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
Disentangle segmented algorithms #5156
Milestone
Comments
This was referenced Mar 1, 2021
This was referenced Mar 22, 2021
This was referenced Apr 30, 2021
This was referenced Jul 7, 2021
bors bot
pushed a commit
that referenced
this issue
Nov 15, 2021
5241: Adapt min_element, max_element and minmax_element to C++20 r=msimberg a=Jedi18 Adapts min_element, max_element and minmax_element to C++20. Adds min_max_result result type Add segmented algorithm tests for min_element, max_element and minmax_element ## Any background context you want to provide? #4822 #5156 Co-authored-by: Hartmut Kaiser <hartmut.kaiser@gmail.com>
This can be closed now. Thanks to everybody helping with resolving the issue. |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Currently the segmented algorithms are part and parcel of the implementation of the parallel algorithms. That unnecessarily complicates those. Now, that we have converted the parallel algorithm APIs into customization point (CPO) based implementations, the segmented algorithms could be separated and exposed through their own specializations of
tag_invoke
to be picked up by the CPOs. This would significantly simplify the base algorithms and allow to separate the segmented algorithms completely.The text was updated successfully, but these errors were encountered: