How to use

save

method

in

org.apache.lucene.util.TimSorter

@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);
 }
}

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);
 }
}

@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);
 }
}

@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);
 }
}

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;
}

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 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;
}

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;
}