org.apache.lucene.util.TimSorter.save java code examples

Add the Codota plugin to your IDE and get smart completions

private void myMethod () {
 ArrayList a =new ArrayList<String>()
new ArrayList()
new ArrayList<Object>()
Smart code suggestions by Tabnine
}

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

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

Javadoc

Save all elements between slots i and i+len into the temporary storage.

Popular methods of TimSorter

binarySort
checkRange
compare
compareSaved
Compare element i from the temporary storage with elementj from the slice to sort, similarly to #com
copy
Copy data from slot src to slot dest.
ensureInvariants
exhaustStack
lower2
lowerSaved
lowerSaved3
merge
mergeAt

Popular in Java

Making http requests using okhttp
compareTo (BigDecimal)
scheduleAtFixedRate (Timer)
requestLocationUpdates (LocationManager)
Pointer (com.sun.jna)
An abstraction for a native pointer data type. A Pointer instance represents, on the Java side, a na
RandomAccessFile (java.io)
Allows reading from and writing to a file in a random-access manner. This is different from the uni-
ConnectException (java.net)
A ConnectException is thrown if a connection cannot be established to a remote host on a specific po
Set (java.util)
A Set is a data structure which does not allow duplicate elements.
Filter (javax.servlet)
A filter is an object that performs filtering tasks on either the request to a resource (a servlet o
Get (org.apache.hadoop.hbase.client)
Used to perform Get operations on a single row. To get everything for a row, instantiate a Get objec
Top 17 PhpStorm Plugins

How to use savemethodin org.apache.lucene.util.TimSorter

Best Java code snippets using org.apache.lucene.util.TimSorter.save (Showing top 12 results out of 315)

How to use
save
method
in
org.apache.lucene.util.TimSorter