Comments on: Unsigned comparison in Java/Scala

By: Unsigned comparisons in Java | Optimi

Unsigned comparisons in Java | Optimi — Fri, 10 Dec 2010 20:11:22 +0000

[...] without using horribly inefficient BigIntegers. After testing a few ideas I came up with against some code by Tamutnefret of Freenode’s ##java, I found his code was [...]

By: Anon

Anon — Tue, 05 Aug 2008 22:23:28 +0000

So it returns true if “i >= j”?

By: Tony Garnock-Jones

Tony Garnock-Jones — Tue, 05 Aug 2008 02:28:51 +0000

(Oh dear. Less-than/greater-than munging obliterated the fully spelled-out version at the end of the previous comment.)

By: Tony Garnock-Jones

Tony Garnock-Jones — Tue, 05 Aug 2008 02:27:59 +0000

Here’s another way of reading it:

“(i < 0) ^ (j < 0)” reads as “i and j have different signs”.

So the whole thing reads “i less than j, xor i and j have different signs”, so

– either i j, and i and j have differing signs

By: david

david — Mon, 04 Aug 2008 22:01:18 +0000

A truth table is just a way of laying out the answers. It doesn’t omit the burden of actually proving each case, which is what I did there.