Struct rustc_index::bit_set::SparseBitSet

pub struct SparseBitSet<T> {
    domain_size: usize,
    elems: ArrayVec<[T; 8]>,
}

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; 8]>

Implementations

impl<T: Idx> SparseBitSet<T>

pub(in bit_set) fn new_empty(
    domain_size: usize
) -> Self

pub(in bit_set) fn len(
    &self
) -> usize

pub(in bit_set) fn is_empty(
    &self
) -> bool

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

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

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

pub(in bit_set) fn to_dense(
    &self
) -> BitSet<T>

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

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

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

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

Formats the value using the given formatter.

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

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

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

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