Struct BitSet

pub struct BitSet<I: Idx + From<usize>> { /* private fields */ }

Implementations

impl<I: Idx + From<usize>> BitSet<I>

pub fn new_empty(end_index: I) -> Self

Create a new empty BitSet which can hold elements x < end_index

pub fn new_filled(end_index: I) -> Self

Create a new empty BitSet which can hold elements x < end_index

pub fn with_capacity_and_blocks<Iter: IntoIterator<Item = u32>>( bits: I, blocks: Iter, ) -> Self

Create a new BitSet with a specific number of bits, initialized from provided blocks.

If the blocks are not the exact size needed for the capacity they will be padded with zeros (if shorter) or truncated to the capacity (if longer).

pub fn grow(&mut self, len_idx: I)

Grow capacity to bits, all new bits initialized to zero

pub fn len(&self) -> usize

Return the length of the FixedBitSet in bits.

pub fn len_idx(&self) -> I

Return the length of the FixedBitSet in bits.

pub fn max(&self) -> I

Return the length of the FixedBitSet in bits.

pub fn contains(&self, bit: I) -> bool

Return true if the bit is enabled in the FixedBitSet, false otherwise.

Note: bits outside the capacity are always disabled.

Note: Also available with index syntax: bitset[bit].

pub fn clear(&mut self)

Clear all bits.

pub fn insert(&mut self, bit: I)

Enable bit.

Panics if bit is out of bounds.

pub fn remove(&mut self, bit: I) -> bool

Disable bit.

Panics if bit is out of bounds.

pub fn put(&mut self, bit: I) -> bool

Enable bit, and return its previous value.

Panics if bit is out of bounds.

pub fn toggle(&mut self, bit: I)

Toggle bit (inverting its state).

Panics if bit is out of bounds

pub fn set(&mut self, bit: I, enabled: bool)

Panics if bit is out of bounds.

pub fn copy_bit(&mut self, from: I, to: I)

Copies boolean value from specified bit to the specified bit.

Panics if to is out of bounds.

pub fn count_ones<T: IndexRange<I>>(&self, range: T) -> usize

Count the number of set bits in the given bit range.

Use .. to count the whole content of the bitset.

Panics if the range extends past the end of the bitset.

pub fn set_range<T: IndexRange<I>>(&mut self, range: T, enabled: bool)

Sets every bit in the given range to the given state (enabled)

Use .. to set the whole bitset.

Panics if the range extends past the end of the bitset.

pub fn insert_range<T: IndexRange<I>>(&mut self, range: T)

Enables every bit in the given range.

Use .. to make the whole bitset ones.

Panics if the range extends past the end of the bitset.

pub fn enable_all(&mut self)

Equivalent to insert_range(..) but significantly faster

pub fn toggle_range<T: IndexRange<I>>(&mut self, range: T)

Toggles (inverts) every bit in the given range.

Use .. to toggle the whole bitset.

Panics if the range extends past the end of the bitset.

pub fn as_slice(&self) -> &[u32]

View the bitset as a slice of u32 blocks

pub fn as_mut_slice(&mut self) -> &mut [u32]

View the bitset as a mutable slice of u32 blocks. Writing past the bitlength in the last will cause contains to return potentially incorrect results for bits past the bitlength.

pub fn is_empty(&self) -> bool

pub fn ones(&self) -> Ones<'_, I>

Iterates over all enabled bits.

Iterator element is the index of the 1 bit, type usize.

pub fn intersection<'a>(&'a self, other: &'a Self) -> Intersection<'a, I>

Returns a lazy iterator over the intersection of two FixedBitSets

pub fn union<'a>(&'a self, other: &'a Self) -> Union<'a, I>

Returns a lazy iterator over the union of two FixedBitSets.

pub fn difference<'a>(&'a self, other: &'a Self) -> Difference<'a, I>

Returns a lazy iterator over the difference of two FixedBitSets. The difference of a and b is the elements of a which are not in b.

pub fn symmetric_difference<'a>( &'a self, other: &'a Self, ) -> SymmetricDifference<'a, I>

Returns a lazy iterator over the symmetric difference of two FixedBitSets. The symmetric difference of a and b is the elements of one, but not both, sets.

pub fn union_with(&mut self, other: &Self)

In-place union of two FixedBitSets.

On calling this method, self’s capacity may be increased to match other’s.

pub fn intersect_with(&mut self, other: &Self)

In-place intersection of two FixedBitSets.

On calling this method, self’s capacity will remain the same as before.

pub fn difference_with(&mut self, other: &Self)

