eslint-plugin-ts-data-forge 0.2.0 → 0.3.0

package/dist/rules/prefer-canonical-array-slicing.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"prefer-canonical-array-slicing.mjs","sources":["../../src/rules/prefer-canonical-array-slicing.mts"],"sourcesContent":["import {\n  AST_NODE_TYPES,\n  ESLintUtils,\n  type TSESLint,\n  type TSESTree,\n} from '@typescript-eslint/utils';\nimport * as ts from 'typescript';\nimport {\n  buildImportFixes,\n  getImportedLocalName,\n  getTsDataForgeImport,\n} from './import-utils.mjs';\n\n/* eslint-disable @typescript-eslint/prefer-readonly-parameter-types */\n\ntype Options = readonly [];\n\ntype MessageIds = 'preferCanonicalArraySlicing';\n\n/**\n * A canonical ts-data-forge `Arr` operation a detected pattern is rewritten to:\n *\n * - `tail` / `butLast` — drop the first / last element\n * - `skip N` / `take N` — drop / keep the first `N` elements\n * - `skipLast N` / `takeLast N` — drop / keep the last `N` elements\n * - `toUnshifted item` / `toPushed item` — prepend / append one element\n *   (`toUnshifted` is emitted in its curried form `toUnshifted(item)(xs)` so\n *   the new element keeps the leading position it had in `[item, ...xs]`)\n */\ntype CopyOp = Readonly<\n  | { fn: 'butLast' | 'tail' }\n  | { fn: 'skip' | 'skipLast' | 'take' | 'takeLast'; count: number }\n  | { fn: 'toPushed' | 'toUnshifted'; itemText: string }\n>;\n\n/** `skip 1` / `skipLast 1` have dedicated single-element names. */\nconst normalizeCountedOp = (\n  fn: 'skip' | 'skipLast' | 'take' | 'takeLast',\n  count: number,\n): CopyOp | undefined =>\n  count < 1\n    ? undefined\n    : fn === 'skip' && count === 1\n      ? ({ fn: 'tail' } as const)\n      : fn === 'skipLast' && count === 1\n        ? ({ fn: 'butLast' } as const)\n        : ({ fn, count } as const);\n\nconst asNonNegativeIntegerLiteral = (\n  node: TSESTree.Node,\n): number | undefined =>\n  node.type === AST_NODE_TYPES.Literal &&\n  typeof node.value === 'number' &&\n  Number.isInteger(node.value) &&\n  node.value >= 0\n    ? node.value\n    : undefined;\n\n/** Matches `-N` (unary minus of a positive integer literal) and returns `N`. */\nconst asNegatedPositiveIntegerLiteral = (\n  node: TSESTree.Node,\n): number | undefined => {\n  if (\n    node.type !== AST_NODE_TYPES.UnaryExpression ||\n    node.operator !== '-' ||\n    node.argument.type !== AST_NODE_TYPES.Literal\n  ) {\n    return undefined;\n  }\n\n  const n = asNonNegativeIntegerLiteral(node.argument);\n\n  return n !== undefined && n >= 1 ? n : undefined;\n};\n\n/**\n * Whether re-reading the expression is free of side effects (a plain variable\n * or a non-computed property chain). Required for patterns that reference the\n * receiver twice, such as `xs.filter((_, i) => i < xs.length - 1)`.\n */\nconst isSimpleReference = (node: TSESTree.Node): boolean =>\n  node.type === AST_NODE_TYPES.Identifier ||\n  node.type === AST_NODE_TYPES.ThisExpression ||\n  (node.type === AST_NODE_TYPES.MemberExpression &&\n    !node.computed &&\n    node.property.type === AST_NODE_TYPES.Identifier &&\n    isSimpleReference(node.object));\n\nconst rootIdentifierName = (node: TSESTree.Node): string | undefined =>\n  node.type === AST_NODE_TYPES.Identifier\n    ? node.name\n    : node.type === AST_NODE_TYPES.MemberExpression\n      ? rootIdentifierName(node.object)\n      : undefined;\n\ntype ComparisonOperator = '!==' | '<' | '<=' | '>' | '>=';\n\nconst COMPARISON_OPERATORS: ReadonlySet<string> = new Set([\n  '!==',\n  '<',\n  '<=',\n  '>',\n  '>=',\n] as const satisfies readonly ComparisonOperator[]);\n\n/** Mirror of each comparison when its operands are swapped. */\nconst FLIPPED_OPERATORS = {\n  '!==': '!==',\n  '<': '>',\n  '<=': '>=',\n  '>': '<',\n  '>=': '<=',\n} as const satisfies Record<ComparisonOperator, ComparisonOperator>;\n\n/** Classifies `index OP N` (a comparison against an integer literal). */\nconst classifyLiteralComparison = (\n  op: ComparisonOperator,\n  n: number,\n): CopyOp | undefined => {\n  switch (op) {\n    case '>=':\n      return normalizeCountedOp('skip', n);\n\n    case '>':\n      return normalizeCountedOp('skip', n + 1);\n\n    case '!==':\n      return n === 0 ? { fn: 'tail' } : undefined;\n\n    case '<':\n      return normalizeCountedOp('take', n);\n\n    case '<=':\n      return normalizeCountedOp('take', n + 1);\n  }\n};\n\n/** Classifies `index OP <xs>.length - M`. */\nconst classifyLengthComparison = (\n  op: ComparisonOperator,\n  m: number,\n): CopyOp | undefined => {\n  switch (op) {\n    case '<':\n      return normalizeCountedOp('skipLast', m);\n\n    case '<=':\n      return normalizeCountedOp('skipLast', m - 1);\n\n    case '!==':\n      return m === 1 ? { fn: 'butLast' } : undefined;\n\n    case '>=':\n      return normalizeCountedOp('takeLast', m);\n\n    case '>':\n      return normalizeCountedOp('takeLast', m - 1);\n  }\n};\n\nexport const preferCanonicalArraySlicing: TSESLint.RuleModule<\n  MessageIds,\n  Options\n> = {\n  meta: {\n    type: 'suggestion',\n    docs: {\n      description:\n        'Unify non-mutating array element addition/removal patterns (`slice` / `toSpliced` / `filter` / `concat` / spread) into the corresponding ts-data-forge functions: `Arr.tail`, `Arr.skip`, `Arr.take`, `Arr.butLast`, `Arr.skipLast`, `Arr.takeLast`, `Arr.toUnshifted`, `Arr.toPushed`.',\n    },\n    fixable: 'code',\n    schema: [],\n    messages: {\n      preferCanonicalArraySlicing:\n        'Replace with `{{replacement}}` 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 parserServices = ESLintUtils.getParserServices(context);\n\n    const checker = parserServices.program.getTypeChecker();\n\n    /**\n     * The in-scope way to reference the `Arr` namespace: a named import\n     * (possibly aliased), a namespace import member, or the canonical `Arr`\n     * (added by the import fix when nothing is imported yet).\n     */\n    const arrLocalName = getImportedLocalName(tsDataForgeImport, 'Arr');\n\n    const namespaceLocalName = tsDataForgeImport?.specifiers.find(\n      (specifier) => specifier.type === AST_NODE_TYPES.ImportNamespaceSpecifier,\n    )?.local.name;\n\n    const arrRef =\n      arrLocalName ??\n      (namespaceLocalName === undefined ? 'Arr' : `${namespaceLocalName}.Arr`);\n\n    const needsArrImport =\n      arrLocalName === undefined && namespaceLocalName === undefined;\n\n    /**\n     * Deferred (non-concrete) types are reduced to their base constraint\n     * before checking; `any` / `unknown` are conservatively not array-like.\n     */\n    const isArrayOrTupleType = (type: ts.Type): boolean => {\n      if ((type.flags & (ts.TypeFlags.Any | ts.TypeFlags.Unknown)) !== 0) {\n        return false;\n      }\n\n      if (type.isUnion()) {\n        return type.types.every(isArrayOrTupleType);\n      }\n\n      if (\n        (type.flags &\n          (ts.TypeFlags.TypeParameter |\n            ts.TypeFlags.IndexedAccess |\n            ts.TypeFlags.Conditional |\n            ts.TypeFlags.Substitution)) !==\n        0\n      ) {\n        const constraint = checker.getBaseConstraintOfType(type);\n\n        return constraint !== undefined && isArrayOrTupleType(constraint);\n      }\n\n      return checker.isArrayType(type) || checker.isTupleType(type);\n    };\n\n    const getTypeOf = (node: TSESTree.Node): ts.Type =>\n      checker.getTypeAtLocation(parserServices.esTreeNodeToTSNodeMap.get(node));\n\n    /**\n     * `true` only when the type can never be an array in any branch, so\n     * `xs.concat(v)` is guaranteed to append `v` as one element rather than\n     * flattening it.\n     */\n    const isDefinitelyNotArrayType = (type: ts.Type): boolean => {\n      if ((type.flags & (ts.TypeFlags.Any | ts.TypeFlags.Unknown)) !== 0) {\n        return false;\n      }\n\n      if (type.isUnion()) {\n        return type.types.every(isDefinitelyNotArrayType);\n      }\n\n      if (\n        (type.flags &\n          (ts.TypeFlags.TypeParameter |\n            ts.TypeFlags.IndexedAccess |\n            ts.TypeFlags.Conditional |\n            ts.TypeFlags.Substitution)) !==\n        0\n      ) {\n        const constraint = checker.getBaseConstraintOfType(type);\n\n        return constraint !== undefined && isDefinitelyNotArrayType(constraint);\n      }\n\n      return !checker.isArrayType(type) && !checker.isTupleType(type);\n    };\n\n    /** Argument-position text; a comma (sequence) expression needs parens. */\n    const toArgText = (node: TSESTree.Node): string => {\n      const text = sourceCode.getText(node);\n\n      return node.type === AST_NODE_TYPES.SequenceExpression\n        ? `(${text})`\n        : text;\n    };\n\n    const toReplacementText = (op: CopyOp, xsText: string): string => {\n      switch (op.fn) {\n        case 'tail':\n        case 'butLast':\n          return `${arrRef}.${op.fn}(${xsText})`;\n\n        case 'skip':\n        case 'take':\n        case 'skipLast':\n        case 'takeLast':\n          return `${arrRef}.${op.fn}(${xsText}, ${op.count})`;\n\n        // Emit the curried form for `toUnshifted` so the new element stays in\n        // the same textual position as in the `[item, ...xs]` source, keeping\n        // the rewrite easy to read.\n        case 'toUnshifted':\n          return `${arrRef}.toUnshifted(${op.itemText})(${xsText})`;\n\n        case 'toPushed':\n          return `${arrRef}.toPushed(${xsText}, ${op.itemText})`;\n      }\n    };\n\n    const mut_nodesToFix: {\n      node: TSESTree.Node;\n      replacement: string;\n    }[] = [];\n\n    const report = (node: TSESTree.Node, op: CopyOp, xsText: string): void => {\n      mut_nodesToFix.push({\n        node,\n        replacement: toReplacementText(op, xsText),\n      });\n    };\n\n    /** Matches `<xsText>.length` (non-computed). */\n    const isReceiverLengthAccess = (\n      node: TSESTree.Node,\n      receiverText: string,\n    ): boolean =>\n      node.type === AST_NODE_TYPES.MemberExpression &&\n      !node.computed &&\n      node.property.type === AST_NODE_TYPES.Identifier &&\n      node.property.name === 'length' &&\n      sourceCode.getText(node.object) === receiverText;\n\n    /** Matches `<xsText>.length - M` (M ≥ 1) and returns `M`. */\n    const matchLengthMinus = (\n      node: TSESTree.Node,\n      receiverText: string,\n    ): number | undefined => {\n      if (\n        node.type !== AST_NODE_TYPES.BinaryExpression ||\n        node.operator !== '-' ||\n        !isReceiverLengthAccess(node.left, receiverText)\n      ) {\n        return undefined;\n      }\n\n      const m = asNonNegativeIntegerLiteral(node.right);\n\n      return m !== undefined && m >= 1 ? m : undefined;\n    };\n\n    /**\n     * Matches an index-only filter callback (`(_, i) => <comparison>`) and\n     * classifies the comparison. Both a leading index (`i >= 1`) and a\n     * trailing index (`1 <= i`) operand order are accepted.\n     */\n    const classifyFilterCallback = (\n      callback: TSESTree.CallExpressionArgument,\n      receiver: TSESTree.Expression,\n      receiverText: string,\n    ): CopyOp | undefined => {\n      if (\n        callback.type !== AST_NODE_TYPES.ArrowFunctionExpression ||\n        callback.async ||\n        callback.body.type === AST_NODE_TYPES.BlockStatement ||\n        callback.params.length !== 2\n      ) {\n        return undefined;\n      }\n\n      const [elementParam, indexParam] = callback.params;\n\n      if (\n        elementParam === undefined ||\n        indexParam === undefined ||\n        elementParam.type !== AST_NODE_TYPES.Identifier ||\n        indexParam.type !== AST_NODE_TYPES.Identifier\n      ) {\n        return undefined;\n      }\n\n      // A callback parameter shadowing the receiver's root binding (e.g.\n      // `xs.filter((xs, i) => i < xs.length - 1)`) would make the textual\n      // `xs.length` comparison refer to the element, not the receiver.\n      const receiverRoot = rootIdentifierName(receiver);\n\n      if (\n        receiverRoot !== undefined &&\n        (elementParam.name === receiverRoot || indexParam.name === receiverRoot)\n      ) {\n        return undefined;\n      }\n\n      const body = callback.body;\n\n      if (\n        body.type !== AST_NODE_TYPES.BinaryExpression ||\n        !COMPARISON_OPERATORS.has(body.operator)\n      ) {\n        return undefined;\n      }\n\n      // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n      const rawOperator = body.operator as ComparisonOperator;\n\n      const isIndex = (side: TSESTree.Node): boolean =>\n        side.type === AST_NODE_TYPES.Identifier &&\n        side.name === indexParam.name;\n\n      const [op, other] = isIndex(body.left)\n        ? ([rawOperator, body.right] as const)\n        : isIndex(body.right)\n          ? ([FLIPPED_OPERATORS[rawOperator], body.left] as const)\n          : [undefined, undefined];\n\n      // `op` and `other` are set together (both from the same tuple), so\n      // checking `op` also guarantees `other` is defined.\n      if (op === undefined || isIndex(other)) {\n        return undefined;\n      }\n\n      // The element parameter must not participate in the comparison (only\n      // the index side and a receiver-independent bound are recognized, so\n      // reaching here with an element reference is impossible for literals,\n      // but `xs.length - N` needs a stable receiver).\n      const n = asNonNegativeIntegerLiteral(other);\n\n      if (n !== undefined) {\n        return classifyLiteralComparison(op, n);\n      }\n\n      if (!isSimpleReference(receiver)) return undefined;\n\n      const m = matchLengthMinus(other, receiverText);\n\n      return m === undefined ? undefined : classifyLengthComparison(op, m);\n    };\n\n    const classifySliceArgs = (\n      args: readonly TSESTree.CallExpressionArgument[],\n      receiver: TSESTree.Expression,\n    ): CopyOp | undefined => {\n      if (args.length === 1) {\n        const [start] = args;\n\n        if (start === undefined) return undefined;\n\n        const n = asNonNegativeIntegerLiteral(start);\n\n        if (n !== undefined) return normalizeCountedOp('skip', n);\n\n        const negated = asNegatedPositiveIntegerLiteral(start);\n\n        return negated === undefined\n          ? undefined\n          : normalizeCountedOp('takeLast', negated);\n      }\n\n      if (args.length === 2) {\n        const [start, end] = args;\n\n        if (\n          start === undefined ||\n          end === undefined ||\n          asNonNegativeIntegerLiteral(start) !== 0\n        ) {\n          return undefined;\n        }\n\n        const n = asNonNegativeIntegerLiteral(end);\n\n        if (n !== undefined) return normalizeCountedOp('take', n);\n\n        const negated = asNegatedPositiveIntegerLiteral(end);\n\n        if (negated !== undefined) {\n          return normalizeCountedOp('skipLast', negated);\n        }\n\n        if (!isSimpleReference(receiver)) return undefined;\n\n        const m = matchLengthMinus(end, sourceCode.getText(receiver));\n\n        return m === undefined ? undefined : normalizeCountedOp('skipLast', m);\n      }\n\n      return undefined;\n    };\n\n    const classifyToSplicedArgs = (\n      args: readonly TSESTree.CallExpressionArgument[],\n      receiver: TSESTree.Expression,\n      receiverText: string,\n    ): CopyOp | undefined => {\n      if (args.length === 1) {\n        const [start] = args;\n\n        if (start === undefined) return undefined;\n\n        const n = asNonNegativeIntegerLiteral(start);\n\n        // `xs.toSpliced(N)` removes everything from index N on → take N.\n        if (n !== undefined) return normalizeCountedOp('take', n);\n\n        const negated = asNegatedPositiveIntegerLiteral(start);\n\n        // `xs.toSpliced(-N)` removes the last N elements → skipLast N.\n        return negated === undefined\n          ? undefined\n          : normalizeCountedOp('skipLast', negated);\n      }\n\n      if (args.length === 2) {\n        const [start, deleteCount] = args;\n\n        if (\n          start === undefined ||\n          deleteCount === undefined ||\n          asNonNegativeIntegerLiteral(start) !== 0\n        ) {\n          return undefined;\n        }\n\n        // `xs.toSpliced(0, N)` removes the first N elements → skip N.\n        const n = asNonNegativeIntegerLiteral(deleteCount);\n\n        if (n !== undefined) return normalizeCountedOp('skip', n);\n\n        // `xs.toSpliced(0, xs.length - N)` keeps the last N → takeLast N.\n        // (Note: `xs.toSpliced(0, -N)` clamps the delete count to 0 and is a\n        // plain copy, so it is deliberately NOT treated as takeLast.)\n        if (!isSimpleReference(receiver)) return undefined;\n\n        const m = matchLengthMinus(deleteCount, receiverText);\n\n        return m === undefined ? undefined : normalizeCountedOp('takeLast', m);\n      }\n\n      if (args.length === 3) {\n        const [start, deleteCount, item] = args;\n\n        if (\n          start === undefined ||\n          deleteCount === undefined ||\n          item === undefined ||\n          item.type === AST_NODE_TYPES.SpreadElement ||\n          asNonNegativeIntegerLiteral(deleteCount) !== 0\n        ) {\n          return undefined;\n        }\n\n        // `xs.toSpliced(0, 0, item)` prepends → toUnshifted.\n        if (asNonNegativeIntegerLiteral(start) === 0) {\n          return { fn: 'toUnshifted', itemText: toArgText(item) };\n        }\n\n        // `xs.toSpliced(xs.length, 0, item)` appends → toPushed.\n        if (\n          isSimpleReference(receiver) &&\n          isReceiverLengthAccess(start, receiverText)\n        ) {\n          return { fn: 'toPushed', itemText: toArgText(item) };\n        }\n\n        return undefined;\n      }\n\n      return undefined;\n    };\n\n    return {\n      CallExpression: (node) => {\n        const callee = node.callee;\n\n        if (\n          callee.type !== AST_NODE_TYPES.MemberExpression ||\n          callee.computed ||\n          callee.property.type !== AST_NODE_TYPES.Identifier\n        ) {\n          return;\n        }\n\n        const methodName = callee.property.name;\n\n        const receiver = callee.object;\n\n        // `Arr.skip(xs, 1)` → `Arr.tail(xs)`, `Arr.skipLast(xs, 1)` →\n        // `Arr.butLast(xs)` (also via a namespace import or an alias).\n        if (methodName === 'skip' || methodName === 'skipLast') {\n          const isArrObject =\n            (receiver.type === AST_NODE_TYPES.Identifier &&\n              receiver.name === arrLocalName) ||\n            (receiver.type === AST_NODE_TYPES.MemberExpression &&\n              !receiver.computed &&\n              receiver.object.type === AST_NODE_TYPES.Identifier &&\n              receiver.object.name === namespaceLocalName &&\n              receiver.property.type === AST_NODE_TYPES.Identifier &&\n              receiver.property.name === 'Arr');\n\n          const [arrayArg, countArg] = node.arguments;\n\n          if (\n            isArrObject &&\n            node.arguments.length === 2 &&\n            arrayArg !== undefined &&\n            arrayArg.type !== AST_NODE_TYPES.SpreadElement &&\n            countArg !== undefined &&\n            asNonNegativeIntegerLiteral(countArg) === 1\n          ) {\n            report(\n              node,\n              { fn: methodName === 'skip' ? 'tail' : 'butLast' },\n              toArgText(arrayArg),\n            );\n          }\n\n          return;\n        }\n\n        // `[item].concat(xs)` → `Arr.toUnshifted(xs, item)`.\n        if (\n          methodName === 'concat' &&\n          receiver.type === AST_NODE_TYPES.ArrayExpression\n        ) {\n          const [element] = receiver.elements;\n\n          const [arg] = node.arguments;\n\n          if (\n            receiver.elements.length === 1 &&\n            element !== null &&\n            element !== undefined &&\n            element.type !== AST_NODE_TYPES.SpreadElement &&\n            node.arguments.length === 1 &&\n            arg !== undefined &&\n            arg.type !== AST_NODE_TYPES.SpreadElement &&\n            isArrayOrTupleType(getTypeOf(arg))\n          ) {\n            report(\n              node,\n              { fn: 'toUnshifted', itemText: toArgText(element) },\n              toArgText(arg),\n            );\n          }\n\n          return;\n        }\n\n        if (\n          methodName !== 'slice' &&\n          methodName !== 'toSpliced' &&\n          methodName !== 'filter' &&\n          methodName !== 'concat'\n        ) {\n          return;\n        }\n\n        // The receiver must be an array or tuple (not a string / typed array\n        // / other object that happens to share the method name).\n        if (!isArrayOrTupleType(getTypeOf(receiver))) return;\n\n        const receiverText = sourceCode.getText(receiver);\n\n        switch (methodName) {\n          case 'slice': {\n            const op = classifySliceArgs(node.arguments, receiver);\n\n            if (op !== undefined) report(node, op, toArgText(receiver));\n\n            return;\n          }\n\n          case 'toSpliced': {\n            const op = classifyToSplicedArgs(\n              node.arguments,\n              receiver,\n              receiverText,\n            );\n\n            if (op !== undefined) report(node, op, toArgText(receiver));\n\n            return;\n          }\n\n          case 'filter': {\n            const [callback] = node.arguments;\n\n            if (callback === undefined || node.arguments.length !== 1) {\n              return;\n            }\n\n            const op = classifyFilterCallback(callback, receiver, receiverText);\n\n            if (op !== undefined) report(node, op, toArgText(receiver));\n\n            return;\n          }\n\n          case 'concat': {\n            const [arg] = node.arguments;\n\n            if (\n              node.arguments.length !== 1 ||\n              arg === undefined ||\n              arg.type === AST_NODE_TYPES.SpreadElement\n            ) {\n              return;\n            }\n\n            // `xs.concat([item])` → `Arr.toPushed(xs, item)`.\n            if (arg.type === AST_NODE_TYPES.ArrayExpression) {\n              const [element] = arg.elements;\n\n              if (\n                arg.elements.length === 1 &&\n                element !== null &&\n                element !== undefined &&\n                element.type !== AST_NODE_TYPES.SpreadElement\n              ) {\n                report(\n                  node,\n                  { fn: 'toPushed', itemText: toArgText(element) },\n                  toArgText(receiver),\n                );\n              }\n\n              return;\n            }\n\n            // `xs.concat(item)` appends only when `item` can never be an\n            // array (otherwise `concat` would flatten it).\n            if (isDefinitelyNotArrayType(getTypeOf(arg))) {\n              report(\n                node,\n                { fn: 'toPushed', itemText: toArgText(arg) },\n                toArgText(receiver),\n              );\n            }\n          }\n        }\n      },\n\n      ArrayExpression: (node) => {\n        // `[item, ...xs]` → `Arr.toUnshifted(xs, item)`,\n        // `[...xs, item]` → `Arr.toPushed(xs, item)`.\n        if (node.elements.length !== 2) return;\n\n        const [first, second] = node.elements;\n\n        if (\n          first === null ||\n          first === undefined ||\n          second === null ||\n          second === undefined\n        ) {\n          return;\n        }\n\n        const [spread, item, fn] =\n          first.type === AST_NODE_TYPES.SpreadElement &&\n          second.type !== AST_NODE_TYPES.SpreadElement\n            ? ([first, second, 'toPushed'] as const)\n            : first.type !== AST_NODE_TYPES.SpreadElement &&\n                second.type === AST_NODE_TYPES.SpreadElement\n              ? ([second, first, 'toUnshifted'] as const)\n              : [undefined, undefined, undefined];\n\n        // `spread`, `item`, and `fn` are set together (all from the same\n        // tuple), so checking `spread` also guarantees the others are\n        // defined.\n        if (spread === undefined) return;\n\n        // Spreading a non-array iterable (`[v, ...someSet]`) is a genuine\n        // conversion, not an element addition to an array.\n        if (!isArrayOrTupleType(getTypeOf(spread.argument))) return;\n\n        report(\n          node,\n          { fn, itemText: toArgText(item) },\n          toArgText(spread.argument),\n        );\n      },\n\n      'Program:exit': () => {\n        for (const [index, nodeInfo] of mut_nodesToFix.entries()) {\n          context.report({\n            node: nodeInfo.node,\n            messageId: 'preferCanonicalArraySlicing',\n            data: { replacement: nodeInfo.replacement },\n            fix: (fixer) => {\n              const importFixes =\n                index === 0 && needsArrImport\n                  ? buildImportFixes(fixer, program, tsDataForgeImport, ['Arr'])\n                  : [];\n\n              return [\n                ...importFixes,\n                fixer.replaceText(nodeInfo.node, nodeInfo.replacement),\n              ];\n            },\n          });\n        }\n      },\n    };\n  },\n  defaultOptions: [],\n} as const;\n\n/* eslint-enable @typescript-eslint/prefer-readonly-parameter-types */\n"],"names":[],"mappings":";;;;AAoCA,MAAM,kBAAA,GAAqB,CACzB,EAAA,EACA,KAAA,KAEA,KAAA,GAAQ,IACJ,MAAA,GACA,EAAA,KAAO,MAAA,IAAU,KAAA,KAAU,CAAA,GACxB,EAAE,IAAI,MAAA,EAAO,GACd,EAAA,KAAO,UAAA,IAAc,KAAA,KAAU,CAAA,GAC5B,EAAE,EAAA,EAAI,SAAA,EAAU,GAChB,EAAE,EAAA,EAAI,KAAA,EAAM;AAEvB,MAAM,2BAAA,GAA8B,CAClC,IAAA,KAEA,IAAA,CAAK,SAAS,cAAA,CAAe,OAAA,IAC7B,OAAO,IAAA,CAAK,KAAA,KAAU,YACtB,MAAA,CAAO,SAAA,CAAU,KAAK,KAAK,CAAA,IAC3B,KAAK,KAAA,IAAS,CAAA,GACV,KAAK,KAAA,GACL,MAAA;AAGN,MAAM,+BAAA,GAAkC,CACtC,IAAA,KACuB;AACvB,EAAA,IACE,IAAA,CAAK,IAAA,KAAS,cAAA,CAAe,eAAA,IAC7B,IAAA,CAAK,QAAA,KAAa,GAAA,IAClB,IAAA,CAAK,QAAA,CAAS,IAAA,KAAS,cAAA,CAAe,OAAA,EACtC;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,CAAA,GAAI,2BAAA,CAA4B,IAAA,CAAK,QAAQ,CAAA;AAEnD,EAAA,OAAO,CAAA,KAAM,MAAA,IAAa,CAAA,IAAK,CAAA,GAAI,CAAA,GAAI,MAAA;AACzC,CAAA;AAOA,MAAM,iBAAA,GAAoB,CAAC,IAAA,KACzB,IAAA,CAAK,IAAA,KAAS,eAAe,UAAA,IAC7B,IAAA,CAAK,IAAA,KAAS,cAAA,CAAe,cAAA,IAC5B,IAAA,CAAK,SAAS,cAAA,CAAe,gBAAA,IAC5B,CAAC,IAAA,CAAK,QAAA,IACN,IAAA,CAAK,QAAA,CAAS,IAAA,KAAS,cAAA,CAAe,UAAA,IACtC,iBAAA,CAAkB,IAAA,CAAK,MAAM,CAAA;AAEjC,MAAM,qBAAqB,CAAC,IAAA,KAC1B,IAAA,CAAK,IAAA,KAAS,eAAe,UAAA,GACzB,IAAA,CAAK,IAAA,GACL,IAAA,CAAK,SAAS,cAAA,CAAe,gBAAA,GAC3B,kBAAA,CAAmB,IAAA,CAAK,MAAM,CAAA,GAC9B,MAAA;AAIR,MAAM,oBAAA,uBAAgD,GAAA,CAAI;AAAA,EACxD,KAAA;AAAA,EACA,GAAA;AAAA,EACA,IAAA;AAAA,EACA,GAAA;AAAA,EACA;AACF,CAAkD,CAAA;AAGlD,MAAM,iBAAA,GAAoB;AAAA,EACxB,KAAA,EAAO,KAAA;AAAA,EACP,GAAA,EAAK,GAAA;AAAA,EACL,IAAA,EAAM,IAAA;AAAA,EACN,GAAA,EAAK,GAAA;AAAA,EACL,IAAA,EAAM;AACR,CAAA;AAGA,MAAM,yBAAA,GAA4B,CAChC,EAAA,EACA,CAAA,KACuB;AACvB,EAAA,QAAQ,EAAA;AAAI,IACV,KAAK,IAAA;AACH,MAAA,OAAO,kBAAA,CAAmB,QAAQ,CAAC,CAAA;AAAA,IAErC,KAAK,GAAA;AACH,MAAA,OAAO,kBAAA,CAAmB,MAAA,EAAQ,CAAA,GAAI,CAAC,CAAA;AAAA,IAEzC,KAAK,KAAA;AACH,MAAA,OAAO,CAAA,KAAM,CAAA,GAAI,EAAE,EAAA,EAAI,QAAO,GAAI,MAAA;AAAA,IAEpC,KAAK,GAAA;AACH,MAAA,OAAO,kBAAA,CAAmB,QAAQ,CAAC,CAAA;AAAA,IAErC,KAAK,IAAA;AACH,MAAA,OAAO,kBAAA,CAAmB,MAAA,EAAQ,CAAA,GAAI,CAAC,CAAA;AAAA;AAE7C,CAAA;AAGA,MAAM,wBAAA,GAA2B,CAC/B,EAAA,EACA,CAAA,KACuB;AACvB,EAAA,QAAQ,EAAA;AAAI,IACV,KAAK,GAAA;AACH,MAAA,OAAO,kBAAA,CAAmB,YAAY,CAAC,CAAA;AAAA,IAEzC,KAAK,IAAA;AACH,MAAA,OAAO,kBAAA,CAAmB,UAAA,EAAY,CAAA,GAAI,CAAC,CAAA;AAAA,IAE7C,KAAK,KAAA;AACH,MAAA,OAAO,CAAA,KAAM,CAAA,GAAI,EAAE,EAAA,EAAI,WAAU,GAAI,MAAA;AAAA,IAEvC,KAAK,IAAA;AACH,MAAA,OAAO,kBAAA,CAAmB,YAAY,CAAC,CAAA;AAAA,IAEzC,KAAK,GAAA;AACH,MAAA,OAAO,kBAAA,CAAmB,UAAA,EAAY,CAAA,GAAI,CAAC,CAAA;AAAA;AAEjD,CAAA;AAEO,MAAM,2BAAA,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,2BAAA,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,cAAA,GAAiB,WAAA,CAAY,iBAAA,CAAkB,OAAO,CAAA;AAE5D,IAAA,MAAM,OAAA,GAAU,cAAA,CAAe,OAAA,CAAQ,cAAA,EAAe;AAOtD,IAAA,MAAM,YAAA,GAAe,oBAAA,CAAqB,iBAAA,EAAmB,KAAK,CAAA;AAElE,IAAA,MAAM,kBAAA,GAAqB,mBAAmB,UAAA,CAAW,IAAA;AAAA,MACvD,CAAC,SAAA,KAAc,SAAA,CAAU,IAAA,KAAS,cAAA,CAAe;AAAA,OAChD,KAAA,CAAM,IAAA;AAET,IAAA,MAAM,SACJ,YAAA,KACC,kBAAA,KAAuB,MAAA,GAAY,KAAA,GAAQ,GAAG,kBAAkB,CAAA,IAAA,CAAA,CAAA;AAEnE,IAAA,MAAM,cAAA,GACJ,YAAA,KAAiB,MAAA,IAAa,kBAAA,KAAuB,MAAA;AAMvD,IAAA,MAAM,kBAAA,GAAqB,CAAC,IAAA,KAA2B;AACrD,MAAA,IAAA,CAAK,IAAA,CAAK,SAAS,EAAA,CAAG,SAAA,CAAU,MAAM,EAAA,CAAG,SAAA,CAAU,cAAc,CAAA,EAAG;AAClE,QAAA,OAAO,KAAA;AAAA,MACT;AAEA,MAAA,IAAI,IAAA,CAAK,SAAQ,EAAG;AAClB,QAAA,OAAO,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,kBAAkB,CAAA;AAAA,MAC5C;AAEA,MAAA,IAAA,CACG,IAAA,CAAK,KAAA,IACH,EAAA,CAAG,SAAA,CAAU,gBACZ,EAAA,CAAG,SAAA,CAAU,aAAA,GACb,EAAA,CAAG,SAAA,CAAU,WAAA,GACb,EAAA,CAAG,SAAA,CAAU,mBACjB,CAAA,EACA;AACA,QAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,uBAAA,CAAwB,IAAI,CAAA;AAEvD,QAAA,OAAO,UAAA,KAAe,MAAA,IAAa,kBAAA,CAAmB,UAAU,CAAA;AAAA,MAClE;AAEA,MAAA,OAAO,QAAQ,WAAA,CAAY,IAAI,CAAA,IAAK,OAAA,CAAQ,YAAY,IAAI,CAAA;AAAA,IAC9D,CAAA;AAEA,IAAA,MAAM,SAAA,GAAY,CAAC,IAAA,KACjB,OAAA,CAAQ,kBAAkB,cAAA,CAAe,qBAAA,CAAsB,GAAA,CAAI,IAAI,CAAC,CAAA;AAO1E,IAAA,MAAM,wBAAA,GAA2B,CAAC,IAAA,KAA2B;AAC3D,MAAA,IAAA,CAAK,IAAA,CAAK,SAAS,EAAA,CAAG,SAAA,CAAU,MAAM,EAAA,CAAG,SAAA,CAAU,cAAc,CAAA,EAAG;AAClE,QAAA,OAAO,KAAA;AAAA,MACT;AAEA,MAAA,IAAI,IAAA,CAAK,SAAQ,EAAG;AAClB,QAAA,OAAO,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,wBAAwB,CAAA;AAAA,MAClD;AAEA,MAAA,IAAA,CACG,IAAA,CAAK,KAAA,IACH,EAAA,CAAG,SAAA,CAAU,gBACZ,EAAA,CAAG,SAAA,CAAU,aAAA,GACb,EAAA,CAAG,SAAA,CAAU,WAAA,GACb,EAAA,CAAG,SAAA,CAAU,mBACjB,CAAA,EACA;AACA,QAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,uBAAA,CAAwB,IAAI,CAAA;AAEvD,QAAA,OAAO,UAAA,KAAe,MAAA,IAAa,wBAAA,CAAyB,UAAU,CAAA;AAAA,MACxE;AAEA,MAAA,OAAO,CAAC,QAAQ,WAAA,CAAY,IAAI,KAAK,CAAC,OAAA,CAAQ,YAAY,IAAI,CAAA;AAAA,IAChE,CAAA;AAGA,IAAA,MAAM,SAAA,GAAY,CAAC,IAAA,KAAgC;AACjD,MAAA,MAAM,IAAA,GAAO,UAAA,CAAW,OAAA,CAAQ,IAAI,CAAA;AAEpC,MAAA,OAAO,KAAK,IAAA,KAAS,cAAA,CAAe,kBAAA,GAChC,CAAA,CAAA,EAAI,IAAI,CAAA,CAAA,CAAA,GACR,IAAA;AAAA,IACN,CAAA;AAEA,IAAA,MAAM,iBAAA,GAAoB,CAAC,EAAA,EAAY,MAAA,KAA2B;AAChE,MAAA,QAAQ,GAAG,EAAA;AAAI,QACb,KAAK,MAAA;AAAA,QACL,KAAK,SAAA;AACH,UAAA,OAAO,GAAG,MAAM,CAAA,CAAA,EAAI,EAAA,CAAG,EAAE,IAAI,MAAM,CAAA,CAAA,CAAA;AAAA,QAErC,KAAK,MAAA;AAAA,QACL,KAAK,MAAA;AAAA,QACL,KAAK,UAAA;AAAA,QACL,KAAK,UAAA;AACH,UAAA,OAAO,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,EAAA,CAAG,EAAE,CAAA,CAAA,EAAI,MAAM,CAAA,EAAA,EAAK,EAAA,CAAG,KAAK,CAAA,CAAA,CAAA;AAAA;AAAA;AAAA;AAAA,QAKlD,KAAK,aAAA;AACH,UAAA,OAAO,GAAG,MAAM,CAAA,aAAA,EAAgB,EAAA,CAAG,QAAQ,KAAK,MAAM,CAAA,CAAA,CAAA;AAAA,QAExD,KAAK,UAAA;AACH,UAAA,OAAO,GAAG,MAAM,CAAA,UAAA,EAAa,MAAM,CAAA,EAAA,EAAK,GAAG,QAAQ,CAAA,CAAA,CAAA;AAAA;AACvD,IACF,CAAA;AAEA,IAAA,MAAM,iBAGA,EAAC;AAEP,IAAA,MAAM,MAAA,GAAS,CAAC,IAAA,EAAqB,EAAA,EAAY,MAAA,KAAyB;AACxE,MAAA,cAAA,CAAe,IAAA,CAAK;AAAA,QAClB,IAAA;AAAA,QACA,WAAA,EAAa,iBAAA,CAAkB,EAAA,EAAI,MAAM;AAAA,OAC1C,CAAA;AAAA,IACH,CAAA;AAGA,IAAA,MAAM,sBAAA,GAAyB,CAC7B,IAAA,EACA,YAAA,KAEA,IAAA,CAAK,SAAS,cAAA,CAAe,gBAAA,IAC7B,CAAC,IAAA,CAAK,QAAA,IACN,IAAA,CAAK,SAAS,IAAA,KAAS,cAAA,CAAe,UAAA,IACtC,IAAA,CAAK,QAAA,CAAS,IAAA,KAAS,YACvB,UAAA,CAAW,OAAA,CAAQ,IAAA,CAAK,MAAM,CAAA,KAAM,YAAA;AAGtC,IAAA,MAAM,gBAAA,GAAmB,CACvB,IAAA,EACA,YAAA,KACuB;AACvB,MAAA,IACE,IAAA,CAAK,IAAA,KAAS,cAAA,CAAe,gBAAA,IAC7B,IAAA,CAAK,QAAA,KAAa,GAAA,IAClB,CAAC,sBAAA,CAAuB,IAAA,CAAK,IAAA,EAAM,YAAY,CAAA,EAC/C;AACA,QAAA,OAAO,MAAA;AAAA,MACT;AAEA,MAAA,MAAM,CAAA,GAAI,2BAAA,CAA4B,IAAA,CAAK,KAAK,CAAA;AAEhD,MAAA,OAAO,CAAA,KAAM,MAAA,IAAa,CAAA,IAAK,CAAA,GAAI,CAAA,GAAI,MAAA;AAAA,IACzC,CAAA;AAOA,IAAA,MAAM,sBAAA,GAAyB,CAC7B,QAAA,EACA,QAAA,EACA,YAAA,KACuB;AACvB,MAAA,IACE,QAAA,CAAS,IAAA,KAAS,cAAA,CAAe,uBAAA,IACjC,SAAS,KAAA,IACT,QAAA,CAAS,IAAA,CAAK,IAAA,KAAS,cAAA,CAAe,cAAA,IACtC,QAAA,CAAS,MAAA,CAAO,WAAW,CAAA,EAC3B;AACA,QAAA,OAAO,MAAA;AAAA,MACT;AAEA,MAAA,MAAM,CAAC,YAAA,EAAc,UAAU,CAAA,GAAI,QAAA,CAAS,MAAA;AAE5C,MAAA,IACE,YAAA,KAAiB,MAAA,IACjB,UAAA,KAAe,MAAA,IACf,YAAA,CAAa,IAAA,KAAS,cAAA,CAAe,UAAA,IACrC,UAAA,CAAW,IAAA,KAAS,cAAA,CAAe,UAAA,EACnC;AACA,QAAA,OAAO,MAAA;AAAA,MACT;AAKA,MAAA,MAAM,YAAA,GAAe,mBAAmB,QAAQ,CAAA;AAEhD,MAAA,IACE,iBAAiB,MAAA,KAChB,YAAA,CAAa,SAAS,YAAA,IAAgB,UAAA,CAAW,SAAS,YAAA,CAAA,EAC3D;AACA,QAAA,OAAO,MAAA;AAAA,MACT;AAEA,MAAA,MAAM,OAAO,QAAA,CAAS,IAAA;AAEtB,MAAA,IACE,IAAA,CAAK,SAAS,cAAA,CAAe,gBAAA,IAC7B,CAAC,oBAAA,CAAqB,GAAA,CAAI,IAAA,CAAK,QAAQ,CAAA,EACvC;AACA,QAAA,OAAO,MAAA;AAAA,MACT;AAGA,MAAA,MAAM,cAAc,IAAA,CAAK,QAAA;AAEzB,MAAA,MAAM,OAAA,GAAU,CAAC,IAAA,KACf,IAAA,CAAK,SAAS,cAAA,CAAe,UAAA,IAC7B,IAAA,CAAK,IAAA,KAAS,UAAA,CAAW,IAAA;AAE3B,MAAA,MAAM,CAAC,EAAA,EAAI,KAAK,CAAA,GAAI,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA,GAChC,CAAC,WAAA,EAAa,IAAA,CAAK,KAAK,CAAA,GACzB,QAAQ,IAAA,CAAK,KAAK,CAAA,GACf,CAAC,iBAAA,CAAkB,WAAW,CAAA,EAAG,IAAA,CAAK,IAAI,CAAA,GAC3C,CAAC,MAAA,EAAW,MAAS,CAAA;AAI3B,MAAA,IAAI,EAAA,KAAO,MAAA,IAAa,OAAA,CAAQ,KAAK,CAAA,EAAG;AACtC,QAAA,OAAO,MAAA;AAAA,MACT;AAMA,MAAA,MAAM,CAAA,GAAI,4BAA4B,KAAK,CAAA;AAE3C,MAAA,IAAI,MAAM,MAAA,EAAW;AACnB,QAAA,OAAO,yBAAA,CAA0B,IAAI,CAAC,CAAA;AAAA,MACxC;AAEA,MAAA,IAAI,CAAC,iBAAA,CAAkB,QAAQ,CAAA,EAAG,OAAO,MAAA;AAEzC,MAAA,MAAM,CAAA,GAAI,gBAAA,CAAiB,KAAA,EAAO,YAAY,CAAA;AAE9C,MAAA,OAAO,CAAA,KAAM,MAAA,GAAY,MAAA,GAAY,wBAAA,CAAyB,IAAI,CAAC,CAAA;AAAA,IACrE,CAAA;AAEA,IAAA,MAAM,iBAAA,GAAoB,CACxB,IAAA,EACA,QAAA,KACuB;AACvB,MAAA,IAAI,IAAA,CAAK,WAAW,CAAA,EAAG;AACrB,QAAA,MAAM,CAAC,KAAK,CAAA,GAAI,IAAA;AAEhB,QAAA,IAAI,KAAA,KAAU,QAAW,OAAO,MAAA;AAEhC,QAAA,MAAM,CAAA,GAAI,4BAA4B,KAAK,CAAA;AAE3C,QAAA,IAAI,CAAA,KAAM,MAAA,EAAW,OAAO,kBAAA,CAAmB,QAAQ,CAAC,CAAA;AAExD,QAAA,MAAM,OAAA,GAAU,gCAAgC,KAAK,CAAA;AAErD,QAAA,OAAO,OAAA,KAAY,MAAA,GACf,MAAA,GACA,kBAAA,CAAmB,YAAY,OAAO,CAAA;AAAA,MAC5C;AAEA,MAAA,IAAI,IAAA,CAAK,WAAW,CAAA,EAAG;AACrB,QAAA,MAAM,CAAC,KAAA,EAAO,GAAG,CAAA,GAAI,IAAA;AAErB,QAAA,IACE,UAAU,MAAA,IACV,GAAA,KAAQ,UACR,2BAAA,CAA4B,KAAK,MAAM,CAAA,EACvC;AACA,UAAA,OAAO,MAAA;AAAA,QACT;AAEA,QAAA,MAAM,CAAA,GAAI,4BAA4B,GAAG,CAAA;AAEzC,QAAA,IAAI,CAAA,KAAM,MAAA,EAAW,OAAO,kBAAA,CAAmB,QAAQ,CAAC,CAAA;AAExD,QAAA,MAAM,OAAA,GAAU,gCAAgC,GAAG,CAAA;AAEnD,QAAA,IAAI,YAAY,MAAA,EAAW;AACzB,UAAA,OAAO,kBAAA,CAAmB,YAAY,OAAO,CAAA;AAAA,QAC/C;AAEA,QAAA,IAAI,CAAC,iBAAA,CAAkB,QAAQ,CAAA,EAAG,OAAO,MAAA;AAEzC,QAAA,MAAM,IAAI,gBAAA,CAAiB,GAAA,EAAK,UAAA,CAAW,OAAA,CAAQ,QAAQ,CAAC,CAAA;AAE5D,QAAA,OAAO,CAAA,KAAM,MAAA,GAAY,MAAA,GAAY,kBAAA,CAAmB,YAAY,CAAC,CAAA;AAAA,MACvE;AAEA,MAAA,OAAO,MAAA;AAAA,IACT,CAAA;AAEA,IAAA,MAAM,qBAAA,GAAwB,CAC5B,IAAA,EACA,QAAA,EACA,YAAA,KACuB;AACvB,MAAA,IAAI,IAAA,CAAK,WAAW,CAAA,EAAG;AACrB,QAAA,MAAM,CAAC,KAAK,CAAA,GAAI,IAAA;AAEhB,QAAA,IAAI,KAAA,KAAU,QAAW,OAAO,MAAA;AAEhC,QAAA,MAAM,CAAA,GAAI,4BAA4B,KAAK,CAAA;AAG3C,QAAA,IAAI,CAAA,KAAM,MAAA,EAAW,OAAO,kBAAA,CAAmB,QAAQ,CAAC,CAAA;AAExD,QAAA,MAAM,OAAA,GAAU,gCAAgC,KAAK,CAAA;AAGrD,QAAA,OAAO,OAAA,KAAY,MAAA,GACf,MAAA,GACA,kBAAA,CAAmB,YAAY,OAAO,CAAA;AAAA,MAC5C;AAEA,MAAA,IAAI,IAAA,CAAK,WAAW,CAAA,EAAG;AACrB,QAAA,MAAM,CAAC,KAAA,EAAO,WAAW,CAAA,GAAI,IAAA;AAE7B,QAAA,IACE,UAAU,MAAA,IACV,WAAA,KAAgB,UAChB,2BAAA,CAA4B,KAAK,MAAM,CAAA,EACvC;AACA,UAAA,OAAO,MAAA;AAAA,QACT;AAGA,QAAA,MAAM,CAAA,GAAI,4BAA4B,WAAW,CAAA;AAEjD,QAAA,IAAI,CAAA,KAAM,MAAA,EAAW,OAAO,kBAAA,CAAmB,QAAQ,CAAC,CAAA;AAKxD,QAAA,IAAI,CAAC,iBAAA,CAAkB,QAAQ,CAAA,EAAG,OAAO,MAAA;AAEzC,QAAA,MAAM,CAAA,GAAI,gBAAA,CAAiB,WAAA,EAAa,YAAY,CAAA;AAEpD,QAAA,OAAO,CAAA,KAAM,MAAA,GAAY,MAAA,GAAY,kBAAA,CAAmB,YAAY,CAAC,CAAA;AAAA,MACvE;AAEA,MAAA,IAAI,IAAA,CAAK,WAAW,CAAA,EAAG;AACrB,QAAA,MAAM,CAAC,KAAA,EAAO,WAAA,EAAa,IAAI,CAAA,GAAI,IAAA;AAEnC,QAAA,IACE,KAAA,KAAU,MAAA,IACV,WAAA,KAAgB,MAAA,IAChB,IAAA,KAAS,MAAA,IACT,IAAA,CAAK,IAAA,KAAS,cAAA,CAAe,aAAA,IAC7B,2BAAA,CAA4B,WAAW,MAAM,CAAA,EAC7C;AACA,UAAA,OAAO,MAAA;AAAA,QACT;AAGA,QAAA,IAAI,2BAAA,CAA4B,KAAK,CAAA,KAAM,CAAA,EAAG;AAC5C,UAAA,OAAO,EAAE,EAAA,EAAI,aAAA,EAAe,QAAA,EAAU,SAAA,CAAU,IAAI,CAAA,EAAE;AAAA,QACxD;AAGA,QAAA,IACE,kBAAkB,QAAQ,CAAA,IAC1B,sBAAA,CAAuB,KAAA,EAAO,YAAY,CAAA,EAC1C;AACA,UAAA,OAAO,EAAE,EAAA,EAAI,UAAA,EAAY,QAAA,EAAU,SAAA,CAAU,IAAI,CAAA,EAAE;AAAA,QACrD;AAEA,QAAA,OAAO,MAAA;AAAA,MACT;AAEA,MAAA,OAAO,MAAA;AAAA,IACT,CAAA;AAEA,IAAA,OAAO;AAAA,MACL,cAAA,EAAgB,CAAC,IAAA,KAAS;AACxB,QAAA,MAAM,SAAS,IAAA,CAAK,MAAA;AAEpB,QAAA,IACE,MAAA,CAAO,IAAA,KAAS,cAAA,CAAe,gBAAA,IAC/B,MAAA,CAAO,YACP,MAAA,CAAO,QAAA,CAAS,IAAA,KAAS,cAAA,CAAe,UAAA,EACxC;AACA,UAAA;AAAA,QACF;AAEA,QAAA,MAAM,UAAA,GAAa,OAAO,QAAA,CAAS,IAAA;AAEnC,QAAA,MAAM,WAAW,MAAA,CAAO,MAAA;AAIxB,QAAA,IAAI,UAAA,KAAe,MAAA,IAAU,UAAA,KAAe,UAAA,EAAY;AACtD,UAAA,MAAM,WAAA,GACH,QAAA,CAAS,IAAA,KAAS,cAAA,CAAe,UAAA,IAChC,QAAA,CAAS,IAAA,KAAS,YAAA,IACnB,QAAA,CAAS,IAAA,KAAS,cAAA,CAAe,gBAAA,IAChC,CAAC,QAAA,CAAS,QAAA,IACV,QAAA,CAAS,MAAA,CAAO,IAAA,KAAS,cAAA,CAAe,UAAA,IACxC,QAAA,CAAS,OAAO,IAAA,KAAS,kBAAA,IACzB,QAAA,CAAS,QAAA,CAAS,IAAA,KAAS,cAAA,CAAe,UAAA,IAC1C,QAAA,CAAS,SAAS,IAAA,KAAS,KAAA;AAE/B,UAAA,MAAM,CAAC,QAAA,EAAU,QAAQ,CAAA,GAAI,IAAA,CAAK,SAAA;AAElC,UAAA,IACE,eACA,IAAA,CAAK,SAAA,CAAU,MAAA,KAAW,CAAA,IAC1B,aAAa,MAAA,IACb,QAAA,CAAS,IAAA,KAAS,cAAA,CAAe,iBACjC,QAAA,KAAa,MAAA,IACb,2BAAA,CAA4B,QAAQ,MAAM,CAAA,EAC1C;AACA,YAAA,MAAA;AAAA,cACE,IAAA;AAAA,cACA,EAAE,EAAA,EAAI,UAAA,KAAe,MAAA,GAAS,SAAS,SAAA,EAAU;AAAA,cACjD,UAAU,QAAQ;AAAA,aACpB;AAAA,UACF;AAEA,UAAA;AAAA,QACF;AAGA,QAAA,IACE,UAAA,KAAe,QAAA,IACf,QAAA,CAAS,IAAA,KAAS,eAAe,eAAA,EACjC;AACA,UAAA,MAAM,CAAC,OAAO,CAAA,GAAI,QAAA,CAAS,QAAA;AAE3B,UAAA,MAAM,CAAC,GAAG,CAAA,GAAI,IAAA,CAAK,SAAA;AAEnB,UAAA,IACE,QAAA,CAAS,QAAA,CAAS,MAAA,KAAW,CAAA,IAC7B,OAAA,KAAY,IAAA,IACZ,OAAA,KAAY,MAAA,IACZ,OAAA,CAAQ,IAAA,KAAS,cAAA,CAAe,aAAA,IAChC,IAAA,CAAK,UAAU,MAAA,KAAW,CAAA,IAC1B,GAAA,KAAQ,MAAA,IACR,GAAA,CAAI,IAAA,KAAS,cAAA,CAAe,aAAA,IAC5B,kBAAA,CAAmB,SAAA,CAAU,GAAG,CAAC,CAAA,EACjC;AACA,YAAA,MAAA;AAAA,cACE,IAAA;AAAA,cACA,EAAE,EAAA,EAAI,aAAA,EAAe,QAAA,EAAU,SAAA,CAAU,OAAO,CAAA,EAAE;AAAA,cAClD,UAAU,GAAG;AAAA,aACf;AAAA,UACF;AAEA,UAAA;AAAA,QACF;AAEA,QAAA,IACE,eAAe,OAAA,IACf,UAAA,KAAe,eACf,UAAA,KAAe,QAAA,IACf,eAAe,QAAA,EACf;AACA,UAAA;AAAA,QACF;AAIA,QAAA,IAAI,CAAC,kBAAA,CAAmB,SAAA,CAAU,QAAQ,CAAC,CAAA,EAAG;AAE9C,QAAA,MAAM,YAAA,GAAe,UAAA,CAAW,OAAA,CAAQ,QAAQ,CAAA;AAEhD,QAAA,QAAQ,UAAA;AAAY,UAClB,KAAK,OAAA,EAAS;AACZ,YAAA,MAAM,EAAA,GAAK,iBAAA,CAAkB,IAAA,CAAK,SAAA,EAAW,QAAQ,CAAA;AAErD,YAAA,IAAI,OAAO,MAAA,EAAW,MAAA,CAAO,MAAM,EAAA,EAAI,SAAA,CAAU,QAAQ,CAAC,CAAA;AAE1D,YAAA;AAAA,UACF;AAAA,UAEA,KAAK,WAAA,EAAa;AAChB,YAAA,MAAM,EAAA,GAAK,qBAAA;AAAA,cACT,IAAA,CAAK,SAAA;AAAA,cACL,QAAA;AAAA,cACA;AAAA,aACF;AAEA,YAAA,IAAI,OAAO,MAAA,EAAW,MAAA,CAAO,MAAM,EAAA,EAAI,SAAA,CAAU,QAAQ,CAAC,CAAA;AAE1D,YAAA;AAAA,UACF;AAAA,UAEA,KAAK,QAAA,EAAU;AACb,YAAA,MAAM,CAAC,QAAQ,CAAA,GAAI,IAAA,CAAK,SAAA;AAExB,YAAA,IAAI,QAAA,KAAa,MAAA,IAAa,IAAA,CAAK,SAAA,CAAU,WAAW,CAAA,EAAG;AACzD,cAAA;AAAA,YACF;AAEA,YAAA,MAAM,EAAA,GAAK,sBAAA,CAAuB,QAAA,EAAU,QAAA,EAAU,YAAY,CAAA;AAElE,YAAA,IAAI,OAAO,MAAA,EAAW,MAAA,CAAO,MAAM,EAAA,EAAI,SAAA,CAAU,QAAQ,CAAC,CAAA;AAE1D,YAAA;AAAA,UACF;AAAA,UAEA,KAAK,QAAA,EAAU;AACb,YAAA,MAAM,CAAC,GAAG,CAAA,GAAI,IAAA,CAAK,SAAA;AAEnB,YAAA,IACE,IAAA,CAAK,UAAU,MAAA,KAAW,CAAA,IAC1B,QAAQ,MAAA,IACR,GAAA,CAAI,IAAA,KAAS,cAAA,CAAe,aAAA,EAC5B;AACA,cAAA;AAAA,YACF;AAGA,YAAA,IAAI,GAAA,CAAI,IAAA,KAAS,cAAA,CAAe,eAAA,EAAiB;AAC/C,cAAA,MAAM,CAAC,OAAO,CAAA,GAAI,GAAA,CAAI,QAAA;AAEtB,cAAA,IACE,GAAA,CAAI,QAAA,CAAS,MAAA,KAAW,CAAA,IACxB,OAAA,KAAY,IAAA,IACZ,OAAA,KAAY,MAAA,IACZ,OAAA,CAAQ,IAAA,KAAS,cAAA,CAAe,aAAA,EAChC;AACA,gBAAA,MAAA;AAAA,kBACE,IAAA;AAAA,kBACA,EAAE,EAAA,EAAI,UAAA,EAAY,QAAA,EAAU,SAAA,CAAU,OAAO,CAAA,EAAE;AAAA,kBAC/C,UAAU,QAAQ;AAAA,iBACpB;AAAA,cACF;AAEA,cAAA;AAAA,YACF;AAIA,YAAA,IAAI,wBAAA,CAAyB,SAAA,CAAU,GAAG,CAAC,CAAA,EAAG;AAC5C,cAAA,MAAA;AAAA,gBACE,IAAA;AAAA,gBACA,EAAE,EAAA,EAAI,UAAA,EAAY,QAAA,EAAU,SAAA,CAAU,GAAG,CAAA,EAAE;AAAA,gBAC3C,UAAU,QAAQ;AAAA,eACpB;AAAA,YACF;AAAA,UACF;AAAA;AACF,MACF,CAAA;AAAA,MAEA,eAAA,EAAiB,CAAC,IAAA,KAAS;AAGzB,QAAA,IAAI,IAAA,CAAK,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG;AAEhC,QAAA,MAAM,CAAC,KAAA,EAAO,MAAM,CAAA,GAAI,IAAA,CAAK,QAAA;AAE7B,QAAA,IACE,UAAU,IAAA,IACV,KAAA,KAAU,UACV,MAAA,KAAW,IAAA,IACX,WAAW,MAAA,EACX;AACA,UAAA;AAAA,QACF;AAEA,QAAA,MAAM,CAAC,MAAA,EAAQ,IAAA,EAAM,EAAE,IACrB,KAAA,CAAM,IAAA,KAAS,cAAA,CAAe,aAAA,IAC9B,OAAO,IAAA,KAAS,cAAA,CAAe,aAAA,GAC1B,CAAC,OAAO,MAAA,EAAQ,UAAU,CAAA,GAC3B,KAAA,CAAM,IAAA,KAAS,cAAA,CAAe,aAAA,IAC5B,MAAA,CAAO,SAAS,cAAA,CAAe,aAAA,GAC9B,CAAC,MAAA,EAAQ,OAAO,aAAa,CAAA,GAC9B,CAAC,MAAA,EAAW,QAAW,MAAS,CAAA;AAKxC,QAAA,IAAI,WAAW,MAAA,EAAW;AAI1B,QAAA,IAAI,CAAC,kBAAA,CAAmB,SAAA,CAAU,MAAA,CAAO,QAAQ,CAAC,CAAA,EAAG;AAErD,QAAA,MAAA;AAAA,UACE,IAAA;AAAA,UACA,EAAE,EAAA,EAAI,QAAA,EAAU,SAAA,CAAU,IAAI,CAAA,EAAE;AAAA,UAChC,SAAA,CAAU,OAAO,QAAQ;AAAA,SAC3B;AAAA,MACF,CAAA;AAAA,MAEA,gBAAgB,MAAM;AACpB,QAAA,KAAA,MAAW,CAAC,KAAA,EAAO,QAAQ,CAAA,IAAK,cAAA,CAAe,SAAQ,EAAG;AACxD,UAAA,OAAA,CAAQ,MAAA,CAAO;AAAA,YACb,MAAM,QAAA,CAAS,IAAA;AAAA,YACf,SAAA,EAAW,6BAAA;AAAA,YACX,IAAA,EAAM,EAAE,WAAA,EAAa,QAAA,CAAS,WAAA,EAAY;AAAA,YAC1C,GAAA,EAAK,CAAC,KAAA,KAAU;AACd,cAAA,MAAM,WAAA,GACJ,KAAA,KAAU,CAAA,IAAK,cAAA,GACX,gBAAA,CAAiB,KAAA,EAAO,OAAA,EAAS,iBAAA,EAAmB,CAAC,KAAK,CAAC,CAAA,GAC3D,EAAC;AAEP,cAAA,OAAO;AAAA,gBACL,GAAG,WAAA;AAAA,gBACH,KAAA,CAAM,WAAA,CAAY,QAAA,CAAS,IAAA,EAAM,SAAS,WAAW;AAAA,eACvD;AAAA,YACF;AAAA,WACD,CAAA;AAAA,QACH;AAAA,MACF;AAAA,KACF;AAAA,EACF,CAAA;AAAA,EACA,gBAAgB;AAClB;;;;"}
+{"version":3,"file":"prefer-canonical-array-slicing.mjs","sources":["../../src/rules/prefer-canonical-array-slicing.mts"],"sourcesContent":["import {\n  AST_NODE_TYPES,\n  ESLintUtils,\n  type TSESLint,\n  type TSESTree,\n} from '@typescript-eslint/utils';\nimport * as ts from 'typescript';\nimport {\n  buildImportFixes,\n  getImportedLocalName,\n  getTsDataForgeImport,\n} from './import-utils.mjs';\n\n/* eslint-disable @typescript-eslint/prefer-readonly-parameter-types */\n\ntype Options = readonly [];\n\ntype MessageIds = 'preferCanonicalArraySlicing';\n\n/**\n * A canonical ts-data-forge `Arr` operation a detected pattern is rewritten to:\n *\n * - `tail` / `butLast` — drop the first / last element\n * - `skip N` / `take N` — drop / keep the first `N` elements\n * - `skipLast N` / `takeLast N` — drop / keep the last `N` elements\n * - `toUnshifted item` / `toPushed item` — prepend / append one element\n *   (`toUnshifted` is emitted in its curried form `toUnshifted(item)(xs)` so\n *   the new element keeps the leading position it had in `[item, ...xs]`)\n */\ntype CopyOp = Readonly<\n  | { fn: 'butLast' | 'tail' }\n  | { fn: 'skip' | 'skipLast' | 'take' | 'takeLast'; count: number }\n  | { fn: 'toPushed' | 'toUnshifted'; itemText: string }\n>;\n\n/** `skip 1` / `skipLast 1` have dedicated single-element names. */\nconst normalizeCountedOp = (\n  fn: 'skip' | 'skipLast' | 'take' | 'takeLast',\n  count: number,\n): CopyOp | undefined =>\n  count < 1\n    ? undefined\n    : fn === 'skip' && count === 1\n      ? ({ fn: 'tail' } as const)\n      : fn === 'skipLast' && count === 1\n        ? ({ fn: 'butLast' } as const)\n        : ({ fn, count } as const);\n\nconst asNonNegativeIntegerLiteral = (\n  node: TSESTree.Node,\n): number | undefined =>\n  node.type === AST_NODE_TYPES.Literal &&\n  typeof node.value === 'number' &&\n  Number.isInteger(node.value) &&\n  node.value >= 0\n    ? node.value\n    : undefined;\n\n/** Matches `-N` (unary minus of a positive integer literal) and returns `N`. */\nconst asNegatedPositiveIntegerLiteral = (\n  node: TSESTree.Node,\n): number | undefined => {\n  if (\n    node.type !== AST_NODE_TYPES.UnaryExpression ||\n    node.operator !== '-' ||\n    node.argument.type !== AST_NODE_TYPES.Literal\n  ) {\n    return undefined;\n  }\n\n  const n = asNonNegativeIntegerLiteral(node.argument);\n\n  return n !== undefined && n >= 1 ? n : undefined;\n};\n\n/**\n * Whether re-reading the expression is free of side effects (a plain variable\n * or a non-computed property chain). Required for patterns that reference the\n * receiver twice, such as `xs.filter((_, i) => i < xs.length - 1)`.\n */\nconst isSimpleReference = (node: TSESTree.Node): boolean =>\n  node.type === AST_NODE_TYPES.Identifier ||\n  node.type === AST_NODE_TYPES.ThisExpression ||\n  (node.type === AST_NODE_TYPES.MemberExpression &&\n    !node.computed &&\n    node.property.type === AST_NODE_TYPES.Identifier &&\n    isSimpleReference(node.object));\n\nconst rootIdentifierName = (node: TSESTree.Node): string | undefined =>\n  node.type === AST_NODE_TYPES.Identifier\n    ? node.name\n    : node.type === AST_NODE_TYPES.MemberExpression\n      ? rootIdentifierName(node.object)\n      : undefined;\n\ntype ComparisonOperator = '!==' | '<' | '<=' | '>' | '>=';\n\nconst COMPARISON_OPERATORS: ReadonlySet<string> = new Set([\n  '!==',\n  '<',\n  '<=',\n  '>',\n  '>=',\n] as const satisfies readonly ComparisonOperator[]);\n\n/** Mirror of each comparison when its operands are swapped. */\nconst FLIPPED_OPERATORS = {\n  '!==': '!==',\n  '<': '>',\n  '<=': '>=',\n  '>': '<',\n  '>=': '<=',\n} as const satisfies Record<ComparisonOperator, ComparisonOperator>;\n\n/** Classifies `index OP N` (a comparison against an integer literal). */\nconst classifyLiteralComparison = (\n  op: ComparisonOperator,\n  n: number,\n): CopyOp | undefined => {\n  switch (op) {\n    case '>=':\n      return normalizeCountedOp('skip', n);\n\n    case '>':\n      return normalizeCountedOp('skip', n + 1);\n\n    case '!==':\n      return n === 0 ? { fn: 'tail' } : undefined;\n\n    case '<':\n      return normalizeCountedOp('take', n);\n\n    case '<=':\n      return normalizeCountedOp('take', n + 1);\n  }\n};\n\n/** Classifies `index OP <xs>.length - M`. */\nconst classifyLengthComparison = (\n  op: ComparisonOperator,\n  m: number,\n): CopyOp | undefined => {\n  switch (op) {\n    case '<':\n      return normalizeCountedOp('skipLast', m);\n\n    case '<=':\n      return normalizeCountedOp('skipLast', m - 1);\n\n    case '!==':\n      return m === 1 ? { fn: 'butLast' } : undefined;\n\n    case '>=':\n      return normalizeCountedOp('takeLast', m);\n\n    case '>':\n      return normalizeCountedOp('takeLast', m - 1);\n  }\n};\n\nexport const preferCanonicalArraySlicing: TSESLint.RuleModule<\n  MessageIds,\n  Options\n> = {\n  meta: {\n    type: 'suggestion',\n    docs: {\n      description:\n        'Unify non-mutating array element addition/removal patterns (`slice` / `toSpliced` / `filter` / `concat` / spread) into the corresponding ts-data-forge functions: `Arr.tail`, `Arr.skip`, `Arr.take`, `Arr.butLast`, `Arr.skipLast`, `Arr.takeLast`, `Arr.toUnshifted`, `Arr.toPushed`.',\n    },\n    fixable: 'code',\n    schema: [],\n    messages: {\n      preferCanonicalArraySlicing:\n        'Replace with `{{replacement}}` 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 parserServices = ESLintUtils.getParserServices(context);\n\n    const checker = parserServices.program.getTypeChecker();\n\n    /**\n     * The in-scope way to reference the `Arr` namespace: a named import\n     * (possibly aliased), a namespace import member, or the canonical `Arr`\n     * (added by the import fix when nothing is imported yet).\n     */\n    const arrLocalName = getImportedLocalName(tsDataForgeImport, 'Arr');\n\n    const namespaceLocalName = tsDataForgeImport?.specifiers.find(\n      (specifier) => specifier.type === AST_NODE_TYPES.ImportNamespaceSpecifier,\n    )?.local.name;\n\n    const arrRef =\n      arrLocalName ??\n      (namespaceLocalName === undefined ? 'Arr' : `${namespaceLocalName}.Arr`);\n\n    const needsArrImport =\n      arrLocalName === undefined && namespaceLocalName === undefined;\n\n    /**\n     * Deferred (non-concrete) types are reduced to their base constraint\n     * before checking; `any` / `unknown` are conservatively not array-like.\n     */\n    const isArrayOrTupleType = (type: ts.Type): boolean => {\n      if ((type.flags & (ts.TypeFlags.Any | ts.TypeFlags.Unknown)) !== 0) {\n        return false;\n      }\n\n      if (type.isUnion()) {\n        return type.types.every(isArrayOrTupleType);\n      }\n\n      if (\n        (type.flags &\n          (ts.TypeFlags.TypeParameter |\n            ts.TypeFlags.IndexedAccess |\n            ts.TypeFlags.Conditional |\n            ts.TypeFlags.Substitution)) !==\n        0\n      ) {\n        const constraint = checker.getBaseConstraintOfType(type);\n\n        return constraint !== undefined && isArrayOrTupleType(constraint);\n      }\n\n      return checker.isArrayType(type) || checker.isTupleType(type);\n    };\n\n    const getTypeOf = (node: TSESTree.Node): ts.Type =>\n      checker.getTypeAtLocation(parserServices.esTreeNodeToTSNodeMap.get(node));\n\n    /**\n     * `true` only when the type can never be an array in any branch, so\n     * `xs.concat(v)` is guaranteed to append `v` as one element rather than\n     * flattening it.\n     */\n    const isDefinitelyNotArrayType = (type: ts.Type): boolean => {\n      if ((type.flags & (ts.TypeFlags.Any | ts.TypeFlags.Unknown)) !== 0) {\n        return false;\n      }\n\n      if (type.isUnion()) {\n        return type.types.every(isDefinitelyNotArrayType);\n      }\n\n      if (\n        (type.flags &\n          (ts.TypeFlags.TypeParameter |\n            ts.TypeFlags.IndexedAccess |\n            ts.TypeFlags.Conditional |\n            ts.TypeFlags.Substitution)) !==\n        0\n      ) {\n        const constraint = checker.getBaseConstraintOfType(type);\n\n        return constraint !== undefined && isDefinitelyNotArrayType(constraint);\n      }\n\n      return !checker.isArrayType(type) && !checker.isTupleType(type);\n    };\n\n    /** Argument-position text; a comma (sequence) expression needs parens. */\n    const toArgText = (node: TSESTree.Node): string => {\n      const text = sourceCode.getText(node);\n\n      return node.type === AST_NODE_TYPES.SequenceExpression\n        ? `(${text})`\n        : text;\n    };\n\n    const toReplacementText = (op: CopyOp, xsText: string): string => {\n      switch (op.fn) {\n        case 'tail':\n        case 'butLast':\n          return `${arrRef}.${op.fn}(${xsText})`;\n\n        case 'skip':\n        case 'take':\n        case 'skipLast':\n        case 'takeLast':\n          return `${arrRef}.${op.fn}(${xsText}, ${op.count})`;\n\n        // Emit the curried form for `toUnshifted` so the new element stays in\n        // the same textual position as in the `[item, ...xs]` source, keeping\n        // the rewrite easy to read.\n        case 'toUnshifted':\n          return `${arrRef}.toUnshifted(${op.itemText})(${xsText})`;\n\n        case 'toPushed':\n          return `${arrRef}.toPushed(${xsText}, ${op.itemText})`;\n      }\n    };\n\n    const mut_nodesToFix: {\n      node: TSESTree.Node;\n      replacement: string;\n    }[] = [];\n\n    const report = (node: TSESTree.Node, op: CopyOp, xsText: string): void => {\n      mut_nodesToFix.push({\n        node,\n        replacement: toReplacementText(op, xsText),\n      });\n    };\n\n    /** Matches `<xsText>.length` (non-computed). */\n    const isReceiverLengthAccess = (\n      node: TSESTree.Node,\n      receiverText: string,\n    ): boolean =>\n      node.type === AST_NODE_TYPES.MemberExpression &&\n      !node.computed &&\n      node.property.type === AST_NODE_TYPES.Identifier &&\n      node.property.name === 'length' &&\n      sourceCode.getText(node.object) === receiverText;\n\n    /** Matches `<xsText>.length - M` (M ≥ 1) and returns `M`. */\n    const matchLengthMinus = (\n      node: TSESTree.Node,\n      receiverText: string,\n    ): number | undefined => {\n      if (\n        node.type !== AST_NODE_TYPES.BinaryExpression ||\n        node.operator !== '-' ||\n        !isReceiverLengthAccess(node.left, receiverText)\n      ) {\n        return undefined;\n      }\n\n      const m = asNonNegativeIntegerLiteral(node.right);\n\n      return m !== undefined && m >= 1 ? m : undefined;\n    };\n\n    /**\n     * Matches an index-only filter callback (`(_, i) => <comparison>`) and\n     * classifies the comparison. Both a leading index (`i >= 1`) and a\n     * trailing index (`1 <= i`) operand order are accepted.\n     */\n    const classifyFilterCallback = (\n      callback: TSESTree.CallExpressionArgument,\n      receiver: TSESTree.Expression,\n      receiverText: string,\n    ): CopyOp | undefined => {\n      if (\n        callback.type !== AST_NODE_TYPES.ArrowFunctionExpression ||\n        callback.async ||\n        callback.body.type === AST_NODE_TYPES.BlockStatement ||\n        callback.params.length !== 2\n      ) {\n        return undefined;\n      }\n\n      const [elementParam, indexParam] = callback.params;\n\n      if (\n        elementParam === undefined ||\n        indexParam === undefined ||\n        elementParam.type !== AST_NODE_TYPES.Identifier ||\n        indexParam.type !== AST_NODE_TYPES.Identifier\n      ) {\n        return undefined;\n      }\n\n      // A callback parameter shadowing the receiver's root binding (e.g.\n      // `xs.filter((xs, i) => i < xs.length - 1)`) would make the textual\n      // `xs.length` comparison refer to the element, not the receiver.\n      const receiverRoot = rootIdentifierName(receiver);\n\n      if (\n        receiverRoot !== undefined &&\n        (elementParam.name === receiverRoot || indexParam.name === receiverRoot)\n      ) {\n        return undefined;\n      }\n\n      const body = callback.body;\n\n      if (\n        body.type !== AST_NODE_TYPES.BinaryExpression ||\n        !COMPARISON_OPERATORS.has(body.operator)\n      ) {\n        return undefined;\n      }\n\n      // eslint-disable-next-line total-functions/no-unsafe-type-assertion\n      const rawOperator = body.operator as ComparisonOperator;\n\n      const isIndex = (side: TSESTree.Node): boolean =>\n        side.type === AST_NODE_TYPES.Identifier &&\n        side.name === indexParam.name;\n\n      const [op, other] = isIndex(body.left)\n        ? ([rawOperator, body.right] as const)\n        : isIndex(body.right)\n          ? ([FLIPPED_OPERATORS[rawOperator], body.left] as const)\n          : [undefined, undefined];\n\n      // `op` and `other` are set together (both from the same tuple), so\n      // checking `op` also guarantees `other` is defined.\n      if (op === undefined || isIndex(other)) {\n        return undefined;\n      }\n\n      // The element parameter must not participate in the comparison (only\n      // the index side and a receiver-independent bound are recognized, so\n      // reaching here with an element reference is impossible for literals,\n      // but `xs.length - N` needs a stable receiver).\n      const n = asNonNegativeIntegerLiteral(other);\n\n      if (n !== undefined) {\n        return classifyLiteralComparison(op, n);\n      }\n\n      if (!isSimpleReference(receiver)) return undefined;\n\n      const m = matchLengthMinus(other, receiverText);\n\n      return m === undefined ? undefined : classifyLengthComparison(op, m);\n    };\n\n    const classifySliceArgs = (\n      args: readonly TSESTree.CallExpressionArgument[],\n      receiver: TSESTree.Expression,\n    ): CopyOp | undefined => {\n      if (args.length === 1) {\n        const [start] = args;\n\n        if (start === undefined) return undefined;\n\n        const n = asNonNegativeIntegerLiteral(start);\n\n        if (n !== undefined) return normalizeCountedOp('skip', n);\n\n        const negated = asNegatedPositiveIntegerLiteral(start);\n\n        return negated === undefined\n          ? undefined\n          : normalizeCountedOp('takeLast', negated);\n      }\n\n      if (args.length === 2) {\n        const [start, end] = args;\n\n        if (\n          start === undefined ||\n          end === undefined ||\n          asNonNegativeIntegerLiteral(start) !== 0\n        ) {\n          return undefined;\n        }\n\n        const n = asNonNegativeIntegerLiteral(end);\n\n        if (n !== undefined) return normalizeCountedOp('take', n);\n\n        const negated = asNegatedPositiveIntegerLiteral(end);\n\n        if (negated !== undefined) {\n          return normalizeCountedOp('skipLast', negated);\n        }\n\n        if (!isSimpleReference(receiver)) return undefined;\n\n        const m = matchLengthMinus(end, sourceCode.getText(receiver));\n\n        return m === undefined ? undefined : normalizeCountedOp('skipLast', m);\n      }\n\n      return undefined;\n    };\n\n    const classifyToSplicedArgs = (\n      args: readonly TSESTree.CallExpressionArgument[],\n      receiver: TSESTree.Expression,\n      receiverText: string,\n    ): CopyOp | undefined => {\n      if (args.length === 1) {\n        const [start] = args;\n\n        if (start === undefined) return undefined;\n\n        const n = asNonNegativeIntegerLiteral(start);\n\n        // `xs.toSpliced(N)` removes everything from index N on → take N.\n        if (n !== undefined) return normalizeCountedOp('take', n);\n\n        const negated = asNegatedPositiveIntegerLiteral(start);\n\n        // `xs.toSpliced(-N)` removes the last N elements → skipLast N.\n        return negated === undefined\n          ? undefined\n          : normalizeCountedOp('skipLast', negated);\n      }\n\n      if (args.length === 2) {\n        const [start, deleteCount] = args;\n\n        if (\n          start === undefined ||\n          deleteCount === undefined ||\n          asNonNegativeIntegerLiteral(start) !== 0\n        ) {\n          return undefined;\n        }\n\n        // `xs.toSpliced(0, N)` removes the first N elements → skip N.\n        const n = asNonNegativeIntegerLiteral(deleteCount);\n\n        if (n !== undefined) return normalizeCountedOp('skip', n);\n\n        // `xs.toSpliced(0, xs.length - N)` keeps the last N → takeLast N.\n        // (Note: `xs.toSpliced(0, -N)` clamps the delete count to 0 and is a\n        // plain copy, so it is deliberately NOT treated as takeLast.)\n        if (!isSimpleReference(receiver)) return undefined;\n\n        const m = matchLengthMinus(deleteCount, receiverText);\n\n        return m === undefined ? undefined : normalizeCountedOp('takeLast', m);\n      }\n\n      if (args.length === 3) {\n        const [start, deleteCount, item] = args;\n\n        if (\n          start === undefined ||\n          deleteCount === undefined ||\n          item === undefined ||\n          item.type === AST_NODE_TYPES.SpreadElement ||\n          asNonNegativeIntegerLiteral(deleteCount) !== 0\n        ) {\n          return undefined;\n        }\n\n        // `xs.toSpliced(0, 0, item)` prepends → toUnshifted.\n        if (asNonNegativeIntegerLiteral(start) === 0) {\n          return { fn: 'toUnshifted', itemText: toArgText(item) };\n        }\n\n        // `xs.toSpliced(xs.length, 0, item)` appends → toPushed.\n        if (\n          isSimpleReference(receiver) &&\n          isReceiverLengthAccess(start, receiverText)\n        ) {\n          return { fn: 'toPushed', itemText: toArgText(item) };\n        }\n\n        return undefined;\n      }\n\n      return undefined;\n    };\n\n    return {\n      CallExpression: (node) => {\n        const callee = node.callee;\n\n        if (\n          callee.type !== AST_NODE_TYPES.MemberExpression ||\n          callee.computed ||\n          callee.property.type !== AST_NODE_TYPES.Identifier\n        ) {\n          return;\n        }\n\n        const methodName = callee.property.name;\n\n        const receiver = callee.object;\n\n        // `Arr.skip(xs, 1)` → `Arr.tail(xs)`, `Arr.skipLast(xs, 1)` →\n        // `Arr.butLast(xs)` (also via a namespace import or an alias).\n        if (methodName === 'skip' || methodName === 'skipLast') {\n          const isArrObject =\n            (receiver.type === AST_NODE_TYPES.Identifier &&\n              receiver.name === arrLocalName) ||\n            (receiver.type === AST_NODE_TYPES.MemberExpression &&\n              !receiver.computed &&\n              receiver.object.type === AST_NODE_TYPES.Identifier &&\n              receiver.object.name === namespaceLocalName &&\n              receiver.property.type === AST_NODE_TYPES.Identifier &&\n              receiver.property.name === 'Arr');\n\n          const [arrayArg, countArg] = node.arguments;\n\n          if (\n            isArrObject &&\n            node.arguments.length === 2 &&\n            arrayArg !== undefined &&\n            arrayArg.type !== AST_NODE_TYPES.SpreadElement &&\n            countArg !== undefined &&\n            asNonNegativeIntegerLiteral(countArg) === 1\n          ) {\n            report(\n              node,\n              { fn: methodName === 'skip' ? 'tail' : 'butLast' },\n              toArgText(arrayArg),\n            );\n          }\n\n          return;\n        }\n\n        // `[item].concat(xs)` → `Arr.toUnshifted(xs, item)`.\n        if (\n          methodName === 'concat' &&\n          receiver.type === AST_NODE_TYPES.ArrayExpression\n        ) {\n          const [element] = receiver.elements;\n\n          const [arg] = node.arguments;\n\n          if (\n            receiver.elements.length === 1 &&\n            element !== null &&\n            element !== undefined &&\n            element.type !== AST_NODE_TYPES.SpreadElement &&\n            node.arguments.length === 1 &&\n            arg !== undefined &&\n            arg.type !== AST_NODE_TYPES.SpreadElement &&\n            isArrayOrTupleType(getTypeOf(arg))\n          ) {\n            report(\n              node,\n              { fn: 'toUnshifted', itemText: toArgText(element) },\n              toArgText(arg),\n            );\n          }\n\n          return;\n        }\n\n        if (\n          methodName !== 'slice' &&\n          methodName !== 'toSpliced' &&\n          methodName !== 'filter' &&\n          methodName !== 'concat'\n        ) {\n          return;\n        }\n\n        // The receiver must be an array or tuple (not a string / typed array\n        // / other object that happens to share the method name).\n        if (!isArrayOrTupleType(getTypeOf(receiver))) return;\n\n        const receiverText = sourceCode.getText(receiver);\n\n        switch (methodName) {\n          case 'slice': {\n            const op = classifySliceArgs(node.arguments, receiver);\n\n            if (op !== undefined) report(node, op, toArgText(receiver));\n\n            return;\n          }\n\n          case 'toSpliced': {\n            const op = classifyToSplicedArgs(\n              node.arguments,\n              receiver,\n              receiverText,\n            );\n\n            if (op !== undefined) report(node, op, toArgText(receiver));\n\n            return;\n          }\n\n          case 'filter': {\n            const [callback] = node.arguments;\n\n            if (callback === undefined || node.arguments.length !== 1) {\n              return;\n            }\n\n            const op = classifyFilterCallback(callback, receiver, receiverText);\n\n            if (op !== undefined) report(node, op, toArgText(receiver));\n\n            return;\n          }\n\n          case 'concat': {\n            const [arg] = node.arguments;\n\n            if (\n              node.arguments.length !== 1 ||\n              arg === undefined ||\n              arg.type === AST_NODE_TYPES.SpreadElement\n            ) {\n              return;\n            }\n\n            // `xs.concat([item])` → `Arr.toPushed(xs, item)`.\n            if (arg.type === AST_NODE_TYPES.ArrayExpression) {\n              const [element] = arg.elements;\n\n              if (\n                arg.elements.length === 1 &&\n                element !== null &&\n                element !== undefined &&\n                element.type !== AST_NODE_TYPES.SpreadElement\n              ) {\n                report(\n                  node,\n                  { fn: 'toPushed', itemText: toArgText(element) },\n                  toArgText(receiver),\n                );\n              }\n\n              return;\n            }\n\n            // `xs.concat(item)` appends only when `item` can never be an\n            // array (otherwise `concat` would flatten it).\n            if (isDefinitelyNotArrayType(getTypeOf(arg))) {\n              report(\n                node,\n                { fn: 'toPushed', itemText: toArgText(arg) },\n                toArgText(receiver),\n              );\n            }\n          }\n        }\n      },\n\n      ArrayExpression: (node) => {\n        // `[item, ...xs]` → `Arr.toUnshifted(xs, item)`,\n        // `[...xs, item]` → `Arr.toPushed(xs, item)`.\n        if (node.elements.length !== 2) return;\n\n        const [first, second] = node.elements;\n\n        if (\n          first === null ||\n          first === undefined ||\n          second === null ||\n          second === undefined\n        ) {\n          return;\n        }\n\n        const [spread, item, fn] =\n          first.type === AST_NODE_TYPES.SpreadElement &&\n          second.type !== AST_NODE_TYPES.SpreadElement\n            ? ([first, second, 'toPushed'] as const)\n            : first.type !== AST_NODE_TYPES.SpreadElement &&\n                second.type === AST_NODE_TYPES.SpreadElement\n              ? ([second, first, 'toUnshifted'] as const)\n              : [undefined, undefined, undefined];\n\n        // `spread`, `item`, and `fn` are set together (all from the same\n        // tuple), so checking `spread` also guarantees the others are\n        // defined.\n        if (spread === undefined) return;\n\n        // Spreading a non-array iterable (`[v, ...someSet]`) is a genuine\n        // conversion, not an element addition to an array.\n        if (!isArrayOrTupleType(getTypeOf(spread.argument))) return;\n\n        report(\n          node,\n          { fn, itemText: toArgText(item) },\n          toArgText(spread.argument),\n        );\n      },\n\n      'Program:exit': () => {\n        for (const [index, nodeInfo] of mut_nodesToFix.entries()) {\n          context.report({\n            node: nodeInfo.node,\n            messageId: 'preferCanonicalArraySlicing',\n            data: { replacement: nodeInfo.replacement },\n            fix: (fixer) => {\n              const importFixes =\n                index === 0 && needsArrImport\n                  ? buildImportFixes(fixer, program, tsDataForgeImport, ['Arr'])\n                  : [];\n\n              return [\n                ...importFixes,\n                fixer.replaceText(nodeInfo.node, nodeInfo.replacement),\n              ];\n            },\n          });\n        }\n      },\n    };\n  },\n  defaultOptions: [],\n} as const;\n"],"names":[],"mappings":";;;;AAoCA,MAAM,kBAAA,GAAqB,CACzB,EAAA,EACA,KAAA,KAEA,KAAA,GAAQ,IACJ,MAAA,GACA,EAAA,KAAO,MAAA,IAAU,KAAA,KAAU,CAAA,GACxB,EAAE,IAAI,MAAA,EAAO,GACd,EAAA,KAAO,UAAA,IAAc,KAAA,KAAU,CAAA,GAC5B,EAAE,EAAA,EAAI,SAAA,EAAU,GAChB,EAAE,EAAA,EAAI,KAAA,EAAM;AAEvB,MAAM,2BAAA,GAA8B,CAClC,IAAA,KAEA,IAAA,CAAK,SAAS,cAAA,CAAe,OAAA,IAC7B,OAAO,IAAA,CAAK,KAAA,KAAU,YACtB,MAAA,CAAO,SAAA,CAAU,KAAK,KAAK,CAAA,IAC3B,KAAK,KAAA,IAAS,CAAA,GACV,KAAK,KAAA,GACL,MAAA;AAGN,MAAM,+BAAA,GAAkC,CACtC,IAAA,KACuB;AACvB,EAAA,IACE,IAAA,CAAK,IAAA,KAAS,cAAA,CAAe,eAAA,IAC7B,IAAA,CAAK,QAAA,KAAa,GAAA,IAClB,IAAA,CAAK,QAAA,CAAS,IAAA,KAAS,cAAA,CAAe,OAAA,EACtC;AACA,IAAA,OAAO,MAAA;AAAA,EACT;AAEA,EAAA,MAAM,CAAA,GAAI,2BAAA,CAA4B,IAAA,CAAK,QAAQ,CAAA;AAEnD,EAAA,OAAO,CAAA,KAAM,MAAA,IAAa,CAAA,IAAK,CAAA,GAAI,CAAA,GAAI,MAAA;AACzC,CAAA;AAOA,MAAM,iBAAA,GAAoB,CAAC,IAAA,KACzB,IAAA,CAAK,IAAA,KAAS,eAAe,UAAA,IAC7B,IAAA,CAAK,IAAA,KAAS,cAAA,CAAe,cAAA,IAC5B,IAAA,CAAK,SAAS,cAAA,CAAe,gBAAA,IAC5B,CAAC,IAAA,CAAK,QAAA,IACN,IAAA,CAAK,QAAA,CAAS,IAAA,KAAS,cAAA,CAAe,UAAA,IACtC,iBAAA,CAAkB,IAAA,CAAK,MAAM,CAAA;AAEjC,MAAM,qBAAqB,CAAC,IAAA,KAC1B,IAAA,CAAK,IAAA,KAAS,eAAe,UAAA,GACzB,IAAA,CAAK,IAAA,GACL,IAAA,CAAK,SAAS,cAAA,CAAe,gBAAA,GAC3B,kBAAA,CAAmB,IAAA,CAAK,MAAM,CAAA,GAC9B,MAAA;AAIR,MAAM,oBAAA,uBAAgD,GAAA,CAAI;AAAA,EACxD,KAAA;AAAA,EACA,GAAA;AAAA,EACA,IAAA;AAAA,EACA,GAAA;AAAA,EACA;AACF,CAAkD,CAAA;AAGlD,MAAM,iBAAA,GAAoB;AAAA,EACxB,KAAA,EAAO,KAAA;AAAA,EACP,GAAA,EAAK,GAAA;AAAA,EACL,IAAA,EAAM,IAAA;AAAA,EACN,GAAA,EAAK,GAAA;AAAA,EACL,IAAA,EAAM;AACR,CAAA;AAGA,MAAM,yBAAA,GAA4B,CAChC,EAAA,EACA,CAAA,KACuB;AACvB,EAAA,QAAQ,EAAA;AAAI,IACV,KAAK,IAAA;AACH,MAAA,OAAO,kBAAA,CAAmB,QAAQ,CAAC,CAAA;AAAA,IAErC,KAAK,GAAA;AACH,MAAA,OAAO,kBAAA,CAAmB,MAAA,EAAQ,CAAA,GAAI,CAAC,CAAA;AAAA,IAEzC,KAAK,KAAA;AACH,MAAA,OAAO,CAAA,KAAM,CAAA,GAAI,EAAE,EAAA,EAAI,QAAO,GAAI,MAAA;AAAA,IAEpC,KAAK,GAAA;AACH,MAAA,OAAO,kBAAA,CAAmB,QAAQ,CAAC,CAAA;AAAA,IAErC,KAAK,IAAA;AACH,MAAA,OAAO,kBAAA,CAAmB,MAAA,EAAQ,CAAA,GAAI,CAAC,CAAA;AAAA;AAE7C,CAAA;AAGA,MAAM,wBAAA,GAA2B,CAC/B,EAAA,EACA,CAAA,KACuB;AACvB,EAAA,QAAQ,EAAA;AAAI,IACV,KAAK,GAAA;AACH,MAAA,OAAO,kBAAA,CAAmB,YAAY,CAAC,CAAA;AAAA,IAEzC,KAAK,IAAA;AACH,MAAA,OAAO,kBAAA,CAAmB,UAAA,EAAY,CAAA,GAAI,CAAC,CAAA;AAAA,IAE7C,KAAK,KAAA;AACH,MAAA,OAAO,CAAA,KAAM,CAAA,GAAI,EAAE,EAAA,EAAI,WAAU,GAAI,MAAA;AAAA,IAEvC,KAAK,IAAA;AACH,MAAA,OAAO,kBAAA,CAAmB,YAAY,CAAC,CAAA;AAAA,IAEzC,KAAK,GAAA;AACH,MAAA,OAAO,kBAAA,CAAmB,UAAA,EAAY,CAAA,GAAI,CAAC,CAAA;AAAA;AAEjD,CAAA;AAEO,MAAM,2BAAA,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,2BAAA,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,cAAA,GAAiB,WAAA,CAAY,iBAAA,CAAkB,OAAO,CAAA;AAE5D,IAAA,MAAM,OAAA,GAAU,cAAA,CAAe,OAAA,CAAQ,cAAA,EAAe;AAOtD,IAAA,MAAM,YAAA,GAAe,oBAAA,CAAqB,iBAAA,EAAmB,KAAK,CAAA;AAElE,IAAA,MAAM,kBAAA,GAAqB,mBAAmB,UAAA,CAAW,IAAA;AAAA,MACvD,CAAC,SAAA,KAAc,SAAA,CAAU,IAAA,KAAS,cAAA,CAAe;AAAA,OAChD,KAAA,CAAM,IAAA;AAET,IAAA,MAAM,SACJ,YAAA,KACC,kBAAA,KAAuB,MAAA,GAAY,KAAA,GAAQ,GAAG,kBAAkB,CAAA,IAAA,CAAA,CAAA;AAEnE,IAAA,MAAM,cAAA,GACJ,YAAA,KAAiB,MAAA,IAAa,kBAAA,KAAuB,MAAA;AAMvD,IAAA,MAAM,kBAAA,GAAqB,CAAC,IAAA,KAA2B;AACrD,MAAA,IAAA,CAAK,IAAA,CAAK,SAAS,EAAA,CAAG,SAAA,CAAU,MAAM,EAAA,CAAG,SAAA,CAAU,cAAc,CAAA,EAAG;AAClE,QAAA,OAAO,KAAA;AAAA,MACT;AAEA,MAAA,IAAI,IAAA,CAAK,SAAQ,EAAG;AAClB,QAAA,OAAO,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,kBAAkB,CAAA;AAAA,MAC5C;AAEA,MAAA,IAAA,CACG,IAAA,CAAK,KAAA,IACH,EAAA,CAAG,SAAA,CAAU,gBACZ,EAAA,CAAG,SAAA,CAAU,aAAA,GACb,EAAA,CAAG,SAAA,CAAU,WAAA,GACb,EAAA,CAAG,SAAA,CAAU,mBACjB,CAAA,EACA;AACA,QAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,uBAAA,CAAwB,IAAI,CAAA;AAEvD,QAAA,OAAO,UAAA,KAAe,MAAA,IAAa,kBAAA,CAAmB,UAAU,CAAA;AAAA,MAClE;AAEA,MAAA,OAAO,QAAQ,WAAA,CAAY,IAAI,CAAA,IAAK,OAAA,CAAQ,YAAY,IAAI,CAAA;AAAA,IAC9D,CAAA;AAEA,IAAA,MAAM,SAAA,GAAY,CAAC,IAAA,KACjB,OAAA,CAAQ,kBAAkB,cAAA,CAAe,qBAAA,CAAsB,GAAA,CAAI,IAAI,CAAC,CAAA;AAO1E,IAAA,MAAM,wBAAA,GAA2B,CAAC,IAAA,KAA2B;AAC3D,MAAA,IAAA,CAAK,IAAA,CAAK,SAAS,EAAA,CAAG,SAAA,CAAU,MAAM,EAAA,CAAG,SAAA,CAAU,cAAc,CAAA,EAAG;AAClE,QAAA,OAAO,KAAA;AAAA,MACT;AAEA,MAAA,IAAI,IAAA,CAAK,SAAQ,EAAG;AAClB,QAAA,OAAO,IAAA,CAAK,KAAA,CAAM,KAAA,CAAM,wBAAwB,CAAA;AAAA,MAClD;AAEA,MAAA,IAAA,CACG,IAAA,CAAK,KAAA,IACH,EAAA,CAAG,SAAA,CAAU,gBACZ,EAAA,CAAG,SAAA,CAAU,aAAA,GACb,EAAA,CAAG,SAAA,CAAU,WAAA,GACb,EAAA,CAAG,SAAA,CAAU,mBACjB,CAAA,EACA;AACA,QAAA,MAAM,UAAA,GAAa,OAAA,CAAQ,uBAAA,CAAwB,IAAI,CAAA;AAEvD,QAAA,OAAO,UAAA,KAAe,MAAA,IAAa,wBAAA,CAAyB,UAAU,CAAA;AAAA,MACxE;AAEA,MAAA,OAAO,CAAC,QAAQ,WAAA,CAAY,IAAI,KAAK,CAAC,OAAA,CAAQ,YAAY,IAAI,CAAA;AAAA,IAChE,CAAA;AAGA,IAAA,MAAM,SAAA,GAAY,CAAC,IAAA,KAAgC;AACjD,MAAA,MAAM,IAAA,GAAO,UAAA,CAAW,OAAA,CAAQ,IAAI,CAAA;AAEpC,MAAA,OAAO,KAAK,IAAA,KAAS,cAAA,CAAe,kBAAA,GAChC,CAAA,CAAA,EAAI,IAAI,CAAA,CAAA,CAAA,GACR,IAAA;AAAA,IACN,CAAA;AAEA,IAAA,MAAM,iBAAA,GAAoB,CAAC,EAAA,EAAY,MAAA,KAA2B;AAChE,MAAA,QAAQ,GAAG,EAAA;AAAI,QACb,KAAK,MAAA;AAAA,QACL,KAAK,SAAA;AACH,UAAA,OAAO,GAAG,MAAM,CAAA,CAAA,EAAI,EAAA,CAAG,EAAE,IAAI,MAAM,CAAA,CAAA,CAAA;AAAA,QAErC,KAAK,MAAA;AAAA,QACL,KAAK,MAAA;AAAA,QACL,KAAK,UAAA;AAAA,QACL,KAAK,UAAA;AACH,UAAA,OAAO,CAAA,EAAG,MAAM,CAAA,CAAA,EAAI,EAAA,CAAG,EAAE,CAAA,CAAA,EAAI,MAAM,CAAA,EAAA,EAAK,EAAA,CAAG,KAAK,CAAA,CAAA,CAAA;AAAA;AAAA;AAAA;AAAA,QAKlD,KAAK,aAAA;AACH,UAAA,OAAO,GAAG,MAAM,CAAA,aAAA,EAAgB,EAAA,CAAG,QAAQ,KAAK,MAAM,CAAA,CAAA,CAAA;AAAA,QAExD,KAAK,UAAA;AACH,UAAA,OAAO,GAAG,MAAM,CAAA,UAAA,EAAa,MAAM,CAAA,EAAA,EAAK,GAAG,QAAQ,CAAA,CAAA,CAAA;AAAA;AACvD,IACF,CAAA;AAEA,IAAA,MAAM,iBAGA,EAAC;AAEP,IAAA,MAAM,MAAA,GAAS,CAAC,IAAA,EAAqB,EAAA,EAAY,MAAA,KAAyB;AACxE,MAAA,cAAA,CAAe,IAAA,CAAK;AAAA,QAClB,IAAA;AAAA,QACA,WAAA,EAAa,iBAAA,CAAkB,EAAA,EAAI,MAAM;AAAA,OAC1C,CAAA;AAAA,IACH,CAAA;AAGA,IAAA,MAAM,sBAAA,GAAyB,CAC7B,IAAA,EACA,YAAA,KAEA,IAAA,CAAK,SAAS,cAAA,CAAe,gBAAA,IAC7B,CAAC,IAAA,CAAK,QAAA,IACN,IAAA,CAAK,SAAS,IAAA,KAAS,cAAA,CAAe,UAAA,IACtC,IAAA,CAAK,QAAA,CAAS,IAAA,KAAS,YACvB,UAAA,CAAW,OAAA,CAAQ,IAAA,CAAK,MAAM,CAAA,KAAM,YAAA;AAGtC,IAAA,MAAM,gBAAA,GAAmB,CACvB,IAAA,EACA,YAAA,KACuB;AACvB,MAAA,IACE,IAAA,CAAK,IAAA,KAAS,cAAA,CAAe,gBAAA,IAC7B,IAAA,CAAK,QAAA,KAAa,GAAA,IAClB,CAAC,sBAAA,CAAuB,IAAA,CAAK,IAAA,EAAM,YAAY,CAAA,EAC/C;AACA,QAAA,OAAO,MAAA;AAAA,MACT;AAEA,MAAA,MAAM,CAAA,GAAI,2BAAA,CAA4B,IAAA,CAAK,KAAK,CAAA;AAEhD,MAAA,OAAO,CAAA,KAAM,MAAA,IAAa,CAAA,IAAK,CAAA,GAAI,CAAA,GAAI,MAAA;AAAA,IACzC,CAAA;AAOA,IAAA,MAAM,sBAAA,GAAyB,CAC7B,QAAA,EACA,QAAA,EACA,YAAA,KACuB;AACvB,MAAA,IACE,QAAA,CAAS,IAAA,KAAS,cAAA,CAAe,uBAAA,IACjC,SAAS,KAAA,IACT,QAAA,CAAS,IAAA,CAAK,IAAA,KAAS,cAAA,CAAe,cAAA,IACtC,QAAA,CAAS,MAAA,CAAO,WAAW,CAAA,EAC3B;AACA,QAAA,OAAO,MAAA;AAAA,MACT;AAEA,MAAA,MAAM,CAAC,YAAA,EAAc,UAAU,CAAA,GAAI,QAAA,CAAS,MAAA;AAE5C,MAAA,IACE,YAAA,KAAiB,MAAA,IACjB,UAAA,KAAe,MAAA,IACf,YAAA,CAAa,IAAA,KAAS,cAAA,CAAe,UAAA,IACrC,UAAA,CAAW,IAAA,KAAS,cAAA,CAAe,UAAA,EACnC;AACA,QAAA,OAAO,MAAA;AAAA,MACT;AAKA,MAAA,MAAM,YAAA,GAAe,mBAAmB,QAAQ,CAAA;AAEhD,MAAA,IACE,iBAAiB,MAAA,KAChB,YAAA,CAAa,SAAS,YAAA,IAAgB,UAAA,CAAW,SAAS,YAAA,CAAA,EAC3D;AACA,QAAA,OAAO,MAAA;AAAA,MACT;AAEA,MAAA,MAAM,OAAO,QAAA,CAAS,IAAA;AAEtB,MAAA,IACE,IAAA,CAAK,SAAS,cAAA,CAAe,gBAAA,IAC7B,CAAC,oBAAA,CAAqB,GAAA,CAAI,IAAA,CAAK,QAAQ,CAAA,EACvC;AACA,QAAA,OAAO,MAAA;AAAA,MACT;AAGA,MAAA,MAAM,cAAc,IAAA,CAAK,QAAA;AAEzB,MAAA,MAAM,OAAA,GAAU,CAAC,IAAA,KACf,IAAA,CAAK,SAAS,cAAA,CAAe,UAAA,IAC7B,IAAA,CAAK,IAAA,KAAS,UAAA,CAAW,IAAA;AAE3B,MAAA,MAAM,CAAC,EAAA,EAAI,KAAK,CAAA,GAAI,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA,GAChC,CAAC,WAAA,EAAa,IAAA,CAAK,KAAK,CAAA,GACzB,QAAQ,IAAA,CAAK,KAAK,CAAA,GACf,CAAC,iBAAA,CAAkB,WAAW,CAAA,EAAG,IAAA,CAAK,IAAI,CAAA,GAC3C,CAAC,MAAA,EAAW,MAAS,CAAA;AAI3B,MAAA,IAAI,EAAA,KAAO,MAAA,IAAa,OAAA,CAAQ,KAAK,CAAA,EAAG;AACtC,QAAA,OAAO,MAAA;AAAA,MACT;AAMA,MAAA,MAAM,CAAA,GAAI,4BAA4B,KAAK,CAAA;AAE3C,MAAA,IAAI,MAAM,MAAA,EAAW;AACnB,QAAA,OAAO,yBAAA,CAA0B,IAAI,CAAC,CAAA;AAAA,MACxC;AAEA,MAAA,IAAI,CAAC,iBAAA,CAAkB,QAAQ,CAAA,EAAG,OAAO,MAAA;AAEzC,MAAA,MAAM,CAAA,GAAI,gBAAA,CAAiB,KAAA,EAAO,YAAY,CAAA;AAE9C,MAAA,OAAO,CAAA,KAAM,MAAA,GAAY,MAAA,GAAY,wBAAA,CAAyB,IAAI,CAAC,CAAA;AAAA,IACrE,CAAA;AAEA,IAAA,MAAM,iBAAA,GAAoB,CACxB,IAAA,EACA,QAAA,KACuB;AACvB,MAAA,IAAI,IAAA,CAAK,WAAW,CAAA,EAAG;AACrB,QAAA,MAAM,CAAC,KAAK,CAAA,GAAI,IAAA;AAEhB,QAAA,IAAI,KAAA,KAAU,QAAW,OAAO,MAAA;AAEhC,QAAA,MAAM,CAAA,GAAI,4BAA4B,KAAK,CAAA;AAE3C,QAAA,IAAI,CAAA,KAAM,MAAA,EAAW,OAAO,kBAAA,CAAmB,QAAQ,CAAC,CAAA;AAExD,QAAA,MAAM,OAAA,GAAU,gCAAgC,KAAK,CAAA;AAErD,QAAA,OAAO,OAAA,KAAY,MAAA,GACf,MAAA,GACA,kBAAA,CAAmB,YAAY,OAAO,CAAA;AAAA,MAC5C;AAEA,MAAA,IAAI,IAAA,CAAK,WAAW,CAAA,EAAG;AACrB,QAAA,MAAM,CAAC,KAAA,EAAO,GAAG,CAAA,GAAI,IAAA;AAErB,QAAA,IACE,UAAU,MAAA,IACV,GAAA,KAAQ,UACR,2BAAA,CAA4B,KAAK,MAAM,CAAA,EACvC;AACA,UAAA,OAAO,MAAA;AAAA,QACT;AAEA,QAAA,MAAM,CAAA,GAAI,4BAA4B,GAAG,CAAA;AAEzC,QAAA,IAAI,CAAA,KAAM,MAAA,EAAW,OAAO,kBAAA,CAAmB,QAAQ,CAAC,CAAA;AAExD,QAAA,MAAM,OAAA,GAAU,gCAAgC,GAAG,CAAA;AAEnD,QAAA,IAAI,YAAY,MAAA,EAAW;AACzB,UAAA,OAAO,kBAAA,CAAmB,YAAY,OAAO,CAAA;AAAA,QAC/C;AAEA,QAAA,IAAI,CAAC,iBAAA,CAAkB,QAAQ,CAAA,EAAG,OAAO,MAAA;AAEzC,QAAA,MAAM,IAAI,gBAAA,CAAiB,GAAA,EAAK,UAAA,CAAW,OAAA,CAAQ,QAAQ,CAAC,CAAA;AAE5D,QAAA,OAAO,CAAA,KAAM,MAAA,GAAY,MAAA,GAAY,kBAAA,CAAmB,YAAY,CAAC,CAAA;AAAA,MACvE;AAEA,MAAA,OAAO,MAAA;AAAA,IACT,CAAA;AAEA,IAAA,MAAM,qBAAA,GAAwB,CAC5B,IAAA,EACA,QAAA,EACA,YAAA,KACuB;AACvB,MAAA,IAAI,IAAA,CAAK,WAAW,CAAA,EAAG;AACrB,QAAA,MAAM,CAAC,KAAK,CAAA,GAAI,IAAA;AAEhB,QAAA,IAAI,KAAA,KAAU,QAAW,OAAO,MAAA;AAEhC,QAAA,MAAM,CAAA,GAAI,4BAA4B,KAAK,CAAA;AAG3C,QAAA,IAAI,CAAA,KAAM,MAAA,EAAW,OAAO,kBAAA,CAAmB,QAAQ,CAAC,CAAA;AAExD,QAAA,MAAM,OAAA,GAAU,gCAAgC,KAAK,CAAA;AAGrD,QAAA,OAAO,OAAA,KAAY,MAAA,GACf,MAAA,GACA,kBAAA,CAAmB,YAAY,OAAO,CAAA;AAAA,MAC5C;AAEA,MAAA,IAAI,IAAA,CAAK,WAAW,CAAA,EAAG;AACrB,QAAA,MAAM,CAAC,KAAA,EAAO,WAAW,CAAA,GAAI,IAAA;AAE7B,QAAA,IACE,UAAU,MAAA,IACV,WAAA,KAAgB,UAChB,2BAAA,CAA4B,KAAK,MAAM,CAAA,EACvC;AACA,UAAA,OAAO,MAAA;AAAA,QACT;AAGA,QAAA,MAAM,CAAA,GAAI,4BAA4B,WAAW,CAAA;AAEjD,QAAA,IAAI,CAAA,KAAM,MAAA,EAAW,OAAO,kBAAA,CAAmB,QAAQ,CAAC,CAAA;AAKxD,QAAA,IAAI,CAAC,iBAAA,CAAkB,QAAQ,CAAA,EAAG,OAAO,MAAA;AAEzC,QAAA,MAAM,CAAA,GAAI,gBAAA,CAAiB,WAAA,EAAa,YAAY,CAAA;AAEpD,QAAA,OAAO,CAAA,KAAM,MAAA,GAAY,MAAA,GAAY,kBAAA,CAAmB,YAAY,CAAC,CAAA;AAAA,MACvE;AAEA,MAAA,IAAI,IAAA,CAAK,WAAW,CAAA,EAAG;AACrB,QAAA,MAAM,CAAC,KAAA,EAAO,WAAA,EAAa,IAAI,CAAA,GAAI,IAAA;AAEnC,QAAA,IACE,KAAA,KAAU,MAAA,IACV,WAAA,KAAgB,MAAA,IAChB,IAAA,KAAS,MAAA,IACT,IAAA,CAAK,IAAA,KAAS,cAAA,CAAe,aAAA,IAC7B,2BAAA,CAA4B,WAAW,MAAM,CAAA,EAC7C;AACA,UAAA,OAAO,MAAA;AAAA,QACT;AAGA,QAAA,IAAI,2BAAA,CAA4B,KAAK,CAAA,KAAM,CAAA,EAAG;AAC5C,UAAA,OAAO,EAAE,EAAA,EAAI,aAAA,EAAe,QAAA,EAAU,SAAA,CAAU,IAAI,CAAA,EAAE;AAAA,QACxD;AAGA,QAAA,IACE,kBAAkB,QAAQ,CAAA,IAC1B,sBAAA,CAAuB,KAAA,EAAO,YAAY,CAAA,EAC1C;AACA,UAAA,OAAO,EAAE,EAAA,EAAI,UAAA,EAAY,QAAA,EAAU,SAAA,CAAU,IAAI,CAAA,EAAE;AAAA,QACrD;AAEA,QAAA,OAAO,MAAA;AAAA,MACT;AAEA,MAAA,OAAO,MAAA;AAAA,IACT,CAAA;AAEA,IAAA,OAAO;AAAA,MACL,cAAA,EAAgB,CAAC,IAAA,KAAS;AACxB,QAAA,MAAM,SAAS,IAAA,CAAK,MAAA;AAEpB,QAAA,IACE,MAAA,CAAO,IAAA,KAAS,cAAA,CAAe,gBAAA,IAC/B,MAAA,CAAO,YACP,MAAA,CAAO,QAAA,CAAS,IAAA,KAAS,cAAA,CAAe,UAAA,EACxC;AACA,UAAA;AAAA,QACF;AAEA,QAAA,MAAM,UAAA,GAAa,OAAO,QAAA,CAAS,IAAA;AAEnC,QAAA,MAAM,WAAW,MAAA,CAAO,MAAA;AAIxB,QAAA,IAAI,UAAA,KAAe,MAAA,IAAU,UAAA,KAAe,UAAA,EAAY;AACtD,UAAA,MAAM,WAAA,GACH,QAAA,CAAS,IAAA,KAAS,cAAA,CAAe,UAAA,IAChC,QAAA,CAAS,IAAA,KAAS,YAAA,IACnB,QAAA,CAAS,IAAA,KAAS,cAAA,CAAe,gBAAA,IAChC,CAAC,QAAA,CAAS,QAAA,IACV,QAAA,CAAS,MAAA,CAAO,IAAA,KAAS,cAAA,CAAe,UAAA,IACxC,QAAA,CAAS,OAAO,IAAA,KAAS,kBAAA,IACzB,QAAA,CAAS,QAAA,CAAS,IAAA,KAAS,cAAA,CAAe,UAAA,IAC1C,QAAA,CAAS,SAAS,IAAA,KAAS,KAAA;AAE/B,UAAA,MAAM,CAAC,QAAA,EAAU,QAAQ,CAAA,GAAI,IAAA,CAAK,SAAA;AAElC,UAAA,IACE,eACA,IAAA,CAAK,SAAA,CAAU,MAAA,KAAW,CAAA,IAC1B,aAAa,MAAA,IACb,QAAA,CAAS,IAAA,KAAS,cAAA,CAAe,iBACjC,QAAA,KAAa,MAAA,IACb,2BAAA,CAA4B,QAAQ,MAAM,CAAA,EAC1C;AACA,YAAA,MAAA;AAAA,cACE,IAAA;AAAA,cACA,EAAE,EAAA,EAAI,UAAA,KAAe,MAAA,GAAS,SAAS,SAAA,EAAU;AAAA,cACjD,UAAU,QAAQ;AAAA,aACpB;AAAA,UACF;AAEA,UAAA;AAAA,QACF;AAGA,QAAA,IACE,UAAA,KAAe,QAAA,IACf,QAAA,CAAS,IAAA,KAAS,eAAe,eAAA,EACjC;AACA,UAAA,MAAM,CAAC,OAAO,CAAA,GAAI,QAAA,CAAS,QAAA;AAE3B,UAAA,MAAM,CAAC,GAAG,CAAA,GAAI,IAAA,CAAK,SAAA;AAEnB,UAAA,IACE,QAAA,CAAS,QAAA,CAAS,MAAA,KAAW,CAAA,IAC7B,OAAA,KAAY,IAAA,IACZ,OAAA,KAAY,MAAA,IACZ,OAAA,CAAQ,IAAA,KAAS,cAAA,CAAe,aAAA,IAChC,IAAA,CAAK,UAAU,MAAA,KAAW,CAAA,IAC1B,GAAA,KAAQ,MAAA,IACR,GAAA,CAAI,IAAA,KAAS,cAAA,CAAe,aAAA,IAC5B,kBAAA,CAAmB,SAAA,CAAU,GAAG,CAAC,CAAA,EACjC;AACA,YAAA,MAAA;AAAA,cACE,IAAA;AAAA,cACA,EAAE,EAAA,EAAI,aAAA,EAAe,QAAA,EAAU,SAAA,CAAU,OAAO,CAAA,EAAE;AAAA,cAClD,UAAU,GAAG;AAAA,aACf;AAAA,UACF;AAEA,UAAA;AAAA,QACF;AAEA,QAAA,IACE,eAAe,OAAA,IACf,UAAA,KAAe,eACf,UAAA,KAAe,QAAA,IACf,eAAe,QAAA,EACf;AACA,UAAA;AAAA,QACF;AAIA,QAAA,IAAI,CAAC,kBAAA,CAAmB,SAAA,CAAU,QAAQ,CAAC,CAAA,EAAG;AAE9C,QAAA,MAAM,YAAA,GAAe,UAAA,CAAW,OAAA,CAAQ,QAAQ,CAAA;AAEhD,QAAA,QAAQ,UAAA;AAAY,UAClB,KAAK,OAAA,EAAS;AACZ,YAAA,MAAM,EAAA,GAAK,iBAAA,CAAkB,IAAA,CAAK,SAAA,EAAW,QAAQ,CAAA;AAErD,YAAA,IAAI,OAAO,MAAA,EAAW,MAAA,CAAO,MAAM,EAAA,EAAI,SAAA,CAAU,QAAQ,CAAC,CAAA;AAE1D,YAAA;AAAA,UACF;AAAA,UAEA,KAAK,WAAA,EAAa;AAChB,YAAA,MAAM,EAAA,GAAK,qBAAA;AAAA,cACT,IAAA,CAAK,SAAA;AAAA,cACL,QAAA;AAAA,cACA;AAAA,aACF;AAEA,YAAA,IAAI,OAAO,MAAA,EAAW,MAAA,CAAO,MAAM,EAAA,EAAI,SAAA,CAAU,QAAQ,CAAC,CAAA;AAE1D,YAAA;AAAA,UACF;AAAA,UAEA,KAAK,QAAA,EAAU;AACb,YAAA,MAAM,CAAC,QAAQ,CAAA,GAAI,IAAA,CAAK,SAAA;AAExB,YAAA,IAAI,QAAA,KAAa,MAAA,IAAa,IAAA,CAAK,SAAA,CAAU,WAAW,CAAA,EAAG;AACzD,cAAA;AAAA,YACF;AAEA,YAAA,MAAM,EAAA,GAAK,sBAAA,CAAuB,QAAA,EAAU,QAAA,EAAU,YAAY,CAAA;AAElE,YAAA,IAAI,OAAO,MAAA,EAAW,MAAA,CAAO,MAAM,EAAA,EAAI,SAAA,CAAU,QAAQ,CAAC,CAAA;AAE1D,YAAA;AAAA,UACF;AAAA,UAEA,KAAK,QAAA,EAAU;AACb,YAAA,MAAM,CAAC,GAAG,CAAA,GAAI,IAAA,CAAK,SAAA;AAEnB,YAAA,IACE,IAAA,CAAK,UAAU,MAAA,KAAW,CAAA,IAC1B,QAAQ,MAAA,IACR,GAAA,CAAI,IAAA,KAAS,cAAA,CAAe,aAAA,EAC5B;AACA,cAAA;AAAA,YACF;AAGA,YAAA,IAAI,GAAA,CAAI,IAAA,KAAS,cAAA,CAAe,eAAA,EAAiB;AAC/C,cAAA,MAAM,CAAC,OAAO,CAAA,GAAI,GAAA,CAAI,QAAA;AAEtB,cAAA,IACE,GAAA,CAAI,QAAA,CAAS,MAAA,KAAW,CAAA,IACxB,OAAA,KAAY,IAAA,IACZ,OAAA,KAAY,MAAA,IACZ,OAAA,CAAQ,IAAA,KAAS,cAAA,CAAe,aAAA,EAChC;AACA,gBAAA,MAAA;AAAA,kBACE,IAAA;AAAA,kBACA,EAAE,EAAA,EAAI,UAAA,EAAY,QAAA,EAAU,SAAA,CAAU,OAAO,CAAA,EAAE;AAAA,kBAC/C,UAAU,QAAQ;AAAA,iBACpB;AAAA,cACF;AAEA,cAAA;AAAA,YACF;AAIA,YAAA,IAAI,wBAAA,CAAyB,SAAA,CAAU,GAAG,CAAC,CAAA,EAAG;AAC5C,cAAA,MAAA;AAAA,gBACE,IAAA;AAAA,gBACA,EAAE,EAAA,EAAI,UAAA,EAAY,QAAA,EAAU,SAAA,CAAU,GAAG,CAAA,EAAE;AAAA,gBAC3C,UAAU,QAAQ;AAAA,eACpB;AAAA,YACF;AAAA,UACF;AAAA;AACF,MACF,CAAA;AAAA,MAEA,eAAA,EAAiB,CAAC,IAAA,KAAS;AAGzB,QAAA,IAAI,IAAA,CAAK,QAAA,CAAS,MAAA,KAAW,CAAA,EAAG;AAEhC,QAAA,MAAM,CAAC,KAAA,EAAO,MAAM,CAAA,GAAI,IAAA,CAAK,QAAA;AAE7B,QAAA,IACE,UAAU,IAAA,IACV,KAAA,KAAU,UACV,MAAA,KAAW,IAAA,IACX,WAAW,MAAA,EACX;AACA,UAAA;AAAA,QACF;AAEA,QAAA,MAAM,CAAC,MAAA,EAAQ,IAAA,EAAM,EAAE,IACrB,KAAA,CAAM,IAAA,KAAS,cAAA,CAAe,aAAA,IAC9B,OAAO,IAAA,KAAS,cAAA,CAAe,aAAA,GAC1B,CAAC,OAAO,MAAA,EAAQ,UAAU,CAAA,GAC3B,KAAA,CAAM,IAAA,KAAS,cAAA,CAAe,aAAA,IAC5B,MAAA,CAAO,SAAS,cAAA,CAAe,aAAA,GAC9B,CAAC,MAAA,EAAQ,OAAO,aAAa,CAAA,GAC9B,CAAC,MAAA,EAAW,QAAW,MAAS,CAAA;AAKxC,QAAA,IAAI,WAAW,MAAA,EAAW;AAI1B,QAAA,IAAI,CAAC,kBAAA,CAAmB,SAAA,CAAU,MAAA,CAAO,QAAQ,CAAC,CAAA,EAAG;AAErD,QAAA,MAAA;AAAA,UACE,IAAA;AAAA,UACA,EAAE,EAAA,EAAI,QAAA,EAAU,SAAA,CAAU,IAAI,CAAA,EAAE;AAAA,UAChC,SAAA,CAAU,OAAO,QAAQ;AAAA,SAC3B;AAAA,MACF,CAAA;AAAA,MAEA,gBAAgB,MAAM;AACpB,QAAA,KAAA,MAAW,CAAC,KAAA,EAAO,QAAQ,CAAA,IAAK,cAAA,CAAe,SAAQ,EAAG;AACxD,UAAA,OAAA,CAAQ,MAAA,CAAO;AAAA,YACb,MAAM,QAAA,CAAS,IAAA;AAAA,YACf,SAAA,EAAW,6BAAA;AAAA,YACX,IAAA,EAAM,EAAE,WAAA,EAAa,QAAA,CAAS,WAAA,EAAY;AAAA,YAC1C,GAAA,EAAK,CAAC,KAAA,KAAU;AACd,cAAA,MAAM,WAAA,GACJ,KAAA,KAAU,CAAA,IAAK,cAAA,GACX,gBAAA,CAAiB,KAAA,EAAO,OAAA,EAAS,iBAAA,EAAmB,CAAC,KAAK,CAAC,CAAA,GAC3D,EAAC;AAEP,cAAA,OAAO;AAAA,gBACL,GAAG,WAAA;AAAA,gBACH,KAAA,CAAM,WAAA,CAAY,QAAA,CAAS,IAAA,EAAM,SAAS,WAAW;AAAA,eACvD;AAAA,YACF;AAAA,WACD,CAAA;AAAA,QACH;AAAA,MACF;AAAA,KACF;AAAA,EACF,CAAA;AAAA,EACA,gBAAgB;AAClB;;;;"}

