Skip to content

Files

Latest commit

ec5a527 · Apr 21, 2015

History

History
This branch is 3 commits behind projectcalico/datrie:master.

libdatrie

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
Apr 21, 2015
Feb 17, 2014
Aug 6, 2012
Apr 21, 2015
Feb 17, 2014
Jan 29, 2012
Jan 29, 2012
Apr 21, 2015
Feb 17, 2014
Feb 17, 2014
Jan 29, 2012
Jan 29, 2012
Jul 31, 2012
Feb 17, 2014
Jan 29, 2012
datrie - Double-Array Trie Library
==================================

This is an implementation of double-array structure for representing trie, 
as proposed by Junichi Aoe [1].

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.

See the details of the implementation at [2]:
  http://linux.thai.net/~thep/datrie/datrie.html

Historically, this was first implemented as C++ classes in a library called
midatrie [2], but later simplified and rewritten from scratch in C.

--
Theppitak Karoonboonyanan.
September 2006.

References
----------

[1] Aoe, J. "An Efficient Digital Search Algorithm by Using a Double-Array 
    Structure". IEEE Transactions on Software Engineering. Vol. 15, 9 
    (Sep 1989). pp. 1066-1077.

[2] Karoonboonyanan, T. "An Implementation of Double-Array Trie".
    http://linux.thai.net/~thep/datrie/datrie.html