| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/queue/queue.defn/ |
| swap.pass.cpp | 10 // <queue>
12 // void swap(queue& q);
14 #include <queue>
29 std::queue<int> q1 = make<std::queue<int> >(5);
30 std::queue<int> q2 = make<std::queue<int> >(10);
31 std::queue<int> q1_save = q1;
32 std::queue<int> q2_save = q2;
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/queue/queue.ops/ |
| eq.pass.cpp | 10 // <queue>
13 // bool operator==(const queue<T, Container>& x,const queue<T, Container>& y);
16 // bool operator!=(const queue<T, Container>& x,const queue<T, Container>& y);
18 #include <queue>
33 std::queue<int> q1 = make<std::queue<int> >(5);
34 std::queue<int> q2 = make<std::queue<int> >(10)
[all...] |
| lt.pass.cpp | 10 // <queue>
13 // bool operator< (const queue<T, Container>& x,const queue<T, Container>& y);
16 // bool operator> (const queue<T, Container>& x,const queue<T, Container>& y);
19 // bool operator>=(const queue<T, Container>& x,const queue<T, Container>& y);
22 // bool operator<=(const queue<T, Container>& x,const queue<T, Container>& y);
24 #include <queue>
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/queue/queue.special/ |
| swap.pass.cpp | 10 // <queue>
13 // void swap(queue<T, Container>& x, queue<T, Container>& y);
15 #include <queue>
30 std::queue<int> q1 = make<std::queue<int> >(5);
31 std::queue<int> q2 = make<std::queue<int> >(10);
32 std::queue<int> q1_save = q1;
33 std::queue<int> q2_save = q2
[all...] |
| /external/libcxx/test/std/containers/container.adaptors/queue/queue.ops/ |
| lt.pass.cpp | 10 // <queue>
13 // bool operator< (const queue<T, Container>& x,const queue<T, Container>& y);
16 // bool operator> (const queue<T, Container>& x,const queue<T, Container>& y);
19 // bool operator>=(const queue<T, Container>& x,const queue<T, Container>& y);
22 // bool operator<=(const queue<T, Container>& x,const queue<T, Container>& y);
24 #include <queue>
[all...] |
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/queue/queue.ops/ |
| lt.pass.cpp | 10 // <queue>
13 // bool operator< (const queue<T, Container>& x,const queue<T, Container>& y);
16 // bool operator> (const queue<T, Container>& x,const queue<T, Container>& y);
19 // bool operator>=(const queue<T, Container>& x,const queue<T, Container>& y);
22 // bool operator<=(const queue<T, Container>& x,const queue<T, Container>& y);
24 #include <queue>
[all...] |
| /libcore/ojluni/src/main/java/java/util/ |
| Timer.java | 78 * it uses a binary heap to represent its task queue, so the cost to schedule
91 * The timer task queue. This data structure is shared with the timer
94 * and removing them from the queue when they're obsolete.
96 private final TaskQueue queue = new TaskQueue(); field in class:Timer
101 private final TimerThread thread = new TimerThread(queue);
106 * tasks in the timer queue. It is used in preference to a finalizer on
112 synchronized(queue) {
114 queue.notify(); // In case queue is empty.
395 synchronized(queue) {
497 private TaskQueue queue; field in class:TimerThread
[all...] |
| /external/squashfs-tools/squashfs-tools/ |
| caches-queues-lists.c | 39 struct queue *queue_init(int size)
41 struct queue *queue = malloc(sizeof(struct queue)); local
43 if(queue == NULL)
50 queue->data = malloc(sizeof(void *) * (size + 1));
51 if(queue->data == NULL)
54 queue->size = size + 1;
55 queue->readp = queue->writep = 0
156 struct seq_queue *queue = malloc(sizeof(struct seq_queue)); local
[all...] |
| /device/google/marlin/camera/QCamera2/stack/mm-jpeg-interface/src/ |
| mm_jpeg_queue.c | 37 int32_t mm_jpeg_queue_init(mm_jpeg_queue_t* queue)
39 pthread_mutex_init(&queue->lock, NULL);
40 cam_list_init(&queue->head.list);
41 queue->size = 0;
45 int32_t mm_jpeg_queue_enq(mm_jpeg_queue_t* queue, mm_jpeg_q_data_t data)
57 pthread_mutex_lock(&queue->lock);
58 cam_list_add_tail_node(&node->list, &queue->head.list);
59 queue->size++;
60 pthread_mutex_unlock(&queue->lock);
66 int32_t mm_jpeg_queue_enq_head(mm_jpeg_queue_t* queue, mm_jpeg_q_data_t data
[all...] |
| /device/huawei/angler/camera/QCamera2/stack/mm-jpeg-interface/src/ |
| mm_jpeg_queue.c | 34 int32_t mm_jpeg_queue_init(mm_jpeg_queue_t* queue)
36 pthread_mutex_init(&queue->lock, NULL);
37 cam_list_init(&queue->head.list);
38 queue->size = 0;
42 int32_t mm_jpeg_queue_enq(mm_jpeg_queue_t* queue, mm_jpeg_q_data_t data)
54 pthread_mutex_lock(&queue->lock);
55 cam_list_add_tail_node(&node->list, &queue->head.list);
56 queue->size++;
57 pthread_mutex_unlock(&queue->lock);
63 int32_t mm_jpeg_queue_enq_head(mm_jpeg_queue_t* queue, mm_jpeg_q_data_t data
[all...] |
| /device/lge/bullhead/camera/QCamera2/stack/mm-jpeg-interface/src/ |
| mm_jpeg_queue.c | 34 int32_t mm_jpeg_queue_init(mm_jpeg_queue_t* queue)
36 pthread_mutex_init(&queue->lock, NULL);
37 cam_list_init(&queue->head.list);
38 queue->size = 0;
42 int32_t mm_jpeg_queue_enq(mm_jpeg_queue_t* queue, mm_jpeg_q_data_t data)
54 pthread_mutex_lock(&queue->lock);
55 cam_list_add_tail_node(&node->list, &queue->head.list);
56 queue->size++;
57 pthread_mutex_unlock(&queue->lock);
63 int32_t mm_jpeg_queue_enq_head(mm_jpeg_queue_t* queue, mm_jpeg_q_data_t data
[all...] |
| /hardware/qcom/camera/msm8998/QCamera2/stack/mm-jpeg-interface/src/ |
| mm_jpeg_queue.c | 37 int32_t mm_jpeg_queue_init(mm_jpeg_queue_t* queue)
39 pthread_mutex_init(&queue->lock, NULL);
40 cam_list_init(&queue->head.list);
41 queue->size = 0;
45 int32_t mm_jpeg_queue_enq(mm_jpeg_queue_t* queue, mm_jpeg_q_data_t data)
57 pthread_mutex_lock(&queue->lock);
58 cam_list_add_tail_node(&node->list, &queue->head.list);
59 queue->size++;
60 pthread_mutex_unlock(&queue->lock);
66 int32_t mm_jpeg_queue_enq_head(mm_jpeg_queue_t* queue, mm_jpeg_q_data_t data
[all...] |
| /prebuilts/misc/common/swig/include/2.0.11/std/ |
| std_queue.i | 5 * @brief A wrapping of std::queue for Ruby.
12 // Queue
14 %define %std_queue_methods(queue...)
15 queue();
16 queue( const _Sequence& );
26 %define %std_queue_methods_val(queue...)
27 %std_queue_methods(queue)
31 // std::queue
36 // -- f(std::queue<T>), f(const std::queue<T>&)
[all...] |
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_open/ |
| 12-1.c | 34 mqd_t queue; local
39 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
40 if (queue == (mqd_t) - 1) {
46 if (mq_getattr(queue, &attr) != 0) {
49 mq_close(queue);
54 mq_close(queue);
|
| /frameworks/base/libs/hwui/tests/unit/ |
| LayerUpdateQueueTests.cpp | 28 LayerUpdateQueue queue; local
29 EXPECT_TRUE(queue.entries().empty());
44 LayerUpdateQueue queue; local
45 queue.enqueueLayerWithDamage(a.get(), Rect(25, 25, 75, 75));
46 queue.enqueueLayerWithDamage(b.get(), Rect(100, 100, 300, 300));
47 queue.enqueueLayerWithDamage(c.get(), Rect(.5, .5, .5, .5));
49 EXPECT_EQ(3u, queue.entries().size());
51 EXPECT_EQ(a.get(), queue.entries()[0].renderNode.get());
52 EXPECT_EQ(Rect(25, 25, 75, 75), queue.entries()[0].damage);
53 EXPECT_EQ(b.get(), queue.entries()[1].renderNode.get())
62 LayerUpdateQueue queue; local
75 LayerUpdateQueue queue; local
[all...] |
| /system/bt/osi/test/ |
| leaky_bonded_queue_test.cc | 54 LeakyBondedQueue<MockItem>* queue = new LeakyBondedQueue<MockItem>(3); local
55 EXPECT_EQ(queue->Capacity(), static_cast<size_t>(3));
56 EXPECT_EQ(queue->Length(), static_cast<size_t>(0));
57 queue->Enqueue(item1);
58 EXPECT_EQ(queue->Length(), static_cast<size_t>(1));
59 queue->Enqueue(item2);
60 EXPECT_EQ(queue->Length(), static_cast<size_t>(2));
61 queue->Enqueue(item3);
62 EXPECT_EQ(queue->Length(), static_cast<size_t>(3));
64 queue->Enqueue(item4)
90 LeakyBondedQueue<MockItem>* queue = new LeakyBondedQueue<MockItem>(2); local
124 LeakyBondedQueue<MockItem>* queue = new LeakyBondedQueue<MockItem>(2); local
164 LeakyBondedQueue<MockItem>* queue = new LeakyBondedQueue<MockItem>(2); local
193 LeakyBondedQueue<MockItem>* queue = new LeakyBondedQueue<MockItem>(2); local
218 LeakyBondedQueue<MockItem>* queue = new LeakyBondedQueue<MockItem>(2); local
227 LeakyBondedQueue<MockItem>* queue = new LeakyBondedQueue<MockItem>(1); local
237 LeakyBondedQueue<MockItem>* queue = new LeakyBondedQueue<MockItem>(2); local
[all...] |
| /external/guava/guava-tests/test/com/google/common/util/concurrent/ |
| ListenerCallQueueTest.java | 43 ListenerCallQueue<Object> queue = local
47 queue.add(incrementingCallback(counter, 1));
48 queue.add(incrementingCallback(counter, 2));
49 queue.add(incrementingCallback(counter, 3));
50 queue.add(incrementingCallback(counter, 4));
52 queue.execute();
58 ListenerCallQueue<Object> queue = local
62 queue.add(incrementingCallback(counter, 1));
63 queue.add(THROWING_CALLBACK);
64 queue.add(incrementingCallback(counter, 2))
78 ListenerCallQueue<Object> queue = local
100 ListenerCallQueue<Object> queue = local
[all...] |
| /external/mesa3d/src/gallium/drivers/llvmpipe/ |
| lp_scene_queue.c | 30 * Scene queue. We'll use two queues. One contains "full" scenes which
49 * A queue of scenes
58 /** Allocate a new scene queue */
62 struct lp_scene_queue *queue = CALLOC_STRUCT(lp_scene_queue); local
63 if (!queue)
66 queue->ring = util_ringbuffer_create( MAX_SCENE_QUEUE *
68 if (queue->ring == NULL)
71 return queue;
74 FREE(queue);
79 /** Delete a scene queue */
[all...] |
| /external/mesa3d/src/vulkan/wsi/ |
| wsi_common_queue.h | 38 wsi_queue_init(struct wsi_queue *queue, int length)
46 ret = u_vector_init(&queue->vector, sizeof(uint32_t),
60 ret = pthread_cond_init(&queue->cond, &condattr);
64 ret = pthread_mutex_init(&queue->mutex, NULL);
72 pthread_cond_destroy(&queue->cond);
76 u_vector_finish(&queue->vector);
82 wsi_queue_destroy(struct wsi_queue *queue)
84 u_vector_finish(&queue->vector);
85 pthread_mutex_destroy(&queue->mutex);
86 pthread_cond_destroy(&queue->cond)
[all...] |
| /external/libcxx/test/std/containers/container.adaptors/queue/queue.defn/ |
| back.pass.cpp | 10 // <queue>
14 #include <queue>
19 std::queue<int> q;
|
| empty.pass.cpp | 10 // <queue>
14 #include <queue>
19 std::queue<int> q;
|
| front.pass.cpp | 10 // <queue>
14 #include <queue>
19 std::queue<int> q;
|
| /external/libcxx/test/std/containers/container.adaptors/queue/queue.special/ |
| swap_noexcept.pass.cpp | 10 // <queue>
12 // void swap(queue& c)
19 #include <queue>
28 typedef std::queue<MoveOnly> C;
|
| /external/webrtc/webrtc/modules/video_coding/codecs/test/ |
| predictive_packet_manipulator.h | 14 #include <queue>
31 // FIFO queue so they will be returned in the same order they were added.
40 std::queue<double> random_results_;
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/queue/queue.defn/ |
| back.pass.cpp | 10 // <queue>
14 #include <queue>
19 std::queue<int> q;
|
