DetSkipOctree

Adds an element to the tree. If there is already an element stored at the point represented by the new element, it will be replaced.

Removes an element from the tree. If the element is not found, this operation does nothing.

Adds an element to the tree (or replaces a given element with the same point location).

Tests whether the tree contains an element.

Returns a string debug representation of the octree.

Queries the element at a given point.

The base square of the tree. No point can lie outside this square (or hyper-cube).

Queries whether an element is stored at a given point.

Tests whether the tree is empty (true) or whether it contains any elements (false).

An Iterator which iterates over the points stored in the octree, using an in-order traversal directed by the orthant indices of the nodes of the tree.

Great care has to be taken as the iterator might be corrupted if the tree is successively changed before the iterator is exhausted.

Reports the nearest neighbor entry with respect to a given point.

Note: There is a potential numeric overflow if the squared distance of the query point towards the furthest corner of the tree's root hyper-cube exceeds 63 bits. For a root IntSquare(0x40000000, 0x40000000, 0x40000000), this happens for example for any point going more towards north-west than IntPoint2DLike(-1572067139, -1572067139).

Same as nearestNeighbor but returning an Option, thus not throwing an exception if no neighbor is found.

Reports the number of decimation levels in the tree.

The number of orthants in each hyperCube. This is equal to 1 << numDimensions and gives the upper bound of the index to QNode.child().

A function which maps an element (possibly through transactional access) to a geometric point coordinate.

Removes an element from the tree

Removes the element stored under a given point view.

Queries the number of leaves in the tree. This may be a very costly action, so it is recommended to only use it for debugging purposes.

The space (i.e., resolution and dimensionality) underlying the tree.

Converts the tree into a linearized indexed sequence. This is not necessarily a very efficient method, and should usually just be used for debugging.

Converts the tree into a linearized list. This is not necessarily a very efficient method, and should usually just be used for debugging.

Converts the tree into a linearized sequence. This is not necessarily a very efficient method, and should usually just be used for debugging. To avoid surprises, this does not call iterator.toSeq because that would produce a Stream and thus subject to further changes to the tree while traversing. The returned seq instead is 'forced' and thus stable.

Converts the tree into a non-transactional set. This is not necessarily a very efficient method, and should usually just be used for debugging.

Looks up a point and applies a transformation to the entry associated with it. This can be used to update an element in-place, or used for maintaining a spatial multi-map.

Adds an element to the tree (or replaces a given element with the same point location).