| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| reverse.h | 36 void Reverse(const Fst<Arc> &ifst, MutableFst<RevArc> *ofst) {
41 ofst->DeleteStates();
42 ofst->SetInputSymbols(ifst.InputSymbols());
43 ofst->SetOutputSymbols(ifst.OutputSymbols());
45 StateId ostart = ofst->AddState();
46 ofst->SetStart(ostart);
53 while (ofst->NumStates() <= os)
54 ofst->AddState();
56 ofst->SetFinal(os, RevWeight::One());
61 ofst->AddArc(0, oarc)
[all...] |
| randgen.h | 106 int64 dest; // 'ofst' state to append
117 void RandGen(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,
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->SetFinal(opts.dest, Weight::One())
[all...] |
| shortest-path.h | 50 // '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' contains the n-shortest paths in 'ifst'. 'distance' return
[all...] |
| /external/openfst/src/script/ |
| concat.cc | 24 void Concat(MutableFstClass *ofst, const FstClass &ifst) {
25 if (!ArcTypesMatch(*ofst, ifst, "Concat")) return;
27 ConcatArgs1 args(ofst, ifst);
29 Apply<Operation<ConcatArgs1> >("Concat", ofst->ArcType(), &args);
32 void Concat(const FstClass &ifst, MutableFstClass *ofst) {
33 if (!ArcTypesMatch(ifst, *ofst, "Concat")) return;
35 ConcatArgs2 args(ifst, ofst);
37 Apply<Operation<ConcatArgs2> >("Concat", ofst->ArcType(), &args);
|
| compose.cc | 26 MutableFstClass *ofst, ComposeFilter compose_filter) {
28 !ArcTypesMatch(*ofst, ifst1, "Compose")) return;
30 ComposeArgs1 args(ifst1, ifst2, ofst, compose_filter);
35 MutableFstClass *ofst, const ComposeOptions &copts) {
37 !ArcTypesMatch(*ofst, ifst1, "Compose")) return;
39 ComposeArgs2 args(ifst1, ifst2, ofst, copts);
|
| difference.cc | 25 MutableFstClass *ofst, ComposeFilter compose_filter) {
27 !ArcTypesMatch(*ofst, ifst1, "Difference")) return;
29 DifferenceArgs1 args(ifst1, ifst2, ofst, compose_filter);
34 MutableFstClass *ofst, const ComposeOptions &copts) {
36 !ArcTypesMatch(*ofst, ifst1, "Difference")) return;
38 DifferenceArgs2 args(ifst1, ifst2, ofst, copts);
|
| intersect.cc | 25 MutableFstClass *ofst, ComposeFilter compose_filter) {
27 !ArcTypesMatch(*ofst, ifst1, "Intersect")) return;
29 IntersectArgs1 args(ifst1, ifst2, ofst, compose_filter);
34 MutableFstClass *ofst, const ComposeOptions &copts) {
36 !ArcTypesMatch(*ofst, ifst1, "Intersect")) return;
38 IntersectArgs2 args(ifst1, ifst2, ofst, copts);
|
| push.cc | 25 void Push(MutableFstClass *ofst, ReweightType dir, float delta,
27 PushArgs1 args(ofst, dir, delta, remove_total_weight);
28 Apply<Operation<PushArgs1> >("Push", ofst->ArcType(), &args);
32 void Push(const FstClass &ifst, MutableFstClass *ofst, uint32 flags,
34 if (!ArcTypesMatch(ifst, *ofst, "Push")) return;
36 PushArgs2 args(ifst, ofst, flags, dir, delta);
|
| shortest-path.cc | 24 void ShortestPath(const FstClass &ifst, MutableFstClass *ofst,
27 if (!ArcTypesMatch(ifst, *ofst, "ShortestPath")) return;
29 ShortestPathArgs1 args(ifst, ofst, distance, opts);
33 void ShortestPath(const FstClass &ifst, MutableFstClass *ofst,
36 if (!ArcTypesMatch(ifst, *ofst, "ShortestPath")) return;
38 ShortestPathArgs2 args(ifst, ofst, n, unique, first_path, weight_threshold,
|
| relabel.cc | 25 void Relabel(MutableFstClass *ofst,
30 RelabelArgs1 args(ofst, old_isyms, relabel_isyms, attach_new_isyms,
32 Apply<Operation<RelabelArgs1> >("Relabel", ofst->ArcType(), &args);
36 void Relabel(MutableFstClass *ofst,
39 RelabelArgs2 args(ofst, ipairs, opairs);
41 Apply<Operation<RelabelArgs2> >("Relabel", ofst->ArcType(), &args);
|
| replace.cc | 25 MutableFstClass *ofst, const int64 &root,
33 if (!ArcTypesMatch(*tuples[0].second, *ofst, "Replace")) return;
35 ReplaceArgs args(tuples, ofst, root, epsilon_on_replace);
37 Apply<Operation<ReplaceArgs> >("Replace", ofst->ArcType(), &args);
|
| /external/openfst/src/include/fst/ |
| reverse.h | 43 void Reverse(const Fst<Arc> &ifst, MutableFst<RevArc> *ofst) {
48 ofst->DeleteStates();
49 ofst->SetInputSymbols(ifst.InputSymbols());
50 ofst->SetOutputSymbols(ifst.OutputSymbols());
52 ofst->ReserveStates(CountStates(ifst) + 1);
54 StateId ostart = ofst->AddState();
55 ofst->SetStart(ostart);
62 while (ofst->NumStates() <= os)
63 ofst->AddState();
65 ofst->SetFinal(os, RevWeight::One())
[all...] |
| shortest-path.h | 67 // '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->SetProperties(kError, kError)
[all...] |
| /external/openfst/src/include/fst/script/ |
| push.h | 32 MutableFst<Arc> *ofst = args->arg1->GetMutableFst<Arc>(); local
35 fst::Push(ofst, REWEIGHT_TO_FINAL, args->arg3, args->arg4);
37 fst::Push(ofst, REWEIGHT_TO_INITIAL, args->arg3, args->arg4);
48 MutableFst<Arc> *ofst = args->arg2->GetMutableFst<Arc>(); local
51 fst::Push<Arc, REWEIGHT_TO_FINAL>(ifst, ofst, args->arg3, args->arg5);
53 fst::Push<Arc, REWEIGHT_TO_INITIAL>(ifst, ofst, args->arg3, args->arg5);
58 void Push(MutableFstClass *ofst, ReweightType type, float delta = kDelta,
62 void Push(const FstClass &ifst, MutableFstClass *ofst, uint32 flags,
|
| concat.h | 32 MutableFst<Arc> *ofst = args->arg1->GetMutableFst<Arc>(); local
35 Concat(ofst, ifst);
41 MutableFst<Arc> *ofst = args->arg2->GetMutableFst<Arc>(); local
43 Concat(ifst, ofst);
46 void Concat(MutableFstClass *ofst, const FstClass &ifst);
47 void Concat(const FstClass &ifst, MutableFstClass *ofst);
|
| compose.h | 34 MutableFst<Arc> *ofst = args->arg3->GetMutableFst<Arc>(); local
36 Compose(ifst1, ifst2, ofst, args->arg4);
48 MutableFst<Arc> *ofst = args->arg3->GetMutableFst<Arc>(); local
50 Compose(ifst1, ifst2, ofst, args->arg4);
54 MutableFstClass *ofst,
58 MutableFstClass *ofst, ComposeFilter compose_filter);
|
| difference.h | 35 MutableFst<Arc> *ofst = args->arg3->GetMutableFst<Arc>(); local
37 Difference(ifst1, ifst2, ofst, args->arg4);
47 MutableFst<Arc> *ofst = args->arg3->GetMutableFst<Arc>(); local
49 Difference(ifst1, ifst2, ofst, args->arg4);
54 MutableFstClass *ofst,
58 MutableFstClass *ofst,
|
| intersect.h | 35 MutableFst<Arc> *ofst = args->arg3->GetMutableFst<Arc>(); local
37 Intersect(ifst1, ifst2, ofst, args->arg4);
47 MutableFst<Arc> *ofst = args->arg3->GetMutableFst<Arc>(); local
49 Intersect(ifst1, ifst2, ofst, args->arg4);
53 MutableFstClass *ofst,
57 MutableFstClass *ofst,
|
| randgen.h | 39 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),
|
| relabel.h | 41 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,
|
| epsnormalize.h | 33 MutableFst<Arc> *ofst = args->arg2->GetMutableFst<Arc>(); local
35 EpsNormalize(ifst, ofst, args->arg3);
38 void EpsNormalize(const FstClass &ifst, MutableFstClass *ofst,
|
| project.h | 31 MutableFst<Arc> *ofst = args->arg1->GetMutableFst<Arc>(); local
33 Project(ofst, args->arg2);
36 void Project(MutableFstClass *ofst, ProjectType project_type);
|
| shortest-path.h | 59 MutableFst<Arc> *ofst = args->arg2->GetMutableFst<Arc>(); local
78 ShortestPath(ifst, ofst, &weights, spopts);
90 ShortestPath(ifst, ofst, &weights, spopts);
102 ShortestPath(ifst, ofst, &weights, spopts);
114 ShortestPath(ifst, ofst, &weights, spopts);
126 ShortestPath(ifst, ofst, &weights, spopts);
138 ShortestPath(ifst, ofst, &weights, spopts);
144 ofst->SetProperties(kError, kError);
162 MutableFst<Arc> *ofst = args->arg2->GetMutableFst<Arc>(); local
166 ShortestPath(ifst, ofst, args->arg3, args->arg4, args->arg5
[all...] |
| /external/openfst/src/extensions/pdt/ |
| pdtscript.cc | 43 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, parens, root)
[all...] |
| /external/openfst/src/bin/ |
| fstconvert.cc | 48 FstClass *ofst = ifst;
49 if (!ofst) return 1;
51 if (ofst->FstType() != FLAGS_fst_type) {
52 ofst = s::Convert(*ifst, FLAGS_fst_type);
55 ofst->Write(out_name);
|
