[iterators] Add page breaks, and reflow some code lines.

Author: tkoeppe

source/iterators.tex

@@ -426,6 +426,7 @@
     -> decltype(std::begin(c));
   template<class C> constexpr auto cend(const C& c) noexcept(noexcept(std::end(c)))
     -> decltype(std::end(c));
+
   template<class C> constexpr auto rbegin(C& c) -> decltype(c.rbegin());
   template<class C> constexpr auto rbegin(const C& c) -> decltype(c.rbegin());
   template<class C> constexpr auto rend(C& c) -> decltype(c.rend());
@@ -442,9 +443,11 @@
   template<class C> constexpr auto ssize(const C& c)
     -> common_type_t<ptrdiff_t, make_signed_t<decltype(c.size())>>;
   template<class T, ptrdiff_t N> constexpr ptrdiff_t ssize(const T (&array)[N]) noexcept;
+
   template<class C> [[nodiscard]] constexpr auto empty(const C& c) -> decltype(c.empty());
   template<class T, size_t N> [[nodiscard]] constexpr bool empty(const T (&array)[N]) noexcept;
   template<class E> [[nodiscard]] constexpr bool empty(initializer_list<E> il) noexcept;
+
   template<class C> constexpr auto data(C& c) -> decltype(c.data());
   template<class C> constexpr auto data(const C& c) -> decltype(c.data());
   template<class T, size_t N> constexpr T* data(T (&array)[N]) noexcept;
@@ -1523,6 +1526,8 @@
     @\exposconcept{weakly-equality-comparable-with}@<S, I>;      // see \ref{concept.equalitycomparable}
 \end{itemdecl}
 
+\newpage
+
 \begin{itemdescr}
 \pnum
 Let \tcode{s} and \tcode{i} be values of type \tcode{S} and
@@ -2423,8 +2428,7 @@
 \begin{codeblock}
 template<class In, class Out>
   concept @\deflibconcept{indirectly_movable}@ =
-    @\libconcept{indirectly_readable}@<In> &&
-    @\libconcept{indirectly_writable}@<Out, iter_rvalue_reference_t<In>>;
+    @\libconcept{indirectly_readable}@<In> && @\libconcept{indirectly_writable}@<Out, iter_rvalue_reference_t<In>>;
 \end{codeblock}
 
 \pnum
@@ -2542,9 +2546,7 @@
 \begin{codeblock}
 template<class I>
   concept @\deflibconcept{permutable}@ =
-    @\libconcept{forward_iterator}@<I> &&
-    @\libconcept{indirectly_movable_storable}@<I, I> &&
-    @\libconcept{indirectly_swappable}@<I, I>;
+    @\libconcept{forward_iterator}@<I> && @\libconcept{indirectly_movable_storable}@<I, I> && @\libconcept{indirectly_swappable}@<I, I>;
 \end{codeblock}
 
 \rSec3[alg.req.mergeable]{Concept \cname{mergeable}}
@@ -2910,6 +2912,8 @@
 the ending and starting positions of \tcode{i}.
 \end{itemdescr}
 
+\newpage
+
 \rSec3[range.iter.op.distance]{\tcode{ranges::distance}}
 \indexlibraryglobal{distance}%
 \begin{itemdecl}
@@ -3477,6 +3481,8 @@
 \tcode{x.base() < y.base()}.
 \end{itemdescr}
 
+\newpage
+
 \indexlibrarymember{operator<=}{reverse_iterator}%
 \begin{itemdecl}
 template<class Iterator1, class Iterator2>
@@ -4690,8 +4696,10 @@
 void fun(ForwardIterator begin, ForwardIterator end);
 
 list<int> s;
+
 // populate the list \tcode{s}
 using CI = common_iterator<counted_iterator<list<int>::iterator>, default_sentinel_t>;
+
 // call \tcode{fun} on a range of 10 ints
 fun(CI(counted_iterator(s.begin(), 10)), CI(default_sentinel));
 \end{codeblock}
@@ -5108,6 +5116,8 @@
 a range of $N$ elements starting at a given position
 without needing to know the end position a priori.
 
+\newpage
+
 \pnum
 \begin{example}
 \begin{codeblock}