| /llvm-project-15.0.7/libcxx/test/std/algorithms/ |
| H A D | robust_against_adl.compile.pass.cpp | 43 Holder<Incomplete> **last = t.data+10; in all_the_algorithms() local
62 (void)std::copy(first, last, first2); in all_the_algorithms()
67 (void)std::distance(first, last); in all_the_algorithms()
76 (void)std::fill(first, last, value); in all_the_algorithms()
78 (void)std::find(first, last, value); in all_the_algorithms()
91 (void)std::is_heap(first, last); in all_the_algorithms()
102 (void)std::is_sorted(first, last); in all_the_algorithms()
114 (void)std::make_heap(first, last); in all_the_algorithms()
164 (void)std::pop_heap(first, last); in all_the_algorithms()
168 (void)std::push_heap(first, last); in all_the_algorithms()
[all …]
|
| H A D | robust_re_difference_type.compile.pass.cpp | 104 (void)std::distance(first, last); in all_the_algorithms()
113 (void)std::fill(first, last, value); in all_the_algorithms()
128 (void)std::is_heap(first, last); in all_the_algorithms()
139 (void)std::is_sorted(first, last); in all_the_algorithms()
151 (void)std::make_heap(first, last); in all_the_algorithms()
199 (void)std::pop_heap(first, last); in all_the_algorithms()
203 (void)std::push_heap(first, last); in all_the_algorithms()
213 (void)std::reverse(first, last); in all_the_algorithms()
233 (void)std::sort(first, last); in all_the_algorithms()
235 (void)std::sort_heap(first, last); in all_the_algorithms()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/time/time.cal/time.cal.operators/ |
| H A D | month_day_last.pass.cpp | 49 constexpr std::chrono::last_spec last = std::chrono::last; in main() local
56 constexpr auto mdl = February/std::chrono::last; in main()
72 month_day_last mdl1 = last/m; in main()
73 month_day_last mdl2 = m/last; in main()
81 ASSERT_NOEXCEPT ( last/2); in main()
82 ASSERT_SAME_TYPE(month_day_last, decltype(last/2)); in main()
83 ASSERT_NOEXCEPT ( 2/last); in main()
86 static_assert((last/2).month() == February, ""); in main()
87 static_assert((2/last).month() == February, ""); in main()
92 month_day_last mdl1 = last/i; in main()
[all …]
|
| H A D | month_weekday_last.pass.cpp | 48 constexpr std::chrono::last_spec last = std::chrono::last; in main() local
51 ASSERT_NOEXCEPT (February/Tuesday[last]); in main()
52 ASSERT_SAME_TYPE(month_weekday_last, decltype(February/Tuesday[last])); in main()
53 ASSERT_NOEXCEPT (Tuesday[last]/February); in main()
54 ASSERT_SAME_TYPE(month_weekday_last, decltype(Tuesday[last]/February)); in main()
58 constexpr month_weekday_last wdi = February/Tuesday[last]; in main()
60 static_assert(wdi.weekday_last() == Tuesday[last], ""); in main()
67 weekday_last wdi = weekday{j}[last]; in main()
81 ASSERT_SAME_TYPE(month_weekday_last, decltype(2/Tuesday[last])); in main()
83 ASSERT_SAME_TYPE(month_weekday_last, decltype(Tuesday[last]/2)); in main()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/libcxx/algorithms/ |
| H A D | robust_against_copying_comparators.pass.cpp | 98 T *last = a+10; in all_the_algorithms() local
108 (void)std::all_of(first, last, UnaryTrue<T>(&copies)); assert(copies == 0); in all_the_algorithms()
109 (void)std::any_of(first, last, UnaryTrue<T>(&copies)); assert(copies == 0); in all_the_algorithms()
133 (void)std::is_heap(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
140 (void)std::is_sorted(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
148 (void)std::make_heap(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
179 (void)std::pop_heap(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
181 (void)std::push_heap(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
195 (void)std::sort(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
196 (void)std::sort_heap(first, last, Less<T>(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| H A D | ranges_robust_against_copying_comparators.pass.cpp | 85 void **last = a+10; in all_the_algorithms() local
95 (void)std::ranges::all_of(first, last, UnaryTrue(&copies)); assert(copies == 0); in all_the_algorithms()
97 (void)std::ranges::any_of(first, last, UnaryTrue(&copies)); assert(copies == 0); in all_the_algorithms()
129 (void)std::ranges::is_heap(first, last, Less(&copies)); assert(copies == 0); in all_the_algorithms()
137 (void)std::ranges::is_sorted(first, last, Less(&copies)); assert(copies == 0); in all_the_algorithms()
147 (void)std::ranges::make_heap(first, last, Less(&copies)); assert(copies == 0); in all_the_algorithms()
184 (void)std::ranges::pop_heap(first, last, Less(&copies)); assert(copies == 0); in all_the_algorithms()
188 (void)std::ranges::push_heap(first, last, Less(&copies)); assert(copies == 0); in all_the_algorithms()
210 (void)std::ranges::sort(first, last, Less(&copies)); assert(copies == 0); in all_the_algorithms()
212 (void)std::ranges::sort_heap(first, last, Less(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| H A D | ranges_robust_against_copying_projections.pass.cpp | 67 T *last = a+10; in all_the_algorithms() local
77 (void)std::ranges::all_of(first, last, UnaryTrue(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
79 (void)std::ranges::any_of(first, last, UnaryTrue(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
84 (void)std::ranges::count(first, last, value, Proj(&copies)); assert(copies == 0); in all_the_algorithms()
97 (void)std::ranges::find(first, last, value, Proj(&copies)); assert(copies == 0); in all_the_algorithms()
112 (void)std::ranges::is_heap(first, last, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
120 (void)std::ranges::is_sorted(first, last, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
167 (void)std::ranges::pop_heap(first, last, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
177 (void)std::ranges::remove(first, last, value, Proj(&copies)); assert(copies == 0); in all_the_algorithms()
201 (void)std::ranges::sort(first, last, Less(), Proj(&copies)); assert(copies == 0); in all_the_algorithms()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/ranges/range.utility/range.subrange/ |
| H A D | structured_bindings.pass.cpp | 26 auto [first, last] = r; in test_sized_subrange()
28 assert(last == a+4); in test_sized_subrange()
31 auto [first, last] = std::move(r); in test_sized_subrange()
33 assert(last == a+4); in test_sized_subrange()
38 assert(last == a+4); in test_sized_subrange()
43 assert(last == a+4); in test_sized_subrange()
53 auto [first, last] = r; in test_unsized_subrange()
79 auto&& [first, last] = r; in test_copies_not_originals()
83 last = a+2; in test_copies_not_originals()
89 auto&& [first, last] = r; in test_copies_not_originals()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/iterators/iterator.primitives/range.iter.ops/range.iter.ops.distance/ |
| H A D | iterator_sentinel.pass.cpp | 31 auto last = Sent(It(a)); in test_unsized() local
32 assert(std::ranges::distance(first, last) == 0); in test_unsized()
33 assert(std::ranges::distance(It(a), last) == 0); in test_unsized()
40 auto last = Sent(It(a + 3)); in test_unsized() local
41 assert(std::ranges::distance(first, last) == 3); in test_unsized()
69 auto last = Sent(It(a)); in test_sized() local
92 auto last = Sent(It(a)); in test_sized() local
101 auto last = Sent(It(a + 3)); in test_sized() local
144 StrideCounter last(a+3, nullptr); in test_stride_counting() local
153 SizedStrideCounter last(a+3, nullptr); in test_stride_counting() local
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/make.heap/ |
| H A D | ranges_make_heap.pass.cpp | 41 concept HasMakeHeapIt = requires(Iter first, Sent last, Comp comp) { std::ranges::make_heap(first, …
77 verify_heap(heapified, last, expected); in test_one()
87 verify_heap(heapified, last, expected); in test_one()
137 assert(last == in.end()); in test()
144 assert(last == in.end()); in test()
159 verify_heap(in, last, expected); in test()
165 verify_heap(in, last, expected); in test()
185 verify_heap(in, last, expected); in test()
191 verify_heap(in, last, expected); in test()
201 verify_heap(in, last, expected); in test()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/push.heap/ |
| H A D | ranges_push_heap.pass.cpp | 41 concept HasPushHeapIt = requires(Iter first, Sent last, Comp comp) { std::ranges::make_heap(first, …
81 verify_heap(heapified, last, expected); in test_one()
91 verify_heap(heapified, last, expected); in test_one()
139 assert(last == in.end()); in test()
146 assert(last == in.end()); in test()
161 verify_heap(in, last, expected); in test()
167 verify_heap(in, last, expected); in test()
187 verify_heap(in, last, expected); in test()
193 verify_heap(in, last, expected); in test()
203 verify_heap(in, last, expected); in test()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/sort.heap/ |
| H A D | ranges_sort_heap.pass.cpp | 41 concept HasSortHeapIt = requires(Iter first, Sent last, Comp comp) { std::ranges::make_heap(first, …
79 verify_sorted(sorted, last, expected); in test_one()
89 verify_sorted(sorted, last, expected); in test_one()
134 assert(last == in.data() + in.size()); in test()
141 assert(last == in.data() + in.size()); in test()
156 verify_sorted(in, last, expected); in test()
162 verify_sorted(in, last, expected); in test()
182 verify_sorted(in, last, expected); in test()
188 verify_sorted(in, last, expected); in test()
198 verify_sorted(in, last, expected); in test()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/stable.sort/ |
| H A D | ranges.stable.sort.pass.cpp | 40 …cept HasStableSortIt = requires(Iter first, Sent last, Comp comp) { std::ranges::stable_sort(first…
154 assert(last == in.end()); in test()
161 assert(last == in.end()); in test()
184 assert(last == in.end()); in test()
191 assert(last == in.end()); in test()
205 assert(last == in.end()); in test()
212 assert(last == in.end()); in test()
231 assert(last == in.end()); in test()
238 assert(last == in.end()); in test()
247 assert(last == in.end()); in test()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/pop.heap/ |
| H A D | ranges_pop_heap.pass.cpp | 41 concept HasPopHeapIt = requires(Iter first, Sent last, Comp comp) { std::ranges::make_heap(first, l…
81 verify_heap(heapified, last, expected); in test_one()
91 verify_heap(heapified, last, expected); in test_one()
134 assert(last == in.data() + in.size()); in test()
142 assert(last == in.data() + in.size()); in test()
158 verify_heap(in, last, expected); in test()
164 verify_heap(in, last, expected); in test()
184 verify_heap(in, last, expected); in test()
190 verify_heap(in, last, expected); in test()
200 verify_heap(in, last, expected); in test()
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/sort/ |
| H A D | ranges.sort.pass.cpp | 41 concept HasSortIt = requires(Iter first, Sent last, Comp comp) { std::ranges::sort(first, last, com…
71 assert(base(last) == sorted.data() + sorted.size()); in test_one()
130 assert(last == in.end()); in test()
137 assert(last == in.end()); in test()
151 assert(last == in.end()); in test()
156 auto last = std::ranges::sort(in, {}, &A::a); in test() local
158 assert(last == in.end()); in test()
177 assert(last == in.end()); in test()
184 assert(last == in.end()); in test()
193 assert(last == in.end()); in test()
[all …]
|
| /llvm-project-15.0.7/llvm/test/MC/ARM/ |
| H A D | unpred-control-flow-in-it-block.s | 4 @ an IT block, but not the last instruction in the block.
8 @ CHECK: :[[@LINE-1]]:{{[0-9]+}}: error: instruction must be outside of IT block or the last instru…
10 @ CHECK: :[[@LINE-1]]:{{[0-9]+}}: error: instruction must be outside of IT block or the last instru…
12 @ CHECK: :[[@LINE-1]]:{{[0-9]+}}: error: instruction must be outside of IT block or the last instru…
16 @ CHECK: :[[@LINE-1]]:{{[0-9]+}}: error: instruction must be outside of IT block or the last instru…
18 @ CHECK: :[[@LINE-1]]:{{[0-9]+}}: error: instruction must be outside of IT block or the last instru…
20 @ CHECK: :[[@LINE-1]]:{{[0-9]+}}: error: instruction must be outside of IT block or the last instru…
24 @ CHECK: :[[@LINE-1]]:{{[0-9]+}}: error: instruction must be outside of IT block or the last instru…
26 @ CHECK: :[[@LINE-1]]:{{[0-9]+}}: error: instruction must be outside of IT block or the last instru…
28 @ CHECK: :[[@LINE-1]]:{{[0-9]+}}: error: instruction must be outside of IT block or the last instru…
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.nth.element/ |
| H A D | ranges_nth_element.pass.cpp | 44 std::ranges::nth_element(first, nth, last, comp);
72 assert(base(last) == partially_sorted.end()); in verify_nth()
108 verify_nth(partially_sorted, nth_index, last, *expected_nth);
199 assert(last == in.end()); in test()
206 assert(last == in.end()); in test()
222 assert(last == in.end()); in test()
229 assert(last == in.end()); in test()
250 assert(last == in.end()); in test()
257 assert(last == in.end()); in test()
269 assert(last == in.end()); in test()
[all …]
|
| /llvm-project-15.0.7/pstl/test/std/utilities/memory/specialized.algorithms/ |
| H A D | uninitialized_fill_destroy.pass.cpp | 25 …operator()(Policy&& exec, Iterator first, Iterator last, const T& in, std::size_t n, std::false_ty… in operator ()()
30 uninitialized_fill(exec, first, last, in); in operator ()()
31 size_t count = count_if(first, last, [&in](T& x) -> bool { return x == in; }); in operator ()()
33 destroy(exec, first, last); in operator ()()
39 EXPECT_TRUE(res == last, "wrong result of uninitialized_fill_n"); in operator ()()
40 size_t count = count_if(first, last, [&in](T& x) -> bool { return x == in; }); in operator ()()
52 destroy(exec, first, last); in operator ()()
53 uninitialized_fill(exec, first, last, in); in operator ()()
54 size_t count = count_if(first, last, [&in](T& x) -> bool { return x == in; }); in operator ()()
60 size_t count = count_if(first, last, [&in](T& x) -> bool { return x == in; }); in operator ()()
[all …]
|
| /llvm-project-15.0.7/llvm/bindings/python/llvm/ |
| H A D | object.py | 131 last = None
140 yield last
143 last.expire()
146 last.expire()
159 last = None
168 yield last
171 last.expire()
174 last.expire()
251 last = None
260 yield last
[all …]
|
| /llvm-project-15.0.7/libcxx/include/ |
| H A D | numeric | 21 accumulate(InputIterator first, InputIterator last, T init);
29 reduce(InputIterator first, InputIterator last); // C++17
33 reduce(InputIterator first, InputIterator last, T init); // C++17
62 transform_reduce(InputIterator first, InputIterator last, T init,
75 exclusive_scan(InputIterator first, InputIterator last,
80 exclusive_scan(InputIterator first, InputIterator last,
89 inclusive_scan(InputIterator first, InputIterator last,
94 inclusive_scan(InputIterator first, InputIterator last,
100 transform_exclusive_scan(InputIterator first, InputIterator last,
107 transform_inclusive_scan(InputIterator first, InputIterator last,
[all …]
|
| /llvm-project-15.0.7/libcxx/test/std/algorithms/alg.sorting/alg.sort/partial.sort/ |
| H A D | ranges_partial_sort.pass.cpp | 41 concept HasPartialSortIt = requires(Iter first, Iter mid, Sent last, Comp comp) {
42 std::ranges::partial_sort(first, mid, last, comp);
77 assert(base(last) == partially_sorted.data() + partially_sorted.size()); in test_one()
89 assert(base(last) == partially_sorted.data() + partially_sorted.size()); in test_one()
158 assert(last == in.end()); in test()
166 auto last = std::ranges::partial_sort(in, m, std::ranges::greater{}); in test() local
168 assert(last == in.end()); in test()
185 auto last = std::ranges::partial_sort(b, m, in.end(), {}, &A::a); in test() local
189 assert(last == in.end()); in test()
197 auto last = std::ranges::partial_sort(in, m, {}, &A::a); in test() local
[all …]
|
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/alg.heap.operations/ |
| H A D | is_heap.pass.cpp | 42 operator()(pstl::execution::unsequenced_policy, Iterator first, Iterator last, Predicate pred) in operator ()()
47 …operator()(pstl::execution::parallel_unsequenced_policy, Iterator first, Iterator last, Predicate … in operator ()()
54 operator()(Policy&& exec, Iterator first, Iterator last, Predicate pred) in operator ()()
59 bool expected = is_heap(first, last); in operator ()()
60 bool actual = is_heap(exec, first, last); in operator ()()
65 bool expected = is_heap(first, last, pred); in operator ()()
66 bool actual = is_heap(exec, first, last, pred); in operator ()()
71 Iterator expected = is_heap_until(first, last); in operator ()()
72 Iterator actual = is_heap_until(exec, first, last); in operator ()()
77 const Iterator expected = is_heap_until(first, last, pred); in operator ()()
[all …]
|
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.sorting/ |
| H A D | partial_sort_copy.pass.cpp | 62 …operator()(pstl::execution::unsequenced_policy, InputIterator first, InputIterator last, Size n1, … in operator ()()
91 …operator()(Policy&& exec, InputIterator first, InputIterator last, Size n1, Size n2, const T& tras… in operator ()()
94 prepare_data(first, last, n1, trash); in operator ()()
95 … RandomAccessIterator exp = std::partial_sort_copy(first, last, exp_first, exp_last, compare); in operator ()()
96 … RandomAccessIterator res = std::partial_sort_copy(exec, first, last, d_first, d_last, compare); in operator ()()
104 …operator()(Policy&& exec, InputIterator first, InputIterator last, Size n1, Size n2, const T& tras… in operator ()()
106 prepare_data(first, last, n1, trash); in operator ()()
107 RandomAccessIterator exp = std::partial_sort_copy(first, last, exp_first, exp_last); in operator ()()
108 RandomAccessIterator res = std::partial_sort_copy(exec, first, last, d_first, d_last); in operator ()()
117 prepare_data(InputIterator first, InputIterator last, Size n1, const T& trash) in prepare_data()
[all …]
|
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.modifying.operations/ |
| H A D | copy_move.pass.cpp | 37 … operator()(pstl::execution::parallel_unsequenced_policy, InputIterator first, InputIterator last, in operator ()()
47 operator()(Policy&& exec, InputIterator first, InputIterator last, OutputIterator out_first, in operator ()()
55 copy(first, last, expected_first); in operator ()()
56 auto k = copy(exec, first, last, out_first); in operator ()()
89 … operator()(pstl::execution::parallel_unsequenced_policy, InputIterator first, InputIterator last, in operator ()()
98 operator()(Policy&& exec, InputIterator first, InputIterator last, OutputIterator out_first, in operator ()()
106 move(first, last, expected_first); in operator ()()
107 auto k = move(exec, first, last, out_first); in operator ()()
131 … operator()(pstl::execution::parallel_unsequenced_policy, InputIterator first, InputIterator last, in operator ()()
140 operator()(Policy&& exec, InputIterator first, InputIterator last, OutputIterator out_first, in operator ()()
[all …]
|
| /llvm-project-15.0.7/pstl/test/std/algorithms/alg.modifying.operations/alg.partitions/ |
| H A D | partition.pass.cpp | 53 is_equal(Iterator first, Iterator last, Iterator d_first) in is_equal() argument
55 return std::equal(first, last, d_first); in is_equal()
71 …operator()(pstl::execution::unsequenced_policy, BiDirIt first, BiDirIt last, BiDirIt exp_first, Bi… in operator ()()
78 …operator()(pstl::execution::parallel_unsequenced_policy, BiDirIt first, BiDirIt last, BiDirIt exp_… in operator ()()
85 …operator()(pstl::execution::parallel_policy, BiDirIt first, BiDirIt last, BiDirIt exp_first, BiDir…
92 …operator()(pstl::execution::parallel_unsequenced_policy, BiDirIt first, BiDirIt last, BiDirIt exp_…
105 fill_data(first, last, generator); in operator ()()
106 BiDirIt actual_ret = std::partition(exec, first, last, unary_op); in operator ()()
107 … EXPECT_TRUE(std::all_of(first, actual_ret, unary_op) && !std::any_of(actual_ret, last, unary_op), in operator ()()
114 fill_data(first, last, generator); in operator ()()
[all …]
|