Remove awkward \linebreaks.

Author: Eelis

source/algorithms.tex

@@ -5588,7 +5588,7 @@
     \tcode{invoke(op, invoke(proj, *(first1 + (i - result))))}
     for unary transforms defined in namespace \tcode{ranges};
   \item
-    \tcode{invoke(binary_op, invoke(proj1, *(first1 + (i - result))), invoke(proj2,\linebreak *(first2 + (i - result))))}
+    \tcode{invoke(binary_op, invoke(proj1, *(first1 + (i - result))), invoke(proj2, *(first2 + (i - result))))}
     for binary transforms defined in namespace \tcode{ranges}.
   \end{itemize}
 \end{itemize}
@@ -11738,7 +11738,7 @@
 \pnum
 \constraints
 \tcode{is_unbounded_array_v<T>} is \tcode{false}.
-The expression \tcode{::new (declval<void*>()) T(\linebreak{}declval<Args>()...)}
+The expression \tcode{::new (declval<void*>()) T(declval<Args>()...)}
 is well-formed when treated as an unevaluated operand\iref{term.unevaluated.operand}.
 
 \pnum

source/containers.tex

@@ -1456,7 +1456,7 @@
 \pnum
 \recommended
 If \tcode{R} models \tcode{ranges::\libconcept{approximately_sized_range}} and
-\tcode{ranges::distance(\linebreak{}rg) <= ranges::reserve_hint(rg)} is \tcode{true},
+\tcode{ranges::distance(rg) <= ranges::reserve_hint(rg)} is \tcode{true},
 an implementation should not perform more than a single reallocation.
 
 \pnum
@@ -1828,7 +1828,7 @@
 \pnum
 \recommended
 If \tcode{R} models \tcode{ranges::\libconcept{approximately_sized_range}} and
-\tcode{ranges::distance(\linebreak{}rg) <= ranges::reserve_hint(rg)} is \tcode{true},
+\tcode{ranges::distance(rg) <= ranges::reserve_hint(rg)} is \tcode{true},
 an implementation should not perform any reallocation.
 \end{itemdescr}
 
@@ -2444,8 +2444,7 @@
 Assigns \tcode{nh.ptr_} to \tcode{ptr_}.
 \item
 If \tcode{!alloc\textunderscore} or \tcode{ator_traits::propagate_on_container_move_assignment::value}
-is \tcode{true}, \linebreak
-move assigns \tcode{nh.alloc_} to \tcode{alloc_}.
+is \tcode{true}, move assigns \tcode{nh.alloc_} to \tcode{alloc_}.
 \item
 Assigns
 \keyword{nullptr} to \tcode{nh.ptr_} and assigns \tcode{nullopt} to
@@ -7467,14 +7466,14 @@
 \pnum
 \expects
 \tcode{T} is \oldconcept{EmplaceConstructible} into \tcode{forward_list}
-from \tcode{std::forward<Args>(\linebreak args)...}.
+from \tcode{std::forward<Args>(args)...}.
 \tcode{position} is \tcode{before_begin()} or is a dereferenceable
 iterator in the range \range{begin()}{end()}.
 
 \pnum
 \effects
 Inserts an object of type \tcode{value_type} direct-non-list-initialized with
-\tcode{std::forward<Args>(\linebreak args)...} after \tcode{position}.
+\tcode{std::forward<Args>(args)...} after \tcode{position}.
 
 \pnum
 \returns
@@ -10633,7 +10632,7 @@
 \pnum
 The expression
 \tcode{\exposid{is-vector-bool-reference}<T>} is \tcode{true}
-if \tcode{T} denotes the type \tcode{vector<bool, Alloc>::\linebreak{}reference}
+if \tcode{T} denotes the type \tcode{vector<bool, Alloc>::reference}
 for some type \tcode{Alloc} and
 \tcode{vector<bool, Alloc>} is not a program-defined specialization.
 \end{itemdescr}
