quadtree: Trivial cleanup

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

diff --git a/quadtree.c b/quadtree.c
index 9338a8523f326fe362066e4129c7b3d96123be36..5ea460a397ee5a0dabee3fbdeca06d5f58c8554f 100644 (file)
--- a/quadtree.c
+++ b/quadtree.c
@@ -522,7 +522,7 @@ static int quadtree_split_by_node(struct quadtree *node,
        return 1;
 }
 
-/*
+/**
  * Quickly detach a node from a tree. Move all child nodes under
  * @parent node.
  */
@@ -543,7 +543,6 @@ static int _quadtree_del(struct quadtree *node, struct quadtree *parent)
        if (i == 4)
                trap();
 
-
        for (i = 0; i < 4; i++) {
                if (!node->child[i])
                        continue;
@@ -832,7 +831,7 @@ struct quadtree *quadtree_move(struct quadtree *node, struct vector new_pos,
        /* Move the node into its new location */
        node->pos = new_pos;
 
-       if(node->children) {
+       if (node->children) {
                /*
                 * Now, search the subtree for any children that are
                 * located in wrong place and move them into correct