|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.5-1) unstable; urgency=low * Fixed alignment issue, (Closes: #401124) * Update packaging, policy, debhelper, etc. * Removed old BIT cruft from rules * Upstream has propper distclean target (Closes: #424425) -- Troy Heber <firstname.lastname@example.org> Mon, 21 May 2007 15:07:50 -0600 judy (1.0.3-2) unstable; urgency=low * Resolves #372525, remove .shlibs * Policy update * Updated more»
1.0.5 Version (May 2007) by (twh) o added proper clean targets to enable multiple builds o added examples directory o Correctly Detects 32/64-bit build environment o Allow explicit configure for 32/64-bit environment 1.0.4 Version (May 2007) by (twh) o fixed the Checkit problem "error Judy1PrevEmpty Rcode != 1 = 0" o Fixed memory allignment in JudyMallocIF.c (doug) o Fixed messages from "make c 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»