Searched refs:nextstate (Results 1 - 25 of 95) sorted by relevance

1234

/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Darc.h36 : ilabel(i), olabel(o), weight(w), nextstate(s) {}
48 StateId nextstate; // Transition destination state member in struct:fst::StdArc
60 : ilabel(i), olabel(o), weight(w), nextstate(s) {}
72 StateId nextstate; // Transition destination state member in struct:fst::LogArc
85 : ilabel(i), olabel(o), weight(w), nextstate(s) {}
101 StateId nextstate; // Transition destination state member in class:fst::StringArc
117 : ilabel(i), olabel(o), weight(w), nextstate(s) {}
121 weight(arc.olabel, arc.weight), nextstate(arc.nextstate) {}
135 StateId nextstate; // Transitio member in struct:fst::GallicArc
160 StateId nextstate; // Transition destination state member in struct:fst::ReverseArc
[all...]
H A Darcsum.h35 if (x.nextstate < y.nextstate) return true;
36 if (x.nextstate > y.nextstate) return false;
48 x.nextstate == y.nextstate);
H A Dshortest-distance.h147 while ((StateId)distance_->size() <= arc.nextstate) {
153 while ((StateId)sources_.size() <= arc.nextstate)
155 if (sources_[arc.nextstate] != source) {
156 (*distance_)[arc.nextstate] = Weight::Zero();
157 rdistance_[arc.nextstate] = Weight::Zero();
158 enqueued_[arc.nextstate] = false;
159 sources_[arc.nextstate] = source;
162 Weight &nd = (*distance_)[arc.nextstate];
163 Weight &nr = rdistance_[arc.nextstate];
168 if (!enqueued_[arc.nextstate]) {
[all...]
H A Dprune.h103 (*fdistance)[arc.nextstate]);
105 arc.nextstate = dead[0];
203 while (idistance->size() <= arc.nextstate)
205 while (fdistance->size() <= arc.nextstate)
207 while (copy.size() <= arc.nextstate)
211 (*fdistance)[arc.nextstate]);
214 if (copy[arc.nextstate] == kNoStateId)
215 copy[arc.nextstate] = ofst->AddState();
216 arc.nextstate = copy[arc.nextstate];
[all...]
H A Dequal.h93 } else if (arc1.nextstate != arc2.nextstate) {
97 << ", nextstate1 = " << arc1.nextstate
98 << ", nextstate2 = " << arc2.nextstate;
H A Dreplace.h311 StateId nextstate = local
312 FindState(StateTuple(prefix_id, top.fst_id, top.nextstate));
313 AddArc(s, A(0, 0, fst->Final(fst_state), nextstate));
321 StateId nextstate = local
322 FindState(StateTuple(tuple.prefix_id, tuple.fst_id, arc.nextstate));
323 AddArc(s, A(arc.ilabel, arc.olabel, arc.weight, nextstate));
332 tuple.fst_id, arc.nextstate);
344 StateId nextstate = local
346 StateTuple(tuple.prefix_id, tuple.fst_id, arc.nextstate));
347 AddArc(s, A(arc.ilabel, arc.olabel, arc.weight, nextstate));
391 StateId nextstate; member in struct:fst::ReplaceFstImpl::PrefixTuple
405 Push(int fst_id, StateId nextstate) argument
479 PushPrefix(StackPrefix prefix, Label fst_id, StateId nextstate) argument
[all...]
H A Drmfinalepsilon.h52 if (coaccess[arc.nextstate]) {
73 if (finals.find(arc.nextstate) != finals.end()) {
76 w = Plus(Times(fst->Final(arc.nextstate), arc.weight), w);
H A Dshortest-path.h116 while (distance->size() <= arc.nextstate) {
123 Weight &nd = (*distance)[arc.nextstate];
127 parent[arc.nextstate] = s;
128 arc_parent[arc.nextstate] = arc;
129 if (!enqueued[arc.nextstate]) {
130 state_queue->Enqueue(arc.nextstate);
131 enqueued[arc.nextstate] = true;
133 state_queue->Update(arc.nextstate);
158 arc_parent[d].nextstate = d_p;
311 Arc arc(rarc.ilabel, rarc.olabel, rarc.weight.Reverse(), rarc.nextstate);
[all...]
H A Ddfs-visit.h128 int next_color = state_color[arc.nextstate];
134 state_color[arc.nextstate] = kDfsGrey;
135 state_stack.push(new DfsState<Arc>(fst, arc.nextstate));
136 dfs = visitor->InitState(arc.nextstate, root);
H A Dreweight.h67 (potential[arc.nextstate] == Weight::Zero()))
71 arc.weight = Divide(Times(arc.weight, potential[arc.nextstate]),
74 && (potential[arc.nextstate] != Weight::Zero()))
76 potential[arc.nextstate], DIVIDE_RIGHT);
H A Dstatesort.h77 arc.nextstate = order[arc.nextstate];
H A Dverify.h86 } else if (arc.nextstate < 0) {
90 } else if (arc.nextstate >= ns) {
/external/openfst/src/include/fst/
H A Darc.h50 : ilabel(i), olabel(o), weight(w), nextstate(s) {}
63 StateId nextstate; member in class:fst::ArcTpl
83 : ilabel(i), olabel(o), weight(w), nextstate(s) {}
99 StateId nextstate; // Transition destination state member in class:fst::StringArc
115 : ilabel(i), olabel(o), weight(w), nextstate(s) {}
119 weight(arc.olabel, arc.weight), nextstate(arc.nextstate) {}
133 StateId nextstate; // Transition destination state member in struct:fst::GallicArc
146 : ilabel(i), olabel(o), weight(w), nextstate(s) {}
158 StateId nextstate; // Transitio member in struct:fst::ReverseArc
182 StateId nextstate; // Transition destination state member in struct:fst::LexicographicArc
206 StateId nextstate; // Transition destination state member in struct:fst::ProductArc
238 StateId nextstate; // Transition destination state member in struct:fst::PowerArc
270 StateId nextstate; // Transition destination state member in struct:fst::SparsePowerArc
301 StateId nextstate; // Transition destination state member in struct:fst::ExpectationArc
[all...]
H A Dprune.h159 arc.nextstate < fdistance->size()
160 ? (*fdistance)[arc.nextstate]
163 arc.nextstate = dead[0];
167 if (less(Times(idistance[s], arc.weight), idistance[arc.nextstate]))
168 idistance[arc.nextstate] = Times(idistance[s], arc.weight);
169 if (visited[arc.nextstate]) continue;
173 if (enqueued[arc.nextstate] == kNoKey) {
174 enqueued[arc.nextstate] = heap.Insert(arc.nextstate);
177 heap.Update(enqueued[arc.nextstate], ar
[all...]
H A Dshortest-distance.h183 while (distance_->size() <= arc.nextstate) {
189 while (sources_.size() <= arc.nextstate)
191 if (sources_[arc.nextstate] != source_id_) {
192 (*distance_)[arc.nextstate] = Weight::Zero();
193 rdistance_[arc.nextstate] = Weight::Zero();
194 enqueued_[arc.nextstate] = false;
195 sources_[arc.nextstate] = source_id_;
198 Weight &nd = (*distance_)[arc.nextstate];
199 Weight &nr = rdistance_[arc.nextstate];
208 if (!enqueued_[arc.nextstate]) {
[all...]
H A Ddfs-visit.h148 if (arc.nextstate >= state_color.size()) {
149 nstates = arc.nextstate + 1;
156 int next_color = state_color[arc.nextstate];
162 state_color[arc.nextstate] = kDfsGrey;
163 state_stack.push(new DfsState<Arc>(fst, arc.nextstate));
164 dfs = visitor->InitState(arc.nextstate, root);
H A Dequal.h96 } else if (arc1.nextstate != arc2.nextstate) {
100 << ", nextstate1 = " << arc1.nextstate
101 << ", nextstate2 = " << arc2.nextstate;
H A Dvisit.h138 if (arc.nextstate >= state_status.size()) {
139 nstates = arc.nextstate + 1;
146 if (state_status[arc.nextstate] == kWhiteState) {
149 visit = visitor->InitState(arc.nextstate, root);
150 state_status[arc.nextstate] = kGreyState;
151 queue->Enqueue(arc.nextstate);
152 } else if (state_status[arc.nextstate] == kBlackState) {
H A Drmfinalepsilon.h58 if (coaccess[arc.nextstate]) {
79 if (finals.find(arc.nextstate) != finals.end()) {
82 w = Plus(Times(fst->Final(arc.nextstate), arc.weight), w);
H A Dconnect.h69 comps_->MakeSet(arc.nextstate);
70 comps_->Union(s, arc.nextstate);
75 comps_->Union(s, arc.nextstate);
80 comps_->Union(s, arc.nextstate);
147 StateId t = arc.nextstate;
154 if (arc.nextstate == start_) {
162 StateId t = arc.nextstate;
H A Dshortest-path.h159 while (distance->size() <= arc.nextstate) {
166 Weight &nd = (*distance)[arc.nextstate];
174 parent[arc.nextstate] = s;
175 arc_parent[arc.nextstate] = arc;
176 if (!enqueued[arc.nextstate]) {
177 state_queue->Enqueue(arc.nextstate);
178 enqueued[arc.nextstate] = true;
180 state_queue->Update(arc.nextstate);
195 arc_parent[d].nextstate = d_p;
359 Arc arc(rarc.ilabel, rarc.olabel, rarc.weight.Reverse(), rarc.nextstate);
[all...]
H A Dstate-map.h499 if (x.nextstate < y.nextstate) return true;
500 if (x.nextstate > y.nextstate) return false;
509 x.nextstate == y.nextstate);
574 if (x.nextstate < y.nextstate) return true;
575 if (x.nextstate > y.nextstate) retur
[all...]
H A Dstatesort.h86 arc.nextstate = order[arc.nextstate];
H A Dverify.h89 } else if (arc.nextstate < 0) {
93 } else if (arc.nextstate >= ns) {
/external/openfst/src/include/fst/extensions/pdt/
H A Dexpand.h190 StateTuple ntuple(arc.nextstate, stack_id);
191 arc.nextstate = state_table_->FindState(ntuple);
626 // the currently stored distance for 'arc.nextstate',
627 // updates 'Distance(arc.nextstate)' with new estimate;
628 // * if 'fd' is less than the currently stored distance from 'arc.nextstate'
633 if (less_(nd, Distance(arc.nextstate))) {
634 SetDistance(arc.nextstate, nd);
635 SetSourceState(arc.nextstate, SourceState(s));
637 if (less_(fd, FinalDistance(arc.nextstate)))
638 SetFinalDistance(arc.nextstate, f
[all...]

Completed in 272 milliseconds

1234