• Home
  • Raw
  • Download

Lines Matching refs:ifst

78 void SingleShortestPath(const Fst<Arc> &ifst,  in SingleShortestPath()  argument
86 ofst->SetInputSymbols(ifst.InputSymbols()); in SingleShortestPath()
87 ofst->SetOutputSymbols(ifst.OutputSymbols()); in SingleShortestPath()
89 if (ifst.Start() == kNoStateId) { in SingleShortestPath()
90 if (ifst.Properties(kError, false)) ofst->SetProperties(kError, kError); in SingleShortestPath()
99 StateId source = opts.source == kNoStateId ? ifst.Start() : opts.source; in SingleShortestPath()
142 if (ifst.Final(s) != Weight::Zero()) { in SingleShortestPath()
143 Weight w = Times(sd, ifst.Final(s)); in SingleShortestPath()
155 for (ArcIterator< Fst<Arc> > aiter(ifst, s); in SingleShortestPath()
193 ofst->SetFinal(s_p, ifst.Final(f_parent)); in SingleShortestPath()
200 if (ifst.Properties(kError, false)) ofst->SetProperties(kError, kError); in SingleShortestPath()
276 void NShortestPath(const Fst<RevArc> &ifst,
297 ofst->SetInputSymbols(ifst.InputSymbols());
298 ofst->SetOutputSymbols(ifst.OutputSymbols());
317 if (ifst.Start() == kNoStateId ||
318 distance.size() <= ifst.Start() ||
319 distance[ifst.Start()] == Weight::Zero() ||
322 if (ifst.Properties(kError, false)) ofst->SetProperties(kError, kError);
330 pairs[final] = Pair(ifst.Start(), Weight::One());
332 Weight limit = Times(distance[ifst.Start()], weight_threshold);
355 for (ArcIterator< Fst<RevArc> > aiter(ifst, p.first);
369 Weight finalw = ifst.Final(p.first).Reverse();
380 if (ifst.Properties(kError, false)) ofst->SetProperties(kError, kError);
413 void ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst, in ShortestPath() argument
422 SingleShortestPath(ifst, ofst, distance, opts); in ShortestPath()
434 ShortestDistance(ifst, distance, opts); in ShortestPath()
444 Reverse(ifst, &rfst); in ShortestPath()
484 void ShortestPath(const Fst<Arc> &ifst, MutableFst<Arc> *ofst,
491 AutoQueue<typename Arc::StateId> state_queue(ifst, &distance, arc_filter);
496 ShortestPath(ifst, ofst, &distance, opts);