eslint-plugin-typefest 1.0.1

package/dist/_internal/array-like-expression.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-like-expression.js","sourceRoot":"","sources":["../../src/_internal/array-like-expression.ts"],"names":[],"mappings":"AAQA,OAAO,EACH,aAAa,EACb,kCAAkC,EAClC,iBAAiB,GACpB,MAAM,+BAA+B,CAAC;AACvC,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAEtC,OAAO,EAAE,aAAa,EAAE,MAAM,eAAe,CAAC;AAC9C,OAAO,EAAE,wCAAwC,EAAE,MAAM,mCAAmC,CAAC;AAC7F,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EAAE,gBAAgB,EAAE,MAAM,qBAAqB,CAAC;AACvD,OAAO,EACH,0BAA0B,EAC1B,gCAAgC,EAChC,+BAA+B,EAC/B,+BAA+B,GAClC,MAAM,0BAA0B,CAAC;AAClC,OAAO,EAAE,kCAAkC,EAAE,MAAM,2BAA2B,CAAC;AAuC/E,MAAM,uBAAuB,GAAG,CAAC,EAC7B,aAAa,EACb,OAAO,EACP,eAAe,EACf,SAAS,EACT,cAAc,GAOhB,EAAW,EAAE;IACX,MAAM,YAAY,GAAG,eAAe,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;IAExD,IAAI,SAAS,CAAC,YAAY,CAAC,EAAE,CAAC;QAC1B,OAAO,YAAY,CAAC;IACxB,CAAC;IAED,IAAI,gBAAgB,CAAC,SAAS,EAAE,aAAa,CAAC,EAAE,CAAC;QAC7C,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,SAAS,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;IAE7B,IAAI,aAAa,CAAC,aAAa,CAAC,IAAI,iBAAiB,CAAC,aAAa,CAAC,EAAE,CAAC;QACnE,eAAe,CAAC,GAAG,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;QAE1C,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,IAAI,kCAAkC,CAAC,aAAa,EAAE,OAAO,CAAC,EAAE,CAAC;QAC7D,eAAe,CAAC,GAAG,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;QAEzC,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,IACI,+BAA+B,CAAC,OAAO,EAAE,aAAa,CAAC,KAAK,IAAI;QAChE,+BAA+B,CAAC,OAAO,EAAE,aAAa,CAAC,KAAK,IAAI,EAClE,CAAC;QACC,eAAe,CAAC,GAAG,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;QAEzC,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,IAAI,aAAa,CAAC,OAAO,EAAE,EAAE,CAAC;QAC1B,MAAM,WAAW,GACb,cAAc,KAAK,OAAO;YACtB,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,QAAQ,EAAE,EAAE,CACnC,uBAAuB,CAAC;gBACpB,aAAa,EAAE,QAAQ;gBACvB,OAAO;gBACP,eAAe;gBACf,SAAS;gBACT,cAAc;aACjB,CAAC,CACL;YACH,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CAClC,uBAAuB,CAAC;gBACpB,aAAa,EAAE,QAAQ;gBACvB,OAAO;gBACP,eAAe;gBACf,SAAS;gBACT,cAAc;aACjB,CAAC,CACL,CAAC;QAEZ,eAAe,CAAC,GAAG,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;QAEhD,OAAO,WAAW,CAAC;IACvB,CAAC;IAED,IAAI,aAAa,CAAC,cAAc,EAAE,EAAE,CAAC;QACjC,MAAM,WAAW,GAAG,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,QAAQ,EAAE,EAAE,CACtD,uBAAuB,CAAC;YACpB,aAAa,EAAE,QAAQ;YACvB,OAAO;YACP,eAAe;YACf,SAAS;YACT,cAAc;SACjB,CAAC,CACL,CAAC;QAEF,eAAe,CAAC,GAAG,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;QAEhD,OAAO,WAAW,CAAC;IACvB,CAAC;IAED,MAAM,cAAc,GAAG,gCAAgC,CACnD,OAAO,EACP,aAAa,CAChB,CAAC;IACF,IACI,SAAS,CAAC,cAAc,CAAC;QACzB,cAAc,KAAK,aAAa;QAChC,uBAAuB,CAAC;YACpB,aAAa,EAAE,cAAc;YAC7B,OAAO;YACP,eAAe;YACf,SAAS;YACT,cAAc;SACjB,CAAC,EACJ,CAAC;QACC,eAAe,CAAC,GAAG,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;QAEzC,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,MAAM,YAAY,GAAG,0BAA0B,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;IACxE,IAAI,SAAS,CAAC,YAAY,CAAC,IAAI,YAAY,KAAK,aAAa,EAAE,CAAC;QAC5D,MAAM,WAAW,GAAG,uBAAuB,CAAC;YACxC,aAAa,EAAE,YAAY;YAC3B,OAAO;YACP,eAAe;YACf,SAAS;YACT,cAAc;SACjB,CAAC,CAAC;QAEH,eAAe,CAAC,GAAG,CAAC,aAAa,EAAE,WAAW,CAAC,CAAC;QAEhD,OAAO,WAAW,CAAC;IACvB,CAAC;IAED,eAAe,CAAC,GAAG,CAAC,aAAa,EAAE,KAAK,CAAC,CAAC;IAE1C,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC;AAEF;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAC3B,OAAiC,EACjC,IAAuB,EACvB,iBAA0C,MAAM,EACzC,EAAE,CACT,uBAAuB,CAAC;IACpB,aAAa,EAAE,IAAI;IACnB,OAAO;IACP,eAAe,EAAE,IAAI,GAAG,EAA8B;IACtD,SAAS,EAAE,IAAI,GAAG,EAAqB;IACvC,cAAc;CACjB,CAAC,CAAC;AAEP,MAAM,qCAAqC,GAAG,CAC1C,UAAyC,EACtB,EAAE;IACrB,IAAI,UAAU,CAAC,IAAI,KAAK,iBAAiB,EAAE,CAAC;QACxC,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,IACI,UAAU,CAAC,IAAI,KAAK,gBAAgB;QACpC,UAAU,CAAC,IAAI,KAAK,qBAAqB;QACzC,UAAU,CAAC,IAAI,KAAK,uBAAuB,EAC7C,CAAC;QACC,OAAO,qCAAqC,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;IACxE,CAAC;IAED,OAAO,SAAS,CAAC;AACrB,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,kCAAkC,GAAG,CAAC,EAC/C,OAAO,EACP,cAAc,EACd,iBAAiB,EACjB,cAAc,GAAG,MAAM,GACmB,EAAE,EAAE;IAC9C,MAAM,4BAA4B,GAAG,IAAI,GAAG,EAA8B,CAAC;IAE3E,OAAO,CAAC,UAAyC,EAAW,EAAE;QAC1D,MAAM,eAAe,GACjB,qCAAqC,CAAC,UAAU,CAAC,CAAC;QAEtD,kCAAkC,CAAC;YAC/B,QAAQ,EAAE,iBAAiB;YAC3B,YAAY,EAAE,SAAS,CAAC,eAAe,CAAC;SAC3C,CAAC,CAAC;QAEH,IAAI,SAAS,CAAC,eAAe,CAAC,EAAE,CAAC;YAC7B,OAAO,eAAe,CAAC;QAC3B,CAAC;QAED,MAAM,MAAM,GAAG,iBAAiB,CAAC;YAC7B,SAAS,EAAE,GAAG,EAAE;gBACZ,MAAM,cAAc,GAAG,wCAAwC,CAC3D,OAAO,EACP,UAAU,EACV,cAAc,EACd,8CAA8C,CACjD,CAAC;gBAEF,IAAI,CAAC,SAAS,CAAC,cAAc,CAAC,EAAE,CAAC;oBAC7B,OAAO,KAAK,CAAC;gBACjB,CAAC;gBAED,OAAO,uBAAuB,CAAC;oBAC3B,aAAa,EAAE,cAAc;oBAC7B,OAAO;oBACP,eAAe,EAAE,4BAA4B;oBAC7C,SAAS,EAAE,IAAI,GAAG,EAAqB;oBACvC,cAAc;iBACjB,CAAC,CAAC;YACP,CAAC;YACD,MAAM,EAAE,oCAAoC;SAC/C,CAAC,CAAC;QAEH,IAAI,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC;YACb,OAAO,KAAK,CAAC;QACjB,CAAC;QAED,OAAO,MAAM,CAAC,KAAK,CAAC;IACxB,CAAC,CAAC;AACN,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,6BAA6B,GAAG,CACzC,IAAyC,EAClC,EAAE;IACT,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC,CAAC;IAEvC,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;QAC3B,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,IAAI,UAAU,CAAC,IAAI,KAAK,sBAAsB,EAAE,CAAC;QAC7C,OAAO,UAAU,CAAC,IAAI,KAAK,IAAI,CAAC;IACpC,CAAC;IAED,IAAI,UAAU,CAAC,IAAI,KAAK,iBAAiB,EAAE,CAAC;QACxC,OAAO,UAAU,CAAC,QAAQ,KAAK,QAAQ,CAAC;IAC5C,CAAC;IAED,IAAI,UAAU,CAAC,IAAI,KAAK,kBAAkB,EAAE,CAAC;QACzC,OAAO,UAAU,CAAC,QAAQ,KAAK,IAAI,CAAC;IACxC,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC,CAAC"}

