ruby-bullet 0.1.0-x86-linux → 0.1.1-x86-linux

data/deps/include/bullet/BulletCollision/CollisionShapes/btTriangleInfoMap.h

@@ -1,241 +0,0 @@
-/*
-Bullet Continuous Collision Detection and Physics Library
-Copyright (c) 2010 Erwin Coumans  http://bulletphysics.org
-
-This software is provided 'as-is', without any express or implied warranty.
-In no event will the authors be held liable for any damages arising from the use of this software.
-Permission is granted to anyone to use this software for any purpose, 
-including commercial applications, and to alter it and redistribute it freely, 
-subject to the following restrictions:
-
-1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
-2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
-3. This notice may not be removed or altered from any source distribution.
-*/
-
-#ifndef _BT_TRIANGLE_INFO_MAP_H
-#define _BT_TRIANGLE_INFO_MAP_H
-
-
-#include "LinearMath/btHashMap.h"
-#include "LinearMath/btSerializer.h"
-
-
-///for btTriangleInfo m_flags
-#define TRI_INFO_V0V1_CONVEX 1
-#define TRI_INFO_V1V2_CONVEX 2
-#define TRI_INFO_V2V0_CONVEX 4
-
-#define TRI_INFO_V0V1_SWAP_NORMALB 8
-#define TRI_INFO_V1V2_SWAP_NORMALB 16
-#define TRI_INFO_V2V0_SWAP_NORMALB 32
-
-
-///The btTriangleInfo structure stores information to adjust collision normals to avoid collisions against internal edges
-///it can be generated using 
-struct	btTriangleInfo
-{
-	btTriangleInfo()
-	{
-		m_edgeV0V1Angle = SIMD_2_PI;
-		m_edgeV1V2Angle = SIMD_2_PI;
-		m_edgeV2V0Angle = SIMD_2_PI;
-		m_flags=0;
-	}
-
-	int			m_flags;
-
-	btScalar	m_edgeV0V1Angle;
-	btScalar	m_edgeV1V2Angle;
-	btScalar	m_edgeV2V0Angle;
-
-};
-
-typedef btHashMap<btHashInt,btTriangleInfo> btInternalTriangleInfoMap;
-
-
-///The btTriangleInfoMap stores edge angle information for some triangles. You can compute this information yourself or using btGenerateInternalEdgeInfo.
-struct	btTriangleInfoMap : public btInternalTriangleInfoMap
-{
-	btScalar	m_convexEpsilon;///used to determine if an edge or contact normal is convex, using the dot product
-	btScalar	m_planarEpsilon; ///used to determine if a triangle edge is planar with zero angle
-	btScalar	m_equalVertexThreshold; ///used to compute connectivity: if the distance between two vertices is smaller than m_equalVertexThreshold, they are considered to be 'shared'
-	btScalar	m_edgeDistanceThreshold; ///used to determine edge contacts: if the closest distance between a contact point and an edge is smaller than this distance threshold it is considered to "hit the edge"
-	btScalar	m_maxEdgeAngleThreshold; //ignore edges that connect triangles at an angle larger than this m_maxEdgeAngleThreshold
-	btScalar	m_zeroAreaThreshold; ///used to determine if a triangle is degenerate (length squared of cross product of 2 triangle edges < threshold)
-	
-	
-	btTriangleInfoMap()
-	{
-		m_convexEpsilon = 0.00f;
-		m_planarEpsilon = 0.0001f;
-		m_equalVertexThreshold = btScalar(0.0001)*btScalar(0.0001);
-		m_edgeDistanceThreshold = btScalar(0.1);
-		m_zeroAreaThreshold = btScalar(0.0001)*btScalar(0.0001);
-		m_maxEdgeAngleThreshold = SIMD_2_PI;
-	}
-	virtual ~btTriangleInfoMap() {}
-
-	virtual	int	calculateSerializeBufferSize() const;
-
-	///fills the dataBuffer and returns the struct name (and 0 on failure)
-	virtual	const char*	serialize(void* dataBuffer, btSerializer* serializer) const;
-
-	void	deSerialize(struct btTriangleInfoMapData& data);
-
-};
-
-///those fields have to be float and not btScalar for the serialization to work properly
-struct	btTriangleInfoData
-{
-	int			m_flags;
-	float	m_edgeV0V1Angle;
-	float	m_edgeV1V2Angle;
-	float	m_edgeV2V0Angle;
-};
-
-struct	btTriangleInfoMapData
-{
-	int					*m_hashTablePtr;
-	int					*m_nextPtr;
-	btTriangleInfoData	*m_valueArrayPtr;
-	int					*m_keyArrayPtr;
-
-	float	m_convexEpsilon;
-	float	m_planarEpsilon;
-	float	m_equalVertexThreshold; 
-	float	m_edgeDistanceThreshold;
-	float	m_zeroAreaThreshold;
-
-	int		m_nextSize;
-	int		m_hashTableSize;
-	int		m_numValues;
-	int		m_numKeys;
-	char	m_padding[4];
-};
-
-SIMD_FORCE_INLINE	int	btTriangleInfoMap::calculateSerializeBufferSize() const
-{
-	return sizeof(btTriangleInfoMapData);
-}
-
-///fills the dataBuffer and returns the struct name (and 0 on failure)
-SIMD_FORCE_INLINE	const char*	btTriangleInfoMap::serialize(void* dataBuffer, btSerializer* serializer) const
-{
-	btTriangleInfoMapData* tmapData = (btTriangleInfoMapData*) dataBuffer;
-	tmapData->m_convexEpsilon = m_convexEpsilon;
-	tmapData->m_planarEpsilon = m_planarEpsilon;
-	tmapData->m_equalVertexThreshold = m_equalVertexThreshold;
-	tmapData->m_edgeDistanceThreshold = m_edgeDistanceThreshold;
-	tmapData->m_zeroAreaThreshold = m_zeroAreaThreshold;
-	
-	tmapData->m_hashTableSize = m_hashTable.size();
-
-	tmapData->m_hashTablePtr = tmapData->m_hashTableSize ? (int*)serializer->getUniquePointer((void*)&m_hashTable[0]) : 0;
-	if (tmapData->m_hashTablePtr)
-	{ 
-		//serialize an int buffer
-		int sz = sizeof(int);
-		int numElem = tmapData->m_hashTableSize;
-		btChunk* chunk = serializer->allocate(sz,numElem);
-		int* memPtr = (int*)chunk->m_oldPtr;
-		for (int i=0;i<numElem;i++,memPtr++)
-		{
-			*memPtr = m_hashTable[i];
-		}
-		serializer->finalizeChunk(chunk,"int",BT_ARRAY_CODE,(void*)&m_hashTable[0]);
-
-	}
-
-	tmapData->m_nextSize = m_next.size();
-	tmapData->m_nextPtr = tmapData->m_nextSize? (int*)serializer->getUniquePointer((void*)&m_next[0]): 0;
-	if (tmapData->m_nextPtr)
-	{
-		int sz = sizeof(int);
-		int numElem = tmapData->m_nextSize;
-		btChunk* chunk = serializer->allocate(sz,numElem);
-		int* memPtr = (int*)chunk->m_oldPtr;
-		for (int i=0;i<numElem;i++,memPtr++)
-		{
-			*memPtr = m_next[i];
-		}
-		serializer->finalizeChunk(chunk,"int",BT_ARRAY_CODE,(void*)&m_next[0]);
-	}
-	
-	tmapData->m_numValues = m_valueArray.size();
-	tmapData->m_valueArrayPtr = tmapData->m_numValues ? (btTriangleInfoData*)serializer->getUniquePointer((void*)&m_valueArray[0]): 0;
-	if (tmapData->m_valueArrayPtr)
-	{
-		int sz = sizeof(btTriangleInfoData);
-		int numElem = tmapData->m_numValues;
-		btChunk* chunk = serializer->allocate(sz,numElem);
-		btTriangleInfoData* memPtr = (btTriangleInfoData*)chunk->m_oldPtr;
-		for (int i=0;i<numElem;i++,memPtr++)
-		{
-			memPtr->m_edgeV0V1Angle = m_valueArray[i].m_edgeV0V1Angle;
-			memPtr->m_edgeV1V2Angle = m_valueArray[i].m_edgeV1V2Angle;
-			memPtr->m_edgeV2V0Angle = m_valueArray[i].m_edgeV2V0Angle;
-			memPtr->m_flags = m_valueArray[i].m_flags;
-		}
-		serializer->finalizeChunk(chunk,"btTriangleInfoData",BT_ARRAY_CODE,(void*) &m_valueArray[0]);
-	}
-	
-	tmapData->m_numKeys = m_keyArray.size();
-	tmapData->m_keyArrayPtr = tmapData->m_numKeys ? (int*)serializer->getUniquePointer((void*)&m_keyArray[0]) : 0;
-	if (tmapData->m_keyArrayPtr)
-	{
-		int sz = sizeof(int);
-		int numElem = tmapData->m_numValues;
-		btChunk* chunk = serializer->allocate(sz,numElem);
-		int* memPtr = (int*)chunk->m_oldPtr;
-		for (int i=0;i<numElem;i++,memPtr++)
-		{
-			*memPtr = m_keyArray[i].getUid1();
-		}
-		serializer->finalizeChunk(chunk,"int",BT_ARRAY_CODE,(void*) &m_keyArray[0]);
-
-	}
-	return "btTriangleInfoMapData";
-}
-
-
-
-///fills the dataBuffer and returns the struct name (and 0 on failure)
-SIMD_FORCE_INLINE	void	btTriangleInfoMap::deSerialize(btTriangleInfoMapData& tmapData )
-{
-
-
-	m_convexEpsilon = tmapData.m_convexEpsilon;
-	m_planarEpsilon = tmapData.m_planarEpsilon;
-	m_equalVertexThreshold = tmapData.m_equalVertexThreshold;
-	m_edgeDistanceThreshold = tmapData.m_edgeDistanceThreshold;
-	m_zeroAreaThreshold = tmapData.m_zeroAreaThreshold;
-	m_hashTable.resize(tmapData.m_hashTableSize);
-	int i =0;
-	for (i=0;i<tmapData.m_hashTableSize;i++)
-	{
-		m_hashTable[i] = tmapData.m_hashTablePtr[i];
-	}
-	m_next.resize(tmapData.m_nextSize);
-	for (i=0;i<tmapData.m_nextSize;i++)
-	{
-		m_next[i] = tmapData.m_nextPtr[i];
-	}
-	m_valueArray.resize(tmapData.m_numValues);
-	for (i=0;i<tmapData.m_numValues;i++)
-	{
-		m_valueArray[i].m_edgeV0V1Angle = tmapData.m_valueArrayPtr[i].m_edgeV0V1Angle;
-		m_valueArray[i].m_edgeV1V2Angle = tmapData.m_valueArrayPtr[i].m_edgeV1V2Angle;
-		m_valueArray[i].m_edgeV2V0Angle = tmapData.m_valueArrayPtr[i].m_edgeV2V0Angle;
-		m_valueArray[i].m_flags = tmapData.m_valueArrayPtr[i].m_flags;
-	}
-	
-	m_keyArray.resize(tmapData.m_numKeys,btHashInt(0));
-	for (i=0;i<tmapData.m_numKeys;i++)
-	{
-		m_keyArray[i].setUid1(tmapData.m_keyArrayPtr[i]);
-	}
-}
-
-
-#endif //_BT_TRIANGLE_INFO_MAP_H

