DynBindModelExamples: Difference between revisions
| Line 8: | Line 8: | ||
|<code>[eiffel, N] | |<code>[eiffel, N] | ||
class | class | ||
A | |||
feature | feature | ||
f1 do ... end | f1 do ... end | ||
| Line 17: | Line 17: | ||
<code>[eiffel, N] | <code>[eiffel, N] | ||
class | class | ||
B | |||
inherit | inherit | ||
A | |||
rename f1 as f2, g1 as g2 | rename f1 as f2, g1 as g2 | ||
redefine f2, g2 end | redefine f2, g2 end | ||
| Line 30: | Line 30: | ||
<code>[eiffel, N] | <code>[eiffel, N] | ||
class | class | ||
D | |||
inherit | inherit | ||
A | |||
redefine f1, g1 | redefine f1, g1 | ||
select g1 end | select g1 end | ||
B | |||
select f2 end | |||
feature | feature | ||
f1 do ... end | f1 do ... end | ||
Revision as of 18:39, 28 January 2007
Author: Matthias Konrad
The system
In this example we are studying a simple system with three classes that contains both renaming and selects:
class A feature f1 do ... end g1 do ... end end |
class B inherit A rename f1 as f2, g1 as g2 redefine f2, g2 end feature f2 do ... end g2 do ... end end |
class D inherit A redefine f1, g1 select g1 end B select f2 end feature f1 do ... end g1 do ... end end |
This system is defined by:
The naming function
We proceed by calculating the naming function. According to its definition we have to do that incrementally. Meaning that we first calculate then and finally .
Calculating
Since contains only one class it is sufficient to define . According to the definition:
We can forget about the right part of the union since has no base classes. So we need to calculate:
So we get:
And hence:
Calculating
We show the calculation of the different (four) parts of the function in separate sections:
Calculate
According to the definition:
Calculate
According to the definition:
Calculate
According to the definition:
Lets calculate the left part first:
And now the right part:
So we get:
Calculate
According to the definition:
Where:
And:
Here are the steps taken to compute the part:
So we get:
Putting the parts together:
We can know show the complete total function:
|
|
|
|
| |
|
| |
|
|
Calculating
We will not show the complete construction of but restrict our self to the most interesting parts.
Calculate
According to the definition:
Where:
And:
Note that we can omit from the formulas since it is always empty.
So we get:
The complete naming function
|
|
|
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
The dynamic binding function
To calculate the dynamic binding function, we need to get . We will again calculate it incrementally:
Calculating
According to the definition:
Since is empty this simplifies to:
So we get:
Calculating
Again we calculate the different parts of the function in separate sections:
Calculate
According to the definition:
Calculate
According to the definition:
Calculate
According to the definition:
So we get:
Calculate
According to the definition:
At this stage it should be clear how to calculate this, so we just give the result:
Putting the parts together:
We can know show the complete total function:
|
|
|
|
| |
|
| |
|
|
Calculating
There is nothing new for this calculation so we just present the result:
|
|
|
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|
Deriving the dynamic binding function
The function is now given. We evaluate it at two interesting points: