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
|
/*
* Ouroboros - Copyright (C) 2016 - 2022
*
* Test of the B-tree implementation
*
* Dimitri Staessens <dimitri@ouroboros.rocks>
* Sander Vrijders <sander@ouroboros.rocks>
*
* This program is free software; you can redistribute it and/or modify
* it under the terms of the GNU General Public License version 2 as
* published by the Free Software Foundation.
*
* 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, write to the Free Software
* Foundation, Inc., http://www.fsf.org/about/contact/.
*/
#include <ouroboros/btree.h>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#define MAX_BTREE_KEY 10000
int btree_test(int argc,
char ** argv)
{
struct btree * tree;
int vals[MAX_BTREE_KEY];
int i;
int j;
(void) argc;
(void) argv;
memset(vals, 0, MAX_BTREE_KEY * sizeof(int));
tree = btree_create(32);
if (tree == NULL)
return -1;
if (btree_search(tree, 8) != NULL) {
btree_destroy(tree);
return -1;
}
for (i = 0; i < MAX_BTREE_KEY; ++i)
if (btree_insert(tree, i, &argv)) {
printf("Failed to add element.\n");
btree_destroy(tree);
return -1;
}
for (i = 0; i < MAX_BTREE_KEY; ++i)
if (btree_search(tree, rand() % MAX_BTREE_KEY) != &argv) {
printf("Added element not in tree.\n");
btree_destroy(tree);
return -1;
}
for (i = 0; i < MAX_BTREE_KEY; ++i)
if (btree_remove(tree, i)) {
printf("Failed to remove element %d.\n", i);
btree_destroy(tree);
return -1;
}
for (i = 0; i < MAX_BTREE_KEY / 10; ++i)
if (btree_search(tree, rand() % MAX_BTREE_KEY / 10) != NULL) {
printf("Removed element found in tree.\n");
btree_destroy(tree);
return -1;
}
for (i = 0; i < MAX_BTREE_KEY; ++i)
if (btree_insert(tree, i, &argv)) {
printf("Failed to add element.\n");
btree_destroy(tree);
return -1;
}
for (i = 0; i < MAX_BTREE_KEY; ++i) {
j = rand() % MAX_BTREE_KEY;
if (vals[j] != -1) {
if (btree_remove(tree, j)) {
printf("Failed to remove element %d.\n", j);
btree_destroy(tree);
return -1;
}
}
vals[j] = -1;
}
btree_destroy(tree);
return 0;
}
|
