judy - Library which provides fully dynamic arrays
The Judy library provides fully dynamic arrays. These arrays may be indexed
by a 32- or 64- bit word size, a null terminated string, or an array-of-bytes
plus length. A dynamic array (sparsely populated) can also be thought of as a
mapping function or associative memory. These arrays are both speed- and
memory- efficient across a wide range of index set types (sequential,
periodic, clustered, random). Their speed and memory usage are typically
better than storage models such as skiplists, linked lists, binary, ternary,
b-trees, or even hashing, and improves with very large data sets.
- * 2009-07-21 - Dries Verachtert <dries[AT]ulyssis[DOTORG]> - 1.0.5-1 - 7981/dag
- Updated to releae 1.0.5.
- * 2007-11-14 - Dries Verachtert <dries[AT]ulyssis[DOTORG]> - 1.0.4-1
- Initial package.