saik0

`run` was called 16x more than `skewed` in the benchmarks I ran.

Also, if we did it with just ref counting either bitmaps would no longer be `Sync` I was thinking of this is an optimization of space, not time. > In...

I tried the "naive lazy" alg as suggested by @lemire in #58 and it is indeed faster (and simpler) for OR. It also does better than sequential for XOR. Unsurprisingly...

Curiosity got the better of me, so I tied some other strategies. 1. Inside the multi-ops there the container access pattern is effectively random. BTreeMap and HashMap keyed by the...

> Unfortunately, you broke the link, next time could you provide a permanent link, please 😄 Yes. Next time. 😄 > I think you can open a draft PR on...

Here are the benchmarks from my experiments on saik0#1  

@Kerollmops @josephglanville Would this help your work in #66?

@josephglanville I was taking a look through history in #12 > I think storing start, end will result in slightly nicer code vs storing start, run_length. Serialisation will of course...

#127 removes 8 bytes from each array container, so maybe we can afford a few extra bytes at the root now ;)

This is relevant to #167. Cardinality of all ops can all be trivially implemented in terms of the cardinality of the intersection `|A ∩ B|`. ``` |A \ B| =...