| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/queue/queue.defn/ |
| pop.pass.cpp | 10 // <queue>
14 #include <queue>
19 std::queue<int> q;
|
| push_rv.pass.cpp | 10 // <queue>
14 #include <queue>
22 std::queue<MoveOnly> q;
|
| /prebuilts/ndk/5/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_queue.h | 0 // Queue implementation -*- C++ -*-
77 * wrapper is what enforces strict first-in-first-out %queue behavior.
86 * @c pop, which are standard %queue/FIFO operations.
89 class queue class
100 operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
104 operator<(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
130 queue(const _Sequence& __c = _Sequence()) function in class:queue
134 queue(const _Sequence& __c function in class:queue
138 queue(_Sequence&& __c = _Sequence()) function in class:queue
141 queue(queue&& __q) function in class:queue
[all...] |
| /prebuilts/ndk/6/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_queue.h | 0 // Queue implementation -*- C++ -*-
77 * wrapper is what enforces strict first-in-first-out %queue behavior.
86 * @c pop, which are standard %queue/FIFO operations.
89 class queue class
100 operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
104 operator<(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
130 queue(const _Sequence& __c = _Sequence()) function in class:queue
134 queue(const _Sequence& __c function in class:queue
138 queue(_Sequence&& __c = _Sequence()) function in class:queue
141 queue(queue&& __q) function in class:queue
[all...] |
| /prebuilts/ndk/7/sources/cxx-stl/gnu-libstdc++/include/bits/ |
| stl_queue.h | 0 // Queue implementation -*- C++ -*-
77 * wrapper is what enforces strict first-in-first-out %queue behavior.
86 * @c pop, which are standard %queue/FIFO operations.
89 class queue class
100 operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
104 operator<(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
130 queue(const _Sequence& __c = _Sequence()) function in class:queue
134 queue(const _Sequence& __c function in class:queue
138 queue(_Sequence&& __c = _Sequence()) function in class:queue
141 queue(queue&& __q) function in class:queue
[all...] |
| /prebuilts/ndk/8/sources/cxx-stl/gnu-libstdc++/4.4.3/include/bits/ |
| stl_queue.h | 0 // Queue implementation -*- C++ -*-
77 * wrapper is what enforces strict first-in-first-out %queue behavior.
86 * @c pop, which are standard %queue/FIFO operations.
89 class queue class
100 operator==(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
104 operator<(const queue<_Tp1, _Seq1>&, const queue<_Tp1, _Seq1>&);
130 queue(const _Sequence& __c = _Sequence()) function in class:queue
134 queue(const _Sequence& __c function in class:queue
138 queue(_Sequence&& __c = _Sequence()) function in class:queue
141 queue(queue&& __q) function in class:queue
[all...] |
| /external/libnl/src/ |
| nf-queue.c | 2 * src/nf-queue.c Monitor netfilter queue events
19 #include <netlink/netfilter/queue.h>
26 struct nfnl_queue *queue; local
28 queue = nfnl_queue_alloc();
29 if (!queue)
30 nl_cli_fatal(ENOMEM, "Unable to allocate queue object");
32 return queue;
51 printf("Warning: %d Out of order packets. Queue or socket overload \n", packet_id - next_packet_id);
87 struct nfnl_queue *queue; local
[all...] |
| /external/strace/ |
| unwind.c | 88 static void queue_print(struct queue_t *queue);
110 tcp->queue = malloc(sizeof(*tcp->queue));
111 if (!tcp->queue)
113 tcp->queue->head = NULL;
114 tcp->queue->tail = NULL;
120 queue_print(tcp->queue);
121 free(tcp->queue);
122 tcp->queue = NULL;
481 * queue manipulator
[all...] |
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| PriorityQueueTest.java | 194 PriorityQueue<Object> queue = new PriorityQueue<Object>(); local
195 assertNotNull(queue);
196 assertEquals(0, queue.size());
197 assertNull(queue.comparator());
204 PriorityQueue<Object> queue = new PriorityQueue<Object>(100); local
205 assertNotNull(queue);
206 assertEquals(0, queue.size());
207 assertNull(queue.comparator());
214 PriorityQueue<Object> queue = new PriorityQueue<Object>(100, local
216 assertNotNull(queue);
314 PriorityQueue<String> queue = new PriorityQueue<String>(4, local
338 PriorityQueue<Integer> queue = new PriorityQueue<Integer>(c); local
389 PriorityQueue<Integer> queue = new PriorityQueue<Integer>(treeSet); local
412 PriorityQueue<String> queue = new PriorityQueue<String>(10, local
430 PriorityQueue<Object> queue = new PriorityQueue<Object>(); local
443 PriorityQueue<Object> queue = new PriorityQueue<Object>(); local
483 PriorityQueue<Object> queue = new PriorityQueue<Object>(); local
506 PriorityQueue<Object> queue = new PriorityQueue<Object>(); local
546 PriorityQueue<Object> queue = new PriorityQueue<Object>(); local
559 PriorityQueue<Object> queue = new PriorityQueue<Object>(); local
598 PriorityQueue<String> queue = new PriorityQueue<String>(10, local
647 PriorityQueue<Object> queue = new PriorityQueue<Object>(); local
657 PriorityQueue<Object> queue = new PriorityQueue<Object>(); local
[all...] |
| /external/chromium_org/net/spdy/ |
| spdy_write_queue_unittest.cc | 56 RequeingBufferProducer(SpdyWriteQueue* queue) {
59 base::Bind(RequeingBufferProducer::ConsumeCallback, queue));
66 static void ConsumeCallback(SpdyWriteQueue* queue,
73 queue->Enqueue(
265 // Enqueue a bunch of writes and then call Clear(). The write queue
285 SpdyWriteQueue queue; local
286 queue.Enqueue(
289 scoped_ptr<SpdyBufferProducer>(new RequeingBufferProducer(&queue)),
296 EXPECT_TRUE(queue.Dequeue(&frame_type, &producer, &stream));
297 EXPECT_TRUE(queue.IsEmpty())
312 SpdyWriteQueue queue; local
334 SpdyWriteQueue queue; local
356 SpdyWriteQueue queue; local
[all...] |
| /frameworks/base/core/java/android/hardware/ |
| SystemSensorManager.java | 116 SensorEventQueue queue = mSensorListeners.get(listener); local
117 if (queue == null) {
119 queue = new SensorEventQueue(listener, looper, this);
120 if (!queue.addSensor(sensor, delayUs, maxBatchReportLatencyUs, reservedFlags)) {
121 queue.dispose();
124 mSensorListeners.put(listener, queue);
127 return queue.addSensor(sensor, delayUs, maxBatchReportLatencyUs, reservedFlags);
141 SensorEventQueue queue = mSensorListeners.get(listener); local
142 if (queue != null) {
145 result = queue.removeAllSensors()
165 TriggerEventQueue queue = mTriggerListeners.get(listener); local
188 TriggerEventQueue queue = mTriggerListeners.get(listener); local
210 SensorEventQueue queue = mSensorListeners.get(listener); local
[all...] |
| /device/moto/shamu/camera/QCamera2/stack/mm-camera-interface/src/ |
| mm_camera_channel.c | 74 int32_t mm_channel_superbuf_flush(mm_channel_t* my_obj, mm_channel_queue_t * queue);
104 /* channel super queue functions */
105 int32_t mm_channel_superbuf_queue_init(mm_channel_queue_t * queue);
106 int32_t mm_channel_superbuf_queue_deinit(mm_channel_queue_t * queue);
108 mm_channel_queue_t * queue,
110 mm_channel_queue_node_t* mm_channel_superbuf_dequeue(mm_channel_queue_t * queue);
112 mm_channel_queue_t *queue);
114 mm_channel_queue_t *queue);
119 mm_channel_queue_t * queue);
186 * in the superbuf queue, or sending matched superbuf frames to uppe
[all...] |
| /external/chromium_org/third_party/angle/src/compiler/translator/ |
| RemoveTree.cpp | 15 std::queue<TIntermNode*> nodeQueue;
|
| /external/libcxx/test/containers/container.adaptors/priority.queue/priqueue.cons/ |
| ctor_comp.pass.cpp | 10 // <queue>
14 #include <queue>
|
| ctor_default.pass.cpp | 10 // <queue>
14 #include <queue>
|
| ctor_iter_iter.pass.cpp | 10 // <queue>
15 #include <queue>
|
| ctor_iter_iter_comp.pass.cpp | 10 // <queue>
15 #include <queue>
|
| ctor_iter_iter_comp_cont.pass.cpp | 10 // <queue>
16 #include <queue>
|
| /external/libcxx/test/containers/container.adaptors/priority.queue/priqueue.members/ |
| emplace.pass.cpp | 10 // <queue>
16 #include <queue>
|
| push.pass.cpp | 10 // <queue>
16 #include <queue>
|
| push_rvalue.pass.cpp | 10 // <queue>
16 #include <queue>
|
| swap.pass.cpp | 10 // <queue>
16 #include <queue>
|
| top.pass.cpp | 10 // <queue>
16 #include <queue>
|
| /external/libcxx/test/containers/container.adaptors/priority.queue/priqueue.special/ |
| swap.pass.cpp | 10 // <queue>
18 #include <queue>
|
| /external/stlport/stlport/ |
| queue | 42 # include_next <queue>
44 # include _STLP_NATIVE_HEADER(queue)
|
