/external/libgdx/extensions/gdx-box2d/gdx-box2d/jni/Box2D/Collision/ |
b2Distance.cpp | 106 b2SimplexVertex* vertices = &m_v1; 153 const b2SimplexVertex* vertices = &m_v1; 166 return -m_v1.w; 170 b2Vec2 e12 = m_v2.w - m_v1.w; 171 float32 sgn = b2Cross(e12, -m_v1.w); 199 return m_v1.w; 202 return m_v1.a * m_v1.w + m_v2.a * m_v2.w; 222 *pA = m_v1.wA; 223 *pB = m_v1.wB 268 b2SimplexVertex m_v1, m_v2, m_v3; member in struct:b2Simplex [all...] |
b2CollideEdge.cpp | 212 b2Vec2 m_v0, m_v1, m_v2, m_v3; member in struct:b2EPCollider 238 m_v1 = edgeA->m_vertex1; 245 b2Vec2 edge1 = m_v2 - m_v1; 248 float32 offset1 = b2Dot(m_normal1, m_centroidB - m_v1); 255 b2Vec2 edge0 = m_v1 - m_v0; 514 rf.v1 = m_v1; 523 rf.v2 = m_v1; 531 ie[0].v = m_v1; 629 float32 s = b2Dot(m_normal, m_polygonB.vertices[i] - m_v1); 652 float32 s1 = b2Dot(n, m_polygonB.vertices[i] - m_v1); [all...] |
/external/pdfium/third_party/agg23/ |
agg_vcgen_dash.cpp | 120 m_v1 = &m_src_vertices[0]; 122 m_curr_rest = m_v1->dist; 123 *x = m_v1->x; 124 *y = m_v1->y; 141 *x = m_v2->x - (m_v2->x - m_v1->x) * m_curr_rest / m_v1->dist; 142 *y = m_v2->y - (m_v2->y - m_v1->y) * m_curr_rest / m_v1->dist; 148 m_v1 = m_v2; 149 m_curr_rest = m_v1->dist [all...] |
agg_vcgen_dash.h | 67 const vertex_dist* m_v1; member in class:agg::vcgen_dash
|
/external/libgdx/extensions/gdx-box2d/gdx-box2d-gwt/src/com/badlogic/gdx/physics/box2d/gwt/emu/org/jbox2d/collision/ |
Distance.java | 106 public final SimplexVertex m_v1 = new SimplexVertex(); field in class:Distance.Simplex 109 public final SimplexVertex vertices[] = {m_v1, m_v2, m_v3}; 171 out.set(m_v1.w).negateLocal(); 174 e12.set(m_v2.w).subLocal(m_v1.w); 176 out.set(m_v1.w).negateLocal(); 211 out.set(m_v1.w); 215 case2.set(m_v1.w).mulLocal(m_v1.a).addLocal(case22); 239 pA.set(m_v1.wA); 240 pB.set(m_v1.wB) [all...] |
Collision.java | 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); [all...] |
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/CollisionShapes/ |
btConvexPolyhedron.cpp | 44 m_v1(v1) 46 if (m_v1>m_v0) 47 btSwap(m_v0,m_v1); 50 short int m_v1; member in struct:btInternalVertexPair 53 return m_v0+(m_v1<<16); 57 return m_v0==other.m_v0 && m_v1==other.m_v1; 118 btVector3 edge = m_vertices[vp.m_v1]-m_vertices[vp.m_v0];
|
/external/deqp/framework/referencerenderer/ |
rrRasterizer.hpp | 153 tcu::Vec4 m_v1; member in class:rr::TriangleRasterizer 197 tcu::Vec4 m_v1; member in class:rr::SingleSampleLineRasterizer 278 tcu::Vec4 m_v1; member in class:rr::LineExitDiamondGenerator
|
rrRasterizer.cpp | 100 const tcu::Vector<deInt64,2> m_v1; member in struct:rr::LineRasterUtil::SubpixelLineSegment 104 , m_v1(v1) 110 return m_v1 - m_v0; 184 const tcu::Vector<deInt64,2> u2 = ( p - l.m_v1); 339 if (p != line.m_v0 && p != line.m_v1) 359 const bool endIsOutside = !corners[ndx].pointInclusive || p != line.m_v1; 367 if (p == line.m_v1) 420 const bool endVertexInside = LineRasterUtil::vertexOnLeftSideOfLine (line.m_v1, LineRasterUtil::SubpixelLineSegment(bounds[ndx].p0, bounds[ndx].p1)) || 421 (bounds[ndx].edgeInclusive && LineRasterUtil::vertexOnLine (line.m_v1, LineRasterUtil::SubpixelLineSegment(bounds[ndx].p0, bounds[ndx].p1))); 467 m_v1 = v1 [all...] |