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

Internal

Symbols intended for engine-internal use. Not part of the public API.

Structs