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
|
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <time.h>
#include "tree_map.h"
typedef struct {
RBNode node;
int key;
int value;
int amount;
} Int2IntRBNode;
static int cmpfunc(void *x, void *y) {
int *a = x, *b = y;
return *a < *b ? -1 : *a > *b;
}
static void augment(void *n) {
Int2IntRBNode *node = n;
Int2IntRBNode *left = rb_tree_left(node);
Int2IntRBNode *right = rb_tree_right(node);
node->amount = 1;
node->amount += left == NULL ? 0 : left->amount;
node->amount += right == NULL ? 0 : right->amount;
}
static void test_largedata();
static int max(int a, int b) { return a > b ? a : b; }
int depth(void *n) {
RBNode *node = n;
if (node == NULL) return 0;
return max(depth(node->entry.rbe_left), depth(node->entry.rbe_right)) + 1;
}
void checkaugment(Int2IntRBNode *node) {
if (node == NULL) return;
Int2IntRBNode *left = rb_tree_left(node);
Int2IntRBNode *right = rb_tree_right(node);
int amount = 1;
amount += left == NULL ? 0 : left->amount;
amount += right == NULL ? 0 : right->amount;
assert(amount == node->amount);
checkaugment(left);
checkaugment(right);
}
int main() {
printf("[TEST] augment rbtree\n");
test_largedata();
printf("[PASS] augment rbtree\n");
return 0;
}
#define TESTSZ 10000
int input[TESTSZ];
void shuffle(int *input, int n) {
for (int i = n - 1; i > 0; i--) {
int j = rand() % i;
int tmp = input[i];
input[i] = input[j];
input[j] = tmp;
}
}
static void test_largedata() {
// generate random input
time_t t;
srand((unsigned)time(&t));
for (int i = 0; i < TESTSZ; i++) {
input[i] = i;
}
shuffle(input, TESTSZ);
// insert
RBTree tree = {NULL, cmpfunc, augment};
Int2IntRBNode *n;
for (int i = 0; i < TESTSZ; i++) {
n = malloc(sizeof(*n));
n->key = input[i];
n->value = input[i];
n->amount = 1;
rb_tree_insert(&tree, n);
}
// check tree validity
int d = depth(tree.rbh_root);
assert(d >= 13 && d <= 28);
Int2IntRBNode *root = (Int2IntRBNode *)(tree.rbh_root);
assert(root->amount == TESTSZ);
checkaugment(root);
Int2IntRBNode *iter = rb_tree_min(&tree);
int i = 0;
for (; iter != NULL; iter = rb_tree_next(&tree, iter)) {
assert(iter->key == i);
i++;
}
// delete when: key % 3 != 0
memset(input, 0, sizeof(int) * TESTSZ);
int count = 0;
for (int i = 0; i < TESTSZ; i++) {
if (i % 3 != 0) {
input[count] = i;
} else {
continue;
}
count++;
}
shuffle(input, count);
for (int i = 0; i < count; i++) {
Int2IntRBNode *iter = rb_tree_find(&tree, &input[i]);
assert(iter != NULL);
rb_tree_remove(&tree, iter);
free(iter);
}
// check tree validity
d = depth(tree.rbh_root);
assert(d >= 11 && d <= 24);
root = (Int2IntRBNode *)(tree.rbh_root);
assert(root->amount == TESTSZ - count);
checkaugment(root);
iter = rb_tree_min(&tree);
i = 0;
for (; iter != NULL; iter = rb_tree_next(&tree, iter)) {
assert(iter->key == i * 3);
i++;
}
destroy_rb_tree(&tree, NULL);
}
|
