- a * b
- a / b
- a + b
- a - b
- a ^ b
- min(a, b)
- max(a, b)
- abs(a)
This requires* ceil() as part of the calculation.
More generally, it would also be nice to have the following formulas available:
- ceil(a, b)
- floor(a, b)
- clamp(a, b, c)
- mod(a, b) or a % b
- div(a, b) or a // b (integer division, python style - is the counterpart to mod)
- and(a, b)
- or(a, b)
- xor(a, b)
- a << b
- a >> b
- a == b (these comparisons return 1 or 0)
- a != b
- a < b
- a <= b
- a > b
- a >= b
*ceil can be implemented in terms of modulo, so parity with arithmetic combinators would suffice, although it's not elegant