I would like to know, for the following cases, if the IEEE standard guarantees every possible case (excluding NaN and infinities) using any cpu adhering to the standard:
- Commutativity: x # y = y # x
- Associativity: (x # y) # z = x # (y # z)
- x - x = 0 (does x - x == 0.0f always return true?)
- x * 0 = 0 (does x * 0.0f == 0.0f always return true?)
- x * 1 = x (does x * 1.0f == x always return true?)
- x / x = 1.0f (does x / x == 1.0f always return true? Except for x = 0 of course)
(# means all operations: + - * /)