data/deps/include/bullet/BulletCollision/CollisionShapes/btTriangleMesh.h

@@ -1,69 +0,0 @@
-/*
-Bullet Continuous Collision Detection and Physics Library
-Copyright (c) 2003-2009 Erwin Coumans  http://bulletphysics.org
-
-This software is provided 'as-is', without any express or implied warranty.
-In no event will the authors be held liable for any damages arising from the use of this software.
-Permission is granted to anyone to use this software for any purpose, 
-including commercial applications, and to alter it and redistribute it freely, 
-subject to the following restrictions:
-
-1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
-2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
-3. This notice may not be removed or altered from any source distribution.
-*/
-
-#ifndef BT_TRIANGLE_MESH_H
-#define BT_TRIANGLE_MESH_H
-
-#include "btTriangleIndexVertexArray.h"
-#include "LinearMath/btVector3.h"
-#include "LinearMath/btAlignedObjectArray.h"
-
-///The btTriangleMesh class is a convenience class derived from btTriangleIndexVertexArray, that provides storage for a concave triangle mesh. It can be used as data for the btBvhTriangleMeshShape.
-///It allows either 32bit or 16bit indices, and 4 (x-y-z-w) or 3 (x-y-z) component vertices.
-///If you want to share triangle/index data between graphics mesh and collision mesh (btBvhTriangleMeshShape), you can directly use btTriangleIndexVertexArray or derive your own class from btStridingMeshInterface.
-///Performance of btTriangleMesh and btTriangleIndexVertexArray used in a btBvhTriangleMeshShape is the same.
-class btTriangleMesh : public btTriangleIndexVertexArray
-{
-	btAlignedObjectArray<btVector3>	m_4componentVertices;
-	btAlignedObjectArray<float>		m_3componentVertices;
-
-	btAlignedObjectArray<unsigned int>		m_32bitIndices;
-	btAlignedObjectArray<unsigned short int>		m_16bitIndices;
-	bool	m_use32bitIndices;
-	bool	m_use4componentVertices;
-	
-
-	public:
-		btScalar	m_weldingThreshold;
-
-		btTriangleMesh (bool use32bitIndices=true,bool use4componentVertices=true);
-
-		bool	getUse32bitIndices() const
-		{
-			return m_use32bitIndices;
-		}
-
-		bool	getUse4componentVertices() const
-		{
-			return m_use4componentVertices;
-		}
-		///By default addTriangle won't search for duplicate vertices, because the search is very slow for large triangle meshes.
-		///In general it is better to directly use btTriangleIndexVertexArray instead.
-		void	addTriangle(const btVector3& vertex0,const btVector3& vertex1,const btVector3& vertex2, bool removeDuplicateVertices=false);
-		
-		int getNumTriangles() const;
-
-		virtual void	preallocateVertices(int numverts){(void) numverts;}
-		virtual void	preallocateIndices(int numindices){(void) numindices;}
-
-		///findOrAddVertex is an internal method, use addTriangle instead
-		int		findOrAddVertex(const btVector3& vertex, bool removeDuplicateVertices);
-		///addIndex is an internal method, use addTriangle instead
-		void	addIndex(int index);
-		
-};
-
-#endif //BT_TRIANGLE_MESH_H
-

