Eliminate requires, complexity, & notes clauses for reduce's special forms.

Author: jaredhoberock

algorithms.html

@@ -550,20 +550,24 @@ <h1>Reduce</h1>
         </cxx-returns>
 
         <cxx-requires>
-          <code>typename iterator_traits&lt;InputIterator&gt;::value_type{}</code>
-          shall be a valid expression. The <code>operator+</code> function associated with
-          <code>iterator_traits&lt;InputIterator&gt;::value_type</code> shall not invalidate iterators or
-          subranges, nor modify elements in the range <code>[first,last)</code>.
+          <del2>
+            <code>typename iterator_traits&lt;InputIterator&gt;::value_type{}</code>
+            shall be a valid expression. The <code>operator+</code> function associated with
+            <code>iterator_traits&lt;InputIterator&gt;::value_type</code> shall not invalidate iterators or
+            subranges, nor modify elements in the range <code>[first,last)</code>.
+          </del2>
         </cxx-requires>
 
         <cxx-complexity>
-          O(<code>last - first</code>) applications of <code>operator+</code>.
+          <del2>O(<code>last - first</code>) applications of <code>operator+</code>.</del2>
         </cxx-complexity>
 
         <cxx-notes>
-          The primary difference between <code>reduce</code> and <code>accumulate</code> is that the behavior
-          of <code>reduce</code> may be non-deterministic for non-associative or non-commutative
-          <code>operator+</code>.
+          <del2>
+            The primary difference between <code>reduce</code> and <code>accumulate</code> is that the behavior
+            of <code>reduce</code> may be non-deterministic for non-associative or non-commutative
+            <code>operator+</code>.
+          </del2>
         </cxx-notes>
       </cxx-function>
 
@@ -578,17 +582,21 @@ <h1>Reduce</h1>
         </cxx-returns>
 
         <cxx-requires>
-          The <code>operator+</code> function associated with <code>T</code> shall not invalidate iterators
-          or subranges, nor modify elements in the range <code>[first,last)</code>.
+          <del2>
+            The <code>operator+</code> function associated with <code>T</code> shall not invalidate iterators
+            or subranges, nor modify elements in the range <code>[first,last)</code>.
+          </del2>
         </cxx-requires>
 
         <cxx-complexity>
-          O(<code>last - first</code>) applications of <code>operator+</code>.
+          <del2>O(<code>last - first</code>) applications of <code>operator+</code>.</del2>
         </cxx-complexity>
 
         <cxx-notes>
-          The primary difference between <code>reduce</code> and <code>accumulate</code> is that the behavior
-          of <code>reduce</code> may be non-deterministic for non-associative or non-commutative <code>operator+</code>.
+          <del2>
+            The primary difference between <code>reduce</code> and <code>accumulate</code> is that the behavior
+            of <code>reduce</code> may be non-deterministic for non-associative or non-commutative <code>operator+</code>.
+          </del2>
         </cxx-notes>
       </cxx-function>