// Calculate posting bit positions and corresponding pointers
for ( int j = 0; j < frequency; j++ ) {
bitPos[ j ] = ibs.readBits(); // Cache bit poisition
pointer[ j ] = ibs.readDelta(); // Cache pointer
if ( hasCounts ) count = ibs.readGamma() + 1;
if ( hasPositions ) ibs.skipDeltas( count ); // Skip document positions
}
// Sort stably pointers and positions by increasing pointer
it.unimi.dsi.fastutil.Arrays.quickSort( 0, frequency, new AbstractIntComparator() {
public int compare( final int i0, final int i1 ) {