This iterator goes over all the bits whose value are 1 in a biset
This structure is really only meant to facilitate the writing
of iterator methods on bitsets. This way, only the const param
can be specified while leaving all the other types inferred by
the compiler. (That’s kind of type curry-ing).
This structure implemts a bitset with a maximum capacity of
$capa bits. The structure requires no dynamic allocation and it is
therefore fully copiable
This structure implemts a bitset with a maximum capacity of
$capa bits. The structure requires no dynamic allocation and it is
therefore fully copiable
This structure implemts a bitset with a maximum capacity of
$capa bits. The structure requires no dynamic allocation and it is
therefore fully copiable
This structure implemts a bitset with a maximum capacity of
$capa bits. The structure requires no dynamic allocation and it is
therefore fully copiable
This structure implemts a bitset with a maximum capacity of
$capa bits. The structure requires no dynamic allocation and it is
therefore fully copiable
This structure implemts a bitset with a maximum capacity of
$capa bits. The structure requires no dynamic allocation and it is
therefore fully copiable
This is an iterator that will iterate over all the subsets of a given size
of a given bitset