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
|
/*************************************************************************
* Copyright (C) 2010 Tavian Barnes <tavianator@gmail.com> *
* *
* This file is part of The Dimension Test Suite. *
* *
* The Dimension Test Suite is free software; you can redistribute it *
* and/or modify it under the terms of the GNU General Public License as *
* published by the Free Software Foundation; either version 3 of the *
* License, or (at your option) any later version. *
* *
* The Dimension Test Suite 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, see <http://www.gnu.org/licenses/>. *
*************************************************************************/
/*
* Basic tests of our Bounding Volume Splay Tree framework
*/
#include "../../libdimension/dimension_impl.h"
#include <stdlib.h>
int
main()
{
dmnsn_bvst *tree;
dmnsn_object *obj1, *obj2, *obj3;
obj1 = dmnsn_new_object();
obj2 = dmnsn_new_object();
obj3 = dmnsn_new_object();
obj1->min = dmnsn_new_vector(0.0, 0.0, 0.0);
obj1->max = dmnsn_new_vector(1.0, 1.0, 1.0);
obj2->min = dmnsn_new_vector(-2.0, -2.0, -2.0);
obj2->max = dmnsn_new_vector(1.0, 1.0, 1.0);
obj3->min = dmnsn_new_vector(-1.0, -1.0, -1.0);
obj3->max = dmnsn_new_vector(0.0, 0.0, 0.0);
tree = dmnsn_new_bvst();
dmnsn_bvst_insert(tree, obj1);
if (tree->root->object != obj1) {
fprintf(stderr, "Wrong BVST built.\n");
return EXIT_FAILURE;
}
dmnsn_bvst_insert(tree, obj2);
if (tree->root->object != obj2 || tree->root->contains->object != obj1) {
fprintf(stderr, "Wrong BVST built.\n");
return EXIT_FAILURE;
}
dmnsn_bvst_insert(tree, obj3);
if (tree->root->object != obj3 || tree->root->contains->object != obj1
|| tree->root->container->object != obj2) {
fprintf(stderr, "Wrong BVST built.\n");
return EXIT_FAILURE;
}
dmnsn_delete_bvst(tree);
dmnsn_delete_object(obj3);
dmnsn_delete_object(obj2);
dmnsn_delete_object(obj1);
return EXIT_SUCCESS;
}
|
