pub enum HybridBitSet<T> {
    Sparse(SparseBitSet<T>),
    Dense(BitSet<T>),
}
Expand description

A fixed-size bitset type with a hybrid representation: sparse when there are up to a SPARSE_MAX elements in the set, but dense when there are more than SPARSE_MAX.

This type is especially efficient for sets that typically have a small number of elements, but a large domain_size, and are cleared frequently.

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§

§

Sparse(SparseBitSet<T>)

§

Dense(BitSet<T>)

Implementations§

source§

impl<T: Idx> HybridBitSet<T>

source

pub fn new_empty(domain_size: usize) -> Self

source

pub fn domain_size(&self) -> usize

source

pub fn clear(&mut self)

source

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

source

pub fn superset(&self, other: &HybridBitSet<T>) -> bool

source

pub fn is_empty(&self) -> bool

source

pub fn last_set_in(&self, range: impl RangeBounds<T>) -> Option<T>
where T: Ord,

Returns the previous element present in the bitset from elem, inclusively of elem. That is, will return Some(elem) if elem is in the bitset.

source

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

source

pub fn insert_range(&mut self, elems: impl RangeBounds<T>)

source

pub fn insert_all(&mut self)

source

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

source

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

Converts to a dense set, consuming itself in the process.

source

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

source

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).

source

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).

source

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§

source§

impl<T: Idx> BitRelations<BitSet<T>> for HybridBitSet<T>

source§

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

source§

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

source§

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

source§

impl<T: Idx> BitRelations<HybridBitSet<T>> for BitSet<T>

source§

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

source§

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

source§

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

source§

impl<T: Idx> BitRelations<HybridBitSet<T>> for ChunkedBitSet<T>

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

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

source§

impl<T: Clone> Clone for HybridBitSet<T>

source§

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

Returns a copy of the value. Read more
1.0.0 · source§

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

Performs copy-assignment from source. Read more
source§

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

source§

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

Formats the value using the given formatter. Read more

Auto Trait Implementations§

§

impl<T> Freeze for HybridBitSet<T>
where T: Freeze,

§

impl<T> RefUnwindSafe for HybridBitSet<T>
where T: RefUnwindSafe,

§

impl<T> Send for HybridBitSet<T>
where T: Send,

§

impl<T> Sync for HybridBitSet<T>
where T: Sync,

§

impl<T> Unpin for HybridBitSet<T>
where T: Unpin,

§

impl<T> UnwindSafe for HybridBitSet<T>
where T: UnwindSafe,

Blanket Implementations§

source§

impl<T> Any for T
where T: 'static + ?Sized,

source§

fn type_id(&self) -> TypeId

Gets the TypeId of self. Read more
source§

impl<T> Borrow<T> for T
where T: ?Sized,

source§

fn borrow(&self) -> &T

Immutably borrows from an owned value. Read more
source§

impl<T> BorrowMut<T> for T
where T: ?Sized,

source§

fn borrow_mut(&mut self) -> &mut T

Mutably borrows from an owned value. Read more
source§

impl<T> From<T> for T

source§

fn from(t: T) -> T

Returns the argument unchanged.

source§

impl<T, U> Into<U> for T
where U: From<T>,

source§

fn into(self) -> U

Calls U::from(self).

That is, this conversion is whatever the implementation of From<T> for U chooses to do.

§

impl<T> Pointable for T

§

const ALIGN: usize = _

The alignment of pointer.
§

type Init = T

The type for initializers.
§

unsafe fn init(init: <T as Pointable>::Init) -> usize

Initializes a with the given initializer. Read more
§

unsafe fn deref<'a>(ptr: usize) -> &'a T

Dereferences the given pointer. Read more
§

unsafe fn deref_mut<'a>(ptr: usize) -> &'a mut T

Mutably dereferences the given pointer. Read more
§

unsafe fn drop(ptr: usize)

Drops the object pointed to by the given pointer. Read more
source§

impl<T> ToOwned for T
where T: Clone,

§

type Owned = T

The resulting type after obtaining ownership.
source§

fn to_owned(&self) -> T

Creates owned data from borrowed data, usually by cloning. Read more
source§

fn clone_into(&self, target: &mut T)

Uses borrowed data to replace owned data, usually by cloning. Read more
source§

impl<T, U> TryFrom<U> for T
where U: Into<T>,

§

type Error = Infallible

The type returned in the event of a conversion error.
source§

fn try_from(value: U) -> Result<T, <T as TryFrom<U>>::Error>

Performs the conversion.
source§

impl<T, U> TryInto<U> for T
where U: TryFrom<T>,

§

type Error = <U as TryFrom<T>>::Error

The type returned in the event of a conversion error.
source§

fn try_into(self) -> Result<U, <U as TryFrom<T>>::Error>

Performs the conversion.

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.