|
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
|
|
10636 | 10635 | \pnum
|
10637 | 10636 | The expression
|
10638 | 10637 | \tcode{\exposid{is-vector-bool-reference}<T>} is \tcode{true}
|
10639 |
| -if \tcode{T} denotes the type \tcode{vector<bool, Alloc>::\linebreak{}reference} |
| 10638 | +if \tcode{T} denotes the type \tcode{vector<bool, Alloc>::reference} |
10640 | 10639 | for some type \tcode{Alloc} and
|
10641 | 10640 | \tcode{vector<bool, Alloc>} is not a program-defined specialization.
|
10642 | 10641 | \end{itemdescr}
|
|
12028 | 12027 | Otherwise, let \tcode{r} be \tcode{equal_range(k)}.
|
12029 | 12028 | Constructs an object \tcode{u} of type \tcode{value_type} with
|
12030 | 12029 | \tcode{piecewise_construct, forward_as_tuple(std::forward<K>(k)),
|
12031 |
| -forward_as_tuple(std::forward<Args>(args)...)}.\linebreak |
| 12030 | +forward_as_tuple(std::forward<Args>(args)...)}. |
12032 | 12031 | If \tcode{equal_range(u.first) == r} is \tcode{false},
|
12033 | 12032 | the behavior is undefined.
|
12034 | 12033 | Inserts \tcode{u} into \tcode{*this}.
|
|
17514 | 17513 | \pnum
|
17515 | 17514 | \effects
|
17516 | 17515 | Equivalent to \tcode{flat_map(s, key_cont, mapped_cont)} and
|
17517 |
| -\tcode{flat_map(s, key_cont, \linebreak{}mapped_cont, comp)}, respectively, |
| 17516 | +\tcode{flat_map(s, key_cont, mapped_cont, comp)}, respectively, |
17518 | 17517 | except that \tcode{\exposid{c}.keys} and \tcode{\exposid{c}.values} are constructed
|
17519 | 17518 | with uses-allocator construction\iref{allocator.uses.construction}.
|
17520 | 17519 |
|
|
17698 | 17697 | \pnum
|
17699 | 17698 | \effects
|
17700 | 17699 | Initializes an object \tcode{t} of type \tcode{pair<key_type, mapped_type>}
|
17701 |
| -with \tcode{std::forward<Args>(\linebreak args)...}; |
| 17700 | +with \tcode{std::forward<Args>(args)...}; |
17702 | 17701 | if the map already contains an element
|
17703 | 17702 | whose key is equivalent to \tcode{t.first},
|
17704 | 17703 | \tcode{*this} is unchanged.
|
|
17975 | 17974 | \effects
|
17976 | 17975 | If the map already contains an element \tcode{e}
|
17977 | 17976 | whose key is equivalent to \tcode{k},
|
17978 |
| -assigns \tcode{std::forward<\linebreak M>(obj)} to \tcode{e.second}. |
| 17977 | +assigns \tcode{std::forward<M>(obj)} to \tcode{e.second}. |
17979 | 17978 | Otherwise, equivalent to
|
17980 | 17979 | \begin{codeblock}
|
17981 | 17980 | try_emplace(std::forward<decltype(k)>(k), std::forward<M>(obj))
|
|
18030 | 18029 | \effects
|
18031 | 18030 | If the map already contains an element \tcode{e}
|
18032 | 18031 | whose key is equivalent to \tcode{k},
|
18033 |
| -assigns \tcode{std::forward<\linebreak M>(obj)} to \tcode{e.second}. |
| 18032 | +assigns \tcode{std::forward<M>(obj)} to \tcode{e.second}. |
18034 | 18033 | Otherwise, equivalent to
|
18035 | 18034 | \begin{codeblock}
|
18036 | 18035 | try_emplace(std::forward<K>(k), std::forward<M>(obj))
|
@@ -18644,14 +18643,14 @@
|
18644 | 18643 | \pnum
|
18645 | 18644 | \effects
|
18646 | 18645 | Equivalent to \tcode{flat_multimap(key_cont, mapped_cont)} and
|
18647 |
| -\tcode{flat_multimap(key_cont, \linebreak{}mapped_cont, comp)}, respectively, |
| 18646 | +\tcode{flat_multimap(key_cont, mapped_cont, comp)}, respectively, |
18648 | 18647 | except that \tcode{\exposid{c}.keys} and \tcode{\exposid{c}.values} are constructed
|
18649 | 18648 | with uses-allocator construction\iref{allocator.uses.construction}.
|
18650 | 18649 |
|
18651 | 18650 | \pnum
|
18652 | 18651 | \complexity
|
18653 | 18652 | Same as \tcode{flat_multimap(key_cont, mapped_cont)} and
|
18654 |
| -\tcode{flat_multimap(key_cont, \linebreak{}mapped_cont, comp)}, respectively. |
| 18653 | +\tcode{flat_multimap(key_cont, mapped_cont, comp)}, respectively. |
18655 | 18654 | \end{itemdescr}
|
18656 | 18655 |
|
18657 | 18656 | \indexlibraryctor{flat_multimap}%
|
|
23204 | 23203 | \item
|
23205 | 23204 | If \exposid{rank_} is greater than one,
|
23206 | 23205 | then the product of
|
23207 |
| -\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(\linebreak 0))} and |
| 23206 | +\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(0))} and |
23208 | 23207 | all values \tcode{ext.extent($k$)}
|
23209 | 23208 | with $k$ in the range of \range{1}{\exposid{rank_}}
|
23210 | 23209 | is representable as a value of type \tcode{index_type}.
|
|
23283 | 23282 | \item
|
23284 | 23283 | If \exposid{rank_} is greater than \tcode{1} and
|
23285 | 23284 | \tcode{padding_value} does not equal \tcode{dynamic_extent},
|
23286 |
| -then \tcode{other.\linebreak stride(1)} equals |
| 23285 | +then \tcode{other.stride(1)} equals |
23287 | 23286 | \begin{codeblock}
|
23288 | 23287 | @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value,
|
23289 | 23288 | extents_type::@\exposid{index-cast}@(other.extents().extent(0)))
|
|
23350 | 23349 | \item
|
23351 | 23350 | If \exposid{rank_} is greater than 1 and
|
23352 | 23351 | \tcode{padding_value} does not equal \tcode{dynamic_extent},
|
23353 |
| -then \tcode{other.\linebreak stride(1)} equals |
| 23352 | +then \tcode{other.stride(1)} equals |
23354 | 23353 | \begin{codeblock}
|
23355 | 23354 | @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value,
|
23356 | 23355 | extents_type::@\exposid{index-cast}@(other.extent(0)))
|
|
23748 | 23747 | if \exposid{static-padding-stride} is not \tcode{dynamic_extent}.
|
23749 | 23748 | \begin{note}
|
23750 | 23749 | Using \tcode{extents<index_type, \exposid{static-padding-stride}>}
|
23751 |
| -instead of \tcode{index_type} as the type of \exposid{stride-\linebreak rm2} |
| 23750 | +instead of \tcode{index_type} as the type of \exposid{stride-rm2} |
23752 | 23751 | would achieve this.
|
23753 | 23752 | \end{note}
|
23754 | 23753 | \end{itemdescr}
|
@@ -23831,13 +23830,13 @@
|
23831 | 23830 | \item
|
23832 | 23831 | If \exposid{rank_} is greater than one,
|
23833 | 23832 | then the product of
|
23834 |
| -\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(\exposid{\linebreak rank_} - 1))} and |
| 23833 | +\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(\exposid{rank_} - 1))} and |
23835 | 23834 | all values \tcode{ext.extent($k$)}
|
23836 | 23835 | with $k$ in the range of \range{0}{\exposid{rank_} - 1}
|
23837 | 23836 | is representable as a value of type \tcode{index_type}.
|
23838 | 23837 | \item
|
23839 | 23838 | If \tcode{padding_value} is not equal to \tcode{dynamic_extent},
|
23840 |
| -\tcode{padding_value} equals \tcode{extents_type::\linebreak \exposid{index-cast}(pad)}. |
| 23839 | +\tcode{padding_value} equals \tcode{extents_type::\exposid{index-cast}(pad)}. |
23841 | 23840 | \end{itemize}
|
23842 | 23841 |
|
23843 | 23842 | \pnum
|
|
23910 | 23909 | \item
|
23911 | 23910 | If \exposid{rank_} is greater than 1 and
|
23912 | 23911 | \tcode{padding_value} does not equal \tcode{dynamic_extent},
|
23913 |
| -then \tcode{other.\linebreak stride(\exposid{rank_} - 2)} equals |
| 23912 | +then \tcode{other.stride(\exposid{rank_} - 2)} equals |
23914 | 23913 | \begin{codeblock}
|
23915 | 23914 | @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value,
|
23916 | 23915 | extents_type::@\exposid{index-cast}@(other.extents().extent(@\exposid{rank_}@ - 1)))
|
|
23978 | 23977 | \item
|
23979 | 23978 | If \exposid{rank_} is greater than 1 and
|
23980 | 23979 | \tcode{padding_value} does not equal \tcode{dynamic_extent},
|
23981 |
| -then \tcode{other.\linebreak stride(\exposid{rank_} - 2)} equals |
| 23980 | +then \tcode{other.stride(\exposid{rank_} - 2)} equals |
23982 | 23981 | \begin{codeblock}
|
23983 | 23982 | @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value,
|
23984 | 23983 | extents_type::@\exposid{index-cast}@(other.extent(@\exposid{rank_}@ - 1)))
|
|
25567 | 25566 | \item
|
25568 | 25567 | \tcode{stride(k) * \exposid{de-ice}($s_k$.stride)}
|
25569 | 25568 | if $S_k$ is a specialization of \tcode{strided_slice} and
|
25570 |
| -\tcode{$s_k$.stride < $s_k$.\linebreak extent} is \tcode{true}; |
| 25569 | +\tcode{$s_k$.stride < $s_k$.extent} is \tcode{true}; |
25571 | 25570 | \item
|
25572 | 25571 | otherwise, \tcode{stride($k$)}.
|
25573 | 25572 | \end{itemize}
|
@@ -25965,11 +25964,11 @@
|
25965 | 25964 | \begin{itemize}
|
25966 | 25965 | \item
|
25967 | 25966 | \tcode{decltype(submdspan_mapping(src.mapping(), slices...))}
|
25968 |
| -is a specialization of \tcode{submd-\linebreak{}span_mapping_result}. |
| 25967 | +is a specialization of \tcode{submdspan_mapping_result}. |
25969 | 25968 |
|
25970 | 25969 | \item
|
25971 | 25970 | \tcode{is_same_v<remove_cvref_t<decltype(sub_map_offset.mapping.extents())>,}
|
25972 |
| -\tcode{decltype(\linebreak{}submdspan_extents(src.mapping(), slices...))>} |
| 25971 | +\tcode{decltype(submdspan_extents(src.mapping(), slices...))>} |
25973 | 25972 | is \tcode{true}.
|
25974 | 25973 |
|
25975 | 25974 | \item
|
@@ -25999,11 +25998,11 @@
|
25999 | 25998 | \item
|
26000 | 25999 | $0 \le \tcode{\exposid{first_}<index_type, $k$>(slices...)}$
|
26001 | 26000 | $\le \tcode{\exposid{last_}<$k$>(src.extents(), slices...)}$
|
26002 |
| - $\le \tcode{\linebreak{}src.extent($k$)}$ |
| 26001 | + $\le \tcode{src.extent($k$)}$ |
26003 | 26002 | \end{itemize}
|
26004 | 26003 |
|
26005 | 26004 | \item
|
26006 |
| -\tcode{sub_map_offset.mapping.extents() == submdspan_extents(src.mapping(), slices...)}\linebreak |
| 26005 | +\tcode{sub_map_offset.mapping.extents() == submdspan_extents(src.mapping(), slices...)} |
26007 | 26006 | is \tcode{true}; and
|
26008 | 26007 |
|
26009 | 26008 | \item
|
|
0 commit comments