| /llvm-project-15.0.7/libcxx/test/std/algorithms/ |
| H A D | robust_against_adl.compile.pass.cpp | 44 Holder<Incomplete> **first2 = u.data; in all_the_algorithms() local
62 (void)std::copy(first, last, first2); in all_the_algorithms()
64 (void)std::copy_n(first, count, first2); in all_the_algorithms()
68 (void)std::equal(first, last, first2); in all_the_algorithms()
71 (void)std::equal(first, last, first2, last2); in all_the_algorithms()
79 (void)std::find_end(first, last, first2, mid2); in all_the_algorithms()
142 (void)std::mismatch(first, last, first2); in all_the_algorithms()
148 (void)std::move(first, last, first2); in all_the_algorithms()
179 (void)std::reverse_copy(first, last, first2); in all_the_algorithms()
182 (void)std::search(first, last, first2, mid2); in all_the_algorithms()
[all …]
|
| H A D | robust_re_difference_type.compile.pass.cpp | 99 (void)std::copy(first, last, first2); in all_the_algorithms()
101 (void)std::copy_n(first, count, first2); in all_the_algorithms()
105 (void)std::equal(first, last, first2); in all_the_algorithms()
108 (void)std::equal(first, last, first2, last2); in all_the_algorithms()
116 (void)std::find_end(first, last, first2, mid2); in all_the_algorithms()
179 (void)std::mismatch(first, last, first2); in all_the_algorithms()
185 (void)std::move(first, last, first2); in all_the_algorithms()
214 (void)std::reverse_copy(first, last, first2); in all_the_algorithms()
217 (void)std::search(first, last, first2, mid2); in all_the_algorithms()
240 (void)std::swap_ranges(first, last, first2); in all_the_algorithms()
[all …]
|
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.modifying.operations/ |
| H A D | unique.pass.cpp | 28 …perator()(pstl::execution::unsequenced_policy, ForwardIt first1, ForwardIt last1, ForwardIt first2, in operator ()()
35 …(pstl::execution::parallel_unsequenced_policy, ForwardIt first1, ForwardIt last1, ForwardIt first2, in operator ()()
42 …perator()(pstl::execution::unsequenced_policy, ForwardIt first1, ForwardIt last1, ForwardIt first2, in operator ()()
63 fill_data(first2, last2, generator); in operator ()()
66 ForwardIt k = unique(exec, first2, last2); in operator ()()
69 … EXPECT_TRUE(std::distance(first2, k) == n, "wrong return value from unique without predicate"); in operator ()()
70 EXPECT_EQ_N(first1, first2, n, "wrong effect from unique without predicate"); in operator ()()
82 fill_data(first2, last2, generator); in operator ()()
85 ForwardIt k = unique(exec, first2, last2, pred); in operator ()()
88 EXPECT_TRUE(std::distance(first2, k) == n, "wrong return value from unique with predicate"); in operator ()()
[all …]
|
| H A D | transform_binary.pass.cpp | 37 check_and_reset(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, OutputIterator … in check_and_reset() argument
41 for (; first1 != last1; ++first1, ++first2, ++out_first, ++k) in check_and_reset()
44 Out expected = Out(1.5) + *first1 - *first2; in check_and_reset()
65 …operator()(Policy&& exec, InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, Inpu… in operator ()()
68 auto result = std::transform(exec, first1, last1, first2, out_first, op); in operator ()()
70 check_and_reset(first1, last1, first2, out_first); in operator ()()
|
| /llvm-project-15.0.7/libcxx/test/libcxx/algorithms/ |
| H A D | robust_against_copying_comparators.pass.cpp | 99 T *first2 = b; in all_the_algorithms() local
116 (void)std::copy_if(first, last, first2, UnaryTrue<T>(&copies)); assert(copies == 0); in all_the_algorithms()
117 (void)std::equal(first, last, first2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
119 (void)std::equal(first, last, first2, last2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
122 (void)std::find_end(first, last, first2, mid2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
132 (void)std::includes(first, last, first2, last2, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
136 (void)std::is_permutation(first, last, first2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
154 (void)std::merge(first, mid, mid, last, first2, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
165 (void)std::mismatch(first, last, first2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
186 (void)std::search(first, last, first2, mid2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| H A D | ranges_robust_against_copying_comparators.pass.cpp | 86 void **first2 = b; in all_the_algorithms() local
104 (void)std::ranges::copy_if(first, last, first2, UnaryTrue(&copies)); assert(copies == 0); in all_the_algorithms()
105 (void)std::ranges::copy_if(a, first2, UnaryTrue(&copies)); assert(copies == 0); in all_the_algorithms()
109 (void)std::ranges::equal(first, last, first2, last2, Equal(&copies)); assert(copies == 0); in all_the_algorithms()
191 (void)std::ranges::remove_copy_if(a, first2, UnaryTrue(&copies)); assert(copies == 0); in all_the_algorithms()
203 (void)std::ranges::set_difference(a, b, first2, Less(&copies)); assert(copies == 0); in all_the_algorithms()
205 (void)std::ranges::set_intersection(a, b, first2, Less(&copies)); assert(copies == 0); in all_the_algorithms()
209 (void)std::ranges::set_union(a, b, first2, Less(&copies)); assert(copies == 0); in all_the_algorithms()
222 (void)std::ranges::transform(a, first2, UnaryTransform(&copies)); assert(copies == 0); in all_the_algorithms()
227 (void)std::ranges::unique_copy(first, last, first2, Equal(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| H A D | ranges_robust_against_copying_projections.pass.cpp | 68 T *first2 = b; in all_the_algorithms() local
88 … (void)std::ranges::copy_if(first, last, first2, UnaryTrue(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
89 (void)std::ranges::copy_if(a, first2, UnaryTrue(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
173 (void)std::ranges::remove_copy(first, last, first2, value, Proj(&copies)); assert(copies == 0); in all_the_algorithms()
174 (void)std::ranges::remove_copy(a, first2, value, Proj(&copies)); assert(copies == 0); in all_the_algorithms()
176 (void)std::ranges::remove_copy_if(a, first2, UnaryTrue(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
182 (void)std::ranges::replace_copy(a, first2, value, T(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
184 …(void)std::ranges::replace_copy_if(a, first2, UnaryTrue(), T(), Proj(&copies)); assert(copies == 0… in all_the_algorithms()
213 (void)std::ranges::transform(a, first2, UnaryTransform(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
218 … (void)std::ranges::unique_copy(first, last, first2, Equal(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/alg.set.operations/ |
| H A D | set.pass.cpp | 65 auto n2 = std::distance(first2, last2); in operator ()()
70 auto expect_res = std::set_union(first1, last1, first2, last2, expect.begin(), comp); in operator ()()
71 auto res = std::set_union(exec, first1, last1, first2, last2, out.begin(), comp); in operator ()()
95 auto n2 = std::distance(first2, last2); in operator ()()
100 auto expect_res = std::set_intersection(first1, last1, first2, last2, expect.begin(), comp); in operator ()()
101 auto res = std::set_intersection(exec, first1, last1, first2, last2, out.begin(), comp); in operator ()()
125 auto n2 = std::distance(first2, last2); in operator ()()
130 auto expect_res = std::set_difference(first1, last1, first2, last2, expect.begin(), comp); in operator ()()
131 auto res = std::set_difference(exec, first1, last1, first2, last2, out.begin(), comp); in operator ()()
155 auto n2 = std::distance(first2, last2); in operator ()()
[all …]
|
| H A D | includes.pass.cpp | 49 …operator()(Policy&& exec, InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, Inpu… in operator ()()
53 auto expect_res = std::includes(first1, last1, first2, last2, comp); in operator ()()
54 auto res = std::includes(exec, first1, last1, first2, last2, comp); in operator ()()
|
| /llvm-project-15.0.7/libcxx/test/libcxx/fuzzing/ |
| H A D | fuzz.h | 68 bool fast_is_permutation(Iter1 first1, Iter1 last1, Iter2 first2) { in fast_is_permutation() argument
74 for (; first1 != last1; ++first1, ++first2) { in fast_is_permutation()
78 yBuckets[first2->key]++; in fast_is_permutation()
79 yPayloads[first2->key] += first2->payload; in fast_is_permutation()
96 bool fast_is_permutation(Iter1 first1, Iter1 last1, Iter2 first2) { in fast_is_permutation() argument
100 for (; first1 != last1; ++first1, ++first2) { in fast_is_permutation()
102 yBuckets[*first2]++; in fast_is_permutation()
|
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.nonmodifying/ |
| H A D | mismatch.pass.cpp | 25 operator()(Policy&& exec, Iterator1 first1, Iterator1 last1, Iterator2 first2) in operator ()()
30 const auto expected = std::mismatch(first1, last1, first2, std::equal_to<T>()); in operator ()()
31 const auto res3 = mismatch(exec, first1, last1, first2, std::equal_to<T>()); in operator ()()
33 const auto res4 = mismatch(exec, first1, last1, first2); in operator ()()
39 operator()(Policy&& exec, Iterator1 first1, Iterator1 last1, Iterator2 first2, Iterator2 last2) in operator ()()
44 …const auto expected = mismatch(std::execution::seq, first1, last1, first2, last2, std::equal_to<T>… in operator ()()
45 const auto res1 = mismatch(exec, first1, last1, first2, last2, std::equal_to<T>()); in operator ()()
47 const auto res2 = mismatch(exec, first1, last1, first2, last2); in operator ()()
|
| H A D | nth_element.pass.cpp | 75 …perator()(pstl::execution::unsequenced_policy, Iterator1 first1, Iterator1 last1, Iterator1 first2, in operator ()()
81 …(pstl::execution::parallel_unsequenced_policy, Iterator1 first1, Iterator1 last1, Iterator1 first2, in operator ()()
91 …operator()(Policy&& exec, Iterator1 first1, Iterator1 last1, Iterator1 first2, Iterator1 last2, Si… in operator ()()
97 const Iterator1 mid2 = std::next(first2, m); in operator ()()
101 fill_data(first2, mid2, generator1); in operator ()()
104 std::nth_element(exec, first2, mid2, last2, comp); in operator ()()
109 …EXPECT_TRUE(std::find_first_of(first2, mid2, mid2, last2, [comp](T& x, T& y) { return comp(y, x); … in operator ()()
|
| H A D | equal.pass.cpp | 100 …operator()(ExecutionPolicy&& exec, Iterator1 first1, Iterator1 last1, Iterator2 first2, bool is_tr… in operator ()()
104 auto expected = equal(first1, last1, first2); in operator ()()
105 auto actual = equal(exec, first1, last1, first2); in operator ()()
|
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.merge/ |
| H A D | merge.pass.cpp | 27 …operator()(Policy&& exec, InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, Inpu… in operator ()()
32 const auto res = merge(exec, first1, last1, first2, last2, out_first, comp); in operator ()()
36 …EXPECT_TRUE(includes(out_first, res, first2, last2, comp), "second sequence is not a part of resul… in operator ()()
39 const auto res = merge(exec, first1, last1, first2, last2, out_first); in operator ()()
50 … std::reverse_iterator<InputIterator2> first2, std::reverse_iterator<InputIterator2> last2, in operator ()()
55 const auto res = merge(exec, first1, last1, first2, last2, out_first, std::greater<T>()); in operator ()()
61 EXPECT_TRUE(includes(out_first, res, first2, last2, std::greater<T>()), in operator ()()
|
| H A D | inplace_merge.pass.cpp | 27 …l::execution::unsequenced_policy, BiDirIt1 first1, BiDirIt1 last1, BiDirIt1 first2, BiDirIt1 last2, in operator ()()
34 …r()(pstl::execution::parallel_unsequenced_policy, BiDirIt1 first1, BiDirIt1 last1, BiDirIt1 first2, in operator ()()
44 …operator()(Policy&& exec, BiDirIt1 first1, BiDirIt1 last1, BiDirIt1 first2, BiDirIt1 last2, Size n… in operator ()()
51 const BiDirIt1 mid2 = std::next(first2, m); in operator ()()
52 fill_data(first2, mid2, generator1); in operator ()()
56 std::inplace_merge(exec, first2, mid2, last2, comp); in operator ()()
57 EXPECT_EQ_N(first1, first2, n, "wrong effect from inplace_merge with predicate"); in operator ()()
|
| /llvm-project-15.0.7/libcxx/test/std/numerics/numeric.ops/transform.reduce/ |
| H A D | transform_reduce_iter_iter_iter_init.pass.cpp | 29 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, T x) in test() argument
32 decltype(std::transform_reduce(first1, last1, first2, init))> ); in test()
33 assert(std::transform_reduce(first1, last1, first2, init) == x); in test()
|
| H A D | transform_reduce_iter_iter_iter_init_op_op.pass.cpp | 31 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, Op1 op1, Op2 op2, T x) in test() argument
34 decltype(std::transform_reduce(first1, last1, first2, init, op1, op2))> ); in test()
35 assert(std::transform_reduce(first1, last1, first2, init, op1, op2) == x); in test()
|
| /llvm-project-15.0.7/pstl/test/std/utilities/memory/specialized.algorithms/ |
| H A D | uninitialized_copy_move.pass.cpp | 26 IsCheckValueCorrectness(InputIterator first1, OutputIterator first2, Size n) in IsCheckValueCorrectness() argument
28 for (Size i = 0; i < n; ++i, ++first1, ++first2) in IsCheckValueCorrectness()
30 if (*first1 != *first2) in IsCheckValueCorrectness()
|
| /llvm-project-15.0.7/pstl/test/std/numerics/numeric.ops/ |
| H A D | transform_reduce.pass.cpp | 82 …operator()(Policy&& exec, InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, Inpu… in operator ()()
86 auto expectedB = std::inner_product(first1, last1, first2, init, opB1, opB2); in operator ()()
88 T resRA = std::transform_reduce(exec, first1, last1, first2, init, opB1, opB2); in operator ()()
|
| /llvm-project-15.0.7/libcxx/include/ |
| H A D | algorithm | 154 transform(I1 first1, S1 last1, I2 first2, S2 last2, O result,
673 merge(I1 first1, S1 last1, I2 first2, S2 last2, O result,
1090 ForwardIterator2 first2, ForwardIterator2 last2);
1135 InputIterator2 first2, BinaryPredicate pred);
1140 InputIterator2 first2, InputIterator2 last2,
1155 InputIterator2 first2, BinaryPredicate pred);
1160 InputIterator2 first2, InputIterator2 last2,
1166 ForwardIterator2 first2);
1176 ForwardIterator2 first2, BinaryPredicate pred);
1187 ForwardIterator2 first2, ForwardIterator2 last2);
[all …]
|
| H A D | numeric | 41 inner_product(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, T init);
45 inner_product(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2,
52 InputIterator2 first2, T init); // C++17
57 InputIterator2 first2, T init,
|
| /llvm-project-15.0.7/llvm/test/Transforms/InstSimplify/ |
| H A D | ptr_diff.ll | 21 %first2 = getelementptr inbounds i8, ptr %ptr, i32 1
22 %first3 = getelementptr inbounds i8, ptr %first2, i32 2
24 %last1 = getelementptr inbounds i8, ptr %first2, i32 48
|
| /llvm-project-15.0.7/libcxx/test/std/numerics/numeric.ops/inner.product/ |
| H A D | inner_product.pass.cpp | 30 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, T x) in test() argument
32 assert(std::inner_product(first1, last1, first2, init) == x); in test()
|
| H A D | inner_product_comp.pass.cpp | 94 test(Iter1 first1, Iter1 last1, Iter2 first2, T init, T x) in test() argument
96 assert(std::inner_product(first1, last1, first2, init, in test()
|
| /llvm-project-15.0.7/clang-tools-extra/test/clang-tidy/checkers/bugprone/ |
| H A D | fold-init-type.cpp | 18 InputIt2 first2, T value);
22 InputIt2 first2, T value);
|