Searched refs:m_v1 (Results 1 – 9 of 9) sorted by relevance
106 b2SimplexVertex* vertices = &m_v1; in ReadCache()153 const b2SimplexVertex* vertices = &m_v1; in WriteCache()166 return -m_v1.w; in GetSearchDirection()170 b2Vec2 e12 = m_v2.w - m_v1.w; in GetSearchDirection()171 float32 sgn = b2Cross(e12, -m_v1.w); in GetSearchDirection()199 return m_v1.w; in GetClosestPoint()202 return m_v1.a * m_v1.w + m_v2.a * m_v2.w; in GetClosestPoint()222 *pA = m_v1.wA; in GetWitnessPoints()223 *pB = m_v1.wB; in GetWitnessPoints()227 *pA = m_v1.a * m_v1.wA + m_v2.a * m_v2.wA; in GetWitnessPoints()[all …]
212 b2Vec2 m_v0, m_v1, m_v2, m_v3; member238 m_v1 = edgeA->m_vertex1; in Collide()245 b2Vec2 edge1 = m_v2 - m_v1; in Collide()248 float32 offset1 = b2Dot(m_normal1, m_centroidB - m_v1); in Collide()255 b2Vec2 edge0 = m_v1 - m_v0; in Collide()514 rf.v1 = m_v1; in Collide()523 rf.v2 = m_v1; in Collide()531 ie[0].v = m_v1; in Collide()629 float32 s = b2Dot(m_normal, m_polygonB.vertices[i] - m_v1); in ComputeEdgeSeparation()652 float32 s1 = b2Dot(n, m_polygonB.vertices[i] - m_v1); in ComputePolygonSeparation()
106 public final SimplexVertex m_v1 = new SimplexVertex(); field in Distance.Simplex109 public final SimplexVertex vertices[] = {m_v1, m_v2, m_v3};171 out.set(m_v1.w).negateLocal(); in getSearchDirection()174 e12.set(m_v2.w).subLocal(m_v1.w); in getSearchDirection()176 out.set(m_v1.w).negateLocal(); in getSearchDirection()211 out.set(m_v1.w); in getClosestPoint()215 case2.set(m_v1.w).mulLocal(m_v1.a).addLocal(case22); in getClosestPoint()239 pA.set(m_v1.wA); in getWitnessPoints()240 pB.set(m_v1.wB); in getWitnessPoints()244 case2.set(m_v1.wA).mulLocal(m_v1.a); in getWitnessPoints()[all …]
970 Vec2 m_v1 = new Vec2();1011 m_v1 = edgeA.m_vertex1;1018 edge1.set(m_v2).subLocal(m_v1);1021 float offset1 = Vec2.dot(m_normal1, temp.set(m_centroidB).subLocal(m_v1));1027 edge0.set(m_v1).subLocal(m_v0);1280 rf.v1.set(m_v1);1287 rf.v2.set(m_v1);1293 ie0.v.set(m_v1);1381 float tempx = v.x - m_v1.x;1382 float tempy = v.y - m_v1.y;[all …]
120 m_v1 = &m_src_vertices[0]; in vertex()122 m_curr_rest = m_v1->dist; in vertex()123 *x = m_v1->x; in vertex()124 *y = m_v1->y; in vertex()141 *x = m_v2->x - (m_v2->x - m_v1->x) * m_curr_rest / m_v1->dist; in vertex()142 *y = m_v2->y - (m_v2->y - m_v1->y) * m_curr_rest / m_v1->dist; in vertex()148 m_v1 = m_v2; in vertex()149 m_curr_rest = m_v1->dist; in vertex()
67 const vertex_dist* m_v1; variable
44 m_v1(v1) in btInternalVertexPair()46 if (m_v1>m_v0) in btInternalVertexPair()47 btSwap(m_v0,m_v1); in btInternalVertexPair()50 short int m_v1; member53 return m_v0+(m_v1<<16); in getHash()57 return m_v0==other.m_v0 && m_v1==other.m_v1; in equals()118 btVector3 edge = m_vertices[vp.m_v1]-m_vertices[vp.m_v0]; in initialize()
100 const tcu::Vector<deInt64,2> m_v1; member104 , m_v1(v1) in SubpixelLineSegment()110 return m_v1 - m_v0; in direction()184 const tcu::Vector<deInt64,2> u2 = ( p - l.m_v1); in vertexOnLineSegment()339 if (p != line.m_v0 && p != line.m_v1) in doesLineSegmentExitDiamond()359 const bool endIsOutside = !corners[ndx].pointInclusive || p != line.m_v1; in doesLineSegmentExitDiamond()367 if (p == line.m_v1) in doesLineSegmentExitDiamond()420 …const bool endVertexInside = LineRasterUtil::vertexOnLeftSideOfLine (line.m_v1, LineRasterUti… in doesLineSegmentExitDiamond()421 …(bounds[ndx].edgeInclusive && LineRasterUtil::vertexOnLine (line.m_v1, LineRasterUtil::SubpixelLin… in doesLineSegmentExitDiamond()467 m_v1 = v1; in init()[all …]
153 tcu::Vec4 m_v1; member in rr::TriangleRasterizer197 tcu::Vec4 m_v1; member in rr::SingleSampleLineRasterizer278 tcu::Vec4 m_v1; member in rr::LineExitDiamondGenerator