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
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
|
#pragma once
// enum.hpp - Safe building blocks for enumerated types.
//
// Copyright © 2012-2014 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 "fwd.hpp"
#include <cassert>
#include <cstddef>
#include <algorithm>
#include <type_traits>
#include "../compat/iter.hpp"
#include "array.hpp"
namespace tmwa
{
// part moved to fwd.hpp
template<class T, class E, E max>
class eptr
{
constexpr static
size_t size()
{
return static_cast<size_t>(max);
}
T *_data;
public:
eptr(std::nullptr_t=nullptr)
: _data(nullptr)
{}
eptr(earray<T, E, max>& arr)
: _data(arr.data)
{}
T& operator [](E v) const
{
auto i = static_cast<size_t>(v);
assert (i < size());
return _data[i];
}
explicit operator bool()
{
return _data;
}
bool operator not()
{
return not _data;
}
};
// std::underlying_type isn't supported until gcc 4.7
// this is a poor man's emulation
// TODO I'm depending on GCC 4.7 now, this can go away
template<class E>
struct underlying_type
{
static_assert(std::is_enum<E>::value, "Only enums have underlying type!");
typedef typename std::conditional<
std::is_signed<E>::value,
typename std::make_signed<E>::type,
typename std::make_unsigned<E>::type
>::type type;
};
template<class E, bool=std::is_enum<E>::value>
struct remove_enum
{
typedef E type;
};
template<class E>
struct remove_enum<E, true>
{
typedef typename underlying_type<E>::type type;
};
// This really should just go in a namespace
// that's how I use it anyway ...
#define ENUM_BITWISE_OPERATORS(E) \
inline \
E operator & (E l, E r) \
{ \
typedef underlying_type<E>::type U; \
return E(U(l) & U(r)); \
} \
inline \
E operator | (E l, E r) \
{ \
typedef underlying_type<E>::type U; \
return E(U(l) | U(r)); \
} \
inline \
E operator ^ (E l, E r) \
{ \
typedef underlying_type<E>::type U; \
return E(U(l) ^ U(r)); \
} \
inline \
E& operator &= (E& l, E r) \
{ \
return l = l & r; \
} \
inline \
E& operator |= (E& l, E r) \
{ \
return l = l | r; \
} \
inline \
E& operator ^= (E& l, E r) \
{ \
return l = l ^ r; \
} \
inline \
E operator ~ (E r) \
{ \
return E(-1) ^ r; \
}
template<class E>
class EnumMath
{
typedef typename underlying_type<E>::type U;
public:
static
E inced(E v)
{
return static_cast<E>(static_cast<U>(v) + 1);
}
};
template<class E>
IteratorPair<ValueIterator<E, EnumMath<E>>> erange(E b, E e)
{
return {b, e};
}
} // namespace tmwa
|
