Search results for "dist:Judy $1"
Judy::1 - Efficient integer to bit map
Judy::1 is the equivalent of a bit array or bit map. A bit is addressed by an $Key. The array may be sparse, and the $Key may be any native integer. If a key is present, it represents a set bit. If a key is absent, it represents an unset bit. Nothing...
JJORE/Judy-0.41 - 24 Sep 2012 04:47:22 UTC
Judy - Library for creating and accessing dynamic arrays
The Judy family of functions supports fully dynamic arrays. These arrays may be indexed by a 32- or 64-bit word (depending on processor word size) (Judy::1, Judy::L), a null terminated string (Judy::SL), or an ordinary perl string (Judy::HS). Judy ar...
JJORE/Judy-0.41 - 24 Sep 2012 04:47:22 UTC
Judy::L - Efficient integer to integer map
Judy::L is the equivalent of a sparse array of integers. Memory to support the array is allocated as key/value pairs are inserted, and released as key/value pairs are deleted. The value may be used as a scalar, or a pointer to a structure or block of...
JJORE/Judy-0.41 - 24 Sep 2012 04:47:22 UTC
Judy::HS - Efficiet string to integer map
Judy::HS is an equivalent to a hash of integers. The keys are all strings, the values are integers. JudyHS is a hybrid using the best capabilities of hashing and Judy methods. JudyHS does not have a poor performance case where knowledge of the hash a...
JJORE/Judy-0.41 - 24 Sep 2012 04:47:22 UTC