Searched defs:len1 (Results 1 - 3 of 3) sorted by relevance
/dalvik/libcore/luni/src/main/java/java/util/ |
H A D | ComparableTimSort.java | 406 int len1 = runLen[i]; 409 if (DEBUG) assert len1 > 0 && len2 > 0; 410 if (DEBUG) assert base1 + len1 == base2; 417 runLen[i] = len1 + len2; 428 int k = gallopRight((Comparable<Object>) a[base2], a, base1, len1, 0); 431 len1 -= k; 432 if (len1 == 0) 439 len2 = gallopLeft((Comparable<Object>) a[base1 + len1 - 1], a, 445 // Merge remaining runs, using tmp array with min(len1, len2) elements 446 if (len1 < 614 mergeLo(int base1, int len1, int base2, int len2) argument 731 mergeHi(int base1, int len1, int base2, int len2) argument [all...] |
H A D | TimSort.java | 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 < 646 mergeLo(int base1, int len1, int base2, int len2) argument 763 mergeHi(int base1, int len1, int base2, int len2) argument [all...] |
/dalvik/vm/ |
H A D | UtfString.c | 499 int len1, len2, offset1, offset2; local 504 len1 = dvmGetFieldInt((Object*) strObj1, STRING_FIELDOFF_COUNT); 508 if (len1 != len2) 509 return len1 - len2; 517 assert(offset1 + len1 <= (int) chars1->length); 522 len1 * sizeof(u2));
|
Completed in 221 milliseconds