g++ and aliasing bools

[Paolo Carlini]

Mark Mitchell wrote:

> Your proof has at least one bug.  A type that has no baseclasses or
> virtuals can contain (as a data member) a type that does; such a type
> is at least as complex as the contained type.  (Similarly, an array
> of classes with virtual bases, etc.)  You need to recurse through the
> type structure.

Mark, is this really hard to implement??

My feeling is that this first improvement step should not be terribly difficult
to implement and also not terribly difficult to prove correct!

Cheers,
Paolo.