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.
Made a library? Written a blog post? Found a useful tutorial? Share it with the Ruby community here or just enjoy what everyone else has found!
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