In-place difference of two FixedBitSets.

On calling this method, self’s capacity will remain the same as before.

pub fn symmetric_difference_with(&mut self, other: &Self)

In-place symmetric difference of two FixedBitSets.

On calling this method, self’s capacity may be increased to match other’s.

pub fn is_disjoint(&self, other: &Self) -> bool

Returns true if self has no elements in common with other. This is equivalent to checking for an empty intersection.

pub fn is_subset(&self, other: &Self) -> bool

Returns true if the set is a subset of another, i.e. other contains at least all the values in self.

pub fn is_superset(&self, other: &Self) -> bool

Returns true if the set is a superset of another, i.e. self contains at least all the values in other.

Trait Implementations

impl<I: Idx + From<usize>> Binary for BitSet<I>

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

Formats the value using the given formatter.

impl<'a, I: Idx + From<usize>> BitAnd for &'a BitSet<I>

type Output = BitSet<I>

The resulting type after applying the & operator.

fn bitand(self, other: &BitSet<I>) -> BitSet<I>

Performs the & operation.

impl<'a, I: Idx + From<usize>> BitAndAssign for BitSet<I>

fn bitand_assign(&mut self, other: Self)

Performs the &= operation.

impl<'a, I: Idx + From<usize>> BitOr for &'a BitSet<I>

type Output = BitSet<I>

The resulting type after applying the | operator.

fn bitor(self, other: &BitSet<I>) -> BitSet<I>

Performs the | operation.

impl<'a, I: Idx + From<usize>> BitOrAssign for BitSet<I>

fn bitor_assign(&mut self, other: Self)

Performs the |= operation.

impl<'a, I: Idx + From<usize>> BitXor for &'a BitSet<I>

type Output = BitSet<I>

The resulting type after applying the ^ operator.

fn bitxor(self, other: &BitSet<I>) -> BitSet<I>

Performs the ^ operation.

impl<'a, I: Idx + From<usize>> BitXorAssign for BitSet<I>

fn bitxor_assign(&mut self, other: Self)

Performs the ^= operation.

impl<I: Idx + From<usize>> Clone for BitSet<I>

fn clone(&self) -> Self

Returns a copy of the value.

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

Performs copy-assignment from source.

impl<I: Debug + Idx + From<usize>> Debug for BitSet<I>

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

Formats the value using the given formatter.

impl<I: Default + Idx + From<usize>> Default for BitSet<I>

fn default() -> BitSet<I>

Returns the “default value” for a type.

impl<I: Idx + From<usize> + Display> Display for BitSet<I>

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

Formats the value using the given formatter.

impl<I: Idx + From<usize>> Extend<I> for BitSet<I>

Sets the bit at index i to true for each item i in the input src.

fn extend<Iter: IntoIterator<Item = I>>(&mut self, src: Iter)

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<I: Idx + From<usize>> From<BitSet<I>> for WorkQueue<I>

fn from(set: BitSet<I>) -> Self

Converts to this type from the input type.

impl<I: Idx + From<usize>> FromIterator<I> for BitSet<I>

Return a FixedBitSet containing bits set to true for every bit index in the iterator, other bits are set to false.

fn from_iter<Iter: IntoIterator<Item = I>>(src: Iter) -> Self

Creates a value from an iterator.

impl<I: Hash + Idx + From<usize>> Hash for BitSet<I>

fn hash<__H: Hasher>(&self, state: &mut __H)

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<I: Idx + From<usize>> Index<I> for BitSet<I>

Return true if the bit is enabled in the bitset, or false otherwise.

Note: bits outside the capacity are always disabled, and thus indexing a FixedBitSet will not panic.

type Output = bool

The returned type after indexing.

fn index(&self, bit: I) -> &bool

Performs the indexing (container[index]) operation.

impl<I: Ord + Idx + From<usize>> Ord for BitSet<I>

fn cmp(&self, other: &BitSet<I>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<I: PartialEq + Idx + From<usize>> PartialEq for BitSet<I>

fn eq(&self, other: &BitSet<I>) -> 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<I: PartialOrd + Idx + From<usize>> PartialOrd for BitSet<I>

fn partial_cmp(&self, other: &BitSet<I>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

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

Tests less than (for self and other) and is used by the < operator.

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

Tests less than or equal to (for self and other) and is used by the <= operator.

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

Tests greater than (for self and other) and is used by the > operator.

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

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<I: Eq + Idx + From<usize>> Eq for BitSet<I>

impl<I: Idx + From<usize>> StructuralPartialEq for BitSet<I>