001 /*
002 * Copyright 2005 Sun Microsystems, Inc. All Rights Reserved.
003 * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
004 *
005 * This code is free software; you can redistribute it and/or modify it
006 * under the terms of the GNU General Public License version 2 only, as
007 * published by the Free Software Foundation. Sun designates this
008 * particular file as subject to the "Classpath" exception as provided
009 * by Sun in the LICENSE file that accompanied this code.
010 *
011 * This code is distributed in the hope that it will be useful, but WITHOUT
012 * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
013 * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
014 * version 2 for more details (a copy is included in the LICENSE file that
015 * accompanied this code).
016 *
017 * You should have received a copy of the GNU General Public License version
018 * 2 along with this work; if not, write to the Free Software Foundation,
019 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
020 *
021 * Please contact Sun Microsystems, Inc., 4150 Network Circle, Santa Clara,
022 * CA 95054 USA or visit www.sun.com if you need additional information or
023 * have any questions.
024 */
025
026 package com.sun.source.util;
027
028 import com.sun.source.tree.*;
029
030 /**
031 * A simple visitor for tree nodes.
032 *
033 * @author Peter von der Ahé
034 * @since 1.6
035 */
036 public class SimpleTreeVisitor <R,P> implements TreeVisitor<R,P> {
037 protected final R DEFAULT_VALUE;
038
039 protected SimpleTreeVisitor() {
040 DEFAULT_VALUE = null;
041 }
042
043 protected SimpleTreeVisitor(R defaultValue) {
044 DEFAULT_VALUE = defaultValue;
045 }
046
047 protected R defaultAction(Tree node, P p) {
048 return DEFAULT_VALUE;
049 }
050
051 public final R visit(Tree node, P p) {
052 return (node == null) ? null : node.accept(this, p);
053 }
054
055 public final R visit(Iterable<? extends Tree> nodes, P p) {
056 R r = null;
057 if (nodes != null)
058 for (Tree node : nodes)
059 r = visit(node, p);
060 return r;
061 }
062
063 public R visitCompilationUnit(CompilationUnitTree node, P p) {
064 return defaultAction(node, p);
065 }
066
067 public R visitImport(ImportTree node, P p) {
068 return defaultAction(node, p);
069 }
070
071 public R visitClass(ClassTree node, P p) {
072 return defaultAction(node, p);
073 }
074
075 public R visitMethod(MethodTree node, P p) {
076 return defaultAction(node, p);
077 }
078
079 public R visitVariable(VariableTree node, P p) {
080 return defaultAction(node, p);
081 }
082
083 public R visitEmptyStatement(EmptyStatementTree node, P p) {
084 return defaultAction(node, p);
085 }
086
087 public R visitBlock(BlockTree node, P p) {
088 return defaultAction(node, p);
089 }
090
091 /* emw4: staging stuff */
092 public R visitBracketExpr(BracketExprTree node, P p) {
093 throw new UnsupportedOperationException ("visitBracketExpr in SimpleTreeVisitor");
094 }
095
096 public R visitBracketStat(BracketStatTree node, P p) {
097 throw new UnsupportedOperationException ("visitBracketStat in SimpleTreeVisitor");
098 }
099
100 public R visitEscapeExpr(EscapeExprTree node, P p) {
101 throw new UnsupportedOperationException ("visitEscapeExpr in SimpleTreeVisitor");
102 }
103
104 public R visitEscapeStat(EscapeStatTree node, P p) {
105 throw new UnsupportedOperationException ("visitEscapeStat in SimpleTreeVisitor");
106 }
107
108 public R visitDoWhileLoop(DoWhileLoopTree node, P p) {
109 return defaultAction(node, p);
110 }
111
112 public R visitWhileLoop(WhileLoopTree node, P p) {
113 return defaultAction(node, p);
114 }
115
116 public R visitForLoop(ForLoopTree node, P p) {
117 return defaultAction(node, p);
118 }
119
120 public R visitEnhancedForLoop(EnhancedForLoopTree node, P p) {
121 return defaultAction(node, p);
122 }
123
124 public R visitLabeledStatement(LabeledStatementTree node, P p) {
125 return defaultAction(node, p);
126 }
127
128 public R visitSwitch(SwitchTree node, P p) {
129 return defaultAction(node, p);
130 }
131
132 public R visitCase(CaseTree node, P p) {
133 return defaultAction(node, p);
134 }
135
136 public R visitSynchronized(SynchronizedTree node, P p) {
137 return defaultAction(node, p);
138 }
139
140 public R visitTry(TryTree node, P p) {
141 return defaultAction(node, p);
142 }
143
144 public R visitCatch(CatchTree node, P p) {
145 return defaultAction(node, p);
146 }
147
148 public R visitConditionalExpression(ConditionalExpressionTree node, P p) {
149 return defaultAction(node, p);
150 }
151
152 public R visitIf(IfTree node, P p) {
153 return defaultAction(node, p);
154 }
155
156 public R visitExpressionStatement(ExpressionStatementTree node, P p) {
157 return defaultAction(node, p);
158 }
159
160 public R visitBreak(BreakTree node, P p) {
161 return defaultAction(node, p);
162 }
163
164 public R visitContinue(ContinueTree node, P p) {
165 return defaultAction(node, p);
166 }
167
168 public R visitReturn(ReturnTree node, P p) {
169 return defaultAction(node, p);
170 }
171
172 public R visitThrow(ThrowTree node, P p) {
173 return defaultAction(node, p);
174 }
175
176 public R visitAssert(AssertTree node, P p) {
177 return defaultAction(node, p);
178 }
179
180 public R visitMethodInvocation(MethodInvocationTree node, P p) {
181 return defaultAction(node, p);
182 }
183
184 public R visitNewClass(NewClassTree node, P p) {
185 return defaultAction(node, p);
186 }
187
188 public R visitNewArray(NewArrayTree node, P p) {
189 return defaultAction(node, p);
190 }
191
192 public R visitParenthesized(ParenthesizedTree node, P p) {
193 return defaultAction(node, p);
194 }
195
196 public R visitAssignment(AssignmentTree node, P p) {
197 return defaultAction(node, p);
198 }
199
200 public R visitCompoundAssignment(CompoundAssignmentTree node, P p) {
201 return defaultAction(node, p);
202 }
203
204 public R visitUnary(UnaryTree node, P p) {
205 return defaultAction(node, p);
206 }
207
208 public R visitBinary(BinaryTree node, P p) {
209 return defaultAction(node, p);
210 }
211
212 public R visitTypeCast(TypeCastTree node, P p) {
213 return defaultAction(node, p);
214 }
215
216 public R visitInstanceOf(InstanceOfTree node, P p) {
217 return defaultAction(node, p);
218 }
219
220 public R visitArrayAccess(ArrayAccessTree node, P p) {
221 return defaultAction(node, p);
222 }
223
224 public R visitMemberSelect(MemberSelectTree node, P p) {
225 return defaultAction(node, p);
226 }
227
228 public R visitIdentifier(IdentifierTree node, P p) {
229 return defaultAction(node, p);
230 }
231
232 public R visitLiteral(LiteralTree node, P p) {
233 return defaultAction(node, p);
234 }
235
236 public R visitPrimitiveType(PrimitiveTypeTree node, P p) {
237 return defaultAction(node, p);
238 }
239
240 public R visitArrayType(ArrayTypeTree node, P p) {
241 return defaultAction(node, p);
242 }
243
244 public R visitParameterizedType(ParameterizedTypeTree node, P p) {
245 return defaultAction(node, p);
246 }
247
248 public R visitTypeParameter(TypeParameterTree node, P p) {
249 return defaultAction(node, p);
250 }
251
252 public R visitWildcard(WildcardTree node, P p) {
253 return defaultAction(node, p);
254 }
255
256 public R visitModifiers(ModifiersTree node, P p) {
257 return defaultAction(node, p);
258 }
259
260 public R visitAnnotation(AnnotationTree node, P p) {
261 return defaultAction(node, p);
262 }
263
264 public R visitErroneous(ErroneousTree node, P p) {
265 return defaultAction(node, p);
266 }
267
268 public R visitOther(Tree node, P p) {
269 return defaultAction(node, p);
270 }
271 }