Radix sort partition boundaries

[Oren Tropp]

As I understand it, each iteration of radix sort is a partition (to more than 2 bins, depending on number of bits).
What I need are the indexes of each partition after the sweep. I know the info is somewhere in the temp data after the scan bins operation... Is there any way to get it?
I am writing a very specialized sort algorithm fused with another operation for which it would be very helpful...