Path: csiph.com!x330-a1.tempe.blueboxinc.net!feeder1.hal-mli.net!weretis.net!feeder4.news.weretis.net!news.musoftware.de!wum.musoftware.de!news.swapon.de!eternal-september.org!feeder.eternal-september.org!.POSTED!not-for-mail
From: markspace <-@.>
Newsgroups: comp.lang.java.programmer
Subject: Re: Java puzzler
Date: Thu, 12 May 2011 17:40:45 -0700
Organization: A noiseless patient Spider
Lines: 13
Message-ID: <iqhumi$750$1@dont-email.me>
References: <4db69c13-878f-4806-adb2-a3c5adb1c48c@glegroupsg2000goo.googlegroups.com> <qrGdnWE1mOKFHVfQnZ2dnUVZ_uKdnZ2d@earthlink.com> <alpine.DEB.2.00.1105112141410.27211@urchin.earth.li> <I6SdnROEzeMni1bQnZ2dnUVZ_sKdnZ2d@earthlink.com> <alpine.DEB.2.00.1105122029030.7602@urchin.earth.li> <-8mdnSRPEIdA21HQnZ2dnUVZ_j2dnZ2d@earthlink.com> <iqhhim$blg$4@speranza.aioe.org> <iqhjks$798$1@dont-email.me> <AcCdnflMosQt-lHQnZ2dnUVZ_t2dnZ2d@earthlink.com>
Mime-Version: 1.0
Content-Type: text/plain; charset=ISO-8859-1; format=flowed
Content-Transfer-Encoding: 7bit
Injection-Date: Fri, 13 May 2011 00:40:50 +0000 (UTC)
Injection-Info: mx01.eternal-september.org; posting-host="IPG0uhtItDWol02AtwWFWQ"; logging-data="7328"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/qHKOLLN+U6ZvHyPhJXYkgV2YU1otL0Xk="
User-Agent: Mozilla/5.0 (Windows; U; Windows NT 6.1; en-US; rv:1.9.2.17) Gecko/20110414 Thunderbird/3.1.10
In-Reply-To: <AcCdnflMosQt-lHQnZ2dnUVZ_t2dnZ2d@earthlink.com>
Cancel-Lock: sha1:k6U7NqM9vy6hdGGU9QKrRaGAhJY=
Xref: x330-a1.tempe.blueboxinc.net comp.lang.java.programmer:4027

On 5/12/2011 4:05 PM, Patricia Shanahan wrote:

> If (byte)100 + (byte)100 caused an overflow, I would need an unsigned
> byte type to do the same job.

OK, I think I understand.  If the goal is to allow unsigned arithmetic 
with automatic overflow detection, they we'd have to add unsigned 
integer primitives to the language.

If the goal is only to provide automatic overflow detection for the 
existing types however, I don't think that any additional unsigned types 
would be required.