libdatrie 0.2.13-ok1 source package in openKylin
Changelog
libdatrie (0.2.13-ok1) nile; urgency=high * Build for openKylin. -- Luoyaoming <email address hidden> Wed, 24 Apr 2024 14:24:47 +0800
libdatrie (0.2.13-ok1) nile; urgency=high * Build for openKylin. -- Luoyaoming <email address hidden> Wed, 24 Apr 2024 14:24:47 +0800
Series | Published | Component | Section | |
---|---|---|---|---|
Huanghe V3.0 | proposed | main | libs | |
Huanghe V3.0 | release | main | libs | |
Nile V2.0 | release | main | libs | |
Nile V2.0 | proposed | main | libs |
File | Size | SHA-256 Checksum |
---|---|---|
libdatrie_0.2.13.orig.tar.xz | 306.7 KiB | 12231bb2be2581a7f0fb9904092d24b0ed2a271a16835071ed97bed65267f4be |
libdatrie_0.2.13-ok1.debian.tar.xz | 4.3 KiB | 405c76898cc44880ef3d68e9db92e08e6b262a18d15f694e45190e54f87e7be3 |
libdatrie_0.2.13-ok1.dsc | 2.1 KiB | a98be57436b693e889b2128d592bfb506474822f81eb53f65eecd5187b9b49c5 |
Trie is a kind of digital search tree, an efficient indexing method in which
search time is independent of database size. It only takes O(m) search time,
where m is the length of the search string. 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 https:/
.
This package contains the development libraries, header files and manpages
you need to develop your programs using the datrie library.
Trie is a kind of digital search tree, an efficient indexing method in which
search time is independent of database size. It only takes O(m) search time,
where m is the length of the search string. 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 https:/
.
This package contains some documents about the datrie library.
This package provides shared libraries needed to run programs that use the
datrie library. It is usually automatically installed.
Trie is a kind of digital search tree, an efficient indexing method in which
search time is independent of database size. It only takes O(m) search time,
where m is the length of the search string. 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 https:/
.
This package contains the program files which is used with the library,
including trietool, the trie manipulation tool.
This package provides double-array trie shared library needed to run
libthai for the debian-installer GTK+ frontend.