Home
last modified time | relevance | path

Searched refs:last2 (Results 1 – 25 of 29) sorted by relevance

12

/llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/alg.set.operations/
H A Dset.pass.cpp65 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 Dincludes.pass.cpp49 …y&& exec, InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, 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.modifying.operations/
H A Dunique.pass.cpp29 ForwardIt last2, Generator generator) in operator ()()
36 ForwardIt last2, Generator generator) in operator ()()
43 ForwardIt last2, BinaryPred pred, Generator generator) in operator ()()
50 ForwardIt last2, BinaryPred pred, Generator generator) in operator ()()
57 …operator()(Policy&& exec, ForwardIt first1, ForwardIt last1, ForwardIt first2, ForwardIt last2, Ge… in operator ()()
63 fill_data(first2, last2, generator); in operator ()()
66 ForwardIt k = unique(exec, first2, last2); in operator ()()
75 …operator()(Policy&& exec, ForwardIt first1, ForwardIt last1, ForwardIt first2, ForwardIt last2, Bi… in operator ()()
82 fill_data(first2, last2, generator); in operator ()()
85 ForwardIt k = unique(exec, first2, last2, pred); in operator ()()
/llvm-project-15.0.7/libcxx/test/std/algorithms/
H A Drobust_against_adl.compile.pass.cpp46 Holder<Incomplete> **last2 = u.data+10; in all_the_algorithms() local
63 (void)std::copy_backward(first, last, last2); in all_the_algorithms()
71 (void)std::equal(first, last, first2, last2); in all_the_algorithms()
72 (void)std::equal(first, last, first2, last2, std::equal_to<void*>()); in all_the_algorithms()
89 (void)std::includes(first, last, first2, last2); in all_the_algorithms()
90 (void)std::includes(first, last, first2, last2, std::less<void*>()); in all_the_algorithms()
99 (void)std::is_permutation(first, last, first2, last2); in all_the_algorithms()
109 (void)std::lexicographical_compare(first, last, first2, last2); in all_the_algorithms()
145 (void)std::mismatch(first, last, first2, last2); in all_the_algorithms()
149 (void)std::move_backward(first, last, last2); in all_the_algorithms()
[all …]
H A Drobust_re_difference_type.compile.pass.cpp83 auto last2 = PickyIterator<void**, long long>(b+10); in all_the_algorithms() local
100 (void)std::copy_backward(first, last, last2); in all_the_algorithms()
108 (void)std::equal(first, last, first2, last2); in all_the_algorithms()
109 (void)std::equal(first, last, first2, last2, std::equal_to<void*>()); in all_the_algorithms()
126 (void)std::includes(first, last, first2, last2); in all_the_algorithms()
127 (void)std::includes(first, last, first2, last2, std::less<void*>()); in all_the_algorithms()
136 (void)std::is_permutation(first, last, first2, last2); in all_the_algorithms()
146 (void)std::lexicographical_compare(first, last, first2, last2); in all_the_algorithms()
182 (void)std::mismatch(first, last, first2, last2); in all_the_algorithms()
186 (void)std::move_backward(first, last, last2); in all_the_algorithms()
[all …]
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.merge/
H A Dmerge.pass.cpp27 …y&& exec, InputIterator1 first1, InputIterator1 last1, InputIterator2 first2, InputIterator2 last2, 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 Dinplace_merge.pass.cpp27 …l::execution::unsequenced_policy, BiDirIt1 first1, BiDirIt1 last1, BiDirIt1 first2, BiDirIt1 last2, in operator ()()
35 … BiDirIt1 last2, Size n, Size m, Generator1 generator1, Generator2 generator2, Compare comp) in operator ()()
44 …operator()(Policy&& exec, BiDirIt1 first1, BiDirIt1 last1, BiDirIt1 first2, BiDirIt1 last2, Size n… in operator ()()
53 fill_data(mid2, last2, generator2); in operator ()()
56 std::inplace_merge(exec, first2, mid2, last2, comp); in operator ()()
/llvm-project-15.0.7/pstl/test/std/algorithms/alg.nonmodifying/
H A Dnth_element.pass.cpp76 … Iterator1 last2, Size n, Size m, Generator1 generator1, Generator2 generator2, Compare comp) in operator ()()
82 … Iterator1 last2, Size n, Size m, Generator1 generator1, Generator2 generator2, Compare comp) in operator ()()
91 …operator()(Policy&& exec, Iterator1 first1, Iterator1 last1, Iterator1 first2, Iterator1 last2, Si… in operator ()()
102 fill_data(mid2, last2, generator2); 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 Dmismatch.pass.cpp39 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 ()()
/llvm-project-15.0.7/libcxx/test/libcxx/algorithms/
H A Drobust_against_copying_comparators.pass.cpp101 T *last2 = b+10; in all_the_algorithms() local
119 (void)std::equal(first, last, first2, last2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
123 (void)std::find_first_of(first, last, first2, last2, 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()
138 (void)std::is_permutation(first, last, first2, last2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
143 …(void)std::lexicographical_compare(first, last, first2, last2, Less<T>(&copies)); assert(copies ==… in all_the_algorithms()
167 (void)std::mismatch(first, last, first2, last2, Equal<T>(&copies)); assert(copies == 0); in all_the_algorithms()
177 … (void)std::partition_copy(first, last, first2, last2, UnaryTrue<T>(&copies)); assert(copies == 0); in all_the_algorithms()
H A Dranges_robust_against_copying_comparators.pass.cpp88 void **last2 = b+10; in all_the_algorithms() local
109 (void)std::ranges::equal(first, last, first2, last2, Equal(&copies)); assert(copies == 0); in all_the_algorithms()
115 … (void)std::ranges::find_first_of(first, last, first2, last2, Equal(&copies)); assert(copies == 0); in all_the_algorithms()
127 (void)std::ranges::includes(first, last, first2, last2, Less(&copies)); assert(copies == 0); in all_the_algorithms()
135 …(void)std::ranges::is_permutation(first, last, first2, last2, Equal(&copies)); assert(copies == 0); in all_the_algorithms()
143 …(void)std::ranges::lexicographical_compare(first, last, first2, last2, Less(&copies)); assert(copi… in all_the_algorithms()
166 (void)std::ranges::mismatch(first, last, first2, last2, Equal(&copies)); assert(copies == 0); in all_the_algorithms()
180 …(void)std::ranges::partition_copy(first, last, first2, last2, UnaryTrue(&copies)); assert(copies =… in all_the_algorithms()
181 (void)std::ranges::partition_copy(a, first2, last2, UnaryTrue(&copies)); assert(copies == 0); in all_the_algorithms()
H A Dranges_robust_against_copying_projections.pass.cpp70 T *last2 = b+10; in all_the_algorithms() local
93 …(void)std::ranges::equal(first, last, first2, last2, Equal(), Proj(&copies), Proj(&copies)); asser… in all_the_algorithms()
101 …(void)std::ranges::find_first_of(first, last, first2, last2, Equal(), Proj(&copies), Proj(&copies)… in all_the_algorithms()
110 …(void)std::ranges::includes(first, last, first2, last2, Less(), Proj(&copies), Proj(&copies)); ass… in all_the_algorithms()
118 …(void)std::ranges::is_permutation(first, last, first2, last2, Equal(), Proj(&copies), Proj(&copies… in all_the_algorithms()
126 …(void)std::ranges::lexicographical_compare(first, last, first2, last2, Less(), Proj(&copies), Proj… in all_the_algorithms()
149 …(void)std::ranges::mismatch(first, last, first2, last2, Equal(), Proj(&copies), Proj(&copies)); as… in all_the_algorithms()
163 …(void)std::ranges::partition_copy(first, last, first2, last2, UnaryTrue(), Proj(&copies)); assert(… in all_the_algorithms()
164 …(void)std::ranges::partition_copy(a, first2, last2, UnaryTrue(), Proj(&copies)); assert(copies == … in all_the_algorithms()
/llvm-project-15.0.7/polly/lib/External/isl/
H A Disl_local.c186 int last1, last2; in isl_local_cmp() local
214 last2 = isl_seq_last_non_zero(mat2->row[i] + 1, n_col - 1); in isl_local_cmp()
215 if (last1 != last2) in isl_local_cmp()
216 return last1 - last2; in isl_local_cmp()
H A Disl_constraint.c1317 int last1, last2; in isl_constraint_plain_cmp() local
1330 last2 = isl_seq_last_non_zero(c2->v->el + 1, c1->v->size - 1); in isl_constraint_plain_cmp()
1331 if (last1 != last2) in isl_constraint_plain_cmp()
1332 return last1 - last2; in isl_constraint_plain_cmp()
1352 int last1, last2; in isl_constraint_cmp_last_non_zero() local
1365 last2 = isl_seq_last_non_zero(c2->v->el + 1, c1->v->size - 1); in isl_constraint_cmp_last_non_zero()
1366 if (last1 != last2) in isl_constraint_cmp_last_non_zero()
1367 return last1 - last2; in isl_constraint_cmp_last_non_zero()
1370 return isl_int_abs_cmp(c1->v->el[1 + last1], c2->v->el[1 + last2]); in isl_constraint_cmp_last_non_zero()
/llvm-project-15.0.7/libcxx/include/
H A Dalgorithm154 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);
1100 ForwardIterator2 first2, ForwardIterator2 last2);
1130 InputIterator2 first2, InputIterator2 last2); // **C++14**
1140 InputIterator2 first2, InputIterator2 last2,
1150 InputIterator2 first2, InputIterator2 last2); // **C++14**
1160 InputIterator2 first2, InputIterator2 last2,
1181 ForwardIterator2 first2, ForwardIterator2 last2,
1187 ForwardIterator2 first2, ForwardIterator2 last2);
[all …]
/llvm-project-15.0.7/llvm/test/Transforms/InstSimplify/
H A Dptr_diff.ll25 %last2 = getelementptr inbounds i8, ptr %last1, i32 8
26 %last3 = getelementptr inbounds i8, ptr %last2, i32 -4
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.lex.comparison/
H A Dranges.lexicographical_compare.pass.cpp39 concept HasLexicographicalCompareIt = requires(Iter1 first1, Sent1 last1, Iter2 first2, Sent2 last2…
40 std::ranges::lexicographical_compare(first1, last1, first2, last2);
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.is_permutation/
H A Dranges.is_permutation.pass.cpp41 concept HasIsPermutationIt = requires(Iter1 first1, Sent1 last1, Iter2 first2, Sent2 last2) {
42 std::ranges::is_permutation(first1, last1, first2, last2);
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort.copy/
H A Dranges_partial_sort_copy.pass.cpp50 requires(Iter1&& first1, Sent1&& last1, Iter2&& first2, Sent2&& last2, Comp&& comp) {
52 std::forward<Iter2>(first2), std::forward<Sent2>(last2), std::forward<Comp>(comp));
/llvm-project-15.0.7/compiler-rt/lib/tsan/rtl/
H A Dtsan_rtl_report.cpp62 const char *last2 = last_frame2->info.function; in StackStripMain() local
64 if (last2 && 0 == internal_strcmp(last2, "main")) { in StackStripMain()
78 } else if (last || last2) { in StackStripMain()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.equal/
H A Dranges.equal.pass.cpp37 concept HasEqualIt = requires (Iter1 first1, Sent1 last1, Iter2 first2, Sent2 last2) {
38 std::ranges::equal(first1, last1, first2, last2);
/llvm-project-15.0.7/compiler-rt/lib/tsan/rtl-old/
H A Dtsan_rtl_report.cpp62 const char *last2 = last_frame2->info.function; in StackStripMain() local
64 if (last2 && 0 == internal_strcmp(last2, "main")) { in StackStripMain()
78 } else if (last || last2) { in StackStripMain()
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/
H A Dranges.search.pass.cpp36 concept HasSearchIt = requires (Iter1 first1, Sent1 last1, Iter2 first2, Sent2 last2) {
37 std::ranges::search(first1, last1, first2, last2);
/llvm-project-15.0.7/libcxx/test/std/algorithms/alg.nonmodifying/alg.find.end/
H A Dranges.find_end.pass.cpp35 concept HasFindEndIt = requires (Iter1 first1, Sent1 last1, Iter2 first2, Sent2 last2) {
36 std::ranges::find_end(first1, last1, first2, last2);
/llvm-project-15.0.7/llvm/test/CodeGen/Thumb2/
H A D2010-03-08-addi12-ccout.ll16 %last2 = alloca [256 x i8], align 4 ; <[256 x i8]*> [#uses=1]
169 %scevgep666 = getelementptr [256 x i8], [256 x i8]* %last2, i32 0, i32 %tmp665 ; <i8*> [#uses=1]

12