problems with empty base layout algorithm

[Daveed Vandevoorde]

allen.chan at ca.ibm.com wrote:
[...]
> Using the above algorithm, we will get:
> 
> 1. The empty base B will be allocated at offset zero.
> 2. The empty base C will be allocated at offset one. Update ebase(F) = 1.
> 3. The empty base D will be allocated at offset two. Update ebase(F) = 2.
> 4. The base E will be allocated at dsize(F), which is zero.
> 5. sizeof(F) = max(sizeof(F), ebase(F)) = max(4, 2) = 4.
> 
> All comments are welcome.

It seems strange to allow subobjects to be allocated in the middle of another
subobject no?  It feels similar to the idea of interleaving field allocation.

	Daveed