Package: libjudy-dev (1.0.5-1)
Links for libjudy-dev
Download Source Package judy:
C library for creating and accessing dynamic arrays (dev package)
Judy is a C library that implements a dynamic array. Empty Judy arrays are declared with null pointers. A Judy array consumes memory only when populated yet can grow to take advantage of all available memory. Judy's key benefits are: scalability, performance, memory efficiency, and ease of use. Judy arrays are designed to grow without tuning into the peta-element range, scaling near O(log-base-256).
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.
This is the development package.
Other Packages Related to libjudy-dev
- dep: libjudydebian1 (= 1.0.5-1)
- C library for creating and accessing dynamic arrays
|Architecture||Package Size||Installed Size||Files|
|amd64||194.0 kB||992.0 kB||[list of files]|
|armel||142.1 kB||716.0 kB||[list of files]|
|armhf||166.8 kB||472.0 kB||[list of files]|
|i386||137.4 kB||672.0 kB||[list of files]|
|ia64||277.7 kB||1,328.0 kB||[list of files]|
|kfreebsd-amd64||204.4 kB||900.0 kB||[list of files]|
|kfreebsd-i386||148.8 kB||594.0 kB||[list of files]|
|mips||169.4 kB||764.0 kB||[list of files]|
|mipsel||152.0 kB||764.0 kB||[list of files]|
|powerpc||153.3 kB||748.0 kB||[list of files]|
|s390||149.5 kB||740.0 kB||[list of files]|
|s390x||239.4 kB||854.0 kB||[list of files]|
|sparc||143.4 kB||728.0 kB||[list of files]|