Coverage Report - com.jeantessier.dependency.TransitiveClosure
 
Classes in this File Line Coverage Branch Coverage Complexity
TransitiveClosure
100%
22/22
100%
6/6
1.5
 
 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  
 import java.util.*;
 36  
 
 37  
 /**
 38  
  *  Creates a sub-graph of Nodes based on a scope and
 39  
  *  filtering rules.  To get all transitive dependencies,
 40  
  *  the visited graph should be maximized first with
 41  
  *  LinkMaximizer.  Otherwise, you will only get a subset
 42  
  *  of the explicit dependencies.
 43  
  */
 44  
 public class TransitiveClosure {
 45  
     public static final long DO_NOT_FOLLOW = -1;
 46  
     public static final long UNBOUNDED_DEPTH = Long.MAX_VALUE;
 47  
     
 48  40
     private long maximumInboundDepth = DO_NOT_FOLLOW;
 49  40
     private long maximumOutboundDepth = UNBOUNDED_DEPTH;
 50  
 
 51  
     private SelectionCriteria startCriteria;
 52  
     private SelectionCriteria stopCriteria;
 53  
 
 54  40
     private NodeFactory factory = new NodeFactory();
 55  
     
 56  40
     public TransitiveClosure(SelectionCriteria startCriteria, SelectionCriteria stopCriteria) {
 57  40
         this.startCriteria = startCriteria;
 58  40
         this.stopCriteria  = stopCriteria;
 59  40
     }
 60  
 
 61  
     public NodeFactory getFactory() {
 62  142
         return factory;
 63  
     }
 64  
 
 65  
     public void setMaximumInboundDepth(long maximumInboundDepth) {
 66  31
         this.maximumInboundDepth  = maximumInboundDepth;
 67  31
     }
 68  
 
 69  
     public void setMaximumOutboundDepth(long maximumOutboundDepth) {
 70  31
         this.maximumOutboundDepth = maximumOutboundDepth;
 71  31
     }
 72  
 
 73  
     public void traverseNodes(Collection<? extends Node> nodes) {
 74  40
         if (maximumInboundDepth != DO_NOT_FOLLOW) {
 75  27
             compute(nodes, maximumInboundDepth, new ClosureInboundSelector());
 76  
         }
 77  
         
 78  40
         if (maximumOutboundDepth != DO_NOT_FOLLOW) {
 79  36
             compute(nodes, maximumOutboundDepth, new ClosureOutboundSelector());
 80  
         }
 81  40
     }
 82  
 
 83  
     private void compute(Collection<? extends Node> nodes, long depth, ClosureLayerSelector layerSelector) {
 84  63
         TransitiveClosureEngine engine = new TransitiveClosureEngine(factory, nodes, startCriteria, stopCriteria, layerSelector);
 85  
 
 86  63
         if (depth == UNBOUNDED_DEPTH) {
 87  33
             engine.computeAllLayers();
 88  
         } else {
 89  30
             engine.computeLayers(depth);
 90  
         }
 91  63
     }
 92  
 }