alla flaggor
jessie  ] [  stretch  ] [  buster  ] [  bullseye  ] [  sid  ]
[ Källkod: libdatrie  ]

Paket: libdatrie-dev (0.2.8-1)

Länkar för libdatrie-dev



Hämta källkodspaketet libdatrie:


Externa resurser:

Liknande paket:

Development files for double-array trie library

Trie is a kind of digital search tree, an efficient indexing method with O(1) time complexity for searching. 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

This package contains the development libraries, header files and manpages you need to develop your programs using the datrie library.

Märken: Software Development: Bibliotek, Role: Development Library

Andra paket besläktade med libdatrie-dev

  • beror
  • rekommenderar
  • föreslår
  • enhances

Hämta libdatrie-dev

Hämtningar för alla tillgängliga arkitekturer
Arkitektur Paketstorlek Installerad storlek Filer
amd64 35,8 kbyte126,0 kbyte [filförteckning]
armel 33,4 kbyte112,0 kbyte [filförteckning]
armhf 32,7 kbyte106,0 kbyte [filförteckning]
i386 36,5 kbyte121,0 kbyte [filförteckning]