• View
• Edit
• History
• Print

libdatrie

Description

This is an implementation of double-array structure for representing trie. 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.

The library is available as 32-bit and 64-bit:

• If you are compiling a 32-bit program, no special compiler options are needed.
• If you are compiling a 64-bit program, you have to compile and link your application with "cc -q64" or "gcc -maix64".

Homepage: http://linux.thai.net

Current version: 0.2.4-1

Downloads

RPM:

• libdatrie-0.2.4-1.aix5.1.ppc.rpm
• libdatrie-devel-0.2.4-1.aix5.1.ppc.rpm

Source RPM:

• libdatrie-0.2.4-1.src.rpm

Package dependencies:

• pkg-config

Older version

RPM:

• libdatrie-0.1.4-1.aix5.1.ppc.rpm
• libdatrie-devel-0.1.4-1.aix5.1.ppc.rpm

Source RPM:

• libdatrie-0.1.4-1.src.rpm

Package dependencies:

• pkg-config

All versions:

• Binary RPMs
• Source RPMs