package/dist/_internal/array-method-call-rule.d.ts

@@ -0,0 +1,34 @@
+/**
+ * @packageDocumentation
+ * Shared reporting helper for ts-extras array-method call replacement rules.
+ */
+import type { TSESLint, TSESTree } from "@typescript-eslint/utils";
+import type { UnknownArray } from "type-fest";
+import { type ImportedValueAliasMap } from "./imported-value-symbols.js";
+/** Typed rule context shape for array-method rule listeners. */
+type ArrayMethodRuleContext<MessageId extends string> = Readonly<TSESLint.RuleContext<MessageId, Readonly<UnknownArray>>>;
+/** Direct named value imports collection type from shared import helper. */
+type DirectNamedValueImports = ImportedValueAliasMap;
+/**
+ * Match `<arrayExpr>.<method>(...)` and report a standardized ts-extras helper
+ * replacement when the receiver is array-like.
+ */
+export declare const reportTsExtrasArrayMethodCall: <MessageId extends string>({ canAutofix, context, importedName, imports, isArrayLikeExpression, memberName, messageId, node, reportSuggestion, suggestionMessageId, }: Readonly<{
+    canAutofix?: (node: Readonly<TSESTree.CallExpression>) => boolean;
+    context: ArrayMethodRuleContext<MessageId>;
+    importedName: string;
+    imports: DirectNamedValueImports;
+    isArrayLikeExpression: (expression: Readonly<TSESTree.Expression>) => boolean;
+    memberName: string;
+    messageId: MessageId;
+    node: Readonly<TSESTree.CallExpression>;
+    reportSuggestion?: (input: Readonly<{
+        fix: TSESLint.ReportFixFunction;
+        messageId: MessageId;
+        node: Readonly<TSESTree.CallExpression>;
+        suggestionMessageId: MessageId;
+    }>) => void;
+    suggestionMessageId?: MessageId;
+}>) => void;
+export {};
+//# sourceMappingURL=array-method-call-rule.d.ts.map

package/dist/_internal/array-method-call-rule.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-method-call-rule.d.ts","sourceRoot":"","sources":["../../src/_internal/array-method-call-rule.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AACnE,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,WAAW,CAAC;AAE9C,OAAO,EAEH,KAAK,qBAAqB,EAC7B,MAAM,6BAA6B,CAAC;AAQrC,gEAAgE;AAChE,KAAK,sBAAsB,CAAC,SAAS,SAAS,MAAM,IAAI,QAAQ,CAC5D,QAAQ,CAAC,WAAW,CAAC,SAAS,EAAE,QAAQ,CAAC,YAAY,CAAC,CAAC,CAC1D,CAAC;AAEF,4EAA4E;AAC5E,KAAK,uBAAuB,GAAG,qBAAqB,CAAC;AAErD;;;GAGG;AACH,eAAO,MAAM,6BAA6B,GAAI,SAAS,SAAS,MAAM,EAAE,4IAWrE,QAAQ,CAAC;IACR,UAAU,CAAC,EAAE,CAAC,IAAI,EAAE,QAAQ,CAAC,QAAQ,CAAC,cAAc,CAAC,KAAK,OAAO,CAAC;IAClE,OAAO,EAAE,sBAAsB,CAAC,SAAS,CAAC,CAAC;IAC3C,YAAY,EAAE,MAAM,CAAC;IACrB,OAAO,EAAE,uBAAuB,CAAC;IACjC,qBAAqB,EAAE,CACnB,UAAU,EAAE,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,KACxC,OAAO,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,SAAS,EAAE,SAAS,CAAC;IACrB,IAAI,EAAE,QAAQ,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC;IACxC,gBAAgB,CAAC,EAAE,CACf,KAAK,EAAE,QAAQ,CAAC;QACZ,GAAG,EAAE,QAAQ,CAAC,iBAAiB,CAAC;QAChC,SAAS,EAAE,SAAS,CAAC;QACrB,IAAI,EAAE,QAAQ,CAAC,QAAQ,CAAC,cAAc,CAAC,CAAC;QACxC,mBAAmB,EAAE,SAAS,CAAC;KAClC,CAAC,KACD,IAAI,CAAC;IACV,mBAAmB,CAAC,EAAE,SAAS,CAAC;CACnC,CAAC,KAAG,IA8CJ,CAAC"}

package/dist/_internal/array-method-call-rule.js

