| /external/openfst/src/include/fst/ |
| concat.h | 86 arc.nextstate += numstates1;
153 arc.nextstate += numstates2;
|
| equivalent.h | 232 arc_pairs[arc.ilabel].first = Util::MapState(arc.nextstate, FST1);
244 arc_pairs[arc.ilabel].second = Util::MapState(arc.nextstate, FST2);
|
| test-properties.h | 179 if (arc.nextstate <= s) {
183 if (arc.nextstate != s + 1) {
|
| state-reachable.h | 108 (*isets_)[s].Union((*isets_)[arc.nextstate]);
|
| union.h | 86 arc.nextstate += numstates1;
|
| matcher.h | 225 loop_.nextstate = s;
913 if (phi_loop_ && matcher_->Value().nextstate == state) {
918 state = matcher_->Value().nextstate;
[all...] |
| lookahead-filter.h | 185 // examine the future of the composition state (arc1.nextstate,
186 // arc2.nextstate), blocking moving forward when its determined to be
304 selector_.GetMatcher()->SetState(arca->nextstate);
307 arcb->nextstate) ? f :
560 Selector().GetMatcher()->SetState(arca->nextstate);
589 arcb->nextstate = larc.nextstate;
|
| label-reachable.h | 428 arc.nextstate = label2state_[label];
431 ++indeg[arc.nextstate]; // Finds in-degrees for next step.
444 ++indeg[arc.nextstate]; // Finds in-degrees for next step.
|
| replace-util.h | 439 Label label = nonterminal_array_[arc.nextstate];
462 Label label = nonterminal_array_[arc.nextstate];
463 const Fst<Arc> *fst = fst_array_[arc.nextstate];
|
| synchronize.h | 250 StateId d = FindState(Element(arc.nextstate, istring, ostring));
256 StateId d = FindState(Element(arc.nextstate, istring, ostring));
|
| /external/openfst/src/include/fst/extensions/pdt/ |
| info.h | 121 if (!open_paren_state_set.count(arc.nextstate)) {
123 open_paren_state_set.insert(arc.nextstate);
|
| shortest-path.h | 514 balance_data_.OpenInsert(paren_id, arc.nextstate);
600 SearchState d(arc.nextstate, arc.nextstate);
617 balance_data_.Find(paren_id, arc.nextstate);
656 // State 't' is in the same sub-graph as the nextstate should be (i.e.
661 SearchState d(arc.nextstate, t.start);
707 arc.nextstate = d_p;
739 if (arc.nextstate != d.state)
755 if (path_arc.nextstate == kNoStateId) {
|
| compose.h | 63 loop_.nextstate = kNoStateId;
73 loop_.nextstate = kNoStateId;
84 loop_.nextstate = s;
|
| /external/openfst/src/test/ |
| fst_test.cc | 38 ilabel(i), olabel(o), weight(w), nextstate(s) {}
49 StateId nextstate; // Transition destination state member in struct:fst::CustomArc
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| complement.h | 240 arc_.nextstate = 0;
243 ++arc_.nextstate;
|
| equivalent.h | 196 arc_pairs[arc.ilabel].first = Util::MapState(arc.nextstate, FST1);
208 arc_pairs[arc.ilabel].second = Util::MapState(arc.nextstate, FST2);
|
| test-properties.h | 172 if (arc.nextstate <= s) {
176 if (arc.nextstate != s + 1) {
|
| concat.h | 63 arc.nextstate += numstates1;
|
| union.h | 61 arc.nextstate += numstates1;
|
| vector-fst.h | 95 StateId t = newid[arcs[i].nextstate];
97 arcs[i].nextstate = t;
267 if (arc.nextstate <= s) {
375 ReadType(strm, &arc.nextstate);
439 WriteType(strm, arc.nextstate);
|
| cache.h | 182 if (arc.nextstate >= nknown_states_)
183 nknown_states_ = arc.nextstate + 1;
|
| factor-weight.h | 263 StateId d = FindState(Element(arc.nextstate, Weight::One()));
268 StateId d = FindState(Element(arc.nextstate,
|
| /external/openfst/src/include/fst/extensions/ngram/ |
| ngram-fst.h | 316 unigram = aiter.Value().nextstate;
327 label_queue.push(make_pair(aiter.Value().nextstate, aiter.Value().ilabel));
339 label_queue.push(make_pair(arc.nextstate, now.second));
372 // this arc goes from state to arc.nextstate, so create an arc from
373 // arc.nextstate to state to reverse it.
375 context_fst.AddArc(arc.nextstate, Arc(context[state], context[state],
477 context_q.push(arc.nextstate);
803 loop_.nextstate = inst_.state_;
809 arc_.nextstate = fst_.GetImpl()->context_index_.Rank1(
824 arc_.nextstate = fst_.GetImpl()->Transition(inst_.context_, label)
[all...] |
| /external/ppp/pppd/ |
| fsm.c | 211 terminate_layer(f, nextstate)
213 int nextstate;
231 f->state = nextstate == CLOSING ? CLOSED : STOPPED;
240 f->state = nextstate;
|
| /external/opencv/cvaux/src/ |
| cvhmm1d.cpp | 854 int nextstate;
862 nextstate = info->state[counter+1];
863 hmm->transP[ state * transP_size + nextstate] += 1;
[all...] |
