| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/queue/queue.defn/ |
| 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;
|
| assign_copy.pass.cpp | 10 // <queue>
12 // queue& operator=(const queue& q);
14 #include <queue>
29 std::queue<int> q(make<std::deque<int> >(5));
30 std::queue<int> q2;
|
| back_const.pass.cpp | 10 // <queue>
14 #include <queue>
19 std::queue<int> q;
24 const std::queue<int>& cqr = q;
|
| front_const.pass.cpp | 10 // <queue>
14 #include <queue>
19 std::queue<int> q;
24 const std::queue<int>& cqr = q;
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/queue/queue.special/ |
| swap_noexcept.pass.cpp | 10 // <queue>
12 // void swap(queue& c)
17 #include <queue>
26 typedef std::queue<MoveOnly> C;
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/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;
|
| assign_copy.pass.cpp | 10 // <queue>
12 // queue& operator=(const queue& q);
14 #include <queue>
29 std::queue<int> q(make<std::deque<int> >(5));
30 std::queue<int> q2;
|
| back_const.pass.cpp | 10 // <queue>
14 #include <queue>
19 std::queue<int> q;
24 const std::queue<int>& cqr = q;
|
| front_const.pass.cpp | 10 // <queue>
14 #include <queue>
19 std::queue<int> q;
24 const std::queue<int>& cqr = q;
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/queue/queue.special/ |
| swap_noexcept.pass.cpp | 10 // <queue>
12 // void swap(queue& c)
17 #include <queue>
26 typedef std::queue<MoveOnly> C;
|
| /external/libcxx/test/std/containers/container.adaptors/priority.queue/ |
| types.fail.cpp | 10 // <queue>
27 #include <queue>
|
| /external/webrtc/webrtc/common_audio/ |
| swap_queue_unittest.cc | 24 // Queue item verification function for the vector test.
29 // Queue item verifier for the vector test.
46 SwapQueue<std::vector<int>> queue(2, i);
48 EXPECT_TRUE(queue.Insert(&i));
50 EXPECT_TRUE(queue.Insert(&i));
52 EXPECT_TRUE(queue.Remove(&i));
54 EXPECT_TRUE(queue.Remove(&i));
59 SwapQueue<int> queue(2);
61 // Fill the queue.
63 EXPECT_TRUE(queue.Insert(&i))
[all...] |
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/priority.queue/ |
| types.fail.cpp | 10 // <queue>
27 #include <queue>
|
| /external/libchrome/base/synchronization/ |
| condition_variable_unittest.cc | 259 WorkQueue queue(kThreadCount); // Start the threads.
266 base::AutoLock auto_lock(*queue.lock());
267 while (!queue.EveryIdWasAllocated())
268 queue.all_threads_have_ids()->Wait();
273 queue.SpinUntilAllThreadsAreWaiting();
277 base::AutoLock auto_lock(*queue.lock());
278 EXPECT_EQ(0, queue.GetNumThreadsTakingAssignments());
279 EXPECT_EQ(0, queue.GetNumThreadsCompletingTasks());
280 EXPECT_EQ(0, queue.task_count());
281 EXPECT_EQ(0, queue.GetMaxCompletionsByWorkerThread())
[all...] |
| /external/libcxx/test/std/containers/container.adaptors/queue/queue.cons/ |
| ctor_copy.pass.cpp | 10 // <queue>
12 // queue(const queue&) = default;
14 #include <queue>
29 std::queue<int> q(make<std::deque<int> >(5));
30 std::queue<int> q2 = q;
|
| /external/libcxx/test/std/containers/container.adaptors/queue/queue.defn/ |
| assign_copy.pass.cpp | 10 // <queue>
12 // queue& operator=(const queue& q);
14 #include <queue>
29 std::queue<int> q(make<std::deque<int> >(5));
30 std::queue<int> q2;
|
| back_const.pass.cpp | 10 // <queue>
14 #include <queue>
19 std::queue<int> q;
24 const std::queue<int>& cqr = q;
|
| front_const.pass.cpp | 10 // <queue>
14 #include <queue>
19 std::queue<int> q;
24 const std::queue<int>& cqr = q;
|
| /prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/queue/queue.cons/ |
| ctor_copy.pass.cpp | 10 // <queue>
12 // queue(const queue&) = default;
14 #include <queue>
29 std::queue<int> q(make<std::deque<int> >(5));
30 std::queue<int> q2 = q;
|
| /prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/queue/queue.cons/ |
| ctor_copy.pass.cpp | 10 // <queue>
12 // queue(const queue&) = default;
14 #include <queue>
29 std::queue<int> q(make<std::deque<int> >(5));
30 std::queue<int> q2 = q;
|
| /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...] |
