Home
last modified time | relevance | path

Searched refs:base1 (Results 1 – 2 of 2) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
DComparableTimSort.java443 int base1 = runBase[i]; in mergeAt() local
448 assert base1 + len1 == base2; in mergeAt()
466 int k = gallopRight((Comparable<Object>) a[base2], a, base1, len1, 0); in mergeAt()
468 base1 += k; in mergeAt()
477 len2 = gallopLeft((Comparable<Object>) a[base1 + len1 - 1], a, in mergeAt()
485 mergeLo(base1, len1, base2, len2); in mergeAt()
487 mergeHi(base1, len1, base2, len2); in mergeAt()
652 private void mergeLo(int base1, int len1, int base2, int len2) {
653 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
661 int dest = base1; // Indexes int a
[all …]
DTimSort.java477 int base1 = runBase[i]; in mergeAt() local
482 assert base1 + len1 == base2; in mergeAt()
500 int k = gallopRight(a[base2], a, base1, len1, 0, c); in mergeAt()
502 base1 += k; in mergeAt()
511 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c); in mergeAt()
518 mergeLo(base1, len1, base2, len2); in mergeAt()
520 mergeHi(base1, len1, base2, len2); in mergeAt()
685 private void mergeLo(int base1, int len1, int base2, int len2) {
686 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
693 int dest = base1; // Indexes int a
[all …]