-
Notifications
You must be signed in to change notification settings - Fork 0
/
Tree.c
62 lines (48 loc) · 1.05 KB
/
Tree.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
#import "Tree.h"
#define self Tree
rsdef(self, New, ref(DestroyNode) destroyNode) {
return (self) {
.destroyNode = destroyNode,
.root.len = 0,
.root.buf = NULL,
.root.parent = NULL
};
}
def(void, Destroy) {
call(FreeNodes, &this->root);
}
def(void, Reset) {
call(FreeNodes, &this->root);
this->root.len = 0;
this->root.buf = NULL;
this->root.parent = NULL;
}
def(void, FreeNodes, ref(Node) *node) {
if (node->len == 0) {
return;
}
fwd(i, node->len) {
callback(this->destroyNode, node->buf[i]);
call(FreeNodes, node->buf[i]);
Memory_Destroy(node->buf[i]);
}
Memory_Destroy(node->buf);
node->len = 0;
}
def(ref(Node) *, AddCustomNode, ref(Node) *node, size_t size) {
if (node == NULL) {
node = &this->root;
}
if (node->len == 0) {
node->buf = Memory_New(sizeof(ref(Node) *));
} else {
node->buf = Memory_Resize(node->buf,
(node->len + 1) * sizeof(ref(Node) *));
}
ref(Node) *res = node->buf[node->len] = Memory_New(size);
res->len = 0;
res->buf = NULL;
res->parent = node;
node->len++;
return res;
}