Expand description
Fixed-width bit vectors in natural binary order, with rank/unrank.
Position 0 is the least-significant bit, so ordinal r maps to the bit
vector whose bit j is (r >> j) & 1.
Structs§
- BitVector
Iter - Iterator over all
2^widthbit vectors of lengthwidth, in ordinal order.
Functions§
- bit_
vector_ rank - The ordinal of a bit vector (position 0 = least significant bit).
- bit_
vector_ unrank - The bit vector of the given
widthfor ordinalrank. - bit_
vectors - Construct a bit-vector iterator, rejecting widths that would overflow the
u128cursor.