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