| /external/srec/tools/grxmlcompile/ |
| D | fst-io.h | 53 : fst_(fst), isyms_(isyms), osyms_(osyms), ssyms_(ssyms), in FstPrinter()
60 StateId start = fst_.Start(); in Print()
65 for (StateIterator< Fst<A> > siter(fst_); in Print()
109 for (ArcIterator< Fst<A> > aiter(fst_, s); in PrintState()
127 Weight final = fst_.Final(s); in PrintState()
137 const Fst<A> &fst_; variable
234 while (s >= fst_.NumStates()) in FstReader()
235 fst_.AddState(); in FstReader()
237 fst_.SetStart(s); in FstReader()
243 fst_.SetFinal(s, Weight::One()); in FstReader()
[all …]
|
| D | grxmlcompile.cpp | 355 ESR_ReturnCode FstMergeOLabelsToILabels( fst::StdVectorFst& fst_, int max_ilabels ) in FstMergeOLabelsToILabels() argument
357 fst::StdArc::StateId s = fst_.Start(); in FstMergeOLabelsToILabels()
360 for (fst::StateIterator< fst::StdVectorFst> siter(fst_); in FstMergeOLabelsToILabels()
364 for(fst::MutableArcIterator<fst::StdVectorFst> aiter(&fst_, s); in FstMergeOLabelsToILabels()
380 ESR_ReturnCode FstMergeOLabelsToILabels_GetMax( fst::StdVectorFst& fst_, int& max_ilabel ) in FstMergeOLabelsToILabels_GetMax() argument
382 if (fst_.Start() == fst::kNoStateId) return ESR_INVALID_ARGUMENT; in FstMergeOLabelsToILabels_GetMax()
383 for (fst::StateIterator< fst::StdVectorFst> siter(fst_); in FstMergeOLabelsToILabels_GetMax()
385 for(fst::MutableArcIterator<fst::StdVectorFst> aiter(&fst_, siter.Value()); in FstMergeOLabelsToILabels_GetMax()
395 ESR_ReturnCode FstSplitOLabelsFromILabels( fst::StdVectorFst& fst_, int max_ilabels ) in FstSplitOLabelsFromILabels() argument
397 fst::StdArc::StateId s = fst_.Start(); in FstSplitOLabelsFromILabels()
[all …]
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| D | complement.h | 57 explicit ComplementFstImpl(const Fst<A> &fst) : fst_(fst.Copy()) { in ComplementFstImpl()
65 ~ComplementFstImpl() { delete fst_; } in ~ComplementFstImpl() local
68 StateId start = fst_->Start(); in Start()
77 if (s == 0 || fst_->Final(s - 1) == Weight::Zero()) in Final()
87 return fst_->NumArcs(s - 1) + 1; in NumArcs()
91 return s == 0 ? 0 : fst_->NumInputEpsilons(s - 1); in NumInputEpsilons()
95 return s == 0 ? 0 : fst_->NumOutputEpsilons(s - 1); in NumOutputEpsilons()
99 const Fst<A> *fst_;
190 : siter_(*fst.impl_->fst_), s_(0) { in StateIterator()
224 aiter_ = new ArcIterator< Fst<A> >(*fst.impl_->fst_, s - 1); in ArcIterator()
|
| D | map.h | 271 : CacheImpl<B>(opts), fst_(fst.Copy()), in MapFstImpl()
281 : CacheImpl<B>(opts), fst_(fst.Copy()), in MapFstImpl()
291 delete fst_; in ~MapFstImpl() local
297 SetStart(FindOState(fst_->Start())); in Start()
306 B final_arc = (*mapper_)(A(0, 0, fst_->Final(FindIState(s)), in Final()
316 B final_arc = (*mapper_)(A(0, 0, fst_->Final(FindIState(s)), in Final()
362 for (ArcIterator< Fst<A> > aiter(*fst_, FindIState(s)); in Expand()
377 B final_arc = (*mapper_)(A(0, 0, fst_->Final(FindIState(s)), in Expand()
388 B final_arc = (*mapper_)(A(0, 0, fst_->Final(FindIState(s)), in Expand()
403 SetInputSymbols(fst_->InputSymbols()); in Init()
[all …]
|
| D | arcsort.h | 92 : CacheImpl<A>(opts), fst_(fst.Copy()), comp_(comp) { in ArcSortFstImpl()
94 uint64 props = fst_->Properties(kCopyProperties, false); in ArcSortFstImpl()
101 : fst_(impl.fst_->Copy()), comp_(impl.comp_) { in ArcSortFstImpl()
108 ~ArcSortFstImpl() { delete fst_; } in ~ArcSortFstImpl() local
112 SetStart(fst_->Start()); in Start()
118 SetFinal(s, fst_->Final(s)); in Final()
141 fst_->InitStateIterator(data); in InitStateIterator()
151 for (ArcIterator< Fst<A> > aiter(*fst_, s); !aiter.Done(); aiter.Next()) in Expand()
162 const Fst<A> *fst_;
|
| D | cache.h | 395 explicit CacheStateIterator(const F &fst) : fst_(fst), s_(0) {} in CacheStateIterator()
398 if (s_ < fst_.impl_->NumKnownStates()) in Done()
400 fst_.Start(); // force start state in Done()
401 if (s_ < fst_.impl_->NumKnownStates()) in Done()
403 for (int u = fst_.impl_->MinUnexpandedState(); in Done()
404 u < fst_.impl_->NumKnownStates(); in Done()
405 u = fst_.impl_->MinUnexpandedState()) { in Done()
406 ArcIterator<F>(fst_, u); // force state expansion in Done()
407 if (s_ < fst_.impl_->NumKnownStates()) in Done()
420 const F &fst_;
|
| D | shortest-distance.h | 65 : fst_(fst.Copy()), distance_(distance), state_queue_(opts.state_queue), in ShortestDistanceState()
72 delete fst_; in ~ShortestDistanceState() local
78 const Fst<Arc> *fst_;
96 if (fst_->Start() == kNoStateId) in ShortestDistance()
112 source = fst_->Start(); in ShortestDistance()
141 for (ArcIterator< Fst<Arc> > aiter(*fst_, s); in ShortestDistance()
|
| D | minimize.h | 61 : fst_(fst), partition_(partition), flags_(flags) {} in fst_() function
67 const ssize_t xfinal = fst_.Final(x).Hash(); in operator()
68 const ssize_t yfinal = fst_.Final(y).Hash(); in operator()
75 if (fst_.NumArcs(x) < fst_.NumArcs(y)) return true; in operator()
76 if (fst_.NumArcs(x) > fst_.NumArcs(y)) return false; in operator()
80 for (ArcIterator<Fst<A> > aiter1(fst_, x), aiter2(fst_, y); in operator()
99 const Fst<A>& fst_;
|
| D | rmepsilon.h | 65 : fst_(fst), distance_(distance), sd_state_(fst_, distance, opts, true) { in RmEpsilonState()
115 const Fst<Arc> &fst_; variable
151 for (ArcIterator< Fst<Arc> > ait(fst_, state); in Expand()
182 final_ = Plus(final_, Times((*distance_)[state], fst_.Final(state))); in Expand()
333 fst_(fst.Copy()), in RmEpsilonFstImpl()
335 *fst_, in RmEpsilonFstImpl()
346 delete fst_; in ~RmEpsilonFstImpl() local
351 SetStart(fst_->Start()); in Start()
399 const Fst<A> *fst_;
|
| D | factor-weight.h | 163 : CacheImpl<A>(opts), fst_(fst.Copy()), delta_(opts.delta), in FactorWeightFstImpl()
174 delete fst_; in ~FactorWeightFstImpl() local
179 StateId s = fst_->Start(); in Start()
182 StateId start = FindState(Element(fst_->Start(), Weight::One())); in Start()
194 : (Weight) Times(e.weight, fst_->Final(e.state)); in Final()
258 for (ArcIterator< Fst<A> > ait(*fst_, e.state); in Expand()
278 (fst_->Final(e.state) != Weight::Zero())) { in Expand()
281 : Times(e.weight, fst_->Final(e.state)); in Expand()
315 const Fst<A> *fst_; variable
|
| D | synchronize.h | 73 : CacheImpl<A>(opts), fst_(fst.Copy()) { in SynchronizeFstImpl()
83 delete fst_; in ~SynchronizeFstImpl() local
96 StateId s = fst_->Start(); in Start()
100 StateId start = FindState(Element(fst_->Start(), empty, empty)); in Start()
109 Weight w = e.state == kNoStateId ? Weight::One() : fst_->Final(e.state); in Final()
212 for (ArcIterator< Fst<A> > ait(*fst_, e.state); in Expand()
230 Weight w = e.state == kNoStateId ? Weight::One() : fst_->Final(e.state); in Expand()
293 const Fst<A> *fst_; variable
|
| D | relabel.h | 168 : CacheImpl<A>(opts), fst_(fst.Copy()), in RelabelFstImpl()
195 : CacheImpl<A>(opts), fst_(fst.Copy()), in RelabelFstImpl()
229 ~RelabelFstImpl() { delete fst_; } in ~RelabelFstImpl() local
233 StateId s = fst_->Start(); in Start()
241 SetFinal(s, fst_->Final(s)); in Final()
275 for (ArcIterator<Fst<A> > aiter(*fst_, s); !aiter.Done(); aiter.Next()) { in Expand()
299 const Fst<A> *fst_;
415 : impl_(fst.impl_), siter_(*impl_->fst_), s_(0) {} in StateIterator()
|
| D | connect.h | 64 fst_ = &fst; in InitVisit()
130 if (fst_->Final(s) != Weight::Zero()) in FinishState()
182 const Fst<A> *fst_; variable
|
| D | determinize.h | 136 : CacheImpl<A>(opts), fst_(fst.Copy()) { in DeterminizeFstImplBase()
145 virtual ~DeterminizeFstImplBase() { delete fst_; } in ~DeterminizeFstImplBase() local
196 const Fst<A> *fst_; // Input Fst
207 using DeterminizeFstImplBase<A>::fst_;
242 StateId s = fst_->Start(); in ComputeStart()
259 fst_->Final(element.state_id))); in ComputeFinal()
311 for (ArcIterator< Fst<A> > aiter(*fst_, src_element.state_id); in LabelSubsets()
|