Expand description
A dense bitset implementation using only safe code.
§Examples
use dense_bitset::BitSet;
let mut set = BitSet::new();
set.insert(5);
set.insert(42);
set.insert(7);
assert!(set.get(5));
assert_eq!(set, [5, 7, 42].iter().collect());
Structs§
- A variably sized, heap allocated, dense bitset implemented using no
unsafe
code. - A iterator over the
true
entries of aBitSet
.