eslint 8.43.0 → 8.45.0

package/lib/rules/indent.js

@@ -188,15 +188,19 @@ class TokenInfo {
      */
     constructor(sourceCode) {
         this.sourceCode = sourceCode;
-        this.firstTokensByLineNumber = sourceCode.tokensAndComments.reduce((map, token) => {
-            if (!map.has(token.loc.start.line)) {
-                map.set(token.loc.start.line, token);
+        this.firstTokensByLineNumber = new Map();
+        const tokens = sourceCode.tokensAndComments;
+
+        for (let i = 0; i < tokens.length; i++) {
+            const token = tokens[i];
+
+            if (!this.firstTokensByLineNumber.has(token.loc.start.line)) {
+                this.firstTokensByLineNumber.set(token.loc.start.line, token);
             }
-            if (!map.has(token.loc.end.line) && sourceCode.text.slice(token.range[1] - token.loc.end.column, token.range[1]).trim()) {
-                map.set(token.loc.end.line, token);
+            if (!this.firstTokensByLineNumber.has(token.loc.end.line) && sourceCode.text.slice(token.range[1] - token.loc.end.column, token.range[1]).trim()) {
+                this.firstTokensByLineNumber.set(token.loc.end.line, token);
             }
-            return map;
-        }, new Map());
+        }
     }
 
     /**
@@ -964,19 +968,19 @@ module.exports = {
             const parenStack = [];
             const parenPairs = [];
 
-            tokens.forEach(nextToken => {
+            for (let i = 0; i < tokens.length; i++) {
+                const nextToken = tokens[i];
 
-                // Accumulate a list of parenthesis pairs
                 if (astUtils.isOpeningParenToken(nextToken)) {
                     parenStack.push(nextToken);
                 } else if (astUtils.isClosingParenToken(nextToken)) {
-                    parenPairs.unshift({ left: parenStack.pop(), right: nextToken });
+                    parenPairs.push({ left: parenStack.pop(), right: nextToken });
                 }
-            });
+            }
 
-            parenPairs.forEach(pair => {
-                const leftParen = pair.left;
-                const rightParen = pair.right;
+            for (let i = parenPairs.length - 1; i >= 0; i--) {
+                const leftParen = parenPairs[i].left;
+                const rightParen = parenPairs[i].right;
 
                 // We only want to handle parens around expressions, so exclude parentheses that are in function parameters and function call arguments.
                 if (!parameterParens.has(leftParen) && !parameterParens.has(rightParen)) {
@@ -990,7 +994,7 @@ module.exports = {
                 }
 
                 offsets.setDesiredOffset(rightParen, leftParen, 0);
-            });
+            }
         }
 
         /**
@@ -1246,7 +1250,7 @@ module.exports = {
 
             IfStatement(node) {
                 addBlocklessNodeIndent(node.consequent);
-                if (node.alternate && node.alternate.type !== "IfStatement") {
+                if (node.alternate) {
                     addBlocklessNodeIndent(node.alternate);
                 }
             },
@@ -1711,9 +1715,13 @@ module.exports = {
                     }
 
                     // Invoke the queued offset listeners for the nodes that aren't ignored.
-                    listenerCallQueue
-                        .filter(nodeInfo => !ignoredNodes.has(nodeInfo.node))
-                        .forEach(nodeInfo => nodeInfo.listener(nodeInfo.node));
+                    for (let i = 0; i < listenerCallQueue.length; i++) {
+                        const nodeInfo = listenerCallQueue[i];
+
+                        if (!ignoredNodes.has(nodeInfo.node)) {
+                            nodeInfo.listener(nodeInfo.node);
+                        }
+                    }
 
                     // Update the offsets for ignored nodes to prevent their child tokens from being reported.
                     ignoredNodes.forEach(ignoreNode);
@@ -1724,27 +1732,31 @@ module.exports = {
                      * Create a Map from (tokenOrComment) => (precedingToken).
                      * This is necessary because sourceCode.getTokenBefore does not handle a comment as an argument correctly.
                      */
-                    const precedingTokens = sourceCode.ast.comments.reduce((commentMap, comment) => {
+                    const precedingTokens = new WeakMap();
+
+                    for (let i = 0; i < sourceCode.ast.comments.length; i++) {
+                        const comment = sourceCode.ast.comments[i];
+
                         const tokenOrCommentBefore = sourceCode.getTokenBefore(comment, { includeComments: true });
+                        const hasToken = precedingTokens.has(tokenOrCommentBefore) ? precedingTokens.get(tokenOrCommentBefore) : tokenOrCommentBefore;
 
-                        return commentMap.set(comment, commentMap.has(tokenOrCommentBefore) ? commentMap.get(tokenOrCommentBefore) : tokenOrCommentBefore);
-                    }, new WeakMap());
+                        precedingTokens.set(comment, hasToken);
+                    }
 
-                    sourceCode.lines.forEach((line, lineIndex) => {
-                        const lineNumber = lineIndex + 1;
+                    for (let i = 1; i < sourceCode.lines.length + 1; i++) {
 
-                        if (!tokenInfo.firstTokensByLineNumber.has(lineNumber)) {
+                        if (!tokenInfo.firstTokensByLineNumber.has(i)) {
 
                             // Don't check indentation on blank lines
-                            return;
+                            continue;
                         }
 
-                        const firstTokenOfLine = tokenInfo.firstTokensByLineNumber.get(lineNumber);
+                        const firstTokenOfLine = tokenInfo.firstTokensByLineNumber.get(i);
 
-                        if (firstTokenOfLine.loc.start.line !== lineNumber) {
+                        if (firstTokenOfLine.loc.start.line !== i) {
 
                             // Don't check the indentation of multi-line tokens (e.g. template literals or block comments) twice.
-                            return;
+                            continue;
                         }
 
                         if (astUtils.isCommentToken(firstTokenOfLine)) {
@@ -1769,18 +1781,18 @@ module.exports = {
                                 mayAlignWithBefore && validateTokenIndent(firstTokenOfLine, offsets.getDesiredIndent(tokenBefore)) ||
                                 mayAlignWithAfter && validateTokenIndent(firstTokenOfLine, offsets.getDesiredIndent(tokenAfter))
                             ) {
-                                return;
+                                continue;
                             }
                         }
 
                         // If the token matches the expected indentation, don't report it.
                         if (validateTokenIndent(firstTokenOfLine, offsets.getDesiredIndent(firstTokenOfLine))) {
-                            return;
+                            continue;
                         }
 
                         // Otherwise, report the token/comment.
                         report(firstTokenOfLine, offsets.getDesiredIndent(firstTokenOfLine));
-                    });
+                    }
                 }
             }
         );

package/lib/rules/logical-assignment-operators.js

@@ -370,8 +370,11 @@ module.exports = {
                                 return;
                             }
 
-                            const requiresOuterParenthesis = logical.parent.type !== "ExpressionStatement" &&
-                                                             (astUtils.getPrecedence({ type: "AssignmentExpression" }) < astUtils.getPrecedence(logical.parent));
+                            const parentPrecedence = astUtils.getPrecedence(logical.parent);
+                            const requiresOuterParenthesis = logical.parent.type !== "ExpressionStatement" && (
+                                parentPrecedence === -1 ||
+                                astUtils.getPrecedence({ type: "AssignmentExpression" }) < parentPrecedence
+                            );
 
                             if (!astUtils.isParenthesised(sourceCode, logical) && requiresOuterParenthesis) {
                                 yield ruleFixer.insertTextBefore(logical, "(");

package/lib/rules/max-len.js

@@ -252,19 +252,23 @@ module.exports = {
             return sourceCode.ast.tokens.filter(token => token.type === "RegularExpression");
         }
 
-
         /**
-         * A reducer to group an AST node by line number, both start and end.
-         * @param {Object} acc the accumulator
-         * @param {ASTNode} node the AST node in question
-         * @returns {Object} the modified accumulator
-         * @private
+         *
+         * reduce an array of AST nodes by line number, both start and end.
+         * @param {ASTNode[]} arr array of AST nodes
+         * @returns {Object} accululated AST nodes
          */
-        function groupByLineNumber(acc, node) {
-            for (let i = node.loc.start.line; i <= node.loc.end.line; ++i) {
-                ensureArrayAndPush(acc, i, node);
+        function groupArrayByLineNumber(arr) {
+            const obj = {};
+
+            for (let i = 0; i < arr.length; i++) {
+                const node = arr[i];
+
+                for (let j = node.loc.start.line; j <= node.loc.end.line; ++j) {
+                    ensureArrayAndPush(obj, j, node);
+                }
             }
-            return acc;
+            return obj;
         }
 
         /**
@@ -312,13 +316,13 @@ module.exports = {
             let commentsIndex = 0;
 
             const strings = getAllStrings();
-            const stringsByLine = strings.reduce(groupByLineNumber, {});
+            const stringsByLine = groupArrayByLineNumber(strings);
 
             const templateLiterals = getAllTemplateLiterals();
-            const templateLiteralsByLine = templateLiterals.reduce(groupByLineNumber, {});
+            const templateLiteralsByLine = groupArrayByLineNumber(templateLiterals);
 
             const regExpLiterals = getAllRegExpLiterals();
-            const regExpLiteralsByLine = regExpLiterals.reduce(groupByLineNumber, {});
+            const regExpLiteralsByLine = groupArrayByLineNumber(regExpLiterals);
 
             lines.forEach((line, i) => {
 

package/lib/rules/no-extra-parens.js

@@ -46,6 +46,7 @@ module.exports = {
                             type: "object",
                             properties: {
                                 conditionalAssign: { type: "boolean" },
+                                ternaryOperandBinaryExpressions: { type: "boolean" },
                                 nestedBinaryExpressions: { type: "boolean" },
                                 returnAssign: { type: "boolean" },
                                 ignoreJSX: { enum: ["none", "all", "single-line", "multi-line"] },
@@ -76,6 +77,7 @@ module.exports = {
         const precedence = astUtils.getPrecedence;
         const ALL_NODES = context.options[0] !== "functions";
         const EXCEPT_COND_ASSIGN = ALL_NODES && context.options[1] && context.options[1].conditionalAssign === false;
+        const EXCEPT_COND_TERNARY = ALL_NODES && context.options[1] && context.options[1].ternaryOperandBinaryExpressions === false;
         const NESTED_BINARY = ALL_NODES && context.options[1] && context.options[1].nestedBinaryExpressions === false;
         const EXCEPT_RETURN_ASSIGN = ALL_NODES && context.options[1] && context.options[1].returnAssign === false;
         const IGNORE_JSX = ALL_NODES && context.options[1] && context.options[1].ignoreJSX;
@@ -886,18 +888,26 @@ module.exports = {
                 if (isReturnAssignException(node)) {
                     return;
                 }
+
+                const availableTypes = new Set(["BinaryExpression", "LogicalExpression"]);
+
                 if (
+                    !(EXCEPT_COND_TERNARY && availableTypes.has(node.test.type)) &&
                     !isCondAssignException(node) &&
                     hasExcessParensWithPrecedence(node.test, precedence({ type: "LogicalExpression", operator: "||" }))
                 ) {
                     report(node.test);
                 }
 
-                if (hasExcessParensWithPrecedence(node.consequent, PRECEDENCE_OF_ASSIGNMENT_EXPR)) {
+                if (
+                    !(EXCEPT_COND_TERNARY && availableTypes.has(node.consequent.type)) &&
+                    hasExcessParensWithPrecedence(node.consequent, PRECEDENCE_OF_ASSIGNMENT_EXPR)) {
                     report(node.consequent);
                 }
 
-                if (hasExcessParensWithPrecedence(node.alternate, PRECEDENCE_OF_ASSIGNMENT_EXPR)) {
+                if (
+                    !(EXCEPT_COND_TERNARY && availableTypes.has(node.alternate.type)) &&
+                    hasExcessParensWithPrecedence(node.alternate, PRECEDENCE_OF_ASSIGNMENT_EXPR)) {
                     report(node.alternate);
                 }
             },

package/lib/rules/no-extra-semi.js

@@ -38,6 +38,23 @@ module.exports = {
     create(context) {
         const sourceCode = context.sourceCode;
 
+        /**
+         * Checks if a node or token is fixable.
+         * A node is fixable if it can be removed without turning a subsequent statement into a directive after fixing other nodes.
+         * @param {Token} nodeOrToken The node or token to check.
+         * @returns {boolean} Whether or not the node is fixable.
+         */
+        function isFixable(nodeOrToken) {
+            const nextToken = sourceCode.getTokenAfter(nodeOrToken);
+
+            if (!nextToken || nextToken.type !== "String") {
+                return true;
+            }
+            const stringNode = sourceCode.getNodeByRangeIndex(nextToken.range[0]);
+
+            return !astUtils.isTopLevelExpressionStatement(stringNode.parent);
+        }
+
         /**
          * Reports an unnecessary semicolon error.
          * @param {Node|Token} nodeOrToken A node or a token to be reported.
@@ -47,17 +64,18 @@ module.exports = {
             context.report({
                 node: nodeOrToken,
                 messageId: "unexpected",
-                fix(fixer) {
-
-                    /*
-                     * Expand the replacement range to include the surrounding
-                     * tokens to avoid conflicting with semi.
-                     * https://github.com/eslint/eslint/issues/7928
-                     */
-                    return new FixTracker(fixer, context.sourceCode)
-                        .retainSurroundingTokens(nodeOrToken)
-                        .remove(nodeOrToken);
-                }
+                fix: isFixable(nodeOrToken)
+                    ? fixer =>
+
+                        /*
+                         * Expand the replacement range to include the surrounding
+                         * tokens to avoid conflicting with semi.
+                         * https://github.com/eslint/eslint/issues/7928
+                         */
+                        new FixTracker(fixer, context.sourceCode)
+                            .retainSurroundingTokens(nodeOrToken)
+                            .remove(nodeOrToken)
+                    : null
             });
         }
 

package/lib/rules/no-loss-of-precision.js

@@ -83,7 +83,7 @@ module.exports = {
          * @returns {string} the numeric string with a decimal point in the proper place
          */
         function addDecimalPointToNumber(stringNumber) {
-            return `${stringNumber.slice(0, 1)}.${stringNumber.slice(1)}`;
+            return `${stringNumber[0]}.${stringNumber.slice(1)}`;
         }
 
         /**
@@ -92,7 +92,12 @@ module.exports = {
          * @returns {string} the stripped string
          */
         function removeLeadingZeros(numberAsString) {
-            return numberAsString.replace(/^0*/u, "");
+            for (let i = 0; i < numberAsString.length; i++) {
+                if (numberAsString[i] !== "0") {
+                    return numberAsString.slice(i);
+                }
+            }
+            return numberAsString;
         }
 
         /**
@@ -101,7 +106,12 @@ module.exports = {
          * @returns {string} the stripped string
          */
         function removeTrailingZeros(numberAsString) {
-            return numberAsString.replace(/0*$/u, "");
+            for (let i = numberAsString.length - 1; i >= 0; i--) {
+                if (numberAsString[i] !== "0") {
+                    return numberAsString.slice(0, i + 1);
+                }
+            }
+            return numberAsString;
         }
 
         /**
@@ -128,7 +138,7 @@ module.exports = {
             const trimmedFloat = removeLeadingZeros(stringFloat);
 
             if (trimmedFloat.startsWith(".")) {
-                const decimalDigits = trimmedFloat.split(".").pop();
+                const decimalDigits = trimmedFloat.slice(1);
                 const significantDigits = removeLeadingZeros(decimalDigits);
 
                 return {
@@ -144,7 +154,6 @@ module.exports = {
             };
         }
 
-
         /**
          * Converts a base ten number to proper scientific notation
          * @param {string} stringNumber the string representation of the base ten number to be converted
@@ -160,7 +169,6 @@ module.exports = {
                 : normalizedNumber.magnitude;
 
             return `${normalizedCoefficient}e${magnitude}`;
-
         }
 
         /**

package/lib/rules/no-restricted-modules.js

@@ -5,6 +5,12 @@
  */
 "use strict";
 
+//------------------------------------------------------------------------------
+// Requirements
+//------------------------------------------------------------------------------
+
+const astUtils = require("./utils/ast-utils");
+
 //------------------------------------------------------------------------------
 // Rule Definition
 //------------------------------------------------------------------------------
@@ -116,15 +122,6 @@ module.exports = {
             return node && node.type === "Literal" && typeof node.value === "string";
         }
 
-        /**
-         * Function to check if a node is a static string template literal.
-         * @param {ASTNode} node The node to check.
-         * @returns {boolean} If the node is a string template literal.
-         */
-        function isStaticTemplateLiteral(node) {
-            return node && node.type === "TemplateLiteral" && node.expressions.length === 0;
-        }
-
         /**
          * Function to check if a node is a require call.
          * @param {ASTNode} node The node to check.
@@ -144,7 +141,7 @@ module.exports = {
                 return node.value.trim();
             }
 
-            if (isStaticTemplateLiteral(node)) {
+            if (astUtils.isStaticTemplateLiteral(node)) {
                 return node.quasis[0].value.cooked.trim();
             }
 

package/lib/rules/no-unused-labels.js

@@ -5,6 +5,12 @@
 
 "use strict";
 
+//------------------------------------------------------------------------------
+// Requirements
+//------------------------------------------------------------------------------
+
+const astUtils = require("./utils/ast-utils");
+
 //------------------------------------------------------------------------------
 // Rule Definition
 //------------------------------------------------------------------------------
@@ -46,6 +52,45 @@ module.exports = {
             };
         }
 
+        /**
+         * Checks if a `LabeledStatement` node is fixable.
+         * For a node to be fixable, there must be no comments between the label and the body.
+         * Furthermore, is must be possible to remove the label without turning the body statement into a
+         * directive after other fixes are applied.
+         * @param {ASTNode} node The node to evaluate.
+         * @returns {boolean} Whether or not the node is fixable.
+         */
+        function isFixable(node) {
+
+            /*
+             * Only perform a fix if there are no comments between the label and the body. This will be the case
+             * when there is exactly one token/comment (the ":") between the label and the body.
+             */
+            if (sourceCode.getTokenAfter(node.label, { includeComments: true }) !==
+                sourceCode.getTokenBefore(node.body, { includeComments: true })) {
+                return false;
+            }
+
+            // Looking for the node's deepest ancestor which is not a `LabeledStatement`.
+            let ancestor = node.parent;
+
+            while (ancestor.type === "LabeledStatement") {
+                ancestor = ancestor.parent;
+            }
+
+            if (ancestor.type === "Program" ||
+                (ancestor.type === "BlockStatement" && astUtils.isFunction(ancestor.parent))) {
+                const { body } = node;
+
+                if (body.type === "ExpressionStatement" &&
+                    ((body.expression.type === "Literal" && typeof body.expression.value === "string") ||
+                    astUtils.isStaticTemplateLiteral(body.expression))) {
+                    return false; // potential directive
+                }
+            }
+            return true;
+        }
+
         /**
          * Removes the top of the stack.
          * At the same time, this reports the label if it's never used.
@@ -58,19 +103,7 @@ module.exports = {
                     node: node.label,
                     messageId: "unused",
                     data: node.label,
-                    fix(fixer) {
-
-                        /*
-                         * Only perform a fix if there are no comments between the label and the body. This will be the case
-                         * when there is exactly one token/comment (the ":") between the label and the body.
-                         */
-                        if (sourceCode.getTokenAfter(node.label, { includeComments: true }) ===
-                                sourceCode.getTokenBefore(node.body, { includeComments: true })) {
-                            return fixer.removeRange([node.range[0], node.body.range[0]]);
-                        }
-
-                        return null;
-                    }
+                    fix: isFixable(node) ? fixer => fixer.removeRange([node.range[0], node.body.range[0]]) : null
                 });
             }
 

