Merge pull request #4 from jaredhoberock/master

Fixes to recent issues

Author: jaredhoberock

algorithms.html

@@ -377,6 +377,10 @@ <h1>For each</h1>
           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.
+
+          Unlike its sequential form, the parallel overload of <code>for_each</code> requires
+          <code>Function</code> to meet the requirements of <code>CopyConstructible</code>, but not
+          <code>MoveConstructible</code>.
         </cxx-notes>
       </cxx-function>
 
@@ -442,8 +446,9 @@ <h1>For each</h1>
         </cxx-remarks>
 
         <cxx-notes>
-          Unlike its sequential form, the parallel overload of <code>for_each_n</code> does not require
-          <code>Function</code> to meet the requirements of <code>MoveConstructible</code>.
+          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>, but not
+          <code>MoveConstructible</code>.
         </cxx-notes>
       </cxx-function>
     </cxx-section>

execution_policies.html

@@ -172,7 +172,8 @@ <h1>Dynamic execution policy</h1>
     <cxx-example>
       <pre>std::vector&lt;float&gt; sort_me = ...
 
-std::execution_policy exec = std::seq;
+using namespace std::experimental::parallel;
+execution_policy exec = seq;
 
 if(sort_me.size() &gt; threshold)
 {