Home
last modified time | relevance | path

Searched refs:arc1 (Results 1 – 8 of 8) sorted by relevance

/external/openfst/src/include/fst/
Dequal.h73 Arc arc1 = aiter1.Value();
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
Dcompose-filter.h258 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
259 if (arc1->olabel == kNoLabel) in FilterArc()
265 return arc1->olabel == 0 ? FilterState::NoState() : FilterState(0); in FilterArc()
343 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
347 else if (arc1->olabel == kNoLabel) in FilterArc()
350 return arc1->olabel == 0 ? FilterState::NoState() : FilterState(0); in FilterArc()
436 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
442 else if (arc1->olabel == kNoLabel) // Epsilon on Fst2 in FilterArc()
447 else if (arc1->olabel == 0) // Epsilon on both in FilterArc()
510 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
[all …]
Dlookahead-filter.h248 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
251 const FilterState &f = filter_.FilterArc(arc1, arc2); in FilterArc()
255 return LookAheadOutput() ? LookAheadFilterArc(arc1, arc2, f) : in FilterArc()
256 LookAheadFilterArc(arc2, arc1, f); in FilterArc()
365 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
366 const FilterState1 &f1 = filter_.FilterArc(arc1, arc2); in FilterArc()
494 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
496 return FilterState(filter_.FilterArc(arc1, arc2), in FilterArc()
502 return LookAheadOutput() ? PushedLabelFilterArc(arc1, arc2, flabel) : in FilterArc()
503 PushedLabelFilterArc(arc2, arc1, flabel); in FilterArc()
[all …]
Darcsort.h179 bool operator() (A arc1, A arc2) const { in operator()
180 return arc1.ilabel < arc2.ilabel; in operator()
193 bool operator() (const A &arc1, const A &arc2) const { in operator()
194 return arc1.olabel < arc2.olabel; in operator()
Dminimize.h89 const A& arc1 = aiter1.Value(); in operator() local
91 if (arc1.ilabel < arc2.ilabel) return true; in operator()
92 if (arc1.ilabel > arc2.ilabel) return false; in operator()
94 if (partition_.class_id(arc1.nextstate) < in operator()
96 if (partition_.class_id(arc1.nextstate) > in operator()
Dcompose.h331 void AddArc(StateId s, const Arc &arc1, const Arc &arc2, in AddArc() argument
333 StateTuple tuple(arc1.nextstate, arc2.nextstate, f); in AddArc()
334 Arc oarc(arc1.ilabel, arc2.olabel, Times(arc1.weight, arc2.weight), in AddArc()
/external/openfst/src/include/fst/extensions/pdt/
Dcompose.h352 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
353 FilterState1 f1 = filter_.FilterArc(arc1, arc2); in FilterArc()
358 if (arc1->olabel == kNoLabel && arc2->ilabel) { // arc2 parentheses in FilterArc()
360 arc1->ilabel = arc2->ilabel; in FilterArc()
362 arc2->olabel = arc1->ilabel; in FilterArc()
365 } else if (arc2->ilabel == kNoLabel && arc1->olabel) { // arc1 parentheses in FilterArc()
367 arc2->olabel = arc1->olabel; in FilterArc()
369 arc1->ilabel = arc2->olabel; in FilterArc()
371 return FilterParen(arc1->olabel, f1, f2); in FilterArc()
/external/hyphenation-patterns/hu/
Dhyph-hu.pat.txt4299 arc1él.
4300 arc1élb
4301 arc1éll
4302 arc1élt