[algorithm] Page breaks

Author: jensmaurer

source/algorithms.tex

@@ -903,6 +903,7 @@
              @\libconcept{indirect_unary_predicate}@<projected<I, Proj>> Pred>
       constexpr iter_difference_t<I>
         count_if(I first, S last, Pred pred, Proj proj = {});
+@\newpage@
     template<@\libconcept{input_range}@ R, class Proj = identity,
              @\libconcept{indirect_unary_predicate}@<projected<iterator_t<R>, Proj>> Pred>
       constexpr range_difference_t<R>
@@ -2354,6 +2355,7 @@
                        ForwardIterator1 first1, ForwardIterator1 last1,
                        ForwardIterator2 first2, ForwardIterator2 last2,
                        ForwardIterator result);
+@\newpage@
   template<class ExecutionPolicy, class ForwardIterator1, class ForwardIterator2,
            class ForwardIterator, class Compare>
     ForwardIterator
@@ -2793,6 +2795,7 @@
                                 Proj1 proj1 = {}, Proj2 proj2 = {});
   }
 
+@\newpage@
   // \ref{alg.three.way}, three-way comparison algorithms
   template<class InputIterator1, class InputIterator2, class Cmp>
     constexpr auto
@@ -4177,6 +4180,8 @@
 At most \tcode{last - first} applications of the corresponding predicate.
 \end{itemdescr}
 
+\newpage
+
 \indexlibraryglobal{search_n}%
 \begin{itemdecl}
 template<@\libconcept{forward_iterator}@ I, @\libconcept{sentinel_for}@<I> S, class T,
@@ -6296,6 +6301,8 @@
                               Proj1 proj1 = {}, Proj2 proj2 = {});
 \end{itemdecl}
 
+\newpage
+
 \begin{itemdescr}
 \pnum
 Let $N$ be $\min(\tcode{last - first}, \ \tcode{result_last - result_first})$.
@@ -6848,6 +6855,8 @@
     ranges::partition(R&& r, Pred pred, Proj proj = {});
 \end{itemdecl}
 
+\newpage
+
 \begin{itemdescr}
 \pnum
 Let \tcode{proj} be \tcode{identity\{\}}
@@ -7078,6 +7087,8 @@
 of \tcode{pred} and \tcode{proj}.
 \end{itemdescr}
 
+\newpage
+
 \rSec2[alg.merge]{Merge}
 
 \indexlibraryglobal{merge}%
@@ -8950,7 +8961,7 @@
                                ForwardIterator1 first, ForwardIterator1 last,
                                ForwardIterator2 result,
                                BinaryOperation binary_op, UnaryOperation unary_op, T init);
-
+@\enlargethispage{10pt}@
   // \ref{adjacent.difference}, adjacent difference
   template<class InputIterator, class OutputIterator>
     constexpr OutputIterator
@@ -9293,6 +9304,8 @@
   \end{itemize}
   are convertible to \tcode{T}.
 
+\newpage
+
 \pnum
 \expects
 \begin{itemize}
@@ -9746,6 +9759,7 @@
     transform_inclusive_scan(InputIterator first, InputIterator last,
                              OutputIterator result,
                              BinaryOperation binary_op, UnaryOperation unary_op);
+@\newpage@
 template<class ExecutionPolicy,
          class ForwardIterator1, class ForwardIterator2,
          class BinaryOperation, class UnaryOperation>
@@ -10350,6 +10364,8 @@
 \end{codeblock}
 \end{itemdescr}
 
+\enlargethispage{10pt}
+
 \indexlibraryglobal{uninitialized_value_construct_n}%
 \begin{itemdecl}
 namespace ranges {
@@ -10359,6 +10375,8 @@
 }
 \end{itemdecl}
 
+\newpage
+
 \begin{itemdescr}
 \pnum
 \effects