Double dispatch

Polymorphism
Ad hoc polymorphism Function overloading Operator overloading Parametric polymorphism Double dispatch Multiple dispatch Single & dynamic dispatch Subtyping Virtual function

In software engineering, double dispatch is a special form of multiple dispatch, and a mechanism that dispatches a function call to different concrete functions depending on the runtime types of two objects involved in the call. In most object-oriented systems, the concrete function that is called from a function call in the code depends on the dynamic type of a single object and therefore they are known as single dispatch calls, or simply virtual function calls.

Examples

Double dispatch is useful in situations where the choice of computation depends on the runtime types of its arguments. For example, a programmer could use double dispatch in the following situations:

Sorting a mixed set of objects algorithms require that a list of objects be sorted into some canonical order. Deciding if one element comes before another element requires knowledge of both types and possibly some subset of the fields.
Adaptive collision algorithms usually require that collisions between different objects be handled in different ways. A typical example is in a game environment where the collision between a spaceship and an asteroid is computed differently from the collision between a spaceship and a spacestation.^[1]
Painting algorithms that require the intersection points of overlapping sprites to be rendered in a different manner.
Personnel management systems may dispatch different types of jobs to different personnel. A schedule algorithm that is given a person object typed as an accountant and a job object typed as engineering rejects the scheduling of that person for that job.
Event handling systems that use both the event type and the type of the receptor object in order to call the correct event handling routine.
Lock and key systems where there are many types of locks and many types of keys and every type of key opens multiple types of locks. Not only do you need to know the types of the objects involved, but the subset of "information about a particular key that are relevant to seeing if a particular key opens a particular lock" is different between different lock types.

A common idiom

The common idiom, as in the examples presented above, is that the selection of the appropriate algorithm is based on the call's argument types at runtime. The call is therefore subject to all the usual additional performance costs that are associated with dynamic resolution of calls, usually more than in a language supporting only single method dispatch. In C++, for example, a dynamic function call is usually resolved by a single offset calculation - which is possible because the compiler knows the location of the function in the object's method table and so can statically calculate the offset. In a language supporting double dispatch, this is slightly more costly, because the compiler must generate code to calculate the method's offset in the method table at runtime, thereby increasing the overall instruction path length (by an amount that is likely to be no more than the total number of calls to the function, which may not be very significant).

Double dispatch is more than function overloading

At first glance, double dispatch appears to be a natural result of function overloading. Function overloading allows the function called to depend on the type of the argument. Function overloading, however, is done at compile time using "name mangling" where the internal name of the function has the argument's type encoded in it. So for example a function foo(int) may internally be called __foo_i and the function foo(double) may be called __foo_d. So there is no runtime overhead because there is no name collision and calling an overloaded function goes through at most one virtual table just like any other function. Dynamic dispatch is only based on the type of the calling object, meaning it uses virtual functions (overriding) instead of function overloading. Consider the following example, written in C++, of collisions in a game:

class SpaceShip {};
class ApolloSpacecraft : public SpaceShip {};

class Asteroid {
public:
  virtual void CollideWith(SpaceShip&) {
    cout << "Asteroid hit a SpaceShip" << endl;
  }
  virtual void CollideWith(ApolloSpacecraft&) {
    cout << "Asteroid hit an ApolloSpacecraft" << endl;
  }
};

class ExplodingAsteroid : public Asteroid {
public:
  virtual void CollideWith(SpaceShip&) {
    cout << "ExplodingAsteroid hit a SpaceShip" << endl;
  }
  virtual void CollideWith(ApolloSpacecraft&) {
    cout << "ExplodingAsteroid hit an ApolloSpacecraft" << endl;
  }
};

If you have

Asteroid theAsteroid;
SpaceShip theSpaceShip;
ApolloSpacecraft theApolloSpacecraft;

then, because of function overloading,

theAsteroid.CollideWith(theSpaceShip); 
theAsteroid.CollideWith(theApolloSpacecraft);

will print Asteroid hit a SpaceShip and Asteroid hit an ApolloSpacecraft respectively, without using any dynamic dispatch. Furthermore

ExplodingAsteroid theExplodingAsteroid;
theExplodingAsteroid.CollideWith(theSpaceShip); 
theExplodingAsteroid.CollideWith(theApolloSpacecraft);

