Fast Compact Sparse Bit SetsImagine you need a relatively compact data structure for quickly checking membership of mostly-consecutive non-negative integers. (If this sounds really specific, it is because it is precisely what I needed for a particular project.) The Ruby standard library contains a Set class which may be a good starting point. Set is actually implemented as a Hash with the Set elements as keys and true as the
Working with large sets –
CONCISE: COmpressed 'N' Composable Integer SEt
Google Code Archive - Long-term storage for Google Code Project Hosting.
