| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| dfs-visit.h | 67 DfsState(const Fst<Arc> &fst, StateId s): state_id(s), arc_iter(fst, s) {}
69 StateId state_id; // Fst state ... member in struct:fst::DfsState
106 StateId s = dfs_state->state_id;
114 StateId p = parent_state->state_id;
|
| determinize.h | 216 Element(StateId s, Weight w) : state_id(s), weight(w) {}
218 StateId state_id; // Input state Id member in struct:fst::DeterminizeFsaImpl::Element
259 fst_->Final(element.state_id)));
311 for (ArcIterator< Fst<A> > aiter(*fst_, src_element.state_id);
340 while ((StateId)elements_.size() <= dest_element.state_id)
342 Element *matching_element = elements_[dest_element.state_id];
351 elements_[dest_element.state_id] = &dest_element;
367 elements_[dest_element.state_id] = 0;
397 (*elements_)[element1.state_id] = &element1;
405 Element *element1 = (*elements_)[element2.state_id];
[all...] |
| /external/openfst/src/include/fst/ |
| dfs-visit.h | 77 DfsState(const Fst<Arc> &fst, StateId s): state_id(s), arc_iter(fst, s) {}
79 StateId state_id; // Fst state ... member in struct:fst::DfsState
126 StateId s = dfs_state->state_id;
138 StateId p = parent_state->state_id;
|
| determinize.h | 251 Element(StateId s, Weight w) : state_id(s), weight(w) {}
253 StateId state_id; // Input state Id member in struct:fst::DeterminizeFsaImpl::Element
330 GetFst().Final(element.state_id)));
375 Weight ind = element.state_id < in_dist_->size() ?
376 (*in_dist_)[element.state_id] : Weight::Zero();
407 for (ArcIterator< Fst<A> > aiter(GetFst(), src_element.state_id);
436 while (elements_.size() <= dest_element.state_id)
438 Element *matching_element = elements_[dest_element.state_id];
449 elements_[dest_element.state_id] = &dest_element;
465 elements_[dest_element.state_id] = 0
[all...] |
| randgen.h | 143 StateId state_id; // current input FST state member in struct:fst::RandState
150 : state_id(s), nsamples(n), length(l), select(k), parent(p) {}
153 : state_id(kNoStateId), nsamples(0), length(0), select(0), parent(0) {}
183 // Samples 'rstate.nsamples' from state 'state_id'. The 'rstate.length' is
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)];
270 if ((fst_.NumArcs(rstate.state_id) == 0 &&
271 fst_.Final(rstate.state_id) == Weight::Zero()) ||
278 ++sample_map_[arc_selector_(fst_, rstate.state_id, accumulator_)]
[all...] |
| /external/openfst/src/include/fst/extensions/pdt/ |
| pdt.h | 157 StateId state_id; member in struct:fst::PdtStateTuple
161 : state_id(kNoStateId), stack_id(-1) {}
164 : state_id(fs), stack_id(ss) {}
173 return x.state_id == y.state_id && x.stack_id == y.stack_id;
182 return tuple.state_id + tuple.stack_id * kPrime;
|
| paren.h | 55 return p.paren_id + p.state_id * kPrime;
60 StateId state_id; // destination (source) state of open (close) paren member in class:fst::ParenState
62 ParenState() : paren_id(kNoLabel), state_id(kNoStateId) {}
64 ParenState(Label p, StateId s) : paren_id(p), state_id(s) {}
69 return p.paren_id == this->paren_id && p.state_id == this->state_id;
76 (p.paren_id == this->paren.id && p.state_id < this->state_id);
468 StateId open_dest = okey.state_id;
|
| expand.h | 140 Weight w = fst_->Final(tuple.state_id);
178 for (ArcIterator< Fst<A> > aiter(*fst_, tuple.state_id);
677 Times(DistanceToDest(state_table_.Tuple(arc.nextstate).state_id,
753 VLOG(2) << "Open paren: " << s << "(" << state_table_.Tuple(s).state_id
754 << ") to " << ns << "(" << state_table_.Tuple(ns).state_id << ")";
760 balance_data_->Find(paren_id, state_table_.Tuple(ns).state_id);
777 VLOG(2) << state_table_.Tuple(ns).state_id << ", " << source;
779 << DistanceToDest(state_table_.Tuple(ns).state_id, source)
783 Times(DistanceToDest(state_table_.Tuple(ns).state_id, source),
788 DistanceToDest(state_table_.Tuple(ns).state_id, source)
[all...] |
