Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

N4407 #46

Merged
merged 2 commits into from
Apr 8, 2015
Merged

N4407 #46

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
037f5da
Add N4407 with cleaned up formatting
jaredhoberock Apr 7, 2015
329cc24
Manually break code lines which were spilling into the margin.
jaredhoberock Apr 7, 2015
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
24 changes: 7 additions & 17 deletions README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -1,31 +1,21 @@
Document Number: N4353
Date: 2015-01-08
Document Number: N4408
Date: 2015-04-10
Revises:
Project: Programming Language C++
Project Number: TS 19570
Reply-to: Jared Hoberock
NVIDIA Corporation
jhoberock@nvidia.com

# Parallelism TS Editor's Report, pre-DTS ballot
# Parallelism TS Editor's Report, pre-Lenexa mailing

N4352 is the latest Parallelism TS Working Draft. It contains editorial changes to the Parallelism TS as directed by an editing committee appointed during the Urbana meeting to approve the correctness of the Parallelism TS working paper.
N4407 is the latest Parallelism TS Working Draft. It contains editorial changes to the Parallelism TS to address whitespace and other formatting issues.

N4352 updates the previous draft, N4310, published in the post-Urbana mailing.
N4407 updates the previous draft, N4352, published in the midterm mailing.

N4354 is document N4352 reformatted as a DTS ballot document. It updates N4312, which was published in the post-Urbana mailing.
N4409 is document N4407 reformatted as a TS document. It updates N4354, which was published in the midterm mailing.

## Editorial Changes

1. A missing signature for `execution_policy::type` was added to the synopsis in Section 2.7.
2. A missing `ExecutionPolicy` overload signature for `for_each_n` was added to the synopsis in Section 4.3.1.
3. Missing `ExecutionPolicy` overload signatures for `reduce`, `exclusive_scan`, `inclusive_scan`, `transform_reduce`, `transform_exclusive_scan`, and `transform_inclusive_scan` were added to the synopsis in Section 4.4.1.

## Acknowledgements

Thanks to the review committee, who identified these issues.

* Hans Boehm
* Lawrence Crowl
* Alisdair Meredith
Eliminated spurious whitespace and paragraph numbers and manually broke code lines which were spilling into the margin.

184 changes: 75 additions & 109 deletions algorithms.html
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -348,7 +348,8 @@ <h1>Definitions</h1>
<li><code>a1</code> when <code>N</code> is <code>1</code></li>

