Merge 2017-11 LWG Motion 7

Author: tkoeppe

source/utilities.tex

@@ -1729,7 +1729,7 @@
 Equivalent to:
 \begin{codeblock}
 return apply_impl(std::forward<F>(f), std::forward<Tuple>(t),
-                  make_index_sequence<tuple_size_v<decay_t<Tuple>>>{});
+                  make_index_sequence<tuple_size_v<remove_reference_t<Tuple>>>{});
 \end{codeblock}
 \end{itemdescr}
 
@@ -1751,8 +1751,9 @@
 \end{codeblock}
 Equivalent to:
 \begin{codeblock}
-return make_from_tuple_impl<T>(forward<Tuple>(t),
-                               make_index_sequence<tuple_size_v<decay_t<Tuple>>>{});
+return make_from_tuple_impl<T>(
+           forward<Tuple>(t),
+           make_index_sequence<tuple_size_v<remove_reference_t<Tuple>>>{});
 \end{codeblock}
 \begin{note} The type of \tcode{T} must be supplied
 as an explicit template parameter,
@@ -2430,8 +2431,8 @@
 this constructor shall be a constexpr constructor.
 This constructor shall not participate in overload resolution unless
 \tcode{is_constructible_v<T, U\&\&>} is \tcode{true},
-\tcode{is_same_v<decay_t<U>, in_place_t>} is \tcode{false}, and
-\tcode{is_same_v<optional<T>, decay_t<U>>} is \tcode{false}.
+\tcode{is_same_v<remove_cvref_t<U>, in_place_t>} is \tcode{false}, and
+\tcode{is_same_v<remove_cvref_t<U>, optional>} is \tcode{false}.
 The constructor is explicit if and only if
 \tcode{is_convertible_v<U\&\&, T>} is \tcode{false}.
 \end{itemdescr}
@@ -2668,7 +2669,7 @@
 \remarks
 If any exception is thrown, the result of the expression \tcode{bool(*this)} remains unchanged. If an exception is thrown during the call to \tcode{T}'s constructor, the state of \tcode{v} is determined by the exception safety guarantee of \tcode{T}'s constructor. If an exception is thrown during the call to \tcode{T}'s assignment, the state of \tcode{*val} and \tcode{v} is determined by the exception safety guarantee of \tcode{T}'s assignment.
 This function shall not participate in overload resolution unless
-\tcode{is_same_v<optional<T>, decay_t<U>>} is \tcode{false},
+\tcode{is_same_v<remove_cvref_t<U>, optional>} is \tcode{false},
 \tcode{conjunction_v<is_scalar<T>, is_same<T, decay_t<U>>>} is \tcode{false},
 \tcode{is_constructible_v<T, U>} is \tcode{true}, and
 \tcode{is_assignable_v<T\&, U>} is \tcode{true}.
@@ -3975,16 +3976,27 @@
 
 \pnum
 \remarks
-This function shall not participate in overload resolution
-unless \tcode{sizeof...(Types)} is nonzero,
-unless \tcode{is_same_v<decay_t<T>, variant>} is \tcode{false},
-unless \tcode{decay_t<T>} is neither
-a specialization of \tcode{in_place_type_t}
-nor a specialization of \tcode{in_place_index_t},
-unless \tcode{is_constructible_v<$\tcode{T}_j$, T>} is \tcode{true},
-and unless the expression
-\tcode{\placeholdernc{FUN}(}\brk\tcode{std::forward<T>(t))} (with \tcode{\placeholdernc{FUN}}
-being the above-mentioned set of imaginary functions) is well-formed.
+This function shall not participate in overload resolution unless
+\begin{itemize}
+\item
+  \tcode{sizeof...(Types)} is nonzero,
+
+\item
+  \tcode{is_same_v<remove_cvref_t<T>, variant>} is \tcode{false},
+
+\item
+  \tcode{remove_cvref_t<T>} is neither a specialization
+  of \tcode{in_place_type_t} nor a specialization
+  of \tcode{in_place_index_t},
+
+\item
+  \tcode{is_constructible_v<$\tcode{T}_j$, T>} is \tcode{true}, and
+
+\item
+  the expression \tcode{\placeholdernc{FUN}(}\brk\tcode{std::forward<T>(t))}
+  (with \tcode{\placeholdernc{FUN}} being the above-mentioned set of
+  imaginary functions) is well-formed.
+\end{itemize}
 
 \pnum
 \begin{note}
