How about simple recursion
#include <utility>
#include <tuple>
// 1. metafunction to concatenate a type and a tuple
template<typename T, typename U> struct tuple_prepend_type;
template<typename T, typename ...U>
struct tuple_prepend_type<T, std::tuple<U...>>
{
using type = std::tuple<T, U...>;
};
// 2. is_pair type trait
template<typename>
struct is_pair : std::false_type {};
template<typename U, typename V>
struct is_pair<std::pair<U, V>> : public std::true_type {};
// 3. the converter itself
template<typename T, typename = void>
struct pairs_to_tuple {
using type = std::tuple<typename T::first_type,
typename T::second_type>;
};
template<typename T>
struct pairs_to_tuple<T, typename std::enable_if<
is_pair<typename T::second_type>::value
>::type
>
{
using type = typename tuple_prepend_type<
typename T::first_type,
typename pairs_to_tuple<typename T::second_type>::type
>::type;
};
int main()
{
std::pair<int, std::pair<double, std::pair<bool, char> > > p;
static_assert(std::is_same<pairs_to_tuple<decltype(p)>::type,
std::tuple<int, double, bool, char>>::value, "")
}