@repobit/dex-store-elements 1.7.2 → 2.0.0

package/dist/src/core/option-update.js

@@ -0,0 +1,59 @@
+// src/core/option-update.ts
+/**
+ * Pure devices/subscription update semantics shared by the runtime OptionNode
+ * and the dry-run compute layer.
+ *
+ * Given a current numeric value and an UpdateByDelta command, this returns the
+ * next value. `next` / `prev` walk the product's declared dimension values, so
+ * sequential stepping respects what the product actually offers.
+ */
+export function applyOptionUpdate(field, currentValue, update, product) {
+    if (!update || update.type !== field) {
+        return currentValue;
+    }
+    if (update.useAsValue) {
+        if (typeof update.delta !== 'number') {
+            return currentValue;
+        }
+        return clampNumericUpdate(update.delta, update);
+    }
+    if (currentValue === undefined) {
+        return undefined;
+    }
+    if (update.delta === 'next' ||
+        update.delta === 'prev') {
+        return applySequentialUpdate(field, currentValue, update, product);
+    }
+    return clampNumericUpdate(currentValue + update.delta, update);
+}
+function applySequentialUpdate(field, currentValue, update, product) {
+    const values = field === 'devices'
+        ? product?.getDevices().values
+        : product?.getSubscriptions().values;
+    if (!values || values.length === 0) {
+        return currentValue;
+    }
+    const currentIndex = values.findIndex((value) => value === currentValue);
+    if (currentIndex < 0) {
+        return currentValue;
+    }
+    const nextIndex = update.delta === 'next'
+        ? currentIndex + 1
+        : currentIndex - 1;
+    const nextValue = values[nextIndex];
+    if (nextValue === undefined) {
+        return currentValue;
+    }
+    return clampNumericUpdate(nextValue, update);
+}
+function clampNumericUpdate(value, update) {
+    let nextValue = value;
+    if (update.min !== undefined) {
+        nextValue = Math.max(update.min, nextValue);
+    }
+    if (update.max !== undefined) {
+        nextValue = Math.min(update.max, nextValue);
+    }
+    return nextValue;
+}
+//# sourceMappingURL=option-update.js.map

package/dist/src/core/option-update.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"option-update.js","sourceRoot":"","sources":["../../../src/core/option-update.ts"],"names":[],"mappings":"AAAA,4BAA4B;AAK5B;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAA4B,EAC5B,YAAgC,EAChC,MAAiC,EACjC,OAA4B;IAE5B,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,IAAI,KAAK,KAAK,EAAE,CAAC;QACrC,OAAO,YAAY,CAAC;IACtB,CAAC;IAED,IAAI,MAAM,CAAC,UAAU,EAAE,CAAC;QACtB,IAAI,OAAO,MAAM,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;YACrC,OAAO,YAAY,CAAC;QACtB,CAAC;QAED,OAAO,kBAAkB,CACvB,MAAM,CAAC,KAAK,EACZ,MAAM,CACP,CAAC;IACJ,CAAC;IAED,IAAI,YAAY,KAAK,SAAS,EAAE,CAAC;QAC/B,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,IACE,MAAM,CAAC,KAAK,KAAK,MAAM;QACvB,MAAM,CAAC,KAAK,KAAK,MAAM,EACvB,CAAC;QACD,OAAO,qBAAqB,CAC1B,KAAK,EACL,YAAY,EACZ,MAAM,EACN,OAAO,CACR,CAAC;IACJ,CAAC;IAED,OAAO,kBAAkB,CACvB,YAAY,GAAG,MAAM,CAAC,KAAK,EAC3B,MAAM,CACP,CAAC;AACJ,CAAC;AAED,SAAS,qBAAqB,CAC5B,KAA4B,EAC5B,YAAoB,EACpB,MAAqB,EACrB,OAA4B;IAE5B,MAAM,MAAM,GACV,KAAK,KAAK,SAAS;QACjB,CAAC,CAAC,OAAO,EAAE,UAAU,EAAE,CAAC,MAAM;QAC9B,CAAC,CAAC,OAAO,EAAE,gBAAgB,EAAE,CAAC,MAAM,CAAC;IAEzC,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACnC,OAAO,YAAY,CAAC;IACtB,CAAC;IAED,MAAM,YAAY,GAChB,MAAM,CAAC,SAAS,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,KAAK,YAAY,CAAC,CAAC;IAEtD,IAAI,YAAY,GAAG,CAAC,EAAE,CAAC;QACrB,OAAO,YAAY,CAAC;IACtB,CAAC;IAED,MAAM,SAAS,GACb,MAAM,CAAC,KAAK,KAAK,MAAM;QACrB,CAAC,CAAC,YAAY,GAAG,CAAC;QAClB,CAAC,CAAC,YAAY,GAAG,CAAC,CAAC;IAEvB,MAAM,SAAS,GACb,MAAM,CAAC,SAAS,CAAC,CAAC;IAEpB,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;QAC5B,OAAO,YAAY,CAAC;IACtB,CAAC;IAED,OAAO,kBAAkB,CACvB,SAAS,EACT,MAAM,CACP,CAAC;AACJ,CAAC;AAED,SAAS,kBAAkB,CACzB,KAAa,EACb,MAAqB;IAErB,IAAI,SAAS,GAAG,KAAK,CAAC;IAEtB,IAAI,MAAM,CAAC,GAAG,KAAK,SAAS,EAAE,CAAC;QAC7B,SAAS,GAAG,IAAI,CAAC,GAAG,CAClB,MAAM,CAAC,GAAG,EACV,SAAS,CACV,CAAC;IACJ,CAAC;IAED,IAAI,MAAM,CAAC,GAAG,KAAK,SAAS,EAAE,CAAC;QAC7B,SAAS,GAAG,IAAI,CAAC,GAAG,CAClB,MAAM,CAAC,GAAG,EACV,SAAS,CACV,CAAC;IACJ,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC","sourcesContent":["// src/core/option-update.ts\n\nimport type { UpdateByDelta } from '@/core/actions.js';\nimport type { Product } from '@repobit/dex-store';\n\n/**\n * Pure devices/subscription update semantics shared by the runtime OptionNode\n * and the dry-run compute layer.\n *\n * Given a current numeric value and an UpdateByDelta command, this returns the\n * next value. `next` / `prev` walk the product's declared dimension values, so\n * sequential stepping respects what the product actually offers.\n */\nexport function applyOptionUpdate(\n  field: UpdateByDelta['type'],\n  currentValue: number | undefined,\n  update: UpdateByDelta | undefined,\n  product: Product | undefined\n): number | undefined {\n  if (!update || update.type !== field) {\n    return currentValue;\n  }\n\n  if (update.useAsValue) {\n    if (typeof update.delta !== 'number') {\n      return currentValue;\n    }\n\n    return clampNumericUpdate(\n      update.delta,\n      update\n    );\n  }\n\n  if (currentValue === undefined) {\n    return undefined;\n  }\n\n  if (\n    update.delta === 'next' ||\n    update.delta === 'prev'\n  ) {\n    return applySequentialUpdate(\n      field,\n      currentValue,\n      update,\n      product\n    );\n  }\n\n  return clampNumericUpdate(\n    currentValue + update.delta,\n    update\n  );\n}\n\nfunction applySequentialUpdate(\n  field: UpdateByDelta['type'],\n  currentValue: number,\n  update: UpdateByDelta,\n  product: Product | undefined\n): number {\n  const values =\n    field === 'devices'\n      ? product?.getDevices().values\n      : product?.getSubscriptions().values;\n\n  if (!values || values.length === 0) {\n    return currentValue;\n  }\n\n  const currentIndex =\n    values.findIndex((value) => value === currentValue);\n\n  if (currentIndex < 0) {\n    return currentValue;\n  }\n\n  const nextIndex =\n    update.delta === 'next'\n      ? currentIndex + 1\n      : currentIndex - 1;\n\n  const nextValue =\n    values[nextIndex];\n\n  if (nextValue === undefined) {\n    return currentValue;\n  }\n\n  return clampNumericUpdate(\n    nextValue,\n    update\n  );\n}\n\nfunction clampNumericUpdate(\n  value: number,\n  update: UpdateByDelta\n): number {\n  let nextValue = value;\n\n  if (update.min !== undefined) {\n    nextValue = Math.max(\n      update.min,\n      nextValue\n    );\n  }\n\n  if (update.max !== undefined) {\n    nextValue = Math.min(\n      update.max,\n      nextValue\n    );\n  }\n\n  return nextValue;\n}\n"]}

