public final class CheckEnums extends NodeTraversal.AbstractPostOrderCallback implements CompilerPass
Modifier and Type | Field and Description |
---|---|
static DiagnosticType |
COMPUTED_PROP_NAME_IN_ENUM |
static DiagnosticType |
DUPLICATE_ENUM_VALUE |
static DiagnosticType |
ENUM_PROP_NOT_CONSTANT |
static DiagnosticType |
SHORTHAND_ASSIGNMENT_IN_ENUM |
Constructor and Description |
---|
CheckEnums(AbstractCompiler compiler) |
Modifier and Type | Method and Description |
---|---|
void |
process(Node externs,
Node root)
Process the JS with root node root.
|
void |
visit(NodeTraversal t,
Node n,
Node parent)
Visits a node in postorder (after its children).
|
shouldTraverse
public static final DiagnosticType DUPLICATE_ENUM_VALUE
public static final DiagnosticType COMPUTED_PROP_NAME_IN_ENUM
public static final DiagnosticType SHORTHAND_ASSIGNMENT_IN_ENUM
public static final DiagnosticType ENUM_PROP_NOT_CONSTANT
public CheckEnums(AbstractCompiler compiler)
public void process(Node externs, Node root)
CompilerPass
process
in interface CompilerPass
externs
- Top of external JS treeroot
- Top of JS treepublic void visit(NodeTraversal t, Node n, Node parent)
NodeTraversal.Callback
NodeTraversal.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.Callback
t
- The current traversal.n
- The current node.parent
- The parent of the current node.Copyright © 2009-2020 Google. All Rights Reserved.