python-pygtrie 2.2-1.1ubuntu1 source package in Ubuntu
Changelog
python-pygtrie (2.2-1.1ubuntu1) jammy; urgency=medium * debian/patches/python-3.10.patch: compatibility with python 3.10. -- Steve Langasek <email address hidden> Sat, 11 Dec 2021 07:21:32 +0000
Upload details
- Uploaded by:
- Steve Langasek
- Uploaded to:
- Jammy
- Original maintainer:
- Ubuntu Developers
- 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.orig.tar.gz | 29.5 KiB | d3f55074455951c2215126bf744b017d5bc400acb57b102be06163c0dec0f254 |
python-pygtrie_2.2-1.1ubuntu1.debian.tar.xz | 3.4 KiB | b70e4dc5a92aef08106ec6743a77413b2c76b91b3c9bbbb5785f163291a911af |
python-pygtrie_2.2-1.1ubuntu1.dsc | 2.2 KiB | 8192b8e7b40b77907003dc7676a503aa13f1c138c4870722f4e76a237d1761c0 |
Available diffs
- diff from 2.2-1.1 (in Debian) to 2.2-1.1ubuntu1 (908 bytes)
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.