| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| D | equal.h | 71 Arc arc2 = aiter2.Value(); in Equal() local
72 if (arc1.ilabel != arc2.ilabel) { in Equal()
77 << ", ilabel2 = " << arc2.ilabel; in Equal()
79 } else if (arc1.olabel != arc2.olabel) { in Equal()
84 << ", olabel2 = " << arc2.olabel; in Equal()
86 } else if (!ApproxEqual(arc1.weight, arc2.weight)) { in Equal()
91 << ", weight2 = " << arc2.weight; in Equal()
93 } else if (arc1.nextstate != arc2.nextstate) { in Equal()
98 << ", nextstate2 = " << arc2.nextstate; in Equal()
|
| D | arcsort.h | 281 bool operator() (A arc1, A arc2) const { in operator()
282 return arc1.ilabel < arc2.ilabel; in operator()
294 bool operator() (const A &arc1, const A &arc2) const { in operator()
295 return arc1.olabel < arc2.olabel; in operator()
|
| D | minimize.h | 83 const A& arc2 = aiter2.Value(); in operator() local
84 if (arc1.ilabel < arc2.ilabel) return true; in operator()
85 if (arc1.ilabel > arc2.ilabel) return false; in operator()
88 partition_.class_id(arc2.nextstate)) return true; in operator()
90 partition_.class_id(arc2.nextstate)) return false; in operator()
|
| /external/openfst/src/include/fst/ |
| D | equal.h | 74 Arc arc2 = aiter2.Value();
75 if (arc1.ilabel != arc2.ilabel) {
80 << ", ilabel2 = " << arc2.ilabel;
82 } else if (arc1.olabel != arc2.olabel) {
87 << ", olabel2 = " << arc2.olabel;
89 } else if (!ApproxEqual(arc1.weight, arc2.weight, delta)) {
94 << ", weight2 = " << arc2.weight;
96 } else if (arc1.nextstate != arc2.nextstate) {
101 << ", nextstate2 = " << arc2.nextstate;
|
| D | compose-filter.h | 258 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
262 else if (arc2->ilabel == kNoLabel) in FilterArc()
343 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
344 if (arc2->ilabel == kNoLabel) in FilterArc()
436 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
437 if (arc2->ilabel == kNoLabel) // Epsilon on Fst1 in FilterArc()
510 FilterState FilterArc(Arc *arc1, Arc *arc2) const { in FilterArc() argument
511 FilterState f = filter_.FilterArc(arc1, arc2); in FilterArc()
514 arc1->ilabel = arc2->ilabel; in FilterArc()
515 if (arc2->ilabel == kNoLabel) in FilterArc()
[all …]
|
| D | lookahead-filter.h | 248 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()
378 arc2->weight = Divide(Times(arc2->weight, lweight), fweight); 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()
[all …]
|
| D | arcsort.h | 179 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()
|
| D | minimize.h | 90 const A& arc2 = aiter2.Value(); in operator() local
91 if (arc1.ilabel < arc2.ilabel) return true; in operator()
92 if (arc1.ilabel > arc2.ilabel) return false; in operator()
95 partition_.class_id(arc2.nextstate)) return true; in operator()
97 partition_.class_id(arc2.nextstate)) return false; in operator()
|
| D | compose.h | 331 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/ |
| D | compose.h | 352 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()
361 } else if (arc2->ilabel) { in FilterArc()
362 arc2->olabel = arc1->ilabel; in FilterArc()
364 return FilterParen(arc2->ilabel, f1, f2); 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()
|
| /external/srec/tools/grxmlcompile/ |
| D | grxmlcompile.cpp | 476 fst::StdArc arc2 = aiter2.Value(); in FstPushSlotLikeOLabels() local
477 if(arc2.ilabel == WORD_BOUNDARY) { in FstPushSlotLikeOLabels()
481 arc2.ilabel = EPSILON_LABEL; in FstPushSlotLikeOLabels()
482 arc2.olabel = slotId; in FstPushSlotLikeOLabels()
483 aiter2.SetValue( arc2); in FstPushSlotLikeOLabels()
|
| /external/srec/srec/crec/ |
| D | srec_context.c | 1518 FSMarc *arc = NULL, *arc2; in remove_added_arcs_leaving() local
1528 arc2 = &fst->FSMarc_list[ai]; in remove_added_arcs_leaving()
1529 for (ai2 = arc2->linkl_next_arc; ai2 >= fst->num_base_arcs && ai2 != MAXarcID; in remove_added_arcs_leaving()
1530 ai2 = arc2->linkl_next_arc) in remove_added_arcs_leaving()
1532 arc2 = &fst->FSMarc_list[ai2]; in remove_added_arcs_leaving()
1544 FSMarc *arc = NULL, *arc2; in remove_added_arcs_arriving() local
1555 arc2 = &fst->FSMarc_list[ai]; in remove_added_arcs_arriving()
1556 for (ai2 = arc2->linkl_prev_arc; ai2 >= fst->num_base_arcs && ai2 != MAXarcID; in remove_added_arcs_arriving()
1557 ai2 = arc2->linkl_prev_arc) in remove_added_arcs_arriving()
1559 arc2 = &fst->FSMarc_list[ai2]; in remove_added_arcs_arriving()
[all …]
|
| /external/webkit/PerformanceTests/Parser/resources/ |
| D | final-url-en | 81311 http://www.yakface.com/yaknews/arc2-2002.shtml
|