51df8b9173
Our interval template started life as `range`, and was supported wrapping to follow Cassandra's convention of wrapping around the maximum token. We later recognized that an interval type should usually be non-wrapping and split it into wrapping_range and nonwrapping_range, with `range` aliasing wrapping_range to preserve compatibility. Even later, we realized the name was already taken by C++ ranges and so renamed it to `interval`. Given that intervals are usually non-wrapping, the default `interval` type is non-wrapping. We can now simplify it further, recognizing that everyone assumes that an interval is non-wrapping and so doesn't need the nonwrapping_interval_designation. We just rename nonwrapping_interval to `interval` and remove the type alias.
45 lines
1.0 KiB
C++
45 lines
1.0 KiB
C++
/*
|
|
* Copyright (C) 2017-present ScyllaDB
|
|
*/
|
|
|
|
/*
|
|
* SPDX-License-Identifier: AGPL-3.0-or-later
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include "interval.hh"
|
|
#include <seastar/core/print.hh>
|
|
|
|
#include "seastarx.hh"
|
|
|
|
using int_range = interval<int>;
|
|
|
|
inline
|
|
unsigned cardinality(const int_range& r) {
|
|
assert(r.start());
|
|
assert(r.end());
|
|
return r.end()->value() - r.start()->value() + r.start()->is_inclusive() + r.end()->is_inclusive() - 1;
|
|
}
|
|
|
|
inline
|
|
unsigned cardinality(const std::optional<int_range>& ropt) {
|
|
return ropt ? cardinality(*ropt) : 0;
|
|
}
|
|
|
|
inline
|
|
std::optional<int_range> intersection(const int_range& a, const int_range& b) {
|
|
auto int_tri_cmp = [] (int x, int y) {
|
|
return x <=> y;
|
|
};
|
|
return a.intersection(b, int_tri_cmp);
|
|
}
|
|
|
|
inline
|
|
int_range make_int_range(int start_inclusive, int end_exclusive) {
|
|
if (end_exclusive <= start_inclusive) {
|
|
throw std::runtime_error(format("invalid range: [{:d}, {:d})", start_inclusive, end_exclusive));
|
|
}
|
|
return int_range({start_inclusive}, {end_exclusive - 1});
|
|
}
|