tower120

> If there are 73 numbers stored, 1 7 9 42 1893 40958 144938 etc., I want my_bitmap.index_of(1893) to return 4. As is, there is no such information in `hi_sparse_bitset`'s...

Anyway, that will be highly inefficient even if it could be retrieved in O(1) time, since you'll have to keep you're `my_data_vec` sorted. This mean O(N) at each insert/remove.

Just wait for a month or so - I bet [hi_sparse_array](https://github.com/tower120/hi_sparse_array) will do what you want to achieve.

If by any chance you still need hierarchical bitmap as MAP: https://crates.io/crates/hibit_tree . It is still somewhat unpolished. In doc department, at least. It was renamed from previous hi_sparse_array to...

This feature request impossible to implement efficiently with the current `hi_sparse_bitset` data structure.

> ... assuming you have gnuplot installed. I assume most end-user will not have `gnuplot` installed on Windows. I don't even understand what that mean in Rust context.

Can you show example of " a lot of tedious for loops to add or remove entries."? Also, if you do a graph - could this https://crates.io/crates/hibit_tree be more useful...

Ok - I'll see what I can do. I may do some refactor as well, so let me ask a few questions: - Do you use `BitSet` or `SmallBitSet`? -...

Are you aware of BitSet memory overhead? See memory layout scheme on doc's main page. > No. In my case, the index range is only known at run-time. But the...

@huguesb FYI, there is highly efficient seralization/deserealization implementation as part of https://github.com/tower120/hi_sparse_bitset/issues/40 now in `dev` branch. There are also `insert_block()` and `BitSet::from(impl BitSetInterface)` - that efficiently materialize lazy bitsets. Better...