A 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.
- Sources inherited from project devel:languages:python:backports
- Links to openSUSE:Factory / python-PyTrie
- Has a link diff
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout Cloud:OpenStack:Master/python-PyTrie && cd $_ - Create Badge
Refresh
Refresh
Source Files (show unmerged sources)
| Filename | Size | Changed |
|---|---|---|
| PyTrie-0.4.0.tar.gz | 0000095139 92.9 KB | |
| python-PyTrie.changes | 0000001643 1.6 KB | |
| python-PyTrie.spec | 0000002182 2.13 KB |
Latest Revision
Dirk Mueller (dirkmueller)
committed
(revision 1)
Comments 0