Bitmatrixb2

// Find all columns where both row 10 and row 20 have a '1' bitmatrixb2* result = bm2_and_rows(mat, 10, 20); // Iterate over set bits uint64_t word; bm2_foreach_set_word(result, &word) // Process 64-bit chunk

// Create a logical view of the transposed matrix (no data copy) bitmatrixb2* transposed = bm2_transpose_view(mat); // Now row 5 of transposed is column 5 of original Performance Benchmarks In controlled tests on an Intel Xeon Gold 6242 (AVX-512 enabled), Bitmatrixb2 demonstrated: bitmatrixb2

| Operation | Naive Bit Array | Bitmatrixb2 | Speedup | |-----------|----------------|-------------|---------| | Row-to-column AND (1024x1024) | 342 µs | 18 µs | 19x | | Matrix multiplication (binary) | 1,240 µs | 97 µs | 12.8x | | Sparse block iteration (30% density) | 880 µs | 112 µs | 7.85x | | Full matrix transpose | 512 µs | 0.4 µs (view) | 1280x | // Find all columns where both row 10

This article delves deep into the architecture, use cases, and performance benchmarks of Bitmatrixb2, offering a comprehensive guide for professionals looking to leverage this powerful tool. At its core, Bitmatrixb2 is a specialized two-dimensional bit matrix implementation designed for ultra-fast boolean operations and space-efficient data encoding. Unlike traditional bit arrays or simple bitmap indexes, Bitmatrixb2 introduces a block-based transposition engine (the "b2" suffix denotes "block-squared" architecture) that allows for simultaneous row-column operations. and performance benchmarks of Bitmatrixb2