/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | closure.h | 22 #include "fst/lib/mutable-fst.h" 23 #include "fst/lib/rational.h" 25 namespace fst { namespace 39 void Closure(MutableFst<Arc> *fst, ClosureType closure_type) { argument 44 uint64 props = fst->Properties(kFstProperties, false); 45 StateId start = fst->Start(); 46 for (StateIterator< MutableFst<Arc> > siter(*fst); 50 Weight final = fst->Final(s); 52 fst 68 Closure(RationalFst<Arc> *fst, ClosureType closure_type) argument 102 ClosureFst(const Fst<A> &fst, ClosureType closure_type) argument 106 ClosureFst(const Fst<A> &fst, const ClosureFstOptions &opts) argument 111 ClosureFst(const ClosureFst<A> &fst) argument 121 StateIterator(const ClosureFst<A> &fst) argument 132 ArcIterator(const ClosureFst<A> &fst, StateId s) argument [all...] |
H A D | rmfinalepsilon.h | 24 #include "fst/lib/connect.h" 25 #include "fst/lib/mutable-fst.h" 27 namespace fst { namespace 30 void RmFinalEpsilon(MutableFst<A>* fst) { argument 39 DfsVisit(*fst, &scc_visitor); 45 for (StateIterator<Fst<A> > siter(*fst); !siter.Done(); siter.Next()) { 47 if (fst->Final(s) != Weight::Zero()) { 49 for (ArcIterator<Fst<A> > aiter(*fst, s); !aiter.Done(); aiter.Next()) { 64 for (StateIterator<Fst<A> > siter(*fst); !site [all...] |
H A D | invert.h | 22 #include "fst/lib/map.h" 23 #include "fst/lib/mutable-fst.h" 25 namespace fst { namespace 49 void Invert(MutableFst<Arc> *fst) { Map(fst, InvertMapper<Arc>()); } argument 67 explicit InvertFst(const Fst<A> &fst) : MapFst<A, A, C>(fst, C()) {} argument 69 InvertFst(const InvertFst<A> &fst) : MapFst<A, A, C>(fst) {} argument 80 StateIterator(const InvertFst<A> &fst) argument 90 ArcIterator(const InvertFst<A> &fst, typename A::StateId s) argument [all...] |
/external/openfst/src/extensions/far/ |
H A D | farcompilestrings.cc | 24 #include <fst/extensions/far/farscript.h> 25 #include <fst/extensions/far/main.h> 35 "FAR file format type: one of: \"default\", \"fst\", " 56 namespace s = fst::script; 75 fst::FarEntryType fet = fst::StringToFarEntryType(FLAGS_entry_type); 76 fst::FarTokenType ftt = fst::StringToFarTokenType(FLAGS_token_type); 77 fst::FarType far_type = fst [all...] |
H A D | stlist.cc | 17 #include <fst/extensions/far/stlist.h> 19 namespace fst { namespace 31 } // namespace fst
|
H A D | strings.cc | 17 #include <fst/extensions/far/compile-strings.h> 25 namespace fst { namespace 40 } // namespace fst
|
H A D | sttable.cc | 17 #include <fst/extensions/far/sttable.h> 19 namespace fst { namespace 31 } // namespace fst
|
H A D | farequal.cc | 19 // Tests if two Far files contains the same (key,fst) pairs. 21 #include <fst/extensions/far/main.h> 22 #include <fst/extensions/far/farscript.h> 28 DEFINE_double(delta, fst::kDelta, "Comparison/quantization delta"); 31 namespace s = fst::script; 50 filename1, filename2, fst::LoadArcTypeFromFar(filename1),
|
/external/openfst/src/include/fst/script/ |
H A D | push.h | 20 #include <fst/script/arg-packs.h> 21 #include <fst/script/fst-class.h> 22 #include <fst/push.h> 24 namespace fst { namespace 35 fst::Push(ofst, REWEIGHT_TO_FINAL, args->arg3, args->arg4); 37 fst::Push(ofst, REWEIGHT_TO_INITIAL, args->arg3, args->arg4); 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); 66 } // namespace fst [all...] |
H A D | reweight.h | 23 #include <fst/script/arg-packs.h> 24 #include <fst/script/fst-class.h> 25 #include <fst/script/weight-class.h> 26 #include <fst/reweight.h> 28 namespace fst { namespace 36 MutableFst<Arc> *fst = args->arg1->GetMutableFst<Arc>(); local 44 Reweight(fst, potentials, args->arg3); 47 void Reweight(MutableFstClass *fst, const vector<WeightClass> &potential, 51 } // namespace fst [all...] |
H A D | rmepsilon.h | 23 #include <fst/script/arg-packs.h> 24 #include <fst/script/fst-class.h> 25 #include <fst/script/weight-class.h> 26 #include <fst/script/shortest-distance.h> // for ShortestDistanceOptions 27 #include <fst/rmepsilon.h> 28 #include <fst/queue.h> 33 %include "nlp/fst/script/shortest-distance.h" 37 namespace fst { namespace 44 struct RmEpsilonOptions : public fst 49 RmEpsilonOptions(QueueType qt = AUTO_QUEUE, float d = kDelta, bool c = true, WeightClass w = fst::script::WeightClass::Zero(), int64 n = kNoStateId) argument 65 RmEpsilonHelper(MutableFst<Arc> *fst, vector<typename Arc::Weight> *distance, const RmEpsilonOptions &opts) argument 159 MutableFst<Arc> *fst = args->arg1->GetMutableFst<Arc>(); local 171 MutableFst<Arc> *fst = args->arg1->GetMutableFst<Arc>(); local [all...] |
/external/openfst/src/bin/ |
H A D | fstdraw.cc | 22 #include <fst/script/draw.h> 46 namespace s = fst::script; 47 using fst::ostream; 48 using fst::SymbolTable; 52 usage += " [binary.fst [text.dot]]\n"; 63 s::FstClass *fst = s::FstClass::Read(in_name); local 64 if (!fst) return 1; 70 ostrm = new fst::ofstream(argv[2]); 80 fst::SymbolTableTextOptions opts; 99 isyms = fst [all...] |
H A D | fstprint.cc | 23 #include <fst/script/print.h> 38 namespace s = fst::script; 39 using fst::ostream; 40 using fst::SymbolTable; 44 usage += " [binary.fst [text.fst]]\n"; 56 s::FstClass *fst = s::FstClass::Read(in_name); local 57 if (!fst) return 1; 63 ostrm = new fst::ofstream(argv[2]); 73 fst [all...] |
H A D | fstdeterminize.cc | 23 #include <fst/script/determinize.h> 25 DEFINE_double(delta, fst::kDelta, "Comparison/quantization delta"); 26 DEFINE_int64(nstate, fst::kNoStateId, "State number threshold"); 33 namespace s = fst::script; 34 using fst::script::FstClass; 35 using fst::script::MutableFstClass; 36 using fst::script::VectorFstClass; 37 using fst::script::WeightClass; 41 usage += " [in.fst [out.fst]]\ [all...] |
/external/openfst/src/include/fst/ |
H A D | topsort.h | 29 #include <fst/dfs-visit.h> 30 #include <fst/fst.h> 31 #include <fst/statesort.h> 34 namespace fst { namespace 49 void InitVisit(const Fst<A> &fst) { argument 91 bool TopSort(MutableFst<Arc> *fst) { argument 98 DfsVisit(*fst, &top_order_visitor); 101 StateSort(fst, order); 102 fst [all...] |
H A D | verify.h | 24 #include <fst/fst.h> 25 #include <fst/test-properties.h> 28 namespace fst { namespace 32 bool Verify(const Fst<Arc> &fst, bool allow_negative_labels = false) { argument 37 StateId start = fst.Start(); 38 const SymbolTable *isyms = fst.InputSymbols(); 39 const SymbolTable *osyms = fst.OutputSymbols(); 43 for (StateIterator< Fst<Arc> > siter(fst); 56 for (StateIterator< Fst<Arc> > siter(fst); [all...] |
H A D | map.h | 26 #include <fst/arc-map.h> 29 namespace fst { namespace 32 void Map(MutableFst<A> *fst, C* mapper) { argument 33 ArcMap(fst, mapper); 37 void Map(MutableFst<A> *fst, C mapper) { argument 38 ArcMap(fst, mapper); 61 MapFst(const Fst<A> &fst, const C &mapper, const MapFstOptions& opts) argument 62 : ArcMapFst<A, B, C>(fst, mapper, opts) {} 64 MapFst(const Fst<A> &fst, C* mapper, const MapFstOptions& opts) argument 65 : ArcMapFst<A, B, C>(fst, mappe 67 MapFst(const Fst<A> &fst, const C &mapper) argument 70 MapFst(const Fst<A> &fst, C* mapper) argument 73 MapFst(const ArcMapFst<A, B, C> &fst, bool safe = false) argument 88 StateIterator(const ArcMapFst<A, B, C> &fst) argument 98 ArcIterator(const ArcMapFst<A, B, C> &fst, typename A::StateId s) argument [all...] |
H A D | project.h | 24 #include <fst/arc-map.h> 25 #include <fst/mutable-fst.h> 28 namespace fst { namespace 77 void Project(MutableFst<Arc> *fst, ProjectType project_type) { argument 78 ArcMap(fst, ProjectMapper<Arc>(project_type)); 80 fst->SetOutputSymbols(fst->InputSymbols()); 82 fst->SetInputSymbols(fst 104 ProjectFst(const Fst<A> &fst, ProjectType project_type) argument 113 ProjectFst(const ProjectFst<A> &fst, bool safe = false) argument 128 StateIterator(const ProjectFst<A> &fst) argument 138 ArcIterator(const ProjectFst<A> &fst, typename A::StateId s) argument [all...] |
/external/openfst/src/test/ |
H A D | weight_test.cc | 24 #include <fst/expectation-weight.h> 25 #include <fst/float-weight.h> 26 #include <fst/random-weight.h> 32 using fst::TropicalWeight; 33 using fst::TropicalWeightGenerator; 34 using fst::TropicalWeightTpl; 35 using fst::TropicalWeightGenerator_; 37 using fst::LogWeight; 38 using fst::LogWeightGenerator; 39 using fst [all...] |
/external/openfst/src/extensions/pdt/ |
H A D | pdtshortestpath.cc | 23 #include <fst/extensions/pdt/pdtscript.h> 24 #include <fst/util.h> 34 namespace s = fst::script; 38 usage += " in.pdt [out.fst]\n"; 59 fst::ReadLabelPairs(FLAGS_pdt_parentheses, &parens, false); 63 fst::QueueType qt; 66 qt = fst::FIFO_QUEUE; 68 qt = fst::LIFO_QUEUE; 70 qt = fst::STATE_ORDER_QUEUE;
|
/external/openfst/src/lib/ |
H A D | compat.cc | 21 #include <fst/compat.h> 30 namespace fst { namespace 44 } // namespace fst
|
/external/openfst/src/script/ |
H A D | relabel.cc | 17 #include <fst/script/fst-class.h> 18 #include <fst/script/script-impl.h> 19 #include <fst/script/relabel.h> 21 namespace fst { namespace 45 void Relabel(MutableFstClass *fst, argument 48 RelabelArgs3 args(fst, new_isymbols, new_osymbols); 49 Apply<Operation<RelabelArgs3> >("Relabel", fst->ArcType(), &args); 68 } // namespace fst
|
H A D | script-impl.cc | 19 #include <fst/script/script-impl.h> 21 namespace fst { namespace 39 } // namespace fst
|
H A D | shortest-distance.cc | 17 #include <fst/script/fst-class.h> 18 #include <fst/script/script-impl.h> 19 #include <fst/script/shortest-distance.h> 21 namespace fst { namespace 25 void ShortestDistance(const FstClass &fst, vector<WeightClass> *distance, argument 27 ShortestDistanceArgs1 args(fst, distance, opts); 29 Apply<Operation<ShortestDistanceArgs1> >("ShortestDistance", fst.ArcType(), 66 } // namespace fst
|
/external/srec/srec/include/ |
H A D | search_network.h | 58 #define ARC_XtoI(ARC) ((arcID)((ARC)-fst->FSMarc_list)) 60 #define ARC_ItoX(ARC_ID) (&fst->FSMarc_list[ARC_ID]) 62 #define NODE_XtoI(NOD) ((nodeID)((NOD)-fst->FSMnode_list)) 64 #define NODE_ItoX(NODE_ID) (&fst->FSMnode_list[NODE_ID]) 75 #define TO_NODE(ARC) fst->FSMarc_list[(ARC)].to_node 76 #define NEXT_NODE(NOD) fst->FSMnode_list[(NOD)].un_ptr.next_node 77 #define LINKL_NEXT(ARC) fst->FSMarc_list[(ARC)].linkl_next_arc 78 #define LINKL_PREV(ARC) fst->FSMarc_list[(ARC)].linkl_prev_arc 79 #define FIRST_PREV(NOD) fst->FSMnode_list[(NOD)].first_prev_arc 80 #define FIRST_NEXT(NOD) fst [all...] |