Package | Description |
---|---|
com.sun.source.tree |
Provides interfaces to represent source code as abstract syntax
trees (AST).
|
com.sun.source.util |
Provides utilities for operations on abstract syntax trees (AST).
|
com.sun.tools.javac.api | |
com.sun.tools.javac.tree |
Modifier and Type | Method and Description |
---|---|
<R,D> R |
Tree.accept(TreeVisitor<R,D> visitor,
D data)
Accept method used to implement the visitor pattern.
|
Modifier and Type | Class and Description |
---|---|
class |
SimpleTreeVisitor<R,P>
A simple visitor for tree nodes.
|
class |
TreePathScanner<R,P>
A TreeVisitor that visits all the child tree nodes, and provides
support for maintaining a path for the parent nodes.
|
class |
TreeScanner<R,P>
A TreeVisitor that visits all the child tree nodes.
|
Modifier and Type | Class and Description |
---|---|
protected static class |
JavacTrees.Copier
Makes a copy of a tree, noting the value resulting from copying a particular leaf.
|
Modifier and Type | Class and Description |
---|---|
class |
TreeCopier<P>
Creates a copy of a tree, using a given TreeMaker.
|
Modifier and Type | Method and Description |
---|---|
abstract <R,D> R |
JCTree.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCAnnotatedType.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCAnnotation.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCArrayAccess.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCArrayTypeTree.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCAssert.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCAssign.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCAssignOp.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCBinary.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCBlock.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCBreak.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCCase.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCCatch.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCClassDecl.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCCompilationUnit.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCConditional.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCContinue.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCDoWhileLoop.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCEnhancedForLoop.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCErroneous.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCExpressionStatement.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCFieldAccess.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCForLoop.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCIdent.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCIf.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCImport.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCInstanceOf.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCLabeledStatement.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCLambda.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCLiteral.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCMemberReference.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCMethodDecl.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCMethodInvocation.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCModifiers.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCNewArray.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCNewClass.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCParens.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCPrimitiveTypeTree.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCReturn.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCSkip.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCSwitch.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCSynchronized.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCThrow.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCTry.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCTypeApply.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCTypeCast.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCTypeIntersection.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCTypeParameter.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCTypeUnion.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCUnary.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCVariableDecl.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCWhileLoop.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.JCWildcard.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.LetExpr.accept(TreeVisitor<R,D> v,
D d) |
<R,D> R |
JCTree.TypeBoundKind.accept(TreeVisitor<R,D> v,
D d) |
Copyright © 2017 earcam. All rights reserved.