• file
• revisions
• annotate
• diff
• comparison
• raw

src/share/classes/com/sun/source/util/SimpleTreeVisitor.java@93012e2a5d1d (annotated)

src/share/classes/com/sun/source/util/SimpleTreeVisitor.java

Sat, 07 Nov 2020 10:30:02 +0800

author

aoqi

date

Sat, 07 Nov 2020 10:30:02 +0800

changeset 3938

93012e2a5d1d

parent 2525

2eb010b6cb22

permissions

-rw-r--r--

Added tag mips-jdk8u275-b01 for changeset eb6ee6a5f2fe

aoqi@0	1	/*
aoqi@0	2	* Copyright (c) 2005, 2013, Oracle and/or its affiliates. All rights reserved.
aoqi@0	3	* DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER.
aoqi@0	4	*
aoqi@0	5	* This code is free software; you can redistribute it and/or modify it
aoqi@0	6	* under the terms of the GNU General Public License version 2 only, as
aoqi@0	7	* published by the Free Software Foundation. Oracle designates this
aoqi@0	8	* particular file as subject to the "Classpath" exception as provided
aoqi@0	9	* by Oracle in the LICENSE file that accompanied this code.
aoqi@0	10	*
aoqi@0	11	* This code is distributed in the hope that it will be useful, but WITHOUT
aoqi@0	12	* ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
aoqi@0	13	* FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
aoqi@0	14	* version 2 for more details (a copy is included in the LICENSE file that
aoqi@0	15	* accompanied this code).
aoqi@0	16	*
aoqi@0	17	* You should have received a copy of the GNU General Public License version
aoqi@0	18	* 2 along with this work; if not, write to the Free Software Foundation,
aoqi@0	19	* Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA.
aoqi@0	20	*
aoqi@0	21	* Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA
aoqi@0	22	* or visit www.oracle.com if you need additional information or have any
aoqi@0	23	* questions.
aoqi@0	24	*/
aoqi@0	25
aoqi@0	26	package com.sun.source.util;
aoqi@0	27
aoqi@0	28	import com.sun.source.tree.*;
aoqi@0	29
aoqi@0	30	/**
aoqi@0	31	* A simple visitor for tree nodes.
aoqi@0	32	*
aoqi@0	33	* @author Peter von der Ahé
aoqi@0	34	* @since 1.6
aoqi@0	35	*/
aoqi@0	36	@jdk.Exported
aoqi@0	37	public class SimpleTreeVisitor <R,P> implements TreeVisitor<R,P> {
aoqi@0	38	protected final R DEFAULT_VALUE;
aoqi@0	39
aoqi@0	40	protected SimpleTreeVisitor() {
aoqi@0	41	DEFAULT_VALUE = null;
aoqi@0	42	}
aoqi@0	43
aoqi@0	44	protected SimpleTreeVisitor(R defaultValue) {
aoqi@0	45	DEFAULT_VALUE = defaultValue;
aoqi@0	46	}
aoqi@0	47
aoqi@0	48	protected R defaultAction(Tree node, P p) {
aoqi@0	49	return DEFAULT_VALUE;
aoqi@0	50	}
aoqi@0	51
aoqi@0	52	public final R visit(Tree node, P p) {
aoqi@0	53	return (node == null) ? null : node.accept(this, p);
aoqi@0	54	}
aoqi@0	55
aoqi@0	56	public final R visit(Iterable<? extends Tree> nodes, P p) {
aoqi@0	57	R r = null;
aoqi@0	58	if (nodes != null)
aoqi@0	59	for (Tree node : nodes)
aoqi@0	60	r = visit(node, p);
aoqi@0	61	return r;
aoqi@0	62	}
aoqi@0	63
aoqi@0	64	public R visitCompilationUnit(CompilationUnitTree node, P p) {
aoqi@0	65	return defaultAction(node, p);
aoqi@0	66	}
aoqi@0	67
aoqi@0	68	public R visitImport(ImportTree node, P p) {
aoqi@0	69	return defaultAction(node, p);
aoqi@0	70	}
aoqi@0	71
aoqi@0	72	public R visitClass(ClassTree node, P p) {
aoqi@0	73	return defaultAction(node, p);
aoqi@0	74	}
aoqi@0	75
aoqi@0	76	public R visitMethod(MethodTree node, P p) {
aoqi@0	77	return defaultAction(node, p);
aoqi@0	78	}
aoqi@0	79
aoqi@0	80	public R visitVariable(VariableTree node, P p) {
aoqi@0	81	return defaultAction(node, p);
aoqi@0	82	}
aoqi@0	83
aoqi@0	84	public R visitEmptyStatement(EmptyStatementTree node, P p) {
aoqi@0	85	return defaultAction(node, p);
aoqi@0	86	}
aoqi@0	87
aoqi@0	88	public R visitBlock(BlockTree node, P p) {
aoqi@0	89	return defaultAction(node, p);
aoqi@0	90	}
aoqi@0	91
aoqi@0	92	public R visitDoWhileLoop(DoWhileLoopTree node, P p) {
aoqi@0	93	return defaultAction(node, p);
aoqi@0	94	}
aoqi@0	95
aoqi@0	96	public R visitWhileLoop(WhileLoopTree node, P p) {
aoqi@0	97	return defaultAction(node, p);
aoqi@0	98	}
aoqi@0	99
aoqi@0	100	public R visitForLoop(ForLoopTree node, P p) {
aoqi@0	101	return defaultAction(node, p);
aoqi@0	102	}
aoqi@0	103
aoqi@0	104	public R visitEnhancedForLoop(EnhancedForLoopTree node, P p) {
aoqi@0	105	return defaultAction(node, p);
aoqi@0	106	}
aoqi@0	107
aoqi@0	108	public R visitLabeledStatement(LabeledStatementTree node, P p) {
aoqi@0	109	return defaultAction(node, p);
aoqi@0	110	}
aoqi@0	111
aoqi@0	112	public R visitSwitch(SwitchTree node, P p) {
aoqi@0	113	return defaultAction(node, p);
aoqi@0	114	}
aoqi@0	115
aoqi@0	116	public R visitCase(CaseTree node, P p) {
aoqi@0	117	return defaultAction(node, p);
aoqi@0	118	}
aoqi@0	119
aoqi@0	120	public R visitSynchronized(SynchronizedTree node, P p) {
aoqi@0	121	return defaultAction(node, p);
aoqi@0	122	}
aoqi@0	123
aoqi@0	124	public R visitTry(TryTree node, P p) {
aoqi@0	125	return defaultAction(node, p);
aoqi@0	126	}
aoqi@0	127
aoqi@0	128	public R visitCatch(CatchTree node, P p) {
aoqi@0	129	return defaultAction(node, p);
aoqi@0	130	}
aoqi@0	131
aoqi@0	132	public R visitConditionalExpression(ConditionalExpressionTree node, P p) {
aoqi@0	133	return defaultAction(node, p);
aoqi@0	134	}
aoqi@0	135
aoqi@0	136	public R visitIf(IfTree node, P p) {
aoqi@0	137	return defaultAction(node, p);
aoqi@0	138	}
aoqi@0	139
aoqi@0	140	public R visitExpressionStatement(ExpressionStatementTree node, P p) {
aoqi@0	141	return defaultAction(node, p);
aoqi@0	142	}
aoqi@0	143
aoqi@0	144	public R visitBreak(BreakTree node, P p) {
aoqi@0	145	return defaultAction(node, p);
aoqi@0	146	}
aoqi@0	147
aoqi@0	148	public R visitContinue(ContinueTree node, P p) {
aoqi@0	149	return defaultAction(node, p);
aoqi@0	150	}
aoqi@0	151
aoqi@0	152	public R visitReturn(ReturnTree node, P p) {
aoqi@0	153	return defaultAction(node, p);
aoqi@0	154	}
aoqi@0	155
aoqi@0	156	public R visitThrow(ThrowTree node, P p) {
aoqi@0	157	return defaultAction(node, p);
aoqi@0	158	}
aoqi@0	159
aoqi@0	160	public R visitAssert(AssertTree node, P p) {
aoqi@0	161	return defaultAction(node, p);
aoqi@0	162	}
aoqi@0	163
aoqi@0	164	public R visitMethodInvocation(MethodInvocationTree node, P p) {
aoqi@0	165	return defaultAction(node, p);
aoqi@0	166	}
aoqi@0	167
aoqi@0	168	public R visitNewClass(NewClassTree node, P p) {
aoqi@0	169	return defaultAction(node, p);
aoqi@0	170	}
aoqi@0	171
aoqi@0	172	public R visitNewArray(NewArrayTree node, P p) {
aoqi@0	173	return defaultAction(node, p);
aoqi@0	174	}
aoqi@0	175
aoqi@0	176	public R visitLambdaExpression(LambdaExpressionTree node, P p) {
aoqi@0	177	return defaultAction(node, p);
aoqi@0	178	}
aoqi@0	179
aoqi@0	180	public R visitParenthesized(ParenthesizedTree node, P p) {
aoqi@0	181	return defaultAction(node, p);
aoqi@0	182	}
aoqi@0	183
aoqi@0	184	public R visitAssignment(AssignmentTree node, P p) {
aoqi@0	185	return defaultAction(node, p);
aoqi@0	186	}
aoqi@0	187
aoqi@0	188	public R visitCompoundAssignment(CompoundAssignmentTree node, P p) {
aoqi@0	189	return defaultAction(node, p);
aoqi@0	190	}
aoqi@0	191
aoqi@0	192	public R visitUnary(UnaryTree node, P p) {
aoqi@0	193	return defaultAction(node, p);
aoqi@0	194	}
aoqi@0	195
aoqi@0	196	public R visitBinary(BinaryTree node, P p) {
aoqi@0	197	return defaultAction(node, p);
aoqi@0	198	}
aoqi@0	199
aoqi@0	200	public R visitTypeCast(TypeCastTree node, P p) {
aoqi@0	201	return defaultAction(node, p);
aoqi@0	202	}
aoqi@0	203
aoqi@0	204	public R visitInstanceOf(InstanceOfTree node, P p) {
aoqi@0	205	return defaultAction(node, p);
aoqi@0	206	}
aoqi@0	207
aoqi@0	208	public R visitArrayAccess(ArrayAccessTree node, P p) {
aoqi@0	209	return defaultAction(node, p);
aoqi@0	210	}
aoqi@0	211
aoqi@0	212	public R visitMemberSelect(MemberSelectTree node, P p) {
aoqi@0	213	return defaultAction(node, p);
aoqi@0	214	}
aoqi@0	215
aoqi@0	216	public R visitMemberReference(MemberReferenceTree node, P p) {
aoqi@0	217	return defaultAction(node, p);
aoqi@0	218	}
aoqi@0	219
aoqi@0	220	public R visitIdentifier(IdentifierTree node, P p) {
aoqi@0	221	return defaultAction(node, p);
aoqi@0	222	}
aoqi@0	223
aoqi@0	224	public R visitLiteral(LiteralTree node, P p) {
aoqi@0	225	return defaultAction(node, p);
aoqi@0	226	}
aoqi@0	227
aoqi@0	228	public R visitPrimitiveType(PrimitiveTypeTree node, P p) {
aoqi@0	229	return defaultAction(node, p);
aoqi@0	230	}
aoqi@0	231
aoqi@0	232	public R visitArrayType(ArrayTypeTree node, P p) {
aoqi@0	233	return defaultAction(node, p);
aoqi@0	234	}
aoqi@0	235
aoqi@0	236	public R visitParameterizedType(ParameterizedTypeTree node, P p) {
aoqi@0	237	return defaultAction(node, p);
aoqi@0	238	}
aoqi@0	239
aoqi@0	240	public R visitUnionType(UnionTypeTree node, P p) {
aoqi@0	241	return defaultAction(node, p);
aoqi@0	242	}
aoqi@0	243
aoqi@0	244	public R visitIntersectionType(IntersectionTypeTree node, P p) {
aoqi@0	245	return defaultAction(node, p);
aoqi@0	246	}
aoqi@0	247
aoqi@0	248	public R visitTypeParameter(TypeParameterTree node, P p) {
aoqi@0	249	return defaultAction(node, p);
aoqi@0	250	}
aoqi@0	251
aoqi@0	252	public R visitWildcard(WildcardTree node, P p) {
aoqi@0	253	return defaultAction(node, p);
aoqi@0	254	}
aoqi@0	255
aoqi@0	256	public R visitModifiers(ModifiersTree node, P p) {
aoqi@0	257	return defaultAction(node, p);
aoqi@0	258	}
aoqi@0	259
aoqi@0	260	public R visitAnnotation(AnnotationTree node, P p) {
aoqi@0	261	return defaultAction(node, p);
aoqi@0	262	}
aoqi@0	263
aoqi@0	264	public R visitAnnotatedType(AnnotatedTypeTree node, P p) {
aoqi@0	265	return defaultAction(node, p);
aoqi@0	266	}
aoqi@0	267
aoqi@0	268	public R visitErroneous(ErroneousTree node, P p) {
aoqi@0	269	return defaultAction(node, p);
aoqi@0	270	}
aoqi@0	271
aoqi@0	272	public R visitOther(Tree node, P p) {
aoqi@0	273	return defaultAction(node, p);
aoqi@0	274	}
aoqi@0	275	}