c++编译期归并排序

偶然看到了这个题目尝试着自己写了一下，不动手还是觉得挺简单的。。。

#include <iostream>
#include <tuple>
template<typename itType, int i = 1>
struct Next {
   
    using type = typename Next < typename itType::next, i - 1 >::type;
};
template<typename itType>
struct Next<itType, 0> {
   
    using type = itType;
};

template<typename it, typename itE, size_t i = 0>
struct Size {
   
    constexpr static size_t value = Size < typename it::next, itE, i + 1 >::value;
};
template<typename it, size_t i>
struct Size<it, it, i> {
   
    constexpr static size_t value = i;
};

template<typename ValueType>
class Container {
   
    template<ValueType...values>
    struct MakeListHelper;
    template<typename itBegin, typename itEnd>
    struct ListSortImple;
    template<typename itBegin, typename itEnd, template<ValueType>class Template>
    struct ForeachImple;
public:

    template<ValueType v, typename Next = void>
    struct Node {
   
        constexpr static const ValueType value = v;
        using next = Next;
    };

    template <typename HeadNode = void>
    class List {
   
    public:
        using begin = HeadNode;
        using end = void;
    };

    template<ValueType ... values>
    using make_list = List<typename MakeListHelper<values...>::type>;
    template<typename itBegin, typename itEnd = void>
    using make_list_by_iterator = List<itBegin>;

    template<typename itBegin, typename itEnd>
    using sort = List<typename ListSortImple