mirror of
https://github.com/scylladb/scylladb.git
synced 2026-04-28 20:27:03 +00:00
7faf2eed2f
Remove assumptions in the build system about dynamically linked boost unit tests. Includes seastar update which would have otherwise broken the build.
89 lines
2.5 KiB
C++
89 lines
2.5 KiB
C++
/*
|
|
* Copyright (C) 2016 ScyllaDB
|
|
*/
|
|
|
|
/*
|
|
* This file is part of Scylla.
|
|
*
|
|
* Scylla is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU Affero General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* Scylla is distributed in the hope that it will be useful,
|
|
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
|
* GNU General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with Scylla. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#define BOOST_TEST_MODULE core
|
|
|
|
#include <iostream>
|
|
#include <memory>
|
|
#include <vector>
|
|
#include <boost/test/unit_test.hpp>
|
|
|
|
#include "utils/anchorless_list.hh"
|
|
|
|
struct object : anchorless_list_base_hook<object> {
|
|
int value;
|
|
};
|
|
|
|
BOOST_AUTO_TEST_CASE(test_achorless_list) {
|
|
std::vector<std::unique_ptr<object>> objects;
|
|
for (unsigned i = 0; i < 100; i++) {
|
|
objects.emplace_back(std::make_unique<object>());
|
|
objects.back()->value = i;
|
|
}
|
|
|
|
for (unsigned i = 50; i < 99; i++) {
|
|
objects[i + 1]->insert_after(*objects[i]);
|
|
}
|
|
|
|
for (unsigned i = 50; i > 0; i--) {
|
|
objects[i - 1]->insert_before(*objects[i]);
|
|
}
|
|
|
|
BOOST_REQUIRE(objects.front()->is_front());
|
|
BOOST_REQUIRE(objects.back()->is_back());
|
|
|
|
unsigned current = 0;
|
|
for (auto&& v : objects.front()->all_elements()) {
|
|
BOOST_REQUIRE_EQUAL(v.value, current++);
|
|
}
|
|
BOOST_REQUIRE_EQUAL(current, objects.size());
|
|
|
|
current = 50;
|
|
for (auto&& v : objects[50]->elements_from_this()) {
|
|
BOOST_REQUIRE_EQUAL(v.value, current++);
|
|
}
|
|
BOOST_REQUIRE_EQUAL(current, objects.size());
|
|
|
|
for (auto it = objects.begin(); it != objects.end(); ++it) {
|
|
it = objects.erase(it);
|
|
}
|
|
|
|
current = 1;
|
|
for (auto&& v : objects.front()->all_elements()) {
|
|
BOOST_REQUIRE_EQUAL(v.value, current);
|
|
current += 2;
|
|
}
|
|
BOOST_REQUIRE_EQUAL(current, objects.size() * 2 + 1);
|
|
|
|
std::vector<std::unique_ptr<object>> moved_objects;
|
|
for (auto& obj : objects) {
|
|
moved_objects.emplace_back(std::make_unique<object>(std::move(*obj)));
|
|
}
|
|
objects.clear();
|
|
|
|
current = 1;
|
|
for (auto&& v : moved_objects.front()->all_elements()) {
|
|
BOOST_REQUIRE_EQUAL(v.value, current);
|
|
current += 2;
|
|
}
|
|
BOOST_REQUIRE_EQUAL(current, moved_objects.size() * 2 + 1);
|
|
}
|