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
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
|
#include <assert.h>
#include <stdlib.h>
#include "libavl.h"
#include "avl_tree.h"
struct avl_node {
unsigned long long unique_key;
void *data;
void(*free_cb) (void *);
unsigned int ref_count;
struct avl_tree_node node;
};
struct avl_tree {
struct avl_tree_node *root;
unsigned int max_node_num;
unsigned int curr_node_num;
};
struct avl_tree* avl_tree_init(unsigned int max_node_num)
{
struct avl_tree *tree = NULL;
tree = (struct avl_tree*)calloc(1, sizeof(struct avl_tree));
if (tree) {
tree->max_node_num = max_node_num;
}
return tree;
}
struct avl_node *avl_tree_node_new(unsigned long long unique_key, void *data, void (*free_cb)(void *))
{
struct avl_node *ret = NULL;
ret = (struct avl_node*)calloc(1, sizeof(struct avl_node));
if (ret) {
ret->unique_key = unique_key;
ret->data = data;
ret->free_cb = free_cb;
}
return ret;
}
int avl_tree_node_key_set(struct avl_node *pnode, unsigned long long key)
{
if (!pnode) {
return -1;
}
pnode->unique_key = key;
return 0;
}
unsigned long long avl_tree_node_key_get(struct avl_node *pnode)
{
if (!pnode) {
return 0;
}
return pnode->unique_key;
}
void *avl_tree_node_data_get(struct avl_node *pnode)
{
if (!pnode) {
return NULL;
}
return pnode->data;
}
void avl_tree_node_free(struct avl_node *pnode)
{
if (pnode) {
if (pnode->free_cb) {
pnode->free_cb(pnode->data);
}
free(pnode);
pnode = NULL;
}
return;
}
static void avl_tree_traverse_node_free(struct avl_tree_node **root)
{
struct avl_tree_node *temp_tree_node = NULL;
struct avl_node *temp_node = NULL;
temp_tree_node = avl_tree_first_in_order(*root);
while (temp_tree_node) {
temp_node = avl_tree_entry(temp_tree_node, struct avl_node, node);
avl_tree_remove(root, temp_tree_node);
avl_tree_node_free(temp_node);
temp_tree_node = avl_tree_first_in_order(*root);
}
return;
}
void avl_tree_destroy(struct avl_tree *tree)
{
avl_tree_traverse_node_free(&tree->root);
free(tree);
return;
}
static int
cmp_nodes_value(const struct avl_tree_node *node1,
const struct avl_tree_node *node2)
{
long long diff;
struct avl_node *temp1 = avl_tree_entry(node1, struct avl_node, node);
struct avl_node *temp2 = avl_tree_entry(node2, struct avl_node, node);
diff = temp1->unique_key - temp2->unique_key;
if (diff > 0) {
return 1;
} else if (diff < 0) {
return -1;
} else {
return 0;
}
}
int avl_node_in_tree(struct avl_node* pnode)
{
if (!pnode) {
return 0;
}
if (pnode->ref_count > 0) {
return 1;
}
return 0;
}
struct avl_node *avl_tree_node_lookup(struct avl_tree *tree, unsigned long long key)
{
struct avl_node lookup;
struct avl_tree_node *temp;
struct avl_node *ret = NULL;
lookup.unique_key = key;
temp = avl_tree_lookup_node(tree->root, &lookup.node, cmp_nodes_value);
if (temp) {
ret = avl_tree_entry(temp, struct avl_node, node);
}
return ret;
}
int avl_tree_node_insert(struct avl_tree *tree, struct avl_node* pnode)
{
struct avl_tree_node *temp = NULL;
if (!pnode) {
return -1;
}
if (avl_node_in_tree(pnode)) {
pnode->ref_count++;
return 0;
}
if (tree->curr_node_num == tree->max_node_num) {
return -1;
}
temp = avl_tree_insert(&tree->root, &pnode->node, cmp_nodes_value);
if (temp) {
return -1;
}
pnode->ref_count = 1;
tree->curr_node_num++;
return 0;
}
void avl_tree_node_remove(struct avl_tree *tree, struct avl_node* pnode)
{
if (!pnode || pnode->ref_count == 0) {
return;
}
pnode->ref_count--;
assert(pnode->ref_count >= 0);
if (pnode->ref_count > 0) {
return;
}
avl_tree_remove(&tree->root, &pnode->node);
tree->curr_node_num--;
return;
}
struct avl_node *avl_tree_minimum_node_get(struct avl_tree *tree)
{
struct avl_node *ret = NULL;
struct avl_tree_node *temp = NULL;
temp = avl_tree_first_in_order(tree->root);
if (temp) {
ret = avl_tree_entry(temp, struct avl_node, node);
}
return ret;
}
struct avl_node *avl_tree_minimum_node_get_and_pop(struct avl_tree* tree)
{
struct avl_node *node = NULL;
node = avl_tree_minimum_node_get(tree);
if (node) {
avl_tree_node_remove(tree, node);
}
return node;
}
struct avl_node *avl_tree_next_in_order_node_get(struct avl_node* pnode)
{
struct avl_node *node = NULL;
struct avl_tree_node *temp = NULL;
temp = avl_tree_next_in_order(&pnode->node);
if (temp) {
node = avl_tree_entry(temp, struct avl_node, node);
}
return node;
}
|
