A set of functions and function templates is formed comprising:
For each constructor of the primary class template designated by the template-name, if the template is defined, a function template with the following properties:
The template parameters are the template parameters of the class template followed by the template parameters (including default template arguments) of the constructor, if any.
The types of the function parameters are those of the constructor.
The return type is the class template specialization designated by the template-name and template arguments corresponding to the template parameters obtained from the class template.
If the primary class template C is not defined or does not declare any constructors, an additional function template derived as above from a hypothetical constructor C().
An additional function template derived as above from a hypothetical constructor C(C), called the copy deduction candidate.
For each deduction-guide, a function or function template with the following properties:
The template parameters, if any, and function parameters are those of the deduction-guide.
The return type is the simple-template-id of the deduction-guide.
Initialization and overload resolution are performed as described in [dcl.init] and [over.match.ctor], [over.match.copy], or [over.match.list] (as appropriate for the type of initialization performed) for an object of a hypothetical class type, where the selected functions and function templates are considered to be the constructors of that class type for the purpose of forming an overload set, and the initializer is provided by the context in which class template argument deduction was performed. Each such notional constructor is considered to be explicit if the function or function template was generated from a constructor or deduction-guide that was declared explicit. All such notional constructors are considered to be public members of the hypothetical class type.
[ Example:
template <class T> struct A {
explicit A(const T&, ...) noexcept; A(T&&, ...); };
int i;
A a1 = { i, i };
A a2{i, i}; A a3{0, i}; A a4 = {0, i};
template <class T> A(const T&, const T&) -> A<T&>; template <class T> explicit A(T&&, T&&) -> A<T>;
A a5 = {0, 1}; A a6{0,1}; A a7 = {0, i}; A a8{0,i};
template <class T> struct B {
template <class U> using TA = T;
template <class U> B(U, TA<U>);
};
B b{(int*)0, (char*)0};
— end example ]
RetroSearch is an open source project built by @garambo | Open a GitHub Issue
Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo
HTML:
3.2
| Encoding:
UTF-8
| Version:
0.7.4