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

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

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

origin: org.apache.lucene/lucene-core

void mergeAt(int n) {
 assert stackSize >= 2;
 merge(runBase(n + 1), runBase(n), runEnd(n));
 for (int j = n + 1; j > 0; --j) {
  setRunEnd(j, runEnd(j-1));
 }
 --stackSize;
}
origin: org.apache.lucene/lucene-core

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

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

void mergeAt(int n) {
 assert stackSize >= 2;
 merge(runBase(n + 1), runBase(n), runEnd(n));
 for (int j = n + 1; j > 0; --j) {
  setRunEnd(j, runEnd(j-1));
 }
 --stackSize;
}
origin: harbby/presto-connectors

void mergeAt(int n) {
 assert stackSize >= 2;
 merge(runBase(n + 1), runBase(n), runEnd(n));
 for (int j = n + 1; j > 0; --j) {
  setRunEnd(j, runEnd(j-1));
 }
 --stackSize;
}
origin: org.infinispan/infinispan-embedded-query

void mergeAt(int n) {
 assert stackSize >= 2;
 merge(runBase(n + 1), runBase(n), runEnd(n));
 for (int j = n + 1; j > 0; --j) {
  setRunEnd(j, runEnd(j-1));
 }
 --stackSize;
}
origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.lucene

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

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

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

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

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

/** 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;
}
org.apache.lucene.utilTimSorterrunEnd

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

  • Start an intent from android
  • getResourceAsStream (ClassLoader)
  • findViewById (Activity)
  • scheduleAtFixedRate (ScheduledExecutorService)
  • Point (java.awt)
    A point representing a location in (x,y) coordinate space, specified in integer precision.
  • BigInteger (java.math)
    An immutable arbitrary-precision signed integer.FAST CRYPTOGRAPHY This implementation is efficient f
  • Map (java.util)
    A Map is a data structure consisting of a set of keys and values in which each key is mapped to a si
  • Properties (java.util)
    A Properties object is a Hashtable where the keys and values must be Strings. Each property can have
  • XPath (javax.xml.xpath)
    XPath provides access to the XPath evaluation environment and expressions. Evaluation of XPath Expr
  • StringUtils (org.apache.commons.lang)
    Operations on java.lang.String that arenull safe. * IsEmpty/IsBlank - checks if a String contains
  • From CI to AI: The AI layer in your organization
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