This page is a snapshot from the LWG issues list, see the Library Active Issues List for more information and the meaning of Resolved status.
2880. Relax complexity specifications for non-sequenced policiesSection: 26.3.3 [algorithms.parallel.exec] Status: Resolved Submitter: Switzerland Opened: 2017-02-03 Last modified: 2017-06-26
Priority: Not Prioritized
View all other issues in [algorithms.parallel.exec].
View all issues with Resolved status.
Discussion:
Addresses CH 10Parallel implementations of algorithms may be faster if not restricted to the complexity specifications of serial implementations.
Proposed change: Add a relaxation of complexity specifications for non-sequenced policies.
Proposed resolution:
Resolved by the adoption of P0523r1 in Kona
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4