Home
last modified time | relevance | path

Searched refs:removeb2b (Results 1 – 25 of 27) sorted by relevance

12

/dports/devel/bullet/bullet3-3.21/src/LinearMath/
H A DbtConvexHull.h200 void removeb2b(btHullTriangle* s, btHullTriangle* t);
H A DbtConvexHull.cpp371 void HullLibrary::removeb2b(btHullTriangle *s, btHullTriangle *t) in removeb2b() function in HullLibrary
437 if (hasvert(*m_tris[ta->n[0]], v)) removeb2b(ta, m_tris[ta->n[0]]); in extrude()
438 if (hasvert(*m_tris[tb->n[0]], v)) removeb2b(tb, m_tris[tb->n[0]]); in extrude()
439 if (hasvert(*m_tris[tc->n[0]], v)) removeb2b(tc, m_tris[tc->n[0]]); in extrude()
/dports/graphics/blender/blender-2.91.0/extern/bullet2/src/LinearMath/
H A DbtConvexHull.h200 void removeb2b(btHullTriangle* s, btHullTriangle* t);
H A DbtConvexHull.cpp371 void HullLibrary::removeb2b(btHullTriangle *s, btHullTriangle *t) in removeb2b() function in HullLibrary
437 if (hasvert(*m_tris[ta->n[0]], v)) removeb2b(ta, m_tris[ta->n[0]]); in extrude()
438 if (hasvert(*m_tris[tb->n[0]], v)) removeb2b(tb, m_tris[tb->n[0]]); in extrude()
439 if (hasvert(*m_tris[tc->n[0]], v)) removeb2b(tc, m_tris[tc->n[0]]); in extrude()
/dports/games/supertuxkart/SuperTuxKart-1.2-src/lib/bullet/src/LinearMath/
H A DbtConvexHull.h206 void removeb2b(btHullTriangle* s,btHullTriangle*t);
H A DbtConvexHull.cpp398 void HullLibrary::removeb2b(btHullTriangle* s,btHullTriangle*t) in removeb2b() function in HullLibrary
465 if(hasvert(*m_tris[ta->n[0]],v)) removeb2b(ta,m_tris[ta->n[0]]); in extrude()
466 if(hasvert(*m_tris[tb->n[0]],v)) removeb2b(tb,m_tris[tb->n[0]]); in extrude()
467 if(hasvert(*m_tris[tc->n[0]],v)) removeb2b(tc,m_tris[tc->n[0]]); in extrude()
/dports/games/critterding/critterding-beta12/src/utils/bullet/LinearMath/
H A DbtConvexHull.h206 void removeb2b(btHullTriangle* s,btHullTriangle*t);
H A DbtConvexHull.cpp398 void HullLibrary::removeb2b(btHullTriangle* s,btHullTriangle*t) in removeb2b() function in HullLibrary
465 if(hasvert(*m_tris[ta->n[0]],v)) removeb2b(ta,m_tris[ta->n[0]]); in extrude()
466 if(hasvert(*m_tris[tb->n[0]],v)) removeb2b(tb,m_tris[tb->n[0]]); in extrude()
467 if(hasvert(*m_tris[tc->n[0]],v)) removeb2b(tc,m_tris[tc->n[0]]); in extrude()
/dports/devel/godot-tools/godot-3.2.3-stable/thirdparty/bullet/LinearMath/
H A DbtConvexHull.h200 void removeb2b(btHullTriangle* s, btHullTriangle* t);
H A DbtConvexHull.cpp371 void HullLibrary::removeb2b(btHullTriangle *s, btHullTriangle *t) in removeb2b() function in HullLibrary
437 if (hasvert(*m_tris[ta->n[0]], v)) removeb2b(ta, m_tris[ta->n[0]]); in extrude()
438 if (hasvert(*m_tris[tb->n[0]], v)) removeb2b(tb, m_tris[tb->n[0]]); in extrude()
439 if (hasvert(*m_tris[tc->n[0]], v)) removeb2b(tc, m_tris[tc->n[0]]); in extrude()
/dports/devel/godot/godot-3.2.3-stable/thirdparty/bullet/LinearMath/
H A DbtConvexHull.h200 void removeb2b(btHullTriangle* s, btHullTriangle* t);
H A DbtConvexHull.cpp371 void HullLibrary::removeb2b(btHullTriangle *s, btHullTriangle *t) in removeb2b() function in HullLibrary
437 if (hasvert(*m_tris[ta->n[0]], v)) removeb2b(ta, m_tris[ta->n[0]]); in extrude()
438 if (hasvert(*m_tris[tb->n[0]], v)) removeb2b(tb, m_tris[tb->n[0]]); in extrude()
439 if (hasvert(*m_tris[tc->n[0]], v)) removeb2b(tc, m_tris[tc->n[0]]); in extrude()
/dports/science/chrono/chrono-7.0.1/src/chrono/collision/bullet/LinearMath/
H A DbtConvexHull.h201 void removeb2b(btHullTriangle* s, btHullTriangle* t);
H A DbtConvexHull.cpp372 void HullLibrary::removeb2b(btHullTriangle *s, btHullTriangle *t) in removeb2b() function in HullLibrary
438 if (hasvert(*m_tris[ta->n[0]], v)) removeb2b(ta, m_tris[ta->n[0]]); in extrude()
439 if (hasvert(*m_tris[tb->n[0]], v)) removeb2b(tb, m_tris[tb->n[0]]); in extrude()
440 if (hasvert(*m_tris[tc->n[0]], v)) removeb2b(tc, m_tris[tc->n[0]]); in extrude()
/dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/Bullet/src/LinearMath/
H A DbtConvexHull.h206 void removeb2b(btHullTriangle* s,btHullTriangle*t);
H A DbtConvexHull.cpp391 void HullLibrary::removeb2b(btHullTriangle* s,btHullTriangle*t) in removeb2b() function in HullLibrary
458 if(hasvert(*m_tris[ta->n[0]],v)) removeb2b(ta,m_tris[ta->n[0]]); in extrude()
459 if(hasvert(*m_tris[tb->n[0]],v)) removeb2b(tb,m_tris[tb->n[0]]); in extrude()
460 if(hasvert(*m_tris[tc->n[0]],v)) removeb2b(tc,m_tris[tc->n[0]]); in extrude()
/dports/devel/py-bullet3/bullet3-3.21/src/LinearMath/
H A DbtConvexHull.h200 void removeb2b(btHullTriangle* s, btHullTriangle* t);
H A DbtConvexHull.cpp371 void HullLibrary::removeb2b(btHullTriangle *s, btHullTriangle *t) in removeb2b() function in HullLibrary
437 if (hasvert(*m_tris[ta->n[0]], v)) removeb2b(ta, m_tris[ta->n[0]]); in extrude()
438 if (hasvert(*m_tris[tb->n[0]], v)) removeb2b(tb, m_tris[tb->n[0]]); in extrude()
439 if (hasvert(*m_tris[tc->n[0]], v)) removeb2b(tc, m_tris[tc->n[0]]); in extrude()
/dports/games/OpenTomb/OpenTomb-win32-2018-02-03_alpha/extern/bullet/LinearMath/
H A DbtConvexHull.h206 void removeb2b(btHullTriangle* s,btHullTriangle*t);
H A DbtConvexHull.cpp391 void HullLibrary::removeb2b(btHullTriangle* s,btHullTriangle*t) in removeb2b() function in HullLibrary
458 if(hasvert(*m_tris[ta->n[0]],v)) removeb2b(ta,m_tris[ta->n[0]]); in extrude()
459 if(hasvert(*m_tris[tb->n[0]],v)) removeb2b(tb,m_tris[tb->n[0]]); in extrude()
460 if(hasvert(*m_tris[tc->n[0]],v)) removeb2b(tc,m_tris[tc->n[0]]); in extrude()
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/bullet/src/LinearMath/
H A DbtConvexHull.h206 void removeb2b(btHullTriangle* s,btHullTriangle*t);
H A DbtConvexHull.cpp398 void HullLibrary::removeb2b(btHullTriangle* s,btHullTriangle*t) in removeb2b() function in HullLibrary
465 if(hasvert(*m_tris[ta->n[0]],v)) removeb2b(ta,m_tris[ta->n[0]]); in extrude()
466 if(hasvert(*m_tris[tb->n[0]],v)) removeb2b(tb,m_tris[tb->n[0]]); in extrude()
467 if(hasvert(*m_tris[tc->n[0]],v)) removeb2b(tc,m_tris[tc->n[0]]); in extrude()
/dports/devel/bullet/bullet3-3.21/Extras/ConvexDecomposition/
H A Dcd_hull.cpp2501 void removeb2b(btHullTriangle *s, btHullTriangle *t, Array<btHullTriangle *> &tris) in removeb2b() function
2538 if (hasvert(*tris[ta->n[0]], v)) removeb2b(ta, tris[ta->n[0]], tris); in extrude()
2539 if (hasvert(*tris[tb->n[0]], v)) removeb2b(tb, tris[tb->n[0]], tris); in extrude()
2540 if (hasvert(*tris[tc->n[0]], v)) removeb2b(tc, tris[tc->n[0]], tris); in extrude()
/dports/science/chrono/chrono-7.0.1/src/chrono/collision/gimpact/ConvexDecomposition/
H A Dcd_hull.cpp2390 void removeb2b(btHullTriangle* s,btHullTriangle*t) in removeb2b() function
2427 if(hasvert(*tris[ta->n[0]],v)) removeb2b(ta,tris[ta->n[0]]); in extrude()
2428 if(hasvert(*tris[tb->n[0]],v)) removeb2b(tb,tris[tb->n[0]]); in extrude()
2429 if(hasvert(*tris[tc->n[0]],v)) removeb2b(tc,tris[tc->n[0]]); in extrude()
/dports/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/StanHull/
H A Dhull.cpp2341 void removeb2b(Tri* s,Tri*t) in removeb2b() function
2378 if(hasvert(*tris[ta->n[0]],v)) removeb2b(ta,tris[ta->n[0]]); in extrude()
2379 if(hasvert(*tris[tb->n[0]],v)) removeb2b(tb,tris[tb->n[0]]); in extrude()
2380 if(hasvert(*tris[tc->n[0]],v)) removeb2b(tc,tris[tc->n[0]]); in extrude()

12