Data structures
Templated commonly used data structures.
Classes
-
LookupTable— Contains a set of samples resulting from sampling some function at equal intervals. -
MinHeap— Binary tree where each nodes is less than or equal to the data in its node's children. -
SpatialTreeElementId— Identifier that may be used for finding an element in the spatial tree. -
TSpatialTree— Spatial partitioning tree for 1D/2D/3D space (i.e. quadtree for 2D, octree for 3D). -
TSpatialTree::Node— Represents a single spatial tree node. -
TSpatialTree::NodeBounds— Contains bounds for a specific node. -
TSpatialTree::NodeTraversalContext— Contains information about a specific tree node, to be used during node traversal. -
TSpatialTree::NodeIterator— Iterator that iterates over tree nodes. -
TSpatialTree::ElementIterator— Iterator that iterates over all elements in a single node. -
TSpatialTree::AreaIntersectIterator— Iterator that iterates over all elements intersecting the specified AABox. -
TSpatialTree::TreeIterator— Iterator that iterates over all elements in the tree.
Structs
-
HeapNode— Nodes for the heap. -
TSpatialTreeTraits— Traits to help with specialization of the spatial tree for different dimensions. -
TSpatialTreeChildNodeId— Contains a reference to one child nodes in a spatial tree node. -
TSpatialTreeChildNodeIdRange— Contains a range of child nodes in a spatial tree node (any or all of the possible child nodes).
Internal
Symbols intended for engine-internal use. Not part of the public API.
Structs
-
TSpatialTree::NodeElementSuballocationBlock— A sequential group of elements within a node. -
TSpatialTree::NodeElementBoundsSuballocationBlock— A sequential group of element bounds within a node. -
TSpatialTree::NodeElementData— Contains data about elements within a node.