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
134
135
136
137
138
139
140
141
|
#pragma once
// variant.hpp - A single value, multiple type container. Better than boost's.
//
// Copyright © 2012 Ben Longbons <b.r.longbons@gmail.com>
//
// This file is part of The Mana World (Athena server)
//
// This program is free software: you can redistribute it and/or modify
// it under the terms of the GNU General Public License as published by
// the Free Software Foundation, either version 3 of the License, or
// (at your option) any later version.
//
// This program is distributed in the hope that it will be useful,
// but WITHOUT ANY WARRANTY; without even the implied warranty of
// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
// GNU General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program. If not, see <http://www.gnu.org/licenses/>.
#include <type_traits>
#include <cstdint>
#include <cstddef>
#include <utility>
#include "union.hpp"
#include "void.hpp"
#include "fwd.hpp"
namespace tmwa
{
namespace sexpr
{
#define MATCH_BEGIN(expr) \
{ \
auto&& _match_var = (expr); \
switch (tmwa::sexpr::VariantFriend::get_state(_match_var)) \
{ \
{ \
{ \
/* }}}} */
#define MATCH_END() \
/* {{{{ */ \
} \
} \
} \
(void) _match_var; \
}
#define MATCH_CASE(ty, v) \
/* {{{{ */ \
} \
break; \
} \
{ \
using _match_case_type = std::remove_const<std::remove_reference<ty>::type>::type; \
case tmwa::sexpr::VariantFriend::get_state_for<_match_case_type, decltype(_match_var)>(): \
{ \
ty v = tmwa::sexpr::VariantFriend::unchecked_get<_match_case_type>(_match_var);
/* }}}} */
#define MATCH_DEFAULT() \
/* {{{{ */ \
} \
break; \
} \
{ \
default: \
{ \
/* }}}} */
template<class... T>
class Variant
{
static_assert(sizeof...(T), "A variant must not be empty");
};
template<class D, class... T>
class Variant<D, T...>
{
constexpr static size_t state_count = 1 + sizeof...(T);
// simplify things immensely
friend class VariantFriend;
typedef Union<D, T...> DataType;
DataType data;
size_t state;
void do_destruct();
template<class C, class... A>
void do_construct(A&&... a);
public:
Variant();
~Variant();
void reset();
template<class C, class... A>
void emplace(A&&... a);
Variant(const Variant& r);
Variant(Variant&& r);
Variant& operator = (const Variant& r);
Variant& operator = (Variant&& r);
template<class E>
Variant(E e)
{
do_construct<E, E>(std::move(e));
}
template<class E>
Variant& operator = (E e)
{
emplace<E, E>(std::move(e));
return *this;
}
// use these ONLY if only one type makes sense
// otherwise use apply
template<class E>
bool is() const;
template<class E>
E *get_if();
template<class E>
const E *get_if() const;
};
template<class R, class F>
void apply(R& r, F&& f);
template<class R, class F, class V1, class... V>
void apply(R& r, F&& f, V1&& v1, V&&... v);
template<class F, class... V>
void apply(Void&& r, F&& f, V&&... v);
} // namespace sexpr
using sexpr::Variant;
} // namespace tmwa
#include "variant.tcc"
|
