openKylin libdatrie package

libdatrie 0.2.14-ok1 source package in openKylin

Changelog

libdatrie (0.2.14-ok1) huanghe; urgency=medium

  * Build for openKylin.

 -- openKylinBot <email address hidden>  Fri, 29 May 2026 07:12:13 -0700

Upload details

Uploaded by:
openKylinBot
Sponsored by:
Cibot
Uploaded to:
Huanghe V3.0
Original maintainer:
Openkylin Developers
Architectures:
any all
Section:
libs
Urgency:
Medium Urgency

Publishing See full publishing history

Series Pocket Published Component Section
Huanghe V3.0 proposed main libs

Downloads

File Size SHA-256 Checksum
libdatrie_0.2.14.orig.tar.xz 318.1 KiB f04095010518635b51c2313efa4f290b7db828d6273e39b2b8858f859dfe81d5
libdatrie_0.2.14-ok1.debian.tar.xz 4.2 KiB c122832e926228678ed965efd611271cf445eb391748925e17e1242c6a6c95ef
libdatrie_0.2.14-ok1.dsc 2.0 KiB 390260ce94535f4afde0318fad80d777d6fdefff39eb0e7a85ea41a575dfd9cb

Available diffs

View changes file

Binary packages built by this source

libdatrie-dev: Development files for double-array trie 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://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.

libdatrie-doc: Documentation files for double-array trie 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://linux.thai.net/~thep/datrie/datrie.html
 .
 This package contains some documents about the datrie library.

libdatrie1: Double-array trie library

 This package provides shared libraries needed to run programs that use the
 datrie library. It is usually automatically installed.

libdatrie1-bin: Programs for double-array trie 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://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.

libdatrie1-bin-dbgsym: debug symbols for libdatrie1-bin
libdatrie1-dbgsym: debug symbols for libdatrie1
libdatrie1-udeb: 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.