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
BitSetRangesreplace full blocks with prealocated one. Similar to empty blocks inBitSet.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