Searched defs:len1 (Results 1 - 3 of 3) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
H A DComparableTimSort.java440 int len1 = runLen[i];
443 assert len1 > 0 && len2 > 0;
444 assert base1 + len1 == base2;
451 runLen[i] = len1 + len2;
462 int k = gallopRight((Comparable<Object>) a[base2], a, base1, len1, 0);
465 len1 -= k;
466 if (len1 == 0)
473 len2 = gallopLeft((Comparable<Object>) a[base1 + len1 - 1], a,
479 // Merge remaining runs, using tmp array with min(len1, len2) elements
480 if (len1 <
648 mergeLo(int base1, int len1, int base2, int len2) argument
765 mergeHi(int base1, int len1, int base2, int len2) argument
[all...]
H A DTimSort.java474 int len1 = runLen[i];
477 assert len1 > 0 && len2 > 0;
478 assert base1 + len1 == base2;
485 runLen[i] = len1 + len2;
496 int k = gallopRight(a[base2], a, base1, len1, 0, c);
499 len1 -= k;
500 if (len1 == 0)
507 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c);
512 // Merge remaining runs, using tmp array with min(len1, len2) elements
513 if (len1 <
681 mergeLo(int base1, int len1, int base2, int len2) argument
797 mergeHi(int base1, int len1, int base2, int len2) argument
[all...]
/libcore/ojluni/src/main/native/
H A Dzip_util.c1166 jboolean equals(char* name1, int len1, char* name2, int len2) { argument
1167 if (len1 != len2) {
1170 while (len1-- > 0) {

Completed in 38 milliseconds