2 * @fileoverview Rule to flag unnecessary double negation in Boolean contexts
3 * @author Brandon Mills
8 //------------------------------------------------------------------------------
10 //------------------------------------------------------------------------------
12 const astUtils
= require("./utils/ast-utils");
13 const eslintUtils
= require("eslint-utils");
15 const precedence
= astUtils
.getPrecedence
;
17 //------------------------------------------------------------------------------
19 //------------------------------------------------------------------------------
26 description
: "disallow unnecessary boolean casts",
27 category
: "Possible Errors",
29 url
: "https://eslint.org/docs/rules/no-extra-boolean-cast"
35 enforceForLogicalOperands
: {
40 additionalProperties
: false
45 unexpectedCall
: "Redundant Boolean call.",
46 unexpectedNegation
: "Redundant double negation."
51 const sourceCode
= context
.getSourceCode();
53 // Node types which have a test which will coerce values to booleans.
54 const BOOLEAN_NODE_TYPES
= [
58 "ConditionalExpression",
63 * Check if a node is a Boolean function or constructor.
64 * @param {ASTNode} node the node
65 * @returns {boolean} If the node is Boolean function or constructor
67 function isBooleanFunctionOrConstructorCall(node
) {
69 // Boolean(<bool>) and new Boolean(<bool>)
70 return (node
.type
=== "CallExpression" || node
.type
=== "NewExpression") &&
71 node
.callee
.type
=== "Identifier" &&
72 node
.callee
.name
=== "Boolean";
76 * Checks whether the node is a logical expression and that the option is enabled
77 * @param {ASTNode} node the node
78 * @returns {boolean} if the node is a logical expression and option is enabled
80 function isLogicalContext(node
) {
81 return node
.type
=== "LogicalExpression" &&
82 (node
.operator
=== "||" || node
.operator
=== "&&") &&
83 (context
.options
.length
&& context
.options
[0].enforceForLogicalOperands
=== true);
89 * Check if a node is in a context where its value would be coerced to a boolean at runtime.
90 * @param {ASTNode} node The node
91 * @returns {boolean} If it is in a boolean context
93 function isInBooleanContext(node
) {
95 (isBooleanFunctionOrConstructorCall(node
.parent
) &&
96 node
=== node
.parent
.arguments
[0]) ||
98 (BOOLEAN_NODE_TYPES
.indexOf(node
.parent
.type
) !== -1 &&
99 node
=== node
.parent
.test
) ||
102 (node
.parent
.type
=== "UnaryExpression" &&
103 node
.parent
.operator
=== "!")
108 * Checks whether the node is a context that should report an error
109 * Acts recursively if it is in a logical context
110 * @param {ASTNode} node the node
111 * @returns {boolean} If the node is in one of the flagged contexts
113 function isInFlaggedContext(node
) {
114 return isInBooleanContext(node
) ||
115 (isLogicalContext(node
.parent
) &&
117 // For nested logical statements
118 isInFlaggedContext(node
.parent
)
124 * Check if a node has comments inside.
125 * @param {ASTNode} node The node to check.
126 * @returns {boolean} `true` if it has comments inside.
128 function hasCommentsInside(node
) {
129 return Boolean(sourceCode
.getCommentsInside(node
).length
);
133 * Checks if the given node is wrapped in grouping parentheses. Parentheses for constructs such as if() don't count.
134 * @param {ASTNode} node The node to check.
135 * @returns {boolean} `true` if the node is parenthesized.
138 function isParenthesized(node
) {
139 return eslintUtils
.isParenthesized(1, node
, sourceCode
);
143 * Determines whether the given node needs to be parenthesized when replacing the previous node.
144 * It assumes that `previousNode` is the node to be reported by this rule, so it has a limited list
145 * of possible parent node types. By the same assumption, the node's role in a particular parent is already known.
146 * For example, if the parent is `ConditionalExpression`, `previousNode` must be its `test` child.
147 * @param {ASTNode} previousNode Previous node.
148 * @param {ASTNode} node The node to check.
149 * @returns {boolean} `true` if the node needs to be parenthesized.
151 function needsParens(previousNode
, node
) {
152 if (isParenthesized(previousNode
)) {
154 // parentheses around the previous node will stay, so there is no need for an additional pair
158 // parent of the previous node will become parent of the replacement node
159 const parent
= previousNode
.parent
;
161 switch (parent
.type
) {
162 case "CallExpression":
163 case "NewExpression":
164 return node
.type
=== "SequenceExpression";
166 case "DoWhileStatement":
167 case "WhileStatement":
170 case "ConditionalExpression":
171 return precedence(node
) <= precedence(parent
);
172 case "UnaryExpression":
173 return precedence(node
) < precedence(parent
);
174 case "LogicalExpression":
175 if (astUtils
.isMixedLogicalAndCoalesceExpressions(node
, parent
)) {
178 if (previousNode
=== parent
.left
) {
179 return precedence(node
) < precedence(parent
);
181 return precedence(node
) <= precedence(parent
);
183 /* istanbul ignore next */
185 throw new Error(`Unexpected parent type: ${parent.type}`);
190 UnaryExpression(node
) {
191 const parent
= node
.parent
;
194 // Exit early if it's guaranteed not to match
195 if (node
.operator
!== "!" ||
196 parent
.type
!== "UnaryExpression" ||
197 parent
.operator
!== "!") {
202 if (isInFlaggedContext(parent
)) {
205 messageId
: "unexpectedNegation",
207 if (hasCommentsInside(parent
)) {
211 if (needsParens(parent
, node
.argument
)) {
212 return fixer
.replaceText(parent
, `(${sourceCode.getText(node.argument)})`);
216 const tokenBefore
= sourceCode
.getTokenBefore(parent
);
217 const firstReplacementToken
= sourceCode
.getFirstToken(node
.argument
);
221 tokenBefore
.range
[1] === parent
.range
[0] &&
222 !astUtils
.canTokensBeAdjacent(tokenBefore
, firstReplacementToken
)
227 return fixer
.replaceText(parent
, prefix
+ sourceCode
.getText(node
.argument
));
233 CallExpression(node
) {
234 if (node
.callee
.type
!== "Identifier" || node
.callee
.name
!== "Boolean") {
238 if (isInFlaggedContext(node
)) {
241 messageId
: "unexpectedCall",
243 const parent
= node
.parent
;
245 if (node
.arguments
.length
=== 0) {
246 if (parent
.type
=== "UnaryExpression" && parent
.operator
=== "!") {
252 if (hasCommentsInside(parent
)) {
256 const replacement
= "true";
258 const tokenBefore
= sourceCode
.getTokenBefore(parent
);
262 tokenBefore
.range
[1] === parent
.range
[0] &&
263 !astUtils
.canTokensBeAdjacent(tokenBefore
, replacement
)
268 return fixer
.replaceText(parent
, prefix
+ replacement
);
275 if (hasCommentsInside(node
)) {
279 return fixer
.replaceText(node
, "false");
282 if (node
.arguments
.length
=== 1) {
283 const argument
= node
.arguments
[0];
285 if (argument
.type
=== "SpreadElement" || hasCommentsInside(node
)) {
290 * Boolean(expression) -> expression
293 if (needsParens(node
, argument
)) {
294 return fixer
.replaceText(node
, `(${sourceCode.getText(argument)})`);
297 return fixer
.replaceText(node
, sourceCode
.getText(argument
));
300 // two or more arguments