Method freeQuadtreeNode

quadtree.go:151–171

(n *quadtreeNode)

}

func (qt *Quadtree) freeQuadtreeNode(n *quadtreeNode) {
	if !qt.usePool {
		return
	}
	if n.hasNodes {
		for i, child := range n.Nodes {
			qt.freeQuadtreeNode(child)
			n.Nodes[i] = nil
		}
	}

	if n.Objects != nil {
		for _, o := range n.Objects {
			qt.freeQuadtreeNodeData(o)
		}
	}
	n.Objects = nil
	n.Tree = nil
	n.hasNodes = false
	quadtreeNodePool.Put(n)
}

// split - split the node into 4 subnodes
func (qt *quadtreeNode) split() {