Classes in this File | Line Coverage | Branch Coverage | Complexity | ||||
CrNoIncomingTransitions |
|
| 7.25;7.25 |
1 | /* $Id: CrNoIncomingTransitions.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 | * mvw | |
11 | ***************************************************************************** | |
12 | * | |
13 | * Some portions of this file was previously release using the BSD License: | |
14 | */ | |
15 | ||
16 | // Copyright (c) 1996-2009 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.HashSet; | |
43 | import java.util.Set; | |
44 | ||
45 | import org.argouml.cognitive.Designer; | |
46 | import org.argouml.model.Model; | |
47 | import org.argouml.uml.cognitive.UMLDecision; | |
48 | ||
49 | /** | |
50 | * A critic to detect whether a state has no incoming transitions. | |
51 | * <p> | |
52 | * Also a transition to a state contained in the design material | |
53 | * counts as an "incoming" transition thanks to issue 689. | |
54 | * | |
55 | * @author jrobbins | |
56 | */ | |
57 | public class CrNoIncomingTransitions extends CrUML { | |
58 | ||
59 | /** | |
60 | * Constructor. | |
61 | */ | |
62 | 900 | public CrNoIncomingTransitions() { |
63 | 900 | setupHeadAndDesc(); |
64 | 900 | addSupportedDecision(UMLDecision.STATE_MACHINES); |
65 | 900 | addTrigger("incoming"); |
66 | 900 | } |
67 | ||
68 | /** | |
69 | * This is the decision routine for the critic. | |
70 | * | |
71 | * @param dm is the design material, i.e. the | |
72 | * UML entity that is being checked. | |
73 | * @param dsgr is for future development and can be ignored. | |
74 | * | |
75 | * @return boolean problem found | |
76 | */ | |
77 | public boolean predicate2(Object dm, Designer dsgr) { | |
78 | 570 | if (!(Model.getFacade().isAStateVertex(dm))) { |
79 | 0 | return NO_PROBLEM; |
80 | } | |
81 | /* Now we are sure dm is a StateVertex. */ | |
82 | 570 | if (Model.getFacade().isAPseudostate(dm)) { |
83 | 0 | Object k = Model.getFacade().getKind(dm); |
84 | 0 | if (k.equals(Model.getPseudostateKind().getChoice())) { |
85 | 0 | return NO_PROBLEM; |
86 | } | |
87 | 0 | if (k.equals(Model.getPseudostateKind().getJunction())) { |
88 | 0 | return NO_PROBLEM; |
89 | } | |
90 | 0 | if (k.equals(Model.getPseudostateKind().getInitial())) { |
91 | 0 | return NO_PROBLEM; |
92 | } | |
93 | } | |
94 | 570 | if (!Model.getFacade().isAState(dm)) { |
95 | 0 | return NO_PROBLEM; |
96 | } | |
97 | /* Now we are sure dm is a State. */ | |
98 | 570 | Object sm = Model.getStateMachinesHelper().getStateMachine(dm); |
99 | 570 | if (sm != null && Model.getFacade().getTop(sm) == dm) { |
100 | /* If dm is the top state of the statemachine, then it is | |
101 | * not supposed to have incoming transitions. */ | |
102 | 570 | return NO_PROBLEM; |
103 | } | |
104 | ||
105 | 0 | Collection incoming = Model.getFacade().getIncomings(dm); |
106 | 0 | if (incoming.size() > 0) { |
107 | 0 | return NO_PROBLEM; |
108 | } | |
109 | ||
110 | 0 | if (!Model.getFacade().isACompositeState(dm)) { |
111 | 0 | return PROBLEM_FOUND; |
112 | } | |
113 | /* Now we are sure dm is a Composite State. */ | |
114 | ||
115 | /* Issue 689: Look for a transition that arrives | |
116 | * at a sub-state of the composite state: */ | |
117 | 0 | Collection transitions = Model.getFacade().getTransitions(sm); |
118 | 0 | for (Object t : transitions) { |
119 | 0 | Object sourceState = Model.getFacade().getSource(t); |
120 | 0 | Object targetState = Model.getFacade().getTarget(t); |
121 | 0 | if (!isSomeSubvertexOf(sourceState, dm) && isSomeSubvertexOf(targetState, dm)) { |
122 | 0 | return NO_PROBLEM; |
123 | } | |
124 | 0 | } |
125 | ||
126 | 0 | return PROBLEM_FOUND; |
127 | } | |
128 | ||
129 | /** | |
130 | * Test if a state is contained within a composite state recursively. | |
131 | * This is done by checking if the parent of the subject | |
132 | * equals the composite, or the parent of the parent, etc. | |
133 | * | |
134 | * @param subject the StateVertex that is investigated | |
135 | * @param composite the Composite state that may or may not contain the subject | |
136 | * @return true if and only if the given composite contains recursively the given subject | |
137 | */ | |
138 | private boolean isSomeSubvertexOf(Object subject, Object composite) { | |
139 | 0 | Object c = subject; |
140 | 0 | while (c != null) { |
141 | 0 | if (c == composite) { |
142 | 0 | return true; |
143 | } | |
144 | 0 | c = Model.getFacade().getContainer(c); |
145 | } | |
146 | 0 | return false; |
147 | } | |
148 | ||
149 | /* | |
150 | * @see org.argouml.uml.cognitive.critics.CrUML#getCriticizedDesignMaterials() | |
151 | */ | |
152 | public Set<Object> getCriticizedDesignMaterials() { | |
153 | 900 | Set<Object> ret = new HashSet<Object>(); |
154 | 900 | ret.add(Model.getMetaTypes().getStateVertex()); |
155 | 900 | return ret; |
156 | } | |
157 | ||
158 | } |