[oneDPL][ranges] Add nth_element parallel range algorithm #633
Conversation
dmitriy-sobolev
force-pushed
the
add-ranges-sorting-algorithms
branch
from
e21c85f to
f63665d
Compare
akukanov
changed the title
| merge (ExecutionPolicy&& pol, R1&& r1, R2&& r2, OutR&& result, Comp comp = {}, | ||
| Proj1 proj1 = {}, Proj2 proj2 = {}); | ||
| // nth_element |
There was a problem hiding this comment.
In #644 we are adding a new section for partitioning algorithms.
nth_element is effectively a partitioning algorithm - it rearranges the elements of a range such that every element "to the right" is "not greater" (with respect to the comparator) than any element "to the left" (though, elements equal to the Nth one can be found at any side of it), On the other hand, the requirements for nth_element are much closer to sort than to partition.
Should we keep this algorithms in the group with sort or move it to the partition group?
There was a problem hiding this comment.
I think it fits better in partitioning than sort.
There was a problem hiding this comment.
Let's merge #644 first, and then add nth_element into the partition operations group.
| merge (ExecutionPolicy&& pol, R1&& r1, R2&& r2, OutR&& result, Comp comp = {}, | ||
| Proj1 proj1 = {}, Proj2 proj2 = {}); | ||
| // nth_element |
There was a problem hiding this comment.
I think it fits better in partitioning than sort.
3 participants
Adding
nth_elementinto oneDPL specification.