Libraries.Game.Collision.Narrowphase.ConvexConvexPairSolver

This class contains actions that will help you solve for the closest points between two objects and the distance between these closest point

This action compares two object hash codes and returns an integer. The result is larger if this hash code is larger than the object passed as a parameter, smaller, or equal. In this case, -1 means smaller, 0 means equal, and 1 means larger. This action was changed in Quorum 7 to return an integer, instead of a CompareResult object, because the previous implementation was causing efficiency issues.

Example Code

Object o
        Object t
        integer result = o:Compare(t) //1 (larger), 0 (equal), or -1 (smalle

This action determines if two objects are equal based on their hash code values.

Example Code

use Libraries.Language.Object
        use Libraries.Language.Types.Text
        Object o
        Text t
        boolean result = o:Equals(

This action finds the closest points on object A to B and on object B to

This action gets the hash code for an object.

Example Code

Object o
        integer hash = o:GetHashCode

This action stores the shapes of object A and B that might be colliding and different solvers that are used to solve this collisio

This action stores a vector that could tell you whether the two objects are colliding or no

This action sets whether if you want to have an invisible shell around the objects that might collide or not. Having an invisible shell can make computations faster and more accurat

This action stores the shape of the first object that might be involved in the collisio

This action stores the shape of the second object that might be involved in the collisio

This action connects this ConvexConvexPairSolver to a ConvexConvexPenetrationDepthSolver for the actions inside ConvexConvexPenetrationDepthSolver to help with this ConvexConvexPairSolve