Libraries.Game.InputSet

Where the actual information is stored for the InputSet. Storing in this format allows for matching InputSets to be used as keys into a HashTable, even if the objects themselves have different hashcodes. The individual bits represent the following information: 1st to 8th bits: Integer value of the key or mouse input. 9th to 12th bits: What kind of input this is. Corresponds to one of the input constants. 13th to 14th bits: How the input is triggered. Can represent an input event beginning, finishing, or continuing. 15th to 16th bits: How many previous events should be registered before triggering this one. 17th bit: Shift key modifier - 1 if required, 0 otherwise. 18th bit: Control key modifier - 1 if required, 0 otherwise. 19th bit: Alt key modifier - 1 if required, 0 otherwise. 20th bit: Meta key modifier - 1 if required, 0 otherwis

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 sets the raw bitmask. It intentionally has a nasty technical to warn the user that this action should not be used unless you really, really, know what you are doin

This sets the raw bitmask. It intentionally has a nasty technical to warn the user that this action should not be used unless you really, really, know what you are doin