Searched refs:fFirstPosSet (Results 1 – 8 of 8) sorted by relevance
276 n.fFirstPosSet.add(n); in calcFirstPos()287 n.fFirstPosSet.addAll(n.fLeftChild.fFirstPosSet); in calcFirstPos()288 n.fFirstPosSet.addAll(n.fRightChild.fFirstPosSet); in calcFirstPos()291 n.fFirstPosSet.addAll(n.fLeftChild.fFirstPosSet); in calcFirstPos()293 n.fFirstPosSet.addAll(n.fRightChild.fFirstPosSet); in calcFirstPos()299 n.fFirstPosSet.addAll(n.fLeftChild.fFirstPosSet); in calcFirstPos()366 i.fFollowPos.addAll(n.fRightChild.fFirstPosSet); in calcFollowPos()374 i.fFollowPos.addAll(n.fFirstPosSet); in calcFollowPos()422 matchStartNodes.addAll(node.fFirstPosSet); in calcChainedFollowPos()513 … 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);
277 n.fFirstPosSet.add(n); in calcFirstPos()288 n.fFirstPosSet.addAll(n.fLeftChild.fFirstPosSet); in calcFirstPos()289 n.fFirstPosSet.addAll(n.fRightChild.fFirstPosSet); in calcFirstPos()292 n.fFirstPosSet.addAll(n.fLeftChild.fFirstPosSet); in calcFirstPos()294 n.fFirstPosSet.addAll(n.fRightChild.fFirstPosSet); in calcFirstPos()300 n.fFirstPosSet.addAll(n.fLeftChild.fFirstPosSet); in calcFirstPos()367 i.fFollowPos.addAll(n.fRightChild.fFirstPosSet); in calcFollowPos()375 i.fFollowPos.addAll(n.fFirstPosSet); in calcFollowPos()423 matchStartNodes.addAll(node.fFirstPosSet); in calcChainedFollowPos()514 … 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);
264 n->fFirstPosSet->addElement(n, *fStatus); in calcFirstPos()275 setAdd(n->fFirstPosSet, n->fLeftChild->fFirstPosSet); in calcFirstPos()276 setAdd(n->fFirstPosSet, n->fRightChild->fFirstPosSet); in calcFirstPos()279 setAdd(n->fFirstPosSet, n->fLeftChild->fFirstPosSet); in calcFirstPos()281 setAdd(n->fFirstPosSet, n->fRightChild->fFirstPosSet); in calcFirstPos()287 setAdd(n->fFirstPosSet, n->fLeftChild->fFirstPosSet); in calcFirstPos()363 setAdd(i->fFollowPos, n->fRightChild->fFirstPosSet); in calcFollowPos()375 setAdd(i->fFollowPos, n->fFirstPosSet); in calcFollowPos()433 setAdd(&matchStartNodes, node->fFirstPosSet); in calcChainedFollowPos()534 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