c315a72e7bb22100738c003ea3b6d7f578c042f9
1 /*
2 * COPYRIGHT: See COPYING in the top level directory
3 * PROJECT: ReactOS system libraries
4 * PURPOSE: Splay-Tree implementation
5 * FILE: lib/rtl/splaytree.c
6 * PROGRAMMER:
7 */
9 /* INCLUDES *****************************************************************/
11 #include <rtl.h>
13 #define NDEBUG
14 #include <debug.h>
16 /* FUNCTIONS ***************************************************************/
18 /*
19 * @unimplemented
20 */
22 NTAPI
23 RtlDelete (
25 )
26 {
27 UNIMPLEMENTED;
28 return 0;
29 }
31 /*
32 * @unimplemented
33 */
34 VOID
35 NTAPI
36 RtlDeleteNoSplay (
39 )
40 {
41 UNIMPLEMENTED;
42 }
45 /*
46 * @unimplemented
47 */
49 NTAPI
50 RtlRealPredecessor (
52 )
53 {
54 UNIMPLEMENTED;
55 return 0;
56 }
58 /*
59 * @unimplemented
60 */
62 NTAPI
63 RtlRealSuccessor (
65 )
66 {
67 UNIMPLEMENTED;
68 return 0;
69 }
71 /*
72 * @unimplemented
73 */
75 NTAPI
77 {
78 /*
79 * Implementation Notes (http://en.wikipedia.org/wiki/Splay_tree):
80 *
81 * To do a splay, we carry out a sequence of rotations,
82 * each of which moves the target node N closer to the root.
83 *
84 * Each particular step depends on only two factors:
85 * - Whether N is the left or right child of its parent node, P,
86 * - Whether P is the left or right child of its parent, G (for grandparent node).
87 *
88 * Thus, there are four cases:
89 * - Case 1: N is the left child of P and P is the left child of G.
90 * In this case we perform a double right rotation, so that
91 * P becomes N's right child, and G becomes P's right child.
92 *
93 * - Case 2: N is the right child of P and P is the right child of G.
94 * In this case we perform a double left rotation, so that
95 * P becomes N's left child, and G becomes P's left child.
96 *
97 * - Case 3: N is the left child of P and P is the right child of G.
98 * In this case we perform a rotation so that
99 * G becomes N's left child, and P becomes N's right child.
100 *
101 * - Case 4: N is the right child of P and P is the left child of G.
102 * In this case we perform a rotation so that
103 * P becomes N's left child, and G becomes N's right child.
104 *
105 * Finally, if N doesn't have a grandparent node, we simply perform a
106 * left or right rotation to move it to the root.
107 *
108 * By performing a splay on the node of interest after every operation,
109 * we keep recently accessed nodes near the root and keep the tree
110 * roughly balanced, so that we achieve the desired amortized time bounds.
111 */
114 /* N is the item we'll be playing with */
117 /* Let the algorithm run until N becomes the root entry */
118 while (!RtlIsRoot(N))
119 {
120 /* Now get the parent and grand-parent */
121 P = RtlParent(N);
122 G = RtlParent(P);
124 /* Case 1 & 3: N is left child of P */
125 if (RtlIsLeftChild(N))
126 {
127 /* Case 1: P is the left child of G */
128 if (RtlIsLeftChild(P))
129 {
130 /*
131 * N's right-child becomes P's left child and
132 * P's right-child becomes G's left child.
133 */
134 RtlLeftChild(P) = RtlRightChild(N);
135 RtlLeftChild(G) = RtlRightChild(P);
137 /*
138 * If they exist, update their parent pointers too,
139 * since they've changed trees.
140 */
141 if (RtlLeftChild(P)) RtlParent(RtlLeftChild(P)) = P;
142 if (RtlLeftChild(G)) RtlParent(RtlLeftChild(G)) = G;
144 /*
145 * Now we'll shove N all the way to the top.
146 * Check if G is the root first.
147 */
148 if (RtlIsRoot(G))
149 {
150 /* G doesn't have a parent, so N will become the root! */
151 RtlParent(N) = N;
152 }
153 else
154 {
155 /* G has a parent, so inherit it since we take G's place */
156 RtlParent(N) = RtlParent(G);
158 /*
159 * Now find out who was referencing G and have it reference
160 * N instead, since we're taking G's place.
161 */
162 if (RtlIsLeftChild(G))
163 {
164 /*
165 * G was a left child, so change its parent's left
166 * child link to point to N now.
167 */
168 RtlLeftChild(RtlParent(G)) = N;
169 }
170 else
171 {
172 /*
173 * G was a right child, so change its parent's right
174 * child link to point to N now.
175 */
176 RtlLeftChild(RtlParent(G)) = N;
177 }
178 }
180 /* Now N is on top, so P has become its child. */
181 RtlRightChild(N) = P;
182 RtlParent(P) = N;
184 /* N is on top, P is its child, so G is grandchild. */
185 RtlRightChild(P) = G;
186 RtlParent(G) = P;
187 }
188 /* Case 3: P is the right child of G */
189 else if (RtlIsRightChild(P))
190 {
191 /*
192 * N's left-child becomes G's right child and
193 * N's right-child becomes P's left child.
194 */
195 RtlRightChild(G) = RtlLeftChild(N);
196 RtlLeftChild(P) = RtlRightChild(N);
198 /*
199 * If they exist, update their parent pointers too,
200 * since they've changed trees.
201 */
202 if (RtlRightChild(G)) RtlParent(RtlRightChild(G)) = G;
203 if (RtlLeftChild(P)) RtlParent(RtlLeftChild(P)) = P;
205 /*
206 * Now we'll shove N all the way to the top.
207 * Check if G is the root first.
208 */
209 if (RtlIsRoot(G))
210 {
211 /* G doesn't have a parent, so N will become the root! */
212 RtlParent(N) = N;
213 }
214 else
215 {
216 /* G has a parent, so inherit it since we take G's place */
217 RtlParent(N) = RtlParent(G);
219 /*
220 * Now find out who was referencing G and have it reference
221 * N instead, since we're taking G's place.
222 */
223 if (RtlIsLeftChild(G))
224 {
225 /*
226 * G was a left child, so change its parent's left
227 * child link to point to N now.
228 */
229 RtlLeftChild(RtlParent(G)) = N;
230 }
231 else
232 {
233 /*
234 * G was a right child, so change its parent's right
235 * child link to point to N now.
236 */
237 RtlLeftChild(RtlParent(G)) = N;
238 }
239 }
241 /* Now N is on top, so G has become its left child. */
242 RtlLeftChild(N) = G;
243 RtlParent(G) = N;
245 /* N is on top, G is its left child, so P is right child. */
246 RtlRightChild(N) = P;
247 RtlParent(P) = N;
248 }
249 /* "Finally" case: N doesn't have a grandparent => P is root */
250 else
251 {
253 }
254 }
255 /* Case 2 & 4: N is right child of P */
256 else
257 {
258 /* Case 2: P is the right child of G */
259 if (RtlIsRightChild(P))
260 {
262 }
263 /* Case 4: P is the left child of G */
264 else if (RtlIsLeftChild(P))
265 {
267 }
268 /* "Finally" case: N doesn't have a grandparent => P is root */
269 else
270 {
272 }
273 }
274 }
276 /* Return the root entry */
277 return N;
278 }
281 /*
282 * @implemented
283 */
286 {
290 if (Child == NULL)
291 return NULL;
293 if (Child->LeftChild == NULL)
294 return Child;
296 /* Get left-most child */
297 while (Child->LeftChild != NULL)
298 Child = Child->LeftChild;
300 return Child;
301 }
303 /*
304 * @implemented
305 */