/external/guava/guava-testlib/src/com/google/common/collect/testing/testers/ |
H A D | AbstractQueueTester.java | 22 import java.util.Queue; 31 protected final Queue<E> getQueue() { 32 return (Queue<E>) collection;
|
/external/guava/guava-testlib/src/com/google/common/collect/testing/ |
H A D | TestQueueGenerator.java | 21 import java.util.Queue; 31 Queue<E> create(Object... elements);
|
H A D | TestStringQueueGenerator.java | 23 import java.util.Queue; 40 public Queue<String> create(Object... elements) { 49 protected abstract Queue<String> create(String[] elements);
|
H A D | TestsForQueuesInJavaUtil.java | 30 import java.util.Queue; 37 * Generates a test suite covering the {@link Queue} implementations in the 81 @Override public Queue<String> create(String[] elements) { 99 @Override public Queue<String> create(String[] elements) { 116 @Override public Queue<String> create(String[] elements) { 133 @Override public Queue<String> create(String[] elements) { 155 @Override public Queue<String> create(String[] elements) { 171 @Override public Queue<String> create(String[] elements) {
|
/external/llvm/lib/CodeGen/ |
H A D | LatencyPriorityQueue.cpp | 84 Queue.push_back(SU); 122 std::vector<SUnit *>::iterator Best = Queue.begin(); 123 for (std::vector<SUnit *>::iterator I = std::next(Queue.begin()), 124 E = Queue.end(); I != E; ++I) 128 if (Best != std::prev(Queue.end())) 129 std::swap(*Best, Queue.back()); 130 Queue.pop_back(); 135 assert(!Queue.empty() && "Queue is empty!"); 136 std::vector<SUnit *>::iterator I = std::find(Queue [all...] |
/external/google-breakpad/src/testing/gtest/samples/ |
H A D | sample3-inl.h | 40 // Queue is a simple queue implemented as a singled-linked list. 44 class Queue; 46 // QueueNode is a node in a Queue, which consists of an element of 50 friend class Queue<E>; 74 class Queue { class 77 Queue() : head_(NULL), last_(NULL), size_(0) {} function in class:Queue 80 ~Queue() { Clear(); } 153 Queue* Map(F function) const { 154 Queue* new_queue = new Queue(); [all...] |
H A D | sample3_unittest.cc | 95 // A helper function for testing Queue::Map(). 96 void MapTester(const Queue<int> * q) { 99 const Queue<int> * const new_q = q->Map(Double); 114 Queue<int> q0_; 115 Queue<int> q1_; 116 Queue<int> q2_; 146 // Tests the Queue::Map() function.
|
H A D | sample5_unittest.cc | 164 Queue<int> q0_; 165 Queue<int> q1_; 166 Queue<int> q2_;
|
/external/protobuf/gtest/samples/ |
H A D | sample3-inl.h | 40 // Queue is a simple queue implemented as a singled-linked list. 44 class Queue; 46 // QueueNode is a node in a Queue, which consists of an element of 50 friend class Queue<E>; 74 class Queue { class 78 Queue() : head_(NULL), last_(NULL), size_(0) {} function in class:Queue 81 ~Queue() { Clear(); } 154 Queue* Map(F function) const { 155 Queue* new_queue = new Queue(); [all...] |
H A D | sample3_unittest.cc | 95 // A helper function for testing Queue::Map(). 96 void MapTester(const Queue<int> * q) { 99 const Queue<int> * const new_q = q->Map(Double); 114 Queue<int> q0_; 115 Queue<int> q1_; 116 Queue<int> q2_; 146 // Tests the Queue::Map() function.
|
H A D | sample5_unittest.cc | 164 Queue<int> q0_; 165 Queue<int> q1_; 166 Queue<int> q2_;
|
/external/openfst/src/include/fst/script/ |
H A D | shortest-path.h | 71 typedef AutoQueue<StateId> Queue; typedef 72 Queue *queue = QueueConstructor<Queue, Arc, 74 fst::ShortestPathOptions<Arc, Queue, ArcFilter> spopts( 83 typedef FifoQueue<StateId> Queue; typedef 84 Queue *queue = QueueConstructor<Queue, Arc, 86 fst::ShortestPathOptions<Arc, Queue, ArcFilter> spopts( 95 typedef LifoQueue<StateId> Queue; typedef 96 Queue *queu 107 typedef NaturalShortestFirstQueue<StateId, Weight> Queue; typedef 119 typedef StateOrderQueue<StateId> Queue; typedef 131 typedef TopOrderQueue<StateId> Queue; typedef [all...] |
H A D | shortest-distance.h | 57 template<class Queue, class Arc, class ArcFilter> 60 static Queue *Construct(const Fst<Arc> &, 62 return new Queue(); 101 template<class Arc, class Queue> 110 Queue *queue = 111 QueueConstructor<Queue, Arc, AnyArcFilter<Arc> >::Construct( 113 fst::ShortestDistanceOptions<Arc, Queue, AnyArcFilter<Arc> > sdopts( 120 Queue *queue = 121 QueueConstructor<Queue, Arc, AnyArcFilter<Arc> >::Construct( 123 fst::ShortestDistanceOptions<Arc, Queue, [all...] |
/external/guava/guava/src/com/google/common/collect/ |
H A D | ForwardingQueue.java | 22 import java.util.Queue; 46 implements Queue<E> { 51 @Override protected abstract Queue<E> delegate();
|
H A D | EvictingQueue.java | 29 import java.util.Queue; 48 private final Queue<E> delegate; 79 @Override protected Queue<E> delegate() {
|
/external/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/ |
H A D | BaseKeyPool.java | 5 import java.util.Queue; 9 private final Queue<T> keyPool = Util.createQueue(MAX_SIZE);
|
/external/guava/guava-tests/test/com/google/common/collect/ |
H A D | ForwardingQueueTest.java | 31 import java.util.Queue; 43 private final Queue<T> backingQueue; 45 StandardImplForwardingQueue(Queue<T> backingQueue) { 49 @Override protected Queue<T> delegate() { 106 private Queue<String> forward; 107 private Queue<String> queue; 116 @Override protected Queue<String> create(String[] elements) { 137 queue = createProxyInstance(Queue.class); 139 @Override protected Queue<String> delegate() {
|
/external/glide/library/src/main/java/com/bumptech/glide/util/ |
H A D | ByteArrayPool.java | 5 import java.util.Queue; 18 private final Queue<byte[]> tempQueue = Util.createQueue(0);
|
/external/guava/guava-tests/benchmark/com/google/common/collect/ |
H A D | MinMaxPriorityQueueBenchmark.java | 30 import java.util.Queue; 47 private Queue<Integer> queue; 87 protected Queue<T> delegate() { 100 @Override public Queue<Integer> create(Comparator<Integer> comparator) { 105 @Override public Queue<Integer> create(Comparator<Integer> comparator) { 110 @Override public Queue<Integer> create(Comparator<Integer> comparator) { 115 public abstract Queue<Integer> create(Comparator<Integer> comparator);
|
/external/openfst/src/include/fst/extensions/pdt/ |
H A D | shortest-path.h | 40 template <class Arc, class Queue> 379 template<class Arc, class Queue> 394 const PdtShortestPathOptions<Arc, Queue> &opts) 471 Queue *state_queue_; // current state queue 485 template<class Arc, class Queue> 486 void PdtShortestPath<Arc, Queue>::Init(MutableFst<Arc> *ofst) { 526 template<class Arc, class Queue> 527 void PdtShortestPath<Arc, Queue>::GetDistance(StateId start) { 531 Queue state_queue; 552 template<class Arc, class Queue> 790 typedef FifoQueue<typename Arc::StateId> Queue; typedef [all...] |
/external/guava/guava-testlib/test/com/google/common/collect/testing/ |
H A D | OpenJdk6QueueTests.java | 27 import java.util.Queue; 30 * Tests the {@link Queue} implementations of {@link java.util}, suppressing
|
/external/jetty/src/java/org/eclipse/jetty/io/ |
H A D | PooledBuffers.java | 21 import java.util.Queue; 27 private final Queue<Buffer> _headers; 28 private final Queue<Buffer> _buffers; 29 private final Queue<Buffer> _others;
|
/external/openfst/src/include/fst/ |
H A D | shortest-distance.h | 38 template <class Arc, class Queue, class ArcFilter> 42 Queue *state_queue; // Queue discipline used; owned by caller 56 ShortestDistanceOptions(Queue *q, ArcFilter filt, StateId src = kNoStateId, 71 template<class Arc, class Queue, class ArcFilter> 80 const ShortestDistanceOptions<Arc, Queue, ArcFilter> &opts, 98 Queue *state_queue_; 115 template <class Arc, class Queue, class ArcFilter> 116 void ShortestDistanceState<Arc, Queue, ArcFilter>::ShortestDistance( 243 template<class Arc, class Queue, clas [all...] |
/external/guava/guava/src/com/google/common/io/ |
H A D | LineReader.java | 27 import java.util.Queue; 44 private final Queue<String> lines = new LinkedList<String>();
|
/external/guava/guava/src/com/google/common/util/concurrent/ |
H A D | SerializingExecutor.java | 22 import java.util.Queue; 55 private final Queue<Runnable> waitQueue = new LinkedList<Runnable>();
|