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: Simon Wright Subject: Re: Bit manipulation facilities in Ada Date: 1998/11/22 Message-ID: #1/1 X-Deja-AN: 414523669 X-NNTP-Posting-Host: pogner.demon.co.uk:158.152.70.98 References: <36573C4D.DA431821@physics.purdue.edu> <737gmk$9f1$1@nw001t.infi.net> <739bfk$u0g$1@nnrp1.dejanews.com> X-Complaints-To: abuse@demon.net X-Trace: news.demon.co.uk 911754846 nnrp-04:12537 NO-IDENT pogner.demon.co.uk:158.152.70.98 Organization: At Home Newsgroups: comp.lang.ada Date: 1998-11-22T00:00:00+00:00 List-Id: dewarr@my-dejanews.com writes: > Ada is far better than C for this purpose. In addition to > all the general (and quite correct) propaganda about the > general superiority of Ada, there is one particular feature > that is missing in Ada, namely packed bit arrays. In C you ^^^^^^^ 'present', I think? > have to program this your self, as an array of bytes, which > you then do bit manipulation on.