Struct fixedbitset::FixedBitSet

source · [−]

pub struct FixedBitSet { /* private fields */ }

Expand description

FixedBitSet is a simple fixed size set of bits that each can be enabled (1 / true) or disabled (0 / false).

The bit set has a fixed capacity in terms of enabling bits (and the capacity can grow using the grow method).

Derived traits depend on both the zeros and ones, so [0,1] is not equal to [0,1,0].

Implementations

source

impl FixedBitSet

source

pub const fn new() -> Self

Create a new empty FixedBitSet.

source

pub fn with_capacity(bits: usize) -> Self

Create a new FixedBitSet with a specific number of bits, all initially clear.

source

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

Create a new FixedBitSet 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).

For example:

let data = vec![4];
let bs = fixedbitset::FixedBitSet::with_capacity_and_blocks(4, data);
assert_eq!(format!("{:b}", bs), "0010");

source

pub fn grow(&mut self, bits: usize)

Grow capacity to bits, all new bits initialized to zero

source

pub fn len(&self) -> usize

The length of the FixedBitSet in bits.

Note: len includes both set and unset bits.

let bitset = FixedBitSet::with_capacity(10);
// there are 0 set bits, but 10 unset bits
assert_eq!(bitset.len(), 10);

len does not return the count of set bits. For that, use bitset.count_ones(..) instead.

source

pub fn is_empty(&self) -> bool

true if the FixedBitSet is empty.

Note that an “empty” FixedBitSet is a FixedBitSet with no bits (meaning: it’s length is zero). If you want to check if all bits are unset, use FixedBitSet::is_clear.

let bitset = FixedBitSet::with_capacity(10);
assert!(!bitset.is_empty());

let bitset = FixedBitSet::with_capacity(0);
assert!(bitset.is_empty());

source

pub fn is_clear(&self) -> bool

true if all bits in the FixedBitSet are unset.

As opposed to FixedBitSet::is_empty, which is true only for sets without any bits, set or unset.

let mut bitset = FixedBitSet::with_capacity(10);
assert!(bitset.is_clear());

bitset.insert(2);
assert!(!bitset.is_clear());

This is equivalent to bitset.count_ones(..) == 0.

source

pub fn contains(&self, bit: usize) -> 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].

source

pub fn clear(&mut self)

Clear all bits.

source

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

Enable bit.

Panics if bit is out of bounds.

source

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

Enable bit, and return its previous value.

Panics if bit is out of bounds.

source

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

Toggle bit (inverting its state).

Panics if bit is out of bounds

source

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

Panics if bit is out of bounds.

source

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

Copies boolean value from specified bit to the specified bit.

Panics if to is out of bounds.

source

pub fn count_ones<T: IndexRange>(&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.

source

pub fn set_range<T: IndexRange>(&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.

source

pub fn insert_range<T: IndexRange>(&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.

source

pub fn toggle_range<T: IndexRange>(&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.

source

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

View the bitset as a slice of u32 blocks

source

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.

source

pub fn ones(&self) -> Ones<'_>ⓘNotable traits for Ones<'a>`impl<'a> Iterator for Ones<'a> type Item = usize;`

Iterates over all enabled bits.

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

source

pub fn intersection<'a>(&'a self, other: &'a FixedBitSet) -> Intersection<'a>ⓘNotable traits for Intersection<'a>`impl<'a> Iterator for Intersection<'a> type Item = usize;`

Returns a lazy iterator over the intersection of two FixedBitSets

source

pub fn union<'a>(&'a self, other: &'a FixedBitSet) -> Union<'a>ⓘNotable traits for Union<'a>`impl<'a> Iterator for Union<'a> type Item = usize;`

Returns a lazy iterator over the union of two FixedBitSets.

source

pub fn difference<'a>(&'a self, other: &'a FixedBitSet) -> Difference<'a>ⓘNotable traits for Difference<'a>`impl<'a> Iterator for Difference<'a> type Item = usize;`

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.

source

pub fn symmetric_difference<'a>(
&'a self,
other: &'a FixedBitSet
) -> SymmetricDifference<'a>ⓘNotable traits for SymmetricDifference<'a>`impl<'a> Iterator for SymmetricDifference<'a> type Item = usize;`

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.

source