Re: Multiple interface inheritance workaround in Ada 95 / Ada 0x to satisfy a Java language advocate?

[Robert A Duff <bobduff@shell01.TheWorld.com>]

Jim Rogers <jimmaureenrogers@worldnet.att.net> writes:

> I am not strong on C++ so I will deal with the Java example above.
> All Java objects are accessed through references. This is equivalent
> to having all Ada object accessed through access to class types.

To mimic Java in this way, it seems that (in addition to what you said
above), you have to derive everything ultimately from one root type.
This happens automatically in Java, but in Ada it requires planning
ahead, which is impossible when combining two independently-developed
pieces of code.

> The Ada equivalent for a tagged type is:
> 
> type I1_Access is access all I1'Class;
> type I2_Access is access all I2'Class;
> 
> procedure f(item : in I1_Access)
>     temp : I2_Access;
> begin
>     if item.all in I2'Class then

But this is illegal, unless I1 and I2 are "related" to each other.

>        temp := item;

This needs to be "temp := I2_Access(item);", which is again illegal
in the same circumstance.

>     end if;
> end f;
> 
> Note that this performs a lookup similar to what you describe.

By the way, the ARG is working on a feature that mimics Java's
interfaces (i.e., multiple inheritance without the pain), but I
don't think it does what Hyman Rosen wanted.  (OK, he didn't say he
*wanted* it; he just said that C++ supports it.)

I would like to see an example of why it is wanted.  On the face of it,
it seems weird to reach off into the far distance and ask whether this
thing I have my hands on just *happens* to obey some totally unrelated
interface.

- Bob