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: import junit.framework.*;
38:
39: public class TestGraphSummarizerWithScoping extends TestCase {
40: private NodeFactory factory;
41:
42: private Node b;
43:
44: private GraphSummarizer summarizer;
45:
46: protected void setUp() throws Exception {
47: factory = new NodeFactory();
48:
49: Node a_A_a = factory.createFeature("a.A.a");
50: Node a_A_b = factory.createFeature("a.A.b");
51:
52: b = factory.createPackage("b");
53: Node b_B_b = factory.createFeature("b.B.b");
54:
55: a_A_a.addDependency(a_A_b);
56: a_A_a.addDependency(b_B_b);
57:
58: List<String> includeScope = new LinkedList<String>();
59: includeScope.add("/^a/");
60:
61: RegularExpressionSelectionCriteria scopeCriteria = new RegularExpressionSelectionCriteria(
62: "//");
63:
64: scopeCriteria.setMatchingClasses(false);
65: scopeCriteria.setMatchingFeatures(false);
66: scopeCriteria.setGlobalIncludes(includeScope);
67:
68: RegularExpressionSelectionCriteria filterCriteria = new RegularExpressionSelectionCriteria(
69: "//");
70: filterCriteria.setMatchingClasses(false);
71: filterCriteria.setMatchingFeatures(false);
72:
73: summarizer = new GraphSummarizer(scopeCriteria, filterCriteria);
74: }
75:
76: public void testIncludeF2F() {
77: summarizer.traverseNodes(factory.getPackages().values());
78:
79: assertTrue(summarizer.getScopeFactory().createPackage("a")
80: .getInboundDependencies().isEmpty());
81: assertEquals(summarizer.getScopeFactory().createPackage("a")
82: .getOutboundDependencies().toString(), 1, summarizer
83: .getScopeFactory().createPackage("a")
84: .getOutboundDependencies().size());
85: assertTrue(summarizer.getScopeFactory().createPackage("a")
86: .getOutboundDependencies().contains(b));
87: }
88: }
|