rbtree.h

Go to the documentation of this file.

/*
BSD 3-Clause License
 
Copyright (c) 2025, Szymon Turno
 
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.
 
3. Neither the name of the copyright holder nor the names of its
   contributors may be used to endorse or promote products derived from
   this software without specific prior written permission.
 
THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "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 COPYRIGHT HOLDER OR CONTRIBUTORS 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.
*/
 
#ifndef ST_RBTREE_H
#define ST_RBTREE_H
 
#include "st/logger/except.h"
#include "vx/graph.h"
#include <stdint.h>
 
enum StBstOrder {
        ST_BST_INORDER = 0, 
        ST_BST_PREORDER,    
        ST_BST_POSTORDER,   
};
 
enum StBstChild {
        ST_BST_LEFT = 0,   
        ST_BST_RIGHT,      
        ST_BST_N_CHILDREN, 
};
 
/* clang-format off */
VX_GRAPH(struct StRbNode, ST_BST_N_CHILDREN, union {intptr_t parcol; int32_t align;});
/* clang-format on */
 
static inline struct StRbNode* st_rb_left(struct StRbNode* node)
{
        ST_ENSURE_MEM(node, ST_ERROR);
        return vx_graph_4vx(vx_graph_2vx(node)->nbor[ST_BST_LEFT], node);
}
 
static inline struct StRbNode* st_rb_right(struct StRbNode* node)
{
        ST_ENSURE_MEM(node, ST_ERROR);
        return vx_graph_4vx(vx_graph_2vx(node)->nbor[ST_BST_RIGHT], node);
}
 
struct StRbNode* st_rb_link(struct StRbNode* node, struct StRbNode* parent);
 
struct StRbNode* st_rb_insrebal(struct StRbNode* root, struct StRbNode* node);
 
struct StRbNode* st_rb_parent(struct StRbNode* node);
 
struct StRbNode* st_rb_first(struct StRbNode* node, enum StBstOrder order);
 
struct StRbNode* st_rb_next(struct StRbNode* node, enum StBstOrder order);
 
#endif /* ST_RBTREE_H */