Module node

Structs§

BBox: A bounding box container object that implements Aabb and HasInner. Note that &mut BBox<N,T> also implements Aabb and HasInner.
BBoxMut: BBox with a reference.
Node: A node in Tree.
NodeData: Like Node except only has the number of elem instead of a slice..
Range: A 1D range. Internally represented as start and end. (as opposed to a start and length) If range A contains value x and range B contains value x, then A intersects B. There is no protection against “degenerate” Ranges where start>end.
Rect: An axis aligned rectangle. Stored as two Ranges.
VistrMutPin: Tree Iterator that returns a protected mutable reference to each node.

Aabb: Trait to signify that this object has an axis aligned bounding box.
HasElem
Num: The underlying number type used for the tree. It is auto implemented by all types that satisfy the type constraints. Notice that no arithmetic is possible. The tree is constructed using only comparisons and copying.

Vistr: When we traverse the tree in read-only mode, we can simply return a reference to each node. We don’t need to protect the user from only mutating parts of the BBox’s since they can’t change anything.