simpletreevisitor.java

Mobile 应用程序使用 Java Micro Edition (Java ME) 平台

/*
 * @(#)SimpleTreeVisitor.java	1.3 05/11/17
 *
 * Copyright 2006 Sun Microsystems, Inc. All rights reserved.
 * SUN PROPRIETARY/CONFIDENTIAL. Use is subject to license terms.
 *
 * Use and Distribution is subject to the Java Research License available
 * at <http://www.sun.com/software/communitysource/jrl.html>.
 */

package com.sun.source.util;

import com.sun.source.tree.*;

/**
 * A simple visitor for tree nodes.
 *
 * @author Peter von der Ah&eacute;
 * @since 1.6
 */
public class SimpleTreeVisitor <R,P> implements TreeVisitor<R,P> {
    protected final R DEFAULT_VALUE;

    protected SimpleTreeVisitor() {
	DEFAULT_VALUE = null;
    }

    protected SimpleTreeVisitor(R defaultValue) {
	DEFAULT_VALUE = defaultValue;
    }

    protected R defaultAction(Tree node, P p) {
	return DEFAULT_VALUE;
    }

    public final R visit(Tree node, P p) {
	return (node == null) ? null : node.accept(this, p);
    }

    public final R visit(Iterable<? extends Tree> nodes, P p) {
	R r = null;
	if (nodes != null)
            for (Tree node : nodes)
                r = visit(node, p);
        return r;
    }

    public R visitCompilationUnit(CompilationUnitTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitImport(ImportTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitClass(ClassTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitMethod(MethodTree node, P p) {
	return defaultAction(node, p);
    }
	
    public R visitVariable(VariableTree node, P p) {
	return defaultAction(node, p);
    }
	
    public R visitEmptyStatement(EmptyStatementTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitBlock(BlockTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitDoWhileLoop(DoWhileLoopTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitWhileLoop(WhileLoopTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitForLoop(ForLoopTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitEnhancedForLoop(EnhancedForLoopTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitLabeledStatement(LabeledStatementTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitSwitch(SwitchTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitCase(CaseTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitSynchronized(SynchronizedTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitTry(TryTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitCatch(CatchTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitConditionalExpression(ConditionalExpressionTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitIf(IfTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitExpressionStatement(ExpressionStatementTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitBreak(BreakTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitContinue(ContinueTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitReturn(ReturnTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitThrow(ThrowTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitAssert(AssertTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitMethodInvocation(MethodInvocationTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitNewClass(NewClassTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitNewArray(NewArrayTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitParenthesized(ParenthesizedTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitAssignment(AssignmentTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitCompoundAssignment(CompoundAssignmentTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitUnary(UnaryTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitBinary(BinaryTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitTypeCast(TypeCastTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitInstanceOf(InstanceOfTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitArrayAccess(ArrayAccessTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitMemberSelect(MemberSelectTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitIdentifier(IdentifierTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitLiteral(LiteralTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitPrimitiveType(PrimitiveTypeTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitArrayType(ArrayTypeTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitParameterizedType(ParameterizedTypeTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitTypeParameter(TypeParameterTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitWildcard(WildcardTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitModifiers(ModifiersTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitAnnotation(AnnotationTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitErroneous(ErroneousTree node, P p) {
	return defaultAction(node, p);
    }

    public R visitOther(Tree node, P p) {
	return defaultAction(node, p);
    }
}