Home
last modified time | relevance | path

Searched refs:QueueItem (Results 1 – 2 of 2) sorted by relevance

/netbsd-src/external/apache2/llvm/dist/clang/lib/StaticAnalyzer/Core/
H A DWorkList.cpp206 using QueueItem = std::pair<WorkListUnit, QueuePriority>; typedef in __anon126612d90411::UnexploredFirstPriorityQueue
209 bool operator() (const QueueItem &LHS, const QueueItem &RHS) { in operator ()()
222 llvm::PriorityQueue<QueueItem, std::vector<QueueItem>, ExplorationComparator>
244 QueueItem U = queue.top(); in dequeue()
268 using QueueItem = std::pair<WorkListUnit, QueuePriority>; typedef in __anon126612d90511::UnexploredFirstPriorityLocationQueue
271 bool operator() (const QueueItem &LHS, const QueueItem &RHS) { in operator ()()
284 llvm::PriorityQueue<QueueItem, std::vector<QueueItem>, ExplorationComparator>
302 QueueItem U = queue.top(); in dequeue()
/netbsd-src/external/apache2/llvm/dist/clang/lib/Format/
H A DUnwrappedLineFormatter.cpp978 typedef std::pair<OrderedPenalty, StateNode *> QueueItem; typedef in clang::format::__anon25f930cf0111::OptimizingLineFormatter
981 typedef std::priority_queue<QueueItem, std::vector<QueueItem>,
982 std::greater<QueueItem>>
1004 Queue.push(QueueItem(OrderedPenalty(0, Count), Node)); in analyzeSolutionSpace()
1072 Queue->push(QueueItem(OrderedPenalty(Penalty, *Count), Node)); in addNextStateToQueue()