@@ -0,0 +1,49 @@
+import { createMethodToFunctionCallFix, } from "./imported-value-symbols.js";
+import { getIdentifierPropertyMemberCall } from "./member-call.js";
+import { TS_EXTRAS_MODULE_SOURCE } from "./module-source.js";
+import { reportResolvedAutofixOrSuggestionOutcome, resolveAutofixOrSuggestionOutcome, } from "./rule-reporting.js";
+/**
+ * Match `<arrayExpr>.<method>(...)` and report a standardized ts-extras helper
+ * replacement when the receiver is array-like.
+ */
+export const reportTsExtrasArrayMethodCall = ({ canAutofix, context, importedName, imports, isArrayLikeExpression, memberName, messageId, node, reportSuggestion, suggestionMessageId, }) => {
+    const memberCall = getIdentifierPropertyMemberCall({
+        memberName,
+        node,
+    });
+    if (memberCall === null) {
+        return;
+    }
+    if (!isArrayLikeExpression(memberCall.callee.object)) {
+        return;
+    }
+    const shouldAutofix = canAutofix?.(node) ?? true;
+    const fix = createMethodToFunctionCallFix({
+        callNode: node,
+        context,
+        importedName,
+        imports,
+        sourceModuleName: TS_EXTRAS_MODULE_SOURCE,
+    });
+    const outcome = resolveAutofixOrSuggestionOutcome({
+        canAutofix: shouldAutofix,
+        fix,
+    });
+    if (outcome.kind === "suggestion" && reportSuggestion !== undefined) {
+        reportSuggestion({
+            fix: outcome.fix,
+            messageId,
+            node,
+            suggestionMessageId: suggestionMessageId ?? messageId,
+        });
+        return;
+    }
+    reportResolvedAutofixOrSuggestionOutcome({
+        context,
+        messageId,
+        node,
+        outcome,
+        suggestionMessageId: suggestionMessageId ?? messageId,
+    });
+};
+//# sourceMappingURL=array-method-call-rule.js.map

package/dist/_internal/array-method-call-rule.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"array-method-call-rule.js","sourceRoot":"","sources":["../../src/_internal/array-method-call-rule.ts"],"names":[],"mappings":"AAOA,OAAO,EACH,6BAA6B,GAEhC,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAAE,+BAA+B,EAAE,MAAM,kBAAkB,CAAC;AACnE,OAAO,EAAE,uBAAuB,EAAE,MAAM,oBAAoB,CAAC;AAC7D,OAAO,EACH,wCAAwC,EACxC,iCAAiC,GACpC,MAAM,qBAAqB,CAAC;AAU7B;;;GAGG;AACH,MAAM,CAAC,MAAM,6BAA6B,GAAG,CAA2B,EACpE,UAAU,EACV,OAAO,EACP,YAAY,EACZ,OAAO,EACP,qBAAqB,EACrB,UAAU,EACV,SAAS,EACT,IAAI,EACJ,gBAAgB,EAChB,mBAAmB,GAqBrB,EAAQ,EAAE;IACR,MAAM,UAAU,GAAG,+BAA+B,CAAC;QAC/C,UAAU;QACV,IAAI;KACP,CAAC,CAAC;IAEH,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;QACtB,OAAO;IACX,CAAC;IAED,IAAI,CAAC,qBAAqB,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC;QACnD,OAAO;IACX,CAAC;IAED,MAAM,aAAa,GAAG,UAAU,EAAE,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC;IACjD,MAAM,GAAG,GAAG,6BAA6B,CAAC;QACtC,QAAQ,EAAE,IAAI;QACd,OAAO;QACP,YAAY;QACZ,OAAO;QACP,gBAAgB,EAAE,uBAAuB;KAC5C,CAAC,CAAC;IAEH,MAAM,OAAO,GAAG,iCAAiC,CAAC;QAC9C,UAAU,EAAE,aAAa;QACzB,GAAG;KACN,CAAC,CAAC;IAEH,IAAI,OAAO,CAAC,IAAI,KAAK,YAAY,IAAI,gBAAgB,KAAK,SAAS,EAAE,CAAC;QAClE,gBAAgB,CAAC;YACb,GAAG,EAAE,OAAO,CAAC,GAAG;YAChB,SAAS;YACT,IAAI;YACJ,mBAAmB,EAAE,mBAAmB,IAAI,SAAS;SACxD,CAAC,CAAC;QAEH,OAAO;IACX,CAAC;IAED,wCAAwC,CAAC;QACrC,OAAO;QACP,SAAS;QACT,IAAI;QACJ,OAAO;QACP,mBAAmB,EAAE,mBAAmB,IAAI,SAAS;KACxD,CAAC,CAAC;AACP,CAAC,CAAC"}

package/dist/_internal/ast-node.d.ts

@@ -0,0 +1,23 @@
+/**
+ * @packageDocumentation
+ * AST parent-chain traversal helpers used by multiple rule utilities.
+ */
+import type { TSESTree } from "@typescript-eslint/utils";
+/**
+ * Gets a node's parent reference when available.
+ *
+ * @param node - AST node whose parent should be read.
+ *
+ * @returns Parent node when present on parser output; otherwise `undefined`.
+ */
+export declare const getParentNode: (node: Readonly<TSESTree.Node>) => Readonly<TSESTree.Node> | undefined;
+/**
+ * Walks the parent chain to locate the enclosing `Program` node.
+ *
+ * @param node - Starting AST node.
+ *
+ * @returns Nearest enclosing `Program` node; otherwise `null` when no program
+ *   boundary can be reached (including cycle-guard termination).
+ */
+export declare const getProgramNode: (node: Readonly<TSESTree.Node>) => null | Readonly<TSESTree.Program>;
+//# sourceMappingURL=ast-node.d.ts.map

package/dist/_internal/ast-node.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast-node.d.ts","sourceRoot":"","sources":["../../src/_internal/ast-node.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAoBzD;;;;;;GAMG;AACH,eAAO,MAAM,aAAa,GACtB,MAAM,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,KAC9B,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,SACgC,CAAC;AAE9D;;;;;;;GAOG;AACH,eAAO,MAAM,cAAc,GACvB,MAAM,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,KAC9B,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,OAAO,CAqBlC,CAAC"}

package/dist/_internal/ast-node.js

@@ -0,0 +1,38 @@
+import { keyIn } from "ts-extras";
+import { resolveFirstValueInLinkedStructure } from "./cycle-safe-linked-search.js";
+/**
+ * Determine whether a node exposes an optional `parent` property.
+ */
+const hasOptionalParentProperty = (node) => keyIn(node, "parent");
+/**
+ * Gets a node's parent reference when available.
+ *
+ * @param node - AST node whose parent should be read.
+ *
+ * @returns Parent node when present on parser output; otherwise `undefined`.
+ */
+export const getParentNode = (node) => hasOptionalParentProperty(node) ? node.parent : undefined;
+/**
+ * Walks the parent chain to locate the enclosing `Program` node.
+ *
+ * @param node - Starting AST node.
+ *
+ * @returns Nearest enclosing `Program` node; otherwise `null` when no program
+ *   boundary can be reached (including cycle-guard termination).
+ */
+export const getProgramNode = (node) => {
+    const lookupResult = resolveFirstValueInLinkedStructure({
+        getNextNode: (currentNode) => getParentNode(currentNode) ?? null,
+        resolveValue: (currentNode) => currentNode.type === "Program"
+            ? {
+                found: true,
+                value: currentNode,
+            }
+            : {
+                found: false,
+            },
+        startNode: node,
+    });
+    return lookupResult.found ? lookupResult.value : null;
+};
+//# sourceMappingURL=ast-node.js.map

