File: control

package info (click to toggle)
judy 1.0.5-5
  • links: PTS
  • area: main
  • in suites: bullseye, buster, sid, stretch
  • size: 5,632 kB
  • ctags: 2,605
  • sloc: ansic: 25,480; sh: 9,661; makefile: 420
file content (55 lines) | stat: -rw-r--r-- 2,733 bytes parent folder | download
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
Source: judy
Section: libs
Priority: optional
Maintainer: Troy Heber <troyh@debian.org>
Uploaders:
Build-Depends: debhelper (>=9), dh-autoreconf, quilt
Standards-Version: 3.9.6

Package: libjudy-dev
Section: libdevel
Architecture: any
Depends: libjudydebian1 (= ${binary:Version}), ${shlibs:Depends}, ${misc:Depends}
Description: 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.

Package: libjudydebian1
Section: libs
Architecture: any
Depends: ${shlibs:Depends}, ${misc:Depends}
Description: 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.