@sarj/eslint-plugin 15.26.2 → 15.26.3

package/dist/index.cjs

@@ -652,6 +652,25 @@ var no_broad_return_type_default = createRule({
 // src/rules/no-reduce-accumulator-copy.ts
 var import_utils5 = require("@typescript-eslint/utils");
 var import_typescript3 = __toESM(require("typescript"), 1);
+
+// src/rules/_for-each-ast-child.ts
+function forEachAstChild(node, visitorKeys, visit) {
+  for (const key of visitorKeys[node.type] ?? []) {
+    const value = node[key];
+    if (Array.isArray(value)) {
+      const children = value;
+      for (const child of children) if (isNode(child) && visit(child) === true) return true;
+    } else if (isNode(value)) {
+      if (visit(value) === true) return true;
+    }
+  }
+  return false;
+}
+function isNode(value) {
+  return typeof value === "object" && value !== null && "type" in value && typeof value.type === "string";
+}
+
+// src/rules/no-reduce-accumulator-copy.ts
 var NO_REDUCE_ACCUMULATOR_COPY_DOCUMENTATION = {
   summary: "Review copies of the accumulated collection inside a built-in reduce callback.",
   rationale: "Copying a growing accumulator at every step can make collection quadratic instead of linear in its output size.",
@@ -722,12 +741,7 @@ var no_reduce_accumulator_copy_default = createRule({
             context.report({ node: current, messageId: "copy" });
           }
           if (current.type === import_utils5.AST_NODE_TYPES.CallExpression) inspectCall(current);
-          for (const key of context.sourceCode.visitorKeys[current.type] ?? []) {
-            const child = current[key];
-            if (Array.isArray(child)) {
-              for (const item of child) if (item !== null && typeof item === "object" && "type" in item) inspect(item);
-            } else if (child !== null && typeof child === "object" && "type" in child) inspect(child);
-          }
+          forEachAstChild(current, context.sourceCode.visitorKeys, inspect);
         };
         inspect(callback.body);
       }
@@ -3546,17 +3560,17 @@ function subtreeContainsStarLiteral(node) {
     const value = node[key];
     if (Array.isArray(value)) {
       for (const child of value) {
-        if (isNode(child) && subtreeContainsStarLiteral(child)) {
+        if (isNode2(child) && subtreeContainsStarLiteral(child)) {
           return true;
         }
       }
-    } else if (isNode(value) && subtreeContainsStarLiteral(value)) {
+    } else if (isNode2(value) && subtreeContainsStarLiteral(value)) {
       return true;
     }
   }
   return false;
 }
-function isNode(value) {
+function isNode2(value) {
   return typeof value === "object" && value !== null && typeof value.type === "string";
 }
 function calleeName(node) {
@@ -4570,15 +4584,7 @@ function functionComplexity(fn, visitorKeys) {
     visitChildren(node, nesting);
   }
   function visitChildren(node, nesting) {
-    for (const key of visitorKeys[node.type] ?? []) {
-      const value = node[key];
-      const candidates = Array.isArray(value) ? value : [value];
-      for (const candidate2 of candidates) {
-        if (typeof candidate2 === "object" && candidate2 !== null && "type" in candidate2) {
-          visit(candidate2, nesting);
-        }
-      }
-    }
+    forEachAstChild(node, visitorKeys, (child) => visit(child, nesting));
   }
   visit(fn.body, 0);
   return points;
@@ -4747,7 +4753,7 @@ var PURE_CONSTRUCTORS = /* @__PURE__ */ new Set([
   "Response",
   "AbortController"
 ]);
-function isNode2(value) {
+function isNode3(value) {
   return typeof value === "object" && value !== null && typeof value.type === "string";
 }
 function isPureCall(node) {
@@ -4797,11 +4803,11 @@ function subtreeMatches(stmt, predicate, descendIntoFunctions = false) {
       const value = current[key];
       if (Array.isArray(value)) {
         for (const child of value) {
-          if (isNode2(child)) {
+          if (isNode3(child)) {
             visit(child);
           }
         }
-      } else if (isNode2(value)) {
+      } else if (isNode3(value)) {
         visit(value);
       }
       if (found) {
@@ -9960,7 +9966,7 @@ function isSentinelArgument(arg) {
 function isFunctionNode(node) {
   return node.type === import_utils61.AST_NODE_TYPES.FunctionDeclaration || node.type === import_utils61.AST_NODE_TYPES.FunctionExpression || node.type === import_utils61.AST_NODE_TYPES.ArrowFunctionExpression;
 }
-function isNode3(value) {
+function isNode4(value) {
   return typeof value === "object" && value !== null && typeof value.type === "string";
 }
 function walkWithinScope(node, visit) {
@@ -9983,11 +9989,11 @@ function walkWithinScope(node, visit) {
       const value = current[key];
       if (Array.isArray(value)) {
         for (const child of value) {
-          if (isNode3(child)) {
+          if (isNode4(child)) {
             recurse(child);
           }
         }
-      } else if (isNode3(value)) {
+      } else if (isNode4(value)) {
         recurse(value);
       }
     }
@@ -10045,11 +10051,11 @@ function subtreeReadsName(node, name) {
       const value = current[key];
       if (Array.isArray(value)) {
         for (const child of value) {
-          if (isNode3(child)) {
+          if (isNode4(child)) {
             recurse(child);
           }
         }
-      } else if (isNode3(value)) {
+      } else if (isNode4(value)) {
         recurse(value);
       }
     }
@@ -10110,7 +10116,7 @@ function enclosingFunctionName(node) {
   let current = node.parent;
   while (current !== void 0 && current !== null) {
     if (isFunctionNode(current)) {
-      if ("id" in current && isNode3(current.id) && current.id.type === import_utils61.AST_NODE_TYPES.Identifier) {
+      if ("id" in current && isNode4(current.id) && current.id.type === import_utils61.AST_NODE_TYPES.Identifier) {
         return current.id.name;
       }
       const parent = current.parent;
@@ -10176,7 +10182,7 @@ function tryReturnsSafeParse(catchNode) {
       const value = current[key];
       const children = Array.isArray(value) ? value : [value];
       for (const child of children) {
-        if (isNode3(child)) recurse(child);
+        if (isNode4(child)) recurse(child);
       }
     }
   }
@@ -10215,7 +10221,7 @@ function functionReturnsSameSentinelKindElsewhere(catchNode, kind) {
 function enclosingFunctionBody(node) {
   let current = node.parent;
   while (current !== void 0 && current !== null) {
-    if (isFunctionNode(current) && "body" in current && isNode3(current.body) && current.body.type === import_utils61.AST_NODE_TYPES.BlockStatement) {
+    if (isFunctionNode(current) && "body" in current && isNode4(current.body) && current.body.type === import_utils61.AST_NODE_TYPES.BlockStatement) {
       return current.body;
     }
     current = current.parent;
@@ -16315,13 +16321,7 @@ function isEmptyGuard(node, access) {
 }
 function contains(node, visitorKeys, predicate) {
   if (predicate(node)) return true;
-  for (const key of visitorKeys[node.type] ?? []) {
-    const child = node[key];
-    for (const value of Array.isArray(child) ? child : [child]) {
-      if (value !== null && typeof value === "object" && "type" in value && contains(value, visitorKeys, predicate)) return true;
-    }
-  }
-  return false;
+  return forEachAstChild(node, visitorKeys, (child) => contains(child, visitorKeys, predicate));
 }
 function belongsToFunction(node, fn) {
   let current = node;
@@ -22085,14 +22085,7 @@ function referencedPropertyName(node) {
 function walk(node, visitorKeys, visit, nestedFunction = false) {
   visit(node, nestedFunction);
   const nested = nestedFunction || isFunction(node);
-  for (const key of visitorKeys[node.type] ?? []) {
-    const child = node[key];
-    if (Array.isArray(child)) {
-      for (const item of child) if (typeof item === "object" && item !== null && "type" in item) walk(item, visitorKeys, visit, nested);
-    } else if (typeof child === "object" && child !== null && "type" in child) {
-      walk(child, visitorKeys, visit, nested);
-    }
-  }
+  forEachAstChild(node, visitorKeys, (child) => walk(child, visitorKeys, visit, nested));
 }
 function classScope(context, node, computedReferenceNames) {
   const methods = node.body.body.filter(
@@ -23285,7 +23278,7 @@ var RULES = {
 };
 var meta = {
   name: "@sarj/eslint-plugin",
-  version: "15.26.2"
+  version: "15.26.3"
 };
 var APPLICATION_ONLY_RULES = [];
 var LIBRARY_IMPORT_POLICY = ["error", {

package/dist/index.d.cts

@@ -996,7 +996,7 @@ type FlatPreset = {
 declare const PLUGIN: {
     readonly meta: {
         readonly name: "@sarj/eslint-plugin";
-        readonly version: "15.26.2";
+        readonly version: "15.26.3";
     };
     readonly rules: {
         readonly "no-conditional-empty-object-spread": DocumentedRule<[], "avoid">;

package/dist/index.d.ts

@@ -996,7 +996,7 @@ type FlatPreset = {
 declare const PLUGIN: {
     readonly meta: {
         readonly name: "@sarj/eslint-plugin";
-        readonly version: "15.26.2";
+        readonly version: "15.26.3";
     };
     readonly rules: {
         readonly "no-conditional-empty-object-spread": DocumentedRule<[], "avoid">;

package/dist/index.js

@@ -608,6 +608,25 @@ var no_broad_return_type_default = createRule({
 // src/rules/no-reduce-accumulator-copy.ts
 import { AST_NODE_TYPES as AST_NODE_TYPES4, ASTUtils as ASTUtils2, ESLintUtils as ESLintUtils4 } from "@typescript-eslint/utils";
 import ts3 from "typescript";
+
+// src/rules/_for-each-ast-child.ts
+function forEachAstChild(node, visitorKeys, visit) {
+  for (const key of visitorKeys[node.type] ?? []) {
+    const value = node[key];
+    if (Array.isArray(value)) {
+      const children = value;
+      for (const child of children) if (isNode(child) && visit(child) === true) return true;
+    } else if (isNode(value)) {
+      if (visit(value) === true) return true;
+    }
+  }
+  return false;
+}
+function isNode(value) {
+  return typeof value === "object" && value !== null && "type" in value && typeof value.type === "string";
+}
+
+// src/rules/no-reduce-accumulator-copy.ts
 var NO_REDUCE_ACCUMULATOR_COPY_DOCUMENTATION = {
   summary: "Review copies of the accumulated collection inside a built-in reduce callback.",
   rationale: "Copying a growing accumulator at every step can make collection quadratic instead of linear in its output size.",
@@ -678,12 +697,7 @@ var no_reduce_accumulator_copy_default = createRule({
             context.report({ node: current, messageId: "copy" });
           }
           if (current.type === AST_NODE_TYPES4.CallExpression) inspectCall(current);
-          for (const key of context.sourceCode.visitorKeys[current.type] ?? []) {
-            const child = current[key];
-            if (Array.isArray(child)) {
-              for (const item of child) if (item !== null && typeof item === "object" && "type" in item) inspect(item);
-            } else if (child !== null && typeof child === "object" && "type" in child) inspect(child);
-          }
+          forEachAstChild(current, context.sourceCode.visitorKeys, inspect);
         };
         inspect(callback.body);
       }
@@ -3510,17 +3524,17 @@ function subtreeContainsStarLiteral(node) {
     const value = node[key];
     if (Array.isArray(value)) {
       for (const child of value) {
-        if (isNode(child) && subtreeContainsStarLiteral(child)) {
+        if (isNode2(child) && subtreeContainsStarLiteral(child)) {
           return true;
         }
       }
-    } else if (isNode(value) && subtreeContainsStarLiteral(value)) {
+    } else if (isNode2(value) && subtreeContainsStarLiteral(value)) {
       return true;
     }
   }
   return false;
 }
-function isNode(value) {
+function isNode2(value) {
   return typeof value === "object" && value !== null && typeof value.type === "string";
 }
 function calleeName(node) {
@@ -4534,15 +4548,7 @@ function functionComplexity(fn, visitorKeys) {
     visitChildren(node, nesting);
   }
   function visitChildren(node, nesting) {
-    for (const key of visitorKeys[node.type] ?? []) {
-      const value = node[key];
-      const candidates = Array.isArray(value) ? value : [value];
-      for (const candidate2 of candidates) {
-        if (typeof candidate2 === "object" && candidate2 !== null && "type" in candidate2) {
-          visit(candidate2, nesting);
-        }
-      }
-    }
+    forEachAstChild(node, visitorKeys, (child) => visit(child, nesting));
   }
   visit(fn.body, 0);
   return points;
@@ -4711,7 +4717,7 @@ var PURE_CONSTRUCTORS = /* @__PURE__ */ new Set([
   "Response",
   "AbortController"
 ]);
-function isNode2(value) {
+function isNode3(value) {
   return typeof value === "object" && value !== null && typeof value.type === "string";
 }
 function isPureCall(node) {
@@ -4761,11 +4767,11 @@ function subtreeMatches(stmt, predicate, descendIntoFunctions = false) {
       const value = current[key];
       if (Array.isArray(value)) {
         for (const child of value) {
-          if (isNode2(child)) {
+          if (isNode3(child)) {
             visit(child);
           }
         }
-      } else if (isNode2(value)) {
+      } else if (isNode3(value)) {
         visit(value);
       }
       if (found) {
@@ -9942,7 +9948,7 @@ function isSentinelArgument(arg) {
 function isFunctionNode(node) {
   return node.type === AST_NODE_TYPES48.FunctionDeclaration || node.type === AST_NODE_TYPES48.FunctionExpression || node.type === AST_NODE_TYPES48.ArrowFunctionExpression;
 }
-function isNode3(value) {
+function isNode4(value) {
   return typeof value === "object" && value !== null && typeof value.type === "string";
 }
 function walkWithinScope(node, visit) {
@@ -9965,11 +9971,11 @@ function walkWithinScope(node, visit) {
       const value = current[key];
       if (Array.isArray(value)) {
         for (const child of value) {
-          if (isNode3(child)) {
+          if (isNode4(child)) {
             recurse(child);
           }
         }
-      } else if (isNode3(value)) {
+      } else if (isNode4(value)) {
         recurse(value);
       }
     }
@@ -10027,11 +10033,11 @@ function subtreeReadsName(node, name) {
       const value = current[key];
       if (Array.isArray(value)) {
         for (const child of value) {
-          if (isNode3(child)) {
+          if (isNode4(child)) {
             recurse(child);
           }
         }
-      } else if (isNode3(value)) {
+      } else if (isNode4(value)) {
         recurse(value);
       }
     }
@@ -10092,7 +10098,7 @@ function enclosingFunctionName(node) {
   let current = node.parent;
   while (current !== void 0 && current !== null) {
     if (isFunctionNode(current)) {
-      if ("id" in current && isNode3(current.id) && current.id.type === AST_NODE_TYPES48.Identifier) {
+      if ("id" in current && isNode4(current.id) && current.id.type === AST_NODE_TYPES48.Identifier) {
         return current.id.name;
       }
       const parent = current.parent;
@@ -10158,7 +10164,7 @@ function tryReturnsSafeParse(catchNode) {
       const value = current[key];
       const children = Array.isArray(value) ? value : [value];
       for (const child of children) {
-        if (isNode3(child)) recurse(child);
+        if (isNode4(child)) recurse(child);
       }
     }
   }
@@ -10197,7 +10203,7 @@ function functionReturnsSameSentinelKindElsewhere(catchNode, kind) {
 function enclosingFunctionBody(node) {
   let current = node.parent;
   while (current !== void 0 && current !== null) {
-    if (isFunctionNode(current) && "body" in current && isNode3(current.body) && current.body.type === AST_NODE_TYPES48.BlockStatement) {
+    if (isFunctionNode(current) && "body" in current && isNode4(current.body) && current.body.type === AST_NODE_TYPES48.BlockStatement) {
       return current.body;
     }
     current = current.parent;
@@ -16316,13 +16322,7 @@ function isEmptyGuard(node, access) {
 }
 function contains(node, visitorKeys, predicate) {
   if (predicate(node)) return true;
-  for (const key of visitorKeys[node.type] ?? []) {
-    const child = node[key];
-    for (const value of Array.isArray(child) ? child : [child]) {
-      if (value !== null && typeof value === "object" && "type" in value && contains(value, visitorKeys, predicate)) return true;
-    }
-  }
-  return false;
+  return forEachAstChild(node, visitorKeys, (child) => contains(child, visitorKeys, predicate));
 }
 function belongsToFunction(node, fn) {
   let current = node;
@@ -22103,14 +22103,7 @@ function referencedPropertyName(node) {
 function walk(node, visitorKeys, visit, nestedFunction = false) {
   visit(node, nestedFunction);
   const nested = nestedFunction || isFunction(node);
-  for (const key of visitorKeys[node.type] ?? []) {
-    const child = node[key];
-    if (Array.isArray(child)) {
-      for (const item of child) if (typeof item === "object" && item !== null && "type" in item) walk(item, visitorKeys, visit, nested);
-    } else if (typeof child === "object" && child !== null && "type" in child) {
-      walk(child, visitorKeys, visit, nested);
-    }
-  }
+  forEachAstChild(node, visitorKeys, (child) => walk(child, visitorKeys, visit, nested));
 }
 function classScope(context, node, computedReferenceNames) {
   const methods = node.body.body.filter(
@@ -23306,7 +23299,7 @@ var RULES = {
 };
 var meta = {
   name: "@sarj/eslint-plugin",
-  version: "15.26.2"
+  version: "15.26.3"
 };
 var APPLICATION_ONLY_RULES = [];
 var LIBRARY_IMPORT_POLICY = ["error", {

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@sarj/eslint-plugin",
-  "version": "15.26.2",
+  "version": "15.26.3",
   "packageManager": "npm@12.0.2",
   "description": "Custom ESLint rules for hypermodern TypeScript / React / Next.js projects",
   "type": "module",