Judy

http://judy.sourceforge.net/

Judy is an implementation of a sorted associative array in C.  All
reasonable associative array implementations have O(log N) insert and
lookup complexity, but the constant factor for Judy is very much
smaller than other widely used implementations (several times faster
than STL's "map" and twice as fast as SGI's "hash_map", in my trivial
benchmarks).  The designer explains why here
<http://judy.sourceforge.net/downloads/10minutes.htm>; most of the 
improvement comes from awareness of the characteristics of modern 
memory architectures.
_______________________________________________
sweetcode mailing list
http://lists.ofb.net/listinfo/sweetcode
http://sweetcode.org/