Classes in this File | Line Coverage | Branch Coverage | Complexity | ||||
CrInvalidBranch |
|
| 4.666666666666667;4.667 |
1 | /* $Id: CrInvalidBranch.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-2007 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 when a Branch (i.e. Choice or Junction) | |
51 | * state has the wrong number of transitions. | |
52 | * Implements constraint [5] and [6] on PseudoState in the UML | |
53 | * Semantics v1.3, p. 2-140: | |
54 | * | |
55 | * [5] A junction vertex must have at least one incoming and | |
56 | * one outgoing transition. | |
57 | * (self.kind = #junction) implies | |
58 | * ((self.incoming->size >= 1) and (self.outgoing->size >= 1)) | |
59 | * | |
60 | * [6] A choice vertex must have at least one incoming and | |
61 | * one outgoing transition. | |
62 | * (self.kind = #choice) implies | |
63 | * ((self.incoming->size >= 1) and (self.outgoing->size >= 1)) | |
64 | * | |
65 | * Well-formedness rule [7] and [8] for PseudoState. See page 138 of UML 1.4 | |
66 | * Semantics. OMG document UML 1.4.2 formal/04-07-02. | |
67 | * | |
68 | * @author jrobbins | |
69 | */ | |
70 | public class CrInvalidBranch extends CrUML { | |
71 | ||
72 | /** | |
73 | * The constructor. | |
74 | */ | |
75 | 900 | public CrInvalidBranch() { |
76 | 900 | setupHeadAndDesc(); |
77 | 900 | addSupportedDecision(UMLDecision.STATE_MACHINES); |
78 | 900 | addTrigger("incoming"); |
79 | 900 | } |
80 | ||
81 | ||
82 | /* | |
83 | * @see org.argouml.uml.cognitive.critics.CrUML#predicate2(java.lang.Object, org.argouml.cognitive.Designer) | |
84 | */ | |
85 | public boolean predicate2(Object dm, Designer dsgr) { | |
86 | 0 | if (!(Model.getFacade().isAPseudostate(dm))) { |
87 | 0 | return NO_PROBLEM; |
88 | } | |
89 | 0 | Object k = Model.getFacade().getKind(dm); |
90 | 0 | if ((!Model.getFacade().equalsPseudostateKind(k, |
91 | Model.getPseudostateKind().getChoice())) | |
92 | && (!Model.getFacade().equalsPseudostateKind(k, | |
93 | Model.getPseudostateKind().getJunction()))) { | |
94 | 0 | return NO_PROBLEM; |
95 | } | |
96 | 0 | Collection outgoing = Model.getFacade().getOutgoings(dm); |
97 | 0 | Collection incoming = Model.getFacade().getIncomings(dm); |
98 | 0 | int nOutgoing = outgoing == null ? 0 : outgoing.size(); |
99 | 0 | int nIncoming = incoming == null ? 0 : incoming.size(); |
100 | 0 | if (nIncoming < 1) { |
101 | 0 | return PROBLEM_FOUND; |
102 | } | |
103 | 0 | if (nOutgoing < 1) { |
104 | 0 | return PROBLEM_FOUND; |
105 | } | |
106 | 0 | return NO_PROBLEM; |
107 | } | |
108 | ||
109 | /* | |
110 | * @see org.argouml.uml.cognitive.critics.CrUML#getCriticizedDesignMaterials() | |
111 | */ | |
112 | public Set<Object> getCriticizedDesignMaterials() { | |
113 | 900 | Set<Object> ret = new HashSet<Object>(); |
114 | 900 | ret.add(Model.getMetaTypes().getPseudostate()); |
115 | 900 | return ret; |
116 | } | |
117 | ||
118 | } | |
119 |