Bart/bullet3
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Move unquantize from btOptimizedBvh.cpp to btOptimizedBvh.h

Browse Source
This commit is contained in:
johnmccutchan
2008-01-14 23:47:05 +00:00
parent be0beaf7bd
commit 41e9491402
2 changed files with 10 additions and 15 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
src/BulletCollision/CollisionShapes/btOptimizedBvh.cpp
View File

@@ -985,20 +985,6 @@ void btOptimizedBvh::reportBoxCastOverlappingNodex(btNodeOverlapCallback* nodeCa
}
btVector3 btOptimizedBvh::unQuantize(const unsigned short* vecIn) const
{
btVector3 vecOut;
vecOut.setValue(
(btScalar)(vecIn[0]) / (m_bvhQuantization.getX()),
(btScalar)(vecIn[1]) / (m_bvhQuantization.getY()),
(btScalar)(vecIn[2]) / (m_bvhQuantization.getZ()));
vecOut += m_bvhAabbMin;
return vecOut;
}
void btOptimizedBvh::swapLeafNodes(int i,int splitIndex)
{
if (m_useQuantization)

11
src/BulletCollision/CollisionShapes/btOptimizedBvh.h
View File

@@ -349,7 +349,16 @@ public:
}
btVector3 unQuantize(const unsigned short* vecIn) const;
SIMD_FORCE_INLINE btVector3 unQuantize(const unsigned short* vecIn) const
{
btVector3 vecOut;
vecOut.setValue(
(btScalar)(vecIn[0]) / (m_bvhQuantization.getX()),
(btScalar)(vecIn[1]) / (m_bvhQuantization.getY()),
(btScalar)(vecIn[2]) / (m_bvhQuantization.getZ()));
vecOut += m_bvhAabbMin;
return vecOut;
}
///setTraversalMode let's you choose between stackless, recursive or stackless cache friendly tree traversal. Note this is only implemented for quantized trees.
void setTraversalMode(btTraversalMode traversalMode)