Binary package “python3-trie” in ubuntu focal
Pure Python implementation of the trie data structure (Python 3)
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.
.
This is the Python 3 package.
Source package
Published versions
- python3-trie 0.2+ds-1 in amd64 (Release)
- python3-trie 0.2+ds-2 in amd64 (Proposed)
- python3-trie 0.2+ds-2 in amd64 (Release)
- python3-trie 0.2+ds-1 in arm64 (Release)
- python3-trie 0.2+ds-2 in arm64 (Proposed)
- python3-trie 0.2+ds-2 in arm64 (Release)
- python3-trie 0.2+ds-1 in armhf (Release)
- python3-trie 0.2+ds-2 in armhf (Proposed)
- python3-trie 0.2+ds-2 in armhf (Release)
- python3-trie 0.2+ds-1 in i386 (Release)
- python3-trie 0.2+ds-2 in i386 (Proposed)
- python3-trie 0.2+ds-2 in i386 (Release)
- python3-trie 0.2+ds-1 in ppc64el (Release)
- python3-trie 0.2+ds-2 in ppc64el (Proposed)
- python3-trie 0.2+ds-2 in ppc64el (Release)
- python3-trie 0.2+ds-2 in riscv64 (Release)
- python3-trie 0.2+ds-1 in s390x (Release)
- python3-trie 0.2+ds-2 in s390x (Proposed)
- python3-trie 0.2+ds-2 in s390x (Release)