Searched refs:fFirstPosSet (Results 1 – 7 of 7) sorted by relevance
264 n.fFirstPosSet.add(n); in calcFirstPos()275 n.fFirstPosSet.addAll(n.fLeftChild.fFirstPosSet); in calcFirstPos()276 n.fFirstPosSet.addAll(n.fRightChild.fFirstPosSet); in calcFirstPos()279 n.fFirstPosSet.addAll(n.fLeftChild.fFirstPosSet); in calcFirstPos()281 n.fFirstPosSet.addAll(n.fRightChild.fFirstPosSet); in calcFirstPos()287 n.fFirstPosSet.addAll(n.fLeftChild.fFirstPosSet); in calcFirstPos()354 i.fFollowPos.addAll(n.fRightChild.fFirstPosSet); in calcFollowPos()362 i.fFollowPos.addAll(n.fFirstPosSet); in calcFollowPos()414 matchStartNodes.addAll(node.fFirstPosSet); in calcChainedFollowPos()507 … Set<RBBINode> matchStartNodes = fRB.fTreeRoots[fRootIx].fLeftChild.fRightChild.fFirstPosSet; in bofFixup()[all …]
101 Set<RBBINode> fFirstPosSet; // See Aho DFA table generation algorithm field in RBBINode113 fFirstPosSet = new HashSet<RBBINode>(); in RBBINode()141 fFirstPosSet = new HashSet<RBBINode>(other.fFirstPosSet);
265 n.fFirstPosSet.add(n); in calcFirstPos()276 n.fFirstPosSet.addAll(n.fLeftChild.fFirstPosSet); in calcFirstPos()277 n.fFirstPosSet.addAll(n.fRightChild.fFirstPosSet); in calcFirstPos()280 n.fFirstPosSet.addAll(n.fLeftChild.fFirstPosSet); in calcFirstPos()282 n.fFirstPosSet.addAll(n.fRightChild.fFirstPosSet); in calcFirstPos()288 n.fFirstPosSet.addAll(n.fLeftChild.fFirstPosSet); in calcFirstPos()355 i.fFollowPos.addAll(n.fRightChild.fFirstPosSet); in calcFollowPos()363 i.fFollowPos.addAll(n.fFirstPosSet); in calcFollowPos()415 matchStartNodes.addAll(node.fFirstPosSet); in calcChainedFollowPos()508 … Set<RBBINode> matchStartNodes = fRB.fTreeRoots[fRootIx].fLeftChild.fRightChild.fFirstPosSet; in bofFixup()[all …]
102 Set<RBBINode> fFirstPosSet; // See Aho DFA table generation algorithm field in RBBINode114 fFirstPosSet = new HashSet<RBBINode>(); in RBBINode()142 fFirstPosSet = new HashSet<RBBINode>(other.fFirstPosSet);
259 n->fFirstPosSet->addElement(n, *fStatus); in calcFirstPos()270 setAdd(n->fFirstPosSet, n->fLeftChild->fFirstPosSet); in calcFirstPos()271 setAdd(n->fFirstPosSet, n->fRightChild->fFirstPosSet); in calcFirstPos()274 setAdd(n->fFirstPosSet, n->fLeftChild->fFirstPosSet); in calcFirstPos()276 setAdd(n->fFirstPosSet, n->fRightChild->fFirstPosSet); in calcFirstPos()282 setAdd(n->fFirstPosSet, n->fLeftChild->fFirstPosSet); in calcFirstPos()358 setAdd(i->fFollowPos, n->fRightChild->fFirstPosSet); in calcFollowPos()370 setAdd(i->fFollowPos, n->fFirstPosSet); in calcFollowPos()434 setAdd(&matchStartNodes, node->fFirstPosSet); in calcChainedFollowPos()538 UVector *matchStartNodes = fTree->fLeftChild->fRightChild->fFirstPosSet; in bofFixup()[all …]
69 fFirstPosSet = new UVector(status); // TODO - get a real status from somewhere in RBBINode()98 fFirstPosSet = new UVector(status); // TODO - get a real status from somewhere in RBBINode()133 delete fFirstPosSet; in ~RBBINode()
89 UVector *fFirstPosSet; variable