Home
last modified time | relevance | path

Searched refs:aabbMax1 (Results 1 – 25 of 62) sorted by relevance

123

/dports/games/critterding/critterding-beta12/src/utils/bullet/BulletMultiThreaded/SpuNarrowPhaseCollisionTask/
H A DSpuCollisionShapes.h96 …bbAgainstQuantizedAabb(unsigned short int* aabbMin1,unsigned short int* aabbMax1,const unsigned sh… in spuTestQuantizedAabbAgainstQuantizedAabb() argument
100 vec_ushort8 vecMax = {aabbMax2[0],aabbMax1[0],aabbMax2[2],aabbMax1[2],aabbMax2[1],aabbMax1[1],0,0}; in spuTestQuantizedAabbAgainstQuantizedAabb()
105 return btSelect((unsigned)((aabbMin1[0] <= aabbMax2[0]) & (aabbMax1[0] >= aabbMin2[0]) in spuTestQuantizedAabbAgainstQuantizedAabb()
106 & (aabbMin1[2] <= aabbMax2[2]) & (aabbMax1[2] >= aabbMin2[2]) in spuTestQuantizedAabbAgainstQuantizedAabb()
107 & (aabbMin1[1] <= aabbMax2[1]) & (aabbMax1[1] >= aabbMin2[1])), in spuTestQuantizedAabbAgainstQuantizedAabb()
113 …ntizedAabb(const unsigned short int* aabbMin1,const unsigned short int* aabbMax1,const unsigned sh… in spuTestQuantizedAabbAgainstQuantizedAabb() argument
116 overlap = (aabbMin1[0] > aabbMax2[0] || aabbMax1[0] < aabbMin2[0]) ? 0 : overlap; in spuTestQuantizedAabbAgainstQuantizedAabb()
117 overlap = (aabbMin1[2] > aabbMax2[2] || aabbMax1[2] < aabbMin2[2]) ? 0 : overlap; in spuTestQuantizedAabbAgainstQuantizedAabb()
118 overlap = (aabbMin1[1] > aabbMax2[1] || aabbMax1[1] < aabbMin2[1]) ? 0 : overlap; in spuTestQuantizedAabbAgainstQuantizedAabb()
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/bullet/src/BulletMultiThreaded/SpuNarrowPhaseCollisionTask/
H A DSpuCollisionShapes.h99 …bbAgainstQuantizedAabb(unsigned short int* aabbMin1,unsigned short int* aabbMax1,const unsigned sh… in spuTestQuantizedAabbAgainstQuantizedAabb() argument
103 vec_ushort8 vecMax = {aabbMax2[0],aabbMax1[0],aabbMax2[2],aabbMax1[2],aabbMax2[1],aabbMax1[1],0,0}; in spuTestQuantizedAabbAgainstQuantizedAabb()
108 return btSelect((unsigned)((aabbMin1[0] <= aabbMax2[0]) & (aabbMax1[0] >= aabbMin2[0]) in spuTestQuantizedAabbAgainstQuantizedAabb()
109 & (aabbMin1[2] <= aabbMax2[2]) & (aabbMax1[2] >= aabbMin2[2]) in spuTestQuantizedAabbAgainstQuantizedAabb()
110 & (aabbMin1[1] <= aabbMax2[1]) & (aabbMax1[1] >= aabbMin2[1])), in spuTestQuantizedAabbAgainstQuantizedAabb()
116 …ntizedAabb(const unsigned short int* aabbMin1,const unsigned short int* aabbMax1,const unsigned sh… in spuTestQuantizedAabbAgainstQuantizedAabb() argument
119 overlap = (aabbMin1[0] > aabbMax2[0] || aabbMax1[0] < aabbMin2[0]) ? 0 : overlap; in spuTestQuantizedAabbAgainstQuantizedAabb()
120 overlap = (aabbMin1[2] > aabbMax2[2] || aabbMax1[2] < aabbMin2[2]) ? 0 : overlap; in spuTestQuantizedAabbAgainstQuantizedAabb()
121 overlap = (aabbMin1[1] > aabbMax2[1] || aabbMax1[1] < aabbMin2[1]) ? 0 : overlap; in spuTestQuantizedAabbAgainstQuantizedAabb()
/dports/devel/py-bullet3/bullet3-3.21/src/Bullet3Geometry/
H A Db3AabbUtil.h32 B3_FORCE_INLINE bool b3TestPointAgainstAabb2(const b3Vector3& aabbMin1, const b3Vector3& aabbMax1, in b3TestPointAgainstAabb2() argument
36 overlap = (aabbMin1.getX() > point.getX() || aabbMax1.getX() < point.getX()) ? false : overlap; in b3TestPointAgainstAabb2()
37 overlap = (aabbMin1.getZ() > point.getZ() || aabbMax1.getZ() < point.getZ()) ? false : overlap; in b3TestPointAgainstAabb2()
38 overlap = (aabbMin1.getY() > point.getY() || aabbMax1.getY() < point.getY()) ? false : overlap; in b3TestPointAgainstAabb2()
43 B3_FORCE_INLINE bool b3TestAabbAgainstAabb2(const b3Vector3& aabbMin1, const b3Vector3& aabbMax1, in b3TestAabbAgainstAabb2() argument
47 …overlap = (aabbMin1.getX() > aabbMax2.getX() || aabbMax1.getX() < aabbMin2.getX()) ? false : overl… in b3TestAabbAgainstAabb2()
48 …overlap = (aabbMin1.getZ() > aabbMax2.getZ() || aabbMax1.getZ() < aabbMin2.getZ()) ? false : overl… in b3TestAabbAgainstAabb2()
203 …x2[0]) & (aabbMax1[0] >= aabbMin2[0]) & (aabbMin1[2] <= aabbMax2[2]) & (aabbMax1[2] >= aabbMin2[2]… in b3TestQuantizedAabbAgainstQuantizedAabb()
210 overlap = (aabbMin1[0] > aabbMax2[0] || aabbMax1[0] < aabbMin2[0]) ? false : overlap; in b3TestQuantizedAabbAgainstQuantizedAabb()
211 overlap = (aabbMin1[2] > aabbMax2[2] || aabbMax1[2] < aabbMin2[2]) ? false : overlap; in b3TestQuantizedAabbAgainstQuantizedAabb()
[all …]
/dports/devel/godot/godot-3.2.3-stable/thirdparty/bullet/Bullet3Geometry/
H A Db3AabbUtil.h32 B3_FORCE_INLINE bool b3TestPointAgainstAabb2(const b3Vector3& aabbMin1, const b3Vector3& aabbMax1, in b3TestPointAgainstAabb2() argument
36 overlap = (aabbMin1.getX() > point.getX() || aabbMax1.getX() < point.getX()) ? false : overlap; in b3TestPointAgainstAabb2()
37 overlap = (aabbMin1.getZ() > point.getZ() || aabbMax1.getZ() < point.getZ()) ? false : overlap; in b3TestPointAgainstAabb2()
38 overlap = (aabbMin1.getY() > point.getY() || aabbMax1.getY() < point.getY()) ? false : overlap; in b3TestPointAgainstAabb2()
43 B3_FORCE_INLINE bool b3TestAabbAgainstAabb2(const b3Vector3& aabbMin1, const b3Vector3& aabbMax1, in b3TestAabbAgainstAabb2() argument
47 …overlap = (aabbMin1.getX() > aabbMax2.getX() || aabbMax1.getX() < aabbMin2.getX()) ? false : overl… in b3TestAabbAgainstAabb2()
48 …overlap = (aabbMin1.getZ() > aabbMax2.getZ() || aabbMax1.getZ() < aabbMin2.getZ()) ? false : overl… in b3TestAabbAgainstAabb2()
203 …x2[0]) & (aabbMax1[0] >= aabbMin2[0]) & (aabbMin1[2] <= aabbMax2[2]) & (aabbMax1[2] >= aabbMin2[2]… in b3TestQuantizedAabbAgainstQuantizedAabb()
210 overlap = (aabbMin1[0] > aabbMax2[0] || aabbMax1[0] < aabbMin2[0]) ? false : overlap; in b3TestQuantizedAabbAgainstQuantizedAabb()
211 overlap = (aabbMin1[2] > aabbMax2[2] || aabbMax1[2] < aabbMin2[2]) ? false : overlap; in b3TestQuantizedAabbAgainstQuantizedAabb()
[all …]
/dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/bullet/Bullet3Geometry/
H A Db3AabbUtil.h32 B3_FORCE_INLINE bool b3TestPointAgainstAabb2(const b3Vector3& aabbMin1, const b3Vector3& aabbMax1, in b3TestPointAgainstAabb2() argument
36 overlap = (aabbMin1.getX() > point.getX() || aabbMax1.getX() < point.getX()) ? false : overlap; in b3TestPointAgainstAabb2()
37 overlap = (aabbMin1.getZ() > point.getZ() || aabbMax1.getZ() < point.getZ()) ? false : overlap; in b3TestPointAgainstAabb2()
38 overlap = (aabbMin1.getY() > point.getY() || aabbMax1.getY() < point.getY()) ? false : overlap; in b3TestPointAgainstAabb2()
43 B3_FORCE_INLINE bool b3TestAabbAgainstAabb2(const b3Vector3& aabbMin1, const b3Vector3& aabbMax1, in b3TestAabbAgainstAabb2() argument
47 …overlap = (aabbMin1.getX() > aabbMax2.getX() || aabbMax1.getX() < aabbMin2.getX()) ? false : overl… in b3TestAabbAgainstAabb2()
48 …overlap = (aabbMin1.getZ() > aabbMax2.getZ() || aabbMax1.getZ() < aabbMin2.getZ()) ? false : overl… in b3TestAabbAgainstAabb2()
203 …x2[0]) & (aabbMax1[0] >= aabbMin2[0]) & (aabbMin1[2] <= aabbMax2[2]) & (aabbMax1[2] >= aabbMin2[2]… in b3TestQuantizedAabbAgainstQuantizedAabb()
210 overlap = (aabbMin1[0] > aabbMax2[0] || aabbMax1[0] < aabbMin2[0]) ? false : overlap; in b3TestQuantizedAabbAgainstQuantizedAabb()
211 overlap = (aabbMin1[2] > aabbMax2[2] || aabbMax1[2] < aabbMin2[2]) ? false : overlap; in b3TestQuantizedAabbAgainstQuantizedAabb()
[all …]
/dports/devel/bullet/bullet3-3.21/src/Bullet3Geometry/
H A Db3AabbUtil.h32 B3_FORCE_INLINE bool b3TestPointAgainstAabb2(const b3Vector3& aabbMin1, const b3Vector3& aabbMax1, in b3TestPointAgainstAabb2() argument
36 overlap = (aabbMin1.getX() > point.getX() || aabbMax1.getX() < point.getX()) ? false : overlap; in b3TestPointAgainstAabb2()
37 overlap = (aabbMin1.getZ() > point.getZ() || aabbMax1.getZ() < point.getZ()) ? false : overlap; in b3TestPointAgainstAabb2()
38 overlap = (aabbMin1.getY() > point.getY() || aabbMax1.getY() < point.getY()) ? false : overlap; in b3TestPointAgainstAabb2()
43 B3_FORCE_INLINE bool b3TestAabbAgainstAabb2(const b3Vector3& aabbMin1, const b3Vector3& aabbMax1, in b3TestAabbAgainstAabb2() argument
47 …overlap = (aabbMin1.getX() > aabbMax2.getX() || aabbMax1.getX() < aabbMin2.getX()) ? false : overl… in b3TestAabbAgainstAabb2()
48 …overlap = (aabbMin1.getZ() > aabbMax2.getZ() || aabbMax1.getZ() < aabbMin2.getZ()) ? false : overl… in b3TestAabbAgainstAabb2()
203 …x2[0]) & (aabbMax1[0] >= aabbMin2[0]) & (aabbMin1[2] <= aabbMax2[2]) & (aabbMax1[2] >= aabbMin2[2]… in b3TestQuantizedAabbAgainstQuantizedAabb()
210 overlap = (aabbMin1[0] > aabbMax2[0] || aabbMax1[0] < aabbMin2[0]) ? false : overlap; in b3TestQuantizedAabbAgainstQuantizedAabb()
211 overlap = (aabbMin1[2] > aabbMax2[2] || aabbMax1[2] < aabbMin2[2]) ? false : overlap; in b3TestQuantizedAabbAgainstQuantizedAabb()
[all …]
/dports/devel/bullet/bullet3-3.21/src/LinearMath/
H A DbtAabbUtil2.h32 SIMD_FORCE_INLINE bool TestPointAgainstAabb2(const btVector3& aabbMin1, const btVector3& aabbMax1, in TestPointAgainstAabb2() argument
36 overlap = (aabbMin1.getX() > point.getX() || aabbMax1.getX() < point.getX()) ? false : overlap; in TestPointAgainstAabb2()
37 overlap = (aabbMin1.getZ() > point.getZ() || aabbMax1.getZ() < point.getZ()) ? false : overlap; in TestPointAgainstAabb2()
38 overlap = (aabbMin1.getY() > point.getY() || aabbMax1.getY() < point.getY()) ? false : overlap; in TestPointAgainstAabb2()
43 SIMD_FORCE_INLINE bool TestAabbAgainstAabb2(const btVector3& aabbMin1, const btVector3& aabbMax1, in TestAabbAgainstAabb2() argument
47 …overlap = (aabbMin1.getX() > aabbMax2.getX() || aabbMax1.getX() < aabbMin2.getX()) ? false : overl… in TestAabbAgainstAabb2()
48 …overlap = (aabbMin1.getZ() > aabbMax2.getZ() || aabbMax1.getZ() < aabbMin2.getZ()) ? false : overl… in TestAabbAgainstAabb2()
203 …x2[0]) & (aabbMax1[0] >= aabbMin2[0]) & (aabbMin1[2] <= aabbMax2[2]) & (aabbMax1[2] >= aabbMin2[2]… in testQuantizedAabbAgainstQuantizedAabb()
210 overlap = (aabbMin1[0] > aabbMax2[0] || aabbMax1[0] < aabbMin2[0]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
211 overlap = (aabbMin1[2] > aabbMax2[2] || aabbMax1[2] < aabbMin2[2]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
[all …]
/dports/graphics/blender/blender-2.91.0/extern/bullet2/src/LinearMath/
H A DbtAabbUtil2.h32 SIMD_FORCE_INLINE bool TestPointAgainstAabb2(const btVector3& aabbMin1, const btVector3& aabbMax1, in TestPointAgainstAabb2() argument
36 overlap = (aabbMin1.getX() > point.getX() || aabbMax1.getX() < point.getX()) ? false : overlap; in TestPointAgainstAabb2()
37 overlap = (aabbMin1.getZ() > point.getZ() || aabbMax1.getZ() < point.getZ()) ? false : overlap; in TestPointAgainstAabb2()
38 overlap = (aabbMin1.getY() > point.getY() || aabbMax1.getY() < point.getY()) ? false : overlap; in TestPointAgainstAabb2()
43 SIMD_FORCE_INLINE bool TestAabbAgainstAabb2(const btVector3& aabbMin1, const btVector3& aabbMax1, in TestAabbAgainstAabb2() argument
47 …overlap = (aabbMin1.getX() > aabbMax2.getX() || aabbMax1.getX() < aabbMin2.getX()) ? false : overl… in TestAabbAgainstAabb2()
48 …overlap = (aabbMin1.getZ() > aabbMax2.getZ() || aabbMax1.getZ() < aabbMin2.getZ()) ? false : overl… in TestAabbAgainstAabb2()
203 …x2[0]) & (aabbMax1[0] >= aabbMin2[0]) & (aabbMin1[2] <= aabbMax2[2]) & (aabbMax1[2] >= aabbMin2[2]… in testQuantizedAabbAgainstQuantizedAabb()
210 overlap = (aabbMin1[0] > aabbMax2[0] || aabbMax1[0] < aabbMin2[0]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
211 overlap = (aabbMin1[2] > aabbMax2[2] || aabbMax1[2] < aabbMin2[2]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
[all …]
/dports/games/supertuxkart/SuperTuxKart-1.2-src/lib/bullet/src/LinearMath/
H A DbtAabbUtil2.h36 SIMD_FORCE_INLINE bool TestPointAgainstAabb2(const btVector3 &aabbMin1, const btVector3 &aabbMax1, in TestPointAgainstAabb2() argument
40 overlap = (aabbMin1.getX() > point.getX() || aabbMax1.getX() < point.getX()) ? false : overlap; in TestPointAgainstAabb2()
41 overlap = (aabbMin1.getZ() > point.getZ() || aabbMax1.getZ() < point.getZ()) ? false : overlap; in TestPointAgainstAabb2()
42 overlap = (aabbMin1.getY() > point.getY() || aabbMax1.getY() < point.getY()) ? false : overlap; in TestPointAgainstAabb2()
48 SIMD_FORCE_INLINE bool TestAabbAgainstAabb2(const btVector3 &aabbMin1, const btVector3 &aabbMax1, in TestAabbAgainstAabb2() argument
52 …overlap = (aabbMin1.getX() > aabbMax2.getX() || aabbMax1.getX() < aabbMin2.getX()) ? false : overl… in TestAabbAgainstAabb2()
219 & (aabbMin1[2] <= aabbMax2[2]) & (aabbMax1[2] >= aabbMin2[2]) in testQuantizedAabbAgainstQuantizedAabb()
220 & (aabbMin1[1] <= aabbMax2[1]) & (aabbMax1[1] >= aabbMin2[1])), in testQuantizedAabbAgainstQuantizedAabb()
227 overlap = (aabbMin1[0] > aabbMax2[0] || aabbMax1[0] < aabbMin2[0]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
228 overlap = (aabbMin1[2] > aabbMax2[2] || aabbMax1[2] < aabbMin2[2]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
[all …]
/dports/games/critterding/critterding-beta12/src/utils/bullet/LinearMath/
H A DbtAabbUtil2.h36 SIMD_FORCE_INLINE bool TestPointAgainstAabb2(const btVector3 &aabbMin1, const btVector3 &aabbMax1, in TestPointAgainstAabb2() argument
40 overlap = (aabbMin1.getX() > point.getX() || aabbMax1.getX() < point.getX()) ? false : overlap; in TestPointAgainstAabb2()
41 overlap = (aabbMin1.getZ() > point.getZ() || aabbMax1.getZ() < point.getZ()) ? false : overlap; in TestPointAgainstAabb2()
42 overlap = (aabbMin1.getY() > point.getY() || aabbMax1.getY() < point.getY()) ? false : overlap; in TestPointAgainstAabb2()
48 SIMD_FORCE_INLINE bool TestAabbAgainstAabb2(const btVector3 &aabbMin1, const btVector3 &aabbMax1, in TestAabbAgainstAabb2() argument
52 …overlap = (aabbMin1.getX() > aabbMax2.getX() || aabbMax1.getX() < aabbMin2.getX()) ? false : overl… in TestAabbAgainstAabb2()
219 & (aabbMin1[2] <= aabbMax2[2]) & (aabbMax1[2] >= aabbMin2[2]) in testQuantizedAabbAgainstQuantizedAabb()
220 & (aabbMin1[1] <= aabbMax2[1]) & (aabbMax1[1] >= aabbMin2[1])), in testQuantizedAabbAgainstQuantizedAabb()
227 overlap = (aabbMin1[0] > aabbMax2[0] || aabbMax1[0] < aabbMin2[0]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
228 overlap = (aabbMin1[2] > aabbMax2[2] || aabbMax1[2] < aabbMin2[2]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
[all …]
/dports/devel/godot/godot-3.2.3-stable/thirdparty/bullet/LinearMath/
H A DbtAabbUtil2.h32 SIMD_FORCE_INLINE bool TestPointAgainstAabb2(const btVector3& aabbMin1, const btVector3& aabbMax1, in TestPointAgainstAabb2() argument
36 overlap = (aabbMin1.getX() > point.getX() || aabbMax1.getX() < point.getX()) ? false : overlap; in TestPointAgainstAabb2()
37 overlap = (aabbMin1.getZ() > point.getZ() || aabbMax1.getZ() < point.getZ()) ? false : overlap; in TestPointAgainstAabb2()
38 overlap = (aabbMin1.getY() > point.getY() || aabbMax1.getY() < point.getY()) ? false : overlap; in TestPointAgainstAabb2()
43 SIMD_FORCE_INLINE bool TestAabbAgainstAabb2(const btVector3& aabbMin1, const btVector3& aabbMax1, in TestAabbAgainstAabb2() argument
47 …overlap = (aabbMin1.getX() > aabbMax2.getX() || aabbMax1.getX() < aabbMin2.getX()) ? false : overl… in TestAabbAgainstAabb2()
48 …overlap = (aabbMin1.getZ() > aabbMax2.getZ() || aabbMax1.getZ() < aabbMin2.getZ()) ? false : overl… in TestAabbAgainstAabb2()
203 …x2[0]) & (aabbMax1[0] >= aabbMin2[0]) & (aabbMin1[2] <= aabbMax2[2]) & (aabbMax1[2] >= aabbMin2[2]… in testQuantizedAabbAgainstQuantizedAabb()
210 overlap = (aabbMin1[0] > aabbMax2[0] || aabbMax1[0] < aabbMin2[0]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
211 overlap = (aabbMin1[2] > aabbMax2[2] || aabbMax1[2] < aabbMin2[2]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
[all …]
/dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/bullet/LinearMath/
H A DbtAabbUtil2.h32 SIMD_FORCE_INLINE bool TestPointAgainstAabb2(const btVector3& aabbMin1, const btVector3& aabbMax1, in TestPointAgainstAabb2() argument
36 overlap = (aabbMin1.getX() > point.getX() || aabbMax1.getX() < point.getX()) ? false : overlap; in TestPointAgainstAabb2()
37 overlap = (aabbMin1.getZ() > point.getZ() || aabbMax1.getZ() < point.getZ()) ? false : overlap; in TestPointAgainstAabb2()
38 overlap = (aabbMin1.getY() > point.getY() || aabbMax1.getY() < point.getY()) ? false : overlap; in TestPointAgainstAabb2()
43 SIMD_FORCE_INLINE bool TestAabbAgainstAabb2(const btVector3& aabbMin1, const btVector3& aabbMax1, in TestAabbAgainstAabb2() argument
47 …overlap = (aabbMin1.getX() > aabbMax2.getX() || aabbMax1.getX() < aabbMin2.getX()) ? false : overl… in TestAabbAgainstAabb2()
48 …overlap = (aabbMin1.getZ() > aabbMax2.getZ() || aabbMax1.getZ() < aabbMin2.getZ()) ? false : overl… in TestAabbAgainstAabb2()
203 …x2[0]) & (aabbMax1[0] >= aabbMin2[0]) & (aabbMin1[2] <= aabbMax2[2]) & (aabbMax1[2] >= aabbMin2[2]… in testQuantizedAabbAgainstQuantizedAabb()
210 overlap = (aabbMin1[0] > aabbMax2[0] || aabbMax1[0] < aabbMin2[0]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
211 overlap = (aabbMin1[2] > aabbMax2[2] || aabbMax1[2] < aabbMin2[2]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
[all …]
/dports/science/chrono/chrono-7.0.1/src/chrono/collision/bullet/LinearMath/
H A DbtAabbUtil2.h32 SIMD_FORCE_INLINE bool TestPointAgainstAabb2(const btVector3& aabbMin1, const btVector3& aabbMax1, in TestPointAgainstAabb2() argument
36 overlap = (aabbMin1.getX() > point.getX() || aabbMax1.getX() < point.getX()) ? false : overlap; in TestPointAgainstAabb2()
37 overlap = (aabbMin1.getZ() > point.getZ() || aabbMax1.getZ() < point.getZ()) ? false : overlap; in TestPointAgainstAabb2()
38 overlap = (aabbMin1.getY() > point.getY() || aabbMax1.getY() < point.getY()) ? false : overlap; in TestPointAgainstAabb2()
43 SIMD_FORCE_INLINE bool TestAabbAgainstAabb2(const btVector3& aabbMin1, const btVector3& aabbMax1, in TestAabbAgainstAabb2() argument
47 …overlap = (aabbMin1.getX() > aabbMax2.getX() || aabbMax1.getX() < aabbMin2.getX()) ? false : overl… in TestAabbAgainstAabb2()
48 …overlap = (aabbMin1.getZ() > aabbMax2.getZ() || aabbMax1.getZ() < aabbMin2.getZ()) ? false : overl… in TestAabbAgainstAabb2()
203 …x2[0]) & (aabbMax1[0] >= aabbMin2[0]) & (aabbMin1[2] <= aabbMax2[2]) & (aabbMax1[2] >= aabbMin2[2]… in testQuantizedAabbAgainstQuantizedAabb()
210 overlap = (aabbMin1[0] > aabbMax2[0] || aabbMax1[0] < aabbMin2[0]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
211 overlap = (aabbMin1[2] > aabbMax2[2] || aabbMax1[2] < aabbMin2[2]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
[all …]
/dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/Bullet/src/LinearMath/
H A DbtAabbUtil2.h36 SIMD_FORCE_INLINE bool TestPointAgainstAabb2(const btVector3 &aabbMin1, const btVector3 &aabbMax1, in TestPointAgainstAabb2() argument
40 overlap = (aabbMin1.getX() > point.getX() || aabbMax1.getX() < point.getX()) ? false : overlap; in TestPointAgainstAabb2()
41 overlap = (aabbMin1.getZ() > point.getZ() || aabbMax1.getZ() < point.getZ()) ? false : overlap; in TestPointAgainstAabb2()
42 overlap = (aabbMin1.getY() > point.getY() || aabbMax1.getY() < point.getY()) ? false : overlap; in TestPointAgainstAabb2()
48 SIMD_FORCE_INLINE bool TestAabbAgainstAabb2(const btVector3 &aabbMin1, const btVector3 &aabbMax1, in TestAabbAgainstAabb2() argument
52 …overlap = (aabbMin1.getX() > aabbMax2.getX() || aabbMax1.getX() < aabbMin2.getX()) ? false : overl… in TestAabbAgainstAabb2()
215 & (aabbMin1[2] <= aabbMax2[2]) & (aabbMax1[2] >= aabbMin2[2]) in testQuantizedAabbAgainstQuantizedAabb()
216 & (aabbMin1[1] <= aabbMax2[1]) & (aabbMax1[1] >= aabbMin2[1])), in testQuantizedAabbAgainstQuantizedAabb()
223 overlap = (aabbMin1[0] > aabbMax2[0] || aabbMax1[0] < aabbMin2[0]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
224 overlap = (aabbMin1[2] > aabbMax2[2] || aabbMax1[2] < aabbMin2[2]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
[all …]
/dports/devel/py-bullet3/bullet3-3.21/src/LinearMath/
H A DbtAabbUtil2.h32 SIMD_FORCE_INLINE bool TestPointAgainstAabb2(const btVector3& aabbMin1, const btVector3& aabbMax1, in TestPointAgainstAabb2() argument
36 overlap = (aabbMin1.getX() > point.getX() || aabbMax1.getX() < point.getX()) ? false : overlap; in TestPointAgainstAabb2()
37 overlap = (aabbMin1.getZ() > point.getZ() || aabbMax1.getZ() < point.getZ()) ? false : overlap; in TestPointAgainstAabb2()
38 overlap = (aabbMin1.getY() > point.getY() || aabbMax1.getY() < point.getY()) ? false : overlap; in TestPointAgainstAabb2()
43 SIMD_FORCE_INLINE bool TestAabbAgainstAabb2(const btVector3& aabbMin1, const btVector3& aabbMax1, in TestAabbAgainstAabb2() argument
47 …overlap = (aabbMin1.getX() > aabbMax2.getX() || aabbMax1.getX() < aabbMin2.getX()) ? false : overl… in TestAabbAgainstAabb2()
48 …overlap = (aabbMin1.getZ() > aabbMax2.getZ() || aabbMax1.getZ() < aabbMin2.getZ()) ? false : overl… in TestAabbAgainstAabb2()
203 …x2[0]) & (aabbMax1[0] >= aabbMin2[0]) & (aabbMin1[2] <= aabbMax2[2]) & (aabbMax1[2] >= aabbMin2[2]… in testQuantizedAabbAgainstQuantizedAabb()
210 overlap = (aabbMin1[0] > aabbMax2[0] || aabbMax1[0] < aabbMin2[0]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
211 overlap = (aabbMin1[2] > aabbMax2[2] || aabbMax1[2] < aabbMin2[2]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
[all …]
/dports/games/OpenTomb/OpenTomb-win32-2018-02-03_alpha/extern/bullet/LinearMath/
H A DbtAabbUtil2.h36 SIMD_FORCE_INLINE bool TestPointAgainstAabb2(const btVector3 &aabbMin1, const btVector3 &aabbMax1, in TestPointAgainstAabb2() argument
40 overlap = (aabbMin1.getX() > point.getX() || aabbMax1.getX() < point.getX()) ? false : overlap; in TestPointAgainstAabb2()
41 overlap = (aabbMin1.getZ() > point.getZ() || aabbMax1.getZ() < point.getZ()) ? false : overlap; in TestPointAgainstAabb2()
42 overlap = (aabbMin1.getY() > point.getY() || aabbMax1.getY() < point.getY()) ? false : overlap; in TestPointAgainstAabb2()
48 SIMD_FORCE_INLINE bool TestAabbAgainstAabb2(const btVector3 &aabbMin1, const btVector3 &aabbMax1, in TestAabbAgainstAabb2() argument
52 …overlap = (aabbMin1.getX() > aabbMax2.getX() || aabbMax1.getX() < aabbMin2.getX()) ? false : overl… in TestAabbAgainstAabb2()
215 & (aabbMin1[2] <= aabbMax2[2]) & (aabbMax1[2] >= aabbMin2[2]) in testQuantizedAabbAgainstQuantizedAabb()
216 & (aabbMin1[1] <= aabbMax2[1]) & (aabbMax1[1] >= aabbMin2[1])), in testQuantizedAabbAgainstQuantizedAabb()
223 overlap = (aabbMin1[0] > aabbMax2[0] || aabbMax1[0] < aabbMin2[0]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
224 overlap = (aabbMin1[2] > aabbMax2[2] || aabbMax1[2] < aabbMin2[2]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
[all …]
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/bullet/src/LinearMath/
H A DbtAabbUtil2.h36 SIMD_FORCE_INLINE bool TestPointAgainstAabb2(const btVector3 &aabbMin1, const btVector3 &aabbMax1, in TestPointAgainstAabb2() argument
40 overlap = (aabbMin1.getX() > point.getX() || aabbMax1.getX() < point.getX()) ? false : overlap; in TestPointAgainstAabb2()
41 overlap = (aabbMin1.getZ() > point.getZ() || aabbMax1.getZ() < point.getZ()) ? false : overlap; in TestPointAgainstAabb2()
42 overlap = (aabbMin1.getY() > point.getY() || aabbMax1.getY() < point.getY()) ? false : overlap; in TestPointAgainstAabb2()
48 SIMD_FORCE_INLINE bool TestAabbAgainstAabb2(const btVector3 &aabbMin1, const btVector3 &aabbMax1, in TestAabbAgainstAabb2() argument
52 …overlap = (aabbMin1.getX() > aabbMax2.getX() || aabbMax1.getX() < aabbMin2.getX()) ? false : overl… in TestAabbAgainstAabb2()
219 & (aabbMin1[2] <= aabbMax2[2]) & (aabbMax1[2] >= aabbMin2[2]) in testQuantizedAabbAgainstQuantizedAabb()
220 & (aabbMin1[1] <= aabbMax2[1]) & (aabbMax1[1] >= aabbMin2[1])), in testQuantizedAabbAgainstQuantizedAabb()
227 overlap = (aabbMin1[0] > aabbMax2[0] || aabbMax1[0] < aabbMin2[0]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
228 overlap = (aabbMin1[2] > aabbMax2[2] || aabbMax1[2] < aabbMin2[2]) ? false : overlap; in testQuantizedAabbAgainstQuantizedAabb()
[all …]
/dports/devel/py-bullet3/bullet3-3.21/src/Bullet3Collision/NarrowPhaseCollision/shared/
H A Db3QuantizedBvhNodeData.h64 const unsigned short int* aabbMax1, in b3TestQuantizedAabbAgainstQuantizedAabbSlow() argument
71 if (aabbMax1[0] < aabbMin2[0]) in b3TestQuantizedAabbAgainstQuantizedAabbSlow()
75 if (aabbMax1[1] < aabbMin2[1]) in b3TestQuantizedAabbAgainstQuantizedAabbSlow()
79 if (aabbMax1[2] < aabbMin2[2]) in b3TestQuantizedAabbAgainstQuantizedAabbSlow()
/dports/devel/godot/godot-3.2.3-stable/thirdparty/bullet/Bullet3Collision/NarrowPhaseCollision/shared/
H A Db3QuantizedBvhNodeData.h64 const unsigned short int* aabbMax1, in b3TestQuantizedAabbAgainstQuantizedAabbSlow() argument
71 if (aabbMax1[0] < aabbMin2[0]) in b3TestQuantizedAabbAgainstQuantizedAabbSlow()
75 if (aabbMax1[1] < aabbMin2[1]) in b3TestQuantizedAabbAgainstQuantizedAabbSlow()
79 if (aabbMax1[2] < aabbMin2[2]) in b3TestQuantizedAabbAgainstQuantizedAabbSlow()
/dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/bullet/Bullet3Collision/NarrowPhaseCollision/shared/
H A Db3QuantizedBvhNodeData.h64 const unsigned short int* aabbMax1, in b3TestQuantizedAabbAgainstQuantizedAabbSlow() argument
71 if (aabbMax1[0] < aabbMin2[0]) in b3TestQuantizedAabbAgainstQuantizedAabbSlow()
75 if (aabbMax1[1] < aabbMin2[1]) in b3TestQuantizedAabbAgainstQuantizedAabbSlow()
79 if (aabbMax1[2] < aabbMin2[2]) in b3TestQuantizedAabbAgainstQuantizedAabbSlow()
/dports/devel/bullet/bullet3-3.21/src/Bullet3Collision/NarrowPhaseCollision/shared/
H A Db3QuantizedBvhNodeData.h64 const unsigned short int* aabbMax1, in b3TestQuantizedAabbAgainstQuantizedAabbSlow() argument
71 if (aabbMax1[0] < aabbMin2[0]) in b3TestQuantizedAabbAgainstQuantizedAabbSlow()
75 if (aabbMax1[1] < aabbMin2[1]) in b3TestQuantizedAabbAgainstQuantizedAabbSlow()
79 if (aabbMax1[2] < aabbMin2[2]) in b3TestQuantizedAabbAgainstQuantizedAabbSlow()
/dports/devel/bullet/bullet3-3.21/src/Bullet3Collision/BroadPhaseCollision/shared/
H A Db3Aabb.h46 inline bool b3TestAabbAgainstAabb(b3Float4ConstArg aabbMin1, b3Float4ConstArg aabbMax1, in b3TestAabbAgainstAabb() argument
50 overlap = (aabbMin1.x > aabbMax2.x || aabbMax1.x < aabbMin2.x) ? false : overlap; in b3TestAabbAgainstAabb()
51 overlap = (aabbMin1.z > aabbMax2.z || aabbMax1.z < aabbMin2.z) ? false : overlap; in b3TestAabbAgainstAabb()
52 overlap = (aabbMin1.y > aabbMax2.y || aabbMax1.y < aabbMin2.y) ? false : overlap; in b3TestAabbAgainstAabb()
/dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/bullet/Bullet3Collision/BroadPhaseCollision/shared/
H A Db3Aabb.h46 inline bool b3TestAabbAgainstAabb(b3Float4ConstArg aabbMin1, b3Float4ConstArg aabbMax1, in b3TestAabbAgainstAabb() argument
50 overlap = (aabbMin1.x > aabbMax2.x || aabbMax1.x < aabbMin2.x) ? false : overlap; in b3TestAabbAgainstAabb()
51 overlap = (aabbMin1.z > aabbMax2.z || aabbMax1.z < aabbMin2.z) ? false : overlap; in b3TestAabbAgainstAabb()
52 overlap = (aabbMin1.y > aabbMax2.y || aabbMax1.y < aabbMin2.y) ? false : overlap; in b3TestAabbAgainstAabb()
/dports/devel/py-bullet3/bullet3-3.21/src/Bullet3Collision/BroadPhaseCollision/shared/
H A Db3Aabb.h46 inline bool b3TestAabbAgainstAabb(b3Float4ConstArg aabbMin1, b3Float4ConstArg aabbMax1, in b3TestAabbAgainstAabb() argument
50 overlap = (aabbMin1.x > aabbMax2.x || aabbMax1.x < aabbMin2.x) ? false : overlap; in b3TestAabbAgainstAabb()
51 overlap = (aabbMin1.z > aabbMax2.z || aabbMax1.z < aabbMin2.z) ? false : overlap; in b3TestAabbAgainstAabb()
52 overlap = (aabbMin1.y > aabbMax2.y || aabbMax1.y < aabbMin2.y) ? false : overlap; in b3TestAabbAgainstAabb()
/dports/devel/godot/godot-3.2.3-stable/thirdparty/bullet/Bullet3Collision/BroadPhaseCollision/shared/
H A Db3Aabb.h46 inline bool b3TestAabbAgainstAabb(b3Float4ConstArg aabbMin1, b3Float4ConstArg aabbMax1, in b3TestAabbAgainstAabb() argument
50 overlap = (aabbMin1.x > aabbMax2.x || aabbMax1.x < aabbMin2.x) ? false : overlap; in b3TestAabbAgainstAabb()
51 overlap = (aabbMin1.z > aabbMax2.z || aabbMax1.z < aabbMin2.z) ? false : overlap; in b3TestAabbAgainstAabb()
52 overlap = (aabbMin1.y > aabbMax2.y || aabbMax1.y < aabbMin2.y) ? false : overlap; in b3TestAabbAgainstAabb()

123