Struct rustc_data_structures::indexed_set::IdxSet

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

Represents a set 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 bitvector this type uses to represent the set of object it holds.

The representation is dense, using one bit per possible element.

Methods

impl<T: Idx> IdxSet<T>

pub fn new_filled(universe_size: usize) -> Self

Creates set holding every element whose index falls in range 0..universe_size.

pub fn new_empty(universe_size: usize) -> Self

Creates set holding no elements.

pub fn to_hybrid(&self) -> HybridIdxSet<T>

Duplicates as a hybrid set.

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.

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 union_hybrid(&mut self, other: &HybridIdxSet<T>) -> bool

Like union(), but takes a HybridIdxSet argument.

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 subtract_hybrid(&mut self, other: &HybridIdxSet<T>) -> bool

Like subtract(), but takes a HybridIdxSet argument.

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: Eq + Idx> Eq for IdxSet<T>

impl<T: PartialEq + Idx> PartialEq for IdxSet<T>

fn eq(&self, other: &IdxSet<T>) -> bool

This method tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &IdxSet<T>) -> bool

This method tests for !=.

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

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

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

fn encode<E: Encoder>(&self, encoder: &mut E) -> Result<(), E::Error>

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

fn decode<D: Decoder>(d: &mut D) -> Result<IdxSet<T>, D::Error>

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

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

Formats the value using the given formatter.

impl<I: Idx, CTX> HashStable<CTX> for IdxSet<I>

fn hash_stable<W: StableHasherResult>(     &self,     ctx: &mut CTX,     hasher: &mut StableHasher<W> )