|
1000 | 1000 | const @\unspec@ ignore;
|
1001 | 1001 |
|
1002 | 1002 | template <class... Types>
|
1003 |
| - constexpr tuple<@\textit{VTypes}@...> make_tuple(Types&&...); |
| 1003 | + constexpr tuple<@\placeholder{VTypes}@...> make_tuple(Types&&...); |
1004 | 1004 | template <class... Types>
|
1005 | 1005 | constexpr tuple<Types&&...> forward_as_tuple(Types&&...) noexcept;
|
1006 | 1006 |
|
1007 | 1007 | template<class... Types>
|
1008 | 1008 | constexpr tuple<Types&...> tie(Types&...) noexcept;
|
1009 | 1009 |
|
1010 | 1010 | template <class... Tuples>
|
1011 |
| - constexpr tuple<@\textit{Ctypes}@...> tuple_cat(Tuples&&...); |
| 1011 | + constexpr tuple<@\placeholder{Ctypes}@...> tuple_cat(Tuples&&...); |
1012 | 1012 |
|
1013 | 1013 | // \ref{tuple.helper}, tuple helper classes:
|
1014 | 1014 | template <class T> class tuple_size; // undefined
|
|
1561 | 1561 | \indexlibrary{\idxcode{tuple}!\idxcode{make_tuple}}%
|
1562 | 1562 | \begin{itemdecl}
|
1563 | 1563 | template<class... Types>
|
1564 |
| - constexpr tuple<@\textit{VTypes}@...> make_tuple(Types&&... t); |
| 1564 | + constexpr tuple<@\placeholder{VTypes}@...> make_tuple(Types&&... t); |
1565 | 1565 | \end{itemdecl}
|
1566 | 1566 |
|
1567 | 1567 | \begin{itemdescr} \pnum Let \tcode{$U_i$} be \tcode{decay_t<$T_i$>} for each
|
|
1639 | 1639 | \indexlibrary{\idxcode{tuple_cat}}
|
1640 | 1640 | \begin{itemdecl}
|
1641 | 1641 | template <class... Tuples>
|
1642 |
| - constexpr tuple<@\textit{CTypes}@...> tuple_cat(Tuples&&... tpls); |
| 1642 | + constexpr tuple<@\placeholder{CTypes}@...> tuple_cat(Tuples&&... tpls); |
1643 | 1643 | \end{itemdecl}
|
1644 | 1644 |
|
1645 | 1645 | \begin{itemdescr}
|
|
1660 | 1660 | \tcode{is_constructible<$A_{ik}$, $cv_i A_{ik}$\&\&>::value == true}.
|
1661 | 1661 |
|
1662 | 1662 | \pnum
|
1663 |
| -\remarks The types in \tcode{\textit{Ctypes}} shall be equal to the ordered |
| 1663 | +\remarks The types in \tcode{\placeholder{Ctypes}} shall be equal to the ordered |
1664 | 1664 | sequence of the extended types
|
1665 | 1665 | \tcode{$Args_0$..., $Args_1$...,} ... \tcode{$Args_{n-1}$...}, where $n$ is
|
1666 | 1666 | equal to \tcode{sizeof...(Tuples)}. Let \tcode{$e_i$...} be the $i^{th}$
|
|
0 commit comments