Page breaks (jmaurer)

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 = {});
   }
 
@@ -905,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>
@@ -1097,8 +1096,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 +1838,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 {
@@ -2361,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
@@ -2800,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
@@ -4184,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,
@@ -6303,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})$.
@@ -6855,6 +6855,8 @@
     ranges::partition(R&& r, Pred pred, Proj proj = {});
 \end{itemdecl}
 
+\newpage
+
 \begin{itemdescr}
 \pnum
 Let \tcode{proj} be \tcode{identity\{\}}
@@ -6975,8 +6977,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);
@@ -7086,6 +7087,8 @@
 of \tcode{pred} and \tcode{proj}.
 \end{itemdescr}
 
+\newpage
+
 \rSec2[alg.merge]{Merge}
 
 \indexlibraryglobal{merge}%
@@ -7357,8 +7360,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 +7373,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 +8358,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>
@@ -8961,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
@@ -9304,6 +9304,8 @@
   \end{itemize}
   are convertible to \tcode{T}.
 
+\newpage
+
 \pnum
 \expects
 \begin{itemize}
@@ -9757,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>
@@ -10361,6 +10364,8 @@
 \end{codeblock}
 \end{itemdescr}
 
+\enlargethispage{10pt}
+
 \indexlibraryglobal{uninitialized_value_construct_n}%
 \begin{itemdecl}
 namespace ranges {
@@ -10370,6 +10375,8 @@
 }
 \end{itemdecl}
 
+\newpage
+
 \begin{itemdescr}
 \pnum
 \effects

source/atomics.tex

@@ -2588,6 +2588,8 @@
   subtraction     \\
 \end{floattable}
 
+\newpage
+
 \indexlibraryglobal{atomic_fetch_add}%
 \indexlibraryglobal{atomic_fetch_sub}%
 \indexlibraryglobal{atomic_fetch_add_explicit}%
@@ -2753,6 +2755,8 @@
 resulting from this is performed.
 \end{note}
 
+\newpage
+
 \pnum
 \begin{example}
 \begin{codeblock}

source/iostreams.tex

@@ -605,6 +605,8 @@
 declared in \libheaderref{cstdio}.
 \end{itemdescr}
 
+\newpage
+
 \rSec1[iostreams.base]{Iostreams base classes}
 
 \rSec2[ios.syn]{Header \tcode{<ios>} synopsis}
@@ -1742,6 +1744,8 @@
 then the behavior of that function is undefined.
 \indextext{undefined}%
 
+\newpage
+
 \rSec2[ios]{Class template \tcode{basic_ios}}
 
 \rSec3[ios.overview]{Overview}
@@ -7622,6 +7626,8 @@
 then calls \tcode{init_buf_ptrs()}.
 \end{itemdescr}
 
+\newpage
+
 \indexlibraryctor{basic_stringbuf}%
 \begin{itemdecl}
 basic_stringbuf(basic_stringbuf&& rhs);
@@ -8290,6 +8296,8 @@
 \tcode{basic_stringbuf<charT, traits, Allocator>(which | ios_base::in)}\iref{stringbuf.cons}.
 \end{itemdescr}
 
+\newpage
+
 \indexlibraryctor{basic_istringstream}%
 \begin{itemdecl}
 explicit basic_istringstream(
@@ -8659,8 +8667,7 @@
 \begin{itemdecl}
 template<class SAlloc>
   basic_ostringstream(
-    const basic_string<charT, traits, SAlloc>& s,
-    ios_base::openmode which, const Allocator& a);
+    const basic_string<charT, traits, SAlloc>& s, ios_base::openmode which, const Allocator& a);
 \end{itemdecl}
 
 \begin{itemdescr}
@@ -8830,6 +8837,8 @@
 Equivalent to: \tcode{rdbuf()->str(std::move(s));}
 \end{itemdescr}
 
+\newpage
+
 \rSec2[stringstream]{Class template \tcode{basic_stringstream}}
 
 \rSec3[stringstream.general]{General}
@@ -9900,6 +9909,8 @@
 \tcode{pos_type(off_type(-1))}.
 \end{itemdescr}
 
+\newpage
+
 \indexlibrarymember{seekpos}{basic_filebuf}%
 \begin{itemdecl}
 pos_type seekpos(pos_type sp,
@@ -11900,6 +11911,7 @@
     template<class charT, class traits>
       friend basic_ostream<charT, traits>&
         operator<<(basic_ostream<charT, traits>& os, const path& p);
+@\newpage@
     template<class charT, class traits>
       friend basic_istream<charT, traits>&
         operator>>(basic_istream<charT, traits>& is, path& p);
@@ -15489,6 +15501,8 @@
 At most one direct or indirect invocation of \tcode{status(to)}.
 \end{itemdescr}
 
+\newpage
+
 \rSec3[fs.op.copy.symlink]{Copy symlink}
 
 \indexlibraryglobal{copy_symlink}%

source/locales.tex

@@ -1480,7 +1480,7 @@
       using mask = typename ctype<charT>::mask;
       explicit ctype_byname(const char*, size_t refs = 0);
       explicit ctype_byname(const string&, size_t refs = 0);
-
+@\newpage@
     protected:
       ~ctype_byname();
     };

source/regex.tex

@@ -2364,6 +2364,8 @@
 sub-expressions stored in \tcode{*this}.
 \end{itemdescr}
 
+\newpage
+
 \indexlibrarymember{match_results}{end}%
 \begin{itemdecl}
 const_iterator end() const;

source/threads.tex

@@ -2464,6 +2464,8 @@
 \tcode{try_lock_until()}. Only when all levels of ownership have been released
 may ownership of the object be acquired by another thread.
 
+\newpage
+
 \pnum
 The behavior of a program is undefined if:
 \begin{itemize}
@@ -2595,6 +2597,8 @@
 Nothing.
 \end{itemdescr}
 
+\newpage
+
 \rSec4[thread.sharedmutex.class]{Class \tcode{shared_mutex}}
 
 \indexlibraryglobal{shared_mutex}%
@@ -3511,6 +3515,8 @@
 
 \rSec4[thread.lock.shared.general]{General}
 
+\enlargethispage{1ex}
+
 \indexlibraryglobal{shared_lock}%
 \begin{codeblock}
 namespace std {
@@ -4509,6 +4515,8 @@
 exceptions\iref{thread.req.timing}.
 \end{itemdescr}
 
+\newpage
+
 \indexlibrarymember{wait_for}{condition_variable}%
 \begin{itemdecl}
 template<class Rep, class Period>
@@ -6855,6 +6863,8 @@
 \end{itemize}
 \end{itemdescr}
 
+\newpage
+
 \indexlibrarymember{operator=}{shared_future}%
 \begin{itemdecl}
 shared_future& operator=(shared_future&& rhs) noexcept;
@@ -7017,6 +7027,8 @@
 timeout-related exceptions\iref{thread.req.timing}.
 \end{itemdescr}
 
+\newpage
+
 \indexlibrarymember{wait_until}{shared_future}%
 \begin{itemdecl}
 template<class Clock, class Duration>