will print ExplodingAsteroid hit a SpaceShip and ExplodingAsteroid hit an ApolloSpacecraft respectively, again without dynamic dispatch.

With a reference to an Asteroid, dynamic dispatch is used and

Asteroid& theAsteroidReference = theExplodingAsteroid;
theAsteroidReference.CollideWith(theSpaceShip); 
theAsteroidReference.CollideWith(theApolloSpacecraft);

prints ExplodingAsteroid hit a SpaceShip and ExplodingAsteroid hit an ApolloSpacecraft, again as expected. However,

SpaceShip& theSpaceShipReference = theApolloSpacecraft;
//note the type of the pointer and the type of the object.
theAsteroid.CollideWith(theSpaceShipReference);
theAsteroidReference.CollideWith(theSpaceShipReference);

The desired behaviour is to bind these calls to the function that takes theApolloSpacecraft as its argument, as that is the instantiated type of the variable, meaning the expected output would be Asteroid hit an ApolloSpacecraft and ExplodingAsteroid hit an ApolloSpacecraft, but the output is actually Asteroid hit a SpaceShip and ExplodingAsteroid hit a SpaceShip. The problem is that, while virtual functions are dispatched dynamically in C++, function overloading is done statically.

Double dispatch in C++

The problem described above can be resolved by simulating double dispatch, for example by using a visitor pattern. Suppose SpaceShip and ApolloSpacecraft both have the function

void CollideWith(Asteroid& inAsteroid) {
  inAsteroid.CollideWith(*this);
}

Then, while the previous example still does not work correctly, the following does:

SpaceShip& theSpaceShipReference = theApolloSpacecraft;
Asteroid& theAsteroidReference = theExplodingAsteroid;
theSpaceShipReference.CollideWith(theAsteroid);
theSpaceShipReference.CollideWith(theAsteroidReference);

It prints out Asteroid hit an ApolloSpacecraft and ExplodingAsteroid hit an ApolloSpacecraft, as expected. The key is that theSpaceShipReference.CollideWith(theAsteroidReference); does the following at run time:

theSpaceShipReference is a reference, so C++ looks up the correct method in the vtable. In this case, it will call ApolloSpacecraft::CollideWith(Asteroid&).
Within ApolloSpacecraft::CollideWith(Asteroid&), inAsteroid is a reference, so inAsteroid.CollideWith(*this) will result in another vtable lookup. In this case, inAsteroid is a reference to an ExplodingAsteroid so ExplodingAsteroid::CollideWith(ApolloSpacecraft&) will be called.

Double dispatch in Eiffel

The Eiffel programming language can bring the concept of agents to bear on the double-dispatch problem. The example below applies the agent language construct to the double-dispatch problem.

