| /external/llvm-project/clang/test/Analysis/ |
| D | mismatched-iterator.cpp | 7 V.insert(V.cbegin(), n); // no-warning in good_insert1()
11 V.insert(V.cbegin(), len, n); // no-warning in good_insert2()
15 V1.insert(V1.cbegin(), V2.cbegin(), V2.cend()); // no-warning in good_insert3()
19 V.insert(V.cbegin(), {n-1, n, n+1}); // no-warning in good_insert4()
23 auto i = std::find(V.cbegin(), V.cend(), n); in good_insert_find()
28 V.erase(V.cbegin()); // no-warning in good_erase1()
32 V.erase(V.cbegin(), V.cend()); // no-warning in good_erase2()
36 V.emplace(V.cbegin(), n); // no-warning in good_emplace()
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()
[all …]
|
| D | invalidated-iterator.cpp | 9 auto i = V.cbegin(); in normal_dereference()
14 auto i = V.cbegin(); in invalidated_dereference()
20 auto i = V.cbegin(); in normal_prefix_increment()
25 auto i = V.cbegin(); in invalidated_prefix_increment()
31 auto i = ++V.cbegin(); in normal_prefix_decrement()
36 auto i = ++V.cbegin(); in invalidated_prefix_decrement()
42 auto i = V.cbegin(); in normal_postfix_increment()
47 auto i = V.cbegin(); in invalidated_postfix_increment()
53 auto i = ++V.cbegin(); in normal_postfix_decrement()
58 auto i = ++V.cbegin(); in invalidated_postfix_decrement()
[all …]
|
| D | iterator-modeling.cpp | 343 auto i0 = L1.cbegin(); in list_copy_assignment()
350 auto i0 = V1.cbegin(); in vector_copy_assignment()
357 auto i0 = D1.cbegin(); in deque_copy_assignment()
365 auto i0 = FL1.cbegin(); in forward_list_copy_assignment()
374 auto i0 = L1.cbegin(), i1 = L2.cbegin(), i2 = --L2.cend(), i3 = L2.cend(); in list_move_assignment()
393 auto i0 = V1.cbegin(), i1 = V2.cbegin(), i2 = --V2.cend(), i3 = V2.cend(); in vector_move_assignment()
411 auto i0 = D1.cbegin(), i1 = D2.cbegin(), i2 = --D2.cend(), i3 = D2.cend(); in deque_move_assignment()
430 auto i0 = FL1.cbegin(), i1 = FL2.cbegin(), i2 = FL2.cend(); in forward_list_move_assignment()
458 auto i0 = L.cbegin(), i1 = L.cend(); in list_assign()
465 auto i0 = V.cbegin(), i1 = V.cend(); in vector_assign()
[all …]
|
| D | container-modeling.cpp | 44 V1.cbegin(); in move_assignment()
46 V2.cbegin(); in move_assignment()
73 V.cbegin(); in push_back()
93 V.cbegin(); in emplace_back()
113 V.cbegin(); in pop_back()
134 L.cbegin(); in push_front()
154 L.cbegin(); in emplace_front()
174 L.cbegin(); in pop_front()
211 V1.cbegin(); in push_back1()
213 V2.cbegin(); in push_back1()
[all …]
|
| /external/llvm-project/libcxx/test/std/containers/sequences/list/list.modifiers/ |
| D | erase_iter_iter.pass.cpp | 24 std::list<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
26 assert(distance(l1.cbegin(), l1.cend()) == 3); in main()
31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); in main()
33 assert(distance(l1.cbegin(), l1.cend()) == 2); in main()
39 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2)); in main()
41 assert(distance(l1.cbegin(), l1.cend()) == 1); in main()
47 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3)); in main()
49 assert(distance(l1.cbegin(), l1.cend()) == 0); in main()
55 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
57 assert(distance(l1.cbegin(), l1.cend()) == 3); in main()
[all …]
|
| /external/llvm-project/libcxx/test/std/containers/sequences/vector.bool/ |
| D | erase_iter_iter.pass.cpp | 25 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
27 assert(distance(l1.cbegin(), l1.cend()) == 3); in main()
32 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); in main()
34 assert(distance(l1.cbegin(), l1.cend()) == 2); in main()
40 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2)); in main()
42 assert(distance(l1.cbegin(), l1.cend()) == 1); in main()
48 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3)); in main()
50 assert(distance(l1.cbegin(), l1.cend()) == 0); in main()
56 std::vector<bool, min_allocator<bool>>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
58 assert(distance(l1.cbegin(), l1.cend()) == 3); in main()
[all …]
|
| /external/libcxx/test/std/containers/sequences/list/list.modifiers/ |
| D | erase_iter_iter.pass.cpp | 24 std::list<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
26 assert(distance(l1.cbegin(), l1.cend()) == 3); in main()
31 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); in main()
33 assert(distance(l1.cbegin(), l1.cend()) == 2); in main()
39 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2)); in main()
41 assert(distance(l1.cbegin(), l1.cend()) == 1); in main()
47 std::list<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3)); in main()
49 assert(distance(l1.cbegin(), l1.cend()) == 0); in main()
55 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
57 assert(distance(l1.cbegin(), l1.cend()) == 3); in main()
[all …]
|
| /external/libcxx/test/std/containers/sequences/vector.bool/ |
| D | erase_iter_iter.pass.cpp | 25 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
27 assert(distance(l1.cbegin(), l1.cend()) == 3); in main()
32 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); in main()
34 assert(distance(l1.cbegin(), l1.cend()) == 2); in main()
40 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2)); in main()
42 assert(distance(l1.cbegin(), l1.cend()) == 1); in main()
48 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3)); in main()
50 assert(distance(l1.cbegin(), l1.cend()) == 0); in main()
56 std::vector<bool, min_allocator<bool>>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
58 assert(distance(l1.cbegin(), l1.cend()) == 3); in main()
[all …]
|
| /external/llvm-project/libcxx/test/std/containers/sequences/vector/vector.modifiers/ |
| D | erase_iter_iter.pass.cpp | 42 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
44 assert(distance(l1.cbegin(), l1.cend()) == 3); in main()
51 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); in main()
53 assert(distance(l1.cbegin(), l1.cend()) == 2); in main()
61 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2)); in main()
63 assert(distance(l1.cbegin(), l1.cend()) == 1); in main()
71 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3)); in main()
73 assert(distance(l1.cbegin(), l1.cend()) == 0); in main()
94 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
96 assert(distance(l1.cbegin(), l1.cend()) == 3); in main()
[all …]
|
| /external/libcxx/test/std/containers/sequences/vector/vector.modifiers/ |
| D | erase_iter_iter.pass.cpp | 42 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
44 assert(distance(l1.cbegin(), l1.cend()) == 3); in main()
51 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin())); in main()
53 assert(distance(l1.cbegin(), l1.cend()) == 2); in main()
61 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 2)); in main()
63 assert(distance(l1.cbegin(), l1.cend()) == 1); in main()
71 std::vector<int>::iterator i = l1.erase(l1.cbegin(), next(l1.cbegin(), 3)); in main()
73 assert(distance(l1.cbegin(), l1.cend()) == 0); in main()
94 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
96 assert(distance(l1.cbegin(), l1.cend()) == 3); in main()
[all …]
|
| /external/llvm-project/libcxx/test/std/containers/associative/set/ |
| D | erase_iter_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); in main()
52 i = m.erase(next(m.cbegin(), 3), next(m.cbegin(), 4)); in main()
63 i = m.erase(next(m.cbegin(), 2), next(m.cbegin(), 5)); in main()
71 i = m.erase(next(m.cbegin(), 0), next(m.cbegin(), 2)); in main()
77 i = m.erase(m.cbegin(), m.cend()); in main()
99 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); in main()
111 i = m.erase(next(m.cbegin(), 3), next(m.cbegin(), 4)); in main()
122 i = m.erase(next(m.cbegin(), 2), next(m.cbegin(), 5)); in main()
130 i = m.erase(next(m.cbegin(), 0), next(m.cbegin(), 2)); in main()
136 i = m.erase(m.cbegin(), m.cend()); in main()
|
| D | erase_iter.pass.cpp | 48 I i = m.erase(next(m.cbegin(), 3)); in main()
59 i = m.erase(next(m.cbegin(), 0)); in main()
69 i = m.erase(next(m.cbegin(), 5)); in main()
78 i = m.erase(next(m.cbegin(), 1)); in main()
86 i = m.erase(next(m.cbegin(), 2)); in main()
93 i = m.erase(next(m.cbegin(), 2)); in main()
99 i = m.erase(next(m.cbegin(), 0)); in main()
104 i = m.erase(m.cbegin()); in main()
127 I i = m.erase(next(m.cbegin(), 3)); in main()
138 i = m.erase(next(m.cbegin(), 0)); in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/multiset/ |
| D | erase_iter_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); in main()
52 i = m.erase(next(m.cbegin(), 3), next(m.cbegin(), 4)); in main()
63 i = m.erase(next(m.cbegin(), 2), next(m.cbegin(), 5)); in main()
71 i = m.erase(next(m.cbegin(), 0), next(m.cbegin(), 2)); in main()
77 i = m.erase(m.cbegin(), m.cend()); in main()
99 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); in main()
111 i = m.erase(next(m.cbegin(), 3), next(m.cbegin(), 4)); in main()
122 i = m.erase(next(m.cbegin(), 2), next(m.cbegin(), 5)); in main()
130 i = m.erase(next(m.cbegin(), 0), next(m.cbegin(), 2)); in main()
136 i = m.erase(m.cbegin(), m.cend()); in main()
|
| D | erase_iter.pass.cpp | 48 I i = m.erase(next(m.cbegin(), 3)); in main()
59 i = m.erase(next(m.cbegin(), 0)); in main()
69 i = m.erase(next(m.cbegin(), 5)); in main()
78 i = m.erase(next(m.cbegin(), 1)); in main()
86 i = m.erase(next(m.cbegin(), 2)); in main()
93 i = m.erase(next(m.cbegin(), 2)); in main()
99 i = m.erase(next(m.cbegin(), 0)); in main()
104 i = m.erase(m.cbegin()); in main()
127 I i = m.erase(next(m.cbegin(), 3)); in main()
138 i = m.erase(next(m.cbegin(), 0)); in main()
[all …]
|
| /external/libcxx/test/std/containers/associative/set/ |
| D | erase_iter_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); in main()
52 i = m.erase(next(m.cbegin(), 3), next(m.cbegin(), 4)); in main()
63 i = m.erase(next(m.cbegin(), 2), next(m.cbegin(), 5)); in main()
71 i = m.erase(next(m.cbegin(), 0), next(m.cbegin(), 2)); in main()
77 i = m.erase(m.cbegin(), m.cend()); in main()
99 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); in main()
111 i = m.erase(next(m.cbegin(), 3), next(m.cbegin(), 4)); in main()
122 i = m.erase(next(m.cbegin(), 2), next(m.cbegin(), 5)); in main()
130 i = m.erase(next(m.cbegin(), 0), next(m.cbegin(), 2)); in main()
136 i = m.erase(m.cbegin(), m.cend()); in main()
|
| D | erase_iter.pass.cpp | 48 I i = m.erase(next(m.cbegin(), 3)); in main()
59 i = m.erase(next(m.cbegin(), 0)); in main()
69 i = m.erase(next(m.cbegin(), 5)); in main()
78 i = m.erase(next(m.cbegin(), 1)); in main()
86 i = m.erase(next(m.cbegin(), 2)); in main()
93 i = m.erase(next(m.cbegin(), 2)); in main()
99 i = m.erase(next(m.cbegin(), 0)); in main()
104 i = m.erase(m.cbegin()); in main()
127 I i = m.erase(next(m.cbegin(), 3)); in main()
138 i = m.erase(next(m.cbegin(), 0)); in main()
[all …]
|
| /external/llvm-project/libcxx/test/std/containers/associative/multiset/ |
| D | erase_iter_iter.pass.cpp | 40 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); in main()
52 i = m.erase(next(m.cbegin(), 3), next(m.cbegin(), 4)); in main()
63 i = m.erase(next(m.cbegin(), 2), next(m.cbegin(), 5)); in main()
71 i = m.erase(next(m.cbegin(), 0), next(m.cbegin(), 2)); in main()
77 i = m.erase(m.cbegin(), m.cend()); in main()
99 I i = m.erase(next(m.cbegin(), 5), next(m.cbegin(), 5)); in main()
111 i = m.erase(next(m.cbegin(), 3), next(m.cbegin(), 4)); in main()
122 i = m.erase(next(m.cbegin(), 2), next(m.cbegin(), 5)); in main()
130 i = m.erase(next(m.cbegin(), 0), next(m.cbegin(), 2)); in main()
136 i = m.erase(m.cbegin(), m.cend()); in main()
|
| D | erase_iter.pass.cpp | 48 I i = m.erase(next(m.cbegin(), 3)); in main()
59 i = m.erase(next(m.cbegin(), 0)); in main()
69 i = m.erase(next(m.cbegin(), 5)); in main()
78 i = m.erase(next(m.cbegin(), 1)); in main()
86 i = m.erase(next(m.cbegin(), 2)); in main()
93 i = m.erase(next(m.cbegin(), 2)); in main()
99 i = m.erase(next(m.cbegin(), 0)); in main()
104 i = m.erase(m.cbegin()); in main()
127 I i = m.erase(next(m.cbegin(), 3)); in main()
138 i = m.erase(next(m.cbegin(), 0)); in main()
[all …]
|
| /external/llvm-project/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/ |
| D | lexicographical_compare.pass.cpp | 57 …invoke_on_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * m… in test()
58 in2.cbegin() + 5 * max_n / 10); in test()
62 …_policies(test_one_policy(), in1.begin(), in1.begin() + max_n, in2.cbegin(), in2.cbegin() + max_n2, in test()
69 …invoke_on_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.begin(), in2.beg… in test()
88 …ll_policies(test_one_policy(), in1.begin(), in1.begin() + n1, in2.cbegin(), in2.cbegin() + n2, pre… in test()
126 …ll_policies(test_one_policy(), in1.begin(), in1.begin() + n1, in2.cbegin(), in2.cbegin() + n2, pre… in test_string()
128 …invoke_on_all_policies(test_one_policy(), in1.cbegin(), in1.cbegin() + max_n, in2.cbegin() + 3 * m… in test_string()
129 in2.cbegin() + 5 * max_n / 10); in test_string()
|
| /external/llvm-project/libcxx/test/std/iterators/iterator.range/ |
| D | begin-end.pass.cpp | 52 assert ( std::cbegin(c) == c.cbegin()); in test_const_container()
53 assert ( std::cbegin(c) != c.cend()); in test_const_container()
92 assert ( std::cbegin(c) == c.cbegin()); in test_container()
93 assert ( std::cbegin(c) != c.cend()); in test_container()
131 assert ( std::cbegin(array) == array ); in test_const_array()
132 assert (*std::cbegin(array) == array[0] ); in test_const_array()
133 assert ( std::cbegin(array) != std::cend(array)); in test_const_array()
157 constexpr const int *b = std::cbegin(arrA); in main()
168 static_assert ( c.cbegin() == std::cbegin(c), ""); in main()
179 static_assert ( std::cbegin(c) != std::cend(c), ""); in main()
[all …]
|
| /external/libcxx/test/std/iterators/iterator.range/ |
| D | begin-end.pass.cpp | 53 assert ( std::cbegin(c) == c.cbegin()); in test_const_container()
54 assert ( std::cbegin(c) != c.cend()); in test_const_container()
93 assert ( std::cbegin(c) == c.cbegin()); in test_container()
94 assert ( std::cbegin(c) != c.cend()); in test_container()
132 assert ( std::cbegin(array) == array ); in test_const_array()
133 assert (*std::cbegin(array) == array[0] ); in test_const_array()
134 assert ( std::cbegin(array) != std::cend(array)); in test_const_array()
158 constexpr const int *b = std::cbegin(arrA); in main()
169 static_assert ( c.cbegin() == std::cbegin(c), ""); in main()
180 static_assert ( std::cbegin(c) != std::cend(c), ""); in main()
[all …]
|
| /external/llvm-project/pstl/test/std/algorithms/alg.nonmodifying/ |
| 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()
53 EXPECT_TRUE(i == in.cbegin() + e, "std::adjacent_find returned wrong result"); 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()
65 EXPECT_TRUE(i == in.cbegin() + expect, "std::adjacent_find returned wrong result"); 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()
[all …]
|
| 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()
|
| /external/llvm-project/libcxx/test/std/containers/unord/unord.multiset/ |
| D | local_iterators.pass.cpp | 162 I i = c.cbegin(b); in main()
167 i = c.cbegin(b); in main()
175 i = c.cbegin(b); in main()
183 i = c.cbegin(b); in main()
189 i = c.cbegin(b); in main()
195 i = c.cbegin(b); in main()
200 i = c.cbegin(b); in main()
220 I i = c.cbegin(b); in main()
225 i = c.cbegin(b); in main()
233 i = c.cbegin(b); in main()
[all …]
|
| /external/libcxx/test/std/containers/unord/unord.multiset/ |
| D | local_iterators.pass.cpp | 162 I i = c.cbegin(b); in main()
167 i = c.cbegin(b); in main()
175 i = c.cbegin(b); in main()
183 i = c.cbegin(b); in main()
189 i = c.cbegin(b); in main()
195 i = c.cbegin(b); in main()
200 i = c.cbegin(b); in main()
220 I i = c.cbegin(b); in main()
225 i = c.cbegin(b); in main()
233 i = c.cbegin(b); in main()
[all …]
|