package/dist/src/dsl/compilers/array/compiler.js

@@ -1,22 +1,21 @@
-import { split } from "../../../dsl/utilty.js";
-// "2,3,4,5"           -> [2,3,4,5]
-// "1..4,8,10..7"      -> [1,2,3,4,8,10,9,8,7]
-// ""                  -> undefined
+import { split } from '../../../dsl/utilty.js';
 export const compiler = (raw) => {
-    const s = raw.trim();
-    if (s === "")
+    const source = raw.trim();
+    if (source === '') {
         return undefined;
+    }
     const out = [];
     const intRe = /^-?\d+$/;
     const rangeRe = /^(-?\d+)\s*\.\.\s*(-?\d+)$/;
-    for (const part of split(s, ",")) {
-        const m = part.match(rangeRe);
-        if (m) {
-            const a = parseInt(m[1], 10);
-            const b = parseInt(m[2], 10);
-            const step = a <= b ? 1 : -1;
-            for (let v = a; v !== b + step; v += step)
-                out.push(v);
+    for (const part of split(source, ',')) {
+        const match = part.match(rangeRe);
+        if (match) {
+            const start = parseInt(match[1], 10);
+            const end = parseInt(match[2], 10);
+            const step = start <= end ? 1 : -1;
+            for (let value = start; value !== end + step; value += step) {
+                out.push(value);
+            }
             continue;
         }
         if (intRe.test(part)) {

package/dist/src/dsl/compilers/array/compiler.js.map

@@ -1 +1 @@
-{"version":3,"file":"compiler.js","sourceRoot":"","sources":["../../../../../src/dsl/compilers/array/compiler.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,cAAc,CAAC;AACrC,mCAAmC;AACnC,8CAA8C;AAC9C,mCAAmC;AACnC,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,GAAW,EAAwB,EAAE;IAC5D,MAAM,CAAC,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IACrB,IAAI,CAAC,KAAK,EAAE;QAAE,OAAO,SAAS,CAAC;IAE/B,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,KAAK,GAAK,SAAS,CAAC;IAC1B,MAAM,OAAO,GAAG,4BAA4B,CAAC;IAE7C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;QACjC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC9B,IAAI,CAAC,EAAE,CAAC;YACN,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC7B,MAAM,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC7B,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,IAAI;gBAAE,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACvD,SAAS;QACX,CAAC;QACD,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACrB,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;YAC7B,SAAS;QACX,CAAC;QACD,MAAM,IAAI,KAAK,CAAC,0BAA0B,IAAI,GAAG,CAAC,CAAC;IACrD,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC,CAAA","sourcesContent":["import { split } from \"@/dsl/utilty\";\n// \"2,3,4,5\"           -> [2,3,4,5]\n// \"1..4,8,10..7\"      -> [1,2,3,4,8,10,9,8,7]\n// \"\"                  -> undefined\nexport const compiler = (raw: string): number[] | undefined => {\n  const s = raw.trim();\n  if (s === \"\") return undefined;\n\n  const out: number[] = [];\n  const intRe   = /^-?\\d+$/;\n  const rangeRe = /^(-?\\d+)\\s*\\.\\.\\s*(-?\\d+)$/;\n\n  for (const part of split(s, \",\")) {\n    const m = part.match(rangeRe);\n    if (m) {\n      const a = parseInt(m[1], 10);\n      const b = parseInt(m[2], 10);\n      const step = a <= b ? 1 : -1;\n      for (let v = a; v !== b + step; v += step) out.push(v);\n      continue;\n    }\n    if (intRe.test(part)) {\n      out.push(parseInt(part, 10));\n      continue;\n    }\n    throw new Error(`Invalid number token: \"${part}\"`);\n  }\n\n  return out;\n}\n"]}
+{"version":3,"file":"compiler.js","sourceRoot":"","sources":["../../../../../src/dsl/compilers/array/compiler.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,iBAAiB,CAAC;AAExC,MAAM,CAAC,MAAM,QAAQ,GAAG,CACtB,GAAW,EACW,EAAE;IACxB,MAAM,MAAM,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;IAE1B,IAAI,MAAM,KAAK,EAAE,EAAE,CAAC;QAClB,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,MAAM,GAAG,GAAa,EAAE,CAAC;IACzB,MAAM,KAAK,GAAG,SAAS,CAAC;IACxB,MAAM,OAAO,GAAG,4BAA4B,CAAC;IAE7C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC;QACtC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAElC,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACrC,MAAM,GAAG,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACnC,MAAM,IAAI,GAAG,KAAK,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAEnC,KAAK,IAAI,KAAK,GAAG,KAAK,EAAE,KAAK,KAAK,GAAG,GAAG,IAAI,EAAE,KAAK,IAAI,IAAI,EAAE,CAAC;gBAC5D,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClB,CAAC;YAED,SAAS;QACX,CAAC;QAED,IAAI,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACrB,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC;YAC7B,SAAS;QACX,CAAC;QAED,MAAM,IAAI,KAAK,CAAC,0BAA0B,IAAI,GAAG,CAAC,CAAC;IACrD,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC,CAAC","sourcesContent":["import { split } from '@/dsl/utilty.js';\n\nexport const compiler = (\n  raw: string\n): number[] | undefined => {\n  const source = raw.trim();\n\n  if (source === '') {\n    return undefined;\n  }\n\n  const out: number[] = [];\n  const intRe = /^-?\\d+$/;\n  const rangeRe = /^(-?\\d+)\\s*\\.\\.\\s*(-?\\d+)$/;\n\n  for (const part of split(source, ',')) {\n    const match = part.match(rangeRe);\n\n    if (match) {\n      const start = parseInt(match[1], 10);\n      const end = parseInt(match[2], 10);\n      const step = start <= end ? 1 : -1;\n\n      for (let value = start; value !== end + step; value += step) {\n        out.push(value);\n      }\n\n      continue;\n    }\n\n    if (intRe.test(part)) {\n      out.push(parseInt(part, 10));\n      continue;\n    }\n\n    throw new Error(`Invalid number token: \"${part}\"`);\n  }\n\n  return out;\n};\n"]}

package/dist/src/dsl/compilers/boolean/compiler.d.ts

@@ -1,4 +1,4 @@
-import { Ctx } from "../../../dsl/utilty.js";
+import type { Ctx } from '../../../dsl/utilty.js';
 type Params = {
     expr: string;
     ctx: Ctx;

package/dist/src/dsl/compilers/boolean/compiler.js

@@ -1,53 +1,40 @@
-import eta from "../../../templating/eta.js";
-// Very lightweight preflight checks so we can rely on Eta/JS
-// for actual expression evaluation while still catching a few
-// DSL-specific pitfalls we used to guard against.
+import eta from '../../../templating/eta.js';
 function preflight(expr) {
-    // 1) Disallow chained comparisons like: a < b < c
-    // Match two comparison operators with no logical op (&&, ||) between
     const chainedCmp = /(<=|>=|<|>)\s*[^&|]+(<=|>=|<|>)/;
     if (chainedCmp.test(expr)) {
-        throw new Error("Chained comparisons are not allowed");
+        throw new Error('Chained comparisons are not allowed');
     }
-    // 2) Basic parentheses balance check to surface a clearer error
     let depth = 0;
-    for (const ch of expr) {
-        if (ch === "(")
+    for (const char of expr) {
+        if (char === '(') {
             depth++;
-        else if (ch === ")") {
+        }
+        else if (char === ')') {
             depth--;
             if (depth < 0) {
-                // extra closing paren
                 throw new Error("Unexpected ')'");
             }
         }
     }
     if (depth > 0) {
-        throw new Error("Expected ')' ");
+        throw new Error("Expected ')'");
     }
 }
 export const compiler = ({ expr, ctx }) => {
     preflight(expr);
-    // Normalize equality to strict semantics to match legacy DSL behavior
-    // - '=='  -> '==='
-    // - '!='  -> '!=='
-    // Note: This is a simple text replacement and does not account for quoted strings,
-    // but our DSL usage does not place operators inside string literals.
     const normalized = expr
         .replace(/!=(?!=)/g, '!==')
         .replace(/(?<![=!])==(?![=])/g, '===');
-    // Build a tiny Eta template that coerces the expression to boolean.
-    const tpl = `{{= !!(${normalized}) }}`;
     try {
-        const fn = eta.compile(tpl);
+        const fn = eta.compile(`{{= !!(${normalized}) }}`);
         const out = eta.render(fn, ctx);
-        // Eta returns a string; normalize to boolean
-        return String(out).trim() === "true";
+        return String(out).trim() === 'true';
     }
-    catch (e) {
-        // Normalize error to a generic syntax error message used in tests
-        const msg = e instanceof Error ? e.message : String(e);
-        throw new Error(`Unexpected expression error: ${msg}`);
+    catch (error) {
+        const message = error instanceof Error
+            ? error.message
+            : String(error);
+        throw new Error(`Unexpected expression error: ${message}`);
     }
 };
 //# sourceMappingURL=compiler.js.map

package/dist/src/dsl/compilers/boolean/compiler.js.map

@@ -1 +1 @@
-{"version":3,"file":"compiler.js","sourceRoot":"","sources":["../../../../../src/dsl/compilers/boolean/compiler.ts"],"names":[],"mappings":"AACA,OAAO,GAAG,MAAM,kBAAkB,CAAC;AAOnC,6DAA6D;AAC7D,8DAA8D;AAC9D,kDAAkD;AAClD,SAAS,SAAS,CAAC,IAAY;IAC7B,kDAAkD;IAClD,qEAAqE;IACrE,MAAM,UAAU,GAAG,iCAAiC,CAAC;IACrD,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;IACzD,CAAC;IAED,gEAAgE;IAChE,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;QACtB,IAAI,EAAE,KAAK,GAAG;YAAE,KAAK,EAAE,CAAC;aACnB,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACpB,KAAK,EAAE,CAAC;YACR,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACd,sBAAsB;gBACtB,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;IACH,CAAC;IACD,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACd,MAAM,IAAI,KAAK,CAAC,eAAe,CAAC,CAAC;IACnC,CAAC;AACH,CAAC;AAED,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,EAAE,IAAI,EAAE,GAAG,EAAU,EAAE,EAAE;IAChD,SAAS,CAAC,IAAI,CAAC,CAAC;IAEhB,sEAAsE;IACtE,mBAAmB;IACnB,mBAAmB;IACnB,mFAAmF;IACnF,qEAAqE;IACrE,MAAM,UAAU,GAAG,IAAI;SACpB,OAAO,CAAC,UAAU,EAAE,KAAK,CAAC;SAC1B,OAAO,CAAC,qBAAqB,EAAE,KAAK,CAAC,CAAC;IAEzC,oEAAoE;IACpE,MAAM,GAAG,GAAG,UAAU,UAAU,MAAM,CAAC;IAEvC,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAC5B,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QAChC,6CAA6C;QAC7C,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,MAAM,CAAC;IACvC,CAAC;IAAC,OAAO,CAAC,EAAE,CAAC;QACX,kEAAkE;QAClE,MAAM,GAAG,GAAG,CAAC,YAAY,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;QACvD,MAAM,IAAI,KAAK,CAAC,gCAAgC,GAAG,EAAE,CAAC,CAAC;IACzD,CAAC;AACH,CAAC,CAAC","sourcesContent":["import { Ctx } from \"@/dsl/utilty\";\nimport eta from \"@/templating/eta\";\n\ntype Params = {\n  expr: string,\n  ctx : Ctx\n};\n\n// Very lightweight preflight checks so we can rely on Eta/JS\n// for actual expression evaluation while still catching a few\n// DSL-specific pitfalls we used to guard against.\nfunction preflight(expr: string) {\n  // 1) Disallow chained comparisons like: a < b < c\n  // Match two comparison operators with no logical op (&&, ||) between\n  const chainedCmp = /(<=|>=|<|>)\\s*[^&|]+(<=|>=|<|>)/;\n  if (chainedCmp.test(expr)) {\n    throw new Error(\"Chained comparisons are not allowed\");\n  }\n\n  // 2) Basic parentheses balance check to surface a clearer error\n  let depth = 0;\n  for (const ch of expr) {\n    if (ch === \"(\") depth++;\n    else if (ch === \")\") {\n      depth--;\n      if (depth < 0) {\n        // extra closing paren\n        throw new Error(\"Unexpected ')'\");\n      }\n    }\n  }\n  if (depth > 0) {\n    throw new Error(\"Expected ')' \");\n  }\n}\n\nexport const compiler = ({ expr, ctx }: Params) => {\n  preflight(expr);\n\n  // Normalize equality to strict semantics to match legacy DSL behavior\n  // - '=='  -> '==='\n  // - '!='  -> '!=='\n  // Note: This is a simple text replacement and does not account for quoted strings,\n  // but our DSL usage does not place operators inside string literals.\n  const normalized = expr\n    .replace(/!=(?!=)/g, '!==')\n    .replace(/(?<![=!])==(?![=])/g, '===');\n\n  // Build a tiny Eta template that coerces the expression to boolean.\n  const tpl = `{{= !!(${normalized}) }}`;\n\n  try {\n    const fn = eta.compile(tpl);\n    const out = eta.render(fn, ctx);\n    // Eta returns a string; normalize to boolean\n    return String(out).trim() === \"true\";\n  } catch (e) {\n    // Normalize error to a generic syntax error message used in tests\n    const msg = e instanceof Error ? e.message : String(e);\n    throw new Error(`Unexpected expression error: ${msg}`);\n  }\n};\n"]}
+{"version":3,"file":"compiler.js","sourceRoot":"","sources":["../../../../../src/dsl/compilers/boolean/compiler.ts"],"names":[],"mappings":"AACA,OAAO,GAAG,MAAM,qBAAqB,CAAC;AAOtC,SAAS,SAAS,CAChB,IAAY;IAEZ,MAAM,UAAU,GAAG,iCAAiC,CAAC;IAErD,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,qCAAqC,CAAC,CAAC;IACzD,CAAC;IAED,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACxB,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;YACjB,KAAK,EAAE,CAAC;QACV,CAAC;aAAM,IAAI,IAAI,KAAK,GAAG,EAAE,CAAC;YACxB,KAAK,EAAE,CAAC;YAER,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACd,MAAM,IAAI,KAAK,CAAC,gBAAgB,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;QACd,MAAM,IAAI,KAAK,CAAC,cAAc,CAAC,CAAC;IAClC,CAAC;AACH,CAAC;AAED,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,EACvB,IAAI,EACJ,GAAG,EACI,EAAW,EAAE;IACpB,SAAS,CAAC,IAAI,CAAC,CAAC;IAEhB,MAAM,UAAU,GAAG,IAAI;SACpB,OAAO,CAAC,UAAU,EAAE,KAAK,CAAC;SAC1B,OAAO,CAAC,qBAAqB,EAAE,KAAK,CAAC,CAAC;IAEzC,IAAI,CAAC;QACH,MAAM,EAAE,GAAG,GAAG,CAAC,OAAO,CAAC,UAAU,UAAU,MAAM,CAAC,CAAC;QACnD,MAAM,GAAG,GAAG,GAAG,CAAC,MAAM,CACpB,EAAE,EACF,GAAG,CACJ,CAAC;QAEF,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,MAAM,CAAC;IACvC,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,OAAO,GACX,KAAK,YAAY,KAAK;YACpB,CAAC,CAAC,KAAK,CAAC,OAAO;YACf,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAEpB,MAAM,IAAI,KAAK,CAAC,gCAAgC,OAAO,EAAE,CAAC,CAAC;IAC7D,CAAC;AACH,CAAC,CAAC","sourcesContent":["import type { Ctx } from '@/dsl/utilty.js';\nimport eta from '@/templating/eta.js';\n\ntype Params = {\n  expr: string;\n  ctx : Ctx;\n};\n\nfunction preflight(\n  expr: string\n): void {\n  const chainedCmp = /(<=|>=|<|>)\\s*[^&|]+(<=|>=|<|>)/;\n\n  if (chainedCmp.test(expr)) {\n    throw new Error('Chained comparisons are not allowed');\n  }\n\n  let depth = 0;\n\n  for (const char of expr) {\n    if (char === '(') {\n      depth++;\n    } else if (char === ')') {\n      depth--;\n\n      if (depth < 0) {\n        throw new Error(\"Unexpected ')'\");\n      }\n    }\n  }\n\n  if (depth > 0) {\n    throw new Error(\"Expected ')'\");\n  }\n}\n\nexport const compiler = ({\n  expr,\n  ctx\n}: Params): boolean => {\n  preflight(expr);\n\n  const normalized = expr\n    .replace(/!=(?!=)/g, '!==')\n    .replace(/(?<![=!])==(?![=])/g, '===');\n\n  try {\n    const fn = eta.compile(`{{= !!(${normalized}) }}`);\n    const out = eta.render(\n      fn,\n      ctx\n    );\n\n    return String(out).trim() === 'true';\n  } catch (error) {\n    const message =\n      error instanceof Error\n        ? error.message\n        : String(error);\n\n    throw new Error(`Unexpected expression error: ${message}`);\n  }\n};\n"]}

package/dist/src/dsl/compilers/enum/compiler.js

@@ -1,16 +1,13 @@
-import { split } from "../../../dsl/utilty.js";
+import { split } from '../../../dsl/utilty.js';
 export const compiler = ({ expr, allowed, isAvailable }) => {
-    const tokens = split(expr, "||");
-    // validate tokens early
-    for (const t of tokens) {
-        if (!allowed.includes(t)) {
-            console.warn(`[store] Unknown token "${t}". Allowed: ${allowed.join(", ")}`);
+    const tokens = split(expr, '||');
+    for (const rawToken of tokens) {
+        const token = rawToken;
+        if (allowed.includes(token) &&
+            isAvailable(token)) {
+            return token;
         }
     }
-    for (const t of tokens) {
-        if (allowed.includes(t) && isAvailable(t))
-            return t;
-    }
     return undefined;
 };
 //# sourceMappingURL=compiler.js.map

package/dist/src/dsl/compilers/enum/compiler.js.map

@@ -1 +1 @@
-{"version":3,"file":"compiler.js","sourceRoot":"","sources":["../../../../../src/dsl/compilers/enum/compiler.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,cAAc,CAAC;AAQrC,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAyB,EAAE,IAAI,EAAE,OAAO,EAAE,WAAW,EAAmB,EAAuB,EAAE;IACvH,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,EAAE,IAAI,CAAc,CAAC;IAC9C,wBAAwB;IACxB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YACzB,OAAO,CAAC,IAAI,CAAC,0BAA0B,CAAC,eAAe,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC/E,CAAC;IACH,CAAC;IAED,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,IAAI,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;IACtD,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC,CAAA","sourcesContent":["import { split } from \"@/dsl/utilty\";\n\ntype Params<Allowed extends string> = {\n  expr       : string,\n  allowed    : readonly Allowed[],\n  isAvailable: (variant: Allowed) => boolean,\n}\n\nexport const compiler = <Allowed extends string>({ expr, allowed, isAvailable }: Params<Allowed>): Allowed | undefined => {\n  const tokens = split(expr, \"||\") as Allowed[];\n  // validate tokens early\n  for (const t of tokens) {\n    if (!allowed.includes(t)) {\n      console.warn(`[store] Unknown token \"${t}\". Allowed: ${allowed.join(\", \")}`);\n    }\n  }\n\n  for (const t of tokens) {\n    if (allowed.includes(t) && isAvailable(t)) return t;\n  }\n  return undefined;\n}"]}
+{"version":3,"file":"compiler.js","sourceRoot":"","sources":["../../../../../src/dsl/compilers/enum/compiler.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,iBAAiB,CAAC;AAQxC,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAyB,EAC/C,IAAI,EACJ,OAAO,EACP,WAAW,EACK,EAAuB,EAAE;IACzC,MAAM,MAAM,GAAG,KAAK,CAClB,IAAI,EACJ,IAAI,CACL,CAAC;IAEF,KAAK,MAAM,QAAQ,IAAI,MAAM,EAAE,CAAC;QAC9B,MAAM,KAAK,GAAG,QAAmB,CAAC;QAElC,IACE,OAAO,CAAC,QAAQ,CAAC,KAAK,CAAC;YACvB,WAAW,CAAC,KAAK,CAAC,EAClB,CAAC;YACD,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC,CAAC","sourcesContent":["import { split } from '@/dsl/utilty.js';\n\ntype Params<Allowed extends string> = {\n  expr       : string;\n  allowed    : readonly Allowed[];\n  isAvailable: (variant: Allowed) => boolean;\n};\n\nexport const compiler = <Allowed extends string>({\n  expr,\n  allowed,\n  isAvailable\n}: Params<Allowed>): Allowed | undefined => {\n  const tokens = split(\n    expr,\n    '||'\n  );\n\n  for (const rawToken of tokens) {\n    const token = rawToken as Allowed;\n\n    if (\n      allowed.includes(token) &&\n      isAvailable(token)\n    ) {\n      return token;\n    }\n  }\n\n  return undefined;\n};\n"]}

package/dist/src/dsl/compilers/index.d.ts

@@ -1,4 +1,5 @@
 export declare const Compiler: {
+    readonly array: (raw: string) => number[] | undefined;
     readonly boolean: ({ expr, ctx }: {
         expr: string;
         ctx: import("../utilty.js").Ctx;
@@ -8,5 +9,4 @@ export declare const Compiler: {
         allowed: readonly Allowed[];
         isAvailable: (variant: Allowed) => boolean;
     }) => Allowed | undefined;
-    readonly array: (raw: string) => number[] | undefined;
 };

package/dist/src/dsl/compilers/index.js

@@ -1,9 +1,9 @@
-import { compiler as array } from "./array/compiler.js";
-import { compiler as boolean } from "./boolean/compiler.js";
-import { compiler as enumeration } from "./enum/compiler.js";
+import { compiler as array } from './array/compiler.js';
+import { compiler as boolean } from './boolean/compiler.js';
+import { compiler as enumeration } from './enum/compiler.js';
 export const Compiler = {
+    array,
     boolean,
-    enum: enumeration,
-    array
+    enum: enumeration
 };
 //# sourceMappingURL=index.js.map

package/dist/src/dsl/compilers/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/dsl/compilers/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,IAAI,KAAK,EAAE,MAAM,kBAAkB,CAAC;AACrD,OAAO,EAAE,QAAQ,IAAI,OAAO,EAAE,MAAM,oBAAoB,CAAC;AACzD,OAAO,EAAE,QAAQ,IAAI,WAAW,EAAE,MAAM,iBAAiB,CAAC;AAE1D,MAAM,CAAC,MAAM,QAAQ,GAAG;IACtB,OAAO;IACP,IAAI,EAAE,WAAW;IACjB,KAAK;CACG,CAAC","sourcesContent":["import { compiler as array } from \"./array/compiler\";\nimport { compiler as boolean } from \"./boolean/compiler\";\nimport { compiler as enumeration } from \"./enum/compiler\";\n\nexport const Compiler = {\n  boolean,\n  enum: enumeration,\n  array\n} as const;"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/dsl/compilers/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,IAAI,KAAK,EAAE,MAAM,qBAAqB,CAAC;AACxD,OAAO,EAAE,QAAQ,IAAI,OAAO,EAAE,MAAM,uBAAuB,CAAC;AAC5D,OAAO,EAAE,QAAQ,IAAI,WAAW,EAAE,MAAM,oBAAoB,CAAC;AAE7D,MAAM,CAAC,MAAM,QAAQ,GAAG;IACtB,KAAK;IACL,OAAO;IACP,IAAI,EAAE,WAAW;CACT,CAAC","sourcesContent":["import { compiler as array } from './array/compiler.js';\nimport { compiler as boolean } from './boolean/compiler.js';\nimport { compiler as enumeration } from './enum/compiler.js';\n\nexport const Compiler = {\n  array,\n  boolean,\n  enum: enumeration\n} as const;\n"]}

package/dist/src/dsl/utilty.d.ts

@@ -1,6 +1,2 @@
 export type Ctx = Record<string, unknown>;
-export declare const isRecord: (v: unknown) => v is Record<string, unknown>;
-export declare const getPath: <T = unknown>(ctx: unknown, path: string) => T | undefined;
-export declare const isTruthy: (v: unknown) => boolean;
-export declare const coerceLiteral: (s: string) => string | number | boolean | null | undefined;
 export declare const split: (raw: string, sep: string) => string[];

package/dist/src/dsl/utilty.js

@@ -1,32 +1,5 @@
-export const isRecord = (v) => v !== null && typeof v === "object";
-export const getPath = (ctx, path) => {
-    let acc = ctx;
-    for (const key of path.split(".")) {
-        if (!isRecord(acc) || !(key in acc))
-            return undefined;
-        acc = acc[key];
-    }
-    return acc;
-};
-export const isTruthy = (v) => v !== "" && v !== false && v !== null && v !== undefined;
-// Parse quoted literal or pass-through
-export const coerceLiteral = (s) => {
-    if (/^-?\d+(\.\d+)?$/.test(s))
-        return Number(s);
-    if (s === "true")
-        return true;
-    if (s === "false")
-        return false;
-    if (s === "null")
-        return null;
-    if (s === "undefined")
-        return undefined;
-    const q = s[0], end = s[s.length - 1];
-    if ((q === "'" && end === "'") || (q === '"' && end === '"'))
-        return s.slice(1, -1);
-    return s;
-};
-// Split by token, trim, drop empties
-export const split = (raw, sep) => raw.split(sep).map(s => s.trim())
+export const split = (raw, sep) => raw
+    .split(sep)
+    .map((s) => s.trim())
     .filter(Boolean);
 //# sourceMappingURL=utilty.js.map

package/dist/src/dsl/utilty.js.map

@@ -1 +1 @@
-{"version":3,"file":"utilty.js","sourceRoot":"","sources":["../../../src/dsl/utilty.ts"],"names":[],"mappings":"AACA,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAU,EAAgC,EAAE,CACnE,CAAC,KAAK,IAAI,IAAI,OAAO,CAAC,KAAK,QAAQ,CAAC;AAEtC,MAAM,CAAC,MAAM,OAAO,GAAG,CAAc,GAAY,EAAE,IAAY,EAAiB,EAAE;IAChF,IAAI,GAAG,GAAY,GAAG,CAAC;IACvB,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;QAClC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,GAAG,CAAC;YAAE,OAAO,SAAS,CAAC;QACtD,GAAG,GAAG,GAAG,CAAC,GAAuB,CAAC,CAAC;IACrC,CAAC;IACD,OAAO,GAAoB,CAAC;AAC9B,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,QAAQ,GAAG,CAAC,CAAU,EAAE,EAAE,CACrC,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,SAAS,CAAC;AAE3D,uCAAuC;AACvC,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,CAAS,EAAE,EAAE;IACzC,IAAI,iBAAiB,CAAC,IAAI,CAAC,CAAC,CAAC;QAAE,OAAO,MAAM,CAAC,CAAC,CAAC,CAAC;IAChD,IAAI,CAAC,KAAK,MAAM;QAAE,OAAO,IAAI,CAAC;IAC9B,IAAI,CAAC,KAAK,OAAO;QAAE,OAAO,KAAK,CAAC;IAChC,IAAI,CAAC,KAAK,MAAM;QAAE,OAAO,IAAI,CAAC;IAC9B,IAAI,CAAC,KAAK,WAAW;QAAE,OAAO,SAAS,CAAC;IACxC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACtC,IAAI,CAAC,CAAC,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,IAAI,GAAG,KAAK,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACpF,OAAO,CAAC,CAAC;AACX,CAAC,CAAC;AAEF,qCAAqC;AACrC,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,GAAW,EAAE,GAAW,EAAE,EAAE,CAChD,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;KAC9B,MAAM,CAAC,OAAO,CAAC,CAAC","sourcesContent":["export type Ctx = Record<string, unknown>;\nexport const isRecord = (v: unknown): v is Record<string, unknown> =>\n  v !== null && typeof v === \"object\";\n\nexport const getPath = <T = unknown>(ctx: unknown, path: string): T | undefined => {\n  let acc: unknown = ctx;\n  for (const key of path.split(\".\")) {\n    if (!isRecord(acc) || !(key in acc)) return undefined;\n    acc = acc[key as keyof typeof acc];\n  }\n  return acc as T | undefined;\n}\n\nexport const isTruthy = (v: unknown) =>\n  v !== \"\" && v !== false && v !== null && v !== undefined;\n\n// Parse quoted literal or pass-through\nexport const coerceLiteral = (s: string) => {\n  if (/^-?\\d+(\\.\\d+)?$/.test(s)) return Number(s);\n  if (s === \"true\") return true;\n  if (s === \"false\") return false;\n  if (s === \"null\") return null;\n  if (s === \"undefined\") return undefined;\n  const q = s[0], end = s[s.length - 1];\n  if ((q === \"'\" && end === \"'\") || (q === '\"' && end === '\"')) return s.slice(1, -1);\n  return s;\n};\n\n// Split by token, trim, drop empties\nexport const split = (raw: string, sep: string) =>\n  raw.split(sep).map(s => s.trim())\n    .filter(Boolean);"]}
+{"version":3,"file":"utilty.js","sourceRoot":"","sources":["../../../src/dsl/utilty.ts"],"names":[],"mappings":"AAEA,MAAM,CAAC,MAAM,KAAK,GAAG,CACnB,GAAW,EACX,GAAW,EACD,EAAE,CACZ,GAAG;KACA,KAAK,CAAC,GAAG,CAAC;KACV,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;KACpB,MAAM,CAAC,OAAO,CAAC,CAAC","sourcesContent":["export type Ctx = Record<string, unknown>;\n\nexport const split = (\n  raw: string,\n  sep: string\n): string[] =>\n  raw\n    .split(sep)\n    .map((s) => s.trim())\n    .filter(Boolean);\n"]}

package/dist/src/eta/batch.d.ts

@@ -0,0 +1,123 @@
+/**
+ * Accumulator for raw `MutationRecord`s produced by the
+ * `EtaMutationObserver` between scheduled flushes.
+ *
+ * Records fall into four buckets:
+ *
+ * - `added` — nodes introduced into the DOM via `childList` records.
+ * - `removed` — nodes detached via `childList` records.
+ * - `text` — `Text` nodes whose data changed via `characterData`
+ *   records.
+ * - `attributes` — `(Element, attributeName)` pairs that flipped via
+ *   `attributes` records.
+ *
+ * The buckets are `Set` / `Map` collections rather than arrays so
+ * that repeated records for the same target naturally collapse
+ * before flush (e.g. five `attributes` flips on the same `title`
+ * only yield a single `(element, 'title')` entry by the time the
+ * batch is applied).
+ *
+ * **Compaction rules.** A flush through `EtaMutationBatcher` applies
+ * the following reductions to the bucket contents before forwarding
+ * the compacted set to the `EtaTemplateIndex`:
+ *
+ * 1. `add` then `remove` of the same node within one batch is a
+ *    no-op (the node ends up detached, the index never saw it).
+ * 2. `remove` then `add` of the same node is forwarded as both a
+ *    `remove` and an `add` (the move is real).
+ * 3. An ancestor `add` subsumes descendant `add`s — the index walks
+ *    the subtree on `add`, so descendant adds are redundant.
+ * 4. An ancestor `remove` subsumes descendant `remove`s for the
+ *    same reason.
+ * 5. A `text` change inside an added subtree is dropped; the index
+ *    reads the final text when it walks the new subtree.
+ * 6. A `text` / `attribute` change inside a removed subtree is
+ *    dropped; the node is leaving ownership.
+ * 7. Repeated text changes on the same `Text` node collapse to one
+ *    entry (the `Set` storage already handles this).
+ * 8. Repeated attribute changes on the same `(Element, name)` pair
+ *    collapse to one entry (the inner `Set<string>` storage already
+ *    handles this).
+ *
+ * The batch itself does not enforce rules 1–6 — those live in the
+ * batcher's compaction pass. Rules 7–8 are enforced automatically
+ * by the bucket storage.
+ *
+ * **Immutability of contents.** Bucket contents are mutable in
+ * place for performance reasons (`Set.add` / `Map.set` are O(1)).
+ * Callers MUST NOT cache references to bucket internals across a
+ * flush — `clear()` resets the bucket to empty. The controller
+ * treats the batch as opaque between flushes.
+ */
+export declare class EtaMutationBatch {
+    /**
+     * Nodes added since the last flush.
+     *
+     * Stored as a `Set<Node>` so multiple adds of the same node
+     * collapse automatically (rule 7-equivalent for adds).
+     */
+    readonly added: Set<Node>;
+    /**
+     * Nodes removed since the last flush.
+     *
+     * Stored as a `Set<Node>` for the same dedup reasons as `added`.
+     */
+    readonly removed: Set<Node>;
+    /**
+     * `Text` nodes whose character data changed since the last flush.
+     *
+     * `Set<Text>` collapses repeated changes on the same text node
+     * (rule 7).
+     */
+    readonly text: Set<Text>;
+    /**
+     * `Element` → set of changed attribute names since the last flush.
+     *
+     * The inner `Set<string>` collapses repeated changes to the same
+     * attribute name (rule 8).
+     */
+    readonly attributes: Map<Element, Set<string>>;
+    /**
+     * Reset every bucket to empty.
+     *
+     * Called by `EtaMutationBatcher.flush()` after the compacted
+     * mutations have been applied to the index. The bucket instances
+     * are preserved (`Set` / `Map` references stay valid) so callers
+     * can safely hold long-lived references to them.
+     */
+    clear(): void;
+    /**
+     * `true` when every bucket is empty — i.e. there is nothing to
+     * forward to the index on the next flush.
+     *
+     * Used by `EtaMutationBatcher.flush()` as a fast-path for "no
+     * work to do" so the batcher can return `false` without touching
+     * the index.
+     */
+    get empty(): boolean;
+}
+/**
+ * Fold a single `MutationRecord` into the appropriate bucket of
+ * `batch`.
+ *
+ * The mapping mirrors `EtaMutationObserver.handleRecord` but
+ * accumulates records rather than forwarding them straight to the
+ * index. The batcher's compaction pass later walks the accumulated
+ * buckets and decides what to actually apply.
+ *
+ * Mapping:
+ *
+ * - `childList` → `addedNodes` / `removedNodes` are added to the
+ *   matching bucket.
+ * - `characterData` → the `Text` target is added to `text` (when
+ *   the target really is a `Text` — the DOM guard is defensive in
+ *   case some exotic browser delivers a different node type).
+ * - `attributes` → `(element, attributeName)` is added to
+ *   `attributes` (when the target is an `Element` and the
+ *   attribute name is present — both are required for the entry
+ *   to be useful to the index).
+ *
+ * Unknown record types are silently dropped. The DOM only emits
+ * the three types above, so this branch is defensive only.
+ */
+export declare function enqueueRecord(batch: EtaMutationBatch, record: MutationRecord): void;

package/dist/src/eta/batch.js

@@ -0,0 +1,162 @@
+// src/eta/batch.ts
+/**
+ * Accumulator for raw `MutationRecord`s produced by the
+ * `EtaMutationObserver` between scheduled flushes.
+ *
+ * Records fall into four buckets:
+ *
+ * - `added` — nodes introduced into the DOM via `childList` records.
+ * - `removed` — nodes detached via `childList` records.
+ * - `text` — `Text` nodes whose data changed via `characterData`
+ *   records.
+ * - `attributes` — `(Element, attributeName)` pairs that flipped via
+ *   `attributes` records.
+ *
+ * The buckets are `Set` / `Map` collections rather than arrays so
+ * that repeated records for the same target naturally collapse
+ * before flush (e.g. five `attributes` flips on the same `title`
+ * only yield a single `(element, 'title')` entry by the time the
+ * batch is applied).
+ *
+ * **Compaction rules.** A flush through `EtaMutationBatcher` applies
+ * the following reductions to the bucket contents before forwarding
+ * the compacted set to the `EtaTemplateIndex`:
+ *
+ * 1. `add` then `remove` of the same node within one batch is a
+ *    no-op (the node ends up detached, the index never saw it).
+ * 2. `remove` then `add` of the same node is forwarded as both a
+ *    `remove` and an `add` (the move is real).
+ * 3. An ancestor `add` subsumes descendant `add`s — the index walks
+ *    the subtree on `add`, so descendant adds are redundant.
+ * 4. An ancestor `remove` subsumes descendant `remove`s for the
+ *    same reason.
+ * 5. A `text` change inside an added subtree is dropped; the index
+ *    reads the final text when it walks the new subtree.
+ * 6. A `text` / `attribute` change inside a removed subtree is
+ *    dropped; the node is leaving ownership.
+ * 7. Repeated text changes on the same `Text` node collapse to one
+ *    entry (the `Set` storage already handles this).
+ * 8. Repeated attribute changes on the same `(Element, name)` pair
+ *    collapse to one entry (the inner `Set<string>` storage already
+ *    handles this).
+ *
+ * The batch itself does not enforce rules 1–6 — those live in the
+ * batcher's compaction pass. Rules 7–8 are enforced automatically
+ * by the bucket storage.
+ *
+ * **Immutability of contents.** Bucket contents are mutable in
+ * place for performance reasons (`Set.add` / `Map.set` are O(1)).
+ * Callers MUST NOT cache references to bucket internals across a
+ * flush — `clear()` resets the bucket to empty. The controller
+ * treats the batch as opaque between flushes.
+ */
+export class EtaMutationBatch {
+    constructor() {
+        /**
+         * Nodes added since the last flush.
+         *
+         * Stored as a `Set<Node>` so multiple adds of the same node
+         * collapse automatically (rule 7-equivalent for adds).
+         */
+        this.added = new Set();
+        /**
+         * Nodes removed since the last flush.
+         *
+         * Stored as a `Set<Node>` for the same dedup reasons as `added`.
+         */
+        this.removed = new Set();
+        /**
+         * `Text` nodes whose character data changed since the last flush.
+         *
+         * `Set<Text>` collapses repeated changes on the same text node
+         * (rule 7).
+         */
+        this.text = new Set();
+        /**
+         * `Element` → set of changed attribute names since the last flush.
+         *
+         * The inner `Set<string>` collapses repeated changes to the same
+         * attribute name (rule 8).
+         */
+        this.attributes = new Map();
+    }
+    /**
+     * Reset every bucket to empty.
+     *
+     * Called by `EtaMutationBatcher.flush()` after the compacted
+     * mutations have been applied to the index. The bucket instances
+     * are preserved (`Set` / `Map` references stay valid) so callers
+     * can safely hold long-lived references to them.
+     */
+    clear() {
+        this.added.clear();
+        this.removed.clear();
+        this.text.clear();
+        this.attributes.clear();
+    }
+    /**
+     * `true` when every bucket is empty — i.e. there is nothing to
+     * forward to the index on the next flush.
+     *
+     * Used by `EtaMutationBatcher.flush()` as a fast-path for "no
+     * work to do" so the batcher can return `false` without touching
+     * the index.
+     */
+    get empty() {
+        return (this.added.size === 0 &&
+            this.removed.size === 0 &&
+            this.text.size === 0 &&
+            this.attributes.size === 0);
+    }
+}
+/**
+ * Fold a single `MutationRecord` into the appropriate bucket of
+ * `batch`.
+ *
+ * The mapping mirrors `EtaMutationObserver.handleRecord` but
+ * accumulates records rather than forwarding them straight to the
+ * index. The batcher's compaction pass later walks the accumulated
+ * buckets and decides what to actually apply.
+ *
+ * Mapping:
+ *
+ * - `childList` → `addedNodes` / `removedNodes` are added to the
+ *   matching bucket.
+ * - `characterData` → the `Text` target is added to `text` (when
+ *   the target really is a `Text` — the DOM guard is defensive in
+ *   case some exotic browser delivers a different node type).
+ * - `attributes` → `(element, attributeName)` is added to
+ *   `attributes` (when the target is an `Element` and the
+ *   attribute name is present — both are required for the entry
+ *   to be useful to the index).
+ *
+ * Unknown record types are silently dropped. The DOM only emits
+ * the three types above, so this branch is defensive only.
+ */
+export function enqueueRecord(batch, record) {
+    if (record.type === 'childList') {
+        for (const node of record.addedNodes) {
+            batch.added.add(node);
+        }
+        for (const node of record.removedNodes) {
+            batch.removed.add(node);
+        }
+        return;
+    }
+    if (record.type === 'characterData' &&
+        record.target instanceof Text) {
+        batch.text.add(record.target);
+        return;
+    }
+    if (record.type === 'attributes' &&
+        record.target instanceof Element &&
+        record.attributeName) {
+        let attrs = batch.attributes.get(record.target);
+        if (!attrs) {
+            attrs = new Set();
+            batch.attributes.set(record.target, attrs);
+        }
+        attrs.add(record.attributeName);
+    }
+}
+//# sourceMappingURL=batch.js.map