./wip/py-trie3, Python implementation of the trie data structure

[ CVSweb ] [ Homepage ] [ RSS ] [ Required by ] [ Add to tracker ]


Branch: CURRENT, Version: 0.2, Package name: py312-trie3-0.2, Maintainer: kamelderouiche

Python3 port of PyTrie. 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


Master sites:

RMD160: 634bc00c7a2df5c5f149c0e27ba33a6a1e48d3a9
Filesize: 95.439 KB

Version history: (Expand)