RubyFlow : The Ruby Community Blog

Home   Submit   Sign Up   Log In   leaders   Twitter   RSS Feed  

Fast Compact Sparse Bit Sets

I implemented a fairly compact data structure for a scenario I had where I needed to store and check set membership for a lot of mostly-consecutive integers, so I thought I would share some details.


Post a Comment

Comment abilities for non registered users are currently deactivated, pending time to add a proper CAPTCHA to solve the escalating spam problem. Sorry!