135     private final int[] runLen;  field in TimSort
186         runLen = new int[stackLen];  in TimSort()
234             int runLen = countRunAndMakeAscending(a, lo, hi, c);  in sort()  local
237             if (runLen < minRun) {  in sort()
239                 binarySort(a, lo, lo + force, lo + runLen, c);  in sort()
240                 runLen = force;  in sort()
244             ts.pushRun(lo, runLen);  in sort()
248             lo += runLen;  in sort()
249             nRemaining -= runLen;  in sort()
416     private void pushRun(int runBase, int runLen) {
418         this.runLen[stackSize] = runLen;
436             if (n > 0 && runLen[n-1] <= runLen[n] + runLen[n+1]) {
437                 if (runLen[n - 1] < runLen[n + 1])
440             } else if (runLen[n] <= runLen[n + 1]) {
455             if (n > 0 && runLen[n - 1] < runLen[n + 1])  in mergeForceCollapse()
474         int len1 = runLen[i];  in mergeAt()
476         int len2 = runLen[i + 1];  in mergeAt()
485         runLen[i] = len1 + len2;  in mergeAt()
488             runLen[i + 1] = runLen[i + 2];  in mergeAt()