Commit 6093fa8a authored by Yuri Chornoivan's avatar Yuri Chornoivan
Browse files

Comment out unused parts of the code

parent 3918b186
......@@ -326,7 +326,7 @@ void b2DynamicTree::RemoveLeaf(int32 leaf)
parent = grandParent;
while (parent != b2_nullNode)
{
b2AABB oldAABB = m_nodes[parent].aabb;
//b2AABB oldAABB = m_nodes[parent].aabb;
m_nodes[parent].aabb.Combine(m_nodes[m_nodes[parent].child1].aabb, m_nodes[m_nodes[parent].child2].aabb);
b2Assert(m_nodes[parent].leafCount > 0);
......
......@@ -215,7 +215,7 @@ struct b2SeparationFunction
b2Vec2 normal = b2Mul(xfA.R, m_axis);
b2Vec2 pointA = b2Mul(xfA, m_localPoint);
b2Vec2 axisB = b2MulT(xfB.R, -normal);
//b2Vec2 axisB = b2MulT(xfB.R, -normal);
b2Vec2 localPointB = m_proxyB->GetVertex(indexB);
b2Vec2 pointB = b2Mul(xfB, localPointB);
......@@ -229,7 +229,7 @@ struct b2SeparationFunction
b2Vec2 normal = b2Mul(xfB.R, m_axis);
b2Vec2 pointB = b2Mul(xfB, m_localPoint);
b2Vec2 axisA = b2MulT(xfA.R, -normal);
//b2Vec2 axisA = b2MulT(xfA.R, -normal);
b2Vec2 localPointA = m_proxyA->GetVertex(indexA);
b2Vec2 pointA = b2Mul(xfA, localPointA);
......
......@@ -127,7 +127,7 @@ void b2ContactSolver::InitializeVelocityConstraints()
for (int32 j = 0; j < cc->pointCount; ++j)
{
b2ManifoldPoint* cp = manifold->points + j;
//b2ManifoldPoint* cp = manifold->points + j;
b2ContactConstraintPoint* ccp = cc->points + j;
ccp->rA = worldManifold.points[j] - bodyA->m_sweep.c;
......@@ -674,7 +674,7 @@ bool b2ContactSolver::SolveTOIPositionConstraints(qreal baumgarte, const b2Body*
b2ContactConstraint* c = m_constraints + i;
b2Body* bodyA = c->bodyA;
b2Body* bodyB = c->bodyB;
/*
qreal massA = 0.0f;
if (bodyA == toiBodyA || bodyA == toiBodyB)
{
......@@ -686,7 +686,7 @@ bool b2ContactSolver::SolveTOIPositionConstraints(qreal baumgarte, const b2Body*
{
massB = bodyB->m_mass;
}
*/
qreal invMassA = bodyA->m_mass * bodyA->m_invMass;
qreal invIA = bodyA->m_mass * bodyA->m_invI;
qreal invMassB = bodyB->m_mass * bodyB->m_invMass;
......
Markdown is supported
0% or .
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment