Struct rustc_index::bit_set::GrowableBitSet

pub struct GrowableBitSet<T: Idx> {
    bit_set: BitSet<T>,
}

A resizable bitset type with a dense representation.

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.

Fields

bit_set: BitSet<T>

Implementations

impl<T: Idx> GrowableBitSet<T>

pub fn ensure(&mut self, min_domain_size: usize)

Ensure that the set can hold at least min_domain_size elements.

pub fn new_empty() -> GrowableBitSet<T>

pub fn with_capacity(capacity: usize) -> GrowableBitSet<T>

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

Returns true if the set has changed.

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

Returns true if the set has changed.

pub fn is_empty(&self) -> bool

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

Trait Implementations

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

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

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<T: Debug + Idx> Debug for GrowableBitSet<T>

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

Formats the value using the given formatter.

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

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

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

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

This method tests for !=.

impl<T: Idx> StructuralPartialEq for GrowableBitSet<T>

Layout

Note: Most layout information is completely unstable and may even differ between compilations. The only exception is types with certain repr(...) attributes. Please see the Rust Reference’s “Type Layout” chapter for details on type layout guarantees.

Size: 32 bytes