• Home
  • Raw
  • Download

Lines Matching refs:six

65     int  fix, six, fnxt, snxt, tof, tos, count;  in EquivalenceTestForward()  local
69 six= FindFromIndex (secondId); in EquivalenceTestForward()
70 if (fix < 0 || six < 0) in EquivalenceTestForward()
85 while (six < numArc && arc[forwardList[six]]->GetFromId() == secondId in EquivalenceTestForward()
86 && arc[forwardList[six]]->GetToId() == DISCARD_LABEL) in EquivalenceTestForward()
87 six++; in EquivalenceTestForward()
88 if (six < numArc && arc[forwardList[six]]->GetFromId() == secondId) in EquivalenceTestForward()
89 snxt= arc[forwardList[six]]->GetFromId(); in EquivalenceTestForward()
98 tos= arc[forwardList[six]]->GetToId(); in EquivalenceTestForward()
107 if (!arc[forwardList[fix]]->HasSameLabels (arc[forwardList[six]]) in EquivalenceTestForward()
113 six++; in EquivalenceTestForward()
184 int fix, six, firstId, secondId, vertEnd; in DeterminizeAtVertex() local
192 six= -1; in DeterminizeAtVertex()
216 six= fix; in DeterminizeAtVertex()
218 while (six < sortNum && arc[forwardList[six]]->GetFromId() == baseId) { in DeterminizeAtVertex()
221 while (six < sortNum && arc[forwardList[six]]->GetFromId() == baseId in DeterminizeAtVertex()
222 && (arc[forwardList[six]]->GetToId() == secondId in DeterminizeAtVertex()
223 || arc[forwardList[six]]->GetInput() == TERMINAL_LABEL in DeterminizeAtVertex()
224 || arc[forwardList[six]]->GetInput() == DISCARD_LABEL)) in DeterminizeAtVertex()
225 six++; in DeterminizeAtVertex()
228 if (six >= sortNum || arc[forwardList[six]]->GetFromId() != baseId) in DeterminizeAtVertex()
231 secondId= arc[forwardList[six]]->GetToId(); in DeterminizeAtVertex()
237 assert (arc[forwardList[six]]->GetInput() != DISCARD_LABEL); in DeterminizeAtVertex()
239 if (PairwiseDeterminize (baseId, firstId, fix, secondId, six, cache) > 0) { in DeterminizeAtVertex()
260 int fix, six, fmiss, smiss, nmatch, symTst, newId; in PairwiseDeterminize() local
264 six= sixStart; in PairwiseDeterminize()
267 assert (arc[forwardList[six]]->GetInput() != DISCARD_LABEL); in PairwiseDeterminize()
273 while (six < sortNum && fix < sortNum) { in PairwiseDeterminize()
276 assert (arc[forwardList[six]]->GetInput() != DISCARD_LABEL); in PairwiseDeterminize()
278 symTst= SYMBOL_COMPARE (forwardList[fix], forwardList[six]); in PairwiseDeterminize()
290 arc[forwardList[six]]->AssignToId (newId); in PairwiseDeterminize()
304 six++; in PairwiseDeterminize()
305 } while (six < sortNum && arc[forwardList[six]]->GetInput() == DISCARD_LABEL); in PairwiseDeterminize()
306 if (six >= sortNum || arc[forwardList[six]]->GetFromId() != baseId in PairwiseDeterminize()
307 || arc[forwardList[six]]->GetToId() != secondId) in PairwiseDeterminize()
308 six= sortNum; in PairwiseDeterminize()
323 six++; in PairwiseDeterminize()
324 } while (six < sortNum && arc[forwardList[six]]->GetInput() == DISCARD_LABEL); in PairwiseDeterminize()
325 if (six >= sortNum || arc[forwardList[six]]->GetFromId() != baseId in PairwiseDeterminize()
326 || arc[forwardList[six]]->GetToId() != secondId) in PairwiseDeterminize()
327 six= sortNum; in PairwiseDeterminize()
359 int fix, six, symTst, numStart; in MergeVertices() local
364 six= FindFromIndex (secondId); in MergeVertices()
365 if (fix < 0 || six < 0) { in MergeVertices()
372 else if (six >= 0) in MergeVertices()
373 while (six < sortNum && arc[forwardList[six]]->GetFromId() == secondId) { in MergeVertices()
374 if (arc[forwardList[six]]->GetInput() != DISCARD_LABEL) in MergeVertices()
375 InheritArc (arc[forwardList[six]], newId); in MergeVertices()
376 six++; in MergeVertices()
380 while (six < sortNum && fix < sortNum) { in MergeVertices()
382 symTst= SYMBOL_COMPARE (forwardList[fix], forwardList[six]); in MergeVertices()
386 && arc[forwardList[six]]->GetToId() == secondId) { in MergeVertices()
391 == arc[forwardList[six]]->GetToId()) { in MergeVertices()
396 InheritArc (arc[forwardList[six]], newId); in MergeVertices()
408 six++; in MergeVertices()
409 } while (six < sortNum && arc[forwardList[six]]->GetInput() == DISCARD_LABEL); in MergeVertices()
410 if (six >= sortNum || arc[forwardList[six]]->GetFromId() != secondId) in MergeVertices()
411 six= sortNum; in MergeVertices()
423 InheritArc (arc[forwardList[six]], newId); in MergeVertices()
425 six++; in MergeVertices()
426 } while (six < sortNum && arc[forwardList[six]]->GetInput() == DISCARD_LABEL); in MergeVertices()
427 if (six >= sortNum || arc[forwardList[six]]->GetFromId() != secondId in MergeVertices()
428 || arc[forwardList[six]]->GetFromId() != secondId) in MergeVertices()
429 six= sortNum; in MergeVertices()
439 while (six < sortNum && arc[forwardList[six]]->GetFromId() == secondId) { in MergeVertices()
440 if (arc[forwardList[six]]->GetInput() != DISCARD_LABEL) in MergeVertices()
441 InheritArc (arc[forwardList[six]], newId); in MergeVertices()
442 six++; in MergeVertices()