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,1922c4740861327c X-Google-Attributes: gid103376,public From: dewarr@my-dejanews.com Subject: Re: Bit manipulation facilities in Ada Date: 1998/11/22 Message-ID: <739bkp$u3p$1@nnrp1.dejanews.com>#1/1 X-Deja-AN: 414486320 References: <36573C4D.DA431821@physics.purdue.edu> X-Http-Proxy: 1.0 x13.dejanews.com:80 (Squid/1.1.22) for client 205.232.38.14 Organization: Deja News - The Leader in Internet Discussion X-Article-Creation-Date: Sun Nov 22 15:46:37 1998 GMT Newsgroups: comp.lang.ada X-Http-User-Agent: Mozilla/4.04 [en] (OS/2; I) Date: 1998-11-22T00:00:00+00:00 List-Id: In article , matthew_heaney@acm.org (Matthew Heaney) wrote: > For example, your professor may not realize that if you > use a rep clause on a > record, then no explicit bit manipulation by the client > is required. That's a weak point, since C can also do the equivalent of rep clauses on records, or close to it, with bit field specifications (indeed for quite a while GNAT translated all record rep clauses to corresponding C structs with bit fields). -----------== Posted via Deja News, The Discussion Network ==---------- http://www.dejanews.com/ Search, Read, Discuss, or Start Your Own