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: dennison@telepath.com Subject: Re: Bit manipulation facilities in Ada Date: 1998/11/23 Message-ID: <73c4qj$sps$1@nnrp1.dejanews.com>#1/1 X-Deja-AN: 414842455 References: <36573C4D.DA431821@physics.purdue.edu> <36575D47.43905794@bellsouth.net> X-Http-Proxy: 1.0 x12.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: Mon Nov 23 17:08:48 1998 GMT Newsgroups: comp.lang.ada X-Http-User-Agent: Mozilla/4.5 [en] (WinNT; I) Date: 1998-11-23T00:00:00+00:00 List-Id: In article <36575D47.43905794@bellsouth.net>, The Ludwig Family wrote: > Look in the index for "modular integers" and look under "arrays", in > particular one-dimensional boolean arrays. For both of these categories, > the operators "and", "or", "xor", and "not" are available. This point is worth emphasising, as it seems to be suprisingly little-known. This feature is very important for writing C and OS bindings as well. Create yourself an enumerated type with suitably descriptive names for each bit. Then create a packed array of booleans indexed by that type, and suddenly bit field operations actually become readable. -- T.E.D. -----------== Posted via Deja News, The Discussion Network ==---------- http://www.dejanews.com/ Search, Read, Discuss, or Start Your Own