Pakiet: libdatrie1-bin (0.2.13-3) [debports]

[ Pakiet źródłowy:  ]

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.

Inne pakiety związane z libdatrie1-bin

• dep: libc6 (>= 2.37)

  Biblioteka GNU C: biblioteki współdzielone
  również pakiet wirtualny udostępniany przez libc6-udeb

• dep: libdatrie1 (>= 0.2.0)

  Biblioteka Double-array trie

Pobieranie libdatrie1-bin

Pobierz dla wszystkich dostępnych architektur

Architektura	Rozmiar pakietu	Rozmiar po instalacji	Pliki
sh4 (port nieoficjalny)	33,4 KiB	109,0 KiB	[lista plików]