Struct ra_ap_rustc_index::interval::IntervalSet

pub struct IntervalSet<I> { /* private fields */ }

Stores a set of intervals on the indices.

The elements in map are sorted and non-adjacent, which means the second value of the previous element is greater than the first value of the following element.

Implementations

impl<I: Idx> IntervalSet<I>

pub fn new(domain: usize) -> IntervalSet<I>

pub fn clear(&mut self)

pub fn iter(&self) -> impl Iterator<Item = I> + '_

where I: Step,

pub fn iter_intervals(&self) -> impl Iterator<Item = Range<I>> + '_

where I: Step,

Iterates through intervals stored in the set, in order.

pub fn insert(&mut self, point: I) -> bool

Returns true if we increased the number of elements present.

pub fn insert_range(&mut self, range: impl RangeBounds<I> + Clone) -> bool

Returns true if we increased the number of elements present.

pub fn contains(&self, needle: I) -> bool

pub fn superset(&self, other: &IntervalSet<I>) -> bool

where I: Step,

pub fn is_empty(&self) -> bool

pub fn first_unset_in(&self, range: impl RangeBounds<I> + Clone) -> Option<I>

Equivalent to range.iter().find(|i| !self.contains(i)).

pub fn last_set_in(&self, range: impl RangeBounds<I> + Clone) -> Option<I>

Returns the maximum (last) element present in the set from range.

pub fn insert_all(&mut self)

pub fn union(&mut self, other: &IntervalSet<I>) -> bool

where I: Step,

Trait Implementations

impl<I: Clone> Clone for IntervalSet<I>

fn clone(&self) -> IntervalSet<I>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<I: Debug> Debug for IntervalSet<I>

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.