News for hackers. Stuff that matters.
Re:Crit-bit Trees: the best way to store sets by jongraehl on Tuesday September 20, 2011 @03:46AM (#3016725)
I couldn't find any benchmarks on the web to substantiate the speed claims.

Still, it's a cool data structure, and I respect djb enough to trust that it's at least competitive with hash tables; I'll consider it when I want more operations than offered by a hash table (especially for a set that's very sparse compared to key length).

There are no comments on this comment yet.