<li>
<code>op(<em>GENERALIZED_NONCOMMUTATIVE_SUM</em>(op, a1, ..., aK), <em>GENERALIZED_NONCOMMUTATIVE_SUM</em>(op, aM, ..., aN)</code> where <code>1 &lt; K+1 = M &le; N</code>.
<code>op(<em>GENERALIZED_NONCOMMUTATIVE_SUM</em>(op, a1, ..., aK), <em>GENERALIZED_NONCOMMUTATIVE_SUM</em>(op, aM, </code><br>
<code>..., aN)</code> where <code>1 &lt; K+1 = M &le; N</code>.
</li>
</ul>
</p>
Expand Down Expand Up @@ -389,13 +390,11 @@ <h1>Header <code>&lt;experimental/algorithm&gt;</code> synopsis</h1>
<h1>For each</h1>

<cxx-function>
<cxx-signature>
template&lt;class ExecutionPolicy,
class InputIterator, class Function&gt;
void for_each(ExecutionPolicy&amp;&amp; exec,
InputIterator first, InputIterator last,
Function f);
</cxx-signature>
<cxx-signature>template&lt;class ExecutionPolicy,
class InputIterator, class Function&gt;
void for_each(ExecutionPolicy&amp;&amp; exec,
InputIterator first, InputIterator last,
Function f);</cxx-signature>

<cxx-effects>
Applies <code>f</code> to the result of dereferencing every iterator in the range <code>[first,last)</code>.
Expand Down Expand Up @@ -426,11 +425,9 @@ <h1>For each</h1>
</cxx-function>

<cxx-function>
<cxx-signature>
template&lt;class InputIterator, class Size, class Function&gt;
InputIterator for_each_n(InputIterator first, Size n,
Function f);
</cxx-signature>
<cxx-signature>template&lt;class InputIterator, class Size, class Function&gt;
InputIterator for_each_n(InputIterator first, Size n,
Function f);</cxx-signature>

<cxx-requires>
<code>Function</code> shall meet the requirements of <code>MoveConstructible</code>
Expand Down Expand Up @@ -460,13 +457,11 @@ <h1>For each</h1>
</cxx-function>

<cxx-function>
<cxx-signature>
template&lt;class ExecutionPolicy,
class InputIterator, class Size, class Function&gt;
InputIterator for_each_n(ExecutionPolicy &amp;&amp; exec,
InputIterator first, Size n,
Function f);
</cxx-signature>
<cxx-signature>template&lt;class ExecutionPolicy,
class InputIterator, class Size, class Function&gt;
InputIterator for_each_n(ExecutionPolicy &amp;&amp; exec,
InputIterator first, Size n,
Function f);</cxx-signature>

<cxx-effects>
Applies <code>f</code> to the result of dereferencing every iterator in the range
Expand Down Expand Up @@ -669,34 +664,28 @@ <h1>Header <code>&lt;experimental/numeric&gt;</code> synopsis</h1>
<h1>Reduce</h1>

<cxx-function>
<cxx-signature>
template&lt;class InputIterator&gt;
typename iterator_traits&lt;InputIterator&gt;::value_type
reduce(InputIterator first, InputIterator last);
</cxx-signature>
<cxx-signature>template&lt;class InputIterator&gt;
typename iterator_traits&lt;InputIterator&gt;::value_type
reduce(InputIterator first, InputIterator last);</cxx-signature>

<cxx-effects>
Same as <code>reduce(first, last, typename iterator_traits&lt;InputIterator&gt;::value_type{})</code>.
</cxx-effects>
</cxx-function>

<cxx-function>
<cxx-signature>
template&lt;class InputIterator, class T&gt;
T reduce(InputIterator first, InputIterator last, T init);
</cxx-signature>
<cxx-signature>template&lt;class InputIterator, class T&gt;
T reduce(InputIterator first, InputIterator last, T init);</cxx-signature>

<cxx-effects>
Same as <code>reduce(first, last, init, plus&lt;&gt;())</code>.
</cxx-effects>
</cxx-function>

<cxx-function>
<cxx-signature>
template&lt;class InputIterator, class T, class BinaryOperation&gt;
T reduce(InputIterator first, InputIterator last, T init,
BinaryOperation binary_op);
</cxx-signature>
<cxx-signature>template&lt;class InputIterator, class T, class BinaryOperation&gt;
T reduce(InputIterator first, InputIterator last, T init,
BinaryOperation binary_op);</cxx-signature>

<cxx-returns>
<code><em>GENERALIZED_SUM</em>(binary_op, init, *first, ..., *(first + (last - first) - 1))</code>.
Expand All @@ -722,29 +711,21 @@ <h1>Reduce</h1>
<h1>Exclusive scan</h1>

<cxx-function>
<cxx-signature>
template&lt;class InputIterator, class OutputIterator,
class T&gt;
OutputIterator
exclusive_scan(InputIterator first, InputIterator last,
OutputIterator result,
T init);
</cxx-signature>
<cxx-signature>template&lt;class InputIterator, class OutputIterator, class T&gt;
OutputIterator exclusive_scan(InputIterator first, InputIterator last,
OutputIterator result,
T init);</cxx-signature>

<cxx-effects>
Same as <code>exclusive_scan(first, last, result, init, plus&lt;&gt;())</code>.
</cxx-effects>
</cxx-function>

<cxx-function>
<cxx-signature>
template&lt;class InputIterator, class OutputIterator,
class T, class BinaryOperation&gt;
OutputIterator
exclusive_scan(InputIterator first, InputIterator last,
OutputIterator result,
T init, BinaryOperation binary_op);
</cxx-signature>
<cxx-signature>template&lt;class InputIterator, class OutputIterator, class T, class BinaryOperation&gt;
OutputIterator exclusive_scan(InputIterator first, InputIterator last,
OutputIterator result,
T init, BinaryOperation binary_op);</cxx-signature>

<cxx-effects>
Assigns through each iterator <code>i</code> in <code>[result,result + (last - first))</code> the
Expand Down Expand Up @@ -777,34 +758,24 @@ <h1>Exclusive scan</h1>
<h1>Inclusive scan</h1>

<cxx-function>
<cxx-signature>
template&lt;class InputIterator, class OutputIterator&gt;
OutputIterator
inclusive_scan(InputIterator first, InputIterator last,
OutputIterator result);
</cxx-signature>
<cxx-signature>template&lt;class InputIterator, class OutputIterator&gt;
OutputIterator inclusive_scan(InputIterator first, InputIterator last,
OutputIterator result);</cxx-signature>

<cxx-effects>
Same as <code>inclusive_scan(first, last, result, plus&lt;&gt;())</code>.
</cxx-effects>
</cxx-function>

<cxx-function>
<cxx-signature>
template&lt;class InputIterator, class OutputIterator,
class BinaryOperation&gt;
OutputIterator
inclusive_scan(InputIterator first, InputIterator last,
OutputIterator result,
BinaryOperation binary_op);

template&lt;class InputIterator, class OutputIterator,
class BinaryOperation&gt;
OutputIterator
inclusive_scan(InputIterator first, InputIterator last,
OutputIterator result,
BinaryOperation binary_op, T init);
</cxx-signature>
<cxx-signature>template&lt;class InputIterator, class OutputIterator, class BinaryOperation&gt;
OutputIterator inclusive_scan(InputIterator first, InputIterator last,
OutputIterator result,
BinaryOperation binary_op);</cxx-signature>
<cxx-signature>template&lt;class InputIterator, class OutputIterator, class BinaryOperation&gt;
OutputIterator inclusive_scan(InputIterator first, InputIterator last,
OutputIterator result,
BinaryOperation binary_op, T init);</cxx-signature>

<cxx-effects>
Assigns through each iterator <code>i</code> in <code>[result,result + (last - first))</code> the value of
Expand Down Expand Up @@ -839,14 +810,13 @@ <h1>Inclusive scan</h1>
<h1>Transform reduce</h1>

<cxx-function>
<cxx-signature>
template&lt;class InputIterator, class UnaryFunction, class T, class BinaryOperation&gt;
T transform_reduce(InputIterator first, InputIterator last,
UnaryOperation unary_op, T init, BinaryOperation binary_op);
</cxx-signature>
<cxx-signature>template&lt;class InputIterator, class UnaryFunction, class T, class BinaryOperation&gt;
T transform_reduce(InputIterator first, InputIterator last,
UnaryOperation unary_op, T init, BinaryOperation binary_op);</cxx-signature>

<cxx-returns>
<code><em>GENERALIZED_SUM</em>(binary_op, init, unary_op(*first), ..., unary_op(*(first + (last - first) - 1)))</code>.
<code><em>GENERALIZED_SUM</em>(binary_op, init, unary_op(*first), ..., unary_op(*(first + (last - first) -</code><br>
<code>1)))</code>.
</cxx-returns>

<cxx-requires>
Expand All @@ -867,20 +837,18 @@ <h1>Transform reduce</h1>
<h1>Transform exclusive scan</h1>

<cxx-function>
<cxx-signature>
template&lt;class InputIterator, class OutputIterator,
class UnaryOperation,
class T, class BinaryOperation&gt;
OutputIterator
transform_exclusive_scan(InputIterator first, InputIterator last,
OutputIterator result,
UnaryOperation unary_op,
T init, BinaryOperation binary_op);
</cxx-signature>
<cxx-signature>template&lt;class InputIterator, class OutputIterator,
class UnaryOperation,
class T, class BinaryOperation&gt;
OutputIterator transform_exclusive_scan(InputIterator first, InputIterator last,
OutputIterator result,
UnaryOperation unary_op,
T init, BinaryOperation binary_op);</cxx-signature>

<cxx-effects>
Assigns through each iterator <code>i</code> in <code>[result,result + (last - first))</code> the value of
<code><em>GENERALIZED_NONCOMMUTATIVE_SUM</em>(binary_op, init, unary_op(*first), ..., unary_op(*(first + (i - result) - 1)))</code>.
<code><em>GENERALIZED_NONCOMMUTATIVE_SUM</em>(binary_op, init, unary_op(*first), ..., unary_op(*(first + (i</code><br>
<code>- result) - 1)))</code>.
</cxx-effects>

<cxx-returns>
Expand Down Expand Up @@ -908,30 +876,28 @@ <h1>Transform exclusive scan</h1>
<h1>Transform inclusive scan</h1>

<cxx-function>
<cxx-signature>
template&lt;class InputIterator, class OutputIterator,
class UnaryOperation,
class BinaryOperation&gt;
OutputIterator
transform_inclusive_scan(InputIterator first, InputIterator last,
OutputIterator result,
UnaryOperation unary_op,
BinaryOperation binary_op);

template&lt;class InputIterator, class OutputIterator,
class UnaryOperation,
class BinaryOperation, class T&gt;
OutputIterator
transform_inclusive_scan(InputIterator first, InputIterator last,
OutputIterator result,
UnaryOperation unary_op,
BinaryOperation binary_op, T init);
</cxx-signature>
<cxx-signature>template&lt;class InputIterator, class OutputIterator,
class UnaryOperation,
class BinaryOperation&gt;
OutputIterator transform_inclusive_scan(InputIterator first, InputIterator last,
OutputIterator result,
UnaryOperation unary_op,
BinaryOperation binary_op);</cxx-signature>

<cxx-signature>template&lt;class InputIterator, class OutputIterator,
class UnaryOperation,
class BinaryOperation, class T&gt;
OutputIterator transform_inclusive_scan(InputIterator first, InputIterator last,
OutputIterator result,
UnaryOperation unary_op,
BinaryOperation binary_op, T init);</cxx-signature>

<cxx-effects>
Assigns through each iterator <code>i</code> in <code>[result,result + (last - first))</code> the value of
<code><em>GENERALIZED_NONCOMMUTATIVE_SUM</em>(binary_op, unary_op(*first), ..., unary_op(*(first + (i - result))))</code> or
<code><em>GENERALIZED_NONCOMMUTATIVE_SUM</em>(binary_op, init, unary_op(*first), ..., unary_op(*(first + (i - result))))</code>
<code><em>GENERALIZED_NONCOMMUTATIVE_SUM</em>(binary_op, unary_op(*first), ..., unary_op(*(first + (i -</code><br>
<code>result))))</code> or
<code><em>GENERALIZED_NONCOMMUTATIVE_SUM</em>(binary_op, init, unary_op(*first), ..., unary_op(*(first + (i</code><br>
<code>- result))))</code>
if <code>init</code> is provided.
</cxx-effects>

Expand Down
16 changes: 4 additions & 12 deletions exceptions.html
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -90,9 +90,7 @@ <h1>Header <code>&lt;experimental/exception_list&gt;</code> synopsis</h1>
</p>

<cxx-function>
<cxx-signature>
size_t size() const noexcept;
</cxx-signature>
<cxx-signature>size_t size() const noexcept;</cxx-signature>

<cxx-returns>
The number of <code>exception_ptr</code> objects contained within the <code>exception_list</code>.
Expand All @@ -104,29 +102,23 @@ <h1>Header <code>&lt;experimental/exception_list&gt;</code> synopsis</h1>
</cxx-function>

<cxx-function>
<cxx-signature>
iterator begin() const noexcept;
</cxx-signature>
<cxx-signature>iterator begin() const noexcept;</cxx-signature>

<cxx-returns>
An iterator referring to the first <code>exception_ptr</code> object contained within the <code>exception_list</code>.
</cxx-returns>
</cxx-function>

<cxx-function>
<cxx-signature>
iterator end() const noexcept;
</cxx-signature>
<cxx-signature>iterator end() const noexcept;</cxx-signature>

<cxx-returns>
An iterator that is past the end of the owned sequence.
</cxx-returns>
</cxx-function>

<cxx-function>
<cxx-signature>
const char* what() const noexcept override;
</cxx-signature>
<cxx-signature>const char* what() const noexcept override;</cxx-signature>

<cxx-returns>
An implementation-defined NTBS.
Expand Down
10 changes: 3 additions & 7 deletions execution_policies.html
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -191,18 +191,14 @@ <h1><code>execution_policy</code> construct/assign</h1>
<h1><code>execution_policy</code> object access</h1>

<cxx-function>
<cxx-signature>
const type_info&amp; type() const noexcept;
</cxx-signature>
<cxx-signature>const type_info&amp; type() const noexcept;</cxx-signature>

<cxx-returns><code>typeid(T)</code>, such that <code>T</code> is the type of the execution policy object contained by <code>*this</code>.</cxx-returns>
</cxx-function>

<cxx-function>
<cxx-signature>
template&lt;class T&gt; T* get() noexcept;
template&lt;class T&gt; const T* get() const noexcept;
</cxx-signature>
<cxx-signature>template&lt;class T&gt; T* get() noexcept;</cxx-signature>
<cxx-signature>template&lt;class T&gt; const T* get() const noexcept;</cxx-signature>

<cxx-returns>If <code>target_type() == typeid(T)</code>, a pointer to the stored execution policy object; otherwise a null pointer.</cxx-returns>

Expand Down
Loading