Consider a problem domain with various forms of SHAPE and of drawing SURFACE upon which to draw a SHAPE. Both SHAPE and SURFACE know about a function called `draw' in themselves, but not in each other. We want objects of the two types to co-variantly interact with each other in a double-dispatch using a visitor pattern.

The challenge is to get a polymorphic SURFACE to draw a polymorphic SHAPE on itself.

Output

The output example below shows the results of two SURFACE visitor objects being polymorphically passed over a list of polymorphic SHAPE objects. The visitor code pattern is only aware of SHAPE and SURFACE generically and not of the specific type of either. Instead, the code relies on run-time polymorphism and the mechanics of agents to achieve a highly flexible co-variant relationship between these two deferred classes and their descendants.

draw a red POLYGON on ETCHASKETCH
draw a red POLYGON on GRAFFITI_WALL
draw a grey RECTANGLE on ETCHASKETCH
draw a grey RECTANGLE on GRAFFITI_WALL
draw a green QUADRILATERAL on ETCHASKETCH
draw a green QUADRILATERAL on GRAFFITI_WALL
draw a blue PARALLELOGRAM on ETCHASKETCH
draw a blue PARALLELOGRAM on GRAFFITI_WALL
draw a yellow POLYGON on ETCHASKETCH
draw a yellow POLYGON on GRAFFITI_WALL
draw a purple RECTANGLE on ETCHASKETCH
draw a purple RECTANGLE on GRAFFITI_WALL

Setup

Before looking at SHAPE or SURFACE, we need to examine the high level decoupled use of our double-dispatch.

Visitor Pattern

The visitor pattern is always a visitor object visiting the elements of a data structure (e.g. list, tree and so on) polymorphically, applying some action (call or agent) against the polymorphic element objects in the visited target structure.

In our example below, we make a list of polymorphic SHAPE objects, visiting each of them with a polymorphic SURFACE, asking the SHAPE to be drawn on the SURFACE.

 1 	make
 2 			-- Print shapes on surfaces.
 3 		local
 4 			l_shapes: ARRAYED_LIST [SHAPE]
 5 			l_surfaces: ARRAYED_LIST [SURFACE]
 6 		do
 7 			create l_shapes.make (6)
 8 			l_shapes.extend (create {POLYGON}.make_with_color ("red"))
 9 			l_shapes.extend (create {RECTANGLE}.make_with_color ("grey"))
10 			l_shapes.extend (create {QUADRILATERAL}.make_with_color ("green"))
11 			l_shapes.extend (create {PARALLELOGRAM}.make_with_color ("blue"))
12 			l_shapes.extend (create {POLYGON}.make_with_color ("yellow"))
13 			l_shapes.extend (create {RECTANGLE}.make_with_color ("purple"))
14 
15 			create l_surfaces.make (2)
16 			l_surfaces.extend (create {ETCHASKETCH}.make)
17 			l_surfaces.extend (create {GRAFFITI_WALL}.make)
18 
19 			across l_shapes as ic_shapes loop
20 				across l_surfaces as ic_surfaces loop
21 					ic_surfaces.item.drawing_agent (ic_shapes.item.drawing_data_agent)
22 				end
23 			end
24 		end

We start by creating a collection of SHAPE and SURFACE objects. We then iterate over one of the lists (SHAPE), allowing elements of the other (SURFACE) to visit each of them in turn. In the example code above, SURFACE objects are visiting SHAPE objects.

The code makes a polymorphic call on {SURFACE}.draw indirectly by way of the `drawing_agent', which is the first call (dispatch) of the double-dispatch pattern. It passes an indirect and polymorphic agent (`drawing_data_agent'), allowing our visitor code to only know about two things:

