Lines Matching refs:final
49 // path to a final state. That path is the shortest path
142 if (ifst.Final(s) != Weight::Zero()) {
143 Weight w = Times(sd, ifst.Final(s));
193 ofst->SetFinal(s_p, ifst.Final(f_parent));
254 // 'distance' must contain the shortest distance from each state to a final
262 // the single final state.
306 // distance from 'superfinal' to the final state is 'Weight::One()',
326 StateId final = ofst->AddState();
327 ofst->SetFinal(final, Weight::One());
328 while (pairs.size() <= final)
330 pairs[final] = Pair(ifst.Start(), Weight::One());
331 heap.push_back(final);
369 Weight finalw = ifst.Final(p.first).Reverse();
402 // the single final state.
441 // the distance to the final state in 'rfst', 'ofst' is built as the
