[algorithm.syn] Fix indenting of parameters in count_if, fill_n, merge, and set_union in synopsis.

Author: Dawn Perchik

source/algorithms.tex

@@ -165,7 +165,7 @@
   template<class ExecutionPolicy, class ForwardIterator, class Predicate>
     typename iterator_traits<ForwardIterator>::difference_type
       count_if(ExecutionPolicy&& exec, // see \ref{algorithms.parallel.overloads}
-            ForwardIterator first, ForwardIterator last, Predicate pred);
+               ForwardIterator first, ForwardIterator last, Predicate pred);
 
   // \ref{mismatch}, mismatch
   template<class InputIterator1, class InputIterator2>
@@ -427,7 +427,7 @@
   template<class ExecutionPolicy, class ForwardIterator,
            class Size, class T>
     ForwardIterator fill_n(ExecutionPolicy&& exec, // see \ref{algorithms.parallel.overloads}
-                          ForwardIterator first, Size n, const T& value);
+                           ForwardIterator first, Size n, const T& value);
 
   // \ref{alg.generate}, generate
   template<class ForwardIterator, class Generator>
@@ -752,15 +752,15 @@
   template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2,
            class ForwardIterator>
     ForwardIterator merge(ExecutionPolicy&& exec, // see \ref{algorithms.parallel.overloads}
-                         ForwardIterator1 first1, ForwardIterator1 last1,
-                         ForwardIterator2 first2, ForwardIterator2 last2,
-                         ForwardIterator result);
+                          ForwardIterator1 first1, ForwardIterator1 last1,
+                          ForwardIterator2 first2, ForwardIterator2 last2,
+                          ForwardIterator result);
   template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2,
            class ForwardIterator, class Compare>
     ForwardIterator merge(ExecutionPolicy&& exec, // see \ref{algorithms.parallel.overloads}
-                         ForwardIterator1 first1, ForwardIterator1 last1,
-                         ForwardIterator2 first2, ForwardIterator2 last2,
-                         ForwardIterator result, Compare comp);
+                          ForwardIterator1 first1, ForwardIterator1 last1,
+                          ForwardIterator2 first2, ForwardIterator2 last2,
+                          ForwardIterator result, Compare comp);
 
   template<class BidirectionalIterator>
     void inplace_merge(BidirectionalIterator first,
@@ -809,15 +809,15 @@
   template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2,
            class ForwardIterator>
     ForwardIterator set_union(ExecutionPolicy&& exec, // see \ref{algorithms.parallel.overloads}
-                             ForwardIterator1 first1, ForwardIterator1 last1,
-                             ForwardIterator2 first2, ForwardIterator2 last2,
-                             ForwardIterator result);
+                              ForwardIterator1 first1, ForwardIterator1 last1,
+                              ForwardIterator2 first2, ForwardIterator2 last2,
+                              ForwardIterator result);
   template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2,
            class ForwardIterator, class Compare>
     ForwardIterator set_union(ExecutionPolicy&& exec, // see \ref{algorithms.parallel.overloads}
-                             ForwardIterator1 first1, ForwardIterator1 last1,
-                             ForwardIterator2 first2, ForwardIterator2 last2,
-                             ForwardIterator result, Compare comp);
+                              ForwardIterator1 first1, ForwardIterator1 last1,
+                              ForwardIterator2 first2, ForwardIterator2 last2,
+                              ForwardIterator result, Compare comp);
 
   template<class InputIterator1, class InputIterator2, class OutputIterator>
     constexpr OutputIterator set_intersection(