Searched refs:fFirstPosSet (Results 1 – 7 of 7) sorted by relevance
262 n.fFirstPosSet.add(n); in calcFirstPos()273 n.fFirstPosSet.addAll(n.fLeftChild.fFirstPosSet); in calcFirstPos()274 n.fFirstPosSet.addAll(n.fRightChild.fFirstPosSet); in calcFirstPos()277 n.fFirstPosSet.addAll(n.fLeftChild.fFirstPosSet); in calcFirstPos()279 n.fFirstPosSet.addAll(n.fRightChild.fFirstPosSet); in calcFirstPos()285 n.fFirstPosSet.addAll(n.fLeftChild.fFirstPosSet); in calcFirstPos()352 i.fFollowPos.addAll(n.fRightChild.fFirstPosSet); in calcFollowPos()360 i.fFollowPos.addAll(n.fFirstPosSet); in calcFollowPos()391 Set<RBBINode> matchStartNodes = userRuleRoot.fFirstPosSet; in calcChainedFollowPos()482 … Set<RBBINode> matchStartNodes = fRB.fTreeRoots[fRootIx].fLeftChild.fRightChild.fFirstPosSet; in bofFixup()[all …]
95 Set<RBBINode> fFirstPosSet; // See Aho DFA table generation algorithm field in RBBINode107 fFirstPosSet = new HashSet<RBBINode>(); in RBBINode()133 fFirstPosSet = new HashSet<RBBINode>(other.fFirstPosSet);
261 n.fFirstPosSet.add(n); in calcFirstPos()272 n.fFirstPosSet.addAll(n.fLeftChild.fFirstPosSet); in calcFirstPos()273 n.fFirstPosSet.addAll(n.fRightChild.fFirstPosSet); in calcFirstPos()276 n.fFirstPosSet.addAll(n.fLeftChild.fFirstPosSet); in calcFirstPos()278 n.fFirstPosSet.addAll(n.fRightChild.fFirstPosSet); in calcFirstPos()284 n.fFirstPosSet.addAll(n.fLeftChild.fFirstPosSet); in calcFirstPos()351 i.fFollowPos.addAll(n.fRightChild.fFirstPosSet); in calcFollowPos()359 i.fFollowPos.addAll(n.fFirstPosSet); in calcFollowPos()390 Set<RBBINode> matchStartNodes = userRuleRoot.fFirstPosSet; in calcChainedFollowPos()481 … Set<RBBINode> matchStartNodes = fRB.fTreeRoots[fRootIx].fLeftChild.fRightChild.fFirstPosSet; in bofFixup()[all …]
94 Set<RBBINode> fFirstPosSet; // See Aho DFA table generation algorithm field in RBBINode106 fFirstPosSet = new HashSet<RBBINode>(); in RBBINode()132 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()412 UVector *matchStartNodes = userRuleRoot->fFirstPosSet; in calcChainedFollowPos()514 UVector *matchStartNodes = fTree->fLeftChild->fRightChild->fFirstPosSet; in bofFixup()[all …]
63 fFirstPosSet = new UVector(status); // TODO - get a real status from somewhere in RBBINode()90 fFirstPosSet = new UVector(status); // TODO - get a real status from somewhere in RBBINode()125 delete fFirstPosSet; in ~RBBINode()
82 UVector *fFirstPosSet; variable