Source: kyotocabinet
Section: utils
Priority: optional
Maintainer: Boyuan Yang <byang@debian.org>
Build-Depends: debhelper-compat (= 13),
 libtool,
 zlib1g-dev,
 liblzma-dev,
 liblzo2-dev,
Standards-Version: 4.6.1
Vcs-Browser: https://salsa.debian.org/debian/kyotocabinet
Vcs-Git: https://salsa.debian.org/debian/kyotocabinet.git
Homepage: https://dbmx.net/kyotocabinet/

Package: libkyotocabinet16v5
Section: libs
Architecture: any
Depends: ${shlibs:Depends}, ${misc:Depends}
Pre-Depends: ${misc:Pre-Depends}
Multi-Arch: same
Conflicts: libkyotocabinet16
Replaces: libkyotocabinet16
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: kyotocabinet-utils
Architecture: any
Depends: ${shlibs:Depends}, ${misc:Depends}
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
Multi-Arch: foreign
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: libkyotocabinet16v5 (= ${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.