Ske*_*een 5 c++ templates variadic-templates c++11
假设我有两个可变参数模板; typename... T, typename... U,我怎么去寻找他们的;
所以根据我的理解,连接很简单; (t..., u...),但是如何找到两者的最大公共子序列呢? - 它甚至可能吗?
And*_*owl 12
这是一个计算元组类型对的集合运算的解决方案.我假设元组可以用来保持着可变参数组,这样,一旦你有Ts...和Us...,你这样做:
typename tuple_intersect<std::tuple<Ts...>, std::tuple<Us...>>::type
Run Code Online (Sandbox Code Playgroud)
这给你一个元组,其中Vs...是的交集Ts...和Us....如果需要再次提取Vs...为参数包,只需提供元组作为接受以下函数的函数的输入tuple<Ts...>:
template<typename... Vs>
void func(std::tuple<Vs...>)
{
// Here, you have Vs... (= Us... & Ts...) as an argument pack
}
Run Code Online (Sandbox Code Playgroud)
框架:
以下是一些简单的元函数,它们对于下面的所有主要元函数都是通用的:
template<typename T, typename... Ts>
struct is_member_of_type_seq { static const bool value = false; };
template<typename T, typename U, typename... Ts>
struct is_member_of_type_seq<T, U, Ts...>
{
static const bool value = std::conditional<
std::is_same<T, U>::value,
std::true_type,
is_member_of_type_seq<T, Ts...>
>::type::value;
};
template<typename, typename>
struct append_to_type_seq { };
template<typename T, typename... Ts>
struct append_to_type_seq<T, std::tuple<Ts...>>
{
using type = std::tuple<Ts..., T>;
};
template<typename, typename>
struct prepend_to_type_seq { };
template<typename T, typename... Ts>
struct prepend_to_type_seq<T, std::tuple<Ts...>>
{
using type = std::tuple<T, Ts...>;
};
Run Code Online (Sandbox Code Playgroud)
1 - 连接
这个很简单:
template<typename, typename>
struct concat_type_seq { };
template<typename... Ts, typename... Us>
struct concat_type_seq<std::tuple<Ts...>, std::tuple<Us...>>
{
using type = std::tuple<Ts..., Us...>;
};
Run Code Online (Sandbox Code Playgroud)
还有一些测试:
static_assert(
std::is_same<
concat_type_seq<
std::tuple<char, int, bool>,
std::tuple<double, double, int>
>::type,
std::tuple<char, int, bool, double, double, int>
>::value,
"Error"
);
Run Code Online (Sandbox Code Playgroud)
2 - 最长的共同子序列
这个稍微复杂一点:
namespace detail
{
// Meta-function that returns, given two sequences S1 and S2, the longest
// subsequence of S1 in S2 that starts with the first element of S1 and
// begins at the first element of S2 (in other words, it returns the
// subsequence S2[0]..S2[N] such that S1[i] = S2[i] for each 0 <= i <= N.
template<typename, typename>
struct match_seq_in_seq_from_start
{
using type = std::tuple<>;
};
template<typename T, typename U, typename... Ts, typename... Us>
struct match_seq_in_seq_from_start<std::tuple<T, Ts...>, std::tuple<U, Us...>>
{
using type = typename std::conditional<
std::is_same<T, U>::value,
typename prepend_to_type_seq<
T,
typename match_seq_in_seq_from_start<
std::tuple<Ts...>,
std::tuple<Us...>
>::type
>::type,
std::tuple<>
>::type;
};
// Some testing...
static_assert(
std::is_same<
match_seq_in_seq_from_start<
std::tuple<int, double, char>,
std::tuple<int, double, long>
// ^^^^^^^^^^^
>::type,
std::tuple<int, double>
>::value,
"Error!"
);
// Meta-function that returns the same as the meta-function above,
// but starting from the first element of S2 which is identical to
// the first element of S1.
template<typename, typename>
struct match_first_seq_in_seq
{
using type = std::tuple<>;
};
template<typename T, typename U, typename... Ts, typename... Us>
struct match_first_seq_in_seq<std::tuple<T, Ts...>, std::tuple<U, Us...>>
{
using type = typename std::conditional<
std::is_same<T, U>::value,
typename match_seq_in_seq_from_start<
std::tuple<T, Ts...>,
std::tuple<U, Us...>
>::type,
typename match_first_seq_in_seq<
std::tuple<T, Ts...>,
std::tuple<Us...>
>::type
>::type;
};
// Some testing...
static_assert(
std::is_same<
match_first_seq_in_seq<
std::tuple<int, double, char>,
std::tuple<bool, char, int, double, long, int, double, char>
// ^^^^^^^^^^^
>::type,
std::tuple<int, double>
>::value,
"Error!"
);
// Meta-function that returns, given two sequences S1 and S2, the longest
// subsequence of S1 in S2 that starts with the first element of S1.
template<typename T, typename U>
struct match_seq_in_seq
{
using type = std::tuple<>;
};
template<typename U, typename... Ts, typename... Us>
struct match_seq_in_seq<std::tuple<Ts...>, std::tuple<U, Us...>>
{
using type1 = typename match_first_seq_in_seq<
std::tuple<Ts...>,
std::tuple<U, Us...>
>::type;
using type2 = typename match_seq_in_seq<
std::tuple<Ts...>,
std::tuple<Us...>
>::type;
using type = typename std::conditional<
(std::tuple_size<type1>::value > std::tuple_size<type2>::value),
type1,
type2
>::type;
};
// Some testing...
static_assert(
std::is_same<
match_seq_in_seq<
std::tuple<int, double, char>,
std::tuple<char, int, double, long, int, double, char>
// ^^^^^^^^^^^^^^^^^
>::type,
std::tuple<int, double, char>
>::value,
"Error!"
);
}
// Meta-function that returns, given two sequences S1 and S2, the longest
// subsequence of S1 in S2 (longest common subsequence).
template<typename T, typename U>
struct max_common_subseq
{
using type = std::tuple<>;
};
template<typename T, typename... Ts, typename... Us>
struct max_common_subseq<std::tuple<T, Ts...>, std::tuple<Us...>>
{
using type1 = typename detail::match_seq_in_seq<
std::tuple<T, Ts...>,
std::tuple<Us...>
>::type;
using type2 = typename max_common_subseq<
std::tuple<Ts...>,
std::tuple<Us...>
>::type;
using type = typename std::conditional<
(std::tuple_size<type1>::value > std::tuple_size<type2>::value),
type1,
type2
>::type;
};
Run Code Online (Sandbox Code Playgroud)
还有一些测试:
// Some testing...
static_assert(
std::is_same<
max_common_subseq<
std::tuple<int, double, char>,
std::tuple<char, int, char, double, char, long, int, bool, double>
>::type,
std::tuple<double, char>
>::value,
"Error!"
);
// Some more testing...
static_assert(
std::is_same<
max_common_subseq<
std::tuple<int, double, char, long, long, bool>,
// ^^^^^^^^^^^^^^^^
std::tuple<char, long, long, double, double, char>
// ^^^^^^^^^^^^^^^^
>::type,
std::tuple<char, long, long>
>::value,
"Error!"
);
Run Code Online (Sandbox Code Playgroud)
3 - 反转
这是反转类型序列的特性(返回具有反转类型列表的元组):
template<typename... Ts>
struct revert_type_seq
{
using type = std::tuple<>;
};
template<typename T, typename... Ts>
struct revert_type_seq<T, Ts...>
{
using type = typename append_to_type_seq<
T,
typename revert_type_seq<Ts...>::type
>::type;
};
Run Code Online (Sandbox Code Playgroud)
还有一些测试:
// Some testing...
static_assert(
std::is_same<
revert_type_seq<char, int, bool>::type,
std::tuple<bool, int, char>
>::value,
"Error"
);
Run Code Online (Sandbox Code Playgroud)
4 - 交叉口
这个没有被要求,但是作为奖励提供:
template<typename, typename>
struct intersect_type_seq
{
using type = std::tuple<>;
};
template<typename T, typename... Ts, typename... Us>
struct intersect_type_seq<std::tuple<T, Ts...>, std::tuple<Us...>>
{
using type = typename std::conditional<
!is_member_of_type_seq<T, Us...>::value,
typename intersect_type_seq<
std::tuple<Ts...>,
std::tuple<Us...>>
::type,
typename prepend_to_type_seq<
T,
typename intersect_type_seq<
std::tuple<Ts...>,
std::tuple<Us...>
>::type
>::type
>::type;
};
Run Code Online (Sandbox Code Playgroud)
还有一些测试:
// Some testing...
static_assert(
std::is_same<
intersect_type_seq<
std::tuple<char, int, bool, double>,
std::tuple<bool, long, double, float>
>::type,
std::tuple<bool, double>
>::value,
"Error!"
);
Run Code Online (Sandbox Code Playgroud)
| 归档时间: |
|
| 查看次数: |
685 次 |
| 最近记录: |