01: /*
02: * Copyright (c) 2001-2007, Jean Tessier
03: * All rights reserved.
04: *
05: * Redistribution and use in source and binary forms, with or without
06: * modification, are permitted provided that the following conditions
07: * are met:
08: *
09: * * 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 LinkMaximizer extends VisitorBase {
36: public LinkMaximizer() {
37: super ();
38: }
39:
40: public LinkMaximizer(TraversalStrategy strategy) {
41: super (strategy);
42: }
43:
44: protected void postprocessClassNode(ClassNode node) {
45: for (Node target : getStrategy().order(
46: node.getOutboundDependencies())) {
47: node.getPackageNode().addDependency(target);
48: }
49:
50: super .postprocessClassNode(node);
51: }
52:
53: public void visitInboundClassNode(ClassNode node) {
54: node.getPackageNode().addDependency(getCurrentNode());
55: }
56:
57: public void visitOutboundClassNode(ClassNode node) {
58: getCurrentNode().addDependency(node.getPackageNode());
59: }
60:
61: protected void postprocessFeatureNode(FeatureNode node) {
62: for (Node target : getStrategy().order(
63: node.getOutboundDependencies())) {
64: node.getClassNode().addDependency(target);
65: node.getClassNode().getPackageNode().addDependency(target);
66: }
67:
68: super .postprocessFeatureNode(node);
69: }
70:
71: public void visitInboundFeatureNode(FeatureNode node) {
72: node.getClassNode().addDependency(getCurrentNode());
73: node.getClassNode().getPackageNode().addDependency(
74: getCurrentNode());
75: }
76:
77: public void visitOutboundFeatureNode(FeatureNode node) {
78: getCurrentNode().addDependency(node.getClassNode());
79: getCurrentNode().addDependency(
80: node.getClassNode().getPackageNode());
81: }
82: }
|