| 1 |
/* { dg-additional-options "-std=c++20" } */ |
| 2 |
|
| 3 |
/* <iterator> c++20 */ |
| 4 |
|
| 5 |
/* std::common_iterator uses std::variant. */ |
| 6 |
|
| 7 |
#include <vector> |
| 8 |
#include <iterator> |
| 9 |
#include <span> |
| 10 |
|
| 11 |
//TODO PR120454 "C++ constexpr vs. OpenMP implicit mapping" |
| 12 |
#pragma omp declare target(std::ranges::distance, std::ranges::next) |
| 13 |
|
| 14 |
#include "target-flex-common.h" |
| 15 |
|
| 16 |
namespace stdr = std::ranges; |
| 17 |
|
| 18 |
template<typename It0, typename It1> |
| 19 |
bool simple_equal(const It0 begin0, const It0 end0, |
| 20 |
const It1 begin1, const It1 end1) BL_NOEXCEPT |
| 21 |
{ |
| 22 |
It0 it0 = begin0; |
| 23 |
It1 it1 = begin1; |
| 24 |
for (; it0 != end0; ++it0, ++it1) |
| 25 |
if (it1 == end1 || *it0 != *it1) |
| 26 |
return false; |
| 27 |
return true; |
| 28 |
} |
| 29 |
|
| 30 |
template<typename It, typename OutIt> |
| 31 |
void simple_copy(const It begin, const It end, OutIt out) BL_NOEXCEPT |
| 32 |
{ |
| 33 |
for (It it = begin; it != end; ++it, ++out) |
| 34 |
*out = *it; |
| 35 |
} |
| 36 |
|
| 37 |
template<typename T, std::size_t Size> |
| 38 |
bool test(const T (&arr)[Size]) |
| 39 |
{ |
| 40 |
bool ok; |
| 41 |
T out_rev_arr[Size]; |
| 42 |
T out_fwd_arr[Size]; |
| 43 |
T out_first_half_arr[Size / 2]; |
| 44 |
#pragma omp target defaultmap(none) \ |
| 45 |
map(from: ok, out_rev_arr[:Size], out_fwd_arr[:Size], \ |
| 46 |
out_first_half_arr[:Size / 2]) \ |
| 47 |
map(to: arr[:Size]) |
| 48 |
{ |
| 49 |
bool inner_ok = true; |
| 50 |
{ |
| 51 |
std::span<const T> span = {arr, Size}; |
| 52 |
std::vector<T> rev_vec(std::reverse_iterator{span.end()}, |
| 53 |
std::reverse_iterator{span.begin()}); |
| 54 |
VERIFY (std::distance(span.begin(), span.end()) |
| 55 |
== std::distance(rev_vec.begin(), rev_vec.end())); |
| 56 |
VERIFY (stdr::distance(span.begin(), span.end()) |
| 57 |
== stdr::distance(rev_vec.begin(), rev_vec.end())); |
| 58 |
VERIFY (stdr::distance(span) == stdr::distance(rev_vec)); |
| 59 |
VERIFY (simple_equal(span.begin(), span.end(), |
| 60 |
std::reverse_iterator{rev_vec.end()}, |
| 61 |
std::reverse_iterator{rev_vec.begin()})); |
| 62 |
simple_copy(rev_vec.begin(), rev_vec.end(), out_rev_arr); |
| 63 |
simple_copy(std::reverse_iterator{rev_vec.end()}, |
| 64 |
std::reverse_iterator{rev_vec.begin()}, |
| 65 |
out_fwd_arr); |
| 66 |
using counted_iter = std::counted_iterator<decltype(span.begin())>; |
| 67 |
using common_iter = std::common_iterator<counted_iter, |
| 68 |
std::default_sentinel_t>; |
| 69 |
std::vector<T> front_half; |
| 70 |
simple_copy(common_iter{counted_iter{span.begin(), Size / 2}}, |
| 71 |
common_iter{std::default_sentinel}, |
| 72 |
std::back_insert_iterator{front_half}); |
| 73 |
VERIFY (simple_equal(span.begin(), stdr::next(span.begin(), Size / 2), |
| 74 |
front_half.begin(), front_half.end())); |
| 75 |
simple_copy(front_half.begin(), front_half.end(), out_first_half_arr); |
| 76 |
} |
| 77 |
end: |
| 78 |
ok = inner_ok; |
| 79 |
} |
| 80 |
VERIFY_NON_TARGET (simple_equal(std::reverse_iterator{arr + Size}, |
| 81 |
std::reverse_iterator{arr}, |
| 82 |
out_rev_arr, out_rev_arr + Size)); |
| 83 |
VERIFY_NON_TARGET (simple_equal(arr, arr + Size, |
| 84 |
out_fwd_arr, out_fwd_arr + Size)); |
| 85 |
VERIFY_NON_TARGET (simple_equal(arr, arr + Size / 2, |
| 86 |
out_first_half_arr, out_first_half_arr + Size / 2)); |
| 87 |
return ok; |
| 88 |
} |
| 89 |
|
| 90 |
int main() |
| 91 |
{ |
| 92 |
int arr[] = {0, 1, 2, 3, 4, 5, 6, 7}; |
| 93 |
return test(arr) ? 0 : 1; |
| 94 |
} |