tower120 / hi_sparse_bitset Goto Github PK

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.

Fully implemented.

https://github.com/tower120/hi_sparse_bitset/tree/bitset_ranges

I'm trying to test hi_sparse_bitset on some custom in-memory indexes. BitSet is generic over a configuration type, and the crate offers 64-bit, 128-bit, and 256-bit configurations. If my understanding is correct, the largest one, _256bit, supports up to 16777216 distinct values. Is that correct?

For my use case, I need to support up to 50m entities. Can I add a larger configuration? I looked at the definitions of existing ones, but it was not exactly obvious how to come up with a new one.