Home
last modified time | relevance | path

Searched refs:nextstate (Results 1 – 25 of 63) sorted by relevance

123

/external/openfst/src/include/fst/
Dprune.h159 arc.nextstate < fdistance->size() in Prune()
160 ? (*fdistance)[arc.nextstate] in Prune()
163 arc.nextstate = dead[0]; in Prune()
167 if (less(Times(idistance[s], arc.weight), idistance[arc.nextstate])) in Prune()
168 idistance[arc.nextstate] = Times(idistance[s], arc.weight); in Prune()
169 if (visited[arc.nextstate]) continue; in Prune()
173 if (enqueued[arc.nextstate] == kNoKey) { in Prune()
174 enqueued[arc.nextstate] = heap.Insert(arc.nextstate); in Prune()
177 heap.Update(enqueued[arc.nextstate], arc.nextstate); in Prune()
285 arc.nextstate < fdistance->size() in Prune()
[all …]
Darc.h51 : ilabel(i), olabel(o), weight(w), nextstate(s) {} in ArcTpl()
64 StateId nextstate; variable
84 : ilabel(i), olabel(o), weight(w), nextstate(s) {} in StringArc()
100 StateId nextstate; // Transition destination state variable
116 : ilabel(i), olabel(o), weight(w), nextstate(s) {} in GallicArc()
120 weight(arc.olabel, arc.weight), nextstate(arc.nextstate) {} in GallicArc()
134 StateId nextstate; // Transition destination state member
147 : ilabel(i), olabel(o), weight(w), nextstate(s) {} in ReverseArc()
159 StateId nextstate; // Transition destination state member
171 : ilabel(i), olabel(o), weight(w), nextstate(s) {} in LexicographicArc()
[all …]
Dshortest-distance.h184 while (distance_->size() <= arc.nextstate) { in ShortestDistance()
190 while (sources_.size() <= arc.nextstate) in ShortestDistance()
192 if (sources_[arc.nextstate] != source_id_) { in ShortestDistance()
193 (*distance_)[arc.nextstate] = Weight::Zero(); in ShortestDistance()
194 rdistance_[arc.nextstate] = Weight::Zero(); in ShortestDistance()
195 enqueued_[arc.nextstate] = false; in ShortestDistance()
196 sources_[arc.nextstate] = source_id_; in ShortestDistance()
199 Weight &nd = (*distance_)[arc.nextstate]; in ShortestDistance()
200 Weight &nr = rdistance_[arc.nextstate]; in ShortestDistance()
209 if (!enqueued_[arc.nextstate]) { in ShortestDistance()
[all …]
Ddfs-visit.h148 if (arc.nextstate >= state_color.size()) { in DfsVisit()
149 nstates = arc.nextstate + 1; in DfsVisit()
156 int next_color = state_color[arc.nextstate]; in DfsVisit()
162 state_color[arc.nextstate] = kDfsGrey; in DfsVisit()
163 state_stack.push(new DfsState<Arc>(fst, arc.nextstate)); in DfsVisit()
164 dfs = visitor->InitState(arc.nextstate, root); in DfsVisit()
Dvisit.h138 if (arc.nextstate >= state_status.size()) { in Visit()
139 nstates = arc.nextstate + 1; in Visit()
146 if (state_status[arc.nextstate] == kWhiteState) { in Visit()
149 visit = visitor->InitState(arc.nextstate, root); in Visit()
150 state_status[arc.nextstate] = kGreyState; in Visit()
151 queue->Enqueue(arc.nextstate); in Visit()
152 } else if (state_status[arc.nextstate] == kBlackState) { in Visit()
Dshortest-path.h159 while (distance->size() <= arc.nextstate) { in SingleShortestPath()
166 Weight &nd = (*distance)[arc.nextstate]; in SingleShortestPath()
174 parent[arc.nextstate] = s; in SingleShortestPath()
175 arc_parent[arc.nextstate] = arc; in SingleShortestPath()
176 if (!enqueued[arc.nextstate]) { in SingleShortestPath()
177 state_queue->Enqueue(arc.nextstate); in SingleShortestPath()
178 enqueued[arc.nextstate] = true; in SingleShortestPath()
180 state_queue->Update(arc.nextstate); in SingleShortestPath()
195 arc_parent[d].nextstate = d_p; in SingleShortestPath()
359 Arc arc(rarc.ilabel, rarc.olabel, rarc.weight.Reverse(), rarc.nextstate);
[all …]
Dequal.h96 } else if (arc1.nextstate != arc2.nextstate) {
100 << ", nextstate1 = " << arc1.nextstate
101 << ", nextstate2 = " << arc2.nextstate;
Darc-map.h162 final_arc.nextstate = superfinal; in ArcMap()
266 final_arc.nextstate = superfinal; in ArcMap()
452 aarc.nextstate = FindOState(aarc.nextstate); in Expand()
469 final_arc.nextstate = superfinal_; in Expand()
738 convert_weight_(arc.weight), arc.nextstate); in operator()
776 if (arc.nextstate == kNoStateId && arc.weight != AW::Zero()) in operator()
779 else if (arc.nextstate == kNoStateId) in operator()
784 GW(SW::One(), arc.weight), arc.nextstate); in operator()
788 GW(SW(arc.olabel), arc.weight), arc.nextstate); in operator()
819 if (arc.nextstate == kNoStateId && arc.weight == GW::Zero()) in operator()
[all …]
Dconnect.h69 comps_->MakeSet(arc.nextstate); in WhiteArc()
70 comps_->Union(s, arc.nextstate); in WhiteArc()
75 comps_->Union(s, arc.nextstate); in GreyArc()
80 comps_->Union(s, arc.nextstate); in BlackArc()
147 StateId t = arc.nextstate; in BackArc()
154 if (arc.nextstate == start_) { in BackArc()
162 StateId t = arc.nextstate; in ForwardOrCrossArc()
Dstate-map.h501 if (x.nextstate < y.nextstate) return true; in operator()
502 if (x.nextstate > y.nextstate) return false; in operator()
511 x.nextstate == y.nextstate); in operator()
576 if (x.nextstate < y.nextstate) return true; in operator()
577 if (x.nextstate > y.nextstate) return false; in operator()
586 x.nextstate == y.nextstate && in operator()
Drmfinalepsilon.h58 if (coaccess[arc.nextstate]) { in RmFinalEpsilon()
79 if (finals.find(arc.nextstate) != finals.end()) { in RmFinalEpsilon()
82 w = Plus(Times(fst->Final(arc.nextstate), arc.weight), w); in RmFinalEpsilon()
Dreplace.h705 arcp->nextstate = state_table_->FindState(
706 StateTuple(prefix_id, top.fst_id, top.nextstate));
729 StateId nextstate = flags & kArcNextStateValue variable
731 StateTuple(tuple.prefix_id, tuple.fst_id, arc.nextstate))
733 *arcp = A(arc.ilabel, arc.olabel, arc.weight, nextstate);
742 tuple.fst_id, arc.nextstate);
758 StateId nextstate = flags & kArcNextStateValue variable
760 StateTuple(tuple.prefix_id, tuple.fst_id, arc.nextstate))
762 *arcp = A(arc.ilabel, arc.olabel, arc.weight, nextstate);
793 PrefixTuple(Label f, StateId s) : fst_id(f), nextstate(s) {} in PrefixTuple()
[all …]
Drmepsilon.h102 StateId nextstate; member
107 : ilabel(i), olabel(o), nextstate(s) {} in Element()
113 return static_cast<size_t>(e.nextstate + in operator()
125 && (e1.nextstate == e2.nextstate); in operator()
184 while (visited_.size() <= arc.nextstate) in Expand()
186 if (!visited_[arc.nextstate]) in Expand()
187 eps_queue_.push(arc.nextstate); in Expand()
189 Element element(arc.ilabel, arc.olabel, arc.nextstate); in Expand()
248 noneps_in[aiter.Value().nextstate] = true; in RmEpsilon()
Dminimize.h94 if (partition_.class_id(arc1.nextstate) < in operator()
95 partition_.class_id(arc2.nextstate)) return true; in operator()
96 if (partition_.class_id(arc1.nextstate) > in operator()
97 partition_.class_id(arc2.nextstate)) return false; in operator()
254 StateId from_state = aiter->Value().nextstate - 1; in Split()
359 if (height_[arc.nextstate] + 1 > height_[s]) in ForwardOrCrossArc()
360 height_[s] = height_[arc.nextstate] + 1; in ForwardOrCrossArc()
472 arc.nextstate = state_map[partition.class_id(arc.nextstate)]; in MergeStates()
Dstatesort.h86 arc.nextstate = order[arc.nextstate]; in StateSort()
Dverify.h89 } else if (arc.nextstate < 0) {
93 } else if (arc.nextstate >= ns) {
Dencode.h422 if ((arc.nextstate == kNoStateId && !(flags_ & kEncodeWeights)) || in operator()
423 (arc.nextstate == kNoStateId && (flags_ & kEncodeWeights) && in operator()
431 arc.nextstate); in operator()
434 if (arc.nextstate == kNoStateId) { in operator()
452 return A(kNoLabel, kNoLabel, Weight::NoWeight(), arc.nextstate); in operator()
457 arc.nextstate); in operator()
Dreweight.h79 if (arc.nextstate >= potential.size()) in Reweight()
81 typename Arc::Weight nextweight = potential[arc.nextstate]; in Reweight()
/external/openfst/src/include/fst/extensions/pdt/
Dexpand.h190 StateTuple ntuple(arc.nextstate, stack_id); in ExpandState()
191 arc.nextstate = state_table_->FindState(ntuple); in ExpandState()
633 if (less_(nd, Distance(arc.nextstate))) { in Relax()
634 SetDistance(arc.nextstate, nd); in Relax()
635 SetSourceState(arc.nextstate, SourceState(s)); in Relax()
637 if (less_(fd, FinalDistance(arc.nextstate))) in Relax()
638 SetFinalDistance(arc.nextstate, fd); in Relax()
640 << arc.nextstate << ", d[ns] = " << Distance(arc.nextstate) in Relax()
677 Times(DistanceToDest(state_table_.Tuple(arc.nextstate).state_id, in PruneArc()
726 VLOG(2) << "ProcNonParen: " << s << " to " << arc.nextstate in ProcNonParen()
[all …]
Dparen.h250 if (!DFSearch(arc.nextstate)) in DFSearch()
252 for (SetIterator set_iter = FindStates(paren_id, arc.nextstate); in DFSearch()
259 if (!DFSearch(cparc.nextstate)) in DFSearch()
265 if(!DFSearch(arc.nextstate)) in DFSearch()
290 FindStates(paren_id, arc.nextstate); in ComputeStateSet()
297 UpdateStateSet(cparc.nextstate, &paren_set, &state_sets); in ComputeStateSet()
307 UpdateStateSet(arc.nextstate, &paren_set, &state_sets); in ComputeStateSet()
Dreplace.h123 arc.nextstate += soff; in Replace()
162 pair<size_t, StateId> paren_key(nfst_id, arc.nextstate); in Replace()
184 Arc farc(close_paren, close_paren, p.second, arc.nextstate); in Replace()
Dshortest-path.h514 balance_data_.OpenInsert(paren_id, arc.nextstate); in Init()
600 SearchState d(arc.nextstate, arc.nextstate); in ProcOpenParen()
617 balance_data_.Find(paren_id, arc.nextstate); in ProcOpenParen()
661 SearchState d(arc.nextstate, t.start); in Relax()
707 arc.nextstate = d_p; in GetPath()
739 if (arc.nextstate != d.state) in GetPathArc()
755 if (path_arc.nextstate == kNoStateId) { in GetPathArc()
/external/curl/lib/
Dssh.c726 sshc->nextstate = SSH_NO_STATE; in ssh_statemach_act()
1243 sshc->nextstate = SSH_NO_STATE; in ssh_statemach_act()
1257 sshc->nextstate = SSH_NO_STATE; in ssh_statemach_act()
1273 sshc->nextstate = SSH_NO_STATE; in ssh_statemach_act()
1289 sshc->nextstate = SSH_NO_STATE; in ssh_statemach_act()
1316 sshc->nextstate = SSH_NO_STATE; in ssh_statemach_act()
1338 sshc->nextstate = SSH_NO_STATE; in ssh_statemach_act()
1362 sshc->nextstate = SSH_NO_STATE; in ssh_statemach_act()
1389 sshc->nextstate = SSH_NO_STATE; in ssh_statemach_act()
1409 if(sshc->nextstate != SSH_NO_STATE) { in ssh_statemach_act()
[all …]
/external/openfst/src/include/fst/script/
Dcompile-impl.h96 arc.nextstate = d = StrToStateId(col[1]);
103 arc.nextstate = d = StrToStateId(col[1]);
115 arc.nextstate = d = StrToStateId(col[1]);
/external/openfst/src/include/fst/extensions/ngram/
Dngram-fst.h316 unigram = aiter.Value().nextstate; in NGramFstImpl()
327 label_queue.push(make_pair(aiter.Value().nextstate, aiter.Value().ilabel)); in NGramFstImpl()
339 label_queue.push(make_pair(arc.nextstate, now.second)); in NGramFstImpl()
375 context_fst.AddArc(arc.nextstate, Arc(context[state], context[state], in NGramFstImpl()
477 context_q.push(arc.nextstate); in NGramFstImpl()
803 loop_.nextstate = inst_.state_; in Find_()
809 arc_.nextstate = fst_.GetImpl()->context_index_.Rank1( in Find_()
824 arc_.nextstate = fst_.GetImpl()->Transition(inst_.context_, label); in Find_()
887 arc_.nextstate = impl_->context_index_.Rank1( in Value()
894 arc_.nextstate = in Value()

123