Home
last modified time | relevance | path

Searched refs:base2 (Results 1 – 3 of 3) sorted by relevance

/libcore/ojluni/src/main/java/java/util/
DComparableTimSort.java441 int base2 = runBase[i + 1]; in mergeAt() local
444 assert base1 + len1 == base2; in mergeAt() local
462 int k = gallopRight((Comparable<Object>) a[base2], a, base1, len1, 0); in mergeAt()
474 base2, len2, len2 - 1); in mergeAt()
481 mergeLo(base1, len1, base2, len2); in mergeAt()
483 mergeHi(base1, len1, base2, len2); in mergeAt()
648 private void mergeLo(int base1, int len1, int base2, int len2) {
649 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
656 int cursor2 = base2; // Indexes int a
765 private void mergeHi(int base1, int len1, int base2, int len2) {
[all …]
DTimSort.java475 int base2 = runBase[i + 1]; in mergeAt() local
478 assert base1 + len1 == base2; in mergeAt() local
496 int k = gallopRight(a[base2], a, base1, len1, 0, c); in mergeAt()
507 len2 = gallopLeft(a[base1 + len1 - 1], a, base2, len2, len2 - 1, c); in mergeAt()
514 mergeLo(base1, len1, base2, len2); in mergeAt()
516 mergeHi(base1, len1, base2, len2); in mergeAt()
681 private void mergeLo(int base1, int len1, int base2, int len2) {
682 assert len1 > 0 && len2 > 0 && base1 + len1 == base2;
688 int cursor2 = base2; // Indexes int a
797 private void mergeHi(int base1, int len1, int base2, int len2) {
[all …]
/libcore/ojluni/src/main/java/java/math/
DBigInteger.java2733 BigInteger base2 = (this.signum < 0 || this.compareTo(m1) >= 0 in modPow() local
2738 base2.oddModPow(exponent, m1)); in modPow()