python-intbitset 2.3.0-3.2build2 source package in Ubuntu
Changelog
python-intbitset (2.3.0-3.2build2) lunar; urgency=medium * No-change rebuild with Python 3.11 as default -- Graham Inggs <email address hidden> Sun, 25 Dec 2022 20:37:50 +0000
Upload details
- Uploaded by:
- Graham Inggs
- Uploaded to:
- Lunar
- Original maintainer:
- Maximiliano Curia
- Architectures:
- any all
- Section:
- misc
- Urgency:
- Medium Urgency
See full publishing history Publishing
Series | Published | Component | Section | |
---|---|---|---|---|
Mantic | release | universe | misc | |
Lunar | release | universe | misc |
Downloads
File | Size | SHA-256 Checksum |
---|---|---|
python-intbitset_2.3.0.orig.tar.gz | 137.4 KiB | 08db3d12b3213c307ae4b87e8276bf78a05fae7e04bbd0e21373a2afdcee874a |
python-intbitset_2.3.0-3.2build2.debian.tar.xz | 4.2 KiB | 67286be137d47e234842d37e7f322cacd329f6c7a9a8db7d9e5f2505abc9744d |
python-intbitset_2.3.0-3.2build2.dsc | 2.1 KiB | 1db33f5c9b7be505526b1354cc0ea84cae9fb22467a053d7428271c2abf3726f |
Available diffs
- diff from 2.3.0-3.2build1 to 2.3.0-3.2build2 (329 bytes)
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