data/deps/include/bullet/BulletCollision/CollisionShapes/btTriangleMeshShape.h

@@ -1,89 +0,0 @@
-/*
-Bullet Continuous Collision Detection and Physics Library
-Copyright (c) 2003-2009 Erwin Coumans  http://bulletphysics.org
-
-This software is provided 'as-is', without any express or implied warranty.
-In no event will the authors be held liable for any damages arising from the use of this software.
-Permission is granted to anyone to use this software for any purpose, 
-including commercial applications, and to alter it and redistribute it freely, 
-subject to the following restrictions:
-
-1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
-2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
-3. This notice may not be removed or altered from any source distribution.
-*/
-
-#ifndef BT_TRIANGLE_MESH_SHAPE_H
-#define BT_TRIANGLE_MESH_SHAPE_H
-
-#include "btConcaveShape.h"
-#include "btStridingMeshInterface.h"
-
-
-///The btTriangleMeshShape is an internal concave triangle mesh interface. Don't use this class directly, use btBvhTriangleMeshShape instead.
-class btTriangleMeshShape : public btConcaveShape
-{
-protected:
-	btVector3	m_localAabbMin;
-	btVector3	m_localAabbMax;
-	btStridingMeshInterface* m_meshInterface;
-
-	///btTriangleMeshShape constructor has been disabled/protected, so that users will not mistakenly use this class.
-	///Don't use btTriangleMeshShape but use btBvhTriangleMeshShape instead!
-	btTriangleMeshShape(btStridingMeshInterface* meshInterface);
-
-public:
-
-	virtual ~btTriangleMeshShape();
-
-	virtual btVector3 localGetSupportingVertex(const btVector3& vec) const;
-
-	virtual btVector3	localGetSupportingVertexWithoutMargin(const btVector3& vec)const
-	{
-		btAssert(0);
-		return localGetSupportingVertex(vec);
-	}
-
-	void	recalcLocalAabb();
-
-	virtual void getAabb(const btTransform& t,btVector3& aabbMin,btVector3& aabbMax) const;
-
-	virtual void	processAllTriangles(btTriangleCallback* callback,const btVector3& aabbMin,const btVector3& aabbMax) const;
-
-	virtual void	calculateLocalInertia(btScalar mass,btVector3& inertia) const;
-
-	virtual void	setLocalScaling(const btVector3& scaling);
-	virtual const btVector3& getLocalScaling() const;
-	
-	btStridingMeshInterface* getMeshInterface()
-	{
-		return m_meshInterface;
-	}
-
-	const btStridingMeshInterface* getMeshInterface() const
-	{
-		return m_meshInterface;
-	}
-
-	const btVector3& getLocalAabbMin() const
-	{
-		return m_localAabbMin;
-	}
-	const btVector3& getLocalAabbMax() const
-	{
-		return m_localAabbMax;
-	}
-
-
-
-	//debugging
-	virtual const char*	getName()const {return "TRIANGLEMESH";}
-
-	
-
-};
-
-
-
-
-#endif //BT_TRIANGLE_MESH_SHAPE_H

