summaryrefslogtreecommitdiffstats
path: root/tests/libdimension/kD_splay_tree.c
diff options
context:
space:
mode:
authorTavian Barnes <tavianator@gmail.com>2010-01-15 14:24:13 -0500
committerTavian Barnes <tavianator@gmail.com>2010-01-15 14:24:13 -0500
commita868a2958dd7ea138b02543ef81cc78abf8622c7 (patch)
treea22e18fd379000ccc1a104ae711a499377e60a72 /tests/libdimension/kD_splay_tree.c
parent26e8ad8ce8f15e25b856c5cbd7f526d090cda3ae (diff)
downloaddimension-a868a2958dd7ea138b02543ef81cc78abf8622c7.tar.xz
Rename kD splay trees to Bounding Volume Splay Trees.
Diffstat (limited to 'tests/libdimension/kD_splay_tree.c')
-rw-r--r--tests/libdimension/kD_splay_tree.c72
1 files changed, 0 insertions, 72 deletions
diff --git a/tests/libdimension/kD_splay_tree.c b/tests/libdimension/kD_splay_tree.c
deleted file mode 100644
index ea53550..0000000
--- a/tests/libdimension/kD_splay_tree.c
+++ /dev/null
@@ -1,72 +0,0 @@
-/*************************************************************************
- * Copyright (C) 2009 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 fancy k-D splay tree framework
- */
-
-#include "../../libdimension/dimension_impl.h"
-#include <stdlib.h>
-
-int
-main()
-{
- dmnsn_kD_splay_tree *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_kD_splay_tree();
-
- dmnsn_kD_splay_insert(tree, obj1);
- if (tree->root->object != obj1) {
- fprintf(stderr, "Wrong kD splay tree built.\n");
- return EXIT_FAILURE;
- }
-
- dmnsn_kD_splay_insert(tree, obj2);
- if (tree->root->object != obj2 || tree->root->contains->object != obj1) {
- fprintf(stderr, "Wrong kD splay tree built.\n");
- return EXIT_FAILURE;
- }
-
- dmnsn_kD_splay_insert(tree, obj3);
- if (tree->root->object != obj3 || tree->root->contains->object != obj1
- || tree->root->container->object != obj2) {
- fprintf(stderr, "Wrong kD splay tree built.\n");
- return EXIT_FAILURE;
- }
-
- dmnsn_delete_kD_splay_tree(tree);
- dmnsn_delete_object(obj3);
- dmnsn_delete_object(obj2);
- dmnsn_delete_object(obj1);
- return EXIT_SUCCESS;
-}