KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > com > jeantessier > dependency > LinkMaximizer


1 /*
2  * Copyright (c) 2001-2005, 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 import java.util.*;
36
37 public class LinkMaximizer extends VisitorBase {
38     public LinkMaximizer() {
39         super();
40     }
41
42     public LinkMaximizer(TraversalStrategy strategy) {
43         super(strategy);
44     }
45
46     protected void postprocessClassNode(ClassNode node) {
47         Iterator i = getStrategy().order(node.getOutboundDependencies()).iterator();
48         while (i.hasNext()) {
49             node.getPackageNode().addDependency((Node) i.next());
50         }
51
52         super.postprocessClassNode(node);
53     }
54
55     public void visitInboundClassNode(ClassNode node) {
56         node.getPackageNode().addDependency(getCurrentNode());
57     }
58
59     public void visitOutboundClassNode(ClassNode node) {
60         getCurrentNode().addDependency(node.getPackageNode());
61     }
62
63     protected void postprocessFeatureNode(FeatureNode node) {
64         Iterator i = getStrategy().order(node.getOutboundDependencies()).iterator();
65         while (i.hasNext()) {
66             Node outboundNode = (Node) i.next();
67             node.getClassNode().addDependency(outboundNode);
68             node.getClassNode().getPackageNode().addDependency(outboundNode);
69         }
70
71         super.postprocessFeatureNode(node);
72     }
73
74     public void visitInboundFeatureNode(FeatureNode node) {
75         node.getClassNode().addDependency(getCurrentNode());
76         node.getClassNode().getPackageNode().addDependency(getCurrentNode());
77     }
78
79     public void visitOutboundFeatureNode(FeatureNode node) {
80         getCurrentNode().addDependency(node.getClassNode());
81         getCurrentNode().addDependency(node.getClassNode().getPackageNode());
82     }
83 }
84
Popular Tags