Eliminate [parallel.alg.foreach]

Author: jaredhoberock

algorithms.html

@@ -459,153 +459,6 @@ <h1>For loop</h1>
       </cxx-function>
     </cxx-section>
 
-    <cxx-section id="parallel.alg.foreach">
-      <h1><del>For each</del></h1>
-
-      <cxx-function>
-        <cxx-signature><del>template&lt;class ExecutionPolicy,
-      class InputIterator, class Function&gt;
-void for_each(ExecutionPolicy&amp;&amp; exec,
-              InputIterator first, InputIterator last,
-              Function f);</del></cxx-signature>
-
-        <del>
-        <cxx-effects>
-          <del>
-          Applies <code>f</code> to the result of dereferencing every iterator in the range <code>[first,last)</code>.
-
-          <cxx-note>
-            If the type of <code>first</code> satisfies the requirements of a mutable iterator, <code>f</code> may
-            apply nonconstant functions through the dereferenced iterator.
-          </cxx-note>
-          </del>
-        </cxx-effects>
-        </del>
-
-        <del>
-        <cxx-complexity>
-          <del>Applies <code>f</code> exactly <code>last - first</code> times.</del>
-        </cxx-complexity>
-        </del>
-        
-        <del>
-        <cxx-remarks>
-          <del>If <code>f</code> returns a result, the result is ignored.</del>
-        </cxx-remarks>
-        </del>
-
-        <del>
-        <cxx-notes>
-          <del>
-          Unlike its sequential form, the parallel overload of <code>for_each</code> does not return a copy of
-          its <code>Function</code> parameter, since parallelization may not permit efficient state
-          accumulation.
-          </del>
-        </cxx-notes>
-        </del>
-
-        <del>
-        <cxx-requires>
-          <del>
-          Unlike its sequential form, the parallel overload of <code>for_each</code> requires
-          <code>Function</code> to meet the requirements of <code>CopyConstructible</code>.
-          </del>
-        </cxx-requires>
-        </del>
-      </cxx-function>
-
-      <cxx-function>
-        <cxx-signature><del>template&lt;class InputIterator, class Size, class Function&gt;
-InputIterator for_each_n(InputIterator first, Size n,
-Function f);</del></cxx-signature>
-
-        <del>
-        <cxx-requires>
-          <del>
-          <code>Function</code> shall meet the requirements of <code>MoveConstructible</code>
-          
-          <cxx-note>
-            <code>Function</code> need not meet the requirements of <code>CopyConstructible</code>.
-          </cxx-note>
-          </del>
-        </cxx-requires>
-        </del>
-
-        <del>
-        <cxx-effects>
-          <del>
-          Applies <code>f</code> to the result of dereferencing every iterator in the range
-          <code>[first,first + n)</code>, starting from <code>first</code> and proceeding to <code>first + n - 1</code>.
-
-          <cxx-note>
-            If the type of <code>first</code> satisfies the requirements of a mutable iterator,
-            <code>f</code> may apply nonconstant functions through the dereferenced iterator.
-          </cxx-note>
-          </del>
-        </cxx-effects>
-        </del>
-
-        <del>
-        <cxx-returns>
-          <del>
-          <code>first + n</code> for non-negative values of <code>n</code> and <code>first</code> for negative values.
-          </del>
-        </cxx-returns>
-        </del>
-
-        <del>
-        <cxx-remarks>
-          <del>
-          If <code>f</code> returns a result, the result is ignored.
-          </del>
-        </cxx-remarks>
-        </del>
-      </cxx-function>
-
-      <cxx-function>
-        <cxx-signature><del>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);</del></cxx-signature>
-
-        <del>
-        <cxx-effects>
-          <del>
-          Applies <code>f</code> to the result of dereferencing every iterator in the range
-          <code>[first,first + n)</code>, starting from <code>first</code> and proceeding to <code>first + n - 1</code>.
-
-          <cxx-note>
-            If the type of <code>first</code> satisfies the requirements of a mutable iterator,
-            <code>f</code> may apply nonconstant functions through the dereferenced iterator.
-          </cxx-note>
-          </del>
-        </cxx-effects>
-        </del>
-
-        <del>
-        <cxx-returns>
-          <del><code>first + n</code> for non-negative values of <code>n</code> and <code>first</code> for negative values.</del>
-        </cxx-returns>
-        </del>
-
-        <del>
-        <cxx-remarks>
-          <del>If <code>f</code> returns a result, the result is ignored.</del>
-        </cxx-remarks>
-        </del>
-
-        <del>
-        <cxx-notes>
-          <del>
-          Unlike its sequential form, the parallel overload of <code>for_each_n</code> requires
-          <code>Function</code> to meet the requirements of <code>CopyConstructible</code>.
-          </del>
-        </cxx-notes>
-        </del>
-      </cxx-function>
-    </cxx-section>
-
     <cxx-section id="parallel.alg.novec">
       <h1>No vec</h1>