#bit-set #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

#249 in Algorithms

Download history 325/week @ 2024-07-20 340/week @ 2024-07-27 270/week @ 2024-08-03 332/week @ 2024-08-10 865/week @ 2024-08-17 1906/week @ 2024-08-24 1401/week @ 2024-08-31 1254/week @ 2024-09-07 1390/week @ 2024-09-14 1782/week @ 2024-09-21 1651/week @ 2024-09-28 1444/week @ 2024-10-05 2690/week @ 2024-10-12 1514/week @ 2024-10-19 2554/week @ 2024-10-26 2179/week @ 2024-11-02

9,180 downloads per month
Used in 4 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