Ubuntu
kyotocabinet package

kyotocabinet 1.2.79-2 source package in Ubuntu

Changelog

kyotocabinet (1.2.79-2) unstable; urgency=medium

  [ Debian Janitor ]
  * Use secure copyright file specification URI.
  * Remove constraints unnecessary since buster:
    + Build-Depends: Drop versioned constraint on libtool.
    + kyotocabinet-utils: Drop versioned constraint on kyotocabinet-doc in
      Replaces.
    + kyotocabinet-utils: Drop versioned constraint on kyotocabinet-doc in
      Breaks.

  [ Boyuan Yang ]
  * debian/control: Mark kyotocabinet-doc as M-A: foreign.

 -- Boyuan Yang <email address hidden>  Sat, 08 Oct 2022 22:06:05 -0400

Upload details

Uploaded by:
Boyuan Yang
Uploaded to:
Sid
Original maintainer:
Boyuan Yang
Architectures:
any all
Section:
utils
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Lunar release universe utils

Downloads

File Size SHA-256 Checksum
kyotocabinet_1.2.79-2.dsc 2.1 KiB 5fd124f4dbf191b1bce0813020e2e732dc9da91902a032bc6ac107aa92fa41b7
kyotocabinet_1.2.79.orig.tar.gz 921.7 KiB 67fb1da4ae2a86f15bb9305f26caa1a7c0c27d525464c71fd732660a95ae3e1d
kyotocabinet_1.2.79-2.debian.tar.xz 8.6 KiB 2aa3ea48593646ea8818b6df3102a1d56e877d9b7b98e7875d845b83c72a26ee

Available diffs

No changes file available.

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-dbgsym: debug symbols for libkyotocabinet16v5