Represents the state of the scanner at the end of a slice.
Represents the state of the scanner at the end of a slice.
The n is the last rank number used (-1 means we haven't started). The iterable items are the refs/cvalues defined by that row (which will only be empty when we haven't started).
Builds a bitset with a boolean value for each row.
Builds a bitset with a boolean value for each row. This value for a row will be true if at least one column is defined for that row and false otherwise.
Builds a bitset for each column we were given.
Builds a bitset for each column we were given. Each bitset contains (end-start) boolean values.
This class works for the indexed rank case (where we are not worried about row uniqueness). It is much faster than the traits based on UniqueRankScanner.