package/dist/_internal/ast-node.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"ast-node.js","sourceRoot":"","sources":["../../src/_internal/ast-node.ts"],"names":[],"mappings":"AAMA,OAAO,EAAE,KAAK,EAAE,MAAM,WAAW,CAAC;AAElC,OAAO,EAAE,kCAAkC,EAAE,MAAM,+BAA+B,CAAC;AASnF;;GAEG;AACH,MAAM,yBAAyB,GAAG,CAC9B,IAA6B,EACC,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;AAE3D;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CACzB,IAA6B,EACM,EAAE,CACrC,yBAAyB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC;AAE9D;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,CAC1B,IAA6B,EACI,EAAE;IACnC,MAAM,YAAY,GAAG,kCAAkC,CAGrD;QACE,WAAW,EAAE,CACT,WAAoC,EACN,EAAE,CAAC,aAAa,CAAC,WAAW,CAAC,IAAI,IAAI;QACvE,YAAY,EAAE,CAAC,WAAoC,EAAE,EAAE,CACnD,WAAW,CAAC,IAAI,KAAK,SAAS;YAC1B,CAAC,CAAC;gBACI,KAAK,EAAE,IAAI;gBACX,KAAK,EAAE,WAAW;aACrB;YACH,CAAC,CAAC;gBACI,KAAK,EAAE,KAAK;aACf;QACX,SAAS,EAAE,IAAI;KAClB,CAAC,CAAC;IAEH,OAAO,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;AAC1D,CAAC,CAAC"}

package/dist/_internal/bounded-cache.d.ts

@@ -0,0 +1,42 @@
+/**
+ * @packageDocumentation
+ * Shared bounded-cache helpers with lightweight LRU semantics for hot-path
+ * parser/type-analysis caches.
+ */
+/**
+ * Result shape returned by bounded-cache lookups.
+ */
+export type BoundedCacheLookupResult<Value> = Readonly<{
+    found: false;
+}> | Readonly<{
+    found: true;
+    value: Value;
+}>;
+/**
+ * Read a cache entry and mark it as most-recently-used.
+ *
+ * @param cache - Mutable cache map.
+ * @param key - Entry key.
+ *
+ * @returns Lookup result describing whether an entry was found. When found,
+ *   includes the cached value (which can itself be `undefined`/`null`).
+ */
+export declare const getBoundedCacheValue: <Key, Value>(cache: Map<Key, Value>, key: Key) => BoundedCacheLookupResult<Value>;
+/**
+ * Insert or update a cache entry and evict least-recently-used entries beyond
+ * the configured max size.
+ *
+ * @param options - Bounded-cache insertion options.
+ *
+ *   - `cache`: Mutable cache map.
+ *   - `key`: Entry key.
+ *   - `maxEntries`: Maximum number of cache entries to retain.
+ *   - `value`: Entry value.
+ */
+export declare const setBoundedCacheValue: <Key, Value>({ cache, key, maxEntries, value, }: Readonly<{
+    cache: Map<Key, Value>;
+    key: Key;
+    maxEntries: number;
+    value: Value;
+}>) => void;
+//# sourceMappingURL=bounded-cache.d.ts.map

package/dist/_internal/bounded-cache.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bounded-cache.d.ts","sourceRoot":"","sources":["../../src/_internal/bounded-cache.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAIH;;GAEG;AACH,MAAM,MAAM,wBAAwB,CAAC,KAAK,IACpC,QAAQ,CAAC;IACL,KAAK,EAAE,KAAK,CAAC;CAChB,CAAC,GACF,QAAQ,CAAC;IACL,KAAK,EAAE,IAAI,CAAC;IACZ,KAAK,EAAE,KAAK,CAAC;CAChB,CAAC,CAAC;AAET;;;;;;;;GAQG;AACH,eAAO,MAAM,oBAAoB,GAAI,GAAG,EAAE,KAAK,EAC3C,OAAO,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,EACtB,KAAK,GAAG,KACT,wBAAwB,CAAC,KAAK,CAgBhC,CAAC;AAEF;;;;;;;;;;GAUG;AACH,eAAO,MAAM,oBAAoB,GAAI,GAAG,EAAE,KAAK,EAAE,oCAK9C,QAAQ,CAAC;IACR,KAAK,EAAE,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACvB,GAAG,EAAE,GAAG,CAAC;IACT,UAAU,EAAE,MAAM,CAAC;IACnB,KAAK,EAAE,KAAK,CAAC;CAChB,CAAC,KAAG,IAoBJ,CAAC"}

package/dist/_internal/bounded-cache.js

@@ -0,0 +1,57 @@
+/**
+ * @packageDocumentation
+ * Shared bounded-cache helpers with lightweight LRU semantics for hot-path
+ * parser/type-analysis caches.
+ */
+import { isSafeInteger } from "ts-extras";
+/**
+ * Read a cache entry and mark it as most-recently-used.
+ *
+ * @param cache - Mutable cache map.
+ * @param key - Entry key.
+ *
+ * @returns Lookup result describing whether an entry was found. When found,
+ *   includes the cached value (which can itself be `undefined`/`null`).
+ */
+export const getBoundedCacheValue = (cache, key) => {
+    if (!cache.has(key)) {
+        return {
+            found: false,
+        };
+    }
+    const value = cache.get(key);
+    cache.delete(key);
+    cache.set(key, value);
+    return {
+        found: true,
+        value,
+    };
+};
+/**
+ * Insert or update a cache entry and evict least-recently-used entries beyond
+ * the configured max size.
+ *
+ * @param options - Bounded-cache insertion options.
+ *
+ *   - `cache`: Mutable cache map.
+ *   - `key`: Entry key.
+ *   - `maxEntries`: Maximum number of cache entries to retain.
+ *   - `value`: Entry value.
+ */
+export const setBoundedCacheValue = ({ cache, key, maxEntries, value, }) => {
+    if (!isSafeInteger(maxEntries) || maxEntries < 1) {
+        return;
+    }
+    if (cache.has(key)) {
+        cache.delete(key);
+    }
+    cache.set(key, value);
+    while (cache.size > maxEntries) {
+        const oldestEntry = cache.keys().next();
+        if (oldestEntry.done === true) {
+            return;
+        }
+        cache.delete(oldestEntry.value);
+    }
+};
+//# sourceMappingURL=bounded-cache.js.map

