These executions are passed as the first parameter for the algorithm:

std::copy(

std::execution::par,

b.start()

);

Most compilers nowadays do not yet support this feature. Probably the only compiler that can already make use of these policies is the Intel C++ Compiler, which was used to perform the tests below.

Copying values from array ''a'' to array ''b''.

std::copy(

std::execution::par,

b

);

''Results''

''Snippet:''

// Counting all multiples of 3

auto condition = [](mytype& i) { return i % 3 == 0; };

condition

);

''Results:''

''Snippet:''

size_t sum;

auto action = [&](mytype& i) { return sum += i; };

action

);

Notice how this **for_each** behaves like a **reduce**: I am modifying the variable "sum" outside of this function. This is very likely to cause a **race condition**.

''Snippet:''

size_t sum = std::reduce(

std::execution::par,

a.end()

);

''Results:''

This algorithm is a bit different: we cannot use ''std::list'' with it. Since the algorithm requires random access, it is only possible to use arrays or vectors.

auto sorter = [](mytype a, mytype b) { return a < b; };

sorter

);

''Results:''

''Snippet:''

auto action = [](mytype i) { return i += 5; };

action

);

''Results:''