Class CheckEs6Modules
- java.lang.Object
-
- com.google.javascript.jscomp.lint.CheckEs6Modules
-
- All Implemented Interfaces:
CompilerPass
,NodeTraversal.Callback
public final class CheckEs6Modules extends java.lang.Object implements NodeTraversal.Callback, CompilerPass
Miscellaneous checks for style in ES6 modules.
-
-
Field Summary
Fields Modifier and Type Field Description static DiagnosticType
DUPLICATE_IMPORT
static DiagnosticType
NO_DEFAULT_EXPORT
-
Constructor Summary
Constructors Constructor Description CheckEs6Modules(AbstractCompiler compiler)
-
Method Summary
All Methods Instance Methods Concrete Methods Modifier and Type Method 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 the node and its children should be traversed.void
visit(NodeTraversal t, Node n, Node parent)
Visits a node in postorder (after its children).
-
-
-
Field Detail
-
DUPLICATE_IMPORT
public static final DiagnosticType DUPLICATE_IMPORT
-
NO_DEFAULT_EXPORT
public static final DiagnosticType NO_DEFAULT_EXPORT
-
-
Constructor Detail
-
CheckEs6Modules
public CheckEs6Modules(AbstractCompiler compiler)
-
-
Method Detail
-
visit
public void visit(NodeTraversal t, Node n, Node parent)
Description copied from interface:NodeTraversal.Callback
Visits a node in postorder (after its children). A node is visited in postorder iffNodeTraversal.Callback.shouldTraverse(NodeTraversal, Node, Node)
returned true for its parent and itself. 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.
- Specified by:
visit
in interfaceNodeTraversal.Callback
- Parameters:
t
- The current traversal.n
- The current node.parent
- The parent of the current node.
-
shouldTraverse
public boolean shouldTraverse(NodeTraversal t, Node n, Node parent)
Description copied from interface:NodeTraversal.Callback
Visits a node in preorder (before its children) and decides whether the node and its children should be traversed.If this method returns true, the node will be visited by
NodeTraversal.Callback.visit(NodeTraversal, Node, Node)
in postorder and its children will be visited by bothNodeTraversal.Callback.shouldTraverse(NodeTraversal, Node, Node)
in preorder and byNodeTraversal.Callback.visit(NodeTraversal, Node, Node)
in postorder.If this method returns false, the node will not be visited by
NodeTraversal.Callback.visit(NodeTraversal, Node, Node)
and its children will neither be visited byNodeTraversal.Callback.shouldTraverse(NodeTraversal, Node, Node)
norNodeTraversal.Callback.visit(NodeTraversal, Node, Node)
.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.
- Specified by:
shouldTraverse
in interfaceNodeTraversal.Callback
- Parameters:
t
- The current traversal.n
- The current node.parent
- The parent of the current node.- Returns:
- whether the children of this node should be visited
-
process
public void process(Node externs, Node root)
Description copied from interface:CompilerPass
Process the JS with root node root. Can modify the contents of each Node tree- Specified by:
process
in interfaceCompilerPass
- Parameters:
externs
- Top of external JS treeroot
- Top of JS tree
-
-