public void startDocument() throws SAXException { this.text.setLength(0); this.path.setLength(0); this.pathSegments.clear(); }
public void reset() { connectedComponents.clear(); Arrays.fill(indices, -1); Arrays.fill(lowLink, -1); onStack.clear(); stack.clear(); index = 0; minSetSize = Long.MAX_VALUE; maxSetSize = 0; }
public void reset() { connectedComponents.clear(); Arrays.fill(indices, -1); Arrays.fill(lowLink, -1); onStack.clear(); stack.clear(); index = 0; minSetSize = Long.MAX_VALUE; maxSetSize = 0; }
/** * reset local state */ private void reset() { paths.clear(); stack.clear(); queue.clear(); Arrays.fill(sigma, 0); Arrays.fill(delta, 0); Arrays.fill(distance, -1); } }
/** * reset local state */ private void reset() { paths.clear(); stack.clear(); queue.clear(); Arrays.fill(sigma, 0); Arrays.fill(delta, 0); Arrays.fill(distance, -1); } }
/** * Initializes the counters for the a token image. */ private void resetForNewTokenImage(final int [] documentIndexesArray, final int [] tokenImagesOrder, final BitSet fieldIndices, IntStack wordDocuments, int i) { fieldIndices.clear(); wordDocuments.clear(); if (documentIndexesArray[tokenImagesOrder[i + 1]] >= 0) { wordDocuments.push(documentIndexesArray[tokenImagesOrder[i + 1]]); } }
private void reset() { indices.clear(); lowLink.clear(); onStack.clear(); stack.clear(); index = 0; }
private void reset() { indices.clear(); lowLink.clear(); onStack.clear(); stack.clear(); index = 0; }
/** * */ public void buildSuffixTree() { this.stateOriginDocument.clear(); final LeafStateMarker marker = new LeafStateMarker(); final ISequence seq = new IntegerSequence(input.buffer, 0, input.elementsCount); this.stree = SuffixTreeBuilder.from(seq) .withProgressCallback(marker) .withStateCallback(marker) .build(); } }
flipStack.pushStack().clear(); union(flipStack.pushStack(), futures);
flipStack.pushStack().clear(); union(flipStack.pushStack(), futures);
private boolean compute(int startNode) { clearPaths(); stack.clear(); queue.clear(); Arrays.fill(sigma, 0);
private boolean compute(int startNode) { clearPaths(); stack.clear(); queue.clear(); depth.clear();
private boolean compute(int startNode) { clearPaths(); stack.clear(); queue.clear(); depth.clear();
queue.popStack().clear(); queue.flip();
queue.popStack().clear(); queue.flip();