pineapple-src/src/common/tree.h

745 lines
19 KiB
C
Raw Normal View History

2020-12-31 07:31:47 +00:00
/* $NetBSD: tree.h,v 1.8 2004/03/28 19:38:30 provos Exp $ */
/* $OpenBSD: tree.h,v 1.7 2002/10/17 21:51:54 art Exp $ */
/* $FreeBSD$ */
/*-
* Copyright 2002 Niels Provos <provos@citi.umich.edu>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
* OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
* IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
* NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
* THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
2021-01-13 19:34:26 +00:00
#pragma once
2020-12-31 07:31:47 +00:00
2022-03-12 10:35:05 +00:00
#include "common/assert.h"
2020-12-31 07:31:47 +00:00
/*
2021-01-13 19:34:26 +00:00
* This file defines data structures for red-black trees.
2020-12-31 07:31:47 +00:00
*
* A red-black tree is a binary search tree with the node color as an
* extra attribute. It fulfills a set of conditions:
* - every search path from the root to a leaf consists of the
* same number of black nodes,
* - each red node (except for the root) has a black parent,
* - each leaf node is black.
*
* Every operation on a red-black tree is bounded as O(lg n).
* The maximum height of a red-black tree is 2lg (n+1).
*/
2022-03-12 10:35:05 +00:00
namespace Common::freebsd {
2021-05-19 04:44:49 +00:00
2022-03-12 10:35:05 +00:00
enum class RBColor {
RB_BLACK = 0,
RB_RED = 1,
};
#pragma pack(push, 4)
2021-01-13 19:34:26 +00:00
template <typename T>
2022-03-12 10:35:05 +00:00
class RBEntry {
2021-01-13 19:34:26 +00:00
public:
2022-03-12 10:35:05 +00:00
constexpr RBEntry() = default;
2021-01-13 19:34:26 +00:00
2022-03-12 10:35:05 +00:00
[[nodiscard]] constexpr T* Left() {
return m_rbe_left;
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
[[nodiscard]] constexpr const T* Left() const {
return m_rbe_left;
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
constexpr void SetLeft(T* e) {
m_rbe_left = e;
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
[[nodiscard]] constexpr T* Right() {
return m_rbe_right;
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
[[nodiscard]] constexpr const T* Right() const {
return m_rbe_right;
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
constexpr void SetRight(T* e) {
m_rbe_right = e;
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
[[nodiscard]] constexpr T* Parent() {
return m_rbe_parent;
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
[[nodiscard]] constexpr const T* Parent() const {
return m_rbe_parent;
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
constexpr void SetParent(T* e) {
m_rbe_parent = e;
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
[[nodiscard]] constexpr bool IsBlack() const {
return m_rbe_color == RBColor::RB_BLACK;
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
[[nodiscard]] constexpr bool IsRed() const {
return m_rbe_color == RBColor::RB_RED;
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
[[nodiscard]] constexpr RBColor Color() const {
return m_rbe_color;
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
constexpr void SetColor(RBColor c) {
m_rbe_color = c;
2021-01-13 19:34:26 +00:00
}
2022-03-13 09:13:48 +00:00
private:
T* m_rbe_left{};
T* m_rbe_right{};
T* m_rbe_parent{};
RBColor m_rbe_color{RBColor::RB_BLACK};
2022-03-12 10:35:05 +00:00
};
#pragma pack(pop)
2021-01-13 19:34:26 +00:00
2022-03-12 10:35:05 +00:00
template <typename T>
struct CheckRBEntry {
static constexpr bool value = false;
};
template <typename T>
struct CheckRBEntry<RBEntry<T>> {
static constexpr bool value = true;
};
2021-01-13 19:34:26 +00:00
2022-03-12 10:35:05 +00:00
template <typename T>
concept IsRBEntry = CheckRBEntry<T>::value;
2021-01-13 19:34:26 +00:00
2022-03-12 10:35:05 +00:00
template <typename T>
concept HasRBEntry = requires(T& t, const T& ct) {
{ t.GetRBEntry() } -> std::same_as<RBEntry<T>&>;
{ ct.GetRBEntry() } -> std::same_as<const RBEntry<T>&>;
};
2021-01-13 19:34:26 +00:00
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
class RBHead {
2021-01-13 19:34:26 +00:00
private:
2022-03-12 10:35:05 +00:00
T* m_rbh_root = nullptr;
public:
[[nodiscard]] constexpr T* Root() {
return m_rbh_root;
}
[[nodiscard]] constexpr const T* Root() const {
return m_rbh_root;
}
constexpr void SetRoot(T* root) {
m_rbh_root = root;
}
[[nodiscard]] constexpr bool IsEmpty() const {
return this->Root() == nullptr;
}
2021-01-13 19:34:26 +00:00
};
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
[[nodiscard]] constexpr RBEntry<T>& RB_ENTRY(T* t) {
return t->GetRBEntry();
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
[[nodiscard]] constexpr const RBEntry<T>& RB_ENTRY(const T* t) {
return t->GetRBEntry();
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
[[nodiscard]] constexpr T* RB_LEFT(T* t) {
return RB_ENTRY(t).Left();
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
[[nodiscard]] constexpr const T* RB_LEFT(const T* t) {
return RB_ENTRY(t).Left();
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
[[nodiscard]] constexpr T* RB_RIGHT(T* t) {
return RB_ENTRY(t).Right();
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
[[nodiscard]] constexpr const T* RB_RIGHT(const T* t) {
return RB_ENTRY(t).Right();
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
[[nodiscard]] constexpr T* RB_PARENT(T* t) {
return RB_ENTRY(t).Parent();
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
[[nodiscard]] constexpr const T* RB_PARENT(const T* t) {
return RB_ENTRY(t).Parent();
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
constexpr void RB_SET_LEFT(T* t, T* e) {
RB_ENTRY(t).SetLeft(e);
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
constexpr void RB_SET_RIGHT(T* t, T* e) {
RB_ENTRY(t).SetRight(e);
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
constexpr void RB_SET_PARENT(T* t, T* e) {
RB_ENTRY(t).SetParent(e);
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
[[nodiscard]] constexpr bool RB_IS_BLACK(const T* t) {
return RB_ENTRY(t).IsBlack();
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
[[nodiscard]] constexpr bool RB_IS_RED(const T* t) {
return RB_ENTRY(t).IsRed();
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
[[nodiscard]] constexpr RBColor RB_COLOR(const T* t) {
return RB_ENTRY(t).Color();
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
constexpr void RB_SET_COLOR(T* t, RBColor c) {
RB_ENTRY(t).SetColor(c);
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
constexpr void RB_SET(T* elm, T* parent) {
auto& rb_entry = RB_ENTRY(elm);
rb_entry.SetParent(parent);
rb_entry.SetLeft(nullptr);
rb_entry.SetRight(nullptr);
rb_entry.SetColor(RBColor::RB_RED);
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
constexpr void RB_SET_BLACKRED(T* black, T* red) {
RB_SET_COLOR(black, RBColor::RB_BLACK);
RB_SET_COLOR(red, RBColor::RB_RED);
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
constexpr void RB_ROTATE_LEFT(RBHead<T>& head, T* elm, T*& tmp) {
2021-01-13 19:34:26 +00:00
tmp = RB_RIGHT(elm);
2022-03-12 10:35:05 +00:00
if (RB_SET_RIGHT(elm, RB_LEFT(tmp)); RB_RIGHT(elm) != nullptr) {
2021-01-13 19:34:26 +00:00
RB_SET_PARENT(RB_LEFT(tmp), elm);
}
2022-03-12 10:35:05 +00:00
if (RB_SET_PARENT(tmp, RB_PARENT(elm)); RB_PARENT(tmp) != nullptr) {
2021-01-13 19:34:26 +00:00
if (elm == RB_LEFT(RB_PARENT(elm))) {
RB_SET_LEFT(RB_PARENT(elm), tmp);
} else {
RB_SET_RIGHT(RB_PARENT(elm), tmp);
}
} else {
2022-03-12 10:35:05 +00:00
head.SetRoot(tmp);
2021-01-13 19:34:26 +00:00
}
RB_SET_LEFT(tmp, elm);
RB_SET_PARENT(elm, tmp);
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
constexpr void RB_ROTATE_RIGHT(RBHead<T>& head, T* elm, T*& tmp) {
2021-01-13 19:34:26 +00:00
tmp = RB_LEFT(elm);
2022-03-12 10:35:05 +00:00
if (RB_SET_LEFT(elm, RB_RIGHT(tmp)); RB_LEFT(elm) != nullptr) {
2021-01-13 19:34:26 +00:00
RB_SET_PARENT(RB_RIGHT(tmp), elm);
}
2022-03-12 10:35:05 +00:00
if (RB_SET_PARENT(tmp, RB_PARENT(elm)); RB_PARENT(tmp) != nullptr) {
2021-01-13 19:34:26 +00:00
if (elm == RB_LEFT(RB_PARENT(elm))) {
RB_SET_LEFT(RB_PARENT(elm), tmp);
} else {
RB_SET_RIGHT(RB_PARENT(elm), tmp);
}
} else {
2022-03-12 10:35:05 +00:00
head.SetRoot(tmp);
2021-01-13 19:34:26 +00:00
}
RB_SET_RIGHT(tmp, elm);
RB_SET_PARENT(elm, tmp);
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
constexpr void RB_REMOVE_COLOR(RBHead<T>& head, T* parent, T* elm) {
T* tmp;
while ((elm == nullptr || RB_IS_BLACK(elm)) && elm != head.Root()) {
2021-01-13 19:34:26 +00:00
if (RB_LEFT(parent) == elm) {
tmp = RB_RIGHT(parent);
if (RB_IS_RED(tmp)) {
RB_SET_BLACKRED(tmp, parent);
RB_ROTATE_LEFT(head, parent, tmp);
tmp = RB_RIGHT(parent);
}
if ((RB_LEFT(tmp) == nullptr || RB_IS_BLACK(RB_LEFT(tmp))) &&
(RB_RIGHT(tmp) == nullptr || RB_IS_BLACK(RB_RIGHT(tmp)))) {
2022-03-12 10:35:05 +00:00
RB_SET_COLOR(tmp, RBColor::RB_RED);
2021-01-13 19:34:26 +00:00
elm = parent;
parent = RB_PARENT(elm);
} else {
if (RB_RIGHT(tmp) == nullptr || RB_IS_BLACK(RB_RIGHT(tmp))) {
2022-03-12 10:35:05 +00:00
T* oleft;
2021-01-13 19:34:26 +00:00
if ((oleft = RB_LEFT(tmp)) != nullptr) {
2022-03-12 10:35:05 +00:00
RB_SET_COLOR(oleft, RBColor::RB_BLACK);
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
RB_SET_COLOR(tmp, RBColor::RB_RED);
2021-01-13 19:34:26 +00:00
RB_ROTATE_RIGHT(head, tmp, oleft);
tmp = RB_RIGHT(parent);
}
RB_SET_COLOR(tmp, RB_COLOR(parent));
2022-03-12 10:35:05 +00:00
RB_SET_COLOR(parent, RBColor::RB_BLACK);
2021-01-13 19:34:26 +00:00
if (RB_RIGHT(tmp)) {
2022-03-12 10:35:05 +00:00
RB_SET_COLOR(RB_RIGHT(tmp), RBColor::RB_BLACK);
2021-01-13 19:34:26 +00:00
}
RB_ROTATE_LEFT(head, parent, tmp);
2022-03-12 10:35:05 +00:00
elm = head.Root();
2021-01-13 19:34:26 +00:00
break;
}
} else {
tmp = RB_LEFT(parent);
if (RB_IS_RED(tmp)) {
RB_SET_BLACKRED(tmp, parent);
RB_ROTATE_RIGHT(head, parent, tmp);
tmp = RB_LEFT(parent);
}
if ((RB_LEFT(tmp) == nullptr || RB_IS_BLACK(RB_LEFT(tmp))) &&
(RB_RIGHT(tmp) == nullptr || RB_IS_BLACK(RB_RIGHT(tmp)))) {
2022-03-12 10:35:05 +00:00
RB_SET_COLOR(tmp, RBColor::RB_RED);
2021-01-13 19:34:26 +00:00
elm = parent;
parent = RB_PARENT(elm);
} else {
if (RB_LEFT(tmp) == nullptr || RB_IS_BLACK(RB_LEFT(tmp))) {
2022-03-12 10:35:05 +00:00
T* oright;
2021-01-13 19:34:26 +00:00
if ((oright = RB_RIGHT(tmp)) != nullptr) {
2022-03-12 10:35:05 +00:00
RB_SET_COLOR(oright, RBColor::RB_BLACK);
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
RB_SET_COLOR(tmp, RBColor::RB_RED);
2021-01-13 19:34:26 +00:00
RB_ROTATE_LEFT(head, tmp, oright);
tmp = RB_LEFT(parent);
}
RB_SET_COLOR(tmp, RB_COLOR(parent));
2022-03-12 10:35:05 +00:00
RB_SET_COLOR(parent, RBColor::RB_BLACK);
2021-01-13 19:34:26 +00:00
if (RB_LEFT(tmp)) {
2022-03-12 10:35:05 +00:00
RB_SET_COLOR(RB_LEFT(tmp), RBColor::RB_BLACK);
2021-01-13 19:34:26 +00:00
}
RB_ROTATE_RIGHT(head, parent, tmp);
2022-03-12 10:35:05 +00:00
elm = head.Root();
2021-01-13 19:34:26 +00:00
break;
}
}
}
if (elm) {
2022-03-12 10:35:05 +00:00
RB_SET_COLOR(elm, RBColor::RB_BLACK);
2021-01-13 19:34:26 +00:00
}
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
constexpr T* RB_REMOVE(RBHead<T>& head, T* elm) {
T* child = nullptr;
T* parent = nullptr;
T* old = elm;
RBColor color = RBColor::RB_BLACK;
2021-01-13 19:34:26 +00:00
if (RB_LEFT(elm) == nullptr) {
child = RB_RIGHT(elm);
} else if (RB_RIGHT(elm) == nullptr) {
child = RB_LEFT(elm);
} else {
2022-03-12 10:35:05 +00:00
T* left;
2021-01-13 19:34:26 +00:00
elm = RB_RIGHT(elm);
while ((left = RB_LEFT(elm)) != nullptr) {
elm = left;
}
child = RB_RIGHT(elm);
parent = RB_PARENT(elm);
color = RB_COLOR(elm);
if (child) {
RB_SET_PARENT(child, parent);
}
2022-03-12 10:35:05 +00:00
2021-01-13 19:34:26 +00:00
if (parent) {
if (RB_LEFT(parent) == elm) {
RB_SET_LEFT(parent, child);
} else {
RB_SET_RIGHT(parent, child);
}
} else {
2022-03-12 10:35:05 +00:00
head.SetRoot(child);
2021-01-13 19:34:26 +00:00
}
if (RB_PARENT(elm) == old) {
parent = elm;
}
2022-03-12 10:35:05 +00:00
elm->SetRBEntry(old->GetRBEntry());
2021-01-13 19:34:26 +00:00
if (RB_PARENT(old)) {
if (RB_LEFT(RB_PARENT(old)) == old) {
RB_SET_LEFT(RB_PARENT(old), elm);
} else {
RB_SET_RIGHT(RB_PARENT(old), elm);
}
} else {
2022-03-12 10:35:05 +00:00
head.SetRoot(elm);
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
2021-01-13 19:34:26 +00:00
RB_SET_PARENT(RB_LEFT(old), elm);
2022-03-12 10:35:05 +00:00
2021-01-13 19:34:26 +00:00
if (RB_RIGHT(old)) {
RB_SET_PARENT(RB_RIGHT(old), elm);
}
2022-03-12 10:35:05 +00:00
2021-01-13 19:34:26 +00:00
if (parent) {
left = parent;
}
2022-03-12 10:35:05 +00:00
if (color == RBColor::RB_BLACK) {
RB_REMOVE_COLOR(head, parent, child);
}
return old;
2021-01-13 19:34:26 +00:00
}
parent = RB_PARENT(elm);
color = RB_COLOR(elm);
if (child) {
RB_SET_PARENT(child, parent);
}
if (parent) {
if (RB_LEFT(parent) == elm) {
RB_SET_LEFT(parent, child);
} else {
RB_SET_RIGHT(parent, child);
}
} else {
2022-03-12 10:35:05 +00:00
head.SetRoot(child);
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
if (color == RBColor::RB_BLACK) {
RB_REMOVE_COLOR(head, parent, child);
}
return old;
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
constexpr void RB_INSERT_COLOR(RBHead<T>& head, T* elm) {
T *parent = nullptr, *tmp = nullptr;
while ((parent = RB_PARENT(elm)) != nullptr && RB_IS_RED(parent)) {
T* gparent = RB_PARENT(parent);
if (parent == RB_LEFT(gparent)) {
tmp = RB_RIGHT(gparent);
if (tmp && RB_IS_RED(tmp)) {
RB_SET_COLOR(tmp, RBColor::RB_BLACK);
RB_SET_BLACKRED(parent, gparent);
elm = gparent;
continue;
}
if (RB_RIGHT(parent) == elm) {
RB_ROTATE_LEFT(head, parent, tmp);
tmp = parent;
parent = elm;
elm = tmp;
}
RB_SET_BLACKRED(parent, gparent);
RB_ROTATE_RIGHT(head, gparent, tmp);
} else {
tmp = RB_LEFT(gparent);
if (tmp && RB_IS_RED(tmp)) {
RB_SET_COLOR(tmp, RBColor::RB_BLACK);
RB_SET_BLACKRED(parent, gparent);
elm = gparent;
continue;
}
if (RB_LEFT(parent) == elm) {
RB_ROTATE_RIGHT(head, parent, tmp);
tmp = parent;
parent = elm;
elm = tmp;
}
RB_SET_BLACKRED(parent, gparent);
RB_ROTATE_LEFT(head, gparent, tmp);
}
}
RB_SET_COLOR(head.Root(), RBColor::RB_BLACK);
}
template <typename T, typename Compare>
requires HasRBEntry<T>
constexpr T* RB_INSERT(RBHead<T>& head, T* elm, Compare cmp) {
T* parent = nullptr;
T* tmp = head.Root();
2021-01-13 19:34:26 +00:00
int comp = 0;
while (tmp) {
parent = tmp;
comp = cmp(elm, parent);
if (comp < 0) {
tmp = RB_LEFT(tmp);
} else if (comp > 0) {
tmp = RB_RIGHT(tmp);
} else {
return tmp;
}
}
RB_SET(elm, parent);
if (parent != nullptr) {
if (comp < 0) {
RB_SET_LEFT(parent, elm);
} else {
RB_SET_RIGHT(parent, elm);
}
} else {
2022-03-12 10:35:05 +00:00
head.SetRoot(elm);
2021-01-13 19:34:26 +00:00
}
RB_INSERT_COLOR(head, elm);
return nullptr;
}
2022-03-12 10:35:05 +00:00
template <typename T, typename Compare>
requires HasRBEntry<T>
constexpr T* RB_FIND(RBHead<T>& head, T* elm, Compare cmp) {
T* tmp = head.Root();
2021-01-13 19:34:26 +00:00
while (tmp) {
const int comp = cmp(elm, tmp);
if (comp < 0) {
tmp = RB_LEFT(tmp);
} else if (comp > 0) {
tmp = RB_RIGHT(tmp);
} else {
return tmp;
}
}
return nullptr;
}
2022-03-12 10:35:05 +00:00
template <typename T, typename Compare>
requires HasRBEntry<T>
constexpr T* RB_NFIND(RBHead<T>& head, T* elm, Compare cmp) {
T* tmp = head.Root();
T* res = nullptr;
2021-01-13 19:34:26 +00:00
while (tmp) {
const int comp = cmp(elm, tmp);
if (comp < 0) {
res = tmp;
tmp = RB_LEFT(tmp);
} else if (comp > 0) {
tmp = RB_RIGHT(tmp);
} else {
return tmp;
}
}
return res;
}
2022-03-12 10:35:05 +00:00
template <typename T, typename U, typename Compare>
requires HasRBEntry<T>
constexpr T* RB_FIND_KEY(RBHead<T>& head, const U& key, Compare cmp) {
T* tmp = head.Root();
2021-01-13 19:34:26 +00:00
while (tmp) {
2022-03-12 10:35:05 +00:00
const int comp = cmp(key, tmp);
2021-01-13 19:34:26 +00:00
if (comp < 0) {
tmp = RB_LEFT(tmp);
} else if (comp > 0) {
tmp = RB_RIGHT(tmp);
} else {
return tmp;
}
}
return nullptr;
}
2022-03-12 10:35:05 +00:00
template <typename T, typename U, typename Compare>
requires HasRBEntry<T>
constexpr T* RB_NFIND_KEY(RBHead<T>& head, const U& key, Compare cmp) {
T* tmp = head.Root();
T* res = nullptr;
2021-01-13 19:34:26 +00:00
while (tmp) {
2022-03-12 10:35:05 +00:00
const int comp = cmp(key, tmp);
2021-01-13 19:34:26 +00:00
if (comp < 0) {
res = tmp;
tmp = RB_LEFT(tmp);
} else if (comp > 0) {
tmp = RB_RIGHT(tmp);
} else {
return tmp;
}
}
return res;
}
2022-03-12 10:35:05 +00:00
template <typename T, typename Compare>
requires HasRBEntry<T>
constexpr T* RB_FIND_EXISTING(RBHead<T>& head, T* elm, Compare cmp) {
T* tmp = head.Root();
while (true) {
const int comp = cmp(elm, tmp);
if (comp < 0) {
tmp = RB_LEFT(tmp);
} else if (comp > 0) {
tmp = RB_RIGHT(tmp);
} else {
return tmp;
}
}
}
template <typename T, typename U, typename Compare>
requires HasRBEntry<T>
constexpr T* RB_FIND_EXISTING_KEY(RBHead<T>& head, const U& key, Compare cmp) {
T* tmp = head.Root();
while (true) {
const int comp = cmp(key, tmp);
if (comp < 0) {
tmp = RB_LEFT(tmp);
} else if (comp > 0) {
tmp = RB_RIGHT(tmp);
} else {
return tmp;
}
}
}
template <typename T>
requires HasRBEntry<T>
constexpr T* RB_NEXT(T* elm) {
2021-01-13 19:34:26 +00:00
if (RB_RIGHT(elm)) {
elm = RB_RIGHT(elm);
while (RB_LEFT(elm)) {
elm = RB_LEFT(elm);
}
} else {
if (RB_PARENT(elm) && (elm == RB_LEFT(RB_PARENT(elm)))) {
elm = RB_PARENT(elm);
} else {
while (RB_PARENT(elm) && (elm == RB_RIGHT(RB_PARENT(elm)))) {
elm = RB_PARENT(elm);
}
elm = RB_PARENT(elm);
}
}
return elm;
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
constexpr T* RB_PREV(T* elm) {
2021-01-13 19:34:26 +00:00
if (RB_LEFT(elm)) {
elm = RB_LEFT(elm);
while (RB_RIGHT(elm)) {
elm = RB_RIGHT(elm);
}
} else {
if (RB_PARENT(elm) && (elm == RB_RIGHT(RB_PARENT(elm)))) {
elm = RB_PARENT(elm);
} else {
while (RB_PARENT(elm) && (elm == RB_LEFT(RB_PARENT(elm)))) {
elm = RB_PARENT(elm);
}
elm = RB_PARENT(elm);
}
}
return elm;
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
constexpr T* RB_MIN(RBHead<T>& head) {
T* tmp = head.Root();
T* parent = nullptr;
2021-01-13 19:34:26 +00:00
while (tmp) {
parent = tmp;
2022-03-12 10:35:05 +00:00
tmp = RB_LEFT(tmp);
2021-01-13 19:34:26 +00:00
}
return parent;
}
2022-03-12 10:35:05 +00:00
template <typename T>
requires HasRBEntry<T>
constexpr T* RB_MAX(RBHead<T>& head) {
T* tmp = head.Root();
T* parent = nullptr;
2021-01-13 19:34:26 +00:00
2022-03-12 10:35:05 +00:00
while (tmp) {
parent = tmp;
tmp = RB_RIGHT(tmp);
}
return parent;
2021-01-13 19:34:26 +00:00
}
2022-03-12 10:35:05 +00:00
} // namespace Common::freebsd