* Joe Buck: > I'm sure there are plenty of production codes that assume signed integer > overflow wraps, or at least make the weaker assumption that in > > a = b + c + d; > > where all variables are integers, if one of the intermediate terms > can't be represented in an integer, we still get the correct result > if the final result is representable in an integer.
There's also a fair amount of code whih relies on -1 == (int)0xFFFFFFFF. Or is there any truly portable and efficient way to convert a sequence of bytes (in big-endian order) to a signed integer?