@@ -4268,11 +4280,19 @@
 \pnum
 \remarks
 This function shall not participate in overload resolution unless
-\tcode{is_same_v<decay_t<T>, variant>} is \tcode{false}, unless
-\tcode{is_assignable_v<$\tcode{T}_j$\&, T> \&\& is_constructible_v<$\tcode{T}_j$, T>} is \tcode{true},
-and unless the expression \tcode{\placeholdernc{FUN}(std::forward<T>(t))} (with
-\tcode{\placeholdernc{FUN}} being the above-mentioned set of imaginary functions)
-is well-formed.
+\begin{itemize}
+\item
+  \tcode{is_same_v<remove_cvref_t<T>, variant>} is \tcode{false},
+
+\item
+  \tcode{is_assignable_v<$\tcode{T}_j$\&, T> \&\& is_constructible_v<$\tcode{T}_j$, T>}
+  is \tcode{true}, and
+
+\item
+  the expression \tcode{\placeholdernc{FUN}(std::forward<T>(t))}
+  (with \tcode{\placeholdernc{FUN}} being the above-mentioned set
+  of imaginary functions) is well-formed.
+\end{itemize}
 
 \pnum
 \begin{note}
@@ -5502,7 +5522,7 @@
 
 \begin{itemdescr}
 \pnum
-Let \tcode{U} be the type \tcode{remove_cv_t<remove_reference_t<T>>}.
+Let \tcode{U} be the type \tcode{remove_cvref_t<T>}.
 
 \pnum
 \requires
@@ -12800,23 +12820,23 @@
 \begin{itemize}
 \item \tcode{(t$_1$.*f)(t$_2$, $\dotsc$, t$_N$)} when \tcode{f} is a pointer to a
 member function of a class \tcode{T}
-and \tcode{is_base_of_v<T, decay_t<decltype(t$_1$)>>} is \tcode{true};
+and \tcode{is_base_of_v<T, remove_reference_t<decltype(t$_1$)>>} is \tcode{true};
 
 \item \tcode{(t$_1$.get().*f)(t$_2$, $\dotsc$, t$_N$)} when \tcode{f} is a pointer to a
 member function of a class \tcode{T}
-and \tcode{decay_t<decltype(t$_1$)>} is a specialization of \tcode{reference_wrapper};
+and \tcode{remove_cvref_t<decltype(t$_1$)>} is a specialization of \tcode{reference_wrapper};
 
 \item \tcode{((*t$_1$).*f)(t$_2$, $\dotsc$, t$_N$)} when \tcode{f} is a pointer to a
 member function of a class \tcode{T}
 and \tcode{t$_1$} does not satisfy the previous two items;
 
 \item \tcode{t$_1$.*f} when \tcode{N == 1} and \tcode{f} is a pointer to
 data member of a class \tcode{T}
-and \tcode{is_base_of_v<T, decay_t<decltype(t$_1$)>>} is \tcode{true};
+and \tcode{is_base_of_v<T, remove_reference_t<decltype(t$_1$)>>} is \tcode{true};
 
 \item \tcode{t$_1$.get().*f} when \tcode{N == 1} and \tcode{f} is a pointer to
 data member of a class \tcode{T}
-and \tcode{decay_t<decltype(t$_1$)>} is a specialization of \tcode{reference_wrapper};
+and \tcode{remove_cvref_t<decltype(t$_1$)>} is a specialization of \tcode{reference_wrapper};
 
 \item \tcode{(*t$_1$).*f} when \tcode{N == 1} and \tcode{f} is a pointer to
 data member of a class \tcode{T}