eslint-plugin-ts-data-forge 0.6.0 → 0.7.0

package/dist/rules/prefer-arr-is-min-length-array.mjs

@@ -1,83 +1,95 @@
-import { isPartOfBoundedLengthCheck, isLengthAccess, isIntegerLiteralOrConstant } from './ast-utils.mjs';
-import { getTsDataForgeImport, getNamedImports, buildImportFixes } from './import-utils.mjs';
-
-const preferArrIsMinLengthArray = {
-  meta: {
-    type: "suggestion",
-    docs: {
-      description: "Replace `xs.length >= n` with `Arr.isMinLengthArray(xs, n)` from ts-data-forge."
+import { isIntegerLiteralOrConstant, isLengthAccess, isPartOfBoundedLengthCheck, } from './ast-utils.mjs';
+import { buildImportFixes, getNamedImports, getTsDataForgeImport, } from './import-utils.mjs';
+export const preferArrIsMinLengthArray = {
+    meta: {
+        type: 'suggestion',
+        docs: {
+            description: 'Replace `xs.length >= n` with `Arr.isMinLengthArray(xs, n)` from ts-data-forge.',
+        },
+        fixable: 'code',
+        schema: [],
+        messages: {
+            useIsMinLengthArray: 'Replace `{{original}}` with `Arr.isMinLengthArray({{arrayName}}, {{length}})` from ts-data-forge.',
+        },
     },
-    fixable: "code",
-    schema: [],
-    messages: {
-      useIsMinLengthArray: "Replace `{{original}}` with `Arr.isMinLengthArray({{arrayName}}, {{length}})` from ts-data-forge."
-    }
-  },
-  create: (context) => {
-    const sourceCode = context.sourceCode;
-    const program = sourceCode.ast;
-    const tsDataForgeImport = getTsDataForgeImport(program);
-    const services = context.sourceCode.parserServices;
-    const mut_nodesToFix = [];
-    return {
-      BinaryExpression: (node) => {
-        if (node.operator !== ">=" && node.operator !== "<=") return;
-        if (isPartOfBoundedLengthCheck(node, sourceCode)) return;
-        const isLengthOnLeft = node.operator === ">=";
-        const lengthSide = node[isLengthOnLeft ? "left" : "right"];
-        const valueSide = node[isLengthOnLeft ? "right" : "left"];
-        if (!isLengthAccess(lengthSide)) return;
-        if (!isIntegerLiteralOrConstant(valueSide, sourceCode)) return;
-        const arrayExpression = lengthSide.object;
-        if (services?.program !== void 0 && services.program !== null) {
-          const checker = services.program.getTypeChecker();
-          const tsNode = services.esTreeNodeToTSNodeMap?.get(arrayExpression);
-          if (tsNode !== void 0) {
-            const type = checker.getTypeAtLocation(tsNode);
-            const isArrayType = checker.isArrayType(type) || checker.isTupleType(type);
-            if (!isArrayType) return;
-          } else {
-            return;
-          }
-        } else {
-          return;
-        }
-        mut_nodesToFix.push({
-          node,
-          arrayExpression,
-          lengthExpression: valueSide
-        });
-      },
-      "Program:exit": () => {
-        const namedImports = getNamedImports(tsDataForgeImport);
-        const hasArrImport = namedImports.includes("Arr");
-        for (const [
-          index,
-          { node, arrayExpression, lengthExpression }
-        ] of mut_nodesToFix.entries()) {
-          const arrayText = sourceCode.getText(arrayExpression);
-          const lengthText = sourceCode.getText(lengthExpression);
-          const originalText = sourceCode.getText(node);
-          context.report({
-            node,
-            messageId: "useIsMinLengthArray",
-            data: {
-              original: originalText,
-              arrayName: arrayText,
-              length: lengthText
+    create: (context) => {
+        const sourceCode = context.sourceCode;
+        const program = sourceCode.ast;
+        const tsDataForgeImport = getTsDataForgeImport(program);
+        const services = context.sourceCode.parserServices;
+        const mut_nodesToFix = [];
+        return {
+            BinaryExpression: (node) => {
+
+                if (node.operator !== '>=' && node.operator !== '<=')
+                    return;
+
+
+                if (isPartOfBoundedLengthCheck(node, sourceCode))
+                    return;
+
+                const isLengthOnLeft = node.operator === '>=';
+                const lengthSide = node[isLengthOnLeft ? 'left' : 'right'];
+                const valueSide = node[isLengthOnLeft ? 'right' : 'left'];
+
+                if (!isLengthAccess(lengthSide))
+                    return;
+
+                if (!isIntegerLiteralOrConstant(valueSide, sourceCode))
+                    return;
+
+                const arrayExpression = lengthSide.object;
+
+                if (services?.program !== undefined && services.program !== null) {
+                    const checker = services.program.getTypeChecker();
+                    const tsNode = services.esTreeNodeToTSNodeMap?.get(arrayExpression);
+                    if (tsNode !== undefined) {
+                        const type = checker.getTypeAtLocation(tsNode);
+
+                        const isArrayType = checker.isArrayType(type) || checker.isTupleType(type);
+                        if (!isArrayType)
+                            return;
+                    }
+                    else {
+                        return;
+                    }
+                }
+                else {
+                    return;
+                }
+                mut_nodesToFix.push({
+                    node,
+                    arrayExpression,
+                    lengthExpression: valueSide,
+                });
             },
-            fix: (fixer) => {
-              const replacement = `Arr.isMinLengthArray(${lengthText}, ${arrayText})`;
-              const importFixes = index === 0 && !hasArrImport ? buildImportFixes(fixer, program, tsDataForgeImport, ["Arr"]) : [];
-              return [...importFixes, fixer.replaceText(node, replacement)];
-            }
-          });
-        }
-      }
-    };
-  },
-  defaultOptions: []
+            'Program:exit': () => {
+                const namedImports = getNamedImports(tsDataForgeImport);
+                const hasArrImport = namedImports.includes('Arr');
+                for (const [index, { node, arrayExpression, lengthExpression },] of mut_nodesToFix.entries()) {
+                    const arrayText = sourceCode.getText(arrayExpression);
+                    const lengthText = sourceCode.getText(lengthExpression);
+                    const originalText = sourceCode.getText(node);
+                    context.report({
+                        node,
+                        messageId: 'useIsMinLengthArray',
+                        data: {
+                            original: originalText,
+                            arrayName: arrayText,
+                            length: lengthText,
+                        },
+                        fix: (fixer) => {
+                            const replacement = `Arr.isMinLengthArray(${lengthText}, ${arrayText})`;
+                            const importFixes = index === 0 && !hasArrImport
+                                ? buildImportFixes(fixer, program, tsDataForgeImport, ['Arr'])
+                                : [];
+                            return [...importFixes, fixer.replaceText(node, replacement)];
+                        },
+                    });
+                }
+            },
+        };
+    },
+    defaultOptions: [],
 };
-
-export { preferArrIsMinLengthArray };
-//# sourceMappingURL=prefer-arr-is-min-length-array.mjs.map
+//# sourceMappingURL=prefer-arr-is-min-length-array.mjs.map

package/dist/rules/prefer-arr-is-min-length-array.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"prefer-arr-is-min-length-array.mjs","sources":["../../src/rules/prefer-arr-is-min-length-array.mts"],"sourcesContent":["import { type TSESLint, type TSESTree } from '@typescript-eslint/utils';\nimport {\n  isIntegerLiteralOrConstant,\n  isLengthAccess,\n  isPartOfBoundedLengthCheck,\n} from './ast-utils.mjs';\nimport {\n  buildImportFixes,\n  getNamedImports,\n  getTsDataForgeImport,\n} from './import-utils.mjs';\n\ntype Options = readonly [];\n\ntype MessageIds = 'useIsMinLengthArray';\n\nexport const preferArrIsMinLengthArray: TSESLint.RuleModule<\n  MessageIds,\n  Options\n> = {\n  meta: {\n    type: 'suggestion',\n    docs: {\n      description:\n        'Replace `xs.length >= n` with `Arr.isMinLengthArray(xs, n)` from ts-data-forge.',\n    },\n    fixable: 'code',\n    schema: [],\n    messages: {\n      useIsMinLengthArray:\n        'Replace `{{original}}` with `Arr.isMinLengthArray({{arrayName}}, {{length}})` from ts-data-forge.',\n    },\n  },\n\n  create: (context) => {\n    const sourceCode = context.sourceCode;\n\n    const program = sourceCode.ast;\n\n    const tsDataForgeImport = getTsDataForgeImport(program);\n\n    const services = context.sourceCode.parserServices;\n\n    const mut_nodesToFix: {\n      node: TSESTree.BinaryExpression;\n      arrayExpression: TSESTree.Expression;\n      lengthExpression: TSESTree.Expression;\n    }[] = [];\n\n    return {\n      BinaryExpression: (node) => {\n        // Check for `xs.length >= n` or `n <= xs.length`\n        if (node.operator !== '>=' && node.operator !== '<=') return;\n\n        // Defer to `prefer-arr-is-bounded-length-array` when this comparison is\n        // the lower bound of a `min && max` pair on the same array.\n        if (isPartOfBoundedLengthCheck(node, sourceCode)) return;\n\n        // xs.length >= n  or  n <= xs.length\n        const isLengthOnLeft = node.operator === '>=';\n\n        const lengthSide = node[isLengthOnLeft ? 'left' : 'right'];\n\n        const valueSide = node[isLengthOnLeft ? 'right' : 'left'];\n\n        // Check if lengthSide is accessing .length\n        if (!isLengthAccess(lengthSide)) return;\n\n        // Only match integer literals or const variables initialized with integer literals\n        if (!isIntegerLiteralOrConstant(valueSide, sourceCode)) return;\n\n        // lengthSide is MemberExpression accessing .length\n        const arrayExpression = lengthSide.object;\n\n        // Check if arrayExpression is actually an array type\n        if (services?.program !== undefined && services.program !== null) {\n          const checker = services.program.getTypeChecker();\n\n          const tsNode = services.esTreeNodeToTSNodeMap?.get(arrayExpression);\n\n          if (tsNode !== undefined) {\n            const type = checker.getTypeAtLocation(tsNode);\n\n            // Check if it's an array type or tuple type\n            const isArrayType =\n              checker.isArrayType(type) || checker.isTupleType(type);\n\n            if (!isArrayType) return;\n          } else {\n            return;\n          }\n        } else {\n          return;\n        }\n\n        mut_nodesToFix.push({\n          node,\n          arrayExpression,\n          lengthExpression: valueSide,\n        });\n      },\n      'Program:exit': () => {\n        const namedImports = getNamedImports(tsDataForgeImport);\n\n        const hasArrImport = namedImports.includes('Arr');\n\n        for (const [\n          index,\n          { node, arrayExpression, lengthExpression },\n        ] of mut_nodesToFix.entries()) {\n          const arrayText = sourceCode.getText(arrayExpression);\n\n          const lengthText = sourceCode.getText(lengthExpression);\n\n          const originalText = sourceCode.getText(node);\n\n          context.report({\n            node,\n            messageId: 'useIsMinLengthArray',\n            data: {\n              original: originalText,\n              arrayName: arrayText,\n              length: lengthText,\n            },\n            fix: (fixer) => {\n              const replacement = `Arr.isMinLengthArray(${lengthText}, ${arrayText})`;\n\n              const importFixes =\n                index === 0 && !hasArrImport\n                  ? buildImportFixes(fixer, program, tsDataForgeImport, ['Arr'])\n                  : [];\n\n              return [...importFixes, fixer.replaceText(node, replacement)];\n            },\n          });\n        }\n      },\n    };\n  },\n  defaultOptions: [],\n} as const;\n"],"names":[],"mappings":";;;AAgBO,MAAM,yBAAA,GAGT;AAAA,EACF,IAAA,EAAM;AAAA,IACJ,IAAA,EAAM,YAAA;AAAA,IACN,IAAA,EAAM;AAAA,MACJ,WAAA,EACE;AAAA,KACJ;AAAA,IACA,OAAA,EAAS,MAAA;AAAA,IACT,QAAQ,EAAC;AAAA,IACT,QAAA,EAAU;AAAA,MACR,mBAAA,EACE;AAAA;AACJ,GACF;AAAA,EAEA,MAAA,EAAQ,CAAC,OAAA,KAAY;AACnB,IAAA,MAAM,aAAa,OAAA,CAAQ,UAAA;AAE3B,IAAA,MAAM,UAAU,UAAA,CAAW,GAAA;AAE3B,IAAA,MAAM,iBAAA,GAAoB,qBAAqB,OAAO,CAAA;AAEtD,IAAA,MAAM,QAAA,GAAW,QAAQ,UAAA,CAAW,cAAA;AAEpC,IAAA,MAAM,iBAIA,EAAC;AAEP,IAAA,OAAO;AAAA,MACL,gBAAA,EAAkB,CAAC,IAAA,KAAS;AAE1B,QAAA,IAAI,IAAA,CAAK,QAAA,KAAa,IAAA,IAAQ,IAAA,CAAK,aAAa,IAAA,EAAM;AAItD,QAAA,IAAI,0BAAA,CAA2B,IAAA,EAAM,UAAU,CAAA,EAAG;AAGlD,QAAA,MAAM,cAAA,GAAiB,KAAK,QAAA,KAAa,IAAA;AAEzC,QAAA,MAAM,UAAA,GAAa,IAAA,CAAK,cAAA,GAAiB,MAAA,GAAS,OAAO,CAAA;AAEzD,QAAA,MAAM,SAAA,GAAY,IAAA,CAAK,cAAA,GAAiB,OAAA,GAAU,MAAM,CAAA;AAGxD,QAAA,IAAI,CAAC,cAAA,CAAe,UAAU,CAAA,EAAG;AAGjC,QAAA,IAAI,CAAC,0BAAA,CAA2B,SAAA,EAAW,UAAU,CAAA,EAAG;AAGxD,QAAA,MAAM,kBAAkB,UAAA,CAAW,MAAA;AAGnC,QAAA,IAAI,QAAA,EAAU,OAAA,KAAY,MAAA,IAAa,QAAA,CAAS,YAAY,IAAA,EAAM;AAChE,UAAA,MAAM,OAAA,GAAU,QAAA,CAAS,OAAA,CAAQ,cAAA,EAAe;AAEhD,UAAA,MAAM,MAAA,GAAS,QAAA,CAAS,qBAAA,EAAuB,GAAA,CAAI,eAAe,CAAA;AAElE,UAAA,IAAI,WAAW,MAAA,EAAW;AACxB,YAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,iBAAA,CAAkB,MAAM,CAAA;AAG7C,YAAA,MAAM,cACJ,OAAA,CAAQ,WAAA,CAAY,IAAI,CAAA,IAAK,OAAA,CAAQ,YAAY,IAAI,CAAA;AAEvD,YAAA,IAAI,CAAC,WAAA,EAAa;AAAA,UACpB,CAAA,MAAO;AACL,YAAA;AAAA,UACF;AAAA,QACF,CAAA,MAAO;AACL,UAAA;AAAA,QACF;AAEA,QAAA,cAAA,CAAe,IAAA,CAAK;AAAA,UAClB,IAAA;AAAA,UACA,eAAA;AAAA,UACA,gBAAA,EAAkB;AAAA,SACnB,CAAA;AAAA,MACH,CAAA;AAAA,MACA,gBAAgB,MAAM;AACpB,QAAA,MAAM,YAAA,GAAe,gBAAgB,iBAAiB,CAAA;AAEtD,QAAA,MAAM,YAAA,GAAe,YAAA,CAAa,QAAA,CAAS,KAAK,CAAA;AAEhD,QAAA,KAAA,MAAW;AAAA,UACT,KAAA;AAAA,UACA,EAAE,IAAA,EAAM,eAAA,EAAiB,gBAAA;AAAiB,SAC5C,IAAK,cAAA,CAAe,OAAA,EAAQ,EAAG;AAC7B,UAAA,MAAM,SAAA,GAAY,UAAA,CAAW,OAAA,CAAQ,eAAe,CAAA;AAEpD,UAAA,MAAM,UAAA,GAAa,UAAA,CAAW,OAAA,CAAQ,gBAAgB,CAAA;AAEtD,UAAA,MAAM,YAAA,GAAe,UAAA,CAAW,OAAA,CAAQ,IAAI,CAAA;AAE5C,UAAA,OAAA,CAAQ,MAAA,CAAO;AAAA,YACb,IAAA;AAAA,YACA,SAAA,EAAW,qBAAA;AAAA,YACX,IAAA,EAAM;AAAA,cACJ,QAAA,EAAU,YAAA;AAAA,cACV,SAAA,EAAW,SAAA;AAAA,cACX,MAAA,EAAQ;AAAA,aACV;AAAA,YACA,GAAA,EAAK,CAAC,KAAA,KAAU;AACd,cAAA,MAAM,WAAA,GAAc,CAAA,qBAAA,EAAwB,UAAU,CAAA,EAAA,EAAK,SAAS,CAAA,CAAA,CAAA;AAEpE,cAAA,MAAM,WAAA,GACJ,KAAA,KAAU,CAAA,IAAK,CAAC,YAAA,GACZ,gBAAA,CAAiB,KAAA,EAAO,OAAA,EAAS,iBAAA,EAAmB,CAAC,KAAK,CAAC,IAC3D,EAAC;AAEP,cAAA,OAAO,CAAC,GAAG,WAAA,EAAa,MAAM,WAAA,CAAY,IAAA,EAAM,WAAW,CAAC,CAAA;AAAA,YAC9D;AAAA,WACD,CAAA;AAAA,QACH;AAAA,MACF;AAAA,KACF;AAAA,EACF,CAAA;AAAA,EACA,gBAAgB;AAClB;;"}
+{"version":3,"file":"prefer-arr-is-min-length-array.mjs","sourceRoot":"","sources":["../../src/rules/prefer-arr-is-min-length-array.mts"],"names":[],"mappings":"AACA,OAAO,EACL,0BAA0B,EAC1B,cAAc,EACd,0BAA0B,GAC3B,MAAM,iBAAiB,CAAC;AACzB,OAAO,EACL,gBAAgB,EAChB,eAAe,EACf,oBAAoB,GACrB,MAAM,oBAAoB,CAAC;AAM5B,MAAM,CAAC,MAAM,yBAAyB,GAGlC;IACF,IAAI,EAAE;QACJ,IAAI,EAAE,YAAY;QAClB,IAAI,EAAE;YACJ,WAAW,EACT,iFAAiF;SACpF;QACD,OAAO,EAAE,MAAM;QACf,MAAM,EAAE,EAAE;QACV,QAAQ,EAAE;YACR,mBAAmB,EACjB,mGAAmG;SACtG;KACF;IAED,MAAM,EAAE,CAAC,OAAO,EAAE,EAAE;QAClB,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC;QAEtC,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC;QAE/B,MAAM,iBAAiB,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;QAExD,MAAM,QAAQ,GAAG,OAAO,CAAC,UAAU,CAAC,cAAc,CAAC;QAEnD,MAAM,cAAc,GAId,EAAE,CAAC;QAET,OAAO;YACL,gBAAgB,EAAE,CAAC,IAAI,EAAE,EAAE;gBACzB,iDAAiD;gBACjD,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI,IAAI,IAAI,CAAC,QAAQ,KAAK,IAAI;oBAAE,OAAO;gBAE7D,wEAAwE;gBACxE,4DAA4D;gBAC5D,IAAI,0BAA0B,CAAC,IAAI,EAAE,UAAU,CAAC;oBAAE,OAAO;gBAEzD,qCAAqC;gBACrC,MAAM,cAAc,GAAG,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC;gBAE9C,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;gBAE3D,MAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAE1D,2CAA2C;gBAC3C,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC;oBAAE,OAAO;gBAExC,mFAAmF;gBACnF,IAAI,CAAC,0BAA0B,CAAC,SAAS,EAAE,UAAU,CAAC;oBAAE,OAAO;gBAE/D,mDAAmD;gBACnD,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,CAAC;gBAE1C,qDAAqD;gBACrD,IAAI,QAAQ,EAAE,OAAO,KAAK,SAAS,IAAI,QAAQ,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;oBACjE,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC,cAAc,EAAE,CAAC;oBAElD,MAAM,MAAM,GAAG,QAAQ,CAAC,qBAAqB,EAAE,GAAG,CAAC,eAAe,CAAC,CAAC;oBAEpE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;wBACzB,MAAM,IAAI,GAAG,OAAO,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;wBAE/C,4CAA4C;wBAC5C,MAAM,WAAW,GACf,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;wBAEzD,IAAI,CAAC,WAAW;4BAAE,OAAO;oBAC3B,CAAC;yBAAM,CAAC;wBACN,OAAO;oBACT,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,OAAO;gBACT,CAAC;gBAED,cAAc,CAAC,IAAI,CAAC;oBAClB,IAAI;oBACJ,eAAe;oBACf,gBAAgB,EAAE,SAAS;iBAC5B,CAAC,CAAC;YACL,CAAC;YACD,cAAc,EAAE,GAAG,EAAE;gBACnB,MAAM,YAAY,GAAG,eAAe,CAAC,iBAAiB,CAAC,CAAC;gBAExD,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAElD,KAAK,MAAM,CACT,KAAK,EACL,EAAE,IAAI,EAAE,eAAe,EAAE,gBAAgB,EAAE,EAC5C,IAAI,cAAc,CAAC,OAAO,EAAE,EAAE,CAAC;oBAC9B,MAAM,SAAS,GAAG,UAAU,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC;oBAEtD,MAAM,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC,gBAAgB,CAAC,CAAC;oBAExD,MAAM,YAAY,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBAE9C,OAAO,CAAC,MAAM,CAAC;wBACb,IAAI;wBACJ,SAAS,EAAE,qBAAqB;wBAChC,IAAI,EAAE;4BACJ,QAAQ,EAAE,YAAY;4BACtB,SAAS,EAAE,SAAS;4BACpB,MAAM,EAAE,UAAU;yBACnB;wBACD,GAAG,EAAE,CAAC,KAAK,EAAE,EAAE;4BACb,MAAM,WAAW,GAAG,wBAAwB,UAAU,KAAK,SAAS,GAAG,CAAC;4BAExE,MAAM,WAAW,GACf,KAAK,KAAK,CAAC,IAAI,CAAC,YAAY;gCAC1B,CAAC,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,EAAE,iBAAiB,EAAE,CAAC,KAAK,CAAC,CAAC;gCAC9D,CAAC,CAAC,EAAE,CAAC;4BAET,OAAO,CAAC,GAAG,WAAW,EAAE,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC;wBAChE,CAAC;qBACF,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;SACF,CAAC;IACJ,CAAC;IACD,cAAc,EAAE,EAAE;CACV,CAAC"}

package/dist/rules/prefer-arr-is-non-empty.mjs

@@ -1,80 +1,88 @@
-import { AST_NODE_TYPES } from '@typescript-eslint/utils';
-import { getTsDataForgeImport, getNamedImports, buildImportFixes } from './import-utils.mjs';
-
-const preferArrIsNonEmpty = {
-  meta: {
-    type: "suggestion",
-    docs: {
-      description: "Replace `xs.length > 0` with `Arr.isNonEmpty(xs)` from ts-data-forge."
+import { AST_NODE_TYPES, } from '@typescript-eslint/utils';
+import { buildImportFixes, getNamedImports, getTsDataForgeImport, } from './import-utils.mjs';
+export const preferArrIsNonEmpty = {
+    meta: {
+        type: 'suggestion',
+        docs: {
+            description: 'Replace `xs.length > 0` with `Arr.isNonEmpty(xs)` from ts-data-forge.',
+        },
+        fixable: 'code',
+        schema: [],
+        messages: {
+            useIsNonEmpty: 'Replace `{{original}}` with `Arr.isNonEmpty({{arrayName}})` from ts-data-forge.',
+        },
     },
-    fixable: "code",
-    schema: [],
-    messages: {
-      useIsNonEmpty: "Replace `{{original}}` with `Arr.isNonEmpty({{arrayName}})` from ts-data-forge."
-    }
-  },
-  create: (context) => {
-    const sourceCode = context.sourceCode;
-    const program = sourceCode.ast;
-    const tsDataForgeImport = getTsDataForgeImport(program);
-    const services = context.sourceCode.parserServices;
-    const mut_nodesToFix = [];
-    return {
-      BinaryExpression: (node) => {
-        if (node.operator !== ">" && node.operator !== "<") return;
-        const isLengthOnLeft = node.operator === ">";
-        const lengthSide = node[isLengthOnLeft ? "left" : "right"];
-        const numberSide = node[isLengthOnLeft ? "right" : "left"];
-        if (lengthSide.type !== AST_NODE_TYPES.MemberExpression || lengthSide.property.type !== AST_NODE_TYPES.Identifier || lengthSide.property.name !== "length" || numberSide.type !== AST_NODE_TYPES.Literal || numberSide.value !== 0) {
-          return;
-        }
-        const arrayExpression = lengthSide.object;
-        if (services?.program !== void 0 && services.program !== null) {
-          const checker = services.program.getTypeChecker();
-          const tsNode = services.esTreeNodeToTSNodeMap?.get(arrayExpression);
-          if (tsNode !== void 0) {
-            const type = checker.getTypeAtLocation(tsNode);
-            const isArrayType = checker.isArrayType(type) || checker.isTupleType(type);
-            if (!isArrayType) return;
-          } else {
-            return;
-          }
-        } else {
-          return;
-        }
-        mut_nodesToFix.push({
-          node,
-          arrayExpression
-        });
-      },
-      "Program:exit": () => {
-        const namedImports = getNamedImports(tsDataForgeImport);
-        const hasArrImport = namedImports.includes("Arr");
-        for (const [
-          index,
-          { node, arrayExpression }
-        ] of mut_nodesToFix.entries()) {
-          const arrayText = sourceCode.getText(arrayExpression);
-          const originalText = sourceCode.getText(node);
-          context.report({
-            node,
-            messageId: "useIsNonEmpty",
-            data: {
-              original: originalText,
-              arrayName: arrayText
+    create: (context) => {
+        const sourceCode = context.sourceCode;
+        const program = sourceCode.ast;
+        const tsDataForgeImport = getTsDataForgeImport(program);
+        const services = context.sourceCode.parserServices;
+        const mut_nodesToFix = [];
+        return {
+            BinaryExpression: (node) => {
+
+                if (node.operator !== '>' && node.operator !== '<')
+                    return;
+                const isLengthOnLeft = node.operator === '>';
+                const lengthSide = node[isLengthOnLeft ? 'left' : 'right'];
+                const numberSide = node[isLengthOnLeft ? 'right' : 'left'];
+
+                if (lengthSide.type !== AST_NODE_TYPES.MemberExpression ||
+                    lengthSide.property.type !== AST_NODE_TYPES.Identifier ||
+                    lengthSide.property.name !== 'length' ||
+                    numberSide.type !== AST_NODE_TYPES.Literal ||
+                    numberSide.value !== 0) {
+                    return;
+                }
+                const arrayExpression = lengthSide.object;
+
+                if (services?.program !== undefined && services.program !== null) {
+                    const checker = services.program.getTypeChecker();
+                    const tsNode = services.esTreeNodeToTSNodeMap?.get(arrayExpression);
+                    if (tsNode !== undefined) {
+                        const type = checker.getTypeAtLocation(tsNode);
+
+                        const isArrayType = checker.isArrayType(type) || checker.isTupleType(type);
+                        if (!isArrayType)
+                            return;
+                    }
+                    else {
+                        return;
+                    }
+                }
+                else {
+                    return;
+                }
+                mut_nodesToFix.push({
+                    node,
+                    arrayExpression,
+                });
+            },
+            'Program:exit': () => {
+                const namedImports = getNamedImports(tsDataForgeImport);
+                const hasArrImport = namedImports.includes('Arr');
+                for (const [index, { node, arrayExpression },] of mut_nodesToFix.entries()) {
+                    const arrayText = sourceCode.getText(arrayExpression);
+                    const originalText = sourceCode.getText(node);
+                    context.report({
+                        node,
+                        messageId: 'useIsNonEmpty',
+                        data: {
+                            original: originalText,
+                            arrayName: arrayText,
+                        },
+                        fix: (fixer) => {
+                            const replacement = `Arr.isNonEmpty(${arrayText})`;
+                            const importFixes = index === 0 && !hasArrImport
+                                ? buildImportFixes(fixer, program, tsDataForgeImport, ['Arr'])
+                                : [];
+                            return [...importFixes, fixer.replaceText(node, replacement)];
+                        },
+                    });
+                }
             },
-            fix: (fixer) => {
-              const replacement = `Arr.isNonEmpty(${arrayText})`;
-              const importFixes = index === 0 && !hasArrImport ? buildImportFixes(fixer, program, tsDataForgeImport, ["Arr"]) : [];
-              return [...importFixes, fixer.replaceText(node, replacement)];
-            }
-          });
-        }
-      }
-    };
-  },
-  defaultOptions: []
+        };
+    },
+    defaultOptions: [],
 };
-
-export { preferArrIsNonEmpty };
-//# sourceMappingURL=prefer-arr-is-non-empty.mjs.map
+//# sourceMappingURL=prefer-arr-is-non-empty.mjs.map

package/dist/rules/prefer-arr-is-non-empty.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"prefer-arr-is-non-empty.mjs","sources":["../../src/rules/prefer-arr-is-non-empty.mts"],"sourcesContent":["import {\n  AST_NODE_TYPES,\n  type TSESLint,\n  type TSESTree,\n} from '@typescript-eslint/utils';\nimport {\n  buildImportFixes,\n  getNamedImports,\n  getTsDataForgeImport,\n} from './import-utils.mjs';\n\ntype Options = readonly [];\n\ntype MessageIds = 'useIsNonEmpty';\n\nexport const preferArrIsNonEmpty: TSESLint.RuleModule<MessageIds, Options> = {\n  meta: {\n    type: 'suggestion',\n    docs: {\n      description:\n        'Replace `xs.length > 0` with `Arr.isNonEmpty(xs)` from ts-data-forge.',\n    },\n    fixable: 'code',\n    schema: [],\n    messages: {\n      useIsNonEmpty:\n        'Replace `{{original}}` with `Arr.isNonEmpty({{arrayName}})` from ts-data-forge.',\n    },\n  },\n\n  create: (context) => {\n    const sourceCode = context.sourceCode;\n\n    const program = sourceCode.ast;\n\n    const tsDataForgeImport = getTsDataForgeImport(program);\n\n    const services = context.sourceCode.parserServices;\n\n    const mut_nodesToFix: {\n      node: TSESTree.BinaryExpression;\n      arrayExpression: TSESTree.Expression;\n    }[] = [];\n\n    return {\n      BinaryExpression: (node) => {\n        // Check for `xs.length > 0` or `0 < xs.length`\n        if (node.operator !== '>' && node.operator !== '<') return;\n\n        const isLengthOnLeft = node.operator === '>';\n\n        const lengthSide = node[isLengthOnLeft ? 'left' : 'right'];\n\n        const numberSide = node[isLengthOnLeft ? 'right' : 'left'];\n\n        // Check if one side is `.length` and the other is 0\n        if (\n          lengthSide.type !== AST_NODE_TYPES.MemberExpression ||\n          lengthSide.property.type !== AST_NODE_TYPES.Identifier ||\n          lengthSide.property.name !== 'length' ||\n          numberSide.type !== AST_NODE_TYPES.Literal ||\n          numberSide.value !== 0\n        ) {\n          return;\n        }\n\n        const arrayExpression = lengthSide.object;\n\n        // Check if arrayExpression is actually an array type\n        if (services?.program !== undefined && services.program !== null) {\n          const checker = services.program.getTypeChecker();\n\n          const tsNode = services.esTreeNodeToTSNodeMap?.get(arrayExpression);\n\n          if (tsNode !== undefined) {\n            const type = checker.getTypeAtLocation(tsNode);\n\n            // Check if it's an array type or tuple type\n            const isArrayType =\n              checker.isArrayType(type) || checker.isTupleType(type);\n\n            if (!isArrayType) return;\n          } else {\n            return;\n          }\n        } else {\n          return;\n        }\n\n        mut_nodesToFix.push({\n          node,\n          arrayExpression,\n        });\n      },\n      'Program:exit': () => {\n        const namedImports = getNamedImports(tsDataForgeImport);\n\n        const hasArrImport = namedImports.includes('Arr');\n\n        for (const [\n          index,\n          { node, arrayExpression },\n        ] of mut_nodesToFix.entries()) {\n          const arrayText = sourceCode.getText(arrayExpression);\n\n          const originalText = sourceCode.getText(node);\n\n          context.report({\n            node,\n            messageId: 'useIsNonEmpty',\n            data: {\n              original: originalText,\n              arrayName: arrayText,\n            },\n            fix: (fixer) => {\n              const replacement = `Arr.isNonEmpty(${arrayText})`;\n\n              const importFixes =\n                index === 0 && !hasArrImport\n                  ? buildImportFixes(fixer, program, tsDataForgeImport, ['Arr'])\n                  : [];\n\n              return [...importFixes, fixer.replaceText(node, replacement)];\n            },\n          });\n        }\n      },\n    };\n  },\n  defaultOptions: [],\n} as const;\n"],"names":[],"mappings":";;;AAeO,MAAM,mBAAA,GAAgE;AAAA,EAC3E,IAAA,EAAM;AAAA,IACJ,IAAA,EAAM,YAAA;AAAA,IACN,IAAA,EAAM;AAAA,MACJ,WAAA,EACE;AAAA,KACJ;AAAA,IACA,OAAA,EAAS,MAAA;AAAA,IACT,QAAQ,EAAC;AAAA,IACT,QAAA,EAAU;AAAA,MACR,aAAA,EACE;AAAA;AACJ,GACF;AAAA,EAEA,MAAA,EAAQ,CAAC,OAAA,KAAY;AACnB,IAAA,MAAM,aAAa,OAAA,CAAQ,UAAA;AAE3B,IAAA,MAAM,UAAU,UAAA,CAAW,GAAA;AAE3B,IAAA,MAAM,iBAAA,GAAoB,qBAAqB,OAAO,CAAA;AAEtD,IAAA,MAAM,QAAA,GAAW,QAAQ,UAAA,CAAW,cAAA;AAEpC,IAAA,MAAM,iBAGA,EAAC;AAEP,IAAA,OAAO;AAAA,MACL,gBAAA,EAAkB,CAAC,IAAA,KAAS;AAE1B,QAAA,IAAI,IAAA,CAAK,QAAA,KAAa,GAAA,IAAO,IAAA,CAAK,aAAa,GAAA,EAAK;AAEpD,QAAA,MAAM,cAAA,GAAiB,KAAK,QAAA,KAAa,GAAA;AAEzC,QAAA,MAAM,UAAA,GAAa,IAAA,CAAK,cAAA,GAAiB,MAAA,GAAS,OAAO,CAAA;AAEzD,QAAA,MAAM,UAAA,GAAa,IAAA,CAAK,cAAA,GAAiB,OAAA,GAAU,MAAM,CAAA;AAGzD,QAAA,IACE,WAAW,IAAA,KAAS,cAAA,CAAe,oBACnC,UAAA,CAAW,QAAA,CAAS,SAAS,cAAA,CAAe,UAAA,IAC5C,WAAW,QAAA,CAAS,IAAA,KAAS,YAC7B,UAAA,CAAW,IAAA,KAAS,eAAe,OAAA,IACnC,UAAA,CAAW,UAAU,CAAA,EACrB;AACA,UAAA;AAAA,QACF;AAEA,QAAA,MAAM,kBAAkB,UAAA,CAAW,MAAA;AAGnC,QAAA,IAAI,QAAA,EAAU,OAAA,KAAY,MAAA,IAAa,QAAA,CAAS,YAAY,IAAA,EAAM;AAChE,UAAA,MAAM,OAAA,GAAU,QAAA,CAAS,OAAA,CAAQ,cAAA,EAAe;AAEhD,UAAA,MAAM,MAAA,GAAS,QAAA,CAAS,qBAAA,EAAuB,GAAA,CAAI,eAAe,CAAA;AAElE,UAAA,IAAI,WAAW,MAAA,EAAW;AACxB,YAAA,MAAM,IAAA,GAAO,OAAA,CAAQ,iBAAA,CAAkB,MAAM,CAAA;AAG7C,YAAA,MAAM,cACJ,OAAA,CAAQ,WAAA,CAAY,IAAI,CAAA,IAAK,OAAA,CAAQ,YAAY,IAAI,CAAA;AAEvD,YAAA,IAAI,CAAC,WAAA,EAAa;AAAA,UACpB,CAAA,MAAO;AACL,YAAA;AAAA,UACF;AAAA,QACF,CAAA,MAAO;AACL,UAAA;AAAA,QACF;AAEA,QAAA,cAAA,CAAe,IAAA,CAAK;AAAA,UAClB,IAAA;AAAA,UACA;AAAA,SACD,CAAA;AAAA,MACH,CAAA;AAAA,MACA,gBAAgB,MAAM;AACpB,QAAA,MAAM,YAAA,GAAe,gBAAgB,iBAAiB,CAAA;AAEtD,QAAA,MAAM,YAAA,GAAe,YAAA,CAAa,QAAA,CAAS,KAAK,CAAA;AAEhD,QAAA,KAAA,MAAW;AAAA,UACT,KAAA;AAAA,UACA,EAAE,MAAM,eAAA;AAAgB,SAC1B,IAAK,cAAA,CAAe,OAAA,EAAQ,EAAG;AAC7B,UAAA,MAAM,SAAA,GAAY,UAAA,CAAW,OAAA,CAAQ,eAAe,CAAA;AAEpD,UAAA,MAAM,YAAA,GAAe,UAAA,CAAW,OAAA,CAAQ,IAAI,CAAA;AAE5C,UAAA,OAAA,CAAQ,MAAA,CAAO;AAAA,YACb,IAAA;AAAA,YACA,SAAA,EAAW,eAAA;AAAA,YACX,IAAA,EAAM;AAAA,cACJ,QAAA,EAAU,YAAA;AAAA,cACV,SAAA,EAAW;AAAA,aACb;AAAA,YACA,GAAA,EAAK,CAAC,KAAA,KAAU;AACd,cAAA,MAAM,WAAA,GAAc,kBAAkB,SAAS,CAAA,CAAA,CAAA;AAE/C,cAAA,MAAM,WAAA,GACJ,KAAA,KAAU,CAAA,IAAK,CAAC,YAAA,GACZ,gBAAA,CAAiB,KAAA,EAAO,OAAA,EAAS,iBAAA,EAAmB,CAAC,KAAK,CAAC,IAC3D,EAAC;AAEP,cAAA,OAAO,CAAC,GAAG,WAAA,EAAa,MAAM,WAAA,CAAY,IAAA,EAAM,WAAW,CAAC,CAAA;AAAA,YAC9D;AAAA,WACD,CAAA;AAAA,QACH;AAAA,MACF;AAAA,KACF;AAAA,EACF,CAAA;AAAA,EACA,gBAAgB;AAClB;;"}
+{"version":3,"file":"prefer-arr-is-non-empty.mjs","sourceRoot":"","sources":["../../src/rules/prefer-arr-is-non-empty.mts"],"names":[],"mappings":"AAAA,OAAO,EACL,cAAc,GAGf,MAAM,0BAA0B,CAAC;AAClC,OAAO,EACL,gBAAgB,EAChB,eAAe,EACf,oBAAoB,GACrB,MAAM,oBAAoB,CAAC;AAM5B,MAAM,CAAC,MAAM,mBAAmB,GAA6C;IAC3E,IAAI,EAAE;QACJ,IAAI,EAAE,YAAY;QAClB,IAAI,EAAE;YACJ,WAAW,EACT,uEAAuE;SAC1E;QACD,OAAO,EAAE,MAAM;QACf,MAAM,EAAE,EAAE;QACV,QAAQ,EAAE;YACR,aAAa,EACX,iFAAiF;SACpF;KACF;IAED,MAAM,EAAE,CAAC,OAAO,EAAE,EAAE;QAClB,MAAM,UAAU,GAAG,OAAO,CAAC,UAAU,CAAC;QAEtC,MAAM,OAAO,GAAG,UAAU,CAAC,GAAG,CAAC;QAE/B,MAAM,iBAAiB,GAAG,oBAAoB,CAAC,OAAO,CAAC,CAAC;QAExD,MAAM,QAAQ,GAAG,OAAO,CAAC,UAAU,CAAC,cAAc,CAAC;QAEnD,MAAM,cAAc,GAGd,EAAE,CAAC;QAET,OAAO;YACL,gBAAgB,EAAE,CAAC,IAAI,EAAE,EAAE;gBACzB,+CAA+C;gBAC/C,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG;oBAAE,OAAO;gBAE3D,MAAM,cAAc,GAAG,IAAI,CAAC,QAAQ,KAAK,GAAG,CAAC;gBAE7C,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;gBAE3D,MAAM,UAAU,GAAG,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;gBAE3D,oDAAoD;gBACpD,IACE,UAAU,CAAC,IAAI,KAAK,cAAc,CAAC,gBAAgB;oBACnD,UAAU,CAAC,QAAQ,CAAC,IAAI,KAAK,cAAc,CAAC,UAAU;oBACtD,UAAU,CAAC,QAAQ,CAAC,IAAI,KAAK,QAAQ;oBACrC,UAAU,CAAC,IAAI,KAAK,cAAc,CAAC,OAAO;oBAC1C,UAAU,CAAC,KAAK,KAAK,CAAC,EACtB,CAAC;oBACD,OAAO;gBACT,CAAC;gBAED,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,CAAC;gBAE1C,qDAAqD;gBACrD,IAAI,QAAQ,EAAE,OAAO,KAAK,SAAS,IAAI,QAAQ,CAAC,OAAO,KAAK,IAAI,EAAE,CAAC;oBACjE,MAAM,OAAO,GAAG,QAAQ,CAAC,OAAO,CAAC,cAAc,EAAE,CAAC;oBAElD,MAAM,MAAM,GAAG,QAAQ,CAAC,qBAAqB,EAAE,GAAG,CAAC,eAAe,CAAC,CAAC;oBAEpE,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;wBACzB,MAAM,IAAI,GAAG,OAAO,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;wBAE/C,4CAA4C;wBAC5C,MAAM,WAAW,GACf,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;wBAEzD,IAAI,CAAC,WAAW;4BAAE,OAAO;oBAC3B,CAAC;yBAAM,CAAC;wBACN,OAAO;oBACT,CAAC;gBACH,CAAC;qBAAM,CAAC;oBACN,OAAO;gBACT,CAAC;gBAED,cAAc,CAAC,IAAI,CAAC;oBAClB,IAAI;oBACJ,eAAe;iBAChB,CAAC,CAAC;YACL,CAAC;YACD,cAAc,EAAE,GAAG,EAAE;gBACnB,MAAM,YAAY,GAAG,eAAe,CAAC,iBAAiB,CAAC,CAAC;gBAExD,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;gBAElD,KAAK,MAAM,CACT,KAAK,EACL,EAAE,IAAI,EAAE,eAAe,EAAE,EAC1B,IAAI,cAAc,CAAC,OAAO,EAAE,EAAE,CAAC;oBAC9B,MAAM,SAAS,GAAG,UAAU,CAAC,OAAO,CAAC,eAAe,CAAC,CAAC;oBAEtD,MAAM,YAAY,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBAE9C,OAAO,CAAC,MAAM,CAAC;wBACb,IAAI;wBACJ,SAAS,EAAE,eAAe;wBAC1B,IAAI,EAAE;4BACJ,QAAQ,EAAE,YAAY;4BACtB,SAAS,EAAE,SAAS;yBACrB;wBACD,GAAG,EAAE,CAAC,KAAK,EAAE,EAAE;4BACb,MAAM,WAAW,GAAG,kBAAkB,SAAS,GAAG,CAAC;4BAEnD,MAAM,WAAW,GACf,KAAK,KAAK,CAAC,IAAI,CAAC,YAAY;gCAC1B,CAAC,CAAC,gBAAgB,CAAC,KAAK,EAAE,OAAO,EAAE,iBAAiB,EAAE,CAAC,KAAK,CAAC,CAAC;gCAC9D,CAAC,CAAC,EAAE,CAAC;4BAET,OAAO,CAAC,GAAG,WAAW,EAAE,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,WAAW,CAAC,CAAC,CAAC;wBAChE,CAAC;qBACF,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;SACF,CAAC;IACJ,CAAC;IACD,cAAc,EAAE,EAAE;CACV,CAAC"}

package/dist/rules/prefer-arr-scan.d.mts

@@ -0,0 +1,96 @@
+import { type TSESLint } from '@typescript-eslint/utils';
+type Options = readonly [];
+type MessageIds = 'preferArrScanPrefix' | 'preferArrScanAccumulate';
+/**
+ * Report an accumulated value that is rebuilt from scratch for every element,
+ * and point at `Arr.scan` from ts-data-forge.
+ *
+ * ## Why
+ *
+ * Two shapes compute what `Arr.scan` computes — a value carried from one
+ * element to the next — by re-deriving it from the whole prefix each time.
+ *
+ * ```ts
+ * // (1) the prefix rebuilt per element: `slice` allocates, and the combining
+ * //     function runs over the whole prefix again. O(n²).
+ * segments.map((_, index) =>
+ *   path.resolve(root, ...segments.slice(0, index + 1)),
+ * );
+ *
+ * // one pass — and `scan` puts the initial value at the head of its result,
+ * // which here is exactly "the root, then each ancestor below it"
+ * Arr.scan(
+ *   segments,
+ *   (ancestor, segment) => path.resolve(ancestor, segment),
+ *   root,
+ * );
+ * ```
+ *
+ * ```ts
+ * // (2) the accumulator copied on every step, for the same O(n²)
+ * xs.reduce<readonly number[]>((acc, x) => [...acc, (acc.at(-1) ?? 0) + x], [0]);
+ *
+ * Arr.scan(xs, (total, x) => total + x, 0);
+ * ```
+ *
+ * The complexity is the smaller half of it. What the rebuilt form loses is the
+ * name of what is being accumulated: (1) says "for each index, combine
+ * everything up to it", and a reader has to turn that back into "carry a value
+ * along" before the code says what it does.
+ *
+ * ## Why only one of the two is fixed
+ *
+ * **(1) cannot be fixed at all**, and the obstacle is not difficulty. Turning
+ * `f(seed, ...xs.slice(0, i + 1))` into a `scan` is only valid if
+ * `f(seed, a, b, c) === f(f(f(seed, a), b), c)` — that the variadic callee is a
+ * left fold. That is a semantic property of the callee, invisible in the AST
+ * and in the type: `path.resolve` and `Math.max` have it, `Array.of` and
+ * `console.log` do not. Nothing static licenses the rewrite, so this shape is
+ * reported and left to a reader. The direction is a second obstacle —
+ * `slice(0, i + 1)` runs forwards while `slice(0, xs.length - i)` runs
+ * backwards and needs the result reversed — and the length a third, `scan`
+ * putting the initial value at the head where `map` has n elements.
+ *
+ * **(2) is fixed**, because none of those three apply to it: the combining
+ * function is the callback body itself, there is no slice and so no direction
+ * to infer, and the lengths already agree — a `reduce` seeded with `[init]`
+ * yields n+1 elements and so does `Arr.scan(xs, f, init)`.
+ *
+ * The fix is withheld unless every one of these holds, since each is what makes
+ * the two forms equal rather than merely similar:
+ *
+ * - the initial value is a one-element array literal `[E]`, so `scan`'s initial
+ *   value is `E`;
+ * - the body is exactly `[...acc, ELEMENT]` — one spread of the accumulator and
+ *   one new element, since `scan` appends exactly one value per step;
+ * - every other mention of the accumulator in `ELEMENT` is `acc.at(-1)`, and
+ *   there is at least one. `scan` hands its callback the previous *value*, not
+ *   the prefix, so `acc.length`, `acc[0]` or `acc.filter(...)` cannot be
+ *   expressed and block the fix. `at(-1)` is the only spelling substituted:
+ *   `Arr.last` returns an `Optional`, not the element, so it is not a
+ *   substitution at all;
+ * - the parameters are plain identifiers with no type annotations — an
+ *   annotation on the accumulator describes the array, and would be wrong on
+ *   `scan`'s value parameter — and there are at most three of them, `reduce`'s
+ *   fourth parameter (the whole array) having no counterpart in `scan`.
+ *
+ * `acc.at(-1)` is typed `T | undefined` while `scan`'s accumulator is `S`, so a
+ * `?? fallback` guarding it becomes redundant after the fix. It is left in
+ * place rather than removed: it evaluates identically either way, and deciding
+ * that it is dead needs to know that `S` excludes `undefined`, which is type
+ * information this rule does not take.
+ *
+ * ## What is not reported
+ *
+ * A `map` callback that reads its element parameter. Rebuilding a prefix *and*
+ * using the current element is not an accumulation spelled out the long way:
+ * `scan` hands its callback the accumulated value and the element, never the
+ * prefix, so such a callback is not one it can express.
+ *
+ * The array has to be spelled the same way in the `map` and in the `slice`.
+ * Deciding that two differently written expressions denote one array needs type
+ * information and would still be a guess about aliasing.
+ */
+export declare const preferArrScan: TSESLint.RuleModule<MessageIds, Options>;
+export {};
+//# sourceMappingURL=prefer-arr-scan.d.mts.map

package/dist/rules/prefer-arr-scan.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prefer-arr-scan.d.mts","sourceRoot":"","sources":["../../src/rules/prefer-arr-scan.mts"],"names":[],"mappings":"AAAA,OAAO,EAEL,KAAK,QAAQ,EAEd,MAAM,0BAA0B,CAAC;AAUlC,KAAK,OAAO,GAAG,SAAS,EAAE,CAAC;AAE3B,KAAK,UAAU,GAAG,qBAAqB,GAAG,yBAAyB,CAAC;AA+CpE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAyFG;AACH,eAAO,MAAM,aAAa,EAAE,QAAQ,CAAC,UAAU,CAAC,UAAU,EAAE,OAAO,CAwVzD,CAAC"}