|
2373 | 2373 | Assigns \tcode{nh.ptr_} to \tcode{ptr_}.
|
2374 | 2374 | \item
|
2375 | 2375 | If \tcode{!alloc\textunderscore} or \tcode{ator_traits::propagate_on_container_move_assignment::value}
|
2376 |
| -is \tcode{true}, \linebreak |
2377 |
| -move assigns \tcode{nh.alloc_} to \tcode{alloc_}. |
| 2376 | +is \tcode{true}, move assigns \tcode{nh.alloc_} to \tcode{alloc_}. |
2378 | 2377 | \item
|
2379 | 2378 | Assigns
|
2380 | 2379 | \keyword{nullptr} to \tcode{nh.ptr_} and assigns \tcode{nullopt} to
|
|
7499 | 7498 | \pnum
|
7500 | 7499 | \expects
|
7501 | 7500 | \tcode{T} is \oldconcept{EmplaceConstructible} into \tcode{forward_list}
|
7502 |
| -from \tcode{std::forward<Args>(\linebreak args)...}. |
| 7501 | +from \tcode{std::forward<Args>(args)...}. |
7503 | 7502 | \tcode{position} is \tcode{before_begin()} or is a dereferenceable
|
7504 | 7503 | iterator in the range \range{begin()}{end()}.
|
7505 | 7504 |
|
7506 | 7505 | \pnum
|
7507 | 7506 | \effects
|
7508 | 7507 | Inserts an object of type \tcode{value_type} direct-non-list-initialized with
|
7509 |
| -\tcode{std::forward<Args>(\linebreak args)...} after \tcode{position}. |
| 7508 | +\tcode{std::forward<Args>(args)...} after \tcode{position}. |
7510 | 7509 |
|
7511 | 7510 | \pnum
|
7512 | 7511 | \returns
|
|
9440 | 9439 | \pnum
|
9441 | 9440 | The expression
|
9442 | 9441 | \tcode{\exposid{is-vector-bool-reference}<T>} is \tcode{true}
|
9443 |
| -if \tcode{T} denotes the type \tcode{vector<bool, Alloc>::\linebreak{}reference} |
| 9442 | +if \tcode{T} denotes the type \tcode{vector<bool, Alloc>::reference} |
9444 | 9443 | for some type \tcode{Alloc} and
|
9445 | 9444 | \tcode{vector<bool, Alloc>} is not a program-defined specialization.
|
9446 | 9445 | \end{itemdescr}
|
|
10869 | 10868 | Otherwise, let \tcode{r} be \tcode{equal_range(k)}.
|
10870 | 10869 | Constructs an object \tcode{u} of type \tcode{value_type} with
|
10871 | 10870 | \tcode{piecewise_construct, forward_as_tuple(std::forward<K>(k)),
|
10872 |
| -forward_as_tuple(std::forward<Args>(args)...)}.\linebreak |
| 10871 | +forward_as_tuple(std::forward<Args>(args)...)}. |
10873 | 10872 | If \tcode{equal_range(u.first) == r} is \tcode{false},
|
10874 | 10873 | the behavior is undefined.
|
10875 | 10874 | Inserts \tcode{u} into \tcode{*this}.
|
|
16306 | 16305 | \pnum
|
16307 | 16306 | \effects
|
16308 | 16307 | Equivalent to \tcode{flat_map(s, key_cont, mapped_cont)} and
|
16309 |
| -\tcode{flat_map(s, key_cont, \linebreak{}mapped_cont, comp)}, respectively, |
| 16308 | +\tcode{flat_map(s, key_cont, mapped_cont, comp)}, respectively, |
16310 | 16309 | except that \tcode{c.keys} and \tcode{c.values} are constructed
|
16311 | 16310 | with uses-allocator construction\iref{allocator.uses.construction}.
|
16312 | 16311 |
|
|
16489 | 16488 | \pnum
|
16490 | 16489 | \effects
|
16491 | 16490 | Initializes an object \tcode{t} of type \tcode{pair<key_type, mapped_type>}
|
16492 |
| -with \tcode{std::forward<Args>(\linebreak args)...}; |
| 16491 | +with \tcode{std::forward<Args>(args)...}; |
16493 | 16492 | if the map already contains an element
|
16494 | 16493 | whose key is equivalent to \tcode{t.first},
|
16495 | 16494 | \tcode{*this} is unchanged.
|
|
16766 | 16765 | \effects
|
16767 | 16766 | If the map already contains an element \tcode{e}
|
16768 | 16767 | whose key is equivalent to \tcode{k},
|
16769 |
| -assigns \tcode{std::forward<\linebreak M>(obj)} to \tcode{e.second}. |
| 16768 | +assigns \tcode{std::forward<M>(obj)} to \tcode{e.second}. |
16770 | 16769 | Otherwise, equivalent to
|
16771 | 16770 | \begin{codeblock}
|
16772 | 16771 | try_emplace(std::forward<decltype(k)>(k), std::forward<M>(obj))
|
|
16821 | 16820 | \effects
|
16822 | 16821 | If the map already contains an element \tcode{e}
|
16823 | 16822 | whose key is equivalent to \tcode{k},
|
16824 |
| -assigns \tcode{std::forward<\linebreak M>(obj)} to \tcode{e.second}. |
| 16823 | +assigns \tcode{std::forward<M>(obj)} to \tcode{e.second}. |
16825 | 16824 | Otherwise, equivalent to
|
16826 | 16825 | \begin{codeblock}
|
16827 | 16826 | try_emplace(std::forward<K>(k), std::forward<M>(obj))
|
@@ -17426,14 +17425,14 @@
|
17426 | 17425 | \pnum
|
17427 | 17426 | \effects
|
17428 | 17427 | Equivalent to \tcode{flat_multimap(key_cont, mapped_cont)} and
|
17429 |
| -\tcode{flat_multimap(key_cont, \linebreak{}mapped_cont, comp)}, respectively, |
| 17428 | +\tcode{flat_multimap(key_cont, mapped_cont, comp)}, respectively, |
17430 | 17429 | except that \tcode{c.keys} and \tcode{c.values} are constructed
|
17431 | 17430 | with uses-allocator construction\iref{allocator.uses.construction}.
|
17432 | 17431 |
|
17433 | 17432 | \pnum
|
17434 | 17433 | \complexity
|
17435 | 17434 | Same as \tcode{flat_multimap(key_cont, mapped_cont)} and
|
17436 |
| -\tcode{flat_multimap(key_cont, \linebreak{}mapped_cont, comp)}, respectively. |
| 17435 | +\tcode{flat_multimap(key_cont, mapped_cont, comp)}, respectively. |
17437 | 17436 | \end{itemdescr}
|
17438 | 17437 |
|
17439 | 17438 | \indexlibraryctor{flat_multimap}%
|
|
21916 | 21915 | \item
|
21917 | 21916 | If \exposid{rank_} is greater than one,
|
21918 | 21917 | then the product of
|
21919 |
| -\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(\linebreak 0))} and |
| 21918 | +\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(0))} and |
21920 | 21919 | all values \tcode{ext.extent($k$)}
|
21921 | 21920 | with $k$ in the range of \range{1}{\exposid{rank_}}
|
21922 | 21921 | is representable as a value of type \tcode{index_type}.
|
|
21995 | 21994 | \item
|
21996 | 21995 | If \exposid{rank_} is greater than \tcode{1} and
|
21997 | 21996 | \tcode{padding_value} does not equal \tcode{dynamic_extent},
|
21998 |
| -then \tcode{other.\linebreak stride(1)} equals |
| 21997 | +then \tcode{other.stride(1)} equals |
21999 | 21998 | \begin{codeblock}
|
22000 | 21999 | @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value,
|
22001 | 22000 | extents_type::@\exposid{index-cast}@(other.extents().extent(0)))
|
|
22062 | 22061 | \item
|
22063 | 22062 | If \exposid{rank_} is greater than 1 and
|
22064 | 22063 | \tcode{padding_value} does not equal \tcode{dynamic_extent},
|
22065 |
| -then \tcode{other.\linebreak stride(1)} equals |
| 22064 | +then \tcode{other.stride(1)} equals |
22066 | 22065 | \begin{codeblock}
|
22067 | 22066 | @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value,
|
22068 | 22067 | extents_type::@\exposid{index-cast}@(other.extent(0)))
|
|
22460 | 22459 | if \exposid{static-padding-stride} is not \tcode{dynamic_extent}.
|
22461 | 22460 | \begin{note}
|
22462 | 22461 | Using \tcode{extents<index_type, \exposid{static-padding-stride}>}
|
22463 |
| -instead of \tcode{index_type} as the type of \exposid{stride-\linebreak rm2} |
| 22462 | +instead of \tcode{index_type} as the type of \exposid{stride-rm2} |
22464 | 22463 | would achieve this.
|
22465 | 22464 | \end{note}
|
22466 | 22465 | \end{itemdescr}
|
@@ -22543,13 +22542,13 @@
|
22543 | 22542 | \item
|
22544 | 22543 | If \exposid{rank_} is greater than one,
|
22545 | 22544 | then the product of
|
22546 |
| -\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(\exposid{\linebreak rank_} - 1))} and |
| 22545 | +\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(\exposid{rank_} - 1))} and |
22547 | 22546 | all values \tcode{ext.extent($k$)}
|
22548 | 22547 | with $k$ in the range of \range{0}{\exposid{rank_} - 1}
|
22549 | 22548 | is representable as a value of type \tcode{index_type}.
|
22550 | 22549 | \item
|
22551 | 22550 | If \tcode{padding_value} is not equal to \tcode{dynamic_extent},
|
22552 |
| -\tcode{padding_value} equals \tcode{extents_type::\linebreak \exposid{index-cast}(pad)}. |
| 22551 | +\tcode{padding_value} equals \tcode{extents_type::\exposid{index-cast}(pad)}. |
22553 | 22552 | \end{itemize}
|
22554 | 22553 |
|
22555 | 22554 | \pnum
|
|
22622 | 22621 | \item
|
22623 | 22622 | If \exposid{rank_} is greater than 1 and
|
22624 | 22623 | \tcode{padding_value} does not equal \tcode{dynamic_extent},
|
22625 |
| -then \tcode{other.\linebreak stride(\exposid{rank_} - 2)} equals |
| 22624 | +then \tcode{other.stride(\exposid{rank_} - 2)} equals |
22626 | 22625 | \begin{codeblock}
|
22627 | 22626 | @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value,
|
22628 | 22627 | extents_type::@\exposid{index-cast}@(other.extents().extent(@\exposid{rank_}@ - 1)))
|
|
22690 | 22689 | \item
|
22691 | 22690 | If \exposid{rank_} is greater than 1 and
|
22692 | 22691 | \tcode{padding_value} does not equal \tcode{dynamic_extent},
|
22693 |
| -then \tcode{other.\linebreak stride(\exposid{rank_} - 2)} equals |
| 22692 | +then \tcode{other.stride(\exposid{rank_} - 2)} equals |
22694 | 22693 | \begin{codeblock}
|
22695 | 22694 | @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value,
|
22696 | 22695 | extents_type::@\exposid{index-cast}@(other.extent(@\exposid{rank_}@ - 1)))
|
|
24091 | 24090 | \item
|
24092 | 24091 | \tcode{stride(k) * \exposid{de-ice}($s_k$.stride)}
|
24093 | 24092 | if $S_k$ is a specialization of \tcode{strided_slice} and
|
24094 |
| -\tcode{$s_k$.stride < $s_k$.\linebreak extent} is \tcode{true}; |
| 24093 | +\tcode{$s_k$.stride < $s_k$.extent} is \tcode{true}; |
24095 | 24094 | \item
|
24096 | 24095 | otherwise, \tcode{stride($k$)}.
|
24097 | 24096 | \end{itemize}
|
@@ -24496,11 +24495,11 @@
|
24496 | 24495 | \begin{itemize}
|
24497 | 24496 | \item
|
24498 | 24497 | \tcode{decltype(submdspan_mapping(src.mapping(), slices...))}
|
24499 |
| -is a specialization of \tcode{submd-\linebreak{}span_mapping_result}. |
| 24498 | +is a specialization of \tcode{submdspan_mapping_result}. |
24500 | 24499 |
|
24501 | 24500 | \item
|
24502 | 24501 | \tcode{is_same_v<remove_cvref_t<decltype(sub_map_offset.mapping.extents())>,}
|
24503 |
| -\tcode{decltype(\linebreak{}submdspan_extents(src.mapping(), slices...))>} |
| 24502 | +\tcode{decltype(submdspan_extents(src.mapping(), slices...))>} |
24504 | 24503 | is \tcode{true}.
|
24505 | 24504 |
|
24506 | 24505 | \item
|
@@ -24530,11 +24529,11 @@
|
24530 | 24529 | \item
|
24531 | 24530 | $0 \le \tcode{\exposid{first_}<index_type, $k$>(slices...)}$
|
24532 | 24531 | $\le \tcode{\exposid{last_}<$k$>(src.extents(), slices...)}$
|
24533 |
| - $\le \tcode{\linebreak{}src.extent($k$)}$ |
| 24532 | + $\le \tcode{src.extent($k$)}$ |
24534 | 24533 | \end{itemize}
|
24535 | 24534 |
|
24536 | 24535 | \item
|
24537 |
| -\tcode{sub_map_offset.mapping.extents() == submdspan_extents(src.mapping(), slices...)}\linebreak |
| 24536 | +\tcode{sub_map_offset.mapping.extents() == submdspan_extents(src.mapping(), slices...)} |
24538 | 24537 | is \tcode{true}; and
|
24539 | 24538 |
|
24540 | 24539 | \item
|
|
0 commit comments