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
LICENSE 0000001450 1.42 KB
PyTrie-0.3.1.tar.gz 0000094678 92.5 KB
fix-sorting-py2.patch 0000000956 956 Bytes
no-import-from-collections.patch 0000000790 790 Bytes
python-PyTrie.changes 0000001198 1.17 KB
python-PyTrie.spec 0000002586 2.53 KB
Latest Revision
Wolfgang Engel's avatar Wolfgang Engel (bigironman) committed (revision 1)
osc copypac from project:openSUSE:Backports:SLE-15-SP3 package:python-PyTrie revision:1
Comments 0
openSUSE Build Service is sponsored by