Skip to content

[SYCLomatic]Remove reverse_iterator from partition implementations #2350

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
zhimingwang36 merged 1 commit into from
Sep 11, 2024
Merged

[SYCLomatic]Remove reverse_iterator from partition implementations #2350

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
51 changes: 9 additions & 42 deletions clang/runtime/dpct-rt/include/dpct/dpl_extras/algorithm.h
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -966,20 +966,21 @@ stable_partition(Policy &&policy, Iter1 first, Iter1 last, Iter2 mask, Pred p) {
internal::make_wrapped_policy<internal::copy_call1>(policy);
auto _copy_call2 = internal::make_wrapped_policy<internal::copy_call2>(
std::forward<Policy>(policy));
using _IterValueT = typename std::iterator_traits<Iter1>::value_type;

auto _n = std::distance(first, last);
internal::__buffer<typename std::iterator_traits<Iter1>::value_type> _tmp(_n);
internal::__buffer<_IterValueT> _tmp1(_n);
internal::__buffer<_IterValueT> _tmp2(_n);

auto _tmp_first = _tmp.get();
auto _tmp_last = _tmp_first + _n;
auto _tmp_last_rev = std::reverse_iterator(_tmp_last);
auto _tmp1_first = _tmp1.get();
auto _tmp2_first = _tmp2.get();

auto _end_pair =
stable_partition_copy(std::move(_partition_call1), first, last, mask,
_tmp_first, _tmp_last_rev, p);
auto _first_part_end = std::copy(std::move(_copy_call1), _tmp_first,
_tmp1_first, _tmp2_first, p);
auto _first_part_end = std::copy(std::move(_copy_call1), _tmp1_first,
std::get<0>(_end_pair), first);
std::copy(std::move(_copy_call2), _tmp_last_rev, std::get<1>(_end_pair),
std::copy(std::move(_copy_call2), _tmp2_first, std::get<1>(_end_pair),
_first_part_end);

return _first_part_end;
Expand Down Expand Up @@ -1012,41 +1013,7 @@ stable_partition(Policy &&policy, Iter1 first, Iter1 last, Iter2 mask, Pred p) {
}

template <typename Policy, typename Iter1, typename Iter2, typename Pred>
typename std::enable_if<internal::is_hetero_execution_policy<
typename std::decay<Policy>::type>::value,
Iter1>::type
partition(Policy &&policy, Iter1 first, Iter1 last, Iter2 mask, Pred p) {
static_assert(
std::is_same<typename std::iterator_traits<Iter1>::iterator_category,
std::random_access_iterator_tag>::value &&
std::is_same<typename std::iterator_traits<Iter2>::iterator_category,
std::random_access_iterator_tag>::value,
"Iterators passed to algorithms must be random-access iterators.");
auto _partition_call1 =
internal::make_wrapped_policy<internal::partition_call1>(policy);
auto _copy_call1 = internal::make_wrapped_policy<internal::copy_call1>(
std::forward<Policy>(policy));

auto _n = std::distance(first, last);
internal::__buffer<typename std::iterator_traits<Iter1>::value_type> _tmp(_n);

auto _tmp_first = _tmp.get();
auto _tmp_last = _tmp_first + _n;
auto _tmp_last_rev = std::reverse_iterator(_tmp_last);

auto _end_pair =
stable_partition_copy(std::move(_partition_call1), first, last, mask,
_tmp_first, _tmp_last_rev, p);
auto _first_n = std::distance(_tmp_first, std::get<0>(_end_pair));
std::copy(std::move(_copy_call1), _tmp_first, _tmp_last, first);

return first + _first_n;
}

template <typename Policy, typename Iter1, typename Iter2, typename Pred>
typename std::enable_if<!internal::is_hetero_execution_policy<
typename std::decay<Policy>::type>::value,
Iter1>::type
internal::enable_if_execution_policy<Policy, Iter1>
partition(Policy &&policy, Iter1 first, Iter1 last, Iter2 mask, Pred p) {
static_assert(
std::is_same<typename std::iterator_traits<Iter1>::iterator_category,
Expand Down