|
2365 | 2365 | Assigns \tcode{nh.ptr_} to \tcode{ptr_}.
|
2366 | 2366 | \item
|
2367 | 2367 | If \tcode{!alloc\textunderscore} or \tcode{ator_traits::propagate_on_container_move_assignment::value}
|
2368 |
| -is \tcode{true}, \linebreak |
2369 |
| -move assigns \tcode{nh.alloc_} to \tcode{alloc_}. |
| 2368 | +is \tcode{true}, move assigns \tcode{nh.alloc_} to \tcode{alloc_}. |
2370 | 2369 | \item
|
2371 | 2370 | Assigns
|
2372 | 2371 | \keyword{nullptr} to \tcode{nh.ptr_} and assigns \tcode{nullopt} to
|
|
7487 | 7486 | \pnum
|
7488 | 7487 | \expects
|
7489 | 7488 | \tcode{T} is \oldconcept{EmplaceConstructible} into \tcode{forward_list}
|
7490 |
| -from \tcode{std::forward<Args>(\linebreak args)...}. |
| 7489 | +from \tcode{std::forward<Args>(args)...}. |
7491 | 7490 | \tcode{position} is \tcode{before_begin()} or is a dereferenceable
|
7492 | 7491 | iterator in the range \range{begin()}{end()}.
|
7493 | 7492 |
|
7494 | 7493 | \pnum
|
7495 | 7494 | \effects
|
7496 | 7495 | Inserts an object of type \tcode{value_type} direct-non-list-initialized with
|
7497 |
| -\tcode{std::forward<Args>(\linebreak args)...} after \tcode{position}. |
| 7496 | +\tcode{std::forward<Args>(args)...} after \tcode{position}. |
7498 | 7497 |
|
7499 | 7498 | \pnum
|
7500 | 7499 | \returns
|
|
9429 | 9428 | \pnum
|
9430 | 9429 | The expression
|
9431 | 9430 | \tcode{\exposid{is-vector-bool-reference}<T>} is \tcode{true}
|
9432 |
| -if \tcode{T} denotes the type \tcode{vector<bool, Alloc>::\linebreak{}reference} |
| 9431 | +if \tcode{T} denotes the type \tcode{vector<bool, Alloc>::reference} |
9433 | 9432 | for some type \tcode{Alloc} and
|
9434 | 9433 | \tcode{vector<bool, Alloc>} is not a program-defined specialization.
|
9435 | 9434 | \end{itemdescr}
|
|
10859 | 10858 | Otherwise, let \tcode{r} be \tcode{equal_range(k)}.
|
10860 | 10859 | Constructs an object \tcode{u} of type \tcode{value_type} with
|
10861 | 10860 | \tcode{piecewise_construct, forward_as_tuple(std::forward<K>(k)),
|
10862 |
| -forward_as_tuple(std::forward<Args>(args)...)}.\linebreak |
| 10861 | +forward_as_tuple(std::forward<Args>(args)...)}. |
10863 | 10862 | If \tcode{equal_range(u.first) == r} is \tcode{false},
|
10864 | 10863 | the behavior is undefined.
|
10865 | 10864 | Inserts \tcode{u} into \tcode{*this}.
|
|
15280 | 15279 | \effects
|
15281 | 15280 | Initializes
|
15282 | 15281 | \tcode{c} with \tcode{ranges::to<Container>(std::forward<R>(rg), a)};
|
15283 |
| -calls \tcode{make_heap(c.\linebreak begin(), c.end(), comp)}. |
| 15282 | +calls \tcode{make_heap(c.begin(), c.end(), comp)}. |
15284 | 15283 | \end{itemdescr}
|
15285 | 15284 |
|
15286 | 15285 | \rSec3[priqueue.members]{Members}
|
|
16296 | 16295 | \pnum
|
16297 | 16296 | \effects
|
16298 | 16297 | Equivalent to \tcode{flat_map(s, key_cont, mapped_cont)} and
|
16299 |
| -\tcode{flat_map(s, key_cont, \linebreak{}mapped_cont, comp)}, respectively, |
| 16298 | +\tcode{flat_map(s, key_cont, mapped_cont, comp)}, respectively, |
16300 | 16299 | except that \tcode{c.keys} and \tcode{c.values} are constructed
|
16301 | 16300 | with uses-allocator construction\iref{allocator.uses.construction}.
|
16302 | 16301 |
|
|
16479 | 16478 | \pnum
|
16480 | 16479 | \effects
|
16481 | 16480 | Initializes an object \tcode{t} of type \tcode{pair<key_type, mapped_type>}
|
16482 |
| -with \tcode{std::forward<Args>(\linebreak args)...}; |
| 16481 | +with \tcode{std::forward<Args>(args)...}; |
16483 | 16482 | if the map already contains an element
|
16484 | 16483 | whose key is equivalent to \tcode{t.first},
|
16485 | 16484 | \tcode{*this} is unchanged.
|
|
16756 | 16755 | \effects
|
16757 | 16756 | If the map already contains an element \tcode{e}
|
16758 | 16757 | whose key is equivalent to \tcode{k},
|
16759 |
| -assigns \tcode{std::forward<\linebreak M>(obj)} to \tcode{e.second}. |
| 16758 | +assigns \tcode{std::forward<M>(obj)} to \tcode{e.second}. |
16760 | 16759 | Otherwise, equivalent to
|
16761 | 16760 | \begin{codeblock}
|
16762 | 16761 | try_emplace(std::forward<decltype(k)>(k), std::forward<M>(obj))
|
|
16811 | 16810 | \effects
|
16812 | 16811 | If the map already contains an element \tcode{e}
|
16813 | 16812 | whose key is equivalent to \tcode{k},
|
16814 |
| -assigns \tcode{std::forward<\linebreak M>(obj)} to \tcode{e.second}. |
| 16813 | +assigns \tcode{std::forward<M>(obj)} to \tcode{e.second}. |
16815 | 16814 | Otherwise, equivalent to
|
16816 | 16815 | \begin{codeblock}
|
16817 | 16816 | try_emplace(std::forward<K>(k), std::forward<M>(obj))
|
@@ -17416,14 +17415,14 @@
|
17416 | 17415 | \pnum
|
17417 | 17416 | \effects
|
17418 | 17417 | Equivalent to \tcode{flat_multimap(key_cont, mapped_cont)} and
|
17419 |
| -\tcode{flat_multimap(key_cont, \linebreak{}mapped_cont, comp)}, respectively, |
| 17418 | +\tcode{flat_multimap(key_cont, mapped_cont, comp)}, respectively, |
17420 | 17419 | except that \tcode{c.keys} and \tcode{c.values} are constructed
|
17421 | 17420 | with uses-allocator construction\iref{allocator.uses.construction}.
|
17422 | 17421 |
|
17423 | 17422 | \pnum
|
17424 | 17423 | \complexity
|
17425 | 17424 | Same as \tcode{flat_multimap(key_cont, mapped_cont)} and
|
17426 |
| -\tcode{flat_multimap(key_cont, \linebreak{}mapped_cont, comp)}, respectively. |
| 17425 | +\tcode{flat_multimap(key_cont, mapped_cont, comp)}, respectively. |
17427 | 17426 | \end{itemdescr}
|
17428 | 17427 |
|
17429 | 17428 | \indexlibraryctor{flat_multimap}%
|
|
21906 | 21905 | \item
|
21907 | 21906 | If \exposid{rank_} is greater than one,
|
21908 | 21907 | then the product of
|
21909 |
| -\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(\linebreak 0))} and |
| 21908 | +\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(0))} and |
21910 | 21909 | all values \tcode{ext.extent($k$)}
|
21911 | 21910 | with $k$ in the range of \range{1}{\exposid{rank_}}
|
21912 | 21911 | is representable as a value of type \tcode{index_type}.
|
|
21985 | 21984 | \item
|
21986 | 21985 | If \exposid{rank_} is greater than \tcode{1} and
|
21987 | 21986 | \tcode{padding_value} does not equal \tcode{dynamic_extent},
|
21988 |
| -then \tcode{other.\linebreak stride(1)} equals |
| 21987 | +then \tcode{other.stride(1)} equals |
21989 | 21988 | \begin{codeblock}
|
21990 | 21989 | @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value,
|
21991 | 21990 | extents_type::@\exposid{index-cast}@(other.extents().extent(0)))
|
|
22052 | 22051 | \item
|
22053 | 22052 | If \exposid{rank_} is greater than 1 and
|
22054 | 22053 | \tcode{padding_value} does not equal \tcode{dynamic_extent},
|
22055 |
| -then \tcode{other.\linebreak stride(1)} equals |
| 22054 | +then \tcode{other.stride(1)} equals |
22056 | 22055 | \begin{codeblock}
|
22057 | 22056 | @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value,
|
22058 | 22057 | extents_type::@\exposid{index-cast}@(other.extent(0)))
|
|
22450 | 22449 | if \exposid{static-padding-stride} is not \tcode{dynamic_extent}.
|
22451 | 22450 | \begin{note}
|
22452 | 22451 | Using \tcode{extents<index_type, \exposid{static-padding-stride}>}
|
22453 |
| -instead of \tcode{index_type} as the type of \exposid{stride-\linebreak rm2} |
| 22452 | +instead of \tcode{index_type} as the type of \exposid{stride-rm2} |
22454 | 22453 | would achieve this.
|
22455 | 22454 | \end{note}
|
22456 | 22455 | \end{itemdescr}
|
@@ -22533,13 +22532,13 @@
|
22533 | 22532 | \item
|
22534 | 22533 | If \exposid{rank_} is greater than one,
|
22535 | 22534 | then the product of
|
22536 |
| -\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(\exposid{\linebreak rank_} - 1))} and |
| 22535 | +\tcode{\exposid{LEAST-MULTIPLE-AT-LEAST}(pad, ext.extent(\exposid{rank_} - 1))} and |
22537 | 22536 | all values \tcode{ext.extent($k$)}
|
22538 | 22537 | with $k$ in the range of \range{0}{\exposid{rank_} - 1}
|
22539 | 22538 | is representable as a value of type \tcode{index_type}.
|
22540 | 22539 | \item
|
22541 | 22540 | If \tcode{padding_value} is not equal to \tcode{dynamic_extent},
|
22542 |
| -\tcode{padding_value} equals \tcode{extents_type::\linebreak \exposid{index-cast}(pad)}. |
| 22541 | +\tcode{padding_value} equals \tcode{extents_type::\exposid{index-cast}(pad)}. |
22543 | 22542 | \end{itemize}
|
22544 | 22543 |
|
22545 | 22544 | \pnum
|
|
22612 | 22611 | \item
|
22613 | 22612 | If \exposid{rank_} is greater than 1 and
|
22614 | 22613 | \tcode{padding_value} does not equal \tcode{dynamic_extent},
|
22615 |
| -then \tcode{other.\linebreak stride(\exposid{rank_} - 2)} equals |
| 22614 | +then \tcode{other.stride(\exposid{rank_} - 2)} equals |
22616 | 22615 | \begin{codeblock}
|
22617 | 22616 | @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value,
|
22618 | 22617 | extents_type::@\exposid{index-cast}@(other.extents().extent(@\exposid{rank_}@ - 1)))
|
|
22680 | 22679 | \item
|
22681 | 22680 | If \exposid{rank_} is greater than 1 and
|
22682 | 22681 | \tcode{padding_value} does not equal \tcode{dynamic_extent},
|
22683 |
| -then \tcode{other.\linebreak stride(\exposid{rank_} - 2)} equals |
| 22682 | +then \tcode{other.stride(\exposid{rank_} - 2)} equals |
22684 | 22683 | \begin{codeblock}
|
22685 | 22684 | @\exposid{LEAST-MULTIPLE-AT-LEAST}@(padding_value,
|
22686 | 22685 | extents_type::@\exposid{index-cast}@(other.extent(@\exposid{rank_}@ - 1)))
|
|
24081 | 24080 | \item
|
24082 | 24081 | \tcode{stride(k) * \exposid{de-ice}($s_k$.stride)}
|
24083 | 24082 | if $S_k$ is a specialization of \tcode{strided_slice} and
|
24084 |
| -\tcode{$s_k$.stride < $s_k$.\linebreak extent} is \tcode{true}; |
| 24083 | +\tcode{$s_k$.stride < $s_k$.extent} is \tcode{true}; |
24085 | 24084 | \item
|
24086 | 24085 | otherwise, \tcode{stride($k$)}.
|
24087 | 24086 | \end{itemize}
|
@@ -24486,11 +24485,11 @@
|
24486 | 24485 | \begin{itemize}
|
24487 | 24486 | \item
|
24488 | 24487 | \tcode{decltype(submdspan_mapping(src.mapping(), slices...))}
|
24489 |
| -is a specialization of \tcode{submd-\linebreak{}span_mapping_result}. |
| 24488 | +is a specialization of \tcode{submdspan_mapping_result}. |
24490 | 24489 |
|
24491 | 24490 | \item
|
24492 | 24491 | \tcode{is_same_v<remove_cvref_t<decltype(sub_map_offset.mapping.extents())>,}
|
24493 |
| -\tcode{decltype(\linebreak{}submdspan_extents(src.mapping(), slices...))>} |
| 24492 | +\tcode{decltype(submdspan_extents(src.mapping(), slices...))>} |
24494 | 24493 | is \tcode{true}.
|
24495 | 24494 |
|
24496 | 24495 | \item
|
@@ -24520,11 +24519,11 @@
|
24520 | 24519 | \item
|
24521 | 24520 | $0 \le \tcode{\exposid{first_}<index_type, $k$>(slices...)}$
|
24522 | 24521 | $\le \tcode{\exposid{last_}<$k$>(src.extents(), slices...)}$
|
24523 |
| - $\le \tcode{\linebreak{}src.extent($k$)}$ |
| 24522 | + $\le \tcode{src.extent($k$)}$ |
24524 | 24523 | \end{itemize}
|
24525 | 24524 |
|
24526 | 24525 | \item
|
24527 |
| -\tcode{sub_map_offset.mapping.extents() == submdspan_extents(src.mapping(), slices...)}\linebreak |
| 24526 | +\tcode{sub_map_offset.mapping.extents() == submdspan_extents(src.mapping(), slices...)} |
24528 | 24527 | is \tcode{true}; and
|
24529 | 24528 |
|
24530 | 24529 | \item
|
|
0 commit comments