package/dist/rules/prefer-canonical-length-cast.d.mts

@@ -0,0 +1,6 @@
+import { type TSESLint } from '@typescript-eslint/utils';
+type Options = readonly [];
+type MessageIds = 'useCanonicalCast';
+export declare const preferCanonicalLengthCast: TSESLint.RuleModule<MessageIds, Options>;
+export {};
+//# sourceMappingURL=prefer-canonical-length-cast.d.mts.map

package/dist/rules/prefer-canonical-length-cast.d.mts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prefer-canonical-length-cast.d.mts","sourceRoot":"","sources":["../../src/rules/prefer-canonical-length-cast.mts"],"names":[],"mappings":"AAAA,OAAO,EAEL,KAAK,QAAQ,EAEd,MAAM,0BAA0B,CAAC;AAGlC,KAAK,OAAO,GAAG,SAAS,EAAE,CAAC;AAE3B,KAAK,UAAU,GAAG,kBAAkB,CAAC;AAgHrC,eAAO,MAAM,yBAAyB,EAAE,QAAQ,CAAC,UAAU,CACzD,UAAU,EACV,OAAO,CAiEC,CAAC"}

package/dist/rules/prefer-canonical-length-cast.mjs

@@ -0,0 +1,155 @@
+import { AST_NODE_TYPES } from '@typescript-eslint/utils';
+import { getImportedLocalName, getTsDataForgeImport } from './import-utils.mjs';
+
+const CAST_REWRITES = [
+  {
+    cast: "asMinLengthArray",
+    bounds: [1],
+    replacement: "asNonEmptyArray",
+    keep: []
+  },
+  {
+    cast: "asFixedLengthArray",
+    bounds: [0],
+    replacement: "asEmptyArray",
+    keep: []
+  },
+  // Listed before the `anyLength, sameAsFirst` entry so that
+  // `asBoundedLengthArray(0, 0, xs)` lands on `asEmptyArray` in one step.
+  {
+    cast: "asBoundedLengthArray",
+    bounds: [0, 0],
+    replacement: "asEmptyArray",
+    keep: []
+  },
+  {
+    cast: "asBoundedLengthArray",
+    bounds: ["anyLength", "sameAsFirst"],
+    replacement: "asFixedLengthArray",
+    keep: [0]
+  },
+  {
+    cast: "asMaxLengthArray",
+    bounds: [0],
+    replacement: "asEmptyArray",
+    keep: []
+  },
+  {
+    cast: "asMinLengthTuple",
+    bounds: [1],
+    replacement: "asNonEmptyTuple",
+    keep: []
+  },
+  {
+    cast: "asFixedLengthTuple",
+    bounds: [0],
+    replacement: "asEmptyTuple",
+    keep: []
+  },
+  {
+    cast: "asBoundedLengthTuple",
+    bounds: [0, 0],
+    replacement: "asEmptyTuple",
+    keep: []
+  },
+  {
+    cast: "asBoundedLengthTuple",
+    bounds: ["anyLength", "sameAsFirst"],
+    replacement: "asFixedLengthTuple",
+    keep: [0]
+  },
+  {
+    cast: "asMaxLengthTuple",
+    bounds: [0],
+    replacement: "asEmptyTuple",
+    keep: []
+  }
+];
+const preferCanonicalLengthCast = {
+  meta: {
+    type: "suggestion",
+    docs: {
+      description: "Normalize an `Arr` length cast whose bounds are degenerate (e.g. `Arr.asMinLengthArray(1, xs)`, `Arr.asFixedLengthTuple(0, xs)`) to the cast that names that constraint directly, staying within the branded `*Array` or structural `*Tuple` family."
+    },
+    fixable: "code",
+    schema: [],
+    messages: {
+      useCanonicalCast: "Use `{{arrName}}.{{replacement}}(...)` instead of `{{arrName}}.{{cast}}({{boundsText}})`: with these bounds the result type is the same (or stricter), and `{{replacement}}` names the constraint directly."
+    }
+  },
+  create: (context) => {
+    const sourceCode = context.sourceCode;
+    const arrLocalName = getImportedLocalName(
+      getTsDataForgeImport(sourceCode.ast),
+      "Arr"
+    );
+    if (arrLocalName === void 0) return {};
+    return {
+      CallExpression: (node) => {
+        const castName = getCastName(node, arrLocalName);
+        if (castName === void 0) return;
+        const rewrite = CAST_REWRITES.find(
+          (candidate) => candidate.cast === castName && matchesBounds(node, candidate)
+        );
+        if (rewrite === void 0) return;
+        const boundsText = node.arguments.slice(0, rewrite.bounds.length).map((arg) => sourceCode.getText(arg)).join(", ");
+        context.report({
+          node,
+          messageId: "useCanonicalCast",
+          data: {
+            arrName: arrLocalName,
+            cast: castName,
+            boundsText: [boundsText, "\u2026"].join(", "),
+            replacement: rewrite.replacement
+          },
+          fix: (fixer) => [
+            fixer.replaceText(
+              node.callee,
+              `${arrLocalName}.${rewrite.replacement}`
+            ),
+            ...dropBoundsFix(fixer, node, rewrite)
+          ]
+        });
+      }
+    };
+  },
+  defaultOptions: []
+};
+const getCastName = (node, arrLocalName) => {
+  const { callee } = node;
+  return callee.type === AST_NODE_TYPES.MemberExpression && !callee.computed && callee.object.type === AST_NODE_TYPES.Identifier && callee.object.name === arrLocalName && callee.property.type === AST_NODE_TYPES.Identifier ? callee.property.name : void 0;
+};
+const matchesBounds = (node, rewrite) => {
+  const args = node.arguments;
+  const boundCount = rewrite.bounds.length;
+  if (args.length !== boundCount + 1 || node.typeArguments !== void 0) {
+    return false;
+  }
+  if (args.some((arg) => arg.type === AST_NODE_TYPES.SpreadElement)) {
+    return false;
+  }
+  const bounds = args.slice(0, boundCount).map(getLengthLiteral);
+  const [first] = bounds;
+  return rewrite.bounds.every((matcher, index) => {
+    const value = bounds[index];
+    if (value === void 0) return false;
+    switch (matcher) {
+      case "anyLength":
+        return true;
+      case "sameAsFirst":
+        return value === first;
+      default:
+        return value === matcher;
+    }
+  });
+};
+const dropBoundsFix = (fixer, node, rewrite) => rewrite.bounds.flatMap((_, index) => {
+  if (rewrite.keep.includes(index)) return [];
+  const dropped = node.arguments[index];
+  const next = node.arguments[index + 1];
+  return dropped === void 0 || next === void 0 ? [] : [fixer.removeRange([dropped.range[0], next.range[0]])];
+});
+const getLengthLiteral = (node) => node.type === AST_NODE_TYPES.Literal && typeof node.value === "number" && Number.isSafeInteger(node.value) && node.value >= 0 ? node.value : void 0;
+
+export { preferCanonicalLengthCast };
+//# sourceMappingURL=prefer-canonical-length-cast.mjs.map

