rect_tree_free()

void rect_tree_free

(

RECT_NODE *

node

)

Recurse from top of node tree and free all children.

Free the rect-tree memory.

does not free underlying point array.

Definition at line 69 of file lwtree.c.

{
        int i;
        if (!node) return;
        if (!rect_node_is_leaf(node))
        {
                for (i = 0; i < node->i.num_nodes; i++)
                {
                        rect_tree_free(node->i.nodes[i]);
                        node->i.nodes[i] = NULL;
                }
        }
        lwfree(node);
}

References rect_node::i, lwfree(), RECT_NODE_INTERNAL::nodes, RECT_NODE_INTERNAL::num_nodes, and rect_node_is_leaf().

Referenced by RectTreeBuilder(), RectTreeFreer(), test_rect_tree_contains_point(), test_rect_tree_distance_tree_case(), and tree_inter().

Here is the call graph for this function:

Here is the caller graph for this function: