News for hackers. Stuff that matters.

A comment on Building data structures that are smaller than an array and faster (in C). Parent comment

Re:Building data structures that are smaller than an array a... by ot on Thursday March 01, 2012 @03:07AM (#3651366)
AFAIK these kinds of Compressed Bit Vectors do not have sublinear random-access, they are only fast for linear scans and operations such as union and intersection.
[ Parent | on HN ]

There are no comments on this comment yet.