Lines Matching defs:ii

40     for (int ii= 0; ii < count; ii++)
41 if (item == itemList[ii])
42 return ii;
122 int ii, jj, dd, maxDepth, count, itCnt;
125 for (ii= 0; ii < numVertex; ii++) {
126 if (maxDepth < depthMap[ii])
127 maxDepth= depthMap[ii];
134 for (ii= 0; ii < numVertex; ii++)
135 if (depthMap[ii] == dd && ii == equivMap[ii]) {
136 CheckForChangeAndResort (ii, equivMap);
137 for (jj= ii+1; jj < numVertex; jj++)
141 // printf ("Try %d %d, ", ii, jj);
142 if (EquivalenceTestForward (ii, jj, equivMap)) {
143 equivMap[jj]= ii;
144 // printf ("Merged %d %d\n", ii, jj);
347 for (int ii= 0; ii < nmatch; ii++) {
459 int ii;
462 for (ii= 0; ii < numArc; ii++)
463 if (arc[ii]->GetInput() != DISCARD_LABEL && arc[ii]->GetToId() >= 0)
464 IncNodeProperty (arc[ii]->GetToId());
476 int ii;
478 for (ii= startNo; ii < numArc; ii++)
479 if (arc[ii]->GetInput() != DISCARD_LABEL && arc[ii]->GetToId() >= 0) {
480 IncNodeProperty (arc[ii]->GetToId());
481 // std::cout << " (" << arc[ii]->GetToId() << " " << QueryNodeProperty (arc[ii]->GetToId()) << ") ";
540 int ii, failCount;
547 for (ii= 0; ii <numVertex; ii++) {
548 // std::cout << ii << " (" << vertexProp[ii] << ") ";
549 nodeCount[ii]= 0;
552 for (ii= 0; ii <numArc; ii++)
553 if (arc[ii]->GetInput() != DISCARD_LABEL && arc[ii]->GetToId() >= 0
554 && (vertexProp[arc[ii]->GetFromId()] > 0 || arc[ii]->GetFromId() == startId))
555 nodeCount[arc[ii]->GetToId()]++;
558 for (ii= 0; ii <numVertex; ii++)
559 if (vertexProp[ii] != nodeCount[ii]) {
560 // std::cout << ii << " (" << vertexProp[ii] << " " << nodeCount[ii] << ") ";