| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.cons/ |
| D | copy.pass.cpp | 32 test(std::deque<int>(ab, an)); in main()
35 std::deque<int, test_allocator<int> > v(3, 2, test_allocator<int>(5)); in main()
36 std::deque<int, test_allocator<int> > v2 = v; in main()
42 std::deque<int, other_allocator<int> > v(3, 2, other_allocator<int>(5)); in main()
43 std::deque<int, other_allocator<int> > v2 = v; in main()
52 test(std::deque<int, min_allocator<int>>(ab, an)); in main()
55 std::deque<int, min_allocator<int> > v(3, 2, min_allocator<int>()); in main()
56 std::deque<int, min_allocator<int> > v2 = v; in main()
|
| D | op_equal.pass.cpp | 33 test(std::deque<int>(ab, an)); in main()
36 std::deque<int, test_allocator<int> > l(3, 2, test_allocator<int>(5)); in main()
37 std::deque<int, test_allocator<int> > l2(l, test_allocator<int>(3)); in main()
43 std::deque<int, other_allocator<int> > l(3, 2, other_allocator<int>(5)); in main()
44 std::deque<int, other_allocator<int> > l2(l, other_allocator<int>(3)); in main()
53 test(std::deque<int, min_allocator<int>>(ab, an)); in main()
56 std::deque<int, min_allocator<int> > l(3, 2, min_allocator<int>()); in main()
57 std::deque<int, min_allocator<int> > l2(l, min_allocator<int>()); in main()
|
| D | move_alloc.pass.cpp | 28 std::deque<MoveOnly, A> c1(A(1)); in main()
31 std::deque<MoveOnly, A> c2(A(1)); in main()
34 std::deque<MoveOnly, A> c3(std::move(c1), A(3)); in main()
43 std::deque<MoveOnly, A> c1(A(1)); in main()
46 std::deque<MoveOnly, A> c2(A(1)); in main()
49 std::deque<MoveOnly, A> c3(std::move(c1), A(1)); in main()
58 std::deque<MoveOnly, A> c1(A(1)); in main()
61 std::deque<MoveOnly, A> c2(A(1)); in main()
64 std::deque<MoveOnly, A> c3(std::move(c1), A(3)); in main()
74 std::deque<MoveOnly, A> c1(A{}); in main()
[all …]
|
| D | move_assign.pass.cpp | 28 std::deque<MoveOnly, A> c1(A(5)); in main()
31 std::deque<MoveOnly, A> c2(A(5)); in main()
34 std::deque<MoveOnly, A> c3(A(5)); in main()
44 std::deque<MoveOnly, A> c1(A(5)); in main()
47 std::deque<MoveOnly, A> c2(A(5)); in main()
50 std::deque<MoveOnly, A> c3(A(6)); in main()
60 std::deque<MoveOnly, A> c1(A(5)); in main()
63 std::deque<MoveOnly, A> c2(A(5)); in main()
66 std::deque<MoveOnly, A> c3(A(6)); in main()
77 std::deque<MoveOnly, A> c1(A{}); in main()
[all …]
|
| D | move.pass.cpp | 28 std::deque<MoveOnly, A> c1(A(1)); in main()
31 std::deque<MoveOnly, A> c2(A(2)); in main()
34 std::deque<MoveOnly, A> c3 = std::move(c1); in main()
43 std::deque<MoveOnly, A> c1(A(1)); in main()
46 std::deque<MoveOnly, A> c2(A(2)); in main()
49 std::deque<MoveOnly, A> c3 = std::move(c1); in main()
59 std::deque<MoveOnly, A> c1(A{}); in main()
62 std::deque<MoveOnly, A> c2(A{}); in main()
65 std::deque<MoveOnly, A> c3 = std::move(c1); in main()
|
| D | default_noexcept.pass.cpp | 34 typedef std::deque<MoveOnly> C; in main()
38 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C; in main()
42 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C; in main()
46 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C; in main()
|
| D | move_noexcept.pass.cpp | 34 typedef std::deque<MoveOnly> C; in main()
38 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C; in main()
42 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C; in main()
46 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C; in main()
|
| D | move_assign_noexcept.pass.cpp | 36 typedef std::deque<MoveOnly> C; in main()
40 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C; in main()
44 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C; in main()
48 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C; in main()
|
| D | dtor_noexcept.pass.cpp | 36 typedef std::deque<MoveOnly> C; in main()
40 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C; in main()
44 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C; in main()
48 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C; in main()
|
| /ndk/tests/device/test-stlport_static-exception/jni/ |
| D | alias2.cpp | 47 class deque : protected _Deque_base class
50 deque () {} in deque() function in deque
51 deque(const deque& __x) {} in deque() function in deque
52 ~deque() { in ~deque()
61 GeometryAddress(deque addressStack) {} in GeometryAddress()
68 deque temp1;
|
| /ndk/tests/device/test-stlport_shared-exception/jni/ |
| D | alias2.cpp | 47 class deque : protected _Deque_base class
50 deque () {} in deque() function in deque
51 deque(const deque& __x) {} in deque() function in deque
52 ~deque() { in ~deque()
61 GeometryAddress(deque addressStack) {} in GeometryAddress()
68 deque temp1;
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.special/ |
| D | swap.pass.cpp | 62 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in main()
68 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1)); in main()
69 std::deque<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A(2)); in main()
71 assert((c1 == std::deque<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0])))); in main()
73 assert((c2 == std::deque<int, A>(a1, a1+sizeof(a1)/sizeof(a1[0])))); in main()
80 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A(1)); in main()
81 std::deque<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A(2)); in main()
83 assert((c1 == std::deque<int, A>(a2, a2+sizeof(a2)/sizeof(a2[0])))); in main()
85 assert((c2 == std::deque<int, A>(a1, a1+sizeof(a1)/sizeof(a1[0])))); in main()
95 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); in main()
[all …]
|
| D | swap_noexcept.pass.cpp | 40 typedef std::deque<MoveOnly> C; in main()
45 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C; in main()
50 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C; in main()
55 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C; in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.capacity/ |
| D | access.pass.cpp | 54 std::deque<int> c = make<std::deque<int> >(10); in main()
63 const std::deque<int> c = make<std::deque<int> >(10); in main()
73 std::deque<int, min_allocator<int>> c = make<std::deque<int, min_allocator<int>> >(10); in main()
82 … const std::deque<int, min_allocator<int>> c = make<std::deque<int, min_allocator<int>> >(10); in main()
|
| /ndk/tests/device/test-gnustl-full/unit/ |
| D | deque_test.cpp | 52 deque<int> d; in deque1()
71 deque<int>::iterator dit = d.begin(); in deque1()
72 deque<int>::const_iterator cdit(d.begin()); in deque1()
82 deque<int> d; in insert()
88 deque<int>::iterator dit; in insert()
158 deque<int> d; in at()
159 deque<int> const& cd = d; in at()
185 deque<int> ref; in auto_ref()
190 deque<deque<int> > d_d_int(1, ref); in auto_ref()
211 typedef deque<int, StackAllocator<int> > DequeInt; in allocator_with_state()
[all …]
|
| D | insert_test.cpp | 36 deque<char const*> names(array1, array1 + 3); in insert1()
37 deque<char const*>::iterator i = names.begin() + 2; in insert1()
39 insert_iterator<deque <char const*> > itd(names, i); in insert1()
40 itd = copy(array2, array2 + 3, insert_iterator<deque <char const*> >(names, i)); in insert1()
60 deque<char const*> names(array1, array1 + 3); in insert2()
61 deque<char const*>::iterator i = names.begin() + 2; in insert2()
|
| D | finsert_test.cpp | 34 deque<char const*> names; in finsert1()
35 front_insert_iterator<deque<char const*> > fit(names); in finsert1()
36 fit = copy(array, array + 3, front_insert_iterator<deque <char const*> >(names)); in finsert1()
52 deque<char const*> names; in finsert2()
|
| /ndk/tests/device/test-stlport/unit/ |
| D | deque_test.cpp | 52 deque<int> d; in deque1()
71 deque<int>::iterator dit = d.begin(); in deque1()
72 deque<int>::const_iterator cdit(d.begin()); in deque1()
82 deque<int> d; in insert()
88 deque<int>::iterator dit; in insert()
158 deque<int> d; in at()
159 deque<int> const& cd = d; in at()
185 deque<int> ref; in auto_ref()
190 deque<deque<int> > d_d_int(1, ref); in auto_ref()
211 typedef deque<int, StackAllocator<int> > DequeInt; in allocator_with_state()
[all …]
|
| D | insert_test.cpp | 36 deque<char const*> names(array1, array1 + 3); in insert1()
37 deque<char const*>::iterator i = names.begin() + 2; in insert1()
39 insert_iterator<deque <char const*> > itd(names, i); in insert1()
40 itd = copy(array2, array2 + 3, insert_iterator<deque <char const*> >(names, i)); in insert1()
60 deque<char const*> names(array1, array1 + 3); in insert2()
61 deque<char const*>::iterator i = names.begin() + 2; in insert2()
|
| D | finsert_test.cpp | 34 deque<char const*> names; in finsert1()
35 front_insert_iterator<deque<char const*> > fit(names); in finsert1()
36 fit = copy(array, array + 3, front_insert_iterator<deque <char const*> >(names)); in finsert1()
52 deque<char const*> names; in finsert2()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/ |
| D | iterators.pass.cpp | 28 typedef std::deque<int> C; in main()
38 typedef std::deque<int, min_allocator<int>> C; in main()
49 std::deque<int>::iterator ii1{}, ii2{}; in main()
50 std::deque<int>::iterator ii4 = ii1; in main()
51 std::deque<int>::const_iterator cii{}; in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/queue/queue.defn/ |
| D | types.pass.cpp | 49 static_assert((std::is_same<std::queue<int>::container_type, std::deque<int> >::value), ""); in main()
52 … static_assert((std::is_same<std::queue<int>::reference, std::deque<int>::reference>::value), ""); in main()
53 …static_assert((std::is_same<std::queue<int>::const_reference, std::deque<int>::const_reference>::v… in main()
54 … static_assert((std::is_same<std::queue<int>::size_type, std::deque<int>::size_type>::value), ""); in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/container.adaptors/stack/stack.defn/ |
| D | types.pass.cpp | 50 static_assert((std::is_same<std::stack<int>::container_type, std::deque<int> >::value), ""); in main()
53 … static_assert((std::is_same<std::stack<int>::reference, std::deque<int>::reference>::value), ""); in main()
54 …static_assert((std::is_same<std::stack<int>::const_reference, std::deque<int>::const_reference>::v… in main()
55 … static_assert((std::is_same<std::stack<int>::size_type, std::deque<int>::size_type>::value), ""); in main()
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/include/ |
| D | deque | 2 //===---------------------------- deque -----------------------------------===//
15 deque synopsis
21 class deque
41 deque() noexcept(is_nothrow_default_constructible<allocator_type>::value);
42 explicit deque(const allocator_type& a);
43 explicit deque(size_type n);
44 explicit deque(size_type n, const allocator_type& a); // C++14
45 deque(size_type n, const value_type& v);
46 deque(size_type n, const value_type& v, const allocator_type& a);
48 deque(InputIterator f, InputIterator l);
[all …]
|
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/sequences/deque/deque.modifiers/ |
| D | insert_iter_initializer_list.pass.cpp | 23 std::deque<int> d(10, 1); in main()
24 std::deque<int>::iterator i = d.insert(d.cbegin() + 2, {3, 4, 5, 6}); in main()
43 std::deque<int, min_allocator<int>> d(10, 1); in main()
44 std::deque<int, min_allocator<int>>::iterator i = d.insert(d.cbegin() + 2, {3, 4, 5, 6}); in main()
|