Cross Reference: /dalvik/libcore/luni/src/main/java/java/util/TimSort.java

Lines Matching defs:len1
439         int len1 = runLen[i];
442         if (DEBUG) assert len1 > 0 && len2 > 0;
443         if (DEBUG) assert base1 + len1 == base2;
450         runLen[i] = len1 + len2;
461         int k = gallopRight(a[base2], a, base1, len1, 0, c);
464         len1 -= k;
465         if (len1 == 0)
472         len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c);
477         // Merge remaining runs, using tmp array with min(len1, len2) elements
478         if (len1 <= len2)
479             mergeLo(base1, len1, base2, len2);
481             mergeHi(base1, len1, base2, len2);
634      * (a[base1 + len1-1]) must be greater than all elements of the second run.
636      * For performance, this method should be called only when len1 <= len2;
637      * its twin, mergeHi should be called if len1 >= len2.  (Either method
638      * may be called if len1 == len2.)
641      * @param len1  length of first run to be merged (must be > 0)
646     private void mergeLo(int base1, int len1, int base2, int len2) {
647         if (DEBUG) assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
651         T[] tmp = ensureCapacity(len1);
652         System.arraycopy(a, base1, tmp, 0, len1);
661             System.arraycopy(tmp, cursor1, a, dest, len1);
664         if (len1 == 1) {
682                 if (DEBUG) assert len1 > 1 && len2 > 0;
693                     if (--len1 == 1)
704                 if (DEBUG) assert len1 > 1 && len2 > 0;
705                 count1 = gallopRight(a[cursor2], tmp, cursor1, len1, 0, c);
710                     len1 -= count1;
711                     if (len1 <= 1) // len1 == 1 || len1 == 0
728                 if (--len1 == 1)
738         if (len1 == 1) {
742         } else if (len1 == 0) {
747             if (DEBUG) assert len1 > 1;
748             System.arraycopy(tmp, cursor1, a, dest, len1);
754      * len1 >= len2; mergeLo should be called if len1 <= len2.  (Either method
755      * may be called if len1 == len2.)
758      * @param len1  length of first run to be merged (must be > 0)
763     private void mergeHi(int base1, int len1, int base2, int len2) {
764         if (DEBUG) assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
771         int cursor1 = base1 + len1 - 1;  // Indexes into a
777         if (--len1 == 0) {
782             dest -= len1;
783             cursor1 -= len1;
784             System.arraycopy(a, cursor1 + 1, a, dest + 1, len1);
801                 if (DEBUG) assert len1 > 0 && len2 > 1;
806                     if (--len1 == 0)
823                 if (DEBUG) assert len1 > 0 && len2 > 1;
824                 count1 = len1 - gallopRight(tmp[cursor2], a, base1, len1, len1 - 1, c);
828                     len1 -= count1;
830                     if (len1 == 0)
847                 if (--len1 == 0)
858             if (DEBUG) assert len1 > 0;
859             dest -= len1;
860             cursor1 -= len1;
861             System.arraycopy(a, cursor1 + 1, a, dest + 1, len1);
867             if (DEBUG) assert len1 == 0;