Module hi_sparse_bitset::ops

Operations for apply and reduce.

• And is the only operation that can discard blocks early on hierarchy level during traverse. Complexity-wise this is the fastest operation.
• Or - does not need to discard any blocks, since it is a merge operation by definition.
• Xor - have Or performance.
• Sub - traverse all left operand bitset blocks.

You can make your own operation by implementing BitSetOp.

Structs

• And
  Intersection
• Or
  Union
• Sub
  Difference (relative complement) left\right.
• Xor
  Symmetric difference.

Traits

• BitSetOp
  Binary operation interface for BitSetInterfaces.