Bullet Collision Detection & Physics Library: Member List

Bullet Collision Detection & Physics Library

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 name | btQuantizedBvh |
buildInternal() | btQuantizedBvh |
buildTree(int startIndex, int endIndex) | btQuantizedBvh | protected
calcSplittingAxis(int startIndex, int endIndex) | btQuantizedBvh | protected
calculateSerializeBufferSize() const | btQuantizedBvh |
calculateSerializeBufferSizeNew() const | btQuantizedBvh | inlinevirtual
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 | inlineprotected
getAabbMin(int nodeIndex) const | btQuantizedBvh | inlineprotected
getAlignmentSerializationPadding() | btQuantizedBvh | static
getLeafNodeArray() | btQuantizedBvh | inline
getQuantizedNodeArray() | btQuantizedBvh | inline
getSubtreeInfoArray() | btQuantizedBvh | inline
isQuantized() | btQuantizedBvh | inline
m_bulletVersion | btQuantizedBvh | protected
m_bvhAabbMax | btQuantizedBvh | protected
m_bvhAabbMin | btQuantizedBvh | protected
m_bvhQuantization | btQuantizedBvh | protected
m_contiguousNodes | btQuantizedBvh | protected
m_curNodeIndex | btQuantizedBvh | protected
m_leafNodes | btQuantizedBvh | protected
m_quantizedContiguousNodes | btQuantizedBvh | protected
m_quantizedLeafNodes | btQuantizedBvh | protected
m_subtreeHeaderCount | btQuantizedBvh | mutableprotected
m_SubtreeHeaders | btQuantizedBvh | protected
m_traversalMode | btQuantizedBvh | protected
m_useQuantization | btQuantizedBvh | protected
mergeInternalNodeAabb(int nodeIndex, const btVector3 &newAabbMin, const btVector3 &newAabbMax) | btQuantizedBvh | inlineprotected
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 | inlineprotected
setInternalNodeAabbMin(int nodeIndex, const btVector3 &aabbMin) | btQuantizedBvh | inlineprotected
setInternalNodeEscapeIndex(int nodeIndex, int escapeIndex) | btQuantizedBvh | inlineprotected
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 value | btQuantizedBvh |
TRAVERSAL_STACKLESS enum value | btQuantizedBvh |
TRAVERSAL_STACKLESS_CACHE_FRIENDLY enum value | btQuantizedBvh |
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