|File Search||Catalog||Content Search|
Judy arrays are accessed with insert, retrieve, and delete calls for number or string indexes. Configuration and tuning are not required -- in fact not possible. Judy offers sorting, counting, and neighbor/empty searching. Indexes can be sequential, clustered, periodic, or random -- it doesn't matter to the algorithm. Judy arrays can be arranged hierarchically to handle any bit patterns -- large indexes, sets of keys, etc.
Judy is often an improvement over common data structures such as: arrays, sparse arrays, hash tables, B-trees, binary trees, linear lists, skiplists, other sort and search algorithms, and counting functions.
judy (1.0.3-2) unstable; urgency=low * Resolves #372525, remove .shlibs * Policy update * Updated FSF address in copyright -- Troy Heber <email@example.com> Sun, 11 Jun 2006 15:58:14 -0600 judy (1.0.3-1) unstable; urgency=low * Workaround bug in make: #349078 * Using my shiny new email address * Fixed FTBFS because of #349078 (closes: #353105) -- Troy Heber <firstname.lastname@example.org more»
1.0.3 Version (Feb 2006 ) by (twh) o fixed make files to break out each copy element to be a unique target, this also seems to have resolved the issue where running make check rebuilds the entire library again. 1.0.2 Version (Jan 2006 ) by (twh) o fixed assumption of signed char in test programs. o updated sh_build o fixed generation of man pages from html o fixed 32-bit and 64-bit configure more»
Judy was originally packaged by Theodore Ts'o <email@example.com>, the package is maintained by Troy Heber <firstname.lastname@example.org>. It was downloaded from http://sourceforge.net/projects/judy Upstream Author: Hewlett-Packard Company Copyright(c) 2002, 2005 Hewlett-Packard Development Company, L.P. 2005 Doug Baskins The GNU C Library is free software; you can redistribute it and/or more»