Searched refs:endMarkerNodes (Results 1 – 3 of 3) sorted by relevance
395 List<RBBINode> endMarkerNodes = new ArrayList<RBBINode>(); in calcChainedFollowPos() local399 tree.findNodes(endMarkerNodes, RBBINode.endMark); in calcChainedFollowPos()425 for (RBBINode endMarkerNode : endMarkerNodes) { in calcChainedFollowPos()625 List<RBBINode> endMarkerNodes = new ArrayList<RBBINode>(); in flagAcceptingStates() local630 fRB.fTreeRoots[fRootIx].findNodes(endMarkerNodes, RBBINode.endMark); in flagAcceptingStates()632 for (i=0; i<endMarkerNodes.size(); i++) { in flagAcceptingStates()633 endMarker = endMarkerNodes.get(i); in flagAcceptingStates()
396 List<RBBINode> endMarkerNodes = new ArrayList<RBBINode>(); in calcChainedFollowPos() local400 tree.findNodes(endMarkerNodes, RBBINode.endMark); in calcChainedFollowPos()426 for (RBBINode endMarkerNode : endMarkerNodes) { in calcChainedFollowPos()626 List<RBBINode> endMarkerNodes = new ArrayList<RBBINode>(); in flagAcceptingStates() local631 fRB.fTreeRoots[fRootIx].findNodes(endMarkerNodes, RBBINode.endMark); in flagAcceptingStates()633 for (i=0; i<endMarkerNodes.size(); i++) { in flagAcceptingStates()634 endMarker = endMarkerNodes.get(i); in flagAcceptingStates()
406 UVector endMarkerNodes(*fStatus); in calcChainedFollowPos() local415 tree->findNodes(&endMarkerNodes, RBBINode::endMark, *fStatus); in calcChainedFollowPos()450 for (i=0; i<endMarkerNodes.size(); i++) { in calcChainedFollowPos()451 if (tNode->fFollowPos->contains(endMarkerNodes.elementAt(i))) { in calcChainedFollowPos()722 UVector endMarkerNodes(*fStatus); in flagAcceptingStates() local731 fTree->findNodes(&endMarkerNodes, RBBINode::endMark, *fStatus); in flagAcceptingStates()736 for (i=0; i<endMarkerNodes.size(); i++) { in flagAcceptingStates()737 endMarker = (RBBINode *)endMarkerNodes.elementAt(i); in flagAcceptingStates()