package/dist/rules/prefer-canonical-length-cast.mjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"prefer-canonical-length-cast.mjs","sources":["../../src/rules/prefer-canonical-length-cast.mts"],"sourcesContent":["import {\n  AST_NODE_TYPES,\n  type TSESLint,\n  type TSESTree,\n} from '@typescript-eslint/utils';\nimport { getImportedLocalName, getTsDataForgeImport } from './import-utils.mjs';\n\ntype Options = readonly [];\n\ntype MessageIds = 'useCanonicalCast';\n\n/** How one leading length argument of a cast call must look. */\ntype BoundMatcher = number | 'anyLength' | 'sameAsFirst';\n\ntype CastRewrite = Readonly<{\n  /** The `Arr` cast the call resolves to. */\n  cast: string;\n  /** One matcher per leading length argument the call must have. */\n  bounds: readonly BoundMatcher[];\n  /** The cast the call is rewritten to. */\n  replacement: string;\n  /** Indices into `bounds` of the length arguments the rewrite keeps, in order. */\n  keep: readonly number[];\n}>;\n\n/**\n * `Arr.as*` casts whose length arguments make them a longhand spelling of\n * another cast.\n *\n * Unlike a `Type<T>` wrapper, a cast only ever *returns* the narrowed value, so\n * a rewrite that strengthens the result type stays safe — the result is\n * assignable everywhere the old one was:\n *\n * | call                                 | canonical form                  | relation |\n * | :----------------------------------- | :------------------------------ | :------- |\n * | `Arr.asMinLengthArray(1, xs)`        | `Arr.asNonEmptyArray(xs)`       | type-identical — `NonEmptyArray<A>` is defined as `MinLengthArray<1, A>` |\n * | `Arr.asFixedLengthArray(0, xs)`      | `Arr.asEmptyArray(xs)`          | type-identical — `asEmptyArray` is the length-0 specialization |\n * | `Arr.asBoundedLengthArray(n, n, xs)` | `Arr.asFixedLengthArray(n, xs)` | strengthens — `FixedLengthArray<N, E>` is `BoundedLengthArray<N, N, E>` intersected with the exact tuple for `N <= 10` |\n * | `Arr.asMaxLengthArray(0, xs)`        | `Arr.asEmptyArray(xs)`          | strengthens — an array of at most `0` elements is an array of exactly `0` |\n * | `Arr.asMinLengthTuple(1, xs)`        | `Arr.asNonEmptyTuple(xs)`       | type-identical — both are `MinLengthTuple<1, E>` |\n * | `Arr.asFixedLengthTuple(0, xs)`      | `Arr.asEmptyTuple(xs)`          | type-identical — both are `readonly []` |\n * | `Arr.asBoundedLengthTuple(n, n, xs)` | `Arr.asFixedLengthTuple(n, xs)` | type-identical — `BoundedLengthTuple<N, N, E>` *is* `FixedLengthTuple<N, E>` |\n * | `Arr.asMaxLengthTuple(0, xs)`        | `Arr.asEmptyTuple(xs)`          | type-identical — `MaxLengthTuple<0, E>` is `readonly []` |\n *\n * Each family is rewritten within its own lane — the branded `*Array` casts to\n * `asEmptyArray` / `asNonEmptyArray`, the structural `*Tuple` casts to\n * `asEmptyTuple` / `asNonEmptyTuple` — so a rewrite never moves a value across\n * the branded/structural divide, matching `prefer-canonical-length-guard`.\n *\n * `Arr.asBoundedLengthArray(0, n, xs)` → `Arr.asMaxLengthArray(n, xs)` is\n * deliberately absent: it would *drop* the `MinLengthArray<0, E>` brand, which\n * is a widening rather than a rename.\n *\n * Only the runtime `TypeError` message changes, to the one that names the\n * constraint actually being checked.\n */\nconst CAST_REWRITES = [\n  {\n    cast: 'asMinLengthArray',\n    bounds: [1],\n    replacement: 'asNonEmptyArray',\n    keep: [],\n  },\n  {\n    cast: 'asFixedLengthArray',\n    bounds: [0],\n    replacement: 'asEmptyArray',\n    keep: [],\n  },\n  // Listed before the `anyLength, sameAsFirst` entry so that\n  // `asBoundedLengthArray(0, 0, xs)` lands on `asEmptyArray` in one step.\n  {\n    cast: 'asBoundedLengthArray',\n    bounds: [0, 0],\n    replacement: 'asEmptyArray',\n    keep: [],\n  },\n  {\n    cast: 'asBoundedLengthArray',\n    bounds: ['anyLength', 'sameAsFirst'],\n    replacement: 'asFixedLengthArray',\n    keep: [0],\n  },\n  {\n    cast: 'asMaxLengthArray',\n    bounds: [0],\n    replacement: 'asEmptyArray',\n    keep: [],\n  },\n  {\n    cast: 'asMinLengthTuple',\n    bounds: [1],\n    replacement: 'asNonEmptyTuple',\n    keep: [],\n  },\n  {\n    cast: 'asFixedLengthTuple',\n    bounds: [0],\n    replacement: 'asEmptyTuple',\n    keep: [],\n  },\n  {\n    cast: 'asBoundedLengthTuple',\n    bounds: [0, 0],\n    replacement: 'asEmptyTuple',\n    keep: [],\n  },\n  {\n    cast: 'asBoundedLengthTuple',\n    bounds: ['anyLength', 'sameAsFirst'],\n    replacement: 'asFixedLengthTuple',\n    keep: [0],\n  },\n  {\n    cast: 'asMaxLengthTuple',\n    bounds: [0],\n    replacement: 'asEmptyTuple',\n    keep: [],\n  },\n] as const satisfies readonly CastRewrite[];\n\nexport const preferCanonicalLengthCast: TSESLint.RuleModule<\n  MessageIds,\n  Options\n> = {\n  meta: {\n    type: 'suggestion',\n    docs: {\n      description:\n        'Normalize an `Arr` length cast whose bounds are degenerate (e.g. `Arr.asMinLengthArray(1, xs)`, `Arr.asFixedLengthTuple(0, xs)`) to the cast that names that constraint directly, staying within the branded `*Array` or structural `*Tuple` family.',\n    },\n    fixable: 'code',\n    schema: [],\n    messages: {\n      useCanonicalCast:\n        'Use `{{arrName}}.{{replacement}}(...)` instead of `{{arrName}}.{{cast}}({{boundsText}})`: with these bounds the result type is the same (or stricter), and `{{replacement}}` names the constraint directly.',\n    },\n  },\n\n  create: (context) => {\n    const sourceCode = context.sourceCode;\n\n    const arrLocalName = getImportedLocalName(\n      getTsDataForgeImport(sourceCode.ast),\n      'Arr',\n    );\n\n    if (arrLocalName === undefined) return {};\n\n    return {\n      CallExpression: (node) => {\n        const castName = getCastName(node, arrLocalName);\n\n        if (castName === undefined) return;\n\n        const rewrite = CAST_REWRITES.find(\n          (candidate) =>\n            candidate.cast === castName && matchesBounds(node, candidate),\n        );\n\n        if (rewrite === undefined) return;\n\n        const boundsText = node.arguments\n          .slice(0, rewrite.bounds.length)\n          .map((arg) => sourceCode.getText(arg))\n          .join(', ');\n\n        context.report({\n          node,\n          messageId: 'useCanonicalCast',\n          data: {\n            arrName: arrLocalName,\n            cast: castName,\n            boundsText: [boundsText, '…'].join(', '),\n            replacement: rewrite.replacement,\n          },\n          fix: (fixer) => [\n            fixer.replaceText(\n              node.callee,\n              `${arrLocalName}.${rewrite.replacement}`,\n            ),\n            ...dropBoundsFix(fixer, node, rewrite),\n          ],\n        });\n      },\n    };\n  },\n  defaultOptions: [],\n} as const;\n\n/** The `Arr.<cast>` method name of `node`, or `undefined` for other calls. */\nconst getCastName = (\n  // AST nodes hold mutable child arrays, so they are not deeply readonly.\n  // eslint-disable-next-line @typescript-eslint/prefer-readonly-parameter-types\n  node: TSESTree.CallExpression,\n  arrLocalName: string,\n): string | undefined => {\n  const { callee } = node;\n\n  return callee.type === AST_NODE_TYPES.MemberExpression &&\n    !callee.computed &&\n    callee.object.type === AST_NODE_TYPES.Identifier &&\n    callee.object.name === arrLocalName &&\n    callee.property.type === AST_NODE_TYPES.Identifier\n    ? callee.property.name\n    : undefined;\n};\n\n/**\n * Whether the call is `cast(...bounds, array)` with every bound written as the\n * exact numeric literal the rewrite requires.\n *\n * The arity check also excludes the curried form (`cast(...bounds)`):\n * `Arr.asNonEmptyArray` has no curried counterpart, and a curried\n * `asFixedLengthArray` would need the bound kept in a different position.\n */\nconst matchesBounds = (\n  // eslint-disable-next-line @typescript-eslint/prefer-readonly-parameter-types\n  node: TSESTree.CallExpression,\n  rewrite: CastRewrite,\n): boolean => {\n  const args = node.arguments;\n\n  const boundCount = rewrite.bounds.length;\n\n  if (args.length !== boundCount + 1 || node.typeArguments !== undefined) {\n    return false;\n  }\n\n  if (args.some((arg) => arg.type === AST_NODE_TYPES.SpreadElement)) {\n    return false;\n  }\n\n  const bounds = args.slice(0, boundCount).map(getLengthLiteral);\n\n  const [first] = bounds;\n\n  return rewrite.bounds.every((matcher, index) => {\n    const value = bounds[index];\n\n    if (value === undefined) return false;\n\n    switch (matcher) {\n      case 'anyLength':\n        return true;\n\n      case 'sameAsFirst':\n        return value === first;\n\n      default:\n        return value === matcher;\n    }\n  });\n};\n\n/**\n * Removes the length arguments the rewrite drops. Each removal runs from the\n * dropped argument up to the start of the next one, so the comma, whitespace\n * and any comments in between go with it; the ranges never overlap.\n */\nconst dropBoundsFix = (\n  fixer: TSESLint.RuleFixer,\n  // AST nodes hold mutable child arrays, so they are not deeply readonly.\n  // eslint-disable-next-line @typescript-eslint/prefer-readonly-parameter-types\n  node: TSESTree.CallExpression,\n  rewrite: CastRewrite,\n): readonly TSESLint.RuleFix[] =>\n  rewrite.bounds.flatMap((_, index) => {\n    if (rewrite.keep.includes(index)) return [];\n\n    const dropped = node.arguments[index];\n\n    const next = node.arguments[index + 1];\n\n    return dropped === undefined || next === undefined\n      ? []\n      : [fixer.removeRange([dropped.range[0], next.range[0]])];\n  });\n\n/** A non-negative integer literal's value, or `undefined` for anything else. */\nconst getLengthLiteral = (\n  // eslint-disable-next-line @typescript-eslint/prefer-readonly-parameter-types\n  node: TSESTree.Node,\n): number | undefined =>\n  node.type === AST_NODE_TYPES.Literal &&\n  typeof node.value === 'number' &&\n  Number.isSafeInteger(node.value) &&\n  node.value >= 0\n    ? node.value\n    : undefined;\n"],"names":[],"mappings":";;;AAwDA,MAAM,aAAA,GAAgB;AAAA,EACpB;AAAA,IACE,IAAA,EAAM,kBAAA;AAAA,IACN,MAAA,EAAQ,CAAC,CAAC,CAAA;AAAA,IACV,WAAA,EAAa,iBAAA;AAAA,IACb,MAAM;AAAC,GACT;AAAA,EACA;AAAA,IACE,IAAA,EAAM,oBAAA;AAAA,IACN,MAAA,EAAQ,CAAC,CAAC,CAAA;AAAA,IACV,WAAA,EAAa,cAAA;AAAA,IACb,MAAM;AAAC,GACT;AAAA;AAAA;AAAA,EAGA;AAAA,IACE,IAAA,EAAM,sBAAA;AAAA,IACN,MAAA,EAAQ,CAAC,CAAA,EAAG,CAAC,CAAA;AAAA,IACb,WAAA,EAAa,cAAA;AAAA,IACb,MAAM;AAAC,GACT;AAAA,EACA;AAAA,IACE,IAAA,EAAM,sBAAA;AAAA,IACN,MAAA,EAAQ,CAAC,WAAA,EAAa,aAAa,CAAA;AAAA,IACnC,WAAA,EAAa,oBAAA;AAAA,IACb,IAAA,EAAM,CAAC,CAAC;AAAA,GACV;AAAA,EACA;AAAA,IACE,IAAA,EAAM,kBAAA;AAAA,IACN,MAAA,EAAQ,CAAC,CAAC,CAAA;AAAA,IACV,WAAA,EAAa,cAAA;AAAA,IACb,MAAM;AAAC,GACT;AAAA,EACA;AAAA,IACE,IAAA,EAAM,kBAAA;AAAA,IACN,MAAA,EAAQ,CAAC,CAAC,CAAA;AAAA,IACV,WAAA,EAAa,iBAAA;AAAA,IACb,MAAM;AAAC,GACT;AAAA,EACA;AAAA,IACE,IAAA,EAAM,oBAAA;AAAA,IACN,MAAA,EAAQ,CAAC,CAAC,CAAA;AAAA,IACV,WAAA,EAAa,cAAA;AAAA,IACb,MAAM;AAAC,GACT;AAAA,EACA;AAAA,IACE,IAAA,EAAM,sBAAA;AAAA,IACN,MAAA,EAAQ,CAAC,CAAA,EAAG,CAAC,CAAA;AAAA,IACb,WAAA,EAAa,cAAA;AAAA,IACb,MAAM;AAAC,GACT;AAAA,EACA;AAAA,IACE,IAAA,EAAM,sBAAA;AAAA,IACN,MAAA,EAAQ,CAAC,WAAA,EAAa,aAAa,CAAA;AAAA,IACnC,WAAA,EAAa,oBAAA;AAAA,IACb,IAAA,EAAM,CAAC,CAAC;AAAA,GACV;AAAA,EACA;AAAA,IACE,IAAA,EAAM,kBAAA;AAAA,IACN,MAAA,EAAQ,CAAC,CAAC,CAAA;AAAA,IACV,WAAA,EAAa,cAAA;AAAA,IACb,MAAM;AAAC;AAEX,CAAA;AAEO,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,gBAAA,EACE;AAAA;AACJ,GACF;AAAA,EAEA,MAAA,EAAQ,CAAC,OAAA,KAAY;AACnB,IAAA,MAAM,aAAa,OAAA,CAAQ,UAAA;AAE3B,IAAA,MAAM,YAAA,GAAe,oBAAA;AAAA,MACnB,oBAAA,CAAqB,WAAW,GAAG,CAAA;AAAA,MACnC;AAAA,KACF;AAEA,IAAA,IAAI,YAAA,KAAiB,MAAA,EAAW,OAAO,EAAC;AAExC,IAAA,OAAO;AAAA,MACL,cAAA,EAAgB,CAAC,IAAA,KAAS;AACxB,QAAA,MAAM,QAAA,GAAW,WAAA,CAAY,IAAA,EAAM,YAAY,CAAA;AAE/C,QAAA,IAAI,aAAa,MAAA,EAAW;AAE5B,QAAA,MAAM,UAAU,aAAA,CAAc,IAAA;AAAA,UAC5B,CAAC,SAAA,KACC,SAAA,CAAU,SAAS,QAAA,IAAY,aAAA,CAAc,MAAM,SAAS;AAAA,SAChE;AAEA,QAAA,IAAI,YAAY,MAAA,EAAW;AAE3B,QAAA,MAAM,aAAa,IAAA,CAAK,SAAA,CACrB,MAAM,CAAA,EAAG,OAAA,CAAQ,OAAO,MAAM,CAAA,CAC9B,GAAA,CAAI,CAAC,QAAQ,UAAA,CAAW,OAAA,CAAQ,GAAG,CAAC,CAAA,CACpC,KAAK,IAAI,CAAA;AAEZ,QAAA,OAAA,CAAQ,MAAA,CAAO;AAAA,UACb,IAAA;AAAA,UACA,SAAA,EAAW,kBAAA;AAAA,UACX,IAAA,EAAM;AAAA,YACJ,OAAA,EAAS,YAAA;AAAA,YACT,IAAA,EAAM,QAAA;AAAA,YACN,YAAY,CAAC,UAAA,EAAY,QAAG,CAAA,CAAE,KAAK,IAAI,CAAA;AAAA,YACvC,aAAa,OAAA,CAAQ;AAAA,WACvB;AAAA,UACA,GAAA,EAAK,CAAC,KAAA,KAAU;AAAA,YACd,KAAA,CAAM,WAAA;AAAA,cACJ,IAAA,CAAK,MAAA;AAAA,cACL,CAAA,EAAG,YAAY,CAAA,CAAA,EAAI,OAAA,CAAQ,WAAW,CAAA;AAAA,aACxC;AAAA,YACA,GAAG,aAAA,CAAc,KAAA,EAAO,IAAA,EAAM,OAAO;AAAA;AACvC,SACD,CAAA;AAAA,MACH;AAAA,KACF;AAAA,EACF,CAAA;AAAA,EACA,gBAAgB;AAClB;AAGA,MAAM,WAAA,GAAc,CAGlB,IAAA,EACA,YAAA,KACuB;AACvB,EAAA,MAAM,EAAE,QAAO,GAAI,IAAA;AAEnB,EAAA,OAAO,MAAA,CAAO,SAAS,cAAA,CAAe,gBAAA,IACpC,CAAC,MAAA,CAAO,QAAA,IACR,MAAA,CAAO,MAAA,CAAO,IAAA,KAAS,cAAA,CAAe,cACtC,MAAA,CAAO,MAAA,CAAO,IAAA,KAAS,YAAA,IACvB,MAAA,CAAO,QAAA,CAAS,SAAS,cAAA,CAAe,UAAA,GACtC,MAAA,CAAO,QAAA,CAAS,IAAA,GAChB,MAAA;AACN,CAAA;AAUA,MAAM,aAAA,GAAgB,CAEpB,IAAA,EACA,OAAA,KACY;AACZ,EAAA,MAAM,OAAO,IAAA,CAAK,SAAA;AAElB,EAAA,MAAM,UAAA,GAAa,QAAQ,MAAA,CAAO,MAAA;AAElC,EAAA,IAAI,KAAK,MAAA,KAAW,UAAA,GAAa,CAAA,IAAK,IAAA,CAAK,kBAAkB,MAAA,EAAW;AACtE,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,IAAI,IAAA,CAAK,KAAK,CAAC,GAAA,KAAQ,IAAI,IAAA,KAAS,cAAA,CAAe,aAAa,CAAA,EAAG;AACjE,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,MAAM,SAAS,IAAA,CAAK,KAAA,CAAM,GAAG,UAAU,CAAA,CAAE,IAAI,gBAAgB,CAAA;AAE7D,EAAA,MAAM,CAAC,KAAK,CAAA,GAAI,MAAA;AAEhB,EAAA,OAAO,OAAA,CAAQ,MAAA,CAAO,KAAA,CAAM,CAAC,SAAS,KAAA,KAAU;AAC9C,IAAA,MAAM,KAAA,GAAQ,OAAO,KAAK,CAAA;AAE1B,IAAA,IAAI,KAAA,KAAU,QAAW,OAAO,KAAA;AAEhC,IAAA,QAAQ,OAAA;AAAS,MACf,KAAK,WAAA;AACH,QAAA,OAAO,IAAA;AAAA,MAET,KAAK,aAAA;AACH,QAAA,OAAO,KAAA,KAAU,KAAA;AAAA,MAEnB;AACE,QAAA,OAAO,KAAA,KAAU,OAAA;AAAA;AACrB,EACF,CAAC,CAAA;AACH,CAAA;AAOA,MAAM,aAAA,GAAgB,CACpB,KAAA,EAGA,IAAA,EACA,OAAA,KAEA,QAAQ,MAAA,CAAO,OAAA,CAAQ,CAAC,CAAA,EAAG,KAAA,KAAU;AACnC,EAAA,IAAI,QAAQ,IAAA,CAAK,QAAA,CAAS,KAAK,CAAA,SAAU,EAAC;AAE1C,EAAA,MAAM,OAAA,GAAU,IAAA,CAAK,SAAA,CAAU,KAAK,CAAA;AAEpC,EAAA,MAAM,IAAA,GAAO,IAAA,CAAK,SAAA,CAAU,KAAA,GAAQ,CAAC,CAAA;AAErC,EAAA,OAAO,YAAY,MAAA,IAAa,IAAA,KAAS,SACrC,EAAC,GACD,CAAC,KAAA,CAAM,WAAA,CAAY,CAAC,OAAA,CAAQ,KAAA,CAAM,CAAC,CAAA,EAAG,IAAA,CAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAA;AAC3D,CAAC,CAAA;AAGH,MAAM,gBAAA,GAAmB,CAEvB,IAAA,KAEA,IAAA,CAAK,SAAS,cAAA,CAAe,OAAA,IAC7B,OAAO,IAAA,CAAK,KAAA,KAAU,YACtB,MAAA,CAAO,aAAA,CAAc,KAAK,KAAK,CAAA,IAC/B,KAAK,KAAA,IAAS,CAAA,GACV,KAAK,KAAA,GACL,MAAA;;;;"}

