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

Lines Matching defs:queue
0 // queue.h
44 //   // Returns the head of the queue
48 //   // Removes the head of the queue
52 //   // Does the queue contain no elements?
54 //   // Remove all states from queue
58 // State queue types.
60   TRIVIAL_QUEUE = 0,         // Single state queue
61   FIFO_QUEUE = 1,            // First-in, first-out queue
62   LIFO_QUEUE = 2,            // Last-in, first-out queue
63   SHORTEST_FIRST_QUEUE = 3,  // Shortest-first queue
64   TOP_ORDER_QUEUE = 4,       // Topologically-ordered queue
65   STATE_ORDER_QUEUE = 5,     // State-ID ordered queue
66   SCC_QUEUE = 6,             // Component graph top-ordered meta-queue
67   AUTO_QUEUE = 7,            // Auto-selected queue
107 // Trivial queue discipline, templated on the StateId. You may enqueue
139 // First-in, first-out queue discipline, templated on the StateId.
172 // Last-in, first-out queue discipline, templated on the StateId.
205 // Shortest-first queue discipline, templated on the StateId and
208 // it can be reordered in the queue with a call to Update().
209 // If 'update == false', call to Update() does not reorder the queue.
294 // Shortest-first queue discipline, templated on the StateId and Weight, is
309 // Topological-order queue discipline, templated on the StateId.
310 // States are ordered in the queue topologically. The FST must be acyclic.
381 // State order queue discipline, templated on the StateId.
382 // States are ordered in the queue by state Id.
434 // SCC topological-order meta-queue discipline, templated on the StateId S
435 // and a queue Q, which is used inside each SCC.  It visits the SCC's
445   // and a vector giving the queue to use per SCC number.
446   SccQueue(const vector<StateId> &scc, vector<Queue*> *queue)
447     : QueueBase<S>(SCC_QUEUE), queue_(queue), scc_(scc), front_(0),
531 // Automatic queue discipline, templated on the StateId. It selects a
532 // queue discipline for a given FST based on its properties.
540   // shortest-first queue using the natural order w.r.t to the distance.
572       // Find the queue type to use per SCC.
577       // If unweighted and semiring is idempotent, use lifo queue.
678 // determines which type of queue to use per SCC. Stores result in
682 // to true if every queue is the trivial queue. UNWEIGHTED is set to
768 // A* queue discipline, templated on the StateId, Weight and an
794 // Pruning queue discipline: Enqueues a state 's' only when its
799 // queue discipline is specified by 'queue'. The ownership of 'queue'
807   PruneQueue(const vector<Weight> &distance, Q *queue, L comp,
811       queue_(queue),
867 // Pruning queue discipline (see above) using the weight's natural
868 // order for the comparison function. The ownership of 'queue' is
877   NaturalPruneQueue(const vector<W> &distance, Q *queue,
879       PruneQueue<Q, NaturalLess<W>, C>(distance, queue, less_,