Skip to content

Motions 2022 11 lwg 9 #5995

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Dec 15, 2022
Merged

Motions 2022 11 lwg 9 #5995

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
12c97c5
P2602R2 Poison Pills are Too Toxic
danra Nov 21, 2022
12440ca
[concept.swappable] Add note explaining why swap poison pill is still…
danra Nov 21, 2022
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
5 changes: 5 additions & 0 deletions source/concepts.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -620,6 +620,11 @@
exchange the values denoted by
\tcode{E1} and \tcode{E2},
the program is ill-formed, no diagnostic required.
\begin{note}
This precludes calling unconstrained program-defined overloads of
\tcode{swap}. When the deleted overload is viable, program-defined overloads
need to be more specialized\iref{temp.func.order} to be selected.
\end{note}

\item
Otherwise, if \tcode{E1} and \tcode{E2}
Expand Down
13 changes: 7 additions & 6 deletions source/iterators.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -1133,12 +1133,8 @@
\item \tcode{iter_move(E)}, if
\tcode{E} has class or enumeration type and
\tcode{iter_move(E)} is a well-formed expression when treated as an unevaluated operand,
with overload resolution performed in a context
that does not include a declaration of \tcode{ranges::iter_move}
but does include the declaration
\begin{codeblock}
void iter_move();
\end{codeblock}
where the meaning of \tcode{iter_move} is established as-if by performing
argument-dependent lookup only\iref{basic.lookup.argdep}.

\item Otherwise, if the expression \tcode{*E} is well-formed:
\begin{itemize}
Expand Down Expand Up @@ -1203,6 +1199,11 @@
If the function selected by overload resolution does not exchange the values
denoted by \tcode{E1} and \tcode{E2},
the program is ill-formed, no diagnostic required.
\begin{note}
This precludes calling unconstrained \tcode{std::iter_swap}. When the deleted
overload is viable, program-defined overloads need to be more
specialized\iref{temp.func.order} to be selected.
\end{note}

\item Otherwise, if the types of \tcode{E1} and \tcode{E2} each model
\libconcept{indirectly_readable}, and if the reference types of \tcode{E1} and \tcode{E2}
Expand Down
15 changes: 0 additions & 15 deletions source/lib-intro.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -845,21 +845,6 @@
Each customization point object type constrains its return type to model a
particular concept.

\pnum
\begin{note}
Many of the customization point objects in the library evaluate function call
expressions with an unqualified name which results in a call to a
program-defined function found by argument dependent name
lookup\iref{basic.lookup.argdep}. To preclude such an expression resulting in a
call to unconstrained functions with the same name in namespace \tcode{std},
customization point objects specify that lookup for these expressions is
performed in a context that includes deleted overloads matching the signatures
of overloads defined in namespace \tcode{std}. When the deleted overloads are
viable, program-defined overloads need to be more specialized\iref{temp.func.order}
or more constrained\iref{temp.constr.order} to be used by a customization point
object.
\end{note}

\rSec3[functions.within.classes]{Functions within classes}

\pnum
Expand Down
55 changes: 15 additions & 40 deletions source/ranges.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -640,15 +640,10 @@
\tcode{auto(begin(t))}
is a valid expression whose type models
\libconcept{input_or_output_iterator}
with overload resolution performed in a context in which
unqualified lookup for \tcode{begin} finds only the declarations
\begin{codeblock}
void begin(auto&) = delete;
void begin(const auto&) = delete;
\end{codeblock}
where the meaning of \tcode{begin} is established as-if by performing
argument-dependent lookup only\iref{basic.lookup.argdep},
then \tcode{ranges::begin(E)} is expression-equivalent to
\tcode{auto(begin(t))}
with overload resolution performed in the above context.
that expression.

\item
Otherwise, \tcode{ranges::begin(E)} is ill-formed.
Expand Down Expand Up @@ -711,15 +706,10 @@
\tcode{auto(end(t))}
is a valid expression whose type models
\tcode{\libconcept{sentinel_for}<iterator_t<T>>}
with overload resolution performed in a context in which
unqualified lookup for \tcode{end} finds only the declarations
\begin{codeblock}
void end(auto&) = delete;
void end(const auto&) = delete;
\end{codeblock}
where the meaning of \tcode{end} is established as-if by performing
argument-dependent lookup only\iref{basic.lookup.argdep},
then \tcode{ranges::end(E)} is expression-equivalent to
\tcode{auto(end(t))}
with overload resolution performed in the above context.
that expression.

