libdatrie-doc binary package in openKylin Yangtze V1.0 riscv64

 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.

Publishing history

Date Status Target Pocket Component Section Priority Phased updates Version
  2022-07-12 09:42:15 UTC Published openKylin Yangtze V1.0 riscv64 release main doc Optional 0.2.12-ok1
  • Published
  • Copied from openkylin yangtze-release amd64 in ppa2