| 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 LinkMinimizer extends VisitorBase { |
| 36 | public LinkMinimizer() { |
| 37 | super(); |
| 38 | |
| 39 | getStrategy().setPreOutboundTraversal(false); |
| 40 | getStrategy().setPreInboundTraversal(false); |
| 41 | getStrategy().setPostOutboundTraversal(false); |
| 42 | getStrategy().setPostInboundTraversal(false); |
| 43 | } |
| 44 | |
| 45 | public LinkMinimizer(TraversalStrategy strategy) { |
| 46 | super(strategy); |
| 47 | |
| 48 | getStrategy().setPreOutboundTraversal(false); |
| 49 | getStrategy().setPreInboundTraversal(false); |
| 50 | getStrategy().setPostOutboundTraversal(false); |
| 51 | getStrategy().setPostInboundTraversal(false); |
| 52 | } |
| 53 | |
| 54 | protected void postprocessPackageNode(PackageNode node) { |
| 55 | traverseOutbound(node.getOutboundDependencies()); |
| 56 | |
| 57 | super.postprocessPackageNode(node); |
| 58 | } |
| 59 | |
| 60 | protected void postprocessClassNode(ClassNode node) { |
| 61 | for (Node target : getStrategy().order(node.getOutboundDependencies())) { |
| 62 | node.getPackageNode().removeDependency(target); |
| 63 | |
| 64 | target.acceptOutbound(this); |
| 65 | |
| 66 | pushNode(node.getPackageNode()); |
| 67 | target.acceptOutbound(this); |
| 68 | popNode(); |
| 69 | } |
| 70 | |
| 71 | super.postprocessClassNode(node); |
| 72 | } |
| 73 | |
| 74 | public void visitOutboundClassNode(ClassNode node) { |
| 75 | getCurrentNode().removeDependency(node.getPackageNode()); |
| 76 | } |
| 77 | |
| 78 | protected void postprocessFeatureNode(FeatureNode node) { |
| 79 | for (Node target : getStrategy().order(node.getOutboundDependencies())) { |
| 80 | node.getClassNode().removeDependency(target); |
| 81 | node.getClassNode().getPackageNode().removeDependency(target); |
| 82 | |
| 83 | target.acceptOutbound(this); |
| 84 | |
| 85 | pushNode(node.getClassNode()); |
| 86 | target.acceptOutbound(this); |
| 87 | popNode(); |
| 88 | |
| 89 | pushNode(node.getClassNode().getPackageNode()); |
| 90 | target.acceptOutbound(this); |
| 91 | popNode(); |
| 92 | } |
| 93 | |
| 94 | super.postprocessFeatureNode(node); |
| 95 | } |
| 96 | |
| 97 | public void visitOutboundFeatureNode(FeatureNode node) { |
| 98 | getCurrentNode().removeDependency(node.getClassNode()); |
| 99 | getCurrentNode().removeDependency(node.getClassNode().getPackageNode()); |
| 100 | } |
| 101 | } |