Post

man, bitsets are so cool, especially in combination with pointer tagging. like, wdym you can do unions, intersections and everything and as long as you have less than 64(!) elements, this is cheaper than an array access

20/8/26, 1:21 am1 repost51 likes

Tikhon Jelvis

@jelv.is

20 Aug

you can have a bit of set theory as a treat

vaibhav sagar

@vaibhavsagar.com

24 Aug

have you looked into bitvectors with rank/select? also very cool imho

Daniel

@daniel.abrecht.li

20 Aug

For bigger keys, consider robin hood hashing. If you do it right, you can have all the sets with the same hash / key size be sorted the same way. That should make intersections and stuff pretty fast. My version: github.com/Daniel-Abrec... (Although, I didn't get to implement intersections here yet)