Lines Matching refs:rix
49 int rix;
52 rix= FindFromIndex (currId);
53 if (rix < 0)
55 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == currId) {
56 arc[forwardList[rix]]->Print();
57 rix++;
159 int rix, rixBegin, nextId;
163 rixBegin= rix= FindFromIndex (currId);
164 if (rix < 0)
166 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == currId) {
167 nextId= arc[forwardList[rix]]->GetToId();
170 arc[forwardList[rix]]->AssignToId(mapList[nextId]);
172 rix++;
177 RemoveDuplicatesAtNode (rixBegin, rix);
489 int rix;
495 rix= FindFromIndex (currId);
496 if (rix < 0)
498 while (rix < sortNum && arc[forwardList[rix]]->GetFromId() == currId) {
499 if (arc[forwardList[rix]]->GetInput() != DISCARD_LABEL
500 && arc[forwardList[rix]]->GetToId() >= 0) {
501 if (arc[forwardList[rix]]->GetFromId() == arc[forwardList[rix]]->GetToId())
503 else if (QueryNodeProperty (arc[forwardList[rix]]->GetToId()) > 0)
504 DecVisitationCache (arc[forwardList[rix]]->GetToId());
506 rix++;
514 int rix;
519 rix= FindFromIndex (currId);
520 if (rix < 0)
522 while (rix < sortNum && arc[forwardList[rix]]->GetFromId() == currId) {
523 if (arc[forwardList[rix]]->GetInput() != DISCARD_LABEL
524 && arc[forwardList[rix]]->GetToId() >= 0) {
525 // IncNodeProperty (arc[forwardList[rix]]->GetToId());
526 // if (currId != arc[forwardList[rix]]->GetToId())
527 IncVisitationCache (arc[forwardList[rix]]->GetToId());
529 rix++;
