HomeSort by relevance Sort by last modified time
    Searched refs:numArc (Results 1 - 7 of 7) sorted by null

  /external/srec/tools/grxmlcompile/
sub_base.cpp 45 numArc= 0;
46 CopyFastArcs (baseG, 0, baseG->numArc, 0, -1, -1, -1, -1);
59 if (numArc == 0) {
62 if (numArc%BLKSIZE == 0) {
63 NUANArc **new_arc= new NUANArc * [numArc+BLKSIZE];
64 for (int ii= 0; ii < numArc; ii++)
76 arc[numArc]= arc_one;
77 numArc++;
86 arc[numArc]= arc_one;
87 numArc++
    [all...]
sub_supp.cpp 38 if (numArc <= 1) {
39 sortList= new int [numArc+2];
44 sortNum= numArc;
59 endIx= numArc;
64 sortList= new int [numArc+2];
65 for (ii= 0; ii < sortNum && ii < numArc; ii++)
73 hired= (numArc >> 1)+1;
78 while (jj <= numArc) {
79 if (jj < numArc && ARC_COMPARE (sortList[jj], sortList[jj+1]) <= 0 )
94 retd= numArc;
    [all...]
sub_phon.cpp 52 arcCount= numArc;
100 for (ii= 0; ii < numArc; ii++) {
116 for (ii= 0; ii < numArc; ii++) {
139 for (ii= 0; ii < numArc; ii++) {
163 arcCount= numArc;
220 count= numArc;
329 for (ii= 0; ii < numArc; ii++)
365 for (ii= 0; ii < numArc; ii++) {
380 for (ii= 0; ii < numArc; ii++) {
387 for (ii= 0; ii < numArc; ii++)
    [all...]
sub_min.cpp 55 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == currId) {
77 while (fix < numArc && arc[forwardList[fix]]->GetFromId() == firstId
80 if (fix < numArc && arc[forwardList[fix]]->GetFromId() == firstId)
85 while (six < numArc && arc[forwardList[six]]->GetFromId() == secondId
88 if (six < numArc && arc[forwardList[six]]->GetFromId() == secondId)
166 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == currId) {
336 // numLast= numArc;
362 numStart= numArc;
448 // RemoveDuplicatesAtNode (numStart, numArc);
462 for (ii= 0; ii < numArc; ii++
    [all...]
netw_dump.cpp 36 for (int ii= 0; ii < numArc; ii++) {
58 for (int ii= 0; ii < numArc; ii++) {
115 for ( int ii= 0; ii < numArc; ii++ ) {
204 for (int ii= 0; ii < numArc; ii++) {
278 for (int ii= 0; ii < numArc; ii++) {
346 for (int ii= 0; ii < numArc; ii++) {
sub_grph.h 113 numArc= 0;
132 for (int ii= 0; ii < numArc; ii++)
134 if (numArc >0)
214 int numArc;
sub_grph.cpp 60 opStack[popOp++]= numArc;
87 arcLoc= numArc;
183 endLoc= numArc;
201 endLoc= numArc;
297 for (int ii= 0; ii < numArc; ii++) {
311 pos= numArc;
312 CopyFastArcs (subList[ruleId], 0, subList[ruleId]->numArc, numVertex,
327 for (int ii= startLoc; ii < numArc; ii++) {
690 //printf (" Node %d, Total %d, Arcs %d\n", ii, numVertex, numArc);
731 for (ii= 0; ii < numArc; ii++)
    [all...]

Completed in 182 milliseconds