32     fDStates            = new UVector(status);  in RBBITableBuilder()
354         UVector *LastPosOfLeftChild = n->fLeftChild->fLastPosSet;  in calcFollowPos()
387     UVector         endMarkerNodes(*fStatus);  in calcChainedFollowPos()
388     UVector         leafNodes(*fStatus);  in calcChainedFollowPos()
412     UVector *matchStartNodes = userRuleRoot->fFirstPosSet;  in calcChainedFollowPos()
514     UVector *matchStartNodes = fTree->fLeftChild->fRightChild->fFirstPosSet;  in bofFixup()
559     failState->fPositions = new UVector(*fStatus);  in buildStateTable()
580     initialState->fPositions = new UVector(*fStatus);  in buildStateTable()
618             UVector    *U = NULL;  in buildStateTable()
625                         U = new UVector(*fStatus);  in buildStateTable()
698     UVector     endMarkerNodes(*fStatus);  in flagAcceptingStates()
760     UVector     lookAheadNodes(*fStatus);  in flagLookAheadStates()
793     UVector     tagNodes(*fStatus);  in flagTaggedStates()
853         UVector *thisStatesTagValues = sd->fTagVals;  in mergeRuleStatusVals()
921 void RBBITableBuilder::sortedAdd(UVector **vector, int32_t val) {  in sortedAdd()
925         *vector = new UVector(*fStatus);  in sortedAdd()
930     UVector *vec = *vector;  in sortedAdd()
954 void RBBITableBuilder::setAdd(UVector *dest, UVector *source) {  in setAdd()
1019 UBool RBBITableBuilder::setEquals(UVector *a, UVector *b) {  in setEquals()
1141 void RBBITableBuilder::printSet(UVector *s) {  in printSet()
1199     UVector  *tbl = fRB->fRuleStatusVals;  in printRuleStatusTable()
1234     fDtran     = new UVector(lastInputSymbol+1, *fStatus);  in RBBIStateDescriptor()