mirror of
https://github.com/scylladb/scylladb.git
synced 2026-04-24 10:30:38 +00:00
fcb8d040e8
Instead of lengthy blurbs, switch to single-line, machine-readable standardized (https://spdx.dev) license identifiers. The Linux kernel switched long ago, so there is strong precedent. Three cases are handled: AGPL-only, Apache-only, and dual licensed. For the latter case, I chose (AGPL-3.0-or-later and Apache-2.0), reasoning that our changes are extensive enough to apply our license. The changes we applied mechanically with a script, except to licenses/README.md. Closes #9937
64 lines
1.9 KiB
C++
64 lines
1.9 KiB
C++
/*
|
|
* Copyright (C) 2015-present ScyllaDB
|
|
*/
|
|
|
|
/*
|
|
* SPDX-License-Identifier: AGPL-3.0-or-later
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <vector>
|
|
#include <compare>
|
|
#include <boost/test/unit_test.hpp>
|
|
#include <seastar/util/variant_utils.hh>
|
|
#include <variant>
|
|
#include "test/lib/log.hh"
|
|
#include "utils/collection-concepts.hh"
|
|
#include "to_string.hh"
|
|
|
|
template<typename Comparator, typename... T>
|
|
class total_order_check {
|
|
using element = std::variant<T...>;
|
|
std::vector<std::vector<element>> _data;
|
|
Comparator _cmp;
|
|
private:
|
|
// All in left are expect to compare with all in right with expected_order result
|
|
void check_order(const std::vector<element>& left, const std::vector<element>& right, std::strong_ordering order) {
|
|
for (const element& left_e : left) {
|
|
for (const element& right_e : right) {
|
|
seastar::visit(left_e, [&] (auto&& a) {
|
|
seastar::visit(right_e, [&] (auto&& b) {
|
|
testlog.trace("cmp({}, {}) == {}", a, b, order);
|
|
auto r = _cmp(a, b);
|
|
auto actual = r;
|
|
if (actual != order) {
|
|
BOOST_FAIL(format("Expected cmp({}, {}) == {}, but got {}", a, b, order, actual));
|
|
}
|
|
});
|
|
});
|
|
}
|
|
}
|
|
}
|
|
public:
|
|
total_order_check(Comparator c = Comparator()) : _cmp(std::move(c)) {}
|
|
|
|
total_order_check& next(element e) {
|
|
_data.push_back(std::vector<element>());
|
|
return equal_to(e);
|
|
}
|
|
|
|
total_order_check& equal_to(element e) {
|
|
_data.back().push_back(e);
|
|
return *this;
|
|
}
|
|
|
|
void check() {
|
|
for (unsigned i = 0; i < _data.size(); ++i) {
|
|
for (unsigned j = 0; j < _data.size(); ++j) {
|
|
check_order(_data[i], _data[j], i <=> j);
|
|
}
|
|
}
|
|
}
|
|
};
|