LinkMinimizer.java

  1. /*
  2.  *  Copyright (c) 2001-2024, 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. package com.jeantessier.dependency;

  33. public class LinkMinimizer extends VisitorBase {
  34.     public LinkMinimizer() {
  35.         super(new DependencySkippingTraversalStrategy(getDefaultStrategy()));
  36.     }

  37.     public LinkMinimizer(TraversalStrategy strategy) {
  38.         super(new DependencySkippingTraversalStrategy(strategy));
  39.     }

  40.     protected void postprocessPackageNode(PackageNode node) {
  41.         traverseOutbound(node.getOutboundDependencies());

  42.         super.postprocessPackageNode(node);
  43.     }
  44.    
  45.     protected void postprocessClassNode(ClassNode node) {
  46.         getStrategy().order(node.getOutboundDependencies()).forEach(target -> {
  47.             node.getPackageNode().removeDependency(target);

  48.             target.acceptOutbound(this);

  49.             pushNode(node.getPackageNode());
  50.             target.acceptOutbound(this);
  51.             popNode();
  52.         });

  53.         super.postprocessClassNode(node);
  54.     }

  55.     public void visitOutboundClassNode(ClassNode node) {
  56.         getCurrentNode().removeDependency(node.getPackageNode());
  57.     }
  58.    
  59.     protected void postprocessFeatureNode(FeatureNode node) {
  60.         getStrategy().order(node.getOutboundDependencies()).forEach(target -> {
  61.             node.getClassNode().removeDependency(target);
  62.             node.getClassNode().getPackageNode().removeDependency(target);

  63.             target.acceptOutbound(this);

  64.             pushNode(node.getClassNode());
  65.             target.acceptOutbound(this);
  66.             popNode();

  67.             pushNode(node.getClassNode().getPackageNode());
  68.             target.acceptOutbound(this);
  69.             popNode();
  70.         });

  71.         super.postprocessFeatureNode(node);
  72.     }

  73.     public void visitOutboundFeatureNode(FeatureNode node) {
  74.         getCurrentNode().removeDependency(node.getClassNode());
  75.         getCurrentNode().removeDependency(node.getClassNode().getPackageNode());
  76.     }
  77. }