int lowerSaved(int from, int to, int val) { int len = to - from; while (len > 0) { final int half = len >>> 1; final int mid = from + half; if (compareSaved(val, mid) > 0) { from = mid + 1; len = len - half -1; } else { len = half; } } return from; }
int upperSaved(int from, int to, int val) { int len = to - from; while (len > 0) { final int half = len >>> 1; final int mid = from + half; if (compareSaved(val, mid) < 0) { len = half; } else { from = mid + 1; len = len - half -1; } } return from; }
int lowerSaved3(int from, int to, int val) { int f = from, t = f + 1; while (t < to) { if (compareSaved(val, t) <= 0) { return lowerSaved(f, t, val); } int delta = t - f; f = t; t += delta << 1; } return lowerSaved(f, to, val); }
int upperSaved3(int from, int to, int val) { int f = to - 1, t = to; while (f > from) { if (compareSaved(val, f) >= 0) { return upperSaved(f, t, val); } final int delta = t - f; t = f; f -= delta << 1; } return upperSaved(from, t, val); }
void mergeLo(int lo, int mid, int hi) { assert compare(lo, mid) > 0; int len1 = mid - lo; save(lo, len1); copy(mid, lo); int i = 0, j = mid + 1, dest = lo + 1; outer: for (;;) { for (int count = 0; count < MIN_GALLOP; ) { if (i >= len1 || j >= hi) { break outer; } else if (compareSaved(i, j) <= 0) { restore(i++, dest++); count = 0; } else { copy(j++, dest++); ++count; } } // galloping... int next = lowerSaved3(j, hi, i); for (; j < next; ++dest) { copy(j++, dest); } restore(i++, dest++); } for (; i < len1; ++dest) { restore(i++, dest); } assert j == dest; }
void mergeHi(int lo, int mid, int hi) { assert compare(mid - 1, hi - 1) > 0; int len2 = hi - mid; save(mid, len2); copy(mid - 1, hi - 1); int i = mid - 2, j = len2 - 1, dest = hi - 2; outer: for (;;) { for (int count = 0; count < MIN_GALLOP; ) { if (i < lo || j < 0) { break outer; } else if (compareSaved(j, i) >= 0) { restore(j--, dest--); count = 0; } else { copy(i--, dest--); ++count; } } // galloping int next = upperSaved3(lo, i + 1, j); while (i >= next) { copy(i--, dest--); } restore(j--, dest--); } for (; j >= 0; --dest) { restore(j--, dest); } assert i == dest; }
int lowerSaved(int from, int to, int val) { int len = to - from; while (len > 0) { final int half = len >>> 1; final int mid = from + half; if (compareSaved(val, mid) > 0) { from = mid + 1; len = len - half -1; } else { len = half; } } return from; }
int lowerSaved(int from, int to, int val) { int len = to - from; while (len > 0) { final int half = len >>> 1; final int mid = from + half; if (compareSaved(val, mid) > 0) { from = mid + 1; len = len - half -1; } else { len = half; } } return from; }
int upperSaved(int from, int to, int val) { int len = to - from; while (len > 0) { final int half = len >>> 1; final int mid = from + half; if (compareSaved(val, mid) < 0) { len = half; } else { from = mid + 1; len = len - half -1; } } return from; }
int lowerSaved(int from, int to, int val) { int len = to - from; while (len > 0) { final int half = len >>> 1; final int mid = from + half; if (compareSaved(val, mid) > 0) { from = mid + 1; len = len - half -1; } else { len = half; } } return from; }
int upperSaved(int from, int to, int val) { int len = to - from; while (len > 0) { final int half = len >>> 1; final int mid = from + half; if (compareSaved(val, mid) < 0) { len = half; } else { from = mid + 1; len = len - half -1; } } return from; }
int upperSaved(int from, int to, int val) { int len = to - from; while (len > 0) { final int half = len >>> 1; final int mid = from + half; if (compareSaved(val, mid) < 0) { len = half; } else { from = mid + 1; len = len - half -1; } } return from; }
int lowerSaved3(int from, int to, int val) { int f = from, t = f + 1; while (t < to) { if (compareSaved(val, t) <= 0) { return lowerSaved(f, t, val); } int delta = t - f; f = t; t += delta << 1; } return lowerSaved(f, to, val); }
int lowerSaved3(int from, int to, int val) { int f = from, t = f + 1; while (t < to) { if (compareSaved(val, t) <= 0) { return lowerSaved(f, t, val); } int delta = t - f; f = t; t += delta << 1; } return lowerSaved(f, to, val); }
int upperSaved3(int from, int to, int val) { int f = to - 1, t = to; while (f > from) { if (compareSaved(val, f) >= 0) { return upperSaved(f, t, val); } final int delta = t - f; t = f; f -= delta << 1; } return upperSaved(from, t, val); }
int upperSaved3(int from, int to, int val) { int f = to - 1, t = to; while (f > from) { if (compareSaved(val, f) >= 0) { return upperSaved(f, t, val); } final int delta = t - f; t = f; f -= delta << 1; } return upperSaved(from, t, val); }
int upperSaved3(int from, int to, int val) { int f = to - 1, t = to; while (f > from) { if (compareSaved(val, f) >= 0) { return upperSaved(f, t, val); } final int delta = t - f; t = f; f -= delta << 1; } return upperSaved(from, t, val); }
int lowerSaved3(int from, int to, int val) { int f = from, t = f + 1; while (t < to) { if (compareSaved(val, t) <= 0) { return lowerSaved(f, t, val); } int delta = t - f; f = t; t += delta << 1; } return lowerSaved(f, to, val); }
void mergeHi(int lo, int mid, int hi) { assert compare(mid - 1, hi - 1) > 0; int len2 = hi - mid; save(mid, len2); copy(mid - 1, hi - 1); int i = mid - 2, j = len2 - 1, dest = hi - 2; outer: for (;;) { for (int count = 0; count < MIN_GALLOP; ) { if (i < lo || j < 0) { break outer; } else if (compareSaved(j, i) >= 0) { restore(j--, dest--); count = 0; } else { copy(i--, dest--); ++count; } } // galloping int next = upperSaved3(lo, i + 1, j); while (i >= next) { copy(i--, dest--); } restore(j--, dest--); } for (; j >= 0; --dest) { restore(j--, dest); } assert i == dest; }
void mergeLo(int lo, int mid, int hi) { assert compare(lo, mid) > 0; int len1 = mid - lo; save(lo, len1); copy(mid, lo); int i = 0, j = mid + 1, dest = lo + 1; outer: for (;;) { for (int count = 0; count < MIN_GALLOP; ) { if (i >= len1 || j >= hi) { break outer; } else if (compareSaved(i, j) <= 0) { restore(i++, dest++); count = 0; } else { copy(j++, dest++); ++count; } } // galloping... int next = lowerSaved3(j, hi, i); for (; j < next; ++dest) { copy(j++, dest); } restore(i++, dest++); } for (; i < len1; ++dest) { restore(i++, dest); } assert j == dest; }