package/dist/_internal/bounded-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bounded-cache.js","sourceRoot":"","sources":["../../src/_internal/bounded-cache.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,aAAa,EAAE,MAAM,WAAW,CAAC;AAc1C;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAChC,KAAsB,EACtB,GAAQ,EACuB,EAAE;IACjC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QAClB,OAAO;YACH,KAAK,EAAE,KAAK;SACf,CAAC;IACN,CAAC;IAED,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAU,CAAC;IAEtC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAClB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAEtB,OAAO;QACH,KAAK,EAAE,IAAI;QACX,KAAK;KACR,CAAC;AACN,CAAC,CAAC;AAEF;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAa,EAC7C,KAAK,EACL,GAAG,EACH,UAAU,EACV,KAAK,GAMP,EAAQ,EAAE;IACR,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,IAAI,UAAU,GAAG,CAAC,EAAE,CAAC;QAC/C,OAAO;IACX,CAAC;IAED,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;QACjB,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IACtB,CAAC;IAED,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IAEtB,OAAO,KAAK,CAAC,IAAI,GAAG,UAAU,EAAE,CAAC;QAC7B,MAAM,WAAW,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;QAExC,IAAI,WAAW,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YAC5B,OAAO;QACX,CAAC;QAED,KAAK,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;IACpC,CAAC;AACL,CAAC,CAAC"}

package/dist/_internal/constrained-type-at-location.d.ts

@@ -0,0 +1,31 @@
+/**
+ * @packageDocumentation
+ * Resolve constrained TypeScript types from ESTree nodes with resilient
+ * fallbacks for partially mocked parser-services in tests.
+ */
+import type { TSESTree } from "@typescript-eslint/utils";
+import type ts from "typescript";
+type ConstrainedTypeParserServices = Readonly<{
+    esTreeNodeToTSNodeMap: Readonly<{
+        get: (key: Readonly<TSESTree.Node>) => ts.Node | undefined;
+    }>;
+    getTypeAtLocation?: (node: Readonly<TSESTree.Node>) => Readonly<ts.Type> | ts.Type;
+    program?: null | Readonly<{
+        getTypeChecker: () => ts.TypeChecker;
+    }>;
+}>;
+/**
+ * Resolve a node type using `getConstrainedTypeAtLocation` when available, then
+ * fall back to checker + node-map based resolution.
+ *
+ * @param checker - Type checker used for fallback type lookups.
+ * @param node - ESTree node whose type should be resolved.
+ * @param parserServices - Parser services with node mapping and optional typed
+ *   helpers.
+ * @param reason - Stable diagnostics reason fragment for safe-type wrappers.
+ *
+ * @returns The constrained type when resolvable; otherwise `undefined`.
+ */
+export declare const getConstrainedTypeAtLocationWithFallback: (checker: Readonly<ts.TypeChecker>, node: Readonly<TSESTree.Node>, parserServices: ConstrainedTypeParserServices, reason: string) => ts.Type | undefined;
+export {};
+//# sourceMappingURL=constrained-type-at-location.d.ts.map

package/dist/_internal/constrained-type-at-location.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"constrained-type-at-location.d.ts","sourceRoot":"","sources":["../../src/_internal/constrained-type-at-location.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AACzD,OAAO,KAAK,EAAE,MAAM,YAAY,CAAC;AAYjC,KAAK,6BAA6B,GAAG,QAAQ,CAAC;IAC1C,qBAAqB,EAAE,QAAQ,CAAC;QAC5B,GAAG,EAAE,CAAC,GAAG,EAAE,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,IAAI,GAAG,SAAS,CAAC;KAC9D,CAAC,CAAC;IACH,iBAAiB,CAAC,EAAE,CAChB,IAAI,EAAE,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,KAC5B,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC;IACjC,OAAO,CAAC,EAAE,IAAI,GAAG,QAAQ,CAAC;QACtB,cAAc,EAAE,MAAM,EAAE,CAAC,WAAW,CAAC;KACxC,CAAC,CAAC;CACN,CAAC,CAAC;AAEH;;;;;;;;;;;GAWG;AACH,eAAO,MAAM,wCAAwC,GACjD,SAAS,QAAQ,CAAC,EAAE,CAAC,WAAW,CAAC,EACjC,MAAM,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,EAC7B,gBAAgB,6BAA6B,EAC7C,QAAQ,MAAM,KACf,EAAE,CAAC,IAAI,GAAG,SAmEZ,CAAC"}

package/dist/_internal/constrained-type-at-location.js

@@ -0,0 +1,61 @@
+import { getConstrainedTypeAtLocation } from "@typescript-eslint/type-utils";
+import { isDefined, safeCastTo } from "ts-extras";
+import { safeTypeOperation } from "./safe-type-operation.js";
+import { getTypeCheckerBaseConstraintType } from "./type-checker-compat.js";
+import { recordTypedPathExpensiveTypeCall, recordTypedPathFallbackInvocation, } from "./typed-path-telemetry.js";
+/**
+ * Resolve a node type using `getConstrainedTypeAtLocation` when available, then
+ * fall back to checker + node-map based resolution.
+ *
+ * @param checker - Type checker used for fallback type lookups.
+ * @param node - ESTree node whose type should be resolved.
+ * @param parserServices - Parser services with node mapping and optional typed
+ *   helpers.
+ * @param reason - Stable diagnostics reason fragment for safe-type wrappers.
+ *
+ * @returns The constrained type when resolvable; otherwise `undefined`.
+ */
+export const getConstrainedTypeAtLocationWithFallback = (checker, node, parserServices, reason) => {
+    const mappedTsNode = parserServices.esTreeNodeToTSNodeMap.get(node);
+    const telemetryFilePathResult = safeTypeOperation({
+        operation: () => mappedTsNode?.getSourceFile?.().fileName,
+        reason: "constrained-type-telemetry-file-path-resolution-failed",
+    });
+    const telemetryFilePath = telemetryFilePathResult.ok
+        ? telemetryFilePathResult.value
+        : undefined;
+    recordTypedPathExpensiveTypeCall(telemetryFilePath);
+    const constrainedTypeResult = safeTypeOperation({
+        operation: () => {
+            if (typeof parserServices.getTypeAtLocation !== "function" ||
+                !isDefined(parserServices.program)) {
+                return null;
+            }
+            return getConstrainedTypeAtLocation(parserServices, safeCastTo(node));
+        },
+        reason: `${reason}-constrained`,
+    });
+    if (constrainedTypeResult.ok &&
+        constrainedTypeResult.value !== null &&
+        isDefined(constrainedTypeResult.value)) {
+        return constrainedTypeResult.value;
+    }
+    recordTypedPathFallbackInvocation(telemetryFilePath);
+    const fallbackTypeResult = safeTypeOperation({
+        operation: () => {
+            const tsNode = mappedTsNode;
+            if (!isDefined(tsNode)) {
+                return null;
+            }
+            const rawType = checker.getTypeAtLocation(tsNode);
+            const constrainedType = getTypeCheckerBaseConstraintType(checker, rawType);
+            return constrainedType ?? rawType;
+        },
+        reason: `${reason}-fallback`,
+    });
+    if (!fallbackTypeResult.ok || fallbackTypeResult.value === null) {
+        return undefined;
+    }
+    return fallbackTypeResult.value;
+};
+//# sourceMappingURL=constrained-type-at-location.js.map

