#bitset #container #memory-layout

uniset

A hierarchical, growable bit set with support for in-place atomic operations

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 Feb 18, 2020

#281 in Algorithms

Download history 173/week @ 2023-12-22 249/week @ 2023-12-29 398/week @ 2024-01-05 498/week @ 2024-01-12 691/week @ 2024-01-19 1024/week @ 2024-01-26 1031/week @ 2024-02-02 1202/week @ 2024-02-09 1359/week @ 2024-02-16 1759/week @ 2024-02-23 2332/week @ 2024-03-01 1651/week @ 2024-03-08 1319/week @ 2024-03-15 596/week @ 2024-03-22 392/week @ 2024-03-29 881/week @ 2024-04-05

3,432 downloads per month
Used in 3 crates (via unicycle)

MIT/Apache

54KB
883 lines

uniset

github crates.io docs.rs build status

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> if T and U 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());

No runtime deps