\item
Otherwise, \tcode{ranges::end(E)} is ill-formed.
Expand Down Expand Up @@ -833,15 +823,10 @@
\tcode{auto(rbegin(t))}
is a valid expression whose type models
\libconcept{input_or_output_iterator}
with overload resolution performed in a context in which
unqualified lookup for \tcode{rbegin} finds only the declarations
\begin{codeblock}
void rbegin(auto&) = delete;
void rbegin(const auto&) = delete;
\end{codeblock}
where the meaning of \tcode{rbegin} is established as-if by performing
argument-dependent lookup only\iref{basic.lookup.argdep},
then \tcode{ranges::rbegin(E)} is expression-equivalent to
\tcode{auto(rbegin(t))}
with overload resolution performed in the above context.
that expression.

\item
Otherwise, if both \tcode{ranges::begin(t)} and \tcode{ranges::end(t)}
Expand Down Expand Up @@ -902,15 +887,10 @@
\tcode{auto(rend(t))}
is a valid expression whose type models
\tcode{\libconcept{sentinel_for}<decltype(ranges::rbegin(E))>}
with overload resolution performed in a context in which
unqualified lookup for \tcode{rend} finds only the declarations
\begin{codeblock}
void rend(auto&) = delete;
void rend(const auto&) = delete;
\end{codeblock}
where the meaning of \tcode{rend} is established as-if by performing
argument-dependent lookup only\iref{basic.lookup.argdep},
then \tcode{ranges::rend(E)} is expression-equivalent to
\tcode{auto(rend(t))}
with overload resolution performed in the above context.
that expression.

\item
Otherwise, if both \tcode{ranges::begin(t)} and \tcode{ranges::end(t)}
Expand Down Expand Up @@ -1032,15 +1012,10 @@
\tcode{disable_sized_range<remove_cv_t<T>>} is \tcode{false} and
\tcode{auto(size(t))}
is a valid expression of integer-like type
with overload resolution performed in a context in which
unqualified lookup for \tcode{size} finds only the declarations
\begin{codeblock}
void size(auto&) = delete;
void size(const auto&) = delete;
\end{codeblock}
where the meaning of \tcode{size} is established as-if by performing
argument-dependent lookup only\iref{basic.lookup.argdep},
then \tcode{ranges::size(E)} is expression-equivalent to
\tcode{auto(size(t))}
with overload resolution performed in the above context.
that expression.

\item
Otherwise, if
Expand Down
14 changes: 7 additions & 7 deletions source/support.tex
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -684,7 +684,7 @@
#define @\defnlibxname{cpp_lib_polymorphic_allocator}@ 201902L // also in \libheader{memory_resource}
#define @\defnlibxname{cpp_lib_print}@ 202207L // also in \libheader{print}, \libheader{ostream}
#define @\defnlibxname{cpp_lib_quoted_string_io}@ 201304L // also in \libheader{iomanip}
#define @\defnlibxname{cpp_lib_ranges}@ 202207L
#define @\defnlibxname{cpp_lib_ranges}@ 202211L
// also in \libheader{algorithm}, \libheader{functional}, \libheader{iterator}, \libheader{memory}, \libheader{ranges}
#define @\defnlibxname{cpp_lib_ranges_as_const}@ 202207L // also in \libheader{ranges}
#define @\defnlibxname{cpp_lib_ranges_as_rvalue}@ 202207L // also in \libheader{ranges}
Expand Down Expand Up @@ -4924,8 +4924,8 @@
\item
Otherwise, \tcode{strong_ordering(strong_order(E, F))}
if it is a well-formed expression
with overload resolution performed in a context
that does not include a declaration of \tcode{std::strong_order}.
where the meaning of \tcode{strong_order} is established as-if by performing
argument-dependent lookup only\iref{basic.lookup.argdep}.
\item
Otherwise, if the decayed type \tcode{T} of \tcode{E} is
a floating-point type,
Expand Down Expand Up @@ -4962,8 +4962,8 @@
\item
Otherwise, \tcode{weak_ordering(weak_order(E, F))}
if it is a well-formed expression
with overload resolution performed in a context
that does not include a declaration of \tcode{std::weak_order}.
where the meaning of \tcode{weak_order} is established as-if by performing
argument-dependent lookup only\iref{basic.lookup.argdep}.
\item
Otherwise, if the decayed type \tcode{T} of \tcode{E}
is a floating-point type,
Expand Down Expand Up @@ -5014,8 +5014,8 @@
\item
Otherwise, \tcode{partial_ordering(partial_order(E, F))}
if it is a well-formed expression
with overload resolution performed in a context
that does not include a declaration of \tcode{std::partial_order}.
where the meaning of \tcode{partial_order} is established as-if by performing
argument-dependent lookup only\iref{basic.lookup.argdep}.
\item
Otherwise, \tcode{partial_ordering(compare_three_way()(E, F))}
if it is a well-formed expression.
Expand Down