| bottomUpSortAndPartition() | EBGeometry::BVH::TreeBVH< T, P, BV, K > | inline |
| deepCopy() const | EBGeometry::BVH::TreeBVH< T, P, BV, K > | inline |
| getBoundingVolume() const noexcept | EBGeometry::BVH::TreeBVH< T, P, BV, K > | inline |
| getBoundingVolumes() const noexcept | EBGeometry::BVH::TreeBVH< T, P, BV, K > | inline |
| getBoundingVolumes() noexcept | EBGeometry::BVH::TreeBVH< T, P, BV, K > | inlineprotected |
| getChildren() const noexcept | EBGeometry::BVH::TreeBVH< T, P, BV, K > | inline |
| getDistanceToBoundingVolume(const Vec3 &a_point) const noexcept | EBGeometry::BVH::TreeBVH< T, P, BV, K > | inline |
| getPrimitives() const noexcept | EBGeometry::BVH::TreeBVH< T, P, BV, K > | inline |
| getPrimitives() noexcept | EBGeometry::BVH::TreeBVH< T, P, BV, K > | inlineprotected |
| isLeaf() const noexcept | EBGeometry::BVH::TreeBVH< T, P, BV, K > | inline |
| isPartitioned() const noexcept | EBGeometry::BVH::TreeBVH< T, P, BV, K > | inline |
| LeafPredicate typedef | EBGeometry::BVH::TreeBVH< T, P, BV, K > | |
| m_boundingVolume | EBGeometry::BVH::TreeBVH< T, P, BV, K > | protected |
| m_boundingVolumes | EBGeometry::BVH::TreeBVH< T, P, BV, K > | protected |
| m_children | EBGeometry::BVH::TreeBVH< T, P, BV, K > | protected |
| m_partitioned | EBGeometry::BVH::TreeBVH< T, P, BV, K > | protected |
| m_primitives | EBGeometry::BVH::TreeBVH< T, P, BV, K > | protected |
| Node typedef | EBGeometry::BVH::TreeBVH< T, P, BV, K > | |
| NodePtr typedef | EBGeometry::BVH::TreeBVH< T, P, BV, K > | |
| operator=(const TreeBVH &a_other)=delete | EBGeometry::BVH::TreeBVH< T, P, BV, K > | |
| operator=(TreeBVH &&a_other) noexcept=default | EBGeometry::BVH::TreeBVH< T, P, BV, K > | |
| pack() const | EBGeometry::BVH::TreeBVH< T, P, BV, K > | inline |
| packWith(Converter &&a_converter) const | EBGeometry::BVH::TreeBVH< T, P, BV, K > | inline |
| Partitioner typedef | EBGeometry::BVH::TreeBVH< T, P, BV, K > | |
| PrimitiveList typedef | EBGeometry::BVH::TreeBVH< T, P, BV, K > | |
| setChildren(const std::array< std::shared_ptr< TreeBVH< T, P, BV, K > >, K > &a_children) noexcept | EBGeometry::BVH::TreeBVH< T, P, BV, K > | inlineprotected |
| topDownSortAndPartition(const Partitioner &a_partitioner=BVCentroidPartitioner< T, P, BV, K >, const LeafPredicate &a_stopCrit=DefaultLeafPredicate< T, P, BV, K >) | EBGeometry::BVH::TreeBVH< T, P, BV, K > | inline |
| traverse(const BVH::LeafEvaluator< P > &a_leafEvaluator, const BVH::PrunePredicate< Node, NodeKey > &a_prunePredicate, const BVH::ChildOrderer< Node, NodeKey, K > &a_childOrderer, const BVH::NodeKeyFactory< Node, NodeKey > &a_nodeKeyFactory) const noexcept | EBGeometry::BVH::TreeBVH< T, P, BV, K > | inline |
| TreeBVH() noexcept | EBGeometry::BVH::TreeBVH< T, P, BV, K > | |
| TreeBVH(const std::vector< PrimAndBV< P, BV > > &a_primsAndBVs) | EBGeometry::BVH::TreeBVH< T, P, BV, K > | |
| TreeBVH(std::vector< PrimAndBV< P, BV > > &&a_primsAndBVs) | EBGeometry::BVH::TreeBVH< T, P, BV, K > | |
| TreeBVH(const TreeBVH &a_other)=delete | EBGeometry::BVH::TreeBVH< T, P, BV, K > | |
| TreeBVH(TreeBVH &&a_other) noexcept=default | EBGeometry::BVH::TreeBVH< T, P, BV, K > | |
| Vec3 typedef | EBGeometry::BVH::TreeBVH< T, P, BV, K > | |
| ~TreeBVH() noexcept=default | EBGeometry::BVH::TreeBVH< T, P, BV, K > | |
