184         blockCount= numVertex - startId - 1;  in CloseScope()
202         blockCount= numVertex - startId - 1;  in CloseScope()
220         blockCount= numVertex - startId;  in CloseScope()
226         blockCount= numVertex - startId;  in CloseScope()
312             CopyFastArcs (subList[ruleId], 0, subList[ruleId]->numArc, numVertex,  in ExpandRules()
337         numVertex= maxVertId;  in UpdateVertexCount()
338     else if (numVertex < maxVertId)  in UpdateVertexCount()
339         numVertex= maxVertId;  in UpdateVertexCount()
376     int *nodeList= new int [numVertex];  in RemoveRuleStarts()
377     int *visitList= new int [numVertex];  in RemoveRuleStarts()
378     for (int ii= 0; ii < numVertex; ii++)  in RemoveRuleStarts()
382     ProcessBegins (startPoint, endPoint, BEGINRULE_LABEL, nodeList, 0, visitList, numVertex);  in RemoveRuleStarts()
397     int *nodeList= new int [numVertex];  in RemoveRuleEnds()
398     int *visitList= new int [numVertex];  in RemoveRuleEnds()
399     for (int ii= 0; ii < numVertex; ii++)  in RemoveRuleEnds()
403     ProcessEnds (endPoint, startPoint, ENDRULE_LABEL, nodeList, 0, visitList, numVertex);  in RemoveRuleEnds()
418     int *nodeList= new int [numVertex];  in RemoveNulls()
419     int *visitList= new int [numVertex];  in RemoveNulls()
420     for (int ii= 0; ii < numVertex; ii++)  in RemoveNulls()
424     ProcessBegins (startPoint, endPoint, NONE_LABEL, nodeList, 0, visitList, numVertex);  in RemoveNulls()
455     int *nodeList= new int [numVertex];  in RemoveForwardConnections()
456     int *visitList= new int [numVertex];  in RemoveForwardConnections()
457     for (int ii= 0; ii < numVertex; ii++)  in RemoveForwardConnections()
461     ProcessBegins (startPoint, endPoint, BEGINSCOPE_LABEL, nodeList, 0, visitList, numVertex);  in RemoveForwardConnections()
527     int *nodeList= new int [numVertex];  in RemoveBackwardConnections()
528     int *visitList= new int [numVertex];  in RemoveBackwardConnections()
529     for (int ii= 0; ii < numVertex; ii++)  in RemoveBackwardConnections()
533     ProcessEnds (endPoint, startPoint, ENDSCOPE_LABEL, nodeList, 0, visitList, numVertex);  in RemoveBackwardConnections()
638     depthMap= new int [numVertex];  in ReduceArcsByEquivalence()
639     for (ii= 0; ii < numVertex; ii++)  in ReduceArcsByEquivalence()
644     for (ii= 0; ii < numVertex; ii++)  in ReduceArcsByEquivalence()
649     equivMap= new int [numVertex];  in ReduceArcsByEquivalence()
650     for (ii= 0; ii < numVertex; ii++)  in ReduceArcsByEquivalence()
684         for (ii= 0; ii < numVertex; ii++) {  in DeterminizeArcs()
743                 arc[ii]->AssignToId (numVertex);  in ReverseGraphForOutput()
748 …(void) CreateArc (TERMINAL_LABEL, NONE_LABEL, numVertex, TERMINAL_LABEL);  //  Add terminal transi…  in ReverseGraphForOutput()
749     numVertex++;  in ReverseGraphForOutput()
763     int *nodeList= new int [numVertex];  in RemoveTagConnections()
764     int *visitList= new int [numVertex];  in RemoveTagConnections()
765     for (int ii= 0; ii < numVertex; ii++)  in RemoveTagConnections()
769     ProcessTags (endPoint, startPoint, nodeList, 0, visitList, numVertex);  in RemoveTagConnections()