Home
last modified time | relevance | path

Searched refs:sPrev (Results 1 – 25 of 208) sorted by relevance

123456789

/dports/math/vtk6/VTK-6.2.0/Filters/FlowPaths/
H A DvtkDashedStreamLine.cxx41 vtkStreamer::StreamPoint *sPrev, *sPtr; in RequestData() local
92 sPrev = this->Streamers[ptId].GetStreamPoint(0); in RequestData()
96 xPrev[j] = sPrev->x[j]; in RequestData()
97 vPrev[j] = sPrev->v[j]; in RequestData()
99 scalarPrev = sPrev->s; in RequestData()
106 tOffset = sPrev->t; in RequestData()
115 while ( tOffset >= sPrev->t && tOffset < sPtr->t ) in RequestData()
117 r = (tOffset - sPrev->t) / (sPtr->t - sPrev->t); in RequestData()
121 x[j] = sPrev->x[j] + r * (sPtr->x[j] - sPrev->x[j]); in RequestData()
122 v[j] = sPrev->v[j] + r * (sPtr->v[j] - sPrev->v[j]); in RequestData()
[all …]
H A DvtkStreamLine.cxx58 vtkStreamer::StreamPoint *sPrev, *sPtr; in RequestData() local
118 sPrev = this->Streamers[ptId].GetStreamPoint(0); in RequestData()
126 tOffset = sPrev->t; in RequestData()
130 i++, sPrev=sPtr, sPtr=this->Streamers[ptId].GetStreamPoint(i) ) in RequestData()
135 while ( tOffset >= sPrev->t && tOffset < sPtr->t ) in RequestData()
137 r = (tOffset - sPrev->t) / (sPtr->t - sPrev->t); in RequestData()
141 x[j] = sPrev->x[j] + r * (sPtr->x[j] - sPrev->x[j]); in RequestData()
142 v[j] = sPrev->v[j] + r * (sPtr->v[j] - sPrev->v[j]); in RequestData()
152 s = sPrev->s + r * (sPtr->s - sPrev->s); in RequestData()
160 theta = sPrev->theta + r * (sPtr->theta - sPrev->theta); in RequestData()
H A DvtkStreamPoints.cxx46 vtkStreamer::StreamPoint *sPrev, *sPtr; in RequestData() local
97 for ( sPrev=sPtr=this->Streamers[ptId].GetStreamPoint(0), i=0; in RequestData()
99 i++, sPrev=sPtr, sPtr=this->Streamers[ptId].GetStreamPoint(i) ) in RequestData()
108 r = (tOffset - sPrev->t) / (sPtr->t - sPrev->t); in RequestData()
112 x[j] = sPrev->x[j] + r * (sPtr->x[j] - sPrev->x[j]); in RequestData()
113 v[j] = sPrev->v[j] + r * (sPtr->v[j] - sPrev->v[j]); in RequestData()
123 s = sPrev->s + r * (sPtr->s - sPrev->s); in RequestData()
/dports/math/vtk9/VTK-9.1.0/Filters/General/
H A DvtkHyperStreamline.cxx667 vtkHyperPoint *sPrev, *sPtr; in BuildTube() local
727 i = (sPrev->W[ix] > sPrev->W[iy] ? ix : iy); in BuildTube()
728 if (sPrev->W[i] == 0.0) in BuildTube()
742 dOffset = sPrev->D; in BuildTube()
752 r = (dOffset - sPrev->D) / (sPtr->D - sPrev->D); in BuildTube()
756 x[j] = sPrev->X[j] + r * (sPtr->X[j] - sPrev->X[j]); in BuildTube()
757 v[j] = sPrev->V[j][iv] + r * (sPtr->V[j][iv] - sPrev->V[j][iv]); in BuildTube()
758 r1[j] = sPrev->V[j][ix] + r * (sPtr->V[j][ix] - sPrev->V[j][ix]); in BuildTube()
759 r2[j] = sPrev->V[j][iy] + r * (sPtr->V[j][iy] - sPrev->V[j][iy]); in BuildTube()
760 w[j] = sPrev->W[j] + r * (sPtr->W[j] - sPrev->W[j]); in BuildTube()
[all …]
H A DvtkUncertaintyTubeFilter.cxx190 vtkTubePoint *sPrev, *sPtr, *sNext; in RequestData() local
272 sPrev = this->Tubes[k].GetTubePoint(npts - 2); in RequestData()
273 sPtr->V0[0] = sPtr->X[0] - sPrev->X[0]; in RequestData()
274 sPtr->V0[1] = sPtr->X[1] - sPrev->X[1]; in RequestData()
275 sPtr->V0[2] = sPtr->X[2] - sPrev->X[2]; in RequestData()
279 sPrev = this->Tubes[k].GetTubePoint(idx - 1); in RequestData()
281 v0[0] = sPtr->X[0] - sPrev->X[0]; in RequestData()
282 v0[1] = sPtr->X[1] - sPrev->X[1]; in RequestData()
283 v0[2] = sPtr->X[2] - sPrev->X[2]; in RequestData()
/dports/math/vtk8/VTK-8.2.0/Filters/General/
H A DvtkHyperStreamline.cxx663 vtkHyperPoint *sPrev, *sPtr; in BuildTube() local
724 i = (sPrev->W[ix] > sPrev->W[iy] ? ix : iy); in BuildTube()
725 if ( sPrev->W[i] == 0.0 ) in BuildTube()
739 dOffset = sPrev->D; in BuildTube()
749 r = (dOffset - sPrev->D) / (sPtr->D - sPrev->D); in BuildTube()
753 x[j] = sPrev->X[j] + r * (sPtr->X[j] - sPrev->X[j]); in BuildTube()
754 v[j] = sPrev->V[j][iv] + r * (sPtr->V[j][iv] - sPrev->V[j][iv]); in BuildTube()
755 r1[j] = sPrev->V[j][ix] + r * (sPtr->V[j][ix] - sPrev->V[j][ix]); in BuildTube()
756 r2[j] = sPrev->V[j][iy] + r * (sPtr->V[j][iy] - sPrev->V[j][iy]); in BuildTube()
757 w[j] = sPrev->W[j] + r * (sPtr->W[j] - sPrev->W[j]); in BuildTube()
[all …]
H A DvtkUncertaintyTubeFilter.cxx189 vtkTubePoint *sPrev, *sPtr, *sNext; in RequestData() local
270 sPrev = this->Tubes[k].GetTubePoint(npts-2); in RequestData()
271 sPtr->V0[0] = sPtr->X[0] - sPrev->X[0]; in RequestData()
272 sPtr->V0[1] = sPtr->X[1] - sPrev->X[1]; in RequestData()
273 sPtr->V0[2] = sPtr->X[2] - sPrev->X[2]; in RequestData()
277 sPrev = this->Tubes[k].GetTubePoint(idx-1); in RequestData()
279 v0[0] = sPtr->X[0] - sPrev->X[0]; in RequestData()
280 v0[1] = sPtr->X[1] - sPrev->X[1]; in RequestData()
281 v0[2] = sPtr->X[2] - sPrev->X[2]; in RequestData()
/dports/math/vtk6/VTK-6.2.0/Filters/General/
H A DvtkHyperStreamline.cxx653 vtkHyperPoint *sPrev, *sPtr; in BuildTube() local
714 i = (sPrev->W[ix] > sPrev->W[iy] ? ix : iy); in BuildTube()
715 if ( sPrev->W[i] == 0.0 ) in BuildTube()
729 dOffset = sPrev->D; in BuildTube()
739 r = (dOffset - sPrev->D) / (sPtr->D - sPrev->D); in BuildTube()
743 x[j] = sPrev->X[j] + r * (sPtr->X[j] - sPrev->X[j]); in BuildTube()
744 v[j] = sPrev->V[j][iv] + r * (sPtr->V[j][iv] - sPrev->V[j][iv]); in BuildTube()
745 r1[j] = sPrev->V[j][ix] + r * (sPtr->V[j][ix] - sPrev->V[j][ix]); in BuildTube()
746 r2[j] = sPrev->V[j][iy] + r * (sPtr->V[j][iy] - sPrev->V[j][iy]); in BuildTube()
747 w[j] = sPrev->W[j] + r * (sPtr->W[j] - sPrev->W[j]); in BuildTube()
[all …]
H A DvtkUncertaintyTubeFilter.cxx196 vtkTubePoint *sPrev, *sPtr, *sNext; in RequestData() local
277 sPrev = this->Tubes[k].GetTubePoint(npts-2); in RequestData()
278 sPtr->V[0][0] = sPtr->X[0] - sPrev->X[0]; in RequestData()
279 sPtr->V[0][1] = sPtr->X[1] - sPrev->X[1]; in RequestData()
280 sPtr->V[0][2] = sPtr->X[2] - sPrev->X[2]; in RequestData()
284 sPrev = this->Tubes[k].GetTubePoint(idx-1); in RequestData()
286 v0[0] = sPtr->X[0] - sPrev->X[0]; in RequestData()
287 v0[1] = sPtr->X[1] - sPrev->X[1]; in RequestData()
288 v0[2] = sPtr->X[2] - sPrev->X[2]; in RequestData()
/dports/math/vtk8/VTK-8.2.0/Common/DataModel/
H A DvtkPolyLine.cxx103 vtkVector3d sPrev, sNext; in GenerateSlidingNormals() local
111 sPrev = (pt2 - pt1).Normalized(); in GenerateSlidingNormals()
145 n = sPrev.Cross(sNext); in GenerateSlidingNormals()
149 sPrev = sNext; in GenerateSlidingNormals()
160 if (sPrev[i] != 0.0) in GenerateSlidingNormals()
164 normal[i] = -sPrev[(i+1)%3]/sPrev[i]; in GenerateSlidingNormals()
188 vtkVector3d w = sPrev.Cross(normal); in GenerateSlidingNormals()
195 vtkVector3d q = sNext.Cross(sPrev); in GenerateSlidingNormals()
212 vtkVector3d c = (sNext + sPrev).Normalized(); in GenerateSlidingNormals()
214 c = sPrev.Cross(q); in GenerateSlidingNormals()
[all …]
/dports/math/vtk9/VTK-9.1.0/Common/DataModel/
H A DvtkPolyLine.cxx98 vtkVector3d sPrev, sNext; in GenerateSlidingNormals() local
106 sPrev = (pt2 - pt1).Normalized(); in GenerateSlidingNormals()
140 n = sPrev.Cross(sNext); in GenerateSlidingNormals()
144 sPrev = sNext; in GenerateSlidingNormals()
155 if (sPrev[i] != 0.0) in GenerateSlidingNormals()
159 normal[i] = -sPrev[(i + 1) % 3] / sPrev[i]; in GenerateSlidingNormals()
183 vtkVector3d w = sPrev.Cross(normal); in GenerateSlidingNormals()
190 vtkVector3d q = sNext.Cross(sPrev); in GenerateSlidingNormals()
207 vtkVector3d c = (sNext + sPrev).Normalized(); in GenerateSlidingNormals()
209 c = sPrev.Cross(q); in GenerateSlidingNormals()
[all …]
/dports/math/vtk9/VTK-9.1.0/ThirdParty/vtkm/vtkvtkm/vtk-m/vtkm/worklet/
H A DTube.h163 sPrev = vtkm::Normal(p1 - p0); in operator()
190 sPrev = sNext; in operator()
200 if (sPrev[j] != 0) in operator()
204 normal[j] = -sPrev[(j + 1) % 3] / sPrev[j]; in operator()
236 c = vtkm::Cross(sPrev, q); in operator()
243 sPrev = sNext; in operator()
313 vtkm::Vec3f sPrev = sNext; in operator() local
322 sPrev = sNext; in operator()
332 sPrev = sNext; in operator()
342 auto s = (sPrev + sNext) / 2.; in operator()
[all …]
/dports/graphics/xpdf/xpdf-4.03/splash/
H A DSplashXPathScanner.cc90 SplashXPathSeg *sPrev; in insertSegmentBefore() local
92 sPrev = sNext->prev; in insertSegmentBefore()
93 sPrev->next = s; in insertSegmentBefore()
94 s->prev = sPrev; in insertSegmentBefore()
102 sPrev = s->prev; in removeSegment()
104 sPrev->next = sNext; in removeSegment()
105 sNext->prev = sPrev; in removeSegment()
110 SplashXPathSeg *sPrev) { in moveSegmentAfter() argument
116 sNext = sPrev->next; in moveSegmentAfter()
117 sPrev->next = s; in moveSegmentAfter()
[all …]
/dports/graphics/xpdf4/xpdf-4.03/splash/
H A DSplashXPathScanner.cc90 SplashXPathSeg *sPrev; in insertSegmentBefore() local
92 sPrev = sNext->prev; in insertSegmentBefore()
93 sPrev->next = s; in insertSegmentBefore()
94 s->prev = sPrev; in insertSegmentBefore()
102 sPrev = s->prev; in removeSegment()
104 sPrev->next = sNext; in removeSegment()
105 sNext->prev = sPrev; in removeSegment()
110 SplashXPathSeg *sPrev) { in moveSegmentAfter() argument
116 sNext = sPrev->next; in moveSegmentAfter()
117 sPrev->next = s; in moveSegmentAfter()
[all …]
/dports/math/vtk6/VTK-6.2.0/Common/DataModel/
H A DvtkPolyLine.cxx59 double sPrev[3], sNext[3], q[3], w[3], normal[3]; in GenerateSlidingNormals() local
100 sPrev[i] = pNext[i] - p[i]; in GenerateSlidingNormals()
101 sNext[i] = sPrev[i]; in GenerateSlidingNormals()
191 sPrev[i] = sNext[i]; in GenerateSlidingNormals()
202 vtkMath::Cross(sPrev,normal,w); in GenerateSlidingNormals()
210 vtkMath::Cross (sNext, sPrev, q); in GenerateSlidingNormals()
220 c[i] = sNext[i] + sPrev[i]; in GenerateSlidingNormals()
234 vtkMath::Cross(sPrev,q,c); in GenerateSlidingNormals()
/dports/devel/love07/love-HEAD/src/modules/physics/box2d/Source/Collision/
H A Db2CollidePoly.cpp133 float32 sPrev = EdgeSeparation(poly1, xf1, prevEdge, poly2, xf2); in FindMaxSeparation() local
134 if (sPrev > 0.0f) in FindMaxSeparation()
136 return sPrev; in FindMaxSeparation()
151 if (sPrev > s && sPrev > sNext) in FindMaxSeparation()
155 bestSeparation = sPrev; in FindMaxSeparation()
/dports/devel/love5/love-0.5-0/src/box2d/Source/Collision/
H A Db2CollidePoly.cpp133 float32 sPrev = EdgeSeparation(poly1, xf1, prevEdge, poly2, xf2); in FindMaxSeparation() local
134 if (sPrev > 0.0f) in FindMaxSeparation()
136 return sPrev; in FindMaxSeparation()
151 if (sPrev > s && sPrev > sNext) in FindMaxSeparation()
155 bestSeparation = sPrev; in FindMaxSeparation()
/dports/games/numptyphysics/numptyphysics/Box2D/Source/Collision/
H A Db2CollidePoly.cpp133 float32 sPrev = EdgeSeparation(poly1, xf1, prevEdge, poly2, xf2); in FindMaxSeparation() local
134 if (sPrev > 0.0f) in FindMaxSeparation()
136 return sPrev; in FindMaxSeparation()
151 if (sPrev > s && sPrev > sNext) in FindMaxSeparation()
155 bestSeparation = sPrev; in FindMaxSeparation()
/dports/devel/bullet/bullet3-3.21/src/BulletCollision/CollisionDispatch/
H A DbtBox2dBox2dCollisionAlgorithm.cpp184 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/graphics/blender/blender-2.91.0/extern/bullet2/src/BulletCollision/CollisionDispatch/
H A DbtBox2dBox2dCollisionAlgorithm.cpp184 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/supertuxkart/SuperTuxKart-1.2-src/lib/bullet/src/BulletCollision/CollisionDispatch/
H A DbtBox2dBox2dCollisionAlgorithm.cpp204 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/games/critterding/critterding-beta12/src/utils/bullet/BulletCollision/CollisionDispatch/
H A DbtBox2dBox2dCollisionAlgorithm.cpp204 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-tools/godot-3.2.3-stable/thirdparty/bullet/BulletCollision/CollisionDispatch/
H A DbtBox2dBox2dCollisionAlgorithm.cpp184 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/science/chrono/chrono-7.0.1/src/chrono/collision/bullet/BulletCollision/CollisionDispatch/
H A DbtBox2dBox2dCollisionAlgorithm.cpp184 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/graphics/urho3d/Urho3D-1.7.1/Source/ThirdParty/Bullet/src/BulletCollision/CollisionDispatch/
H A DbtBox2dBox2dCollisionAlgorithm.cpp190 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()

123456789