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
|
#ifndef CONST_ARRAY_HPP
#define CONST_ARRAY_HPP
// const_array.hpp - just a pointer-to-const and a length
//
// Copyright © 2011-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 "../sanity.hpp"
#include <cstring>
#include <iterator>
#include <ostream>
#include <vector>
#ifdef WORKAROUND_GCC46_COMPILER
// constexpr is buggy with templates in this version
// Is this still needed now that const_string is removed?
# define constexpr /* nothing */
#endif
// TODO see if I ever actually use this, and not the subclass
template<class T>
class const_array
{
const T *d;
size_t n;
public:
typedef const T *iterator;
typedef std::reverse_iterator<iterator> reverse_iterator;
constexpr
const_array(std::nullptr_t)
: d(nullptr), n(0)
{}
constexpr
const_array(const T *p, size_t z)
: d(p), n(z)
{}
constexpr
const_array(const T *b, const T *e)
: d(b), n(e - b)
{}
const_array(std::initializer_list<T> list)
: d(list.begin()), n(list.size())
{}
// Implicit conversion from std::vector
const_array(const std::vector<T>& v)
: d(v.data()), n(v.size())
{}
// but disallow conversion from a temporary
const_array(std::vector<T>&&) = delete;
// Oops. see src/warnings.hpp
constexpr
const T *data() const { return d; }
constexpr
size_t size() const { return n; }
constexpr
bool empty() const { return not n; }
constexpr explicit
operator bool() const { return n; }
constexpr
std::pair<const_array, const_array> cut(size_t o) const
{
return {const_array(d, o), const_array(d + o, n - o)};
}
constexpr
const_array first(size_t o) const
{
return cut(o).first;
}
constexpr
const_array last(size_t l) const
{
return cut(size() - l).second;
}
constexpr
const_array after(size_t o) const
{
return cut(o).second;
}
constexpr
iterator begin() const { return d; }
constexpr
iterator end() const { return d + n; }
constexpr
reverse_iterator rbegin() const { return reverse_iterator(end()); }
constexpr
reverse_iterator rend() const { return reverse_iterator(begin()); }
constexpr
const T& front() const { return *begin(); }
constexpr
const T& back() const { return *rbegin(); }
// This probably shouldn't be used, but I'm adding it for porting.
T& operator[](size_t i)
{
return const_cast<T&>(d[i]);
}
};
#ifdef WORKAROUND_GCC46_COMPILER
# undef constexpr
#endif
#endif // CONST_ARRAY_HPP
|
