Searched refs:runLen (Results 1 - 2 of 2) sorted by relevance
/libcore/ojluni/src/main/java/java/util/ |
H A D | ComparableTimSort.java | 103 * runBase[i] + runLen[i] == runBase[i + 1] 110 private final int[] runLen; field in class:ComparableTimSort 152 runLen = new int[stackLen]; 198 int runLen = countRunAndMakeAscending(a, lo, hi); 201 if (runLen < minRun) { 203 binarySort(a, lo, lo + force, lo + runLen); 204 runLen = force; 208 ts.pushRun(lo, runLen); 212 lo += runLen; 213 nRemaining -= runLen; 377 pushRun(int runBase, int runLen) argument [all...] |
H A D | TimSort.java | 128 * runBase[i] + runLen[i] == runBase[i + 1] 135 private final int[] runLen; field in class:TimSort 182 runLen = new int[stackLen]; 230 int runLen = countRunAndMakeAscending(a, lo, hi, c); 233 if (runLen < minRun) { 235 binarySort(a, lo, lo + force, lo + runLen, c); 236 runLen = force; 240 ts.pushRun(lo, runLen); 244 lo += runLen; 245 nRemaining -= runLen; 412 pushRun(int runBase, int runLen) argument [all...] |
Completed in 170 milliseconds