golang-github-bits-and-blooms-bitset 1.13.0-1 source package in Ubuntu
Changelog
golang-github-bits-and-blooms-bitset (1.13.0-1) unstable; urgency=medium * New upstream release, required indirectly by ironsood -- John Goerzen <email address hidden> Tue, 23 Jul 2024 05:19:48 -0500
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 | |
|---|---|---|---|---|
| Questing | release | universe | misc | |
| Plucky | release | universe | misc | |
| Oracular | release | universe | misc |
Downloads
| File | Size | SHA-256 Checksum |
|---|---|---|
| golang-github-bits-and-blooms-bitset_1.13.0-1.dsc | 2.3 KiB | 9a22efcc5602579d4beaa200b687450f977047edfd086da62377aeafee05fa41 |
| golang-github-bits-and-blooms-bitset_1.13.0.orig.tar.gz | 26.2 KiB | 96d630c6f7302257b3eb037819be6c6ef47819672e3ab2f2e4d52348393726eb |
| golang-github-bits-and-blooms-bitset_1.13.0-1.debian.tar.xz | 2.9 KiB | b1f1c3ebca5566d647aa9e5e49b0b856e387b93b251dd717974a3ce11f1977f1 |
Available diffs
- diff from 1.5.0-1 to 1.13.0-1 (10.8 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.
