golang-github-bits-and-blooms-bitset 1.2.2-1 source package in Ubuntu
Changelog
golang-github-bits-and-blooms-bitset (1.2.2-1) unstable; urgency=medium * New upstream release. * according to ratt nothing needs to be rebuild -- Thorsten Alteholz <email address hidden> Mon, 04 Apr 2022 19:49:14 +0200
Upload details
- Uploaded by:
- Debian Go Packaging Team
- Uploaded to:
- Sid
- Original maintainer:
- Debian Go Packaging Team
- Architectures:
- 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 |
|---|---|---|
| golang-github-bits-and-blooms-bitset_1.2.2-1.dsc | 2.4 KiB | cc78b4c50eb4de871ddf268938469fd99e0a50ad0f53fde0f2f798d1cd4abb0b |
| golang-github-bits-and-blooms-bitset_1.2.2.orig.tar.gz | 18.9 KiB | b9f3dfce5c0386b2c6fccdd71f4f2f8d25eefb0efd08d20f1b1f265ca2664181 |
| golang-github-bits-and-blooms-bitset_1.2.2-1.debian.tar.xz | 2.8 KiB | 9348c8c6ce2312a99420a480343c34ea0e1ae5612bc164c9bb16e0512f4972e5 |
Available diffs
- diff from 1.2.1-1 to 1.2.2-1 (2.1 KiB)
No changes file available.
Binary packages built by this source
- golang-github-bits-and-blooms-bitset-dev: implementation of bitsets
This package implements bitsets, a mapping between non-negative integers
and boolean values. It should be more efficient than map[uint] bool.
.
It provides methods for setting, clearing, flipping, and testing
individual integers.
.
But it also provides set intersection, union, difference, complement,
and symmetric operations, as well as tests to check whether any, all,
or no bits are set, and querying a bitset's current length and number
of positive bits.
.
BitSets are expanded to the size of the largest set bit; the memory
allocation is approximately Max bits, where Max is the largest set
bit. BitSets are never shrunk. On creation, a hint can be given for the
number of bits that will be used.
.
Many of the methods, including Set, Clear, and Flip, return a BitSet
pointer, which allows for chaining.
