| /system/chre/util/include/chre/util/ |
| priority_queue_impl.h | 29 PriorityQueue<ElementType, CompareFunction>::PriorityQueue() {}
32 PriorityQueue<ElementType, CompareFunction>::PriorityQueue(
37 size_t PriorityQueue<ElementType, CompareFunction>::size() const {
42 size_t PriorityQueue<ElementType, CompareFunction>::capacity() const {
47 bool PriorityQueue<ElementType, CompareFunction>::empty() const {
52 bool PriorityQueue<ElementType, CompareFunction>::push(
63 bool PriorityQueue<ElementType, CompareFunction>::emplace(Args&&... args) {
72 ElementType& PriorityQueue<ElementType, CompareFunction>::operator[]
[all...] |
| priority_queue.h | 33 class PriorityQueue : public NonCopyable {
38 PriorityQueue();
46 PriorityQueue(const CompareFunction& compare);
158 typename PriorityQueue<ElementType, CompareFunction>::iterator begin();
159 typename PriorityQueue<ElementType, CompareFunction>::const_iterator begin() const;
160 typename PriorityQueue<ElementType, CompareFunction>::const_iterator cbegin() const;
165 typename PriorityQueue<ElementType, CompareFunction>::iterator end();
166 typename PriorityQueue<ElementType, CompareFunction>::const_iterator end() const;
167 typename PriorityQueue<ElementType, CompareFunction>::const_iterator cend() const;
|
| /libcore/luni/src/test/java/libcore/java/util/ |
| OldPriorityQueueTest.java | 22 import java.util.PriorityQueue;
28 PriorityQueue<Object> queue = new PriorityQueue<Object>(100);
34 new PriorityQueue(0);
42 PriorityQueue<String> queue = new PriorityQueue<String>(10,
58 PriorityQueue<Integer> integerQueue = new PriorityQueue<Integer>(list);
74 PriorityQueue<Integer> srcIntegerQueue = new PriorityQueue<Integer>
[all...] |
| /libcore/jsr166-tests/src/test/java/jsr166/ |
| PriorityQueueTest.java | 16 import java.util.PriorityQueue;
43 private PriorityQueue<Integer> populatedQueue(int n) {
44 PriorityQueue<Integer> q = new PriorityQueue<Integer>(n);
59 assertEquals(0, new PriorityQueue(SIZE).size());
67 new PriorityQueue(0);
77 new PriorityQueue((Collection)null);
87 new PriorityQueue(Arrays.asList(new Integer[SIZE]));
100 new PriorityQueue(Arrays.asList(ints));
112 PriorityQueue q = new PriorityQueue(Arrays.asList(ints))
[all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| PriorityQueueTest.java | 28 import java.util.PriorityQueue;
39 private static final String SERIALIZATION_FILE_NAME = "serialization/org/apache/harmony/tests/java/util/PriorityQueue.golden.ser";
42 * java.util.PriorityQueue#iterator()
45 PriorityQueue<Integer> integerQueue = new PriorityQueue<Integer>();
63 * java.util.PriorityQueue#iterator()
66 PriorityQueue<Integer> integerQueue = new PriorityQueue<Integer>();
85 * java.util.PriorityQueue#iterator()
88 PriorityQueue<Integer> integerQueue = new PriorityQueue<Integer>()
[all...] |
| /libcore/benchmarks/src/benchmarks/regression/ |
| PriorityQueueBenchmark.java | 24 import java.util.PriorityQueue;
31 private PriorityQueue<Integer> pq;
32 private PriorityQueue<Integer> usepq;
38 pq = new PriorityQueue<Integer>();
39 usepq = new PriorityQueue<Integer>();
63 usepq = new PriorityQueue<Integer>(pq);
79 usepq = new PriorityQueue<Integer>(pq);
|
| /system/chre/util/tests/ |
| priority_queue_test.cc | 4 using chre::PriorityQueue;
43 PriorityQueue<int> q;
50 PriorityQueue<int> q;
61 PriorityQueue<int> q;
72 PriorityQueue<int> q;
85 PriorityQueue<int> q;
96 PriorityQueue<int> q;
102 PriorityQueue<int> q;
107 PriorityQueue<int> q;
120 PriorityQueue<int> q
[all...] |
| /external/llvm/include/llvm/ADT/ |
| PriorityQueue.h | 1 //===- llvm/ADT/PriorityQueue.h - Priority queues ---------------*- C++ -*-===//
10 // This file defines the PriorityQueue class.
22 /// PriorityQueue - This class behaves like std::priority_queue and
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
36 PriorityQueue(Iterator begin, Iterator end,
|
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| PriorityQueue.h | 1 //===- llvm/ADT/PriorityQueue.h - Priority queues ---------------*- C++ -*-===//
10 // This file defines the PriorityQueue class.
22 /// PriorityQueue - This class behaves like std::priority_queue and
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
36 PriorityQueue(Iterator begin, Iterator end,
|
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| PriorityQueue.h | 1 //===- llvm/ADT/PriorityQueue.h - Priority queues ---------------*- C++ -*-===//
10 // This file defines the PriorityQueue class.
22 /// PriorityQueue - This class behaves like std::priority_queue and
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
36 PriorityQueue(Iterator begin, Iterator end,
|
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
| PriorityQueue.h | 1 //===- llvm/ADT/PriorityQueue.h - Priority queues ---------------*- C++ -*-===//
10 // This file defines the PriorityQueue class.
22 /// PriorityQueue - This class behaves like std::priority_queue and
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
36 PriorityQueue(Iterator begin, Iterator end,
|
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| PriorityQueue.h | 1 //===- llvm/ADT/PriorityQueue.h - Priority queues ---------------*- C++ -*-===//
10 // This file defines the PriorityQueue class.
22 /// PriorityQueue - This class behaves like std::priority_queue and
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
36 PriorityQueue(Iterator begin, Iterator end,
|
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| PriorityQueue.h | 1 //===- llvm/ADT/PriorityQueue.h - Priority queues ---------------*- C++ -*-===//
10 // This file defines the PriorityQueue class.
22 /// PriorityQueue - This class behaves like std::priority_queue and
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
36 PriorityQueue(Iterator begin, Iterator end,
|
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| PriorityQueue.h | 1 //===- llvm/ADT/PriorityQueue.h - Priority queues ---------------*- C++ -*-===//
10 // This file defines the PriorityQueue class.
22 /// PriorityQueue - This class behaves like std::priority_queue and
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
36 PriorityQueue(Iterator begin, Iterator end,
|
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
| PriorityQueue.h | 1 //===- llvm/ADT/PriorityQueue.h - Priority queues ---------------*- C++ -*-===//
10 // This file defines the PriorityQueue class.
22 /// PriorityQueue - This class behaves like std::priority_queue and
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
36 PriorityQueue(Iterator begin, Iterator end,
|
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| PriorityQueue.h | 1 //===- llvm/ADT/PriorityQueue.h - Priority queues ---------------*- C++ -*-===//
10 // This file defines the PriorityQueue class.
22 /// PriorityQueue - This class behaves like std::priority_queue and
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
36 PriorityQueue(Iterator begin, Iterator end,
|
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/ADT/ |
| PriorityQueue.h | 1 //===- llvm/ADT/PriorityQueue.h - Priority queues ---------------*- C++ -*-===//
10 // This file defines the PriorityQueue class.
22 /// PriorityQueue - This class behaves like std::priority_queue and
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {
30 explicit PriorityQueue(const Compare &compare = Compare(),
36 PriorityQueue(Iterator begin, Iterator end,
|
| /prebuilts/go/darwin-x86/src/container/heap/ |
| example_pq_test.go | 21 // A PriorityQueue implements heap.Interface and holds Items.
22 type PriorityQueue []*Item
24 func (pq PriorityQueue) Len() int { return len(pq) }
26 func (pq PriorityQueue) Less(i, j int) bool {
31 func (pq PriorityQueue) Swap(i, j int) {
37 func (pq *PriorityQueue) Push(x interface{}) {
44 func (pq *PriorityQueue) Pop() interface{} {
54 func (pq *PriorityQueue) update(item *Item, value string, priority int) {
60 // This example creates a PriorityQueue with some items, adds and manipulates an item,
70 pq := make(PriorityQueue, len(items)
[all...] |
| /prebuilts/go/linux-x86/src/container/heap/ |
| example_pq_test.go | 21 // A PriorityQueue implements heap.Interface and holds Items.
22 type PriorityQueue []*Item
24 func (pq PriorityQueue) Len() int { return len(pq) }
26 func (pq PriorityQueue) Less(i, j int) bool {
31 func (pq PriorityQueue) Swap(i, j int) {
37 func (pq *PriorityQueue) Push(x interface{}) {
44 func (pq *PriorityQueue) Pop() interface{} {
54 func (pq *PriorityQueue) update(item *Item, value string, priority int) {
60 // This example creates a PriorityQueue with some items, adds and manipulates an item,
70 pq := make(PriorityQueue, len(items)
[all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| PriorityQueue.java | 62 * Multiple threads should not access a {@code PriorityQueue}
82 public class PriorityQueue<E> extends AbstractQueue<E>
117 * Creates a {@code PriorityQueue} with the default initial
121 public PriorityQueue() {
126 * Creates a {@code PriorityQueue} with the specified initial
134 public PriorityQueue(int initialCapacity) {
139 * Creates a {@code PriorityQueue} with the default initial capacity and
147 public PriorityQueue(Comparator<? super E> comparator) {
152 * Creates a {@code PriorityQueue} with the specified initial capacity
162 public PriorityQueue(int initialCapacity
[all...] |
| /external/guava/guava/src/com/google/common/collect/ |
| Queues.java | 23 import java.util.PriorityQueue;
192 * <b>Note:</b> If the specified iterable is a {@code SortedSet} or a {@code PriorityQueue},
207 // PriorityQueue
210 * Creates an empty {@code PriorityQueue} with the ordering given by its
215 public static <E extends Comparable> PriorityQueue<E> newPriorityQueue() {
216 return new PriorityQueue<E>();
220 * Creates a {@code PriorityQueue} containing the given elements.
222 * <b>Note:</b> If the specified iterable is a {@code SortedSet} or a {@code PriorityQueue},
227 public static <E extends Comparable> PriorityQueue<E> newPriorityQueue(
230 return new PriorityQueue<E>(Collections2.cast(elements))
[all...] |
| /system/chre/core/include/chre/core/ |
| timer_pool.h | 129 PriorityQueue<TimerRequest, std::greater<TimerRequest>> mTimerRequests;
|
| /external/guava/guava-tests/benchmark/com/google/common/util/concurrent/ |
| MonitorBasedPriorityBlockingQueue.java | 27 import java.util.PriorityQueue;
37 * the same ordering rules as class {@link PriorityQueue} and supplies
95 final PriorityQueue<E> q;
110 q = new PriorityQueue<E>();
123 q = new PriorityQueue<E>(initialCapacity, null);
140 q = new PriorityQueue<E>(initialCapacity, comparator);
146 * {@link SortedSet} or a {@link PriorityQueue}, this
160 q = new PriorityQueue<E>(c);
|
| /frameworks/layoutlib/bridge/src/android/animation/ |
| AnimationThread.java | 30 import java.util.PriorityQueue;
69 private Queue<MessageBundle> mQueue = new PriorityQueue<MessageBundle>();
|
| /external/guava/guava-testlib/src/com/google/common/collect/testing/ |
| TestsForQueuesInJavaUtil.java | 29 import java.util.PriorityQueue;
147 // Not specifying KNOWN_ORDER for PriorityQueue and PriorityBlockingQueue
172 return new PriorityQueue<String>(MinimalCollection.of(elements));
175 .named("PriorityQueue")
|
