tree_macros.h
11.4 KB
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
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
/**
* \file
*
* \author Georg Hopp
*
* \copyright
* Copyright © 2012 Georg Hopp
*
* This program is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 3 of the License, or
* (at your option) any later version.
*
* This program is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
* GNU General Public License for more details.
*
* You should have received a copy of the GNU General Public License
* along with this program. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef __TR_TREE_MACROS_H__
#define __TR_TREE_MACROS_H__
#include "trbase.h"
#define TR_TREE_RIGHT(node) (NULL!=(node)?(node)->right:NULL)
#define TR_TREE_LEFT(node) (NULL!=(node)?(node)->left:NULL)
#define TR_TREE_PARENT(node) (NULL!=(node)?(node)->parent:NULL)
#define TR_TREE_CHILD(node) \
(NULL==TR_TREE_RIGHT((node))?TR_TREE_LEFT((node)):TR_TREE_RIGHT((node)))
#define TR_TREE_SIBLING(node) \
(NULL!=TR_TREE_PARENT((node))? \
((node)==TR_TREE_PARENT((node))->left? \
TR_TREE_PARENT((node))->right: \
TR_TREE_PARENT((node))->left): \
NULL)
#define TR_TREE_GRANDPARENT(node) (TR_TREE_PARENT((node))->parent)
#define TR_TREE_UNCLE(node) \
((node)->parent == (node)->parent->parent->left \
? (node)->parent->parent->right \
: (node)->parent->parent->left)
#define TR_TREE_REPLACE_NODE(root, node1, node2) \
if (NULL != (node1)->parent) { \
if ((node1) == (node1)->parent->left) { \
(node1)->parent->left = (node2); \
} else { \
(node1)->parent->right = (node2); \
} \
} else { \
*(root) = (node2); \
} \
if (NULL != (node2)) { \
(node2)->parent = (node1)->parent; \
}
#define TR_TREE_ROT_RCLD_right(node) ((node)->left)
#define TR_TREE_ROT_RCLD_left(node) ((node)->right)
#define TR_TREE_ROTATE(lr, root, node) \
if (NULL != (node)) { \
void * stPar = node->parent; \
void * relCld = TR_TREE_ROT_RCLD_##lr(node); \
void * relCCld = TR_TREE_ROT_RCLD_##lr(node)->lr; \
void * nLeft_p = &TR_TREE_ROT_RCLD_##lr(node); \
if (NULL != relCCld) { \
TR_TREE_ROT_RCLD_##lr(node)->lr->parent = node; \
} \
TR_TREE_ROT_RCLD_##lr(node)->lr = node; \
if (NULL != node->parent) { \
if (node->parent->left == node) { \
node->parent->left = relCld; \
} else { \
node->parent->right = relCld; \
} \
} else { \
*(root) = relCld; \
} \
node->parent = relCld; \
TR_TREE_ROT_RCLD_##lr(node)->parent = stPar; \
*(void**)nLeft_p = relCCld; \
}
typedef enum {rbBlack=1, rbRed=2} TR_rbColor;
#define TR_TREE_NODE_BLACK(node) \
(NULL == (node) || rbBlack == (node)->color)
#define TR_TREE_NODE_RED(node) \
(NULL == (node) || rbRed == (node)->color)
#define TR_TREE_NODE_STRICT_BLACK(node) \
(NULL != (node) && rbBlack == (node)->color)
#define TR_TREE_NODE_STRICT_RED(node) \
(NULL != (node) && rbRed == (node)->color)
#define TR_TREE_INORDER_SUCC(node, succ) \
succ = (node)->right; \
while (NULL != succ->left) { \
succ = succ->left; \
}
/*
* Find data in a tree.
* Attention: This will change node, so normally you need to copy
* it before using this macro.
* Also be aware that found needs to be a valid lvalue and an integer.
*/
#define TR_TREE_FIND(node, search, found, comp) \
(found) = -1; \
if ((node)) { \
while(1) { \
(found) = (comp)((node)->data, (search)); \
if (0 != (found)) { \
if (! ((node)->left || (node)->right)) { \
break; \
} \
if (0 < (found)) { \
(node) = (node)->left; \
} else { \
(node) = (node)->right; \
} \
} else { \
break; \
} \
} \
}
#define TR_TREE_BALANCE_DELETE_CASE1(node) \
if (NULL == TR_TREE_PARENT((node))) { \
break; \
}
#define TR_TREE_BALANCE_DELETE_CASE2(root, node, sibling) \
if (NULL != (sibling) && rbRed == (sibling)->color) { \
(node)->parent->color = rbRed; \
(sibling)->color = rbBlack; \
if (NULL != (node)->parent->right \
&& (node) != (node)->parent->right) { \
TR_TREE_ROTATE(left, (root), (node)->parent); \
} else { \
TR_TREE_ROTATE(right, (root), (node)->parent); \
} \
(sibling) = TR_TREE_SIBLING((node)); \
}
#define TR_TREE_BALANCE_DELETE_CASE34(root, node, sibling) \
if (NULL == (sibling) \
|| (rbBlack == (sibling)->color \
&& TR_TREE_NODE_BLACK((sibling)->left) \
&& TR_TREE_NODE_BLACK((sibling)->right))) { \
if (NULL != (sibling)) { \
(sibling)->color = rbRed; \
} \
if (rbBlack == (node)->parent->color) { \
(node) = (node)->parent; \
continue; \
} else { \
(node)->parent->color = rbBlack; \
break; \
} \
}
/*
* this if statement is trivial,
* due to case 2 (even though case 2 changed the sibling to a
* sibling's child,
* the sibling's child can't be red, since no red parent can
* have a red child).
*
* the following statements just force the red to be on the
* left of the left of the parent,
* or right of the right, so case 6 will rotate correctly.
*/
#define TR_TREE_BALANCE_DELETE_CASE5(root, node, sibling) \
if (NULL != (sibling) && rbBlack == (sibling)->color) { \
if ((node) == (node)->parent->left \
&& TR_TREE_NODE_BLACK((sibling)->right) \
&& TR_TREE_NODE_STRICT_RED((sibling)->left)) { \
(sibling)->color = rbRed; \
(sibling)->left->color = rbBlack; \
TR_TREE_ROTATE(right, (root), (sibling)); \
} else if ((node) == (node)->parent->right \
&& TR_TREE_NODE_BLACK((sibling)->left) \
&& TR_TREE_NODE_STRICT_RED((sibling)->right)) { \
(sibling)->color = rbRed; \
(sibling)->right->color = rbBlack; \
TR_TREE_ROTATE(left, (root), (sibling)); \
} \
(sibling) = TR_TREE_SIBLING((node)); \
}
#define TR_TREE_BALANCE_DELETE_CASE6(root, node, sibling) \
if (NULL != (sibling)) { \
(sibling)->color = (node)->parent->color; \
} \
if (NULL != (node) && NULL != (node)->parent) { \
(node)->parent->color = rbBlack; \
if (NULL != (node)->parent->right \
&& (node) != (node)->parent->right) { \
if (NULL != (sibling)->right) { \
(sibling)->right->color = rbBlack; \
} \
TR_TREE_ROTATE(left, (root), (node)->parent); \
} else { \
if (NULL != (sibling)->left) { \
(sibling)->left->color = rbBlack; \
} \
TR_TREE_ROTATE(right, (root), (node)->parent); \
} \
}
#define TR_TREE_BALANCE_DELETE(root, node, sibling) \
while(1) { \
TR_TREE_BALANCE_DELETE_CASE1((node)) \
TR_TREE_BALANCE_DELETE_CASE2((root), (node), (sibling)) \
TR_TREE_BALANCE_DELETE_CASE34((root), (node), (sibling)) \
TR_TREE_BALANCE_DELETE_CASE5((root), (node), (sibling)) \
TR_TREE_BALANCE_DELETE_CASE6((root), (node), (sibling)) \
break; \
}
#define TR_TREE_BALANCE_INSERT_CASE1(node) \
if (NULL == TR_TREE_PARENT((node))) { \
(node)->color = rbBlack; \
break; \
}
#define TR_TREE_BALANCE_INSERT_CASE2(node) \
if (rbBlack == (node)->parent->color) { \
break; \
}
#define TR_TREE_BALANCE_INSERT_CASE3(node) \
if (NULL != TR_TREE_UNCLE(node) \
&& rbRed == TR_TREE_UNCLE(node)->color) { \
(node)->parent->color = rbBlack; \
TR_TREE_UNCLE(node)->color = rbBlack; \
(node)->parent->parent->color = rbRed; \
(node) = (node)->parent->parent; \
continue; \
}
#define TR_TREE_BALANCE_INSERT_CASE4(root, node) \
if ((node) == (node)->parent->right \
&& (node)->parent == (node)->parent->parent->left) { \
TR_TREE_ROTATE(left, (root), (node)->parent); \
(node) = (node)->left; \
} else if ((node) == (node)->parent->left \
&& (node)->parent == (node)->parent->parent->right) { \
TR_TREE_ROTATE(right, (root), (node)->parent); \
(node) = (node)->right; \
}
#define TR_TREE_BALANCE_INSERT_CASE5(root, node) \
(node)->parent->color = rbBlack; \
(node)->parent->parent->color = rbRed; \
if ((node) == (node)->parent->left) { \
TR_TREE_ROTATE(right, (root), (node)->parent->parent); \
} else { \
TR_TREE_ROTATE(left, (root), (node)->parent->parent); \
}
#define TR_TREE_BALANCE_INSERT(root, node) \
while (1) { \
TR_TREE_BALANCE_INSERT_CASE1((node)) \
TR_TREE_BALANCE_INSERT_CASE2((node)) \
TR_TREE_BALANCE_INSERT_CASE3((node)) \
TR_TREE_BALANCE_INSERT_CASE4((root), (node)) \
TR_TREE_BALANCE_INSERT_CASE5((root), (node)) \
break; \
}
#endif // __TR_TREE_MACROS_H__
// vim: set ts=4 sw=4: