Classes in this File | Line Coverage | Branch Coverage | Complexity | ||||
CrConflictingComposites |
|
| 6.5;6.5 |
1 | /* $Id: CrConflictingComposites.java 17849 2010-01-12 19:50:34Z linus $ | |
2 | ***************************************************************************** | |
3 | * Copyright (c) 2009 Contributors - see below | |
4 | * All rights reserved. This program and the accompanying materials | |
5 | * are made available under the terms of the Eclipse Public License v1.0 | |
6 | * which accompanies this distribution, and is available at | |
7 | * http://www.eclipse.org/legal/epl-v10.html | |
8 | * | |
9 | * Contributors: | |
10 | * maurelio1234 | |
11 | ***************************************************************************** | |
12 | * | |
13 | * Some portions of this file was previously release using the BSD License: | |
14 | */ | |
15 | ||
16 | // Copyright (c) 1996-2006 The Regents of the University of California. All | |
17 | // Rights Reserved. Permission to use, copy, modify, and distribute this | |
18 | // software and its documentation without fee, and without a written | |
19 | // agreement is hereby granted, provided that the above copyright notice | |
20 | // and this paragraph appear in all copies. This software program and | |
21 | // documentation are copyrighted by The Regents of the University of | |
22 | // California. The software program and documentation are supplied "AS | |
23 | // IS", without any accompanying services from The Regents. The Regents | |
24 | // does not warrant that the operation of the program will be | |
25 | // uninterrupted or error-free. The end-user understands that the program | |
26 | // was developed for research purposes and is advised not to rely | |
27 | // exclusively on the program for any reason. IN NO EVENT SHALL THE | |
28 | // UNIVERSITY OF CALIFORNIA BE LIABLE TO ANY PARTY FOR DIRECT, INDIRECT, | |
29 | // SPECIAL, INCIDENTAL, OR CONSEQUENTIAL DAMAGES, INCLUDING LOST PROFITS, | |
30 | // ARISING OUT OF THE USE OF THIS SOFTWARE AND ITS DOCUMENTATION, EVEN IF | |
31 | // THE UNIVERSITY OF CALIFORNIA HAS BEEN ADVISED OF THE POSSIBILITY OF | |
32 | // SUCH DAMAGE. THE UNIVERSITY OF CALIFORNIA SPECIFICALLY DISCLAIMS ANY | |
33 | // WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF | |
34 | // MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE SOFTWARE | |
35 | // PROVIDED HEREUNDER IS ON AN "AS IS" BASIS, AND THE UNIVERSITY OF | |
36 | // CALIFORNIA HAS NO OBLIGATIONS TO PROVIDE MAINTENANCE, SUPPORT, | |
37 | // UPDATES, ENHANCEMENTS, OR MODIFICATIONS. | |
38 | ||
39 | package org.argouml.uml.cognitive.critics; | |
40 | ||
41 | import java.util.Collection; | |
42 | import java.util.Iterator; | |
43 | ||
44 | import org.argouml.cognitive.Critic; | |
45 | import org.argouml.cognitive.Designer; | |
46 | import org.argouml.model.Model; | |
47 | import org.argouml.uml.cognitive.UMLDecision; | |
48 | ||
49 | /** | |
50 | * Well-formedness rule [2] for association end. See page 28 of UML 1.1 | |
51 | * Semantics. OMG document ad/97-08-04. | |
52 | * | |
53 | * Well-formedness rule [2] for AssociationEnd. See page 53 of UML 1.4 | |
54 | * Semantics. OMG document UML 1.4.2 formal/04-07-02. | |
55 | * | |
56 | * @author jrobbins | |
57 | */ | |
58 | public class CrConflictingComposites extends CrUML { | |
59 | ||
60 | /** | |
61 | * The constructor. | |
62 | * | |
63 | */ | |
64 | 0 | public CrConflictingComposites() { |
65 | 0 | setupHeadAndDesc(); |
66 | ||
67 | 0 | addSupportedDecision(UMLDecision.CONTAINMENT); |
68 | 0 | setKnowledgeTypes(Critic.KT_SEMANTICS); |
69 | // no good trigger | |
70 | 0 | } |
71 | ||
72 | /* | |
73 | * @see org.argouml.uml.cognitive.critics.CrUML#predicate2( | |
74 | * java.lang.Object, org.argouml.cognitive.Designer) | |
75 | */ | |
76 | public boolean predicate2(Object classifier, Designer dsgr) { | |
77 | 0 | if (!(Model.getFacade().isAClassifier(classifier))) { |
78 | 0 | return NO_PROBLEM; |
79 | } | |
80 | 0 | Collection conns = Model.getFacade().getAssociationEnds(classifier); |
81 | 0 | if (conns == null) { |
82 | 0 | return NO_PROBLEM; |
83 | } | |
84 | 0 | int compositeCount = 0; |
85 | 0 | Iterator assocEnds = conns.iterator(); |
86 | 0 | while (assocEnds.hasNext()) { |
87 | 0 | Object myEnd = assocEnds.next(); |
88 | 0 | if (Model.getCoreHelper() |
89 | .equalsAggregationKind(myEnd, "composite")) { | |
90 | 0 | continue; |
91 | } | |
92 | 0 | if (Model.getFacade().getLower(myEnd) == 0) { |
93 | 0 | continue; |
94 | } | |
95 | 0 | Object asc = Model.getFacade().getAssociation(myEnd); |
96 | 0 | if (asc != null |
97 | && Model.getCoreHelper().hasCompositeEnd(asc)) { | |
98 | 0 | compositeCount++; |
99 | } | |
100 | 0 | } |
101 | 0 | if (compositeCount > 1) { |
102 | 0 | return PROBLEM_FOUND; |
103 | } | |
104 | 0 | return NO_PROBLEM; |
105 | } | |
106 | } /* end class CrConflictingComposites */ |