@@ -12025,7 +12024,7 @@
 Otherwise, let \tcode{r} be \tcode{equal_range(k)}.
 Constructs an object \tcode{u} of type \tcode{value_type} with
 \tcode{piecewise_construct, forward_as_tuple(std::forward<K>(k)),
-forward_as_tuple(std::forward<Args>(args)...)}.\linebreak
+forward_as_tuple(std::forward<Args>(args)...)}.
 If \tcode{equal_range(u.first) == r} is \tcode{false},
 the behavior is undefined.
 Inserts \tcode{u} into \tcode{*this}.
@@ -17511,7 +17510,7 @@
 \pnum
 \effects
 Equivalent to \tcode{flat_map(sorted_unique, key_cont, mapped_cont)} and
-\tcode{flat_map(sorted_unique, key_cont, \linebreak{}mapped_cont, comp)}, respectively,
+\tcode{flat_map(sorted_unique, key_cont, mapped_cont, comp)}, respectively,
 except that \tcode{\exposid{c}.keys} and \tcode{\exposid{c}.values} are constructed
 with uses-allocator construction\iref{allocator.uses.construction}.
 
@@ -17695,7 +17694,7 @@
 \pnum
 \effects
 Initializes an object \tcode{t} of type \tcode{pair<key_type, mapped_type>}
-with \tcode{std::forward<Args>(\linebreak args)...};
+with \tcode{std::forward<Args>(args)...};
 if the map already contains an element
 whose key is equivalent to \tcode{t.first},
 \tcode{*this} is unchanged.
@@ -17972,7 +17971,7 @@
 \effects
 If the map already contains an element \tcode{e}
 whose key is equivalent to \tcode{k},
-assigns \tcode{std::forward<\linebreak M>(obj)} to \tcode{e.second}.
+assigns \tcode{std::forward<M>(obj)} to \tcode{e.second}.
 Otherwise, equivalent to
 \begin{codeblock}
 try_emplace(std::forward<decltype(k)>(k), std::forward<M>(obj))
@@ -18027,7 +18026,7 @@
 \effects
 If the map already contains an element \tcode{e}
 whose key is equivalent to \tcode{k},
-assigns \tcode{std::forward<\linebreak M>(obj)} to \tcode{e.second}.
+assigns \tcode{std::forward<M>(obj)} to \tcode{e.second}.
 Otherwise, equivalent to
 \begin{codeblock}
 try_emplace(std::forward<K>(k), std::forward<M>(obj))
@@ -18641,14 +18640,14 @@
 \pnum
 \effects
 Equivalent to \tcode{flat_multimap(key_cont, mapped_cont)} and
-\tcode{flat_multimap(key_cont, \linebreak{}mapped_cont, comp)}, respectively,
+\tcode{flat_multimap(key_cont, mapped_cont, comp)}, respectively,
 except that \tcode{\exposid{c}.keys} and \tcode{\exposid{c}.values} are constructed
 with uses-allocator construction\iref{allocator.uses.construction}.
 
 \pnum
 \complexity
 Same as \tcode{flat_multimap(key_cont, mapped_cont)} and
-\tcode{flat_multimap(key_cont, \linebreak{}mapped_cont, comp)}, respectively.
+\tcode{flat_multimap(key_cont, mapped_cont, comp)}, respectively.
 \end{itemdescr}
 
 \indexlibraryctor{flat_multimap}%
@@ -23202,7 +23201,7 @@
 \item
 If \exposid{rank_} is greater than one,
 then the product of
-\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(\linebreak 0))} and
+\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(0))} and
 all values \tcode{ext.extent($k$)}
 with $k$ in the range of \range{1}{\exposid{rank_}}
 is representable as a value of type \tcode{index_type}.
@@ -23281,7 +23280,7 @@
 \item
 If \exposid{rank_} is greater than \tcode{1} and
 \tcode{padding_value} does not equal \tcode{dynamic_extent},
-then \tcode{other.\linebreak stride(1)} equals
+then \tcode{other.stride(1)} equals
 \begin{codeblock}
 @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value,
                         extents_type::@\exposid{index-cast}@(other.extents().extent(0)))
@@ -23348,7 +23347,7 @@
 \item
 If \exposid{rank_} is greater than 1 and
 \tcode{padding_value} does not equal \tcode{dynamic_extent},
