bits-and-blooms/bitset

Health v2 · maintenance only

Adoption not part of the score

1513 stars · 191 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded

A Go library implementing bitsets, providing an efficient mapping between non-negative integers and boolean values. It supports individual bit operations plus full set algebra (union, intersection, difference, complement) with portable serialization.

Use cases

• represent sets of integers compactly in Go
• replace map[uint]bool with a memory-efficient structure
• compute intersections and unions of integer sets
• iterate over set bits efficiently
• serialize bitsets to bytes or JSON
• track membership flags for large ID spaces

When to choose

• you need fast, memory-efficient set operations over non-negative integers in Go
• you want battle-tested, fuzz-tested bitset code used in production systems
• you need portable serialization of bitset state

When to avoid

• you need sparse sets over very large ranges where compressed/roaring bitmaps are better
• you need to store non-integer keys or arbitrary values
• you work outside the Go ecosystem

Facets

library · maturity stable

serialization developer-tools developer-tools performance go cross-platform bitset bit-manipulation set-algebra data-structures algorithms

Member repositories

For agents

markdown · JSON · MCP: product_card(name="bits-and-blooms/bitset")