-
Notifications
You must be signed in to change notification settings - Fork 790
[SYCL] Key/Value sorting with fixed-size private array input #14399
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.
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
Merged
Changes from all commits
Commits
Show all changes
3 commits
Select commit
Hold shift + click to select a range
File filter
Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
There are no files selected for viewing
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| Original file line number | Diff line number | Diff line change |
|---|---|---|
| @@ -0,0 +1,94 @@ | ||
| //==------------ key_value_iterator.hpp ------------------------------------==// | ||
| // | ||
| // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions. | ||
| // See https://llvm.org/LICENSE.txt for license information. | ||
| // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception | ||
| // | ||
| //===----------------------------------------------------------------------===// | ||
| // This file includes key/value iterator implementation used for group_sort | ||
| // algorithms. | ||
| // | ||
|
|
||
| #pragma once | ||
| #include <iterator> | ||
| #include <tuple> | ||
| #include <utility> | ||
|
|
||
| namespace sycl { | ||
| inline namespace _V1 { | ||
| namespace detail { | ||
|
|
||
| template <typename T1, typename T2> class key_value_iterator { | ||
| public: | ||
| key_value_iterator(T1 *Keys, T2 *Values) : KeyValue{Keys, Values} {} | ||
|
|
||
| using difference_type = std::ptrdiff_t; | ||
| using value_type = std::tuple<T1, T2>; | ||
| using reference = std::tuple<T1 &, T2 &>; | ||
| using pointer = std::tuple<T1 *, T2 *>; | ||
| using iterator_category = std::random_access_iterator_tag; | ||
|
|
||
| reference operator*() const { | ||
| return std::tie(*(std::get<0>(KeyValue)), *(std::get<1>(KeyValue))); | ||
| } | ||
|
|
||
| reference operator[](difference_type i) const { return *(*this + i); } | ||
|
|
||
| difference_type operator-(const key_value_iterator &it) const { | ||
| return std::get<0>(KeyValue) - std::get<0>(it.KeyValue); | ||
| } | ||
|
|
||
| key_value_iterator &operator+=(difference_type i) { | ||
| KeyValue = | ||
| std::make_tuple(std::get<0>(KeyValue) + i, std::get<1>(KeyValue) + i); | ||
| return *this; | ||
| } | ||
| key_value_iterator &operator-=(difference_type i) { return *this += -i; } | ||
| key_value_iterator &operator++() { return *this += 1; } | ||
| key_value_iterator &operator--() { return *this -= 1; } | ||
| std::tuple<T1 *, T2 *> base() const { return KeyValue; } | ||
| key_value_iterator operator++(int) { | ||
| key_value_iterator it(*this); | ||
| ++(*this); | ||
| return it; | ||
| } | ||
| key_value_iterator operator--(int) { | ||
| key_value_iterator it(*this); | ||
| --(*this); | ||
| return it; | ||
| } | ||
|
|
||
| key_value_iterator operator-(difference_type i) const { | ||
| key_value_iterator it(*this); | ||
| return it -= i; | ||
| } | ||
| key_value_iterator operator+(difference_type i) const { | ||
| key_value_iterator it(*this); | ||
| return it += i; | ||
| } | ||
| friend key_value_iterator operator+(difference_type i, | ||
| const key_value_iterator &it) { | ||
| return it + i; | ||
| } | ||
|
|
||
| bool operator==(const key_value_iterator &it) const { | ||
| return *this - it == 0; | ||
| } | ||
|
|
||
| bool operator!=(const key_value_iterator &it) const { return !(*this == it); } | ||
| bool operator<(const key_value_iterator &it) const { return *this - it < 0; } | ||
| bool operator>(const key_value_iterator &it) const { return it < *this; } | ||
| bool operator<=(const key_value_iterator &it) const { return !(*this > it); } | ||
| bool operator>=(const key_value_iterator &it) const { return !(*this < it); } | ||
|
|
||
| private: | ||
| std::tuple<T1 *, T2 *> KeyValue; | ||
| }; | ||
|
|
||
| template <typename T> void swap(T &first, T &second) { | ||
| std::swap(first, second); | ||
| } | ||
|
|
||
| } // namespace detail | ||
| } // namespace _V1 | ||
| } // namespace sycl | ||
Oops, something went wrong.
Oops, something went wrong.
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
nit: add empty line at the EOF
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thank you, will have to move extension doc from proposed to supported in another PR, will make this correction there.