Lines Matching refs:forwardList
55 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == currId) {
56 arc[forwardList[rix]]->Print();
77 while (fix < numArc && arc[forwardList[fix]]->GetFromId() == firstId
78 && arc[forwardList[fix]]->GetToId() == DISCARD_LABEL)
80 if (fix < numArc && arc[forwardList[fix]]->GetFromId() == firstId)
81 fnxt= arc[forwardList[fix]]->GetFromId();
85 while (six < numArc && arc[forwardList[six]]->GetFromId() == secondId
86 && arc[forwardList[six]]->GetToId() == DISCARD_LABEL)
88 if (six < numArc && arc[forwardList[six]]->GetFromId() == secondId)
89 snxt= arc[forwardList[six]]->GetFromId();
98 tos= arc[forwardList[six]]->GetToId();
99 tof= arc[forwardList[fix]]->GetToId();
107 if (!arc[forwardList[fix]]->HasSameLabels (arc[forwardList[six]])
166 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == currId) {
167 nextId= arc[forwardList[rix]]->GetToId();
170 arc[forwardList[rix]]->AssignToId(mapList[nextId]);
193 while (vertEnd < sortNum && arc[forwardList[vertEnd]]->GetFromId() == baseId) {
200 while (fix < sortNum && arc[forwardList[fix]]->GetFromId() == baseId) {
203 while (fix < sortNum && arc[forwardList[fix]]->GetFromId() == baseId
204 && (arc[forwardList[fix]]->GetToId() == firstId
205 || arc[forwardList[fix]]->GetInput() == TERMINAL_LABEL
206 || arc[forwardList[fix]]->GetInput() == DISCARD_LABEL))
210 if (fix >= sortNum || arc[forwardList[fix]]->GetFromId() != baseId)
213 firstId= arc[forwardList[fix]]->GetToId();
218 while (six < sortNum && arc[forwardList[six]]->GetFromId() == baseId) {
221 while (six < sortNum && arc[forwardList[six]]->GetFromId() == baseId
222 && (arc[forwardList[six]]->GetToId() == secondId
223 || arc[forwardList[six]]->GetInput() == TERMINAL_LABEL
224 || arc[forwardList[six]]->GetInput() == DISCARD_LABEL))
228 if (six >= sortNum || arc[forwardList[six]]->GetFromId() != baseId)
231 secondId= arc[forwardList[six]]->GetToId();
236 assert (arc[forwardList[fix]]->GetInput() != DISCARD_LABEL);
237 assert (arc[forwardList[six]]->GetInput() != DISCARD_LABEL);
243 while (fix < sortNum && arc[forwardList[fix]]->GetFromId() == baseId
244 && arc[forwardList[fix]]->GetInput() == DISCARD_LABEL)
248 if (fix >= sortNum || arc[forwardList[fix]]->GetFromId() != baseId
249 || arc[forwardList[fix]]->GetToId() != firstId)
266 assert (arc[forwardList[fix]]->GetInput() != DISCARD_LABEL);
267 assert (arc[forwardList[six]]->GetInput() != DISCARD_LABEL);
275 assert (arc[forwardList[fix]]->GetInput() != DISCARD_LABEL);
276 assert (arc[forwardList[six]]->GetInput() != DISCARD_LABEL);
278 symTst= SYMBOL_COMPARE (forwardList[fix], forwardList[six]);
290 arc[forwardList[six]]->AssignToId (newId);
293 arc[forwardList[fix]]->AssignInput (DISCARD_LABEL);
298 } while (fix < sortNum && arc[forwardList[fix]]->GetInput() == DISCARD_LABEL);
299 if (fix >= sortNum || arc[forwardList[fix]]->GetFromId() != baseId
300 || arc[forwardList[fix]]->GetToId() != firstId)
305 } while (six < sortNum && arc[forwardList[six]]->GetInput() == DISCARD_LABEL);
306 if (six >= sortNum || arc[forwardList[six]]->GetFromId() != baseId
307 || arc[forwardList[six]]->GetToId() != secondId)
315 } while (fix < sortNum && arc[forwardList[fix]]->GetInput() == DISCARD_LABEL);
316 if (fix >= sortNum || arc[forwardList[fix]]->GetFromId() != baseId
317 || arc[forwardList[fix]]->GetToId() != firstId)
324 } while (six < sortNum && arc[forwardList[six]]->GetInput() == DISCARD_LABEL);
325 if (six >= sortNum || arc[forwardList[six]]->GetFromId() != baseId
326 || arc[forwardList[six]]->GetToId() != secondId)
367 while (fix < sortNum && arc[forwardList[fix]]->GetFromId() == firstId) {
368 if (arc[forwardList[fix]]->GetInput() != DISCARD_LABEL)
369 InheritArc (arc[forwardList[fix]], newId);
373 while (six < sortNum && arc[forwardList[six]]->GetFromId() == secondId) {
374 if (arc[forwardList[six]]->GetInput() != DISCARD_LABEL)
375 InheritArc (arc[forwardList[six]], newId);
382 symTst= SYMBOL_COMPARE (forwardList[fix], forwardList[six]);
385 if (arc[forwardList[fix]]->GetToId() == firstId
386 && arc[forwardList[six]]->GetToId() == secondId) {
387 arcOne= InheritArc (arc[forwardList[fix]], newId);
390 else if (arc[forwardList[fix]]->GetToId()
391 == arc[forwardList[six]]->GetToId()) {
392 InheritArc (arc[forwardList[fix]], newId);
395 InheritArc (arc[forwardList[fix]], newId);
396 InheritArc (arc[forwardList[six]], newId);
402 } while (fix < sortNum && arc[forwardList[fix]]->GetInput() == DISCARD_LABEL);
403 if (fix >= sortNum || arc[forwardList[fix]]->GetFromId() != firstId
404 || arc[forwardList[fix]]->GetFromId() != firstId)
409 } while (six < sortNum && arc[forwardList[six]]->GetInput() == DISCARD_LABEL);
410 if (six >= sortNum || arc[forwardList[six]]->GetFromId() != secondId)
414 InheritArc (arc[forwardList[fix]], newId);
417 } while (fix < sortNum && arc[forwardList[fix]]->GetInput() == DISCARD_LABEL);
418 if (fix >= sortNum || arc[forwardList[fix]]->GetFromId() != firstId
419 || arc[forwardList[fix]]->GetFromId() != firstId)
423 InheritArc (arc[forwardList[six]], newId);
426 } while (six < sortNum && arc[forwardList[six]]->GetInput() == DISCARD_LABEL);
427 if (six >= sortNum || arc[forwardList[six]]->GetFromId() != secondId
428 || arc[forwardList[six]]->GetFromId() != secondId)
433 while (fix < sortNum && arc[forwardList[fix]]->GetFromId() == firstId) {
434 if (arc[forwardList[fix]]->GetInput() != DISCARD_LABEL)
435 InheritArc (arc[forwardList[fix]], newId);
439 while (six < sortNum && arc[forwardList[six]]->GetFromId() == secondId) {
440 if (arc[forwardList[six]]->GetInput() != DISCARD_LABEL)
441 InheritArc (arc[forwardList[six]], newId);
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());
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());
