BEPUphysics.CollisionTests.CollisionAlgorithms.GJK.PairSimplex.VerifyContributions C# (CSharp) Метод

        internal void VerifyContributions()
        {
            switch (State)
            {
                case SimplexState.Point:
                    if (Vector3.Distance(SimplexA.A - SimplexB.A, A) > .0001f)
                        Debug.WriteLine("break.");
                    break;
                case SimplexState.Segment:
                    if (Vector3.Distance(SimplexA.A - SimplexB.A, A) > .0001f)
                        Debug.WriteLine("break.");

                    if (Vector3.Distance(SimplexA.B - SimplexB.B, B) > .0001f)
                        Debug.WriteLine("break.");
                    break;
                case SimplexState.Triangle:
                    if (Vector3.Distance(SimplexA.A - SimplexB.A, A) > .0001f)
                        Debug.WriteLine("break.");

                    if (Vector3.Distance(SimplexA.B - SimplexB.B, B) > .0001f)
                        Debug.WriteLine("break.");

                    if (Vector3.Distance(SimplexA.C - SimplexB.C, C) > .0001f)
                        Debug.WriteLine("break.");
                    break;

                case SimplexState.Tetrahedron:
                    if (Vector3.Distance(SimplexA.A - SimplexB.A, A) > .0001f)
                        Debug.WriteLine("break.");

                    if (Vector3.Distance(SimplexA.B - SimplexB.B, B) > .0001f)
                        Debug.WriteLine("break.");

                    if (Vector3.Distance(SimplexA.C - SimplexB.C, C) > .0001f)
                        Debug.WriteLine("break.");

                    if (Vector3.Distance(SimplexA.D - SimplexB.D, D) > .0001f)
                        Debug.WriteLine("break.");
                    break;
            }
        }
    }