diff --git a/source/algorithms.tex b/source/algorithms.tex index 8442cb43e6..b6b8cdf13a 100644 --- a/source/algorithms.tex +++ b/source/algorithms.tex @@ -5602,7 +5602,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} diff --git a/source/containers.tex b/source/containers.tex index e36e8c065d..335461f106 100644 --- a/source/containers.tex +++ b/source/containers.tex @@ -2373,8 +2373,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 @@ -7389,14 +7388,14 @@ \pnum \expects \tcode{T} is \oldconcept{EmplaceConstructible} into \tcode{forward_list} -from \tcode{std::forward(\linebreak args)...}. +from \tcode{std::forward(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(\linebreak args)...} after \tcode{position}. +\tcode{std::forward(args)...} after \tcode{position}. \pnum \returns @@ -9418,7 +9417,7 @@ \pnum The expression \tcode{\exposid{is-vector-bool-reference}} is \tcode{true} -if \tcode{T} denotes the type \tcode{vector::\linebreak{}reference} +if \tcode{T} denotes the type \tcode{vector::reference} for some type \tcode{Alloc} and \tcode{vector} is not a program-defined specialization. \end{itemdescr} @@ -10809,7 +10808,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)), -forward_as_tuple(std::forward(args)...)}.\linebreak +forward_as_tuple(std::forward(args)...)}. If \tcode{equal_range(u.first) == r} is \tcode{false}, the behavior is undefined. Inserts \tcode{u} into \tcode{*this}. @@ -16266,7 +16265,7 @@ \pnum \effects Equivalent to \tcode{flat_map(s, key_cont, mapped_cont)} and -\tcode{flat_map(s, key_cont, \linebreak{}mapped_cont, comp)}, respectively, +\tcode{flat_map(s, key_cont, mapped_cont, comp)}, respectively, except that \tcode{c.keys} and \tcode{c.values} are constructed with uses-allocator construction\iref{allocator.uses.construction}. @@ -16449,7 +16448,7 @@ \pnum \effects Initializes an object \tcode{t} of type \tcode{pair} -with \tcode{std::forward(\linebreak args)...}; +with \tcode{std::forward(args)...}; if the map already contains an element whose key is equivalent to \tcode{t.first}, \tcode{*this} is unchanged. @@ -16726,7 +16725,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(obj)} to \tcode{e.second}. Otherwise, equivalent to \begin{codeblock} try_emplace(std::forward(k), std::forward(obj)) @@ -16781,7 +16780,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(obj)} to \tcode{e.second}. Otherwise, equivalent to \begin{codeblock} try_emplace(std::forward(k), std::forward(obj)) @@ -17386,14 +17385,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{c.keys} and \tcode{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}% @@ -21915,7 +21914,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}. @@ -21994,7 +21993,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))) @@ -22061,7 +22060,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))) @@ -22459,7 +22458,7 @@ if \exposid{static-padding-stride} is not \tcode{dynamic_extent}. \begin{note} Using \tcode{extents} -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} @@ -22542,13 +22541,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 @@ -22621,7 +22620,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))) @@ -22689,7 +22688,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))) @@ -24090,7 +24089,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} @@ -24495,11 +24494,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,} -\tcode{decltype(\linebreak{}submdspan_extents(src.mapping(), slices...))>} +\tcode{decltype(submdspan_extents(src.mapping(), slices...))>} is \tcode{true}. \item @@ -24529,11 +24528,11 @@ \item $0 \le \tcode{\exposid{first_}(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 diff --git a/source/exec.tex b/source/exec.tex index a7168c10cb..69cc7492a3 100644 --- a/source/exec.tex +++ b/source/exec.tex @@ -2801,7 +2801,7 @@ Let \tcode{out_sndr} and \tcode{env} be subexpressions such that \tcode{OutSndr} is \tcode{decltype((out_sndr))}. If \tcode{\exposconcept{sender-for}} 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 @@ -3154,7 +3154,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}} is \tcode{false}, then the expressions \tcode{on.transform_env(out_sndr, env)} and \tcode{on.transform_sender(out_sndr, env)} are ill-formed. @@ -3316,7 +3316,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, @@ -3485,7 +3485,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}} denotes the type \tcode{\exposid{decayed-tuple}}. Then \tcode{args_variant_t} denotes the type \tcode{variant...>} @@ -3540,7 +3540,7 @@ Let \tcode{sndr} and \tcode{env} be subexpressions, and let \tcode{Sndr} be \tcode{decltype((sndr))}. If -\tcode{\exposconcept{sender-for}>} +\tcode{\exposconcept{sender-for}>} is \tcode{false}, then the expression \tcode{\exposid{let-cpo}.transform_env(sndr, env)} is ill-formed. @@ -4287,7 +4287,7 @@ \end{codeblock} if the expression \tcode{\exposid{decayed-tuple}\{as...\}} is potentially throwing; -otherwise, \tcode{o.emplace(\linebreak as...)}. +otherwise, \tcode{o.emplace(as...)}. \pnum The expression \tcode{when_all_with_variant(sndrs...)} @@ -4600,7 +4600,7 @@ \pnum For a subexpression \tcode{sndr}, let \tcode{Sndr} be \tcode{decltype((sndr))}. -If \tcode{\libconcept{sender_to}>} +If \tcode{\libconcept{sender_to}>} is \tcode{false}, the expression \tcode{sync_wait.apply_sender(sndr)} is ill-formed; otherwise, it is equivalent to: @@ -4671,7 +4671,7 @@ \pnum If \tcode{\exposconcept{callable}} 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}@; @@ -4914,7 +4914,7 @@ Let \tcode{Es} be a pack of the types in the \exposid{type-list} named by \tcode{\exposid{gather-signatures}}, where \exposid{error-list} is an alias template -such that \tcode{\exposid{error-list}<\linebreak Ts...>} is +such that \tcode{\exposid{error-list}} is \tcode{\exposid{type-list}...>}. \pnum diff --git a/source/memory.tex b/source/memory.tex index 0b36bff3d2..4d61ce2583 100644 --- a/source/memory.tex +++ b/source/memory.tex @@ -1075,7 +1075,7 @@ \begin{itemize} \item If \tcode{uses_allocator_v, Alloc>} is \tcode{false} and - \tcode{is_constructible_v} is \tcode{true}, + \tcode{is_constructible_v} is \tcode{true}, return \tcode{forward_as_tuple(std::forward(args)...)}. \item Otherwise, if \tcode{uses_allocator_v, Alloc>} is \tcode{true} and @@ -3996,7 +3996,7 @@ such that its \tcode{value_type} is \tcode{remove_cv_t}. \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 @@ -5229,7 +5229,7 @@ \end{codeblock} if the expression \tcode{s.reset(static_cast(p), std::forward(args)...)} -is well-\linebreak formed; +is well-formed; \item otherwise, \begin{codeblock} diff --git a/source/meta.tex b/source/meta.tex index efdc929b7e..20cefd6c50 100644 --- a/source/meta.tex +++ b/source/meta.tex @@ -2154,7 +2154,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> \&\& is_convertible_v, add_pointer_t>} is \tcode{true}, + \tcode{is_convertible_v, add_pointer_t> \&\& is_convertible_v, add_pointer_t>} is \tcode{true}, then the member typedef \tcode{type} denotes \tcode{R}. \item Otherwise, if diff --git a/source/numerics.tex b/source/numerics.tex index 8e4ab3525d..f07cb63682 100644 --- a/source/numerics.tex +++ b/source/numerics.tex @@ -13688,7 +13688,7 @@ \mandates Let \tcode{a} be \tcode{\exposid{abs-if-needed}(declval())}. -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 @@ -13894,7 +13894,7 @@ \mandates Let \tcode{a} be \tcode{\exposid{abs-if-needed}(declval())}. -Then, \tcode{decltype(\linebreak init + a * a)} +Then, \tcode{decltype(init + a * a)} is convertible to \tcode{Scalar}. \pnum diff --git a/source/ranges.tex b/source/ranges.tex index 7f69027efe..f585d4db22 100644 --- a/source/ranges.tex +++ b/source/ranges.tex @@ -3525,7 +3525,7 @@ Initializes \exposid{value_} with \tcode{make_from_tuple(std::move(value_args))} and -initializes\linebreak{} \exposid{bound_} with +initializes \exposid{bound_} with \tcode{make_from_tuple(std::move(bound_args))}. The behavior is undefined if \tcode{Bound} is not \tcode{unreachable_sentinel_t} and @@ -5741,7 +5741,7 @@ that models \libconcept{random_access_range} and \libconcept{sized_range}, then \tcode{iota_view(*ranges::begin(E), -*(ranges::begin(E) + std::\linebreak{}min(ranges::distance(E), F)))}, +*(ranges::begin(E) + std::min(ranges::distance(E), F)))}, except that \tcode{E} is evaluated only once. \item @@ -6199,7 +6199,7 @@ a specialization of \tcode{subrange} that models \libconcept{random_access_range} and \libconcept{sized_range}, then -\tcode{T(ranges::begin(E) + std::min(ranges::distance(E), F), ranges::\linebreak{}end(E), +\tcode{T(ranges::begin(E) + std::min(ranges::distance(E), F), ranges::end(E), \exposid{to-unsigned-like}(ranges::distance(E) - std::min(ranges::distance(E), F)))}, except that \tcode{E} and \tcode{F} are each evaluated only once. @@ -7234,7 +7234,7 @@ let \placeholder{INNERC} denote \tcode{iterator_traits<\exposid{InnerIter}>::iterator_category}, and let \placeholder{PATTERNC} denote -\tcode{iterator_-\linebreak traits<\exposid{PatternIter}>::iterator_category}. +\tcode{iterator_traits<\exposid{PatternIter}>::iterator_category}. \item If \begin{codeblock} @@ -7726,7 +7726,7 @@ \pnum \effects Initializes \exposid{base_} with \tcode{views::all(std::forward(r))}, and -\exposid{pattern_} with \tcode{views::\linebreak single(std::move(e))}. +\exposid{pattern_} with \tcode{views::single(std::move(e))}. \end{itemdescr} \rSec3[range.lazy.split.outer]{Class template \tcode{lazy_split_view::\exposid{outer-iterator}}} @@ -8037,7 +8037,7 @@ \begin{itemize} \item \tcode{forward_iterator_tag} if -\tcode{iterator_traits>::iterator_category} models \linebreak +\tcode{iterator_traits>::iterator_category} models \tcode{\libconcept{derived_from}}; \item otherwise, \tcode{iterator_traits>::iterator_category}. \end{itemize} @@ -8255,7 +8255,7 @@ \pnum \effects Initializes \exposid{base_} with \tcode{views::all(std::forward(r))}, and -\exposid{pattern_} with \tcode{views::\linebreak single(std::move(e))}. +\exposid{pattern_} with \tcode{views::single(std::move(e))}. \end{itemdescr} \begin{itemdecl} @@ -8807,7 +8807,7 @@ \item Otherwise, if \tcode{\exposconcept{all-forward}} is modeled, -then \tcode{iterator_concept} denotes \tcode{for\-ward_iterator_tag}. +then \tcode{iterator_concept} denotes \tcode{forward_iterator_tag}. \item Otherwise, \tcode{iterator_concept} denotes \tcode{input_iterator_tag}. \end{itemize} @@ -8833,14 +8833,14 @@ \begin{itemize} \item If -\tcode{(\libconcept{derived_from} \&\& ...) \&\& \exposconceptx{concat-is-random-ac-\linebreak{}cess}{concat-is-random-access}} +\tcode{(\libconcept{derived_from} \&\& ...) \&\& \exposconceptx{concat-is-random-access}{concat-is-random-access}} is \tcode{true}, \tcode{iterator_category} denotes \tcode{random_access_iterator_tag}. \item Otherwise, if -\tcode{(\libconcept{derived_from} \&\& ...) \&\& \exposconceptx{concat-is-\linebreak{}bidirectional}{concat-is-bidirectional}} +\tcode{(\libconcept{derived_from} \&\& ...) \&\& \exposconceptx{concat-is-bidirectional}{concat-is-bidirectional}} is \tcode{true}, -\tcode{iterator_category} denotes \tcode{bidirectional_iter\-ator_tag}. +\tcode{iterator_category} denotes \tcode{bidirectional_iterator_tag}. \item Otherwise, if \tcode{(\libconcept{derived_from} \&\& ...)} @@ -9292,11 +9292,11 @@ %FIXME This is hard to parse. If \tcode{$i_\tcode{x}$ > $i_\tcode{y}$}, let \tcode{$d_\tcode{y}$} be -\tcode{ranges::distance(std::get<$i_\tcode{y}$>(y.\exposid{it_}), ranges::end(std::get<$i_\tcode{y}$>(y.\linebreak{}\exposid{parent_}->\exposid{views_})))}, +\tcode{ranges::distance(std::get<$i_\tcode{y}$>(y.\exposid{it_}), ranges::end(std::get<$i_\tcode{y}$>(y.\exposid{parent_}->\exposid{views_})))}, \tcode{$d_\tcode{x}$} be -\tcode{ranges::distance(ranges::begin(std::get<$i_\tcode{x}$>(x.\exposid{parent_}->\linebreak{}\exposid{views_})), std::get<$i_\tcode{x}$>(x.\exposid{it_}))}. +\tcode{ranges::distance(ranges::begin(std::get<$i_\tcode{x}$>(x.\exposid{parent_}->\exposid{views_})), std::get<$i_\tcode{x}$>(x.\exposid{it_}))}. Let \tcode{$s$} denote the sum of the sizes of all the ranges -\tcode{std::get<\linebreak{}$i$>(x.\exposid{parent_}->\exposid{views_})} +\tcode{std::get<$i$>(x.\exposid{parent_}->\exposid{views_})} for every integer \tcode{$i$} in the range \range{$i_\tcode{y}$ + 1}{$i_\tcode{x}$} if there is any, and @@ -9339,7 +9339,7 @@ Let \tcode{$i_\tcode{x}$} denote \tcode{x.\exposid{it_}.index()}, \tcode{$d_\tcode{x}$} be -\tcode{ranges::distance(std::get<$i_\tcode{x}$>(x.\exposid{it_}), ranges::\linebreak{}end(std::get<$i_\tcode{x}$>(x.\exposid{parent_}->\exposid{views_})))}. +\tcode{ranges::distance(std::get<$i_\tcode{x}$>(x.\exposid{it_}), ranges::end(std::get<$i_\tcode{x}$>(x.\exposid{parent_}->\exposid{views_})))}. Let \tcode{$s$} denote the sum of the sizes of all the ranges \tcode{std::get<$i$>(x.\exposid{parent_}->\exposid{views_})} for every integer \tcode{$i$} in the range @@ -9496,7 +9496,7 @@ \begin{itemize} \item If \tcode{T} models \libconcept{contiguous_iterator}, -then \tcode{span(to_address(E), static_cast(static_-\linebreak{}cast(F)))}. +then \tcode{span(to_address(E), static_cast(static_cast(F)))}. \item Otherwise, if \tcode{T} models \libconcept{random_access_iterator}, @@ -13041,7 +13041,7 @@ \item If \tcode{invoke_result_t<\exposid{maybe-const}\&, \exposid{REPEAT}(range_reference_t<\exposid{Base}>, N)...>} -is\linebreak not a reference, +is not a reference, \tcode{iterator_category} denotes \tcode{input_iterator_tag}. \item Otherwise, let \tcode{C} denote the type @@ -14052,7 +14052,7 @@ \effects Initializes \exposid{current_} with \tcode{current}, \exposid{end_} with \tcode{ranges::end(parent->\exposid{base_})}, -\exposid{n_} with \tcode{parent\linebreak ->\exposid{n_}}, and +\exposid{n_} with \tcode{parent->\exposid{n_}}, and \exposid{missing_} with \tcode{missing}. \end{itemdescr} diff --git a/source/utilities.tex b/source/utilities.tex index a38cb3ed6d..bf1c504010 100644 --- a/source/utilities.tex +++ b/source/utilities.tex @@ -2034,7 +2034,7 @@ \item \tcode{(is_constructible_v(std::forward(u)))> \&\& ...)} -is\linebreak{} % Overfull +is \tcode{true}, and \item @@ -3055,7 +3055,7 @@ denotes a type. \end{itemize} The member \grammarterm{typedef-name} \tcode{type} denotes the type -\tcode{tuple, \linebreak{}UQual>...>}. +\tcode{tuple, UQual>...>}. \end{itemdescr} \indexlibrarymember{common_type}{tuple}% @@ -4037,7 +4037,7 @@ \pnum All requirements on container iterators\iref{container.reqmts} apply to -\tcode{optional::iterator} and \tcode{optional::\linebreak{}const_iterator} as well. +\tcode{optional::iterator} and \tcode{optional::const_iterator} as well. \pnum Any operation that initializes or destroys the contained value of an optional object invalidates all iterators into that object. @@ -8375,7 +8375,7 @@ \pnum \mandates \tcode{is_copy_constructible_v} is \tcode{true} and -\tcode{is_constructible_v} is \tcode{true}. +\tcode{is_constructible_v} is \tcode{true}. \pnum \returns @@ -14408,7 +14408,7 @@ \pnum Within \ref{func.wrap.ref}, \tcode{\placeholder{call-args}} is an argument pack with elements such that -\tcode{decltype((\placeholder{call-args}\linebreak{}))...} denote +\tcode{decltype((\placeholder{call-args}))...} denote \tcode{Args\&\&...} respectively. \rSec4[func.wrap.ref.ctor]{Constructors and assignment operators}