package/dist/_internal/constrained-type-at-location.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"constrained-type-at-location.js","sourceRoot":"","sources":["../../src/_internal/constrained-type-at-location.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,4BAA4B,EAAE,MAAM,+BAA+B,CAAC;AAC7E,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,MAAM,WAAW,CAAC;AAElD,OAAO,EAAE,iBAAiB,EAAE,MAAM,0BAA0B,CAAC;AAC7D,OAAO,EAAE,gCAAgC,EAAE,MAAM,0BAA0B,CAAC;AAC5E,OAAO,EACH,gCAAgC,EAChC,iCAAiC,GACpC,MAAM,2BAA2B,CAAC;AAcnC;;;;;;;;;;;GAWG;AACH,MAAM,CAAC,MAAM,wCAAwC,GAAG,CACpD,OAAiC,EACjC,IAA6B,EAC7B,cAA6C,EAC7C,MAAc,EACK,EAAE;IACrB,MAAM,YAAY,GAAG,cAAc,CAAC,qBAAqB,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IACpE,MAAM,uBAAuB,GAAG,iBAAiB,CAAC;QAC9C,SAAS,EAAE,GAAG,EAAE,CAAC,YAAY,EAAE,aAAa,EAAE,EAAE,CAAC,QAAQ;QACzD,MAAM,EAAE,wDAAwD;KACnE,CAAC,CAAC;IACH,MAAM,iBAAiB,GAAG,uBAAuB,CAAC,EAAE;QAChD,CAAC,CAAC,uBAAuB,CAAC,KAAK;QAC/B,CAAC,CAAC,SAAS,CAAC;IAEhB,gCAAgC,CAAC,iBAAiB,CAAC,CAAC;IAEpD,MAAM,qBAAqB,GAAG,iBAAiB,CAAC;QAC5C,SAAS,EAAE,GAAG,EAAE;YACZ,IACI,OAAO,cAAc,CAAC,iBAAiB,KAAK,UAAU;gBACtD,CAAC,SAAS,CAAC,cAAc,CAAC,OAAO,CAAC,EACpC,CAAC;gBACC,OAAO,IAAI,CAAC;YAChB,CAAC;YAED,OAAO,4BAA4B,CAC/B,cAEI,EACJ,UAAU,CACN,IAAI,CACP,CACJ,CAAC;QACN,CAAC;QACD,MAAM,EAAE,GAAG,MAAM,cAAc;KAClC,CAAC,CAAC;IAEH,IACI,qBAAqB,CAAC,EAAE;QACxB,qBAAqB,CAAC,KAAK,KAAK,IAAI;QACpC,SAAS,CAAC,qBAAqB,CAAC,KAAK,CAAC,EACxC,CAAC;QACC,OAAO,qBAAqB,CAAC,KAAK,CAAC;IACvC,CAAC;IAED,iCAAiC,CAAC,iBAAiB,CAAC,CAAC;IAErD,MAAM,kBAAkB,GAAG,iBAAiB,CAAC;QACzC,SAAS,EAAE,GAAG,EAAE;YACZ,MAAM,MAAM,GAAG,YAAY,CAAC;YAE5B,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;gBACrB,OAAO,IAAI,CAAC;YAChB,CAAC;YAED,MAAM,OAAO,GAAG,OAAO,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;YAClD,MAAM,eAAe,GAAG,gCAAgC,CACpD,OAAO,EACP,OAAO,CACV,CAAC;YAEF,OAAO,eAAe,IAAI,OAAO,CAAC;QACtC,CAAC;QACD,MAAM,EAAE,GAAG,MAAM,WAAW;KAC/B,CAAC,CAAC;IAEH,IAAI,CAAC,kBAAkB,CAAC,EAAE,IAAI,kBAAkB,CAAC,KAAK,KAAK,IAAI,EAAE,CAAC;QAC9D,OAAO,SAAS,CAAC;IACrB,CAAC;IAED,OAAO,kBAAkB,CAAC,KAAK,CAAC;AACpC,CAAC,CAAC"}

package/dist/_internal/cycle-safe-linked-search.d.ts

@@ -0,0 +1,48 @@
+/**
+ * @packageDocumentation
+ * Shared Floyd-cycle-guarded linked-structure traversal utilities.
+ */
+/**
+ * Result shape returned by linked-structure searches.
+ */
+export type LinkedStructureLookupResult<Value> = Readonly<{
+    found: false;
+}> | Readonly<{
+    found: true;
+    value: Value;
+}>;
+/**
+ * Resolve the first matching value while traversing a linked structure.
+ *
+ * @param options - Linked-structure traversal options.
+ *
+ *   - `startNode`: Initial node to inspect.
+ *   - `getNextNode`: Function that returns the next node in the chain.
+ *   - `resolveValue`: Function that returns a lookup result for the current node.
+ *
+ * @returns Lookup result for the first resolved value; otherwise a non-matching
+ *   lookup result when traversal reaches the chain end or detects a
+ *   parent-cycle.
+ */
+export declare const resolveFirstValueInLinkedStructure: <Node, Value>({ getNextNode, resolveValue, startNode, }: Readonly<{
+    getNextNode: (node: Node) => Node | null;
+    resolveValue: (node: Node) => LinkedStructureLookupResult<Value>;
+    startNode: Node | null;
+}>) => LinkedStructureLookupResult<Value>;
+/**
+ * Check whether any node in a linked structure satisfies a predicate.
+ *
+ * @param options - Linked-structure traversal options.
+ *
+ *   - `startNode`: Initial node to inspect.
+ *   - `getNextNode`: Function that returns the next node in the chain.
+ *   - `isMatch`: Predicate used to test each visited node.
+ *
+ * @returns `true` when any visited node matches; otherwise `false`.
+ */
+export declare const isAnyLinkedStructureNodeMatching: <Node>({ getNextNode, isMatch, startNode, }: Readonly<{
+    getNextNode: (node: Node) => Node | null;
+    isMatch: (node: Node) => boolean;
+    startNode: Node | null;
+}>) => boolean;
+//# sourceMappingURL=cycle-safe-linked-search.d.ts.map

package/dist/_internal/cycle-safe-linked-search.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"cycle-safe-linked-search.d.ts","sourceRoot":"","sources":["../../src/_internal/cycle-safe-linked-search.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH;;GAEG;AACH,MAAM,MAAM,2BAA2B,CAAC,KAAK,IACvC,QAAQ,CAAC;IACL,KAAK,EAAE,KAAK,CAAC;CAChB,CAAC,GACF,QAAQ,CAAC;IACL,KAAK,EAAE,IAAI,CAAC;IACZ,KAAK,EAAE,KAAK,CAAC;CAChB,CAAC,CAAC;AAOT;;;;;;;;;;;;GAYG;AACH,eAAO,MAAM,kCAAkC,GAAI,IAAI,EAAE,KAAK,EAAE,2CAI7D,QAAQ,CAAC;IACR,WAAW,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,IAAI,GAAG,IAAI,CAAC;IACzC,YAAY,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,2BAA2B,CAAC,KAAK,CAAC,CAAC;IACjE,SAAS,EAAE,IAAI,GAAG,IAAI,CAAC;CAC1B,CAAC,KAAG,2BAA2B,CAAC,KAAK,CA+BrC,CAAC;AAEF;;;;;;;;;;GAUG;AACH,eAAO,MAAM,gCAAgC,GAAI,IAAI,EAAE,sCAIpD,QAAQ,CAAC;IACR,WAAW,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,IAAI,GAAG,IAAI,CAAC;IACzC,OAAO,EAAE,CAAC,IAAI,EAAE,IAAI,KAAK,OAAO,CAAC;IACjC,SAAS,EAAE,IAAI,GAAG,IAAI,CAAC;CAC1B,CAAC,KAAG,OAaO,CAAC"}

