Coverage Report

Coverage Report - com.jeantessier.dependency.TransitiveClosureEngine

Classes in this File

Line Coverage

Branch Coverage

Complexity

TransitiveClosureEngine

100%

38/38

100%

10/10

1.5

 /*
  *  Copyright (c) 2001-2009, Jean Tessier
  *  All rights reserved.
  *  
  *  Redistribution and use in source and binary forms, with or without
  *  modification, are permitted provided that the following conditions
  *  are met:
  *  
  *      * Redistributions of source code must retain the above copyright
  *        notice, this list of conditions and the following disclaimer.
  *  
  *      * Redistributions in binary form must reproduce the above copyright
  *        notice, this list of conditions and the following disclaimer in the
  *        documentation and/or other materials provided with the distribution.
  *  
  *      * Neither the name of Jean Tessier nor the names of his contributors
  *        may be used to endorse or promote products derived from this software
  *        without specific prior written permission.
  *  
  *  THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  *  "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  *  LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
  *  A PARTICULAR PURPOSE ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR
  *  CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
  *  EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
  *  PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
  *  PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF
  *  LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING
  *  NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
  *  SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  */
 
 package com.jeantessier.dependency;
 
 import java.util.*;
 
 public class TransitiveClosureEngine {
     private NodeFactory factory;
     private ClosureLayerSelector layerSelector;
     private ClosureStopSelector stopSelector;
     
     private Collection<Node> coverage = new HashSet<Node>();
     private LinkedList<Collection<? extends Node>> selections = new LinkedList<Collection<? extends Node>>();
     private LinkedList<Collection<? extends Node>> layers = new LinkedList<Collection<? extends Node>>();
     
     public TransitiveClosureEngine(Collection<? extends Node> packages, SelectionCriteria startCriteria, SelectionCriteria stopCriteria, ClosureLayerSelector layerSelector) {
         this(new NodeFactory(), packages, startCriteria, stopCriteria, layerSelector);
     }
     
     public TransitiveClosureEngine(NodeFactory factory, Collection<? extends Node> packages, SelectionCriteria startCriteria, SelectionCriteria stopCriteria, ClosureLayerSelector layerSelector) {
         this.factory = factory;
         
         this.layerSelector = layerSelector;
         this.layerSelector.setFactory(factory);
         this.layerSelector.setCoverage(coverage);
 
         this.stopSelector = new ClosureStopSelector(stopCriteria);
         
         init(packages, startCriteria);
     }
 
     private void init(Collection<? extends Node> packages, SelectionCriteria startCriteria) {
         ClosureStartSelector startSelector = new ClosureStartSelector(factory, startCriteria);
         startSelector.traverseNodes(packages);
         stopSelector.traverseNodes(startSelector.getCopiedNodes());
         gatherResults(startSelector);
     }
 
     public NodeFactory getFactory() {
         return factory;
     }
 
     public int getNbLayers() {
         return layers.size();
     }
     
     public Collection getLayer(int i) {
         return layers.get(i);
     }
 
     public void computeAllLayers() {
         while (!stopSelector.isDone()) {
             computeNextLayer();
         }
     }
 
     public void computeLayers(long nbLayers) {
         for (long i=0; !stopSelector.isDone() && i<nbLayers; i++) {
             computeNextLayer();
         }
     }
 
     public void computeNextLayer() {
         if (!stopSelector.isDone()) {
             layerSelector.reset();
             layerSelector.traverseNodes(selections.getLast());
 
             stopSelector.traverseNodes(layerSelector.getCopiedNodes());
             if (!layerSelector.getCopiedNodes().isEmpty()) {
                 gatherResults(layerSelector);
             }
         }
     }
 
     private void gatherResults(ClosureSelector selector) {
         coverage.addAll(selector.getSelectedNodes());
         selections.add(selector.getSelectedNodes());
         layers.add(selector.getCopiedNodes());
     }
 }

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		public class TransitiveClosureEngine {
38		private NodeFactory factory;
39		private ClosureLayerSelector layerSelector;
40		private ClosureStopSelector stopSelector;
41
42	81	private Collection<Node> coverage = new HashSet<Node>();
43	81	private LinkedList<Collection<? extends Node>> selections = new LinkedList<Collection<? extends Node>>();
44	81	private LinkedList<Collection<? extends Node>> layers = new LinkedList<Collection<? extends Node>>();
45
46		public TransitiveClosureEngine(Collection<? extends Node> packages, SelectionCriteria startCriteria, SelectionCriteria stopCriteria, ClosureLayerSelector layerSelector) {
47	18	this(new NodeFactory(), packages, startCriteria, stopCriteria, layerSelector);
48	18	}
49
50	81	public TransitiveClosureEngine(NodeFactory factory, Collection<? extends Node> packages, SelectionCriteria startCriteria, SelectionCriteria stopCriteria, ClosureLayerSelector layerSelector) {
51	81	this.factory = factory;
52
53	81	this.layerSelector = layerSelector;
54	81	this.layerSelector.setFactory(factory);
55	81	this.layerSelector.setCoverage(coverage);
56
57	81	this.stopSelector = new ClosureStopSelector(stopCriteria);
58
59	81	init(packages, startCriteria);
60	81	}
61
62		private void init(Collection<? extends Node> packages, SelectionCriteria startCriteria) {
63	81	ClosureStartSelector startSelector = new ClosureStartSelector(factory, startCriteria);
64	81	startSelector.traverseNodes(packages);
65	81	stopSelector.traverseNodes(startSelector.getCopiedNodes());
66	81	gatherResults(startSelector);
67	81	}
68
69		public NodeFactory getFactory() {
70	180	return factory;
71		}
72
73		public int getNbLayers() {
74	18	return layers.size();
75		}
76
77		public Collection getLayer(int i) {
78	70	return layers.get(i);
79		}
80
81		public void computeAllLayers() {
82	124	while (!stopSelector.isDone()) {
83	86	computeNextLayer();
84		}
85	38	}
86
87		public void computeLayers(long nbLayers) {
88	64	for (long i=0; !stopSelector.isDone() && i<nbLayers; i++) {
89	32	computeNextLayer();
90		}
91	32	}
92
93		public void computeNextLayer() {
94	142	if (!stopSelector.isDone()) {
95	137	layerSelector.reset();
96	137	layerSelector.traverseNodes(selections.getLast());
97
98	137	stopSelector.traverseNodes(layerSelector.getCopiedNodes());
99	137	if (!layerSelector.getCopiedNodes().isEmpty()) {
100	106	gatherResults(layerSelector);
101		}
102		}
103	142	}
104
105		private void gatherResults(ClosureSelector selector) {
106	187	coverage.addAll(selector.getSelectedNodes());
107	187	selections.add(selector.getSelectedNodes());
108	187	layers.add(selector.getCopiedNodes());
109	187	}
110		}