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

Revert "add compare operators in btAABB"

Browse Source 
This reverts commit 18f17be47d.
This commit is contained in:
nicolaichuk
2017-03-29 18:20:36 +03:00
parent ae07ce2ea7
commit f30464ebcb
2 changed files with 1 additions and 74 deletions
Download Patch File Download Diff File Expand all files Collapse all files

17
src/BulletCollision/Gimpact/btBoxCollision.h
View File

@@ -235,23 +235,6 @@ public:
btAABB() btAABB()
{} {}
bool operator<(const btAABB& obj) const {
return
m_min < obj.m_min &&
m_max < obj.m_max;
}
bool operator>(const btAABB& obj) const {
return
m_min > obj.m_min &&
m_max > obj.m_max;
}
bool operator==(const btAABB& obj) const {
return
m_min == obj.m_min &&
m_max == obj.m_max;
}
btAABB(const btVector3 & V1, btAABB(const btVector3 & V1,
const btVector3 & V2, const btVector3 & V2,

56
src/BulletCollision/Gimpact/btGImpactBvhStructs.h
View File

@@ -35,25 +35,6 @@ struct GIM_PAIR
{ {
int m_index1; int m_index1;
int m_index2; int m_index2;
bool operator<(const GIM_PAIR& obj) const {
return
m_index1 < obj.m_index1 &&
m_index2 < obj.m_index2;
}
bool operator>(const GIM_PAIR& obj) const {
return
m_index1 > obj.m_index1 &&
m_index2 > obj.m_index2;
}
bool operator==(const GIM_PAIR& obj) const {
return
m_index1 == obj.m_index1 &&
m_index2 == obj.m_index2;
}
GIM_PAIR() GIM_PAIR()
{} {}
@@ -75,24 +56,6 @@ struct GIM_BVH_DATA
{ {
btAABB m_bound; btAABB m_bound;
int m_data; int m_data;
bool operator<(const GIM_BVH_DATA& obj) const {
return
m_bound < obj.m_bound &&
m_data < obj.m_data;
}
bool operator>(const GIM_BVH_DATA& obj) const {
return
m_bound > obj.m_bound &&
m_data > obj.m_data;
}
bool operator==(const GIM_BVH_DATA& obj) const {
return
m_bound == obj.m_bound &&
m_data == obj.m_data;
}
}; };
//! Node Structure for trees //! Node Structure for trees
@@ -103,25 +66,6 @@ public:
protected: protected:
int m_escapeIndexOrDataIndex; int m_escapeIndexOrDataIndex;
public: public:
bool operator<(const GIM_BVH_TREE_NODE& obj) const {
return
m_bound < obj.m_bound &&
m_escapeIndexOrDataIndex < obj.m_escapeIndexOrDataIndex;
}
bool operator>(const GIM_BVH_TREE_NODE& obj) const {
return
m_bound > obj.m_bound &&
m_escapeIndexOrDataIndex > obj.m_escapeIndexOrDataIndex;
}
bool operator==(const GIM_BVH_TREE_NODE& obj) const {
return
m_bound == obj.m_bound &&
m_escapeIndexOrDataIndex == obj.m_escapeIndexOrDataIndex;
}
GIM_BVH_TREE_NODE() GIM_BVH_TREE_NODE()
{ {
m_escapeIndexOrDataIndex = 0; m_escapeIndexOrDataIndex = 0;