/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.special/ |
H A D | swap.pass.cpp | 10 // <deque> 13 // void swap(deque<T, A>& x, deque<T, A>& y); 15 #include <deque> 62 testN<std::deque<int> >(rng[i], rng[j], rng[k]); 68 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1)); 69 std::deque<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A(2)); 71 assert((c1 == std::deque<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0])))); 73 assert((c2 == std::deque<int, A>(a1, a1+sizeof(a1)/sizeof(a1[0])))); 80 std::deque<in [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.special/ |
H A D | swap.pass.cpp | 10 // <deque> 13 // void swap(deque<T, A>& x, deque<T, A>& y); 15 #include <deque> 62 testN<std::deque<int> >(rng[i], rng[j], rng[k]); 68 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1)); 69 std::deque<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A(2)); 71 assert((c1 == std::deque<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0])))); 73 assert((c2 == std::deque<int, A>(a1, a1+sizeof(a1)/sizeof(a1[0])))); 80 std::deque<in [all...] |
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.cons/ |
H A D | move.pass.cpp | 10 // <deque> 12 // deque(deque&&); 14 #include <deque> 28 std::deque<MoveOnly, A> c1(A(1)); 31 std::deque<MoveOnly, A> c2(A(2)); 34 std::deque<MoveOnly, A> c3 = std::move(c1); 43 std::deque<MoveOnly, A> c1(A(1)); 46 std::deque<MoveOnly, A> c2(A(2)); 49 std::deque<MoveOnl [all...] |
H A D | move_alloc.pass.cpp | 10 // <deque> 12 // deque(deque&& c, const allocator_type& a); 14 #include <deque> 28 std::deque<MoveOnly, A> c1(A(1)); 31 std::deque<MoveOnly, A> c2(A(1)); 34 std::deque<MoveOnly, A> c3(std::move(c1), A(3)); 43 std::deque<MoveOnly, A> c1(A(1)); 46 std::deque<MoveOnly, A> c2(A(1)); 49 std::deque<MoveOnl [all...] |
H A D | move_assign.pass.cpp | 10 // <deque> 12 // deque& operator=(deque&& c); 14 #include <deque> 28 std::deque<MoveOnly, A> c1(A(5)); 31 std::deque<MoveOnly, A> c2(A(5)); 34 std::deque<MoveOnly, A> c3(A(5)); 44 std::deque<MoveOnly, A> c1(A(5)); 47 std::deque<MoveOnly, A> c2(A(5)); 50 std::deque<MoveOnl [all...] |
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
H A D | move.pass.cpp | 10 // <deque> 12 // deque(deque&&); 14 #include <deque> 28 std::deque<MoveOnly, A> c1(A(1)); 31 std::deque<MoveOnly, A> c2(A(2)); 34 std::deque<MoveOnly, A> c3 = std::move(c1); 43 std::deque<MoveOnly, A> c1(A(1)); 46 std::deque<MoveOnly, A> c2(A(2)); 49 std::deque<MoveOnl [all...] |
H A D | move_alloc.pass.cpp | 10 // <deque> 12 // deque(deque&& c, const allocator_type& a); 14 #include <deque> 28 std::deque<MoveOnly, A> c1(A(1)); 31 std::deque<MoveOnly, A> c2(A(1)); 34 std::deque<MoveOnly, A> c3(std::move(c1), A(3)); 43 std::deque<MoveOnly, A> c1(A(1)); 46 std::deque<MoveOnly, A> c2(A(1)); 49 std::deque<MoveOnl [all...] |
H A D | move_assign.pass.cpp | 10 // <deque> 12 // deque& operator=(deque&& c); 14 #include <deque> 28 std::deque<MoveOnly, A> c1(A(5)); 31 std::deque<MoveOnly, A> c2(A(5)); 34 std::deque<MoveOnly, A> c3(A(5)); 44 std::deque<MoveOnly, A> c1(A(5)); 47 std::deque<MoveOnly, A> c2(A(5)); 50 std::deque<MoveOnl [all...] |
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.cons/ |
H A D | move.pass.cpp | 10 // <deque> 12 // deque(deque&&); 14 #include <deque> 28 std::deque<MoveOnly, A> c1(A(1)); 31 std::deque<MoveOnly, A> c2(A(2)); 34 std::deque<MoveOnly, A> c3 = std::move(c1); 43 std::deque<MoveOnly, A> c1(A(1)); 46 std::deque<MoveOnly, A> c2(A(2)); 49 std::deque<MoveOnl [all...] |
H A D | move_alloc.pass.cpp | 10 // <deque> 12 // deque(deque&& c, const allocator_type& a); 14 #include <deque> 28 std::deque<MoveOnly, A> c1(A(1)); 31 std::deque<MoveOnly, A> c2(A(1)); 34 std::deque<MoveOnly, A> c3(std::move(c1), A(3)); 43 std::deque<MoveOnly, A> c1(A(1)); 46 std::deque<MoveOnly, A> c2(A(1)); 49 std::deque<MoveOnl [all...] |
H A D | move_assign.pass.cpp | 10 // <deque> 12 // deque& operator=(deque&& c); 14 #include <deque> 28 std::deque<MoveOnly, A> c1(A(5)); 31 std::deque<MoveOnly, A> c2(A(5)); 34 std::deque<MoveOnly, A> c3(A(5)); 44 std::deque<MoveOnly, A> c1(A(5)); 47 std::deque<MoveOnly, A> c2(A(5)); 50 std::deque<MoveOnl [all...] |
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.modifiers/ |
H A D | insert_iter_initializer_list.pass.cpp | 10 // <deque> 14 #include <deque> 23 std::deque<int> d(10, 1); 24 std::deque<int>::iterator i = d.insert(d.cbegin() + 2, {3, 4, 5, 6}); 43 std::deque<int, min_allocator<int>> d(10, 1); 44 std::deque<int, min_allocator<int>>::iterator i = d.insert(d.cbegin() + 2, {3, 4, 5, 6});
|
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.modifiers/ |
H A D | insert_iter_initializer_list.pass.cpp | 10 // <deque> 14 #include <deque> 23 std::deque<int> d(10, 1); 24 std::deque<int>::iterator i = d.insert(d.cbegin() + 2, {3, 4, 5, 6}); 43 std::deque<int, min_allocator<int>> d(10, 1); 44 std::deque<int, min_allocator<int>>::iterator i = d.insert(d.cbegin() + 2, {3, 4, 5, 6});
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/sequences/deque/deque.modifiers/ |
H A D | insert_iter_initializer_list.pass.cpp | 10 // <deque> 14 #include <deque> 23 std::deque<int> d(10, 1); 24 std::deque<int>::iterator i = d.insert(d.cbegin() + 2, {3, 4, 5, 6}); 43 std::deque<int, min_allocator<int>> d(10, 1); 44 std::deque<int, min_allocator<int>>::iterator i = d.insert(d.cbegin() + 2, {3, 4, 5, 6});
|
/prebuilts/gdb/darwin-x86/lib/python2.7/ |
H A D | mutex.py | 18 from collections import deque namespace 24 self.queue = deque()
|
/prebuilts/gdb/linux-x86/lib/python2.7/ |
H A D | mutex.py | 18 from collections import deque namespace 24 self.queue = deque()
|
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/queue/queue.cons/ |
H A D | ctor_container.pass.cpp | 29 std::deque<int> d = make<std::deque<int> >(5);
|
/prebuilts/ndk/current/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/stack/stack.cons/ |
H A D | ctor_container.pass.cpp | 29 std::deque<int> d = make<std::deque<int> >(5);
|
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/queue/queue.cons/ |
H A D | ctor_container.pass.cpp | 29 std::deque<int> d = make<std::deque<int> >(5);
|
/prebuilts/ndk/r11/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.cons/ |
H A D | ctor_container.pass.cpp | 29 std::deque<int> d = make<std::deque<int> >(5);
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/queue/queue.cons/ |
H A D | ctor_container.pass.cpp | 29 std::deque<int> d = make<std::deque<int> >(5);
|
/prebuilts/ndk/r13/sources/cxx-stl/llvm-libc++/test/std/containers/container.adaptors/stack/stack.cons/ |
H A D | ctor_container.pass.cpp | 29 std::deque<int> d = make<std::deque<int> >(5);
|
/prebuilts/python/darwin-x86/2.7.5/lib/python2.7/ |
H A D | mutex.py | 18 from collections import deque namespace 24 self.queue = deque()
|
/prebuilts/python/linux-x86/2.7.5/lib/python2.7/ |
H A D | mutex.py | 18 from collections import deque namespace 24 self.queue = deque()
|
/prebuilts/misc/common/swig/include/2.0.11/std/ |
H A D | _std_deque.i | 4 * This file contains a generic definition of std::deque along with 12 #include <deque> 17 /* This macro defines all of the standard methods for a deque. This 21 template<> class deque<int> { 36 deque(); 37 deque(unsigned int size, const T& value=T()); 38 deque(const deque<T> &); 39 ~deque(); 42 void swap(deque< [all...] |