Struct rustc_data_structures::indexed_set::IdxSet

pub struct IdxSet<T: Idx> { /* fields omitted */ }

Represents a set (or packed family of sets), of some element type E, where each E is identified by some unique index type T.

In other words, T is the type used to index into the bitslice this type uses to represent the set of object it holds.

Methods

impl<T: Idx> IdxSet<T>

pub fn to_owned(&self) -> IdxSetBuf<T>

pub fn clear(&mut self)

Removes all elements

pub fn set_up_to(&mut self, universe_size: usize)

Sets all elements up to universe_size

pub fn remove(&mut self, elem: &T) -> bool

Removes elem from the set self; returns true iff this changed self.

pub fn add(&mut self, elem: &T) -> bool

Adds elem to the set self; returns true iff this changed self.

Important traits for &'a mut R

impl<'a, R> Read for &'a mut R where
    R: Read + ?Sized, impl<'a, W> Write for &'a mut W where
    W: Write + ?Sized, impl<'a, I> Iterator for &'a mut I where
    I: Iterator + ?Sized,  type Item = <I as Iterator>::Item;

pub fn range(&self, elems: &Range<T>) -> &Self

Important traits for &'a mut R

impl<'a, R> Read for &'a mut R where
    R: Read + ?Sized, impl<'a, W> Write for &'a mut W where
    W: Write + ?Sized, impl<'a, I> Iterator for &'a mut I where
    I: Iterator + ?Sized,  type Item = <I as Iterator>::Item;

pub fn range_mut(&mut self, elems: &Range<T>) -> &mut Self

pub fn contains(&self, elem: &T) -> bool

Returns true iff set self contains elem.

Important traits for &'a [u8]

impl<'a> Read for &'a [u8]impl<'a> Write for &'a mut [u8]

pub fn words(&self) -> &[Word]

Important traits for &'a [u8]

impl<'a> Read for &'a [u8]impl<'a> Write for &'a mut [u8]

pub fn words_mut(&mut self) -> &mut [Word]

pub fn overwrite(&mut self, other: &IdxSet<T>)

Efficiently overwrite self with other. Panics if self and other don't have the same length.

pub fn union(&mut self, other: &IdxSet<T>) -> bool

Set self = self | other and return true if self changed (i.e., if new bits were added).

pub fn subtract(&mut self, other: &IdxSet<T>) -> bool

Set self = self - other and return true if self changed. (i.e., if any bits were removed).

pub fn intersect(&mut self, other: &IdxSet<T>) -> bool

Set self = self & other and return true if self changed. (i.e., if any bits were removed).

Important traits for Iter<'a, T>

impl<'a, T: Idx> Iterator for Iter<'a, T> type Item = T;

pub fn iter(&self) -> Iter<T>

Trait Implementations

impl<T: Idx> Borrow<IdxSet<T>> for IdxSetBuf<T>

fn borrow(&self) -> &IdxSet<T>

Immutably borrows from an owned value.

impl<T: Idx> BorrowMut<IdxSet<T>> for IdxSetBuf<T>

fn borrow_mut(&mut self) -> &mut IdxSet<T>

Mutably borrows from an owned value.

impl<T: Idx> ToOwned for IdxSet<T>

type Owned = IdxSetBuf<T>

fn to_owned(&self) -> Self::Owned

Creates owned data from borrowed data, usually by cloning.

fn clone_into(&self, target: &mut Self::Owned)

🔬 This is a nightly-only experimental API. (toowned_clone_into)

recently added

Uses borrowed data to replace owned data, usually by cloning.

impl<T: Idx> Debug for IdxSet<T>

fn fmt(&self, w: &mut Formatter) -> Result

Formats the value using the given formatter.