| BOOST_STATIC_ASSERT(sizeof(EdgeEvent)==12) | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| mitsuba::KDTreeBase::BOOST_STATIC_ASSERT(sizeof(KDNode)==8) | mitsuba::KDTreeBase< AABBType > | |
| buildInternal() | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inlineprotected |
| buildTree(BuildContext &ctx, unsigned int depth, KDNode *node, const AABBType &nodeAABB, EdgeEvent *eventStart, EdgeEvent *eventEnd, SizeType primCount, bool isLeftChild, SizeType badRefines) | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inlineprotected |
| buildTreeMinMax(BuildContext &ctx, unsigned int depth, KDNode *node, const AABBType &nodeAABB, const AABBType &tightAABB, IndexType *indices, SizeType primCount, bool isLeftChild, SizeType badRefines) | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inlineprotected |
| cast() | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inlineprotected |
| cast() const | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inlineprotected |
| createEventList(OrderedChunkAllocator &alloc, const AABBType &nodeAABB, IndexType *prims, SizeType primCount) | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inlineprotected |
| createLeaf(BuildContext &ctx, KDNode *node, EdgeEvent *eventStart, EdgeEvent *eventEnd, SizeType primCount) | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inlineprotected |
| createLeaf(BuildContext &ctx, KDNode *node, SizeType *indices, SizeType primCount) | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inlineprotected |
| createLeafAfterRetraction(BuildContext &ctx, KDNode *node, SizeType start) | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inlineprotected |
| decRef(bool autoDeallocate=true) const | Object | |
| EBothSides enum value | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| EBothSidesProcessed enum value | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| EClassificationResult enum name | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| ELeftSide enum value | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| ERightSide enum value | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| GenericKDTree() | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| getAABB() const | mitsuba::KDTreeBase< AABBType > | inline |
| getClass() const | mitsuba::KDTreeBase< AABBType > | virtual |
| getClip() const | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| getEmptySpaceBonus() const | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| getExactPrimitiveThreshold() const | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| getIndices() const | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| getLogLevel() const | mitsuba::KDTreeBase< AABBType > | inline |
| getMaxBadRefines() const | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| getMaxDepth() const | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| getMinMaxBins() const | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| getParallelBuild() const | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| getQueryCost() const | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| getRefCount() const | Object | inline |
| getRetract() const | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| getRoot() const | mitsuba::KDTreeBase< AABBType > | inline |
| getStopPrims() const | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| getTightAABB() const | mitsuba::KDTreeBase< AABBType > | inline |
| getTraversalCost() const | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| incRef() const | Object | |
| IndexType typedef | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | |
| isBuilt() const | mitsuba::KDTreeBase< AABBType > | inline |
| KDNode typedef | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | |
| m_aabb | mitsuba::KDTreeBase< AABBType > | protected |
| m_builders | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| m_clip | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| m_emptySpaceBonus | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| m_exactPrimThreshold | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| m_indexCount | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| m_indices | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| m_indirectionLock | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| m_indirections | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| m_interface | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| m_logLevel | mitsuba::KDTreeBase< AABBType > | protected |
| m_maxBadRefines | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| m_maxDepth | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| m_minMaxBins | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| m_nodeCount | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| m_nodes | mitsuba::KDTreeBase< AABBType > | protected |
| m_parallelBuild | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| m_queryCost | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| m_retract | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| m_stopPrims | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| m_theClass | mitsuba::KDTreeBase< AABBType > | static |
| m_tightAABB | mitsuba::KDTreeBase< AABBType > | protected |
| m_traversalCost | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | protected |
| Object() | Object | |
| Parent typedef | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | |
| PointType typedef | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | |
| Scalar typedef | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | |
| setClip(bool clip) | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| setEmptySpaceBonus(Float emptySpaceBonus) | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| setExactPrimitiveThreshold(SizeType exactPrimThreshold) | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| setLogLevel(ELogLevel level) | mitsuba::KDTreeBase< AABBType > | inline |
| setMaxBadRefines(SizeType maxBadRefines) | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| setMaxDepth(SizeType maxDepth) | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| setMinMaxBins(SizeType minMaxBins) | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| setParallelBuild(bool parallel) | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| setQueryCost(Float queryCost) | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| setRetract(bool retract) | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| setStopPrims(SizeType stopPrims) | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| setTraversalCost(Float traversalCost) | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inline |
| SizeType typedef | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | |
| staticInitialization() | Object | static |
| staticShutdown() | Object | static |
| toString() const | Object | virtual |
| transitionToNLogN(BuildContext &ctx, unsigned int depth, KDNode *node, const AABBType &nodeAABB, IndexType *indices, SizeType primCount, bool isLeftChild, SizeType badRefines) | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inlineprotected |
| VectorType typedef | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | |
| ~GenericKDTree() | mitsuba::GenericKDTree< AABBType, TreeConstructionHeuristic, Derived > | inlinevirtual |
| ~KDTreeBase() | mitsuba::KDTreeBase< AABBType > | inlineprotectedvirtual |
| ~Object() | Object | protectedvirtual |
1.8.5