Currently, IndexSetIterator::next uses a 5-bit window and two lookup-tables to iteratively search for the next set bit and then shift the window forward to prepare for the next call.

Using count_trailing_zeros this logic can be simplified and made slightly faster.