Searched refs:superfinal (Results 1 - 4 of 4) sorted by relevance
/external/openfst/src/include/fst/ |
H A D | arc-map.h | 21 // not change the number of arcs (except possibly superfinal arcs). 45 // A final weight is mapped to an arc to the superfinal state 47 // The superfinal state will be added only if it is needed. 50 // A final weight is mapped to an arc to the superfinal state 52 // Zero(). The superfinal state is always added (if the input is 72 // the number of arcs (expect possibly superfinal arcs). 96 // e.g. whether to add a superfinal state. They will use the Properties() 128 StateId superfinal = kNoStateId; local 130 superfinal = fst->AddState(); 131 fst->SetFinal(superfinal, Weigh 233 StateId superfinal = kNoStateId; local [all...] |
H A D | shortest-path.h | 306 // distance from 'superfinal' to the final state is 'Weight::One()', 307 // hence 'distance[superfinal]' is not needed. 308 StateId superfinal = -1; 310 compare(pairs, distance, superfinal, delta); 314 // paths computed so far to 's'. Valid for 's == -1' (superfinal). 339 Weight d = p.first == superfinal ? Weight::One() : 349 if (p.first == superfinal) 351 if ((p.first == superfinal) && (r[p.first + 1] == n)) break; 353 if (p.first == superfinal) continue; 373 pairs.push_back(Pair(superfinal, [all...] |
/external/srec/tools/thirdparty/OpenFst/fst/lib/ |
H A D | map.h | 35 // A final weight is mapped to an arc to the superfinal state 37 // The superfinal state will be added only if it is needed. 40 // A final weight is mapped to an arc to the superfinal state 42 // Zero(). The superfinal state is always added (if the input is 65 // e.g. whether to add a superfinal state. They will use the Properties() 91 StateId superfinal = kNoStateId; local 93 superfinal = fst->AddState(); 94 fst->SetFinal(superfinal, Weight::One()); 113 if (s != superfinal) { 116 // Add a superfinal stat 174 StateId superfinal = kNoStateId; local [all...] |
H A D | shortest-path.h | 277 StateId superfinal = distance->size(); // superfinal must be handled local 280 compare(pairs, *distance, superfinal, opts.delta); 300 if (p.first == superfinal) 302 if ((p.first == superfinal) && (r[p.first] == n)) break; 304 if (p.first == superfinal) 325 pairs.push_back(Pair(superfinal, w));
|
Completed in 133 milliseconds