eslint-plugin-sonarjs 4.0.2 → 4.1.0

package/cjs/S5868/rule.js

@@ -1,11 +1,11 @@
 "use strict";
 /*
  * SonarQube JavaScript Plugin
- * Copyright (C) 2011-2025 SonarSource Sàrl
+ * Copyright (C) SonarSource Sàrl
  * mailto:info AT sonarsource DOT com
  *
- * This program is free software; you can redistribute it and/or
- * modify it under the terms of the Sonar Source-Available License Version 1, as published by SonarSource SA.
+ * You can redistribute and/or modify this program under the terms of
+ * the Sonar Source-Available License Version 1, as published by SonarSource Sàrl.
  *
  * This program is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
@@ -51,7 +51,6 @@ var __importStar = (this && this.__importStar) || (function () {
 })();
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.rule = void 0;
-const ancestor_js_1 = require("../helpers/ancestor.js");
 const generate_meta_js_1 = require("../helpers/generate-meta.js");
 const ast_js_1 = require("../helpers/ast.js");
 const regexpp_1 = require("@eslint-community/regexpp");
@@ -65,7 +64,21 @@ const MODIFIABLE_REGEXP_FLAGS_TYPES = new Set([
     'TemplateLiteral',
     'TaggedTemplateExpression',
 ]);
+const MIN_HIGH_SURROGATE = 0xd800;
+const MIN_LOW_SURROGATE = 0xdc00;
+const MAX_LOW_SURROGATE_EXCLUSIVE = 0xe000;
+const MIN_EMOJI_MODIFIER = 0x1f3fb;
+const MAX_EMOJI_MODIFIER = 0x1f3ff;
+const MIN_REGIONAL_INDICATOR = 0x1f1e6;
+const MAX_REGIONAL_INDICATOR = 0x1f1ff;
+const ZERO_WIDTH_JOINER = 0x200d;
 exports.rule = (0, rule_template_js_1.createRegExpRule)(context => {
+    let currentSeams = [];
+    // Seam positions are in pattern space, while regexpp positions include the opening slash.
+    // A pair straddles a seam only when the seam is exactly before charB.
+    function spansSeam(charA, charB) {
+        return charA.end === charB.start && currentSeams.some(seam => seam + 1 === charB.start);
+    }
     function checkSequence(sequence) {
         // Stop on the first illegal character in the sequence
         for (let index = 0; index < sequence.length; index++) {
@@ -75,20 +88,16 @@ exports.rule = (0, rule_template_js_1.createRegExpRule)(context => {
         }
     }
     function checkCharacter(character, index, characters) {
-        // Stop on the first failed check as there may be overlaps between checks
-        // for instance a zero-width-sequence containing a modified emoji.
-        for (const check of characterChecks) {
-            if (check(character, index, characters)) {
-                return true;
-            }
-        }
-        return false;
+        // Stop on the first check that fires as checks may overlap,
+        // for instance a zero-width sequence containing a modified emoji.
+        return characterChecks.some(check => check(character, index, characters));
     }
     function checkCombinedCharacter(character, index, characters) {
         let reported = false;
         if (index !== 0 &&
             isCombiningCharacter(character.value) &&
-            !isCombiningCharacter(characters[index - 1].value)) {
+            !isCombiningCharacter(characters[index - 1].value) &&
+            !spansSeam(characters[index - 1], character)) {
             const combinedChar = characters[index - 1].raw + characters[index].raw;
             const message = `Move this Unicode combined character '${combinedChar}' outside of the character class`;
             context.reportRegExpNode({ regexpNode: characters[index], node: context.node, message });
@@ -98,7 +107,9 @@ exports.rule = (0, rule_template_js_1.createRegExpRule)(context => {
     }
     function checkSurrogatePairTailCharacter(character, index, characters) {
         let reported = false;
-        if (index !== 0 && isSurrogatePair(characters[index - 1].value, character.value)) {
+        if (index !== 0 &&
+            isSurrogatePair(characters[index - 1].value, character.value) &&
+            !spansSeam(characters[index - 1], character)) {
             const surrogatePair = characters[index - 1].raw + characters[index].raw;
             const message = `Move this Unicode surrogate pair '${surrogatePair}' outside of the character class or use 'u' flag`;
             const pattern = (0, extract_js_1.getPatternFromNode)(context.node, context)?.pattern;
@@ -125,7 +136,7 @@ exports.rule = (0, rule_template_js_1.createRegExpRule)(context => {
         if ((0, ast_js_1.isRegexLiteral)(node)) {
             return insertTextAfter(fixer, node, 'u');
         }
-        const regExpConstructor = getRegExpConstructor(node);
+        const regExpConstructor = getRegExpConstructor(node, sourceCode);
         if (!regExpConstructor) {
             return null;
         }
@@ -144,7 +155,8 @@ exports.rule = (0, rule_template_js_1.createRegExpRule)(context => {
         let reported = false;
         if (index !== 0 &&
             isEmojiModifier(character.value) &&
-            !isEmojiModifier(characters[index - 1].value)) {
+            !isEmojiModifier(characters[index - 1].value) &&
+            !spansSeam(characters[index - 1], character)) {
             const modifiedEmoji = characters[index - 1].raw + characters[index].raw;
             const message = `Move this Unicode modified Emoji '${modifiedEmoji}' outside of the character class`;
             context.reportRegExpNode({ regexpNode: characters[index], node: context.node, message });
@@ -156,7 +168,8 @@ exports.rule = (0, rule_template_js_1.createRegExpRule)(context => {
         let reported = false;
         if (index !== 0 &&
             isRegionalIndicator(character.value) &&
-            isRegionalIndicator(characters[index - 1].value)) {
+            isRegionalIndicator(characters[index - 1].value) &&
+            !spansSeam(characters[index - 1], character)) {
             const regionalIndicator = characters[index - 1].raw + characters[index].raw;
             const message = `Move this Unicode regional indicator '${regionalIndicator}' outside of the character class`;
             context.reportRegExpNode({ regexpNode: characters[index], node: context.node, message });
@@ -170,7 +183,9 @@ exports.rule = (0, rule_template_js_1.createRegExpRule)(context => {
             index !== characters.length - 1 &&
             isZeroWidthJoiner(character.value) &&
             !isZeroWidthJoiner(characters[index - 1].value) &&
-            !isZeroWidthJoiner(characters[index + 1].value)) {
+            !isZeroWidthJoiner(characters[index + 1].value) &&
+            !spansSeam(characters[index - 1], character) &&
+            !spansSeam(character, characters[index + 1])) {
             // It's practically difficult to determine the full joined character sequence
             // as it may join more than 2 elements that consist of characters or modified Emojis
             // see: https://unicode.org/emoji/charts/emoji-zwj-sequences.html
@@ -186,7 +201,7 @@ exports.rule = (0, rule_template_js_1.createRegExpRule)(context => {
     }
     function isValidWithUnicodeFlag(pattern) {
         try {
-            validator.validatePattern(pattern, undefined, undefined, true);
+            validator.validatePattern(pattern, undefined, undefined, { unicode: true });
             return true;
         }
         catch {
@@ -205,6 +220,7 @@ exports.rule = (0, rule_template_js_1.createRegExpRule)(context => {
     ];
     return {
         onCharacterClassEnter(ccNode) {
+            currentSeams = (0, extract_js_1.getPatternFromNode)(context.node, context)?.seams ?? [];
             for (const chars of characters(ccNode.elements)) {
                 checkSequence(chars);
             }
@@ -219,10 +235,10 @@ function characters(nodes) {
             current.push(node);
         }
         else if (node.type === 'CharacterClassRange') {
-            // for following regexp [xa-z] we produce [[xa],[z]]
-            // we would report for example if instead of 'xa' there would be unicode combined class
+            // For [xa-z], check [xa] but do not pair z with the next range or character.
+            // Report if the sequence ending at the range minimum is a grapheme cluster.
             current.push(node.min);
-            current = [node.max];
+            current = [];
             sequences.push(current);
         }
         else if (node.type === 'CharacterSet' && current.length > 0) {
@@ -238,19 +254,32 @@ function isCombiningCharacter(codePoint) {
     return /^[\p{Mc}\p{Me}\p{Mn}]$/u.test(String.fromCodePoint(codePoint));
 }
 function isSurrogatePair(lead, tail) {
-    return lead >= 0xd800 && lead < 0xdc00 && tail >= 0xdc00 && tail < 0xe000;
+    return (lead >= MIN_HIGH_SURROGATE &&
+        lead < MIN_LOW_SURROGATE &&
+        tail >= MIN_LOW_SURROGATE &&
+        tail < MAX_LOW_SURROGATE_EXCLUSIVE);
 }
 function isEmojiModifier(code) {
-    return code >= 0x1f3fb && code <= 0x1f3ff;
+    return code >= MIN_EMOJI_MODIFIER && code <= MAX_EMOJI_MODIFIER;
 }
 function isRegionalIndicator(code) {
-    return code >= 0x1f1e6 && code <= 0x1f1ff;
+    return code >= MIN_REGIONAL_INDICATOR && code <= MAX_REGIONAL_INDICATOR;
 }
 function isZeroWidthJoiner(code) {
-    return code === 0x200d;
+    return code === ZERO_WIDTH_JOINER;
+}
+function getRegExpConstructor(node, sourceCode) {
+    const ancestors = sourceCode.getAncestors(node);
+    for (let i = ancestors.length - 1; i >= 0; i--) {
+        const ancestor = ancestors[i];
+        if (ancestor && isRegExpConstructorCallOrNew(ancestor)) {
+            return ancestor;
+        }
+    }
+    return undefined;
 }
-function getRegExpConstructor(node) {
-    return (0, ancestor_js_1.ancestorsChain)(node, new Set(['CallExpression', 'NewExpression'])).find(n => (0, ast_js_2.isRegExpConstructor)(n));
+function isRegExpConstructorCallOrNew(node) {
+    return (0, ast_js_2.isRegExpConstructor)(node);
 }
 function hasModifiableFlags(regExpConstructor) {
     const args = regExpConstructor.arguments;

package/cjs/S5869/generated-meta.js

@@ -1,11 +1,11 @@
 "use strict";
 /*
  * SonarQube JavaScript Plugin
- * Copyright (C) 2011-2025 SonarSource Sàrl
+ * Copyright (C) SonarSource Sàrl
  * mailto:info AT sonarsource DOT com
  *
- * This program is free software; you can redistribute it and/or
- * modify it under the terms of the Sonar Source-Available License Version 1, as published by SonarSource SA.
+ * You can redistribute and/or modify this program under the terms of
+ * the Sonar Source-Available License Version 1, as published by SonarSource Sàrl.
  *
  * This program is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
@@ -31,7 +31,7 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
     for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.requiredDependency = exports.languages = exports.scope = exports.sonarKey = exports.meta = void 0;
+exports.skipOnGeneratedSource = exports.requiredDependency = exports.languages = exports.scope = exports.sonarKey = exports.meta = void 0;
 __exportStar(require("./meta.js"), exports);
 exports.meta = {
     type: 'suggestion',
@@ -49,3 +49,4 @@ exports.sonarKey = 'S5869';
 exports.scope = 'Main';
 exports.languages = ['js', 'ts'];
 exports.requiredDependency = [];
+exports.skipOnGeneratedSource = false;

package/cjs/S5869/index.js

@@ -3,11 +3,11 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.rule = void 0;
 /*
  * SonarQube JavaScript Plugin
- * Copyright (C) 2011-2025 SonarSource Sàrl
+ * Copyright (C) SonarSource Sàrl
  * mailto:info AT sonarsource DOT com
  *
- * This program is free software; you can redistribute it and/or
- * modify it under the terms of the Sonar Source-Available License Version 1, as published by SonarSource SA.
+ * You can redistribute and/or modify this program under the terms of
+ * the Sonar Source-Available License Version 1, as published by SonarSource Sàrl.
  *
  * This program is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of

package/cjs/S5869/meta.js

@@ -3,11 +3,11 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.hasSecondaries = exports.eslintId = exports.implementation = void 0;
 /*
  * SonarQube JavaScript Plugin
- * Copyright (C) 2011-2025 SonarSource Sàrl
+ * Copyright (C) SonarSource Sàrl
  * mailto:info AT sonarsource DOT com
  *
- * This program is free software; you can redistribute it and/or
- * modify it under the terms of the Sonar Source-Available License Version 1, as published by SonarSource SA.
+ * You can redistribute and/or modify this program under the terms of
+ * the Sonar Source-Available License Version 1, as published by SonarSource Sàrl.
  *
  * This program is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of

package/cjs/S5869/rule.js

@@ -1,11 +1,11 @@
 "use strict";
 /*
  * SonarQube JavaScript Plugin
- * Copyright (C) 2011-2025 SonarSource Sàrl
+ * Copyright (C) SonarSource Sàrl
  * mailto:info AT sonarsource DOT com
  *
- * This program is free software; you can redistribute it and/or
- * modify it under the terms of the Sonar Source-Available License Version 1, as published by SonarSource SA.
+ * You can redistribute and/or modify this program under the terms of
+ * the Sonar Source-Available License Version 1, as published by SonarSource Sàrl.
  *
  * This program is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of

package/cjs/S5876/generated-meta.js

@@ -1,11 +1,11 @@
 "use strict";
 /*
  * SonarQube JavaScript Plugin
- * Copyright (C) 2011-2025 SonarSource Sàrl
+ * Copyright (C) SonarSource Sàrl
  * mailto:info AT sonarsource DOT com
  *
- * This program is free software; you can redistribute it and/or
- * modify it under the terms of the Sonar Source-Available License Version 1, as published by SonarSource SA.
+ * You can redistribute and/or modify this program under the terms of
+ * the Sonar Source-Available License Version 1, as published by SonarSource Sàrl.
  *
  * This program is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of
@@ -31,7 +31,7 @@ var __exportStar = (this && this.__exportStar) || function(m, exports) {
     for (var p in m) if (p !== "default" && !Object.prototype.hasOwnProperty.call(exports, p)) __createBinding(exports, m, p);
 };
 Object.defineProperty(exports, "__esModule", { value: true });
-exports.requiredDependency = exports.languages = exports.scope = exports.sonarKey = exports.meta = void 0;
+exports.skipOnGeneratedSource = exports.requiredDependency = exports.languages = exports.scope = exports.sonarKey = exports.meta = void 0;
 __exportStar(require("./meta.js"), exports);
 exports.meta = {
     type: 'problem',
@@ -49,3 +49,4 @@ exports.sonarKey = 'S5876';
 exports.scope = 'Main';
 exports.languages = ['js', 'ts'];
 exports.requiredDependency = [];
+exports.skipOnGeneratedSource = false;

package/cjs/S5876/index.js

@@ -3,11 +3,11 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.rule = void 0;
 /*
  * SonarQube JavaScript Plugin
- * Copyright (C) 2011-2025 SonarSource Sàrl
+ * Copyright (C) SonarSource Sàrl
  * mailto:info AT sonarsource DOT com
  *
- * This program is free software; you can redistribute it and/or
- * modify it under the terms of the Sonar Source-Available License Version 1, as published by SonarSource SA.
+ * You can redistribute and/or modify this program under the terms of
+ * the Sonar Source-Available License Version 1, as published by SonarSource Sàrl.
  *
  * This program is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of

package/cjs/S5876/meta.js

@@ -3,11 +3,11 @@ Object.defineProperty(exports, "__esModule", { value: true });
 exports.eslintId = exports.implementation = void 0;
 /*
  * SonarQube JavaScript Plugin
- * Copyright (C) 2011-2025 SonarSource Sàrl
+ * Copyright (C) SonarSource Sàrl
  * mailto:info AT sonarsource DOT com
  *
- * This program is free software; you can redistribute it and/or
- * modify it under the terms of the Sonar Source-Available License Version 1, as published by SonarSource SA.
+ * You can redistribute and/or modify this program under the terms of
+ * the Sonar Source-Available License Version 1, as published by SonarSource Sàrl.
  *
  * This program is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of

package/cjs/S5876/rule.js

@@ -1,11 +1,11 @@
 "use strict";
 /*
  * SonarQube JavaScript Plugin
- * Copyright (C) 2011-2025 SonarSource Sàrl
+ * Copyright (C) SonarSource Sàrl
  * mailto:info AT sonarsource DOT com
  *
- * This program is free software; you can redistribute it and/or
- * modify it under the terms of the Sonar Source-Available License Version 1, as published by SonarSource SA.
+ * You can redistribute and/or modify this program under the terms of
+ * the Sonar Source-Available License Version 1, as published by SonarSource Sàrl.
  *
  * This program is distributed in the hope that it will be useful,
  * but WITHOUT ANY WARRANTY; without even the implied warranty of

package/cjs/S5906/assertion-suggestions.js

@@ -0,0 +1,279 @@
+"use strict";
+/*
+ * SonarQube JavaScript Plugin
+ * Copyright (C) SonarSource Sàrl
+ * mailto:info AT sonarsource DOT com
+ *
+ * You can redistribute and/or modify this program under the terms of
+ * the Sonar Source-Available License Version 1, as published by SonarSource Sàrl.
+ *
+ * This program is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
+ * See the Sonar Source-Available License for more details.
+ *
+ * You should have received a copy of the Sonar Source-Available License
+ * along with this program; if not, see https://sonarsource.com/license/ssal/
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getBooleanExpressionSuggestion = getBooleanExpressionSuggestion;
+exports.chaiShouldReceiver = chaiShouldReceiver;
+const ast_js_1 = require("../helpers/ast.js");
+const assertion_utils_js_1 = require("./assertion-utils.js");
+const STRICT_EQUALITY_OPERATORS = new Set(['===', '!==']);
+const STRING_LIKE_IDENTIFIER = /(?:text|string|message|content|html)$/i;
+const NUMERIC_IDENTIFIER = /(?:amount|count|delta|depth|diff|duration|elapsed|height|index|length|level|limit|number|price|score|size|total|width)$/i;
+const DATE_LIKE_IDENTIFIER = /(?:date|time|timestamp)$/i;
+function getBooleanExpressionSuggestion(actual, positive, family, sourceCode, node, assertObject = 'assert', extraArguments = '') {
+    if (actual.type === 'BinaryExpression') {
+        return getBinaryExpressionSuggestion(actual, positive, family, sourceCode, node, assertObject, extraArguments);
+    }
+    return getIncludesSuggestion(actual, positive, family, sourceCode, node, assertObject, extraArguments);
+}
+function chaiShouldReceiver(source, node) {
+    return isSafeChaiShouldReceiver(node) ? source : `(${source})`;
+}
+const SAFE_CHAI_SHOULD_RECEIVER_TYPES = new Set([
+    'Identifier',
+    'MemberExpression',
+    'CallExpression',
+    'ThisExpression',
+]);
+function isSafeChaiShouldReceiver(node) {
+    return SAFE_CHAI_SHOULD_RECEIVER_TYPES.has(node.type);
+}
+function getBinaryExpressionSuggestion(actual, positive, family, sourceCode, node, assertObject, extraArguments) {
+    const left = sourceCode.getText(actual.left);
+    const right = sourceCode.getText(actual.right);
+    const suggestionContext = { family, sourceCode, node, assertObject, extraArguments };
+    if (STRICT_EQUALITY_OPERATORS.has(actual.operator)) {
+        const same = actual.operator === '===' ? positive : !positive;
+        const specificSuggestion = buildSpecificEqualitySuggestion(actual, same, suggestionContext);
+        if (specificSuggestion !== undefined) {
+            return specificSuggestion;
+        }
+        return buildEqualitySuggestion(actual.left, right, same, suggestionContext);
+    }
+    if (actual.operator === 'instanceof') {
+        return buildInstanceofSuggestion(left, actual.left, right, positive, suggestionContext);
+    }
+    const comparison = isNumericComparison(actual)
+        ? getNumericComparison(actual.operator, positive)
+        : null;
+    if (comparison) {
+        return buildNumericComparisonSuggestion(left, actual.left, right, comparison, suggestionContext);
+    }
+    return null;
+}
+function buildSpecificEqualitySuggestion(actual, same, context) {
+    const leftNullish = getNullishKind(actual.left);
+    if (leftNullish) {
+        return buildNullishEqualitySuggestion(actual.right, leftNullish, same, context);
+    }
+    const rightNullish = getNullishKind(actual.right);
+    if (rightNullish) {
+        return buildNullishEqualitySuggestion(actual.left, rightNullish, same, context);
+    }
+    if ((0, assertion_utils_js_1.isLengthAccess)(actual.left)) {
+        return buildLengthEqualitySuggestion(actual.left.object, context.sourceCode.getText(actual.right), same, context);
+    }
+    if ((0, assertion_utils_js_1.isLengthAccess)(actual.right)) {
+        return buildLengthEqualitySuggestion(actual.right.object, context.sourceCode.getText(actual.left), same, context);
+    }
+    return undefined;
+}
+function getNullishKind(node) {
+    if ((0, assertion_utils_js_1.isNullLiteral)(node)) {
+        return 'null';
+    }
+    if ((0, assertion_utils_js_1.isUndefinedExpression)(node)) {
+        return 'undefined';
+    }
+    return null;
+}
+function buildNullishEqualitySuggestion(actualNode, nullish, same, context) {
+    const { family, sourceCode, node, assertObject, extraArguments } = context;
+    const actual = sourceCode.getText(actualNode);
+    if (family === 'jest' || family === 'jasmine') {
+        if (nullish === 'null') {
+            return (0, assertion_utils_js_1.replacement)(`expect(${actual})${negation(same)}.toBeNull()`, node);
+        }
+        return (0, assertion_utils_js_1.replacement)(same ? `expect(${actual}).toBeUndefined()` : `expect(${actual}).toBeDefined()`, node);
+    }
+    if (family === 'assert') {
+        const method = getAssertNullishMethod(nullish, same);
+        return (0, assertion_utils_js_1.replacement)(`${assertObject}.${method}(${actual}${extraArguments})`, node);
+    }
+    if (family === 'chai-should') {
+        return (0, assertion_utils_js_1.replacement)(`${chaiShouldReceiver(actual, actualNode)}.should${negation(same)}.be.${nullish}`, node);
+    }
+    return (0, assertion_utils_js_1.replacement)(`expect(${actual}${extraArguments}).to${negation(same)}.be.${nullish}`, node);
+}
+function getAssertNullishMethod(nullish, same) {
+    if (nullish === 'null') {
+        return same ? 'isNull' : 'isNotNull';
+    }
+    return same ? 'isUndefined' : 'isDefined';
+}
+function buildLengthEqualitySuggestion(actualNode, expected, same, context) {
+    const { family, sourceCode, node, assertObject, extraArguments } = context;
+    const actual = sourceCode.getText(actualNode);
+    if (family === 'jest' || family === 'jasmine') {
+        const matcher = family === 'jasmine' ? 'toHaveSize' : 'toHaveLength';
+        return (0, assertion_utils_js_1.replacement)(`expect(${actual})${negation(same)}.${matcher}(${expected})`, node);
+    }
+    if (family === 'assert') {
+        return same
+            ? (0, assertion_utils_js_1.replacement)(`${assertObject}.lengthOf(${actual}, ${expected}${extraArguments})`, node)
+            : null;
+    }
+    if (family === 'chai-should') {
+        return (0, assertion_utils_js_1.replacement)(`${chaiShouldReceiver(actual, actualNode)}.should${negation(same)}.have.lengthOf(${expected})`, node);
+    }
+    return (0, assertion_utils_js_1.replacement)(`expect(${actual}${extraArguments}).to${negation(same)}.have.lengthOf(${expected})`, node);
+}
+function buildEqualitySuggestion(leftNode, right, same, context) {
+    const { family, sourceCode, node, assertObject, extraArguments } = context;
+    const left = sourceCode.getText(leftNode);
+    if (family === 'jest' || family === 'jasmine') {
+        return (0, assertion_utils_js_1.replacement)(`expect(${left})${negation(same)}.toBe(${right})`, node);
+    }
+    if (family === 'assert') {
+        return (0, assertion_utils_js_1.replacement)(`${assertObject}.${same ? 'strictEqual' : 'notStrictEqual'}(${left}, ${right}${extraArguments})`, node);
+    }
+    if (family === 'chai-should') {
+        return (0, assertion_utils_js_1.replacement)(`${chaiShouldReceiver(left, leftNode)}.should${negation(same)}.equal(${right})`, node);
+    }
+    return (0, assertion_utils_js_1.replacement)(`expect(${left}${extraArguments}).to${negation(same)}.equal(${right})`, node);
+}
+function buildInstanceofSuggestion(left, leftNode, right, positive, context) {
+    const { family, node, assertObject, extraArguments } = context;
+    if (family === 'jest' || family === 'jasmine') {
+        return (0, assertion_utils_js_1.replacement)(`expect(${left})${negation(positive)}.toBeInstanceOf(${right})`, node);
+    }
+    if (family === 'assert') {
+        return (0, assertion_utils_js_1.replacement)(`${assertObject}.${positive ? 'instanceOf' : 'notInstanceOf'}(${left}, ${right}${extraArguments})`, node);
+    }
+    if (family === 'chai-should') {
+        return (0, assertion_utils_js_1.replacement)(`${chaiShouldReceiver(left, leftNode)}.should${negation(positive)}.be.instanceOf(${right})`, node);
+    }
+    return (0, assertion_utils_js_1.replacement)(`expect(${left}${extraArguments}).to${negation(positive)}.be.instanceOf(${right})`, node);
+}
+function buildNumericComparisonSuggestion(left, leftNode, right, comparison, context) {
+    const { family, node, assertObject, extraArguments } = context;
+    if (family === 'jest' || family === 'jasmine') {
+        return (0, assertion_utils_js_1.replacement)(`expect(${left}).${comparison.jest}(${right})`, node);
+    }
+    if (family === 'assert') {
+        return (0, assertion_utils_js_1.replacement)(`${assertObject}.${comparison.assert}(${left}, ${right}${extraArguments})`, node);
+    }
+    if (family === 'chai-should') {
+        return (0, assertion_utils_js_1.replacement)(`${chaiShouldReceiver(left, leftNode)}.should.be.${comparison.chai}(${right})`, node);
+    }
+    return (0, assertion_utils_js_1.replacement)(`expect(${left}${extraArguments}).to.be.${comparison.chai}(${right})`, node);
+}
+function getIncludesSuggestion(actual, positive, family, sourceCode, node, assertObject, extraArguments) {
+    if (actual.type !== 'CallExpression' ||
+        !(0, ast_js_1.isMethodCall)(actual) ||
+        !(0, ast_js_1.isIdentifier)(actual.callee.property, 'includes') ||
+        actual.arguments.length !== 1 ||
+        !isTrustedStringReceiver(actual.callee.object)) {
+        return null;
+    }
+    const receiver = sourceCode.getText(actual.callee.object);
+    const needle = sourceCode.getText(actual.arguments[0]);
+    if (family === 'jest' || family === 'jasmine') {
+        return (0, assertion_utils_js_1.replacement)(`expect(${receiver})${negation(positive)}.toContain(${needle})`, node);
+    }
+    if (family === 'assert') {
+        return (0, assertion_utils_js_1.replacement)(`${assertObject}.${positive ? 'include' : 'notInclude'}(${receiver}, ${needle}${extraArguments})`, node);
+    }
+    if (family === 'chai-should') {
+        return (0, assertion_utils_js_1.replacement)(`${chaiShouldReceiver(receiver, actual.callee.object)}.should${negation(positive)}.include(${needle})`, node);
+    }
+    return (0, assertion_utils_js_1.replacement)(`expect(${receiver}${extraArguments}).to${negation(positive)}.include(${needle})`, node);
+}
+function negation(positive) {
+    return positive ? '' : '.not';
+}
+function isTrustedStringReceiver(node) {
+    if (node.type === 'Literal') {
+        return typeof node.value === 'string';
+    }
+    if (node.type === 'TemplateLiteral') {
+        return node.expressions.length === 0;
+    }
+    return (0, ast_js_1.isIdentifier)(node) && STRING_LIKE_IDENTIFIER.test(node.name);
+}
+function isNumericComparison(node) {
+    return (isKnownNumericOperand(node.left) &&
+        isKnownNumericOperand(node.right) &&
+        !isKnownNonNumericOperand(node.left) &&
+        !isKnownNonNumericOperand(node.right));
+}
+function isKnownNumericOperand(node) {
+    if (node.type === 'Literal') {
+        return typeof node.value === 'number' || typeof node.value === 'bigint';
+    }
+    if (node.type === 'UnaryExpression' && ['+', '-'].includes(node.operator)) {
+        return isKnownNumericOperand(node.argument);
+    }
+    if ((0, ast_js_1.isIdentifier)(node)) {
+        return NUMERIC_IDENTIFIER.test(node.name);
+    }
+    if (node.type === 'MemberExpression' && !node.computed && (0, ast_js_1.isIdentifier)(node.property)) {
+        return NUMERIC_IDENTIFIER.test(node.property.name);
+    }
+    return false;
+}
+function isKnownNonNumericOperand(node) {
+    if (node.type === 'Literal') {
+        return typeof node.value === 'string';
+    }
+    if (node.type === 'TemplateLiteral') {
+        return node.expressions.length === 0;
+    }
+    if (node.type === 'NewExpression' && (0, ast_js_1.isIdentifier)(node.callee, 'Date')) {
+        return true;
+    }
+    if (node.type === 'CallExpression' && (0, ast_js_1.isIdentifier)(node.callee, 'Date')) {
+        return true;
+    }
+    if ((0, ast_js_1.isIdentifier)(node)) {
+        return STRING_LIKE_IDENTIFIER.test(node.name) || DATE_LIKE_IDENTIFIER.test(node.name);
+    }
+    if (node.type === 'MemberExpression' && !node.computed && (0, ast_js_1.isIdentifier)(node.property)) {
+        return (STRING_LIKE_IDENTIFIER.test(node.property.name) ||
+            DATE_LIKE_IDENTIFIER.test(node.property.name));
+    }
+    return false;
+}
+function getNumericComparison(operator, positive) {
+    const effective = positive ? operator : invertComparison(operator);
+    switch (effective) {
+        case '>':
+            return { jest: 'toBeGreaterThan', chai: 'above', assert: 'isAbove' };
+        case '>=':
+            return { jest: 'toBeGreaterThanOrEqual', chai: 'at.least', assert: 'isAtLeast' };
+        case '<':
+            return { jest: 'toBeLessThan', chai: 'below', assert: 'isBelow' };
+        case '<=':
+            return { jest: 'toBeLessThanOrEqual', chai: 'at.most', assert: 'isAtMost' };
+        default:
+            return null;
+    }
+}
+function invertComparison(operator) {
+    switch (operator) {
+        case '>':
+            return '<=';
+        case '>=':
+            return '<';
+        case '<':
+            return '>=';
+        case '<=':
+            return '>';
+        default:
+            return null;
+    }
+}