🚀 go-pugleaf

In <<4iukhc$5nr@rdsunx.crd.ge.com>>, 
volpe@bart.crd.ge.com (Christopher R. Volpe) wrote:


>Alternatively, how about this:

>    return ((signed int) ((unsigned int)a - (unsigned int)b));


	That won't work.  First consider a=-32 and b = 31, which, with 16-bit
ints becomes:
   (signed int) ( (unsigned int) -32 - (unsigned int) 31 )
== (signed int)                65504 -                31  
== (signed int)                65473 
== -63 (a negative value, as it should)

	Now, multiple each value by 1000.  Since the relationship is the same,
we should again get a negative number, however:
   (signed int) ( (unsigned int) -32000 - (unsigned int) 31000 )
== (signed int) (                 33536 -                31000)
== (signed int) (                  2536)
== 2536 (a positiove value)