@blumintinc/eslint-plugin-blumint 1.20.132 → 1.20.134

package/lib/index.js

@@ -223,7 +223,7 @@ function noFrontendImportsFromFunctionsPatterns(pattern) {
 module.exports = {
     meta: {
         name: '@blumintinc/eslint-plugin-blumint',
-        version: '1.20.132',
+        version: '1.20.134',
     },
     parseOptions: {
         ecmaVersion: 2020,

package/lib/rules/enforce-unique-cursor-headers.js

@@ -41,6 +41,23 @@ const DEFAULT_OPTIONS = {
         '@vitest-environment',
     ],
 };
+/**
+ * What the consumer's options are deep-merged over, with every null-valued
+ * default removed.
+ *
+ * `applyDefault` merges before `create` runs, and its `deepMerge` classifies
+ * `null` as an object (`typeof null === 'object'`), so a key that is null on
+ * both sides is recursed into and reaches `Object.keys(null)`. That throws
+ * while LOADING the rule, which aborts the lint for the whole file and takes
+ * every other rule with it. `headerTemplate` is exactly that shape: `null` is
+ * both its schema-legal value and its documented default, so a consumer who
+ * writes the documented default out explicitly crashes their own run.
+ *
+ * Omitting the key leaves the merge nothing to recurse into. Nothing is lost —
+ * `normalizeOptions` reads the default straight from `DEFAULT_OPTIONS`, so an
+ * absent key and a null one already resolve identically.
+ */
+const MERGEABLE_DEFAULT_OPTIONS = Object.fromEntries(Object.entries(DEFAULT_OPTIONS).filter(([, value]) => value !== null));
 /**
  * Maximum number of characters to scan at the beginning of a file to detect generated markers.
  */
@@ -381,7 +398,7 @@ exports.enforceUniqueCursorHeaders = (0, createRule_1.createRule)({
             splitHeaderFragment: 'Cursor header metadata is split across adjacent comment blocks → Fragmented headers are easy to miss and let required tags drift out of sync → Merge the fragments into a single top-of-file header containing: {{tags}}.',
         },
     },
-    defaultOptions: [DEFAULT_OPTIONS],
+    defaultOptions: [MERGEABLE_DEFAULT_OPTIONS],
     create(context, [userOptions]) {
         const options = normalizeOptions(userOptions);
         const fileName = context.getFilename();

package/lib/rules/parallelize-async-operations.js

@@ -394,6 +394,97 @@ exports.parallelizeAsyncOperations = (0, createRule_1.createRule)({
             }
             return false;
         }
+        /**
+         * The array folds whose callback receives the PREVIOUS iteration's result as
+         * its first parameter. `reduceRight` carries the same contract as `reduce`;
+         * only the traversal order differs, so both fold a chain the same way.
+         *
+         * `map`/`forEach`/`filter` are deliberately absent: their callbacks receive
+         * an ELEMENT first, and awaiting an element is an ordinary data read rather
+         * than a serialization point.
+         */
+        const SEQUENTIAL_FOLD_METHODS = new Set(['reduce', 'reduceRight']);
+        /**
+         * Reports whether a function node is the callback a fold folds WITH -- the
+         * first argument of a `.reduce(...)` / `.reduceRight(...)` call.
+         *
+         * Only a direct argument qualifies. A callback bound to a name first
+         * (`const step = async (promise, doc) => {...}; items.reduce(step, seed)`)
+         * is left alone rather than chased through the binding, which keeps the
+         * barrier to the shape it can prove.
+         */
+        function isFoldCallback(fn) {
+            const call = fn.parent;
+            if (!call ||
+                call.type !== utils_1.AST_NODE_TYPES.CallExpression ||
+                call.arguments[0] !== fn) {
+                return false;
+            }
+            const callee = call.callee;
+            if (callee.type !== utils_1.AST_NODE_TYPES.MemberExpression) {
+                return false;
+            }
+            const property = callee.property;
+            const methodName = callee.computed
+                ? property.type === utils_1.AST_NODE_TYPES.Literal &&
+                    typeof property.value === 'string'
+                    ? property.value
+                    : null
+                : property.type === utils_1.AST_NODE_TYPES.Identifier
+                    ? property.name
+                    : null;
+            return !!methodName && SEQUENTIAL_FOLD_METHODS.has(methodName);
+        }
+        /**
+         * Reports whether a parameter binding is the FIRST parameter of a function
+         * -- the accumulator slot of a fold callback.
+         *
+         * Keyed on position rather than on the binding's name, because the
+         * accumulator is spelled `promise`, `acc`, `previous`, `prev`, `chain` or
+         * anything else the author preferred, and matching a name list would both
+         * miss the unlisted spellings and fire on an element parameter that happens
+         * to be called `promise`. A default (`async (acc = Promise.resolve(), doc)`)
+         * still binds the accumulator first, so the pattern is unwrapped.
+         */
+        function isAccumulatorParameter(fn, binding) {
+            if (!FUNCTION_BOUNDARY_TYPES.has(fn.type)) {
+                return false;
+            }
+            const [first] = fn.params;
+            if (!first) {
+                return false;
+            }
+            const target = first.type === utils_1.AST_NODE_TYPES.AssignmentPattern ? first.left : first;
+            return target === binding;
+        }
+        /**
+         * Reports whether an awaited expression is a bare read of the ACCUMULATOR
+         * parameter of an enclosing fold callback.
+         *
+         * The parameter is resolved through the scope chain rather than matched by
+         * name, so a local that merely shadows the accumulator's spelling
+         * (`const promise = fetchThing(); await promise;` inside the callback) is
+         * correctly NOT the accumulator, and an accumulator under any spelling is.
+         * TS-only wrappers are unwrapped because `await acc!` and
+         * `await acc as Promise<void>` read the same binding.
+         */
+        function isFoldAccumulatorAwait(awaitExpr) {
+            let argument = awaitExpr.argument;
+            while (argument.type === utils_1.AST_NODE_TYPES.TSNonNullExpression ||
+                argument.type === utils_1.AST_NODE_TYPES.TSAsExpression) {
+                argument = argument.expression;
+            }
+            if (argument.type !== utils_1.AST_NODE_TYPES.Identifier) {
+                return false;
+            }
+            const variable = ASTHelpers_1.ASTHelpers.findVariableInScope(ASTHelpers_1.ASTHelpers.getScope(context, argument), argument.name);
+            if (!variable) {
+                return false;
+            }
+            return variable.defs.some((definition) => definition.type === utils_1.TSESLint.Scope.DefinitionType.Parameter &&
+                isAccumulatorParameter(definition.node, definition.name) &&
+                isFoldCallback(definition.node));
+        }
         /**
          * Follows an identifier back to the array literal a `const` binds to it.
          *
@@ -838,6 +929,27 @@ exports.parallelizeAsyncOperations = (0, createRule_1.createRule)({
                     }
                 }
             }
+            // 11. Fold-accumulator serialization barrier. `items.reduce(async
+            // (promise, item) => { await promise; await store(item); },
+            // Promise.resolve())` is the canonical idiom for FORCING sequential
+            // execution over a collection: the callback's first parameter IS the
+            // previous iteration's completion, so `await promise` is a serialization
+            // point rather than an operation of its own. The dependency it expresses
+            // is a sequencing one -- the accumulator and `store(item)` share no value
+            // at all -- so the identifier comparison above classifies the pair
+            // independent and the rewrite hoists the awaits into a Promise.all,
+            // starting every iteration's work at once and discarding the exact
+            // guarantee the idiom was written to provide. The run is deliberate, not
+            // a latency mistake, so the rule declines to report it rather than merely
+            // declining the fix. Only an accumulator await with something AFTER it
+            // qualifies, mirroring the guard barrier above: it is what follows the
+            // barrier that the rewrite would illegally start early. (#1851)
+            for (let i = 0; i < awaitNodes.length - 1; i++) {
+                const awaitExpr = getAwaitExpression(awaitNodes[i]);
+                if (awaitExpr && isFoldAccumulatorAwait(awaitExpr)) {
+                    return true;
+                }
+            }
             return false;
         }
         /**

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@blumintinc/eslint-plugin-blumint",
-  "version": "1.20.132",
+  "version": "1.20.134",
   "description": "Custom eslint rules for use within BluMint",
   "author": {
     "name": "Brodie McGuire",

package/release-manifest.json

@@ -1,4 +1,32 @@
 [
+  {
+    "version": "1.20.134",
+    "date": "2026-08-07T15:09:56.261Z",
+    "rules": [
+      {
+        "name": "enforce-unique-cursor-headers",
+        "changeType": "fix",
+        "issues": [
+          1853
+        ],
+        "summary": "keep null defaults out of the options deep-merge (closes #1853)"
+      }
+    ]
+  },
+  {
+    "version": "1.20.133",
+    "date": "2026-08-07T14:16:50.604Z",
+    "rules": [
+      {
+        "name": "parallelize-async-operations",
+        "changeType": "fix",
+        "issues": [
+          1851
+        ],
+        "summary": "treat a fold accumulator await as a sequencing barrier (closes #1851)"
+      }
+    ]
+  },
   {
     "version": "1.20.132",
     "date": "2026-08-07T12:26:09.881Z",