| Trees | Indices | Help |
|
|---|
|
|
This module implements a trie data structure. This allows an O(M) lookup of a string in a dictionary, where M is the length of the string. It also supports approximate matches. Functions: trie Create a new trie object. save Save a trie to a handle. load Load a trie from a handle.
|
|||
trie object |
|
||
|
|||
new Trie object. |
|
||
| Trees | Indices | Help |
|
|---|
| Generated by Epydoc 3.0.1 on Tue Feb 5 17:59:49 2013 | http://epydoc.sourceforge.net |