Files
scylladb/test/boost/managed_vector_test.cc
Avi Kivity f3eade2f62 treewide: relicense to ScyllaDB-Source-Available-1.0
Drop the AGPL license in favor of a source-available license.
See the blog post [1] for details.

[1] https://www.scylladb.com/2024/12/18/why-were-moving-to-a-source-available-license/
2024-12-18 17:45:13 +02:00

145 lines
3.0 KiB
C++

/*
* Copyright (C) 2015-present ScyllaDB
*/
/*
* SPDX-License-Identifier: LicenseRef-ScyllaDB-Source-Available-1.0
*/
#include <boost/test/unit_test.hpp>
#include "test/lib/scylla_test_case.hh"
#include "utils/managed_vector.hh"
#include "utils/logalloc.hh"
static constexpr unsigned count = 125;
template<typename Vector>
void fill(Vector& vec) {
BOOST_CHECK(vec.empty());
for (unsigned i = 0; i < count; i++) {
vec.emplace_back(i);
}
BOOST_CHECK(!vec.empty());
BOOST_CHECK_EQUAL(vec.size(), count);
BOOST_CHECK_GE(vec.capacity(), vec.size());
}
template<typename Vector>
void verify_filled(const Vector& vec) {
unsigned idx = 0;
for (auto&& v : vec) {
BOOST_CHECK_EQUAL(v, idx);
BOOST_CHECK_EQUAL(vec[idx], idx);
idx++;
}
BOOST_CHECK_EQUAL(idx, count);
}
template<typename Vector>
void verify_empty(const Vector& vec) {
BOOST_CHECK_EQUAL(vec.size(), 0);
BOOST_CHECK(vec.empty());
for (auto&& v : vec) {
(void)v;
BOOST_FAIL("vec should be empty");
}
}
SEASTAR_THREAD_TEST_CASE(test_emplace) {
managed_vector<unsigned> vec;
fill(vec);
verify_filled(vec);
vec.clear();
verify_empty(vec);
}
SEASTAR_THREAD_TEST_CASE(test_copy) {
managed_vector<unsigned> vec;
managed_vector<unsigned> vec2(vec);
verify_empty(vec2);
fill(vec);
managed_vector<unsigned> vec3(vec);
verify_filled(vec);
verify_filled(vec3);
}
SEASTAR_THREAD_TEST_CASE(test_move) {
managed_vector<unsigned> vec;
managed_vector<unsigned> vec2(std::move(vec));
verify_empty(vec2);
fill(vec);
managed_vector<unsigned> vec3(std::move(vec));
verify_empty(vec);
verify_filled(vec3);
}
SEASTAR_THREAD_TEST_CASE(test_erase) {
managed_vector<unsigned> vec;
fill(vec);
vec.erase(vec.begin());
unsigned idx = 1;
for (auto&& v : vec) {
BOOST_CHECK_EQUAL(v, idx);
BOOST_CHECK_EQUAL(vec[idx - 1], idx);
idx++;
}
BOOST_CHECK_EQUAL(idx, count);
}
SEASTAR_THREAD_TEST_CASE(test_resize_up) {
managed_vector<unsigned> vec;
fill(vec);
vec.resize(count + 5);
unsigned idx = 0;
for (auto&& v : vec) {
if (idx < count) {
BOOST_CHECK_EQUAL(v, idx);
BOOST_CHECK_EQUAL(vec[idx], idx);
} else {
BOOST_CHECK_EQUAL(v, 0);
BOOST_CHECK_EQUAL(vec[idx], 0);
}
idx++;
}
BOOST_CHECK_EQUAL(idx, count + 5);
}
SEASTAR_THREAD_TEST_CASE(test_resize_down) {
managed_vector<unsigned> vec;
fill(vec);
vec.resize(5);
unsigned idx = 0;
for (auto&& v : vec) {
BOOST_CHECK_EQUAL(v, idx);
BOOST_CHECK_EQUAL(vec[idx], idx);
idx++;
}
BOOST_CHECK_EQUAL(idx, 5);
}
SEASTAR_THREAD_TEST_CASE(test_compaction) {
logalloc::region reg;
with_allocator(reg.allocator(), [&] {
managed_vector<unsigned> vec;
fill(vec);
verify_filled(vec);
reg.full_compaction();
verify_filled(vec);
});
}