/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
expanded-fst.h | 30 typedef A Arc; 57 << "\" (arc type = \"" << A::Type() 81 template <class Arc> 82 typename Arc::StateId CountStates(const Fst<Arc> &fst) { 84 const ExpandedFst<Arc> *efst = down_cast<const ExpandedFst<Arc> *>(&fst); 87 typename Arc::StateId nstates = 0; 88 for (StateIterator< Fst<Arc> > siter(fst); !siter.Done(); siter.Next())
|
invert.h | 27 // Mapper to implement inversion of an arc. 31 A operator()(const A &arc) { 32 return A(arc.olabel, arc.ilabel, arc.weight, arc.nextstate); 48 template<class Arc> inline 49 void Invert(MutableFst<Arc> *fst) { Map(fst, InvertMapper<Arc>()); } 59 // time and to visit an input state or arc is assumed and exclusiv [all...] |
arc.h | 0 // arc.h 17 // Commonly used Fst arc types. 28 // Arc with integer labels and state Ids and float weights over the 40 static const string &Type() { // Arc type name 52 // Arc with integer labels and state Ids and float weights over the 64 static const string &Type() { // Arc type name 76 // Arc with integer labels and state Ids and string weights. 89 static const string &Type() { // Arc type name 105 // Arc with label and state Id type the same as template arg and with 109 typedef A Arc; [all...] |
closure.h | 38 template<class Arc> 39 void Closure(MutableFst<Arc> *fst, ClosureType closure_type) { 40 typedef typename Arc::StateId StateId; 41 typedef typename Arc::Label Label; 42 typedef typename Arc::Weight Weight; 46 for (StateIterator< MutableFst<Arc> > siter(*fst); 52 fst->AddArc(s, Arc(0, 0, final, start)); 59 fst->AddArc(nstart, Arc(0, 0, Weight::One(), start)); 67 template<class Arc> 68 void Closure(RationalFst<Arc> *fst, ClosureType closure_type) [all...] |
difference.h | 48 typedef A Arc; 127 template<class Arc> 128 void Difference(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2, 129 MutableFst<Arc> *ofst, 133 *ofst = DifferenceFst<Arc>(ifst1, ifst2, nopts);
|
intersect.h | 45 typedef A Arc; 117 template<class Arc> 118 void Intersect(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2, 119 MutableFst<Arc> *ofst, 123 *ofst = IntersectFst<Arc>(ifst1, ifst2, nopts);
|
project.h | 31 // Mapper to implement projection per arc. 37 A operator()(const A &arc) { 39 ? arc.ilabel : arc.olabel; 40 return A(label, label, arc.weight, arc.nextstate); 62 template<class Arc> inline 63 void Project(MutableFst<Arc> *fst, ProjectType project_type) { 64 Map(fst, ProjectMapper<Arc>(project_type)); 68 // Projects an FST onto its domain or range by either copying each arc' [all...] |
topsort.h | 35 typedef A Arc; 51 bool TreeArc(StateId s, const A &arc) { return true; } 53 bool BackArc(StateId s, const A &arc) { return (*acyclic_ = false); } 55 bool ForwardOrCrossArc(StateId s, const A &arc) { return true; } 85 template <class Arc> 86 bool TopSort(MutableFst<Arc> *fst) { 87 typedef typename Arc::StateId StateId; 92 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
|
concat.h | 38 template<class Arc> 39 void Concat(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) { 40 typedef typename Arc::StateId StateId; 41 typedef typename Arc::Label Label; 42 typedef typename Arc::Weight Weight; 53 for (StateIterator< Fst<Arc> > siter2(fst2); 59 for (ArcIterator< Fst<Arc> > aiter(fst2, s2); 62 Arc arc = aiter.Value() local [all...] |
mutable-fst.h | 18 // and mutable arc iterator interface. 35 typedef A Arc; 46 virtual void AddArc(StateId, const A &arc) = 0; // Add an arc to state 90 << "\" (arc type = \"" << A::Type() 108 // For generic mutuble arc iterator construction; not normally called 114 // Mutable arc iterator interface, templated on the Arc definition. 118 typedef A Arc; 119 virtual void SetValue(const A &arc) = 0; // Set current arc's content [all...] |
union.h | 36 template <class Arc> 37 void Union(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) { 38 typedef typename Arc::StateId StateId; 39 typedef typename Arc::Label Label; 40 typedef typename Arc::Weight Weight; 51 for (StateIterator< Fst<Arc> > siter(fst2); 57 for (ArcIterator< Fst<Arc> > aiter(fst2, s2); 60 Arc arc = aiter.Value() local [all...] |
/external/openfst/src/include/fst/ |
closure.h | 45 template<class Arc> 46 void Closure(MutableFst<Arc> *fst, ClosureType closure_type) { 47 typedef typename Arc::StateId StateId; 48 typedef typename Arc::Label Label; 49 typedef typename Arc::Weight Weight; 53 for (StateIterator< MutableFst<Arc> > siter(*fst); 59 fst->AddArc(s, Arc(0, 0, final, start)); 67 fst->AddArc(nstart, Arc(0, 0, Weight::One(), start)); 75 template<class Arc> 76 void Closure(RationalFst<Arc> *fst, ClosureType closure_type) [all...] |
difference.h | 67 typedef A Arc; 159 template<class Arc> 160 void Difference(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2, 161 MutableFst<Arc> *ofst, 163 typedef Matcher< Fst<Arc> > M; 168 *ofst = DifferenceFst<Arc>(ifst1, ifst2, nopts); 170 DifferenceFstOptions<Arc> dopts; 172 *ofst = DifferenceFst<Arc>(ifst1, ifst2, dopts); 174 DifferenceFstOptions<Arc, M, AltSequenceComposeFilter<M> > dopts [all...] |
intersect.h | 66 typedef A Arc; 142 template<class Arc> 143 void Intersect(const Fst<Arc> &ifst1, const Fst<Arc> &ifst2, 144 MutableFst<Arc> *ofst, 146 typedef Matcher< Fst<Arc> > M; 151 *ofst = IntersectFst<Arc>(ifst1, ifst2, nopts); 153 IntersectFstOptions<Arc> iopts; 155 *ofst = IntersectFst<Arc>(ifst1, ifst2, iopts); 157 IntersectFstOptions<Arc, M, AltSequenceComposeFilter<M> > iopts [all...] |
invert.h | 24 #include <fst/arc-map.h> 30 // Mapper to implement inversion of an arc. 34 A operator()(const A &arc) { 35 return A(arc.olabel, arc.ilabel, arc.weight, arc.nextstate); 55 template<class Arc> inline 56 void Invert(MutableFst<Arc> *fst) { 59 ArcMap(fst, InvertMapper<Arc>()); [all...] |
map.h | 26 #include <fst/arc-map.h> 56 typedef B Arc; 108 A operator()(const A &arc) const { return arc; }
|
register.h | 84 // from 'Fst<Arc>' for this to work. 87 : public GenericRegisterer<FstRegister<typename F::Arc> > { 89 typedef typename F::Arc Arc; 90 typedef typename FstRegister<Arc>::Entry Entry; 91 typedef typename FstRegister<Arc>::Reader Reader; 94 GenericRegisterer<FstRegister<typename F::Arc> >( 106 static Fst<Arc> *Convert(const Fst<Arc> &fst) { return new F(fst); } 124 << "\" (arc type = \"" << atype << "\")" [all...] |
topsort.h | 40 typedef A Arc; 56 bool TreeArc(StateId s, const A &arc) { return true; } 58 bool BackArc(StateId s, const A &arc) { return (*acyclic_ = false); } 60 bool ForwardOrCrossArc(StateId s, const A &arc) { return true; } 90 template <class Arc> 91 bool TopSort(MutableFst<Arc> *fst) { 92 typedef typename Arc::StateId StateId; 97 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
|
concat.h | 46 template<class Arc> 47 void Concat(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) { 48 typedef typename Arc::StateId StateId; 49 typedef typename Arc::Label Label; 50 typedef typename Arc::Weight Weight; 75 for (StateIterator< Fst<Arc> > siter2(fst2); 82 for (ArcIterator< Fst<Arc> > aiter(fst2, s2); 85 Arc arc = aiter.Value() local 152 Arc arc = aiter.Value(); local [all...] |
expanded-fst.h | 37 typedef A Arc; 65 << "\" (arc type = \"" << A::Type() 124 template < class I, class F = ExpandedFst<typename I::Arc> > 127 typedef typename I::Arc Arc; 128 typedef typename Arc::Weight Weight; 129 typedef typename Arc::StateId StateId; 165 ImplToExpandedFst<I, F> &operator=(const Fst<Arc> &fst) { 174 template <class Arc> 175 typename Arc::StateId CountStates(const Fst<Arc> &fst) [all...] |
project.h | 24 #include <fst/arc-map.h> 34 // Mapper to implement projection per arc. 40 A operator()(const A &arc) { 42 ? arc.ilabel : arc.olabel; 43 return A(label, label, arc.weight, arc.nextstate); 76 template<class Arc> inline 77 void Project(MutableFst<Arc> *fst, ProjectType project_type) { 78 ArcMap(fst, ProjectMapper<Arc>(project_type)) [all...] |
union.h | 43 template <class Arc> 44 void Union(MutableFst<Arc> *fst1, const Fst<Arc> &fst2) { 45 typedef typename Arc::StateId StateId; 46 typedef typename Arc::Label Label; 47 typedef typename Arc::Weight Weight; 75 for (StateIterator< Fst<Arc> > siter(fst2); 82 for (ArcIterator< Fst<Arc> > aiter(fst2, s2); 85 Arc arc = aiter.Value() local [all...] |
arc.h | 0 // arc.h 20 // Commonly used Fst arc types. 74 // Arc with integer labels and state Ids and string weights. 87 static const string &Type() { // Arc type name 103 // Arc with label and state Id type the same as template arg and with 107 typedef A Arc; 117 GallicArc(const A &arc) 118 : ilabel(arc.ilabel), olabel(arc.ilabel), 119 weight(arc.olabel, arc.weight), nextstate(arc.nextstate) { [all...] |
arcsort.h | 36 template <class Arc, class Compare> 39 typedef Arc FromArc; 40 typedef Arc ToArc; 42 typedef typename Arc::StateId StateId; 43 typedef typename Arc::Weight Weight; 45 ArcSortMapper(const Fst<Arc> &fst, const Compare &comp) 49 ArcSortMapper(const ArcSortMapper<Arc, Compare> &mapper, 50 const Fst<Arc> *fst = 0) 60 for (ArcIterator< Fst<Arc> > aiter(fst_, s); !aiter.Done(); aiter.Next()) 66 const Arc &Value() const { return arcs_[i_]; [all...] |
/external/openfst/src/include/fst/extensions/far/ |
compile-strings.h | 38 // for (StringReader<Arc> reader(...); !reader.Done(); reader.Next()) { 44 typedef A Arc; 128 template <class Arc> 142 typename StringReader<Arc>::EntryType entry_type; 144 entry_type = StringReader<Arc>::LINE; 146 entry_type = StringReader<Arc>::FILE; 152 typename StringCompiler<Arc>::TokenType token_type; 154 token_type = StringCompiler<Arc>::SYMBOL; 156 token_type = StringCompiler<Arc>::BYTE; 158 token_type = StringCompiler<Arc>::UTF8 [all...] |