| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| arc.h | 36 : 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; // Transition destination stat member in struct:fst::GallicArc
160 StateId nextstate; \/\/ Transition destination state member in struct:fst::ReverseArc
[all...] |
| arcsum.h | 35 if (x.nextstate < y.nextstate) return true;
36 if (x.nextstate > y.nextstate) return false;
48 x.nextstate == y.nextstate);
|
| shortest-distance.h | 147 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...] |
| prune.h | 103 (*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...] |
| rmfinalepsilon.h | 51 if (coaccess[arc.nextstate]) {
72 if (finals.find(arc.nextstate) != finals.end()) {
75 w = Plus(Times(fst->Final(arc.nextstate), arc.weight), w);
|
| dfs-visit.h | 128 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);
|
| equal.h | 93 } else if (arc1.nextstate != arc2.nextstate) {
97 << ", nextstate1 = " << arc1.nextstate
98 << ", nextstate2 = " << arc2.nextstate;
|
| replace.h | 310 StateId nextstate = local
311 FindState(StateTuple(prefix_id, top.fst_id, top.nextstate));
312 AddArc(s, A(0, 0, fst->Final(fst_state), nextstate));
320 StateId nextstate = local
321 FindState(StateTuple(tuple.prefix_id, tuple.fst_id, arc.nextstate));
322 AddArc(s, A(arc.ilabel, arc.olabel, arc.weight, nextstate));
331 tuple.fst_id, arc.nextstate);
343 StateId nextstate = local
345 StateTuple(tuple.prefix_id, tuple.fst_id, arc.nextstate));
346 AddArc(s, A(arc.ilabel, arc.olabel, arc.weight, nextstate));
390 StateId nextstate; member in struct:fst::ReplaceFstImpl::PrefixTuple
[all...] |
| shortest-path.h | 116 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...] |
| reweight.h | 67 (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);
|
| statesort.h | 77 arc.nextstate = order[arc.nextstate];
|
| map.h | 121 final_arc.nextstate = superfinal;
203 final_arc.nextstate = superfinal;
365 aarc.nextstate = FindOState(aarc.nextstate);
382 final_arc.nextstate = superfinal_;
656 return LogArc(arc.ilabel, arc.olabel, arc.weight.Value(), arc.nextstate);
671 return StdArc(arc.ilabel, arc.olabel, arc.weight.Value(), arc.nextstate);
692 if (arc.nextstate == kNoStateId && arc.weight != AW::Zero())
695 else if (arc.nextstate == kNoStateId)
700 GW(SW::One(), arc.weight), arc.nextstate);
[all...] |
| verify.h | 86 } else if (arc.nextstate < 0) {
90 } else if (arc.nextstate >= ns) {
|
| invert.h | 32 return A(arc.olabel, arc.ilabel, arc.weight, arc.nextstate);
|
| rmepsilon.h | 79 StateId nextstate; member in struct:fst::RmEpsilonState::Element
84 : ilabel(i), olabel(o), nextstate(s) {}
90 return static_cast<size_t>(e.nextstate);
91 return static_cast<size_t>(e.nextstate +
105 && (e1.nextstate == e2.nextstate);
156 while ((StateId)visited_.size() <= arc.nextstate)
158 if (!visited_[arc.nextstate])
159 eps_queue_.push(arc.nextstate);
161 Element element(arc.ilabel, arc.olabel, arc.nextstate);
[all...] |
| minimize.h | 87 if (partition_.class_id(arc1.nextstate) <
88 partition_.class_id(arc2.nextstate)) return true;
89 if (partition_.class_id(arc1.nextstate) >
90 partition_.class_id(arc2.nextstate)) return false;
241 StateId from_state = aiter->Value().nextstate - 1;
346 if (height_[arc.nextstate] + 1 > height_[s])
347 height_[s] = height_[arc.nextstate] + 1;
459 arc.nextstate = state_map[partition.class_id(arc.nextstate)];
|
| randgen.h | 150 nopts.source = iarc.nextstate;
151 nopts.dest = oarc.nextstate;
|
| project.h | 40 return A(label, label, arc.weight, arc.nextstate);
|
| reverse.h | 69 StateId nos = iarc.nextstate + 1;
|
| connect.h | 105 StateId t = arc.nextstate;
112 if (arc.nextstate == start_) {
120 StateId t = arc.nextstate;
|
| encode.h | 233 if ((arc.nextstate == kNoStateId && !(flags_ & kEncodeWeights)) ||
234 (arc.nextstate == kNoStateId && (flags_ & kEncodeWeights) &&
242 arc.nextstate);
245 if (arc.nextstate == kNoStateId) {
253 arc.nextstate);;
|
| compose.h | 435 StateTuple tuple(arcb.nextstate, arca.nextstate, f);
436 arc.nextstate = FindState(tuple);
441 StateTuple tuple(arca.nextstate, arcb.nextstate, f);
442 arc.nextstate = FindState(tuple);
534 while (labela == kPhiLabel && sf != arca.nextstate) {
535 sf = arca.nextstate;
554 if (labela == kPhiLabel && sf == arca.nextstate) {
[all...] |
| 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);
|
| /external/srec/tools/grxmlcompile/ |
| fst-io.h | 115 PrintStateId(arc.nextstate);
249 arc.nextstate = d = StrToStateId(col[1]);
256 arc.nextstate = d = StrToStateId(col[1]);
268 arc.nextstate = d = StrToStateId(col[1]);
|
