| /llvm-project-15.0.7/libcxx/test/std/containers/sequences/deque/ |
| H A D | compare.pass.cpp | 43 const std::deque<int> d1, d2; in main()
47 const std::deque<int> d1(1, 1), d2(1, 1); in main()
52 const std::deque<int> d1(items, items + 3); in main()
53 const std::deque<int> d2(items, items + 3); in main()
57 const std::deque<int> d1(1, 1), d2; in main()
61 const std::deque<int> d1(1, 1), d2(1, 2); in main()
67 const std::deque<int> d1(items1, items1 + 2); in main()
68 const std::deque<int> d2(items2, items2 + 2); in main()
74 const std::deque<int> d1(items1, items1 + 2); in main()
79 const std::deque<LessAndEqComp> d1, d2; in main()
[all …]
|
| H A 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()
|
| /llvm-project-15.0.7/libcxx/test/std/containers/sequences/deque/deque.cons/ |
| H A D | deduct.pass.cpp | 36 std::deque deq(std::begin(arr), std::end(arr)); in main()
60 std::deque deq(1, A{}); // deque (size_type, T) in main()
89 std::deque<long double> source; in main()
90 std::deque deq(source); // deque(deque &) in main()
101 std::deque<short, Alloc> source; in main()
102 std::deque deq(source, Alloc(2)); in main()
107 std::deque<short, Alloc> source; in main()
113 std::deque<short, Alloc> source; in main()
114 std::deque deq(std::move(source), Alloc(2)); in main()
119 std::deque<short, Alloc> source; in main()
[all …]
|
| H A D | move_alloc.pass.cpp | 29 std::deque<MoveOnly, A> c1(A(1)); in main()
32 std::deque<MoveOnly, A> c2(A(1)); in main()
35 std::deque<MoveOnly, A> c3(std::move(c1), A(3)); // unequal allocator in main()
44 std::deque<MoveOnly, A> c1(A(1)); in main()
47 std::deque<MoveOnly, A> c2(A(1)); in main()
50 std::deque<MoveOnly, A> c3(std::move(c1), A(1)); // equal allocator in main()
59 std::deque<MoveOnly, A> c1(A(1)); in main()
62 std::deque<MoveOnly, A> c2(A(1)); in main()
74 std::deque<MoveOnly, A> c1(A{}); in main()
77 std::deque<MoveOnly, A> c2(A{}); in main()
[all …]
|
| H A D | move_assign.pass.cpp | 29 std::deque<MoveOnly, A> c1(A(5)); in main()
32 std::deque<MoveOnly, A> c2(A(5)); in main()
35 std::deque<MoveOnly, A> c3(A(5)); in main()
45 std::deque<MoveOnly, A> c1(A(5)); in main()
48 std::deque<MoveOnly, A> c2(A(5)); in main()
51 std::deque<MoveOnly, A> c3(A(6)); in main()
61 std::deque<MoveOnly, A> c1(A(5)); in main()
64 std::deque<MoveOnly, A> c2(A(5)); in main()
77 std::deque<MoveOnly, A> c1(A{}); in main()
80 std::deque<MoveOnly, A> c2(A{}); in main()
[all …]
|
| H A D | copy.pass.cpp | 33 test(std::deque<int>(ab, an)); in main()
36 std::deque<int, test_allocator<int> > v(3, 2, test_allocator<int>(5)); in main()
37 std::deque<int, test_allocator<int> > v2 = v; in main()
43 std::deque<int, other_allocator<int> > v(3, 2, other_allocator<int>(5)); in main()
44 std::deque<int, other_allocator<int> > v2 = v; in main()
51 test(std::deque<int, min_allocator<int>>(ab, an)); in main()
54 std::deque<int, min_allocator<int> > v(3, 2, min_allocator<int>()); in main()
55 std::deque<int, min_allocator<int> > v2 = v; in main()
|
| H A 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()
|
| H A D | move.pass.cpp | 29 std::deque<MoveOnly, A> c1(A(1)); in main()
32 std::deque<MoveOnly, A> c2(A(2)); in main()
36 std::deque<MoveOnly, A> c3 = std::move(c1); in main()
46 std::deque<MoveOnly, A> c1(A(1)); in main()
49 std::deque<MoveOnly, A> c2(A(2)); in main()
52 std::deque<MoveOnly, A> c3 = std::move(c1); in main()
61 std::deque<MoveOnly, A> c1(A{}); in main()
64 std::deque<MoveOnly, A> c2(A{}); in main()
67 std::deque<MoveOnly, A> c3 = std::move(c1); in main()
|
| H A D | move_noexcept.pass.cpp | 37 typedef std::deque<MoveOnly> C; in main()
41 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C; in main()
45 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C; in main()
49 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C; in main()
|
| H A D | default_noexcept.pass.cpp | 37 typedef std::deque<MoveOnly> C; in main()
41 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C; in main()
46 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C; in main()
50 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C; in main()
|
| H A D | move_assign_noexcept.pass.cpp | 38 typedef std::deque<MoveOnly> C; in main()
42 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C; in main()
47 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C; in main()
51 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C; in main()
|
| H A D | dtor_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()
47 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C; in main()
|
| H A D | iter_iter.pass.cpp | 31 typedef std::deque<T, Allocator> C; in test()
45 typedef std::deque<T, Allocator> C; in test()
77 std::deque<T> v(It(arr1), It(std::end(arr1))); in test_emplacable_concept()
81 std::deque<T> v(It(arr2), It(std::end(arr2))); in test_emplacable_concept()
91 std::deque<T> v(It(arr1), It(std::end(arr1))); in test_emplacable_concept()
96 std::deque<T> v(It(arr2), It(std::end(arr2))); in test_emplacable_concept()
|
| H A D | assign_iter_iter.pass.cpp | 93 testN<std::deque<int> >(rng[i], rng[j], rng[k]); in basic_test()
94 testNI<std::deque<int> >(1500, 2000, 1000); in basic_test()
103 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[j], rng[k]); in basic_test()
104 testNI<std::deque<int, min_allocator<int>> >(1500, 2000, 1000); in basic_test()
117 std::deque<T> v; in test_emplacable_concept()
122 std::deque<T> v; in test_emplacable_concept()
|
| /llvm-project-15.0.7/lldb/test/API/functionalities/data-formatter/data-formatter-stl/generic/deque/ |
| H A D | main.cpp | 21 template <typename T> T fill(T deque) { in fill() argument
23 deque.push_back({i, i + 1, i + 2}); in fill()
24 deque.push_front({-i, -(i + 1), -(i + 2)}); in fill()
26 return deque; in fill()
30 std::deque<int> empty; in main()
31 std::deque<int> deque_1 = {1}; in main()
32 std::deque<int> deque_3 = {3, 1, 2}; in main()
34 std::deque<Foo_small> deque_200_small; in main()
35 deque_200_small = fill<std::deque<Foo_small>>(deque_200_small); in main()
37 std::deque<Foo_large> deque_200_large; in main()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/containers/sequences/deque/deque.special/ |
| H A 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, 1)); in main()
69 std::deque<int, A> c2(a2, a2+sizeof(a2)/sizeof(a2[0]), A(1, 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()
101 std::deque<int, A> c1(a1, a1+sizeof(a1)/sizeof(a1[0]), A()); in main()
[all …]
|
| H A D | swap_noexcept.pass.cpp | 60 typedef std::deque<MoveOnly> C; in main()
65 typedef std::deque<MoveOnly, test_allocator<MoveOnly>> C; in main()
69 typedef std::deque<MoveOnly, other_allocator<MoveOnly>> C; in main()
74 typedef std::deque<MoveOnly, some_alloc<MoveOnly>> C; in main()
84 typedef std::deque<MoveOnly, some_alloc2<MoveOnly>> C; in main()
|
| /llvm-project-15.0.7/libcxx/include/ |
| H A D | deque | 20 class deque
50 deque(const deque& c);
51 deque(deque&& c)
55 deque(deque&& c, const allocator_type& a);
58 deque& operator=(const deque& c);
59 deque& operator=(deque&& c)
1336 deque(const deque& __c);
1339 deque& operator=(const deque& __c);
1353 deque& operator=(deque&& __c)
1663 deque<_Tp, _Allocator>::deque(const deque& __c)
[all …]
|
| /llvm-project-15.0.7/libcxx/benchmarks/ |
| H A D | deque.bench.cpp | 22 std::deque<unsigned char>{})->Arg(5140480);
26 std::deque<unsigned char>{}, 0)->Arg(5140480);
30 std::deque<char>{},
35 std::deque<size_t>{},
40 std::deque<std::string>{},
|
| /llvm-project-15.0.7/libcxx/include/experimental/ |
| H A D | deque | 14 experimental/deque synopsis
23 using deque = std::deque<T,polymorphic_allocator<T>>;
33 #include <deque>
44 using deque = _VSTD::deque<_ValueT, polymorphic_allocator<_ValueT>>;
|
| /llvm-project-15.0.7/libcxx/test/std/containers/sequences/deque/deque.capacity/ |
| H A D | access.pass.cpp | 55 typedef std::deque<int> C; in main()
56 C c = make<std::deque<int> >(10); in main()
71 typedef std::deque<int> C; in main()
72 const C c = make<std::deque<int> >(10); in main()
88 typedef std::deque<int, min_allocator<int>> C; in main()
89 C c = make<std::deque<int, min_allocator<int>> >(10); in main()
104 typedef std::deque<int, min_allocator<int>> C; in main()
105 const C c = make<std::deque<int, min_allocator<int>> >(10); in main()
|
| /llvm-project-15.0.7/libcxx/test/std/containers/container.adaptors/priority.queue/ |
| H A D | types.pass.cpp | 58 …tic_assert(( std::is_same<std::priority_queue<int, std::deque<int> >::container_type, std::deque<i… in main()
59 …static_assert(( std::is_same<std::priority_queue<int, std::deque<int> >::value_type, int>::value),… in main()
64 …static_assert(( std::is_same<std::priority_queue<int, std::deque<int> >::value_compare, std::less<… in main()
65 …static_assert(( std::is_same<std::priority_queue<int, std::deque<int>, std::greater<int> >::value_… in main()
|
| /llvm-project-15.0.7/libcxx/test/std/containers/sequences/deque/deque.erasure/ |
| H A D | erase.pass.cpp | 68 test<std::deque<int>>(); in main()
69 test<std::deque<int, min_allocator<int>>> (); in main()
70 test<std::deque<int, test_allocator<int>>> (); in main()
72 test<std::deque<long>>(); in main()
73 test<std::deque<double>>(); in main()
|
| H A D | erase_if.pass.cpp | 70 test<std::deque<int>>(); in main()
71 test<std::deque<int, min_allocator<int>>> (); in main()
72 test<std::deque<int, test_allocator<int>>> (); in main()
74 test<std::deque<long>>(); in main()
75 test<std::deque<double>>(); in main()
|
| /llvm-project-15.0.7/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
| H A D | insert_iter_initializer_list.pass.cpp | 24 std::deque<int> d(10, 1); in main()
25 std::deque<int>::iterator i = d.insert(d.cbegin() + 2, {3, 4, 5, 6}); in main()
44 std::deque<int, min_allocator<int>> d(10, 1); in main()
45 std::deque<int, min_allocator<int>>::iterator i = d.insert(d.cbegin() + 2, {3, 4, 5, 6}); in main()
|