/** * 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; }
private void relax(int nodeId) { IntHashSet connected = new IntHashSet(); int w; do { w = stack.pop(); onStack.clear(w); connected.add(w); } while (w != nodeId); processSCC(nodeId, connected); }
private void relax(int nodeId) { IntHashSet connected = new IntHashSet(); int w; do { w = stack.pop(); onStack.clear(w); connected.add(w); } while (w != nodeId); processSCC(nodeId, connected); }
private void reset() { visited.clear(); queue.clear(); costs.clear(); path.clear(); finalPath.clear(); totalCost = NO_PATH_FOUND; }
private void reset() { visited.clear(); queue.clear(); costs.clear(); path.clear(); finalPath.clear(); totalCost = NO_PATH_FOUND; }
public boolean isArcPresent(int clusterA, int clusterB) { temp.clear(); int size; BitSet setA = clusterDocuments[clusterA]; BitSet setB = clusterDocuments[clusterB]; // Suitable for flat clustering // A small subgroup contained within a bigger group // will give small overlap ratio. Big ratios will // be produced only for balanced group sizes. if (setA.cardinality() < setB.cardinality()) { // addAll == or // reiatinAll == and | intersect temp.or(setA); temp.intersect(setB); size = (int) setB.cardinality(); } else { temp.or(setB); temp.intersect(setA); size = (int) setA.cardinality(); } return temp.cardinality() / (double) size >= clusterMergingThreshold; } }, true);
queue.clear(); path.clear(); visited.clear(); costs.put(source, 0.0); queue.add(source, 0.0);
queue.clear(); path.clear(); visited.clear(); costs.put(source, 0.0); queue.add(source, 0.0);
child.clear(); edges.push(stree.getStartIndex(edge), stree.getEndIndex(edge)); countDocs(level + 1, childState);