Searched refs:ofst (Results 26 - 50 of 120) sorted by relevance

12345

/external/openfst/src/extensions/pdt/
H A Dpdtscript.cc43 MutableFstClass *ofst,
47 !ArcTypesMatch(ifst1, *ofst, "PdtCompose")) return;
49 PdtComposeArgs args(ifst1, ifst2, parens, ofst, copts, left_pdt);
56 MutableFstClass *ofst, const PdtExpandOptions &opts) {
57 PdtExpandArgs args(ifst, parens, ofst, opts);
64 MutableFstClass *ofst, bool connect) {
65 PdtExpand(ifst, parens, ofst, PdtExpandOptions(connect));
69 MutableFstClass *ofst,
77 if (!ArcTypesMatch((*fst_tuples[0].second), *ofst, "PdtReplace")) return;
79 PdtReplaceArgs args(fst_tuples, ofst, paren
40 PdtCompose(const FstClass &ifst1, const FstClass &ifst2, const vector<pair<int64, int64> > &parens, MutableFstClass *ofst, const PdtComposeOptions &copts, bool left_pdt) argument
54 PdtExpand(const FstClass &ifst, const vector<pair<int64, int64> > &parens, MutableFstClass *ofst, const PdtExpandOptions &opts) argument
62 PdtExpand(const FstClass &ifst, const vector<pair<int64, int64> > &parens, MutableFstClass *ofst, bool connect) argument
68 PdtReplace(const vector<pair<int64, const FstClass*> > &fst_tuples, MutableFstClass *ofst, vector<pair<int64, int64> > *parens, const int64 &root) argument
84 PdtReverse(const FstClass &ifst, const vector<pair<int64, int64> > &parens, MutableFstClass *ofst) argument
92 PdtShortestPath(const FstClass &ifst, const vector<pair<int64, int64> > &parens, MutableFstClass *ofst, const PdtShortestPathOptions &opts) argument
[all...]
H A Dpdtreverse.cc55 s::VectorFstClass ofst(ifst->ArcType());
56 s::PdtReverse(*ifst, parens, &ofst);
58 ofst.Write(out_name);
H A Dpdtcompose.cc75 s::VectorFstClass ofst(ifst1->ArcType());
93 s::PdtCompose(*ifst1, *ifst2, parens, &ofst, copts, FLAGS_left_pdt);
96 s::Connect(&ofst);
97 ofst.Write(out_name);
H A Dpdtexpand.cc64 s::VectorFstClass ofst(ifst->ArcType());
65 s::PdtExpand(*ifst, parens, &ofst, s::PdtExpandOptions(
68 ofst.Write(out_name);
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Drandgen.h106 int64 dest; // 'ofst' state to append
117 void RandGen(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, argument
125 ofst->DeleteStates();
126 ofst->SetInputSymbols(ifst.InputSymbols());
127 ofst->SetOutputSymbols(ifst.OutputSymbols());
128 ofst->SetStart(ofst->AddState());
131 nopts.dest = ofst->Start();
133 RandGen(ifst, ofst, nopts);
141 ofst
161 RandGen(const Fst<Arc> &ifst, MutableFst<Arc> *ofst) argument
[all...]
H A Depsnormalize.h48 void EpsNormalize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, argument
61 Map(fwfst, ofst, FromGallicMapper<Arc, STRING_RIGHT_RESTRICT>());
63 Invert(ofst);
H A Dpush.h57 void Push(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, uint32 ptype) { argument
60 *ofst = ifst;
61 Push(ofst, rtype);
81 Map(fwfst, ofst, FromGallicMapper<Arc, stype>());
83 *ofst = ifst;
H A Dshortest-path.h50 // 'ShortestPath' below with n=1. 'ofst' contains the shortest path in
62 MutableFst<Arc> *ofst,
68 ofst->DeleteStates();
69 ofst->SetInputSymbols(ifst.InputSymbols());
70 ofst->SetOutputSymbols(ifst.OutputSymbols());
154 s_p = ofst->AddState();
156 ofst->SetFinal(s_p, ifst.Final(f_parent));
159 ofst->AddArc(s_p, arc_parent[d]);
162 ofst->SetStart(s_p);
207 // 'ofst' contain
61 SingleShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, vector<typename Arc::Weight> *distance, ShortestPathOptions<Arc, Queue, ArcFilter> &opts) argument
228 ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, vector<typename Arc::Weight> *distance, ShortestPathOptions<Arc, Queue, ArcFilter> &opts) argument
351 ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, size_t n = 1, bool unique = false) argument
[all...]
/external/openfst/src/bin/
H A Dfstepsnormalize.cc53 VectorFstClass ofst(ifst->ArcType());
54 s::EpsNormalize(*ifst, &ofst, eps_norm_type);
55 ofst.Write(out_name);
H A Dfstsynchronize.cc47 VectorFstClass ofst(ifst->ArcType());
49 s::Synchronize(*ifst, &ofst);
51 ofst.Write(out_name);
H A Dfstpush.cc66 VectorFstClass ofst(ifst->ArcType());
69 s::Push(*ifst, &ofst, flags, fst::REWEIGHT_TO_FINAL, FLAGS_delta);
71 s::Push(*ifst, &ofst, flags, fst::REWEIGHT_TO_INITIAL, FLAGS_delta);
74 ofst.Write(out_name);
H A Dfstcompose.cc70 VectorFstClass ofst(ifst1->ArcType());
90 s::Compose(*ifst1, *ifst2, &ofst, opts);
92 ofst.Write(out_name);
H A Dfstdeterminize.cc56 VectorFstClass ofst(ifst->ArcType());
63 s::Determinize(*ifst, &ofst, opts);
65 ofst.Write(out_name);
H A Dfstdifference.cc62 VectorFstClass ofst(ifst1->ArcType());
82 s::Difference(*ifst1, *ifst2, &ofst, opts);
84 ofst.Write(out_name);
H A Dfstintersect.cc63 VectorFstClass ofst(ifst1->ArcType());
83 s::Intersect(*ifst1, *ifst2, &ofst, opts);
85 ofst.Write(out_name);
H A Dfstrandgen.cc59 VectorFstClass ofst(ifst->ArcType());
75 s::RandGen(*ifst, &ofst, FLAGS_seed,
80 ofst.Write(out_name);
H A Dfstreplace.cc59 VectorFstClass ofst(ifst->ArcType());
60 Replace(fst_tuples, &ofst, root, FLAGS_epsilon_on_replace);
62 ofst.Write(out_fname);
/external/openfst/src/include/fst/script/
H A Depsnormalize.h33 MutableFst<Arc> *ofst = args->arg2->GetMutableFst<Arc>(); local
35 EpsNormalize(ifst, ofst, args->arg3);
38 void EpsNormalize(const FstClass &ifst, MutableFstClass *ofst,
H A Drandgen.h39 MutableFst<Arc> *ofst = args->arg2->GetMutableFst<Arc>(); local
48 RandGen(ifst, ofst, ropts);
54 RandGen(ifst, ofst, ropts);
60 RandGen(ifst, ofst, ropts);
66 void RandGen(const FstClass &ifst, MutableFstClass *ofst, int32 seed = time(0),
H A Drelabel.h41 MutableFst<Arc> *ofst = args->arg1->GetMutableFst<Arc>(); local
43 Relabel(ofst, args->arg2, args->arg3, args->arg4,
54 MutableFst<Arc> *ofst = args->arg1->GetMutableFst<Arc>(); local
66 Relabel(ofst, converted_ipairs, converted_opairs);
81 void Relabel(MutableFstClass *ofst,
88 void Relabel(MutableFstClass *ofst,
H A Ddecode.h33 MutableFst<Arc> *ofst = args->arg1->GetMutableFst<Arc>(); local
36 Decode(ofst, *decoder);
/external/openfst/src/include/fst/
H A Dshortest-path.h67 // 'ShortestPath' below with n=1. 'ofst' contains the shortest path in
79 MutableFst<Arc> *ofst,
85 ofst->DeleteStates();
86 ofst->SetInputSymbols(ifst.InputSymbols());
87 ofst->SetOutputSymbols(ifst.OutputSymbols());
90 if (ifst.Properties(kError, false)) ofst->SetProperties(kError, kError);
108 ofst->SetProperties(kError, kError);
115 ofst->SetProperties(kError, kError);
122 ofst->SetProperties(kError, kError);
149 ofst
78 SingleShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, vector<typename Arc::Weight> *distance, ShortestPathOptions<Arc, Queue, ArcFilter> &opts) argument
413 ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, vector<typename Arc::Weight> *distance, ShortestPathOptions<Arc, Queue, ArcFilter> &opts) argument
484 ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, size_t n = 1, bool unique = false, bool first_path = false, typename Arc::Weight weight_threshold = Arc::Weight::Zero(), typename Arc::StateId state_threshold = kNoStateId) argument
[all...]
H A Depsnormalize.h52 void EpsNormalize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, argument
65 ArcMap(fwfst, ofst, FromGallicMapper<Arc, STRING_RIGHT_RESTRICT>());
66 ofst->SetOutputSymbols(ifst.OutputSymbols());
68 Invert(ofst);
/external/libhevc/decoder/
H A Dihevcd_nal.c98 WORD32 ofst; local
103 ofst = -1;
107 while(ofst < (bytes_remaining - 1))
109 ofst++;
110 if(pu1_buf[ofst] != 0)
117 if((pu1_buf[ofst + 1] == START_CODE_PREFIX_BYTE) &&
121 ofst++;
128 if((START_CODE_PREFIX_BYTE == pu1_buf[ofst]) &&
132 ofst++;
135 /* Since ofst starte
[all...]
/external/chromium_org/third_party/sqlite/src/tool/
H A Dshowjournal.c50 int ofst, int nByte, /* Start and size of decode */
54 unsigned val = aData[ofst];
56 sprintf(zBuf, " %03x: %02x", ofst, aData[ofst]);
62 sprintf(&zBuf[i], " %02x", aData[ofst+j]);
63 val = val*256 + aData[ofst+j];
48 print_decode_line( unsigned char *aData, int ofst, int nByte, const char *zMsg ) argument

Completed in 3143 milliseconds

12345