mirror of
https://github.com/scylladb/scylladb.git
synced 2026-05-30 19:46:48 +00:00
a5f17b9a2d
Adjust the total_order_check template to work with comparators returning either int (as a temporary compatibility measure) or std::strong_ordering (for #1449 safety).
82 lines
2.6 KiB
C++
82 lines
2.6 KiB
C++
/*
|
|
* Copyright (C) 2015 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/>.
|
|
*/
|
|
|
|
#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"
|
|
|
|
template<typename Comparator, typename... T>
|
|
class total_order_check {
|
|
using element = std::variant<T...>;
|
|
std::vector<std::vector<element>> _data;
|
|
Comparator _cmp;
|
|
private:
|
|
static int sgn(std::strong_ordering x) {
|
|
return (x > 0) - (x < 0);
|
|
}
|
|
static int sgn(int x) {
|
|
return sgn(x <=> 0);
|
|
}
|
|
// 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, int_or_strong_ordering auto 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({}, {}) == {:d}", a, b, order);
|
|
auto r = _cmp(a, b);
|
|
auto actual = this->sgn(r);
|
|
if (actual != order) {
|
|
BOOST_FAIL(format("Expected cmp({}, {}) == {:d}, but got {:d}", 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], sgn(int(i) - int(j)));
|
|
}
|
|
}
|
|
}
|
|
};
|