Home
last modified time | relevance | path

Searched refs:maxdirsterid (Results 1 – 16 of 16) sorted by relevance

/dports/devel/bullet/bullet3-3.21/src/LinearMath/
H A DbtConvexHull.cpp233 int maxdirsterid(const T *p, int count, const T &dir, btAlignedObjectArray<int> &allow) in maxdirsterid() function
461 int p0 = maxdirsterid(verts, verts_count, basis[0], allow); in FindSimplex()
462 int p1 = maxdirsterid(verts, verts_count, -basis[0], allow); in FindSimplex()
477 int p2 = maxdirsterid(verts, verts_count, basis[1], allow); in FindSimplex()
480 p2 = maxdirsterid(verts, verts_count, -basis[1], allow); in FindSimplex()
486 int p3 = maxdirsterid(verts, verts_count, basis[2], allow); in FindSimplex()
487 if (p3 == p0 || p3 == p1 || p3 == p2) p3 = maxdirsterid(verts, verts_count, -basis[2], allow); in FindSimplex()
543 t->vmax = maxdirsterid(verts, verts_count, n, allow); in calchullgen()
590 t->vmax = maxdirsterid(verts, verts_count, n, allow); in calchullgen()
/dports/graphics/blender/blender-2.91.0/extern/bullet2/src/LinearMath/
H A DbtConvexHull.cpp233 int maxdirsterid(const T *p, int count, const T &dir, btAlignedObjectArray<int> &allow) in maxdirsterid() function
461 int p0 = maxdirsterid(verts, verts_count, basis[0], allow); in FindSimplex()
462 int p1 = maxdirsterid(verts, verts_count, -basis[0], allow); in FindSimplex()
477 int p2 = maxdirsterid(verts, verts_count, basis[1], allow); in FindSimplex()
480 p2 = maxdirsterid(verts, verts_count, -basis[1], allow); in FindSimplex()
486 int p3 = maxdirsterid(verts, verts_count, basis[2], allow); in FindSimplex()
487 if (p3 == p0 || p3 == p1 || p3 == p2) p3 = maxdirsterid(verts, verts_count, -basis[2], allow); in FindSimplex()
543 t->vmax = maxdirsterid(verts, verts_count, n, allow); in calchullgen()
590 t->vmax = maxdirsterid(verts, verts_count, n, allow); in calchullgen()
/dports/games/supertuxkart/SuperTuxKart-1.2-src/lib/bullet/src/LinearMath/
H A DbtConvexHull.cpp253 int maxdirsterid(const T *p,int count,const T &dir,btAlignedObjectArray<int> &allow) in maxdirsterid() function
493 int p0 = maxdirsterid(verts,verts_count, basis[0],allow); in FindSimplex()
494 int p1 = maxdirsterid(verts,verts_count,-basis[0],allow); in FindSimplex()
507 int p2 = maxdirsterid(verts,verts_count,basis[1],allow); in FindSimplex()
510 p2 = maxdirsterid(verts,verts_count,-basis[1],allow); in FindSimplex()
516 int p3 = maxdirsterid(verts,verts_count,basis[2],allow); in FindSimplex()
517 if(p3==p0||p3==p1||p3==p2) p3 = maxdirsterid(verts,verts_count,-basis[2],allow); in FindSimplex()
566 t->vmax = maxdirsterid(verts,verts_count,n,allow); in calchullgen()
610 t->vmax = maxdirsterid(verts,verts_count,n,allow); in calchullgen()
/dports/games/critterding/critterding-beta12/src/utils/bullet/LinearMath/
H A DbtConvexHull.cpp253 int maxdirsterid(const T *p,int count,const T &dir,btAlignedObjectArray<int> &allow) in maxdirsterid() function
493 int p0 = maxdirsterid(verts,verts_count, basis[0],allow); in FindSimplex()
494 int p1 = maxdirsterid(verts,verts_count,-basis[0],allow); in FindSimplex()
507 int p2 = maxdirsterid(verts,verts_count,basis[1],allow); in FindSimplex()
510 p2 = maxdirsterid(verts,verts_count,-basis[1],allow); in FindSimplex()
516 int p3 = maxdirsterid(verts,verts_count,basis[2],allow); in FindSimplex()
517 if(p3==p0||p3==p1||p3==p2) p3 = maxdirsterid(verts,verts_count,-basis[2],allow); in FindSimplex()
566 t->vmax = maxdirsterid(verts,verts_count,n,allow); in calchullgen()
610 t->vmax = maxdirsterid(verts,verts_count,n,allow); in calchullgen()
/dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/bullet/LinearMath/
H A DbtConvexHull.cpp233 int maxdirsterid(const T *p, int count, const T &dir, btAlignedObjectArray<int> &allow) in maxdirsterid() function
461 int p0 = maxdirsterid(verts, verts_count, basis[0], allow); in FindSimplex()
462 int p1 = maxdirsterid(verts, verts_count, -basis[0], allow); in FindSimplex()
477 int p2 = maxdirsterid(verts, verts_count, basis[1], allow); in FindSimplex()
480 p2 = maxdirsterid(verts, verts_count, -basis[1], allow); in FindSimplex()
486 int p3 = maxdirsterid(verts, verts_count, basis[2], allow); in FindSimplex()
487 if (p3 == p0 || p3 == p1 || p3 == p2) p3 = maxdirsterid(verts, verts_count, -basis[2], allow); in FindSimplex()
543 t->vmax = maxdirsterid(verts, verts_count, n, allow); in calchullgen()
590 t->vmax = maxdirsterid(verts, verts_count, n, allow); in calchullgen()
/dports/devel/godot/godot-3.2.3-stable/thirdparty/bullet/LinearMath/
H A DbtConvexHull.cpp233 int maxdirsterid(const T *p, int count, const T &dir, btAlignedObjectArray<int> &allow) in maxdirsterid() function
461 int p0 = maxdirsterid(verts, verts_count, basis[0], allow); in FindSimplex()
462 int p1 = maxdirsterid(verts, verts_count, -basis[0], allow); in FindSimplex()
477 int p2 = maxdirsterid(verts, verts_count, basis[1], allow); in FindSimplex()
480 p2 = maxdirsterid(verts, verts_count, -basis[1], allow); in FindSimplex()
486 int p3 = maxdirsterid(verts, verts_count, basis[2], allow); in FindSimplex()
487 if (p3 == p0 || p3 == p1 || p3 == p2) p3 = maxdirsterid(verts, verts_count, -basis[2], allow); in FindSimplex()
543 t->vmax = maxdirsterid(verts, verts_count, n, allow); in calchullgen()
590 t->vmax = maxdirsterid(verts, verts_count, n, allow); in calchullgen()
/dports/science/chrono/chrono-7.0.1/src/chrono/collision/bullet/LinearMath/
H A DbtConvexHull.cpp234 int maxdirsterid(const T *p, int count, const T &dir, btAlignedObjectArray<int> &allow) in maxdirsterid() function
462 int p0 = maxdirsterid(verts, verts_count, basis[0], allow); in FindSimplex()
463 int p1 = maxdirsterid(verts, verts_count, -basis[0], allow); in FindSimplex()
478 int p2 = maxdirsterid(verts, verts_count, basis[1], allow); in FindSimplex()
481 p2 = maxdirsterid(verts, verts_count, -basis[1], allow); in FindSimplex()
487 int p3 = maxdirsterid(verts, verts_count, basis[2], allow); in FindSimplex()
488 if (p3 == p0 || p3 == p1 || p3 == p2) p3 = maxdirsterid(verts, verts_count, -basis[2], allow); in FindSimplex()
544 t->vmax = maxdirsterid(verts, verts_count, n, allow); in calchullgen()
591 t->vmax = maxdirsterid(verts, verts_count, n, allow); in calchullgen()
/dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/Bullet/src/LinearMath/
H A DbtConvexHull.cpp246 int maxdirsterid(const T *p,int count,const T &dir,btAlignedObjectArray<int> &allow) in maxdirsterid() function
486 int p0 = maxdirsterid(verts,verts_count, basis[0],allow); in FindSimplex()
487 int p1 = maxdirsterid(verts,verts_count,-basis[0],allow); in FindSimplex()
500 int p2 = maxdirsterid(verts,verts_count,basis[1],allow); in FindSimplex()
503 p2 = maxdirsterid(verts,verts_count,-basis[1],allow); in FindSimplex()
509 int p3 = maxdirsterid(verts,verts_count,basis[2],allow); in FindSimplex()
510 if(p3==p0||p3==p1||p3==p2) p3 = maxdirsterid(verts,verts_count,-basis[2],allow); in FindSimplex()
559 t->vmax = maxdirsterid(verts,verts_count,n,allow); in calchullgen()
603 t->vmax = maxdirsterid(verts,verts_count,n,allow); in calchullgen()
/dports/devel/py-bullet3/bullet3-3.21/src/LinearMath/
H A DbtConvexHull.cpp233 int maxdirsterid(const T *p, int count, const T &dir, btAlignedObjectArray<int> &allow) in maxdirsterid() function
461 int p0 = maxdirsterid(verts, verts_count, basis[0], allow); in FindSimplex()
462 int p1 = maxdirsterid(verts, verts_count, -basis[0], allow); in FindSimplex()
477 int p2 = maxdirsterid(verts, verts_count, basis[1], allow); in FindSimplex()
480 p2 = maxdirsterid(verts, verts_count, -basis[1], allow); in FindSimplex()
486 int p3 = maxdirsterid(verts, verts_count, basis[2], allow); in FindSimplex()
487 if (p3 == p0 || p3 == p1 || p3 == p2) p3 = maxdirsterid(verts, verts_count, -basis[2], allow); in FindSimplex()
543 t->vmax = maxdirsterid(verts, verts_count, n, allow); in calchullgen()
590 t->vmax = maxdirsterid(verts, verts_count, n, allow); in calchullgen()
/dports/games/OpenTomb/OpenTomb-win32-2018-02-03_alpha/extern/bullet/LinearMath/
H A DbtConvexHull.cpp246 int maxdirsterid(const T *p,int count,const T &dir,btAlignedObjectArray<int> &allow) in maxdirsterid() function
486 int p0 = maxdirsterid(verts,verts_count, basis[0],allow); in FindSimplex()
487 int p1 = maxdirsterid(verts,verts_count,-basis[0],allow); in FindSimplex()
500 int p2 = maxdirsterid(verts,verts_count,basis[1],allow); in FindSimplex()
503 p2 = maxdirsterid(verts,verts_count,-basis[1],allow); in FindSimplex()
509 int p3 = maxdirsterid(verts,verts_count,basis[2],allow); in FindSimplex()
510 if(p3==p0||p3==p1||p3==p2) p3 = maxdirsterid(verts,verts_count,-basis[2],allow); in FindSimplex()
559 t->vmax = maxdirsterid(verts,verts_count,n,allow); in calchullgen()
603 t->vmax = maxdirsterid(verts,verts_count,n,allow); in calchullgen()
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/bullet/src/LinearMath/
H A DbtConvexHull.cpp253 int maxdirsterid(const T *p,int count,const T &dir,btAlignedObjectArray<int> &allow) in maxdirsterid() function
493 int p0 = maxdirsterid(verts,verts_count, basis[0],allow); in FindSimplex()
494 int p1 = maxdirsterid(verts,verts_count,-basis[0],allow); in FindSimplex()
507 int p2 = maxdirsterid(verts,verts_count,basis[1],allow); in FindSimplex()
510 p2 = maxdirsterid(verts,verts_count,-basis[1],allow); in FindSimplex()
516 int p3 = maxdirsterid(verts,verts_count,basis[2],allow); in FindSimplex()
517 if(p3==p0||p3==p1||p3==p2) p3 = maxdirsterid(verts,verts_count,-basis[2],allow); in FindSimplex()
566 t->vmax = maxdirsterid(verts,verts_count,n,allow); in calchullgen()
610 t->vmax = maxdirsterid(verts,verts_count,n,allow); in calchullgen()
/dports/devel/bullet/bullet3-3.21/Extras/ConvexDecomposition/
H A Dcd_hull.cpp2344 int maxdirsterid(const T *p, int count, const T &dir, Array<int> &allow) in maxdirsterid() function
2578 int p0 = maxdirsterid(verts, verts_count, basis[0], allow); in FindSimplex()
2579 int p1 = maxdirsterid(verts, verts_count, -basis[0], allow); in FindSimplex()
2586 int p2 = maxdirsterid(verts, verts_count, basis[1], allow); in FindSimplex()
2589 p2 = maxdirsterid(verts, verts_count, -basis[1], allow); in FindSimplex()
2595 int p3 = maxdirsterid(verts, verts_count, basis[2], allow); in FindSimplex()
2596 if (p3 == p0 || p3 == p1 || p3 == p2) p3 = maxdirsterid(verts, verts_count, -basis[2], allow); in FindSimplex()
2648 t->vmax = maxdirsterid(verts, verts_count, n, allow); in calchullgen()
2694 t->vmax = maxdirsterid(verts, verts_count, n, allow); in calchullgen()
/dports/science/chrono/chrono-7.0.1/src/chrono/collision/gimpact/ConvexDecomposition/
H A Dcd_hull.cpp2231 int maxdirsterid(const T *p,int count,const T &dir,Array<int> &allow) in maxdirsterid() function
2464 int p0 = maxdirsterid(verts,verts_count, basis[0],allow); in FindSimplex()
2465 int p1 = maxdirsterid(verts,verts_count,-basis[0],allow); in FindSimplex()
2472 int p2 = maxdirsterid(verts,verts_count,basis[1],allow); in FindSimplex()
2475 p2 = maxdirsterid(verts,verts_count,-basis[1],allow); in FindSimplex()
2481 int p3 = maxdirsterid(verts,verts_count,basis[2],allow); in FindSimplex()
2482 if(p3==p0||p3==p1||p3==p2) p3 = maxdirsterid(verts,verts_count,-basis[2],allow); in FindSimplex()
2527 t->vmax = maxdirsterid(verts,verts_count,n,allow); in calchullgen()
2570 t->vmax = maxdirsterid(verts,verts_count,n,allow); in calchullgen()
/dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/StanHull/
H A Dhull.cpp2182 int maxdirsterid(const T *p,int count,const T &dir,Array<int> &allow) in maxdirsterid() function
2415 int p0 = maxdirsterid(verts,verts_count, basis[0],allow); in FindSimplex()
2416 int p1 = maxdirsterid(verts,verts_count,-basis[0],allow); in FindSimplex()
2423 int p2 = maxdirsterid(verts,verts_count,basis[1],allow); in FindSimplex()
2426 p2 = maxdirsterid(verts,verts_count,-basis[1],allow); in FindSimplex()
2432 int p3 = maxdirsterid(verts,verts_count,basis[2],allow); in FindSimplex()
2433 if(p3==p0||p3==p1||p3==p2) p3 = maxdirsterid(verts,verts_count,-basis[2],allow); in FindSimplex()
2478 t->vmax = maxdirsterid(verts,verts_count,n,allow); in calchullgen()
2522 t->vmax = maxdirsterid(verts,verts_count,n,allow); in calchullgen()
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/bullet/Extras/ConvexDecomposition/
H A Dcd_hull.cpp2231 int maxdirsterid(const T *p,int count,const T &dir,Array<int> &allow) in maxdirsterid() function
2466 int p0 = maxdirsterid(verts,verts_count, basis[0],allow); in FindSimplex()
2467 int p1 = maxdirsterid(verts,verts_count,-basis[0],allow); in FindSimplex()
2474 int p2 = maxdirsterid(verts,verts_count,basis[1],allow); in FindSimplex()
2477 p2 = maxdirsterid(verts,verts_count,-basis[1],allow); in FindSimplex()
2483 int p3 = maxdirsterid(verts,verts_count,basis[2],allow); in FindSimplex()
2484 if(p3==p0||p3==p1||p3==p2) p3 = maxdirsterid(verts,verts_count,-basis[2],allow); in FindSimplex()
2529 t->vmax = maxdirsterid(verts,verts_count,n,allow); in calchullgen()
2572 t->vmax = maxdirsterid(verts,verts_count,n,allow); in calchullgen()
/dports/devel/py-bullet3/bullet3-3.21/Extras/ConvexDecomposition/
H A Dcd_hull.cpp2344 int maxdirsterid(const T *p, int count, const T &dir, Array<int> &allow) in maxdirsterid() function
2578 int p0 = maxdirsterid(verts, verts_count, basis[0], allow); in FindSimplex()
2579 int p1 = maxdirsterid(verts, verts_count, -basis[0], allow); in FindSimplex()
2586 int p2 = maxdirsterid(verts, verts_count, basis[1], allow); in FindSimplex()
2589 p2 = maxdirsterid(verts, verts_count, -basis[1], allow); in FindSimplex()
2595 int p3 = maxdirsterid(verts, verts_count, basis[2], allow); in FindSimplex()
2596 if (p3 == p0 || p3 == p1 || p3 == p2) p3 = maxdirsterid(verts, verts_count, -basis[2], allow); in FindSimplex()
2648 t->vmax = maxdirsterid(verts, verts_count, n, allow); in calchullgen()
2694 t->vmax = maxdirsterid(verts, verts_count, n, allow); in calchullgen()