/dports/devel/py-bullet3/bullet3-3.21/src/BulletCollision/CollisionDispatch/ |
H A D | btBox2dBox2dCollisionAlgorithm.cpp | 184 btScalar sPrev = EdgeSeparation(poly1, xf1, prevEdge, poly2, xf2); in FindMaxSeparation() local 185 if (sPrev > 0.0f) in FindMaxSeparation() 187 return sPrev; in FindMaxSeparation() 202 if (sPrev > s && sPrev > sNext) in FindMaxSeparation() 206 bestSeparation = sPrev; in FindMaxSeparation()
|
/dports/games/OpenTomb/OpenTomb-win32-2018-02-03_alpha/extern/bullet/BulletCollision/CollisionDispatch/ |
H A D | btBox2dBox2dCollisionAlgorithm.cpp | 190 btScalar sPrev = EdgeSeparation(poly1, xf1, prevEdge, poly2, xf2); in FindMaxSeparation() local 191 if (sPrev > 0.0f) in FindMaxSeparation() 193 return sPrev; in FindMaxSeparation() 208 if (sPrev > s && sPrev > sNext) in FindMaxSeparation() 212 bestSeparation = sPrev; in FindMaxSeparation()
|
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/bullet/src/BulletCollision/CollisionDispatch/ |
H A D | btBox2dBox2dCollisionAlgorithm.cpp | 204 btScalar sPrev = EdgeSeparation(poly1, xf1, prevEdge, poly2, xf2); in FindMaxSeparation() local 205 if (sPrev > 0.0f) in FindMaxSeparation() 207 return sPrev; in FindMaxSeparation() 222 if (sPrev > s && sPrev > sNext) in FindMaxSeparation() 226 bestSeparation = sPrev; in FindMaxSeparation()
|
/dports/devel/godot/godot-3.2.3-stable/thirdparty/bullet/BulletCollision/CollisionDispatch/ |
H A D | btBox2dBox2dCollisionAlgorithm.cpp | 184 btScalar sPrev = EdgeSeparation(poly1, xf1, prevEdge, poly2, xf2); in FindMaxSeparation() local 185 if (sPrev > 0.0f) in FindMaxSeparation() 187 return sPrev; in FindMaxSeparation() 202 if (sPrev > s && sPrev > sNext) in FindMaxSeparation() 206 bestSeparation = sPrev; in FindMaxSeparation()
|
/dports/devel/upp/upp/uppsrc/Core/ |
H A D | Debug.cpp | 237 static LPTOP_LEVEL_EXCEPTION_FILTER sPrev; variable 290 return sPrev ? (*sPrev)(ep) : 0 /*EXCEPTION_CONTINUE_SEARCH*/; in sDumpHandler() 300 if(!sPrev) { in InstallCrashDump() 301 sPrev = SetUnhandledExceptionFilter(sDumpHandler); in InstallCrashDump()
|
/dports/math/gismo/gismo-21.12.0/src/gsSolver/ |
H A D | gsMinimalResidual.hpp | 43 sPrev = 0; s = 0; sNew = 0; in initIteration() 62 const T a3 = sPrev*gamma; in step() 90 sPrev = s; s = sNew; in step()
|
H A D | gsMinimalResidual.h | 104 sPrev, s, sNew, variable
|
/dports/math/vtk8/VTK-8.2.0/Filters/Modeling/ |
H A D | vtkRibbonFilter.cxx | 278 double sPrev[3]; in GeneratePoints() local 299 sPrev[i] = sNext[i]; in GeneratePoints() 306 sPrev[i] = sNext[i]; in GeneratePoints() 319 sPrev[i] = sNext[i]; in GeneratePoints() 334 s[i] = (sPrev[i] + sNext[i]) / 2.0; //average vector in GeneratePoints() 340 vtkMath::Cross(sPrev,n,s); in GeneratePoints()
|
/dports/math/vtk9/VTK-9.1.0/Filters/Modeling/ |
H A D | vtkRibbonFilter.cxx | 267 double sPrev[3]; in GeneratePoints() local 288 sPrev[i] = sNext[i]; in GeneratePoints() 295 sPrev[i] = sNext[i]; in GeneratePoints() 308 sPrev[i] = sNext[i]; in GeneratePoints() 323 s[i] = (sPrev[i] + sNext[i]) / 2.0; // average vector in GeneratePoints() 329 vtkMath::Cross(sPrev, n, s); in GeneratePoints()
|
/dports/math/vtk6/VTK-6.2.0/Filters/Modeling/ |
H A D | vtkRibbonFilter.cxx | 280 double sPrev[3]; in GeneratePoints() local 301 sPrev[i] = sNext[i]; in GeneratePoints() 308 sPrev[i] = sNext[i]; in GeneratePoints() 321 sPrev[i] = sNext[i]; in GeneratePoints() 336 s[i] = (sPrev[i] + sNext[i]) / 2.0; //average vector in GeneratePoints() 342 vtkMath::Cross(sPrev,n,s); in GeneratePoints()
|
/dports/devel/upp/upp/uppsrc/plugin/box2d/ |
H A D | b2CollidePolygon.cpp | 89 float32 sPrev = b2EdgeSeparation(poly1, xf1, prevEdge, poly2, xf2); in b2FindMaxSeparation() local 99 if (sPrev > s && sPrev > sNext) in b2FindMaxSeparation() 103 bestSeparation = sPrev; in b2FindMaxSeparation()
|
/dports/math/vtk6/VTK-6.2.0/Filters/Core/ |
H A D | vtkTubeFilter.cxx | 325 double sPrev[3]; in GeneratePoints() local 348 sPrev[i] = sNext[i]; in GeneratePoints() 349 startCapNorm[i] = -sPrev[i]; in GeneratePoints() 357 sPrev[i] = sNext[i]; in GeneratePoints() 372 sPrev[i] = sNext[i]; in GeneratePoints() 387 s[i] = (sPrev[i] + sNext[i]) / 2.0; //average vector in GeneratePoints() 393 vtkMath::Cross(sPrev,n,s); in GeneratePoints()
|
/dports/games/doomsday/doomsday-2.3.1/doomsday/apps/client/src/world/base/ |
H A D | sector.cpp | 87 mob->sNext->sPrev = &mob->sNext; in DENG2_PIMPL() 89 *(mob->sPrev = &head) = mob; in DENG2_PIMPL() 103 if ((*mob->sPrev = mob->sNext)) in DENG2_PIMPL() 105 mob->sNext->sPrev = mob->sPrev; in DENG2_PIMPL() 109 mob->sPrev = nullptr; in DENG2_PIMPL()
|
/dports/devel/juce/JUCE-f37e9a1/modules/juce_box2d/box2d/Collision/ |
H A D | b2CollidePolygon.cpp | 88 float32 sPrev = b2EdgeSeparation(poly1, xf1, prevEdge, poly2, xf2); in b2FindMaxSeparation() local 98 if (sPrev > s && sPrev > sNext) in b2FindMaxSeparation() 102 bestSeparation = sPrev; in b2FindMaxSeparation()
|
/dports/devel/love08/love-0.8.0/src/libraries/Box2D/Collision/ |
H A D | b2CollidePolygon.cpp | 88 float32 sPrev = b2EdgeSeparation(poly1, xf1, prevEdge, poly2, xf2); in b2FindMaxSeparation() local 98 if (sPrev > s && sPrev > sNext) in b2FindMaxSeparation() 102 bestSeparation = sPrev; in b2FindMaxSeparation()
|
/dports/graphics/py-box2d-py/box2d-py-2.3.8/Box2D/Collision/ |
H A D | b2CollidePolygon.cpp | 88 float32 sPrev = b2EdgeSeparation(poly1, xf1, prevEdge, poly2, xf2); in b2FindMaxSeparation() local 98 if (sPrev > s && sPrev > sNext) in b2FindMaxSeparation() 102 bestSeparation = sPrev; in b2FindMaxSeparation()
|
/dports/devel/emscripten/emscripten-2.0.3/tests/third_party/box2d/Box2D/Collision/ |
H A D | b2CollidePolygon.cpp | 88 float32 sPrev = b2EdgeSeparation(poly1, xf1, prevEdge, poly2, xf2); in b2FindMaxSeparation() local 98 if (sPrev > s && sPrev > sNext) in b2FindMaxSeparation() 102 bestSeparation = sPrev; in b2FindMaxSeparation()
|
/dports/games/kolf/kolf-21.12.3/external/Box2D/Collision/ |
H A D | b2CollidePolygon.cpp | 89 qreal sPrev = b2EdgeSeparation(poly1, xf1, prevEdge, poly2, xf2); in b2FindMaxSeparation() local 99 if (sPrev > s && sPrev > sNext) in b2FindMaxSeparation() 103 bestSeparation = sPrev; in b2FindMaxSeparation()
|
/dports/math/vtk9/VTK-9.1.0/Filters/Core/ |
H A D | vtkTubeFilter.cxx | 343 double sPrev[3]; in GeneratePoints() local 366 sPrev[i] = sNext[i]; in GeneratePoints() 367 startCapNorm[i] = -sPrev[i]; in GeneratePoints() 375 sPrev[i] = sNext[i]; in GeneratePoints() 390 sPrev[i] = sNext[i]; in GeneratePoints() 405 s[i] = (sPrev[i] + sNext[i]) / 2.0; // average vector in GeneratePoints() 411 vtkMath::Cross(sPrev, n, s); in GeneratePoints()
|
/dports/math/vtk8/VTK-8.2.0/Filters/Core/ |
H A D | vtkTubeFilter.cxx | 346 double sPrev[3]; in GeneratePoints() local 369 sPrev[i] = sNext[i]; in GeneratePoints() 370 startCapNorm[i] = -sPrev[i]; in GeneratePoints() 378 sPrev[i] = sNext[i]; in GeneratePoints() 393 sPrev[i] = sNext[i]; in GeneratePoints() 408 s[i] = (sPrev[i] + sNext[i]) / 2.0; //average vector in GeneratePoints() 414 vtkMath::Cross(sPrev,n,s); in GeneratePoints()
|
/dports/graphics/xpdf/xpdf-4.03/splash/ |
H A D | SplashXPathScanner.h | 57 void moveSegmentAfter(SplashXPathSeg *s, SplashXPathSeg *sPrev);
|
/dports/graphics/xpdf4/xpdf-4.03/splash/ |
H A D | SplashXPathScanner.h | 57 void moveSegmentAfter(SplashXPathSeg *s, SplashXPathSeg *sPrev);
|
/dports/devel/gitblit/gitblit-1.8.0/WEB-INF/data/groovy/ |
H A D | fogbugz.groovy | 58 …* Example URL - http://bugs.yourdomain.com/fogbugz/cvsSubmit.asp?ixBug=bugID&sFile=file&sPrev=x&sN… 119 …// Example URL - http://bugs.salsalabs.com/fogbugz/cvsSubmit.asp?ixBug=bugID&sFile=file&sPrev=x&sN… 126 …def url = "${fogbugzUrl}/cvsSubmit.asp?ixBug=${bugId}&sFile=${file}&sPrev=${command.oldId.name}&sN…
|
/dports/cad/sumo/sumo-1.2.0/src/netimport/ |
H A D | NIImporter_OpenDrive.cpp | 2236 double sPrev = l.widthData.front().s; in findWidthSplit() local 2237 double wPrev = l.widthData.front().computeAt(sPrev); in findWidthSplit() 2245 << " s=" << sPrev in findWidthSplit() 2260 double splitPos = sPrev + (sEnd - sPrev) / fabs(w - wPrev) * changeDist; in findWidthSplit() 2270 if (splitPos < sPrev) { in findWidthSplit() 2274 splitPos = sPrev; in findWidthSplit() 2302 sPrev = sEnd; in findWidthSplit() 2345 double sPrev = l.widthData.front().s; in recomputeWidths() local 2346 double sPrevAbs = sPrev + sectionStart; in recomputeWidths() 2380 … std::cout << " atSPrev=" << sPrev << " w=" << (*it_w).computeAt(sPrev) << "\n"; in recomputeWidths() [all …]
|
/dports/misc/elki/elki-release0.7.1-1166-gfb1fffdf3/addons/batikvis/src/main/java/de/lmu/ifi/dbs/elki/visualization/visualizers/scatterplot/cluster/ |
H A D | EMClusterVisualization.java | 475 final double[] sPrev = plusTimes(cent, rPrev, scale); in drawArc() local 494 final double[] gPrev = plusTimes(sPrev, oPrev, KAPPA * scale * tp); in drawArc() 498 path.moveTo(sPrev); in drawArc()
|