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
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
/*
* Copyright 2013-2021 Max Kellermann <max.kellermann@gmail.com>
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
*
* - Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
*
* - Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the
* distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
* ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
* FOUNDATION OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
* SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT,
* STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE)
* ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED
* OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#ifndef CONST_BUFFER_HXX
#define CONST_BUFFER_HXX
#include <cassert>
#include <cstddef>
template<typename T>
struct ConstBuffer;
template<>
struct ConstBuffer<void> {
typedef std::size_t size_type;
using value_type = void;
using pointer = const void *;
using const_pointer = pointer;
using iterator = pointer;
using const_iterator = pointer;
pointer data;
size_type size;
ConstBuffer() = default;
constexpr ConstBuffer(std::nullptr_t) noexcept
:data(nullptr), size(0) {}
constexpr ConstBuffer(pointer _data, size_type _size) noexcept
:data(_data), size(_size) {}
constexpr static ConstBuffer<void> FromVoid(ConstBuffer<void> other) noexcept {
return other;
}
constexpr ConstBuffer<void> ToVoid() const noexcept {
return *this;
}
constexpr bool IsNull() const noexcept {
return data == nullptr;
}
constexpr bool operator==(std::nullptr_t) const noexcept {
return data == nullptr;
}
constexpr bool operator!=(std::nullptr_t) const noexcept {
return data != nullptr;
}
constexpr bool empty() const noexcept {
return size == 0;
}
};
/**
* A reference to a memory area that is read-only.
*/
template<typename T>
struct ConstBuffer {
using size_type = std::size_t;
using value_type = T;
using reference = const T &;
using const_reference = reference;
using pointer = const T *;
using const_pointer = pointer;
using iterator = pointer;
using const_iterator = pointer;
pointer data;
size_type size;
ConstBuffer() = default;
constexpr ConstBuffer(std::nullptr_t) noexcept
:data(nullptr), size(0) {}
constexpr ConstBuffer(pointer _data, size_type _size) noexcept
:data(_data), size(_size) {}
constexpr ConstBuffer(pointer _data, pointer _end) noexcept
:data(_data), size(_end - _data) {}
/**
* Convert array to ConstBuffer instance.
*/
template<size_type _size>
constexpr ConstBuffer(const T (&_data)[_size]) noexcept
:data(_data), size(_size) {}
/**
* Cast a ConstBuffer<void> to a ConstBuffer<T>, rounding down
* to the next multiple of T's size.
*/
static constexpr ConstBuffer<T> FromVoidFloor(ConstBuffer<void> other) noexcept {
static_assert(sizeof(T) > 0, "Empty base type");
return ConstBuffer<T>(pointer(other.data),
other.size / sizeof(T));
}
/**
* Cast a ConstBuffer<void> to a ConstBuffer<T>. A "void"
* buffer records its size in bytes, and when casting to "T",
* the assertion below ensures that the size is a multiple of
* sizeof(T).
*/
constexpr static ConstBuffer<T> FromVoid(ConstBuffer<void> other) noexcept {
static_assert(sizeof(T) > 0, "Empty base type");
assert(other.size % sizeof(T) == 0);
return FromVoidFloor(other);
}
constexpr ConstBuffer<void> ToVoid() const noexcept {
static_assert(sizeof(T) > 0, "Empty base type");
return ConstBuffer<void>(data, size * sizeof(T));
}
constexpr bool IsNull() const noexcept {
return data == nullptr;
}
constexpr bool operator==(std::nullptr_t) const noexcept {
return data == nullptr;
}
constexpr bool operator!=(std::nullptr_t) const noexcept {
return data != nullptr;
}
constexpr bool empty() const noexcept {
return size == 0;
}
template<typename U>
constexpr bool Contains(U &&u) const noexcept {
for (const auto &i : *this)
if (u == i)
return true;
return false;
}
constexpr iterator begin() const noexcept {
return data;
}
constexpr iterator end() const noexcept {
return data + size;
}
constexpr const_iterator cbegin() const noexcept {
return data;
}
constexpr const_iterator cend() const noexcept {
return data + size;
}
constexpr reference operator[](size_type i) const noexcept {
assert(i < size);
return data[i];
}
/**
* Returns a reference to the first element. Buffer must not
* be empty.
*/
constexpr reference front() const noexcept {
assert(!empty());
return data[0];
}
/**
* Returns a reference to the last element. Buffer must not
* be empty.
*/
constexpr reference back() const noexcept {
assert(!empty());
return data[size - 1];
}
/**
* Remove the first element (by moving the head pointer, does
* not actually modify the buffer). Buffer must not be empty.
*/
constexpr void pop_front() noexcept {
assert(!empty());
++data;
--size;
}
/**
* Remove the last element (by moving the tail pointer, does
* not actually modify the buffer). Buffer must not be empty.
*/
constexpr void pop_back() noexcept {
assert(!empty());
--size;
}
/**
* Remove the first element and return a reference to it.
* Buffer must not be empty.
*/
constexpr reference shift() noexcept {
reference result = front();
pop_front();
return result;
}
constexpr void skip_front(size_type n) noexcept {
assert(size >= n);
data += n;
size -= n;
}
/**
* Move the front pointer to the given address, and adjust the
* size attribute to retain the old end address.
*/
void MoveFront(pointer new_data) noexcept {
assert(IsNull() == (new_data == nullptr));
assert(new_data <= end());
size = end() - new_data;
data = new_data;
}
/**
* Move the end pointer to the given address (by adjusting the
* size).
*/
void SetEnd(pointer new_end) noexcept {
assert(IsNull() == (new_end == nullptr));
assert(new_end >= begin());
size = new_end - data;
}
};
#endif