...
Operator | Description | Result |
---|---|---|
> | greater than | Returns a Boolean value (either true or false) |
>= | greater than or equal to | Returns a Boolean value (either true or false) |
== | equal to | Returns a Boolean value (either true or false) |
!= | not equal to | Returns a Boolean value (either true or false) |
<= | less than or equal to | Returns a Boolean value (either true or false) |
< | less than | Returns a Boolean value (either true or false) |
You can use more than one equality or relational operator in a formula. To combine operators you can use either the AND operator && or the OR operator || (two pipes) - see below. You can also use the AND() function or the OR() function.
...
Operator | Description | Result |
---|---|---|
&& | Boolean AND | Returns a Boolean value (either true or false) if both argument1 and argument2 are fulfilled |
|| (double pipe) | Boolean OR | Returns a Boolean value (either true or false) if either argument1 or argument2 is fulfilled |
! | Returns the opposite of a Boolean value | Returns true if the value was originally false, and returns false if the value was originally true |
...
Operator | Description | Result |
---|---|---|
~ | Unary bitwise complement | Performs a logical negation on every bit of a number represented in binary, if the bit is originally 1 then it returns 0 |
<< | Logical and arithmetic left shift | Both a logical and an arithmetic right shift multiply the integer by 2n where n is determined by you |
>> | Arithemtic right shift | Divides the integer by 2n where n is determined by you |
>>> | Logical right shift | A bitwise operation that shifts all bits of an operand to the right |
& | Bitwise AND | Compares the binary representation of two numbers as bit pairs and returns 1 if both bits of a pair are 1, or returns 0 if both bits or one bit of the pair is 0 |
| (pipe) | Bitwise inclusive OR | Compares the binary representation of two numbers as bit pairs and returns 1 if both or one of the bits of a pair are 1, or returns 0 if both bits of a pair are 0 |
...
Info |
---|
You can use a left or right shift to efficiently multiply or divide numbers using 2n. This process might be more efficient than using the operators * or / with large amounts of data. |
...