What is the drawing agent of the surface (e.g. al_surface.drawing_agent on line #21)?
What is the drawing data agent of the shape (e.g. al_shape.drawing_data_agent on line #21)?

Because both SURFACE and SHAPE define their own agents, our visitor code is freed from having to know what is the appropriate call to make, polymorphically or otherwise. This level of indirection and decoupling is simply not achievable in other common languages like C, C++ and Java except through either some form of reflection or feature overloading with signature matching.

SURFACE

Within the polymorphic call to {SURFACE}.draw is the call to an agent, which becomes the second polymorphic call or dispatch in the double-dispatch pattern.

 1 	deferred class
 2 		SURFACE
 3 	
 4 	feature {NONE} -- Initialization
 5 	
 6 		make
 7 				-- Initialize Current.
 8 			do
 9 				drawing_agent := agent draw
10 			end
11 	
12 	feature -- Access
13 
14 		drawing_agent: PROCEDURE [ANY, TUPLE [STRING, STRING]]
15 				-- Drawing agent of Current.
16 	
17 	feature {NONE} -- Implementation
18 	
19 		draw (a_data_agent: FUNCTION [ANY, TUPLE, TUPLE [name, color: STRING]])
20 				-- Draw `a_shape' on Current.
21 			local
22 				l_result: TUPLE [name, color: STRING]
23 			do
24 				l_result := a_data_agent (Void)
25 				print ("draw a " + l_result.color + " " + l_result.name + " on " + type + "%N")
26 			end
27 	
28 		type: STRING
29 				-- Type name of Current.
30 			deferred end
31 	
32 	end

The agent argument in line #19 and call in line #24 are both polymorphic and decoupled. The agent is decoupled because the {SURFACE}.draw feature has no idea what class `a_data_agent' is based on. There is no way to tell what class the operation agent was derived from, so it does not have to come from SHAPE or one of its descendants. This is a distinct advantage of Eiffel agents over the single inheritance, dynamic and polymorphic binding of other languages.

The agent is dynamically polymorphic at run-time because the object is created in the moment it is needed, dynamically, where the version of the objectified routine is determined at that time. The only strongly bound knowledge is of the Result type of the agent signature -- that is -- a named TUPLE with two elements. However, this specific requirement is based on a demand of the enclosing feature (e.g. line #25 uses the named elements of the TUPLE to fulfill `draw' feature of SURFACE), which is necessary and has not been avoided (and perhaps cannot be).

Finally, note how only the `drawing_agent' feature is exported to ANY client! This means that the visitor pattern code (who is the ONLY client of this class) only needs to know about the agent to get its job done (e.g. using the agent as the feature applied to the visited objects).

SHAPE

The SHAPE class has the basis (e.g. drawing data) for what is drawn, perhaps on a SURFACE, but it does not have to be. Again, the agents provide the indirection and class agnostics required to make the co-variant relationship with SHAPE as decoupled as possible.

Additionally, please take note of the fact that SHAPE only provides `drawing_data_agent' as a fully exported feature to any client. Therefore, the only way to interact with SHAPE, other than creation, is through the facilities of the `drawing_data_agent', which is used by ANY client to indirectly and polymorphically gather drawing data for the SHAPE!

 1 	deferred class
 2 		SHAPE
 3 	
 4 	feature {NONE} -- Initialization
 5 	
 6 		make_with_color (a_color: like color)
 7 				-- Make with `a_color' as `color'.
 8 			do
 9 				color := a_color
10 				drawing_data_agent := agent drawing_data
11 			ensure
12 				color_set: color.same_string (a_color)
13 			end
14 
15 	feature -- Access
16 	
17 		drawing_data_agent: FUNCTION [ANY, TUPLE, like drawing_data]
18 				-- Data agent for drawing.
19 	
20 	feature {NONE} -- Implementation
21 	
22 		drawing_data: TUPLE [name: like name; color: like color]
23 				-- Data needed for drawing of Current.
24 			do
25 				Result := [name, color]
26 			end
27 	
28 		name: STRING
29 				-- Object name of Current.
30 			deferred end
31 	
32 		color: STRING
33 				-- Color of Current.
34 
35 	end

Classic Spaceship Example

A variation of the classic Spaceship example has one or more spaceship objects roaming about a universe filled with other items like rogue asteroids and space stations. What we want is a double-dispatch method for handling encounters (e.g. possible collisions) between two co-variant objects in our make-believe universe. In our example below, the output excursion of our USS Enterprise and USS Excelsior will be:

Starship Enterprise changes position from A-001 to A-002.
Starship Enterprise takes evasive action, avoiding Asteroid `Rogue 1'!
Starship Enterprise changes position from A-002 to A-003.
Starship Enterprise takes evasive action, avoiding Asteroid `Rogue 2'!
Starship Enterprise beams a science team to Starship Excelsior as they pass!
Starship Enterprise changes position from A-003 to A-004.
Starship Excelsior changes position from A-003 to A-005.
Starship Enterprise takes evasive action, avoiding Asteroid `Rogue 3'!
Starship Excelsior is near Space Station Deep Space 9 and is dockable.
Starship Enterprise changes position from A-004 to A-005.
Starship Enterprise beams a science team to Starship Excelsior as they pass!
Starship Enterprise is near Space Station Deep Space 9 and is dockable.

Visitor

The visitor for the classic Spaceship example also has a double-dispatch mechanism.

 1 make
 2 		-- Allow SPACESHIP objects to visit and move about in a universe.
 3 	local
 4 		l_universe: ARRAYED_LIST [SPACE_OBJECT]
 5 		l_enterprise,
 6 		l_excelsior: SPACESHIP
 7 	do
 8 		create l_enterprise.make_with_name ("Enterprise", "A-001")
 9 		create l_excelsior.make_with_name ("Excelsior", "A-003")
10 		create l_universe.make (0)
11 		l_universe.force (l_enterprise)
12 		l_universe.force (create {ASTEROID}.make_with_name ("Rogue 1", "A-002"))
13 		l_universe.force (create {ASTEROID}.make_with_name ("Rogue 2", "A-003"))
14 		l_universe.force (l_excelsior)
15 		l_universe.force (create {ASTEROID}.make_with_name ("Rogue 3", "A-004"))
16 		l_universe.force (create {SPACESTATION}.make_with_name ("Deep Space 9", "A-005"))
17 		visit (l_enterprise, l_universe)
18 		l_enterprise.set_position ("A-002")
19 		visit (l_enterprise, l_universe)
20 		l_enterprise.set_position ("A-003")
21 		visit (l_enterprise, l_universe)
22 		l_enterprise.set_position ("A-004")
23 		l_excelsior.set_position ("A-005")
24 		visit (l_enterprise, l_universe)
25 		visit (l_excelsior, l_universe)
26 		l_enterprise.set_position ("A-005")
27 		visit (l_enterprise, l_universe)
28 	end
29 feature {NONE} -- Implementation
30 visit (a_object: SPACE_OBJECT; a_universe: ARRAYED_LIST [SPACE_OBJECT])
31 		-- `a_object' visits `a_universe'.
32 	do
33 		across a_universe as ic_universe loop
34 			check attached {SPACE_OBJECT} ic_universe.item as al_universe_object then
35 				a_object.encounter_agent.call ([al_universe_object.sensor_data_agent])
36 			end
37 		end
38 	end

The double-dispatch can be see in line #35, where two indirect agents are working together to provide two co-variant calls working in perfect polymorphic concert with each other. The `a_object' of the `visit' feature has an `encounter_agent' which is called with the sensor data of the `sensor_data_agent' coming from the `al_universe_object'. The other interesting part of this particular example is the SPACE_OBJECT class and its `encounter' feature:

Visitor Action

The only exported features of a SPACE_OBJECT are the agents for encounter and sensor data, as well as the capacity to set a new position. As one object (the spaceship) visits each object in the universe, the sensor data is collected and passed to the visiting object in its encounter agent. There, the sensor data from the sensor_data_agent (that is -- the data element items of the sensor_data TUPLE as returned by the sensor_data_agent query) are evaluated against the current object and a course of action is taken based on that evaluation (see `encounter' in SPACE_OBJECT below). All other data is exported to {NONE}. This is similar to C, C++ and Java scopes of Private. As non-exported features, the data and routines are used only internally by each SPACE_OBJECT. Finally, note that encounter calls to `print' do not include specific information about possible descendant classes of SPACE_OBJECT! The only thing found at this level in the inheritance are general relational aspects based completely on what can be known from the attributes and routines of a general SPACE_OBJECT. The fact that the output of the `print' makes sense to us, as human beings, based on what we know or imagine about Star ships, space stations and asteroids is merely logical planning or coincidence. The SPACE_OBJECT is not programmed with any specific knowledge of it descendants.

 1 deferred class
 2 SPACE_OBJECT
 3 feature {NONE} -- Initialization
 4 make_with_name (a_name: like name; a_position: like position)
 5     -- Initialize Current with `a_name' and `a_position'.
 6   do
 7     name := a_name
 8     position := a_position
 9     sensor_data_agent := agent sensor_data
10     encounter_agent := agent encounter
11   ensure
12     name_set: name.same_string (a_name)
13     position_set: position.same_string (a_position)
14   end
15 feature -- Access
16 encounter_agent: PROCEDURE [ANY, TUPLE]
17     -- Agent for managing encounters with Current.
18 sensor_data_agent: FUNCTION [ANY, TUPLE, attached like sensor_data_anchor]
19     -- Agent for returning sensor data of Current.
20 feature -- Settings
21 set_position (a_position: like position)
22     -- Set `position' with `a_position'.
23   do
24     print (type + " " + name + " changes position from " + position + " to " + a_position + ".%N")
25     position := a_position
26   ensure
27     position_set: position.same_string (a_position)
28   end
29 feature {NONE} -- Implementation
30 encounter (a_sensor_agent: FUNCTION [ANY, TUPLE, attached like sensor_data_anchor])
31     -- Detect and report on collision status of Current with `a_radar_agent'.
32   do
33     a_sensor_agent.call ([Void])
34     check attached {like sensor_data_anchor} a_sensor_agent.last_result as al_sensor_data then
35       if not name.same_string (al_sensor_data.name) then
36         if (position.same_string (al_sensor_data.position)) then
37           if ((al_sensor_data.is_dockable and is_dockable) and
38               (is_manned and al_sensor_data.is_manned) and
39               (is_manueverable and al_sensor_data.is_not_manueverable)) then
40             print (type + " " + name + " is near " + al_sensor_data.type + " " +
41                 al_sensor_data.name + " and is dockable.%N")
42           elseif ((is_dockable and al_sensor_data.is_dockable) and
43                 (is_manned and al_sensor_data.is_manned) and
44                 (is_manueverable and al_sensor_data.is_manueverable)) then
45             print (type + " " + name + " beams a science team to " + al_sensor_data.type + " " +
46                 al_sensor_data.name + " as they pass!%N")
47           elseif (is_manned and al_sensor_data.is_not_manned) then
48             print (type + " " + name + " takes evasive action, avoiding " +
49                 al_sensor_data.type + " `" + al_sensor_data.name + "'!%N")
50           end
51         end
52       end
53     end
54   end
55 name: STRING
56     -- Name of Current.
57 type: STRING
58     -- Type of Current.
59   deferred
60   end
61 position: STRING
62     -- Position of Current.
63 is_dockable: BOOLEAN
64     -- Is Current dockable with another manned object?
65   deferred
66   end
67 is_manned: BOOLEAN
68     -- Is Current a manned object?
69   deferred
70   end
71 is_manueverable: BOOLEAN
72     -- Is Current capable of being moved?
73   deferred
74   end
75 sensor_data: attached like sensor_data_anchor
76     -- Sensor data of Current.
77   do
78       Result := [name, type, position, is_dockable, not is_dockable, is_manned, not is_manned, is_manueverable, not is_manueverable]
79     end
80 
81   sensor_data_anchor: detachable TUPLE [name, type, position: STRING; is_dockable, is_not_dockable, is_manned, is_not_manned, is_manueverable, is_not_manueverable: BOOLEAN]
82       -- Sensor data type anchor of Current.
83 
84 end

There are three descendant classes of SPACE_OBJECT:

SPACE_OBJECT
ASTEROID
SPACESHIP
SPACESTATION

In our example, the ASTEROID class is used for the `Rogue' items, SPACESHIP for the two star ships and SPACESTATION for Deep Space Nine. In each class, the only specialization is the setting of the `type' feature and of certain properties of the object. The `name' is supplied in the creation routine as well as the `position'. For example: Below is the SPACESHIP example.

 1 class
 2 SPACESHIP
 3 inherit
 4 SPACE_OBJECT
 5 create
 6 make_with_name
 7 feature {NONE} -- Implementation
 8 type: STRING = "Starship"
 9   -- <Precursor>
10 is_dockable: BOOLEAN = True
11   -- <Precursor>
12 is_manned: BOOLEAN = True
13   -- <Precursor>
14 is_manueverable: BOOLEAN = True
15   -- <Precursor>
16 end

So, any SPACESHIP in our universe is dock-able, manned and maneuverable. Other objects, like Asteroids are none of these things. A SPACESTATION, on the other hand, is both dock-able and manned, but is not maneuverable. Thus, when one object has an encounter with another, it first checks to see if the positions put them in the vicinity of each other and if they are, then the objects interact based upon their basic properties. Note that objects with the same type and name are considered to the same object, so an interaction is logically disallowed.

Eiffel Example Conclusion

With regards to double-dispatch, Eiffel allows the designer and programmer to further remove a level of direct object-to-object knowledge by decoupling class routines from their classes by way of making them agents and then passing those agents instead of making direct object feature calls. The agents also have specific signatures and possible results (in the case of queries), making them ideal static type checking vehicles without giving up specific object details. The agents are fully polymorphic so that the resulting code has only the specific knowledge required to get its local job done. Otherwise, there is no maintenance burden added by having specific internal class feature knowledge spread around many co-variant objects. The use and mechanics of agents ensure this. One possible downside of the use of agents is that an agent is computationally more expensive than its direct call counterpart. With this in mind, one ought never to presume the use of agents in the double-dispatch and their application in visitor patterns. If one can clearly see a design limit as to the domain of class types that will be involved in the co-variant interactions, then a direct call is the more efficient solution in terms of computational expense. However, if the class domain of participating types is expected to grow or differ substantially, then agents present an excellent solution to lessening the maintenance burden in the double-dispatch pattern.

References

↑ More Effective C++ by Scott Meyers(Addison-Wesley, 1996)

This article is issued from Wikipedia - version of the Sunday, March 27, 2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.