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
| | /*
Copyright 2020 Google LLC
Use of this source code is governed by a BSD-style
license that can be found in the LICENSE file or at
https://developers.google.com/open-source/licenses/bsd
*/
#include "tree.h"
#include "basics.h"
#include "record.h"
#include "reftable.h"
#include "test_framework.h"
#include "reftable-tests.h"
static int test_compare(const void *a, const void *b)
{
return (char *)a - (char *)b;
}
struct curry {
void *last;
};
static void check_increasing(void *arg, void *key)
{
struct curry *c = (struct curry *)arg;
if (c->last != NULL) {
assert(test_compare(c->last, key) < 0);
}
c->last = key;
}
static void test_tree(void)
{
struct tree_node *root = NULL;
void *values[11] = { 0 };
struct tree_node *nodes[11] = { 0 };
int i = 1;
struct curry c = { 0 };
do {
nodes[i] = tree_search(values + i, &root, &test_compare, 1);
i = (i * 7) % 11;
} while (i != 1);
for (i = 1; i < ARRAY_SIZE(nodes); i++) {
assert(values + i == nodes[i]->key);
assert(nodes[i] ==
tree_search(values + i, &root, &test_compare, 0));
}
infix_walk(root, check_increasing, &c);
tree_free(root);
}
int tree_test_main(int argc, const char *argv[])
{
add_test_case("test_tree", &test_tree);
return test_main(argc, argv);
}
|