search

contain-rs / bit-set

A Set of Bits
Apache License 2.0
63 stars 25 forks source link

Faster counts on union/intersection/etc #19

Closed winstonewert closed 2 months ago

winstonewert commented 4 years ago

In my use case, I need to compute:

a.union(b).count()

In the current implementation this is really slow. However, if we override the default count implementation for the iterators they could use bitcount to be much more efficient.

Would a PR of that nature be acceptable? Or is the project too "frozen" for that.

pczarn commented 4 years ago

I would review and accept a PR for that.

winstonewert commented 4 years ago

If you didn't notice, I did put a pull request:

https://github.com/contain-rs/bit-set/pull/20

pczarn commented 2 months ago

Rebased in #34