Searched defs:Arc (Results 1 - 25 of 32) sorted by relevance

12

/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dexpanded-fst.h30 typedef A Arc; typedef in class:fst::ExpandedFst
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())
H A Dinvert.h48 template<class Arc> inline
49 void Invert(MutableFst<Arc> *fst) { Map(fst, InvertMapper<Arc>()); }
64 typedef A Arc; typedef in class:fst::InvertFst
H A Darc.h28 // 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; typedef in struct:fst::GallicArc
123 static const string &Type() { // Arc type name
139 // Arc wit
141 typedef A Arc; typedef in struct:fst::ReverseArc
[all...]
H A Dclosure.h38 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> *fs
100 typedef A Arc; typedef in class:fst::ClosureFst
[all...]
H A Dconcat.h38 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();
74 fst1->AddArc(s1, Arc(
109 typedef A Arc; typedef in class:fst::ConcatFst
[all...]
H A Ddifference.h48 typedef A Arc; typedef in class:fst::DifferenceFst
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);
H A Dintersect.h45 typedef A Arc; typedef in class:fst::IntersectFst
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);
H A Dproject.h62 template<class Arc> inline
63 void Project(MutableFst<Arc> *fst, ProjectType project_type) {
64 Map(fst, ProjectMapper<Arc>(project_type));
81 typedef A Arc; typedef in class:fst::ProjectFst
H A Dtopsort.h35 typedef A Arc; typedef in class:fst::TopOrderVisitor
85 template <class Arc>
86 bool TopSort(MutableFst<Arc> *fst) {
87 typedef typename Arc::StateId StateId;
92 TopOrderVisitor<Arc> top_order_visitor(&order, &acyclic);
H A Dunion.h36 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();
73 fst1->AddArc(start1, Arc(
111 typedef A Arc; typedef in class:fst::UnionFst
[all...]
H A Dconnect.h33 typedef A Arc; typedef in class:fst::SccVisitor
34 typedef typename Arc::Weight Weight;
201 template<class Arc>
202 void Connect(MutableFst<Arc> *fst) {
203 typedef typename Arc::StateId StateId;
208 SccVisitor<Arc> scc_visitor(0, &access, &coaccess, &props);
H A Dmutable-fst.h35 typedef A Arc; typedef in class:fst::MutableFst
114 // Mutable arc iterator interface, templated on the Arc definition.
118 typedef A Arc; typedef in class:fst::MutableArcIteratorBase
140 class MutableArcIterator : public MutableArcIteratorBase<typename F::Arc> {
142 typedef typename F::Arc Arc; typedef in class:fst::MutableArcIterator
143 typedef typename Arc::StateId StateId;
151 const Arc& Value() const { return data_.base->Value(); }
155 void SetValue(const Arc &a) { data_.base->SetValue(a); }
158 MutableArcIteratorData<Arc> data
[all...]
H A Dregister.h127 // from 'Fst<Arc>' for this to work.
131 typedef typename F::Arc Arc; typedef in class:fst::FstRegisterer
132 typedef typename FstRegister<Arc>::Entry Entry;
133 typedef typename FstRegister<Arc>::Reader Reader;
142 FstRegister<Arc> *registr = FstRegister<Arc>::GetRegister();
147 static Fst<Arc> *Convert(const Fst<Arc> &fst) { return new F(fst); }
H A Darcsort.h42 template<class Arc, class Compare>
43 void ArcSort(MutableFst<Arc> *fst, Compare comp) {
44 typedef typename Arc::StateId StateId;
48 vector<Arc> arcs;
49 for (StateIterator< MutableFst<Arc> > siter(*fst);
54 for (ArcIterator< MutableFst<Arc> > aiter(*fst, s);
190 typedef A Arc; typedef in class:fst::ArcSortFst
307 typedef StdArc Arc; typedef in class:fst::StdArcSortFst
H A Dcomplement.h113 typedef A Arc; typedef in class:fst::ComplementFst
H A Drational.h196 typedef A Arc; typedef in class:fst::RationalFst
H A Drelabel.h323 typedef A Arc; typedef in class:fst::RelabelFst
H A Dcache.h61 using FstImpl<typename S::Arc>::Type;
66 typedef typename S::Arc Arc; typedef in class:fst::CacheBaseImpl
67 typedef typename Arc::Weight Weight;
68 typedef typename Arc::StateId StateId;
140 cache_first_state_->arcs.capacity() * sizeof(Arc);
170 void AddArc(StateId s, const Arc &arc) {
178 vector<Arc> &arcs = state->arcs;
181 const Arc &arc = arcs[a];
192 cache_size_ += arcs.capacity() * sizeof(Arc);
349 typedef A Arc; typedef in struct:fst::CacheState
392 typedef typename F::Arc Arc; typedef in class:fst::CacheStateIterator
431 typedef typename F::Arc Arc; typedef in class:fst::CacheArcIterator
[all...]
H A Dconst-fst.h31 // Arc definition.
227 typedef A Arc; typedef in class:fst::ConstFst
H A Dencode.h341 typedef A Arc; typedef in class:fst::EncodeFst
366 typedef A Arc; typedef in class:fst::DecodeFst
H A Dfactor-weight.h147 typedef A Arc; typedef in class:fst::FactorWeightFstImpl
266 AddArc(s, Arc(arc.ilabel, arc.olabel, w, d));
272 AddArc(s, Arc(arc.ilabel, arc.olabel, p.first, d));
288 AddArc(s, Arc(0, 0, p.first, d));
344 typedef A Arc; typedef in class:fst::FactorWeightFst
H A Dqueue.h289 template <class Arc, class ArcFilter>
291 TopOrderQueue(const Fst<Arc> &fst, ArcFilter filter)
295 TopOrderVisitor<Arc> top_order_visitor(&order_, &acyclic);
504 template <class Arc, class ArcFilter>
505 AutoQueue(const Fst<Arc> &fst, const vector<typename Arc::Weight> *distance,
507 typedef typename Arc::Weight Weight;
525 SccVisitor<Arc> scc_visitor(&scc_, 0, 0, &props);
615 template <class Arc, class ArcFilter, class Less>
616 static void SccQueueType(const Fst<Arc>
651 typedef A Arc; typedef
[all...]
H A Dsynchronize.h51 typedef A Arc; typedef in class:fst::SynchronizeFstImpl
220 AddArc(s, Arc(Car(e.istring, arc.ilabel),
226 AddArc(s, Arc(0 , 0, arc.weight, d));
236 AddArc(s, Arc(Car(e.istring), Car(e.ostring), w, d));
326 typedef A Arc; typedef in class:fst::SynchronizeFst
450 template<class Arc>
451 void Synchronize(const Fst<Arc> &ifst, MutableFst<Arc> *ofst) {
454 *ofst = SynchronizeFst<Arc>(ifst, opts);
H A Dmap.h265 typedef B Arc; typedef in class:fst::MapFstImpl
459 typedef B Arc; typedef in class:fst::MapFst
/external/srec/tools/grxmlcompile/
H A Dfst-io.h43 typedef A Arc; typedef in class:fst::FstPrinter
112 Arc arc = aiter.Value();
149 template <class Arc>
152 Fst<Arc> *fst = Fst<Arc>::Read(istrm, opts);
189 FstPrinter<Arc> fstprinter(*fst, isyms, osyms, ssyms, FLAGS_acceptor);
207 typedef A Arc; typedef in class:fst::FstReader
239 Arc arc;
366 template <class Arc>
396 FstReader<Arc> fstreade
[all...]

Completed in 158 milliseconds

12