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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
|
/*
* Copyright (C) 2016 FAUmachine Team <info@faumachine.org>.
*
* This program is free software. You can redistribute it and/or modify it
* under the terms of the GNU General Public License, either version 2 of
* the License, or (at your option) any later version. See COPYING.
*/
#include "lib/tree.h"
#include <assert.h>
#include <stdlib.h>
/* LIST */
static void lst_init(lst *list)
{
list->first = NULL;
list->last = NULL;
list->num = 0;
}
static int lst_push(lst *list, void *data_node)
{
lst_node *node = (lst_node *)data_node;
node->preceder = list->last;
node->succeder = NULL;
if(list->last) {
list->last->succeder = node;
} else {
list->first = node;
}
list->num++;
list->last=node;
return list->num;
}
static lst_dnode *lst_new_dnode(lst *list, void *data)
{
lst_dnode *dnode;
dnode = (lst_dnode *)malloc(sizeof(lst_dnode));
dnode->data=data;
if(list) {
lst_push(list, dnode);
}
return dnode;
}
/* LIST */
struct tree_node_t {
tree_node *parent;
lst children;
void *data;
};
void tree_init(tree_node *node)
{
node->parent = NULL;
node->data = NULL;
lst_init(&node->children);
}
tree_node *tree_new(void)
{
tree_node *ret;
ret = (tree_node *)malloc(sizeof(tree_node));
if (ret == NULL) {
return NULL;
}
tree_init(ret);
return ret;
}
void tree_free(tree_node *node) {
free(node);
}
void* tree_get_data(tree_node *node)
{
if (node == NULL) {
return NULL;
}
return node->data;
}
void tree_set_data(tree_node *node, void *data)
{
assert(node != NULL);
node->data = data;
}
tree_node* tree_get_parent(tree_node *node)
{
if (node == NULL) {
return NULL;
}
return node->parent;
}
lst* tree_get_children(tree_node *node)
{
if (node == NULL) {
return NULL;
}
return &node->children;
}
tree_node* tree_new_child(tree_node *parent, void *data)
{
tree_node *child;
child = tree_new();
if (child == NULL) {
return NULL;
}
child->parent = parent;
child->data = data;
lst_new_dnode(&parent->children, child);
return child;
}
int tree_visit_preorder(tree_node *root, tree_node_callback cb, void *opaque)
{
int abort;
lst_dnode *child_iter;
if (root == NULL || cb == NULL) {
return -1;
}
abort = cb(root, opaque);
if (abort == 1) {
return 1;
}
lst_Foreach(&root->children, child_iter) {
abort = tree_visit_preorder((tree_node *)child_iter->data, cb, opaque);
if (abort == 1) {
return 1;
}
}
return 0;
}
int tree_visit_postorder(tree_node *root, tree_node_callback cb, void *opaque)
{
int abort;
lst_dnode *child_iter;
if (root == NULL || cb == NULL) {
return -1;
}
lst_Foreach(&root->children, child_iter) {
abort = tree_visit_postorder((tree_node *)child_iter->data, cb, opaque);
if (abort == 1) {
return 1;
}
}
abort = cb(root, opaque);
if (abort == 1) {
return 1;
}
return 0;
}
int tree_visit_children(tree_node *parent, tree_node_callback cb, void *opaque)
{
int abort;
lst_dnode *child_iter;
if (parent == NULL || cb == NULL) {
return -1;
}
lst_Foreach(&parent->children, child_iter) {
abort = cb((tree_node *)child_iter->data, opaque);
if (abort == 1) {
return 1;
}
}
return 0;
}
|
