| /freebsd-11-stable/contrib/libstdc++/include/backward/ |
| H A D | queue.h | 35 using std::priority_queue;
|
| /freebsd-11-stable/contrib/libstdc++/include/ext/pb_ds/ |
| H A D | priority_queue.hpp | 43 * @file priority_queue.hpp
61 class priority_queue class in namespace:pb_ds
86 priority_queue() { } function in class:pb_ds::priority_queue
90 priority_queue(const cmp_fn& r_cmp_fn) : base_type(r_cmp_fn) { } function in class:pb_ds::priority_queue
96 priority_queue(It first_it, It last_it) function in class:pb_ds::priority_queue
104 priority_queue(It first_it, It last_it, const cmp_fn& r_cmp_fn) function in class:pb_ds::priority_queue
108 priority_queue(const priority_queue& other) function in class:pb_ds::priority_queue
112 ~priority_queue() { }
114 priority_queue
[all...] |
| /freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | PriorityQueue.h | 21 /// PriorityQueue - This class behaves like std::priority_queue and
27 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
31 : std::priority_queue<T, Sequence, Compare>(compare, sequence)
38 : std::priority_queue<T, Sequence, Compare>(begin, end, compare, sequence)
58 // priority_queue's plain pop to remove it.
|
| /freebsd-11-stable/contrib/libstdc++/include/precompiled/ |
| H A D | extc++.h | 60 #include <ext/pb_ds/priority_queue.hpp>
|
| /freebsd-11-stable/contrib/libstdc++/include/bits/ |
| H A D | stl_queue.h | 311 * %priority_queue.
314 * and removed from, the %priority_queue using the
315 * %priority_queue's member functions. If you access the elements
317 * order would be different, the %priority_queue will not re-sort
322 class priority_queue class
350 priority_queue(const _Compare& __x = _Compare(), function in class:priority_queue
371 priority_queue(_InputIterator __first, _InputIterator __last, function in class:priority_queue
439 // No equality/comparison operators are provided for priority_queue.
|
| /freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Support/ |
| H A D | GenericIteratedDominanceFrontier.h | 140 std::priority_queue<DomTreeNodePair, SmallVector<DomTreeNodePair, 32>,
|
| H A D | GenericDomTreeConstruction.h | 638 // we use a priority_queue here.
639 std::priority_queue<TreeNodePtr, SmallVector<TreeNodePtr, 8>,
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | RegAllocBasic.cpp | 68 std::priority_queue<LiveInterval*, std::vector<LiveInterval*>,
|
| H A D | LiveDebugValues.cpp | 1508 std::priority_queue<unsigned int, std::vector<unsigned int>,
1511 std::priority_queue<unsigned int, std::vector<unsigned int>,
|
| H A D | RegAllocPBQP.cpp | 327 std::priority_queue<IntervalInfo, std::vector<IntervalInfo>,
|
| H A D | RegAllocGreedy.cpp | 154 using PQueue = std::priority_queue<std::pair<unsigned, unsigned>>;
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | SplitModule.cpp | 161 std::priority_queue<std::pair<unsigned, unsigned>,
|
| /freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Hexagon/ |
| H A D | BitTracker.h | 103 std::priority_queue<MachineInstr*, std::vector<MachineInstr*>, Cmp> Uses;
|
| /freebsd-11-stable/gnu/lib/libstdc++/ |
| H A D | Makefile | 204 priority_queue.hpp \
|
| /freebsd-11-stable/contrib/llvm-project/clang/lib/Format/ |
| H A D | UnwrappedLineFormatter.cpp | 942 typedef std::priority_queue<QueueItem, std::vector<QueueItem>,
|
| /freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-profdata/ |
| H A D | llvm-profdata.cpp | 841 std::priority_queue<std::pair<std::string, uint64_t>,
|
| /freebsd-11-stable/contrib/libstdc++/include/ |
| H A D | Makefile.am | 239 ${pb_srcdir}/priority_queue.hpp \
|
| H A D | Makefile.in | 463 ${pb_srcdir}/priority_queue.hpp \
|