[algorithm.syn] Improve linebreaking.

Author: jensmaurer

source/algorithms.tex

@@ -832,15 +832,13 @@
     template<@\libconcept{input_iterator}@ I1, @\libconcept{sentinel_for}@<I1> S1, @\libconcept{forward_iterator}@ I2, sentinel_for<I2> S2,
              class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
       requires @\libconcept{indirectly_comparable}@<I1, I2, Pred, Proj1, Proj2>
-      constexpr I1 find_first_of(I1 first1, S1 last1, I2 first2, S2 last2,
-                                 Pred pred = {},
+      constexpr I1 find_first_of(I1 first1, S1 last1, I2 first2, S2 last2, Pred pred = {},
                                  Proj1 proj1 = {}, Proj2 proj2 = {});
     template<@\libconcept{input_range}@ R1, @\libconcept{forward_range}@ R2,
              class Pred = ranges::equal_to, class Proj1 = identity, class Proj2 = identity>
       requires @\libconcept{indirectly_comparable}@<iterator_t<R1>, iterator_t<R2>, Pred, Proj1, Proj2>
       constexpr borrowed_iterator_t<R1>
-        find_first_of(R1&& r1, R2&& r2,
-                      Pred pred = {},
+        find_first_of(R1&& r1, R2&& r2, Pred pred = {},
                       Proj1 proj1 = {}, Proj2 proj2 = {});
   }
 
@@ -1097,8 +1095,7 @@
   template<class ForwardIterator, class Size, class T, class BinaryPredicate>
     constexpr ForwardIterator
       search_n(ForwardIterator first, ForwardIterator last,
-               Size count, const T& value,
-               BinaryPredicate pred);
+               Size count, const T& value, BinaryPredicate pred);
   template<class ExecutionPolicy, class ForwardIterator, class Size, class T>
     ForwardIterator
       search_n(ExecutionPolicy&& exec,                          // see \ref{algorithms.parallel.overloads}
@@ -1840,22 +1837,18 @@
   }
 
   template<class RandomAccessIterator>
-    constexpr void partial_sort(RandomAccessIterator first,
-                                RandomAccessIterator middle,
+    constexpr void partial_sort(RandomAccessIterator first, RandomAccessIterator middle,
                                 RandomAccessIterator last);
   template<class RandomAccessIterator, class Compare>
-    constexpr void partial_sort(RandomAccessIterator first,
-                                RandomAccessIterator middle,
+    constexpr void partial_sort(RandomAccessIterator first, RandomAccessIterator middle,
                                 RandomAccessIterator last, Compare comp);
   template<class ExecutionPolicy, class RandomAccessIterator>
     void partial_sort(ExecutionPolicy&& exec,                   // see \ref{algorithms.parallel.overloads}
-                      RandomAccessIterator first,
-                      RandomAccessIterator middle,
+                      RandomAccessIterator first, RandomAccessIterator middle,
                       RandomAccessIterator last);
   template<class ExecutionPolicy, class RandomAccessIterator, class Compare>
     void partial_sort(ExecutionPolicy&& exec,                   // see \ref{algorithms.parallel.overloads}
-                      RandomAccessIterator first,
-                      RandomAccessIterator middle,
+                      RandomAccessIterator first, RandomAccessIterator middle,
                       RandomAccessIterator last, Compare comp);
 
   namespace ranges {
@@ -6975,8 +6968,7 @@
 
 \indexlibraryglobal{partition_copy}%
 \begin{itemdecl}
-template<class InputIterator, class OutputIterator1,
-         class OutputIterator2, class Predicate>
+template<class InputIterator, class OutputIterator1, class OutputIterator2, class Predicate>
   constexpr pair<OutputIterator1, OutputIterator2>
     partition_copy(InputIterator first, InputIterator last,
                    OutputIterator1 out_true, OutputIterator2 out_false, Predicate pred);
@@ -7357,8 +7349,7 @@
 
 \indexlibraryglobal{set_union}%
 \begin{itemdecl}
-template<class InputIterator1, class InputIterator2,
-         class OutputIterator>
+template<class InputIterator1, class InputIterator2, class OutputIterator>
   constexpr OutputIterator
     set_union(InputIterator1 first1, InputIterator1 last1,
               InputIterator2 first2, InputIterator2 last2,
@@ -7371,8 +7362,7 @@
               ForwardIterator2 first2, ForwardIterator2 last2,
               ForwardIterator result);
 
-template<class InputIterator1, class InputIterator2,
-         class OutputIterator, class Compare>
+template<class InputIterator1, class InputIterator2, class OutputIterator, class Compare>
   constexpr OutputIterator
     set_union(InputIterator1 first1, InputIterator1 last1,
               InputIterator2 first2, InputIterator2 last2,
@@ -8357,8 +8347,7 @@
                                         Compare comp);
 template<class ExecutionPolicy, class ForwardIterator, class Compare>
   ForwardIterator min_element(ExecutionPolicy&& exec,
-                              ForwardIterator first, ForwardIterator last,
-                              Compare comp);
+                              ForwardIterator first, ForwardIterator last, Compare comp);
 
 template<@\libconcept{forward_iterator}@ I, @\libconcept{sentinel_for}@<I> S, class Proj = identity,
          @\libconcept{indirect_strict_weak_order}@<projected<I, Proj>> Comp = ranges::less>