/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
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...] |
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
|
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...] |
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...] |
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
|
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);
|
map.h | 271 : CacheImpl<B>(opts), fst_(fst.Copy()), 281 : CacheImpl<B>(opts), fst_(fst.Copy()), 291 delete fst_; 297 this->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_->InputSymbols()) 440 const Fst<A> *fst_; member in class:fst::MapFstImpl 840 MutableFst<ToArc> *fst_; member in struct:fst::GallicToNewSymbolsMapper [all...] |
/external/openfst/src/include/fst/ |
accumulator.h | 438 : arc_limit_(arc_limit), fst_(0), data_( 443 : arc_limit_(acc.arc_limit_), fst_(acc.fst_ ? acc.fst_->Copy() : 0), 449 if (fst_) 450 delete fst_; 458 delete fst_; 459 } else if (fst_) { 464 fst_ = fst.Copy(); 477 if (!fst_) { 586 const Fst<A>* fst_; \/\/ Input fst member in class:fst::CacheLogAccumulator [all...] |
lookahead-matcher.h | 268 fst_(matcher_.GetFst()), 275 fst_(matcher_.GetFst()), 295 const FST &GetFst() const { return fst_; } 332 const FST &fst_; // Matcher FST member in class:fst::ArcLookAheadMatcher 348 if (fst_.Final(s_) != Weight::Zero() && 355 Times(fst_.Final(s_), lfst_->Final(s))));
|
matcher.h | 150 : fst_(fst.Copy()), 174 : fst_(matcher.fst_->Copy(safe)), 187 delete fst_; 202 uint64 props = fst_->Properties(true_prop | false_prop, test); 222 aiter_ = new ArcIterator<F>(*fst_, s); 224 narcs_ = internal::NumArcs(*fst_, s); 289 virtual const F &GetFst() const { return *fst_; } 308 const F *fst_; member in class:fst::SortedMatcher [all...] |
randgen.h | 171 : fst_(fst), 177 : fst_(fst ? *fst : sampler.fst_), 191 if ((fst_.NumArcs(rstate.state_id) == 0 && 192 fst_.Final(rstate.state_id) == Weight::Zero()) || 199 ++sample_map_[arc_selector_(fst_, rstate.state_id)]; 222 const Fst<A> &fst_; member in class:fst::ArcSampler 245 : fst_(fst), 253 : fst_(fst ? *fst : sampler.fst_), 291 const Fst<A> &fst_; member in class:fst::ArcSampler 492 Fst<A> *fst_; member in class:fst::RandGenFstImpl [all...] |
arc-map.h | 335 fst_(fst.Copy()), 346 fst_(fst.Copy()), 356 fst_(impl.fst_->Copy(true)), 365 delete fst_; 371 SetStart(FindOState(fst_->Start())); 380 B final_arc = (*mapper_)(A(0, 0, fst_->Final(FindIState(s)), 393 B final_arc = (*mapper_)(A(0, 0, fst_->Final(FindIState(s)), 433 if ((mask & kError) && (fst_->Properties(kError, false) || 449 for (ArcIterator< Fst<A> > aiter(*fst_, FindIState(s)) 536 const Fst<A> *fst_; member in class:fst::ArcMapFstImpl 957 MutableFst<ToArc> *fst_; member in struct:fst::GallicToNewSymbolsMapper [all...] |
cache.h | 664 : fst_(fst), impl_(impl), s_(0) { 665 fst_.Start(); // force start state 677 ArcIterator<F> aiter(fst_, u); 703 const F &fst_; member in class:fst::CacheStateIterator
|
determinize.h | 376 : CacheImpl<A>(opts), fst_(fst.Copy()) { 388 fst_(impl.fst_->Copy(true)) { 395 virtual ~DeterminizeFstImplBase() { delete fst_; } 447 const Fst<A> &GetFst() const { return *fst_; } 450 const Fst<A> *fst_; // Input Fst member in class:fst::DeterminizeFstImplBase [all...] |
replace.h | 1211 const ReplaceFst<A, T> &fst_; \/\/ Reference to the FST member in class:fst::ArcIterator 1396 const ReplaceFst<A, T>& fst_; member in class:fst::ReplaceFstMatcher [all...] |
/external/openfst/src/include/fst/extensions/ngram/ |
ngram-fst.h | 758 : fst_(fst), inst_(fst.inst_), match_type_(match_type), 767 : fst_(matcher.fst_), inst_(matcher.inst_), 784 return fst_; 793 fst_.GetImpl()->SetInstFuture(s, &inst_); 808 fst_.GetImpl()->SetInstNode(&inst_); 809 arc_.nextstate = fst_.GetImpl()->context_index_.Rank1( 810 fst_.GetImpl()->context_index_.Select1( 811 fst_.GetImpl()->context_index_.Rank0(inst_.node_) - 1)); 812 arc_.weight = fst_.GetImpl()->backoff_[inst_.state_] 847 const NGramFst<A>& fst_; member in class:fst::NGramFstMatcher [all...] |
/external/openfst/src/include/fst/extensions/pdt/ |
expand.h | 89 : CacheImpl<A>(opts), fst_(fst.Copy()), 106 fst_(impl.fst_->Copy(true)), 118 delete fst_; 127 StateId s = fst_->Start(); 140 Weight w = fst_->Final(tuple.state_id); 178 for (ArcIterator< Fst<A> > aiter(*fst_, tuple.state_id); 204 const Fst<A> *fst_; member in class:fst::ExpandFstImpl [all...] |