package/dist/_internal/cycle-safe-linked-search.js

@@ -0,0 +1,70 @@
+/**
+ * @packageDocumentation
+ * Shared Floyd-cycle-guarded linked-structure traversal utilities.
+ */
+/**
+ * Fast-pointer hop count per iteration for Floyd cycle detection.
+ */
+const FLOYD_FAST_POINTER_ADVANCE_STEPS = 2;
+/**
+ * Resolve the first matching value while traversing a linked structure.
+ *
+ * @param options - Linked-structure traversal options.
+ *
+ *   - `startNode`: Initial node to inspect.
+ *   - `getNextNode`: Function that returns the next node in the chain.
+ *   - `resolveValue`: Function that returns a lookup result for the current node.
+ *
+ * @returns Lookup result for the first resolved value; otherwise a non-matching
+ *   lookup result when traversal reaches the chain end or detects a
+ *   parent-cycle.
+ */
+export const resolveFirstValueInLinkedStructure = ({ getNextNode, resolveValue, startNode, }) => {
+    let slowNode = startNode;
+    let fastNode = startNode;
+    while (slowNode !== null) {
+        const resolvedValue = resolveValue(slowNode);
+        if (resolvedValue.found) {
+            return resolvedValue;
+        }
+        slowNode = getNextNode(slowNode);
+        for (let step = 0; step < FLOYD_FAST_POINTER_ADVANCE_STEPS; step += 1) {
+            if (fastNode === null) {
+                break;
+            }
+            fastNode = getNextNode(fastNode);
+        }
+        if (slowNode !== null && fastNode !== null && slowNode === fastNode) {
+            return {
+                found: false,
+            };
+        }
+    }
+    return {
+        found: false,
+    };
+};
+/**
+ * Check whether any node in a linked structure satisfies a predicate.
+ *
+ * @param options - Linked-structure traversal options.
+ *
+ *   - `startNode`: Initial node to inspect.
+ *   - `getNextNode`: Function that returns the next node in the chain.
+ *   - `isMatch`: Predicate used to test each visited node.
+ *
+ * @returns `true` when any visited node matches; otherwise `false`.
+ */
+export const isAnyLinkedStructureNodeMatching = ({ getNextNode, isMatch, startNode, }) => resolveFirstValueInLinkedStructure({
+    getNextNode,
+    resolveValue: (node) => isMatch(node)
+        ? {
+            found: true,
+            value: true,
+        }
+        : {
+            found: false,
+        },
+    startNode,
+}).found;
+//# sourceMappingURL=cycle-safe-linked-search.js.map

package/dist/_internal/cycle-safe-linked-search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cycle-safe-linked-search.js","sourceRoot":"","sources":["../../src/_internal/cycle-safe-linked-search.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAcH;;GAEG;AACH,MAAM,gCAAgC,GAAG,CAAU,CAAC;AAEpD;;;;;;;;;;;;GAYG;AACH,MAAM,CAAC,MAAM,kCAAkC,GAAG,CAAc,EAC5D,WAAW,EACX,YAAY,EACZ,SAAS,GAKX,EAAsC,EAAE;IACtC,IAAI,QAAQ,GAAG,SAAS,CAAC;IACzB,IAAI,QAAQ,GAAG,SAAS,CAAC;IAEzB,OAAO,QAAQ,KAAK,IAAI,EAAE,CAAC;QACvB,MAAM,aAAa,GAAG,YAAY,CAAC,QAAQ,CAAC,CAAC;QAE7C,IAAI,aAAa,CAAC,KAAK,EAAE,CAAC;YACtB,OAAO,aAAa,CAAC;QACzB,CAAC;QAED,QAAQ,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;QAEjC,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,gCAAgC,EAAE,IAAI,IAAI,CAAC,EAAE,CAAC;YACpE,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;gBACpB,MAAM;YACV,CAAC;YAED,QAAQ,GAAG,WAAW,CAAC,QAAQ,CAAC,CAAC;QACrC,CAAC;QAED,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,IAAI,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;YAClE,OAAO;gBACH,KAAK,EAAE,KAAK;aACf,CAAC;QACN,CAAC;IACL,CAAC;IAED,OAAO;QACH,KAAK,EAAE,KAAK;KACf,CAAC;AACN,CAAC,CAAC;AAEF;;;;;;;;;;GAUG;AACH,MAAM,CAAC,MAAM,gCAAgC,GAAG,CAAO,EACnD,WAAW,EACX,OAAO,EACP,SAAS,GAKX,EAAW,EAAE,CACX,kCAAkC,CAAC;IAC/B,WAAW;IACX,YAAY,EAAE,CAAC,IAAI,EAAwC,EAAE,CACzD,OAAO,CAAC,IAAI,CAAC;QACT,CAAC,CAAC;YACI,KAAK,EAAE,IAAI;YACX,KAAK,EAAE,IAAI;SACd;QACH,CAAC,CAAC;YACI,KAAK,EAAE,KAAK;SACf;IACX,SAAS;CACZ,CAAC,CAAC,KAAK,CAAC"}

package/dist/_internal/expression-boolean-memoizer.d.ts

@@ -0,0 +1,17 @@
+/**
+ * @packageDocumentation
+ * Shared helper for memoizing boolean expression predicates by ESTree node
+ * identity.
+ */
+import type { TSESTree } from "@typescript-eslint/utils";
+/**
+ * Memoize a boolean expression predicate using a `WeakMap` keyed by expression
+ * node identity.
+ *
+ * @param evaluate - Predicate to memoize.
+ *
+ * @returns Memoized predicate that reuses previous results for the same node
+ *   object.
+ */
+export declare const memoizeExpressionBooleanPredicate: (evaluate: (expression: Readonly<TSESTree.Expression>) => boolean) => ((expression: Readonly<TSESTree.Expression>) => boolean);
+//# sourceMappingURL=expression-boolean-memoizer.d.ts.map

