HomeSort by relevance Sort by last modified time
    Searched refs:AddArc (Results 1 - 25 of 61) sorted by null

1 2 3

  /external/srec/tools/make_cfst/
make_cfst.cpp 129 myCfst.AddArc(stateEn, fst::StdArc(EPSILON_LABEL, EPSILON_LABEL, 0.0, stateSt));
183 myCfst.AddArc( stateN, fst::StdArc(cphon,modelId,0.0,stateNp1));
184 myCfst.AddArc( stateNp1, fst::StdArc(WORD_BOUNDARY,WORD_BOUNDARY,0.0,stateNp1));
190 myCfst.AddArc( minifst[modelId].lcontext_state[lphonId],
197 myCfst.AddArc( minifst[modelId].stateEn,
214 myCfst.AddArc( minifst[modelId].stateEn,
221 myCfst.AddArc( stateSt,
224 myCfst.AddArc( minifst[silenceModelId].stateEn,
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
rational.h 75 rfst_.AddArc(0, A(0, -1, Weight::One(), 1));
76 rfst_.AddArc(0, A(0, -2, Weight::One(), 1));
98 rfst_.AddArc(0, A(0, -1, Weight::One(), 1));
99 rfst_.AddArc(1, A(0, -2, Weight::One(), 2));
116 rfst_.AddArc(0, A(0, -1, Weight::One(), 0));
122 rfst_.AddArc(0, A(0, -1, Weight::One(), 1));
123 rfst_.AddArc(1, A(0, 0, Weight::One(), 0));
144 afst.AddArc(0, A(0, -nonterminals_, Weight::One(), 1));
160 afst.AddArc(0, A(0, -nonterminals_, Weight::One(), 1));
union.h 62 fst1->AddArc(s1, arc);
73 fst1->AddArc(start1, Arc(0, 0, Weight::One(), start2 + numstates1));
77 fst1->AddArc(nstart1, Arc(0, 0, Weight::One(), start1));
78 fst1->AddArc(nstart1, Arc(0, 0, Weight::One(), start2 + numstates1));
arcsum.h 86 fst->AddArc(s, current_arc);
90 fst->AddArc(s, current_arc);
reverse.h 61 ofst->AddArc(0, oarc);
72 ofst->AddArc(nos, oarc);
closure.h 52 fst->AddArc(s, Arc(0, 0, final, start));
59 fst->AddArc(nstart, Arc(0, 0, Weight::One(), start));
concat.h 64 fst1->AddArc(s1, arc);
74 fst1->AddArc(s1, Arc(0, 0, final, start2 + numstates1));
rmfinalepsilon.h 91 fst->AddArc(s, arcs[i]);
statesort.h 78 fst->AddArc(s2, arc);
compose.h 431 void AddArc(StateId s, const A &arca, const A &arcb, int f,
447 CacheImpl<A>::AddArc(s, arc);
499 AddArc(s, arca, arcb, 0, find_input);
503 AddArc(s, arca, earcb, 0, find_input); // move forward on epsilon
519 AddArc(s, arca, arcb, 0, find_input); // move forward on match
545 AddArc(s, aiterf.Value(), arcb, 0, find_input);
563 AddArc(s, loop, arcb, 0, find_input);
577 AddArc(s, arca, arcb, 0, find_input); // move fwd on match
583 AddArc(s, earca, arcb, numepsa > 0, find_input); // move on epsilon
    [all...]
map.h 122 fst->AddArc(s, final_arc);
135 fst->AddArc(s, A(final_arc.ilabel, final_arc.olabel,
185 ofst->AddArc(s, (*mapper)(aiter.Value()));
204 ofst->AddArc(s, final_arc);
215 ofst->AddArc(s, B(final_arc.ilabel, final_arc.olabel,
367 this->AddArc(s, barc);
383 this->AddArc(s, final_arc);
392 this->AddArc(s, B(final_arc.ilabel, final_arc.olabel,
805 fst_->AddArc(p, ToArc(i ? 0 : l, iter1.Value(), AW::One(), n));
shortest-path.h 159 ofst->AddArc(s_p, arc_parent[d]);
301 ofst->AddArc(ofst->Start(), Arc(0, 0, Weight::One(), state));
316 ofst->AddArc(next, arc);
326 ofst->AddArc(next, Arc(0, 0, finalw, state));
  /external/openfst/src/include/fst/
union.h 87 fst1->AddArc(s1, arc);
98 fst1->AddArc(start1, Arc(0, 0, Weight::One(), start2 + numstates1));
102 fst1->AddArc(nstart1, Arc(0, 0, Weight::One(), start1));
103 fst1->AddArc(nstart1, Arc(0, 0, Weight::One(), start2 + numstates1));
reverse.h 70 ofst->AddArc(0, oarc);
81 ofst->AddArc(nos, oarc);
rational.h 134 rfst_.AddArc(0, A(0, -1, Weight::One(), 1));
135 rfst_.AddArc(0, A(0, -2, Weight::One(), 1));
157 rfst_.AddArc(0, A(0, -1, Weight::One(), 1));
158 rfst_.AddArc(1, A(0, -2, Weight::One(), 2));
175 rfst_.AddArc(0, A(0, -1, Weight::One(), 0));
181 rfst_.AddArc(0, A(0, -1, Weight::One(), 1));
182 rfst_.AddArc(1, A(0, 0, Weight::One(), 0));
204 afst.AddArc(0, A(0, -nonterminals_, Weight::One(), 1));
222 afst.AddArc(0, A(0, -nonterminals_, Weight::One(), 1));
closure.h 59 fst->AddArc(s, Arc(0, 0, final, start));
67 fst->AddArc(nstart, Arc(0, 0, Weight::One(), start));
concat.h 87 fst1->AddArc(s1, arc);
97 fst1->AddArc(s1, Arc(0, 0, final, start2 + numstates1));
148 fst2->AddArc(s2, Arc(0, 0, final, start2));
154 fst2->AddArc(s2, arc);
visit.h 214 ofst_->AddArc(s, arc);
219 ofst_->AddArc(s, arc);
224 ofst_->AddArc(s, arc);
mutable-fst.h 59 virtual void AddArc(StateId, const A &arc) = 0; // Add an arc to state
283 virtual void AddArc(StateId s, const Arc &arc) {
285 GetImpl()->AddArc(s, arc);
rmfinalepsilon.h 97 fst->AddArc(s, arcs[i]);
statesort.h 87 fst->AddArc(s2, arc);
edit-fst.h 190 const A *AddArc(StateId s, const Arc &arc, const WrappedFstT *wrapped) {
201 edits_.AddArc(internal_id, arc);
294 edits_.AddArc(new_internal_id, arc_iterator.Value());
527 void AddArc(StateId s, const Arc &arc) {
529 const A *prev_arc = data_->AddArc(s, arc, wrapped_);
  /external/srec/tools/grxmlcompile/
grxmlcompile.cpp 559 cfst_.AddArc( s, fst::StdArc(SLOT_COUNTER_OFFSET+i /*model*/,
653 l_fst.AddArc(stateEn, fst::StdArc(EPSILON_LABEL,EPSILON_LABEL,0.0,stateSt));
695 l_fst.AddArc(stateP, fst::StdArc( wordId+SLOT_COUNTER_OFFSET, wordId, 0.0, statePp1));
698 l_fst.AddArc(stateP, fst::StdArc( wordId+SLOT_COUNTER_OFFSET, EPSILON_LABEL, 0.0, statePp1));
700 l_fst.AddArc(stateP, fst::StdArc( WORD_BOUNDARY, EPSILON_LABEL, 0.0, stateEn));
723 l_fst.AddArc(stateP, fst::StdArc( SILENCE_CODE, olabel, 0.0, statePp1));
724 l_fst.AddArc(stateP, fst::StdArc( EPSILON_LABEL, olabel, 0.0, statePp1));
726 l_fst.AddArc(stateP, fst::StdArc( *p, olabel, 0.0, statePp1));
743 l_fst.AddArc(stateP, fst::StdArc( EXTRA_EPSILON_LABEL, olabel, 0.0, statePp1));
749 l_fst.AddArc(stateP, fst::StdArc( SILENCE_CODE, EPSILON_LABEL, 0.0, statePp1))
    [all...]
  /external/openfst/src/include/fst/script/
compile-impl.h 99 fst_.AddArc(s, arc);
111 fst_.AddArc(s, arc);
118 fst_.AddArc(s, arc);
  /external/openfst/src/include/fst/extensions/pdt/
replace.h 116 ofst->AddArc(os, arc);
177 ofst->AddArc(p.first, farc);

Completed in 373 milliseconds

1 2 3