package/dist/rules/prefer-canonical-length-guard.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"prefer-canonical-length-guard.d.mts","sourceRoot":"","sources":["../../src/rules/prefer-canonical-length-guard.mts"],"names":[],"mappings":"AAAA,OAAO,EAEL,KAAK,QAAQ,EAEd,MAAM,0BAA0B,CAAC;AAQlC,KAAK,OAAO,GAAG,SAAS,EAAE,CAAC;AAE3B,KAAK,UAAU,GACX,mBAAmB,GACnB,yBAAyB,GACzB,uBAAuB,GACvB,qBAAqB,GACrB,qBAAqB,GACrB,eAAe,CAAC;AA8DpB,eAAO,MAAM,0BAA0B,EAAE,QAAQ,CAAC,UAAU,CAC1D,UAAU,EACV,OAAO,CAqEC,CAAC"}
+{"version":3,"file":"prefer-canonical-length-guard.d.mts","sourceRoot":"","sources":["../../src/rules/prefer-canonical-length-guard.mts"],"names":[],"mappings":"AAAA,OAAO,EAEL,KAAK,QAAQ,EAEd,MAAM,0BAA0B,CAAC;AAQlC,KAAK,OAAO,GAAG,SAAS,EAAE,CAAC;AAE3B,KAAK,UAAU,GACX,mBAAmB,GACnB,yBAAyB,GACzB,uBAAuB,GACvB,qBAAqB,GACrB,qBAAqB,GACrB,eAAe,CAAC;AA8EpB,eAAO,MAAM,0BAA0B,EAAE,QAAQ,CAAC,UAAU,CAC1D,UAAU,EACV,OAAO,CAsEC,CAAC"}

