Lines Matching refs:rix
112 int ii, rix, currId, leftC;
119 rix= FindToIndex (currId);
120 if (rix >= 0) {
121 leftC= arc[backwardList[rix]]->GetCentre();
135 int ii, rix, currId, rightC;
142 rix= FindFromIndex (currId);
143 if (rix >= 0) {
144 rightC= arc[forwardList[rix]]->GetCentre();
337 int rix;
339 rix= FindToIndex (currId);
340 if (rix < 0)
342 while (rix < sortRevNum && arc[backwardList[rix]]->GetToId() == currId) {
343 if (arc[backwardList[rix]]->GetOutput() != DISCARD_LABEL // not resolved yet
344 && arc[backwardList[rix]]->GetInput() >= 0) { // excludes word boundary
345 if (arc[backwardList[rix]]->GetOutput() == NONE_LABEL)
346 arc[backwardList[rix]]->AssignOutput (outId);
347 else if (outId != arc[backwardList[rix]]->GetOutput())
348 arc[backwardList[rix]]->AssignOutput(DISCARD_LABEL);
349 ReverseMarkOutput (arc[backwardList[rix]]->GetFromId(), initialId, outId);
351 rix++;
358 int ii, currId, rix;
393 rix= FindFromIndex (currId);
394 if (rix < 0)
396 while (rix < sortNum && arc[forwardList[rix]]->GetFromId() == currId) {
397 assert (arc[forwardList[rix]]->GetOutput() == DISCARD_LABEL);
398 arc[forwardList[rix]]->AssignOutput(arc[ii]->GetOutput());
399 rix++;
440 int ii, rix, newId, intId, count;
445 rix= FindFromIndex (startId);
446 if (rix < 0)
448 while (rix < sortNum && arc[forwardList[rix]]->GetFromId() == startId) {
449 arc[forwardList[rix]]->AssignFromId (newId);
450 rix++;
