| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/queue/queue.defn/ |
| front_const.pass.cpp | 10 // <queue>
14 #include <queue>
19 std::queue<int> q;
24 const std::queue<int>& cqr = q;
|
| types.pass.cpp | 10 // <queue>
13 // class queue
27 #include <queue>
31 : private std::queue<int>
49 static_assert(( std::is_same<std::queue<int>::container_type, std::deque<int> >::value), "");
50 static_assert(( std::is_same<std::queue<int, std::vector<int> >::container_type, std::vector<int> >::value), "");
51 static_assert(( std::is_same<std::queue<int, std::vector<int> >::value_type, int>::value), "");
52 static_assert(( std::is_same<std::queue<int>::reference, std::deque<int>::reference>::value), "");
53 static_assert(( std::is_same<std::queue<int>::const_reference, std::deque<int>::const_reference>::value), "");
54 static_assert(( std::is_same<std::queue<int>::size_type, std::deque<int>::size_type>::value), "")
[all...] |
| assign_move.pass.cpp | 12 // <queue>
14 // queue& operator=(queue&& q);
16 #include <queue>
35 std::queue<MoveOnly> q(make<std::deque<MoveOnly> >(5));
36 std::queue<MoveOnly> q2;
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_open/ |
| 29-1.c | 10 * Test that mq_open() fails with ENOENT if the named message queue does
29 mqd_t queue; local
33 queue = mq_open(qname, O_RDWR, S_IRUSR | S_IWUSR, NULL);
34 if (queue != (mqd_t) - 1) {
37 mq_close(queue);
45 mq_close(queue);
|
| 19-1.c | 10 * Test that mq_open() does not add messages to the queue or remove
11 * messages from the queue.
14 * - Call mq_open() for non-blocking queue
15 * - Verify mq_receive() fails (because nothing should be in the queue yet)
16 * - Call mq_send() to put something in the queue
17 * - Call mq_open() again for non-blocking queue
19 * still be in the queue).
42 mqd_t queue; local
52 queue = mq_open(qname, O_CREAT | O_RDWR | O_NONBLOCK,
54 if (queue == (mqd_t) - 1)
[all...] |
| 18-1.c | 30 mqd_t queue; local
34 queue = mq_open(qname, O_CREAT | O_RDWR | O_NONBLOCK,
36 if (queue == (mqd_t) - 1) {
42 if (mq_send(queue, msgptr, strlen(msgptr), 1) != 0) {
45 /* close queue and exit */
46 mq_close(queue);
51 mq_close(queue);
|
| 23-1.c | 11 * but the message queue already exists.
29 mqd_t queue, queue2; local
33 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
34 if (queue == (mqd_t) - 1) {
41 * Open queue qname again with O_CREAT and O_EXCL set
47 printf("O_EXCL on an already opened queue.\n");
49 mq_close(queue);
61 mq_close(queue);
69 mq_close(queue);
|
| 21-1.c | 14 * queue does not exist.
32 mqd_t queue; local
36 queue = mq_open(qname, O_RDWR, S_IRUSR | S_IWUSR, NULL);
37 if (queue != (mqd_t) - 1) {
39 mq_close(queue);
|
| 3-1.c | 11 * name does not refer to an already existing message queue.
28 mqd_t queue; local
32 queue = mq_open(qname, O_RDWR, S_IRUSR | S_IWUSR, NULL);
33 if (queue != (mqd_t) - 1) {
36 mq_close(queue);
|
| /external/libcxx/test/std/containers/container.adaptors/queue/queue.defn/ |
| types.pass.cpp | 10 // <queue>
13 // class queue
27 #include <queue>
31 : private std::queue<int>
49 static_assert(( std::is_same<std::queue<int>::container_type, std::deque<int> >::value), "");
50 static_assert(( std::is_same<std::queue<int, std::vector<int> >::container_type, std::vector<int> >::value), "");
51 static_assert(( std::is_same<std::queue<int, std::vector<int> >::value_type, int>::value), "");
52 static_assert(( std::is_same<std::queue<int>::reference, std::deque<int>::reference>::value), "");
53 static_assert(( std::is_same<std::queue<int>::const_reference, std::deque<int>::const_reference>::value), "");
54 static_assert(( std::is_same<std::queue<int>::size_type, std::deque<int>::size_type>::value), "")
[all...] |
| assign_move.pass.cpp | 12 // <queue>
14 // queue& operator=(queue&& q);
16 #include <queue>
35 std::queue<MoveOnly> q(make<std::deque<MoveOnly> >(5));
36 std::queue<MoveOnly> q2;
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/util/ |
| AbstractQueueTest.java | 31 private MockAbstractQueue<Object> queue; field in class:AbstractQueueTest
113 queue.add(null);
127 queue.add(o);
131 queue.add(o);
145 queue.add(o);
148 queue.add(I);
149 assertTrue(queue.contains(I));
150 Iterator iter = queue.iterator();
162 queue.addAll(null);
175 queue.addAll(list)
254 MockAbstractQueue queue = new MockAbstractQueue(); local
[all...] |
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_timedsend/ |
| 18-1.c | 10 * Basic test that if the queue already has room, then mq_timedsend()
14 * on an empty queue. Should succeed.
35 mqd_t queue; local
39 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
40 if (queue == (mqd_t) - 1) {
48 if (mq_timedsend(queue, msgptr, strlen(msgptr), 1, &ts) != 0) {
49 perror("mq_timedsend() did not return success on empty queue");
51 mq_close(queue);
56 mq_close(queue);
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_timedsend/speculative/ |
| 18-2.c | 10 * Basic test that if the queue already has room, then mq_timedsend()
35 mqd_t queue; local
39 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
40 if (queue == (mqd_t) - 1) {
48 if (mq_timedsend(queue, msgptr, strlen(msgptr), 1, &ts) == -1) {
50 mq_close(queue);
55 mq_close(queue);
|
| /external/tensorflow/tensorflow/core/kernels/ |
| queue_op.h | 32 // Defines a QueueOp, an abstract class for Queue construction ops.
57 Status VerifyResource(QueueInterface* queue) override {
58 return queue->MatchesNodeDef(def());
68 Status CreateTypedQueue(TypedQueue* queue, QueueInterface** ret) {
69 if (queue == nullptr) {
70 return errors::ResourceExhausted("Failed to allocate queue.");
72 *ret = queue;
73 return queue->Initialize();
|
| /external/libcxx/test/std/containers/container.adaptors/queue/queue.cons/ |
| ctor_move.pass.cpp | 12 // <queue>
14 // queue(queue&& q);
16 #include <queue>
35 std::queue<MoveOnly> q(make<std::deque<MoveOnly> >(5));
36 std::queue<MoveOnly> q2 = std::move(q);
|
| /frameworks/av/media/libstagefright/rtsp/ |
| AMPEG2TSAssembler.cpp | 55 List<sp<ABuffer> > *queue = source->queue(); local
57 if (queue->empty()) {
62 List<sp<ABuffer> >::iterator it = queue->begin();
63 while (it != queue->end()) {
68 it = queue->erase(it);
71 if (queue->empty()) {
76 sp<ABuffer> buffer = *queue->begin();
90 queue->erase(queue->begin())
[all...] |
| /prebuilts/ndk/r16/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/queue/queue.cons/ |
| ctor_move.pass.cpp | 12 // <queue>
14 // queue(queue&& q);
16 #include <queue>
35 std::queue<MoveOnly> q(make<std::deque<MoveOnly> >(5));
36 std::queue<MoveOnly> q2 = std::move(q);
|
| /external/libcxx/test/std/containers/container.adaptors/priority.queue/priqueue.cons/ |
| default_noexcept.pass.cpp | 12 // <queue>
21 #include <queue>
|
| dtor_noexcept.pass.cpp | 10 // <queue>
16 #include <queue>
|
| move_assign_noexcept.pass.cpp | 10 // <queue>
20 #include <queue>
|
| move_noexcept.pass.cpp | 12 // <queue>
20 #include <queue>
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_close/ |
| 1-1.c | 10 * mq_close test case that attempts to open a new message queue,
11 * close the message queue and verify that mq_close returns 0.
28 mqd_t queue; local
32 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
33 if (queue == (mqd_t) - 1) {
38 if (mq_close(queue) != 0) {
|
| /external/ltp/testcases/open_posix_testsuite/conformance/interfaces/mq_open/speculative/ |
| 2-2.c | 28 mqd_t queue; local
32 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
33 if (queue == (mqd_t) - 1) {
35 printf("message queue names that do not start with /.\n");
39 mq_close(queue);
42 printf("This implementation may support message queue\n");
|
| 2-3.c | 10 * Test that if there are two /s in a message queue name, the behavior
28 mqd_t queue; local
32 queue = mq_open(qname, O_CREAT | O_RDWR, S_IRUSR | S_IWUSR, NULL);
33 if (queue == (mqd_t) - 1) {
35 printf("message queue names with two /s in them.\n");
39 mq_close(queue);
42 printf("This implementation may support message queue\n");
|
