Apocrypha

libdatrie

Double-Array Trie Library

This is an implementation of double-array structure for representing trie, as proposed by Junichi Aoe. 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.

Available in

OverlayNewestEbuildsLast activity
gentoo gitweb ↗ 0.2.14-r1 2 13 h details ›
gentoo-zh GitHub ↗ 0.2.14 1 13 h details ›
vowstar GitHub ↗ 0.2.14-r1 1 25 h details ›
ppfeufer-gentoo-overlay GitHub ↗ 0.2.13 1 6 d details ›
nest GitHub ↗ 0.2.13 2 14 d details ›

Versions & arches

VersionOverlay amd64arm64x86riscvarm Committed
9999 LIVE nest follows upstream — no keywords 2 yr view · download · history ↗
0.2.14-r1 gentoo amd64 stable arm64 stable x86 stable riscv testing arm stable view · download · history ↗
0.2.14-r1 vowstar amd64 untested arm64 untested x86 untested riscv untested arm untested 5 mo view · download · history ↗
0.2.14 gentoo amd64 testing arm64 testing x86 testing riscv testing arm testing view · download · history ↗
0.2.14 gentoo-zh amd64 untested arm64 untested x86 untested riscv untested arm untested 8 mo view · download · history ↗
0.2.13 nest amd64 testing arm64 untested x86 testing riscv untested arm untested 2 yr view · download · history ↗
0.2.13 ppfeufer-gentoo-overlay amd64 untested arm64 untested x86 untested riscv untested arm untested 2 yr view · download · history ↗

Use flags of 0.2.14-r1

  • doc Add extra documentation (API, Javadoc, etc). It is recommended to enable per package instead of globally