Lines Matching refs:runLen
110 private final int[] runLen; field in ComparableTimSort
156 runLen = new int[stackLen]; in ComparableTimSort()
202 int runLen = countRunAndMakeAscending(a, lo, hi); in sort() local
205 if (runLen < minRun) { in sort()
207 binarySort(a, lo, lo + force, lo + runLen); in sort()
208 runLen = force; in sort()
212 ts.pushRun(lo, runLen); in sort()
216 lo += runLen; in sort()
217 nRemaining -= runLen; in sort()
381 private void pushRun(int runBase, int runLen) {
383 this.runLen[stackSize] = runLen;
406 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1] ||
407 n > 1 && runLen[n-2] <= runLen[n] + runLen[n-1]) {
408 if (runLen[n - 1] < runLen[n + 1])
410 } else if (n < 0 || runLen[n] > runLen[n + 1]) {
424 if (n > 0 && runLen[n - 1] < runLen[n + 1]) in mergeForceCollapse()
444 int len1 = runLen[i]; in mergeAt()
446 int len2 = runLen[i + 1]; in mergeAt()
455 runLen[i] = len1 + len2; in mergeAt()
458 runLen[i + 1] = runLen[i + 2]; in mergeAt()