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
python-PyTrie
x86_64
aarch64
ppc64le
x86_64
ppc64le
blocked
i586
x86_64
armv7l
aarch64
x86_64
Refresh


Source Files (show merged sources derived from linked package)
Comments 0
No comments available
openSUSE Build Service is sponsored by