Searched defs:base1 (Results 1 - 2 of 2) sorted by last modified time
/libcore/luni/src/main/java/java/util/ |
H A D | ComparableTimSort.java | 405 int base1 = runBase[i]; 410 if (DEBUG) assert base1 + len1 == base2; 428 int k = gallopRight((Comparable<Object>) a[base2], a, base1, len1, 0); 430 base1 += k; 439 len2 = gallopLeft((Comparable<Object>) a[base1 + len1 - 1], a, 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 601 * (a[base1 + len1-1]) must be greater than all elements of the second run. 607 * @param base1 inde 614 mergeLo(int base1, int len1, int base2, int len2) argument 731 mergeHi(int base1, int len1, int base2, int len2) argument [all...] |
H A D | TimSort.java | 438 int base1 = runBase[i]; 443 if (DEBUG) assert base1 + len1 == base2; 461 int k = gallopRight(a[base2], a, base1, len1, 0, c); 463 base1 += k; 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 634 * (a[base1 + len1-1]) must be greater than all elements of the second run. 640 * @param base1 inde 646 mergeLo(int base1, int len1, int base2, int len2) argument 763 mergeHi(int base1, int len1, int base2, int len2) argument [all...] |
Completed in 28 milliseconds