/external/openfst/src/include/fst/script/ |
H A D | print-impl.h | 51 : fst_(fst), isyms_(isyms), osyms_(osyms), ssyms_(ssyms), 59 StateId start = fst_.Start(); 64 for (StateIterator< Fst<A> > siter(fst_); 108 for (ArcIterator< Fst<A> > aiter(fst_, s); 126 Weight final = fst_.Final(s); 136 const Fst<A> &fst_; member in class:fst::FstPrinter
|
H A D | compile-impl.h | 77 fst_.SetProperties(kError, kError); 81 while (s >= fst_.NumStates()) 82 fst_.AddState(); 84 fst_.SetStart(s); 90 fst_.SetFinal(s, Weight::One()); 93 fst_.SetFinal(s, StrToWeight(col[1], true)); 100 fst_.AddArc(s, arc); 112 fst_.AddArc(s, arc); 119 fst_.AddArc(s, arc); 121 while (d >= fst_ 200 mutable VectorFst<A> fst_; member in class:fst::FstCompiler [all...] |
H A D | draw-impl.h | 58 : fst_(fst), isyms_(isyms), osyms_(osyms), ssyms_(ssyms), 69 StateId start = fst_.Start(); 98 for (StateIterator< Fst<A> > siter(fst_); 169 Weight final = fst_.Final(s); 179 if (s == fst_.Start()) 186 for (ArcIterator< Fst<A> > aiter(fst_, s); 210 const Fst<A> &fst_; member in class:fst::FstDrawer
|
/external/openfst/src/include/fst/ |
H A D | state-reachable.h | 55 : fst_(fst), 71 if (fst_.Final(s) != Weight::Zero()) { 75 if (fst_.NumArcs(s) > 0) { 113 if (index_ >= 0 && fst_.Final(s) != Weight::Zero()) { 127 const Fst<A> &fst_; member in class:fst::IntervalReachVisitor
|
H A D | add-on.h | 157 : fst_(fst), t_(t) { 159 SetProperties(fst_.Properties(kFstProperties, false)); 166 : fst_(fst), t_(t) { 168 SetProperties(fst_.Properties(kFstProperties, false)); 174 : fst_(impl.fst_), t_(impl.t_) { 176 SetProperties(fst_.Properties(kCopyProperties, false)); 186 StateId Start() const { return fst_.Start(); } 187 Weight Final(StateId s) const { return fst_.Final(s); } 188 size_t NumArcs(StateId s) const { return fst_ 294 F fst_; member in class:fst::AddOnImpl [all...] |
H A D | arcsort.h | 46 : fst_(fst), comp_(comp), i_(0) {} 51 : fst_(fst ? *fst : mapper.fst_), comp_(mapper.comp_), i_(0) {} 53 StateId Start() { return fst_.Start(); } 54 Weight Final(StateId s) const { return fst_.Final(s); } 59 arcs_.reserve(fst_.NumArcs(s)); 60 for (ArcIterator< Fst<Arc> > aiter(fst_, s); !aiter.Done(); aiter.Next()) 74 const Fst<Arc> &fst_; member in class:fst::ArcSortMapper
|
H A D | complement.h | 63 explicit ComplementFstImpl(const Fst<A> &fst) : fst_(fst.Copy()) { 72 : fst_(impl.fst_->Copy()) { 79 ~ComplementFstImpl() { delete fst_; } 85 StateId start = fst_->Start(); 94 if (s == 0 || fst_->Final(s - 1) == Weight::Zero()) 104 return fst_->NumArcs(s - 1) + 1; 108 return s == 0 ? 0 : fst_->NumInputEpsilons(s - 1); 112 return s == 0 ? 0 : fst_->NumOutputEpsilons(s - 1); 120 if ((mask & kError) && fst_ 127 const Fst<A> *fst_; member in class:fst::ComplementFstImpl [all...] |
H A D | connect.h | 191 const Fst<A> *fst_; member in class:fst::SccVisitor 217 fst_ = &fst; 258 if (fst_->Final(s) != Weight::Zero())
|
H A D | shortest-distance.h | 82 : fst_(fst), distance_(distance), state_queue_(opts.state_queue), 96 const Fst<Arc> &fst_; member in class:fst::ShortestDistanceState 118 if (fst_.Start() == kNoStateId) { 119 if (fst_.Properties(kError, false)) error_ = true; 147 source = fst_.Start(); 173 if (first_path_ && (fst_.Final(s) != Weight::Zero())) 178 for (ArcIterator< Fst<Arc> > aiter(fst_, s); 219 if (fst_.Properties(kError, false)) error_ = true;
|
H A D | factor-weight.h | 185 fst_(fst.Copy()), 204 fst_(impl.fst_->Copy(true)), 216 delete fst_; 221 StateId s = fst_->Start(); 224 StateId start = FindState(Element(fst_->Start(), Weight::One())); 236 : (Weight) Times(e.weight, fst_->Final(e.state)); 268 if ((mask & kError) && fst_->Properties(kError, false)) 309 for (ArcIterator< Fst<A> > ait(*fst_, e.state); 331 (fst_ 369 const Fst<A> *fst_; member in class:fst::FactorWeightFstImpl [all...] |
H A D | relabel.h | 216 : CacheImpl<A>(opts), fst_(fst.Copy()), 245 : CacheImpl<A>(opts), fst_(fst.Copy()), 278 fst_(impl.fst_->Copy(true)), 289 ~RelabelFstImpl() { delete fst_; } 293 StateId s = fst_->Start(); 301 SetFinal(s, fst_->Final(s)); 331 if ((mask & kError) && fst_->Properties(kError, false)) 344 for (ArcIterator<Fst<A> > aiter(*fst_, s); !aiter.Done(); aiter.Next()) { 368 const Fst<A> *fst_; member in class:fst::RelabelFstImpl [all...] |
H A D | state-map.h | 211 fst_(fst.Copy()), 212 mapper_(new C(mapper, fst_)), 220 fst_(fst.Copy()), 228 fst_(impl.fst_->Copy(true)), 229 mapper_(new C(*impl.mapper_, fst_)), 235 delete fst_; 270 fst_->InitStateIterator(data); 283 if ((mask & kError) && (fst_->Properties(kError, false) || 297 return *fst_; 318 const Fst<A> *fst_; member in class:fst::StateMapFstImpl 436 const Fst<A> &fst_; member in class:fst::IdentityStateMapper 515 const Fst<A> &fst_; member in class:fst::ArcSumMapper 591 const Fst<A> &fst_; member in class:fst::ArcUniqueMapper [all...] |
H A D | synchronize.h | 86 : CacheImpl<A>(opts), fst_(fst.Copy()) { 97 fst_(impl.fst_->Copy(true)) { 105 delete fst_; 118 StateId s = fst_->Start(); 122 StateId start = FindState(Element(fst_->Start(), empty, empty)); 131 Weight w = e.state == kNoStateId ? Weight::One() : fst_->Final(e.state); 162 if ((mask & kError) && fst_->Properties(kError, false)) 243 for (ArcIterator< Fst<A> > ait(*fst_, e.state); 261 Weight w = e.state == kNoStateId ? Weight::One() : fst_ 324 const Fst<A> *fst_; member in class:fst::SynchronizeFstImpl [all...] |
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
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 | 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 | 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 | 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 | 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 | 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 | 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
|
/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...] |
/external/openfst/src/include/fst/extensions/far/ |
H A D | far.h | 407 : keys_(filenames), has_stdin_(false), pos_(0), fst_(0), error_(false) { 464 return *fst_; 472 if (fst_) delete fst_; 479 if (fst_) delete fst_; 482 fst_ = Fst<A>::Read(*streams_[pos_], FstReadOptions()); 483 if (!fst_) { 494 mutable Fst<A> *fst_; member in class:fst::FstFarReader
|
/external/openfst/src/include/fst/extensions/pdt/ |
H A D | paren.h | 145 : fst_(fst), 213 const Fst<A> &fst_; member in class:fst::PdtParenReachable 240 for (ArcIterator<Fst<A> > aiter(fst_, s); 279 for (ArcIterator< Fst<A> > aiter(fst_, s);
|