PrefixTree Documentation


A lighting fast bitwise prefix tree implementation. You can find information about this kind of structures under names trie, DAWG or minimal acyclic deterministic finite automata.

This library can be usefull for

In compare to list based dictionaries the prefix tree structure is both faster and less memory consuming with the same funcionality.

Performance (tested on

You can download this library from

If you have any problem with this software go on support page

If these links don't work you should look at

Generated on Tue Oct 25 00:51:49 2011 for PrefixTree by  doxygen 1.6.3