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.
- Links to openSUSE:Factory / python-PyTrie
- Has a link diff
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout devel:languages:python:backports/python-PyTrie && cd $_ - Create Badge
Refresh
Refresh
Source Files (show merged sources derived from linked package)
| Filename | Size | Changed |
|---|---|---|
| _link | 0000000456 456 Bytes |
Latest Revision
Dirk Mueller (dirkmueller)
committed
(revision 1)
Comments 0