python-pygtrie 2.2-1.1 source package in Ubuntu
Changelog
python-pygtrie (2.2-1.1) unstable; urgency=medium * Non maintainer upload by the Reproducible Builds team. * No source change upload to rebuild on buildd with .buildinfo files. -- Holger Levsen <email address hidden> Wed, 06 Jan 2021 20:35:30 +0100
Upload details
- Uploaded by:
- Debian Python Modules Team
- Uploaded to:
- Sid
- Original maintainer:
- Debian Python Modules Team
- Architectures:
- all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section |
|---|
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| python-pygtrie_2.2-1.1.dsc | 2.1 KiB | adeb6f2ed4fcbcfc6313afb583ea488d81ccead3f7ecbdc1cac855bcd3bd2686 |
| python-pygtrie_2.2.orig.tar.gz | 29.5 KiB | d3f55074455951c2215126bf744b017d5bc400acb57b102be06163c0dec0f254 |
| python-pygtrie_2.2-1.1.debian.tar.xz | 3.0 KiB | d11c87c77be833e0223c27a0632b4ea9d97650ca02e21d7dce5ea3d233502be0 |
Available diffs
- diff from 2.2-1 to 2.2-1.1 (366 bytes)
No changes file available.
Binary packages built by this source
- python-pygtrie-doc: Python library implementing a trie data structure (common documentation)
Trie data structure, also known as radix or prefix tree, is a tree
associating keys to values where all the descendants of a node have
a common prefix (associated with that node).
.
The trie module contains Trie, CharTrie and StringTrie classes each
implementing a mutable mapping interface, i.e. dict interface. As
such, in most circumstances, Trie could be used as a drop-in
replacement for a dict, but the prefix nature of the data structure
is trie's real strength.
.
The module also contains PrefixSet class which uses a trie to store
a set of prefixes such that a key is contained in the set if it or
its prefix is stored in the set.
.
This is the common documentation package.
- python3-pygtrie: Python library implementing a trie data structure (Python 3)
Trie data structure, also known as radix or prefix tree, is a tree
associating keys to values where all the descendants of a node have
a common prefix (associated with that node).
.
The trie module contains Trie, CharTrie and StringTrie classes each
implementing a mutable mapping interface, i.e. dict interface. As
such, in most circumstances, Trie could be used as a drop-in
replacement for a dict, but the prefix nature of the data structure
is trie's real strength.
.
The module also contains PrefixSet class which uses a trie to store
a set of prefixes such that a key is contained in the set if it or
its prefix is stored in the set.
.
This package installs the library for Python 3.
