Struct GrowableBitSet 

pub struct GrowableBitSet<T>
where
    T: Idx,
{ /* private fields */ }

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.

Implementations

impl<T> GrowableBitSet<T>

where T: Idx,

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 insert_range(&mut self, elems: Range<T>)

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

Returns true if the set has changed.

pub fn clear(&mut self)

pub fn count(&self) -> usize

pub fn is_empty(&self) -> bool

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

pub fn contains_any(&self, elems: Range<T>) -> bool

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

pub fn len(&self) -> usize

pub fn union<Rhs>(&mut self, other: &Rhs) -> bool

where GrowableBitSet<T>: BitRelations<Rhs>,

Sets self = self | other and returns true if self changed (i.e., if new bits were added).

pub fn subtract<Rhs>(&mut self, other: &Rhs) -> bool

where GrowableBitSet<T>: BitRelations<Rhs>,

Sets self = self - other and returns true if self changed. (i.e., if any bits were removed).

pub fn intersect<Rhs>(&mut self, other: &Rhs) -> bool

where GrowableBitSet<T>: BitRelations<Rhs>,

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

Trait Implementations

impl<T> BitRelations<GrowableBitSet<T>> for GrowableBitSet<T>

where T: Idx,

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

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

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

impl<T> Clone for GrowableBitSet<T>

where T: Clone + Idx,

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

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<T> Debug for GrowableBitSet<T>

where T: Debug + Idx,

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

Formats the value using the given formatter.

impl<T> Default for GrowableBitSet<T>

where T: Idx,

fn default() -> GrowableBitSet<T>

Returns the “default value” for a type.

impl<T> From<DenseBitSet<T>> for GrowableBitSet<T>

where T: Idx,

fn from(bit_set: DenseBitSet<T>) -> GrowableBitSet<T>

Converts to this type from the input type.

impl<T> From<GrowableBitSet<T>> for DenseBitSet<T>

where T: Idx,

fn from(bit_set: GrowableBitSet<T>) -> DenseBitSet<T>

Converts to this type from the input type.

impl<T> PartialEq for GrowableBitSet<T>

where T: PartialEq + Idx,

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

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<T> StructuralPartialEq for GrowableBitSet<T>

where T: PartialEq + Idx,