From mboxrd@z Thu Jan 1 00:00:00 1970 X-Spam-Checker-Version: SpamAssassin 3.4.4 (2020-01-24) on polar.synack.me X-Spam-Level: X-Spam-Status: No, score=-1.3 required=5.0 tests=BAYES_00,INVALID_MSGID autolearn=no autolearn_force=no version=3.4.4 X-Google-Language: ENGLISH,ASCII-7-bit X-Google-Thread: 103376,5697899e4423465c X-Google-Attributes: gid103376,public From: dennison@telepath.com Subject: Re: Boolean Representation Date: 1998/09/25 Message-ID: <6ug5l7$tsb$1@nnrp1.dejanews.com>#1/1 X-Deja-AN: 394710821 References: <6udkcj$87j$1@nnrp1.dejanews.com> <6uecer$3sf$1@nnrp1.dejanews.com> X-Http-Proxy: 1.0 x6.dejanews.com:80 (Squid/1.1.22) for client 204.48.27.130 Organization: Deja News - The Leader in Internet Discussion X-Article-Creation-Date: Fri Sep 25 13:26:00 1998 GMT Newsgroups: comp.lang.ada X-Http-User-Agent: Mozilla/4.05 [en] (WinNT; I) Date: 1998-09-25T00:00:00+00:00 List-Id: In article , Keith Thompson wrote: > dennison@telepath.com writes: > > > In article <6udkcj$87j$1@nnrp1.dejanews.com>, > [...] > > I believe the only guarantee you get is that the value of True is larger than > > the value of False. > > I don't believe even that much is guaranteed. A compiler I worked on > used, for some targets, the representation (False => 0, True => -1) > (i.e., a literal True value was represented with all bits set to 1 > (2's-complement) rather than just the last bit set to 1). This made > tests and logical operations more efficient, at the expense of some > extra code for Boolean'Pos, Boolean'Val, "<", ">", etc. I suspect their claim would be: (False => 0, True => 2**32 - 1). -- T.E.D. -----== Posted via Deja News, The Leader in Internet Discussion ==----- http://www.dejanews.com/rg_mkgrp.xp Create Your Own Free Member Forum