| /external/srec/tools/grxmlcompile/ |
| H A D | fst-io.h | 253 fst_.AddArc(s, arc);
265 fst_.AddArc(s, arc);
272 fst_.AddArc(s, arc);
|
| H A D | 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(state
[all...] |
| /external/srec/tools/make_cfst/ |
| H A D | 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/ |
| H A D | arcsort.h | 61 fst->AddArc(s, arcs[a]);
152 AddArc(s, aiter.Value());
|
| H A D | arcsum.h | 86 fst->AddArc(s, current_arc);
90 fst->AddArc(s, current_arc);
|
| H A D | cache.h | 49 // SetFinal(), AddArc(), and SetArcs() to cache. Note you must set the
170 void AddArc(StateId s, const Arc &arc) { function in class:fst::CacheBaseImpl
|
| H A D | closure.h | 52 fst->AddArc(s, Arc(0, 0, final, start));
59 fst->AddArc(nstart, Arc(0, 0, Weight::One(), start));
|
| H A D | compose.h | 428 void AddArc(StateId s, const A &arca, const A &arcb, int f, function in class:fst::ComposeFstImpl
444 CacheImpl<A>::AddArc(s, arc);
496 AddArc(s, arca, arcb, 0, find_input);
500 AddArc(s, arca, earcb, 0, find_input); // move forward on epsilon
516 AddArc(s, arca, arcb, 0, find_input); // move forward on match
542 AddArc(s, aiterf.Value(), arcb, 0, find_input);
560 AddArc(s, loop, arcb, 0, find_input);
574 AddArc(s, arca, arcb, 0, find_input); // move fwd on match
580 AddArc(s, earca, arcb, numepsa > 0, find_input); // move on epsilon
|
| H A D | concat.h | 64 fst1->AddArc(s1, arc);
74 fst1->AddArc(s1, Arc(0, 0, final, start2 + numstates1));
|
| H A D | determinize.h | 294 AddArc(s, liter->first, liter->second);
325 void AddArc(StateId s, Label label, Subset *dest_subset) { function in class:fst::DeterminizeFsaImpl
369 CacheImpl<A>::AddArc(s, arc);
502 CacheImpl<A>::AddArc(s, aiter.Value());
|
| H A D | factor-weight.h | 264 this->AddArc(s, Arc(arc.ilabel, arc.olabel, w, d));
270 this->AddArc(s, Arc(arc.ilabel, arc.olabel, p.first, d));
286 this->AddArc(s, Arc(0, 0, p.first, d));
|
| H A D | 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));
|
| H A D | minimize.h | 464 fst->AddArc(state_map[c], arc);
|
| H A D | mutable-fst.h | 46 virtual void AddArc(StateId, const A &arc) = 0; // Add an arc to state
|
| H A D | prune.h | 217 ofst->AddArc(copy[state], arc);
|
| H A D | randgen.h | 147 ofst->AddArc(opts.dest, oarc);
|
| H A D | 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));
|
| H A D | relabel.h | 291 AddArc(s, arc);
|
| H A D | replace.h | 192 depfst.AddArc(i - 1, A(arc.olabel, arc.olabel, Weight::One(), j));
312 AddArc(s, A(0, 0, fst->Final(fst_state), nextstate));
322 AddArc(s, A(arc.ilabel, arc.olabel, arc.weight, nextstate));
340 AddArc(s, A(ilabel, 0, arc.weight, nt_nextstate));
346 AddArc(s, A(arc.ilabel, arc.olabel, arc.weight, nextstate));
|
| H A D | reverse.h | 61 ofst->AddArc(0, oarc);
72 ofst->AddArc(nos, oarc);
|
| H A D | reweight.h | 116 fst->AddArc(state, arc);
|
| H A D | rmepsilon.h | 252 fst->AddArc(state, arcs.back());
390 AddArc(s, arcs.back());
|
| H A D | rmfinalepsilon.h | 90 fst->AddArc(s, arcs[i]);
|
| H A D | 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));
|
| H A D | statesort.h | 78 fst->AddArc(s2, arc);
|