58 lines
1.7 KiB
C
58 lines
1.7 KiB
C
#ifndef BLUE_DS_TREE_H_
|
|
#define BLUE_DS_TREE_H_
|
|
|
|
#include <blue/core/macros.h>
|
|
#include <blue/core/misc.h>
|
|
#include <blue/core/queue.h>
|
|
#include <blue/ds/string.h>
|
|
|
|
B_DECLS_BEGIN;
|
|
|
|
#define B_TYPE_TREE (b_tree_get_type())
|
|
#define B_TYPE_TREE_ITERATOR (b_tree_iterator_get_type())
|
|
|
|
B_DECLARE_TYPE(b_tree);
|
|
B_DECLARE_TYPE(b_tree_iterator);
|
|
|
|
B_TYPE_CLASS_DECLARATION_BEGIN(b_tree)
|
|
B_TYPE_CLASS_DECLARATION_END(b_tree)
|
|
|
|
B_TYPE_CLASS_DECLARATION_BEGIN(b_tree_iterator)
|
|
B_TYPE_CLASS_DECLARATION_END(b_tree_iterator)
|
|
|
|
#define B_TREE_NODE_INIT ((b_tree_node) {0})
|
|
|
|
#define B_TREE_CONTAINER(t, m, v) \
|
|
((void *)((v) ? (uintptr_t)(v) - (offsetof(t, m)) : 0))
|
|
|
|
typedef struct b_tree_node {
|
|
struct b_tree_node *__p01, *__p02, *__p03;
|
|
struct b_queue_entry __q01;
|
|
} b_tree_node;
|
|
|
|
BLUE_API b_type b_tree_get_type(void);
|
|
BLUE_API b_type b_tree_iterator_get_type(void);
|
|
|
|
B_TYPE_DEFAULT_CONSTRUCTOR(b_tree, B_TYPE_TREE);
|
|
|
|
BLUE_API void b_tree_set_root(b_tree *tree, struct b_tree_node *node);
|
|
|
|
BLUE_API void b_tree_node_add_child(b_tree_node *parent, b_tree_node *child);
|
|
BLUE_API void b_tree_node_add_sibling(b_tree_node *node, b_tree_node *to_add);
|
|
|
|
BLUE_API b_tree_node *b_tree_node_get_child(b_tree_node *node, size_t at);
|
|
BLUE_API b_tree_node *b_tree_node_get_parent(b_tree_node *node);
|
|
|
|
BLUE_API b_iterator *b_tree_begin(b_tree *tree);
|
|
BLUE_API const b_iterator *b_tree_cbegin(const b_tree *tree);
|
|
|
|
BLUE_API b_iterator *b_tree_node_begin(b_tree_node *node);
|
|
BLUE_API const b_iterator *b_tree_node_cbegin(const b_tree_node *node);
|
|
|
|
BLUE_API b_iterator *b_tree_node_begin_recursive(b_tree_node *node);
|
|
BLUE_API const b_iterator *b_tree_node_cbegin_recursive(const b_tree_node *node);
|
|
|
|
B_DECLS_END;
|
|
|
|
#endif
|