すべてのオプション
buster  ] [  bullseye  ] [  bookworm  ] [  trixie  ] [  sid  ]
[ ソース: libdatrie  ]

パッケージ: libdatrie1-bin (0.2.13-1)

libdatrie1-bin に関するリンク

Screenshot

Debian の資源:

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.

その他の libdatrie1-bin 関連パッケージ

  • 依存
  • 推奨
  • 提案
  • enhances

libdatrie1-bin のダウンロード

すべての利用可能アーキテクチャ向けのダウンロード
アーキテクチャ パッケージサイズ インストールサイズ ファイル
mips64el 37.9 kB67.0 kB [ファイル一覧]