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,81bce7ee9133fb42
X-Google-Attributes: gid103376,public
From: dewar@cs.nyu.edu (Robert Dewar)
Subject: Re: GNAT Ada for DOS - Reading Integers Problem
Date: 1996/02/23
Message-ID: <dewar.825137575@schonberg>#1/1
X-Deja-AN: 140885609
references: <4g2efj$d5d@susscsc1.rdg.ac.uk>
 <Dn33HL.ICr@lazrus.cca.rockwell.com> <4gdivm$10f5@watnews1.watson.ibm.com>
 <dewar.824906918@schonberg> <Dn8ItA.B9H@world.std.com>
organization: Courant Institute of Mathematical Sciences
newsgroups: comp.lang.ada
Date: 1996-02-23T00:00:00+00:00
List-Id: <comp.lang.ada>

"Would it not be pretty easy to implement, if you restrict it to
components that exactly fit in 1, 2, or 4 bytes -- that is, avoid the
cases that cause non-contiguous bit fields?  These are probably the
cases people want most of the time anyway.

It is correct that the RM does not require the feature.  (Actually, it
*does* require the feature on machines where the storage element is a
word -- but such machines aren't too common anymore.)"

Yes, it would be much easier to implement with this restriction, but in
my experience, this would be a very significant restriction.
dp