2008-10-13 07:39:46 by OBATA Akio | Files touched by this commit (4) |
Log message:
Update tokyocabinet to 1.3.12.
Changes:
2008-10-05 Mikio Hirabayashi
* tcutil.c (tchexencode, tchexdecode): new functions.
* tchdb.c (tchdbaddint): a bug of error code setting was fixed.
- Release: 1.3.12
|
2008-10-06 12:41:25 by OBATA Akio | Files touched by this commit (5) |
Log message:
Update tokyocabinet to 1.3.11.
2008-09-23 Mikio Hirabayashi
* tchdb.c (tchdbputimpl): performance of the ADDINT mode was improved.
* tcbdb.c (tcbdbleafaddrec): performance of the ADDINT mode was improved.
* tcfdb.c (tcfdbputimpl): performance of the ADDINT mode was improved.
* tcutil.c (tcpagealign): new function.
* tchdb.c (tchdbsetxmsiz): the parameter is now rounded up to multiple of the \
page size.
* tcfdb.c (tcfdbtune): the parameter is now rounded up to multiple of the page size.
* tchdb.c (tcseekwrite, tcseekread, tcseekreadtry): page border handling was added.
- Release: 1.3.11
2008-09-20 Mikio Hirabayashi
* tcutil.c (tcunlock): new function.
* tchdb.c (tchdbsetmutex): useless locking was eliminated.
* tcbdb.c (tcbdbsetmutex): useless locking was eliminated.
* tcfdb.c (tcfdbsetmutex): useless locking was eliminated.
- Release: 1.3.10
2008-09-10 Mikio Hirabayashi
* tchdb.c (tchdblockallrecords, tchdbunlockallrecords): new functions.
* tcfdb.c (tcfdblockallrecords, tcfdbunlockallrecords): new functions.
- Release: 1.3.9
|
2008-09-05 09:15:25 by OBATA Akio | Files touched by this commit (3) |
Log message:
Update tokyocabinet to 1.3.8.
2008-09-05 Mikio Hirabayashi
* tcutil.c (tcmapaddint, tcmapadddouble): checking data size was added.
- Release: 1.3.8
|
2008-09-04 14:10:28 by OBATA Akio | Files touched by this commit (7) | |
Log message:
Import tokyocabinet-1.3.7 as databases/tokyocabinet.
Tokyo 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. There is neither concept of
data tables nor data types. Records are organized in hash table, B+ tree, or
fixed-length array.
|