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,20c9d010cae7756
X-Google-Attributes: gid103376,public
From: bobduff@world.std.com (Robert A Duff)
Subject: Re: Bit Manipulation Functions
Date: 1996/09/05
Message-ID: <Dx8HHy.7Dw@world.std.com>#1/1
X-Deja-AN: 178571504
references: <mulcihy-0409961432530001@139.169.215.63>
organization: The World Public Access UNIX, Brookline, MA
newsgroups: comp.lang.ada
Date: 1996-09-05T00:00:00+00:00
List-Id: <comp.lang.ada>


In article <mulcihy-0409961432530001@139.169.215.63>,
David Mulcihy <mulcihy@pat.mdc.com> wrote:
>Is there a library of Ada bit manipulation functions somewhere?

Can you be more specific about what sort of bit manipulation you want to
do?  Some bit manipulation is built into the language.  For example, a
packed array of Booleans has "and", "or", "xor", and "not" built in.
Also, modular types have these operations.

Extracting bit fields from words can be done by declaring a one-word
record with a pragma Pack, or a record_rep_clause.

I assume you want something else...

- Bob