Lines Matching defs:partition
670 * the buffer gets full, find the median and partition around it, keeping
671 * only the lowest k elements. This requires n/k find-median-and-partition
702 // We apply the quickselect algorithm to partition about the median,
713 int pivotNewIndex = partition(buffer, left, right, pivotIndex);
740 private <E extends T> int partition(
