1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
|
Source: python-intbitset
Section: python
Priority: optional
Maintainer: Maximiliano Curia <maxy@debian.org>
Build-Depends: cython3,
debhelper-compat (= 13),
dh-sequence-python3,
python3-dev,
python3-pytest,
python3-setuptools,
python3-sphinx,
Rules-Requires-Root: no
Standards-Version: 4.1.4
Homepage: https://github.com/inveniosoftware/intbitset/
Vcs-Git: https://salsa.debian.org/python-team/packages/python-intbitset.git
Vcs-Browser: https://salsa.debian.org/python-team/packages/python-intbitset
Package: python-intbitset-doc
Architecture: all
Depends: ${misc:Depends}, ${sphinxdoc:Depends}
Built-Using: ${sphinxdoc:Built-Using}
Multi-Arch: foreign
Description: 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.
Package: python3-intbitset
Architecture: any
Depends: ${misc:Depends}, ${python3:Depends}, ${shlibs:Depends}
Description: 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.
|
