Lines Matching defs:currId
33 int ii, wordId, phoneId, currId, newId, nextId, arcCount;
76 currId= arc[ii]->GetFromId();
83 arcOne= CreateArc (phoneId, NONE_LABEL, currId, newId);
88 currId= newId;
90 arcOne= CreateArc (WB_LABEL, wordId, currId, arc[ii]->GetToId());
112 int ii, rix, currId, leftC;
118 currId= arc[ii]->GetFromId();
119 rix= FindToIndex (currId);
124 else if (currId != startId)
125 printf ("Shouldn't get here (L) %d\n", currId);
135 int ii, rix, currId, rightC;
141 currId= arc[ii]->GetToId();
142 rix= FindFromIndex (currId);
148 printf ("Shouldn't get here (R) %d\n", currId);
158 int ii, currId, newId, arcCount, left, right, centre;
179 currId= arc[ii]->GetFromId();
185 arcOne= CreateArc (modelSequence[jj], NONE_LABEL, currId, newId);
192 currId= newId;
210 int ii, fix, bix, firstId, newId, modelCount, followCount, currId, count;
247 currId= arc[backwardList[fix]]->GetFromId();
251 arc[backwardList[fix]]->GetOutput(), currId, newId);
256 currId= newId;
287 currId= firstId;
294 arc[forwardList[bix]]->GetOutput(), currId, newId);
299 currId= newId;
335 void SubGraph::ReverseMarkOutput (int currId, int initialId, int outId)
339 rix= FindToIndex (currId);
342 while (rix < sortRevNum && arc[backwardList[rix]]->GetToId() == currId) {
358 int ii, currId, rix;
366 currId= arc[ii]->GetToId();
367 if (currId >= 0) {
369 nodeList[currId]= DISCARD_LABEL;
370 else if (nodeList[currId] != DISCARD_LABEL) {
371 if (nodeList[currId] == NONE_LABEL)
372 nodeList[currId]= arc[ii]->GetOutput();
373 else if (nodeList[currId] != arc[ii]->GetOutput())
374 nodeList[currId]= DISCARD_LABEL;
381 currId= arc[ii]->GetFromId();
382 if (nodeList[currId] >= 0 && arc[ii]->GetOutput() >= 0) // unique ones
389 currId= arc[ii]->GetToId();
391 std::cout << "Intra silence: " << currId << " " << arc[ii]->GetFromId() << std::endl;
393 rix= FindFromIndex (currId);
396 while (rix < sortNum && arc[forwardList[rix]]->GetFromId() == currId) {
