Lines Matching defs:Queue
28 #include <queue>
884 /// \brief An item in the prioritized BFS search queue. The \c StateNode's
888 /// \brief The BFS queue type.
901 // Insert start element into queue.
904 Queue.push(QueueItem(OrderedPenalty(0, Count), Node));
908 while (!Queue.empty()) {
909 unsigned Penalty = Queue.top().first.first;
910 StateNode *Node = Queue.top().second;
915 Queue.pop();
925 if (Queue.empty())
931 reconstructPath(InitialState, Queue.top().second);
935 return Queue.top().second->State.Column;
957 /// \brief Add the following state to the analysis queue \c Queue.
978 Queue.push(QueueItem(OrderedPenalty(Penalty, Count), Node));
1053 QueueType Queue;
