| 1 |
Source: golang-github-bits-and-blooms-bitset |
| 2 |
Maintainer: Debian Go Packaging Team <[email protected]> |
| 3 |
Uploaders: John Goerzen <[email protected]> |
| 4 |
Section: golang |
| 5 |
Testsuite: autopkgtest-pkg-go |
| 6 |
Priority: optional |
| 7 |
Build-Depends: debhelper-compat (= 13), |
| 8 |
dh-sequence-golang, |
| 9 |
golang-any |
| 10 |
Standards-Version: 4.7.4 |
| 11 |
Vcs-Browser: https://salsa.debian.org/go-team/packages/golang-github-bits-and-blooms-bitset |
| 12 |
Vcs-Git: https://salsa.debian.org/go-team/packages/golang-github-bits-and-blooms-bitset.git |
| 13 |
Homepage: https://github.com/bits-and-blooms/bitset |
| 14 |
XS-Go-Import-Path: github.com/bits-and-blooms/bitset |
| 15 |
|
| 16 |
Package: golang-github-bits-and-blooms-bitset-dev |
| 17 |
Architecture: all |
| 18 |
Depends: ${misc:Depends} |
| 19 |
Multi-Arch: foreign |
| 20 |
Description: implementation of bitsets |
| 21 |
This package implements bitsets, a mapping between non-negative integers |
| 22 |
and boolean values. It should be more efficient than map[uint] bool. |
| 23 |
. |
| 24 |
It provides methods for setting, clearing, flipping, and testing |
| 25 |
individual integers. |
| 26 |
. |
| 27 |
But it also provides set intersection, union, difference, complement, |
| 28 |
and symmetric operations, as well as tests to check whether any, all, |
| 29 |
or no bits are set, and querying a bitset's current length and number |
| 30 |
of positive bits. |
| 31 |
. |
| 32 |
BitSets are expanded to the size of the largest set bit; the memory |
| 33 |
allocation is approximately Max bits, where Max is the largest set |
| 34 |
bit. BitSets are never shrunk. On creation, a hint can be given for the |
| 35 |
number of bits that will be used. |
| 36 |
. |
| 37 |
Many of the methods, including Set, Clear, and Flip, return a BitSet |
| 38 |
pointer, which allows for chaining. |