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

Lines Matching defs:len2
441         int len2 = runLen[i + 1];
442         if (DEBUG) assert len1 > 0 && len2 > 0;
450         runLen[i] = len1 + len2;
472         len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c);
473         if (DEBUG) assert len2 >= 0;
474         if (len2 == 0)
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);
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.)
644      * @param len2  length of second 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;
660         if (--len2 == 0) {
665             System.arraycopy(a, cursor2, a, dest, len2);
666             a[dest + len2] = tmp[cursor1]; // Last elt of run 1 to end of merge
682                 if (DEBUG) assert len1 > 1 && len2 > 0;
687                     if (--len2 == 0)
704                 if (DEBUG) assert len1 > 1 && len2 > 0;
715                 if (--len2 == 0)
718                 count2 = gallopLeft(tmp[cursor1], a, cursor2, len2, 0, c);
723                     len2 -= count2;
724                     if (len2 == 0)
739             if (DEBUG) assert len2 > 0;
740             System.arraycopy(a, cursor2, a, dest, len2);
741             a[dest + len2] = tmp[cursor1]; //  Last elt of run 1 to end of merge
746             if (DEBUG) assert len2 == 0;
754      * len1 >= len2; mergeLo should be called if len1 <= len2.  (Either method
755      * may be called if len1 == len2.)
761      * @param len2  length of second 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;
768         T[] tmp = ensureCapacity(len2);
769         System.arraycopy(a, base2, tmp, 0, len2);
772         int cursor2 = len2 - 1;          // Indexes into tmp array
773         int dest = base2 + len2 - 1;     // Indexes into a
778             System.arraycopy(tmp, 0, a, dest - (len2 - 1), len2);
781         if (len2 == 1) {
801                 if (DEBUG) assert len1 > 0 && len2 > 1;
812                     if (--len2 == 1)
823                 if (DEBUG) assert len1 > 0 && len2 > 1;
834                 if (--len2 == 1)
837                 count2 = len2 - gallopLeft(a[cursor1], tmp, 0, len2, len2 - 1, c);
841                     len2 -= count2;
843                     if (len2 <= 1)  // len2 == 1 || len2 == 0
857         if (len2 == 1) {
863         } else if (len2 == 0) {
868             if (DEBUG) assert len2 > 0;
869             System.arraycopy(tmp, 0, a, dest - (len2 - 1), len2);