K 10
svn:author
V 5
koobs
K 8
svn:date
V 27
2015-02-13T12:13:02.023935Z
K 7
svn:log
V 433
[NEW] devel/py-pytrie: Pure Python implementation of the trie data structure

A trie is an ordered tree data structure that is used to store a mapping
where the keys are sequences, usually strings over an alphabet. In
addition to implementing the mapping interface, tries allow finding the
items for a given prefix, and vice versa, finding the items whose keys
are prefixes of a given key.

WWW: https://bitbucket.org/gsakkis/pytrie

END