Under this assumption, many small things can be optimized, for example:
x == x → 1x * 1 → xx >= y→ !(x < y)and the like.x/x→ 1if the compiler can prove it x != 0.- it can allow the compiler to use the hardware max / min commands for type expressions
x > y ? x : y. - ...
, " ", , :
x - x → 00 / x → 0x * 0 → 0