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.9 required=5.0 tests=BAYES_00 autolearn=ham autolearn_force=no version=3.4.4 X-Google-Thread: 103376,553a6b79b2471571 X-Google-Attributes: gid103376,public X-Google-Language: ENGLISH,ASCII-7-bit Path: g2news2.google.com!news3.google.com!border1.nntp.dca.giganews.com!nntp.giganews.com!newscon06.news.prodigy.com!prodigy.net!newsfeed-00.mathworks.com!nntp.TheWorld.com!not-for-mail From: Robert A Duff Newsgroups: comp.lang.ada Subject: Re: How do you bitwise operations in Ada '83 and '95 Date: 18 Jul 2006 14:45:15 -0400 Organization: The World Public Access UNIX, Brookline, MA Message-ID: References: <1153244316.853254.291560@m79g2000cwm.googlegroups.com> NNTP-Posting-Host: shell01.theworld.com Mime-Version: 1.0 Content-Type: text/plain; charset=us-ascii X-Trace: pcls4.std.com 1153248315 3289 192.74.137.71 (18 Jul 2006 18:45:15 GMT) X-Complaints-To: abuse@TheWorld.com NNTP-Posting-Date: Tue, 18 Jul 2006 18:45:15 +0000 (UTC) User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.2 Xref: g2news2.google.com comp.lang.ada:5776 Date: 2006-07-18T14:45:15-04:00 List-Id: "Chris L" writes: > Also, do you have small coding examples that demonstrate this? If you just want bitwise logical operators, then you want an array of Boolean. Probably with pragma Pack. This works in Ada 83, 95, and 05. If you want to mix bitwise logical operators with arithmetic and the like, then you want to use modular types, which are not available in Ada 83. - Bob