Package: libdatrie-dev (0.2.13-1)

[ Source: libdatrie  ]

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.

Tags: Software Development: Libraries, Role: Development Library

Other Packages Related to libdatrie-dev

• dep: libdatrie1 (= 0.2.13-1)

  Double-array trie library

• dep: pkg-config

  manage compile and link flags for libraries

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

  Documentation files for double-array trie library

Download libdatrie-dev

Download for all available architectures

Architecture	Package Size	Installed Size	Files
amd64	18.0 kB	85.0 kB	[list of files]
arm64	17.9 kB	88.0 kB	[list of files]
armel	15.3 kB	69.0 kB	[list of files]
armhf	15.0 kB	63.0 kB	[list of files]
i386	20.1 kB	84.0 kB	[list of files]
mips64el	19.3 kB	108.0 kB	[list of files]
mipsel	18.6 kB	86.0 kB	[list of files]
ppc64el	20.5 kB	101.0 kB	[list of files]
s390x	17.7 kB	88.0 kB	[list of files]