/external/openfst/src/script/ |
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); 30 Apply<Operation<ShortestPathArgs1> >("ShortestPath", ifst.ArcType(), &args); 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, 40 Apply<Operation<ShortestPathArgs2> >("ShortestPath", ifst.ArcType(), &args);
|
concat.cc | 24 void Concat(MutableFstClass *ofst, const FstClass &ifst) { 25 if (!ArcTypesMatch(*ofst, ifst, "Concat")) return; 27 ConcatArgs1 args(ofst, ifst); 32 void Concat(const FstClass &ifst, MutableFstClass *ofst) { 33 if (!ArcTypesMatch(ifst, *ofst, "Concat")) return; 35 ConcatArgs2 args(ifst, ofst);
|
shortest-distance.cc | 34 void ShortestDistance(const FstClass &ifst, vector<WeightClass> *distance, 36 ShortestDistanceArgs2 args(ifst, distance, reverse, delta); 38 Apply<Operation<ShortestDistanceArgs2> >("ShortestDistance", ifst.ArcType(), 43 WeightClass ShortestDistance(const FstClass &ifst) { 44 ShortestDistanceArgs3 args(ifst); 46 Apply<Operation<ShortestDistanceArgs3> >("ShortestDistance", ifst.ArcType(),
|
determinize.cc | 24 void Determinize(const FstClass &ifst, 27 if (!ArcTypesMatch(ifst, *ofst, "Determinize")) return; 29 DeterminizeArgs args(ifst, ofst, opts); 30 Apply<Operation<DeterminizeArgs> >("Determinize", ifst.ArcType(), &args);
|
epsnormalize.cc | 24 void EpsNormalize(const FstClass &ifst, MutableFstClass *ofst, 26 if (!ArcTypesMatch(ifst, *ofst, "EpsNormalize")) return; 28 EpsNormalizeArgs args(ifst, ofst, norm_type); 29 Apply<Operation<EpsNormalizeArgs> >("EpsNormalize", ifst.ArcType(), &args);
|
push.cc | 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); 37 Apply<Operation<PushArgs2> >("Push", ifst.ArcType(), &args);
|
randgen.cc | 24 void RandGen(const FstClass &ifst, MutableFstClass *ofst, int32 seed, 26 if (!ArcTypesMatch(ifst, *ofst, "RandGen")) return; 28 RandGenArgs args(ifst, ofst, seed, opts); 29 Apply<Operation<RandGenArgs> >("RandGen", ifst.ArcType(), &args);
|
synchronize.cc | 24 void Synchronize(const FstClass &ifst, MutableFstClass *ofst) { 25 if (!ArcTypesMatch(ifst, *ofst, "Synchronize")) return; 27 SynchronizeArgs args(ifst, ofst); 28 Apply<Operation<SynchronizeArgs> >("Synchronize", ifst.ArcType(), &args);
|
prune.cc | 33 void Prune(const FstClass &ifst, MutableFstClass *fst, 35 PruneArgs2 args(ifst, fst, opts); 41 void Prune(const FstClass &ifst, 45 PruneArgs3 args(ifst, ofst, weight_threshold, state_threshold, delta); 47 Apply<Operation<PruneArgs3> >("Prune", ifst.ArcType(), &args);
|
/external/openfst/src/include/fst/script/ |
concat.h | 33 const Fst<Arc> &ifst = *(args->arg2.GetFst<Arc>()); local 35 Concat(ofst, ifst); 40 const Fst<Arc> &ifst = *(args->arg1.GetFst<Arc>()); local 43 Concat(ifst, ofst); 46 void Concat(MutableFstClass *ofst, const FstClass &ifst); 47 void Concat(const FstClass &ifst, MutableFstClass *ofst);
|
shortest-path.h | 58 const Fst<Arc> &ifst = *(args->arg1.GetFst<Arc>()); local 73 ArcFilter>::Construct(ifst, &weights); 78 ShortestPath(ifst, ofst, &weights, spopts); 85 ArcFilter>::Construct(ifst, &weights); 90 ShortestPath(ifst, ofst, &weights, spopts); 97 ArcFilter >::Construct(ifst, &weights); 102 ShortestPath(ifst, ofst, &weights, spopts); 109 ArcFilter>::Construct(ifst, &weights); 114 ShortestPath(ifst, ofst, &weights, spopts); 121 ArcFilter>::Construct(ifst, &weights) 161 const Fst<Arc> &ifst = *(args->arg1.GetFst<Arc>()); local [all...] |
randgen.h | 38 const Fst<Arc> &ifst = *(args->arg1.GetFst<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),
|
map.h | 57 const Fst<Arc> &ifst = *(args->args.arg1.GetFst<Arc>()); local 68 script::StateMap(ifst, ArcSumMapper<Arc>(ifst)))); 71 script::ArcMap(ifst, IdentityArcMapper<Arc>()))); 74 script::ArcMap(ifst, InvertWeightMapper<Arc>()))); 77 script::ArcMap(ifst, PlusMapper<Arc>(w)))); 80 script::ArcMap(ifst, QuantizeMapper<Arc>(delta)))); 83 script::ArcMap(ifst, RmWeightMapper<Arc>()))); 86 script::ArcMap(ifst, SuperFinalMapper<Arc>()))); 89 script::ArcMap(ifst, TimesMapper<Arc>(w)))) [all...] |
push.h | 47 const Fst<Arc> &ifst = *(args->arg1.GetFst<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); 62 void Push(const FstClass &ifst, MutableFstClass *ofst, uint32 flags,
|
/external/openfst/src/extensions/pdt/ |
pdtscript.cc | 54 void PdtExpand(const FstClass &ifst, 57 PdtExpandArgs args(ifst, parens, ofst, opts); 59 Apply<Operation<PdtExpandArgs> >("PdtExpand", ifst.ArcType(), &args); 62 void PdtExpand(const FstClass &ifst, 65 PdtExpand(ifst, parens, ofst, PdtExpandOptions(connect)); 84 void PdtReverse(const FstClass &ifst, 87 PdtReverseArgs args(ifst, parens, ofst); 89 Apply<Operation<PdtReverseArgs> >("PdtReverse", ifst.ArcType(), &args); 92 void PdtShortestPath(const FstClass &ifst, 96 PdtShortestPathArgs args(ifst, parens, ofst, opts) [all...] |
pdtreplace.cc | 49 s::FstClass *ifst = s::FstClass::Read(in_fname); local 50 if (!ifst) return 1; 56 fst_tuples.push_back(make_pair(root, ifst)); 59 ifst = s::FstClass::Read(argv[i]); 60 if (!ifst) return 1; 62 fst_tuples.push_back(make_pair(lab, ifst)); 65 s::VectorFstClass ofst(ifst->ArcType());
|
pdtreverse.cc | 44 s::FstClass *ifst = s::FstClass::Read(in_name); local 45 if (!ifst) return 1; 55 s::VectorFstClass ofst(ifst->ArcType()); 56 s::PdtReverse(*ifst, parens, &ofst);
|
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
reverse.h | 36 void Reverse(const Fst<Arc> &ifst, MutableFst<RevArc> *ofst) { 42 ofst->SetInputSymbols(ifst.InputSymbols()); 43 ofst->SetOutputSymbols(ifst.OutputSymbols()); 44 StateId istart = ifst.Start(); 48 for (StateIterator< Fst<Arc> > siter(ifst); 58 Weight final = ifst.Final(is); 64 for (ArcIterator< Fst<Arc> > aiter(ifst, is); 75 uint64 iprops = ifst.Properties(kCopyProperties, false);
|
randgen.h | 105 int64 source; // 'ifst' state to expand 117 void RandGen(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, 121 if (opts.npath == 0 || opts.max_length == 0 || ifst.Start() == kNoStateId) 126 ofst->SetInputSymbols(ifst.InputSymbols()); 127 ofst->SetOutputSymbols(ifst.OutputSymbols()); 130 nopts.source = ifst.Start(); 133 RandGen(ifst, ofst, nopts); 135 if (ifst.NumArcs(opts.source) == 0 && 136 ifst.Final(opts.source) == Weight::Zero()) // Non-coaccessible 139 size_t n = opts.arc_selector(ifst, opts.source) [all...] |
/external/openfst/src/bin/ |
fstreplace.cc | 43 FstClass *ifst = FstClass::Read(in_fname); local 44 if (!ifst) return 1; 50 fst_tuples.push_back(make_pair(root, ifst)); 53 ifst = s::FstClass::Read(argv[i]); 54 if (!ifst) return 1; 56 fst_tuples.push_back(make_pair(lab, ifst)); 59 VectorFstClass ofst(ifst->ArcType());
|
fstconvert.cc | 45 FstClass *ifst = FstClass::Read(in_name); local 46 if (!ifst) return 1; 48 FstClass *ofst = ifst; 52 ofst = s::Convert(*ifst, FLAGS_fst_type);
|
fstepsnormalize.cc | 47 FstClass *ifst = FstClass::Read(in_name); local 48 if (!ifst) return 1; 53 VectorFstClass ofst(ifst->ArcType()); 54 s::EpsNormalize(*ifst, &ofst, eps_norm_type);
|
fstreverse.cc | 50 FstClass *ifst = FstClass::Read(in_name); local 51 if (!ifst) return 1; 53 VectorFstClass *out = new VectorFstClass(ifst->ArcType()); 55 Reverse(*ifst, out);
|
fstsynchronize.cc | 44 FstClass *ifst = FstClass::Read(in_name); local 45 if (!ifst) return 1; 47 VectorFstClass ofst(ifst->ArcType()); 49 s::Synchronize(*ifst, &ofst);
|
/external/openfst/src/include/fst/ |
reverse.h | 43 void Reverse(const Fst<Arc> &ifst, MutableFst<RevArc> *ofst) { 49 ofst->SetInputSymbols(ifst.InputSymbols()); 50 ofst->SetOutputSymbols(ifst.OutputSymbols()); 51 if (ifst.Properties(kExpanded, false)) 52 ofst->ReserveStates(CountStates(ifst) + 1); 53 StateId istart = ifst.Start(); 57 for (StateIterator< Fst<Arc> > siter(ifst); 67 Weight final = ifst.Final(is); 73 for (ArcIterator< Fst<Arc> > aiter(ifst, is); 84 uint64 iprops = ifst.Properties(kCopyProperties, false) [all...] |