package/lib/rules/no-unused-vars.js

@@ -466,7 +466,8 @@ module.exports = {
                     (
                         parent.type === "AssignmentExpression" &&
                         parent.left === id &&
-                        isUnusedExpression(parent)
+                        isUnusedExpression(parent) &&
+                        !astUtils.isLogicalAssignmentOperator(parent.operator)
                     ) ||
                     (
                         parent.type === "UpdateExpression" &&

package/lib/rules/no-useless-escape.js

@@ -94,6 +94,7 @@ module.exports = {
         messages: {
             unnecessaryEscape: "Unnecessary escape character: \\{{character}}.",
             removeEscape: "Remove the `\\`. This maintains the current functionality.",
+            removeEscapeDoNotKeepSemantics: "Remove the `\\` if it was inserted by mistake.",
             escapeBackslash: "Replace the `\\` with `\\\\` to include the actual backslash character."
         },
 
@@ -125,7 +126,10 @@ module.exports = {
                 data: { character },
                 suggest: [
                     {
-                        messageId: "removeEscape",
+
+                        // Removing unnecessary `\` characters in a directive is not guaranteed to maintain functionality.
+                        messageId: astUtils.isDirective(node.parent)
+                            ? "removeEscapeDoNotKeepSemantics" : "removeEscape",
                         fix(fixer) {
                             return fixer.removeRange(range);
                         }

package/lib/rules/padding-line-between-statements.js

@@ -130,42 +130,6 @@ function isBlockLikeStatement(sourceCode, node) {
     );
 }
 
-/**
- * Check whether the given node is a directive or not.
- * @param {ASTNode} node The node to check.
- * @param {SourceCode} sourceCode The source code object to get tokens.
- * @returns {boolean} `true` if the node is a directive.
- */
-function isDirective(node, sourceCode) {
-    return (
-        astUtils.isTopLevelExpressionStatement(node) &&
-        node.expression.type === "Literal" &&
-        typeof node.expression.value === "string" &&
-        !astUtils.isParenthesised(sourceCode, node.expression)
-    );
-}
-
-/**
- * Check whether the given node is a part of directive prologue or not.
- * @param {ASTNode} node The node to check.
- * @param {SourceCode} sourceCode The source code object to get tokens.
- * @returns {boolean} `true` if the node is a part of directive prologue.
- */
-function isDirectivePrologue(node, sourceCode) {
-    if (isDirective(node, sourceCode)) {
-        for (const sibling of node.parent.body) {
-            if (sibling === node) {
-                break;
-            }
-            if (!isDirective(sibling, sourceCode)) {
-                return false;
-            }
-        }
-        return true;
-    }
-    return false;
-}
-
 /**
  * Gets the actual last token.
  *
@@ -359,12 +323,10 @@ const StatementTypes = {
             CJS_IMPORT.test(sourceCode.getText(node.declarations[0].init))
     },
     directive: {
-        test: isDirectivePrologue
+        test: astUtils.isDirective
     },
     expression: {
-        test: (node, sourceCode) =>
-            node.type === "ExpressionStatement" &&
-            !isDirectivePrologue(node, sourceCode)
+        test: node => node.type === "ExpressionStatement" && !astUtils.isDirective(node)
     },
     iife: {
         test: isIIFEStatement
@@ -375,10 +337,10 @@ const StatementTypes = {
             isBlockLikeStatement(sourceCode, node)
     },
     "multiline-expression": {
-        test: (node, sourceCode) =>
+        test: node =>
             node.loc.start.line !== node.loc.end.line &&
             node.type === "ExpressionStatement" &&
-            !isDirectivePrologue(node, sourceCode)
+            !astUtils.isDirective(node)
     },
 
     "multiline-const": newMultilineKeywordTester("const"),

package/lib/rules/prefer-exponentiation-operator.js

@@ -55,11 +55,12 @@ function doesExponentNeedParens(exponent) {
 function doesExponentiationExpressionNeedParens(node, sourceCode) {
     const parent = node.parent.type === "ChainExpression" ? node.parent.parent : node.parent;
 
+    const parentPrecedence = astUtils.getPrecedence(parent);
     const needsParens = (
         parent.type === "ClassDeclaration" ||
         (
             parent.type.endsWith("Expression") &&
-            astUtils.getPrecedence(parent) >= PRECEDENCE_OF_EXPONENTIATION_EXPR &&
+            (parentPrecedence === -1 || parentPrecedence >= PRECEDENCE_OF_EXPONENTIATION_EXPR) &&
             !(parent.type === "BinaryExpression" && parent.operator === "**" && parent.right === node) &&
             !((parent.type === "CallExpression" || parent.type === "NewExpression") && parent.arguments.includes(node)) &&
             !(parent.type === "MemberExpression" && parent.computed && parent.property === node) &&

package/lib/rules/prefer-regex-literals.js

@@ -37,15 +37,6 @@ function isRegexLiteral(node) {
     return node.type === "Literal" && Object.prototype.hasOwnProperty.call(node, "regex");
 }
 
-/**
- * Determines whether the given node is a template literal without expressions.
- * @param {ASTNode} node Node to check.
- * @returns {boolean} True if the node is a template literal without expressions.
- */
-function isStaticTemplateLiteral(node) {
-    return node.type === "TemplateLiteral" && node.expressions.length === 0;
-}
-
 const validPrecedingTokens = new Set([
     "(",
     ";",
@@ -178,7 +169,7 @@ module.exports = {
             return node.type === "TaggedTemplateExpression" &&
                 astUtils.isSpecificMemberAccess(node.tag, "String", "raw") &&
                 isGlobalReference(astUtils.skipChainExpression(node.tag).object) &&
-                isStaticTemplateLiteral(node.quasi);
+                astUtils.isStaticTemplateLiteral(node.quasi);
         }
 
         /**
@@ -191,7 +182,7 @@ module.exports = {
                 return node.value;
             }
 
-            if (isStaticTemplateLiteral(node)) {
+            if (astUtils.isStaticTemplateLiteral(node)) {
                 return node.quasis[0].value.cooked;
             }
 
@@ -209,7 +200,7 @@ module.exports = {
          */
         function isStaticString(node) {
             return isStringLiteral(node) ||
-                isStaticTemplateLiteral(node) ||
+                astUtils.isStaticTemplateLiteral(node) ||
                 isStringRawTaggedStaticTemplateLiteral(node);
         }