|
|||||||||||||||||||
Source file | Conditionals | Statements | Methods | TOTAL | |||||||||||||||
FeatureNode.java | 100% | 100% | 100% | 100% |
|
1 | /* | |
2 | * Copyright (c) 2001-2009, Jean Tessier | |
3 | * All rights reserved. | |
4 | * | |
5 | * Redistribution and use in source and binary forms, with or without | |
6 | * modification, are permitted provided that the following conditions | |
7 | * are met: | |
8 | * | |
9 | * * Redistributions of source code must retain the above copyright | |
10 | * notice, this list of conditions and the following disclaimer. | |
11 | * | |
12 | * * Redistributions in binary form must reproduce the above copyright | |
13 | * notice, this list of conditions and the following disclaimer in the | |
14 | * documentation and/or other materials provided with the distribution. | |
15 | * | |
16 | * * Neither the name of Jean Tessier nor the names of his contributors | |
17 | * may be used to endorse or promote products derived from this software | |
18 | * without specific prior written permission. | |
19 | * | |
20 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS | |
21 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT | |
22 | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR | |
23 | * A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR | |
24 | * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, | |
25 | * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, | |
26 | * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR | |
27 | * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF | |
28 | * LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING | |
29 | * NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS | |
30 | * SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. | |
31 | */ | |
32 | ||
33 | package com.jeantessier.dependency; | |
34 | ||
35 | public class FeatureNode extends Node { | |
36 | private ClassNode parent; | |
37 | ||
38 | 2108 | public FeatureNode(ClassNode parent, String name, boolean concrete) { |
39 | 2108 | super(name, concrete); |
40 | 2108 | this.parent = parent; |
41 | } | |
42 | ||
43 | // Only to be used by NodeFactory and DeletingVisitor | |
44 | 34 | void setConfirmed(boolean confirmed) { |
45 | 34 | super.setConfirmed(confirmed); |
46 | 34 | if (confirmed) { |
47 | 20 | getClassNode().setConfirmed(confirmed); |
48 | } | |
49 | } | |
50 | ||
51 | 5449 | public ClassNode getClassNode() { |
52 | 5449 | return parent; |
53 | } | |
54 | ||
55 | 3441 | public boolean canAddDependencyTo(Node node) { |
56 | 3441 | return super.canAddDependencyTo(node) && getClassNode().canAddDependencyTo(node); |
57 | } | |
58 | ||
59 | 1393 | public void accept(Visitor visitor) { |
60 | 1393 | visitor.visitFeatureNode(this); |
61 | } | |
62 | ||
63 | 541 | public void acceptInbound(Visitor visitor) { |
64 | 541 | visitor.visitInboundFeatureNode(this); |
65 | } | |
66 | ||
67 | 880 | public void acceptOutbound(Visitor visitor) { |
68 | 880 | visitor.visitOutboundFeatureNode(this); |
69 | } | |
70 | ||
71 | 6 | public String getSimpleName() { |
72 | 6 | return getName().substring(getClassNode().getName().length() + 1); |
73 | } | |
74 | } |
|