Searched refs:base2 (Results 1 - 2 of 2) sorted by relevance
/libcore/luni/src/main/java/java/util/ |
H A D | ComparableTimSort.java | 407 int base2 = runBase[i + 1]; 410 if (DEBUG) assert base1 + len1 == base2; 428 int k = gallopRight((Comparable<Object>) a[base2], a, base1, len1, 0); 440 base2, len2, len2 - 1); 447 mergeLo(base1, len1, base2, len2); 449 mergeHi(base1, len1, base2, len2); 600 * second run (a[base1] > a[base2]), and the last element of the first run 609 * @param base2 index of first element in second run to be merged 614 private void mergeLo(int base1, int len1, int base2, int len2) { argument 615 if (DEBUG) assert len1 > 0 && len2 > 0 && base1 + len1 == base2; 731 mergeHi(int base1, int len1, int base2, int len2) argument [all...] |
H A D | TimSort.java | 440 int base2 = runBase[i + 1]; 443 if (DEBUG) assert base1 + len1 == base2; 461 int k = gallopRight(a[base2], a, base1, len1, 0, c); 472 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c); 479 mergeLo(base1, len1, base2, len2); 481 mergeHi(base1, len1, base2, len2); 633 * second run (a[base1] > a[base2]), and the last element of the first run 642 * @param base2 index of first element in second run to be merged 646 private void mergeLo(int base1, int len1, int base2, int len2) { argument 647 if (DEBUG) assert len1 > 0 && len2 > 0 && base1 + len1 == base2; 763 mergeHi(int base1, int len1, int base2, int len2) argument [all...] |
Completed in 734 milliseconds