Tabnine Logo
Builder$UnCompiledNode
Code IndexAdd Tabnine to your IDE (free)

How to use
Builder$UnCompiledNode
in
org.apache.lucene.util.fst

Best Java code snippets using org.apache.lucene.util.fst.Builder$UnCompiledNode (Showing top 16 results out of 315)

origin: org.apache.lucene/lucene-core

final UnCompiledNode<T>[] next = ArrayUtil.grow(frontier, input.length+1);
for(int idx=frontier.length;idx<next.length;idx++) {
 next[idx] = new UnCompiledNode<>(this, idx);
frontier[idx-1].addArc(input.ints[input.offset + idx - 1],
            frontier[idx]);
frontier[idx].inputCount++;
final UnCompiledNode<T> parentNode = frontier[idx-1];
final T lastOutput = parentNode.getLastOutput(input.ints[input.offset + idx - 1]);
assert validOutput(lastOutput);
 wordSuffix = fst.outputs.subtract(lastOutput, commonOutputPrefix);
 assert validOutput(wordSuffix);
 parentNode.setLastOutput(input.ints[input.offset + idx - 1], commonOutputPrefix);
 node.prependOutput(wordSuffix);
} else {
 commonOutputPrefix = wordSuffix = NO_OUTPUT;
frontier[prefixLenPlus1-1].setLastOutput(input.ints[input.offset + prefixLenPlus1-1], output);
origin: org.apache.lucene/lucene-core

  @SuppressWarnings({"rawtypes","unchecked"}) final UnCompiledNode<T> target =
  (UnCompiledNode<T>) node.arcs[arcIdx].target;
  target.clear();
 node.clear();
 parent.deleteLast(lastInput.intAt(idx-1), node);
} else {
  parent.replaceLast(lastInput.intAt(idx-1),
            compileNode(node, 1+lastInput.length()-idx),
            nextFinalOutput,
  parent.replaceLast(lastInput.intAt(idx-1),
            node,
            nextFinalOutput,
  frontier[idx] = new UnCompiledNode<>(this, idx);
origin: harbby/presto-connectors

System.arraycopy(frontier, 0, next, 0, frontier.length);
for(int idx=frontier.length;idx<next.length;idx++) {
 next[idx] = new UnCompiledNode<>(this, idx);
frontier[idx-1].addArc(input.ints[input.offset + idx - 1],
            frontier[idx]);
frontier[idx].inputCount++;
final UnCompiledNode<T> parentNode = frontier[idx-1];
final T lastOutput = parentNode.getLastOutput(input.ints[input.offset + idx - 1]);
assert validOutput(lastOutput);
 wordSuffix = fst.outputs.subtract(lastOutput, commonOutputPrefix);
 assert validOutput(wordSuffix);
 parentNode.setLastOutput(input.ints[input.offset + idx - 1], commonOutputPrefix);
 node.prependOutput(wordSuffix);
} else {
 commonOutputPrefix = wordSuffix = NO_OUTPUT;
frontier[prefixLenPlus1-1].setLastOutput(input.ints[input.offset + prefixLenPlus1-1], output);
origin: harbby/presto-connectors

frontier = f;
for(int idx=0;idx<frontier.length;idx++) {
 frontier[idx] = new UnCompiledNode<>(this, idx);
origin: harbby/presto-connectors

  @SuppressWarnings({"rawtypes","unchecked"}) final UnCompiledNode<T> target =
  (UnCompiledNode<T>) node.arcs[arcIdx].target;
  target.clear();
 node.clear();
 parent.deleteLast(lastInput.intAt(idx-1), node);
} else {
  parent.replaceLast(lastInput.intAt(idx-1),
            compileNode(node, 1+lastInput.length()-idx),
            nextFinalOutput,
  parent.replaceLast(lastInput.intAt(idx-1),
            node,
            nextFinalOutput,
  frontier[idx] = new UnCompiledNode<>(this, idx);
origin: org.infinispan/infinispan-embedded-query

System.arraycopy(frontier, 0, next, 0, frontier.length);
for(int idx=frontier.length;idx<next.length;idx++) {
 next[idx] = new UnCompiledNode<>(this, idx);
frontier[idx-1].addArc(input.ints[input.offset + idx - 1],
            frontier[idx]);
frontier[idx].inputCount++;
final UnCompiledNode<T> parentNode = frontier[idx-1];
final T lastOutput = parentNode.getLastOutput(input.ints[input.offset + idx - 1]);
assert validOutput(lastOutput);
 wordSuffix = fst.outputs.subtract(lastOutput, commonOutputPrefix);
 assert validOutput(wordSuffix);
 parentNode.setLastOutput(input.ints[input.offset + idx - 1], commonOutputPrefix);
 node.prependOutput(wordSuffix);
} else {
 commonOutputPrefix = wordSuffix = NO_OUTPUT;
frontier[prefixLenPlus1-1].setLastOutput(input.ints[input.offset + prefixLenPlus1-1], output);
origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.lucene

final UnCompiledNode<T>[] next = ArrayUtil.grow(frontier, input.length+1);
for(int idx=frontier.length;idx<next.length;idx++) {
 next[idx] = new UnCompiledNode<>(this, idx);
frontier[idx-1].addArc(input.ints[input.offset + idx - 1],
            frontier[idx]);
frontier[idx].inputCount++;
final UnCompiledNode<T> parentNode = frontier[idx-1];
final T lastOutput = parentNode.getLastOutput(input.ints[input.offset + idx - 1]);
assert validOutput(lastOutput);
 wordSuffix = fst.outputs.subtract(lastOutput, commonOutputPrefix);
 assert validOutput(wordSuffix);
 parentNode.setLastOutput(input.ints[input.offset + idx - 1], commonOutputPrefix);
 node.prependOutput(wordSuffix);
} else {
 commonOutputPrefix = wordSuffix = NO_OUTPUT;
frontier[prefixLenPlus1-1].setLastOutput(input.ints[input.offset + prefixLenPlus1-1], output);
origin: org.infinispan/infinispan-embedded-query

frontier = f;
for(int idx=0;idx<frontier.length;idx++) {
 frontier[idx] = new UnCompiledNode<>(this, idx);
origin: org.infinispan/infinispan-embedded-query

  @SuppressWarnings({"rawtypes","unchecked"}) final UnCompiledNode<T> target =
  (UnCompiledNode<T>) node.arcs[arcIdx].target;
  target.clear();
 node.clear();
 parent.deleteLast(lastInput.intAt(idx-1), node);
} else {
  parent.replaceLast(lastInput.intAt(idx-1),
            compileNode(node, 1+lastInput.length()-idx),
            nextFinalOutput,
  parent.replaceLast(lastInput.intAt(idx-1),
            node,
            nextFinalOutput,
  frontier[idx] = new UnCompiledNode<>(this, idx);
origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.lucene

  @SuppressWarnings({"rawtypes","unchecked"}) final UnCompiledNode<T> target =
  (UnCompiledNode<T>) node.arcs[arcIdx].target;
  target.clear();
 node.clear();
 parent.deleteLast(lastInput.intAt(idx-1), node);
} else {
  parent.replaceLast(lastInput.intAt(idx-1),
            compileNode(node, 1+lastInput.length()-idx),
            nextFinalOutput,
  parent.replaceLast(lastInput.intAt(idx-1),
            node,
            nextFinalOutput,
  frontier[idx] = new UnCompiledNode<>(this, idx);
origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.lucene

frontier = f;
for(int idx=0;idx<frontier.length;idx++) {
 frontier[idx] = new UnCompiledNode<>(this, idx);
origin: harbby/presto-connectors

private CompiledNode compileNode(UnCompiledNode<T> nodeIn, int tailLength) throws IOException {
 final long node;
 long bytesPosStart = bytes.getPosition();
 if (dedupHash != null && (doShareNonSingletonNodes || nodeIn.numArcs <= 1) && tailLength <= shareMaxTailLength) {
  if (nodeIn.numArcs == 0) {
   node = fst.addNode(this, nodeIn);
   lastFrozenNode = node;
  } else {
   node = dedupHash.add(this, nodeIn);
  }
 } else {
  node = fst.addNode(this, nodeIn);
 }
 assert node != -2;
 long bytesPosEnd = bytes.getPosition();
 if (bytesPosEnd != bytesPosStart) {
  // The FST added a new node:
  assert bytesPosEnd > bytesPosStart;
  lastFrozenNode = node;
 }
 nodeIn.clear();
 final CompiledNode fn = new CompiledNode();
 fn.node = node;
 return fn;
}
origin: org.infinispan/infinispan-embedded-query

private CompiledNode compileNode(UnCompiledNode<T> nodeIn, int tailLength) throws IOException {
 final long node;
 long bytesPosStart = bytes.getPosition();
 if (dedupHash != null && (doShareNonSingletonNodes || nodeIn.numArcs <= 1) && tailLength <= shareMaxTailLength) {
  if (nodeIn.numArcs == 0) {
   node = fst.addNode(this, nodeIn);
   lastFrozenNode = node;
  } else {
   node = dedupHash.add(this, nodeIn);
  }
 } else {
  node = fst.addNode(this, nodeIn);
 }
 assert node != -2;
 long bytesPosEnd = bytes.getPosition();
 if (bytesPosEnd != bytesPosStart) {
  // The FST added a new node:
  assert bytesPosEnd > bytesPosStart;
  lastFrozenNode = node;
 }
 nodeIn.clear();
 final CompiledNode fn = new CompiledNode();
 fn.node = node;
 return fn;
}
origin: org.apache.servicemix.bundles/org.apache.servicemix.bundles.lucene

private CompiledNode compileNode(UnCompiledNode<T> nodeIn, int tailLength) throws IOException {
 final long node;
 long bytesPosStart = bytes.getPosition();
 if (dedupHash != null && (doShareNonSingletonNodes || nodeIn.numArcs <= 1) && tailLength <= shareMaxTailLength) {
  if (nodeIn.numArcs == 0) {
   node = fst.addNode(this, nodeIn);
   lastFrozenNode = node;
  } else {
   node = dedupHash.add(this, nodeIn);
  }
 } else {
  node = fst.addNode(this, nodeIn);
 }
 assert node != -2;
 long bytesPosEnd = bytes.getPosition();
 if (bytesPosEnd != bytesPosStart) {
  // The FST added a new node:
  assert bytesPosEnd > bytesPosStart;
  lastFrozenNode = node;
 }
 nodeIn.clear();
 final CompiledNode fn = new CompiledNode();
 fn.node = node;
 return fn;
}
origin: org.apache.lucene/lucene-core

frontier = f;
for(int idx=0;idx<frontier.length;idx++) {
 frontier[idx] = new UnCompiledNode<>(this, idx);
origin: org.apache.lucene/lucene-core

private CompiledNode compileNode(UnCompiledNode<T> nodeIn, int tailLength) throws IOException {
 final long node;
 long bytesPosStart = bytes.getPosition();
 if (dedupHash != null && (doShareNonSingletonNodes || nodeIn.numArcs <= 1) && tailLength <= shareMaxTailLength) {
  if (nodeIn.numArcs == 0) {
   node = fst.addNode(this, nodeIn);
   lastFrozenNode = node;
  } else {
   node = dedupHash.add(this, nodeIn);
  }
 } else {
  node = fst.addNode(this, nodeIn);
 }
 assert node != -2;
 long bytesPosEnd = bytes.getPosition();
 if (bytesPosEnd != bytesPosStart) {
  // The FST added a new node:
  assert bytesPosEnd > bytesPosStart;
  lastFrozenNode = node;
 }
 nodeIn.clear();
 final CompiledNode fn = new CompiledNode();
 fn.node = node;
 return fn;
}
org.apache.lucene.util.fstBuilder$UnCompiledNode

Javadoc

Expert: holds a pending (seen but not yet serialized) Node.

Most used methods

  • <init>
  • addArc
  • clear
  • deleteLast
  • getLastOutput
  • prependOutput
  • replaceLast
  • setLastOutput

Popular in Java

  • Reactive rest calls using spring rest template
  • notifyDataSetChanged (ArrayAdapter)
  • getSystemService (Context)
  • getApplicationContext (Context)
  • URLEncoder (java.net)
    This class is used to encode a string using the format required by application/x-www-form-urlencoded
  • Enumeration (java.util)
    A legacy iteration interface.New code should use Iterator instead. Iterator replaces the enumeration
  • Random (java.util)
    This class provides methods that return pseudo-random values.It is dangerous to seed Random with the
  • ResourceBundle (java.util)
    ResourceBundle is an abstract class which is the superclass of classes which provide Locale-specifi
  • Logger (org.apache.log4j)
    This is the central class in the log4j package. Most logging operations, except configuration, are d
  • Table (org.hibernate.mapping)
    A relational table
  • Top 25 Plugins for Webstorm
Tabnine Logo
  • Products

    Search for Java codeSearch for JavaScript code
  • IDE Plugins

    IntelliJ IDEAWebStormVisual StudioAndroid StudioEclipseVisual Studio CodePyCharmSublime TextPhpStormVimAtomGoLandRubyMineEmacsJupyter NotebookJupyter LabRiderDataGripAppCode
  • Company

    About UsContact UsCareers
  • Resources

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