openKylin libdatrie package

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

Upload details

Uploaded by:
luoyaoming
Sponsored by:
Cibot
Uploaded to:
Nile V2.0
Original maintainer:
Openkylin Developers
Architectures:
any all
Section:
libs
Urgency:
Very Urgent

Publishing See full publishing history

Series Pocket Published Component Section
Nile V2.0 release main libs
Nile V2.0 proposed main libs

Downloads

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

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.