python-trie 0.2+ds-2 source package in Ubuntu
Changelog
python-trie (0.2+ds-2) unstable; urgency=medium * Team upload. * d/control: Set Vcs-* to salsa.debian.org * d/copyright: Use https protocol in Format field * Convert git repository from git-dpm to gbp layout * Use debhelper-compat instead of debian/compat. * Use Python 3 for building docs. * Drop Python 2 support (Closes: #938228). -- Ondřej Nový <email address hidden> Fri, 11 Oct 2019 09:37:31 +0200
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 | |
---|---|---|---|---|
Focal | release | universe | misc |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
python-trie_0.2+ds-2.dsc | 2.0 KiB | 7b1071b9fd3b757f73e2cfb8111f9b627cbef387a3ac52545019934f024eae13 |
python-trie_0.2+ds.orig.tar.gz | 11.0 KiB | 178747e52fb61ce322a0d1dde8d8420d4c3d184d7b4c49b73c997c94dd97c8a0 |
python-trie_0.2+ds-2.debian.tar.xz | 2.5 KiB | b610e57f2cbfe289df285d83c4247a79447d919755bcf2ab915feb68362aa088 |
Available diffs
- diff from 0.2+ds-1 to 0.2+ds-2 (1.5 KiB)
No changes file available.
Binary packages built by this source
- python-trie-doc: Pure Python implementation of the trie data structure (doc)
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 package contains the HTML documentation.
- python3-trie: 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.