Searched refs:arc1 (Results 1 - 9 of 9) sorted by relevance
/external/openfst/src/include/fst/ |
H A D | equal.h | 73 Arc arc1 = aiter1.Value(); local 75 if (arc1.ilabel != arc2.ilabel) { 79 << ", ilabel1 = " << arc1.ilabel 82 } else if (arc1.olabel != arc2.olabel) { 86 << ", olabel1 = " << arc1.olabel 89 } else if (!ApproxEqual(arc1.weight, arc2.weight, delta)) { 93 << ", weight1 = " << arc1.weight 96 } else if (arc1.nextstate != arc2.nextstate) { 100 << ", nextstate1 = " << arc1.nextstate
|
H A D | compose-filter.h | 186 // FilterState FilterArc(Arc *arc1, Arc *arc2) const; 258 FilterState FilterArc(Arc *arc1, Arc *arc2) const { argument 259 if (arc1->olabel == kNoLabel) 265 return arc1->olabel == 0 ? FilterState::NoState() : FilterState(0); 343 FilterState FilterArc(Arc *arc1, Arc *arc2) const { argument 347 else if (arc1->olabel == kNoLabel) 350 return arc1->olabel == 0 ? FilterState::NoState() : FilterState(0); 436 FilterState FilterArc(Arc *arc1, Arc *arc2) const { argument 442 else if (arc1->olabel == kNoLabel) // Epsilon on Fst2 447 else if (arc1 510 FilterArc(Arc *arc1, Arc *arc2) const argument [all...] |
H A D | arcsort.h | 165 bool operator() (A arc1, A arc2) const { argument 166 return arc1.ilabel < arc2.ilabel; 179 bool operator() (const A &arc1, const A &arc2) const { argument 180 return arc1.olabel < arc2.olabel;
|
H A D | lookahead-filter.h | 184 // This filter uses a lookahead matcher in FilterArc(arc1, arc2) to 185 // examine the future of the composition state (arc1.nextstate, 248 FilterState FilterArc(Arc *arc1, Arc *arc2) const { argument 251 const FilterState &f = filter_.FilterArc(arc1, arc2); 255 return LookAheadOutput() ? LookAheadFilterArc(arc1, arc2, f) : 256 LookAheadFilterArc(arc2, arc1, f); 365 FilterState FilterArc(Arc *arc1, Arc *arc2) const { argument 366 const FilterState1 &f1 = filter_.FilterArc(arc1, arc2); 494 FilterState FilterArc(Arc *arc1, Arc *arc2) const { argument 496 return FilterState(filter_.FilterArc(arc1, arc [all...] |
H A D | minimize.h | 89 const A& arc1 = aiter1.Value(); local 91 if (arc1.ilabel < arc2.ilabel) return true; 92 if (arc1.ilabel > arc2.ilabel) return false; 94 if (partition_.class_id(arc1.nextstate) < 96 if (partition_.class_id(arc1.nextstate) >
|
H A D | compose.h | 324 void AddArc(StateId s, const Arc &arc1, const Arc &arc2, argument 326 StateTuple tuple(arc1.nextstate, arc2.nextstate, f); 327 Arc oarc(arc1.ilabel, arc2.olabel, Times(arc1.weight, arc2.weight),
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | equal.h | 70 Arc arc1 = aiter1.Value(); local 72 if (arc1.ilabel != arc2.ilabel) { 76 << ", ilabel1 = " << arc1.ilabel 79 } else if (arc1.olabel != arc2.olabel) { 83 << ", olabel1 = " << arc1.olabel 86 } else if (!ApproxEqual(arc1.weight, arc2.weight)) { 90 << ", weight1 = " << arc1.weight 93 } else if (arc1.nextstate != arc2.nextstate) { 97 << ", nextstate1 = " << arc1.nextstate
|
H A D | arcsort.h | 281 bool operator() (A arc1, A arc2) const { argument 282 return arc1.ilabel < arc2.ilabel; 294 bool operator() (const A &arc1, const A &arc2) const { argument 295 return arc1.olabel < arc2.olabel;
|
H A D | minimize.h | 82 const A& arc1 = aiter1.Value(); local 84 if (arc1.ilabel < arc2.ilabel) return true; 85 if (arc1.ilabel > arc2.ilabel) return false; 87 if (partition_.class_id(arc1.nextstate) < 89 if (partition_.class_id(arc1.nextstate) >
|
Completed in 480 milliseconds