public final class CheckNullableReturn extends java.lang.Object implements HotSwapCompilerPass, NodeTraversal.Callback
| Modifier and Type | Field and Description |
|---|---|
static DiagnosticType |
NULLABLE_RETURN |
static DiagnosticType |
NULLABLE_RETURN_WITH_NAME |
| Constructor and Description |
|---|
CheckNullableReturn(AbstractCompiler compiler) |
| Modifier and Type | Method and Description |
|---|---|
static boolean |
canReturnNull(ControlFlowGraph<Node> graph) |
static boolean |
hasReturnDeclaredNullable(Node n) |
void |
hotSwapScript(Node scriptRoot,
Node originalRoot)
Process the JS with root node root.
|
void |
process(Node externs,
Node root)
Process the JS with root node root.
|
boolean |
shouldTraverse(NodeTraversal nodeTraversal,
Node n,
Node parent)
Visits a node in preorder (before its children) and decides whether its children should be
traversed.
|
void |
visit(NodeTraversal t,
Node n,
Node parent)
Visits a node in postorder (after its children).
|
public static final DiagnosticType NULLABLE_RETURN
public static final DiagnosticType NULLABLE_RETURN_WITH_NAME
public CheckNullableReturn(AbstractCompiler compiler)
public static boolean hasReturnDeclaredNullable(Node n)
public void visit(NodeTraversal t, Node n, Node parent)
NodeTraversal.CallbackNodeTraversal.Callback.shouldTraverse(NodeTraversal, Node, Node) returned true for its parent. In particular, the
root node is never visited in postorder.
Siblings are always visited left-to-right.
Implementations can have side-effects (e.g. modify the parse tree). Removing the current node is legal, but removing or reordering nodes above the current node may cause nodes to be visited twice or not at all.
visit in interface NodeTraversal.Callbackt - The current traversal.n - The current node.parent - The parent of the current node.public static boolean canReturnNull(ControlFlowGraph<Node> graph)
public boolean shouldTraverse(NodeTraversal nodeTraversal, Node n, Node parent)
NodeTraversal.CallbackNodeTraversal.Callback.shouldTraverse(NodeTraversal, Node, Node) in preorder and by NodeTraversal.Callback.visit(NodeTraversal,
Node, Node) in postorder.
Siblings are always visited left-to-right.
Implementations can have side-effects (e.g. modify the parse tree). Removing the current node is legal, but removing or reordering nodes above the current node may cause nodes to be visited twice or not at all.
shouldTraverse in interface NodeTraversal.CallbacknodeTraversal - The current traversal.n - The current node.parent - The parent of the current node.public void process(Node externs, Node root)
CompilerPassprocess in interface CompilerPassexterns - Top of external JS treeroot - Top of JS treepublic void hotSwapScript(Node scriptRoot, Node originalRoot)
HotSwapCompilerPasshotSwapScript in interface HotSwapCompilerPassscriptRoot - Root node corresponding to the file that is modified,
should be of type Token.SCRIPT.originalRoot - Root node corresponding to the original version of the
file that is modified. Should be of type token.SCRIPT.Copyright © 2009-2020 Google. All Rights Reserved.