01: /*
02: * Copyright (c) 2001-2007, Jean Tessier
03: * All rights reserved.
04: *
05: * Redistribution and use in source and binary forms, with or without
06: * modification, are permitted provided that the following conditions
07: * are met:
08: *
09: * * 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 long DO_NOT_FOLLOW = -1;
46: public static long UNBOUNDED_DEPTH = Long.MAX_VALUE;
47:
48: private long maximumInboundDepth = DO_NOT_FOLLOW;
49: private long maximumOutboundDepth = UNBOUNDED_DEPTH;
50:
51: private SelectionCriteria startCriteria;
52: private SelectionCriteria stopCriteria;
53:
54: private NodeFactory factory = new NodeFactory();
55:
56: public TransitiveClosure(SelectionCriteria startCriteria,
57: SelectionCriteria stopCriteria) {
58: this .startCriteria = startCriteria;
59: this .stopCriteria = stopCriteria;
60: }
61:
62: public NodeFactory getFactory() {
63: return factory;
64: }
65:
66: public void setMaximumInboundDepth(long maximumInboundDepth) {
67: this .maximumInboundDepth = maximumInboundDepth;
68: }
69:
70: public void setMaximumOutboundDepth(long maximumOutboundDepth) {
71: this .maximumOutboundDepth = maximumOutboundDepth;
72: }
73:
74: public void traverseNodes(Collection<? extends Node> nodes) {
75: if (maximumInboundDepth != DO_NOT_FOLLOW) {
76: compute(nodes, maximumInboundDepth,
77: new ClosureInboundSelector());
78: }
79:
80: if (maximumOutboundDepth != DO_NOT_FOLLOW) {
81: compute(nodes, maximumOutboundDepth,
82: new ClosureOutboundSelector());
83: }
84: }
85:
86: private void compute(Collection<? extends Node> nodes, long depth,
87: ClosureLayerSelector layerSelector) {
88: TransitiveClosureEngine engine = new TransitiveClosureEngine(
89: factory, nodes, startCriteria, stopCriteria,
90: layerSelector);
91:
92: if (depth == UNBOUNDED_DEPTH) {
93: engine.computeAllLayers();
94: } else {
95: engine.computeLayers(depth);
96: }
97: }
98: }
|