23 #include <Box2D/Common/b2Math.h> 
  103     b2Assert(0 <= index && index < m_count);
 
  104     return m_vertices[index];
 
  110     float32 bestValue = b2Dot(m_vertices[0], d);
 
  111     for (int32 i = 1; i < m_count; ++i)
 
  113         float32 value = b2Dot(m_vertices[i], d);
 
  114         if (value > bestValue)
 
  127     float32 bestValue = b2Dot(m_vertices[0], d);
 
  128     for (int32 i = 1; i < m_count; ++i)
 
  130         float32 value = b2Dot(m_vertices[i], d);
 
  131         if (value > bestValue)
 
  138     return m_vertices[bestIndex];
 
uint8 indexA[3]
vertices on shape A 
Definition: b2Distance.h:61
const b2Vec2 & GetVertex(int32 index) const 
Get a vertex by index. Used by b2Distance. 
Definition: b2Distance.h:101
b2Vec2 pointA
closest point on shapeA 
Definition: b2Distance.h:80
b2Vec2 pointB
closest point on shapeB 
Definition: b2Distance.h:81
const b2Vec2 & GetSupportVertex(const b2Vec2 &d) const 
Get the supporting vertex in the given direction. 
Definition: b2Distance.h:124
float32 metric
length or area 
Definition: b2Distance.h:59
int32 iterations
number of GJK iterations used 
Definition: b2Distance.h:83
uint8 indexB[3]
vertices on shape B 
Definition: b2Distance.h:62
int32 GetVertexCount() const 
Get the vertex count. 
Definition: b2Distance.h:96
Output for b2Distance. 
Definition: b2Distance.h:78
Definition: b2Distance.h:29
Definition: b2Distance.h:57
int32 GetSupport(const b2Vec2 &d) const 
Get the supporting vertex index in the given direction. 
Definition: b2Distance.h:107
void Set(const b2Shape *shape, int32 index)
Definition: b2Distance.cpp:28
A 2D column vector. 
Definition: b2Math.h:53