-then \tcode{other.\linebreak stride(1)} equals
+then \tcode{other.stride(1)} equals
 \begin{codeblock}
 @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value,
                         extents_type::@\exposid{index-cast}@(other.extent(0)))
@@ -23746,7 +23745,7 @@
 if \exposid{static-padding-stride} is not \tcode{dynamic_extent}.
 \begin{note}
 Using \tcode{extents<index_type, \exposid{static-padding-stride}>}
-instead of \tcode{index_type} as the type of \exposid{stride-\linebreak rm2}
+instead of \tcode{index_type} as the type of \exposid{stride-rm2}
 would achieve this.
 \end{note}
 \end{itemdescr}
@@ -23829,13 +23828,13 @@
 \item
 If \exposid{rank_} is greater than one,
 then the product of
-\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(\exposid{\linebreak rank_} - 1))} and
+\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(\exposid{rank_} - 1))} and
 all values \tcode{ext.extent($k$)}
 with $k$ in the range of \range{0}{\exposid{rank_} - 1}
 is representable as a value of type \tcode{index_type}.
 \item
 If \tcode{padding_value} is not equal to \tcode{dynamic_extent},
-\tcode{padding_value} equals \tcode{extents_type::\linebreak \exposid{index-cast}(pad)}.
+\tcode{padding_value} equals \tcode{extents_type::\exposid{index-cast}(pad)}.
 \end{itemize}
 
 \pnum
@@ -23908,7 +23907,7 @@
 \item
 If \exposid{rank_} is greater than 1 and
 \tcode{padding_value} does not equal \tcode{dynamic_extent},
-then \tcode{other.\linebreak stride(\exposid{rank_} - 2)} equals
+then \tcode{other.stride(\exposid{rank_} - 2)} equals
 \begin{codeblock}
 @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value,
                         extents_type::@\exposid{index-cast}@(other.extents().extent(@\exposid{rank_}@ - 1)))
@@ -23976,7 +23975,7 @@
 \item
 If \exposid{rank_} is greater than 1 and
 \tcode{padding_value} does not equal \tcode{dynamic_extent},
-then \tcode{other.\linebreak stride(\exposid{rank_} - 2)} equals
+then \tcode{other.stride(\exposid{rank_} - 2)} equals
 \begin{codeblock}
 @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value,
                         extents_type::@\exposid{index-cast}@(other.extent(@\exposid{rank_}@ - 1)))
@@ -25565,7 +25564,7 @@
 \item
 \tcode{stride(k) * \exposid{de-ice}($s_k$.stride)}
 if $S_k$ is a specialization of \tcode{strided_slice} and
-\tcode{$s_k$.stride < $s_k$.\linebreak extent} is \tcode{true};
+\tcode{$s_k$.stride < $s_k$.extent} is \tcode{true};
 \item
 otherwise, \tcode{stride($k$)}.
 \end{itemize}
@@ -25963,11 +25962,11 @@
 \begin{itemize}
 \item
 \tcode{decltype(submdspan_mapping(src.mapping(), slices...))}
-is a specialization of \tcode{submd-\linebreak{}span_mapping_result}.
+is a specialization of \tcode{submdspan_mapping_result}.
 
 \item
 \tcode{is_same_v<remove_cvref_t<decltype(sub_map_offset.mapping.extents())>,}
-\tcode{decltype(\linebreak{}submdspan_extents(src.mapping(), slices...))>}
+\tcode{decltype(submdspan_extents(src.mapping(), slices...))>}
 is \tcode{true}.
 
 \item
@@ -25997,11 +25996,11 @@
   \item
   $0 \le \tcode{\exposid{first_}<index_type, $k$>(slices...)}$
   $\le \tcode{\exposid{last_}<$k$>(src.extents(), slices...)}$
-  $\le \tcode{\linebreak{}src.extent($k$)}$
+  $\le \tcode{src.extent($k$)}$
   \end{itemize}
 
 \item
-\tcode{sub_map_offset.mapping.extents() == submdspan_extents(src.mapping(), slices...)}\linebreak
+\tcode{sub_map_offset.mapping.extents() == submdspan_extents(src.mapping(), slices...)}
 is \tcode{true}; and
 
 \item

