hi_sparse_bitset
hi_sparse_bitset copied to clipboard
tower120
Hierarchical sparse bitset
`BitSetRanges` replace full blocks with prealocated one. Similar to empty blocks in `BitSet`. This allows to fill ranges at close to O(1) time. Also, filled blocks does not consume memory....
I've been looking all over for some kind of key-value store using a hierarchical bitmap, but all I've found are sets. I could make one myself, but I'd need some...
Hi again! There is the final step to take full advantage of your great library. Sometimes it is necessary to deduplicate bitsets or to build a mapping between bitsets and...
Running benchmarks with: ``` cargo bench --features simple_iter ``` fails with the following error: ``` Benchmarking hi_sparse_bitset insert: Warming up for 3.0000 s thread 'main' panicked at .../hi_sparse_bitset/src/raw.rs:141:9: 2080768 index...
I'm doing some graph manipulation, with the graph being represented by adjacency list, where each vertex is an integer. Using BitSet as a replacement for `HashSet` is making things considerably...
