Flatten the weighted shuffling in the random sorter.

Due to the presence of hierarchical weights, the random sorter currently shuffles level-by-level. We should be able to shuffle all the active leaves only once by calculating (and caching) active leaves' relative weights. This should improve the performance in the presence of hierarchical roles.