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.
- Developed at devel:languages:python
- Sources inherited from project openSUSE:Factory
-
2
derived packages
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout openSUSE:Factory:Rebuild/python-PyTrie && cd $_ - Create Badge
Refresh
Refresh
Source Files
| Filename | Size | Changed |
|---|---|---|
| LICENSE | 0000001450 1.42 KB | |
| PyTrie-0.3.1.tar.gz | 0000094678 92.5 KB | |
| fix-sorting-py2.patch | 0000000956 956 Bytes | |
| python-PyTrie.changes | 0000000975 975 Bytes | |
| python-PyTrie.spec | 0000002431 2.37 KB |
Revision 2 (latest revision is 4)
Dominique Leuenberger (dimstar_suse)
accepted
request 695336
from
Todd R (TheBlackCat)
(revision 2)
- Drop duplicated word.
Comments 0