python-intbitset 3.1.0-1 source package in Ubuntu
Changelog
python-intbitset (3.1.0-1) unstable; urgency=medium * Non-maintainer upload. * add gbp.conf * New upstream version 3.1.0 * replace nose by pytest (Closes: #1018514) * remove obsolete dependency on python3-six * use new dh-sequence-python3 * set Rules-Requires-Root: no * disable old patches * janitor: add upstream metadata * disable sphinx (Closes: #1042615) [ Debian Janitor ] * Apply multi-arch hints. + python-intbitset-doc: Add Multi-Arch: foreign. -- Alexandre Detiste <email address hidden> Sun, 14 Apr 2024 14:58:07 +0200
Upload details
- Uploaded by:
- Maximiliano Curia
- Uploaded to:
- Sid
- Original maintainer:
- Maximiliano Curia
- Architectures:
- any all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
| Series | Published | Component | Section | |
|---|---|---|---|---|
| Oracular | release | universe | misc | |
| Noble | release | universe | misc |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| python-intbitset_3.1.0-1.dsc | 2.1 KiB | b7563142a82c3c1c29a8c905c3a1577f09cfa33ceb62f1955829ae764af20353 |
| python-intbitset_3.1.0.orig.tar.gz | 188.2 KiB | 7da863f1caf79f2d95ca171b1c56e432e02eea07f72704589e60eb843275d591 |
| python-intbitset_3.1.0-1.debian.tar.xz | 4.4 KiB | f547b5c9b5661362de0fd716e5289bbe5a868d619646311b65ff633ee1bb9f30 |
Available diffs
- diff from 2.3.0-3.2build2 (in Ubuntu) to 3.1.0-1 (171.0 KiB)
- diff from 2.3.0-3.2build3 (in Ubuntu) to 3.1.0-1 (171.0 KiB)
No changes file available.
Binary packages built by this source
- python-intbitset-doc: unordered sets with ultra fast operations (documentation)
The ``intbitset`` library provides a set implementation to store sorted
unsigned integers either 32-bits integers (between ``0`` and
``2**31 - 1`` or ``intbitset.__maxelem_ _``) or an infinite range
with fast set operations implemented via bit vectors in a *Python C
extension* for speed and reduced memory usage.
.
This package contains the intbitset documentation.
- python3-intbitset: unordered sets with ultra fast operations
The ``intbitset`` library provides a set implementation to store sorted
unsigned integers either 32-bits integers (between ``0`` and
``2**31 - 1`` or ``intbitset.__maxelem_ _``) or an infinite range
with fast set operations implemented via bit vectors in a *Python C
extension* for speed and reduced memory usage.
- python3-intbitset-dbgsym: debug symbols for python3-intbitset
