Struct rustc_index::bit_set::SparseBitSet

pub struct SparseBitSet<T> {
    domain_size: usize,
    elems: ArrayVec<T, SPARSE_MAX>,
}

A fixed-size bitset type with a sparse representation and a maximum of SPARSE_MAX elements. The elements are stored as a sorted ArrayVec with no duplicates.

This type is used by HybridBitSet; do not use directly.

Fields

domain_size: usize

elems: ArrayVec<T, SPARSE_MAX>

Implementations

impl<T: Idx> SparseBitSet<T>

fn new_empty(domain_size: usize) -> Self

fn len(&self) -> usize

fn is_empty(&self) -> bool

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

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

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

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

fn iter(&self) -> Iter<'_, T>

Trait Implementations

impl<T: Clone> Clone for SparseBitSet<T>

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug> Debug for SparseBitSet<T>

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

Formats the value using the given formatter.

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

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

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

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

Layout

Note: Unable to compute type layout, possibly due to this type having generic parameters. Layout can only be computed for concrete, fully-instantiated types.