| 1 |
Source: libdatrie |
| 2 |
Priority: optional |
| 3 |
Maintainer: Theppitak Karoonboonyanan <[email protected]> |
| 4 |
Build-Depends: |
| 5 |
autoconf-archive, |
| 6 |
debhelper-compat (= 13) |
| 7 |
Build-Depends-Indep: doxygen (>= 1.8.8) |
| 8 |
Standards-Version: 4.7.2 |
| 9 |
Section: libs |
| 10 |
Vcs-Git: https://salsa.debian.org/debian/libdatrie.git |
| 11 |
Vcs-Browser: https://salsa.debian.org/debian/libdatrie |
| 12 |
Homepage: https://linux.thai.net/projects/libthai |
| 13 |
|
| 14 |
Package: libdatrie-dev |
| 15 |
Section: libdevel |
| 16 |
Architecture: any |
| 17 |
Multi-Arch: same |
| 18 |
Pre-Depends: ${misc:Pre-Depends} |
| 19 |
Depends: libdatrie1 (= ${binary:Version}), pkgconf, ${misc:Depends} |
| 20 |
Suggests: libdatrie-doc (= ${source:Version}) |
| 21 |
Description: Development files for double-array trie library |
| 22 |
Trie is a kind of digital search tree, an efficient indexing method in which |
| 23 |
search time is independent of database size. It only takes O(m) search time, |
| 24 |
where m is the length of the search string. Comparably as efficient as |
| 25 |
hashing, trie also provides flexibility on incremental matching and key |
| 26 |
spelling manipulation. This makes it ideal for lexical analyzers, as well as |
| 27 |
spelling dictionaries. |
| 28 |
. |
| 29 |
This library is an implementation of double-array structure for representing |
| 30 |
trie, as proposed by Junichi Aoe. The details of the implementation can be |
| 31 |
found at https://linux.thai.net/~thep/datrie/datrie.html |
| 32 |
. |
| 33 |
This package contains the development libraries, header files and manpages |
| 34 |
you need to develop your programs using the datrie library. |
| 35 |
|
| 36 |
Package: libdatrie1-bin |
| 37 |
Section: misc |
| 38 |
Architecture: any |
| 39 |
Multi-Arch: foreign |
| 40 |
Depends: ${misc:Depends}, ${shlibs:Depends} |
| 41 |
Description: Programs for double-array trie library |
| 42 |
Trie is a kind of digital search tree, an efficient indexing method in which |
| 43 |
search time is independent of database size. It only takes O(m) search time, |
| 44 |
where m is the length of the search string. Comparably as efficient as |
| 45 |
hashing, trie also provides flexibility on incremental matching and key |
| 46 |
spelling manipulation. This makes it ideal for lexical analyzers, as well as |
| 47 |
spelling dictionaries. |
| 48 |
. |
| 49 |
This library is an implementation of double-array structure for representing |
| 50 |
trie, as proposed by Junichi Aoe. The details of the implementation can be |
| 51 |
found at https://linux.thai.net/~thep/datrie/datrie.html |
| 52 |
. |
| 53 |
This package contains the program files which is used with the library, |
| 54 |
including trietool, the trie manipulation tool. |
| 55 |
|
| 56 |
Package: libdatrie1 |
| 57 |
Architecture: any |
| 58 |
Multi-Arch: same |
| 59 |
Depends: ${misc:Depends}, ${shlibs:Depends} |
| 60 |
Pre-Depends: ${misc:Pre-Depends} |
| 61 |
Description: Double-array trie library |
| 62 |
This package provides shared libraries needed to run programs that use the |
| 63 |
datrie library. It is usually automatically installed. |
| 64 |
|
| 65 |
Package: libdatrie1-udeb |
| 66 |
Package-Type: udeb |
| 67 |
Section: debian-installer |
| 68 |
Architecture: any |
| 69 |
Depends: ${misc:Depends}, ${shlibs:Depends} |
| 70 |
Description: Double-array trie library for D-I use |
| 71 |
This package provides double-array trie shared library needed to run |
| 72 |
libthai for the debian-installer GTK+ frontend. |
| 73 |
|
| 74 |
Package: libdatrie-doc |
| 75 |
Section: doc |
| 76 |
Architecture: all |
| 77 |
Multi-Arch: foreign |
| 78 |
Depends: libjs-jquery, ${misc:Depends} |
| 79 |
Suggests: www-browser |
| 80 |
Description: Documentation files for double-array trie library |
| 81 |
Trie is a kind of digital search tree, an efficient indexing method in which |
| 82 |
search time is independent of database size. It only takes O(m) search time, |
| 83 |
where m is the length of the search string. Comparably as efficient as |
| 84 |
hashing, trie also provides flexibility on incremental matching and key |
| 85 |
spelling manipulation. This makes it ideal for lexical analyzers, as well as |
| 86 |
spelling dictionaries. |
| 87 |
. |
| 88 |
This library is an implementation of double-array structure for representing |
| 89 |
trie, as proposed by Junichi Aoe. The details of the implementation can be |
| 90 |
found at https://linux.thai.net/~thep/datrie/datrie.html |
| 91 |
. |
| 92 |
This package contains some documents about the datrie library. |