Namespaces
Variants

execution-policy

From cppreference.com
 
 
Algorithm library
Constrained algorithms and algorithms on ranges (C++20)
Constrained algorithms, e.g. ranges::copy, ranges::sort, ...
Non-modifying sequence operations    
Batch operations
(C++17)
Search operations
Modifying sequence operations
Copy operations
(C++11)
(C++11)
Swap operations
Transformation operations
Generation operations
Removing operations
Order-changing operations
(until C++17)(C++11)
(C++20)(C++20)
Sampling operations
(C++17)

Sorting and related operations
Partitioning operations
(C++11)    

Sorting operations
Binary search operations
(on partitioned ranges)
Set operations (on sorted ranges)
Merge operations (on sorted ranges)
Heap operations
Minimum/maximum operations
(C++11)
(C++17)
Lexicographical comparison operations
Permutation operations


 


template< class T >
concept /*execution-policy*/ = std::is_execution_policy_v<std::remove_cvref_t<T>>;
(since C++26)
(exposition only*)

The exposition-only concept execution-policy is used by parallel range algorithms to constrain the execution policy template parameter.

See also

test whether a class represents an execution policy
(class template) [edit]