diff --git a/source/algorithms.tex b/source/algorithms.tex index d40125348d..c9ab8d9d3c 100644 --- a/source/algorithms.tex +++ b/source/algorithms.tex @@ -10092,7 +10092,7 @@ $E(\tcode{e1}, \tcode{e1})$ be \tcode{bool(invoke(comp, invoke(proj2, e2), invoke(proj1, e1)))}; \item $K$ be the smallest integer in \range{0}{last1 - first1} - such that for every element \tcode{e1} in the position \tcode{first1 + $K$} + such that for the element \tcode{e1} in the position \tcode{first1 + $K$} there are at least $N - K$ elements \tcode{e2} in \range{first2}{last2} for which $E(\tcode{e1}, \tcode{e1})$ holds, and be equal to \tcode{last1 - first1} @@ -10128,7 +10128,7 @@ \tcode{result + $N$} for the overloads in namespace \tcode{std}. \item - \tcode{\{first1 + $K$, first2 + $N$ - $K$, result_last\}} + \tcode{\{first1 + $K$, first2 + $N$ - $K$, result + $N$\}} for the overloads in namespace \tcode{ranges}. \end{itemize} @@ -13593,7 +13593,7 @@ template concept @\defexposconcept{nothrow-sized-sentinel-for}@ = // \expos @\exposconcept{nothrow-sentinel-for}@ && - @\libconcept{sentinel_for}@; + @\libconcept{sized_sentinel_for}@; \end{itemdecl} \begin{itemdescr} diff --git a/source/exec.tex b/source/exec.tex index 92c01d1fbc..058038eff0 100644 --- a/source/exec.tex +++ b/source/exec.tex @@ -8608,7 +8608,7 @@ \end{itemize} \item If \tcode{r.execute(b, e)} is called, -then \tcode{b} and \tcode{e} are in the range \range{0}{n} and +then \tcode{b} and \tcode{e} are in the range \crange{0}{n} and $\tcode{b} < \tcode{e}$. \item For each $i$ in \range{0}{n}, diff --git a/source/memory.tex b/source/memory.tex index 4b3d168212..8ad74c9351 100644 --- a/source/memory.tex +++ b/source/memory.tex @@ -232,7 +232,8 @@ constexpr I uninitialized_default_construct_n(I first, // freestanding iter_difference_t n); - template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{nothrow-random-access-iterator}@ I, @\exposconcept{nothrow-sentinel-for}@ S> + template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{nothrow-random-access-iterator}@ I, + @\exposconcept{nothrow-sized-sentinel-for}@ S> requires @\libconcept{default_initializable}@> I uninitialized_default_construct(Ep&& exec, I first, S last); // freestanding-deleted, // see \ref{algorithms.parallel.overloads} @@ -276,7 +277,8 @@ constexpr I uninitialized_value_construct_n(I first, // freestanding iter_difference_t n); - template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{nothrow-random-access-iterator}@ I, @\exposconcept{nothrow-sentinel-for}@ S> + template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{nothrow-random-access-iterator}@ I, + @\exposconcept{nothrow-sized-sentinel-for}@ S> requires @\libconcept{default_initializable}@> I uninitialized_value_construct(Ep&& exec, I first, S last); // freestanding-deleted, // see \ref{algorithms.parallel.overloads} @@ -333,7 +335,7 @@ O ofirst, S olast); template<@\exposconcept{execution-policy}@ Ep, @\libconcept{random_access_iterator}@ I, @\libconcept{sized_sentinel_for}@ S1, - @\exposconcept{nothrow-random-access-iterator}@ O, @\exposconcept{nothrow-sentinel-for}@ S2> + @\exposconcept{nothrow-random-access-iterator}@ O, @\exposconcept{nothrow-sized-sentinel-for}@ S2> requires @\libconcept{constructible_from}@, iter_reference_t> uninitialized_copy_result uninitialized_copy(Ep&& exec, I ifirst, S1 ilast, // freestanding-deleted, @@ -345,7 +347,7 @@ uninitialized_copy(Ep&& exec, IR&& in_range, OR&& out_range); // freestanding-deleted, // see \ref{algorithms.parallel.overloads} template<@\exposconcept{execution-policy}@ Ep, @\libconcept{random_access_iterator}@ I, @\exposconcept{nothrow-random-access-iterator}@ O, - @\exposconcept{nothrow-sentinel-for}@ S> + @\exposconcept{nothrow-sized-sentinel-for}@ S> requires @\libconcept{constructible_from}@, iter_reference_t> uninitialized_copy_n_result uninitialized_copy_n(Ep&& exec, I ifirst, iter_difference_t n, // freestanding-deleted, @@ -395,7 +397,7 @@ O ofirst, S olast); template<@\exposconcept{execution-policy}@ Ep, @\libconcept{random_access_iterator}@ I, @\libconcept{sized_sentinel_for}@ S1, - @\exposconcept{nothrow-random-access-iterator}@ O, @\exposconcept{nothrow-sentinel-for}@ S2> + @\exposconcept{nothrow-random-access-iterator}@ O, @\exposconcept{nothrow-sized-sentinel-for}@ S2> requires @\libconcept{constructible_from}@, iter_rvalue_reference_t> uninitialized_move_result uninitialized_move(Ep&& exec, I ifirst, S1 ilast, // freestanding-deleted, @@ -408,7 +410,7 @@ // see \ref{algorithms.parallel.overloads} template<@\exposconcept{execution-policy}@ Ep, @\libconcept{random_access_iterator}@ I, - @\exposconcept{nothrow-random-access-iterator}@ O, @\exposconcept{nothrow-sentinel-for}@ S> + @\exposconcept{nothrow-random-access-iterator}@ O, @\exposconcept{nothrow-sized-sentinel-for}@ S> requires @\libconcept{constructible_from}@, iter_rvalue_reference_t> uninitialized_move_n_result uninitialized_move_n(Ep&& exec, I ifirst, iter_difference_t n, // freestanding-deleted, @@ -446,7 +448,7 @@ iter_difference_t n, const T& x); template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{nothrow-random-access-iterator}@ I, - @\exposconcept{nothrow-sentinel-for}@ S, class T> + @\exposconcept{nothrow-sized-sentinel-for}@ S, class T> requires @\libconcept{constructible_from}@, const T&> I uninitialized_fill(Ep&& exec, I first, S last, const T& x); // freestanding-deleted, // see \ref{algorithms.parallel.overloads} @@ -502,7 +504,8 @@ requires @\libconcept{destructible}@> constexpr I destroy_n(I first, iter_difference_t n) noexcept; // freestanding - template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{nothrow-random-access-iterator}@ I, @\exposconcept{nothrow-sentinel-for}@ S> + template<@\exposconcept{execution-policy}@ Ep, @\exposconcept{nothrow-random-access-iterator}@ I, + @\exposconcept{nothrow-sized-sentinel-for}@ S> requires @\libconcept{destructible}@> I destroy(Ep&& exec, I first, S last) noexcept; // freestanding-deleted, // see \ref{algorithms.parallel.overloads} diff --git a/source/meta.tex b/source/meta.tex index 81df5dfe7d..08347e9506 100644 --- a/source/meta.tex +++ b/source/meta.tex @@ -3266,7 +3266,7 @@ consteval info common_type(R&& type_args); template<@\libconcept{reflection_range}@ R = initializer_list> consteval info common_reference(R&& type_args); - consteval info type_underlying_type(info type); + consteval info underlying_type(info type); template<@\libconcept{reflection_range}@ R = initializer_list> consteval info invoke_result(info type, R&& type_args); consteval info unwrap_reference(info type); @@ -3612,7 +3612,7 @@ \tcode{op_slash_equals} & \tcode{operator/=} & \tcode{/=} \\ \rowsep \tcode{op_percent_equals} & \tcode{operator\%=} & \tcode{\%=} \\ \rowsep \tcode{op_caret_equals} & \tcode{operator\caret=} & \tcode{\caret=} \\ \rowsep -\tcode{op_ampersand_equals} & \tcode{operator\&=} & \tcode{\&} \\ \rowsep +\tcode{op_ampersand_equals} & \tcode{operator\&=} & \tcode{\&=} \\ \rowsep \tcode{op_pipe_equals} & \tcode{operator|=} & \tcode{|=} \\ \rowsep \tcode{op_equals_equals} & \tcode{operator==} & \tcode{==} \\ \rowsep \tcode{op_exclamation_equals} & \tcode{operator!=} & \tcode{!=} \\ \rowsep @@ -4245,7 +4245,7 @@ \pnum \returns -\tcode{true} if \tcode{r} represents a const or volatile type, respectively, +\tcode{true} if \tcode{T} represents a const or volatile type, respectively, or a const- or volatile-qualified function type, respectively. Otherwise, \tcode{false}. \end{itemdescr} @@ -5222,7 +5222,7 @@ \end{itemdescr} \begin{itemdecl} -static consteval access_context @\libmember{via}{access_context}@(info cls) noexcept; +static consteval access_context @\libmember{via}{access_context}@(info cls) const; \end{itemdecl} \begin{itemdescr} @@ -5949,8 +5949,9 @@ \begin{itemize} \item \tcode{U} is a pointer type, - \tcode{T} and \tcode{U} are similar types\iref{conv.qual}, and - \tcode{is_convertible_v<\brk{}U, T>} is \tcode{true}, + \tcode{T} and \tcode{U} are either similar\iref{conv.qual} + or both function pointer types, and + \tcode{is_convertible_v} is \tcode{true}, \item \tcode{U} is not a pointer type and the cv-unqualified types of \tcode{T} and \tcode{U} are the same, @@ -6182,7 +6183,7 @@ \indexlibraryglobal{reflect_function}% \begin{itemdecl} template - consteval info reflect_function(T& expr); + consteval info reflect_function(T& fn); \end{itemdecl} \begin{itemdescr} @@ -6197,7 +6198,7 @@ \pnum \throws \tcode{meta::exception} unless -\tcode{expr} is suitable for use as a constant template argument +\tcode{fn} is suitable for use as a constant template argument for a constant template parameter of type \tcode{T\&}\iref{temp.arg.nontype}. \end{itemdescr} pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy