btQuantizedBvh Member List

This is the complete list of members for btQuantizedBvh, including all inherited members.
assignInternalNodeFromLeafNode(int internalNode, int leafNodeIndex)btQuantizedBvh [protected]
BT_DECLARE_ALIGNED_ALLOCATOR()btQuantizedBvh
btQuantizedBvh()btQuantizedBvh
btQuantizedBvh(btQuantizedBvh &other, bool ownsMemory)btQuantizedBvh [private]
btTraversalMode enum namebtQuantizedBvh
buildInternal()btQuantizedBvh
buildTree(int startIndex, int endIndex)btQuantizedBvh [protected]
calcSplittingAxis(int startIndex, int endIndex)btQuantizedBvh [protected]
calculateSerializeBufferSize() const btQuantizedBvh
calculateSerializeBufferSizeNew() const btQuantizedBvh [inline, virtual]
deSerializeDouble(struct btQuantizedBvhDoubleData &quantizedBvhDoubleData)btQuantizedBvh [virtual]
deSerializeFloat(struct btQuantizedBvhFloatData &quantizedBvhFloatData)btQuantizedBvh [virtual]
deSerializeInPlace(void *i_alignedDataBuffer, unsigned int i_dataBufferSize, bool i_swapEndian)btQuantizedBvh [static]
getAabbMax(int nodeIndex) const btQuantizedBvh [inline, protected]
getAabbMin(int nodeIndex) const btQuantizedBvh [inline, protected]
getAlignmentSerializationPadding()btQuantizedBvh [static]
getLeafNodeArray()btQuantizedBvh [inline]
getQuantizedNodeArray()btQuantizedBvh [inline]
getSubtreeInfoArray()btQuantizedBvh [inline]
isQuantized()btQuantizedBvh [inline]
m_bulletVersionbtQuantizedBvh [protected]
m_bvhAabbMaxbtQuantizedBvh [protected]
m_bvhAabbMinbtQuantizedBvh [protected]
m_bvhQuantizationbtQuantizedBvh [protected]
m_contiguousNodesbtQuantizedBvh [protected]
m_curNodeIndexbtQuantizedBvh [protected]
m_leafNodesbtQuantizedBvh [protected]
m_quantizedContiguousNodesbtQuantizedBvh [protected]
m_quantizedLeafNodesbtQuantizedBvh [protected]
m_subtreeHeaderCountbtQuantizedBvh [mutable, protected]
m_SubtreeHeadersbtQuantizedBvh [protected]
m_traversalModebtQuantizedBvh [protected]
m_useQuantizationbtQuantizedBvh [protected]
mergeInternalNodeAabb(int nodeIndex, const btVector3 &newAabbMin, const btVector3 &newAabbMax)btQuantizedBvh [inline, protected]
quantize(unsigned short *out, const btVector3 &point, int isMax) const btQuantizedBvh [inline]
quantizeWithClamp(unsigned short *out, const btVector3 &point2, int isMax) const btQuantizedBvh [inline]
reportAabbOverlappingNodex(btNodeOverlapCallback *nodeCallback, const btVector3 &aabbMin, const btVector3 &aabbMax) const btQuantizedBvh
reportBoxCastOverlappingNodex(btNodeOverlapCallback *nodeCallback, const btVector3 &raySource, const btVector3 &rayTarget, const btVector3 &aabbMin, const btVector3 &aabbMax) const btQuantizedBvh
reportRayOverlappingNodex(btNodeOverlapCallback *nodeCallback, const btVector3 &raySource, const btVector3 &rayTarget) const btQuantizedBvh
serialize(void *o_alignedDataBuffer, unsigned i_dataBufferSize, bool i_swapEndian) const btQuantizedBvh [virtual]
serialize(void *dataBuffer, btSerializer *serializer) const btQuantizedBvh [virtual]
setInternalNodeAabbMax(int nodeIndex, const btVector3 &aabbMax)btQuantizedBvh [inline, protected]
setInternalNodeAabbMin(int nodeIndex, const btVector3 &aabbMin)btQuantizedBvh [inline, protected]
setInternalNodeEscapeIndex(int nodeIndex, int escapeIndex)btQuantizedBvh [inline, protected]
setQuantizationValues(const btVector3 &bvhAabbMin, const btVector3 &bvhAabbMax, btScalar quantizationMargin=btScalar(1.0))btQuantizedBvh
setTraversalMode(btTraversalMode traversalMode)btQuantizedBvh [inline]
sortAndCalcSplittingIndex(int startIndex, int endIndex, int splitAxis)btQuantizedBvh [protected]
swapLeafNodes(int firstIndex, int secondIndex)btQuantizedBvh [protected]
TRAVERSAL_RECURSIVE enum valuebtQuantizedBvh
TRAVERSAL_STACKLESS enum valuebtQuantizedBvh
TRAVERSAL_STACKLESS_CACHE_FRIENDLY enum valuebtQuantizedBvh
unQuantize(const unsigned short *vecIn) const btQuantizedBvh [inline]
updateSubtreeHeaders(int leftChildNodexIndex, int rightChildNodexIndex)btQuantizedBvh [protected]
walkRecursiveQuantizedTreeAgainstQuantizedTree(const btQuantizedBvhNode *treeNodeA, const btQuantizedBvhNode *treeNodeB, btNodeOverlapCallback *nodeCallback) const btQuantizedBvh [protected]
walkRecursiveQuantizedTreeAgainstQueryAabb(const btQuantizedBvhNode *currentNode, btNodeOverlapCallback *nodeCallback, unsigned short int *quantizedQueryAabbMin, unsigned short int *quantizedQueryAabbMax) const btQuantizedBvh [protected]
walkStacklessQuantizedTree(btNodeOverlapCallback *nodeCallback, unsigned short int *quantizedQueryAabbMin, unsigned short int *quantizedQueryAabbMax, int startNodeIndex, int endNodeIndex) const btQuantizedBvh [protected]
walkStacklessQuantizedTreeAgainstRay(btNodeOverlapCallback *nodeCallback, const btVector3 &raySource, const btVector3 &rayTarget, const btVector3 &aabbMin, const btVector3 &aabbMax, int startNodeIndex, int endNodeIndex) const btQuantizedBvh [protected]
walkStacklessQuantizedTreeCacheFriendly(btNodeOverlapCallback *nodeCallback, unsigned short int *quantizedQueryAabbMin, unsigned short int *quantizedQueryAabbMax) const btQuantizedBvh [protected]
walkStacklessTree(btNodeOverlapCallback *nodeCallback, const btVector3 &aabbMin, const btVector3 &aabbMax) const btQuantizedBvh [protected]
walkStacklessTreeAgainstRay(btNodeOverlapCallback *nodeCallback, const btVector3 &raySource, const btVector3 &rayTarget, const btVector3 &aabbMin, const btVector3 &aabbMax, int startNodeIndex, int endNodeIndex) const btQuantizedBvh [protected]
~btQuantizedBvh()btQuantizedBvh [virtual]