A pure Python implementation of the trie data structure

Edit Package python-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.

Refresh
Refresh
Source Files
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
Dominique Leuenberger's avatar Dominique Leuenberger (dimstar_suse) accepted request 847639 from Steve Kowalik's avatar Steve Kowalik (StevenK) (revision 4)
- Update to 0.4.0:
  * Drop Python 2.7 support
- LICENSE now included in the tarball, drop the separate Source. 
- Drop fix-sorting-py2.patch, Python 2 not supported
- Drop no-import-from-collections.patch, included upstream
- No longer BuildRequire python-devel, and switch to the macro for
  testsuite
Comments 0
openSUSE Build Service is sponsored by