Tabnine Logo
TimSorter.save
Code IndexAdd Tabnine to your IDE (free)

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

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

origin: org.apache.lucene/lucene-core

@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);
 }
}
origin: org.apache.lucene/lucene-core

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;
}
origin: org.apache.lucene/lucene-core

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;
}
origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.lucene

@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);
 }
}
origin: org.infinispan/infinispan-embedded-query

@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);
 }
}
origin: harbby/presto-connectors

@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);
 }
}
origin: org.infinispan/infinispan-embedded-query

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;
}
origin: org.infinispan/infinispan-embedded-query

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;
}
origin: harbby/presto-connectors

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;
}
origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.lucene

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;
}
origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.lucene

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;
}
origin: harbby/presto-connectors

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;
}
org.apache.lucene.utilTimSortersave

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
  • merge,
  • mergeAt,
  • mergeHi,
  • mergeInPlace,
  • mergeLo,
  • minRun,
  • nextRun,
  • pushRunLen,
  • reset,
  • restore

Popular in Java

  • Making http requests using okhttp
  • orElseThrow (Optional)
    Return the contained value, if present, otherwise throw an exception to be created by the provided s
  • getExternalFilesDir (Context)
  • setRequestProperty (URLConnection)
  • Pointer (com.sun.jna)
    An abstraction for a native pointer data type. A Pointer instance represents, on the Java side, a na
  • Graphics2D (java.awt)
    This Graphics2D class extends the Graphics class to provide more sophisticated control overgraphics
  • Timestamp (java.sql)
    A Java representation of the SQL TIMESTAMP type. It provides the capability of representing the SQL
  • Properties (java.util)
    A Properties object is a Hashtable where the keys and values must be Strings. Each property can have
  • Stack (java.util)
    Stack is a Last-In/First-Out(LIFO) data structure which represents a stack of objects. It enables u
  • BoxLayout (javax.swing)
  • CodeWhisperer alternatives
Tabnine Logo
  • Products

    Search for Java codeSearch for JavaScript code
  • IDE Plugins

    IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
  • Company

    About UsContact UsCareers
  • Resources

    FAQBlogTabnine AcademyTerms of usePrivacy policyJava Code IndexJavascript Code Index
Get Tabnine for your IDE now