openKylin libdatrie package

libdatrie 0.2.12-ok1 source package in openKylin

Changelog

libdatrie (0.2.12-ok1) yangtze; urgency=medium

  * Build for openKylin.

 -- openKylinBot <email address hidden>  Mon, 25 Apr 2022 22:03:04 +0800

Upload details

Uploaded by:
openKylinBot
Sponsored by:
Cibot
Uploaded to:
Yangtze V1.0
Original maintainer:
Theppitak Karoonboonyanan
Architectures:
any all
Section:
libs
Urgency:
Medium Urgency

Publishing See full publishing history

Series Pocket Published Component Section
Yangtze V1.0 release main libs

Downloads

File Size SHA-256 Checksum
libdatrie_0.2.12.orig.tar.xz 303.0 KiB 452dcc4d3a96c01f80f7c291b42be11863cd1554ff78b93e110becce6e00b149
libdatrie_0.2.12-ok1.debian.tar.xz 4.2 KiB 79771ea4c1702487fbcd85ef383f602f8a35d0b5bac6f0c87268c4fd5440e467
libdatrie_0.2.12-ok1.dsc 2.0 KiB f491d567ad875e0e0f0cb0dc85704955f287bc0e655aa8c8a7befe9fbbfc276c

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.