| /external/llvm/lib/CodeGen/ |
| D | LatencyPriorityQueue.cpp | 84 Queue.push_back(SU); in push()
122 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop()
123 for (std::vector<SUnit *>::iterator I = std::next(Queue.begin()), in pop()
124 E = Queue.end(); I != E; ++I) in pop()
128 if (Best != std::prev(Queue.end())) in pop()
129 std::swap(*Best, Queue.back()); in pop()
130 Queue.pop_back(); in pop()
135 assert(!Queue.empty() && "Queue is empty!"); in remove()
136 std::vector<SUnit *>::iterator I = std::find(Queue.begin(), Queue.end(), SU); in remove()
137 if (I != std::prev(Queue.end())) in remove()
[all …]
|
| /external/protobuf/gtest/samples/ |
| D | sample3-inl.h | 44 class Queue; variable
50 friend class Queue<E>; variable
74 class Queue {
78 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue() function
81 ~Queue() { Clear(); } in ~Queue()
154 Queue* Map(F function) const { in Map()
155 Queue* new_queue = new Queue(); in Map()
169 Queue(const Queue&);
170 const Queue& operator = (const Queue&);
|
| D | sample3_unittest.cc | 96 void MapTester(const Queue<int> * q) { in MapTester()
99 const Queue<int> * const new_q = q->Map(Double); in MapTester()
114 Queue<int> q0_;
115 Queue<int> q1_;
116 Queue<int> q2_;
|
| /external/vulkan-validation-layers/tests/gtest-1.7.0/samples/ |
| D | sample3-inl.h | 44 class Queue; variable
50 friend class Queue<E>; variable
74 class Queue {
77 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue() function
80 ~Queue() { Clear(); } in ~Queue()
153 Queue* Map(F function) const { in Map()
154 Queue* new_queue = new Queue(); in Map()
168 Queue(const Queue&);
169 const Queue& operator = (const Queue&);
|
| D | sample3_unittest.cc | 96 void MapTester(const Queue<int> * q) { in MapTester()
99 const Queue<int> * const new_q = q->Map(Double); in MapTester()
114 Queue<int> q0_;
115 Queue<int> q1_;
116 Queue<int> q2_;
|
| /external/google-breakpad/src/testing/gtest/samples/ |
| D | sample3-inl.h | 44 class Queue; variable
50 friend class Queue<E>; variable
74 class Queue {
77 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue() function
80 ~Queue() { Clear(); } in ~Queue()
153 Queue* Map(F function) const { in Map()
154 Queue* new_queue = new Queue(); in Map()
168 Queue(const Queue&);
169 const Queue& operator = (const Queue&);
|
| D | sample3_unittest.cc | 96 void MapTester(const Queue<int> * q) { in MapTester()
99 const Queue<int> * const new_q = q->Map(Double); in MapTester()
114 Queue<int> q0_;
115 Queue<int> q1_;
116 Queue<int> q2_;
|
| /external/googletest/googletest/samples/ |
| D | sample3-inl.h | 44 class Queue; variable
50 friend class Queue<E>; variable
74 class Queue {
77 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue() function
80 ~Queue() { Clear(); } in ~Queue()
153 Queue* Map(F function) const { in Map()
154 Queue* new_queue = new Queue(); in Map()
168 Queue(const Queue&);
169 const Queue& operator = (const Queue&);
|
| D | sample3_unittest.cc | 96 void MapTester(const Queue<int> * q) { in MapTester()
99 const Queue<int> * const new_q = q->Map(Double); in MapTester()
114 Queue<int> q0_;
115 Queue<int> q1_;
116 Queue<int> q2_;
|
| /external/v8/testing/gtest/samples/ |
| D | sample3-inl.h | 44 class Queue; variable
50 friend class Queue<E>; variable
74 class Queue {
77 Queue() : head_(NULL), last_(NULL), size_(0) {} in Queue() function
80 ~Queue() { Clear(); } in ~Queue()
153 Queue* Map(F function) const { in Map()
154 Queue* new_queue = new Queue(); in Map()
168 Queue(const Queue&);
169 const Queue& operator = (const Queue&);
|
| D | sample3_unittest.cc | 96 void MapTester(const Queue<int> * q) { in MapTester()
99 const Queue<int> * const new_q = q->Map(Double); in MapTester()
114 Queue<int> q0_;
115 Queue<int> q1_;
116 Queue<int> q2_;
|
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| D | LatencyPriorityQueue.cpp | 83 Queue.push_back(SU); in push()
121 std::vector<SUnit *>::iterator Best = Queue.begin(); in pop()
122 for (std::vector<SUnit *>::iterator I = llvm::next(Queue.begin()), in pop()
123 E = Queue.end(); I != E; ++I) in pop()
127 if (Best != prior(Queue.end())) in pop()
128 std::swap(*Best, Queue.back()); in pop()
129 Queue.pop_back(); in pop()
134 assert(!Queue.empty() && "Queue is empty!"); in remove()
135 std::vector<SUnit *>::iterator I = std::find(Queue.begin(), Queue.end(), SU); in remove()
136 if (I != prior(Queue.end())) in remove()
[all …]
|
| /external/python/cpython2/Doc/library/ |
| D | queue.rst | 1 :mod:`Queue` --- A synchronized queue class
4 .. module:: Queue
8 The :mod:`Queue` module has been renamed to :mod:`queue` in Python 3. The
12 **Source code:** :source:`Lib/Queue.py`
16 The :mod:`Queue` module implements multi-producer, multi-consumer queues.
18 exchanged safely between multiple threads. The :class:`~Queue.Queue` class in this
30 The :mod:`Queue` module defines the following classes and exceptions:
32 .. class:: Queue(maxsize=0)
63 Exception raised when non-blocking :meth:`~Queue.get` (or
64 :meth:`~Queue.get_nowait`) is called
[all …]
|
| /external/tensorflow/tensorflow/core/kernels/batching_util/ |
| D | shared_batch_scheduler.h | 42 class Queue; variable
182 using QueueList = std::list<std::unique_ptr<internal::Queue<TaskType>>>;
227 class Queue {
232 Queue(const typename SharedBatchScheduler<TaskType>::QueueOptions& options,
237 ~Queue();
328 TF_DISALLOW_COPY_AND_ASSIGN(Queue);
337 Queue<TaskType>* queue);
352 Queue<TaskType>* queue_;
416 std::unique_ptr<internal::Queue<TaskType>>(new internal::Queue<TaskType>( in AddQueue()
453 internal::Queue<TaskType>* queue_for_batch = nullptr; in ThreadLogic()
[all …]
|
| /external/python/cpython3/Lib/test/test_asyncio/ |
| D | test_queues.py | 34 q = asyncio.Queue(loop=loop)
41 q = asyncio.Queue(loop=loop)
54 q = asyncio.Queue(maxsize=1, loop=loop)
66 q = asyncio.Queue(loop=loop)
72 q = asyncio.Queue(loop=loop)
75 q = asyncio.Queue(loop=self.loop)
80 q = asyncio.Queue()
90 q = asyncio.Queue(loop=self.loop)
98 q = asyncio.Queue(loop=self.loop)
101 q = asyncio.Queue(maxsize=1, loop=self.loop)
[all …]
|
| /external/python/cpython2/Lib/test/ |
| D | test_queue.py | 3 import Queue
97 target_order = dict(Queue = [111, 333, 222],
114 except Queue.Full:
119 except Queue.Full:
131 except Queue.Empty:
136 except Queue.Empty:
198 type2test = Queue.Queue
201 type2test = Queue.LifoQueue
204 type2test = Queue.PriorityQueue
212 class FailingQueue(Queue.Queue):
[all …]
|
| /external/antlr/antlr-3.4/runtime/ObjC/Framework/test/runtime/misc/ |
| D | ANTLRFastQueueTest.m | 19 STAssertNotNil(queue, @"Queue was not created and was nil");
26 STAssertNotNil(queue, @"Queue was not created and was nil");
30 STAssertTrue([queue size] == 1, @"Queue is the wrong size: %d", [queue size]);
39 STAssertNotNil(queue, @"Queue was not created and was nil");
56 STAssertNotNil(queue, @"Queue was not created and was nil");
69 STAssertNotNil(queue, @"Queue was not created and was nil");
73 STAssertTrue([queue size] == 3, @"Queue was too small, was: %d expected 3", [queue size]);
75 STAssertTrue([queue size] == 0, @"Queue is not empty, it's still %d", [queue size]);
82 STAssertNotNil(queue, @"Queue was not created and was nil");
85 …STAssertTrue([[queue description] isEqualToString:@"My String"], @"Queue description was not right…
[all …]
|
| /external/python/cpython3/Doc/library/ |
| D | asyncio-queue.rst | 8 * :class:`Queue`
13 module (:class:`~queue.Queue`, :class:`~queue.PriorityQueue`,
17 Queue chapter
20 .. class:: Queue(maxsize=0, \*, loop=None)
28 Unlike the standard library :mod:`queue`, you can reliably know this Queue's
31 Queue.
48 If the Queue was initialized with ``maxsize=0`` (the default), then
108 Used by queue consumers. For each :meth:`~Queue.get` used to fetch a task, a
114 for every item that had been :meth:`~Queue.put` into the queue).
131 A subclass of :class:`Queue`; retrieves entries in priority order (lowest
[all …]
|
| D | queue.rst | 13 exchanged safely between multiple threads. The :class:`Queue` class in this
31 .. class:: Queue(maxsize=0)
62 Exception raised when non-blocking :meth:`~Queue.get` (or
63 :meth:`~Queue.get_nowait`) is called
64 on a :class:`Queue` object which is empty.
69 Exception raised when non-blocking :meth:`~Queue.put` (or
70 :meth:`~Queue.put_nowait`) is called
71 on a :class:`Queue` object which is full.
76 Queue Objects
79 Queue objects (:class:`Queue`, :class:`LifoQueue`, or :class:`PriorityQueue`)
[all …]
|
| /external/python/cpython2/Lib/multiprocessing/dummy/ |
| D | connection.py | 37 from Queue import Queue
46 self._backlog_queue = Queue(backlog)
58 _in, _out = Queue(), Queue()
64 a, b = Queue(), Queue()
|
| /external/guava/guava-tests/test/com/google/common/collect/ |
| D | ForwardingQueueTest.java | 31 import java.util.Queue;
43 private final Queue<T> backingQueue;
45 StandardImplForwardingQueue(Queue<T> backingQueue) { in StandardImplForwardingQueue()
49 @Override protected Queue<T> delegate() { in delegate()
106 private Queue<String> forward;
107 private Queue<String> queue;
116 @Override protected Queue<String> create(String[] elements) { in suite()
137 queue = createProxyInstance(Queue.class); in setUp()
139 @Override protected Queue<String> delegate() { in setUp()
|
| /external/python/cpython3/Lib/multiprocessing/dummy/ |
| D | connection.py | 12 from queue import Queue
21 self._backlog_queue = Queue(backlog)
39 _in, _out = Queue(), Queue()
45 a, b = Queue(), Queue()
|
| /external/llvm/unittests/ExecutionEngine/Orc/ |
| D | RPCUtilsTest.cpp | 20 class Queue : public std::queue<char> { class
30 QueueChannel(Queue &InQueue, Queue &OutQueue) in QueueChannel()
60 Queue &InQueue;
61 Queue &OutQueue;
81 Queue Q1, Q2; in TEST_F()
110 Queue Q1, Q2; in TEST_F()
140 Queue Q1, Q2; in TEST_F()
|
| /external/guava/guava-tests/benchmark/com/google/common/collect/ |
| D | MinMaxPriorityQueueBenchmark.java | 30 import java.util.Queue;
47 private Queue<Integer> queue;
87 protected Queue<T> delegate() { in delegate()
100 @Override public Queue<Integer> create(Comparator<Integer> comparator) { in create()
105 @Override public Queue<Integer> create(Comparator<Integer> comparator) { in create()
110 @Override public Queue<Integer> create(Comparator<Integer> comparator) { in create()
115 public abstract Queue<Integer> create(Comparator<Integer> comparator); in create()
|
| /external/autotest/site_utils/lxc/container_pool/ |
| D | pool_unittest.py | 7 import Queue
174 except Queue.Empty:
201 except Queue.Empty:
239 except Queue.Empty:
364 with self.assertRaises(Queue.Empty):
377 with self.assertRaises(Queue.Empty):
389 self.worker_results = Queue.Queue()
390 self.worker_errors = Queue.Queue()
405 with self.assertRaises(Queue.Empty):
430 with self.assertRaises(Queue.Empty):
[all …]
|