Home
last modified time | relevance | path

Searched refs:first1 (Results 1 – 25 of 41) sorted by relevance

12

/llvm-project-15.0.7/pstl/test/std/algorithms/alg.modifying.operations/
H A Dunique.pass.cpp28 …operator()(pstl::execution::unsequenced_policy, ForwardIt first1, ForwardIt last1, ForwardIt first… in operator ()()
35 …operator()(pstl::execution::parallel_unsequenced_policy, ForwardIt first1, ForwardIt last1, Forwar… in operator ()()
42 …operator()(pstl::execution::unsequenced_policy, ForwardIt first1, ForwardIt last1, ForwardIt first… in operator ()()
62 fill_data(first1, last1, generator); in operator ()()
65 ForwardIt i = unique(first1, last1); in operator ()()
68 auto n = std::distance(first1, i); in operator ()()
70 EXPECT_EQ_N(first1, first2, n, "wrong effect from unique without predicate"); in operator ()()
81 fill_data(first1, last1, generator); in operator ()()
84 ForwardIt i = unique(first1, last1, pred); in operator ()()
87 auto n = std::distance(first1, i); in operator ()()
[all …]
H A Dtransform_binary.pass.cpp37 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/fuzzing/
H A Dfuzz.h68 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()
75 xBuckets[first1->key]++; in fast_is_permutation()
76 xPayloads[first1->key] += first1->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()
101 xBuckets[*first1]++; in fast_is_permutation()
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/alg.set.operations/
H A Dset.pass.cpp64 auto n1 = std::distance(first1, last1); 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 ()()
94 auto n1 = std::distance(first1, last1); 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 ()()
124 auto n1 = std::distance(first1, last1); 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 ()()
154 auto n1 = std::distance(first1, last1); in operator ()()
[all …]
H A Dincludes.pass.cpp49 …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/pstl/test/std/algorithms/alg.nonmodifying/
H A Dmismatch.pass.cpp25 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 Dnth_element.pass.cpp75 …operator()(pstl::execution::unsequenced_policy, Iterator1 first1, Iterator1 last1, Iterator1 first… in operator ()()
81 …operator()(pstl::execution::parallel_unsequenced_policy, Iterator1 first1, Iterator1 last1, Iterat… in operator ()()
91 …operator()(Policy&& exec, Iterator1 first1, Iterator1 last1, Iterator1 first2, Iterator1 last2, Si… in operator ()()
96 const Iterator1 mid1 = std::next(first1, m); in operator ()()
99 fill_data(first1, mid1, generator1); in operator ()()
103 std::nth_element(first1, mid1, last1, comp); in operator ()()
H A Dequal.pass.cpp100 …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 Dmerge.pass.cpp27 …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 ()()
35 …EXPECT_TRUE(includes(out_first, res, first1, last1, comp), "first sequence is not a part of result… in operator ()()
39 const auto res = merge(exec, first1, last1, first2, last2, out_first); in operator ()()
49 …operator()(Policy&& exec, std::reverse_iterator<InputIterator1> first1, std::reverse_iterator<Inpu… in operator ()()
55 const auto res = merge(exec, first1, last1, first2, last2, out_first, std::greater<T>()); in operator ()()
59 EXPECT_TRUE(includes(out_first, res, first1, last1, std::greater<T>()), in operator ()()
H A Dinplace_merge.pass.cpp27 …operator()(pstl::execution::unsequenced_policy, BiDirIt1 first1, BiDirIt1 last1, BiDirIt1 first2, … in operator ()()
34 …operator()(pstl::execution::parallel_unsequenced_policy, BiDirIt1 first1, BiDirIt1 last1, BiDirIt1… in operator ()()
44 …operator()(Policy&& exec, BiDirIt1 first1, BiDirIt1 last1, BiDirIt1 first2, BiDirIt1 last2, Size n… in operator ()()
47 const BiDirIt1 mid1 = std::next(first1, m); in operator ()()
48 fill_data(first1, mid1, generator1); in operator ()()
55 std::inplace_merge(first1, mid1, last1, comp); in operator ()()
57 EXPECT_EQ_N(first1, first2, n, "wrong effect from inplace_merge with predicate"); in operator ()()
/llvm-project-15.0.7/pstl/test/std/numerics/numeric.ops/
H A Dtransform_reduce.pass.cpp82 …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 ()()
87 auto expectedU = transform_reduce_serial(first1, last1, init, opB1, opU); in operator ()()
88 T resRA = std::transform_reduce(exec, first1, last1, first2, init, opB1, opB2); in operator ()()
90 resRA = std::transform_reduce(exec, first1, last1, init, opB1, opU); in operator ()()
/llvm-project-15.0.7/libcxx/test/std/numerics/numeric.ops/transform.reduce/
H A Dtransform_reduce_iter_iter_iter_init.pass.cpp29 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 Dtransform_reduce_iter_iter_iter_init_op_op.pass.cpp31 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()
H A Dtransform_reduce_iter_iter_init_bop_uop.pass.cpp47 test(Iter1 first1, Iter1 last1, T init, BOp bOp, UOp uOp, T x) in test() argument
50 decltype(std::transform_reduce(first1, last1, init, bOp, uOp))> ); in test()
51 assert(std::transform_reduce(first1, last1, init, bOp, uOp) == x); in test()
/llvm-project-15.0.7/pstl/test/std/utilities/memory/specialized.algorithms/
H A Duninitialized_copy_move.pass.cpp26 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/libcxx/include/
H A Dalgorithm1129 mismatch(InputIterator1 first1, InputIterator1 last1,
1134 mismatch(InputIterator1 first1, InputIterator1 last1,
1139 mismatch(InputIterator1 first1, InputIterator1 last1,
1149 equal(InputIterator1 first1, InputIterator1 last1,
1154 equal(InputIterator1 first1, InputIterator1 last1,
1159 equal(InputIterator1 first1, InputIterator1 last1,
1186 search(ForwardIterator1 first1, ForwardIterator1 last1,
1488 merge(InputIterator1 first1, InputIterator1 last1,
1493 merge(InputIterator1 first1, InputIterator1 last1,
1514 set_union(InputIterator1 first1, InputIterator1 last1,
[all …]
H A Dnumeric41 inner_product(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, T init);
45 inner_product(InputIterator1 first1, InputIterator1 last1, InputIterator2 first2,
51 transform_reduce(InputIterator1 first1, InputIterator1 last1,
56 transform_reduce(InputIterator1 first1, InputIterator1 last1,
/llvm-project-15.0.7/libcxx/test/std/numerics/numeric.ops/inner.product/
H A Dinner_product.pass.cpp30 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 Dinner_product_comp.pass.cpp94 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/llvm/test/Transforms/MergeICmps/
H A Dpair-int32-int32.ll31 %first1.i = getelementptr inbounds %"struct.std::pair", %"struct.std::pair"* %b, i64 0, i32 0
32 %1 = load i32, i32* %first1.i, align 4
75 %first1.i = getelementptr inbounds %"struct.std::pair", %"struct.std::pair"* %b, i64 0, i32 1
76 %1 = load i32, i32* %first1.i, align 4
/llvm-project-15.0.7/llvm/test/CodeGen/PowerPC/
H A Dmemcmp-mergeexpand.ll22 %first1.i = getelementptr inbounds %"struct.std::pair", %"struct.std::pair"* %b, i64 0, i32 0
23 %1 = load i32, i32* %first1.i, align 4
/llvm-project-15.0.7/llvm/test/Transforms/MergeICmps/X86/
H A Dsplit-block-does-work.ll29 %first1.i = getelementptr inbounds %S, %S* %b, i64 0, i32 0
30 %1 = load i32, i32* %first1.i, align 4
108 %first1.i = getelementptr inbounds %S, %S* %b, i64 0, i32 0
109 %1 = load i32, i32* %first1.i, align 4
166 %first1.i = getelementptr inbounds %S, %S* %b, i64 0, i32 0
167 %1 = load i32, i32* %first1.i, align 4
229 %first1.i = getelementptr inbounds %S, %S* %b, i64 0, i32 0
230 %1 = load i32, i32* %first1.i, align 4
H A Datomic.ll31 %first1.i = getelementptr inbounds %S, %S* %b, i64 0, i32 0
32 %1 = load i32, i32* %first1.i, align 4
H A Dvolatile.ll31 %first1.i = getelementptr inbounds %S, %S* %b, i64 0, i32 0
32 %1 = load i32, i32* %first1.i, align 4
/llvm-project-15.0.7/clang-tools-extra/test/clang-tidy/checkers/bugprone/
H A Dfold-init-type.cpp17 T inner_product(InputIt1 first1, InputIt1 last1,
21 T inner_product(ExecutionPolicy &&policy, InputIt1 first1, InputIt1 last1,

12