source/exec.tex

@@ -2831,7 +2831,7 @@
 Let \tcode{out_sndr} and \tcode{env} be subexpressions
 such that \tcode{OutSndr} is \tcode{decltype((out_sndr))}.
 If \tcode{\exposconcept{sender-for}<Out\-Sndr, starts_on_t>} is \tcode{false},
-then the expressions \tcode{starts_on.transform_env(out_sndr, env)} and\linebreak
+then the expressions \tcode{starts_on.transform_env(out_sndr, env)} and
 \tcode{starts_on.transform_sender(out_sndr, env)} are ill-formed; otherwise
 \begin{itemize}
 \item
@@ -3183,7 +3183,7 @@
 \pnum
 Let \tcode{out_sndr} and \tcode{env} be subexpressions,
 let \tcode{OutSndr} be \tcode{decltype((out_sndr))}, and
-let \tcode{Env} be \tcode{decltype((\linebreak env))}.
+let \tcode{Env} be \tcode{decltype((env))}.
 If \tcode{\exposconcept{sender-for}<OutSndr, on_t>} is \tcode{false},
 then the expressions \tcode{on.transform_env(out_sndr, env)} and
 \tcode{on.transform_sender(out_sndr, env)} are ill-formed.
@@ -3345,7 +3345,7 @@
 For subexpressions \tcode{sndr} and \tcode{f},
 if \tcode{decltype((sndr))} does not satisfy \libconcept{sender}, or
 \tcode{decltype((f))} does not satisfy \exposconcept{movable-value},
-\tcode{\exposid{then-cpo}(\linebreak sndr, f) }is ill-formed.
+\tcode{\exposid{then-cpo}(sndr, f) }is ill-formed.
 
 \pnum
 Otherwise,
@@ -3526,7 +3526,7 @@
 Let \tcode{LetSigs} be a pack of those types in \tcode{Sigs}
 with a return type of \tcode{\exposid{decayed-typeof}<\exposid{set-cpo}>}.
 Let \exposid{as-tuple} be an alias template
-such that \tcode{\exposid{as-tuple}<\linebreak Tag(Args...)>} denotes
+such that \tcode{\exposid{as-tuple}<Tag(Args...)>} denotes
 the type \tcode{\exposid{decayed-tuple}<Args...>}.
 Then \tcode{args_variant_t} denotes
 the type \tcode{variant<monostate, \exposid{as-tuple}<LetSigs>...>}
@@ -3581,7 +3581,7 @@
 Let \tcode{sndr} and \tcode{env} be subexpressions, and
 let \tcode{Sndr} be \tcode{decltype((sndr))}.
 If
-\tcode{\exposconcept{sender-for}<Sndr, \exposid{decayed-\linebreak typeof}<\exposid{let-cpo}>>}
+\tcode{\exposconcept{sender-for}<Sndr, \exposid{decayed-typeof}<\exposid{let-cpo}>>}
 is \tcode{false},
 then the expression \tcode{\exposid{let-cpo}.transform_env(sndr, env)}
 is ill-formed.
@@ -4338,7 +4338,7 @@
 \end{codeblock}
 if the expression \tcode{\exposid{decayed-tuple}<decltype(as)...>\{as...\}}
 is potentially throwing;
-otherwise, \tcode{o.emplace(\linebreak as...)}.
+otherwise, \tcode{o.emplace(as...)}.
 
 \pnum
 The expression \tcode{when_all_with_variant(sndrs...)}
@@ -4651,7 +4651,7 @@
 
 \pnum
 For a subexpression \tcode{sndr}, let \tcode{Sndr} be \tcode{decltype((sndr))}.
-If \tcode{\libconcept{sender_to}<Sndr, \exposid{sync-wait-receiver}<\linebreak Sndr>>}
+If \tcode{\libconcept{sender_to}<Sndr, \exposid{sync-wait-receiver}<Sndr>>}
 is \tcode{false},
 the expression \tcode{sync_wait.apply_sender(sndr)} is ill-formed;
 otherwise, it is equivalent to:
