DynBindModelExamples: Difference between revisions
| Line 499: | Line 499: | ||
|-valign="top" -halign="center" | |-valign="top" -halign="center" | ||
| | | | ||
<math>\beta_{ | <math>\beta_{S_3} = \{</math> | ||
| | | | ||
<math> | <math> | ||
| Line 520: | Line 520: | ||
| | | | ||
<math> | <math> | ||
\left( C_2 \mapsto C_2 \right) \mapsto \left\{ f_2 \mapsto f_2, g_2 \mapsto g_2 \right\} | \left( C_2 \mapsto C_2 \right) \mapsto \left\{ f_2 \mapsto f_2, g_2 \mapsto g_2 \right\}, | ||
</math> | </math> | ||
|- | |||
|| | |||
| | |||
<math> | |||
\left( C_1 \mapsto C_3 \right) \mapsto \left\{ f_1 \mapsto f_2, g_1 \mapsto g_1 \right\}, | |||
</math> | |||
|- | |||
|| | |||
| | |||
<math> | |||
\left( C_2 \mapsto C_3 \right) \mapsto \left\{ f_2 \mapsto f_2, g_2 \mapsto g_2 \right\}, | |||
</math> | |||
|- | |||
|| | |||
| | |||
<math> | |||
\left( C_3 \mapsto C_3 \right) | |||
\mapsto | |||
\left\{ f_1 \mapsto f_1, g_1 \mapsto g_1, f_2 \mapsto f_2, g_2 \mapsto g_2 \right\}, | |||
</math> | |||
|- | |||
|| | |||
| | |||
<math> | |||
\left( C_3 \mapsto C_1 \right) \mapsto \emptyset, | |||
</math> | |||
|- | |||
|| | |||
| | |||
<math> | |||
\left( C_3 \mapsto C_2 \right) \mapsto \emptyset \ \} | |||
</math> | |||
|} | |} | ||
Revision as of 22:54, 9 October 2006
This page shows
Example 1
The system
In this example we are studying a symple system with three classes that contains both renaming and selects:
class C1 feature f1 do ... end g1 do ... end end |
class C2 inherit B rename f1 as f2, g1 as g2 redefine f2, g2 end feature f2 do ... end g2 do ... end end |
class C3 inherit C2 select f2 end C1 redefine f1, g1 select g1 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 incrementaly. 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: .
This done we calculate:
So we get:
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 ommit from the formulas since it is always empty.
So we get:
The complete function
|
|
|
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
| |
|
|