skip to navigation
skip to content

PyTrie 0.2

A pure Python implementation of the trie data structure.

Package Documentation

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.

File Type Py Version Uploaded on Size
PyTrie-0.2.tar.gz (md5) Source 2013-12-02 94KB