-
Notifications
You must be signed in to change notification settings - Fork 33
/
size_limited_containers.hpp
367 lines (332 loc) · 12.2 KB
/
size_limited_containers.hpp
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
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
/**
* Copyright Quadrivium LLC
* All Rights Reserved
* SPDX-License-Identifier: Apache-2.0
*/
#pragma once
#include <fmt/format.h>
#include <limits>
#include <qtils/cxx20/lexicographical_compare_three_way.hpp>
#include <span>
#include <stdexcept>
#include <type_traits>
#include <vector>
namespace kagome::common {
template <typename Container, typename T>
concept MutIter = std::is_same_v<T, typename Container::iterator>;
template <typename Container, typename T>
concept ConstIter = std::is_same_v<T, typename Container::const_iterator>;
template <typename Container, typename T>
concept Iter = MutIter<Container, T> or ConstIter<Container, T>;
class MaxSizeException : public std::length_error {
public:
template <typename Format, typename... Args>
// cppcoreguidelines-missing-std-forward
MaxSizeException(const Format &format, const Args &...args)
: std::length_error(
fmt::vformat(format, fmt::make_format_args(args...))) {}
};
template <typename BaseContainer, std::size_t MaxSize>
class SizeLimitedContainer : public BaseContainer {
protected:
using Base = BaseContainer;
using Span = std::span<typename Base::value_type>;
static constexpr bool size_check_is_enabled =
MaxSize < std::numeric_limits<typename Base::size_type>::max();
public:
// Next line is required at least for the scale-codec
static constexpr bool is_static_collection = false;
[[nodiscard]] inline constexpr typename Base::size_type max_size() {
return MaxSize;
}
SizeLimitedContainer() = default;
explicit SizeLimitedContainer(size_t size)
: Base([&] {
if constexpr (size_check_is_enabled) {
[[unlikely]] if (size > max_size()) {
throw MaxSizeException(
"Destination has limited size by {}; requested size is {}",
max_size(),
size);
}
}
return Base(size);
}()) {}
SizeLimitedContainer(size_t size, const typename Base::value_type &value)
: Base([&] {
if constexpr (size_check_is_enabled) {
[[unlikely]] if (size > max_size()) {
throw MaxSizeException(
"Destination has limited size by {}; requested size is {}",
max_size(),
size);
}
}
return Base(size, value);
}()) {}
SizeLimitedContainer(const Base &other)
: Base([&] {
if constexpr (size_check_is_enabled) {
[[unlikely]] if (other.size() > max_size()) {
throw MaxSizeException(
"Destination has limited size by {}; Source size is {}",
max_size(),
other.size());
}
}
return other;
}()) {}
SizeLimitedContainer(Base &&other)
: Base([&] {
if constexpr (size_check_is_enabled) {
[[unlikely]] if (other.size() > max_size()) {
throw MaxSizeException(
"Destination has limited size by {}; Source size is {}",
max_size(),
other.size());
}
}
return std::move(other);
}()) {}
template <typename Iter>
requires std::is_base_of_v<
std::input_iterator_tag,
typename std::iterator_traits<Iter>::iterator_category>
SizeLimitedContainer(Iter begin, Iter end)
: Base([&] {
if constexpr (size_check_is_enabled) {
const size_t size = std::distance(begin, end);
[[unlikely]] if (size > max_size()) {
throw MaxSizeException(
"Container has limited size by {}; Source range size is {}",
max_size(),
Base::size());
}
}
return Base(std::move(begin), std::move(end));
}()) {}
SizeLimitedContainer(std::initializer_list<typename Base::value_type> list)
: SizeLimitedContainer(list.begin(), list.end()) {}
SizeLimitedContainer &operator=(const Base &other) {
if constexpr (size_check_is_enabled) {
[[unlikely]] if (other.size() > max_size()) {
throw MaxSizeException(
"Destination has limited size by {}; Source size is {}",
max_size(),
other.size());
}
}
static_cast<Base &>(*this) = other;
return *this;
}
SizeLimitedContainer &operator=(Base &&other) {
if constexpr (size_check_is_enabled) {
[[unlikely]] if (other.size() > max_size()) {
throw MaxSizeException(
"Destination has limited size by {}; Source size is {}",
max_size(),
other.size());
}
}
static_cast<Base &>(*this) = std::move(other);
return *this;
}
SizeLimitedContainer &operator=(
std::initializer_list<typename Base::value_type> list) {
if constexpr (size_check_is_enabled) {
[[unlikely]] if (list.size() > max_size()) {
throw MaxSizeException(
"Destination has limited size by {}; Source size is {}",
max_size(),
list.size());
}
}
static_cast<Base &>(*this) =
std::forward<std::initializer_list<typename Base::value_type>>(list);
return *this;
}
void assign(typename Base::size_type size,
const typename Base::value_type &value) {
if constexpr (size_check_is_enabled) {
[[unlikely]] if (size > max_size()) {
throw MaxSizeException(
"Destination has limited size by {}; Requested size is {}",
max_size(),
size);
}
}
return Base::assign(size, value);
}
template <typename Iter>
requires std::is_base_of_v<
std::input_iterator_tag,
typename std::iterator_traits<Iter>::iterator_category>
void assign(Iter begin, Iter end) {
if constexpr (size_check_is_enabled) {
const size_t size = std::distance(begin, end);
[[unlikely]] if (size > max_size()) {
throw MaxSizeException(
"Container has limited size by {}; Source range size is {}",
max_size(),
Base::size());
}
}
return Base::assign(std::move(begin), std::move(end));
}
void assign(std::initializer_list<typename Base::value_type> list) {
if constexpr (size_check_is_enabled) {
[[unlikely]] if (list.size() > max_size()) {
throw MaxSizeException(
"Container has limited size by {}; Source range size is {}",
max_size(),
Base::size());
}
}
return Base::assign(std::move(list));
}
template <typename... Args>
typename Base::reference &emplace_back(Args &&...args) {
if constexpr (size_check_is_enabled) {
[[unlikely]] if (Base::size() >= max_size()) {
throw MaxSizeException(
"Container has limited size by {}; Size is already {} ",
max_size(),
Base::size());
}
}
return Base::emplace_back(std::forward<Args>(args)...);
}
template <typename It, typename... Args>
requires Iter<Base, It>
typename Base::iterator emplace(It pos, Args &&...args) {
if constexpr (size_check_is_enabled) {
[[unlikely]] if (Base::size() >= max_size()) {
throw MaxSizeException(
"Container has limited size by {}; Size is already {} ",
max_size(),
Base::size());
}
}
return Base::emplace(std::move(pos), std::forward<Args>(args)...);
}
template <typename It, typename... Args>
requires Iter<Base, It>
typename Base::iterator insert(It pos,
const typename Base::value_type &value) {
if constexpr (size_check_is_enabled) {
[[unlikely]] if (Base::size() >= max_size()) {
throw MaxSizeException(
"Destination has limited size by {}; Size is already {} ",
max_size(),
Base::size());
}
}
return Base::insert(std::move(pos), value);
}
template <typename It, typename... Args>
requires Iter<Base, It>
typename Base::iterator insert(It pos,
typename Base::size_type size,
const typename Base::value_type &value) {
if constexpr (size_check_is_enabled) {
const auto available = max_size() - Base::size();
[[unlikely]] if (available < size) {
throw MaxSizeException(
"Destination has limited size by {}; Requested size is {}",
max_size(),
size);
}
}
return Base::insert(std::move(pos), size, value);
}
template <typename OutIt, typename InIt>
requires Iter<Base, OutIt>
and std::is_base_of_v<
std::input_iterator_tag,
typename std::iterator_traits<InIt>::iterator_category>
typename Base::iterator insert(OutIt pos, InIt begin, InIt end) {
if constexpr (size_check_is_enabled) {
const size_t size = std::distance(begin, end);
const auto available = max_size() - Base::size();
[[unlikely]] if (available < size) {
throw MaxSizeException(
"Destination has limited size by {} and current size is {}; "
"Source range size is {} and would overflow destination",
max_size(),
Base::size(),
size);
}
}
return Base::insert(std::move(pos), std::move(begin), std::move(end));
}
template <typename It, typename... Args>
requires Iter<Base, It>
typename Base::iterator insert(
It pos, std::initializer_list<typename Base::value_type> &&list) {
if constexpr (size_check_is_enabled) {
const auto available = max_size() - Base::size();
[[unlikely]] if (available < list.size()) {
throw MaxSizeException(
"Container has limited size by {}; Source range size is {}",
max_size(),
Base::size());
}
}
return Base::insert(pos, std::move(list));
}
template <typename V>
void push_back(V &&value) {
if constexpr (size_check_is_enabled) {
[[unlikely]] if (Base::size() >= max_size()) {
throw MaxSizeException(
"Container has limited size by {}; Size is already maximum",
max_size());
}
}
Base::push_back(std::forward<V>(value));
}
void reserve(typename Base::size_type size) {
if constexpr (size_check_is_enabled) {
[[unlikely]] if (size > max_size()) {
throw MaxSizeException(
"Destination has limited size by {}; Requested size is {}",
max_size(),
size);
}
}
return Base::reserve(size);
}
void resize(typename Base::size_type size) {
if constexpr (size_check_is_enabled) {
[[unlikely]] if (size > max_size()) {
throw MaxSizeException(
"Destination has limited size by {}; Requested size is {}",
max_size(),
size);
}
}
return Base::resize(size);
}
void resize(typename Base::size_type size,
const typename Base::value_type &value) {
if constexpr (size_check_is_enabled) {
[[unlikely]] if (size > max_size()) {
throw MaxSizeException(
"Destination has limited size by {}; Requested size is {}",
max_size(),
size);
}
}
return Base::resize(size, value);
}
auto operator<=>(const SizeLimitedContainer &other) const {
return qtils::cxx20::lexicographical_compare_three_way(
Base::begin(), Base::end(), other.begin(), other.end());
}
};
template <typename ElementType,
size_t MaxSize,
typename Allocator = std::allocator<ElementType>>
using SLVector =
SizeLimitedContainer<std::vector<ElementType, Allocator>, MaxSize>;
} // namespace kagome::common