/dports/graphics/pixie/Pixie/src/ri/ |
H A D | xform.cpp | 256 initv(vtmp,bmin[COMP_X],bmin[COMP_Y],bmin[COMP_Z]); in transformBound() 259 initv(vtmp,bmin[COMP_X],bmin[COMP_Y],bmax[COMP_Z]); in transformBound() 265 initv(vtmp,bmin[COMP_X],bmax[COMP_Y],bmin[COMP_Z]); in transformBound() 268 initv(vtmp,bmax[COMP_X],bmin[COMP_Y],bmin[COMP_Z]); in transformBound() 291 initv(vtmp,bmin[COMP_X],bmin[COMP_Y],bmin[COMP_Z]); in transformBound() 341 initv(vtmp,bmin[COMP_X],bmin[COMP_Y],bmin[COMP_Z]); in invTransformBound() 344 initv(vtmp,bmin[COMP_X],bmin[COMP_Y],bmax[COMP_Z]); in invTransformBound() 350 initv(vtmp,bmin[COMP_X],bmax[COMP_Y],bmin[COMP_Z]); in invTransformBound() 353 initv(vtmp,bmax[COMP_X],bmin[COMP_Y],bmin[COMP_Z]); in invTransformBound() 376 initv(vtmp,bmin[COMP_X],bmin[COMP_Y],bmin[COMP_Z]); in invTransformBound() [all …]
|
/dports/devel/bullet/bullet3-3.21/Extras/ConvexDecomposition/ |
H A D | splitplane.cpp | 99 mMin[0] = bmin[0]; in Rect3d() 100 mMin[1] = bmin[1]; in Rect3d() 101 mMin[2] = bmin[2]; in Rect3d() 110 mMin[0] = bmin[0]; in SetMin() 111 mMin[1] = bmin[1]; in SetMin() 112 mMin[2] = bmin[2]; in SetMin() 189 if (p[0] < bmin[0]) bmin[0] = p[0]; in computeSplitPlane() 190 if (p[1] < bmin[1]) bmin[1] = p[1]; in computeSplitPlane() 191 if (p[2] < bmin[2]) bmin[2] = p[2]; in computeSplitPlane() 238 p2[1] = bmin[1]; in computeSplitPlane() [all …]
|
H A D | bestfitobb.cpp | 51 float bmin[3] = {1e9, 1e9, 1e9}; in computeOBB() local 61 if (t[0] < bmin[0]) bmin[0] = t[0]; in computeOBB() 62 if (t[1] < bmin[1]) bmin[1] = t[1]; in computeOBB() 63 if (t[2] < bmin[2]) bmin[2] = t[2]; in computeOBB() 76 if (fabsf(bmin[0]) > sides[0]) sides[0] = fabsf(bmin[0]); in computeOBB() 77 if (fabsf(bmin[1]) > sides[1]) sides[1] = fabsf(bmin[1]); in computeOBB() 78 if (fabsf(bmin[2]) > sides[2]) sides[2] = fabsf(bmin[2]); in computeOBB() 87 float bmin[3]; in computeBestFitOBB() local 94 center[0] = (bmax[0] - bmin[0]) * 0.5f + bmin[0]; in computeBestFitOBB() 95 center[1] = (bmax[1] - bmin[1]) * 0.5f + bmin[1]; in computeBestFitOBB() [all …]
|
/dports/science/chrono/chrono-7.0.1/src/chrono/collision/gimpact/ConvexDecomposition/ |
H A D | splitplane.cpp | 105 mMin[0] = bmin[0]; in Rect3d() 106 mMin[1] = bmin[1]; in Rect3d() 107 mMin[2] = bmin[2]; in Rect3d() 117 mMin[0] = bmin[0]; in SetMin() 118 mMin[1] = bmin[1]; in SetMin() 119 mMin[2] = bmin[2]; in SetMin() 196 if ( p[0] < bmin[0] ) bmin[0] = p[0]; in computeSplitPlane() 197 if ( p[1] < bmin[1] ) bmin[1] = p[1]; in computeSplitPlane() 198 if ( p[2] < bmin[2] ) bmin[2] = p[2]; in computeSplitPlane() 235 Rect3d b(bmin,bmax); in computeSplitPlane() [all …]
|
H A D | bestfitobb.cpp | 51 float bmin[3] = { 1e9, 1e9, 1e9 }; in computeOBB() local 61 if ( t[0] < bmin[0] ) bmin[0] = t[0]; in computeOBB() 62 if ( t[1] < bmin[1] ) bmin[1] = t[1]; in computeOBB() 63 if ( t[2] < bmin[2] ) bmin[2] = t[2]; in computeOBB() 77 if ( fabsf(bmin[0]) > sides[0] ) sides[0] = fabsf(bmin[0]); in computeOBB() 78 if ( fabsf(bmin[1]) > sides[1] ) sides[1] = fabsf(bmin[1]); in computeOBB() 79 if ( fabsf(bmin[2]) > sides[2] ) sides[2] = fabsf(bmin[2]); in computeOBB() 90 float bmin[3]; in computeBestFitOBB() local 97 center[0] = (bmax[0]-bmin[0])*0.5f + bmin[0]; in computeBestFitOBB() 98 center[1] = (bmax[1]-bmin[1])*0.5f + bmin[1]; in computeBestFitOBB() [all …]
|
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/bullet/Extras/ConvexDecomposition/ |
H A D | splitplane.cpp | 105 mMin[0] = bmin[0]; in Rect3d() 106 mMin[1] = bmin[1]; in Rect3d() 107 mMin[2] = bmin[2]; in Rect3d() 117 mMin[0] = bmin[0]; in SetMin() 118 mMin[1] = bmin[1]; in SetMin() 119 mMin[2] = bmin[2]; in SetMin() 196 if ( p[0] < bmin[0] ) bmin[0] = p[0]; in computeSplitPlane() 197 if ( p[1] < bmin[1] ) bmin[1] = p[1]; in computeSplitPlane() 198 if ( p[2] < bmin[2] ) bmin[2] = p[2]; in computeSplitPlane() 235 Rect3d b(bmin,bmax); in computeSplitPlane() [all …]
|
H A D | bestfitobb.cpp | 51 float bmin[3] = { 1e9, 1e9, 1e9 }; in computeOBB() local 61 if ( t[0] < bmin[0] ) bmin[0] = t[0]; in computeOBB() 62 if ( t[1] < bmin[1] ) bmin[1] = t[1]; in computeOBB() 63 if ( t[2] < bmin[2] ) bmin[2] = t[2]; in computeOBB() 77 if ( fabsf(bmin[0]) > sides[0] ) sides[0] = fabsf(bmin[0]); in computeOBB() 78 if ( fabsf(bmin[1]) > sides[1] ) sides[1] = fabsf(bmin[1]); in computeOBB() 79 if ( fabsf(bmin[2]) > sides[2] ) sides[2] = fabsf(bmin[2]); in computeOBB() 90 float bmin[3]; in computeBestFitOBB() local 97 center[0] = (bmax[0]-bmin[0])*0.5f + bmin[0]; in computeBestFitOBB() 98 center[1] = (bmax[1]-bmin[1])*0.5f + bmin[1]; in computeBestFitOBB() [all …]
|
/dports/devel/py-bullet3/bullet3-3.21/Extras/ConvexDecomposition/ |
H A D | splitplane.cpp | 99 mMin[0] = bmin[0]; in Rect3d() 100 mMin[1] = bmin[1]; in Rect3d() 101 mMin[2] = bmin[2]; in Rect3d() 110 mMin[0] = bmin[0]; in SetMin() 111 mMin[1] = bmin[1]; in SetMin() 112 mMin[2] = bmin[2]; in SetMin() 189 if (p[0] < bmin[0]) bmin[0] = p[0]; in computeSplitPlane() 190 if (p[1] < bmin[1]) bmin[1] = p[1]; in computeSplitPlane() 191 if (p[2] < bmin[2]) bmin[2] = p[2]; in computeSplitPlane() 238 p2[1] = bmin[1]; in computeSplitPlane() [all …]
|
H A D | bestfitobb.cpp | 51 float bmin[3] = {1e9, 1e9, 1e9}; in computeOBB() local 61 if (t[0] < bmin[0]) bmin[0] = t[0]; in computeOBB() 62 if (t[1] < bmin[1]) bmin[1] = t[1]; in computeOBB() 63 if (t[2] < bmin[2]) bmin[2] = t[2]; in computeOBB() 76 if (fabsf(bmin[0]) > sides[0]) sides[0] = fabsf(bmin[0]); in computeOBB() 77 if (fabsf(bmin[1]) > sides[1]) sides[1] = fabsf(bmin[1]); in computeOBB() 78 if (fabsf(bmin[2]) > sides[2]) sides[2] = fabsf(bmin[2]); in computeOBB() 87 float bmin[3]; in computeBestFitOBB() local 94 center[0] = (bmax[0] - bmin[0]) * 0.5f + bmin[0]; in computeBestFitOBB() 95 center[1] = (bmax[1] - bmin[1]) * 0.5f + bmin[1]; in computeBestFitOBB() [all …]
|
/dports/graphics/recastnavigation/recastnavigation-e75adf86f91eb3082220085e42dda62679f9a3ea/RecastDemo/Source/ |
H A D | ChunkyTriMesh.cpp | 26 float bmin[2]; member 35 if (a->bmin[0] < b->bmin[0]) in compareItemX() 37 if (a->bmin[0] > b->bmin[0]) in compareItemX() 46 if (a->bmin[1] < b->bmin[1]) in compareItemY() 48 if (a->bmin[1] > b->bmin[1]) in compareItemY() 57 bmin[0] = items[imin].bmin[0]; in calcExtends() 58 bmin[1] = items[imin].bmin[1]; in calcExtends() 66 if (it.bmin[0] < bmin[0]) bmin[0] = it.bmin[0]; in calcExtends() 67 if (it.bmin[1] < bmin[1]) bmin[1] = it.bmin[1]; in calcExtends() 173 if (v[0] < it.bmin[0]) it.bmin[0] = v[0]; in rcCreateChunkyTriMesh() [all …]
|
/dports/graphics/recastnavigation/recastnavigation-e75adf86f91eb3082220085e42dda62679f9a3ea/Detour/Source/ |
H A D | DetourNavMeshBuilder.cpp | 44 if (a->bmin[0] < b->bmin[0]) in compareItemX() 46 if (a->bmin[0] > b->bmin[0]) in compareItemX() 55 if (a->bmin[1] < b->bmin[1]) in compareItemY() 57 if (a->bmin[1] > b->bmin[1]) in compareItemY() 66 if (a->bmin[2] < b->bmin[2]) in compareItemZ() 68 if (a->bmin[2] > b->bmin[2]) in compareItemZ() 76 bmin[0] = items[imin].bmin[0]; in calcExtends() 77 bmin[1] = items[imin].bmin[1]; in calcExtends() 87 if (it.bmin[0] < bmin[0]) bmin[0] = it.bmin[0]; in calcExtends() 88 if (it.bmin[1] < bmin[1]) bmin[1] = it.bmin[1]; in calcExtends() [all …]
|
/dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/Detour/source/ |
H A D | DetourNavMeshBuilder.cpp | 44 if (a->bmin[0] < b->bmin[0]) in compareItemX() 46 if (a->bmin[0] > b->bmin[0]) in compareItemX() 55 if (a->bmin[1] < b->bmin[1]) in compareItemY() 57 if (a->bmin[1] > b->bmin[1]) in compareItemY() 66 if (a->bmin[2] < b->bmin[2]) in compareItemZ() 68 if (a->bmin[2] > b->bmin[2]) in compareItemZ() 76 bmin[0] = items[imin].bmin[0]; in calcExtends() 77 bmin[1] = items[imin].bmin[1]; in calcExtends() 87 if (it.bmin[0] < bmin[0]) bmin[0] = it.bmin[0]; in calcExtends() 88 if (it.bmin[1] < bmin[1]) bmin[1] = it.bmin[1]; in calcExtends() [all …]
|
/dports/math/moab/fathomteam-moab-7bde9dfb84a8/pymoab/tests/ |
H A D | test_scd.py | 106 bmin = box.box_min() 107 CHECK_EQ(bmin.i(),imin) 108 CHECK_EQ(bmin.j(),jmin) 109 CHECK_EQ(bmin.k(),kmin) 122 bmin = box.box_min() 128 for i in range(bmin[0],bmax[0]): 129 for j in range(bmin[1],bmax[1]): 132 …this_vert = start_vert + (i-bmin[0]) + (j-bmin[1])*(bmax[0]-bmin[0]+1) + (k-bmin[2])*(bmax[1]-bmin… 145 for i in range(bmin[0],bmax[0]-1): 146 for j in range(bmin[1],bmax[1]-1): [all …]
|
/dports/databases/percona56-client/percona-server-5.6.51-91.0/storage/myisam/ |
H A D | rt_mbr.c | 30 #define INTERSECT_CMP(amin, amax, bmin, bmax) ((amin > bmax) || (bmin > amax)) argument 31 #define CONTAIN_CMP(amin, amax, bmin, bmax) ((bmin > amin) || (bmax < amax)) argument 32 #define WITHIN_CMP(amin, amax, bmin, bmax) ((amin > bmin) || (amax < bmax)) argument 33 #define DISJOINT_CMP(amin, amax, bmin, bmax) ((amin <= bmax) && (bmin <= amax)) argument 34 #define EQUAL_CMP(amin, amax, bmin, bmax) ((amin != bmin) || (amax != bmax)) argument 74 bmin = korr_func(b); \ 84 get_func(bmin, b); \ 345 get_func(bmin, b); \ 438 get_func(bmin, b); \ 708 amin = bmin; \ [all …]
|
/dports/databases/percona56-server/percona-server-5.6.51-91.0/storage/myisam/ |
H A D | rt_mbr.c | 30 #define INTERSECT_CMP(amin, amax, bmin, bmax) ((amin > bmax) || (bmin > amax)) argument 31 #define CONTAIN_CMP(amin, amax, bmin, bmax) ((bmin > amin) || (bmax < amax)) argument 32 #define WITHIN_CMP(amin, amax, bmin, bmax) ((amin > bmin) || (amax < bmax)) argument 33 #define DISJOINT_CMP(amin, amax, bmin, bmax) ((amin <= bmax) && (bmin <= amax)) argument 34 #define EQUAL_CMP(amin, amax, bmin, bmax) ((amin != bmin) || (amax != bmax)) argument 74 bmin = korr_func(b); \ 84 get_func(bmin, b); \ 345 get_func(bmin, b); \ 438 get_func(bmin, b); \ 708 amin = bmin; \ [all …]
|
/dports/databases/percona-pam-for-mysql/percona-server-5.6.51-91.0/storage/myisam/ |
H A D | rt_mbr.c | 30 #define INTERSECT_CMP(amin, amax, bmin, bmax) ((amin > bmax) || (bmin > amax)) argument 31 #define CONTAIN_CMP(amin, amax, bmin, bmax) ((bmin > amin) || (bmax < amax)) argument 32 #define WITHIN_CMP(amin, amax, bmin, bmax) ((amin > bmin) || (amax < bmax)) argument 33 #define DISJOINT_CMP(amin, amax, bmin, bmax) ((amin <= bmax) && (bmin <= amax)) argument 34 #define EQUAL_CMP(amin, amax, bmin, bmax) ((amin != bmin) || (amax != bmax)) argument 74 bmin = korr_func(b); \ 84 get_func(bmin, b); \ 345 get_func(bmin, b); \ 438 get_func(bmin, b); \ 708 amin = bmin; \ [all …]
|
/dports/databases/xtrabackup/percona-xtrabackup-2.4.21/storage/myisam/ |
H A D | rt_mbr.c | 27 #define INTERSECT_CMP(amin, amax, bmin, bmax) ((amin > bmax) || (bmin > amax)) argument 28 #define CONTAIN_CMP(amin, amax, bmin, bmax) ((bmin > amin) || (bmax < amax)) argument 29 #define WITHIN_CMP(amin, amax, bmin, bmax) ((amin > bmin) || (amax < bmax)) argument 30 #define DISJOINT_CMP(amin, amax, bmin, bmax) ((amin <= bmax) && (bmin <= amax)) argument 31 #define EQUAL_CMP(amin, amax, bmin, bmax) ((amin != bmin) || (amax != bmax)) argument 71 bmin = korr_func(b); \ 81 get_func(bmin, b); \ 336 get_func(bmin, b); \ 427 get_func(bmin, b); \ 691 amin = bmin; \ [all …]
|
/dports/databases/xtrabackup8/percona-xtrabackup-8.0.14/storage/myisam/ |
H A D | rt_mbr.cc | 34 #define INTERSECT_CMP(amin, amax, bmin, bmax) ((amin > bmax) || (bmin > amax)) argument 35 #define CONTAIN_CMP(amin, amax, bmin, bmax) ((bmin > amin) || (bmax < amax)) argument 36 #define WITHIN_CMP(amin, amax, bmin, bmax) ((amin > bmin) || (amax < bmax)) argument 37 #define DISJOINT_CMP(amin, amax, bmin, bmax) ((amin <= bmax) && (bmin <= amax)) argument 38 #define EQUAL_CMP(amin, amax, bmin, bmax) ((amin != bmin) || (amax != bmax)) argument 389 type amin, amax, bmin, bmax; \ 402 type amin, amax, bmin, bmax; \ 404 bmin = get_func(b); \ 407 amin = std::max(amin, bmin); \ 662 if (amin > bmin) amin = bmin; \ [all …]
|
/dports/databases/percona57-server/percona-server-5.7.36-39/storage/myisam/ |
H A D | rt_mbr.c | 27 #define INTERSECT_CMP(amin, amax, bmin, bmax) ((amin > bmax) || (bmin > amax)) argument 28 #define CONTAIN_CMP(amin, amax, bmin, bmax) ((bmin > amin) || (bmax < amax)) argument 29 #define WITHIN_CMP(amin, amax, bmin, bmax) ((amin > bmin) || (amax < bmax)) argument 30 #define DISJOINT_CMP(amin, amax, bmin, bmax) ((amin <= bmax) && (bmin <= amax)) argument 31 #define EQUAL_CMP(amin, amax, bmin, bmax) ((amin != bmin) || (amax != bmax)) argument 71 bmin = korr_func(b); \ 81 get_func(bmin, b); \ 336 get_func(bmin, b); \ 427 get_func(bmin, b); \ 691 amin = bmin; \ [all …]
|
/dports/databases/percona57-pam-for-mysql/percona-server-5.7.36-39/storage/myisam/ |
H A D | rt_mbr.c | 27 #define INTERSECT_CMP(amin, amax, bmin, bmax) ((amin > bmax) || (bmin > amax)) argument 28 #define CONTAIN_CMP(amin, amax, bmin, bmax) ((bmin > amin) || (bmax < amax)) argument 29 #define WITHIN_CMP(amin, amax, bmin, bmax) ((amin > bmin) || (amax < bmax)) argument 30 #define DISJOINT_CMP(amin, amax, bmin, bmax) ((amin <= bmax) && (bmin <= amax)) argument 31 #define EQUAL_CMP(amin, amax, bmin, bmax) ((amin != bmin) || (amax != bmax)) argument 71 bmin = korr_func(b); \ 81 get_func(bmin, b); \ 336 get_func(bmin, b); \ 427 get_func(bmin, b); \ 691 amin = bmin; \ [all …]
|
/dports/databases/mysqlwsrep57-server/mysql-wsrep-wsrep_5.7.35-25.27/storage/myisam/ |
H A D | rt_mbr.c | 27 #define INTERSECT_CMP(amin, amax, bmin, bmax) ((amin > bmax) || (bmin > amax)) argument 28 #define CONTAIN_CMP(amin, amax, bmin, bmax) ((bmin > amin) || (bmax < amax)) argument 29 #define WITHIN_CMP(amin, amax, bmin, bmax) ((amin > bmin) || (amax < bmax)) argument 30 #define DISJOINT_CMP(amin, amax, bmin, bmax) ((amin <= bmax) && (bmin <= amax)) argument 31 #define EQUAL_CMP(amin, amax, bmin, bmax) ((amin != bmin) || (amax != bmax)) argument 71 bmin = korr_func(b); \ 81 get_func(bmin, b); \ 336 get_func(bmin, b); \ 427 get_func(bmin, b); \ 691 amin = bmin; \ [all …]
|
/dports/databases/percona57-client/percona-server-5.7.36-39/storage/myisam/ |
H A D | rt_mbr.c | 27 #define INTERSECT_CMP(amin, amax, bmin, bmax) ((amin > bmax) || (bmin > amax)) argument 28 #define CONTAIN_CMP(amin, amax, bmin, bmax) ((bmin > amin) || (bmax < amax)) argument 29 #define WITHIN_CMP(amin, amax, bmin, bmax) ((amin > bmin) || (amax < bmax)) argument 30 #define DISJOINT_CMP(amin, amax, bmin, bmax) ((amin <= bmax) && (bmin <= amax)) argument 31 #define EQUAL_CMP(amin, amax, bmin, bmax) ((amin != bmin) || (amax != bmax)) argument 71 bmin = korr_func(b); \ 81 get_func(bmin, b); \ 336 get_func(bmin, b); \ 427 get_func(bmin, b); \ 691 amin = bmin; \ [all …]
|
/dports/databases/mysqlwsrep56-server/mysql-wsrep-wsrep_5.6.51-25.33/storage/myisam/ |
H A D | rt_mbr.c | 30 #define INTERSECT_CMP(amin, amax, bmin, bmax) ((amin > bmax) || (bmin > amax)) argument 31 #define CONTAIN_CMP(amin, amax, bmin, bmax) ((bmin > amin) || (bmax < amax)) argument 32 #define WITHIN_CMP(amin, amax, bmin, bmax) ((amin > bmin) || (amax < bmax)) argument 33 #define DISJOINT_CMP(amin, amax, bmin, bmax) ((amin <= bmax) && (bmin <= amax)) argument 34 #define EQUAL_CMP(amin, amax, bmin, bmax) ((amin != bmin) || (amax != bmax)) argument 74 bmin = korr_func(b); \ 84 get_func(bmin, b); \ 345 get_func(bmin, b); \ 438 get_func(bmin, b); \ 708 amin = bmin; \ [all …]
|
/dports/databases/mysql57-client/mysql-5.7.36/storage/myisam/ |
H A D | rt_mbr.c | 27 #define INTERSECT_CMP(amin, amax, bmin, bmax) ((amin > bmax) || (bmin > amax)) argument 28 #define CONTAIN_CMP(amin, amax, bmin, bmax) ((bmin > amin) || (bmax < amax)) argument 29 #define WITHIN_CMP(amin, amax, bmin, bmax) ((amin > bmin) || (amax < bmax)) argument 30 #define DISJOINT_CMP(amin, amax, bmin, bmax) ((amin <= bmax) && (bmin <= amax)) argument 31 #define EQUAL_CMP(amin, amax, bmin, bmax) ((amin != bmin) || (amax != bmax)) argument 71 bmin = korr_func(b); \ 81 get_func(bmin, b); \ 336 get_func(bmin, b); \ 427 get_func(bmin, b); \ 691 amin = bmin; \ [all …]
|
/dports/databases/mariadb105-client/mariadb-10.5.15/storage/maria/ |
H A D | ma_rt_mbr.c | 24 #define INTERSECT_CMP(amin, amax, bmin, bmax) ((amin > bmax) || (bmin > amax)) argument 25 #define CONTAIN_CMP(amin, amax, bmin, bmax) ((bmin > amin) || (bmax < amax)) argument 26 #define WITHIN_CMP(amin, amax, bmin, bmax) ((amin > bmin) || (amax < bmax)) argument 27 #define DISJOINT_CMP(amin, amax, bmin, bmax) ((amin <= bmax) && (bmin <= amax)) argument 28 #define EQUAL_CMP(amin, amax, bmin, bmax) ((amin != bmin) || (amax != bmax)) argument 68 bmin= korr_func(b); \ 78 get_func(bmin, b); \ 342 get_func(bmin, b); \ 436 get_func(bmin, b); \ 709 amin= bmin; \ [all …]
|