mirror of
https://github.com/scylladb/scylladb.git
synced 2026-05-12 19:02:12 +00:00
eb70644c1c
A plain array of elements that grows and shrinks by constructing the new instance from an existing one and moving the elements from it. Behaves similarly to vector's external array, but has 0-bytes overhead. The array bounds (0-th and N-th elemements) are determined by checking the flags on the elements themselves. For this the type must support getters and setters for the flags. To remove an element from array there's also a nothrow option that drops the requested element from array, shifts the righter ones left and keeps the trailing unused memory (so called "train") until reconstruction or destruction. Also comes with lower_bound() helper that helps keeping the elements sotred and the from_element() one that returns back reference to the array in which the element sits. Signed-off-by: Pavel Emelyanov <xemul@scylladb.com>
54 lines
1.7 KiB
C++
54 lines
1.7 KiB
C++
/*
|
|
* Copyright (C) 2020 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 <type_traits>
|
|
#include <seastar/util/concepts.hh>
|
|
|
|
SEASTAR_CONCEPT(
|
|
template <typename Func, typename T>
|
|
concept Disposer = requires (Func f, T* val) {
|
|
{ f(val) } noexcept -> std::same_as<void>;
|
|
};
|
|
)
|
|
|
|
SEASTAR_CONCEPT(
|
|
template <typename Key1, typename Key2, typename Less>
|
|
concept LessComparable = requires (const Key1& a, const Key2& b, Less less) {
|
|
{ less(a, b) } -> std::same_as<bool>;
|
|
{ less(b, a) } -> std::same_as<bool>;
|
|
};
|
|
|
|
template <typename Key1, typename Key2, typename Less>
|
|
concept LessNothrowComparable = LessComparable<Key1, Key2, Less> && std::is_nothrow_invocable_v<Less, Key1, Key2>;
|
|
)
|
|
|
|
SEASTAR_CONCEPT(
|
|
template <typename T1, typename T2, typename Compare>
|
|
concept Comparable = requires (const T1& a, const T2& b, Compare cmp) {
|
|
// The Comparable is trichotomic comparator that should return
|
|
// negative value when a < b
|
|
// zero when a == b
|
|
// positive value when a > b
|
|
{ cmp(a, b) } -> std::same_as<int>;
|
|
};
|
|
)
|