eslint-plugin-unicorn
Version:
More than 300 powerful ESLint rules
138 lines (117 loc) • 4.09 kB
JavaScript
import {getStaticValue} from '@eslint-community/eslint-utils';
import {
checkVueTemplate,
isMethodNamed,
getTokenStore,
} from './utils/index.js';
import simpleArraySearchRule from './shared/simple-array-search-rule.js';
import {isLiteral, isNegativeOne} from './ast/index.js';
const MESSAGE_ID = 'prefer-includes';
const messages = {
[MESSAGE_ID]: 'Use `.includes()`, rather than `.{{method}}()`, when checking for existence.',
};
// Ignore `{_,lodash,underscore}.{indexOf,lastIndexOf}`
const ignoredVariables = new Set(['_', 'lodash', 'underscore']);
const isIgnoredTarget = node => node.type === 'Identifier' && ignoredVariables.has(node.name);
const isLiteralZero = node => isLiteral(node, 0);
// `NaN`, `Number.NaN`, `0 / 0`, but not a binding that happens to be named `NaN`
// Same check as in `shared/simple-array-search-rule.js`
const isNaNValue = (node, context) => Number.isNaN(getStaticValue(node, context.sourceCode.getScope(node))?.value);
const isNegativeResult = node => ['===', '==', '<', '<='].includes(node.operator);
const getProblem = (context, node, target, argumentsNodes) => {
const {sourceCode} = context;
const tokenStore = getTokenStore(context, target);
const memberExpressionNode = target.parent;
const dotToken = tokenStore.getTokenBefore(memberExpressionNode.property);
const targetSource = sourceCode.getText().slice(
sourceCode.getRange(memberExpressionNode)[0],
sourceCode.getRange(dotToken)[0],
);
// Strip default `fromIndex`
if (isLiteralZero(argumentsNodes[1])) {
argumentsNodes = argumentsNodes.slice(0, 1);
}
const argumentsSource = argumentsNodes.map(argument => sourceCode.getText(argument));
const replacement = `${isNegativeResult(node) ? '!' : ''}${targetSource}.includes(${argumentsSource.join(', ')})`;
return {
node: memberExpressionNode.property,
messageId: MESSAGE_ID,
data: {
method: node.left.callee.property.name,
},
// The whole comparison is replaced, a comment in it would be dropped
fix: sourceCode.getCommentsInside(node).length > 0
? undefined
: fixer => fixer.replaceText(node, replacement),
};
};
const includesOverSomeRule = simpleArraySearchRule({
method: 'some',
replacement: 'includes',
checkBooleanPredicate: true,
});
/**
@param {import('eslint').Rule.RuleContext} context
*/
const create = context => {
includesOverSomeRule.listen(context);
context.on('BinaryExpression', node => {
const {left, right, operator} = node;
if (!isMethodNamed(left, 'indexOf') && !isMethodNamed(left, 'lastIndexOf')) {
return;
}
const target = left.callee.object;
if (isIgnoredTarget(target)) {
return;
}
const {arguments: argumentsNodes} = left;
// Ignore something.indexOf(foo, 0, another)
if (argumentsNodes.length > 2) {
return;
}
// `indexOf()` compares with `===` and never finds `NaN`, while `.includes()` uses SameValueZero
if (argumentsNodes.length > 0 && isNaNValue(argumentsNodes[0], context)) {
return;
}
// `lastIndexOf(value, fromIndex)` searches backward from `fromIndex`, while `.includes(value, fromIndex)`
// searches forward, so they're only equivalent when no `fromIndex` is passed.
if (isMethodNamed(left, 'lastIndexOf') && argumentsNodes.length > 1) {
return;
}
if (
// `indexOf()` only returns `-1` or a non-negative index, so `<= -1` is `=== -1` too
(['!==', '!=', '>', '===', '==', '<='].includes(operator) && isNegativeOne(right))
|| (['>=', '<'].includes(operator) && isLiteralZero(right))
) {
return getProblem(
context,
node,
target,
argumentsNodes,
);
}
});
};
/**
@type {import('eslint').Rule.RuleModule}
*/
const config = {
create: checkVueTemplate(create),
meta: {
type: 'suggestion',
docs: {
description: 'Prefer `.includes()` over `.indexOf()`, `.lastIndexOf()`, and `Array#some()` when checking for existence or non-existence.',
recommended: 'unopinionated',
},
fixable: 'code',
hasSuggestions: true,
messages: {
...messages,
...includesOverSomeRule.messages,
},
languages: [
'js/js',
],
},
};
export default config;