A parallel algorithm is a function template in the algorithms library with a template parameter named ExecutionPolicy or constrained by execution-policy (since C++26). Such a template parameter is …

C89/C90 standard (ISO/IEC 9899:1990): 4.10.5 Searching and sorting utilities

What links here Related changes Upload file Special pages Printable version Permanent link Page information

C++20 provides constrained versions of most algorithms in the namespace std::ranges. In these algorithms, a range can be specified as either an iterator - sentinel pair or as a single range …

If an uncaught exception is thrown while accessing objects via an algorithm argument, the behavior is determined by the execution policy (for standard policies, std::terminate is invoked).

If an uncaught exception is thrown while accessing objects via an algorithm argument, the behavior is determined by the execution policy (for standard policies, std::terminate is invoked).

// mostly freestanding #include <initializer_list> namespace std { namespace ranges { // algorithm result types template<class I, class F> struct in_fun_result; template<class I1, class I2> struct in_in_result; …

std::transform applies the given function to the elements of the given input range (s), and stores the result in an output range starting from d_first.

If an uncaught exception is thrown while accessing objects via an algorithm argument, the behavior is determined by the execution policy (for standard policies, std::terminate is invoked).

If the algorithm fails to allocate memory, std::bad_alloc is thrown. Possible implementation See also the implementations in libstdc++ and libc++. Notes Before LWG713, the complexity requirement allowed …