org.apache.lucene.util.fst.BytesStore.getPosition java code examples

Common ways to obtain BytesStore

private void myMethod () {
 BytesStore b =new BytesStore(blockBits)
Smart code suggestions by Tabnine
}

/** Pos must be less than the max position written so far!
 *  Ie, you cannot "grow" the file with this! */
public void truncate(long newLen) {
 assert newLen <= getPosition();
 assert newLen >= 0;
 int blockIndex = (int) (newLen >> blockBits);
 nextWrite = (int) (newLen & blockMask);
 if (nextWrite == 0) {
  blockIndex--;
  nextWrite = blockSize;
 }
 blocks.subList(blockIndex+1, blocks.size()).clear();
 if (newLen == 0) {
  current = null;
 } else {
  current = blocks.get(blockIndex);
 }
 assert newLen == getPosition();
}

assert destPos < getPosition();

void finish(long newStartNode) throws IOException {
 assert newStartNode <= bytes.getPosition();
 if (startNode != -1) {
  throw new IllegalStateException("already finished");
 }
 if (newStartNode == FINAL_END_NODE && emptyOutput != null) {
  newStartNode = 0;
 }
 startNode = newStartNode;
 bytes.finish();
 cacheRootArcs();
}

assert dest + len <= getPosition(): "dest=" + dest + " pos=" + getPosition() + " len=" + len;

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

final long startAddress = builder.bytes.getPosition();
long lastArcStart = builder.bytes.getPosition();
int maxBytesPerArc = 0;
for(int arcIdx=0;arcIdx<nodeIn.numArcs;arcIdx++) {
  builder.reusedBytesPerArc[arcIdx] = (int) (builder.bytes.getPosition() - lastArcStart);
  lastArcStart = builder.bytes.getPosition();
  maxBytesPerArc = Math.max(maxBytesPerArc, builder.reusedBytesPerArc[arcIdx]);
 long srcPos = builder.bytes.getPosition();
 long destPos = fixedArrayStart + nodeIn.numArcs*maxBytesPerArc;
 assert destPos >= srcPos;
final long thisNodeAddress = builder.bytes.getPosition()-1;

out.writeVLong(startNode);
if (bytes != null) {
 long numBytes = bytes.getPosition();
 out.writeVLong(numBytes);
 bytes.writeTo(out);

/** Pos must be less than the max position written so far!
 *  Ie, you cannot "grow" the file with this! */
public void truncate(long newLen) {
 assert newLen <= getPosition();
 assert newLen >= 0;
 int blockIndex = (int) (newLen >> blockBits);
 nextWrite = (int) (newLen & blockMask);
 if (nextWrite == 0) {
  blockIndex--;
  nextWrite = blockSize;
 }
 blocks.subList(blockIndex+1, blocks.size()).clear();
 if (newLen == 0) {
  current = null;
 } else {
  current = blocks.get(blockIndex);
 }
 assert newLen == getPosition();
}

/** Pos must be less than the max position written so far!
 *  Ie, you cannot "grow" the file with this! */
public void truncate(long newLen) {
 assert newLen <= getPosition();
 assert newLen >= 0;
 int blockIndex = (int) (newLen >> blockBits);
 nextWrite = (int) (newLen & blockMask);
 if (nextWrite == 0) {
  blockIndex--;
  nextWrite = blockSize;
 }
 blocks.subList(blockIndex+1, blocks.size()).clear();
 if (newLen == 0) {
  current = null;
 } else {
  current = blocks.get(blockIndex);
 }
 assert newLen == getPosition();
}

/** Pos must be less than the max position written so far!
 *  Ie, you cannot "grow" the file with this! */
public void truncate(long newLen) {
 assert newLen <= getPosition();
 assert newLen >= 0;
 int blockIndex = (int) (newLen >> blockBits);
 nextWrite = (int) (newLen & blockMask);
 if (nextWrite == 0) {
  blockIndex--;
  nextWrite = blockSize;
 }
 blocks.subList(blockIndex+1, blocks.size()).clear();
 if (newLen == 0) {
  current = null;
 } else {
  current = blocks.get(blockIndex);
 }
 assert newLen == getPosition();
}

assert destPos < getPosition();

assert destPos < getPosition();

assert destPos < getPosition();

void finish(long newStartNode) throws IOException {
 assert newStartNode <= bytes.getPosition();
 if (startNode != -1) {
  throw new IllegalStateException("already finished");
 }
 if (newStartNode == FINAL_END_NODE && emptyOutput != null) {
  newStartNode = 0;
 }
 startNode = newStartNode;
 bytes.finish();
 cacheRootArcs();
}

void finish(long newStartNode) throws IOException {
 assert newStartNode <= bytes.getPosition();
 if (startNode != -1) {
  throw new IllegalStateException("already finished");
 }
 if (newStartNode == FINAL_END_NODE && emptyOutput != null) {
  newStartNode = 0;
 }
 startNode = newStartNode;
 bytes.finish();
 cacheRootArcs();
}

void finish(long newStartNode) throws IOException {
 assert newStartNode <= bytes.getPosition();
 if (startNode != -1) {
  throw new IllegalStateException("already finished");
 }
 if (newStartNode == FINAL_END_NODE && emptyOutput != null) {
  newStartNode = 0;
 }
 startNode = newStartNode;
 bytes.finish();
 cacheRootArcs();
}

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

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

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

out.writeVLong(startNode);
if (bytes != null) {
 long numBytes = bytes.getPosition();
 out.writeVLong(numBytes);
 bytes.writeTo(out);

Popular methods of BytesStore

<init>
Pulls bytes from the provided IndexInput.
copyBytes
finish
getReverseReader
ramBytesUsed
reverse
Reverse from srcPos, inclusive, to destPos, inclusive.
skipBytes
writeByte
Absolute write byte; you must ensure dest is < max position written so far.
writeBytes
writeTo
Writes all of our bytes to the target DataOutput.
writeVLong
getBlockBits

Popular in Java

Reading from database using SQL prepared statement
setScale (BigDecimal)
addToBackStack (FragmentTransaction)
getSharedPreferences (Context)
BorderLayout (java.awt)
A border layout lays out a container, arranging and resizing its components to fit in five regions:
InputStreamReader (java.io)
A class for turning a byte stream into a character stream. Data read from the source input stream is
Dictionary (java.util)
Note: Do not use this class since it is obsolete. Please use the Map interface for new implementatio
JarFile (java.util.jar)
JarFile is used to read jar entries and their associated data from jar files.
JTextField (javax.swing)
Project (org.apache.tools.ant)
Central representation of an Ant project. This class defines an Ant project with all of its targets,
Sublime Text for Python

How to use getPositionmethodin org.apache.lucene.util.fst.BytesStore

Best Java code snippets using org.apache.lucene.util.fst.BytesStore.getPosition (Showing top 20 results out of 315)

How to use
getPosition
method
in
org.apache.lucene.util.fst.BytesStore