|
2444 | 2444 | Assigns \tcode{nh.ptr_} to \tcode{ptr_}.
|
2445 | 2445 | \item
|
2446 | 2446 | If \tcode{!alloc\textunderscore} or \tcode{ator_traits::propagate_on_container_move_assignment::value}
|
2447 |
| -is \tcode{true}, \linebreak |
2448 |
| -move assigns \tcode{nh.alloc_} to \tcode{alloc_}. |
| 2447 | +is \tcode{true}, move assigns \tcode{nh.alloc_} to \tcode{alloc_}. |
2449 | 2448 | \item
|
2450 | 2449 | Assigns
|
2451 | 2450 | \keyword{nullptr} to \tcode{nh.ptr_} and assigns \tcode{nullopt} to
|
|
7478 | 7477 | \pnum
|
7479 | 7478 | \expects
|
7480 | 7479 | \tcode{T} is \oldconcept{EmplaceConstructible} into \tcode{forward_list}
|
7481 |
| -from \tcode{std::forward<Args>(\linebreak args)...}. |
| 7480 | +from \tcode{std::forward<Args>(args)...}. |
7482 | 7481 | \tcode{position} is \tcode{before_begin()} or is a dereferenceable
|
7483 | 7482 | iterator in the range \range{begin()}{end()}.
|
7484 | 7483 |
|
7485 | 7484 | \pnum
|
7486 | 7485 | \effects
|
7487 | 7486 | Inserts an object of type \tcode{value_type} direct-non-list-initialized with
|
7488 |
| -\tcode{std::forward<Args>(\linebreak args)...} after \tcode{position}. |
| 7487 | +\tcode{std::forward<Args>(args)...} after \tcode{position}. |
7489 | 7488 |
|
7490 | 7489 | \pnum
|
7491 | 7490 | \returns
|
|
10637 | 10636 | \pnum
|
10638 | 10637 | The expression
|
10639 | 10638 | \tcode{\exposid{is-vector-bool-reference}<T>} is \tcode{true}
|
10640 |
| -if \tcode{T} denotes the type \tcode{vector<bool, Alloc>::\linebreak{}reference} |
| 10639 | +if \tcode{T} denotes the type \tcode{vector<bool, Alloc>::reference} |
10641 | 10640 | for some type \tcode{Alloc} and
|
10642 | 10641 | \tcode{vector<bool, Alloc>} is not a program-defined specialization.
|
10643 | 10642 | \end{itemdescr}
|
|
12029 | 12028 | Otherwise, let \tcode{r} be \tcode{equal_range(k)}.
|
12030 | 12029 | Constructs an object \tcode{u} of type \tcode{value_type} with
|
12031 | 12030 | \tcode{piecewise_construct, forward_as_tuple(std::forward<K>(k)),
|
12032 |
| -forward_as_tuple(std::forward<Args>(args)...)}.\linebreak |
| 12031 | +forward_as_tuple(std::forward<Args>(args)...)}. |
12033 | 12032 | If \tcode{equal_range(u.first) == r} is \tcode{false},
|
12034 | 12033 | the behavior is undefined.
|
12035 | 12034 | Inserts \tcode{u} into \tcode{*this}.
|
|
17515 | 17514 | \pnum
|
17516 | 17515 | \effects
|
17517 | 17516 | Equivalent to \tcode{flat_map(s, key_cont, mapped_cont)} and
|
17518 |
| -\tcode{flat_map(s, key_cont, \linebreak{}mapped_cont, comp)}, respectively, |
| 17517 | +\tcode{flat_map(s, key_cont, mapped_cont, comp)}, respectively, |
17519 | 17518 | except that \tcode{\exposid{c}.keys} and \tcode{\exposid{c}.values} are constructed
|
17520 | 17519 | with uses-allocator construction\iref{allocator.uses.construction}.
|
17521 | 17520 |
|
|
17699 | 17698 | \pnum
|
17700 | 17699 | \effects
|
17701 | 17700 | Initializes an object \tcode{t} of type \tcode{pair<key_type, mapped_type>}
|
17702 |
| -with \tcode{std::forward<Args>(\linebreak args)...}; |
| 17701 | +with \tcode{std::forward<Args>(args)...}; |
17703 | 17702 | if the map already contains an element
|
17704 | 17703 | whose key is equivalent to \tcode{t.first},
|
17705 | 17704 | \tcode{*this} is unchanged.
|
|
17976 | 17975 | \effects
|
17977 | 17976 | If the map already contains an element \tcode{e}
|
17978 | 17977 | whose key is equivalent to \tcode{k},
|
17979 |
| -assigns \tcode{std::forward<\linebreak M>(obj)} to \tcode{e.second}. |
| 17978 | +assigns \tcode{std::forward<M>(obj)} to \tcode{e.second}. |
17980 | 17979 | Otherwise, equivalent to
|
17981 | 17980 | \begin{codeblock}
|
17982 | 17981 | try_emplace(std::forward<decltype(k)>(k), std::forward<M>(obj))
|
|
18031 | 18030 | \effects
|
18032 | 18031 | If the map already contains an element \tcode{e}
|
18033 | 18032 | whose key is equivalent to \tcode{k},
|
18034 |
| -assigns \tcode{std::forward<\linebreak M>(obj)} to \tcode{e.second}. |
| 18033 | +assigns \tcode{std::forward<M>(obj)} to \tcode{e.second}. |
18035 | 18034 | Otherwise, equivalent to
|
18036 | 18035 | \begin{codeblock}
|
18037 | 18036 | try_emplace(std::forward<K>(k), std::forward<M>(obj))
|
@@ -18645,14 +18644,14 @@
|
18645 | 18644 | \pnum
|
18646 | 18645 | \effects
|
18647 | 18646 | Equivalent to \tcode{flat_multimap(key_cont, mapped_cont)} and
|
18648 |
| -\tcode{flat_multimap(key_cont, \linebreak{}mapped_cont, comp)}, respectively, |
| 18647 | +\tcode{flat_multimap(key_cont, mapped_cont, comp)}, respectively, |
18649 | 18648 | except that \tcode{\exposid{c}.keys} and \tcode{\exposid{c}.values} are constructed
|
18650 | 18649 | with uses-allocator construction\iref{allocator.uses.construction}.
|
18651 | 18650 |
|
18652 | 18651 | \pnum
|
18653 | 18652 | \complexity
|
18654 | 18653 | Same as \tcode{flat_multimap(key_cont, mapped_cont)} and
|
18655 |
| -\tcode{flat_multimap(key_cont, \linebreak{}mapped_cont, comp)}, respectively. |
| 18654 | +\tcode{flat_multimap(key_cont, mapped_cont, comp)}, respectively. |
18656 | 18655 | \end{itemdescr}
|
18657 | 18656 |
|
18658 | 18657 | \indexlibraryctor{flat_multimap}%
|
|
23205 | 23204 | \item
|
23206 | 23205 | If \exposid{rank_} is greater than one,
|
23207 | 23206 | then the product of
|
23208 |
| -\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(\linebreak 0))} and |
| 23207 | +\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(0))} and |
23209 | 23208 | all values \tcode{ext.extent($k$)}
|
23210 | 23209 | with $k$ in the range of \range{1}{\exposid{rank_}}
|
23211 | 23210 | is representable as a value of type \tcode{index_type}.
|
|
23284 | 23283 | \item
|
23285 | 23284 | If \exposid{rank_} is greater than \tcode{1} and
|
23286 | 23285 | \tcode{padding_value} does not equal \tcode{dynamic_extent},
|
23287 |
| -then \tcode{other.\linebreak stride(1)} equals |
| 23286 | +then \tcode{other.stride(1)} equals |
23288 | 23287 | \begin{codeblock}
|
23289 | 23288 | @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value,
|
23290 | 23289 | extents_type::@\exposid{index-cast}@(other.extents().extent(0)))
|
|
23351 | 23350 | \item
|
23352 | 23351 | If \exposid{rank_} is greater than 1 and
|
23353 | 23352 | \tcode{padding_value} does not equal \tcode{dynamic_extent},
|
23354 |
| -then \tcode{other.\linebreak stride(1)} equals |
| 23353 | +then \tcode{other.stride(1)} equals |
23355 | 23354 | \begin{codeblock}
|
23356 | 23355 | @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value,
|
23357 | 23356 | extents_type::@\exposid{index-cast}@(other.extent(0)))
|
|
23749 | 23748 | if \exposid{static-padding-stride} is not \tcode{dynamic_extent}.
|
23750 | 23749 | \begin{note}
|
23751 | 23750 | Using \tcode{extents<index_type, \exposid{static-padding-stride}>}
|
23752 |
| -instead of \tcode{index_type} as the type of \exposid{stride-\linebreak rm2} |
| 23751 | +instead of \tcode{index_type} as the type of \exposid{stride-rm2} |
23753 | 23752 | would achieve this.
|
23754 | 23753 | \end{note}
|
23755 | 23754 | \end{itemdescr}
|
@@ -23832,13 +23831,13 @@
|
23832 | 23831 | \item
|
23833 | 23832 | If \exposid{rank_} is greater than one,
|
23834 | 23833 | then the product of
|
23835 |
| -\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(\exposid{\linebreak rank_} - 1))} and |
| 23834 | +\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(\exposid{rank_} - 1))} and |
23836 | 23835 | all values \tcode{ext.extent($k$)}
|
23837 | 23836 | with $k$ in the range of \range{0}{\exposid{rank_} - 1}
|
23838 | 23837 | is representable as a value of type \tcode{index_type}.
|
23839 | 23838 | \item
|
23840 | 23839 | If \tcode{padding_value} is not equal to \tcode{dynamic_extent},
|
23841 |
| -\tcode{padding_value} equals \tcode{extents_type::\linebreak \exposid{index-cast}(pad)}. |
| 23840 | +\tcode{padding_value} equals \tcode{extents_type::\exposid{index-cast}(pad)}. |
23842 | 23841 | \end{itemize}
|
23843 | 23842 |
|
23844 | 23843 | \pnum
|
|
23911 | 23910 | \item
|
23912 | 23911 | If \exposid{rank_} is greater than 1 and
|
23913 | 23912 | \tcode{padding_value} does not equal \tcode{dynamic_extent},
|
23914 |
| -then \tcode{other.\linebreak stride(\exposid{rank_} - 2)} equals |
| 23913 | +then \tcode{other.stride(\exposid{rank_} - 2)} equals |
23915 | 23914 | \begin{codeblock}
|
23916 | 23915 | @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value,
|
23917 | 23916 | extents_type::@\exposid{index-cast}@(other.extents().extent(@\exposid{rank_}@ - 1)))
|
|
23979 | 23978 | \item
|
23980 | 23979 | If \exposid{rank_} is greater than 1 and
|
23981 | 23980 | \tcode{padding_value} does not equal \tcode{dynamic_extent},
|
23982 |
| -then \tcode{other.\linebreak stride(\exposid{rank_} - 2)} equals |
| 23981 | +then \tcode{other.stride(\exposid{rank_} - 2)} equals |
23983 | 23982 | \begin{codeblock}
|
23984 | 23983 | @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value,
|
23985 | 23984 | extents_type::@\exposid{index-cast}@(other.extent(@\exposid{rank_}@ - 1)))
|
|
25568 | 25567 | \item
|
25569 | 25568 | \tcode{stride(k) * \exposid{de-ice}($s_k$.stride)}
|
25570 | 25569 | if $S_k$ is a specialization of \tcode{strided_slice} and
|
25571 |
| -\tcode{$s_k$.stride < $s_k$.\linebreak extent} is \tcode{true}; |
| 25570 | +\tcode{$s_k$.stride < $s_k$.extent} is \tcode{true}; |
25572 | 25571 | \item
|
25573 | 25572 | otherwise, \tcode{stride($k$)}.
|
25574 | 25573 | \end{itemize}
|
@@ -25966,11 +25965,11 @@
|
25966 | 25965 | \begin{itemize}
|
25967 | 25966 | \item
|
25968 | 25967 | \tcode{decltype(submdspan_mapping(src.mapping(), slices...))}
|
25969 |
| -is a specialization of \tcode{submd-\linebreak{}span_mapping_result}. |
| 25968 | +is a specialization of \tcode{submdspan_mapping_result}. |
25970 | 25969 |
|
25971 | 25970 | \item
|
25972 | 25971 | \tcode{is_same_v<remove_cvref_t<decltype(sub_map_offset.mapping.extents())>,}
|
25973 |
| -\tcode{decltype(\linebreak{}submdspan_extents(src.mapping(), slices...))>} |
| 25972 | +\tcode{decltype(submdspan_extents(src.mapping(), slices...))>} |
25974 | 25973 | is \tcode{true}.
|
25975 | 25974 |
|
25976 | 25975 | \item
|
@@ -26000,11 +25999,11 @@
|
26000 | 25999 | \item
|
26001 | 26000 | $0 \le \tcode{\exposid{first_}<index_type, $k$>(slices...)}$
|
26002 | 26001 | $\le \tcode{\exposid{last_}<$k$>(src.extents(), slices...)}$
|
26003 |
| - $\le \tcode{\linebreak{}src.extent($k$)}$ |
| 26002 | + $\le \tcode{src.extent($k$)}$ |
26004 | 26003 | \end{itemize}
|
26005 | 26004 |
|
26006 | 26005 | \item
|
26007 |
| -\tcode{sub_map_offset.mapping.extents() == submdspan_extents(src.mapping(), slices...)}\linebreak |
| 26006 | +\tcode{sub_map_offset.mapping.extents() == submdspan_extents(src.mapping(), slices...)} |
26008 | 26007 | is \tcode{true}; and
|
26009 | 26008 |
|
26010 | 26009 | \item
|
|
0 commit comments