data/deps/include/bullet/BulletCollision/CollisionShapes/btTriangleShape.h

@@ -1,182 +0,0 @@
-/*
-Bullet Continuous Collision Detection and Physics Library
-Copyright (c) 2003-2009 Erwin Coumans  http://bulletphysics.org
-
-This software is provided 'as-is', without any express or implied warranty.
-In no event will the authors be held liable for any damages arising from the use of this software.
-Permission is granted to anyone to use this software for any purpose, 
-including commercial applications, and to alter it and redistribute it freely, 
-subject to the following restrictions:
-
-1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
-2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
-3. This notice may not be removed or altered from any source distribution.
-*/
-
-#ifndef BT_OBB_TRIANGLE_MINKOWSKI_H
-#define BT_OBB_TRIANGLE_MINKOWSKI_H
-
-#include "btConvexShape.h"
-#include "btBoxShape.h"
-
-ATTRIBUTE_ALIGNED16(class) btTriangleShape : public btPolyhedralConvexShape
-{
-
-
-public:
-
-	btVector3	m_vertices1[3];
-
-	virtual int getNumVertices() const
-	{
-		return 3;
-	}
-
-	btVector3& getVertexPtr(int index)
-	{
-		return m_vertices1[index];
-	}
-
-	const btVector3& getVertexPtr(int index) const
-	{
-		return m_vertices1[index];
-	}
-	virtual void getVertex(int index,btVector3& vert) const
-	{
-		vert = m_vertices1[index];
-	}
-
-	virtual int getNumEdges() const
-	{
-		return 3;
-	}
-	
-	virtual void getEdge(int i,btVector3& pa,btVector3& pb) const
-	{
-		getVertex(i,pa);
-		getVertex((i+1)%3,pb);
-	}
-
-
-	virtual void getAabb(const btTransform& t,btVector3& aabbMin,btVector3& aabbMax)const 
-	{
-//		btAssert(0);
-		getAabbSlow(t,aabbMin,aabbMax);
-	}
-
-	btVector3 localGetSupportingVertexWithoutMargin(const btVector3& dir)const 
-	{
-		btVector3 dots(dir.dot(m_vertices1[0]), dir.dot(m_vertices1[1]), dir.dot(m_vertices1[2]));
-	  	return m_vertices1[dots.maxAxis()];
-
-	}
-
-	virtual void	batchedUnitVectorGetSupportingVertexWithoutMargin(const btVector3* vectors,btVector3* supportVerticesOut,int numVectors) const
-	{
-		for (int i=0;i<numVectors;i++)
-		{
-			const btVector3& dir = vectors[i];
-			btVector3 dots(dir.dot(m_vertices1[0]), dir.dot(m_vertices1[1]), dir.dot(m_vertices1[2]));
-  			supportVerticesOut[i] = m_vertices1[dots.maxAxis()];
-		}
-
-	}
-
-	btTriangleShape() : btPolyhedralConvexShape ()
-    {
-		m_shapeType = TRIANGLE_SHAPE_PROXYTYPE;
-	}
-
-	btTriangleShape(const btVector3& p0,const btVector3& p1,const btVector3& p2) : btPolyhedralConvexShape ()
-    {
-		m_shapeType = TRIANGLE_SHAPE_PROXYTYPE;
-        m_vertices1[0] = p0;
-        m_vertices1[1] = p1;
-        m_vertices1[2] = p2;
-    }
-
-
-	virtual void getPlane(btVector3& planeNormal,btVector3& planeSupport,int i) const
-	{
-		getPlaneEquation(i,planeNormal,planeSupport);
-	}
-
-	virtual int	getNumPlanes() const
-	{
-		return 1;
-	}
-
-	void calcNormal(btVector3& normal) const
-	{
-		normal = (m_vertices1[1]-m_vertices1[0]).cross(m_vertices1[2]-m_vertices1[0]);
-		normal.normalize();
-	}
-
-	virtual void getPlaneEquation(int i, btVector3& planeNormal,btVector3& planeSupport) const
-	{
-		(void)i;
-		calcNormal(planeNormal);
-		planeSupport = m_vertices1[0];
-	}
-
-	virtual void	calculateLocalInertia(btScalar mass,btVector3& inertia) const
-	{
-		(void)mass;
-		btAssert(0);
-		inertia.setValue(btScalar(0.),btScalar(0.),btScalar(0.));
-	}
-
-		virtual	bool isInside(const btVector3& pt,btScalar tolerance) const
-	{
-		btVector3 normal;
-		calcNormal(normal);
-		//distance to plane
-		btScalar dist = pt.dot(normal);
-		btScalar planeconst = m_vertices1[0].dot(normal);
-		dist -= planeconst;
-		if (dist >= -tolerance && dist <= tolerance)
-		{
-			//inside check on edge-planes
-			int i;
-			for (i=0;i<3;i++)
-			{
-				btVector3 pa,pb;
-				getEdge(i,pa,pb);
-				btVector3 edge = pb-pa;
-				btVector3 edgeNormal = edge.cross(normal);
-				edgeNormal.normalize();
-				btScalar dist = pt.dot( edgeNormal);
-				btScalar edgeConst = pa.dot(edgeNormal);
-				dist -= edgeConst;
-				if (dist < -tolerance)
-					return false;
-			}
-			
-			return true;
-		}
-
-		return false;
-	}
-		//debugging
-		virtual const char*	getName()const
-		{
-			return "Triangle";
-		}
-
-		virtual int		getNumPreferredPenetrationDirections() const
-		{
-			return 2;
-		}
-		
-		virtual void	getPreferredPenetrationDirection(int index, btVector3& penetrationVector) const
-		{
-			calcNormal(penetrationVector);
-			if (index)
-				penetrationVector *= btScalar(-1.);
-		}
-
-
-};
-
-#endif //BT_OBB_TRIANGLE_MINKOWSKI_H
-

