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 will count the number of possible cases. Given that we want to
draw k items among a set of n, without considering the repetitions
and without considerations for the order, we are computing the number
of possible combinations $C^n_k = \frac{n!}{k! (n-k)!}$.