https://github.com/tpn/libdatrie

https://github.com/tpn/libdatrie

Last synced: about 6 hours ago
JSON representation

• Host: GitHub
• URL: https://github.com/tpn/libdatrie
• Owner: tpn
• License: lgpl-2.1
• Created: 2015-06-07T03:41:21.000Z (over 9 years ago)
• Default Branch: master
• Last Pushed: 2015-06-07T03:43:45.000Z (over 9 years ago)
• Last Synced: 2023-03-12T02:33:41.548Z (over 1 year ago)
• Language: C
• Size: 223 KB
• Stars: 0
• Watchers: 1
• Forks: 0
• Open Issues: 0
• Metadata Files:
  • Readme: README
  • Changelog: ChangeLog
  • License: COPYING

Awesome Lists containing this project

README

        
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