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
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
|
Source: libdatrie
Priority: optional
Maintainer: Theppitak Karoonboonyanan <thep@debian.org>
Build-Depends:
autoconf-archive,
debhelper (>= 9),
dh-autoreconf,
dpkg-dev (>= 1.16.1~)
Build-Depends-Indep: doxygen (>= 1.8.8)
Standards-Version: 3.9.8
Section: libs
Vcs-Git: https://anonscm.debian.org/git/collab-maint/libdatrie.git
Vcs-Browser: https://anonscm.debian.org/cgit/collab-maint/libdatrie.git
Homepage: http://linux.thai.net/projects/libthai
Package: libdatrie-dev
Section: libdevel
Architecture: any
Multi-Arch: same
Pre-Depends: ${misc:Pre-Depends}
Depends: libdatrie1 (= ${binary:Version}), ${misc:Depends}
Suggests: libdatrie-doc (= ${source:Version})
Description: Development files for double-array trie library
Trie is a kind of digital search tree, an efficient indexing method with
O(1) time complexity for searching. Comparably as efficient as hashing,
trie also provides flexibility on incremental matching and key spelling
manipulation. This makes it ideal for lexical analyzers, as well as
spelling dictionaries.
.
This library is an implementation of double-array structure for representing
trie, as proposed by Junichi Aoe. The details of the implementation can be
found at http://linux.thai.net/~thep/datrie/datrie.html
.
This package contains the development libraries, header files and manpages
you need to develop your programs using the datrie library.
Package: libdatrie1-bin
Section: misc
Architecture: any
Multi-Arch: foreign
Depends: ${misc:Depends}, ${shlibs:Depends}
Description: Programs for double-array trie library
Trie is a kind of digital search tree, an efficient indexing method with
O(1) time complexity for searching. Comparably as efficient as hashing,
trie also provides flexibility on incremental matching and key spelling
manipulation. This makes it ideal for lexical analyzers, as well as
spelling dictionaries.
.
This library is an implementation of double-array structure for representing
trie, as proposed by Junichi Aoe. The details of the implementation can be
found at http://linux.thai.net/~thep/datrie/datrie.html
.
This package contains the program files which is used with the library,
including trietool, the trie manipulation tool.
Package: libdatrie1
Architecture: any
Multi-Arch: same
Depends: ${misc:Depends}, ${shlibs:Depends}
Pre-Depends: ${misc:Pre-Depends}
Description: Double-array trie library
This package provides shared libraries needed to run programs that use the
datrie library. It is usually automatically installed.
Package: libdatrie1-udeb
Package-Type: udeb
Section: debian-installer
Architecture: any
Depends: ${misc:Depends}, ${shlibs:Depends}
Description: Double-array trie library for D-I use
This package provides double-array trie shared library needed to run
libthai for the debian-installer GTK+ frontend.
Package: libdatrie-doc
Section: doc
Architecture: all
Multi-Arch: foreign
Depends: libjs-jquery, ${misc:Depends}
Suggests: iceweasel | www-browser
Description: Documentation files for double-array trie library
Trie is a kind of digital search tree, an efficient indexing method with
O(1) time complexity for searching. Comparably as efficient as hashing,
trie also provides flexibility on incremental matching and key spelling
manipulation. This makes it ideal for lexical analyzers, as well as
spelling dictionaries.
.
This library is an implementation of double-array structure for representing
trie, as proposed by Junichi Aoe. The details of the implementation can be
found at http://linux.thai.net/~thep/datrie/datrie.html
.
This package contains some documents about the datrie library.
|
