DepthFirstVisitor (DynamicJava API (dynamicjava-20100717-r5295))

Overview

Package

Class

Use

Tree

Deprecated

Index

Help

PREV CLASS NEXT CLASS

FRAMES NO FRAMES

SUMMARY: NESTED | FIELD | CONSTR | METHOD

DETAIL: FIELD | CONSTR | METHOD

koala.dynamicjava.tree.visitor
Class DepthFirstVisitor

java.lang.Object
  koala.dynamicjava.tree.visitor.DepthFirstVisitor

All Implemented Interfaces:: Runnable1<Node>, Visitor<Void>

public class DepthFirstVisitor
extends Object
implements Visitor<Void>, Runnable1<Node>
extends Object
implements Visitor<Void>, Runnable1<Node>

A visitor that traverses an AST in depth-first order. Clients should invoke run() rather than acceptVisitor() to invoke instances. To design a visitor that may perform an action or prune the traversal for each node, override run(), which by default just calls n.acceptVisitor(this). To customize behavior for specific node types, override the appropriate visit() method, which by default simply invokes a recur() method for each subtree. It is very important that changes to the AST class declarations be reflected here (otherwise, for example, a newly-added field will be silently ignored by the traversal).

Constructor Summary
`DepthFirstVisitor()`

Method Summary
`protected void`	`recur(Iterable<? extends Node> l)`
`protected void`	`recur(Node... ns)`
`protected void`	`recur(Node n)`
`protected void`	`recur(Option<? extends Node> opt)`
`protected void`	`recurOnList(Option<? extends Iterable<? extends Node>> opt)`
`protected void`	`recurOnLists(Iterable<? extends Iterable<? extends Node>> l)`
`protected void`	`recurOnPairSeconds(Iterable<? extends Pair<?,? extends Node>> l)`
`void`	`run(Node n)`
`Void`	`visit(AddAssignExpression node)`
`Void`	`visit(AddExpression node)`
`Void`	`visit(AmbiguousName node)`
`Void`	`visit(AndExpression node)`
`Void`	`visit(Annotation node)`
`Void`	`visit(AnonymousAllocation node)`
`Void`	`visit(AnonymousInnerAllocation node)`
`Void`	`visit(ArrayAccess node)`
`Void`	`visit(ArrayAllocation node)`
`Void`	`visit(ArrayInitializer node)`
`Void`	`visit(ArrayTypeName node)`
`Void`	`visit(AssertStatement node)`
`Void`	`visit(BitAndAssignExpression node)`
`Void`	`visit(BitAndExpression node)`
`Void`	`visit(BitOrAssignExpression node)`
`Void`	`visit(BitOrExpression node)`
`Void`	`visit(BlockStatement node)`
`Void`	`visit(BooleanTypeName node)`
`Void`	`visit(BreakStatement node)`
`Void`	`visit(ByteTypeName node)`
`Void`	`visit(CastExpression node)`
`Void`	`visit(CatchStatement node)`
`Void`	`visit(CharTypeName node)`
`Void`	`visit(ClassDeclaration node)`
`Void`	`visit(ClassInitializer node)`
`Void`	`visit(CompilationUnit node)`
`Void`	`visit(ComplementExpression node)`
`Void`	`visit(ConditionalExpression node)`
`Void`	`visit(ConstructorCall node)`
`Void`	`visit(ConstructorDeclaration node)`
`Void`	`visit(ContinueStatement node)`
`Void`	`visit(DivideAssignExpression node)`
`Void`	`visit(DivideExpression node)`
`Void`	`visit(DoStatement node)`
`Void`	`visit(DoubleTypeName node)`
`Void`	`visit(EmptyStatement node)`
`Void`	`visit(EnumDeclaration.EnumConstant node)`
`Void`	`visit(EqualExpression node)`
`Void`	`visit(ExclusiveOrAssignExpression node)`
`Void`	`visit(ExclusiveOrExpression node)`
`Void`	`visit(ExpressionStatement node)`
`Void`	`visit(FieldDeclaration node)`
`Void`	`visit(FloatTypeName node)`
`Void`	`visit(ForEachStatement node)`
`Void`	`visit(FormalParameter node)`
`Void`	`visit(ForStatement node)`
`Void`	`visit(GenericReferenceTypeName node)`
`Void`	`visit(GreaterExpression node)`
`Void`	`visit(GreaterOrEqualExpression node)`
`Void`	`visit(HookTypeName node)`
`Void`	`visit(IfThenElseStatement node)`
`Void`	`visit(IfThenStatement node)`
`Void`	`visit(ImportDeclaration node)`
`Void`	`visit(InnerAllocation node)`
`Void`	`visit(InstanceInitializer node)`
`Void`	`visit(InstanceOfExpression node)`
`Void`	`visit(InterfaceDeclaration node)`
`Void`	`visit(IntTypeName node)`
`Void`	`visit(LabeledStatement node)`
`Void`	`visit(LessExpression node)`
`Void`	`visit(LessOrEqualExpression node)`
`Void`	`visit(Literal node)`
`Void`	`visit(LongTypeName node)`
`Void`	`visit(MethodDeclaration node)`
`Void`	`visit(MinusExpression node)`
`Void`	`visit(ModifierSet node)`
`Void`	`visit(MultiplyAssignExpression node)`
`Void`	`visit(MultiplyExpression node)`
`Void`	`visit(NotEqualExpression node)`
`Void`	`visit(NotExpression node)`
`Void`	`visit(ObjectFieldAccess node)`
`Void`	`visit(ObjectMethodCall node)`
`Void`	`visit(OrExpression node)`
`Void`	`visit(PackageDeclaration node)`
`Void`	`visit(PlusExpression node)`
`Void`	`visit(PostDecrement node)`
`Void`	`visit(PostIncrement node)`
`Void`	`visit(PreDecrement node)`
`Void`	`visit(PreIncrement node)`
`Void`	`visit(ReferenceTypeName node)`
`Void`	`visit(RemainderAssignExpression node)`
`Void`	`visit(RemainderExpression node)`
`Void`	`visit(ReturnStatement node)`
`Void`	`visit(ShiftLeftAssignExpression node)`
`Void`	`visit(ShiftLeftExpression node)`
`Void`	`visit(ShiftRightAssignExpression node)`
`Void`	`visit(ShiftRightExpression node)`
`Void`	`visit(ShortTypeName node)`
`Void`	`visit(SimpleAllocation node)`
`Void`	`visit(SimpleAssignExpression node)`
`Void`	`visit(SimpleFieldAccess node)`
`Void`	`visit(SimpleMethodCall node)`
`Void`	`visit(StaticFieldAccess node)`
`Void`	`visit(StaticMethodCall node)`
`Void`	`visit(SubtractAssignExpression node)`
`Void`	`visit(SubtractExpression node)`
`Void`	`visit(SuperFieldAccess node)`
`Void`	`visit(SuperMethodCall node)`
`Void`	`visit(SwitchBlock node)`
`Void`	`visit(SwitchStatement node)`
`Void`	`visit(SynchronizedStatement node)`
`Void`	`visit(ThisExpression node)`
`Void`	`visit(ThrowStatement node)`
`Void`	`visit(TryStatement node)`
`Void`	`visit(TypeExpression node)`
`Void`	`visit(UnsignedShiftRightAssignExpression node)`
`Void`	`visit(UnsignedShiftRightExpression node)`
`Void`	`visit(VariableAccess node)`
`Void`	`visit(VariableDeclaration node)`
`Void`	`visit(VoidTypeName node)`
`Void`	`visit(WhileStatement node)`

Methods inherited from class java.lang.Object
`clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait`

Constructor Detail