HomeSort by relevance Sort by last modified time
    Searched refs:TopOrderQueue (Results 1 - 5 of 5) sorted by null

  /external/openfst/src/include/fst/script/
shortest-distance.h 67 // and TopOrderQueue's different constructors
92 struct QueueConstructor<TopOrderQueue<typename Arc::StateId>, Arc, ArcFilter> {
94 static TopOrderQueue<typename Arc::StateId> *Construct(
96 return new TopOrderQueue<typename Arc::StateId>(fst, ArcFilter());
195 ShortestDistanceHelper<Arc, TopOrderQueue<StateId> >(args);
rmepsilon.h 117 TopOrderQueue<StateId> queue(*fst, EpsilonArcFilter<Arc>());
118 fst::RmEpsilonOptions<Arc, TopOrderQueue<StateId> > ropts(
shortest-path.h 131 typedef TopOrderQueue<StateId> Queue;
  /external/srec/tools/thirdparty/OpenFst/fst/lib/
queue.h 282 class TopOrderQueue : public QueueBase<S> {
291 TopOrderQueue(const Fst<Arc> &fst, ArcFilter filter)
298 LOG(FATAL) << "TopOrderQueue: fst is not acyclic.";
304 TopOrderQueue(const vector<StateId> &order)
517 queue_ = new TopOrderQueue<StateId>(fst, filter);
551 queue_ = new TopOrderQueue<StateId>(scc_);
  /external/openfst/src/include/fst/
queue.h 313 class TopOrderQueue : public QueueBase<S> {
321 TopOrderQueue(const Fst<Arc> &fst, ArcFilter filter)
328 FSTERROR() << "TopOrderQueue: fst is not acyclic.";
336 TopOrderQueue(const vector<StateId> &order)
555 queue_ = new TopOrderQueue<StateId>(fst, filter);
589 queue_ = new TopOrderQueue<StateId>(scc_);

Completed in 80 milliseconds