tmp/tmpeyrfwu3n/{from.md → to.md}
RENAMED
|
@@ -0,0 +1,33 @@
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
| 1 |
+
### Terms and definitions <a id="algorithms.parallel.defns">[[algorithms.parallel.defns]]</a>
|
| 2 |
+
|
| 3 |
+
A *parallel algorithm* is a function template listed in this
|
| 4 |
+
International Standard with a template parameter named
|
| 5 |
+
`ExecutionPolicy`.
|
| 6 |
+
|
| 7 |
+
Parallel algorithms access objects indirectly accessible via their
|
| 8 |
+
arguments by invoking the following functions:
|
| 9 |
+
|
| 10 |
+
- All operations of the categories of the iterators that the algorithm
|
| 11 |
+
is instantiated with.
|
| 12 |
+
- Operations on those sequence elements that are required by its
|
| 13 |
+
specification.
|
| 14 |
+
- User-provided function objects to be applied during the execution of
|
| 15 |
+
the algorithm, if required by the specification.
|
| 16 |
+
- Operations on those function objects required by the specification.
|
| 17 |
+
\[*Note 1*: See [[algorithms.general]]. — *end note*]
|
| 18 |
+
|
| 19 |
+
These functions are herein called *element access functions*.
|
| 20 |
+
|
| 21 |
+
[*Example 1*:
|
| 22 |
+
|
| 23 |
+
The `sort` function may invoke the following element access functions:
|
| 24 |
+
|
| 25 |
+
- Operations of the random-access iterator of the actual template
|
| 26 |
+
argument (as per [[random.access.iterators]]), as implied by the name
|
| 27 |
+
of the template parameter `RandomAccessIterator`.
|
| 28 |
+
- The `swap` function on the elements of the sequence (as per the
|
| 29 |
+
preconditions specified in [[sort]]).
|
| 30 |
+
- The user-provided `Compare` function object.
|
| 31 |
+
|
| 32 |
+
— *end example*]
|
| 33 |
+
|