judy 1.0.5-5.1 source package in Ubuntu
Changelog
judy (1.0.5-5.1) unstable; urgency=medium * Non-maintainer upload. * Convert to source format 3.0. (Closes: #1007057) -- Bastian Germann <email address hidden> Sat, 28 Oct 2023 13:58:33 +0200
Upload details
- Uploaded by:
- Troy Heber
- Uploaded to:
- Sid
- Original maintainer:
- Troy Heber
- Architectures:
- any
- Section:
- libs
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| judy_1.0.5-5.1.dsc | 1.5 KiB | 41b69f3287d894adf879c89932e2f5f581d163e1fe757e495045922b65f1e17d |
| judy_1.0.5.orig.tar.gz | 1.1 MiB | d2704089f85fdb6f2cd7e77be21170ced4b4375c03ef1ad4cf1075bd414a63eb |
| judy_1.0.5-5.1.debian.tar.xz | 6.8 KiB | 8acb56891d4dabe0de11d3736cf8caafc2926a22697733a84b05bca0335492a2 |
Available diffs
- diff from 1.0.5-5 to 1.0.5-5.1 (679 bytes)
No changes file available.
Binary packages built by this source
- libjudy-dev: 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.
- libjudydebian1: C library for creating and accessing dynamic arrays
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.
- libjudydebian1-dbgsym: debug symbols for libjudydebian1
