| /external/openfst/src/include/fst/ |
| 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
|
| 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;
|
| 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
|
| 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_.NumArcs(s);
294 F fst_; member in class:fst::AddOnImpl
[all...] |
| 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_->Properties(kError, false)
127 const Fst<A> *fst_; member in class:fst::ComplementFstImpl
[all...] |
| connect.h | 191 const Fst<A> *fst_; member in class:fst::SccVisitor
217 fst_ = &fst;
258 if (fst_->Final(s) != Weight::Zero())
|
| 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...] |
| 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...] |
| 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_->Final(e.state)
324 const Fst<A> *fst_; member in class:fst::SynchronizeFstImpl
[all...] |
| 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_->Final(e.state) != Weight::Zero())))
369 const Fst<A> *fst_; member in class:fst::FactorWeightFstImpl
[all...] |
| label-reachable.h | 154 : fst_(new VectorFst<Arc>(fst)),
161 StateId ins = fst_->NumStates();
164 delete fst_;
168 : fst_(0),
179 fst_(0),
410 StateId ins = fst_->NumStates();
417 for (MutableArcIterator< VectorFst<Arc> > aiter(fst_, s);
435 Weight final = fst_->Final(s);
443 fst_->AddArc(s, arc);
446 fst_->SetFinal(s, Weight::Zero())
545 VectorFst<Arc> *fst_; member in class:fst::LabelReachable
[all...] |
| lookahead-filter.h | 129 : fst_(lmatcher1->GetFst().Copy()),
133 : fst_(selector.fst_->Copy()),
138 delete fst_;
141 const F1 &GetFst() const { return *fst_; }
146 const F1 *fst_; member in class:fst::LookAheadSelector
161 : fst_(lmatcher2->GetFst().Copy()),
165 : fst_(selector.fst_->Copy()),
170 delete fst_;
178 const F2 *fst_; member in class:fst::LookAheadSelector
[all...] |
| minimize.h | 68 : fst_(fst), partition_(partition), flags_(flags) {}
74 const size_t xfinal = fst_.Final(x).Hash();
75 const size_t yfinal = fst_.Final(y).Hash();
82 if (fst_.NumArcs(x) < fst_.NumArcs(y)) return true;
83 if (fst_.NumArcs(x) > fst_.NumArcs(y)) return false;
87 for (ArcIterator<Fst<A> > aiter1(fst_, x), aiter2(fst_, y);
106 const Fst<A>& fst_; member in class:fst::StateComparator
[all...] |
| rmepsilon.h | 80 : fst_(fst), distance_(distance), sd_state_(fst_, distance, opts, true),
132 const Fst<Arc> &fst_; member in class:fst::RmEpsilonState
177 for (ArcIterator< Fst<Arc> > ait(fst_, state);
208 final_ = Plus(final_, Times((*distance_)[state], fst_.Final(state)));
401 fst_(fst.Copy()),
404 *fst_,
416 fst_(impl.fst_->Copy(true)),
419 *fst_,
492 const Fst<A> *fst_; member in class:fst::RmEpsilonFstImpl
[all...] |
| /external/openfst/src/include/fst/script/ |
| 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_.NumStates()
200 mutable VectorFst<A> fst_; member in class:fst::FstCompiler
[all...] |
| 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
|
| 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/srec/tools/thirdparty/OpenFst/fst/lib/ |
| connect.h | 64 fst_ = &fst;
130 if (fst_->Final(s) != Weight::Zero())
182 const Fst<A> *fst_; member in class:fst::SccVisitor
|
| 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);
|
| 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...] |
| 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_, s - 1)
[all...] |
| 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) {}
|
| /external/srec/tools/grxmlcompile/ |
| 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_.SetFinal(s, Weight::One())
350 VectorFst<A> fst_; member in class:fst::FstReader
[all...] |
| /external/openfst/src/include/fst/extensions/far/ |
| 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/ |
| 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);
|
