Messages in this thread |  | | Date | Fri, 7 Sep 2001 13:03:12 -0500 (EST) | From | "Mark H. Wood" <> | Subject | Re: [IDEA+RFC] Possible solution for min()/max() war |
| |
On Fri, 7 Sep 2001, Horst von Brand wrote: [quote snipped] > C's unsigned arithmetic is 2-complement. Never even seen a 1-complement > machine.
CDC big iron. Seymour Cray found he could get a little more speed out of his design that way. IIRC SPSS on CDC gear used the -0 value to indicate a missing case.
-- Mark H. Wood, Lead System Programmer mwood@IUPUI.Edu Make a good day.
- To unsubscribe from this list: send the line "unsubscribe linux-kernel" in the body of a message to majordomo@vger.kernel.org More majordomo info at http://vger.kernel.org/majordomo-info.html Please read the FAQ at http://www.tux.org/lkml/
|  |