Searched refs:Queue (Results 1 - 25 of 282) sorted by relevance

1234567891011>>

/external/guava/guava-testlib/src/com/google/common/collect/testing/testers/
H A DAbstractQueueTester.java22 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 DTestQueueGenerator.java21 import java.util.Queue;
31 Queue<E> create(Object... elements);
H A DTestStringQueueGenerator.java23 import java.util.Queue;
40 public Queue<String> create(Object... elements) {
49 protected abstract Queue<String> create(String[] elements);
/external/llvm/lib/CodeGen/
H A DLatencyPriorityQueue.cpp84 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/python/cpython2/Lib/multiprocessing/dummy/
H A Dconnection.py37 from Queue import Queue namespace
46 self._backlog_queue = Queue(backlog)
58 _in, _out = Queue(), Queue()
64 a, b = Queue(), Queue()
/external/google-breakpad/src/testing/gtest/samples/
H A Dsample3-inl.h40 // 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 Dsample3_unittest.cc95 // 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.
/external/googletest/googletest/samples/
H A Dsample3-inl.h40 // 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 Dsample3_unittest.cc95 // 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.
/external/protobuf/gtest/samples/
H A Dsample3-inl.h40 // 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 Dsample3_unittest.cc95 // 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.
/external/v8/testing/gtest/samples/
H A Dsample3-inl.h40 // 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 Dsample3_unittest.cc95 // 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.
/external/vulkan-validation-layers/tests/gtest-1.7.0/samples/
H A Dsample3-inl.h40 // 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 Dsample3_unittest.cc95 // 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.
/external/python/cpython3/Lib/multiprocessing/dummy/
H A Dconnection.py12 from queue import Queue namespace
21 self._backlog_queue = Queue(backlog)
39 _in, _out = Queue(), Queue()
45 a, b = Queue(), Queue()
/external/swiftshader/third_party/LLVM/lib/CodeGen/
H A DLatencyPriorityQueue.cpp83 Queue.push_back(SU);
121 std::vector<SUnit *>::iterator Best = Queue.begin();
122 for (std::vector<SUnit *>::iterator I = llvm::next(Queue.begin()),
123 E = Queue.end(); I != E; ++I)
127 if (Best != prior(Queue.end()))
128 std::swap(*Best, Queue.back());
129 Queue.pop_back();
134 assert(!Queue.empty() && "Queue is empty!");
135 std::vector<SUnit *>::iterator I = std::find(Queue
[all...]
/external/autotest/server/cros/
H A Dqueue_barrier.py5 from multiprocessing import Queue, queues namespace
33 self.queue_master_ = Queue()
34 self.queue_slave_ = Queue()
/external/guava/guava/src/com/google/common/collect/
H A DForwardingQueue.java22 import java.util.Queue;
46 implements Queue<E> {
51 @Override protected abstract Queue<E> delegate();
/external/glide/library/src/main/java/com/bumptech/glide/load/engine/bitmap_recycle/
H A DBaseKeyPool.java5 import java.util.Queue;
9 private final Queue<T> keyPool = Util.createQueue(MAX_SIZE);
/external/toolchain-utils/bestflags/
H A Dpipeline_worker_test.py47 helper_queue = manager.Queue()
48 result_queue = manager.Queue()
49 completed_queue = manager.Queue()
97 result_queue = manager.Queue()
98 completed_queue = manager.Queue()
/external/tensorflow/tensorflow/core/kernels/batching_util/
H A Dshared_batch_scheduler.h42 class Queue;
182 using QueueList = std::list<std::unique_ptr<internal::Queue<TaskType>>>;
227 class Queue { class in namespace:tensorflow::serving::internal
232 Queue(const typename SharedBatchScheduler<TaskType>::QueueOptions& options,
237 ~Queue();
328 TF_DISALLOW_COPY_AND_ASSIGN(Queue);
331 // A RAII-style object that points to a Queue and implements
337 Queue<TaskType>* queue);
352 Queue<TaskType>* queue_;
416 std::unique_ptr<internal::Queue<TaskTyp
505 Queue<TaskType>::Queue( function in class:tensorflow::serving::internal::Queue
[all...]
/external/guava/guava-tests/test/com/google/common/collect/
H A DForwardingQueueTest.java31 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/python/cpython2/Lib/test/
H A Dtest_queue.py2 # to ensure the Queue locks remain stable.
3 import Queue namespace
11 # A thread to run a function that unclogs a blocked Queue.
97 target_order = dict(Queue = [111, 333, 222],
105 self.assertTrue(not q.empty(), "Queue should not be empty")
106 self.assertTrue(not q.full(), "Queue should not be full")
110 self.assertTrue(q.full(), "Queue should be full")
114 except Queue.Full:
119 except Queue.Full:
127 self.assertTrue(q.empty(), "Queue shoul
[all...]
/external/glide/library/src/main/java/com/bumptech/glide/util/
H A DByteArrayPool.java5 import java.util.Queue;
18 private final Queue<byte[]> tempQueue = Util.createQueue(0);

Completed in 555 milliseconds

1234567891011>>