GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived > Member List

This is the complete list of members for GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >, including all inherited members.

BOOST_STATIC_ASSERT(sizeof(EdgeEvent)==12)	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
KDTreeBase::BOOST_STATIC_ASSERT(sizeof(KDNode)==8)	KDTreeBase< BoundingBoxType >
buildInternal()	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline, protected]
buildTree(BuildContext &ctx, unsigned int depth, KDNode *node, const BoundingBoxType &nodeBoundingBox, EdgeEvent *eventStart, EdgeEvent *eventEnd, SizeType primCount, bool isLeftChild, SizeType badRefines)	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline, protected]
buildTreeMinMax(BuildContext &ctx, unsigned int depth, KDNode *node, const BoundingBoxType &nodeBoundingBox, const BoundingBoxType &tightBBox, IndexType *indices, SizeType primCount, bool isLeftChild, SizeType badRefines)	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline, protected]
cast()	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline, protected]
cast() const	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline, protected]
createEventList(OrderedChunkAllocator &alloc, const BoundingBoxType &nodeBoundingBox, IndexType *prims, SizeType primCount)	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline, protected]
createLeaf(BuildContext &ctx, KDNode *node, EdgeEvent *eventStart, EdgeEvent *eventEnd, SizeType primCount)	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline, protected]
createLeaf(BuildContext &ctx, KDNode *node, SizeType *indices, SizeType primCount)	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline, protected]
createLeafAfterRetraction(BuildContext &ctx, KDNode *node, SizeType start)	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline, protected]
EBothSides enum value	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
EBothSidesProcessed enum value	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
EClassificationResult enum name	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
ELeftSide enum value	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
ERightSide enum value	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
GenericKDTree()	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
getBoundingBox() const	KDTreeBase< BoundingBoxType >	[inline]
getClip() const	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
getEmptySpaceBonus() const	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
getExactPrimitiveThreshold() const	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
getMaxBadRefines() const	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
getMaxDepth() const	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
getMinMaxBins() const	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
getParallelBuild() const	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
getQueryCost() const	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
getRetract() const	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
getRoot() const	KDTreeBase< BoundingBoxType >	[inline]
getStopPrims() const	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
getTightBoundingBox() const	KDTreeBase< BoundingBoxType >	[inline]
getTraversalCost() const	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
IndexType typedef	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >
isBuilt() const	KDTreeBase< BoundingBoxType >	[inline]
KDNode typedef	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >
m_bbox	KDTreeBase< BoundingBoxType >	[protected]
m_builders	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
m_clip	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
m_emptySpaceBonus	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
m_exactPrimThreshold	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
m_indexCount	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
m_indices	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
m_indirectionLock	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
m_indirections	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
m_interface	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
m_maxBadRefines	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
m_maxDepth	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
m_minMaxBins	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
m_nodeCount	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
m_nodes	KDTreeBase< BoundingBoxType >	[protected]
m_parallelBuild	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
m_queryCost	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
m_retract	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
m_stopPrims	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
m_tightBBox	KDTreeBase< BoundingBoxType >	[protected]
m_traversalCost	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[protected]
Parent typedef	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >
PointType typedef	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >
Scalar typedef	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >
setClip(bool clip)	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
setEmptySpaceBonus(float emptySpaceBonus)	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
setExactPrimitiveThreshold(SizeType exactPrimThreshold)	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
setMaxBadRefines(SizeType maxBadRefines)	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
setMaxDepth(SizeType maxDepth)	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
setMinMaxBins(SizeType minMaxBins)	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
setParallelBuild(bool parallel)	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
setQueryCost(float queryCost)	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
setRetract(bool retract)	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
setStopPrims(SizeType stopPrims)	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
setTraversalCost(float traversalCost)	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline]
SizeType typedef	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >
transitionToNLogN(BuildContext &ctx, unsigned int depth, KDNode *node, const BoundingBoxType &nodeBoundingBox, IndexType *indices, SizeType primCount, bool isLeftChild, SizeType badRefines)	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline, protected]
VectorType typedef	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >
~GenericKDTree()	GenericKDTree< BoundingBoxType, TreeConstructionHeuristic, Derived >	[inline, virtual]