Construct this with a prefix sum table and matching elements table.
A prefix sum array where each item is its summed index, with an extra element at the end with the entire count.
The elements in the index, matching the prefix sum indices * 2, where there's 2 elements in the array for each item, packed (first has the bottom 5 bits masked out, and is the top bits, the second is a bit field representing the elements for the top bit range, in a unioned-one-hot representation).
Get a cursor that lets you iterate over the union of the sets of multiple indices.
The list of types to build a cursor out of.
The cursor for the list of types.
A set of indices each associated with a number identifier.