quadtree: Remove redundant validity test

The sole purpose of this test wast to see whether the subtree was
removed correctly. If such condition exists, the failure will be
caught in the quadtree_del function. This test should be removed since
it causes unnecessary runtime overhead also on the non-debug build.

Signed-off-by: Timo Kokkonen <kaapeli@itanic.dy.fi>

diff --git a/quadtree.c b/quadtree.c
index 5ea460a397ee5a0dabee3fbdeca06d5f58c8554f..30e306ed58983d70a371e2007063cb6bfc6332f8 100644 (file)
--- a/quadtree.c
+++ b/quadtree.c
@@ -622,11 +622,6 @@ static int optimally_move_tree(struct quadtree *tree, struct quadtree *parent,
        if (quadtree_split_by_node(t, corner, QUADTREE_DOWNRIGHT))
                moved += optimally_move_tree(tree, parent, corner, ops);
 
-       get_middle_point(corner_orig, &mid);
-       tmp = quadtree_find_nearest(tree, &mid, corner_orig, NULL, 0);
-       if (tmp && tmp != tree)
-               trap();
-
 out:
        if (debug)
                printf("Now moved %d nodes, %ld left\n", moved, tree->children);