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 home:adrianSuSE:PL/python-PyTrie && cd $_ - Create Badge
Refresh
Source Files
| Filename | Size | Changed |
|---|---|---|
| PyTrie-0.4.0.tar.gz | 0000095139 92.9 KB | |
| python-PyTrie.changes | 0000002052 2 KB | |
| python-PyTrie.spec | 0000002332 2.28 KB | |
| support-python-314.patch | 0000000771 771 Bytes |
Comments 0