套件：golang-github-bits-and-blooms-bitset-dev（1.22.0-1~exp1）
golang-github-bits-and-blooms-bitset-dev 的相關連結
Debian 的資源：
下載原始碼套件 golang-github-bits-and-blooms-bitset：
- [golang-github-bits-and-blooms-bitset_1.22.0-1~exp1.dsc]
- [golang-github-bits-and-blooms-bitset_1.22.0.orig.tar.gz]
- [golang-github-bits-and-blooms-bitset_1.22.0-1~exp1.debian.tar.xz]
維護小組：
外部的資源：
- 主頁 [github.com]
相似套件：
試製（Experimental）套件
警告：這個套件來自於 experimental 發行版。這表示它很有可能表現出不穩定或者出現 bug ，甚至是導致資料損失。請務必在使用之前查閱 changelog 以及其他潛在的文件。
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.