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 ClosureStopSelector implements Visitor { |
38 | private boolean done = false; |
39 | |
40 | private SelectionCriteria criteria; |
41 | |
42 | public ClosureStopSelector(SelectionCriteria criteria) { |
43 | this.criteria = criteria; |
44 | } |
45 | |
46 | public boolean isDone() { |
47 | return done; |
48 | } |
49 | |
50 | public void traverseNodes(Collection<? extends Node> nodes) { |
51 | if (nodes.isEmpty()) { |
52 | done = true; |
53 | } else { |
54 | for (Node node : nodes) { |
55 | node.accept(this); |
56 | } |
57 | } |
58 | } |
59 | |
60 | public void traverseInbound(Collection<? extends Node> nodes) { |
61 | throw new UnsupportedOperationException("not implemented yet."); |
62 | } |
63 | |
64 | public void traverseOutbound(Collection<? extends Node> nodes) { |
65 | throw new UnsupportedOperationException("not implemented yet."); |
66 | } |
67 | |
68 | public void visitPackageNode(PackageNode node) { |
69 | if (criteria.matches(node)) { |
70 | done = true; |
71 | } |
72 | } |
73 | |
74 | public void visitInboundPackageNode(PackageNode node) { |
75 | // Do nothing |
76 | } |
77 | |
78 | public void visitOutboundPackageNode(PackageNode node) { |
79 | // Do nothing |
80 | } |
81 | |
82 | public void visitClassNode(ClassNode node) { |
83 | if (criteria.matches(node)) { |
84 | done = true; |
85 | } |
86 | } |
87 | |
88 | public void visitInboundClassNode(ClassNode node) { |
89 | // Do nothing |
90 | } |
91 | |
92 | public void visitOutboundClassNode(ClassNode node) { |
93 | // Do nothing |
94 | } |
95 | |
96 | public void visitFeatureNode(FeatureNode node) { |
97 | if (criteria.matches(node)) { |
98 | done = true; |
99 | } |
100 | } |
101 | |
102 | public void visitInboundFeatureNode(FeatureNode node) { |
103 | // Do nothing |
104 | } |
105 | |
106 | public void visitOutboundFeatureNode(FeatureNode node) { |
107 | // Do nothing |
108 | } |
109 | } |