73 lines
2.4 KiB
C
73 lines
2.4 KiB
C
#ifndef BLUELIB_TREE_H_
|
|
#define BLUELIB_TREE_H_
|
|
|
|
#include <blue/core/misc.h>
|
|
#include <blue/core/queue.h>
|
|
#include <blue/object/string.h>
|
|
|
|
#define B_TREE(p) ((b_tree *)(p))
|
|
#define B_TREE_NODE_INIT ((b_tree_node) {})
|
|
|
|
#define B_TREE_CONTAINER(t, m, v) \
|
|
((void *)((v) ? (uintptr_t)(v) - (offsetof(t, m)) : 0))
|
|
|
|
typedef struct b_tree b_tree;
|
|
|
|
#define b_tree_node_foreach(it, node) \
|
|
for (int z__b_unique_name() = b_tree_iterator_begin_at_node(node, it); \
|
|
(it)->node != NULL; b_tree_iterator_next(it))
|
|
|
|
#define b_tree_node_foreach_recursive(it, node) \
|
|
for (int z__b_unique_name() \
|
|
= b_tree_iterator_begin_at_node_recursive(node, it); \
|
|
(it)->node != NULL; b_tree_iterator_next(it))
|
|
|
|
#define b_tree_foreach(it, tree) \
|
|
for (int z__b_unique_name() = b_tree_iterator_begin(tree, it); \
|
|
(it)->node != NULL; b_tree_iterator_next(it))
|
|
|
|
typedef struct b_tree_node {
|
|
struct b_tree_node *__p01, *__p02, *__p03;
|
|
struct b_queue_entry __q01;
|
|
// struct b_tree_node *parent;
|
|
// struct b_tree_node *first_child, *next_sibling;
|
|
} b_tree_node;
|
|
|
|
typedef struct b_tree_iterator {
|
|
b_iterator _base;
|
|
size_t i, depth;
|
|
b_tree_node *node;
|
|
|
|
unsigned char _f01;
|
|
} b_tree_iterator;
|
|
|
|
extern b_tree *b_tree_create(void);
|
|
|
|
static inline b_tree *b_tree_retain(b_tree *tree)
|
|
{
|
|
return B_TREE(b_retain(B_OBJECT(tree)));
|
|
}
|
|
static inline void b_tree_release(b_tree *tree)
|
|
{
|
|
b_release(B_OBJECT(tree));
|
|
}
|
|
|
|
extern void b_tree_set_root(b_tree *tree, struct b_tree_node *node);
|
|
|
|
extern void b_tree_node_add_child(b_tree_node *parent, b_tree_node *child);
|
|
extern void b_tree_node_add_sibling(b_tree_node *node, b_tree_node *to_add);
|
|
|
|
extern b_tree_node *b_tree_node_get_child(b_tree_node *node, size_t at);
|
|
extern b_tree_node *b_tree_node_get_parent(b_tree_node *node);
|
|
|
|
extern int b_tree_iterator_begin(b_tree *tree, b_tree_iterator *it);
|
|
extern int b_tree_iterator_begin_at_node(b_tree_node *node, b_tree_iterator *it);
|
|
extern int b_tree_iterator_begin_at_node_recursive(
|
|
b_tree_node *node, b_tree_iterator *it);
|
|
|
|
extern bool b_tree_iterator_next(b_tree_iterator *it);
|
|
extern b_status b_tree_iterator_erase(b_tree_iterator *it);
|
|
extern bool b_tree_iterator_is_valid(const b_tree_iterator *it);
|
|
|
|
#endif
|