Cross Reference: /external/srec/tools/thirdparty/OpenFst/fst/lib/queue.h

Lines Matching defs:queue
0 // queue.h
41 //   // Returns the head of the queue
45 //   // Removes the head of the queue
49 //   // Does the queue contain no elements?
51 //   // Remove all states from queue
55 // State queue types.
57   TRIVIAL_QUEUE = 0,         // Single state queue
58   FIFO_QUEUE = 1,            // First-in, first-out queue
59   LIFO_QUEUE = 2,            // Last-in, first-out queue
60   SHORTEST_FIRST_QUEUE = 3,  // Shortest-first queue
61   TOP_ORDER_QUEUE = 4,       // Topologically-ordered queue
62   STATE_ORDER_QUEUE = 5,     // State-ID ordered queue
63   SCC_QUEUE = 6,             // Component graph top-ordered meta-queue
64   AUTO_QUEUE = 7,            // Auto-selected queue
98 // Trivial queue discipline, templated on the StateId. You may enqueue
127 // First-in, first-out queue discipline, templated on the StateId.
157 // Last-in, first-out queue discipline, templated on the StateId.
187 // Shortest-first queue discipline, templated on the StateId and
190 // it can be reordered in the queue with a call to Update().
263 // Shortest-first queue discipline, templated on the StateId and Weight is
279 // Topological-order queue discipline, templated on the StateId.
280 // States are ordered in the queue topologically. The FST must be acyclic.
348 // State order queue discipline, templated on the StateId.
349 // States are ordered in the queue by state Id.
398 // SCC topological-order meta-queue discipline, templated on the StateId S
399 // and a queue Q, which is used inside each SCC.  It visits the SCC's
409   // and a vector giving the queue to use per SCC number.
410   SccQueue(const vector<StateId> &scc, vector<Queue*> *queue)
411     : QueueBase<S>(SCC_QUEUE), queue_(queue), scc_(scc), front_(0),
422       LOG(FATAL) << "SccQueue: head of empty queue";
444       LOG(FATAL) << "SccQueue: dequeue of empty queue";
494 // Automatic queue discipline, templated on the StateId. It selects a
495 // queue discipline for a given FST based on its properties.
503   // shortest-first queue using the natural order w.r.t to the distance.
535       // Find the queue type to use per SCC.
540       // If unweighted and semiring is idempotent, use lifo queue.
637 // determines which type of queue to use per SCC. Stores result in
641 // to true if every queue is the trivial queue. UNWEIGHTED is set to