| 1 |
% Part of the MetaUML manual. |
| 2 |
% Copyright (C) 2005 Ovidiu Gheorghies |
| 3 |
% |
| 4 |
% This program is free software; you can redistribute it and/or |
| 5 |
% modify it under the terms of the GNU General Public License |
| 6 |
% as published by the Free Software Foundation; either version 2 |
| 7 |
% of the License, or (at your option) any later version. |
| 8 |
% |
| 9 |
% This program is distributed in the hope that it will be useful, |
| 10 |
% but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 11 |
% MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 12 |
% GNU General Public License for more details. |
| 13 |
% |
| 14 |
% You should have received a copy of the GNU General Public License |
| 15 |
% along with this program; if not, write to the Free Software |
| 16 |
% Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. |
| 17 |
|
| 18 |
input metauml; |
| 19 |
|
| 20 |
beginfig(1); |
| 21 |
drawRelation(aggregationUni) |
| 22 |
((0,0)--(40,0)); |
| 23 |
endfig; |
| 24 |
|
| 25 |
|
| 26 |
beginfig(2); |
| 27 |
path myPath; |
| 28 |
myPath := (0,0) -- (100,0); |
| 29 |
LinkStructure.ls(myPath, |
| 30 |
aggregationUni.widthA, |
| 31 |
aggregationUni.widthB); |
| 32 |
|
| 33 |
describeLinkStructure(ls); |
| 34 |
drawLinkStructure(ls)(aggregationUni); |
| 35 |
endfig; |
| 36 |
|
| 37 |
end |
| 38 |
|