Pacote: libdatrie-dev (0.2.13-3 e outros) [debports]

[ Fonte:  ]

Development files 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 development libraries, header files and manpages you need to develop your programs using the datrie library.

Outros pacotes relacionados a libdatrie-dev

• dep: libdatrie1 (= 0.2.13-3+b2)

  biblioteca de "trie" de vetor duplo

• dep: pkgconf

  gerencia opções de compilação e ligação para bibliotecas

• sug: libdatrie-doc (= 0.2.13-3)

  Documentation files for double-array trie library

Download de libdatrie-dev

Baixe para todas as arquiteturas disponíveis

Arquitetura	Versão	Tamanho do pacote	Tamanho instalado	Arquivos
hppa (porte não oficial)	0.2.13-3+b2	16.6 kB	70.0 kB	[lista de arquivos]