Home
last modified time | relevance | path

Searched refs:numArc (Results 1 – 7 of 7) sorted by relevance

/external/srec/tools/grxmlcompile/
Dsub_supp.cpp38 if (numArc <= 1) { in SortLanguage()
39 sortList= new int [numArc+2]; in SortLanguage()
44 sortNum= numArc; in SortLanguage()
59 endIx= numArc; in SortLanguageAtIndices()
64 sortList= new int [numArc+2]; in SortLanguageAtIndices()
65 for (ii= 0; ii < sortNum && ii < numArc; ii++) in SortLanguageAtIndices()
73 hired= (numArc >> 1)+1; in SortLanguageAtIndices()
78 while (jj <= numArc) { in SortLanguageAtIndices()
79 if (jj < numArc && ARC_COMPARE (sortList[jj], sortList[jj+1]) <= 0 ) in SortLanguageAtIndices()
94 retd= numArc; in SortLanguageAtIndices()
[all …]
Dsub_base.cpp45 numArc= 0; in SubGraph()
46 CopyFastArcs (baseG, 0, baseG->numArc, 0, -1, -1, -1, -1); in SubGraph()
59 if (numArc == 0) { in AllocateSpaceForArc()
62 if (numArc%BLKSIZE == 0) { in AllocateSpaceForArc()
63 NUANArc **new_arc= new NUANArc * [numArc+BLKSIZE]; in AllocateSpaceForArc()
64 for (int ii= 0; ii < numArc; ii++) in AllocateSpaceForArc()
76 arc[numArc]= arc_one; in CreateArc()
77 numArc++; in CreateArc()
86 arc[numArc]= arc_one; in InheritArc()
87 numArc++; in InheritArc()
[all …]
Dsub_phon.cpp52 arcCount= numArc; in ExpandPhonemes()
100 for (ii= 0; ii < numArc; ii++) { in ExpandPhonemes()
116 for (ii= 0; ii < numArc; ii++) { in AddLeftContexts()
139 for (ii= 0; ii < numArc; ii++) { in AddRightContexts()
163 arcCount= numArc; in ExpandToHMMs()
220 count= numArc; in ExpandIntraWordSilence()
329 for (ii= 0; ii < numArc; ii++) in ReverseMarkArcs()
365 for (ii= 0; ii < numArc; ii++) { in MarkNodesByOutputAndClearArcs()
380 for (ii= 0; ii < numArc; ii++) { in MarkNodesByOutputAndClearArcs()
387 for (ii= 0; ii < numArc; ii++) { in MarkNodesByOutputAndClearArcs()
[all …]
Dsub_min.cpp55 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == currId) { in ViewNode()
77 while (fix < numArc && arc[forwardList[fix]]->GetFromId() == firstId in EquivalenceTestForward()
80 if (fix < numArc && arc[forwardList[fix]]->GetFromId() == firstId) in EquivalenceTestForward()
85 while (six < numArc && arc[forwardList[six]]->GetFromId() == secondId in EquivalenceTestForward()
88 if (six < numArc && arc[forwardList[six]]->GetFromId() == secondId) in EquivalenceTestForward()
166 while (rix < numArc && arc[forwardList[rix]]->GetFromId() == currId) { in CheckForChangeAndResort()
362 numStart= numArc; in MergeVertices()
462 for (ii= 0; ii < numArc; ii++) in SetupVisitationCache()
478 for (ii= startNo; ii < numArc; ii++) in UpdateVisitationCache()
552 for (ii= 0; ii <numArc; ii++) in VisitationConsistencyCheck()
Dnetw_dump.cpp36 for (int ii= 0; ii < numArc; ii++) { in RemapForSortedOutput()
58 for (int ii= 0; ii < numArc; ii++) { in WriteForwardGraphFile()
115 for ( int ii= 0; ii < numArc; ii++ ) { in WriteForwardGraphWithSemantic()
204 for (int ii= 0; ii < numArc; ii++) { in WriteHMMGraphFile()
278 for (int ii= 0; ii < numArc; ii++) { in WritePhonemeGraphFile()
346 for (int ii= 0; ii < numArc; ii++) { in PrintWithLabels()
Dsub_grph.cpp60 opStack[popOp++]= numArc; in pushScope()
87 arcLoc= numArc; in BeginScope()
183 endLoc= numArc; in CloseScope()
201 endLoc= numArc; in CloseScope()
297 for (int ii= 0; ii < numArc; ii++) { in ExpandRules()
311 pos= numArc; in ExpandRules()
312 CopyFastArcs (subList[ruleId], 0, subList[ruleId]->numArc, numVertex, in ExpandRules()
327 for (int ii= startLoc; ii < numArc; ii++) { in UpdateVertexCount()
731 for (ii= 0; ii < numArc; ii++) { in ReverseGraphForOutput()
Dsub_grph.h113 numArc= 0; in SubGraph()
132 for (int ii= 0; ii < numArc; ii++) in ~SubGraph()
134 if (numArc >0) in ~SubGraph()
214 int numArc; variable