Home
last modified time | relevance | path

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

12

/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.h310 StateId nextstate = in Expand() local
311 FindState(StateTuple(prefix_id, top.fst_id, top.nextstate)); in Expand()
312 AddArc(s, A(0, 0, fst->Final(fst_state), nextstate)); in Expand()
320 StateId nextstate = in Expand() local
321 FindState(StateTuple(tuple.prefix_id, tuple.fst_id, arc.nextstate)); in Expand()
322 AddArc(s, A(arc.ilabel, arc.olabel, arc.weight, nextstate)); in Expand()
331 tuple.fst_id, arc.nextstate); in Expand()
343 StateId nextstate = in Expand() local
345 StateTuple(tuple.prefix_id, tuple.fst_id, arc.nextstate)); in Expand()
346 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()
Drmfinalepsilon.h51 if (coaccess[arc.nextstate]) { in RmFinalEpsilon()
72 if (finals.find(arc.nextstate) != finals.end()) { in RmFinalEpsilon()
75 w = Plus(Times(fst->Final(arc.nextstate), arc.weight), w); in RmFinalEpsilon()
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()
Drmepsilon.h79 StateId nextstate; member
84 : ilabel(i), olabel(o), nextstate(s) {} in Element()
90 return static_cast<size_t>(e.nextstate); in operator()
91 return static_cast<size_t>(e.nextstate + in operator()
105 && (e1.nextstate == e2.nextstate); in operator()
156 while ((StateId)visited_.size() <= arc.nextstate) in Expand()
158 if (!visited_[arc.nextstate]) in Expand()
159 eps_queue_.push(arc.nextstate); in Expand()
161 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()
Dstatesort.h77 arc.nextstate = order[arc.nextstate]; in StateSort()
Dverify.h86 } else if (arc.nextstate < 0) { in Verify()
90 } else if (arc.nextstate >= ns) { in Verify()
Dconnect.h105 StateId t = arc.nextstate; in BackArc()
112 if (arc.nextstate == start_) { in BackArc()
120 StateId t = arc.nextstate; in ForwardOrCrossArc()
Dcompose.h435 StateTuple tuple(arcb.nextstate, arca.nextstate, f); in AddArc()
436 arc.nextstate = FindState(tuple); in AddArc()
441 StateTuple tuple(arca.nextstate, arcb.nextstate, f); in AddArc()
442 arc.nextstate = FindState(tuple); in AddArc()
534 while (labela == kPhiLabel && sf != arca.nextstate) { in OrderedExpand()
535 sf = arca.nextstate; in OrderedExpand()
554 if (labela == kPhiLabel && sf == arca.nextstate) { in OrderedExpand()
Dencode.h233 if ((arc.nextstate == kNoStateId && !(flags_ & kEncodeWeights)) || in operator()
234 (arc.nextstate == kNoStateId && (flags_ & kEncodeWeights) && in operator()
242 arc.nextstate); in operator()
245 if (arc.nextstate == kNoStateId) { in operator()
253 arc.nextstate);; in operator()
Dequivalent.h196 arc_pairs[arc.ilabel].first = Util::MapState(arc.nextstate, FST1); in Equivalent()
208 arc_pairs[arc.ilabel].second = Util::MapState(arc.nextstate, FST2); in Equivalent()
Drandgen.h150 nopts.source = iarc.nextstate; in RandGen()
151 nopts.dest = oarc.nextstate; in RandGen()
Dtest-properties.h172 if (arc.nextstate <= s) { in ComputeProperties()
176 if (arc.nextstate != s + 1) { in ComputeProperties()
Dinvert.h32 return A(arc.olabel, arc.ilabel, arc.weight, arc.nextstate); in operator()
Dreverse.h69 StateId nos = iarc.nextstate + 1; in Reverse()
/external/srec/tools/grxmlcompile/
Dfst-io.h115 PrintStateId(arc.nextstate); in PrintState()
249 arc.nextstate = d = StrToStateId(col[1]); in FstReader()
256 arc.nextstate = d = StrToStateId(col[1]); in FstReader()
268 arc.nextstate = d = StrToStateId(col[1]); in FstReader()
/external/ppp/pppd/
Dfsm.c211 terminate_layer(f, nextstate) in terminate_layer() argument
213 int nextstate;
231 f->state = nextstate == CLOSING ? CLOSED : STOPPED;
240 f->state = nextstate;

12