kyotocabinet 1.2.76-4.2build1 source package in Ubuntu

Changelog

kyotocabinet (1.2.76-4.2build1) focal; urgency=medium

  * No-change rebuild for libgcc-s1 package name change.

 -- Matthias Klose <email address hidden>  Sun, 22 Mar 2020 16:45:10 +0100

Upload details

Uploaded by:
Matthias Klose on 2020-03-22
Uploaded to:
Focal
Original maintainer:
shawnlandden
Architectures:
any all
Section:
utils
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Groovy release on 2020-04-24 universe utils
Focal release on 2020-03-24 universe utils

Downloads

File Size SHA-256 Checksum
kyotocabinet_1.2.76.orig.tar.gz 929.6 KiB 812a2d3f29c351db4c6f1ff29d94d7135f9e601d7cc1872ec1d7eed381d0d23c
kyotocabinet_1.2.76-4.2build1.debian.tar.xz 8.6 KiB cfef6952029cfc9b14a1dcfc4cc747611ca7c130466c8be5a0e1901c47db21ae
kyotocabinet_1.2.76-4.2build1.dsc 2.3 KiB 57574b2e50687087b8c1116b4f703589c6966e25e2be3e71abc13dc5f7aae9dd

View changes file

Binary packages built by this source

kyotocabinet-doc: 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.

kyotocabinet-utils: 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.

kyotocabinet-utils-dbgsym: debug symbols for kyotocabinet-utils
libkyotocabinet-dev: 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.

libkyotocabinet16v5: 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.

libkyotocabinet16v5-dbg: 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.