FileDocCategorySizeDatePackage
SimpleTreeVisitor.javaAPI DocJava SE 6 API5668Tue Jun 10 00:23:26 BST 2008com.sun.source.util

SimpleTreeVisitor

public class SimpleTreeVisitor extends Object implements TreeVisitor
A simple visitor for tree nodes.
author
Peter von der Ahé
since
1.6

Fields Summary
protected final R
DEFAULT_VALUE
Constructors Summary
protected SimpleTreeVisitor()

	DEFAULT_VALUE = null;
    
protected SimpleTreeVisitor(R defaultValue)

	DEFAULT_VALUE = defaultValue;
    
Methods Summary
protected RdefaultAction(com.sun.source.tree.Tree node, P p)

	return DEFAULT_VALUE;
    
public final Rvisit(com.sun.source.tree.Tree node, P p)

	return (node == null) ? null : node.accept(this, p);
    
public final Rvisit(java.lang.Iterable nodes, P p)

	R r = null;
	if (nodes != null)
            for (Tree node : nodes)
                r = visit(node, p);
        return r;
    
public RvisitAnnotation(com.sun.source.tree.AnnotationTree node, P p)

	return defaultAction(node, p);
    
public RvisitArrayAccess(com.sun.source.tree.ArrayAccessTree node, P p)

	return defaultAction(node, p);
    
public RvisitArrayType(com.sun.source.tree.ArrayTypeTree node, P p)

	return defaultAction(node, p);
    
public RvisitAssert(com.sun.source.tree.AssertTree node, P p)

	return defaultAction(node, p);
    
public RvisitAssignment(com.sun.source.tree.AssignmentTree node, P p)

	return defaultAction(node, p);
    
public RvisitBinary(com.sun.source.tree.BinaryTree node, P p)

	return defaultAction(node, p);
    
public RvisitBlock(com.sun.source.tree.BlockTree node, P p)

	return defaultAction(node, p);
    
public RvisitBreak(com.sun.source.tree.BreakTree node, P p)

	return defaultAction(node, p);
    
public RvisitCase(com.sun.source.tree.CaseTree node, P p)

	return defaultAction(node, p);
    
public RvisitCatch(com.sun.source.tree.CatchTree node, P p)

	return defaultAction(node, p);
    
public RvisitClass(com.sun.source.tree.ClassTree node, P p)

	return defaultAction(node, p);
    
public RvisitCompilationUnit(com.sun.source.tree.CompilationUnitTree node, P p)

	return defaultAction(node, p);
    
public RvisitCompoundAssignment(com.sun.source.tree.CompoundAssignmentTree node, P p)

	return defaultAction(node, p);
    
public RvisitConditionalExpression(com.sun.source.tree.ConditionalExpressionTree node, P p)

	return defaultAction(node, p);
    
public RvisitContinue(com.sun.source.tree.ContinueTree node, P p)

	return defaultAction(node, p);
    
public RvisitDoWhileLoop(com.sun.source.tree.DoWhileLoopTree node, P p)

	return defaultAction(node, p);
    
public RvisitEmptyStatement(com.sun.source.tree.EmptyStatementTree node, P p)

	return defaultAction(node, p);
    
public RvisitEnhancedForLoop(com.sun.source.tree.EnhancedForLoopTree node, P p)

	return defaultAction(node, p);
    
public RvisitErroneous(com.sun.source.tree.ErroneousTree node, P p)

	return defaultAction(node, p);
    
public RvisitExpressionStatement(com.sun.source.tree.ExpressionStatementTree node, P p)

	return defaultAction(node, p);
    
public RvisitForLoop(com.sun.source.tree.ForLoopTree node, P p)

	return defaultAction(node, p);
    
public RvisitIdentifier(com.sun.source.tree.IdentifierTree node, P p)

	return defaultAction(node, p);
    
public RvisitIf(com.sun.source.tree.IfTree node, P p)

	return defaultAction(node, p);
    
public RvisitImport(com.sun.source.tree.ImportTree node, P p)

	return defaultAction(node, p);
    
public RvisitInstanceOf(com.sun.source.tree.InstanceOfTree node, P p)

	return defaultAction(node, p);
    
public RvisitLabeledStatement(com.sun.source.tree.LabeledStatementTree node, P p)

	return defaultAction(node, p);
    
public RvisitLiteral(com.sun.source.tree.LiteralTree node, P p)

	return defaultAction(node, p);
    
public RvisitMemberSelect(com.sun.source.tree.MemberSelectTree node, P p)

	return defaultAction(node, p);
    
public RvisitMethod(com.sun.source.tree.MethodTree node, P p)

	return defaultAction(node, p);
    
public RvisitMethodInvocation(com.sun.source.tree.MethodInvocationTree node, P p)

	return defaultAction(node, p);
    
public RvisitModifiers(com.sun.source.tree.ModifiersTree node, P p)

	return defaultAction(node, p);
    
public RvisitNewArray(com.sun.source.tree.NewArrayTree node, P p)

	return defaultAction(node, p);
    
public RvisitNewClass(com.sun.source.tree.NewClassTree node, P p)

	return defaultAction(node, p);
    
public RvisitOther(com.sun.source.tree.Tree node, P p)

	return defaultAction(node, p);
    
public RvisitParameterizedType(com.sun.source.tree.ParameterizedTypeTree node, P p)

	return defaultAction(node, p);
    
public RvisitParenthesized(com.sun.source.tree.ParenthesizedTree node, P p)

	return defaultAction(node, p);
    
public RvisitPrimitiveType(com.sun.source.tree.PrimitiveTypeTree node, P p)

	return defaultAction(node, p);
    
public RvisitReturn(com.sun.source.tree.ReturnTree node, P p)

	return defaultAction(node, p);
    
public RvisitSwitch(com.sun.source.tree.SwitchTree node, P p)

	return defaultAction(node, p);
    
public RvisitSynchronized(com.sun.source.tree.SynchronizedTree node, P p)

	return defaultAction(node, p);
    
public RvisitThrow(com.sun.source.tree.ThrowTree node, P p)

	return defaultAction(node, p);
    
public RvisitTry(com.sun.source.tree.TryTree node, P p)

	return defaultAction(node, p);
    
public RvisitTypeCast(com.sun.source.tree.TypeCastTree node, P p)

	return defaultAction(node, p);
    
public RvisitTypeParameter(com.sun.source.tree.TypeParameterTree node, P p)

	return defaultAction(node, p);
    
public RvisitUnary(com.sun.source.tree.UnaryTree node, P p)

	return defaultAction(node, p);
    
public RvisitVariable(com.sun.source.tree.VariableTree node, P p)

	return defaultAction(node, p);
    
public RvisitWhileLoop(com.sun.source.tree.WhileLoopTree node, P p)

	return defaultAction(node, p);
    
public RvisitWildcard(com.sun.source.tree.WildcardTree node, P p)

	return defaultAction(node, p);