/guava/android/guava/src/com/google/common/math/Quantiles.java
swap( array, partitionPoint, i) ;swap( array, from, partitionPoint) ;
swap ( array, from, partitionPoint ) ;
for (int i = to; i > from; i--) { if (array[i] > pivot) { swap(array, partitionPoint, i); partitionPoint--; } } <extra_id_0> return partitionPoint; } private static void movePivotToStartOfSlice(double[] array, int from, int to) { int mid = (from + to) >>> 1; boolean toLessThanMid = (array[to] < array[mid]); boolean midLessThanFrom = (array[mid] < array[from]);