17 template <
unsigned int N,
typename T>
18 class prevector_tester
33 const pretype& const_pre_vector = pre_vector;
34 assert(real_vector.size() == pre_vector.size());
35 assert(real_vector.empty() == pre_vector.empty());
36 for (Size s = 0; s < real_vector.size(); s++) {
37 assert(real_vector[s] == pre_vector[s]);
38 assert(&(pre_vector[s]) == &(pre_vector.begin()[s]));
39 assert(&(pre_vector[s]) == &*(pre_vector.begin() + s));
40 assert(&(pre_vector[s]) == &*((pre_vector.end() + s) - real_vector.size()));
43 assert(pretype(real_vector.begin(), real_vector.end()) == pre_vector);
44 assert(pretype(pre_vector.begin(), pre_vector.end()) == pre_vector);
46 for (
const T& v : pre_vector) {
47 assert(v == real_vector[pos]);
52 assert(v == real_vector[pos]);
54 for (
const T& v : const_pre_vector) {
55 assert(v == real_vector[pos]);
60 assert(v == real_vector[pos]);
66 assert(ss1.size() == ss2.size());
67 for (Size s = 0; s < ss1.size(); s++) {
74 real_vector.resize(s);
75 assert(real_vector.size() == s);
77 assert(pre_vector.size() == s);
82 real_vector.reserve(s);
83 assert(real_vector.capacity() >= s);
84 pre_vector.reserve(s);
85 assert(pre_vector.capacity() >= s);
88 void insert(Size position,
const T& value)
90 real_vector.insert(real_vector.begin() + position, value);
91 pre_vector.insert(pre_vector.begin() + position, value);
96 real_vector.insert(real_vector.begin() + position,
count, value);
97 pre_vector.insert(pre_vector.begin() + position,
count, value);
100 template <
typename I>
103 real_vector.insert(real_vector.begin() + position, first, last);
104 pre_vector.insert(pre_vector.begin() + position, first, last);
107 void erase(Size position)
109 real_vector.erase(real_vector.begin() + position);
110 pre_vector.erase(pre_vector.begin() + position);
113 void erase(Size first, Size last)
115 real_vector.erase(real_vector.begin() + first, real_vector.begin() + last);
116 pre_vector.erase(pre_vector.begin() + first, pre_vector.begin() + last);
119 void update(Size pos,
const T& value)
121 real_vector[pos] = value;
122 pre_vector[pos] = value;
127 real_vector.push_back(value);
128 pre_vector.push_back(value);
133 real_vector.pop_back();
134 pre_vector.pop_back();
143 void assign(Size n,
const T& value)
145 real_vector.assign(n, value);
146 pre_vector.assign(n, value);
151 return real_vector.size();
156 return pre_vector.capacity();
161 pre_vector.shrink_to_fit();
166 real_vector.swap(real_vector_alt);
167 pre_vector.swap(pre_vector_alt);
172 real_vector = std::move(real_vector_alt);
173 real_vector_alt.clear();
174 pre_vector = std::move(pre_vector_alt);
175 pre_vector_alt.clear();
180 real_vector = real_vector_alt;
181 pre_vector = pre_vector_alt;
187 size_t s = real_vector.size() / 2;
188 if (real_vector.capacity() < s + r) {
189 real_vector.reserve(s + r);
191 real_vector.resize(s);
192 pre_vector.resize_uninitialized(s);
194 real_vector.push_back(v);
196 auto p = pre_vector.size();
197 pre_vector.resize_uninitialized(p + r);
210 prevector_tester<8, int> test;
227 test.erase(beg, beg + del);
236 for (
int k = 0;
k < num; ++
k) {
244 std::vector<int>
values(num);
248 test.resize_uninitialized(
values);
255 test.shrink_to_fit();
Double ended buffer combining vector and stream-like interfaces.
T ConsumeIntegralInRange(T min, T max)
void erase(Size position)
void update(Size pos, const T &value)
prevector< N, T > pretype
std::vector< T > realtype
void assign(Size n, const T &value)
void insert_range(Size position, I first, I last)
void resize_uninitialized(realtype values)
void push_back(const T &value)
Implements a drop-in replacement for std::vector<T> which stores up to N elements directly (without h...
#define LIMITED_WHILE(condition, limit)
Can be used to limit a theoretically unbounded loop.
void insert(Tdst &dst, const Tsrc &src)
Simplification of std insertion.
reverse_range< T > reverse_iterate(T &x)
static const int64_t values[]
A selection of numbers that do not trigger int64_t overflow when added/subtracted.