golang-github-bits-and-blooms-bitset 1.5.0-1 source package in Ubuntu
Changelog
golang-github-bits-and-blooms-bitset (1.5.0-1) unstable; urgency=medium * New upstream release, required indirectly by ironwood to fix a crash. -- John Goerzen <email address hidden> Tue, 12 Dec 2023 07:48:40 -0600
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 | |
|---|---|---|---|---|
| Noble | release | universe | misc |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| golang-github-bits-and-blooms-bitset_1.5.0-1.dsc | 2.3 KiB | be92c4aba03f9750b36a2c965cee079ccb8353161b7db967d5a27ae9f84c7928 |
| golang-github-bits-and-blooms-bitset_1.5.0.orig.tar.gz | 21.3 KiB | ea00237644c0e75dce2508ab3433022be3774b4a5cb2bc4bfe5a115a6300019f |
| golang-github-bits-and-blooms-bitset_1.5.0-1.debian.tar.xz | 2.9 KiB | 60f508126a82a2ade28ff0c32cd8b5b76f043366d9f51abb405d1b1cc144be9f |
Available diffs
- diff from 1.2.2-1 to 1.5.0-1 (7.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.
