c++-模板元编程ValueList定义及基本操作

c++模板元编程TypeList定义及基本操作

c++模板元编程TypeList进阶操作Accumulate

c++模板元编程 编译期插入排序

#include <iostream>
#include <utility>
#include <string>
#include <cstring>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <boost/type_index.hpp>
#include "def.h"
#include "accumulate.h"
#include "insertionSort.h"

using namespace std;

// 值类型
template<typename T, T Value>
struct CTValue_ {
    constexpr static auto value = Value;
};

template<typename T, T Value>
constexpr auto CTValue_v = CTValue_<T, Value>::value;

// CTValue 测试, 求积
using Primes = TypeList<CTValue_<int, 2>, CTValue_<int, 3>, CTValue_<int, 5>, CTValue_<int, 7>>;

template<typename T, typename U>
struct Multiply_;

template<typename T, T Value1, T Value2>
struct Multiply_<CTValue_<T, Value1>, CTValue_<T, Value2>> {
    using type = CTValue_<T, Value1 * Value2>;
};
template<typename T, typename U>
using Multiply_t = typename Multiply_<T, U>::type;

void CTValue_Test() {
    cout << Accumulate_t<Primes, Multiply_, CTValue_<int, 1>>::value << endl;
}

template<typename T, T ...Values>
struct ValueList {
};

template<typename T, T...Values>
struct IsEmpty_<ValueList<T, Values...>> {
    constexpr static auto value = (sizeof...(Values) == 0);
};

template<typename T, T Head, T...Tail>
struct Front_<ValueList<T, Head, Tail...>, false> {
    using type = CTValue_<T, Head>;
    constexpr static auto value = Head;
};

template<typename T, T...Tail>
struct Front_<ValueList<T, Tail...>, true> {
};

template<typename T, T Head, T...Tail>
struct PopFront_<ValueList<T, Head, Tail...>, false> {
    using type = ValueList<T, Tail...>;
};

template<typename T, T...Tail, T New>
struct PushFront_<ValueList<T, Tail...>, CTValue_<T, New>> {
    using type = ValueList<T, New, Tail...>;
};

template<typename T, T...Tail, T New>
struct PushBack_<ValueList<T, Tail...>, CTValue_<T, New>> {
    using type = ValueList<T, Tail..., New>;
};

template<typename T, typename U>
struct LesserThan_;

template<typename T, T First, T Second>
struct LesserThan_<CTValue_<T, First>, CTValue_<T, Second>> {
    constexpr static auto value = First < Second;
};

int main() {
    using Intergers = ValueList<int, 2, 3, 5, 1, 6, 8, 9, 12, 6>;
    using SortedIntergers = InsertionSort_t<Intergers, LesserThan_>;
    cout << boost::typeindex::type_id_with_cvr<SortedIntergers>().pretty_name()<< endl;
}