Searched defs:base2 (Results 1 - 2 of 2) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
H A DComparableTimSort.java437 int base2 = runBase[i + 1];
440 assert base1 + len1 == base2;
458 int k = gallopRight((Comparable<Object>) a[base2], a, base1, len1, 0);
470 base2, len2, len2 - 1);
477 mergeLo(base1, len1, base2, len2);
479 mergeHi(base1, len1, base2, len2);
630 * second run (a[base1] > a[base2]), and the last element of the first run
639 * @param base2 index of first element in second run to be merged
644 private void mergeLo(int base1, int len1, int base2, int len2) { argument
645 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
761 mergeHi(int base1, int len1, int base2, int len2) argument
[all...]
H A DTimSort.java471 int base2 = runBase[i + 1];
474 assert base1 + len1 == base2;
492 int k = gallopRight(a[base2], a, base1, len1, 0, c);
503 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c);
510 mergeLo(base1, len1, base2, len2);
512 mergeHi(base1, len1, base2, len2);
664 * second run (a[base1] > a[base2]), and the last element of the first run
673 * @param base2 index of first element in second run to be merged
677 private void mergeLo(int base1, int len1, int base2, int len2) { argument
678 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
793 mergeHi(int base1, int len1, int base2, int len2) argument
[all...]

Completed in 24 milliseconds