traverse the quadtree and destroy all sub elements */
| 320 | |
| 321 | /* traverse the quadtree and destroy all sub elements */ |
| 322 | static void clusterTreeNodeDestroy(msClusterLayerInfo* layerinfo, clusterTreeNode *node) |
| 323 | { |
| 324 | int i; |
| 325 | /* destroy the shapes added to this node */ |
| 326 | clusterInfoDestroyList(layerinfo, node->shapes); |
| 327 | |
| 328 | /* Recurse to subnodes if they exist */ |
| 329 | for (i = 0; i < 4; i++) |
| 330 | { |
| 331 | if (node->subnode[i]) |
| 332 | clusterTreeNodeDestroy(layerinfo, node->subnode[i]); |
| 333 | } |
| 334 | |
| 335 | msFree(node); |
| 336 | --layerinfo->numNodes; |
| 337 | } |
| 338 | |
| 339 | /* destroy memory of the cluster finalized list (without recursion) */ |
| 340 | static void clusterTreeNodeDestroyList(msClusterLayerInfo* layerinfo, clusterTreeNode *node) |
no test coverage detected