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
|
#include "shared/avl_tree.h"
#include "test_harness.h"
#define integer_cmp_(a, b) (a - b)
AVL_TREE_DECL(int);
AVL_TREE_IMPL(int, integer_cmp_, null_dtor);
static inline void avl_tree_debug_print(avl_tree_node_t(int) * node, int tab)
{
if (node) {
avl_tree_debug_print(node->right, tab + 1);
}
for (int i = 0; i < tab; ++i) {
printf(" ");
}
if (!node) {
printf("(nil)\n");
return;
}
printf("%d\n", node->value);
avl_tree_debug_print(node->left, tab + 1);
}
TEST(avl_tree, insert)
{
avl_tree_t(int)* tree = avl_tree_new(int)();
avl_tree_insert(int)(tree, 5);
ASSERT_EQ(avl_tree_size(int)(tree), 1);
avl_tree_insert(int)(tree, 4);
avl_tree_insert(int)(tree, 6);
ASSERT_EQ(avl_tree_size(int)(tree), 3);
ASSERT_EQ(avl_tree_height(int)(tree), 2);
return 0;
}
TEST(avl_tree, insert_rotate_asc)
{
avl_tree_t(int)* tree = avl_tree_new(int)();
avl_tree_insert(int)(tree, 1);
avl_tree_insert(int)(tree, 2);
avl_tree_insert(int)(tree, 3);
avl_tree_insert(int)(tree, 4);
ASSERT_EQ(avl_tree_size(int)(tree), 4);
ASSERT_EQ(avl_tree_height(int)(tree), 3);
return 0;
}
TEST(avl_tree, insert_rotate_desc)
{
avl_tree_t(int)* tree = avl_tree_new(int)();
avl_tree_insert(int)(tree, 4);
avl_tree_insert(int)(tree, 3);
avl_tree_insert(int)(tree, 2);
avl_tree_insert(int)(tree, 1);
ASSERT_EQ(avl_tree_size(int)(tree), 4);
ASSERT_EQ(avl_tree_height(int)(tree), 3);
return 0;
}
TEST(avl_tree_erase, erase)
{
avl_tree_t(int)* tree = avl_tree_new(int)();
avl_tree_insert(int)(tree, 4);
avl_tree_insert(int)(tree, 3);
avl_tree_insert(int)(tree, 2);
avl_tree_insert(int)(tree, 1);
ASSERT_EQ(avl_tree_size(int)(tree), 4);
ASSERT_EQ(avl_tree_height(int)(tree), 3);
int out;
bool b = avl_tree_erase(int)(tree, 3, &out);
ASSERT_EQ(b, 1);
ASSERT_EQ(out, 3);
ASSERT_EQ(avl_tree_size(int)(tree), 3);
ASSERT_EQ(avl_tree_height(int)(tree), 2);
b = avl_tree_erase(int)(tree, 1, &out);
ASSERT_EQ(b, 1);
ASSERT_EQ(out, 1);
ASSERT_EQ(avl_tree_size(int)(tree), 2);
ASSERT_EQ(avl_tree_height(int)(tree), 2);
return 0;
}
TEST(avl_tree, erase_onesided)
{
avl_tree_t(int)* tree = avl_tree_new(int)();
for (int i = 0; i < 16; ++i) {
avl_tree_insert(int)(tree, i);
}
ASSERT_EQ(avl_tree_erase(int)(tree, 0, NULL), 1);
ASSERT_EQ(avl_tree_erase(int)(tree, 1, NULL), 1);
ASSERT_EQ(avl_tree_erase(int)(tree, 2, NULL), 1);
ASSERT_EQ(avl_tree_erase(int)(tree, 3, NULL), 1);
ASSERT_EQ(avl_tree_erase(int)(tree, 4, NULL), 1);
ASSERT_EQ(avl_tree_erase(int)(tree, 5, NULL), 1);
ASSERT_EQ(avl_tree_erase(int)(tree, 6, NULL), 1);
ASSERT_EQ(avl_tree_height(int)(tree), 4);
ASSERT_EQ(avl_tree_size(int)(tree), 9);
avl_tree_free(int)(tree);
ASSERT_TRUE(debug_is_heap_empty());
return 0;
}
TEST(avl_tree, find)
{
avl_tree_t(int)* tree = avl_tree_new(int)();
for (int i = 0; i < 16; ++ i) {
avl_tree_insert(int)(tree, i);
}
ASSERT_EQ(*avl_tree_find(int)(tree, 4), 4);
ASSERT_EQ(*avl_tree_find(int)(tree, 3), 3);
ASSERT_EQ(*avl_tree_find(int)(tree, 15), 15);
ASSERT_EQ(avl_tree_find(int)(tree, 100), NULL);
return 0;
}
TEST (avl_tree, stress)
{
avl_tree_t(int)* tree = avl_tree_new(int)();
for (int i = 0; i < 512; ++ i) {
avl_tree_insert(int)(tree, i);
}
return 0;
}
|
