Lines Matching defs:src
560 * off is the offset to generate corresponding low, high in src
563 private static void mergeSort(Object[] src,
579 // Recursively sort halves of dest into src
585 mergeSort(dest, src, low, mid, -off);
586 mergeSort(dest, src, mid, high, -off);
588 // If list is already sorted, just copy from src to dest. This is an
590 if (((Comparable)src[mid-1]).compareTo(src[mid]) <= 0) {
591 System.arraycopy(src, low, dest, destLow, length);
595 // Merge sorted halves (now in src) into dest
597 if (q >= high || p < mid && ((Comparable)src[p]).compareTo(src[q])<=0)
598 dest[i] = src[p++];
600 dest[i] = src[q++];
746 * off is the offset into src corresponding to low in dest
749 private static void mergeSort(Object[] src,
763 // Recursively sort halves of dest into src
769 mergeSort(dest, src, low, mid, -off, c);
770 mergeSort(dest, src, mid, high, -off, c);
772 // If list is already sorted, just copy from src to dest. This is an
774 if (c.compare(src[mid-1], src[mid]) <= 0) {
775 System.arraycopy(src, low, dest, destLow, length);
779 // Merge sorted halves (now in src) into dest
781 if (q >= high || p < mid && c.compare(src[p], src[q]) <= 0)
782 dest[i] = src[p++];
784 dest[i] = src[q++];