Path: utzoo!utgpu!news-server.csri.toronto.edu!mailrus!umich!samsung!uakari.primate.wisc.edu!unmvax!bbx!bbxsda!scott
From: scott@bbxsda.UUCP (Scott Amspoker)
Newsgroups: comp.std.c++
Subject: Re: "packed" objects (Oops! Forgot something!)
Message-ID: <921@bbxsda.UUCP>
Date: 1 Aug 90 21:52:44 GMT
References: <56159@microsoft.UUCP> <56165@microsoft.UUCP> <6785@netxcom.DHL.COM> <6786@netxcom.DHL.COM> <GSTEIN.90Jul31194438@goober.oracle.com> <MCGRATH.90Aug1122802@helen.Berkeley.EDU>
Reply-To: scott@bbxsda.UUCP (Scott Amspoker)
Organization: Basis International,  Albuquerque, NM
Lines: 16

In article <MCGRATH.90Aug1122802@helen.Berkeley.EDU> mcgrath@helen.Berkeley.EDU (Roland McGrath) writes:
>Are there any other arguments against allowing arbitrary reordering of
>structures?

Yes, I want to have a data structure with several different kinds of
nodes.  Each node contains common data that may be manipulated by
general purpose routines that do not need understand the rest of the
data in each node.  I want to be sure that the layout of each node
begins the same way.  I don't want to use a union since the nodes range 
in size from a few bytes to hundreds of bytes (the larger nodes being rare).

-- 
Scott Amspoker
Basis International, Albuquerque, NM
(505) 345-5232
unmvax.cs.unm.edu!bbx!bbxsda!scott