duke@1: /* jjg@815: * Copyright (c) 2005, 2011, Oracle and/or its affiliates. All rights reserved. duke@1: * DO NOT ALTER OR REMOVE COPYRIGHT NOTICES OR THIS FILE HEADER. duke@1: * duke@1: * This code is free software; you can redistribute it and/or modify it duke@1: * under the terms of the GNU General Public License version 2 only, as ohair@554: * published by the Free Software Foundation. Oracle designates this duke@1: * particular file as subject to the "Classpath" exception as provided ohair@554: * by Oracle in the LICENSE file that accompanied this code. duke@1: * duke@1: * This code is distributed in the hope that it will be useful, but WITHOUT duke@1: * ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or duke@1: * FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License duke@1: * version 2 for more details (a copy is included in the LICENSE file that duke@1: * accompanied this code). duke@1: * duke@1: * You should have received a copy of the GNU General Public License version duke@1: * 2 along with this work; if not, write to the Free Software Foundation, duke@1: * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA. duke@1: * ohair@554: * Please contact Oracle, 500 Oracle Parkway, Redwood Shores, CA 94065 USA ohair@554: * or visit www.oracle.com if you need additional information or have any ohair@554: * questions. duke@1: */ duke@1: duke@1: package com.sun.source.util; duke@1: duke@1: import com.sun.source.tree.*; duke@1: duke@1: /** duke@1: * A simple visitor for tree nodes. duke@1: * duke@1: * @author Peter von der Ahé duke@1: * @since 1.6 duke@1: */ duke@1: public class SimpleTreeVisitor implements TreeVisitor { duke@1: protected final R DEFAULT_VALUE; duke@1: duke@1: protected SimpleTreeVisitor() { duke@1: DEFAULT_VALUE = null; duke@1: } duke@1: duke@1: protected SimpleTreeVisitor(R defaultValue) { duke@1: DEFAULT_VALUE = defaultValue; duke@1: } duke@1: duke@1: protected R defaultAction(Tree node, P p) { duke@1: return DEFAULT_VALUE; duke@1: } duke@1: duke@1: public final R visit(Tree node, P p) { duke@1: return (node == null) ? null : node.accept(this, p); duke@1: } duke@1: duke@1: public final R visit(Iterable nodes, P p) { duke@1: R r = null; duke@1: if (nodes != null) duke@1: for (Tree node : nodes) duke@1: r = visit(node, p); duke@1: return r; duke@1: } duke@1: duke@1: public R visitCompilationUnit(CompilationUnitTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitImport(ImportTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitClass(ClassTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitMethod(MethodTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitVariable(VariableTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitEmptyStatement(EmptyStatementTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitBlock(BlockTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitDoWhileLoop(DoWhileLoopTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitWhileLoop(WhileLoopTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitForLoop(ForLoopTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitEnhancedForLoop(EnhancedForLoopTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitLabeledStatement(LabeledStatementTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitSwitch(SwitchTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitCase(CaseTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitSynchronized(SynchronizedTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitTry(TryTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitCatch(CatchTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitConditionalExpression(ConditionalExpressionTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitIf(IfTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitExpressionStatement(ExpressionStatementTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitBreak(BreakTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitContinue(ContinueTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitReturn(ReturnTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitThrow(ThrowTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitAssert(AssertTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitMethodInvocation(MethodInvocationTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitNewClass(NewClassTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitNewArray(NewArrayTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitParenthesized(ParenthesizedTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitAssignment(AssignmentTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitCompoundAssignment(CompoundAssignmentTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitUnary(UnaryTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitBinary(BinaryTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitTypeCast(TypeCastTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitInstanceOf(InstanceOfTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitArrayAccess(ArrayAccessTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitMemberSelect(MemberSelectTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitIdentifier(IdentifierTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitLiteral(LiteralTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitPrimitiveType(PrimitiveTypeTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitArrayType(ArrayTypeTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitParameterizedType(ParameterizedTypeTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: darcy@969: public R visitUnionType(UnionTypeTree node, P p) { mcimadamore@550: return defaultAction(node, p); mcimadamore@550: } mcimadamore@550: duke@1: public R visitTypeParameter(TypeParameterTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitWildcard(WildcardTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitModifiers(ModifiersTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitAnnotation(AnnotationTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitErroneous(ErroneousTree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: duke@1: public R visitOther(Tree node, P p) { duke@1: return defaultAction(node, p); duke@1: } duke@1: }