Libraries.Interface.Events.CollisionEvent2D

This class is used to represent collision between two 2D items. One CollisionEvent2D corresponds to one collision between the two items. This class also has a doubly linked list structure which allows you to access all of the collision events that has happened. This doubly linked list encompasses the collision that happened in the whole "world" of a certain game.

This action estimates the friction between the surface of the two 2D objects using friction mixing law such that if one object is frictionless then the surface between the two objects will have 0 friction as well.

This action estimates the restitution between the surface of the two 2D objects using restitution mixing law such that if one object is inelastic, then the other object will bounce off the inelastic object easily.

This action finds the collision point on the incident edge.

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 (smaller)

This action calculates if the collision has started or if the collision has been resolved. Using a CollisionListener, the user can change what would the responses of the system (ex. audio playback) and the objects be when the collision has begun or when the collision has ended.

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(t)

This action gets the hash code for an object.

Example Code

Object o
        integer hash = o:GetHashCode()

this assumes that each item is made up of one sha

let p2 be the most current evaluation of collisionPoin

calculate the new "collisionPoint

local collision poin

this would be the incident polyg

The starting point of the doubly linked list of collisions on the second item that is involved in the collision.

when the circles are NOT colliding, retu

True when the shapes are touchin

The first item involved in the collisio

you have to specify which "child" of itemA it i

The second item involved in the collisio

False when the user doesn't want to count this as an collisio

This action finds the collision point on the incident edge.

you have to specify which "child" of itemB it i

other way around, so flip them he

this would be the reference polyg

this stores the index of the reference ed

A becomes the indicent polyg

B becomes the reference polyg