Package com.google.javascript.jscomp.lint

Class CheckDuplicateCase

java.lang.Object

com.google.javascript.jscomp.NodeTraversal.AbstractPostOrderCallback

com.google.javascript.jscomp.lint.CheckDuplicateCase

All Implemented Interfaces:

CompilerPass, NodeTraversal.Callback

public final class CheckDuplicateCase
extends NodeTraversal.AbstractPostOrderCallback
implements CompilerPass

Check for duplicate case labels in a switch statement Eg: switch (foo) { case 1: case 1: }

This is normally an indication of a programmer error.

Inspired by ESLint (https://github.com/eslint/eslint/blob/master/lib/rules/no-duplicate-case.js)

Field Summary

Fields

Modifier and Type	Field	Description
static final DiagnosticType	DUPLICATE_CASE

Constructor Summary

Constructors

Constructor	Description
CheckDuplicateCase(AbstractCompiler compiler)

Method Summary

Modifier and Type	Method	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).

Methods inherited from class com.google.javascript.jscomp.NodeTraversal.AbstractPostOrderCallback

shouldTraverse

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Details

DUPLICATE_CASE

public static final DiagnosticType DUPLICATE_CASE

Constructor Details

CheckDuplicateCase

public CheckDuplicateCase(AbstractCompiler compiler)

Method Details

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 interface CompilerPass

Parameters:

externs - Top of external JS tree

root - Top of JS tree

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 iff NodeTraversal.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 interface NodeTraversal.Callback

Parameters:

t - The current traversal.

n - The current node.

parent - The parent of the current node.