| merge(BitMapProducer) |  | 100% | | 100% | 0 | 3 | 0 | 17 | 0 | 1 |
| forEachBitMap(LongPredicate) | | 100% | | 100% | 0 | 3 | 0 | 5 | 0 | 1 |
| lambda$merge$3(int) | | 100% | | 100% | 0 | 3 | 0 | 5 | 0 | 1 |
| merge(BloomFilter) | | 100% | | 100% | 0 | 2 | 0 | 5 | 0 | 1 |
| SimpleBloomFilter(Shape) | | 100% | | n/a | 0 | 1 | 0 | 6 | 0 | 1 |
| forEachBitMapPair(BitMapProducer, LongBiPredicate) | | 100% | | 100% | 0 | 3 | 0 | 2 | 0 | 1 |
| SimpleBloomFilter(SimpleBloomFilter) | | 100% | | n/a | 0 | 1 | 0 | 5 | 0 | 1 |
| lambda$merge$2(int[], long) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| merge(IndexProducer) | | 100% | | n/a | 0 | 1 | 0 | 4 | 0 | 1 |
| cardinality() | | 100% | | 100% | 0 | 2 | 0 | 4 | 0 | 1 |
| isEmpty() | | 100% | | 100% | 0 | 3 | 0 | 1 | 0 | 1 |
| merge(Hasher) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| forEachIndex(IntPredicate) | | 100% | | n/a | 0 | 1 | 0 | 2 | 0 | 1 |
| clear() | | 100% | | n/a | 0 | 1 | 0 | 3 | 0 | 1 |
| lambda$isEmpty$1(long) | | 100% | | 100% | 0 | 2 | 0 | 1 | 0 | 1 |
| asBitMapArray() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| contains(IndexProducer) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| copy() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| lambda$contains$0(int) | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| getShape() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |
| characteristics() | | 100% | | n/a | 0 | 1 | 0 | 1 | 0 | 1 |