all options
buster  ] [  bullseye  ] [  bookworm  ] [  trixie  ] [  sid  ]
[ Source: libdatrie  ]

Package: libdatrie1-bin (0.2.13-2 and others)

Links for libdatrie1-bin

Screenshot

Debian Resources:

Download Source Package libdatrie:

Maintainer:

External Resources:

Similar packages:

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.

Tags: Role: Program

Other Packages Related to libdatrie1-bin

  • depends
  • recommends
  • suggests
  • enhances

Download libdatrie1-bin

Download for all available architectures
Architecture Version Package Size Installed Size Files
armhf 0.2.13-2+b1 37.8 kB115.0 kB [list of files]