@@ -4722,7 +4722,7 @@
 
 \pnum
 If \tcode{\exposconcept{callable}<sync_wait_t, Sndr>} is \tcode{false},
-the expression \tcode{sync_wait_with_variant.apply_sender(\linebreak sndr)} is ill-formed.
+the expression \tcode{sync_wait_with_variant.apply_sender(sndr)} is ill-formed.
 Otherwise, it is equivalent to:
 \begin{codeblock}
 using result_type = @\exposid{sync-wait-with-variant-result-type}@<Sndr>;
@@ -4962,7 +4962,7 @@
 Let \tcode{Es} be a pack of the types in the \exposid{type-list} named by
 \tcode{\exposid{gather-signatures}<set_error_t, InputSigna\-tures, type_identity_t, \exposid{error-list}>},
 where \exposid{error-list} is an alias template
-such that \tcode{\exposid{error-list}<\linebreak Ts...>} is
+such that \tcode{\exposid{error-list}<Ts...>} is
 \tcode{\exposid{type-list}<SetError<Ts>...>}.
 
 \pnum

source/memory.tex

@@ -1255,7 +1255,7 @@
 \begin{itemize}
 \item
   If \tcode{uses_allocator_v<remove_cv_t<T>, Alloc>} is \tcode{false} and
-  \tcode{is_constructible_v<T,\linebreak Args...>} is \tcode{true},
+  \tcode{is_constructible_v<T, Args...>} is \tcode{true},
   return \tcode{forward_as_tuple(std::forward<Args>(args)...)}.
 \item
   Otherwise, if \tcode{uses_allocator_v<remove_cv_t<T>, Alloc>} is \tcode{true} and
@@ -4188,7 +4188,7 @@
   the allocator \tcode{a} passed to \tcode{allocate_shared}.
 \item
   When a (sub)object of non-array type \tcode{U} is initialized by
-  \tcode{make_shared_for_overwrite} or\linebreak % avoid Overfull
+  \tcode{make_shared_for_overwrite} or
   \tcode{allocate_shared_for_overwrite},
   it is initialized via the expression \tcode{::new(pv) U},
   where \tcode{pv} has type \tcode{void*} and
@@ -5423,7 +5423,7 @@
 \end{codeblock}
 if the expression
 \tcode{s.reset(static_cast<SP>(p), std::forward<Args>(args)...)}
-is well-\linebreak formed;
+is well-formed;
 \item
 otherwise,
 \begin{codeblock}

source/meta.tex

@@ -2184,7 +2184,7 @@
   \item Let \tcode{R} be \tcode{\placeholdernc{COMMON-REF}(T1, T2)}.
     If \tcode{T1} and \tcode{T2} are reference types,
     \tcode{R} is well-formed, and
-    \tcode{is_convertible_v<add_pointer_t<T1>, add_pointer_t<R>> \&\& is_convertible_v<add_poin\linebreak{}ter_t<T2>, add_pointer_t<R>>} is \tcode{true},
+    \tcode{is_convertible_v<add_pointer_t<T1>, add_pointer_t<R>> \&\& is_convertible_v<add_pointer_t<T2>, add_pointer_t<R>>} is \tcode{true},
     then the member typedef \tcode{type} denotes \tcode{R}.
 
   \item Otherwise, if

source/numerics.tex

@@ -13781,7 +13781,7 @@
 \mandates
 Let \tcode{a} be
 \tcode{\exposid{abs-if-needed}(declval<typename InVec::value_type>())}.
-Then, \tcode{decltype(\linebreak init + a * a} is convertible to \tcode{Scalar}.
+Then, \tcode{decltype(init + a * a} is convertible to \tcode{Scalar}.
 
 \pnum
 \returns
@@ -13987,7 +13987,7 @@
 \mandates
 Let \tcode{a} be
 \tcode{\exposid{abs-if-needed}(declval<typename InMat::value_type>())}.
-Then, \tcode{decltype(\linebreak init + a * a)}
+Then, \tcode{decltype(init + a * a)}
 is convertible to \tcode{Scalar}.
 
 \pnum