Essentially, an alternate way to collect ids when there aren't enough of them to justify setting bits in a bitset. Seems like we should sort the list of ids, then copy to a new array (while removing duplicates). A more efficient sort (hybrid MSD radix sort?) would be a bonus.
Essentially, an alternate way to collect ids when there aren't enough of them to justify setting bits in a bitset. Seems like we should sort the list of ids, then copy to a new array (while removing duplicates). A more efficient sort (hybrid MSD radix sort?) would be a bonus.