Searched refs:QueueItem (Results 1 – 3 of 3) sorted by relevance
/external/libweave/include/weave/provider/test/ |
D | fake_task_runner.h | 41 using QueueItem = std::pair<std::pair<base::Time, size_t>, base::Closure>; variable 44 bool operator()(const QueueItem& a, const QueueItem& b) const { in operator() 55 std::priority_queue<QueueItem, 56 std::vector<QueueItem>,
|
/external/libweave/examples/provider/ |
D | event_task_runner.h | 74 using QueueItem = std::pair<std::pair<base::Time, size_t>, base::Closure>; variable 77 bool operator()(const QueueItem& a, const QueueItem& b) const { in operator() 84 std::priority_queue<QueueItem, 85 std::vector<QueueItem>,
|
/external/clang/lib/Format/ |
D | UnwrappedLineFormatter.cpp | 670 typedef std::pair<OrderedPenalty, StateNode *> QueueItem; typedef in clang::format::__anon620a99a70111::OptimizingLineFormatter 673 typedef std::priority_queue<QueueItem, std::vector<QueueItem>, 674 std::greater<QueueItem>> QueueType; 695 Queue.push(QueueItem(OrderedPenalty(0, Count), Node)); in analyzeSolutionSpace() 761 Queue->push(QueueItem(OrderedPenalty(Penalty, *Count), Node)); in addNextStateToQueue()
|