Lines Matching defs:runLen
103 * runBase[i] + runLen[i] == runBase[i + 1]
110 private final int[] runLen;
156 runLen = new int[stackLen];
202 int runLen = countRunAndMakeAscending(a, lo, hi);
205 if (runLen < minRun) {
207 binarySort(a, lo, lo + force, lo + runLen);
208 runLen = force;
212 ts.pushRun(lo, runLen);
216 lo += runLen;
217 nRemaining -= runLen;
379 * @param runLen the number of elements in the run
381 private void pushRun(int runBase, int runLen) {
383 this.runLen[stackSize] = runLen;
391 * 1. runLen[i - 3] > runLen[i - 2] + runLen[i - 1]
392 * 2. runLen[i - 2] > runLen[i - 1]
401 if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1]) {
402 if (runLen[n - 1] < runLen[n + 1])
405 } else if (runLen[n] <= runLen[n + 1]) {
420 if (n > 0 && runLen[n - 1] < runLen[n + 1])
440 int len1 = runLen[i];
442 int len2 = runLen[i + 1];
451 runLen[i] = len1 + len2;
454 runLen[i + 1] = runLen[i + 2];
