HomeSort by relevance Sort by last modified time
    Searched refs:arc2 (Results 1 - 13 of 13) sorted by null

  /external/openfst/src/include/fst/
equal.h 74 Arc arc2 = aiter2.Value(); local
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;
compose-filter.h 186 // FilterState FilterArc(Arc *arc1, Arc *arc2) const;
258 FilterState FilterArc(Arc *arc1, Arc *arc2) const {
262 else if (arc2->ilabel == kNoLabel)
343 FilterState FilterArc(Arc *arc1, Arc *arc2) const {
344 if (arc2->ilabel == kNoLabel)
436 FilterState FilterArc(Arc *arc1, Arc *arc2) const {
437 if (arc2->ilabel == kNoLabel) // Epsilon on Fst1
510 FilterState FilterArc(Arc *arc1, Arc *arc2) const {
511 FilterState f = filter_.FilterArc(arc1, arc2);
514 arc1->ilabel = arc2->ilabel
    [all...]
arcsort.h 165 bool operator() (A arc1, A arc2) const {
166 return arc1.ilabel < arc2.ilabel;
179 bool operator() (const A &arc1, const A &arc2) const {
180 return arc1.olabel < arc2.olabel;
lookahead-filter.h 184 // This filter uses a lookahead matcher in FilterArc(arc1, arc2) to
186 // arc2.nextstate), blocking moving forward when its determined to be
248 FilterState FilterArc(Arc *arc1, Arc *arc2) const {
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 {
366 const FilterState1 &f1 = filter_.FilterArc(arc1, arc2);
378 arc2->weight = Divide(Times(arc2->weight, lweight), fweight)
    [all...]
minimize.h 90 const A& arc2 = aiter2.Value(); local
91 if (arc1.ilabel < arc2.ilabel) return true;
92 if (arc1.ilabel > arc2.ilabel) return false;
95 partition_.class_id(arc2.nextstate)) return true;
97 partition_.class_id(arc2.nextstate)) return false;
compose.h 324 void AddArc(StateId s, const Arc &arc1, const Arc &arc2,
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/
equal.h 71 Arc arc2 = aiter2.Value(); local
72 if (arc1.ilabel != arc2.ilabel) {
77 << ", ilabel2 = " << arc2.ilabel;
79 } else if (arc1.olabel != arc2.olabel) {
84 << ", olabel2 = " << arc2.olabel;
86 } else if (!ApproxEqual(arc1.weight, arc2.weight)) {
91 << ", weight2 = " << arc2.weight;
93 } else if (arc1.nextstate != arc2.nextstate) {
98 << ", nextstate2 = " << arc2.nextstate;
arcsort.h 281 bool operator() (A arc1, A arc2) const {
282 return arc1.ilabel < arc2.ilabel;
294 bool operator() (const A &arc1, const A &arc2) const {
295 return arc1.olabel < arc2.olabel;
minimize.h 83 const A& arc2 = aiter2.Value(); local
84 if (arc1.ilabel < arc2.ilabel) return true;
85 if (arc1.ilabel > arc2.ilabel) return false;
88 partition_.class_id(arc2.nextstate)) return true;
90 partition_.class_id(arc2.nextstate)) return false;
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/internal/
GesturePreviewTrail.java 146 public RectF arc2 = new RectF(); field in class:GesturePreviewTrail.WorkingSet
188 w.arc2.set(w.p2x, w.p2y, w.p2x, w.p2y);
189 w.arc2.inset(-w.r2, -w.r2);
200 path.arcTo(w.arc2, w.aa, w.a2);
  /external/srec/tools/grxmlcompile/
grxmlcompile.cpp 476 fst::StdArc arc2 = aiter2.Value(); local
477 if(arc2.ilabel == WORD_BOUNDARY) {
481 arc2.ilabel = EPSILON_LABEL;
482 arc2.olabel = slotId;
483 aiter2.SetValue( arc2);
    [all...]
  /external/srec/srec/crec/
srec_context.c 1518 FSMarc *arc = NULL, *arc2; local
1544 FSMarc *arc = NULL, *arc2; local
1577 FSMarc_t *arc, *arc2, *arc3; local
    [all...]
  /prebuilts/tools/common/jfreechart/
jfreechart-1.0.9.jar 

Completed in 275 milliseconds