bitmap

Uses vectorized instructions for boolean algebra operations, achieving nanosecond-level performance in benchmarks for And, Or, etc., as shown with times like 141.7 ns/op for OR on 100,000 elements.

All critical methods avoid heap allocations entirely, evidenced by benchmark results showing 0 B/op across operations, reducing garbage collector overhead in performance-critical applications.

Provides hardware-accelerated AND, OR, XOR, and ANDNOT, making it ideal for implementing bitmap indexes as demonstrated in the documentation with book filtering examples.

Includes Range() and Filter() methods with minimal overhead, optimized for in-place operations without extra allocations, as benchmarked with Filter() at 93,630 ns/op for 100,000 elements.