judy 1.0.5-5 source package in Ubuntu
Changelog
judy (1.0.5-5) unstable; urgency=medium
* Patch from Andrey Gursky <email address hidden>, Remove
-fno-aggressive-loop-optimizations, (Closes: #782841))
-- Troy Heber <email address hidden> Mon, 27 Apr 2015 07:20:49 -0600
Upload details
- Uploaded by:
- Troy Heber
- Uploaded to:
- Sid
- Original maintainer:
- Troy Heber
- Architectures:
- any
- Section:
- libs
- Urgency:
- Medium Urgency
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| judy_1.0.5-5.dsc | 1.6 KiB | 7783fcc3331a07f52b356af658c78186378f59401a5125943cb6c8d0ed98e039 |
| judy_1.0.5.orig.tar.gz | 1.1 MiB | d2704089f85fdb6f2cd7e77be21170ced4b4375c03ef1ad4cf1075bd414a63eb |
| judy_1.0.5-5.diff.gz | 7.1 KiB | bb3b4f3f670a0a3d5c8e1373f806c54d91dc69ee280c5421335c9ee2056a462a |
Available diffs
- diff from 1.0.5-4 to 1.0.5-5 (1.8 KiB)
No changes file available.
Binary packages built by this source
- libjudy-dev: No summary available for libjudy-dev in ubuntu yakkety.
No description available for libjudy-dev in ubuntu yakkety.
- libjudydebian1: No summary available for libjudydebian1 in ubuntu cosmic.
No description available for libjudydebian1 in ubuntu cosmic.
- libjudydebian1-dbgsym: debug symbols for package libjudydebian1
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.
