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 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118
|
Source: kyotocabinet
Section: utils
Priority: optional
Maintainer: Shawn Landden <shawnlandden@gmail.com>
Build-Depends: debhelper (>= 9),
dpkg-dev (>= 1.16.1),
automake,
libtool (>= 2.2),
zlib1g-dev,
liblzma-dev,
liblzo2-dev
Standards-Version: 3.9.3
Vcs-Browser: http://git.debian.org/?p=collab-maint/kyoto-cabinet.git
Vcs-Git: git://git.debian.org/collab-maint/kyoto-cabinet.git
Homepage: http://fallabs.com/kyotocabinet/
Package: libkyotocabinet16
Section: libs
Architecture: any
Depends: ${shlibs:Depends}, ${misc:Depends}
Pre-Depends: ${misc:Pre-Depends}
Multi-Arch: same
Description: Straightforward implementation of DBM - shared library
Kyoto Cabinet is a library of routines for managing a database. The
database is a simple data file containing records, each is a pair of
a key and a value. Every key and value is serial bytes with variable
length. Both binary data and character string can be used as a key and
a value. Each key must be unique within a database. There is neither
concept of data tables nor data types. Records are organized in
hash table or B+ tree.
.
This package contains the shared library.
Package: libkyotocabinet16-dbg
Section: debug
Architecture: any
Priority: extra
Depends: libkyotocabinet16 (= ${binary:Version}), ${misc:Depends}
Provides: libkyocabinet-dbg
Multi-Arch: same
Description: Straightforward implementation of DBM - debugging symbols
Kyoto Cabinet is a library of routines for managing a database. The
database is a simple data file containing records, each is a pair of
a key and a value. Every key and value is serial bytes with variable
length. Both binary data and character string can be used as a key and
a value. Each key must be unique within a database. There is neither
concept of data tables nor data types. Records are organized in
hash table or B+ tree.
.
This package contains the debugging symbols for the shared library.
Package: kyotocabinet-utils
Architecture: any
Depends: ${shlibs:Depends}, ${misc:Depends}
Replaces: kyotocabinet-doc (<< 1.2.76-2)
Breaks: kyotocabinet-doc (<< 1.2.76-2)
Recommends: kyotocabinet-doc
Multi-Arch: foreign
Description: Straightforward implementation of DBM - utilities
Kyoto Cabinet is a library of routines for managing a database. The
database is a simple data file containing records, each is a pair of
a key and a value. Every key and value is serial bytes with variable
length. Both binary data and character string can be used as a key and
a value. Each key must be unique within a database. There is neither
concept of data tables nor data types. Records are organized in
hash table or B+ tree.
.
This package contains the kcutilmgr tool, used to compile kyotocabinet
language bindings without Debian patches applied, and well as testing
and debugging utilities.
Package: kyotocabinet-doc
Section: doc
Architecture: all
Depends: ${shlibs:Depends}, ${misc:Depends}
Suggests: libkyotocabinet-dev
Description: Straightforward implementation of DBM - docs
Kyoto Cabinet is a library of routines for managing a database. The
database is a simple data file containing records, each is a pair of
a key and a value. Every key and value is serial bytes with variable
length. Both binary data and character string can be used as a key and
a value. Each key must be unique within a database. There is neither
concept of data tables nor data types. Records are organized in
hash table or B+ tree.
.
Kyoto Cabinet runs very fast. For example, elapsed time to store
one million records is 0.9 seconds for hash database, and 1.1 seconds
for B+ tree database. Moreover, the size of database is very small.
For example, overhead for a record is 16 bytes for hash database,
and 4 bytes for B+ tree database. Furthermore, scalability of
Kyoto Cabinet is great. The database size can be up to 8EB (9.22e18 bytes).
.
Sponsored by the same company, Kyoto Cabinet is "[a] more powerful and
convenient library than Tokyo Cabinet [and] surpasses Tokyo Cabinet in
every aspect".
.
This package contains the documentation.
Package: libkyotocabinet-dev
Section: libdevel
Multi-Arch: same
Architecture: any
Depends: libkyotocabinet16 (= ${binary:Version}), ${misc:Depends},
zlib1g-dev,
liblzma-dev,
liblzo2-dev
Provides: libkyotocabinet16-dev
Description: Straightforward implementation of DBM - development headers
Kyoto Cabinet is a library of routines for managing a database. The
database is a simple data file containing records, each is a pair of
a key and a value. Every key and value is serial bytes with variable
length. Both binary data and character string can be used as a key and
a value. Each key must be unique within a database. There is neither
concept of data tables nor data types. Records are organized in
hash table or B+ tree.
.
This package contains the development headers.
|