package/dist/rules/prefer-canonical-length-guard.mjs

@@ -23,19 +23,23 @@ const MESSAGES = {
 };
 const GUARD_REWRITES = [
   { guard: "isFixedLengthArray", bounds: [0], replacement: "isEmpty" },
-  { guard: "isFixedLengthTuple", bounds: [0], replacement: "isEmpty" },
-  { guard: "isMaxLengthTuple", bounds: [0], replacement: "isEmpty" },
   { guard: "isMaxLengthArray", bounds: [0], replacement: "isEmpty" },
-  { guard: "isBoundedLengthTuple", bounds: [0, 0], replacement: "isEmpty" },
   { guard: "isBoundedLengthArray", bounds: [0, 0], replacement: "isEmpty" },
   { guard: "isMinLengthArray", bounds: [1], replacement: "isNonEmpty" },
-  { guard: "isMinLengthTuple", bounds: [1], replacement: "isNonEmpty" }
+  { guard: "isFixedLengthTuple", bounds: [0], replacement: "isEmptyTuple" },
+  { guard: "isMaxLengthTuple", bounds: [0], replacement: "isEmptyTuple" },
+  {
+    guard: "isBoundedLengthTuple",
+    bounds: [0, 0],
+    replacement: "isEmptyTuple"
+  },
+  { guard: "isMinLengthTuple", bounds: [1], replacement: "isNonEmptyTuple" }
 ];
 const preferCanonicalLengthGuard = {
   meta: {
     type: "suggestion",
     docs: {
-      description: "Normalize array-length checks to their canonical `Arr` guard: `xs.length <op> n` becomes the matching `Arr.is*` guard, and degenerate guards (e.g. `Arr.isFixedLengthTuple(xs, 0)`) become `Arr.isEmpty` / `Arr.isNonEmpty`."
+      description: "Normalize array-length checks to their canonical `Arr` guard: `xs.length <op> n` becomes the matching `Arr.is*` guard, and a degenerate guard becomes the named one for its family (`Arr.isFixedLengthArray(0, xs)` \u2192 `Arr.isEmpty`, `Arr.isFixedLengthTuple(0, xs)` \u2192 `Arr.isEmptyTuple`)."
     },
     fixable: "code",
     schema: [],
@@ -63,7 +67,7 @@ const preferCanonicalLengthGuard = {
           if (rewrite === void 0 || !matchesBounds(node, rewrite.bounds)) {
             return;
           }
-          const [array] = node.arguments;
+          const array = node.arguments[rewrite.bounds.length];
           if (array === void 0) return;
           const arrayText = sourceCode.getText(array);
           context.report({
@@ -72,7 +76,7 @@ const preferCanonicalLengthGuard = {
             data: {
               arrName: arrLocalName,
               guard: guardName,
-              boundsText: ["\u2026", ...rewrite.bounds.map(String)].join(", "),
+              boundsText: [...rewrite.bounds.map(String), "\u2026"].join(", "),
               replacement: rewrite.replacement
             },
             fix: (fixer) => fixer.replaceText(
@@ -117,7 +121,7 @@ const matchesBounds = (node, bounds) => {
     return false;
   }
   return args.every(
-    (arg, index) => arg.type !== AST_NODE_TYPES.SpreadElement && (index === 0 || arg.type === AST_NODE_TYPES.Literal && arg.value === bounds[index - 1])
+    (arg, index) => arg.type !== AST_NODE_TYPES.SpreadElement && (index === bounds.length || arg.type === AST_NODE_TYPES.Literal && arg.value === bounds[index])
   );
 };
 

package/dist/rules/prefer-canonical-length-guard.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"prefer-canonical-length-guard.mjs","sources":["../../src/rules/prefer-canonical-length-guard.mts"],"sourcesContent":["import {\n  AST_NODE_TYPES,\n  type TSESLint,\n  type TSESTree,\n} from '@typescript-eslint/utils';\nimport { getImportedLocalName, getTsDataForgeImport } from './import-utils.mjs';\nimport { preferArrIsBoundedLengthArray } from './prefer-arr-is-bounded-length-array.mjs';\nimport { preferArrIsFixedLengthArray } from './prefer-arr-is-fixed-length-array.mjs';\nimport { preferArrIsMaxLengthArray } from './prefer-arr-is-max-length-array.mjs';\nimport { preferArrIsMinLengthArray } from './prefer-arr-is-min-length-array.mjs';\nimport { preferArrIsNonEmpty } from './prefer-arr-is-non-empty.mjs';\n\ntype Options = readonly [];\n\ntype MessageIds =\n  | 'useCanonicalGuard'\n  | 'useIsBoundedLengthArray'\n  | 'useIsFixedLengthArray'\n  | 'useIsMaxLengthArray'\n  | 'useIsMinLengthArray'\n  | 'useIsNonEmpty';\n\n/**\n * The `xs.length <op> n` → `Arr.is*` rules folded into this one.\n *\n * Their implementations are reused as-is rather than rewritten: this rule\n * merges their visitors, so every case they already cover (type-aware array\n * checks, `Arr` import insertion, the `&&`-bounded-range special case) keeps\n * behaving exactly as before, and their co-located tests keep exercising them\n * directly.\n */\nconst COMPARISON_RULES = [\n  preferArrIsNonEmpty,\n  preferArrIsMinLengthArray,\n  preferArrIsMaxLengthArray,\n  preferArrIsBoundedLengthArray,\n  preferArrIsFixedLengthArray,\n] as const;\n\nconst MESSAGES = {\n  useCanonicalGuard:\n    'Replace `{{arrName}}.{{guard}}({{boundsText}})` with `{{arrName}}.{{replacement}}(...)`: the bound makes the two guards equivalent.',\n  useIsNonEmpty: preferArrIsNonEmpty.meta.messages.useIsNonEmpty,\n  useIsMinLengthArray:\n    preferArrIsMinLengthArray.meta.messages.useIsMinLengthArray,\n  useIsMaxLengthArray:\n    preferArrIsMaxLengthArray.meta.messages.useIsMaxLengthArray,\n  useIsBoundedLengthArray:\n    preferArrIsBoundedLengthArray.meta.messages.useIsBoundedLengthArray,\n  useIsFixedLengthArray:\n    preferArrIsFixedLengthArray.meta.messages.useIsFixedLengthArray,\n} as const satisfies Record<MessageIds, string>;\n\n/**\n * Length guards whose bound makes them redundant with `Arr.isEmpty` /\n * `Arr.isNonEmpty`, keyed by guard name.\n *\n * `isEmpty` narrows to `FixedLengthArray<0, E> & Xs` and `isNonEmpty` to\n * `MinLengthArray<1, E> & Xs`, so:\n *\n * - The `*Array` entries are **type-identical** — `isFixedLengthArray(xs, 0)`\n *   and `isMinLengthArray(xs, 1)` produce exactly those types.\n * - The `*Tuple` entries **narrow**: they resolve to the structural\n *   `readonly []` / `readonly [E, ...E[]]`, and the canonical guards add the\n *   brand on top. The result stays assignable everywhere the old type was, so\n *   the rewrite is safe, but it is a strengthening rather than a pure rename.\n */\nconst GUARD_REWRITES = [\n  { guard: 'isFixedLengthArray', bounds: [0], replacement: 'isEmpty' },\n  { guard: 'isFixedLengthTuple', bounds: [0], replacement: 'isEmpty' },\n  { guard: 'isMaxLengthTuple', bounds: [0], replacement: 'isEmpty' },\n  { guard: 'isMaxLengthArray', bounds: [0], replacement: 'isEmpty' },\n  { guard: 'isBoundedLengthTuple', bounds: [0, 0], replacement: 'isEmpty' },\n  { guard: 'isBoundedLengthArray', bounds: [0, 0], replacement: 'isEmpty' },\n  { guard: 'isMinLengthArray', bounds: [1], replacement: 'isNonEmpty' },\n  { guard: 'isMinLengthTuple', bounds: [1], replacement: 'isNonEmpty' },\n] as const satisfies readonly Readonly<{\n  guard: string;\n  bounds: readonly number[];\n  replacement: string;\n}>[];\n\nexport const preferCanonicalLengthGuard: TSESLint.RuleModule<\n  MessageIds,\n  Options\n> = {\n  meta: {\n    type: 'suggestion',\n    docs: {\n      description:\n        'Normalize array-length checks to their canonical `Arr` guard: `xs.length <op> n` becomes the matching `Arr.is*` guard, and degenerate guards (e.g. `Arr.isFixedLengthTuple(xs, 0)`) become `Arr.isEmpty` / `Arr.isNonEmpty`.',\n    },\n    fixable: 'code',\n    schema: [],\n    messages: MESSAGES,\n  },\n\n  create: (context) => {\n    const sourceCode = context.sourceCode;\n\n    const arrLocalName = getImportedLocalName(\n      getTsDataForgeImport(sourceCode.ast),\n      'Arr',\n    );\n\n    const comparisonVisitors = COMPARISON_RULES.map((rule) =>\n      rule.create(context),\n    );\n\n    if (arrLocalName === undefined) return mergeVisitors(comparisonVisitors);\n\n    return mergeVisitors([\n      ...comparisonVisitors,\n      {\n        CallExpression: (node) => {\n          const guardName = getGuardName(node, arrLocalName);\n\n          if (guardName === undefined) return;\n\n          const rewrite = GUARD_REWRITES.find(\n            (entry) => entry.guard === guardName,\n          );\n\n          if (rewrite === undefined || !matchesBounds(node, rewrite.bounds)) {\n            return;\n          }\n\n          const [array] = node.arguments;\n\n          if (array === undefined) return;\n\n          const arrayText = sourceCode.getText(array);\n\n          context.report({\n            node,\n            messageId: 'useCanonicalGuard',\n            data: {\n              arrName: arrLocalName,\n              guard: guardName,\n              boundsText: ['…', ...rewrite.bounds.map(String)].join(', '),\n              replacement: rewrite.replacement,\n            },\n            fix: (fixer) =>\n              fixer.replaceText(\n                node,\n                `${arrLocalName}.${rewrite.replacement}(${arrayText})`,\n              ),\n          });\n        },\n      },\n    ]);\n  },\n  defaultOptions: [],\n} as const;\n\n/**\n * Combines several rule listeners into one, calling every handler registered\n * for a given selector in order.\n */\nconst mergeVisitors = (\n  // `RuleListener` holds mutable AST handler signatures, so it is not deeply\n  // readonly.\n  // eslint-disable-next-line @typescript-eslint/prefer-readonly-parameter-types\n  visitors: readonly TSESLint.RuleListener[],\n): TSESLint.RuleListener => {\n  const mut_merged: Record<string, ((node: never) => void)[]> = {};\n\n  for (const visitor of visitors) {\n    for (const [selector, handler] of Object.entries(visitor)) {\n      if (typeof handler !== 'function') continue;\n\n      const mut_handlers = mut_merged[selector] ?? [];\n\n      mut_handlers.push(handler);\n\n      mut_merged[selector] = mut_handlers;\n    }\n  }\n\n  return Object.fromEntries(\n    Object.entries(mut_merged).map(([selector, handlers]) => [\n      selector,\n      (node: never) => {\n        for (const handler of handlers) {\n          handler(node);\n        }\n      },\n    ]),\n  );\n};\n\n/** The `Arr.<guard>` method name of `node`, or `undefined` for other calls. */\nconst getGuardName = (\n  // eslint-disable-next-line @typescript-eslint/prefer-readonly-parameter-types\n  node: TSESTree.CallExpression,\n  arrLocalName: string,\n): string | undefined => {\n  const { callee } = node;\n\n  return callee.type === AST_NODE_TYPES.MemberExpression &&\n    !callee.computed &&\n    callee.object.type === AST_NODE_TYPES.Identifier &&\n    callee.object.name === arrLocalName &&\n    callee.property.type === AST_NODE_TYPES.Identifier\n    ? callee.property.name\n    : undefined;\n};\n\n/**\n * Whether the call is `guard(array, ...bounds)` with every bound written as the\n * exact numeric literal the rewrite requires.\n */\nconst matchesBounds = (\n  // eslint-disable-next-line @typescript-eslint/prefer-readonly-parameter-types\n  node: TSESTree.CallExpression,\n  bounds: readonly number[],\n): boolean => {\n  const args = node.arguments;\n\n  if (args.length !== bounds.length + 1 || node.typeArguments !== undefined) {\n    return false;\n  }\n\n  return args.every(\n    (arg, index) =>\n      arg.type !== AST_NODE_TYPES.SpreadElement &&\n      (index === 0 ||\n        (arg.type === AST_NODE_TYPES.Literal &&\n          arg.value === bounds[index - 1])),\n  );\n};\n"],"names":[],"mappings":";;;;;;;;AA+BA,MAAM,gBAAA,GAAmB;AAAA,EACvB,mBAAA;AAAA,EACA,yBAAA;AAAA,EACA,yBAAA;AAAA,EACA,6BAAA;AAAA,EACA;AACF,CAAA;AAEA,MAAM,QAAA,GAAW;AAAA,EACf,iBAAA,EACE,qIAAA;AAAA,EACF,aAAA,EAAe,mBAAA,CAAoB,IAAA,CAAK,QAAA,CAAS,aAAA;AAAA,EACjD,mBAAA,EACE,yBAAA,CAA0B,IAAA,CAAK,QAAA,CAAS,mBAAA;AAAA,EAC1C,mBAAA,EACE,yBAAA,CAA0B,IAAA,CAAK,QAAA,CAAS,mBAAA;AAAA,EAC1C,uBAAA,EACE,6BAAA,CAA8B,IAAA,CAAK,QAAA,CAAS,uBAAA;AAAA,EAC9C,qBAAA,EACE,2BAAA,CAA4B,IAAA,CAAK,QAAA,CAAS;AAC9C,CAAA;AAgBA,MAAM,cAAA,GAAiB;AAAA,EACrB,EAAE,OAAO,oBAAA,EAAsB,MAAA,EAAQ,CAAC,CAAC,CAAA,EAAG,aAAa,SAAA,EAAU;AAAA,EACnE,EAAE,OAAO,oBAAA,EAAsB,MAAA,EAAQ,CAAC,CAAC,CAAA,EAAG,aAAa,SAAA,EAAU;AAAA,EACnE,EAAE,OAAO,kBAAA,EAAoB,MAAA,EAAQ,CAAC,CAAC,CAAA,EAAG,aAAa,SAAA,EAAU;AAAA,EACjE,EAAE,OAAO,kBAAA,EAAoB,MAAA,EAAQ,CAAC,CAAC,CAAA,EAAG,aAAa,SAAA,EAAU;AAAA,EACjE,EAAE,OAAO,sBAAA,EAAwB,MAAA,EAAQ,CAAC,CAAA,EAAG,CAAC,CAAA,EAAG,WAAA,EAAa,SAAA,EAAU;AAAA,EACxE,EAAE,OAAO,sBAAA,EAAwB,MAAA,EAAQ,CAAC,CAAA,EAAG,CAAC,CAAA,EAAG,WAAA,EAAa,SAAA,EAAU;AAAA,EACxE,EAAE,OAAO,kBAAA,EAAoB,MAAA,EAAQ,CAAC,CAAC,CAAA,EAAG,aAAa,YAAA,EAAa;AAAA,EACpE,EAAE,OAAO,kBAAA,EAAoB,MAAA,EAAQ,CAAC,CAAC,CAAA,EAAG,aAAa,YAAA;AACzD,CAAA;AAMO,MAAM,0BAAA,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,GACZ;AAAA,EAEA,MAAA,EAAQ,CAAC,OAAA,KAAY;AACnB,IAAA,MAAM,aAAa,OAAA,CAAQ,UAAA;AAE3B,IAAA,MAAM,YAAA,GAAe,oBAAA;AAAA,MACnB,oBAAA,CAAqB,WAAW,GAAG,CAAA;AAAA,MACnC;AAAA,KACF;AAEA,IAAA,MAAM,qBAAqB,gBAAA,CAAiB,GAAA;AAAA,MAAI,CAAC,IAAA,KAC/C,IAAA,CAAK,MAAA,CAAO,OAAO;AAAA,KACrB;AAEA,IAAA,IAAI,YAAA,KAAiB,MAAA,EAAW,OAAO,aAAA,CAAc,kBAAkB,CAAA;AAEvE,IAAA,OAAO,aAAA,CAAc;AAAA,MACnB,GAAG,kBAAA;AAAA,MACH;AAAA,QACE,cAAA,EAAgB,CAAC,IAAA,KAAS;AACxB,UAAA,MAAM,SAAA,GAAY,YAAA,CAAa,IAAA,EAAM,YAAY,CAAA;AAEjD,UAAA,IAAI,cAAc,MAAA,EAAW;AAE7B,UAAA,MAAM,UAAU,cAAA,CAAe,IAAA;AAAA,YAC7B,CAAC,KAAA,KAAU,KAAA,CAAM,KAAA,KAAU;AAAA,WAC7B;AAEA,UAAA,IAAI,YAAY,MAAA,IAAa,CAAC,cAAc,IAAA,EAAM,OAAA,CAAQ,MAAM,CAAA,EAAG;AACjE,YAAA;AAAA,UACF;AAEA,UAAA,MAAM,CAAC,KAAK,CAAA,GAAI,IAAA,CAAK,SAAA;AAErB,UAAA,IAAI,UAAU,MAAA,EAAW;AAEzB,UAAA,MAAM,SAAA,GAAY,UAAA,CAAW,OAAA,CAAQ,KAAK,CAAA;AAE1C,UAAA,OAAA,CAAQ,MAAA,CAAO;AAAA,YACb,IAAA;AAAA,YACA,SAAA,EAAW,mBAAA;AAAA,YACX,IAAA,EAAM;AAAA,cACJ,OAAA,EAAS,YAAA;AAAA,cACT,KAAA,EAAO,SAAA;AAAA,cACP,UAAA,EAAY,CAAC,QAAA,EAAK,GAAG,OAAA,CAAQ,MAAA,CAAO,GAAA,CAAI,MAAM,CAAC,CAAA,CAAE,IAAA,CAAK,IAAI,CAAA;AAAA,cAC1D,aAAa,OAAA,CAAQ;AAAA,aACvB;AAAA,YACA,GAAA,EAAK,CAAC,KAAA,KACJ,KAAA,CAAM,WAAA;AAAA,cACJ,IAAA;AAAA,cACA,GAAG,YAAY,CAAA,CAAA,EAAI,OAAA,CAAQ,WAAW,IAAI,SAAS,CAAA,CAAA;AAAA;AACrD,WACH,CAAA;AAAA,QACH;AAAA;AACF,KACD,CAAA;AAAA,EACH,CAAA;AAAA,EACA,gBAAgB;AAClB;AAMA,MAAM,aAAA,GAAgB,CAIpB,QAAA,KAC0B;AAC1B,EAAA,MAAM,aAAwD,EAAC;AAE/D,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,KAAA,MAAW,CAAC,QAAA,EAAU,OAAO,KAAK,MAAA,CAAO,OAAA,CAAQ,OAAO,CAAA,EAAG;AACzD,MAAA,IAAI,OAAO,YAAY,UAAA,EAAY;AAEnC,MAAA,MAAM,YAAA,GAAe,UAAA,CAAW,QAAQ,CAAA,IAAK,EAAC;AAE9C,MAAA,YAAA,CAAa,KAAK,OAAO,CAAA;AAEzB,MAAA,UAAA,CAAW,QAAQ,CAAA,GAAI,YAAA;AAAA,IACzB;AAAA,EACF;AAEA,EAAA,OAAO,MAAA,CAAO,WAAA;AAAA,IACZ,MAAA,CAAO,QAAQ,UAAU,CAAA,CAAE,IAAI,CAAC,CAAC,QAAA,EAAU,QAAQ,CAAA,KAAM;AAAA,MACvD,QAAA;AAAA,MACA,CAAC,IAAA,KAAgB;AACf,QAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,UAAA,OAAA,CAAQ,IAAI,CAAA;AAAA,QACd;AAAA,MACF;AAAA,KACD;AAAA,GACH;AACF,CAAA;AAGA,MAAM,YAAA,GAAe,CAEnB,IAAA,EACA,YAAA,KACuB;AACvB,EAAA,MAAM,EAAE,QAAO,GAAI,IAAA;AAEnB,EAAA,OAAO,MAAA,CAAO,SAAS,cAAA,CAAe,gBAAA,IACpC,CAAC,MAAA,CAAO,QAAA,IACR,MAAA,CAAO,MAAA,CAAO,IAAA,KAAS,cAAA,CAAe,cACtC,MAAA,CAAO,MAAA,CAAO,IAAA,KAAS,YAAA,IACvB,MAAA,CAAO,QAAA,CAAS,SAAS,cAAA,CAAe,UAAA,GACtC,MAAA,CAAO,QAAA,CAAS,IAAA,GAChB,MAAA;AACN,CAAA;AAMA,MAAM,aAAA,GAAgB,CAEpB,IAAA,EACA,MAAA,KACY;AACZ,EAAA,MAAM,OAAO,IAAA,CAAK,SAAA;AAElB,EAAA,IAAI,KAAK,MAAA,KAAW,MAAA,CAAO,SAAS,CAAA,IAAK,IAAA,CAAK,kBAAkB,MAAA,EAAW;AACzE,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,OAAO,IAAA,CAAK,KAAA;AAAA,IACV,CAAC,GAAA,EAAK,KAAA,KACJ,GAAA,CAAI,IAAA,KAAS,eAAe,aAAA,KAC3B,KAAA,KAAU,CAAA,IACR,GAAA,CAAI,SAAS,cAAA,CAAe,OAAA,IAC3B,IAAI,KAAA,KAAU,MAAA,CAAO,QAAQ,CAAC,CAAA;AAAA,GACtC;AACF,CAAA;;;;"}
+{"version":3,"file":"prefer-canonical-length-guard.mjs","sources":["../../src/rules/prefer-canonical-length-guard.mts"],"sourcesContent":["import {\n  AST_NODE_TYPES,\n  type TSESLint,\n  type TSESTree,\n} from '@typescript-eslint/utils';\nimport { getImportedLocalName, getTsDataForgeImport } from './import-utils.mjs';\nimport { preferArrIsBoundedLengthArray } from './prefer-arr-is-bounded-length-array.mjs';\nimport { preferArrIsFixedLengthArray } from './prefer-arr-is-fixed-length-array.mjs';\nimport { preferArrIsMaxLengthArray } from './prefer-arr-is-max-length-array.mjs';\nimport { preferArrIsMinLengthArray } from './prefer-arr-is-min-length-array.mjs';\nimport { preferArrIsNonEmpty } from './prefer-arr-is-non-empty.mjs';\n\ntype Options = readonly [];\n\ntype MessageIds =\n  | 'useCanonicalGuard'\n  | 'useIsBoundedLengthArray'\n  | 'useIsFixedLengthArray'\n  | 'useIsMaxLengthArray'\n  | 'useIsMinLengthArray'\n  | 'useIsNonEmpty';\n\n/**\n * The `xs.length <op> n` → `Arr.is*` rules folded into this one.\n *\n * Their implementations are reused as-is rather than rewritten: this rule\n * merges their visitors, so every case they already cover (type-aware array\n * checks, `Arr` import insertion, the `&&`-bounded-range special case) keeps\n * behaving exactly as before, and their co-located tests keep exercising them\n * directly.\n */\nconst COMPARISON_RULES = [\n  preferArrIsNonEmpty,\n  preferArrIsMinLengthArray,\n  preferArrIsMaxLengthArray,\n  preferArrIsBoundedLengthArray,\n  preferArrIsFixedLengthArray,\n] as const;\n\nconst MESSAGES = {\n  useCanonicalGuard:\n    'Replace `{{arrName}}.{{guard}}({{boundsText}})` with `{{arrName}}.{{replacement}}(...)`: the bound makes the two guards equivalent.',\n  useIsNonEmpty: preferArrIsNonEmpty.meta.messages.useIsNonEmpty,\n  useIsMinLengthArray:\n    preferArrIsMinLengthArray.meta.messages.useIsMinLengthArray,\n  useIsMaxLengthArray:\n    preferArrIsMaxLengthArray.meta.messages.useIsMaxLengthArray,\n  useIsBoundedLengthArray:\n    preferArrIsBoundedLengthArray.meta.messages.useIsBoundedLengthArray,\n  useIsFixedLengthArray:\n    preferArrIsFixedLengthArray.meta.messages.useIsFixedLengthArray,\n} as const satisfies Record<MessageIds, string>;\n\n/**\n * Length guards whose bound makes them redundant with a named degenerate\n * guard, keyed by guard name.\n *\n * Every entry stays inside its own family rather than crossing the\n * branded/structural divide:\n *\n * - the branded `*Array` guards go to `isEmpty` / `isNonEmpty`, which narrow to\n *   `FixedLengthArray<0, E> & Xs` / `MinLengthArray<1, E> & Xs`;\n * - the structural `*Tuple` guards go to `isEmptyTuple` / `isNonEmptyTuple`,\n *   which narrow to `readonly []` / `MinLengthTuple<1, E>`.\n *\n * Most entries are then **type-identical** — `isFixedLengthArray(0, xs)` and\n * `isMinLengthArray(1, xs)` produce exactly what `isEmpty` / `isNonEmpty`\n * narrow to, and `FixedLengthTuple<0, E>`, `MaxLengthTuple<0, E>` and\n * `BoundedLengthTuple<0, 0, E>` are all `readonly []`. Two *strengthen*:\n * `MaxLengthArray<0, E>` and `BoundedLengthArray<0, 0, E>` do not include the\n * `readonly []` structural part that `FixedLengthArray<0, E>` intersects on, so\n * rewriting them to `isEmpty` adds it. That is sound for a guard — the narrowed\n * type only flows outwards, and the stronger type is assignable everywhere the\n * old one was — and it stays within the branded family.\n *\n * Sending a `*Tuple` guard to the branded `isEmpty` would also be sound, but it\n * would silently change which family the value belongs to, which is why each\n * family keeps its own lane.\n */\nconst GUARD_REWRITES = [\n  { guard: 'isFixedLengthArray', bounds: [0], replacement: 'isEmpty' },\n  { guard: 'isMaxLengthArray', bounds: [0], replacement: 'isEmpty' },\n  { guard: 'isBoundedLengthArray', bounds: [0, 0], replacement: 'isEmpty' },\n  { guard: 'isMinLengthArray', bounds: [1], replacement: 'isNonEmpty' },\n  { guard: 'isFixedLengthTuple', bounds: [0], replacement: 'isEmptyTuple' },\n  { guard: 'isMaxLengthTuple', bounds: [0], replacement: 'isEmptyTuple' },\n  {\n    guard: 'isBoundedLengthTuple',\n    bounds: [0, 0],\n    replacement: 'isEmptyTuple',\n  },\n  { guard: 'isMinLengthTuple', bounds: [1], replacement: 'isNonEmptyTuple' },\n] as const satisfies readonly Readonly<{\n  guard: string;\n  bounds: readonly number[];\n  replacement: string;\n}>[];\n\nexport const preferCanonicalLengthGuard: TSESLint.RuleModule<\n  MessageIds,\n  Options\n> = {\n  meta: {\n    type: 'suggestion',\n    docs: {\n      description:\n        'Normalize array-length checks to their canonical `Arr` guard: `xs.length <op> n` becomes the matching `Arr.is*` guard, and a degenerate guard becomes the named one for its family (`Arr.isFixedLengthArray(0, xs)` → `Arr.isEmpty`, `Arr.isFixedLengthTuple(0, xs)` → `Arr.isEmptyTuple`).',\n    },\n    fixable: 'code',\n    schema: [],\n    messages: MESSAGES,\n  },\n\n  create: (context) => {\n    const sourceCode = context.sourceCode;\n\n    const arrLocalName = getImportedLocalName(\n      getTsDataForgeImport(sourceCode.ast),\n      'Arr',\n    );\n\n    const comparisonVisitors = COMPARISON_RULES.map((rule) =>\n      rule.create(context),\n    );\n\n    if (arrLocalName === undefined) return mergeVisitors(comparisonVisitors);\n\n    return mergeVisitors([\n      ...comparisonVisitors,\n      {\n        CallExpression: (node) => {\n          const guardName = getGuardName(node, arrLocalName);\n\n          if (guardName === undefined) return;\n\n          const rewrite = GUARD_REWRITES.find(\n            (entry) => entry.guard === guardName,\n          );\n\n          if (rewrite === undefined || !matchesBounds(node, rewrite.bounds)) {\n            return;\n          }\n\n          // The array is the last argument; the bounds precede it.\n          const array = node.arguments[rewrite.bounds.length];\n\n          if (array === undefined) return;\n\n          const arrayText = sourceCode.getText(array);\n\n          context.report({\n            node,\n            messageId: 'useCanonicalGuard',\n            data: {\n              arrName: arrLocalName,\n              guard: guardName,\n              boundsText: [...rewrite.bounds.map(String), '…'].join(', '),\n              replacement: rewrite.replacement,\n            },\n            fix: (fixer) =>\n              fixer.replaceText(\n                node,\n                `${arrLocalName}.${rewrite.replacement}(${arrayText})`,\n              ),\n          });\n        },\n      },\n    ]);\n  },\n  defaultOptions: [],\n} as const;\n\n/**\n * Combines several rule listeners into one, calling every handler registered\n * for a given selector in order.\n */\nconst mergeVisitors = (\n  // `RuleListener` holds mutable AST handler signatures, so it is not deeply\n  // readonly.\n  // eslint-disable-next-line @typescript-eslint/prefer-readonly-parameter-types\n  visitors: readonly TSESLint.RuleListener[],\n): TSESLint.RuleListener => {\n  const mut_merged: Record<string, ((node: never) => void)[]> = {};\n\n  for (const visitor of visitors) {\n    for (const [selector, handler] of Object.entries(visitor)) {\n      if (typeof handler !== 'function') continue;\n\n      const mut_handlers = mut_merged[selector] ?? [];\n\n      mut_handlers.push(handler);\n\n      mut_merged[selector] = mut_handlers;\n    }\n  }\n\n  return Object.fromEntries(\n    Object.entries(mut_merged).map(([selector, handlers]) => [\n      selector,\n      (node: never) => {\n        for (const handler of handlers) {\n          handler(node);\n        }\n      },\n    ]),\n  );\n};\n\n/** The `Arr.<guard>` method name of `node`, or `undefined` for other calls. */\nconst getGuardName = (\n  // eslint-disable-next-line @typescript-eslint/prefer-readonly-parameter-types\n  node: TSESTree.CallExpression,\n  arrLocalName: string,\n): string | undefined => {\n  const { callee } = node;\n\n  return callee.type === AST_NODE_TYPES.MemberExpression &&\n    !callee.computed &&\n    callee.object.type === AST_NODE_TYPES.Identifier &&\n    callee.object.name === arrLocalName &&\n    callee.property.type === AST_NODE_TYPES.Identifier\n    ? callee.property.name\n    : undefined;\n};\n\n/**\n * Whether the call is `guard(...bounds, array)` with every bound written as the\n * exact numeric literal the rewrite requires.\n *\n * The arity check also excludes the curried form (`guard(...bounds)`): the\n * degenerate guards take only the array, so there is nothing to rewrite it to.\n */\nconst matchesBounds = (\n  // eslint-disable-next-line @typescript-eslint/prefer-readonly-parameter-types\n  node: TSESTree.CallExpression,\n  bounds: readonly number[],\n): boolean => {\n  const args = node.arguments;\n\n  if (args.length !== bounds.length + 1 || node.typeArguments !== undefined) {\n    return false;\n  }\n\n  return args.every(\n    (arg, index) =>\n      arg.type !== AST_NODE_TYPES.SpreadElement &&\n      (index === bounds.length ||\n        (arg.type === AST_NODE_TYPES.Literal && arg.value === bounds[index])),\n  );\n};\n"],"names":[],"mappings":";;;;;;;;AA+BA,MAAM,gBAAA,GAAmB;AAAA,EACvB,mBAAA;AAAA,EACA,yBAAA;AAAA,EACA,yBAAA;AAAA,EACA,6BAAA;AAAA,EACA;AACF,CAAA;AAEA,MAAM,QAAA,GAAW;AAAA,EACf,iBAAA,EACE,qIAAA;AAAA,EACF,aAAA,EAAe,mBAAA,CAAoB,IAAA,CAAK,QAAA,CAAS,aAAA;AAAA,EACjD,mBAAA,EACE,yBAAA,CAA0B,IAAA,CAAK,QAAA,CAAS,mBAAA;AAAA,EAC1C,mBAAA,EACE,yBAAA,CAA0B,IAAA,CAAK,QAAA,CAAS,mBAAA;AAAA,EAC1C,uBAAA,EACE,6BAAA,CAA8B,IAAA,CAAK,QAAA,CAAS,uBAAA;AAAA,EAC9C,qBAAA,EACE,2BAAA,CAA4B,IAAA,CAAK,QAAA,CAAS;AAC9C,CAAA;AA4BA,MAAM,cAAA,GAAiB;AAAA,EACrB,EAAE,OAAO,oBAAA,EAAsB,MAAA,EAAQ,CAAC,CAAC,CAAA,EAAG,aAAa,SAAA,EAAU;AAAA,EACnE,EAAE,OAAO,kBAAA,EAAoB,MAAA,EAAQ,CAAC,CAAC,CAAA,EAAG,aAAa,SAAA,EAAU;AAAA,EACjE,EAAE,OAAO,sBAAA,EAAwB,MAAA,EAAQ,CAAC,CAAA,EAAG,CAAC,CAAA,EAAG,WAAA,EAAa,SAAA,EAAU;AAAA,EACxE,EAAE,OAAO,kBAAA,EAAoB,MAAA,EAAQ,CAAC,CAAC,CAAA,EAAG,aAAa,YAAA,EAAa;AAAA,EACpE,EAAE,OAAO,oBAAA,EAAsB,MAAA,EAAQ,CAAC,CAAC,CAAA,EAAG,aAAa,cAAA,EAAe;AAAA,EACxE,EAAE,OAAO,kBAAA,EAAoB,MAAA,EAAQ,CAAC,CAAC,CAAA,EAAG,aAAa,cAAA,EAAe;AAAA,EACtE;AAAA,IACE,KAAA,EAAO,sBAAA;AAAA,IACP,MAAA,EAAQ,CAAC,CAAA,EAAG,CAAC,CAAA;AAAA,IACb,WAAA,EAAa;AAAA,GACf;AAAA,EACA,EAAE,OAAO,kBAAA,EAAoB,MAAA,EAAQ,CAAC,CAAC,CAAA,EAAG,aAAa,iBAAA;AACzD,CAAA;AAMO,MAAM,0BAAA,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,GACZ;AAAA,EAEA,MAAA,EAAQ,CAAC,OAAA,KAAY;AACnB,IAAA,MAAM,aAAa,OAAA,CAAQ,UAAA;AAE3B,IAAA,MAAM,YAAA,GAAe,oBAAA;AAAA,MACnB,oBAAA,CAAqB,WAAW,GAAG,CAAA;AAAA,MACnC;AAAA,KACF;AAEA,IAAA,MAAM,qBAAqB,gBAAA,CAAiB,GAAA;AAAA,MAAI,CAAC,IAAA,KAC/C,IAAA,CAAK,MAAA,CAAO,OAAO;AAAA,KACrB;AAEA,IAAA,IAAI,YAAA,KAAiB,MAAA,EAAW,OAAO,aAAA,CAAc,kBAAkB,CAAA;AAEvE,IAAA,OAAO,aAAA,CAAc;AAAA,MACnB,GAAG,kBAAA;AAAA,MACH;AAAA,QACE,cAAA,EAAgB,CAAC,IAAA,KAAS;AACxB,UAAA,MAAM,SAAA,GAAY,YAAA,CAAa,IAAA,EAAM,YAAY,CAAA;AAEjD,UAAA,IAAI,cAAc,MAAA,EAAW;AAE7B,UAAA,MAAM,UAAU,cAAA,CAAe,IAAA;AAAA,YAC7B,CAAC,KAAA,KAAU,KAAA,CAAM,KAAA,KAAU;AAAA,WAC7B;AAEA,UAAA,IAAI,YAAY,MAAA,IAAa,CAAC,cAAc,IAAA,EAAM,OAAA,CAAQ,MAAM,CAAA,EAAG;AACjE,YAAA;AAAA,UACF;AAGA,UAAA,MAAM,KAAA,GAAQ,IAAA,CAAK,SAAA,CAAU,OAAA,CAAQ,OAAO,MAAM,CAAA;AAElD,UAAA,IAAI,UAAU,MAAA,EAAW;AAEzB,UAAA,MAAM,SAAA,GAAY,UAAA,CAAW,OAAA,CAAQ,KAAK,CAAA;AAE1C,UAAA,OAAA,CAAQ,MAAA,CAAO;AAAA,YACb,IAAA;AAAA,YACA,SAAA,EAAW,mBAAA;AAAA,YACX,IAAA,EAAM;AAAA,cACJ,OAAA,EAAS,YAAA;AAAA,cACT,KAAA,EAAO,SAAA;AAAA,cACP,UAAA,EAAY,CAAC,GAAG,OAAA,CAAQ,MAAA,CAAO,GAAA,CAAI,MAAM,CAAA,EAAG,QAAG,CAAA,CAAE,IAAA,CAAK,IAAI,CAAA;AAAA,cAC1D,aAAa,OAAA,CAAQ;AAAA,aACvB;AAAA,YACA,GAAA,EAAK,CAAC,KAAA,KACJ,KAAA,CAAM,WAAA;AAAA,cACJ,IAAA;AAAA,cACA,GAAG,YAAY,CAAA,CAAA,EAAI,OAAA,CAAQ,WAAW,IAAI,SAAS,CAAA,CAAA;AAAA;AACrD,WACH,CAAA;AAAA,QACH;AAAA;AACF,KACD,CAAA;AAAA,EACH,CAAA;AAAA,EACA,gBAAgB;AAClB;AAMA,MAAM,aAAA,GAAgB,CAIpB,QAAA,KAC0B;AAC1B,EAAA,MAAM,aAAwD,EAAC;AAE/D,EAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,IAAA,KAAA,MAAW,CAAC,QAAA,EAAU,OAAO,KAAK,MAAA,CAAO,OAAA,CAAQ,OAAO,CAAA,EAAG;AACzD,MAAA,IAAI,OAAO,YAAY,UAAA,EAAY;AAEnC,MAAA,MAAM,YAAA,GAAe,UAAA,CAAW,QAAQ,CAAA,IAAK,EAAC;AAE9C,MAAA,YAAA,CAAa,KAAK,OAAO,CAAA;AAEzB,MAAA,UAAA,CAAW,QAAQ,CAAA,GAAI,YAAA;AAAA,IACzB;AAAA,EACF;AAEA,EAAA,OAAO,MAAA,CAAO,WAAA;AAAA,IACZ,MAAA,CAAO,QAAQ,UAAU,CAAA,CAAE,IAAI,CAAC,CAAC,QAAA,EAAU,QAAQ,CAAA,KAAM;AAAA,MACvD,QAAA;AAAA,MACA,CAAC,IAAA,KAAgB;AACf,QAAA,KAAA,MAAW,WAAW,QAAA,EAAU;AAC9B,UAAA,OAAA,CAAQ,IAAI,CAAA;AAAA,QACd;AAAA,MACF;AAAA,KACD;AAAA,GACH;AACF,CAAA;AAGA,MAAM,YAAA,GAAe,CAEnB,IAAA,EACA,YAAA,KACuB;AACvB,EAAA,MAAM,EAAE,QAAO,GAAI,IAAA;AAEnB,EAAA,OAAO,MAAA,CAAO,SAAS,cAAA,CAAe,gBAAA,IACpC,CAAC,MAAA,CAAO,QAAA,IACR,MAAA,CAAO,MAAA,CAAO,IAAA,KAAS,cAAA,CAAe,cACtC,MAAA,CAAO,MAAA,CAAO,IAAA,KAAS,YAAA,IACvB,MAAA,CAAO,QAAA,CAAS,SAAS,cAAA,CAAe,UAAA,GACtC,MAAA,CAAO,QAAA,CAAS,IAAA,GAChB,MAAA;AACN,CAAA;AASA,MAAM,aAAA,GAAgB,CAEpB,IAAA,EACA,MAAA,KACY;AACZ,EAAA,MAAM,OAAO,IAAA,CAAK,SAAA;AAElB,EAAA,IAAI,KAAK,MAAA,KAAW,MAAA,CAAO,SAAS,CAAA,IAAK,IAAA,CAAK,kBAAkB,MAAA,EAAW;AACzE,IAAA,OAAO,KAAA;AAAA,EACT;AAEA,EAAA,OAAO,IAAA,CAAK,KAAA;AAAA,IACV,CAAC,GAAA,EAAK,KAAA,KACJ,GAAA,CAAI,IAAA,KAAS,eAAe,aAAA,KAC3B,KAAA,KAAU,MAAA,CAAO,MAAA,IACf,IAAI,IAAA,KAAS,cAAA,CAAe,WAAW,GAAA,CAAI,KAAA,KAAU,OAAO,KAAK,CAAA;AAAA,GACxE;AACF,CAAA;;;;"}

package/dist/rules/prefer-range-for-loop.mjs

@@ -21,7 +21,7 @@ const preferRangeForLoop = {
     const mut_nodesToFix = [];
     return {
       ForStatement: (node) => {
-        if (node.init?.type !== AST_NODE_TYPES.VariableDeclaration || node.init.kind !== "let" || !Arr.isFixedLengthTuple(node.init.declarations, 1)) {
+        if (node.init?.type !== AST_NODE_TYPES.VariableDeclaration || node.init.kind !== "let" || !Arr.isFixedLengthTuple(1, node.init.declarations)) {
           return;
         }
         const declaration = node.init.declarations[0];

package/dist/rules/prefer-range-for-loop.mjs.map

@@ -1 +1 @@
-{"version":3,"file":"prefer-range-for-loop.mjs","sources":["../../src/rules/prefer-range-for-loop.mts"],"sourcesContent":["import {\n  AST_NODE_TYPES,\n  type TSESLint,\n  type TSESTree,\n} from '@typescript-eslint/utils';\nimport { Arr } from 'ts-data-forge';\nimport {\n  buildImportFixes,\n  getNamedImports,\n  getTsDataForgeImport,\n} from './import-utils.mjs';\n\ntype Options = readonly [];\n\ntype MessageIds = 'useRangeForLoop';\n\nexport const preferRangeForLoop: TSESLint.RuleModule<MessageIds, Options> = {\n  meta: {\n    type: 'suggestion',\n    docs: {\n      description:\n        'Replace `for (let i = begin; i < end; ++i)` with `for (const i of range(begin, end))` from ts-data-forge.',\n    },\n    fixable: 'code',\n    schema: [],\n    messages: {\n      useRangeForLoop:\n        'Replace with `for (const {{varName}} of range({{begin}}, {{end}}))` 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 mut_nodesToFix: {\n      node: TSESTree.ForStatement;\n      varName: string;\n      begin: string;\n      end: string;\n      step?: string;\n    }[] = [];\n\n    return {\n      ForStatement: (node) => {\n        // Check init: let i = begin\n        if (\n          node.init?.type !== AST_NODE_TYPES.VariableDeclaration ||\n          node.init.kind !== 'let' ||\n          !Arr.isFixedLengthTuple(node.init.declarations, 1)\n        ) {\n          return;\n        }\n\n        const declaration = node.init.declarations[0];\n\n        if (\n          declaration.id.type !== AST_NODE_TYPES.Identifier ||\n          declaration.init === null\n        ) {\n          return;\n        }\n\n        const varName = declaration.id.name;\n\n        const beginExpr = declaration.init;\n\n        // Check test: i < end\n        if (\n          node.test?.type !== AST_NODE_TYPES.BinaryExpression ||\n          node.test.operator !== '<' ||\n          node.test.left.type !== AST_NODE_TYPES.Identifier ||\n          node.test.left.name !== varName\n        ) {\n          return;\n        }\n\n        const endExpr = node.test.right;\n\n        // Check update: ++i, i++, i += 1, or i += step\n        if (node.update === null) return;\n\n        let mut_step: string | undefined;\n\n        if (node.update.type === AST_NODE_TYPES.UpdateExpression) {\n          // ++i or i++\n          if (\n            node.update.operator === '++' &&\n            node.update.argument.type === AST_NODE_TYPES.Identifier &&\n            node.update.argument.name === varName\n          ) {\n            mut_step = undefined; // step defaults to 1\n          } else {\n            return;\n          }\n        } else if (\n          node.update.type === AST_NODE_TYPES.AssignmentExpression &&\n          node.update.operator === '+=' &&\n          node.update.left.type === AST_NODE_TYPES.Identifier &&\n          node.update.left.name === varName\n        ) {\n          // i += step\n          const stepValue = node.update.right;\n\n          if (stepValue.type === AST_NODE_TYPES.Literal) {\n            const stepNum = stepValue.value;\n\n            // Only support positive integer steps\n            if (typeof stepNum === 'number' && stepNum > 0) {\n              mut_step = stepNum === 1 ? undefined : String(stepNum);\n            } else {\n              return;\n            }\n          } else {\n            // Variable step like i += step\n            mut_step = sourceCode.getText(stepValue);\n          }\n        } else {\n          return;\n        }\n\n        const beginText = sourceCode.getText(beginExpr);\n\n        const endText = sourceCode.getText(endExpr);\n\n        mut_nodesToFix.push({\n          node,\n          varName,\n          begin: beginText,\n          end: endText,\n          step: mut_step,\n        });\n      },\n      'Program:exit': () => {\n        const namedImports = getNamedImports(tsDataForgeImport);\n\n        const hasRangeImport = namedImports.includes('range');\n\n        for (const [\n          index,\n          { node, varName, begin, end, step },\n        ] of mut_nodesToFix.entries()) {\n          context.report({\n            node: node.init ?? node,\n            messageId: 'useRangeForLoop',\n            data: {\n              varName,\n              begin,\n              end,\n            },\n            fix: (fixer) => {\n              const bodyText = sourceCode.getText(node.body);\n\n              const rangeArgs =\n                step === undefined\n                  ? `${begin}, ${end}`\n                  : `${begin}, ${end}, ${step}`;\n\n              const replacement = `for (const ${varName} of range(${rangeArgs})) ${bodyText}`;\n\n              const importFixes =\n                index === 0 && !hasRangeImport\n                  ? buildImportFixes(fixer, program, tsDataForgeImport, [\n                      'range',\n                    ])\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,kBAAA,GAA+D;AAAA,EAC1E,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,eAAA,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,iBAMA,EAAC;AAEP,IAAA,OAAO;AAAA,MACL,YAAA,EAAc,CAAC,IAAA,KAAS;AAEtB,QAAA,IACE,KAAK,IAAA,EAAM,IAAA,KAAS,cAAA,CAAe,mBAAA,IACnC,KAAK,IAAA,CAAK,IAAA,KAAS,KAAA,IACnB,CAAC,IAAI,kBAAA,CAAmB,IAAA,CAAK,IAAA,CAAK,YAAA,EAAc,CAAC,CAAA,EACjD;AACA,UAAA;AAAA,QACF;AAEA,QAAA,MAAM,WAAA,GAAc,IAAA,CAAK,IAAA,CAAK,YAAA,CAAa,CAAC,CAAA;AAE5C,QAAA,IACE,YAAY,EAAA,CAAG,IAAA,KAAS,eAAe,UAAA,IACvC,WAAA,CAAY,SAAS,IAAA,EACrB;AACA,UAAA;AAAA,QACF;AAEA,QAAA,MAAM,OAAA,GAAU,YAAY,EAAA,CAAG,IAAA;AAE/B,QAAA,MAAM,YAAY,WAAA,CAAY,IAAA;AAG9B,QAAA,IACE,KAAK,IAAA,EAAM,IAAA,KAAS,eAAe,gBAAA,IACnC,IAAA,CAAK,KAAK,QAAA,KAAa,GAAA,IACvB,KAAK,IAAA,CAAK,IAAA,CAAK,SAAS,cAAA,CAAe,UAAA,IACvC,KAAK,IAAA,CAAK,IAAA,CAAK,SAAS,OAAA,EACxB;AACA,UAAA;AAAA,QACF;AAEA,QAAA,MAAM,OAAA,GAAU,KAAK,IAAA,CAAK,KAAA;AAG1B,QAAA,IAAI,IAAA,CAAK,WAAW,IAAA,EAAM;AAE1B,QAAA,IAAI,QAAA;AAEJ,QAAA,IAAI,IAAA,CAAK,MAAA,CAAO,IAAA,KAAS,cAAA,CAAe,gBAAA,EAAkB;AAExD,UAAA,IACE,IAAA,CAAK,MAAA,CAAO,QAAA,KAAa,IAAA,IACzB,KAAK,MAAA,CAAO,QAAA,CAAS,IAAA,KAAS,cAAA,CAAe,UAAA,IAC7C,IAAA,CAAK,MAAA,CAAO,QAAA,CAAS,SAAS,OAAA,EAC9B;AACA,YAAA,QAAA,GAAW,MAAA;AAAA,UACb,CAAA,MAAO;AACL,YAAA;AAAA,UACF;AAAA,QACF,CAAA,MAAA,IACE,KAAK,MAAA,CAAO,IAAA,KAAS,eAAe,oBAAA,IACpC,IAAA,CAAK,OAAO,QAAA,KAAa,IAAA,IACzB,KAAK,MAAA,CAAO,IAAA,CAAK,SAAS,cAAA,CAAe,UAAA,IACzC,KAAK,MAAA,CAAO,IAAA,CAAK,SAAS,OAAA,EAC1B;AAEA,UAAA,MAAM,SAAA,GAAY,KAAK,MAAA,CAAO,KAAA;AAE9B,UAAA,IAAI,SAAA,CAAU,IAAA,KAAS,cAAA,CAAe,OAAA,EAAS;AAC7C,YAAA,MAAM,UAAU,SAAA,CAAU,KAAA;AAG1B,YAAA,IAAI,OAAO,OAAA,KAAY,QAAA,IAAY,OAAA,GAAU,CAAA,EAAG;AAC9C,cAAA,QAAA,GAAW,OAAA,KAAY,CAAA,GAAI,MAAA,GAAY,MAAA,CAAO,OAAO,CAAA;AAAA,YACvD,CAAA,MAAO;AACL,cAAA;AAAA,YACF;AAAA,UACF,CAAA,MAAO;AAEL,YAAA,QAAA,GAAW,UAAA,CAAW,QAAQ,SAAS,CAAA;AAAA,UACzC;AAAA,QACF,CAAA,MAAO;AACL,UAAA;AAAA,QACF;AAEA,QAAA,MAAM,SAAA,GAAY,UAAA,CAAW,OAAA,CAAQ,SAAS,CAAA;AAE9C,QAAA,MAAM,OAAA,GAAU,UAAA,CAAW,OAAA,CAAQ,OAAO,CAAA;AAE1C,QAAA,cAAA,CAAe,IAAA,CAAK;AAAA,UAClB,IAAA;AAAA,UACA,OAAA;AAAA,UACA,KAAA,EAAO,SAAA;AAAA,UACP,GAAA,EAAK,OAAA;AAAA,UACL,IAAA,EAAM;AAAA,SACP,CAAA;AAAA,MACH,CAAA;AAAA,MACA,gBAAgB,MAAM;AACpB,QAAA,MAAM,YAAA,GAAe,gBAAgB,iBAAiB,CAAA;AAEtD,QAAA,MAAM,cAAA,GAAiB,YAAA,CAAa,QAAA,CAAS,OAAO,CAAA;AAEpD,QAAA,KAAA,MAAW;AAAA,UACT,KAAA;AAAA,UACA,EAAE,IAAA,EAAM,OAAA,EAAS,KAAA,EAAO,KAAK,IAAA;AAAK,SACpC,IAAK,cAAA,CAAe,OAAA,EAAQ,EAAG;AAC7B,UAAA,OAAA,CAAQ,MAAA,CAAO;AAAA,YACb,IAAA,EAAM,KAAK,IAAA,IAAQ,IAAA;AAAA,YACnB,SAAA,EAAW,iBAAA;AAAA,YACX,IAAA,EAAM;AAAA,cACJ,OAAA;AAAA,cACA,KAAA;AAAA,cACA;AAAA,aACF;AAAA,YACA,GAAA,EAAK,CAAC,KAAA,KAAU;AACd,cAAA,MAAM,QAAA,GAAW,UAAA,CAAW,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA;AAE7C,cAAA,MAAM,SAAA,GACJ,IAAA,KAAS,MAAA,GACL,CAAA,EAAG,KAAK,CAAA,EAAA,EAAK,GAAG,CAAA,CAAA,GAChB,CAAA,EAAG,KAAK,CAAA,EAAA,EAAK,GAAG,KAAK,IAAI,CAAA,CAAA;AAE/B,cAAA,MAAM,cAAc,CAAA,WAAA,EAAc,OAAO,CAAA,UAAA,EAAa,SAAS,MAAM,QAAQ,CAAA,CAAA;AAE7E,cAAA,MAAM,WAAA,GACJ,UAAU,CAAA,IAAK,CAAC,iBACZ,gBAAA,CAAiB,KAAA,EAAO,SAAS,iBAAA,EAAmB;AAAA,gBAClD;AAAA,eACD,IACD,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-range-for-loop.mjs","sources":["../../src/rules/prefer-range-for-loop.mts"],"sourcesContent":["import {\n  AST_NODE_TYPES,\n  type TSESLint,\n  type TSESTree,\n} from '@typescript-eslint/utils';\nimport { Arr } from 'ts-data-forge';\nimport {\n  buildImportFixes,\n  getNamedImports,\n  getTsDataForgeImport,\n} from './import-utils.mjs';\n\ntype Options = readonly [];\n\ntype MessageIds = 'useRangeForLoop';\n\nexport const preferRangeForLoop: TSESLint.RuleModule<MessageIds, Options> = {\n  meta: {\n    type: 'suggestion',\n    docs: {\n      description:\n        'Replace `for (let i = begin; i < end; ++i)` with `for (const i of range(begin, end))` from ts-data-forge.',\n    },\n    fixable: 'code',\n    schema: [],\n    messages: {\n      useRangeForLoop:\n        'Replace with `for (const {{varName}} of range({{begin}}, {{end}}))` 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 mut_nodesToFix: {\n      node: TSESTree.ForStatement;\n      varName: string;\n      begin: string;\n      end: string;\n      step?: string;\n    }[] = [];\n\n    return {\n      ForStatement: (node) => {\n        // Check init: let i = begin\n        if (\n          node.init?.type !== AST_NODE_TYPES.VariableDeclaration ||\n          node.init.kind !== 'let' ||\n          !Arr.isFixedLengthTuple(1, node.init.declarations)\n        ) {\n          return;\n        }\n\n        const declaration = node.init.declarations[0];\n\n        if (\n          declaration.id.type !== AST_NODE_TYPES.Identifier ||\n          declaration.init === null\n        ) {\n          return;\n        }\n\n        const varName = declaration.id.name;\n\n        const beginExpr = declaration.init;\n\n        // Check test: i < end\n        if (\n          node.test?.type !== AST_NODE_TYPES.BinaryExpression ||\n          node.test.operator !== '<' ||\n          node.test.left.type !== AST_NODE_TYPES.Identifier ||\n          node.test.left.name !== varName\n        ) {\n          return;\n        }\n\n        const endExpr = node.test.right;\n\n        // Check update: ++i, i++, i += 1, or i += step\n        if (node.update === null) return;\n\n        let mut_step: string | undefined;\n\n        if (node.update.type === AST_NODE_TYPES.UpdateExpression) {\n          // ++i or i++\n          if (\n            node.update.operator === '++' &&\n            node.update.argument.type === AST_NODE_TYPES.Identifier &&\n            node.update.argument.name === varName\n          ) {\n            mut_step = undefined; // step defaults to 1\n          } else {\n            return;\n          }\n        } else if (\n          node.update.type === AST_NODE_TYPES.AssignmentExpression &&\n          node.update.operator === '+=' &&\n          node.update.left.type === AST_NODE_TYPES.Identifier &&\n          node.update.left.name === varName\n        ) {\n          // i += step\n          const stepValue = node.update.right;\n\n          if (stepValue.type === AST_NODE_TYPES.Literal) {\n            const stepNum = stepValue.value;\n\n            // Only support positive integer steps\n            if (typeof stepNum === 'number' && stepNum > 0) {\n              mut_step = stepNum === 1 ? undefined : String(stepNum);\n            } else {\n              return;\n            }\n          } else {\n            // Variable step like i += step\n            mut_step = sourceCode.getText(stepValue);\n          }\n        } else {\n          return;\n        }\n\n        const beginText = sourceCode.getText(beginExpr);\n\n        const endText = sourceCode.getText(endExpr);\n\n        mut_nodesToFix.push({\n          node,\n          varName,\n          begin: beginText,\n          end: endText,\n          step: mut_step,\n        });\n      },\n      'Program:exit': () => {\n        const namedImports = getNamedImports(tsDataForgeImport);\n\n        const hasRangeImport = namedImports.includes('range');\n\n        for (const [\n          index,\n          { node, varName, begin, end, step },\n        ] of mut_nodesToFix.entries()) {\n          context.report({\n            node: node.init ?? node,\n            messageId: 'useRangeForLoop',\n            data: {\n              varName,\n              begin,\n              end,\n            },\n            fix: (fixer) => {\n              const bodyText = sourceCode.getText(node.body);\n\n              const rangeArgs =\n                step === undefined\n                  ? `${begin}, ${end}`\n                  : `${begin}, ${end}, ${step}`;\n\n              const replacement = `for (const ${varName} of range(${rangeArgs})) ${bodyText}`;\n\n              const importFixes =\n                index === 0 && !hasRangeImport\n                  ? buildImportFixes(fixer, program, tsDataForgeImport, [\n                      'range',\n                    ])\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,kBAAA,GAA+D;AAAA,EAC1E,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,eAAA,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,iBAMA,EAAC;AAEP,IAAA,OAAO;AAAA,MACL,YAAA,EAAc,CAAC,IAAA,KAAS;AAEtB,QAAA,IACE,KAAK,IAAA,EAAM,IAAA,KAAS,cAAA,CAAe,mBAAA,IACnC,KAAK,IAAA,CAAK,IAAA,KAAS,KAAA,IACnB,CAAC,IAAI,kBAAA,CAAmB,CAAA,EAAG,IAAA,CAAK,IAAA,CAAK,YAAY,CAAA,EACjD;AACA,UAAA;AAAA,QACF;AAEA,QAAA,MAAM,WAAA,GAAc,IAAA,CAAK,IAAA,CAAK,YAAA,CAAa,CAAC,CAAA;AAE5C,QAAA,IACE,YAAY,EAAA,CAAG,IAAA,KAAS,eAAe,UAAA,IACvC,WAAA,CAAY,SAAS,IAAA,EACrB;AACA,UAAA;AAAA,QACF;AAEA,QAAA,MAAM,OAAA,GAAU,YAAY,EAAA,CAAG,IAAA;AAE/B,QAAA,MAAM,YAAY,WAAA,CAAY,IAAA;AAG9B,QAAA,IACE,KAAK,IAAA,EAAM,IAAA,KAAS,eAAe,gBAAA,IACnC,IAAA,CAAK,KAAK,QAAA,KAAa,GAAA,IACvB,KAAK,IAAA,CAAK,IAAA,CAAK,SAAS,cAAA,CAAe,UAAA,IACvC,KAAK,IAAA,CAAK,IAAA,CAAK,SAAS,OAAA,EACxB;AACA,UAAA;AAAA,QACF;AAEA,QAAA,MAAM,OAAA,GAAU,KAAK,IAAA,CAAK,KAAA;AAG1B,QAAA,IAAI,IAAA,CAAK,WAAW,IAAA,EAAM;AAE1B,QAAA,IAAI,QAAA;AAEJ,QAAA,IAAI,IAAA,CAAK,MAAA,CAAO,IAAA,KAAS,cAAA,CAAe,gBAAA,EAAkB;AAExD,UAAA,IACE,IAAA,CAAK,MAAA,CAAO,QAAA,KAAa,IAAA,IACzB,KAAK,MAAA,CAAO,QAAA,CAAS,IAAA,KAAS,cAAA,CAAe,UAAA,IAC7C,IAAA,CAAK,MAAA,CAAO,QAAA,CAAS,SAAS,OAAA,EAC9B;AACA,YAAA,QAAA,GAAW,MAAA;AAAA,UACb,CAAA,MAAO;AACL,YAAA;AAAA,UACF;AAAA,QACF,CAAA,MAAA,IACE,KAAK,MAAA,CAAO,IAAA,KAAS,eAAe,oBAAA,IACpC,IAAA,CAAK,OAAO,QAAA,KAAa,IAAA,IACzB,KAAK,MAAA,CAAO,IAAA,CAAK,SAAS,cAAA,CAAe,UAAA,IACzC,KAAK,MAAA,CAAO,IAAA,CAAK,SAAS,OAAA,EAC1B;AAEA,UAAA,MAAM,SAAA,GAAY,KAAK,MAAA,CAAO,KAAA;AAE9B,UAAA,IAAI,SAAA,CAAU,IAAA,KAAS,cAAA,CAAe,OAAA,EAAS;AAC7C,YAAA,MAAM,UAAU,SAAA,CAAU,KAAA;AAG1B,YAAA,IAAI,OAAO,OAAA,KAAY,QAAA,IAAY,OAAA,GAAU,CAAA,EAAG;AAC9C,cAAA,QAAA,GAAW,OAAA,KAAY,CAAA,GAAI,MAAA,GAAY,MAAA,CAAO,OAAO,CAAA;AAAA,YACvD,CAAA,MAAO;AACL,cAAA;AAAA,YACF;AAAA,UACF,CAAA,MAAO;AAEL,YAAA,QAAA,GAAW,UAAA,CAAW,QAAQ,SAAS,CAAA;AAAA,UACzC;AAAA,QACF,CAAA,MAAO;AACL,UAAA;AAAA,QACF;AAEA,QAAA,MAAM,SAAA,GAAY,UAAA,CAAW,OAAA,CAAQ,SAAS,CAAA;AAE9C,QAAA,MAAM,OAAA,GAAU,UAAA,CAAW,OAAA,CAAQ,OAAO,CAAA;AAE1C,QAAA,cAAA,CAAe,IAAA,CAAK;AAAA,UAClB,IAAA;AAAA,UACA,OAAA;AAAA,UACA,KAAA,EAAO,SAAA;AAAA,UACP,GAAA,EAAK,OAAA;AAAA,UACL,IAAA,EAAM;AAAA,SACP,CAAA;AAAA,MACH,CAAA;AAAA,MACA,gBAAgB,MAAM;AACpB,QAAA,MAAM,YAAA,GAAe,gBAAgB,iBAAiB,CAAA;AAEtD,QAAA,MAAM,cAAA,GAAiB,YAAA,CAAa,QAAA,CAAS,OAAO,CAAA;AAEpD,QAAA,KAAA,MAAW;AAAA,UACT,KAAA;AAAA,UACA,EAAE,IAAA,EAAM,OAAA,EAAS,KAAA,EAAO,KAAK,IAAA;AAAK,SACpC,IAAK,cAAA,CAAe,OAAA,EAAQ,EAAG;AAC7B,UAAA,OAAA,CAAQ,MAAA,CAAO;AAAA,YACb,IAAA,EAAM,KAAK,IAAA,IAAQ,IAAA;AAAA,YACnB,SAAA,EAAW,iBAAA;AAAA,YACX,IAAA,EAAM;AAAA,cACJ,OAAA;AAAA,cACA,KAAA;AAAA,cACA;AAAA,aACF;AAAA,YACA,GAAA,EAAK,CAAC,KAAA,KAAU;AACd,cAAA,MAAM,QAAA,GAAW,UAAA,CAAW,OAAA,CAAQ,IAAA,CAAK,IAAI,CAAA;AAE7C,cAAA,MAAM,SAAA,GACJ,IAAA,KAAS,MAAA,GACL,CAAA,EAAG,KAAK,CAAA,EAAA,EAAK,GAAG,CAAA,CAAA,GAChB,CAAA,EAAG,KAAK,CAAA,EAAA,EAAK,GAAG,KAAK,IAAI,CAAA,CAAA;AAE/B,cAAA,MAAM,cAAc,CAAA,WAAA,EAAc,OAAO,CAAA,UAAA,EAAa,SAAS,MAAM,QAAQ,CAAA,CAAA;AAE7E,cAAA,MAAM,WAAA,GACJ,UAAU,CAAA,IAAK,CAAC,iBACZ,gBAAA,CAAiB,KAAA,EAAO,SAAS,iBAAA,EAAmB;AAAA,gBAClD;AAAA,eACD,IACD,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;;;;"}

package/dist/rules/rules.d.mts

@@ -1,6 +1,7 @@
 export declare const tsDataForgeRules: {
     readonly 'prefer-canonical-array-slicing': import("@typescript-eslint/utils/ts-eslint").RuleModule<"preferCanonicalArraySlicing", readonly [], unknown, import("@typescript-eslint/utils/ts-eslint").RuleListener>;
     readonly 'prefer-canonical-length-guard': import("@typescript-eslint/utils/ts-eslint").RuleModule<"useCanonicalGuard" | "useIsBoundedLengthArray" | "useIsFixedLengthArray" | "useIsMaxLengthArray" | "useIsMinLengthArray" | "useIsNonEmpty", readonly [], unknown, import("@typescript-eslint/utils/ts-eslint").RuleListener>;
+    readonly 'prefer-canonical-length-cast': import("@typescript-eslint/utils/ts-eslint").RuleModule<"useCanonicalCast", readonly [], unknown, import("@typescript-eslint/utils/ts-eslint").RuleListener>;
     readonly 'prefer-arr-is-array': import("@typescript-eslint/utils/ts-eslint").RuleModule<"useArrIsArray", readonly [], unknown, import("@typescript-eslint/utils/ts-eslint").RuleListener>;
     readonly 'prefer-arr-sum': import("@typescript-eslint/utils/ts-eslint").RuleModule<"useArrSum" | "useArrSumBy", readonly [], unknown, import("@typescript-eslint/utils/ts-eslint").RuleListener>;
     readonly 'prefer-as-int': import("@typescript-eslint/utils/ts-eslint").RuleModule<"useBrandedNumberCastFunction", readonly [], unknown, import("@typescript-eslint/utils/ts-eslint").RuleListener>;

package/dist/rules/rules.d.mts.map

@@ -1 +1 @@
-{"version":3,"file":"rules.d.mts","sourceRoot":"","sources":["../../src/rules/rules.mts"],"names":[],"mappings":"AAcA,eAAO,MAAM,gBAAgB;;;;;;;;;;;;;;;CAaa,CAAC"}
+{"version":3,"file":"rules.d.mts","sourceRoot":"","sources":["../../src/rules/rules.mts"],"names":[],"mappings":"AAeA,eAAO,MAAM,gBAAgB;;;;;;;;;;;;;;;;CAca,CAAC"}