-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathP592.ExpandingTuples.cpp
More file actions
133 lines (122 loc) · 3.58 KB
/
Copy pathP592.ExpandingTuples.cpp
File metadata and controls
133 lines (122 loc) · 3.58 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
#include <iostream>
#include <utility>
#include <type_traits>
template<typename... Types>
class Tuple;
template<typename Head, typename... Tail>
class Tuple<Head, Tail...>
{
private:
Head head;
Tuple<Tail...> tail;
public:
// constructors
Tuple() {}
template<typename VHead, typename... VTail, typename = std::enable_if_t<sizeof...(Tail) == sizeof...(VTail)>>
Tuple(VHead&& _head, VTail&&... _tail)
: head(std::forward<VHead>(_head))
, tail(std::forward<VTail>(_tail)...) {}
template<typename VHead, typename... VTail, typename = std::enable_if_t<sizeof...(Tail) == sizeof...(VTail)>>
Tuple(const Tuple<VHead, VTail...>& other)
: head(other.getHead())
, tail(other.getTail()) {}
template<typename VHead, typename... VTail, typename = std::enable_if_t<sizeof...(Tail) == sizeof...(VTail)>>
Tuple(Tuple<VHead, VTail...>&& other)
: head(std::move(other.getHead())
, tail(std::move(other.getTail()))) {}
Head& getHead() { return head; }
const Head& getHead() const { return head; }
Tuple<Tail...>& getTail() { return tail; }
const Tuple<Tail...>& getTail() const { return tail; }
};
template<>
class Tuple<> {};
// get<>: get element of tuple recursively
template<unsigned N>
struct TupleGet
{
template<typename Head, typename... Tail>
static decltype(auto) apply(const Tuple<Head, Tail...>& t)
{
return TupleGet<N-1>::apply(t.getTail());
}
template<typename Head, typename... Tail>
static decltype(auto) apply(Tuple<Head, Tail...>& t)
{
return TupleGet<N-1>::apply(t.getTail());
}
template<typename Head, typename... Tail>
static decltype(auto) apply(Tuple<Head, Tail...>&& t)
{
return TupleGet<N-1>::apply(t.getTail());
}
};
template<>
struct TupleGet<0>
{
template<typename Head, typename... Tail>
static const Head& apply(const Tuple<Head, Tail...>& t)
{
return t.getHead();
}
template<typename Head, typename... Tail>
static Head& apply(Tuple<Head, Tail...>& t)
{
return t.getHead();
}
template<typename Head, typename... Tail>
static Head&& apply(Tuple<Head, Tail...>&& t)
{
return t.getHead();
}
template<typename... Types>
static int apply(const Tuple<Types...>& t) // fallback: for promptation
{
static_assert(sizeof...(Types) > 0, "The index if out of range of tuple.");
return 0;
}
};
// get<>
template<unsigned N, typename... Types>
decltype(auto) get(const Tuple<Types...>& t)
{
return TupleGet<N>::apply(t);
};
template<unsigned N, typename... Types>
decltype(auto) get(Tuple<Types...>& t)
{
return TupleGet<N>::apply(t);
};
template<unsigned N, typename... Types>
decltype(auto) get(Tuple<Types...>&& t)
{
return TupleGet<N>::apply(t);
};
// makeTuple
template<typename... Types>
auto makeTuple(Types&&... elems)
{
return Tuple<std::decay_t<Types>...>(std::forward<Types>(elems)...);
}
// expanding tuple
template<typename F, typename... Elements, std::size_t... Indices>
decltype(auto) applyImpl(F&& f, const Tuple<Elements...>& t, std::index_sequence<Indices...>)
{
return f(get<Indices>(t)...);
}
template<typename F, typename... Elements>
decltype(auto) apply(F&& f, const Tuple<Elements...>& t)
{
return applyImpl(std::forward<F>(f), t, std::make_index_sequence<sizeof...(Elements)>());
}
void f(int a, double b, std::string s)
{
std::cout << a << ", " << b << ", " << s << std::endl;
}
using namespace std::literals;
int main(int argc, char const *argv[])
{
auto t = makeTuple(1, 2.1, "hello"s);
apply(f, t);
return 0;
}