data/deps/include/bullet/BulletCollision/CollisionShapes/btUniformScalingShape.h

@@ -1,87 +0,0 @@
-/*
-Bullet Continuous Collision Detection and Physics Library
-Copyright (c) 2003-2009 Erwin Coumans  http://bulletphysics.org
-
-This software is provided 'as-is', without any express or implied warranty.
-In no event will the authors be held liable for any damages arising from the use of this software.
-Permission is granted to anyone to use this software for any purpose, 
-including commercial applications, and to alter it and redistribute it freely, 
-subject to the following restrictions:
-
-1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
-2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
-3. This notice may not be removed or altered from any source distribution.
-*/
-
-#ifndef BT_UNIFORM_SCALING_SHAPE_H
-#define BT_UNIFORM_SCALING_SHAPE_H
-
-#include "btConvexShape.h"
-#include "BulletCollision/BroadphaseCollision/btBroadphaseProxy.h" // for the types
-
-///The btUniformScalingShape allows to re-use uniform scaled instances of btConvexShape in a memory efficient way.
-///Istead of using btUniformScalingShape, it is better to use the non-uniform setLocalScaling method on convex shapes that implement it.
-class btUniformScalingShape : public btConvexShape
-{
-	btConvexShape*	m_childConvexShape;
-
-	btScalar	m_uniformScalingFactor;
-	
-	public:
-	
-	btUniformScalingShape(	btConvexShape* convexChildShape, btScalar uniformScalingFactor);
-	
-	virtual ~btUniformScalingShape();
-	
-	virtual btVector3	localGetSupportingVertexWithoutMargin(const btVector3& vec)const;
-
-	virtual btVector3	localGetSupportingVertex(const btVector3& vec)const;
-
-	virtual void	batchedUnitVectorGetSupportingVertexWithoutMargin(const btVector3* vectors,btVector3* supportVerticesOut,int numVectors) const;
-
-	virtual void	calculateLocalInertia(btScalar mass,btVector3& inertia) const;
-
-	btScalar	getUniformScalingFactor() const
-	{
-		return m_uniformScalingFactor;
-	}
-
-	btConvexShape*	getChildShape() 
-	{
-		return m_childConvexShape;
-	}
-
-	const btConvexShape*	getChildShape() const
-	{
-		return m_childConvexShape;
-	}
-
-	virtual const char*	getName()const 
-	{
-		return "UniformScalingShape";
-	}
-	
-
-
-	///////////////////////////
-
-
-	///getAabb's default implementation is brute force, expected derived classes to implement a fast dedicated version
-	void getAabb(const btTransform& t,btVector3& aabbMin,btVector3& aabbMax) const;
-
-	virtual void getAabbSlow(const btTransform& t,btVector3& aabbMin,btVector3& aabbMax) const;
-
-	virtual void	setLocalScaling(const btVector3& scaling) ;
-	virtual const btVector3& getLocalScaling() const ;
-
-	virtual void	setMargin(btScalar margin);
-	virtual btScalar	getMargin() const;
-
-	virtual int		getNumPreferredPenetrationDirections() const;
-	
-	virtual void	getPreferredPenetrationDirection(int index, btVector3& penetrationVector) const;
-
-
-};
-
-#endif //BT_UNIFORM_SCALING_SHAPE_H