Attributes
Members list
Type members
Classlikes
Represents the options used to guide the process of inserting a value into the Quadtree.
Represents the options used to guide the process of inserting a value into the Quadtree.
Attributes
- Companion
- trait
- Supertypes
-
class Objecttrait Matchableclass Any
- Self type
-
InsertOptions.type
Represents the options used to guide the process of inserting a value into the Quadtree.
Represents the options used to guide the process of inserting a value into the Quadtree.
Attributes
- Companion
- object
- Supertypes
-
class Objecttrait Matchableclass Any
Value members
Concrete methods
Construct a QuadTree from a repeated sequence of elements.
Construct a QuadTree from a repeated sequence of elements.
Attributes
Construct a QuadTree from a Batch of elements.
Construct a QuadTree from a Batch of elements.
Attributes
Construct an empty QuadTree of a given size.
Construct an empty QuadTree of a given size.
Attributes
Construct an empty QuadTree of a given size.
Construct an empty QuadTree of a given size.
Attributes
Construct an empty QuadTree of a given size.
Construct an empty QuadTree of a given size.
Attributes
Construct an empty QuadTree of a given bounds.
Construct an empty QuadTree of a given bounds.
Attributes
Filter's out any matching location and/or value in the tree.
Filter's out any matching location and/or value in the tree.
Attributes
Filters the values at the quad directly under the vertex, if there is one. 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 the values at the quad directly under the vertex, if there is one. 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.
Attributes
Filters any values who's spatial value interset with the BoundingBox.
Filters any values who's spatial value interset with the BoundingBox.
Attributes
Filters any values who's spatial value intersect with the LineSegment.
Filters any values who's spatial value intersect with the LineSegment.
Attributes
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.
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.
Attributes
Insert a Batch of QuadTreeValue instances into the QuadTree with explicit option values.
Insert a Batch of QuadTreeValue instances into the QuadTree with explicit option values.
Attributes
Insert a single QuadTreeValue instance into the QuadTree with explicit option values.
Insert a single QuadTreeValue instance into the QuadTree with explicit option values.
Attributes
QuadTree.options(...)
is a convenience method for making instances of InsertOptions
, and some insert operations require implicitly.
QuadTree.options(...)
is a convenience method for making instances of InsertOptions
, and some insert operations require implicitly.
Attributes
Simplifies the QuadTree
by removing unused leaves and branches.
Simplifies the QuadTree
by removing unused leaves and branches.
Attributes
Removes the value at the quad directly under the vertex, if there is one. 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 the value at the quad directly under the vertex, if there is one. 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.
Attributes
Removes any values who's spatial value interset with the BoundingBox.
Removes any values who's spatial value interset with the BoundingBox.
Attributes
Removes any values who's spatial value intersect with the LineSegment.
Removes any values who's spatial value intersect with the LineSegment.
Attributes
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.
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.
Attributes
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.
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.
Attributes
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 BoundingBox.
Attributes
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.
Attributes
Return a Batch
containing all the values in the QuadTree
, please be aware that there will probably be duplicate entries.
Return a Batch
containing all the values in the QuadTree
, please be aware that there will probably be duplicate entries.
Attributes
Concrete fields
A default set of InsertOptions
. Please note that these options are very use-case / context specific, so the usefulness of these defaults should be doubted.
A default set of InsertOptions
. Please note that these options are very use-case / context specific, so the usefulness of these defaults should be doubted.