Struct rustc_data_structures::bit_set::BitSet

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

A fixed-size bitset type with a dense representation. It does not support resizing after creation; use GrowableBitSet for that.

T is an index type, typically a newtyped usize wrapper, but it can also just be usize.

All operations that involve an element will panic if the element is equal to or greater than the domain size. All operations that involve two bitsets will panic if the bitsets have differing domain sizes.

Methods

impl<T: Idx> BitSet<T>

pub fn new_empty(domain_size: usize) -> BitSet<T>

Create a new, empty bitset with a given domain_size.

pub fn new_filled(domain_size: usize) -> BitSet<T>

Create a new, filled bitset with a given domain_size.

pub fn domain_size(&self) -> usize

Get the domain size.

pub fn clear(&mut self)

Clear all elements.

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

Efficiently overwrite self with other.

pub fn count(&self) -> usize

Count the number of set bits in the set.

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

True if self contains elem.

pub fn superset(&self, other: &BitSet<T>) -> bool

Is self is a (non-strict) superset of other?

pub fn is_empty(&self) -> bool

Is the set empty?

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

Insert elem. Returns true if the set has changed.

pub fn insert_all(&mut self)

Sets all bits to true.

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

Returns true if the set has changed.

pub fn union(
    &mut self,
    other: &impl UnionIntoBitSet<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: &impl SubtractFromBitSet<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: &BitSet<T>) -> bool

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

Important traits for &'a mut [u8]

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

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

Get a slice of the underlying words.

Important traits for BitIter<'a, T>

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

pub fn iter<'a>(&'a self) -> BitIter<'a, T>

Iterates over the indices of set bits in a sorted order.

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

Duplicates the set as a hybrid set.

Trait Implementations

impl<T: Idx> UnionIntoBitSet<T> for BitSet<T>

fn union_into(&self, other: &mut BitSet<T>) -> bool

impl<T: Idx> SubtractFromBitSet<T> for BitSet<T>

fn subtract_from(&self, other: &mut BitSet<T>) -> bool

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

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

impl<T: Eq + Idx> Eq for BitSet<T>

impl<T: Clone + Idx> Clone for BitSet<T>

fn clone(&self) -> BitSet<T>

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

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

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

This method tests for !=.

impl<T: Idx> ToString for BitSet<T>

fn to_string(&self) -> String

Converts the given value to a String.

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

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

Formats the value using the given formatter.

impl<T: Encodable + Idx> Encodable for BitSet<T>

fn encode<__ST: Encoder>(&self, s: &mut __ST) -> Result<(), __ST::Error>

impl<T: Decodable + Idx> Decodable for BitSet<T>

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