# quadtree

Simple f32-based quadtree that can query rects and points
in Olog(n) time.

Note: For simplicity sake, there is no way to update the tree
besides destroying and rebuilding it completely.