Home
last modified time | relevance | path

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

1234

/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()
/external/srec/tools/thirdparty/OpenFst/fst/lib/
Darc.h36 : ilabel(i), olabel(o), weight(w), nextstate(s) {} in StdArc()
48 StateId nextstate; // Transition destination state member
60 : ilabel(i), olabel(o), weight(w), nextstate(s) {} in LogArc()
72 StateId nextstate; // Transition destination state member
85 : ilabel(i), olabel(o), weight(w), nextstate(s) {} in StringArc()
101 StateId nextstate; // Transition destination state variable
117 : ilabel(i), olabel(o), weight(w), nextstate(s) {} in GallicArc()
121 weight(arc.olabel, arc.weight), nextstate(arc.nextstate) {} in GallicArc()
135 StateId nextstate; // Transition destination state member
148 : ilabel(i), olabel(o), weight(w), nextstate(s) {} in ReverseArc()
[all …]
Dshortest-distance.h147 while ((StateId)distance_->size() <= arc.nextstate) { in ShortestDistance()
153 while ((StateId)sources_.size() <= arc.nextstate) in ShortestDistance()
155 if (sources_[arc.nextstate] != source) { in ShortestDistance()
156 (*distance_)[arc.nextstate] = Weight::Zero(); in ShortestDistance()
157 rdistance_[arc.nextstate] = Weight::Zero(); in ShortestDistance()
158 enqueued_[arc.nextstate] = false; in ShortestDistance()
159 sources_[arc.nextstate] = source; in ShortestDistance()
162 Weight &nd = (*distance_)[arc.nextstate]; in ShortestDistance()
163 Weight &nr = rdistance_[arc.nextstate]; in ShortestDistance()
168 if (!enqueued_[arc.nextstate]) { in ShortestDistance()
[all …]
Darcsum.h35 if (x.nextstate < y.nextstate) return true; in operator()
36 if (x.nextstate > y.nextstate) return false; in operator()
48 x.nextstate == y.nextstate); in operator()
Dprune.h103 (*fdistance)[arc.nextstate]); in Prune()
105 arc.nextstate = dead[0]; in Prune()
203 while (idistance->size() <= arc.nextstate) in Prune()
205 while (fdistance->size() <= arc.nextstate) in Prune()
207 while (copy.size() <= arc.nextstate) in Prune()
211 (*fdistance)[arc.nextstate]); in Prune()
214 if (copy[arc.nextstate] == kNoStateId) in Prune()
215 copy[arc.nextstate] = ofst->AddState(); in Prune()
216 arc.nextstate = copy[arc.nextstate]; in Prune()
Dreplace.h311 StateId nextstate = in Expand() local
312 FindState(StateTuple(prefix_id, top.fst_id, top.nextstate)); in Expand()
313 AddArc(s, A(0, 0, fst->Final(fst_state), nextstate)); in Expand()
321 StateId nextstate = in Expand() local
322 FindState(StateTuple(tuple.prefix_id, tuple.fst_id, arc.nextstate)); in Expand()
323 AddArc(s, A(arc.ilabel, arc.olabel, arc.weight, nextstate)); in Expand()
332 tuple.fst_id, arc.nextstate); in Expand()
344 StateId nextstate = in Expand() local
346 StateTuple(tuple.prefix_id, tuple.fst_id, arc.nextstate)); in Expand()
347 AddArc(s, A(arc.ilabel, arc.olabel, arc.weight, nextstate)); in Expand()
[all …]
Dshortest-path.h116 while (distance->size() <= arc.nextstate) { in SingleShortestPath()
123 Weight &nd = (*distance)[arc.nextstate]; in SingleShortestPath()
127 parent[arc.nextstate] = s; in SingleShortestPath()
128 arc_parent[arc.nextstate] = arc; in SingleShortestPath()
129 if (!enqueued[arc.nextstate]) { in SingleShortestPath()
130 state_queue->Enqueue(arc.nextstate); in SingleShortestPath()
131 enqueued[arc.nextstate] = true; in SingleShortestPath()
133 state_queue->Update(arc.nextstate); in SingleShortestPath()
158 arc_parent[d].nextstate = d_p; in SingleShortestPath()
311 Arc arc(rarc.ilabel, rarc.olabel, rarc.weight.Reverse(), rarc.nextstate); in ShortestPath()
[all …]
Dequal.h93 } else if (arc1.nextstate != arc2.nextstate) { in Equal()
97 << ", nextstate1 = " << arc1.nextstate in Equal()
98 << ", nextstate2 = " << arc2.nextstate; in Equal()
Dmap.h121 final_arc.nextstate = superfinal; in Map()
203 final_arc.nextstate = superfinal; in Map()
365 aarc.nextstate = FindOState(aarc.nextstate); in Expand()
382 final_arc.nextstate = superfinal_; in Expand()
656 return LogArc(arc.ilabel, arc.olabel, arc.weight.Value(), arc.nextstate); in operator()
671 return StdArc(arc.ilabel, arc.olabel, arc.weight.Value(), arc.nextstate); in operator()
692 if (arc.nextstate == kNoStateId && arc.weight != AW::Zero()) in operator()
695 else if (arc.nextstate == kNoStateId) in operator()
700 GW(SW::One(), arc.weight), arc.nextstate); in operator()
704 GW(SW(arc.olabel), arc.weight), arc.nextstate); in operator()
[all …]
Ddfs-visit.h128 int next_color = state_color[arc.nextstate]; in DfsVisit()
134 state_color[arc.nextstate] = kDfsGrey; in DfsVisit()
135 state_stack.push(new DfsState<Arc>(fst, arc.nextstate)); in DfsVisit()
136 dfs = visitor->InitState(arc.nextstate, root); in DfsVisit()
Dreweight.h67 (potential[arc.nextstate] == Weight::Zero())) in Reweight()
71 arc.weight = Divide(Times(arc.weight, potential[arc.nextstate]), in Reweight()
74 && (potential[arc.nextstate] != Weight::Zero())) in Reweight()
76 potential[arc.nextstate], DIVIDE_RIGHT); in Reweight()
Drmfinalepsilon.h52 if (coaccess[arc.nextstate]) { in RmFinalEpsilon()
73 if (finals.find(arc.nextstate) != finals.end()) { in RmFinalEpsilon()
76 w = Plus(Times(fst->Final(arc.nextstate), arc.weight), w); in RmFinalEpsilon()
Drmepsilon.h81 StateId nextstate; member
86 : ilabel(i), olabel(o), nextstate(s) {} in Element()
92 return static_cast<size_t>(e.nextstate); in operator()
93 return static_cast<size_t>(e.nextstate + in operator()
107 && (e1.nextstate == e2.nextstate); in operator()
158 while ((StateId)visited_.size() <= arc.nextstate) in Expand()
160 if (!visited_[arc.nextstate]) in Expand()
161 eps_queue_.push(arc.nextstate); in Expand()
163 Element element(arc.ilabel, arc.olabel, arc.nextstate); in Expand()
Dminimize.h87 if (partition_.class_id(arc1.nextstate) < in operator()
88 partition_.class_id(arc2.nextstate)) return true; in operator()
89 if (partition_.class_id(arc1.nextstate) > in operator()
90 partition_.class_id(arc2.nextstate)) return false; in operator()
241 StateId from_state = aiter->Value().nextstate - 1; in Split()
346 if (height_[arc.nextstate] + 1 > height_[s]) in ForwardOrCrossArc()
347 height_[s] = height_[arc.nextstate] + 1; in ForwardOrCrossArc()
459 arc.nextstate = state_map[partition.class_id(arc.nextstate)]; in MergeStates()
/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 …]

1234