KickJava   Java API By Example, From Geeks To Geeks.

Java > Open Source Codes > com > jeantessier > dependency > SelectiveTraversalStrategy


1 /*
2  * Copyright (c) 2001-2005, 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 SelectiveTraversalStrategy implements TraversalStrategy {
38     private SelectionCriteria scopeCriteria;
39     private SelectionCriteria filterCriteria;
40
41     private boolean preOutboundTraversal = true;
42     private boolean preInboundTraversal = true;
43     private boolean postOutboundTraversal = false;
44     private boolean postInboundTraversal = false;
45
46     public SelectiveTraversalStrategy() {
47         this(new ComprehensiveSelectionCriteria(), new ComprehensiveSelectionCriteria());
48     }
49     
50     public SelectiveTraversalStrategy(SelectionCriteria scopeCriteria, SelectionCriteria filterCriteria) {
51         this.scopeCriteria = scopeCriteria;
52         this.filterCriteria = filterCriteria;
53     }
54     
55     public boolean doPreOutboundTraversal() {
56         return preOutboundTraversal;
57     }
58
59     public void setPreOutboundTraversal(boolean preOutboundTraversal) {
60         this.preOutboundTraversal = preOutboundTraversal;
61     }
62
63     public boolean doPreInboundTraversal() {
64         return preInboundTraversal;
65     }
66
67     public void setPreInboundTraversal(boolean preInboundTraversal) {
68         this.preInboundTraversal = preInboundTraversal;
69     }
70
71     public boolean doPostOutboundTraversal() {
72         return postOutboundTraversal;
73     }
74
75     public void setPostOutboundTraversal(boolean postOutboundTraversal) {
76         this.postOutboundTraversal = postOutboundTraversal;
77     }
78
79     public boolean doPostInboundTraversal() {
80         return postInboundTraversal;
81     }
82
83     public void setPostInboundTraversal(boolean postInboundTraversal) {
84         this.postInboundTraversal = postInboundTraversal;
85     }
86
87     public boolean isInScope(PackageNode node) {
88         return scopeCriteria.matches(node);
89     }
90     
91     public boolean isInScope(ClassNode node) {
92         return scopeCriteria.matches(node);
93     }
94     
95     public boolean isInScope(FeatureNode node) {
96         return scopeCriteria.matches(node);
97     }
98
99     public boolean isInFilter(PackageNode node) {
100         return filterCriteria.matches(node);
101     }
102     
103     public boolean isInFilter(ClassNode node) {
104         return filterCriteria.matches(node);
105     }
106     
107     public boolean isInFilter(FeatureNode node) {
108         return filterCriteria.matches(node);
109     }
110
111     public Collection order(Collection collection) {
112         return new ArrayList(collection);
113     }
114 }
115
Popular Tags