Searched refs:ShortestDistance (Results 1 - 18 of 18) sorted by relevance

/external/openfst/src/script/
H A Dshortest-distance.cc25 void ShortestDistance(const FstClass &fst, vector<WeightClass> *distance, function in namespace:fst::script
29 Apply<Operation<ShortestDistanceArgs1> >("ShortestDistance", fst.ArcType(),
34 void ShortestDistance(const FstClass &ifst, vector<WeightClass> *distance, function in namespace:fst::script
38 Apply<Operation<ShortestDistanceArgs2> >("ShortestDistance", ifst.ArcType(),
43 WeightClass ShortestDistance(const FstClass &ifst) { function in namespace:fst::script
46 Apply<Operation<ShortestDistanceArgs3> >("ShortestDistance", ifst.ArcType(),
52 REGISTER_FST_OPERATION(ShortestDistance, StdArc, ShortestDistanceArgs1);
53 REGISTER_FST_OPERATION(ShortestDistance, LogArc, ShortestDistanceArgs1);
54 REGISTER_FST_OPERATION(ShortestDistance, Log64Arc, ShortestDistanceArgs1);
56 REGISTER_FST_OPERATION(ShortestDistance, StdAr
[all...]
/external/openfst/src/include/fst/script/
H A Dshortest-distance.h115 ShortestDistance(fst, &weights, sdopts);
126 ShortestDistance(fst, &weights, sdopts);
137 ShortestDistance(fst, &weights, sdopts);
149 ShortestDistance(fst, &weights, sdopts);
163 void ShortestDistance(ShortestDistanceArgs1 *args) { function in namespace:fst::script
205 void ShortestDistance(ShortestDistanceArgs2 *args) { function in namespace:fst::script
209 ShortestDistance(fst, &distance, args->arg3, args->arg4);
225 void ShortestDistance(ShortestDistanceArgs3 *args) { function in namespace:fst::script
228 args->retval = WeightClass(ShortestDistance(fst));
233 void ShortestDistance(cons
[all...]
H A Dfstscript.h136 REGISTER_FST_OPERATION(ShortestDistance, Arc, ShortestDistanceArgs1);
137 REGISTER_FST_OPERATION(ShortestDistance, Arc, ShortestDistanceArgs2);
138 REGISTER_FST_OPERATION(ShortestDistance, Arc, ShortestDistanceArgs3);
/external/srec/tools/thirdparty/OpenFst/fst/lib/
H A Dpush.h43 ShortestDistance(*fst, &distance, type == REWEIGHT_TO_INITIAL);
70 ShortestDistance(gfst, &gdistance, rtype == REWEIGHT_TO_INITIAL);
76 ShortestDistance(guwfst, &gdistance, rtype == REWEIGHT_TO_INITIAL);
H A Dshortest-distance.h50 // ShortestDistance(source) when 'retain' is true for improved
75 void ShortestDistance(StateId source);
94 void ShortestDistanceState<Arc, Queue, ArcFilter>::ShortestDistance( function in class:fst::ShortestDistanceState
100 LOG(FATAL) << "ShortestDistance: Weight needs to be right distributive: "
199 void ShortestDistance( function in namespace:fst
206 sd_state.ShortestDistance(opts.source);
230 void ShortestDistance(const Fst<Arc> &fst, function in namespace:fst
241 ShortestDistance(fst, distance, opts);
253 ShortestDistance(rfst, &rdistance, ropts);
H A Dprune.h75 ShortestDistance(*fst, idistance, false);
82 ShortestDistance(*fst, fdistance, true);
163 ShortestDistance(ifst, idistance, false);
168 ShortestDistance(ifst, fdistance, true);
H A Dshortest-path.h260 ShortestDistance(ifst, distance, opts);
H A Drmepsilon.h136 sd_state_.ShortestDistance(source);
/external/openfst/src/include/fst/
H A Dshortest-distance.h65 // ShortestDistance(source) when 'retain' is true for improved
91 void ShortestDistance(StateId source);
116 void ShortestDistanceState<Arc, Queue, ArcFilter>::ShortestDistance( function in class:fst::ShortestDistanceState
124 FSTERROR() << "ShortestDistance: Weight needs to be right distributive: "
131 FSTERROR() << "ShortestDistance: first_path option disallowed when "
244 void ShortestDistance( function in namespace:fst
251 sd_state.ShortestDistance(opts.source);
281 void ShortestDistance(const Fst<Arc> &fst, function in namespace:fst
294 ShortestDistance(fst, distance, opts);
307 ShortestDistance(rfs
323 typename Arc::Weight ShortestDistance(const Fst<Arc> &fst, float delta = kDelta) { function in namespace:fst
[all...]
H A Drandequivalent.h89 Weight sum1 = ShortestDistance(pfst1);
99 Weight sum2 = ShortestDistance(pfst2);
H A Dpush.h40 // the output of ShortestDistance. 'distance' is the shortest distance from the
103 ShortestDistance(*fst, &distance, type == REWEIGHT_TO_INITIAL, delta);
140 ShortestDistance(gfst, &gdistance, rtype == REWEIGHT_TO_INITIAL, delta);
146 ShortestDistance(guwfst, &gdistance, rtype == REWEIGHT_TO_INITIAL, delta);
H A Dprune.h119 ShortestDistance(*fst, &tmp, true, opts.delta);
243 ShortestDistance(ifst, &tmp, true, opts.delta);
H A Drmepsilon.h163 sd_state_.ShortestDistance(source);
H A Dshortest-path.h434 ShortestDistance(ifst, distance, opts);
H A Ddeterminize.h996 ShortestDistance(ifst, &idistance, true);
/external/openfst/src/bin/
H A Dfstshortestdistance.cc83 s::ShortestDistance(*ifst, &distance, FLAGS_reverse, FLAGS_delta);
87 s::ShortestDistance(*ifst, &distance, opts);
/external/openfst/src/include/fst/extensions/far/
H A Dprint-strings.h103 cout << FLAGS_far_field_separator[0] << ShortestDistance(fst);
/external/openfst/src/test/
H A Dalgo_test.h623 ShortestDistance(U, &d, true);
627 ShortestDistance(U1, &d, true);
631 ShortestDistance(U2, &d, true);
747 VLOG(1) << "Check: ShortestDistance(T- prune(T))"
748 << " > ShortestDistance(T) times Thresold";
757 Weight sum1 = Times(ShortestDistance(A), thresold);
758 Weight sum2 = ShortestDistance(C);
780 Weight tsum = ShortestDistance(T);
781 Weight psum = ShortestDistance(path);
794 ShortestDistance(path
[all...]

Completed in 1555 milliseconds