Rename kD splay trees to Bounding Volume Splay Trees.

1 files changed, 72 insertions, 0 deletions

diff --git a/tests/libdimension/bvst.c b/tests/libdimension/bvst.c
new file mode 100644
index 0000000..36dce04
--- /dev/null
+++ b/tests/libdimension/bvst.c
@@ -0,0 +1,72 @@
+/*************************************************************************
+ * 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 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;
+}