libdatrie0 0.1.2-2 (amd64 binary) in ubuntu intrepid
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 http://
.
This package contains the shared libraries needed to run programs that use
the datrie library.
.
Homepage: http://
Details
- Package version:
- 0.1.2-2
- Status:
- Superseded
- Component:
- main
- Priority:
- Optional
Downloadable files
amd64 build of libdatrie 0.1.2-2 in ubuntu hardy RELEASE produced
these files:
- libdatrie0_0.1.2-2_amd64.deb (18.7 KiB)
Package relationships
- Depends on: