HomeSort by relevance Sort by last modified time
    Searched refs:PriorityQueue (Results 1 - 25 of 60) sorted by null

1 2 3

  /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 17 import java.util.PriorityQueue;
32 private PriorityQueue<Integer> populatedQueue(int n) {
33 PriorityQueue<Integer> q = new PriorityQueue<Integer>(n);
48 assertEquals(0, new PriorityQueue(SIZE).size());
56 PriorityQueue q = new PriorityQueue(0);
66 PriorityQueue q = new PriorityQueue((Collection)null);
77 PriorityQueue q = new PriorityQueue(Arrays.asList(ints))
    [all...]
  /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/
PriorityQueueTest.java 26 import java.util.PriorityQueue;
35 private static final String SERIALIZATION_FILE_NAME = "serialization/org/apache/harmony/tests/java/util/PriorityQueue.golden.ser";
38 * java.util.PriorityQueue#iterator()
41 PriorityQueue<Integer> integerQueue = new PriorityQueue<Integer>();
59 * java.util.PriorityQueue#iterator()
62 PriorityQueue<Integer> integerQueue = new PriorityQueue<Integer>();
81 * java.util.PriorityQueue#iterator()
84 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;
37 pq = new PriorityQueue<Integer>();
38 usepq = new PriorityQueue<Integer>();
62 usepq = new PriorityQueue<Integer>(pq);
78 usepq = new PriorityQueue<Integer>(pq);
  /external/chromium_org/net/base/
prioritized_dispatcher.h 21 // non-thread-safe PriorityQueue. All operations are O(p) time for p priority
28 typedef PriorityQueue<Job*>::Priority Priority;
64 typedef PriorityQueue<Job*>::Pointer Handle;
125 PriorityQueue<Job*> queue_;
priority_queue_unittest.cc 15 typedef PriorityQueue<int>::Priority Priority;
47 PriorityQueue<int> queue_;
48 PriorityQueue<int>::Pointer pointers_[kNumElements];
80 PriorityQueue<int>::Pointer p = queue_.FirstMax();
93 PriorityQueue<int>::Pointer current = queue_.FirstMax();
97 PriorityQueue<int>::Pointer next = queue_.GetNextTowardsLastMin(current);
priority_queue.h 32 class PriorityQueue : public base::NonThreadSafe {
88 // Comparing to Pointer from a different PriorityQueue is undefined.
98 friend class PriorityQueue;
104 typedef typename PriorityQueue::List::iterator ListIterator;
131 explicit PriorityQueue(Priority num_priorities)
306 DISALLOW_COPY_AND_ASSIGN(PriorityQueue);
  /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,
  /libcore/luni/src/main/java/java/util/
PriorityQueue.java 24 * A PriorityQueue holds elements on a priority heap, which orders the elements
32 * A PriorityQueue is not synchronized. If multiple threads will have to access
35 public class PriorityQueue<E> extends AbstractQueue<E> implements Serializable {
55 public PriorityQueue() {
68 public PriorityQueue(int initialCapacity) {
83 public PriorityQueue(int initialCapacity, Comparator<? super E> comparator) {
105 public PriorityQueue(Collection<? extends E> c) {
106 if (c instanceof PriorityQueue) {
107 getFromPriorityQueue((PriorityQueue<? extends E>) c);
126 public PriorityQueue(PriorityQueue<? extends E> c)
    [all...]
  /external/guava/guava/src/com/google/common/collect/
Queues.java 22 import java.util.PriorityQueue;
153 // PriorityQueue
156 * Creates an empty {@code PriorityQueue} instance.
158 * @return a new, empty {@code PriorityQueue}
160 public static <E> PriorityQueue<E> newPriorityQueue() {
161 return new PriorityQueue<E>();
165 * Creates an {@code PriorityQueue} instance containing the given elements.
168 * @return a new {@code PriorityQueue} containing those elements
170 public static <E> PriorityQueue<E> newPriorityQueue(Iterable<? extends E> elements) {
172 return new PriorityQueue<E>(Collections2.cast(elements))
    [all...]
  /frameworks/base/tools/layoutlib/bridge/src/android/animation/
AnimationThread.java 31 import java.util.PriorityQueue;
70 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")
  /frameworks/support/v7/palette/src/android/support/v7/graphics/
ColorCutQuantizer.java 29 import java.util.PriorityQueue;
127 final PriorityQueue<Vbox> pq = new PriorityQueue<Vbox>(maxColors, VBOX_COMPARATOR_VOLUME);
146 * @param queue {@link java.util.PriorityQueue} to poll for boxes
149 private void splitBoxes(final PriorityQueue<Vbox> queue, final int maxSize) {
  /frameworks/base/tests/Camera2Tests/SmartCamera/SimpleCamera/src/androidx/media/filterfw/
FrameManager.java 26 import java.util.PriorityQueue;
161 private PriorityQueue<Backing> mQueue;
164 mQueue = new PriorityQueue<Backing>(4, new Comparator<Backing>() {
  /packages/apps/Gallery/src/com/android/camera/gallery/
ImageListUber.java 27 import java.util.PriorityQueue;
39 private final PriorityQueue<MergeSlot> mQueue;
55 mQueue = new PriorityQueue<MergeSlot>(4,
  /packages/apps/UnifiedEmail/src/com/android/mail/browse/
MessageAttachmentTile.java 47 import java.util.PriorityQueue;
139 PriorityQueue<MessageAttachmentTile> queue = new PriorityQueue<MessageAttachmentTile>(
  /packages/apps/Calendar/src/com/android/calendar/
AsyncQueryServiceHelper.java 39 import java.util.PriorityQueue;
46 private static final PriorityQueue<OperationInfo> sWorkQueue =
47 new PriorityQueue<OperationInfo>();
181 // Unknown order even for a PriorityQueue
  /packages/apps/UnifiedEmail/src/com/android/mail/ui/
FolderSelectorAdapter.java 46 import java.util.PriorityQueue;
157 final public PriorityQueue<TreeNode> mChildren = new PriorityQueue<TreeNode>();
  /external/chromium_org/third_party/webrtc/base/
messagequeue.cc 363 PriorityQueue::container_type::iterator new_end = dmsgq_.container().begin();
364 for (PriorityQueue::container_type::iterator it = new_end;
messagequeue.h 227 class PriorityQueue : public std::priority_queue<DelayedMessage> {
244 PriorityQueue dmsgq_;
  /libcore/luni/src/main/java/java/util/concurrent/
DelayQueue.java 45 private final PriorityQueue<E> q = new PriorityQueue<E>();
  /developers/build/prebuilts/gradle/Quiz/Application/src/main/java/com/example/android/wearable/quiz/
MainActivity.java 76 import java.util.PriorityQueue;
103 private PriorityQueue<Question> mFutureQuestions;
133 mFutureQuestions = new PriorityQueue<Question>(10);
  /developers/build/prebuilts/gradle/StorageProvider/Application/src/main/java/com/example/android/storageprovider/
MyCloudProvider.java 47 import java.util.PriorityQueue;
168 PriorityQueue<File> lastModifiedFiles = new PriorityQueue<File>(5, new Comparator<File>() {
  /developers/samples/android/content/documentsUi/StorageProvider/Application/src/main/java/com/example/android/storageprovider/
MyCloudProvider.java 47 import java.util.PriorityQueue;
168 PriorityQueue<File> lastModifiedFiles = new PriorityQueue<File>(5, new Comparator<File>() {
  /developers/samples/android/wearable/wear/Quiz/Application/src/main/java/com/example/android/wearable/quiz/
MainActivity.java 76 import java.util.PriorityQueue;
103 private PriorityQueue<Question> mFutureQuestions;
133 mFutureQuestions = new PriorityQueue<Question>(10);

Completed in 871 milliseconds

1 2 3