|
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 |
|
10642 | 10641 | \pnum |
10643 | 10642 | The expression |
10644 | 10643 | \tcode{\exposid{is-vector-bool-reference}<T>} is \tcode{true} |
10645 | | -if \tcode{T} denotes the type \tcode{vector<bool, Alloc>::\linebreak{}reference} |
| 10644 | +if \tcode{T} denotes the type \tcode{vector<bool, Alloc>::reference} |
10646 | 10645 | for some type \tcode{Alloc} and |
10647 | 10646 | \tcode{vector<bool, Alloc>} is not a program-defined specialization. |
10648 | 10647 | \end{itemdescr} |
|
12034 | 12033 | Otherwise, let \tcode{r} be \tcode{equal_range(k)}. |
12035 | 12034 | Constructs an object \tcode{u} of type \tcode{value_type} with |
12036 | 12035 | \tcode{piecewise_construct, forward_as_tuple(std::forward<K>(k)), |
12037 | | -forward_as_tuple(std::forward<Args>(args)...)}.\linebreak |
| 12036 | +forward_as_tuple(std::forward<Args>(args)...)}. |
12038 | 12037 | If \tcode{equal_range(u.first) == r} is \tcode{false}, |
12039 | 12038 | the behavior is undefined. |
12040 | 12039 | Inserts \tcode{u} into \tcode{*this}. |
|
17520 | 17519 | \pnum |
17521 | 17520 | \effects |
17522 | 17521 | Equivalent to \tcode{flat_map(s, key_cont, mapped_cont)} and |
17523 | | -\tcode{flat_map(s, key_cont, \linebreak{}mapped_cont, comp)}, respectively, |
| 17522 | +\tcode{flat_map(s, key_cont, mapped_cont, comp)}, respectively, |
17524 | 17523 | except that \tcode{\exposid{c}.keys} and \tcode{\exposid{c}.values} are constructed |
17525 | 17524 | with uses-allocator construction\iref{allocator.uses.construction}. |
17526 | 17525 |
|
|
17704 | 17703 | \pnum |
17705 | 17704 | \effects |
17706 | 17705 | Initializes an object \tcode{t} of type \tcode{pair<key_type, mapped_type>} |
17707 | | -with \tcode{std::forward<Args>(\linebreak args)...}; |
| 17706 | +with \tcode{std::forward<Args>(args)...}; |
17708 | 17707 | if the map already contains an element |
17709 | 17708 | whose key is equivalent to \tcode{t.first}, |
17710 | 17709 | \tcode{*this} is unchanged. |
|
17981 | 17980 | \effects |
17982 | 17981 | If the map already contains an element \tcode{e} |
17983 | 17982 | whose key is equivalent to \tcode{k}, |
17984 | | -assigns \tcode{std::forward<\linebreak M>(obj)} to \tcode{e.second}. |
| 17983 | +assigns \tcode{std::forward<M>(obj)} to \tcode{e.second}. |
17985 | 17984 | Otherwise, equivalent to |
17986 | 17985 | \begin{codeblock} |
17987 | 17986 | try_emplace(std::forward<decltype(k)>(k), std::forward<M>(obj)) |
|
18036 | 18035 | \effects |
18037 | 18036 | If the map already contains an element \tcode{e} |
18038 | 18037 | whose key is equivalent to \tcode{k}, |
18039 | | -assigns \tcode{std::forward<\linebreak M>(obj)} to \tcode{e.second}. |
| 18038 | +assigns \tcode{std::forward<M>(obj)} to \tcode{e.second}. |
18040 | 18039 | Otherwise, equivalent to |
18041 | 18040 | \begin{codeblock} |
18042 | 18041 | try_emplace(std::forward<K>(k), std::forward<M>(obj)) |
@@ -18650,14 +18649,14 @@ |
18650 | 18649 | \pnum |
18651 | 18650 | \effects |
18652 | 18651 | Equivalent to \tcode{flat_multimap(key_cont, mapped_cont)} and |
18653 | | -\tcode{flat_multimap(key_cont, \linebreak{}mapped_cont, comp)}, respectively, |
| 18652 | +\tcode{flat_multimap(key_cont, mapped_cont, comp)}, respectively, |
18654 | 18653 | except that \tcode{\exposid{c}.keys} and \tcode{\exposid{c}.values} are constructed |
18655 | 18654 | with uses-allocator construction\iref{allocator.uses.construction}. |
18656 | 18655 |
|
18657 | 18656 | \pnum |
18658 | 18657 | \complexity |
18659 | 18658 | Same as \tcode{flat_multimap(key_cont, mapped_cont)} and |
18660 | | -\tcode{flat_multimap(key_cont, \linebreak{}mapped_cont, comp)}, respectively. |
| 18659 | +\tcode{flat_multimap(key_cont, mapped_cont, comp)}, respectively. |
18661 | 18660 | \end{itemdescr} |
18662 | 18661 |
|
18663 | 18662 | \indexlibraryctor{flat_multimap}% |
|
23210 | 23209 | \item |
23211 | 23210 | If \exposid{rank_} is greater than one, |
23212 | 23211 | then the product of |
23213 | | -\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(\linebreak 0))} and |
| 23212 | +\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(0))} and |
23214 | 23213 | all values \tcode{ext.extent($k$)} |
23215 | 23214 | with $k$ in the range of \range{1}{\exposid{rank_}} |
23216 | 23215 | is representable as a value of type \tcode{index_type}. |
|
23289 | 23288 | \item |
23290 | 23289 | If \exposid{rank_} is greater than \tcode{1} and |
23291 | 23290 | \tcode{padding_value} does not equal \tcode{dynamic_extent}, |
23292 | | -then \tcode{other.\linebreak stride(1)} equals |
| 23291 | +then \tcode{other.stride(1)} equals |
23293 | 23292 | \begin{codeblock} |
23294 | 23293 | @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value, |
23295 | 23294 | extents_type::@\exposid{index-cast}@(other.extents().extent(0))) |
|
23356 | 23355 | \item |
23357 | 23356 | If \exposid{rank_} is greater than 1 and |
23358 | 23357 | \tcode{padding_value} does not equal \tcode{dynamic_extent}, |
23359 | | -then \tcode{other.\linebreak stride(1)} equals |
| 23358 | +then \tcode{other.stride(1)} equals |
23360 | 23359 | \begin{codeblock} |
23361 | 23360 | @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value, |
23362 | 23361 | extents_type::@\exposid{index-cast}@(other.extent(0))) |
|
23754 | 23753 | if \exposid{static-padding-stride} is not \tcode{dynamic_extent}. |
23755 | 23754 | \begin{note} |
23756 | 23755 | Using \tcode{extents<index_type, \exposid{static-padding-stride}>} |
23757 | | -instead of \tcode{index_type} as the type of \exposid{stride-\linebreak rm2} |
| 23756 | +instead of \tcode{index_type} as the type of \exposid{stride-rm2} |
23758 | 23757 | would achieve this. |
23759 | 23758 | \end{note} |
23760 | 23759 | \end{itemdescr} |
@@ -23837,13 +23836,13 @@ |
23837 | 23836 | \item |
23838 | 23837 | If \exposid{rank_} is greater than one, |
23839 | 23838 | then the product of |
23840 | | -\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(\exposid{\linebreak rank_} - 1))} and |
| 23839 | +\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(\exposid{rank_} - 1))} and |
23841 | 23840 | all values \tcode{ext.extent($k$)} |
23842 | 23841 | with $k$ in the range of \range{0}{\exposid{rank_} - 1} |
23843 | 23842 | is representable as a value of type \tcode{index_type}. |
23844 | 23843 | \item |
23845 | 23844 | If \tcode{padding_value} is not equal to \tcode{dynamic_extent}, |
23846 | | -\tcode{padding_value} equals \tcode{extents_type::\linebreak \exposid{index-cast}(pad)}. |
| 23845 | +\tcode{padding_value} equals \tcode{extents_type::\exposid{index-cast}(pad)}. |
23847 | 23846 | \end{itemize} |
23848 | 23847 |
|
23849 | 23848 | \pnum |
|
23916 | 23915 | \item |
23917 | 23916 | If \exposid{rank_} is greater than 1 and |
23918 | 23917 | \tcode{padding_value} does not equal \tcode{dynamic_extent}, |
23919 | | -then \tcode{other.\linebreak stride(\exposid{rank_} - 2)} equals |
| 23918 | +then \tcode{other.stride(\exposid{rank_} - 2)} equals |
23920 | 23919 | \begin{codeblock} |
23921 | 23920 | @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value, |
23922 | 23921 | extents_type::@\exposid{index-cast}@(other.extents().extent(@\exposid{rank_}@ - 1))) |
|
23984 | 23983 | \item |
23985 | 23984 | If \exposid{rank_} is greater than 1 and |
23986 | 23985 | \tcode{padding_value} does not equal \tcode{dynamic_extent}, |
23987 | | -then \tcode{other.\linebreak stride(\exposid{rank_} - 2)} equals |
| 23986 | +then \tcode{other.stride(\exposid{rank_} - 2)} equals |
23988 | 23987 | \begin{codeblock} |
23989 | 23988 | @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value, |
23990 | 23989 | extents_type::@\exposid{index-cast}@(other.extent(@\exposid{rank_}@ - 1))) |
|
25573 | 25572 | \item |
25574 | 25573 | \tcode{stride(k) * \exposid{de-ice}($s_k$.stride)} |
25575 | 25574 | if $S_k$ is a specialization of \tcode{strided_slice} and |
25576 | | -\tcode{$s_k$.stride < $s_k$.\linebreak extent} is \tcode{true}; |
| 25575 | +\tcode{$s_k$.stride < $s_k$.extent} is \tcode{true}; |
25577 | 25576 | \item |
25578 | 25577 | otherwise, \tcode{stride($k$)}. |
25579 | 25578 | \end{itemize} |
@@ -25971,11 +25970,11 @@ |
25971 | 25970 | \begin{itemize} |
25972 | 25971 | \item |
25973 | 25972 | \tcode{decltype(submdspan_mapping(src.mapping(), slices...))} |
25974 | | -is a specialization of \tcode{submd-\linebreak{}span_mapping_result}. |
| 25973 | +is a specialization of \tcode{submdspan_mapping_result}. |
25975 | 25974 |
|
25976 | 25975 | \item |
25977 | 25976 | \tcode{is_same_v<remove_cvref_t<decltype(sub_map_offset.mapping.extents())>,} |
25978 | | -\tcode{decltype(\linebreak{}submdspan_extents(src.mapping(), slices...))>} |
| 25977 | +\tcode{decltype(submdspan_extents(src.mapping(), slices...))>} |
25979 | 25978 | is \tcode{true}. |
25980 | 25979 |
|
25981 | 25980 | \item |
@@ -26005,11 +26004,11 @@ |
26005 | 26004 | \item |
26006 | 26005 | $0 \le \tcode{\exposid{first_}<index_type, $k$>(slices...)}$ |
26007 | 26006 | $\le \tcode{\exposid{last_}<$k$>(src.extents(), slices...)}$ |
26008 | | - $\le \tcode{\linebreak{}src.extent($k$)}$ |
| 26007 | + $\le \tcode{src.extent($k$)}$ |
26009 | 26008 | \end{itemize} |
26010 | 26009 |
|
26011 | 26010 | \item |
26012 | | -\tcode{sub_map_offset.mapping.extents() == submdspan_extents(src.mapping(), slices...)}\linebreak |
| 26011 | +\tcode{sub_map_offset.mapping.extents() == submdspan_extents(src.mapping(), slices...)} |
26013 | 26012 | is \tcode{true}; and |
26014 | 26013 |
|
26015 | 26014 | \item |
|
0 commit comments