Lines Matching refs:ifst
137 // 'ifst' whose weight is no more than 'opts.threshold' Times() the
141 void Prune(const Fst<Arc> &ifst,
155 if (ifst.Start() == kNoStateId)
163 ShortestDistance(ifst, idistance, false);
168 ShortestDistance(ifst, fdistance, true);
173 while (fdistance->size() <= ifst.Start())
175 Weight ceiling = Times((*fdistance)[ifst.Start()], opts.threshold);
177 for (StateIterator< Fst<Arc> > sit(ifst);
193 if (!less(ceiling, Times((*idistance)[state], ifst.Final(state))))
194 ofst->SetFinal(copy[state], ifst.Final(state));
196 for (ArcIterator< Fst<Arc> > ait(ifst, state);
222 ofst->SetStart(copy[ifst.Start()]);
234 // successful path in 'ifst' whose weight is no more than
238 void Prune(const Fst<Arc> &ifst,
242 Prune(ifst, ofst, opts);
