libjudy-dev binary package in Ubuntu Trusty i386

 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.

Publishing history

Date Status Target Pocket Component Section Priority Phased updates Version
  2013-12-22 07:23:26 UTC Published Ubuntu Trusty i386 release universe libdevel Optional 1.0.5-1ubuntu1
  • Published on 2013-12-22
  • Copied from ubuntu trusty-proposed i386 in Primary Archive for Ubuntu
  Deleted Ubuntu Trusty i386 proposed universe libdevel Optional 1.0.5-1ubuntu1
  • Removal requested on 2013-12-22.
  • Deleted on 2013-12-22 by Ubuntu Archive Robot

    moved to release

  • Published on 2013-12-22
  2013-12-22 07:23:49 UTC Superseded Ubuntu Trusty i386 release universe libdevel Optional 1.0.5-1
  • Removal requested on 2013-12-23.
  • Superseded on 2013-12-22 by i386 build of judy 1.0.5-1ubuntu1 in ubuntu trusty PROPOSED
  • Published on 2013-10-18
  • Copied from ubuntu intrepid-release i386 in Primary Archive for Ubuntu

Source package