Branch

Compare two trees for inequality.

Compare two trees for equality.

Filter's out any matching value in the tree.

Filters the values at the quad directly under the vertex, if there is any. Note that while this is fast, it only works well for simple cases, or trees of vertices / points. This is because it does not visit the whole tree looking for other quads that might share ownership of this value. For example, if you add a bounding box the size of the whole tree, but then use filterAt to filter it's value in just one quad, say the top left quad, the box will continue to exist in all the other quads it touched.

Filters any values who's spatial value interset with the BoundingBox.

Filters any values who's spatial value intersect with the LineSegment.

Filters any values who's spatial value intersect with the LineSegment.

Traverses the whole tree to find the element that is closest to the vertex specified. Slower than searchAt, but it will find a value assuming the tree has values in it.

Insert a Batch of values of T (e.g. a String) with corresponding spatial values S (e.g. a BoundingBox or a Point) into the QuadTree with explicit option values.

Insert values T (e.g. a String) with corresponding spatial values S (e.g. a BoundingBox or a Point) into the QuadTree with explicit option values.

Insert value T (e.g. a String) with spatial value S (e.g. a BoundingBox or a Point) into the QuadTree with explicit option values.

Insert a Batch of values of T (e.g. a String) with corresponding spatial values S (e.g. a BoundingBox or a Point) into the QuadTree. QuadTree.InsertOptions are supplied via implicit / given; construct using given opts = QuadTree.options(..).

Insert values T (e.g. a String) with corresponding spatial values S (e.g. a BoundingBox or a Point) into the QuadTree. QuadTree.InsertOptions are supplied via implicit / given; construct using given opts = QuadTree.options(..).

Insert value T (e.g. a String) with spatial value S (e.g. a BoundingBox or a Point) into the QuadTree. QuadTree.InsertOptions are supplied via implicit / given; construct using given opts = QuadTree.options(..).

Prints the tree as a string, with the levels indented.

Simplifies the QuadTree by removing unused leaves and branches.

Removes the values at the quad directly under the vertex, if there is any. Note that while this is fast, it only works well for simple cases, or trees of vertices / points. This is because it does not visit the whole tree looking for other quads that might share ownership of this value. For example, if you add a bounding box the size of the whole tree, but then use removeAt to remove it's value in just one quad, say the top left quad, the box will continue to exist in all the other quads it touched.

Removes any values who's spatial value interset with the BoundingBox.

Removes any values who's spatial value intersect with the LineSegment.

Removes any values who's spatial value intersect with the LineSegment.

Traverses the whole tree to find the element that is closest to the vertex specified, and removes it. Slower than removeAt, but it will find a value to remove, assuming the tree has values in it. On removal, all instances of that value are deleted from the tree.

Dives down to the leaf nodes directly under the vertex and returns it's values. Faster than findClosestTo as it does not traverse the tree, but only returns what is in the final quad, and won't look outside it for values.

Searches the tree for any values who's spatial value interset with the BoundingBox.

Searches the tree for any values who's spatial value interset with the LineSegment.

Searches the tree for any values who's spatial value interset with the LineSegment.

Return a Batch containing all the values in the QuadTree, please be aware that there will probably be duplicate entries.