package/dist/_internal/expression-boolean-memoizer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"expression-boolean-memoizer.d.ts","sourceRoot":"","sources":["../../src/_internal/expression-boolean-memoizer.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AACH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAIzD;;;;;;;;GAQG;AACH,eAAO,MAAM,iCAAiC,GAC1C,UAAU,CAAC,UAAU,EAAE,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,KAAK,OAAO,KACjE,CAAC,CAAC,UAAU,EAAE,QAAQ,CAAC,QAAQ,CAAC,UAAU,CAAC,KAAK,OAAO,CAgBzD,CAAC"}

package/dist/_internal/expression-boolean-memoizer.js

@@ -0,0 +1,23 @@
+import { isDefined } from "ts-extras";
+/**
+ * Memoize a boolean expression predicate using a `WeakMap` keyed by expression
+ * node identity.
+ *
+ * @param evaluate - Predicate to memoize.
+ *
+ * @returns Memoized predicate that reuses previous results for the same node
+ *   object.
+ */
+export const memoizeExpressionBooleanPredicate = (evaluate) => {
+    const cache = new WeakMap();
+    return (expression) => {
+        const cachedResult = cache.get(expression);
+        if (isDefined(cachedResult)) {
+            return cachedResult;
+        }
+        const result = evaluate(expression);
+        cache.set(expression, result);
+        return result;
+    };
+};
+//# sourceMappingURL=expression-boolean-memoizer.js.map

package/dist/_internal/expression-boolean-memoizer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"expression-boolean-memoizer.js","sourceRoot":"","sources":["../../src/_internal/expression-boolean-memoizer.ts"],"names":[],"mappings":"AAOA,OAAO,EAAE,SAAS,EAAE,MAAM,WAAW,CAAC;AAEtC;;;;;;;;GAQG;AACH,MAAM,CAAC,MAAM,iCAAiC,GAAG,CAC7C,QAAgE,EACR,EAAE;IAC1D,MAAM,KAAK,GAAG,IAAI,OAAO,EAA0C,CAAC;IAEpE,OAAO,CAAC,UAAU,EAAE,EAAE;QAClB,MAAM,YAAY,GAAG,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;QAE3C,IAAI,SAAS,CAAC,YAAY,CAAC,EAAE,CAAC;YAC1B,OAAO,YAAY,CAAC;QACxB,CAAC;QAED,MAAM,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,CAAC;QAEpC,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;QAE9B,OAAO,MAAM,CAAC;IAClB,CAAC,CAAC;AACN,CAAC,CAAC"}

package/dist/_internal/filter-callback.d.ts

@@ -0,0 +1,56 @@
+/**
+ * @packageDocumentation
+ * Utilities for detecting nodes that live inside `.filter(...)` callbacks.
+ */
+import type { TSESTree } from "@typescript-eslint/utils";
+/**
+ * Narrows call expressions to direct `.filter(...)` calls.
+ */
+export declare const isFilterCallExpression: (expression: Readonly<TSESTree.CallExpression>) => expression is TSESTree.CallExpression & {
+    callee: TSESTree.MemberExpression & {
+        computed: false;
+        optional: false;
+        property: TSESTree.Identifier;
+    };
+    optional: false;
+};
+/**
+ * Extract the first callback argument from a direct `.filter(...)` call.
+ *
+ * @param expression - Candidate call expression to inspect.
+ *
+ * @returns Callback expression when the call is a supported `.filter(...)`
+ *   invocation and the first argument is an arrow/function expression;
+ *   otherwise `null`.
+ */
+export declare const getFilterCallbackFunctionArgument: (expression: Readonly<TSESTree.CallExpression>) => null | Readonly<TSESTree.ArrowFunctionExpression | TSESTree.FunctionExpression>;
+/**
+ * Structured match for `.filter(...)` calls with a single identifier parameter
+ * arrow callback that uses an expression body.
+ */
+export type SingleParameterExpressionArrowFilterCallbackMatch = Readonly<{
+    callback: TSESTree.ArrowFunctionExpression & {
+        body: TSESTree.Expression;
+        params: [TSESTree.Identifier];
+    };
+    parameter: TSESTree.Identifier;
+}>;
+/**
+ * Extract a strict callback shape from direct `.filter(...)` calls.
+ *
+ * @param expression - Candidate call expression to inspect.
+ *
+ * @returns Structured callback match when supported; otherwise `null`.
+ */
+export declare const getSingleParameterExpressionArrowFilterCallback: (expression: Readonly<TSESTree.CallExpression>) => null | SingleParameterExpressionArrowFilterCallbackMatch;
+/**
+ * Checks whether a node appears inside a callback passed as the first argument
+ * to a direct `.filter(...)` call.
+ *
+ * @param node - Node to inspect.
+ *
+ * @returns `true` when the node is inside a `.filter(...)` callback; otherwise
+ *   `false`.
+ */
+export declare const isWithinFilterCallback: (node: Readonly<TSESTree.Node>) => boolean;
+//# sourceMappingURL=filter-callback.d.ts.map

package/dist/_internal/filter-callback.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"filter-callback.d.ts","sourceRoot":"","sources":["../../src/_internal/filter-callback.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,0BAA0B,CAAC;AAiBzD;;GAEG;AACH,eAAO,MAAM,sBAAsB,GAC/B,YAAY,QAAQ,CAAC,QAAQ,CAAC,cAAc,CAAC,KAC9C,UAAU,IAAI,QAAQ,CAAC,cAAc,GAAG;IACvC,MAAM,EAAE,QAAQ,CAAC,gBAAgB,GAAG;QAChC,QAAQ,EAAE,KAAK,CAAC;QAChB,QAAQ,EAAE,KAAK,CAAC;QAChB,QAAQ,EAAE,QAAQ,CAAC,UAAU,CAAC;KACjC,CAAC;IACF,QAAQ,EAAE,KAAK,CAAC;CAOsC,CAAC;AAE3D;;;;;;;;GAQG;AACH,eAAO,MAAM,iCAAiC,GAC1C,YAAY,QAAQ,CAAC,QAAQ,CAAC,cAAc,CAAC,KAC9C,IAAI,GAAG,QAAQ,CACd,QAAQ,CAAC,uBAAuB,GAAG,QAAQ,CAAC,kBAAkB,CAgBjE,CAAC;AAEF;;;GAGG;AACH,MAAM,MAAM,iDAAiD,GAAG,QAAQ,CAAC;IACrE,QAAQ,EAAE,QAAQ,CAAC,uBAAuB,GAAG;QACzC,IAAI,EAAE,QAAQ,CAAC,UAAU,CAAC;QAC1B,MAAM,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC;KACjC,CAAC;IACF,SAAS,EAAE,QAAQ,CAAC,UAAU,CAAC;CAClC,CAAC,CAAC;AAEH;;;;;;GAMG;AACH,eAAO,MAAM,+CAA+C,GACxD,YAAY,QAAQ,CAAC,QAAQ,CAAC,cAAc,CAAC,KAC9C,IAAI,GAAG,iDA0BT,CAAC;AAEF;;;;;;;;GAQG;AACH,eAAO,MAAM,sBAAsB,GAC/B,MAAM,QAAQ,CAAC,QAAQ,CAAC,IAAI,CAAC,KAC9B,OAgCF,CAAC"}