tree.h

 
#pragma once
 
#include <kernel/types.h>
 
#include <libalgo/linked_list.h>
#include <utils/compiler.h>
 
#define INIT_TREE_NODE(_node)                       \
    _node = ((struct tree_node){                    \
        .children = LLIST_INIT((_node).children), \
    })
 
typedef struct tree_node {
    node_t this; 
    struct tree_node *parent; 
    llist_t children;         
} tree_node_t;
 
typedef tree_node_t *tree_t;
 
#define FOREACH_CHILDREN(_iter, _node) FOREACH_LLIST (_iter, &(_node)->children)
 
static ALWAYS_INLINE tree_node_t *tree_node(node_t *node)
{
    return (tree_node_t *)node;
}
 
void tree_add_child(tree_node_t *node, tree_node_t *child);
 
void tree_add_child_sorted(tree_node_t *node, tree_node_t *child, compare_t);
 
tree_node_t *tree_remove(tree_node_t *node);
 
tree_node_t *tree_find_child(tree_node_t *node, compare_t, const void *data);
 
void tree_free(tree_t root, void (*free_function)(tree_node_t *));