tower120

> It's not used anymore, we have new plugin registry at https://plugins.lapce.dev Well, I can open that too. > Please open new issue though. OK

Hi. What is static classes in C++ terms? What do you understand under "static properties"? And I remember how lib actually works a little vague... From what I can see...

If you want to "deduplicate bitsets", why not substract? S1 - S2 will give you S1 without S2 elements. If you want to map indices to values, you need https://github.com/tower120/hi_sparse_array...

Looks like you need hi_sparse_array's multi_merge. There is a version of it now in repository, but I rewriting it to new more space efficient data structure. `Ord` is probably possible....

Well, if you "just" need `Ord`, and don't care about speed - you probably can compare block_iter() between two sets. (Don't forget to take block starts into count as well).

For `TRUSTED_HIERARCHY ` maybe that is enough (I can't see that far without practical implementation). But if you work, for example, with lazy(!) result of intersection - raised bits in...

It is just with multi_merge/fold_merge you basically OR bitmasks of all maps/arrays at once, and then just apply resolve function to intersected data items in the very last level. At...

> Isn't it enough to just to compare levels one-by-one? First try level0 indices, if they are equal then level1, and finally, if again equal - block-by-block? I looked at...

First of all, if you need map, there is https://github.com/tower120/hi_sparse_array - which is basically hi_sparse_bitset but with data at last level + bunch of other improvements. I think I need...

Wait, I think I understand the closest thing you want. You want index of terminal SIMD-BitBlock. But at first, as-is, BitBlocks are not stored contiguously (but they could - that's...