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,d23a9c52d1958b6a
X-Google-Attributes: gid103376,public
From: tmoran@bix.com
Subject: Re: Problem to dramatize packed-array/rep-clause difficulties
Date: 1996/03/28
Message-ID: <4jdcf6$7gc@news2.delphi.com>#1/1
X-Deja-AN: 144634309
organization: Delphi Internet Services Corporation
newsgroups: comp.lang.ada
Date: 1996-03-28T00:00:00+00:00
List-Id: <comp.lang.ada>

>Well what you are really talking about here is a repeated pattern of
>nine byte containing eight fields, so clearly the best approach ...
>if you have such a strange structure (it is one for which I have
  Of course an array of n bit fields will always have the packing
pattern repeat after Least Common Multiple(n,8) bits, and thus
can be viewed as an array of LCM(n,8)/8 -byte records, each containing
LCM(n,8)/n fields.  If access to the J-th of a packed array of n-bit
items is most efficiently implemented on a particular machine by using
a case statement on the J/(LCM(n,8)/n)-th group, then by definition a
'smart' compiler for that machine does it that way.