Re: Multiple dispatch

[Natasha Kerensikova <lithiumcat@gmail.com>]

Hello,

On 2011-06-11, Dmitry A. Kazakov <mailbox@dmitry-kazakov.de> wrote:
> On Sat, 11 Jun 2011 15:19:00 +0200, Yannick Duchêne (Hibou57) wrote:
>
>> Le Sat, 11 Jun 2011 13:52:05 +0200, Dmitry A. Kazakov  
>> <mailbox@dmitry-kazakov.de> a écrit:
>>> Yes, that looks like the usual pattern for protocols and similar stuff,
>>> when objects do not depend on the container.
>> What kind of dependencies do you have in mind ? Object existence depending  
>> on the container ? Or object's properties depending on the container ?
>
> Any dependencies (correlations). Imagine the dispatching table. It is a 2D
> matrix for double dispatch. In full dispatch the table is irregular, i.e.
> there is no preferred way to index this matrix either by columns or by
> rows.

I remember having faced that kind of issues with C through dynamic
linker introspection : there is a function that returns a function
pointer corresponding to the given symbol name. I crafted the symbol
name using an operation like
"dispatch_prefix_" & First_Tag & "_" & Second_Tag

This makes the dispatch table completely isotropic and allows to
implement any element of the matrix in any compilation unit (as long as
it is linked (statically or dynamically) to the final binary). I found
this feature very nice when the "glue" between the row type and the
column type does not obviously belong to either type (in the original
example, that would be a very special representation of a given general
data type in a given general container).

I guess the introspection of object files is too low level for Ada, and
even importing libdl from C wouldn't be of much use because of the
name-mangling performed by Ada compiler (or you have to use C symbol
names and give up namespaces, case-insensitivity and other cool Ada
features).

I know other high-level languages do have introspection mechanisms, but
I haven't seen anything like that in Ada. Have I missed them?


Natasha