Cross Reference: /external/openfst/src/include/fst/queue.h

Lines Matching defs:queue
0 // queue.h
45 //   // Returns the head of the queue
49 //   // Removes the head of the queue
53 //   // Does the queue contain no elements?
55 //   // Remove all states from queue
59 // State queue types.
61   TRIVIAL_QUEUE = 0,         // Single state queue
62   FIFO_QUEUE = 1,            // First-in, first-out queue
63   LIFO_QUEUE = 2,            // Last-in, first-out queue
64   SHORTEST_FIRST_QUEUE = 3,  // Shortest-first queue
65   TOP_ORDER_QUEUE = 4,       // Topologically-ordered queue
66   STATE_ORDER_QUEUE = 5,     // State-ID ordered queue
67   SCC_QUEUE = 6,             // Component graph top-ordered meta-queue
68   AUTO_QUEUE = 7,            // Auto-selected queue
108 // Trivial queue discipline, templated on the StateId. You may enqueue
140 // First-in, first-out queue discipline, templated on the StateId.
173 // Last-in, first-out queue discipline, templated on the StateId.
206 // Shortest-first queue discipline, templated on the StateId and
209 // it can be reordered in the queue with a call to Update().
210 // If 'update == false', call to Update() does not reorder the queue.
295 // Shortest-first queue discipline, templated on the StateId and Weight, is
310 // Topological-order queue discipline, templated on the StateId.
311 // States are ordered in the queue topologically. The FST must be acyclic.
382 // State order queue discipline, templated on the StateId.
383 // States are ordered in the queue by state Id.
435 // SCC topological-order meta-queue discipline, templated on the StateId S
436 // and a queue Q, which is used inside each SCC.  It visits the SCC's
446   // and a vector giving the queue to use per SCC number.
447   SccQueue(const vector<StateId> &scc, vector<Queue*> *queue)
448     : QueueBase<S>(SCC_QUEUE), queue_(queue), scc_(scc), front_(0),
532 // Automatic queue discipline, templated on the StateId. It selects a
533 // queue discipline for a given FST based on its properties.
541   // shortest-first queue using the natural order w.r.t to the distance.
573       // Find the queue type to use per SCC.
578       // If unweighted and semiring is idempotent, use lifo queue.
679 // determines which type of queue to use per SCC. Stores result in
683 // to true if every queue is the trivial queue. UNWEIGHTED is set to
769 // A* queue discipline, templated on the StateId, Weight and an
795 // Distance-based pruning queue discipline: Enqueues a state 's'
800 // 'class_func'. The underlying queue discipline is specified by
801 // 'queue'. The ownership of 'queue' is given to this class.
808   PruneQueue(const vector<Weight> &distance, Q *queue, L comp,
812       queue_(queue),
868 // Pruning queue discipline (see above) using the weight's natural
869 // order for the comparison function. The ownership of 'queue' is
878   NaturalPruneQueue(const vector<W> &distance, Q *queue,
880       PruneQueue<Q, NaturalLess<W>, C>(distance, queue, less_,
888 // Filter-based pruning queue discipline: Enqueues a state 's' only
890 // The underlying queue discipline is specified by 'queue'. The ownership
891 // of 'queue' is given to this class.
897   FilterQueue(Q *queue, const F &state_filter)
899       queue_(queue),