Enum MixedBitSet

pub enum MixedBitSet<T> {
    Small(BitSet<T>),
    Large(ChunkedBitSet<T>),
}

A bitset with a mixed representation, using BitSet for small and medium bitsets, and ChunkedBitSet for large bitsets, i.e. those with enough bits for at least two chunks. This is a good choice for many bitsets that can have large domain sizes (e.g. 5000+).

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.

Variants

Small(BitSet<T>)

Large(ChunkedBitSet<T>)

Implementations

impl<T> MixedBitSet<T>

pub fn domain_size(&self) -> usize

impl<T: Idx> MixedBitSet<T>

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

pub fn is_empty(&self) -> bool

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

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

pub fn insert_all(&mut self)

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

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

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

where Self: 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 Self: 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 Self: BitRelations<Rhs>,

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

Trait Implementations

impl<T: Idx> BitRelations<MixedBitSet<T>> for MixedBitSet<T>

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

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

fn intersect(&mut self, _other: &MixedBitSet<T>) -> bool

impl<T> Clone for MixedBitSet<T>

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

WARNING: this implementation of clone_from may panic if the two bitsets have different domain sizes. This constraint is not inherent to clone_from, but it works with the existing call sites and allows a faster implementation, which is important because this function is hot.

fn clone(&self) -> Self

Returns a copy of the value.

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

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

Formats the value using the given formatter.

impl<T: PartialEq> PartialEq for MixedBitSet<T>

fn eq(&self, other: &MixedBitSet<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: Eq> Eq for MixedBitSet<T>

impl<T> StructuralPartialEq for MixedBitSet<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: 40 bytes

Size for each variant:

• Small: 32 bytes
• Large: 24 bytes