• Home
  • Raw
  • Download

Lines Matching refs:numArc

45     numArc= 0;  in SubGraph()
46 CopyFastArcs (baseG, 0, baseG->numArc, 0, -1, -1, -1, -1); in SubGraph()
59 if (numArc == 0) { in AllocateSpaceForArc()
62 if (numArc%BLKSIZE == 0) { in AllocateSpaceForArc()
63 NUANArc **new_arc= new NUANArc * [numArc+BLKSIZE]; in AllocateSpaceForArc()
64 for (int ii= 0; ii < numArc; ii++) in AllocateSpaceForArc()
76 arc[numArc]= arc_one; in CreateArc()
77 numArc++; in CreateArc()
86 arc[numArc]= arc_one; in InheritArc()
87 numArc++; in InheritArc()
96 arc[numArc]= arc_one; in InheritReverseArc()
97 numArc++; in InheritReverseArc()
107 arc[numArc]= arc_one; in InheritReverseArcWithTag()
108 numArc++; in InheritReverseArcWithTag()
117 arc[numArc]= arc_one; in CreateCopyWithOutput()
118 numArc++; in CreateCopyWithOutput()
127 if (numArc%BLKSIZE == 0) { in CopyFastArcs()
128 NUANArc **new_arc= new NUANArc * [numArc+BLKSIZE]; in CopyFastArcs()
129 for (int ii= 0; ii < numArc; ii++) in CopyFastArcs()
135 arc[numArc]= arc_one; in CopyFastArcs()
136 numArc++; in CopyFastArcs()
146 for (int ii= 0; ii < numArc; ii++) { in Print()
159 for (int ii= 0; ii < numArc; ii++) { in PrintText()
169 for (int ii= 0; ii < numArc; ii++) in ReverseDepthOnTerminal()
186 while (rix < numArc && arc[backwardList[rix]]->GetToId() == startId) { in ReverseDepthData()
207 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == startId) { in ForwardDepthData()
250 for (ii= 0; ii < numArc; ii++) { in RemoveMarkedNodes()
264 for (ii= currId; ii < numArc; ii++) in RemoveMarkedNodes()
266 numArc= currId; in RemoveMarkedNodes()
275 for (ii= 0; ii < numArc; ii++) { in RemoveDiscardedArcs()
285 for (ii= currId; ii < numArc; ii++) in RemoveDiscardedArcs()
287 numArc= currId; in RemoveDiscardedArcs()
295 for (ii= 0; ii < numArc; ii++) { in MapGraphVertices()
326 for (int ii= 0; ii < numArc; ii++) { in ClearLabelledConnections()
335 for (int ii= 0; ii < numArc; ii++) { in ClearRuleIds()
344 for (int ii= 0; ii < numArc; ii++) in ClearOutputs()