Skip to content
Sections
>> Trisquel >> Paketit >> aramo >> misc >> libdatrie1-bin
etiona  ] [  nabia  ] [  aramo  ]
[ Source: libdatrie  ]

Paketti: libdatrie1-bin (0.2.13-2)

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.

Muut pakettiin libdatrie1-bin liittyvät paketit

  • depends
  • recommends
  • suggests
  • dep: libc6 (>= 2.34)
    GNU C Library: Shared libraries
    myös näennäispaketti, jonka toteuttaa libc6-udeb
  • dep: libdatrie1 (>= 0.2.0)
    Double-array trie library

Imuroi libdatrie1-bin

Imurointi kaikille saataville arkkitehtuureille
Arkkitehtuuri Paketin koko Koko asennettuna Tiedostot
amd64 10.2 kt52 kt [tiedostoluettelo]
arm64 10.2 kt47 kt [tiedostoluettelo]
armhf 9.5 kt43 kt [tiedostoluettelo]
i386 10.7 kt51 kt [tiedostoluettelo]
ppc64el 11.5 kt160 kt [tiedostoluettelo]