/** Compute the length of the next run, make the run sorted and return its * length. */ int nextRun() { final int runBase = runEnd(0); assert runBase < to; if (runBase == to - 1) { return 1; } int o = runBase + 2; if (compare(runBase, runBase+1) > 0) { // run must be strictly descending while (o < to && compare(o - 1, o) > 0) { ++o; } reverse(runBase, o); } else { // run must be non-descending while (o < to && compare(o - 1, o) <= 0) { ++o; } } final int runHi = Math.max(o, Math.min(to, runBase + minRun)); binarySort(runBase, runHi, o); return runHi - runBase; }
@Override public void sort(int from, int to) { checkRange(from, to); if (to - from <= 1) { return; } reset(from, to); do { ensureInvariants(); pushRunLen(nextRun()); } while (runEnd(0) < to); exhaustStack(); assert runEnd(0) == to; }
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; }
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 merge(int lo, int mid, int hi) { if (compare(mid - 1, mid) <= 0) { return; } lo = upper2(lo, mid, mid); hi = lower2(mid, hi, mid - 1); if (hi - mid <= mid - lo && hi - mid <= maxTempSlots) { mergeHi(lo, mid, hi); } else if (mid - lo <= maxTempSlots) { mergeLo(lo, mid, hi); } else { mergeInPlace(lo, mid, hi); } }
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; }
@Override void doRotate(int lo, int mid, int hi) { final int len1 = mid - lo; final int len2 = hi - mid; if (len1 == len2) { while (mid < hi) { swap(lo++, mid++); } } else if (len2 < len1 && len2 <= maxTempSlots) { save(mid, len2); for (int i = lo + len1 - 1, j = hi - 1; i >= lo; --i, --j) { copy(i, j); } for (int i = 0, j = lo; i < len2; ++i, ++j) { restore(i, j); } } else if (len1 <= maxTempSlots) { save(lo, len1); for (int i = mid, j = lo; i < hi; ++i, ++j) { copy(i, j); } for (int i = 0, j = lo + len2; j < hi; ++i, ++j) { restore(i, j); } } else { reverse(lo, mid); reverse(mid, hi); reverse(lo, hi); } }
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; }
void merge(int lo, int mid, int hi) { if (compare(mid - 1, mid) <= 0) { return; } lo = upper2(lo, mid, mid); hi = lower2(mid, hi, mid - 1); if (hi - mid <= mid - lo && hi - mid <= maxTempSlots) { mergeHi(lo, mid, hi); } else if (mid - lo <= maxTempSlots) { mergeLo(lo, mid, hi); } else { mergeInPlace(lo, mid, hi); } }
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; }
@Override void doRotate(int lo, int mid, int hi) { final int len1 = mid - lo; final int len2 = hi - mid; if (len1 == len2) { while (mid < hi) { swap(lo++, mid++); } } else if (len2 < len1 && len2 <= maxTempSlots) { save(mid, len2); for (int i = lo + len1 - 1, j = hi - 1; i >= lo; --i, --j) { copy(i, j); } for (int i = 0, j = lo; i < len2; ++i, ++j) { restore(i, j); } } else if (len1 <= maxTempSlots) { save(lo, len1); for (int i = mid, j = lo; i < hi; ++i, ++j) { copy(i, j); } for (int i = 0, j = lo + len2; j < hi; ++i, ++j) { restore(i, j); } } else { reverse(lo, mid); reverse(mid, hi); reverse(lo, hi); } }
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 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; }
@Override public void sort(int from, int to) { checkRange(from, to); if (to - from <= 1) { return; } reset(from, to); do { ensureInvariants(); pushRunLen(nextRun()); } while (runEnd(0) < to); exhaustStack(); assert runEnd(0) == to; }
void merge(int lo, int mid, int hi) { if (compare(mid - 1, mid) <= 0) { return; } lo = upper2(lo, mid, mid); hi = lower2(mid, hi, mid - 1); if (hi - mid <= mid - lo && hi - mid <= maxTempSlots) { mergeHi(lo, mid, hi); } else if (mid - lo <= maxTempSlots) { mergeLo(lo, mid, hi); } else { mergeInPlace(lo, mid, hi); } }
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; }
@Override void doRotate(int lo, int mid, int hi) { final int len1 = mid - lo; final int len2 = hi - mid; if (len1 == len2) { while (mid < hi) { swap(lo++, mid++); } } else if (len2 < len1 && len2 <= maxTempSlots) { save(mid, len2); for (int i = lo + len1 - 1, j = hi - 1; i >= lo; --i, --j) { copy(i, j); } for (int i = 0, j = lo; i < len2; ++i, ++j) { restore(i, j); } } else if (len1 <= maxTempSlots) { save(lo, len1); for (int i = mid, j = lo; i < hi; ++i, ++j) { copy(i, j); } for (int i = 0, j = lo + len2; j < hi; ++i, ++j) { restore(i, j); } } else { reverse(lo, mid); reverse(mid, hi); reverse(lo, hi); } }