5 releases
0.2.4 | Mar 13, 2024 |
---|---|
0.2.3 | Mar 22, 2023 |
0.2.1 | Jan 2, 2023 |
0.2.0 | Jun 4, 2020 |
0.1.1 |
|
#249 in Algorithms
9,180 downloads per month
Used in 4 crates
(via unicycle)
54KB
883 lines
uniset
A hierarchical, growable bit set with support for in-place atomic operations.
The idea is based on hibitset, but dynamically growing instead of using a fixed capacity. By being careful with the data layout, we can also support structural sharing between the local and atomic bitset variants.
Features
vec-safety
- Avoid relying on the assumption that&mut Vec<T>
can be safely coerced to&mut Vec<U>
ifT
andU
have an identical memory layouts (enabled by default, issue #1).
Examples
use uniset::BitSet;
let mut set = BitSet::new();
assert!(set.is_empty());
assert_eq!(0, set.capacity());
set.set(127);
set.set(128);
assert!(!set.is_empty());
assert!(set.test(128));
assert_eq!(vec![127, 128], set.iter().collect::<Vec<_>>());
assert!(!set.is_empty());
assert_eq!(vec![127, 128], set.drain().collect::<Vec<_>>());
assert!(set.is_empty());