libdatrie-dev binary package in openKylin Nile V2.0 i386

 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.

Publishing history

Date Status Target Pocket Component Section Priority Phased updates Version
  2024-04-30 03:00:54 UTC Published openKylin Nile V2.0 i386 release main libdevel Optional 0.2.13-ok1
  • Published
  • Copied from openkylin nile-proposed i386 in Primary Archive for openKylin
  2024-04-24 07:00:24 UTC Published openKylin Nile V2.0 i386 proposed main libdevel Optional 0.2.13-ok1
  • Published
  2024-04-30 03:04:13 UTC Superseded openKylin Nile V2.0 i386 release main libdevel Optional 0.2.12-ok1
  • Removal requested .
  • Superseded by i386 build of libdatrie 0.2.13-ok1 in openkylin nile PROPOSED
  • Published
  • Copied from openkylin yangtze-release i386 in Primary Archive for openKylin