kyotocabinet 1.2.76-4.2 source package in Ubuntu
Changelog
kyotocabinet (1.2.76-4.2) unstable; urgency=medium * Non-maintainer upload. * Fix incompatibility with C++14/GCC 6 (Closes: #811627) -- Andreas Stührk <email address hidden> Sat, 24 Sep 2016 17:58:05 +0200
Upload details
- Uploaded by:
- shawnlandden
- Uploaded to:
- Sid
- Original maintainer:
- shawnlandden
- Architectures:
- any all
- Section:
- utils
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Bionic | release | universe | utils |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
kyotocabinet_1.2.76-4.2.dsc | 2.2 KiB | ce49eda1824facaae96f8f18fcb72a59c7358d9f7ef60836a068cb5ec6bddb5b |
kyotocabinet_1.2.76.orig.tar.gz | 929.6 KiB | 812a2d3f29c351db4c6f1ff29d94d7135f9e601d7cc1872ec1d7eed381d0d23c |
kyotocabinet_1.2.76-4.2.debian.tar.xz | 8.6 KiB | ab96492aa59d1bb58f493a57d13c9c52937cf498a5e0c1617a9971a3e08fbd8a |
Available diffs
- diff from 1.2.76-4.1 to 1.2.76-4.2 (785 bytes)
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: No summary available for kyotocabinet-utils-dbgsym in ubuntu cosmic.
No description available for kyotocabinet-
utils-dbgsym in ubuntu cosmic.
- libkyotocabinet-dev: No summary available for libkyotocabinet-dev in ubuntu yakkety.
No description available for libkyotocabinet-dev in ubuntu yakkety.
- libkyotocabinet-dev-dbgsym: No summary available for libkyotocabinet-dev-dbgsym in ubuntu yakkety.
No description available for libkyotocabinet
-dev-dbgsym in ubuntu yakkety.
- libkyotocabinet16v5: No summary available for libkyotocabinet16v5 in ubuntu yakkety.
No description available for libkyotocabinet16v5 in ubuntu yakkety.
- libkyotocabinet16v5-dbg: No summary available for libkyotocabinet16v5-dbg in ubuntu zesty.
No description available for libkyotocabinet
16v5-dbg in ubuntu zesty.
- libkyotocabinet16v5-dbgsym: debug symbols for package libkyotocabinet16v5
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.