Reset the bit set to empty.
Remove an element from the bit set.
Destroy a bit set.
Test whether the bit set contains the element.
Initialise an empty bit set capable of holding ni integers, 0 <= i < ni.
Initialise a bit set capable of holding ni integers, 0 <= i < ni. The set returned is empty if fill == 0, or all of [0,ni) otherwise. bn is always non-zero (a fact used by kbs_next()).
Insert an element into the bit set.
Reset the bit set to all of [0,ni).
(For internal use only.) Returns a mask (like 00011111) showing which bits are in use in the last slot (for the given ni) set.
Return the next element contained in the bit set, or -1 if there are no more.
Resize an existing bit set to be capable of holding ni_new integers. Returns negative on error.
Resize an existing bit set to be capable of holding ni_new integers. Elements in [ni_old,ni_new) are added to the set if fill != 0. Need to clear excess bits when fill!=0 or n_new<n; always is simpler.
Initialise or reset a bit set iterator.