Path: utzoo!utgpu!water!watmath!clyde!rutgers!mit-eddie!uw-beaver!uw-june!pardo
From: pardo@june.cs.washington.edu (David Keppel)
Newsgroups: comp.lang.c
Subject: Re: data alignment (was Re: RISC data alignment, in comp.arch)
Message-ID: <4232@june.cs.washington.edu>
Date: 17 Feb 88 22:01:59 GMT
References: <2635@calmasd.GE.COM> <28200092@ccvaxa> <496@ecrcvax.UUCP> <2309@umd5.umd.edu>
Reply-To: pardo@uw-june.UUCP (David Keppel)
Organization: U of Washington, Computer Science, Seattle
Lines: 18

[ Compiler rearranges structs for better mem use and/or no holes ]

In article <2309@umd5.umd.edu> chris@trantor.umd.edu (Chris Torek) writes:
>you throw the data items in a carry-sack and shake well, you
>have an unordered tangle of data.  Hence the proper name for
>an unordered aggregate type: a `bag'.

"Bag" is already defined (at least in Smalltalk ;-) as a set type that
allows replicated elements.  This also allegedly appears occasionally
in mathematics.

In a set, each element appears at most once.	{ Arf Barf Bork }
In a bag, elements can appear several times.	{ Arf Arf Barf Bork Bork }

>Next week: the `blender' datatype :-) .
Now _this_ I want to see!  ;-)

	;-D on  (Blender bender spender ender - no tab)  Pardo