Searched refs:PriorityQueue (Results 1 – 19 of 19) sorted by relevance
26 import java.util.PriorityQueue;41 PriorityQueue<Integer> integerQueue = new PriorityQueue<Integer>(); in test_iterator()62 PriorityQueue<Integer> integerQueue = new PriorityQueue<Integer>(); in test_iterator_empty()84 PriorityQueue<Integer> integerQueue = new PriorityQueue<Integer>(); in test_iterator_outofbound()110 PriorityQueue<Integer> integerQueue = new PriorityQueue<Integer>(); in test_iterator_remove()138 …PriorityQueue<String> integerQueue = new PriorityQueue<String>(10, new MockComparatorStringByLengt… in test_iterator_removeEquals()153 PriorityQueue<Integer> integerQueue = new PriorityQueue<Integer>(); in test_iterator_remove_illegalState()181 PriorityQueue<Integer> integerQueue = new PriorityQueue<Integer>(); in test_size()194 PriorityQueue<Object> queue = new PriorityQueue<Object>(); in test_Constructor()204 PriorityQueue<Object> queue = new PriorityQueue<Object>(100); in test_ConstructorI()[all …]
22 import java.util.PriorityQueue;160 public static <E> PriorityQueue<E> newPriorityQueue() { in newPriorityQueue()161 return new PriorityQueue<E>(); in newPriorityQueue()170 public static <E> PriorityQueue<E> newPriorityQueue(Iterable<? extends E> elements) { in newPriorityQueue()172 return new PriorityQueue<E>(Collections2.cast(elements)); in newPriorityQueue()174 PriorityQueue<E> queue = new PriorityQueue<E>(); in newPriorityQueue()
41 import java.util.PriorityQueue;1304 queue = new PriorityQueue<PeekingIterator<T>>(2, heapComparator);
38 import java.util.PriorityQueue;
15 typedef PriorityQueue<int>::Priority Priority;47 PriorityQueue<int> queue_;48 PriorityQueue<int>::Pointer pointers_[kNumElements];80 PriorityQueue<int>::Pointer p = queue_.FirstMax(); in TEST_F()93 PriorityQueue<int>::Pointer current = queue_.FirstMax(); in TEST_F()97 PriorityQueue<int>::Pointer next = queue_.GetNextTowardsLastMin(current); in TEST_F()
28 typedef PriorityQueue<Job*>::Priority Priority;64 typedef PriorityQueue<Job*>::Pointer Handle;125 PriorityQueue<Job*> queue_;
32 class PriorityQueue : public base::NonThreadSafe {98 friend class PriorityQueue;104 typedef typename PriorityQueue::List::iterator ListIterator;131 explicit PriorityQueue(Priority num_priorities) in PriorityQueue() function306 DISALLOW_COPY_AND_ASSIGN(PriorityQueue);
28 class PriorityQueue : public std::priority_queue<T, Sequence, Compare> {30 explicit PriorityQueue(const Compare &compare = Compare(),36 PriorityQueue(Iterator begin, Iterator end,
29 import java.util.PriorityQueue;172 return new PriorityQueue<String>(MinimalCollection.of(elements));
217 class PriorityQueue : public std::priority_queue<DelayedMessage> {238 PriorityQueue dmsgq_;
354 PriorityQueue::container_type::iterator new_end = dmsgq_.container().begin(); in Clear()355 for (PriorityQueue::container_type::iterator it = new_end; in Clear()
243 class PriorityQueue : public std::priority_queue<DelayedMessage> {264 PriorityQueue dmsgq_;
378 PriorityQueue::container_type::iterator new_end = dmsgq_.container().begin(); in Clear()379 for (PriorityQueue::container_type::iterator it = new_end; in Clear()
38 class PriorityQueue { class43 PriorityQueue(const Sorter &Precedes) : Precedes(Precedes) {} in PriorityQueue() function in __anon614e51e70111::PriorityQueue150 PriorityQueue<BlockPair, QueueSorter, 20> Queue;
35 import java.util.PriorityQueue;657 PriorityQueue<Integer> control = new PriorityQueue<Integer>(); in testCorrectOrdering_randomAccess()
39 import java.util.PriorityQueue;1268 queue = new PriorityQueue<PeekingIterator<T>>(2, heapComparator);
30 typedef net::PriorityQueue<ScheduledResourceRequest*> NetQueue;
355 typedef PriorityQueue<const Request*> RequestQueue;
2637 PriorityQueue<SUnit*, std::vector<SUnit*>, SUnitOrder<false> >2640 PriorityQueue<SUnit*, std::vector<SUnit*>, SUnitOrder<true> >