Home
last modified time | relevance | path

Searched refs:cbegin (Results 1 – 25 of 347) sorted by relevance

12345678910>>...14

/llvm-project-15.0.7/clang/test/Analysis/
H A Dmismatched-iterator.cpp7 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()
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()
48 std::find_first_of(V1.cbegin(), V1.cend(), V2.cbegin(), V2.cend()); // no-warning in good_find_first_of()
64 …V2.insert(V1.cbegin(), V2.cbegin(), V2.cend()); // expected-warning{{Container accessed using fore… in bad_insert3()
113 V2.erase(V1.cbegin()); // no-warning in ignore_conjured1()
[all …]
H A Dinvalidated-iterator.cpp9 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()
42 auto i = V.cbegin(); in normal_postfix_increment()
47 auto i = V.cbegin(); in invalidated_postfix_increment()
64 auto i = V.cbegin(); in normal_increment_by_2()
69 auto i = V.cbegin(); in invalidated_increment_by_2()
75 auto i = V.cbegin(); in normal_increment_by_2_copy()
80 auto i = V.cbegin(); in invalidated_increment_by_2_copy()
[all …]
H A Diterator-modeling.cpp824 auto i0 = L.cbegin(), i1 = ++L.cbegin(), i2 = L.cend(); in list_pop_front()
843 auto i0 = D.cbegin(), i1 = ++D.cbegin(), i2 = D.cend(); in deque_pop_front()
906 auto i0 = L.cbegin(), i1 = ++L.cbegin(), i2 = L.cend(); in list_insert_behind_begin()
999 auto i0 = V.cbegin(), i1 = ++V.cbegin(), i2 = V.cend(); in vector_insert_behind_begin()
1082 auto i0 = D.cbegin(), i1 = ++D.cbegin(), i2 = D.cend(); in deque_insert_behind_begin()
1234 auto i0 = L.cbegin(), i1 = ++L.cbegin(), i2 = L.cend(); in list_emplace_behind_begin()
1326 auto i0 = V.cbegin(), i1 = ++V.cbegin(), i2 = V.cend(); in vector_emplace_behind_begin()
1408 auto i0 = D.cbegin(), i1 = ++D.cbegin(), i2 = D.cend(); in deque_emplace_behind_begin()
1545 auto i0 = L.cbegin(), i1 = ++L.cbegin(), i2 = L.cend(); in list_erase_begin()
1562 auto i0 = L.cbegin(), i1 = ++L.cbegin(), i2 = L.cend(); in list_erase_behind_begin()
[all …]
H A Dcontainer-modeling.cpp44 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 …]
/llvm-project-15.0.7/libcxx/test/std/containers/sequences/list/list.modifiers/
H A Derase_iter_iter.pass.cpp24 std::list<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
26 assert(std::distance(l1.cbegin(), l1.cend()) == 3); in main()
31 std::list<int>::iterator i = l1.erase(l1.cbegin(), std::next(l1.cbegin())); in main()
33 assert(std::distance(l1.cbegin(), l1.cend()) == 2); in main()
39 std::list<int>::iterator i = l1.erase(l1.cbegin(), std::next(l1.cbegin(), 2)); in main()
41 assert(std::distance(l1.cbegin(), l1.cend()) == 1); in main()
47 std::list<int>::iterator i = l1.erase(l1.cbegin(), std::next(l1.cbegin(), 3)); in main()
55 std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in main()
62 … std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), std::next(l1.cbegin())); in main()
70 … std::list<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), std::next(l1.cbegin(), 2)); in main()
[all …]
/llvm-project-15.0.7/libcxx/test/std/containers/sequences/vector.bool/
H A Derase_iter_iter.pass.cpp26 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in tests()
28 assert(std::distance(l1.cbegin(), l1.cend()) == 3); in tests()
33 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), std::next(l1.cbegin())); in tests()
35 assert(std::distance(l1.cbegin(), l1.cend()) == 2); in tests()
41 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), std::next(l1.cbegin(), 2)); in tests()
43 assert(std::distance(l1.cbegin(), l1.cend()) == 1); in tests()
49 std::vector<bool>::iterator i = l1.erase(l1.cbegin(), std::next(l1.cbegin(), 3)); in tests()
57 std::vector<bool, min_allocator<bool>>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in tests()
64 …std::vector<bool, min_allocator<bool>>::iterator i = l1.erase(l1.cbegin(), std::next(l1.cbegin())); in tests()
72 …::vector<bool, min_allocator<bool>>::iterator i = l1.erase(l1.cbegin(), std::next(l1.cbegin(), 2)); in tests()
[all …]
/llvm-project-15.0.7/libcxx/test/libcxx/strings/basic.string/string.modifiers/
H A Ddebug.erase.iter_iter.pass.cpp29 l1.erase(l2.cbegin(), l1.cbegin() + 1), in main()
36 TEST_LIBCPP_ASSERT_FAILURE(l1.erase(l2.cbegin(), l1.cbegin() + 1), in main()
46 …TEST_LIBCPP_ASSERT_FAILURE(l1.erase(l1.cbegin(), l2.cbegin() + 1), "Attempted to compare incompara… in main()
52 …TEST_LIBCPP_ASSERT_FAILURE(l1.erase(l1.cbegin(), l2.cbegin() + 1), "Attempted to compare incompara… in main()
62 l1.erase(l2.cbegin(), l2.cbegin() + 1), in main()
70 l1.erase(l2.cbegin(), l2.cbegin() + 1), in main()
79 TEST_LIBCPP_ASSERT_FAILURE(l1.erase(l1.cbegin() + 1, l1.cbegin()), in main()
85 TEST_LIBCPP_ASSERT_FAILURE(l1.erase(l1.cbegin() + 1, l1.cbegin()), in main()
/llvm-project-15.0.7/libcxx/test/std/containers/sequences/vector/vector.modifiers/
H A Derase_iter_iter.pass.cpp42 std::vector<int>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in tests()
44 assert(std::distance(l1.cbegin(), l1.cend()) == 3); in tests()
51 std::vector<int>::iterator i = l1.erase(l1.cbegin(), std::next(l1.cbegin())); in tests()
53 assert(std::distance(l1.cbegin(), l1.cend()) == 2); in tests()
61 std::vector<int>::iterator i = l1.erase(l1.cbegin(), std::next(l1.cbegin(), 2)); in tests()
63 assert(std::distance(l1.cbegin(), l1.cend()) == 1); in tests()
71 std::vector<int>::iterator i = l1.erase(l1.cbegin(), std::next(l1.cbegin(), 3)); in tests()
94 std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), l1.cbegin()); in tests()
103 … std::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), std::next(l1.cbegin())); in tests()
113 …td::vector<int, min_allocator<int>>::iterator i = l1.erase(l1.cbegin(), std::next(l1.cbegin(), 2)); in tests()
[all …]
/llvm-project-15.0.7/libcxx/test/std/containers/associative/multiset/
H A Derase_iter_iter.pass.cpp40 I i = m.erase(std::next(m.cbegin(), 5), std::next(m.cbegin(), 5)); in main()
52 i = m.erase(std::next(m.cbegin(), 3), std::next(m.cbegin(), 4)); in main()
63 i = m.erase(std::next(m.cbegin(), 2), std::next(m.cbegin(), 5)); in main()
71 i = m.erase(std::next(m.cbegin(), 0), std::next(m.cbegin(), 2)); in main()
77 i = m.erase(m.cbegin(), m.cend()); in main()
99 I i = m.erase(std::next(m.cbegin(), 5), std::next(m.cbegin(), 5)); in main()
111 i = m.erase(std::next(m.cbegin(), 3), std::next(m.cbegin(), 4)); in main()
122 i = m.erase(std::next(m.cbegin(), 2), std::next(m.cbegin(), 5)); in main()
130 i = m.erase(std::next(m.cbegin(), 0), std::next(m.cbegin(), 2)); in main()
136 i = m.erase(m.cbegin(), m.cend()); in main()
H A Derase_iter.pass.cpp48 I i = m.erase(std::next(m.cbegin(), 3)); in main()
59 i = m.erase(std::next(m.cbegin(), 0)); in main()
69 i = m.erase(std::next(m.cbegin(), 5)); in main()
78 i = m.erase(std::next(m.cbegin(), 1)); in main()
86 i = m.erase(std::next(m.cbegin(), 2)); in main()
93 i = m.erase(std::next(m.cbegin(), 2)); in main()
99 i = m.erase(std::next(m.cbegin(), 0)); in main()
104 i = m.erase(m.cbegin()); in main()
138 i = m.erase(std::next(m.cbegin(), 0)); in main()
148 i = m.erase(std::next(m.cbegin(), 5)); in main()
[all …]
/llvm-project-15.0.7/libcxx/test/std/containers/associative/set/
H A Derase_iter_iter.pass.cpp40 I i = m.erase(std::next(m.cbegin(), 5), std::next(m.cbegin(), 5)); in main()
52 i = m.erase(std::next(m.cbegin(), 3), std::next(m.cbegin(), 4)); in main()
63 i = m.erase(std::next(m.cbegin(), 2), std::next(m.cbegin(), 5)); in main()
71 i = m.erase(std::next(m.cbegin(), 0), std::next(m.cbegin(), 2)); in main()
77 i = m.erase(m.cbegin(), m.cend()); in main()
99 I i = m.erase(std::next(m.cbegin(), 5), std::next(m.cbegin(), 5)); in main()
111 i = m.erase(std::next(m.cbegin(), 3), std::next(m.cbegin(), 4)); in main()
122 i = m.erase(std::next(m.cbegin(), 2), std::next(m.cbegin(), 5)); in main()
130 i = m.erase(std::next(m.cbegin(), 0), std::next(m.cbegin(), 2)); in main()
136 i = m.erase(m.cbegin(), m.cend()); in main()
H A Derase_iter.pass.cpp48 I i = m.erase(std::next(m.cbegin(), 3)); in main()
59 i = m.erase(std::next(m.cbegin(), 0)); in main()
69 i = m.erase(std::next(m.cbegin(), 5)); in main()
78 i = m.erase(std::next(m.cbegin(), 1)); in main()
86 i = m.erase(std::next(m.cbegin(), 2)); in main()
93 i = m.erase(std::next(m.cbegin(), 2)); in main()
99 i = m.erase(std::next(m.cbegin(), 0)); in main()
104 i = m.erase(m.cbegin()); in main()
138 i = m.erase(std::next(m.cbegin(), 0)); in main()
148 i = m.erase(std::next(m.cbegin(), 5)); in main()
[all …]
/llvm-project-15.0.7/libcxx/test/std/ranges/range.access/
H A Dbegin.pass.cpp98 assert(std::ranges::cbegin(a) == a); in testArray()
102 assert(std::ranges::cbegin(b) == b); in testArray()
106 assert(std::ranges::cbegin(c) == c); in testArray()
163 assert(std::ranges::cbegin(a) == &a.x); in testBeginMember()
179 assert(std::ranges::cbegin(d) == &d.x); in testBeginMember()
183 assert(std::ranges::cbegin(e) == &e.x); in testBeginMember()
249 assert(std::ranges::cbegin(a) == &a.x); in testBeginFunction()
251 assert(std::ranges::cbegin(aa) == &aa.x); in testBeginFunction()
270 assert(std::ranges::cbegin(d) == &d.x); in testBeginFunction()
278 assert(std::ranges::cbegin(e) == &e.x); in testBeginFunction()
[all …]
/llvm-project-15.0.7/libcxx/test/libcxx/containers/sequences/list/list.modifiers/
H A Ddebug.erase.iter_iter.pass.cpp26 TEST_LIBCPP_ASSERT_FAILURE(l1.erase(l2.cbegin(), std::next(l1.cbegin())), in main()
35 TEST_LIBCPP_ASSERT_FAILURE(l1.erase(l1.cbegin(), std::next(l2.cbegin())), in main()
44 TEST_LIBCPP_ASSERT_FAILURE(l1.erase(l2.cbegin(), std::next(l2.cbegin())), in main()
52 TEST_LIBCPP_ASSERT_FAILURE(l1.erase(std::next(l1.cbegin()), l1.cbegin()), in main()
/llvm-project-15.0.7/libcxx/test/libcxx/containers/unord/unord.multiset/
H A Ddebug.erase.iter_iter.pass.cpp27 l1.erase(l2.cbegin(), std::next(l1.cbegin())), in main()
37 l1.erase(l1.cbegin(), std::next(l2.cbegin())), in main()
47 l1.erase(l2.cbegin(), std::next(l2.cbegin())), in main()
55 TEST_LIBCPP_ASSERT_FAILURE(l1.erase(std::next(l1.cbegin()), l1.cbegin()), in main()
/llvm-project-15.0.7/libcxx/test/libcxx/containers/unord/unord.set/
H A Ddebug.erase.iter_iter.pass.cpp27 l1.erase(l2.cbegin(), std::next(l1.cbegin())), in main()
37 l1.erase(l1.cbegin(), std::next(l2.cbegin())), in main()
47 l1.erase(l2.cbegin(), std::next(l2.cbegin())), in main()
55 TEST_LIBCPP_ASSERT_FAILURE(l1.erase(std::next(l1.cbegin()), l1.cbegin()), in main()
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/alg.lex.comparison/
H A Dlexicographical_compare.pass.cpp57 …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()
/llvm-project-15.0.7/libcxx/test/libcxx/containers/unord/unord.map/unord.map.modifiers/
H A Ddebug.erase.iter_iter.pass.cpp28 l1.erase(l2.cbegin(), std::next(l1.cbegin())), in main()
39 l1.erase(l1.cbegin(), std::next(l2.cbegin())), in main()
50 l1.erase(l2.cbegin(), std::next(l2.cbegin())), in main()
59 TEST_LIBCPP_ASSERT_FAILURE(l1.erase(std::next(l1.cbegin()), l1.cbegin()), in main()
/llvm-project-15.0.7/libcxx/test/libcxx/containers/unord/unord.multimap/unord.multimap.modifiers/
H A Ddebug.erase.iter_iter.pass.cpp28 l1.erase(l2.cbegin(), std::next(l1.cbegin())), in main()
39 l1.erase(l1.cbegin(), std::next(l2.cbegin())), in main()
50 l1.erase(l2.cbegin(), std::next(l2.cbegin())), in main()
59 TEST_LIBCPP_ASSERT_FAILURE(l1.erase(std::next(l1.cbegin()), l1.cbegin()), in main()
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.nonmodifying/
H A Dadjacent_find.pass.cpp52 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 …]
H A Dmismatch.pass.cpp80 … 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/iterators/iterator.requirements/iterator.cust/iterator.cust.move/
H A Diter_move.pass.cpp127 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()
146 assert(std::all_of(v1.cbegin(), v1.cbegin() + half_size, move_counter_is(3))); in test()
149 assert(std::all_of(v1.cbegin(), v1.cbegin() + half_size, move_counter_is(reset))); in test()
150 assert(std::all_of(v2.cbegin(), v2.cend(), move_counter_is(4))); in test()
[all …]
/llvm-project-15.0.7/libcxx/test/std/containers/unord/unord.multiset/
H A Dlocal_iterators.pass.cpp167 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()
225 i = c.cbegin(b); in main()
233 i = c.cbegin(b); in main()
241 i = c.cbegin(b); in main()
247 i = c.cbegin(b); in main()
[all …]
/llvm-project-15.0.7/libcxx/test/std/containers/associative/multimap/multimap.modifiers/
H A Derase_iter_iter.pass.cpp40 I i = m.erase(m.cbegin(), m.cbegin()); in main()
60 i = m.erase(m.cbegin(), std::next(m.cbegin(), 2)); in main()
76 i = m.erase(std::next(m.cbegin(), 2), std::next(m.cbegin(), 6)); in main()
84 i = m.erase(m.cbegin(), m.cend()); in main()
107 I i = m.erase(m.cbegin(), m.cbegin()); in main()
127 i = m.erase(m.cbegin(), std::next(m.cbegin(), 2)); in main()
143 i = m.erase(std::next(m.cbegin(), 2), std::next(m.cbegin(), 6)); in main()
151 i = m.erase(m.cbegin(), m.cend()); in main()
/llvm-project-15.0.7/libcxx/test/std/containers/associative/map/map.modifiers/
H A Derase_iter_iter.pass.cpp40 I i = m.erase(m.cbegin(), m.cbegin()); in main()
60 i = m.erase(m.cbegin(), std::next(m.cbegin(), 2)); in main()
76 i = m.erase(std::next(m.cbegin(), 2), std::next(m.cbegin(), 6)); in main()
84 i = m.erase(m.cbegin(), m.cend()); in main()
107 I i = m.erase(m.cbegin(), m.cbegin()); in main()
127 i = m.erase(m.cbegin(), std::next(m.cbegin(), 2)); in main()
143 i = m.erase(std::next(m.cbegin(), 2), std::next(m.cbegin(), 6)); in main()
151 i = m.erase(m.cbegin(), m.cend()); in main()

12345678910>>...14