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
|
/*++
Copyright (c) 1989 Microsoft Corporation
Module Name:
tsplay.c
Abstract:
Test program for the Splay Procedures
Author:
Gary Kimura [GaryKi] 24-May-1989
Revision History:
--*/
#define DbgPrint DbgPrint
#include <stdio.h>
#include "nt.h"
#include "ntrtl.h"
#include "triangle.h"
ULONG RtlRandom (IN OUT PULONG Seed);
typedef struct _TREE_NODE {
CLONG Data;
TRI_SPLAY_LINKS Links;
} TREE_NODE;
typedef TREE_NODE *PTREE_NODE;
TREE_NODE Buffer[2048];
PTREE_NODE
TreeInsert (
IN PTREE_NODE Root,
IN PTREE_NODE Node
);
VOID
PrintTree (
IN PTREE_NODE Node
);
int
_CDECL
main(
int argc,
char *argv[]
)
{
PTREE_NODE Root;
ULONG i;
ULONG Seed;
DbgPrint("Start TriangleTest()\n");
Root = NULL;
Seed = 0;
for (i=0; i<2048; i++) {
Buffer[i].Data = RtlRandom(&Seed);
Buffer[i].Data = Buffer[i].Data % 512;
TriInitializeSplayLinks(&Buffer[i].Links);
Root = TreeInsert(Root, &Buffer[i]);
}
PrintTree(Root);
DbgPrint("End TriangleTest()\n");
return TRUE;
}
PTREE_NODE
TreeInsert (
IN PTREE_NODE Root,
IN PTREE_NODE Node
)
{
PTRI_SPLAY_LINKS Temp;
if (Root == NULL) {
//DbgPrint("Add as root %u\n", Node->Data);
return Node;
}
while (TRUE) {
if (Root->Data == Node->Data) {
//DbgPrint("Delete %u\n", Node->Data);
Temp = TriDelete(&Root->Links);
if (Temp == NULL) {
return NULL;
} else {
return CONTAINING_RECORD(Temp, TREE_NODE, Links);
}
}
if (Root->Data < Node->Data) {
//
// Go right
//
if (TriRightChild(&Root->Links) == NULL) {
//DbgPrint("Add as right child %u\n", Node->Data);
TriInsertAsRightChild(&Root->Links, &Node->Links);
return CONTAINING_RECORD(TriSplay(&Node->Links), TREE_NODE, Links);
} else {
Root = CONTAINING_RECORD(TriRightChild(&Root->Links), TREE_NODE, Links);
}
} else {
//
// Go Left
//
if (TriLeftChild(&Root->Links) == NULL) {
//DbgPrint("Add as left child %u\n", Node->Data);
TriInsertAsLeftChild(&Root->Links, &Node->Links);
return CONTAINING_RECORD(TriSplay(&Node->Links), TREE_NODE, Links);
} else {
Root = CONTAINING_RECORD(TriLeftChild(&Root->Links), TREE_NODE, Links);
}
}
}
}
VOID
PrintTree (
IN PTREE_NODE Node
)
{
PTRI_SPLAY_LINKS Temp;
ULONG LastValue;
if (Node == NULL) {
return;
}
//
// find smallest value
//
while (TriLeftChild(&Node->Links) != NULL) {
Node = CONTAINING_RECORD(TriLeftChild(&Node->Links), TREE_NODE, Links);
}
LastValue = Node->Data;
//DbgPrint("%u\n", Node->Data);
//
// while the is a real successor we print the successor value
//
while ((Temp = TriRealSuccessor(&Node->Links)) != NULL) {
Node = CONTAINING_RECORD(Temp, TREE_NODE, Links);
if (LastValue >= Node->Data) {
DbgPrint("TestSplay Error\n");
}
LastValue = Node->Data;
//DbgPrint("%u\n", Node->Data);
}
}
|
