| /external/openfst/src/script/ |
| H A D | shortest-path.cc | 24 void ShortestPath(const FstClass &ifst, MutableFstClass *ofst, function in namespace:fst::script
27 if (!ArcTypesMatch(ifst, *ofst, "ShortestPath")) return;
30 Apply<Operation<ShortestPathArgs1> >("ShortestPath", ifst.ArcType(), &args);
33 void ShortestPath(const FstClass &ifst, MutableFstClass *ofst, function in namespace:fst::script
36 if (!ArcTypesMatch(ifst, *ofst, "ShortestPath")) return;
40 Apply<Operation<ShortestPathArgs2> >("ShortestPath", ifst.ArcType(), &args);
44 REGISTER_FST_OPERATION(ShortestPath, StdArc, ShortestPathArgs1);
45 REGISTER_FST_OPERATION(ShortestPath, LogArc, ShortestPathArgs1);
46 REGISTER_FST_OPERATION(ShortestPath, Log64Arc, ShortestPathArgs1);
48 REGISTER_FST_OPERATION(ShortestPath, StdAr
[all...] |
| /external/openfst/src/include/fst/script/ |
| H A D | shortest-path.h | 57 void ShortestPath(ShortestPathArgs1 *args) { function in namespace:fst::script
78 ShortestPath(ifst, ofst, &weights, spopts);
90 ShortestPath(ifst, ofst, &weights, spopts);
102 ShortestPath(ifst, ofst, &weights, spopts);
114 ShortestPath(ifst, ofst, &weights, spopts);
126 ShortestPath(ifst, ofst, &weights, spopts);
138 ShortestPath(ifst, ofst, &weights, spopts);
160 void ShortestPath(ShortestPathArgs2 *args) { function in namespace:fst::script
166 ShortestPath(ifst, ofst, args->arg3, args->arg4, args->arg5,
172 void ShortestPath(cons
[all...] |
| H A D | fstscript.h | 139 REGISTER_FST_OPERATION(ShortestPath, Arc, ShortestPathArgs1);
140 REGISTER_FST_OPERATION(ShortestPath, Arc, ShortestPathArgs2);
|
| /external/compiler-rt/lib/sanitizer_common/tests/ |
| H A D | sanitizer_bvgraph_test.cc | 266 void ShortestPath() { function
298 TEST(BVGraph, ShortestPath) {
299 ShortestPath<BV1>();
300 ShortestPath<BV2>();
301 ShortestPath<BV3>();
302 ShortestPath<BV4>();
|
| /external/openfst/src/bin/ |
| H A D | fstshortestpath.cc | 87 s::ShortestPath(*ifst, &ofst, &distance, opts);
|
| /external/openfst/src/include/fst/extensions/pdt/ |
| H A D | pdtscript.h | 226 ShortestPath(fst, parens, ofst, spopts);
233 ShortestPath(fst, parens, ofst, spopts);
240 ShortestPath(fst, parens, ofst, spopts);
|
| H A D | shortest-path.h | 424 void ShortestPath(MutableFst<Arc> *ofst) { function in class:fst::PdtShortestPath
776 void ShortestPath(const Fst<Arc> &ifst, function in namespace:fst
782 psp.ShortestPath(ofst);
786 void ShortestPath(const Fst<Arc> &ifst, function in namespace:fst
793 psp.ShortestPath(ofst);
|
| H A D | expand.h | 365 reverse_shortest_path_->ShortestPath(&path);
|
| /external/srec/tools/thirdparty/OpenFst/fst/lib/ |
| H A D | shortest-path.h | 50 // 'ShortestPath' below with n=1. 'ofst' contains the shortest path in
88 LOG(FATAL) << "SingleShortestPath: for nshortest > 1, use ShortestPath"
228 void ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, function in namespace:fst
248 LOG(FATAL) << "ShortestPath: n-shortest: Weight needs to have the "
252 LOG(FATAL) << "ShortestPath: n-shortest-string algorithm not "
351 void ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, function in namespace:fst
358 ShortestPath(ifst, ofst, &distance, opts);
|
| /external/openfst/src/include/fst/ |
| H A D | shortest-path.h | 67 // 'ShortestPath' below with n=1. 'ofst' contains the shortest path in
106 FSTERROR() << "SingleShortestPath: for nshortest > 1, use ShortestPath"
413 void ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, function in namespace:fst
427 FSTERROR() << "ShortestPath: n-shortest: Weight needs to have the "
484 void ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, function in namespace:fst
496 ShortestPath(ifst, ofst, &distance, opts);
|
| /external/openfst/src/test/ |
| H A D | algo_test.h | 779 ShortestPath(T, &path);
791 ShortestPath(R, &paths, nshortest, true, false,
803 ShortestPath(R, &path);
|