Files
scylladb/repair/sync_boundary.hh
Avi Kivity 0ae22a09d4 LICENSE: Update to version 1.1
Updated terms of non-commercial use (must be a never-customer).
2026-04-12 19:46:33 +03:00

40 lines
1.3 KiB
C++

/*
* Copyright (C) 2018-present ScyllaDB
*/
/*
* SPDX-License-Identifier: LicenseRef-ScyllaDB-Source-Available-1.1
*/
#pragma once
#include "dht/decorated_key.hh"
#include "mutation/position_in_partition.hh"
// Represent a position of a mutation_fragment read from a flat mutation
// reader. Repair nodes negotiate a small range identified by two
// repair_sync_boundary to work on in each round.
struct repair_sync_boundary {
dht::decorated_key pk;
position_in_partition position;
class tri_compare {
dht::ring_position_comparator _pk_cmp;
position_in_partition::tri_compare _position_cmp;
public:
tri_compare(const schema& s) : _pk_cmp(s), _position_cmp(s) { }
std::strong_ordering operator()(const repair_sync_boundary& a, const repair_sync_boundary& b) const {
auto ret = _pk_cmp(a.pk, b.pk);
if (ret == 0) {
ret = _position_cmp(a.position, b.position);
}
return ret;
}
};
};
template <> struct fmt::formatter<repair_sync_boundary> {
constexpr auto parse(format_parse_context& ctx) { return ctx.begin(); }
auto format(const repair_sync_boundary& boundary, fmt::format_context& ctx) const {
return fmt::format_to(ctx.out(), "{{ {}, {} }}", boundary.pk, boundary.position);
}
};