python-intbitset 2.3.0-3.2build1 source package in Ubuntu

Changelog

python-intbitset (2.3.0-3.2build1) jammy; urgency=medium

  * No-change rebuild with Python 3.10 as default version

 -- Graham Inggs <email address hidden>  Thu, 13 Jan 2022 20:24:31 +0000

Upload details

Uploaded by:
Graham Inggs
Uploaded to:
Jammy
Original maintainer:
Maximiliano Curia
Architectures:
any all
Section:
misc
Urgency:
Medium Urgency

See full publishing history Publishing

Series Pocket Published Component Section
Jammy 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.2build1.debian.tar.xz 4.1 KiB 3f09027ddf0bc99be2bad242659b1f4024bfd3d4b5742fcda47edd64d2122fd0
python-intbitset_2.3.0-3.2build1.dsc 2.1 KiB c9bd10cdbf371fb9719273a8b46bb65124585e419f0a31341012b80f7066e00b

View changes file

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: No summary available for python3-intbitset-dbgsym in ubuntu kinetic.

No description available for python3-intbitset-dbgsym in ubuntu kinetic.