Пакет: libdatrie1-bin (0.2.13-3 и други)

[ Източник: libdatrie  ]

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.

Етикети: Role: Program

Други пакети, свързани с libdatrie1-bin

• dep: libc6 (>= 2.34)

  GNU C Library: Shared libraries
  също и виртуален пакет, предлаган от libc6-udeb

• dep: libdatrie1 (>= 0.2.0)

  Double-array trie library

Изтегляне на libdatrie1-bin

Изтегляне за всички налични архитектури

Архитектура	Версия	Големина на пакета	Големина след инсталиране	Файлове
armel	0.2.13-3+b1	32,5 кБ	58,0 кБ	[списък на файловете]