blob: 4b3c8a363eb42f3d196383be4945bb42d456b87c (
plain) (
blame)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
|
{ fetchurl, lib, stdenv, zlib, bzip2 }:
stdenv.mkDerivation rec {
pname = "tokyocabinet";
version = "1.4.48";
src = fetchurl {
url = "https://dbmx.net/tokyocabinet/${pname}-${version}.tar.gz";
sha256 = "140zvr0n8kvsl0fbn2qn3f2kh3yynfwnizn4dgbj47m975yg80x0";
};
buildInputs = [ zlib bzip2 ];
postInstall =
'' sed -i "$out/lib/pkgconfig/tokyocabinet.pc" \
-e 's|-lz|-L${zlib.out}/lib -lz|g;
s|-lbz2|-L${bzip2.out}/lib -lbz2|g'
'';
meta = {
description = "Tokyo Cabinet: a modern implementation of DBM";
longDescription =
'' 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.
Tokyo Cabinet is developed as the successor of GDBM and QDBM on the
following purposes. They are achieved and Tokyo Cabinet replaces
conventional DBM products: improves space efficiency, improves time
efficiency, improves parallelism, improves usability, improves
robustness, supports 64-bit architecture.
'';
license = lib.licenses.lgpl2Plus;
maintainers = [ ];
platforms = lib.platforms.unix;
};
}
|