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.
- Devel package for openSUSE:Factory
-
3
derived packages
- Links to openSUSE:Factory / python-PyTrie
- Download package
-
Checkout Package
osc -A https://api.opensuse.org checkout devel:languages:python/python-PyTrie && cd $_ - Create Badge
python-PyTrie
Package has built successfully and can be used to build further packages.
Package has built successfully and can be used to build further packages.
Package has built successfully and can be used to build further packages.
Package has built successfully and can be used to build further packages.
This package waits for other packages to be built. These can be in the same or other projects.
Package has built successfully and can be used to build further packages.
Package has built successfully and can be used to build further packages.
Package has built successfully and can be used to build further packages.
Package has built successfully and can be used to build further packages.
Package has built successfully and can be used to build further packages.
Comments 0