| /llvm-project-15.0.7/clang/test/Analysis/ |
| H A D | mismatched-iterator.cpp | 15 V1.insert(V1.cbegin(), V2.cbegin(), V2.cend()); // no-warning in good_insert3()
23 auto i = std::find(V.cbegin(), V.cend(), n); in good_insert_find()
32 V.erase(V.cbegin(), V.cend()); // no-warning in good_erase2()
40 std::vector<int> new_v(V.cbegin(), V.cend()); // no-warning in good_ctor()
44 std::find(V.cbegin(), V.cend(), n); // no-warning in good_find()
48 std::find_first_of(V1.cbegin(), V1.cend(), V2.cbegin(), V2.cend()); // no-warning in good_find_first_of()
52 std::copy(V1.cbegin(), V1.cend(), V2.begin()); // no-warning in good_copy()
78 …V2.erase(V2.cbegin(), V1.cend()); // expected-warning{{Container accessed using foreign iterator a… in bad_erase2()
88 if (V.cbegin() == V.cend()) {} // no-warning in good_comparison()
104 …std::find_first_of(V1.cbegin(), V2.cend(), V2.cbegin(), V2.cend()); // expected-warning{{Iterators… in bad_find_first_of()
[all …]
|
| H A D | iterator-modeling.cpp | 528 auto i0 = L.cbegin(), i1 = --L.cend(), i2 = L.cend(); in list_push_back()
547 auto i0 = V.cbegin(), i1 = --V.cend(), i2 = V.cend(); in vector_push_back()
566 auto i0 = D.cbegin(), i1 = --D.cend(), i2 = D.cend(); in deque_push_back()
588 auto i0 = L.cbegin(), i1 = --L.cend(), i2 = L.cend(); in list_emplace_back()
607 auto i0 = V.cbegin(), i1 = --V.cend(), i2 = V.cend(); in vector_emplace_back()
626 auto i0 = D.cbegin(), i1 = --D.cend(), i2 = D.cend(); in deque_emplace_back()
648 auto i0 = L.cbegin(), i1 = --L.cend(), i2 = L.cend(); in list_pop_back()
667 auto i0 = V.cbegin(), i1 = --V.cend(), i2 = V.cend(); in vector_pop_back()
686 auto i0 = D.cbegin(), i1 = --D.cend(), i2 = D.cend(); in deque_pop_back()
728 auto i0 = D.cbegin(), i1 = --D.cend(), i2 = D.cend(); in deque_push_front()
[all …]
|
| H A D | container-modeling.cpp | 45 V1.cend(); in move_assignment()
47 V2.cend(); in move_assignment()
74 V.cend(); in push_back()
94 V.cend(); in emplace_back()
114 V.cend(); in pop_back()
135 L.cend(); in push_front()
155 L.cend(); in emplace_front()
175 L.cend(); in pop_front()
212 V1.cend(); in push_back1()
214 V2.cend(); in push_back1()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/ranges/range.access/ |
| H A D | end.pass.cpp | 84 assert(std::ranges::cend(a) == a + 2); in testArray()
88 assert(std::ranges::cend(b) == b + 2); in testArray()
92 assert(std::ranges::cend(c) == c + 2); in testArray()
164 assert(std::ranges::cend(a) == &a.x); in testEndMember()
176 assert(std::ranges::cend(d) == &d.x); in testEndMember()
180 assert(std::ranges::cend(e) == &e.x); in testEndMember()
272 assert(std::ranges::cend(a) == &a.x); in testEndFunction()
287 assert(std::ranges::cend(d) == &d.x); in testEndFunction()
294 assert(std::ranges::cend(e) == &e.x); in testEndFunction()
301 assert(std::ranges::cend(f) == &f.y); in testEndFunction()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/containers/associative/set/ |
| H A D | insert_iter_cv.pass.cpp | 27 R r = m.insert(m.cend(), M::value_type(2)); in main()
32 r = m.insert(m.cend(), M::value_type(1)); in main()
37 r = m.insert(m.cend(), M::value_type(3)); in main()
42 r = m.insert(m.cend(), M::value_type(3)); in main()
52 R r = m.insert(m.cend(), M::value_type(2)); in main()
57 r = m.insert(m.cend(), M::value_type(1)); in main()
62 r = m.insert(m.cend(), M::value_type(3)); in main()
67 r = m.insert(m.cend(), M::value_type(3)); in main()
|
| H A D | insert_iter_rv.pass.cpp | 31 R r = m.insert(m.cend(), M::value_type(2)); in main()
36 r = m.insert(m.cend(), M::value_type(1)); in main()
41 r = m.insert(m.cend(), M::value_type(3)); in main()
46 r = m.insert(m.cend(), M::value_type(3)); in main()
55 R r = m.insert(m.cend(), M::value_type(2)); in main()
60 r = m.insert(m.cend(), M::value_type(1)); in main()
65 r = m.insert(m.cend(), M::value_type(3)); in main()
70 r = m.insert(m.cend(), M::value_type(3)); in main()
|
| /llvm-project-15.0.7/libcxx/test/std/containers/associative/multiset/ |
| H A D | insert_iter_cv.pass.cpp | 27 R r = m.insert(m.cend(), M::value_type(2)); in main()
32 r = m.insert(m.cend(), M::value_type(1)); in main()
37 r = m.insert(m.cend(), M::value_type(3)); in main()
42 r = m.insert(m.cend(), M::value_type(3)); in main()
52 R r = m.insert(m.cend(), M::value_type(2)); in main()
57 r = m.insert(m.cend(), M::value_type(1)); in main()
62 r = m.insert(m.cend(), M::value_type(3)); in main()
67 r = m.insert(m.cend(), M::value_type(3)); in main()
|
| H A D | insert_iter_rv.pass.cpp | 30 R r = m.insert(m.cend(), M::value_type(2)); in main()
35 r = m.insert(m.cend(), M::value_type(1)); in main()
40 r = m.insert(m.cend(), M::value_type(3)); in main()
45 r = m.insert(m.cend(), M::value_type(3)); in main()
54 R r = m.insert(m.cend(), M::value_type(2)); in main()
59 r = m.insert(m.cend(), M::value_type(1)); in main()
64 r = m.insert(m.cend(), M::value_type(3)); in main()
69 r = m.insert(m.cend(), M::value_type(3)); in main()
|
| /llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.multiset/ |
| H A D | local_iterators.pass.cpp | 168 j = c.cend(b); in main()
176 j = c.cend(b); in main()
184 j = c.cend(b); in main()
190 j = c.cend(b); in main()
196 j = c.cend(b); in main()
201 j = c.cend(b); in main()
226 j = c.cend(b); in main()
234 j = c.cend(b); in main()
242 j = c.cend(b); in main()
248 j = c.cend(b); in main()
[all …]
|
| H A D | local_iterators.compile.fail.cpp | 168 j = c.cend(b); in main()
176 j = c.cend(b); in main()
184 j = c.cend(b); in main()
190 j = c.cend(b); in main()
196 j = c.cend(b); in main()
201 j = c.cend(b); in main()
226 j = c.cend(b); in main()
234 j = c.cend(b); in main()
242 j = c.cend(b); in main()
248 j = c.cend(b); in main()
[all …]
|
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.nonmodifying/ |
| H A D | adjacent_find.pass.cpp | 52 auto i = std::adjacent_find(in.cbegin(), in.cend(), std::equal_to<T>()); in test_adjacent_find_by_type()
56 … invoke_on_all_policies(test_adjacent_find(), in.cbegin(), in.cend(), std::equal_to<T>()); in test_adjacent_find_by_type()
64 auto i = std::adjacent_find(in.cbegin(), in.cend(), std::equal_to<T>()); in test_adjacent_find_by_type()
68 invoke_on_all_policies(test_adjacent_find(), in.cbegin(), in.cend(), std::equal_to<T>()); in test_adjacent_find_by_type()
76 invoke_on_all_policies(test_adjacent_find(), a1.cbegin(), a1.cend(), std::equal_to<T>()); in test_adjacent_find_by_type()
77 invoke_on_all_policies(test_adjacent_find(), a1.cbegin() + 1, a1.cend(), std::equal_to<T>()); in test_adjacent_find_by_type()
83 invoke_on_all_policies(test_adjacent_find(), a2.cbegin(), a2.cend(), std::equal_to<T>()); in test_adjacent_find_by_type()
84 invoke_on_all_policies(test_adjacent_find(), a2.cbegin(), a2.cend() - 1, std::equal_to<T>()); in test_adjacent_find_by_type()
89 invoke_on_all_policies(test_adjacent_find(), a3.cbegin(), a3.cend(), std::equal_to<T>()); in test_adjacent_find_by_type()
|
| H A D | mismatch.pass.cpp | 80 … invoke_on_all_policies(test_mismatch(), in.cbegin(), in.cend(), in2.cbegin(), in2.cend()); in test_mismatch_by_type()
81 invoke_on_all_policies(test_mismatch(), in.cbegin(), in.cend(), in2.cbegin()); in test_mismatch_by_type()
94 … invoke_on_all_policies(test_mismatch(), in.cbegin(), in.cend(), in2.cbegin(), in2.cend()); in test_mismatch_by_type()
96 invoke_on_all_policies(test_mismatch(), in.cbegin(), in.cend(), in2.cbegin()); in test_mismatch_by_type()
102 … invoke_on_all_policies(test_mismatch(), in.cbegin(), in.cend(), in2.cbegin(), in2.cend()); in test_mismatch_by_type()
104 invoke_on_all_policies(test_mismatch(), in.cbegin(), in.cend(), in2.cbegin()); in test_mismatch_by_type()
|
| /llvm-project-15.0.7/libcxx/test/std/containers/associative/multimap/multimap.modifiers/ |
| H A D | insert_iter_rv.pass.cpp | 32 R r = m.insert(m.cend(), P(2, 2)); in do_insert_rv_test()
38 r = m.insert(m.cend(), P(1, 1)); in do_insert_rv_test()
44 r = m.insert(m.cend(), P(3, 3)); in do_insert_rv_test()
50 r = m.insert(m.cend(), P(3, 2)); in do_insert_rv_test()
74 R r = m.insert(m.cend(), {2, MoveOnly(2)}); in main()
80 r = m.insert(m.cend(), {1, MoveOnly(1)}); in main()
86 r = m.insert(m.cend(), {3, MoveOnly(3)}); in main()
92 r = m.insert(m.cend(), {3, MoveOnly(2)}); in main()
|
| H A D | emplace_hint.pass.cpp | 33 R r = m.emplace_hint(m.cend()); in main()
39 r = m.emplace_hint(m.cend(), std::piecewise_construct, in main()
47 r = m.emplace_hint(m.cend(), std::piecewise_construct, in main()
61 R r = m.emplace_hint(m.cend(), std::piecewise_construct, in main()
87 R r = m.emplace_hint(m.cend(), M::value_type(2, 3.5)); in main()
98 R r = m.emplace_hint(m.cend()); in main()
104 r = m.emplace_hint(m.cend(), std::piecewise_construct, in main()
112 r = m.emplace_hint(m.cend(), std::piecewise_construct, in main()
126 R r = m.emplace_hint(m.cend(), std::piecewise_construct, in main()
152 R r = m.emplace_hint(m.cend(), M::value_type(2, 3.5)); in main()
|
| /llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.set/ |
| H A D | local_iterators.pass.cpp | 140 j = c.cend(b); in main()
146 j = c.cend(b); in main()
152 j = c.cend(b); in main()
158 j = c.cend(b); in main()
184 j = c.cend(b); in main()
190 j = c.cend(b); in main()
196 j = c.cend(b); in main()
202 j = c.cend(b); in main()
320 j = c.cend(b); in main()
326 j = c.cend(b); in main()
[all …]
|
| H A D | local_iterators.compile.fail.cpp | 166 j = c.cend(b); in main()
174 j = c.cend(b); in main()
182 j = c.cend(b); in main()
188 j = c.cend(b); in main()
194 j = c.cend(b); in main()
199 j = c.cend(b); in main()
224 j = c.cend(b); in main()
232 j = c.cend(b); in main()
240 j = c.cend(b); in main()
246 j = c.cend(b); in main()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.map/ |
| H A D | local_iterators.pass.cpp | 149 j = c.cend(b); in main()
156 j = c.cend(b); in main()
163 j = c.cend(b); in main()
170 j = c.cend(b); in main()
197 j = c.cend(b); in main()
204 j = c.cend(b); in main()
211 j = c.cend(b); in main()
218 j = c.cend(b); in main()
345 j = c.cend(b); in main()
352 j = c.cend(b); in main()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/iterators/iterator.range/ |
| H A D | begin-end.pass.cpp | 56 ASSERT_SAME_TYPE(decltype(std::cend(a)), const int*); in test_arrays_and_initializer_lists_forward()
58 assert(std::cend(a) == a + 3); in test_arrays_and_initializer_lists_forward()
68 ASSERT_SAME_TYPE(decltype(std::cend(ca)), const int*); in test_arrays_and_initializer_lists_forward()
70 assert(std::cend(ca) == a + 3); in test_arrays_and_initializer_lists_forward()
81 ASSERT_SAME_TYPE(decltype(std::cend(il)), const int*); in test_arrays_and_initializer_lists_forward()
83 assert(std::cend(il) == il.end()); in test_arrays_and_initializer_lists_forward()
95 assert(std::cend(cil) == il.end()); in test_arrays_and_initializer_lists_forward()
161 assert(std::cend(c) == c.end()); in test_container()
181 assert(std::cend(cc) == c.end()); in test_container()
236 assert(std::cend(a) == a + 3); in test_adl_proofing()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/iterators/iterator.requirements/iterator.cust/iterator.cust.move/ |
| H A D | iter_move.pass.cpp | 127 assert(std::all_of(v1.cbegin(), v1.cend(), move_counter_is(reset))); in test()
128 assert(std::all_of(v2.cbegin(), v2.cend(), move_counter_is(1))); in test()
132 assert(std::all_of(v1.cbegin(), v1.cend(), move_counter_is(reset))); in test()
133 assert(std::all_of(v3.cbegin(), v3.cend(), move_counter_is(1))); in test()
137 assert(std::all_of(v3.cbegin(), v3.cend(), move_counter_is(reset))); in test()
138 assert(std::all_of(v4.cbegin(), v4.cend(), move_counter_is(2))); in test()
141 assert(std::all_of(v2.cbegin(), v2.cend(), move_counter_is(reset))); in test()
145 assert(std::all_of(v4.cbegin(), v4.cend(), move_counter_is(reset))); in test()
150 assert(std::all_of(v2.cbegin(), v2.cend(), move_counter_is(4))); in test()
153 assert(std::all_of(v1.cbegin(), v1.cend(), move_counter_is(reset))); in test()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/containers/sequences/list/list.modifiers/ |
| H A D | erase_iter_iter.pass.cpp | 26 assert(std::distance(l1.cbegin(), l1.cend()) == 3); in main()
33 assert(std::distance(l1.cbegin(), l1.cend()) == 2); in main()
41 assert(std::distance(l1.cbegin(), l1.cend()) == 1); in main()
49 assert(std::distance(l1.cbegin(), l1.cend()) == 0); in main()
57 assert(std::distance(l1.cbegin(), l1.cend()) == 3); in main()
64 assert(std::distance(l1.cbegin(), l1.cend()) == 2); in main()
72 assert(std::distance(l1.cbegin(), l1.cend()) == 1); in main()
80 assert(std::distance(l1.cbegin(), l1.cend()) == 0); in main()
|
| /llvm-project-15.0.7/libcxx/test/std/containers/sequences/vector.bool/ |
| H A D | erase_iter_iter.pass.cpp | 28 assert(std::distance(l1.cbegin(), l1.cend()) == 3); in tests()
35 assert(std::distance(l1.cbegin(), l1.cend()) == 2); in tests()
43 assert(std::distance(l1.cbegin(), l1.cend()) == 1); in tests()
51 assert(std::distance(l1.cbegin(), l1.cend()) == 0); in tests()
59 assert(std::distance(l1.cbegin(), l1.cend()) == 3); in tests()
66 assert(std::distance(l1.cbegin(), l1.cend()) == 2); in tests()
74 assert(std::distance(l1.cbegin(), l1.cend()) == 1); in tests()
82 assert(std::distance(l1.cbegin(), l1.cend()) == 0); in tests()
|
| /llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.multimap/ |
| H A D | local_iterators.pass.cpp | 210 j = c.cend(b); in main()
227 j = c.cend(b); in main()
244 j = c.cend(b); in main()
251 j = c.cend(b); in main()
258 j = c.cend(b); in main()
263 j = c.cend(b); in main()
288 j = c.cend(b); in main()
305 j = c.cend(b); in main()
322 j = c.cend(b); in main()
329 j = c.cend(b); in main()
[all …]
|
| H A D | local_iterators.compile.fail.cpp | 181 j = c.cend(b); in main()
191 j = c.cend(b); in main()
201 j = c.cend(b); in main()
208 j = c.cend(b); in main()
215 j = c.cend(b); in main()
220 j = c.cend(b); in main()
245 j = c.cend(b); in main()
255 j = c.cend(b); in main()
265 j = c.cend(b); in main()
272 j = c.cend(b); in main()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/containers/sequences/deque/deque.special/ |
| H A D | copy.pass.cpp | 56 assert(std::copy(c1.cbegin(), c1.cend(), c2.begin()) == c2.end()); in testN()
58 assert(std::copy(c2.cbegin(), c2.cend(), c1.begin()) == c1.end()); in testN()
60 assert(std::copy(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end())); in testN()
62 assert(std::copy(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end())); in testN()
64 assert(std::copy(RACI(c1.cbegin()), RACI(c1.cend()), c2.begin()) == c2.end()); in testN()
66 assert(std::copy(ICI(c2.cbegin()), ICI(c2.cend()), c1.begin()) == c1.end()); in testN()
|
| H A D | move.pass.cpp | 55 assert(std::move(c1.cbegin(), c1.cend(), c2.begin()) == c2.end()); in testN()
57 assert(std::move(c2.cbegin(), c2.cend(), c1.begin()) == c1.end()); in testN()
59 assert(std::move(c1.cbegin(), c1.cend(), RAI(c2.begin())) == RAI(c2.end())); in testN()
61 assert(std::move(c2.cbegin(), c2.cend(), RAI(c1.begin())) == RAI(c1.end())); in testN()
63 assert(std::move(RACI(c1.cbegin()), RACI(c1.cend()), c2.begin()) == c2.end()); in testN()
65 assert(std::move(RACI(c2.cbegin()), RACI(c2.cend()), c1.begin()) == c1.end()); in testN()
|