mirror of
https://github.com/scylladb/scylladb.git
synced 2026-04-24 18:40: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
61 lines
1.5 KiB
C++
61 lines
1.5 KiB
C++
/*
|
|
* Copyright (C) 2018-present ScyllaDB
|
|
*/
|
|
|
|
/*
|
|
* SPDX-License-Identifier: AGPL-3.0-or-later
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <cstddef>
|
|
#include <limits>
|
|
|
|
namespace db::view {
|
|
|
|
/**
|
|
* The view update backlog represents the pending view data that a base replica
|
|
* maintains. It is the maximum of the memory backlog - how much memory pending
|
|
* view updates are consuming out of the their allocated quota - and the disk
|
|
* backlog - how much view hints are consuming. The size of a backlog is relative
|
|
* to its maximum size.
|
|
*/
|
|
struct update_backlog {
|
|
size_t current;
|
|
size_t max;
|
|
|
|
float relative_size() const {
|
|
return float(current) / float(max);
|
|
}
|
|
|
|
friend bool operator==(const update_backlog& lhs, const update_backlog& rhs) {
|
|
return lhs.relative_size() == rhs.relative_size();
|
|
}
|
|
|
|
friend bool operator<(const update_backlog& lhs, const update_backlog& rhs) {
|
|
return lhs.relative_size() < rhs.relative_size();
|
|
}
|
|
|
|
friend bool operator!=(const update_backlog& lhs, const update_backlog& rhs) {
|
|
return !(lhs == rhs);
|
|
}
|
|
|
|
friend bool operator<=(const update_backlog& lhs, const update_backlog& rhs) {
|
|
return !(rhs < lhs);
|
|
}
|
|
|
|
friend bool operator>(const update_backlog& lhs, const update_backlog& rhs) {
|
|
return rhs < lhs;
|
|
}
|
|
|
|
friend bool operator>=(const update_backlog& lhs, const update_backlog& rhs) {
|
|
return !(lhs < rhs);
|
|
}
|
|
|
|
static update_backlog no_backlog() {
|
|
return update_backlog{0, std::numeric_limits<size_t>::max()};
|
|
}
|
|
};
|
|
|
|
}
|