judy 1.0.5-1ubuntu1 source package in Ubuntu
Changelog
judy (1.0.5-1ubuntu1) trusty; urgency=medium
* Use autotools-dev to update config.{sub,guess} for new arches.
-- Logan Rosen <email address hidden> Sun, 22 Dec 2013 00:58:35 -0500
Upload details
- Uploaded by:
- Logan Rosen
- Uploaded to:
- Trusty
- Original maintainer:
- Ubuntu Developers
- Architectures:
- any
- Section:
- libs
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Trusty | release | universe | libs |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| judy_1.0.5.orig.tar.gz | 1.1 MiB | d2704089f85fdb6f2cd7e77be21170ced4b4375c03ef1ad4cf1075bd414a63eb |
| judy_1.0.5-1ubuntu1.diff.gz | 4.0 KiB | b2e92f047cd9dea7289ff5df7d6644b960da16a51482772b9504c98f21421b32 |
| judy_1.0.5-1ubuntu1.dsc | 1.4 KiB | 67f505d2bb58f25e37be6a8fe1e3b01c689421d3cfb9d061d94417693da50647 |
Available diffs
- diff from 1.0.5-1 to 1.0.5-1ubuntu1 (727 bytes)
Binary packages built by this source
- libjudy-dev: No summary available for libjudy-dev in ubuntu utopic.
No description available for libjudy-dev in ubuntu utopic.
- 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.
