public final class CheckEs6ModuleFileStructure extends NodeTraversal.AbstractPreOrderCallback implements CompilerPass
| Modifier and Type | Field and Description |
|---|---|
static DiagnosticType |
MUST_COME_BEFORE |
| Constructor and Description |
|---|
CheckEs6ModuleFileStructure(AbstractCompiler compiler) |
| Modifier and Type | Method and Description |
|---|---|
void |
process(Node externs,
Node root)
Process the JS with root node root.
|
boolean |
shouldTraverse(NodeTraversal t,
Node n,
Node parent)
Visits a node in preorder (before its children) and decides whether its children should be
traversed.
|
visitpublic static final DiagnosticType MUST_COME_BEFORE
public CheckEs6ModuleFileStructure(AbstractCompiler compiler)
public boolean shouldTraverse(NodeTraversal t, 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.Callbackt - 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 treeCopyright © 2009-2020 Google. All Rights Reserved.