11#include <boost/test/unit_test.hpp>
18template <
unsigned int N,
typename T>
34 template <
typename A,
typename B>
45 const pretype& const_pre_vector = pre_vector;
48 for (
Size s = 0;
s < real_vector.size();
s++) {
52 local_check(&(pre_vector[
s]) == &*((pre_vector.
end() +
s) - real_vector.size()));
58 for (
const T& v : pre_vector) {
61 for (
const T& v : pre_vector | std::views::reverse) {
64 for (
const T& v : const_pre_vector) {
67 for (
const T& v : const_pre_vector | std::views::reverse) {
75 for (
Size s = 0;
s < ss1.size();
s++) {
83 real_vector.resize(
s);
92 real_vector.reserve(
s);
101 real_vector.insert(real_vector.begin() + position, value);
102 pre_vector.
insert(pre_vector.
begin() + position, value);
108 real_vector.insert(real_vector.begin() + position,
count, value);
113 template <
typename I>
116 real_vector.insert(real_vector.begin() + position, first, last);
117 pre_vector.
insert(pre_vector.
begin() + position, first, last);
123 real_vector.erase(real_vector.begin() + position);
124 pre_vector.
erase(pre_vector.
begin() + position);
130 real_vector.erase(real_vector.begin() + first, real_vector.begin() + last);
131 pre_vector.
erase(pre_vector.
begin() + first, pre_vector.
begin() + last);
137 real_vector[pos] = value;
138 pre_vector[pos] = value;
144 real_vector.push_back(value);
151 real_vector.pop_back();
164 real_vector.assign(n, value);
165 pre_vector.
assign(n, value);
170 return real_vector.size();
186 real_vector.swap(real_vector_alt);
187 pre_vector.
swap(pre_vector_alt);
193 real_vector = std::move(real_vector_alt);
194 real_vector_alt.clear();
195 pre_vector = std::move(pre_vector_alt);
196 pre_vector_alt.
clear();
201 real_vector = real_vector_alt;
202 pre_vector = pre_vector_alt;
208 size_t s = real_vector.size() / 2;
209 if (real_vector.capacity() <
s + r) {
210 real_vector.reserve(
s + r);
212 real_vector.resize(
s);
215 real_vector.push_back(v);
217 auto p = pre_vector.
size();
228 BOOST_CHECK_MESSAGE(passed,
"insecure_rand: " + rand_seed.
ToString());
240 for (
int j = 0; j < 64; j++) {
242 for (
int i = 0; i < 2048; i++) {
243 if (m_rng.randbits(2) == 0) {
244 test.
insert(m_rng.randrange(test.size() + 1),
int(m_rng.rand32()));
246 if (test.size() > 0 && m_rng.randbits(2) == 1) {
247 test.erase(m_rng.randrange(test.size()));
249 if (m_rng.randbits(3) == 2) {
250 int new_size = std::max(0, std::min(30, (
int)test.size() + (
int)m_rng.randrange(5) - 2));
251 test.resize(new_size);
253 if (m_rng.randbits(3) == 3) {
254 test.insert(m_rng.randrange(test.size() + 1), 1 + m_rng.randbool(),
int(m_rng.rand32()));
256 if (m_rng.randbits(3) == 4) {
257 int del = std::min<int>(test.size(), 1 + (m_rng.randbool()));
258 int beg = m_rng.randrange(test.size() + 1 - del);
259 test.erase(beg, beg + del);
261 if (m_rng.randbits(4) == 5) {
262 test.push_back(
int(m_rng.rand32()));
264 if (test.size() > 0 && m_rng.randbits(4) == 6) {
267 if (m_rng.randbits(5) == 7) {
269 int num = 1 + (m_rng.randbits(2));
270 for (
int k = 0;
k < num;
k++) {
271 values[
k] = int(m_rng.rand32());
273 test.insert_range(m_rng.randrange(test.size() + 1),
values,
values + num);
275 if (m_rng.randbits(5) == 8) {
276 int del = std::min<int>(test.size(), 1 + (m_rng.randbits(2)));
277 int beg = m_rng.randrange(test.size() + 1 - del);
278 test.erase(beg, beg + del);
280 if (m_rng.randbits(5) == 9) {
281 test.reserve(m_rng.randbits(5));
283 if (m_rng.randbits(6) == 10) {
284 test.shrink_to_fit();
286 if (test.size() > 0) {
287 test.update(m_rng.randrange(test.size()),
int(m_rng.rand32()));
289 if (m_rng.randbits(10) == 11) {
292 if (m_rng.randbits(9) == 12) {
293 test.assign(m_rng.randbits(5),
int(m_rng.rand32()));
295 if (m_rng.randbits(3) == 3) {
298 if (m_rng.randbits(4) == 8) {
301 if (m_rng.randbits(5) == 18) {
304 if (m_rng.randbits(5) == 19) {
305 unsigned int num = 1 + (m_rng.randbits(4));
306 std::vector<int>
values(num);
308 v = int(m_rng.rand32());
310 test.resize_uninitialized(
values);
Double ended buffer combining vector and stream-like interfaces.
void Reseed(const uint256 &seed) noexcept
Reseed with explicit seed (only for testing).
uint256 rand256() noexcept
generate a random uint256.
std::string ToString() const
void erase(Size position)
void update(Size pos, const T &value)
void local_check_equal(A a, B b)
void insert(Size position, Size count, const T &value)
prevector< N, T > pretype
void erase(Size first, Size last)
prevector_tester(FastRandomContext &rng)
void insert(Size position, const T &value)
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...
void swap(prevector< N, T, Size, Diff > &other) noexcept
iterator erase(iterator pos)
void reserve(size_type new_capacity)
void resize_uninitialized(size_type new_size)
void resize(size_type new_size)
iterator insert(iterator pos, const T &value)
void assign(size_type n, const T &val)
void push_back(const T &value)
BOOST_FIXTURE_TEST_SUITE(cuckoocache_tests, BasicTestingSetup)
Test Suite for CuckooCache.
BOOST_AUTO_TEST_SUITE_END()
BOOST_AUTO_TEST_CASE(PrevectorTestInt)
static const int64_t values[]
A selection of numbers that do not trigger int64_t overflow when added/subtracted.
Testing setup that configures a complete environment.