@llui/compiler 0.5.1 → 0.5.2

package/dist/collect-deps.d.ts

@@ -19,7 +19,10 @@ import ts from 'typescript';
  * Shared by the bit-assignment path (`collectDeps`, below) and the
  * `diagnostics.ts` bitmask-overflow warning.
  */
-export declare function collectStatePathsFromSource(sourceFile: ts.SourceFile): Set<string>;
+export declare function collectStatePathsFromSource(sourceFile: ts.SourceFile): {
+    paths: Set<string>;
+    opaque: boolean;
+};
 /**
  * Per-accessor path sets — one entry per reactive arrow/function. Used
  * by the bitmask-overflow diagnostic to find clusters of paths that
@@ -45,6 +48,7 @@ export declare function collectAccessorPathSets(sourceFile: ts.SourceFile): Set<
 export declare function collectDeps(source: string, extraPaths?: ReadonlySet<string>): {
     lo: Map<string, number>;
     hi: Map<string, number>;
+    opaque: boolean;
 };
 /**
  * Determines if a node is at a reactive-accessor position — either an

package/dist/collect-deps.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"collect-deps.d.ts","sourceRoot":"","sources":["../src/collect-deps.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,YAAY,CAAA;AAyG3B;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,2BAA2B,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,GAAG,GAAG,CAAC,MAAM,CAAC,CAuBlF;AAED;;;;GAIG;AACH,wBAAgB,uBAAuB,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAwBhF;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,WAAW,CACzB,MAAM,EAAE,MAAM,EACd,UAAU,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,GAC/B;IACD,EAAE,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IACvB,EAAE,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CACxB,CAsCA;AAeD;;;;;;;;;;GAUG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,GAAG,OAAO,CA6DzD"}
+{"version":3,"file":"collect-deps.d.ts","sourceRoot":"","sources":["../src/collect-deps.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,YAAY,CAAA;AA0L3B;;;;;;;;;;;;;;;;;;;GAmBG;AACH,wBAAgB,2BAA2B,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,GAAG;IACtE,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAA;IAClB,MAAM,EAAE,OAAO,CAAA;CAChB,CAyBA;AAED;;;;GAIG;AACH,wBAAgB,uBAAuB,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAwBhF;AAED;;;;;;;;;;;;;;;GAeG;AACH,wBAAgB,WAAW,CACzB,MAAM,EAAE,MAAM,EACd,UAAU,CAAC,EAAE,WAAW,CAAC,MAAM,CAAC,GAC/B;IACD,EAAE,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IACvB,EAAE,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IACvB,MAAM,EAAE,OAAO,CAAA;CAChB,CAsCA;AAeD;;;;;;;;;;GAUG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,GAAG,OAAO,CA6DzD"}

package/dist/collect-deps.js

@@ -25,7 +25,7 @@ const NON_DELEGATION_HELPERS = new Set(['sample', 'item', 'memo', 'text', 'unsaf
  *     handing OUR state in. Conservative: don't recurse through
  *     lambda boundaries.
  */
-function visitTopLevelDelegations(body, stateParamName, follow) {
+function visitTopLevelDelegations(body, stateParamName, follow, onUnresolved) {
     function visit(node) {
         if (ts.isCallExpression(node) && ts.isIdentifier(node.expression)) {
             const name = node.expression.text;
@@ -35,6 +35,8 @@ function visitTopLevelDelegations(body, stateParamName, follow) {
                     const resolved = resolveAccessorBody(node.expression);
                     if (resolved)
                         follow(resolved);
+                    else if (onUnresolved)
+                        onUnresolved();
                 }
             }
         }
@@ -68,7 +70,7 @@ function visitTopLevelDelegations(body, stateParamName, follow) {
  * `visited` breaks cycles on mutually-recursive helpers — terminates
  * the walk; doesn't try to be precise about what such helpers read.
  */
-function extractAccessorPaths(accessor, paths, visited = new Set()) {
+function extractAccessorPaths(accessor, paths, visited = new Set(), opaqueOut) {
     if (visited.has(accessor))
         return false;
     visited.add(accessor);
@@ -76,20 +78,94 @@ function extractAccessorPaths(accessor, paths, visited = new Set()) {
     if (params.length !== 1)
         return false;
     const paramName = params[0].name;
-    if (!ts.isIdentifier(paramName))
+    if (!ts.isIdentifier(paramName)) {
+        // Destructured/anonymous param — the path walker can't follow
+        // reads through it. Conservative: mark the accessor as opaque so
+        // the synthesis pipeline emits a whole-state sentinel.
+        if (opaqueOut)
+            opaqueOut.value = true;
         return false;
+    }
     if (!accessor.body)
         return false;
     const before = paths.size;
     extractPaths(accessor.body, paramName.text, '', paths);
+    // Detect opaque state flow alongside path extraction. Mirrors the
+    // classifier in `transform.ts`'s `computeAccessorMask` (Identifier
+    // `s` used in a non-tracked position) — any leak means a precise
+    // `__prefixes` table is insufficient because a field read only
+    // through the leak never enters fieldBits and the runtime can't
+    // dirty it on change.
+    if (opaqueOut)
+        detectOpaqueStateFlow(accessor.body, paramName.text, opaqueOut);
     // Follow delegations: `(s) => helper(s)` — extract `helper`'s body's
     // state paths too. Reuses the `visited` set across the recursion
-    // chain so cycles terminate.
+    // chain so cycles terminate. When the callee is unresolvable
+    // (function parameter, import, destructured), the same logic that
+    // forces FULL_MASK in `computeAccessorMask` flags the file as
+    // opaque here, so the sentinel gets emitted.
     visitTopLevelDelegations(accessor.body, paramName.text, (resolved) => {
-        extractAccessorPaths(resolved, paths, visited);
+        extractAccessorPaths(resolved, paths, visited, opaqueOut);
+    }, () => {
+        if (opaqueOut)
+            opaqueOut.value = true;
     });
     return paths.size > before;
 }
+/**
+ * Mirror of the classifier in `computeAccessorMask` (transform.ts). An
+ * accessor "leaks state" — and so demands the conservative
+ * FULL_MASK / whole-state sentinel — when the state identifier `s`
+ * appears in any position OTHER than:
+ *   - the param binding itself
+ *   - the root of `s.x.y…` (PropertyAccessExpression)
+ *   - the root of `s['literal']` / `s[0]` (ElementAccess with literal key)
+ *   - arg0 of `helper(s)` with an Identifier callee (handled by the
+ *     delegation visitor — resolvable → recursion, unresolvable →
+ *     marks opaque via the callback)
+ *
+ * Every other context (NewExpression arg, TaggedTemplate span, spread,
+ * const-alias, conditional branch, method-call arg, dynamic key
+ * `s[expr]`, return-the-whole-state, …) is treated as a leak.
+ */
+function detectOpaqueStateFlow(body, stateParam, out) {
+    function visit(node) {
+        if (out.value)
+            return;
+        if (ts.isIdentifier(node) && node.text === stateParam) {
+            const parent = node.parent;
+            const isBinding = !!parent && ts.isParameter(parent);
+            if (!isBinding) {
+                let isTracked = false;
+                if (parent) {
+                    if (ts.isPropertyAccessExpression(parent) && parent.expression === node) {
+                        isTracked = true;
+                    }
+                    else if (ts.isElementAccessExpression(parent) && parent.expression === node) {
+                        isTracked =
+                            ts.isStringLiteralLike(parent.argumentExpression) ||
+                                ts.isNumericLiteral(parent.argumentExpression);
+                    }
+                    else if (ts.isCallExpression(parent) &&
+                        ts.isIdentifier(parent.expression) &&
+                        parent.arguments[0] === node &&
+                        !NON_DELEGATION_HELPERS.has(parent.expression.text)) {
+                        // The delegation visitor either recurses into the resolved
+                        // body (transitively detecting opaque inside) or flags
+                        // opaque via its second callback for unresolvable callees.
+                        isTracked = true;
+                    }
+                }
+                if (!isTracked) {
+                    out.value = true;
+                    return;
+                }
+            }
+        }
+        ts.forEachChild(node, visit);
+    }
+    visit(body);
+}
 /**
  * Walk the AST and collect every unique state access path referenced by
  * a reactive accessor. A reactive accessor is one of:
@@ -112,25 +188,28 @@ function extractAccessorPaths(accessor, paths, visited = new Set()) {
  */
 export function collectStatePathsFromSource(sourceFile) {
     const paths = new Set();
+    const opaqueOut = { value: false };
     function visit(node) {
         // Inline arrow / function expression at a reactive position.
         if (ts.isArrowFunction(node) || ts.isFunctionExpression(node)) {
             if (isReactiveAccessor(node))
-                extractAccessorPaths(node, paths);
+                extractAccessorPaths(node, paths, undefined, opaqueOut);
         }
         // Identifier at a reactive position — resolve to its declaration
-        // and extract paths from the resolved body. Skip identifiers
-        // imported from elsewhere (resolver returns null) — there's no
-        // body to scan, runtime falls back to FULL_MASK.
+        // and extract paths from the resolved body. Identifiers that
+        // resolve elsewhere (imports, etc.) leave a binding the walker
+        // can't see — treat the host file as opaque so the sentinel fires.
         if (ts.isIdentifier(node) && isReactiveAccessor(node)) {
             const resolved = resolveAccessorBody(node);
             if (resolved)
-                extractAccessorPaths(resolved, paths);
+                extractAccessorPaths(resolved, paths, undefined, opaqueOut);
+            else
+                opaqueOut.value = true;
         }
         ts.forEachChild(node, visit);
     }
     visit(sourceFile);
-    return paths;
+    return { paths, opaque: opaqueOut.value };
 }
 /**
  * Per-accessor path sets — one entry per reactive arrow/function. Used
@@ -180,9 +259,9 @@ export function collectDeps(source, extraPaths) {
     const sourceFile = ts.createSourceFile('input.ts', source, ts.ScriptTarget.Latest, true);
     // Check if file imports from @llui/dom
     if (!hasLluiImport(sourceFile)) {
-        return { lo: new Map(), hi: new Map() };
+        return { lo: new Map(), hi: new Map(), opaque: false };
     }
-    const paths = collectStatePathsFromSource(sourceFile);
+    const { paths, opaque } = collectStatePathsFromSource(sourceFile);
     // Cross-file extension (v2c pipeline integration): the host adapter may
     // pass paths discovered by `crossFileAccessorPaths()` — paths read
     // through in-repo view-helpers in *other* files. Union them with the
@@ -212,7 +291,7 @@ export function collectDeps(source, extraPaths) {
         }
         index++;
     }
-    return { lo, hi };
+    return { lo, hi, opaque };
 }
 function hasLluiImport(sourceFile) {
     for (const stmt of sourceFile.statements) {

package/dist/collect-deps.js.map

@@ -1 +1 @@
-{"version":3,"file":"collect-deps.js","sourceRoot":"","sources":["../src/collect-deps.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,YAAY,CAAA;AAC3B,OAAO,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAA;AAE5D;;;;;;;GAOG;AACH,MAAM,sBAAsB,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC,CAAA;AAExF;;;;;;;;;;;;;;;GAeG;AACH,SAAS,wBAAwB,CAC/B,IAAa,EACb,cAAsB,EACtB,MAA6F;IAE7F,SAAS,KAAK,CAAC,IAAa;QAC1B,IAAI,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YAClE,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAA;YACjC,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACtC,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;gBAC9B,IAAI,IAAI,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;oBAClE,MAAM,QAAQ,GAAG,mBAAmB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;oBACrD,IAAI,QAAQ;wBAAE,MAAM,CAAC,QAAQ,CAAC,CAAA;gBAChC,CAAC;YACH,CAAC;QACH,CAAC;QACD,kEAAkE;QAClE,gEAAgE;QAChE,aAAa;QACb,IACE,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC;YACxB,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC;YAC7B,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC,EAC9B,CAAC;YACD,OAAM;QACR,CAAC;QACD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;IAC9B,CAAC;IACD,+DAA+D;IAC/D,uDAAuD;IACvD,IAAI,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC,EAAE,CAAC;QAChG,OAAM;IACR,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,CAAA;AACb,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,oBAAoB,CAC3B,QAA2E,EAC3E,KAAkB,EAClB,UAAwB,IAAI,GAAG,EAAE;IAEjC,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;QAAE,OAAO,KAAK,CAAA;IACvC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;IAErB,MAAM,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAA;IAClC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAA;IACrC,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC,IAAI,CAAA;IACjC,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,SAAS,CAAC;QAAE,OAAO,KAAK,CAAA;IAC7C,IAAI,CAAC,QAAQ,CAAC,IAAI;QAAE,OAAO,KAAK,CAAA;IAChC,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAA;IAEzB,YAAY,CAAC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,CAAC,CAAA;IAEtD,qEAAqE;IACrE,iEAAiE;IACjE,6BAA6B;IAC7B,wBAAwB,CAAC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,CAAC,QAAQ,EAAE,EAAE;QACnE,oBAAoB,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,CAAC,CAAA;IAChD,CAAC,CAAC,CAAA;IAEF,OAAO,KAAK,CAAC,IAAI,GAAG,MAAM,CAAA;AAC5B,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,UAAU,2BAA2B,CAAC,UAAyB;IACnE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;IAE/B,SAAS,KAAK,CAAC,IAAa;QAC1B,6DAA6D;QAC7D,IAAI,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9D,IAAI,kBAAkB,CAAC,IAAI,CAAC;gBAAE,oBAAoB,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QACjE,CAAC;QAED,iEAAiE;QACjE,6DAA6D;QAC7D,+DAA+D;QAC/D,iDAAiD;QACjD,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;YACtD,MAAM,QAAQ,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAA;YAC1C,IAAI,QAAQ;gBAAE,oBAAoB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAA;QACrD,CAAC;QAED,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;IAC9B,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,CAAA;IACjB,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,uBAAuB,CAAC,UAAyB;IAC/D,MAAM,IAAI,GAAkB,EAAE,CAAA;IAE9B,SAAS,KAAK,CAAC,IAAa;QAC1B,IAAI,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9D,IAAI,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC7B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAA;gBAC7B,IAAI,oBAAoB,CAAC,IAAI,EAAE,GAAG,CAAC;oBAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YACrD,CAAC;QACH,CAAC;QAED,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;YACtD,MAAM,QAAQ,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAA;YAC1C,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAA;gBAC7B,IAAI,oBAAoB,CAAC,QAAQ,EAAE,GAAG,CAAC;oBAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YACzD,CAAC;QACH,CAAC;QAED,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;IAC9B,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,CAAA;IACjB,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,WAAW,CACzB,MAAc,EACd,UAAgC;IAKhC,MAAM,UAAU,GAAG,EAAE,CAAC,gBAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;IAExF,uCAAuC;IACvC,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,EAAE,CAAC;QAC/B,OAAO,EAAE,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,CAAA;IACzC,CAAC;IAED,MAAM,KAAK,GAAG,2BAA2B,CAAC,UAAU,CAAC,CAAA;IACrD,wEAAwE;IACxE,mEAAmE;IACnE,qEAAqE;IACrE,+DAA+D;IAC/D,mEAAmE;IACnE,qEAAqE;IACrE,uBAAuB;IACvB,IAAI,UAAU,EAAE,CAAC;QACf,KAAK,MAAM,CAAC,IAAI,UAAU;YAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAC1C,CAAC;IAED,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAA;IACpC,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAA;IACpC,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;YACf,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC,CAAA;QAC1B,CAAC;aAAM,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;YACtB,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAA;QACjC,CAAC;aAAM,CAAC;YACN,+DAA+D;YAC/D,8DAA8D;YAC9D,qBAAqB;YACrB,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;QAClB,CAAC;QACD,KAAK,EAAE,CAAA;IACT,CAAC;IAED,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,CAAA;AACnB,CAAC;AAED,SAAS,aAAa,CAAC,UAAyB;IAC9C,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,UAAU,EAAE,CAAC;QACzC,IACE,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC;YAC5B,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,eAAe,CAAC;YACxC,IAAI,CAAC,eAAe,CAAC,IAAI,KAAK,WAAW,EACzC,CAAC;YACD,OAAO,IAAI,CAAA;QACb,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAa;IAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;IAE1B,2CAA2C;IAC3C,IAAI,EAAE,CAAC,gBAAgB,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QAChE,kEAAkE;QAClE,uEAAuE;QACvE,gEAAgE;QAChE,IAAI,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC;YACvC,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,KAAK,MAAM,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC7E,OAAO,KAAK,CAAA;YACd,CAAC;QACH,CAAC;QACD,wFAAwF;QACxF,wEAAwE;QACxE,IAAI,EAAE,CAAC,0BAA0B,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC;YACrD,MAAM,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAA;YAC9C,IAAI,UAAU,KAAK,MAAM,IAAI,UAAU,KAAK,MAAM,EAAE,CAAC;gBACnD,OAAO,IAAI,CAAA;YACb,CAAC;YACD,OAAO,KAAK,CAAA;QACd,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,0FAA0F;IAC1F,+EAA+E;IAC/E,sEAAsE;IACtE,8EAA8E;IAC9E,IAAI,EAAE,CAAC,oBAAoB,CAAC,MAAM,CAAC,EAAE,CAAC;QACpC,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAA;QACvB,IAAI,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC;YACzB,+CAA+C;YAC/C,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,OAAO,KAAK,CAAA;YAC3C,wDAAwD;YACxD,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM;gBAAE,OAAO,KAAK,CAAA;YAC3D,gDAAgD;YAChD,IAAI,QAAQ,GAAwB,MAAM,CAAC,MAAM,CAAA,CAAC,0BAA0B;YAC5E,OAAO,QAAQ,IAAI,CAAC,EAAE,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAClD,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAA;YAC5B,CAAC;YACD,IAAI,CAAC,QAAQ;gBAAE,OAAO,KAAK,CAAA;YAC3B,MAAM,QAAQ,GAAG,QAA6B,CAAA;YAC9C,6DAA6D;YAC7D,IAAI,EAAE,CAAC,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;gBACzC,OAAO,kBAAkB,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;YACzD,CAAC;YACD,kEAAkE;YAClE,mEAAmE;YACnE,yDAAyD;YACzD,gEAAgE;YAChE,+DAA+D;YAC/D,gDAAgD;YAChD,IAAI,EAAE,CAAC,0BAA0B,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;gBACvD,OAAO,kBAAkB,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC9D,CAAC;YACD,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAED,4EAA4E;AAC5E,uEAAuE;AACvE,MAAM,kBAAkB,GAAG,IAAI,GAAG,CAAC;IACjC,kFAAkF;IAClF,GAAG;QACD,GAAG;QACH,MAAM;QACN,SAAS;QACT,OAAO;QACP,GAAG;QACH,YAAY;QACZ,IAAI;QACJ,QAAQ;QACR,QAAQ;QACR,MAAM;QACN,IAAI;QACJ,SAAS;QACT,QAAQ;QACR,KAAK;QACL,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,UAAU;QACV,YAAY;QACZ,QAAQ;QACR,QAAQ;QACR,MAAM;QACN,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,QAAQ;QACR,IAAI;QACJ,GAAG;QACH,QAAQ;QACR,KAAK;QACL,OAAO;QACP,OAAO;QACP,QAAQ;QACR,IAAI;QACJ,MAAM;QACN,MAAM;QACN,KAAK;QACL,IAAI;QACJ,UAAU;QACV,QAAQ;QACR,QAAQ;QACR,GAAG;QACH,KAAK;QACL,UAAU;QACV,SAAS;QACT,QAAQ;QACR,OAAO;QACP,MAAM;QACN,QAAQ;QACR,KAAK;QACL,SAAS;QACT,KAAK;QACL,OAAO;QACP,OAAO;QACP,IAAI;QACJ,UAAU;QACV,OAAO;QACP,IAAI;QACJ,OAAO;QACP,MAAM;QACN,IAAI;QACJ,IAAI;QACJ,OAAO;KACR;IACD,wBAAwB;IACxB,MAAM;IACN,QAAQ;IACR,OAAO;IACP,MAAM;IACN,MAAM;IACN,QAAQ;IACR,SAAS;IACT,OAAO;IACP,eAAe;IACf,sEAAsE;IACtE,qEAAqE;IACrE,gEAAgE;IAChE,iEAAiE;IACjE,8BAA8B;IAC9B,OAAO;CACR,CAAC,CAAA;AAEF;;;;;GAKG;AACH,SAAS,YAAY,CAAC,IAAa,EAAE,SAAiB,EAAE,OAAe,EAAE,KAAkB;IACzF,IAAI,EAAE,CAAC,0BAA0B,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,oDAAoD;QACpD,IAAI,EAAE,CAAC,0BAA0B,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/C,mCAAmC;QACrC,CAAC;QACD,mEAAmE;aAC9D,IAAI,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;YAC7E,yDAAyD;YACzD,gEAAgE;YAChE,IAAI,EAAE,CAAC,0BAA0B,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;gBACnD,MAAM,KAAK,GAAG,oBAAoB,CAAC,IAAI,CAAC,UAAU,EAAE,SAAS,CAAC,CAAA;gBAC9D,IAAI,KAAK;oBAAE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;YAC7B,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,KAAK,GAAG,oBAAoB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;YACnD,IAAI,KAAK,EAAE,CAAC;gBACV,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;YAClB,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,EAAE,CAAC,yBAAyB,CAAC,IAAI,CAAC,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,oBAAoB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;QACnD,IAAI,KAAK,EAAE,CAAC;YACV,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QAClB,CAAC;IACH,CAAC;IAED,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAA;AAClF,CAAC;AAED;;;;GAIG;AACH,SAAS,oBAAoB,CAAC,IAAiC,EAAE,SAAiB;IAChF,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,IAAI,OAAO,GAAkB,IAAI,CAAA;IAEjC,OAAO,EAAE,CAAC,0BAA0B,CAAC,OAAO,CAAC,EAAE,CAAC;QAC9C,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAChC,OAAO,GAAG,OAAO,CAAC,UAAU,CAAA;IAC9B,CAAC;IAED,uCAAuC;IACvC,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC5D,OAAO,IAAI,CAAA;IACb,CAAC;IAED,mBAAmB;IACnB,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACpC,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AACxB,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAAC,IAAgC,EAAE,SAAiB;IAC/E,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC5E,OAAO,IAAI,CAAA;IACb,CAAC;IAED,IAAI,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC;QAChD,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAA;IACrC,CAAC;IAED,OAAO,IAAI,CAAA;AACb,CAAC","sourcesContent":["import ts from 'typescript'\nimport { resolveAccessorBody } from './accessor-resolver.js'\n\n/**\n * Names whose first arg is itself a reactive accessor (the existing\n * arrow walker handles them) or which are explicitly excluded\n * (sample/item read state imperatively / per-row, not as state\n * accessors). When a delegating accessor's body contains a call to one\n * of these, we don't follow it — recursion is reserved for \"this is\n * just a thin wrapper that hands the state to another local helper.\"\n */\nconst NON_DELEGATION_HELPERS = new Set(['sample', 'item', 'memo', 'text', 'unsafeHtml'])\n\n/**\n * Walk a delegating accessor's body looking for calls to OTHER local\n * functions that take the state param verbatim — `helper(s)` where\n * `s` matches the outer accessor's param name. For each, hand the\n * resolved declaration back so the caller can recurse into its body.\n *\n * Skips:\n *   - Framework helpers (`memo`, `text`, etc.) — their arrow args are\n *     visited by the top-level arrow walker; we'd double-count.\n *   - Method calls (`s.items.filter(...)`) — the callee is a builtin,\n *     not a local function we can resolve.\n *   - Nested function bodies — params inside a `(item) => …` shadow\n *     ours, so a `helper(s)` deep in there isn't (necessarily)\n *     handing OUR state in. Conservative: don't recurse through\n *     lambda boundaries.\n */\nfunction visitTopLevelDelegations(\n  body: ts.Node,\n  stateParamName: string,\n  follow: (resolved: ts.ArrowFunction | ts.FunctionExpression | ts.FunctionDeclaration) => void,\n): void {\n  function visit(node: ts.Node): void {\n    if (ts.isCallExpression(node) && ts.isIdentifier(node.expression)) {\n      const name = node.expression.text\n      if (!NON_DELEGATION_HELPERS.has(name)) {\n        const arg0 = node.arguments[0]\n        if (arg0 && ts.isIdentifier(arg0) && arg0.text === stateParamName) {\n          const resolved = resolveAccessorBody(node.expression)\n          if (resolved) follow(resolved)\n        }\n      }\n    }\n    // Don't descend into nested function bodies — their params shadow\n    // ours, and any call inside them isn't unambiguously delegating\n    // our state.\n    if (\n      ts.isArrowFunction(node) ||\n      ts.isFunctionExpression(node) ||\n      ts.isFunctionDeclaration(node)\n    ) {\n      return\n    }\n    ts.forEachChild(node, visit)\n  }\n  // If the body itself is a function, there's nothing at the top\n  // level to inspect — its own body is a separate scope.\n  if (ts.isArrowFunction(body) || ts.isFunctionExpression(body) || ts.isFunctionDeclaration(body)) {\n    return\n  }\n  visit(body)\n}\n\n/**\n * Extract paths from a callable accessor (arrow / fn-expr / fn-decl)\n * into the given set. Recurses through call-delegations to other local\n * helpers so that `(s) => filtered(s)` / `(s) => { void s.x; return\n * inner(s) }` correctly contribute the helper's state-path reads.\n * Without recursion the precise mask under-counts — fields read only\n * via the helper drop off the bitmask, and any sibling reactive\n * accessor that reads them produces a non-zero `dirty` that AND'd with\n * the narrow each.__mask is zero, silently skipping the reconcile.\n *\n * `visited` breaks cycles on mutually-recursive helpers — terminates\n * the walk; doesn't try to be precise about what such helpers read.\n */\nfunction extractAccessorPaths(\n  accessor: ts.ArrowFunction | ts.FunctionExpression | ts.FunctionDeclaration,\n  paths: Set<string>,\n  visited: Set<ts.Node> = new Set(),\n): boolean {\n  if (visited.has(accessor)) return false\n  visited.add(accessor)\n\n  const params = accessor.parameters\n  if (params.length !== 1) return false\n  const paramName = params[0]!.name\n  if (!ts.isIdentifier(paramName)) return false\n  if (!accessor.body) return false\n  const before = paths.size\n\n  extractPaths(accessor.body, paramName.text, '', paths)\n\n  // Follow delegations: `(s) => helper(s)` — extract `helper`'s body's\n  // state paths too. Reuses the `visited` set across the recursion\n  // chain so cycles terminate.\n  visitTopLevelDelegations(accessor.body, paramName.text, (resolved) => {\n    extractAccessorPaths(resolved, paths, visited)\n  })\n\n  return paths.size > before\n}\n\n/**\n * Walk the AST and collect every unique state access path referenced by\n * a reactive accessor. A reactive accessor is one of:\n *\n *   - An inline arrow / function expression at a reactive position\n *     (`text(s => s.count)`, `div({ title: s => s.title })`,\n *     `show({ when: s => s.gated })`, etc.).\n *   - An Identifier at a reactive position that resolves to a callable\n *     in this file — a const-bound arrow / function expression,\n *     a hoisted function declaration, or `const x = memo(arrow)`.\n *\n * The second case lets authors refactor a literal arrow into a named\n * helper without losing the reactive-mask optimization (a precise mask\n * for `__dirty` and structural-primitive `__mask`). Without it, the\n * runtime falls back to FULL_MASK — correct, but every binding fires\n * on every state change.\n *\n * Shared by the bit-assignment path (`collectDeps`, below) and the\n * `diagnostics.ts` bitmask-overflow warning.\n */\nexport function collectStatePathsFromSource(sourceFile: ts.SourceFile): Set<string> {\n  const paths = new Set<string>()\n\n  function visit(node: ts.Node): void {\n    // Inline arrow / function expression at a reactive position.\n    if (ts.isArrowFunction(node) || ts.isFunctionExpression(node)) {\n      if (isReactiveAccessor(node)) extractAccessorPaths(node, paths)\n    }\n\n    // Identifier at a reactive position — resolve to its declaration\n    // and extract paths from the resolved body. Skip identifiers\n    // imported from elsewhere (resolver returns null) — there's no\n    // body to scan, runtime falls back to FULL_MASK.\n    if (ts.isIdentifier(node) && isReactiveAccessor(node)) {\n      const resolved = resolveAccessorBody(node)\n      if (resolved) extractAccessorPaths(resolved, paths)\n    }\n\n    ts.forEachChild(node, visit)\n  }\n\n  visit(sourceFile)\n  return paths\n}\n\n/**\n * Per-accessor path sets — one entry per reactive arrow/function. Used\n * by the bitmask-overflow diagnostic to find clusters of paths that\n * always fire together (co-occurrence analysis).\n */\nexport function collectAccessorPathSets(sourceFile: ts.SourceFile): Set<string>[] {\n  const sets: Set<string>[] = []\n\n  function visit(node: ts.Node): void {\n    if (ts.isArrowFunction(node) || ts.isFunctionExpression(node)) {\n      if (isReactiveAccessor(node)) {\n        const set = new Set<string>()\n        if (extractAccessorPaths(node, set)) sets.push(set)\n      }\n    }\n\n    if (ts.isIdentifier(node) && isReactiveAccessor(node)) {\n      const resolved = resolveAccessorBody(node)\n      if (resolved) {\n        const set = new Set<string>()\n        if (extractAccessorPaths(resolved, set)) sets.push(set)\n      }\n    }\n\n    ts.forEachChild(node, visit)\n  }\n\n  visit(sourceFile)\n  return sets\n}\n\n/**\n * Pre-scan a source file to collect all unique state access paths\n * referenced by reactive accessors (arrow functions in props and text() calls).\n *\n * Returns a pair of maps:\n *   - `lo`: paths at bit positions 0..30, with value `1 << position`\n *   - `hi`: paths at bit positions 31..61, with value `1 << (position - 31)`\n *\n * Bit positions past 61 collapse to `-1` (FULL_MASK) in the `lo` map and\n * cause every binding reading them to re-evaluate on every cycle. The\n * `bitmask-overflow` lint rule warns the user to restructure state.\n *\n * Components with ≤31 paths see an empty `hi` map; the compiler skips\n * all high-word emit so the generated code is byte-identical to the\n * pre-multi-word baseline.\n */\nexport function collectDeps(\n  source: string,\n  extraPaths?: ReadonlySet<string>,\n): {\n  lo: Map<string, number>\n  hi: Map<string, number>\n} {\n  const sourceFile = ts.createSourceFile('input.ts', source, ts.ScriptTarget.Latest, true)\n\n  // Check if file imports from @llui/dom\n  if (!hasLluiImport(sourceFile)) {\n    return { lo: new Map(), hi: new Map() }\n  }\n\n  const paths = collectStatePathsFromSource(sourceFile)\n  // Cross-file extension (v2c pipeline integration): the host adapter may\n  // pass paths discovered by `crossFileAccessorPaths()` — paths read\n  // through in-repo view-helpers in *other* files. Union them with the\n  // file-local set before bit assignment. Without this merge the\n  // sentinel-`show()` workaround from v2b §1 remains necessary; with\n  // it, helpers in other files contribute to the consumer's __prefixes\n  // table automatically.\n  if (extraPaths) {\n    for (const p of extraPaths) paths.add(p)\n  }\n\n  const lo = new Map<string, number>()\n  const hi = new Map<string, number>()\n  let index = 0\n  for (const path of paths) {\n    if (index < 31) {\n      lo.set(path, 1 << index)\n    } else if (index < 62) {\n      hi.set(path, 1 << (index - 31))\n    } else {\n      // Past 61 paths — graceful FULL_MASK fallback in the low word.\n      // Realistic LLui components shouldn't hit this; the lint rule\n      // fires well before.\n      lo.set(path, -1)\n    }\n    index++\n  }\n\n  return { lo, hi }\n}\n\nfunction hasLluiImport(sourceFile: ts.SourceFile): boolean {\n  for (const stmt of sourceFile.statements) {\n    if (\n      ts.isImportDeclaration(stmt) &&\n      ts.isStringLiteral(stmt.moduleSpecifier) &&\n      stmt.moduleSpecifier.text === '@llui/dom'\n    ) {\n      return true\n    }\n  }\n  return false\n}\n\n/**\n * Determines if a node is at a reactive-accessor position — either an\n * inline arrow / function expression OR an identifier that's about to\n * be resolved to one. The check is identity-based on `parent.arguments[0]`\n * etc., so the same logic works for both shapes.\n *\n * Exported so the cross-file walker can use the same gate. Without this\n * gate the walker descends into every 1-param arrow in the file —\n * including `onEffect: (bag) => bag.send(...)` — and pollutes\n * `__prefixes` with non-state property names (issue #5, bug 3).\n */\nexport function isReactiveAccessor(node: ts.Node): boolean {\n  const parent = node.parent\n\n  // text(s => s.count) — first arg to a call\n  if (ts.isCallExpression(parent) && parent.arguments[0] === node) {\n    // Skip item(t => t.id) — per-item selectors inside each() render.\n    // Skip sample(s => s.x) — imperative one-shot read, no binding created\n    // (both the top-level import and the destructured-from-h form).\n    if (ts.isIdentifier(parent.expression)) {\n      if (parent.expression.text === 'item' || parent.expression.text === 'sample') {\n        return false\n      }\n    }\n    // Skip array method callbacks: .filter(t => ...), .map(t => ...), .some(t => ...), etc.\n    // Allow view-helper primitive calls: h.text(s => ...), h.memo(s => ...)\n    if (ts.isPropertyAccessExpression(parent.expression)) {\n      const methodName = parent.expression.name.text\n      if (methodName === 'text' || methodName === 'memo') {\n        return true\n      }\n      return false\n    }\n    return true\n  }\n\n  // div({ title: s => s.title }) — value in a property assignment inside an object literal.\n  // Only treat as reactive if the containing call is a known framework API whose\n  // properties are reactive accessors. Otherwise user-land helpers like\n  // sliceHandler({ narrow: (m) => m.type === ... }) would pollute the path set.\n  if (ts.isPropertyAssignment(parent)) {\n    const key = parent.name\n    if (ts.isIdentifier(key)) {\n      // Skip event handlers (onClick, onInput, etc.)\n      if (/^on[A-Z]/.test(key.text)) return false\n      // Skip each() key function and other non-reactive props\n      if (key.text === 'key' || key.text === 'name') return false\n      // Walk up to find the enclosing call expression\n      let ancestor: ts.Node | undefined = parent.parent // ObjectLiteralExpression\n      while (ancestor && !ts.isCallExpression(ancestor)) {\n        ancestor = ancestor.parent\n      }\n      if (!ancestor) return false\n      const callExpr = ancestor as ts.CallExpression\n      // Bare identifier: `scope({on: …})`, `div({title: …})`, etc.\n      if (ts.isIdentifier(callExpr.expression)) {\n        return REACTIVE_API_NAMES.has(callExpr.expression.text)\n      }\n      // Method-call form: `h.scope({on: …})`, `h.show({when: …})`, etc.\n      // The docs and View bag promote this shape; without recognizing it\n      // here, paths read ONLY through a structural primitive's\n      // `on`/`when`/`items` accessor never enter `__prefixes`, so the\n      // runtime dirty mask can't see changes to those fields and the\n      // structural block silently fails to reconcile.\n      if (ts.isPropertyAccessExpression(callExpr.expression)) {\n        return REACTIVE_API_NAMES.has(callExpr.expression.name.text)\n      }\n      return false\n    }\n  }\n\n  return false\n}\n\n// Framework APIs whose object-literal arguments contain reactive accessors.\n// Arrow functions in property values of these calls are state-tracked.\nconst REACTIVE_API_NAMES = new Set([\n  // Element helpers (see ELEMENT_HELPERS in transform.ts — we keep a superset here)\n  ...[\n    'a',\n    'abbr',\n    'article',\n    'aside',\n    'b',\n    'blockquote',\n    'br',\n    'button',\n    'canvas',\n    'code',\n    'dd',\n    'details',\n    'dialog',\n    'div',\n    'dl',\n    'dt',\n    'em',\n    'fieldset',\n    'figcaption',\n    'figure',\n    'footer',\n    'form',\n    'h1',\n    'h2',\n    'h3',\n    'h4',\n    'h5',\n    'h6',\n    'header',\n    'hr',\n    'i',\n    'iframe',\n    'img',\n    'input',\n    'label',\n    'legend',\n    'li',\n    'main',\n    'mark',\n    'nav',\n    'ol',\n    'optgroup',\n    'option',\n    'output',\n    'p',\n    'pre',\n    'progress',\n    'section',\n    'select',\n    'small',\n    'span',\n    'strong',\n    'sub',\n    'summary',\n    'sup',\n    'table',\n    'tbody',\n    'td',\n    'textarea',\n    'tfoot',\n    'th',\n    'thead',\n    'time',\n    'tr',\n    'ul',\n    'video',\n  ],\n  // Structural primitives\n  'each',\n  'branch',\n  'scope',\n  'show',\n  'memo',\n  'portal',\n  'foreign',\n  'child',\n  'errorBoundary',\n  // track({ deps: (s) => [...] }) — explicit reactivity declaration for\n  // paths static analysis can't infer. The compiler treats `deps` as a\n  // reactive accessor so its paths fold into the host component's\n  // __prefixes; the call expression is then stripped from emission\n  // (see transform.ts). v2b §3.\n  'track',\n])\n\n/**\n * Extract state access paths from an expression body.\n * Handles:\n * - Direct property access: param.field, param.field.subfield\n * - Bracket notation with string literal: param['field']\n */\nfunction extractPaths(node: ts.Node, paramName: string, _prefix: string, paths: Set<string>): void {\n  if (ts.isPropertyAccessExpression(node)) {\n    // Skip if this is an intermediate in a deeper chain\n    if (ts.isPropertyAccessExpression(node.parent)) {\n      // handled when the leaf is visited\n    }\n    // Skip if this is the callee of a method call: s.todos.filter(...)\n    else if (ts.isCallExpression(node.parent) && node.parent.expression === node) {\n      // It's a method call — record the object, not the method\n      // e.g. s.todos.filter(...) → record 'todos', not 'todos.filter'\n      if (ts.isPropertyAccessExpression(node.expression)) {\n        const chain = resolvePropertyChain(node.expression, paramName)\n        if (chain) paths.add(chain)\n      }\n    } else {\n      const chain = resolvePropertyChain(node, paramName)\n      if (chain) {\n        paths.add(chain)\n      }\n    }\n  }\n\n  if (ts.isElementAccessExpression(node)) {\n    const chain = resolveElementAccess(node, paramName)\n    if (chain) {\n      paths.add(chain)\n    }\n  }\n\n  ts.forEachChild(node, (child) => extractPaths(child, paramName, _prefix, paths))\n}\n\n/**\n * Resolve a property access chain like s.user.name to \"user.name\".\n * Returns null if the chain doesn't start with the state parameter.\n * Stops at depth 2.\n */\nfunction resolvePropertyChain(node: ts.PropertyAccessExpression, paramName: string): string | null {\n  const parts: string[] = []\n  let current: ts.Expression = node\n\n  while (ts.isPropertyAccessExpression(current)) {\n    parts.unshift(current.name.text)\n    current = current.expression\n  }\n\n  // The root must be the state parameter\n  if (!ts.isIdentifier(current) || current.text !== paramName) {\n    return null\n  }\n\n  // Limit to depth 2\n  if (parts.length > 2) {\n    return parts.slice(0, 2).join('.')\n  }\n\n  return parts.join('.')\n}\n\n/**\n * Resolve bracket access with string literal: s['count'] → \"count\"\n */\nfunction resolveElementAccess(node: ts.ElementAccessExpression, paramName: string): string | null {\n  if (!ts.isIdentifier(node.expression) || node.expression.text !== paramName) {\n    return null\n  }\n\n  if (ts.isStringLiteral(node.argumentExpression)) {\n    return node.argumentExpression.text\n  }\n\n  return null\n}\n"]}
+{"version":3,"file":"collect-deps.js","sourceRoot":"","sources":["../src/collect-deps.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,YAAY,CAAA;AAC3B,OAAO,EAAE,mBAAmB,EAAE,MAAM,wBAAwB,CAAA;AAE5D;;;;;;;GAOG;AACH,MAAM,sBAAsB,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,YAAY,CAAC,CAAC,CAAA;AAExF;;;;;;;;;;;;;;;GAeG;AACH,SAAS,wBAAwB,CAC/B,IAAa,EACb,cAAsB,EACtB,MAA6F,EAC7F,YAAyB;IAEzB,SAAS,KAAK,CAAC,IAAa;QAC1B,IAAI,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YAClE,MAAM,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAA;YACjC,IAAI,CAAC,sBAAsB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACtC,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;gBAC9B,IAAI,IAAI,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;oBAClE,MAAM,QAAQ,GAAG,mBAAmB,CAAC,IAAI,CAAC,UAAU,CAAC,CAAA;oBACrD,IAAI,QAAQ;wBAAE,MAAM,CAAC,QAAQ,CAAC,CAAA;yBACzB,IAAI,YAAY;wBAAE,YAAY,EAAE,CAAA;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QACD,kEAAkE;QAClE,gEAAgE;QAChE,aAAa;QACb,IACE,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC;YACxB,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC;YAC7B,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC,EAC9B,CAAC;YACD,OAAM;QACR,CAAC;QACD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;IAC9B,CAAC;IACD,+DAA+D;IAC/D,uDAAuD;IACvD,IAAI,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,qBAAqB,CAAC,IAAI,CAAC,EAAE,CAAC;QAChG,OAAM;IACR,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,CAAA;AACb,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,oBAAoB,CAC3B,QAA2E,EAC3E,KAAkB,EAClB,UAAwB,IAAI,GAAG,EAAE,EACjC,SAA8B;IAE9B,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC;QAAE,OAAO,KAAK,CAAA;IACvC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;IAErB,MAAM,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAA;IAClC,IAAI,MAAM,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAA;IACrC,MAAM,SAAS,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC,IAAI,CAAA;IACjC,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,SAAS,CAAC,EAAE,CAAC;QAChC,8DAA8D;QAC9D,iEAAiE;QACjE,uDAAuD;QACvD,IAAI,SAAS;YAAE,SAAS,CAAC,KAAK,GAAG,IAAI,CAAA;QACrC,OAAO,KAAK,CAAA;IACd,CAAC;IACD,IAAI,CAAC,QAAQ,CAAC,IAAI;QAAE,OAAO,KAAK,CAAA;IAChC,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAA;IAEzB,YAAY,CAAC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,CAAC,CAAA;IAEtD,kEAAkE;IAClE,mEAAmE;IACnE,iEAAiE;IACjE,+DAA+D;IAC/D,gEAAgE;IAChE,sBAAsB;IACtB,IAAI,SAAS;QAAE,qBAAqB,CAAC,QAAQ,CAAC,IAAI,EAAE,SAAS,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;IAE9E,qEAAqE;IACrE,iEAAiE;IACjE,6DAA6D;IAC7D,kEAAkE;IAClE,8DAA8D;IAC9D,6CAA6C;IAC7C,wBAAwB,CACtB,QAAQ,CAAC,IAAI,EACb,SAAS,CAAC,IAAI,EACd,CAAC,QAAQ,EAAE,EAAE;QACX,oBAAoB,CAAC,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,SAAS,CAAC,CAAA;IAC3D,CAAC,EACD,GAAG,EAAE;QACH,IAAI,SAAS;YAAE,SAAS,CAAC,KAAK,GAAG,IAAI,CAAA;IACvC,CAAC,CACF,CAAA;IAED,OAAO,KAAK,CAAC,IAAI,GAAG,MAAM,CAAA;AAC5B,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,SAAS,qBAAqB,CAAC,IAAa,EAAE,UAAkB,EAAE,GAAuB;IACvF,SAAS,KAAK,CAAC,IAAa;QAC1B,IAAI,GAAG,CAAC,KAAK;YAAE,OAAM;QACrB,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;YACtD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;YAC1B,MAAM,SAAS,GAAG,CAAC,CAAC,MAAM,IAAI,EAAE,CAAC,WAAW,CAAC,MAAM,CAAC,CAAA;YACpD,IAAI,CAAC,SAAS,EAAE,CAAC;gBACf,IAAI,SAAS,GAAG,KAAK,CAAA;gBACrB,IAAI,MAAM,EAAE,CAAC;oBACX,IAAI,EAAE,CAAC,0BAA0B,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;wBACxE,SAAS,GAAG,IAAI,CAAA;oBAClB,CAAC;yBAAM,IAAI,EAAE,CAAC,yBAAyB,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;wBAC9E,SAAS;4BACP,EAAE,CAAC,mBAAmB,CAAC,MAAM,CAAC,kBAAkB,CAAC;gCACjD,EAAE,CAAC,gBAAgB,CAAC,MAAM,CAAC,kBAAkB,CAAC,CAAA;oBAClD,CAAC;yBAAM,IACL,EAAE,CAAC,gBAAgB,CAAC,MAAM,CAAC;wBAC3B,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC;wBAClC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI;wBAC5B,CAAC,sBAAsB,CAAC,GAAG,CAAC,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,EACnD,CAAC;wBACD,2DAA2D;wBAC3D,uDAAuD;wBACvD,2DAA2D;wBAC3D,SAAS,GAAG,IAAI,CAAA;oBAClB,CAAC;gBACH,CAAC;gBACD,IAAI,CAAC,SAAS,EAAE,CAAC;oBACf,GAAG,CAAC,KAAK,GAAG,IAAI,CAAA;oBAChB,OAAM;gBACR,CAAC;YACH,CAAC;QACH,CAAC;QACD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;IAC9B,CAAC;IACD,KAAK,CAAC,IAAI,CAAC,CAAA;AACb,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,MAAM,UAAU,2BAA2B,CAAC,UAAyB;IAInE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;IAC/B,MAAM,SAAS,GAAG,EAAE,KAAK,EAAE,KAAK,EAAE,CAAA;IAElC,SAAS,KAAK,CAAC,IAAa;QAC1B,6DAA6D;QAC7D,IAAI,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9D,IAAI,kBAAkB,CAAC,IAAI,CAAC;gBAAE,oBAAoB,CAAC,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,CAAC,CAAA;QACvF,CAAC;QAED,iEAAiE;QACjE,6DAA6D;QAC7D,+DAA+D;QAC/D,mEAAmE;QACnE,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;YACtD,MAAM,QAAQ,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAA;YAC1C,IAAI,QAAQ;gBAAE,oBAAoB,CAAC,QAAQ,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,CAAC,CAAA;;gBACpE,SAAS,CAAC,KAAK,GAAG,IAAI,CAAA;QAC7B,CAAC;QAED,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;IAC9B,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,CAAA;IACjB,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,CAAC,KAAK,EAAE,CAAA;AAC3C,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,uBAAuB,CAAC,UAAyB;IAC/D,MAAM,IAAI,GAAkB,EAAE,CAAA;IAE9B,SAAS,KAAK,CAAC,IAAa;QAC1B,IAAI,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9D,IAAI,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC7B,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAA;gBAC7B,IAAI,oBAAoB,CAAC,IAAI,EAAE,GAAG,CAAC;oBAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YACrD,CAAC;QACH,CAAC;QAED,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,IAAI,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC;YACtD,MAAM,QAAQ,GAAG,mBAAmB,CAAC,IAAI,CAAC,CAAA;YAC1C,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAA;gBAC7B,IAAI,oBAAoB,CAAC,QAAQ,EAAE,GAAG,CAAC;oBAAE,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;YACzD,CAAC;QACH,CAAC;QAED,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;IAC9B,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,CAAA;IACjB,OAAO,IAAI,CAAA;AACb,CAAC;AAED;;;;;;;;;;;;;;;GAeG;AACH,MAAM,UAAU,WAAW,CACzB,MAAc,EACd,UAAgC;IAMhC,MAAM,UAAU,GAAG,EAAE,CAAC,gBAAgB,CAAC,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC,YAAY,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;IAExF,uCAAuC;IACvC,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,EAAE,CAAC;QAC/B,OAAO,EAAE,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,CAAA;IACxD,CAAC;IAED,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,2BAA2B,CAAC,UAAU,CAAC,CAAA;IACjE,wEAAwE;IACxE,mEAAmE;IACnE,qEAAqE;IACrE,+DAA+D;IAC/D,mEAAmE;IACnE,qEAAqE;IACrE,uBAAuB;IACvB,IAAI,UAAU,EAAE,CAAC;QACf,KAAK,MAAM,CAAC,IAAI,UAAU;YAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;IAC1C,CAAC;IAED,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAA;IACpC,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAA;IACpC,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;YACf,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,KAAK,CAAC,CAAA;QAC1B,CAAC;aAAM,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;YACtB,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAA;QACjC,CAAC;aAAM,CAAC;YACN,+DAA+D;YAC/D,8DAA8D;YAC9D,qBAAqB;YACrB,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;QAClB,CAAC;QACD,KAAK,EAAE,CAAA;IACT,CAAC;IAED,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,CAAA;AAC3B,CAAC;AAED,SAAS,aAAa,CAAC,UAAyB;IAC9C,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,UAAU,EAAE,CAAC;QACzC,IACE,EAAE,CAAC,mBAAmB,CAAC,IAAI,CAAC;YAC5B,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,eAAe,CAAC;YACxC,IAAI,CAAC,eAAe,CAAC,IAAI,KAAK,WAAW,EACzC,CAAC;YACD,OAAO,IAAI,CAAA;QACb,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAa;IAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAA;IAE1B,2CAA2C;IAC3C,IAAI,EAAE,CAAC,gBAAgB,CAAC,MAAM,CAAC,IAAI,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;QAChE,kEAAkE;QAClE,uEAAuE;QACvE,gEAAgE;QAChE,IAAI,EAAE,CAAC,YAAY,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC;YACvC,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,KAAK,MAAM,IAAI,MAAM,CAAC,UAAU,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAC7E,OAAO,KAAK,CAAA;YACd,CAAC;QACH,CAAC;QACD,wFAAwF;QACxF,wEAAwE;QACxE,IAAI,EAAE,CAAC,0BAA0B,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC;YACrD,MAAM,UAAU,GAAG,MAAM,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAA;YAC9C,IAAI,UAAU,KAAK,MAAM,IAAI,UAAU,KAAK,MAAM,EAAE,CAAC;gBACnD,OAAO,IAAI,CAAA;YACb,CAAC;YACD,OAAO,KAAK,CAAA;QACd,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED,0FAA0F;IAC1F,+EAA+E;IAC/E,sEAAsE;IACtE,8EAA8E;IAC9E,IAAI,EAAE,CAAC,oBAAoB,CAAC,MAAM,CAAC,EAAE,CAAC;QACpC,MAAM,GAAG,GAAG,MAAM,CAAC,IAAI,CAAA;QACvB,IAAI,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,EAAE,CAAC;YACzB,+CAA+C;YAC/C,IAAI,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,OAAO,KAAK,CAAA;YAC3C,wDAAwD;YACxD,IAAI,GAAG,CAAC,IAAI,KAAK,KAAK,IAAI,GAAG,CAAC,IAAI,KAAK,MAAM;gBAAE,OAAO,KAAK,CAAA;YAC3D,gDAAgD;YAChD,IAAI,QAAQ,GAAwB,MAAM,CAAC,MAAM,CAAA,CAAC,0BAA0B;YAC5E,OAAO,QAAQ,IAAI,CAAC,EAAE,CAAC,gBAAgB,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAClD,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAA;YAC5B,CAAC;YACD,IAAI,CAAC,QAAQ;gBAAE,OAAO,KAAK,CAAA;YAC3B,MAAM,QAAQ,GAAG,QAA6B,CAAA;YAC9C,6DAA6D;YAC7D,IAAI,EAAE,CAAC,YAAY,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;gBACzC,OAAO,kBAAkB,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;YACzD,CAAC;YACD,kEAAkE;YAClE,mEAAmE;YACnE,yDAAyD;YACzD,gEAAgE;YAChE,+DAA+D;YAC/D,gDAAgD;YAChD,IAAI,EAAE,CAAC,0BAA0B,CAAC,QAAQ,CAAC,UAAU,CAAC,EAAE,CAAC;gBACvD,OAAO,kBAAkB,CAAC,GAAG,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAC9D,CAAC;YACD,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC;AAED,4EAA4E;AAC5E,uEAAuE;AACvE,MAAM,kBAAkB,GAAG,IAAI,GAAG,CAAC;IACjC,kFAAkF;IAClF,GAAG;QACD,GAAG;QACH,MAAM;QACN,SAAS;QACT,OAAO;QACP,GAAG;QACH,YAAY;QACZ,IAAI;QACJ,QAAQ;QACR,QAAQ;QACR,MAAM;QACN,IAAI;QACJ,SAAS;QACT,QAAQ;QACR,KAAK;QACL,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,UAAU;QACV,YAAY;QACZ,QAAQ;QACR,QAAQ;QACR,MAAM;QACN,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,QAAQ;QACR,IAAI;QACJ,GAAG;QACH,QAAQ;QACR,KAAK;QACL,OAAO;QACP,OAAO;QACP,QAAQ;QACR,IAAI;QACJ,MAAM;QACN,MAAM;QACN,KAAK;QACL,IAAI;QACJ,UAAU;QACV,QAAQ;QACR,QAAQ;QACR,GAAG;QACH,KAAK;QACL,UAAU;QACV,SAAS;QACT,QAAQ;QACR,OAAO;QACP,MAAM;QACN,QAAQ;QACR,KAAK;QACL,SAAS;QACT,KAAK;QACL,OAAO;QACP,OAAO;QACP,IAAI;QACJ,UAAU;QACV,OAAO;QACP,IAAI;QACJ,OAAO;QACP,MAAM;QACN,IAAI;QACJ,IAAI;QACJ,OAAO;KACR;IACD,wBAAwB;IACxB,MAAM;IACN,QAAQ;IACR,OAAO;IACP,MAAM;IACN,MAAM;IACN,QAAQ;IACR,SAAS;IACT,OAAO;IACP,eAAe;IACf,sEAAsE;IACtE,qEAAqE;IACrE,gEAAgE;IAChE,iEAAiE;IACjE,8BAA8B;IAC9B,OAAO;CACR,CAAC,CAAA;AAEF;;;;;GAKG;AACH,SAAS,YAAY,CAAC,IAAa,EAAE,SAAiB,EAAE,OAAe,EAAE,KAAkB;IACzF,IAAI,EAAE,CAAC,0BAA0B,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,oDAAoD;QACpD,IAAI,EAAE,CAAC,0BAA0B,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/C,mCAAmC;QACrC,CAAC;QACD,mEAAmE;aAC9D,IAAI,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;YAC7E,yDAAyD;YACzD,gEAAgE;YAChE,IAAI,EAAE,CAAC,0BAA0B,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;gBACnD,MAAM,KAAK,GAAG,oBAAoB,CAAC,IAAI,CAAC,UAAU,EAAE,SAAS,CAAC,CAAA;gBAC9D,IAAI,KAAK;oBAAE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;YAC7B,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,KAAK,GAAG,oBAAoB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;YACnD,IAAI,KAAK,EAAE,CAAC;gBACV,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;YAClB,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,EAAE,CAAC,yBAAyB,CAAC,IAAI,CAAC,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,oBAAoB,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;QACnD,IAAI,KAAK,EAAE,CAAC;YACV,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QAClB,CAAC;IACH,CAAC;IAED,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC,CAAA;AAClF,CAAC;AAED;;;;GAIG;AACH,SAAS,oBAAoB,CAAC,IAAiC,EAAE,SAAiB;IAChF,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,IAAI,OAAO,GAAkB,IAAI,CAAA;IAEjC,OAAO,EAAE,CAAC,0BAA0B,CAAC,OAAO,CAAC,EAAE,CAAC;QAC9C,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAChC,OAAO,GAAG,OAAO,CAAC,UAAU,CAAA;IAC9B,CAAC;IAED,uCAAuC;IACvC,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC5D,OAAO,IAAI,CAAA;IACb,CAAC;IAED,mBAAmB;IACnB,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrB,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;IACpC,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AACxB,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAAC,IAAgC,EAAE,SAAiB;IAC/E,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,KAAK,SAAS,EAAE,CAAC;QAC5E,OAAO,IAAI,CAAA;IACb,CAAC;IAED,IAAI,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,kBAAkB,CAAC,EAAE,CAAC;QAChD,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,CAAA;IACrC,CAAC;IAED,OAAO,IAAI,CAAA;AACb,CAAC","sourcesContent":["import ts from 'typescript'\nimport { resolveAccessorBody } from './accessor-resolver.js'\n\n/**\n * Names whose first arg is itself a reactive accessor (the existing\n * arrow walker handles them) or which are explicitly excluded\n * (sample/item read state imperatively / per-row, not as state\n * accessors). When a delegating accessor's body contains a call to one\n * of these, we don't follow it — recursion is reserved for \"this is\n * just a thin wrapper that hands the state to another local helper.\"\n */\nconst NON_DELEGATION_HELPERS = new Set(['sample', 'item', 'memo', 'text', 'unsafeHtml'])\n\n/**\n * Walk a delegating accessor's body looking for calls to OTHER local\n * functions that take the state param verbatim — `helper(s)` where\n * `s` matches the outer accessor's param name. For each, hand the\n * resolved declaration back so the caller can recurse into its body.\n *\n * Skips:\n *   - Framework helpers (`memo`, `text`, etc.) — their arrow args are\n *     visited by the top-level arrow walker; we'd double-count.\n *   - Method calls (`s.items.filter(...)`) — the callee is a builtin,\n *     not a local function we can resolve.\n *   - Nested function bodies — params inside a `(item) => …` shadow\n *     ours, so a `helper(s)` deep in there isn't (necessarily)\n *     handing OUR state in. Conservative: don't recurse through\n *     lambda boundaries.\n */\nfunction visitTopLevelDelegations(\n  body: ts.Node,\n  stateParamName: string,\n  follow: (resolved: ts.ArrowFunction | ts.FunctionExpression | ts.FunctionDeclaration) => void,\n  onUnresolved?: () => void,\n): void {\n  function visit(node: ts.Node): void {\n    if (ts.isCallExpression(node) && ts.isIdentifier(node.expression)) {\n      const name = node.expression.text\n      if (!NON_DELEGATION_HELPERS.has(name)) {\n        const arg0 = node.arguments[0]\n        if (arg0 && ts.isIdentifier(arg0) && arg0.text === stateParamName) {\n          const resolved = resolveAccessorBody(node.expression)\n          if (resolved) follow(resolved)\n          else if (onUnresolved) onUnresolved()\n        }\n      }\n    }\n    // Don't descend into nested function bodies — their params shadow\n    // ours, and any call inside them isn't unambiguously delegating\n    // our state.\n    if (\n      ts.isArrowFunction(node) ||\n      ts.isFunctionExpression(node) ||\n      ts.isFunctionDeclaration(node)\n    ) {\n      return\n    }\n    ts.forEachChild(node, visit)\n  }\n  // If the body itself is a function, there's nothing at the top\n  // level to inspect — its own body is a separate scope.\n  if (ts.isArrowFunction(body) || ts.isFunctionExpression(body) || ts.isFunctionDeclaration(body)) {\n    return\n  }\n  visit(body)\n}\n\n/**\n * Extract paths from a callable accessor (arrow / fn-expr / fn-decl)\n * into the given set. Recurses through call-delegations to other local\n * helpers so that `(s) => filtered(s)` / `(s) => { void s.x; return\n * inner(s) }` correctly contribute the helper's state-path reads.\n * Without recursion the precise mask under-counts — fields read only\n * via the helper drop off the bitmask, and any sibling reactive\n * accessor that reads them produces a non-zero `dirty` that AND'd with\n * the narrow each.__mask is zero, silently skipping the reconcile.\n *\n * `visited` breaks cycles on mutually-recursive helpers — terminates\n * the walk; doesn't try to be precise about what such helpers read.\n */\nfunction extractAccessorPaths(\n  accessor: ts.ArrowFunction | ts.FunctionExpression | ts.FunctionDeclaration,\n  paths: Set<string>,\n  visited: Set<ts.Node> = new Set(),\n  opaqueOut?: { value: boolean },\n): boolean {\n  if (visited.has(accessor)) return false\n  visited.add(accessor)\n\n  const params = accessor.parameters\n  if (params.length !== 1) return false\n  const paramName = params[0]!.name\n  if (!ts.isIdentifier(paramName)) {\n    // Destructured/anonymous param — the path walker can't follow\n    // reads through it. Conservative: mark the accessor as opaque so\n    // the synthesis pipeline emits a whole-state sentinel.\n    if (opaqueOut) opaqueOut.value = true\n    return false\n  }\n  if (!accessor.body) return false\n  const before = paths.size\n\n  extractPaths(accessor.body, paramName.text, '', paths)\n\n  // Detect opaque state flow alongside path extraction. Mirrors the\n  // classifier in `transform.ts`'s `computeAccessorMask` (Identifier\n  // `s` used in a non-tracked position) — any leak means a precise\n  // `__prefixes` table is insufficient because a field read only\n  // through the leak never enters fieldBits and the runtime can't\n  // dirty it on change.\n  if (opaqueOut) detectOpaqueStateFlow(accessor.body, paramName.text, opaqueOut)\n\n  // Follow delegations: `(s) => helper(s)` — extract `helper`'s body's\n  // state paths too. Reuses the `visited` set across the recursion\n  // chain so cycles terminate. When the callee is unresolvable\n  // (function parameter, import, destructured), the same logic that\n  // forces FULL_MASK in `computeAccessorMask` flags the file as\n  // opaque here, so the sentinel gets emitted.\n  visitTopLevelDelegations(\n    accessor.body,\n    paramName.text,\n    (resolved) => {\n      extractAccessorPaths(resolved, paths, visited, opaqueOut)\n    },\n    () => {\n      if (opaqueOut) opaqueOut.value = true\n    },\n  )\n\n  return paths.size > before\n}\n\n/**\n * Mirror of the classifier in `computeAccessorMask` (transform.ts). An\n * accessor \"leaks state\" — and so demands the conservative\n * FULL_MASK / whole-state sentinel — when the state identifier `s`\n * appears in any position OTHER than:\n *   - the param binding itself\n *   - the root of `s.x.y…` (PropertyAccessExpression)\n *   - the root of `s['literal']` / `s[0]` (ElementAccess with literal key)\n *   - arg0 of `helper(s)` with an Identifier callee (handled by the\n *     delegation visitor — resolvable → recursion, unresolvable →\n *     marks opaque via the callback)\n *\n * Every other context (NewExpression arg, TaggedTemplate span, spread,\n * const-alias, conditional branch, method-call arg, dynamic key\n * `s[expr]`, return-the-whole-state, …) is treated as a leak.\n */\nfunction detectOpaqueStateFlow(body: ts.Node, stateParam: string, out: { value: boolean }): void {\n  function visit(node: ts.Node): void {\n    if (out.value) return\n    if (ts.isIdentifier(node) && node.text === stateParam) {\n      const parent = node.parent\n      const isBinding = !!parent && ts.isParameter(parent)\n      if (!isBinding) {\n        let isTracked = false\n        if (parent) {\n          if (ts.isPropertyAccessExpression(parent) && parent.expression === node) {\n            isTracked = true\n          } else if (ts.isElementAccessExpression(parent) && parent.expression === node) {\n            isTracked =\n              ts.isStringLiteralLike(parent.argumentExpression) ||\n              ts.isNumericLiteral(parent.argumentExpression)\n          } else if (\n            ts.isCallExpression(parent) &&\n            ts.isIdentifier(parent.expression) &&\n            parent.arguments[0] === node &&\n            !NON_DELEGATION_HELPERS.has(parent.expression.text)\n          ) {\n            // The delegation visitor either recurses into the resolved\n            // body (transitively detecting opaque inside) or flags\n            // opaque via its second callback for unresolvable callees.\n            isTracked = true\n          }\n        }\n        if (!isTracked) {\n          out.value = true\n          return\n        }\n      }\n    }\n    ts.forEachChild(node, visit)\n  }\n  visit(body)\n}\n\n/**\n * Walk the AST and collect every unique state access path referenced by\n * a reactive accessor. A reactive accessor is one of:\n *\n *   - An inline arrow / function expression at a reactive position\n *     (`text(s => s.count)`, `div({ title: s => s.title })`,\n *     `show({ when: s => s.gated })`, etc.).\n *   - An Identifier at a reactive position that resolves to a callable\n *     in this file — a const-bound arrow / function expression,\n *     a hoisted function declaration, or `const x = memo(arrow)`.\n *\n * The second case lets authors refactor a literal arrow into a named\n * helper without losing the reactive-mask optimization (a precise mask\n * for `__dirty` and structural-primitive `__mask`). Without it, the\n * runtime falls back to FULL_MASK — correct, but every binding fires\n * on every state change.\n *\n * Shared by the bit-assignment path (`collectDeps`, below) and the\n * `diagnostics.ts` bitmask-overflow warning.\n */\nexport function collectStatePathsFromSource(sourceFile: ts.SourceFile): {\n  paths: Set<string>\n  opaque: boolean\n} {\n  const paths = new Set<string>()\n  const opaqueOut = { value: false }\n\n  function visit(node: ts.Node): void {\n    // Inline arrow / function expression at a reactive position.\n    if (ts.isArrowFunction(node) || ts.isFunctionExpression(node)) {\n      if (isReactiveAccessor(node)) extractAccessorPaths(node, paths, undefined, opaqueOut)\n    }\n\n    // Identifier at a reactive position — resolve to its declaration\n    // and extract paths from the resolved body. Identifiers that\n    // resolve elsewhere (imports, etc.) leave a binding the walker\n    // can't see — treat the host file as opaque so the sentinel fires.\n    if (ts.isIdentifier(node) && isReactiveAccessor(node)) {\n      const resolved = resolveAccessorBody(node)\n      if (resolved) extractAccessorPaths(resolved, paths, undefined, opaqueOut)\n      else opaqueOut.value = true\n    }\n\n    ts.forEachChild(node, visit)\n  }\n\n  visit(sourceFile)\n  return { paths, opaque: opaqueOut.value }\n}\n\n/**\n * Per-accessor path sets — one entry per reactive arrow/function. Used\n * by the bitmask-overflow diagnostic to find clusters of paths that\n * always fire together (co-occurrence analysis).\n */\nexport function collectAccessorPathSets(sourceFile: ts.SourceFile): Set<string>[] {\n  const sets: Set<string>[] = []\n\n  function visit(node: ts.Node): void {\n    if (ts.isArrowFunction(node) || ts.isFunctionExpression(node)) {\n      if (isReactiveAccessor(node)) {\n        const set = new Set<string>()\n        if (extractAccessorPaths(node, set)) sets.push(set)\n      }\n    }\n\n    if (ts.isIdentifier(node) && isReactiveAccessor(node)) {\n      const resolved = resolveAccessorBody(node)\n      if (resolved) {\n        const set = new Set<string>()\n        if (extractAccessorPaths(resolved, set)) sets.push(set)\n      }\n    }\n\n    ts.forEachChild(node, visit)\n  }\n\n  visit(sourceFile)\n  return sets\n}\n\n/**\n * Pre-scan a source file to collect all unique state access paths\n * referenced by reactive accessors (arrow functions in props and text() calls).\n *\n * Returns a pair of maps:\n *   - `lo`: paths at bit positions 0..30, with value `1 << position`\n *   - `hi`: paths at bit positions 31..61, with value `1 << (position - 31)`\n *\n * Bit positions past 61 collapse to `-1` (FULL_MASK) in the `lo` map and\n * cause every binding reading them to re-evaluate on every cycle. The\n * `bitmask-overflow` lint rule warns the user to restructure state.\n *\n * Components with ≤31 paths see an empty `hi` map; the compiler skips\n * all high-word emit so the generated code is byte-identical to the\n * pre-multi-word baseline.\n */\nexport function collectDeps(\n  source: string,\n  extraPaths?: ReadonlySet<string>,\n): {\n  lo: Map<string, number>\n  hi: Map<string, number>\n  opaque: boolean\n} {\n  const sourceFile = ts.createSourceFile('input.ts', source, ts.ScriptTarget.Latest, true)\n\n  // Check if file imports from @llui/dom\n  if (!hasLluiImport(sourceFile)) {\n    return { lo: new Map(), hi: new Map(), opaque: false }\n  }\n\n  const { paths, opaque } = collectStatePathsFromSource(sourceFile)\n  // Cross-file extension (v2c pipeline integration): the host adapter may\n  // pass paths discovered by `crossFileAccessorPaths()` — paths read\n  // through in-repo view-helpers in *other* files. Union them with the\n  // file-local set before bit assignment. Without this merge the\n  // sentinel-`show()` workaround from v2b §1 remains necessary; with\n  // it, helpers in other files contribute to the consumer's __prefixes\n  // table automatically.\n  if (extraPaths) {\n    for (const p of extraPaths) paths.add(p)\n  }\n\n  const lo = new Map<string, number>()\n  const hi = new Map<string, number>()\n  let index = 0\n  for (const path of paths) {\n    if (index < 31) {\n      lo.set(path, 1 << index)\n    } else if (index < 62) {\n      hi.set(path, 1 << (index - 31))\n    } else {\n      // Past 61 paths — graceful FULL_MASK fallback in the low word.\n      // Realistic LLui components shouldn't hit this; the lint rule\n      // fires well before.\n      lo.set(path, -1)\n    }\n    index++\n  }\n\n  return { lo, hi, opaque }\n}\n\nfunction hasLluiImport(sourceFile: ts.SourceFile): boolean {\n  for (const stmt of sourceFile.statements) {\n    if (\n      ts.isImportDeclaration(stmt) &&\n      ts.isStringLiteral(stmt.moduleSpecifier) &&\n      stmt.moduleSpecifier.text === '@llui/dom'\n    ) {\n      return true\n    }\n  }\n  return false\n}\n\n/**\n * Determines if a node is at a reactive-accessor position — either an\n * inline arrow / function expression OR an identifier that's about to\n * be resolved to one. The check is identity-based on `parent.arguments[0]`\n * etc., so the same logic works for both shapes.\n *\n * Exported so the cross-file walker can use the same gate. Without this\n * gate the walker descends into every 1-param arrow in the file —\n * including `onEffect: (bag) => bag.send(...)` — and pollutes\n * `__prefixes` with non-state property names (issue #5, bug 3).\n */\nexport function isReactiveAccessor(node: ts.Node): boolean {\n  const parent = node.parent\n\n  // text(s => s.count) — first arg to a call\n  if (ts.isCallExpression(parent) && parent.arguments[0] === node) {\n    // Skip item(t => t.id) — per-item selectors inside each() render.\n    // Skip sample(s => s.x) — imperative one-shot read, no binding created\n    // (both the top-level import and the destructured-from-h form).\n    if (ts.isIdentifier(parent.expression)) {\n      if (parent.expression.text === 'item' || parent.expression.text === 'sample') {\n        return false\n      }\n    }\n    // Skip array method callbacks: .filter(t => ...), .map(t => ...), .some(t => ...), etc.\n    // Allow view-helper primitive calls: h.text(s => ...), h.memo(s => ...)\n    if (ts.isPropertyAccessExpression(parent.expression)) {\n      const methodName = parent.expression.name.text\n      if (methodName === 'text' || methodName === 'memo') {\n        return true\n      }\n      return false\n    }\n    return true\n  }\n\n  // div({ title: s => s.title }) — value in a property assignment inside an object literal.\n  // Only treat as reactive if the containing call is a known framework API whose\n  // properties are reactive accessors. Otherwise user-land helpers like\n  // sliceHandler({ narrow: (m) => m.type === ... }) would pollute the path set.\n  if (ts.isPropertyAssignment(parent)) {\n    const key = parent.name\n    if (ts.isIdentifier(key)) {\n      // Skip event handlers (onClick, onInput, etc.)\n      if (/^on[A-Z]/.test(key.text)) return false\n      // Skip each() key function and other non-reactive props\n      if (key.text === 'key' || key.text === 'name') return false\n      // Walk up to find the enclosing call expression\n      let ancestor: ts.Node | undefined = parent.parent // ObjectLiteralExpression\n      while (ancestor && !ts.isCallExpression(ancestor)) {\n        ancestor = ancestor.parent\n      }\n      if (!ancestor) return false\n      const callExpr = ancestor as ts.CallExpression\n      // Bare identifier: `scope({on: …})`, `div({title: …})`, etc.\n      if (ts.isIdentifier(callExpr.expression)) {\n        return REACTIVE_API_NAMES.has(callExpr.expression.text)\n      }\n      // Method-call form: `h.scope({on: …})`, `h.show({when: …})`, etc.\n      // The docs and View bag promote this shape; without recognizing it\n      // here, paths read ONLY through a structural primitive's\n      // `on`/`when`/`items` accessor never enter `__prefixes`, so the\n      // runtime dirty mask can't see changes to those fields and the\n      // structural block silently fails to reconcile.\n      if (ts.isPropertyAccessExpression(callExpr.expression)) {\n        return REACTIVE_API_NAMES.has(callExpr.expression.name.text)\n      }\n      return false\n    }\n  }\n\n  return false\n}\n\n// Framework APIs whose object-literal arguments contain reactive accessors.\n// Arrow functions in property values of these calls are state-tracked.\nconst REACTIVE_API_NAMES = new Set([\n  // Element helpers (see ELEMENT_HELPERS in transform.ts — we keep a superset here)\n  ...[\n    'a',\n    'abbr',\n    'article',\n    'aside',\n    'b',\n    'blockquote',\n    'br',\n    'button',\n    'canvas',\n    'code',\n    'dd',\n    'details',\n    'dialog',\n    'div',\n    'dl',\n    'dt',\n    'em',\n    'fieldset',\n    'figcaption',\n    'figure',\n    'footer',\n    'form',\n    'h1',\n    'h2',\n    'h3',\n    'h4',\n    'h5',\n    'h6',\n    'header',\n    'hr',\n    'i',\n    'iframe',\n    'img',\n    'input',\n    'label',\n    'legend',\n    'li',\n    'main',\n    'mark',\n    'nav',\n    'ol',\n    'optgroup',\n    'option',\n    'output',\n    'p',\n    'pre',\n    'progress',\n    'section',\n    'select',\n    'small',\n    'span',\n    'strong',\n    'sub',\n    'summary',\n    'sup',\n    'table',\n    'tbody',\n    'td',\n    'textarea',\n    'tfoot',\n    'th',\n    'thead',\n    'time',\n    'tr',\n    'ul',\n    'video',\n  ],\n  // Structural primitives\n  'each',\n  'branch',\n  'scope',\n  'show',\n  'memo',\n  'portal',\n  'foreign',\n  'child',\n  'errorBoundary',\n  // track({ deps: (s) => [...] }) — explicit reactivity declaration for\n  // paths static analysis can't infer. The compiler treats `deps` as a\n  // reactive accessor so its paths fold into the host component's\n  // __prefixes; the call expression is then stripped from emission\n  // (see transform.ts). v2b §3.\n  'track',\n])\n\n/**\n * Extract state access paths from an expression body.\n * Handles:\n * - Direct property access: param.field, param.field.subfield\n * - Bracket notation with string literal: param['field']\n */\nfunction extractPaths(node: ts.Node, paramName: string, _prefix: string, paths: Set<string>): void {\n  if (ts.isPropertyAccessExpression(node)) {\n    // Skip if this is an intermediate in a deeper chain\n    if (ts.isPropertyAccessExpression(node.parent)) {\n      // handled when the leaf is visited\n    }\n    // Skip if this is the callee of a method call: s.todos.filter(...)\n    else if (ts.isCallExpression(node.parent) && node.parent.expression === node) {\n      // It's a method call — record the object, not the method\n      // e.g. s.todos.filter(...) → record 'todos', not 'todos.filter'\n      if (ts.isPropertyAccessExpression(node.expression)) {\n        const chain = resolvePropertyChain(node.expression, paramName)\n        if (chain) paths.add(chain)\n      }\n    } else {\n      const chain = resolvePropertyChain(node, paramName)\n      if (chain) {\n        paths.add(chain)\n      }\n    }\n  }\n\n  if (ts.isElementAccessExpression(node)) {\n    const chain = resolveElementAccess(node, paramName)\n    if (chain) {\n      paths.add(chain)\n    }\n  }\n\n  ts.forEachChild(node, (child) => extractPaths(child, paramName, _prefix, paths))\n}\n\n/**\n * Resolve a property access chain like s.user.name to \"user.name\".\n * Returns null if the chain doesn't start with the state parameter.\n * Stops at depth 2.\n */\nfunction resolvePropertyChain(node: ts.PropertyAccessExpression, paramName: string): string | null {\n  const parts: string[] = []\n  let current: ts.Expression = node\n\n  while (ts.isPropertyAccessExpression(current)) {\n    parts.unshift(current.name.text)\n    current = current.expression\n  }\n\n  // The root must be the state parameter\n  if (!ts.isIdentifier(current) || current.text !== paramName) {\n    return null\n  }\n\n  // Limit to depth 2\n  if (parts.length > 2) {\n    return parts.slice(0, 2).join('.')\n  }\n\n  return parts.join('.')\n}\n\n/**\n * Resolve bracket access with string literal: s['count'] → \"count\"\n */\nfunction resolveElementAccess(node: ts.ElementAccessExpression, paramName: string): string | null {\n  if (!ts.isIdentifier(node.expression) || node.expression.text !== paramName) {\n    return null\n  }\n\n  if (ts.isStringLiteral(node.argumentExpression)) {\n    return node.argumentExpression.text\n  }\n\n  return null\n}\n"]}

package/dist/cross-file-walker.d.ts

@@ -69,5 +69,8 @@ export declare function toCanonicalDiagnostic(d: WalkerDiagnostic, sourceText: s
  * including `onEffect: (bag) => bag.send(...)`, where `bag.send` ends
  * up in the path set as a phantom "send" prefix. Issue #5, bug 3.
  */
-export declare function crossFileAccessorPaths(program: ts.Program, focalFile: ts.SourceFile): Set<string>;
+export declare function crossFileAccessorPaths(program: ts.Program, focalFile: ts.SourceFile): {
+    paths: Set<string>;
+    opaque: boolean;
+};
 //# sourceMappingURL=cross-file-walker.d.ts.map

package/dist/cross-file-walker.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"cross-file-walker.d.ts","sourceRoot":"","sources":["../src/cross-file-walker.ts"],"names":[],"mappings":"AAyBA,OAAO,EAAE,MAAM,YAAY,CAAA;AAC3B,OAAO,EACL,KAAK,UAAU,EAKhB,MAAM,iBAAiB,CAAA;AAGxB,MAAM,MAAM,cAAc,GAAG,QAAQ,GAAG,QAAQ,GAAG,OAAO,GAAG,cAAc,CAAA;AAE3E,MAAM,WAAW,wBAAwB;IACvC,IAAI,EAAE,cAAc,CAAA;IACpB,oEAAoE;IACpE,KAAK,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;IACvB,6BAA6B;IAC7B,MAAM,EAAE,MAAM,CAAA;CACf;AAED,MAAM,MAAM,YAAY,GAAG,uBAAuB,GAAG,wBAAwB,GAAG,mBAAmB,CAAA;AAEnG,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,YAAY,CAAA;IAChB,IAAI,EAAE,MAAM,CAAA;IACZ,GAAG,EAAE,MAAM,CAAA;IACX,GAAG,EAAE,MAAM,CAAA;IACX,OAAO,EAAE,MAAM,CAAA;IACf,UAAU,EAAE,MAAM,GAAG,SAAS,CAAA;CAC/B;AAED,MAAM,WAAW,YAAY;IAC3B,WAAW,EAAE,gBAAgB,EAAE,CAAA;IAC/B,qCAAqC;IACrC,OAAO,EAAE,GAAG,CACV,MAAM,EACN;QACE,eAAe,EAAE,MAAM,CAAA;QACvB,MAAM,EAAE,MAAM,CAAA;QACd,MAAM,EAAE,MAAM,CAAA;QACd,KAAK,EAAE,MAAM,CAAA;QACb,UAAU,EAAE,MAAM,CAAA;KACnB,CACF,CAAA;CACF;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,EAAE,CAAC,MAAM,EACjB,OAAO,EAAE,EAAE,CAAC,WAAW,GACtB,wBAAwB,CA0D1B;AA8LD;;;;GAIG;AACH,wBAAgB,WAAW,CACzB,OAAO,EAAE,EAAE,CAAC,OAAO,EACnB,OAAO,GAAE;IAAE,MAAM,CAAC,EAAE,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,KAAK,OAAO,CAAA;CAAO,GAChE,YAAY,CA0Dd;AA6CD;;;;GAIG;AACH,wBAAgB,qBAAqB,CACnC,CAAC,EAAE,gBAAgB,EACnB,UAAU,EAAE,MAAM,EAClB,WAAW,EAAE,MAAM,GAClB,UAAU,CAaZ;AAoBD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,sBAAsB,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,EAAE,SAAS,EAAE,EAAE,CAAC,UAAU,GAAG,GAAG,CAAC,MAAM,CAAC,CA8BjG"}
+{"version":3,"file":"cross-file-walker.d.ts","sourceRoot":"","sources":["../src/cross-file-walker.ts"],"names":[],"mappings":"AAyBA,OAAO,EAAE,MAAM,YAAY,CAAA;AAC3B,OAAO,EACL,KAAK,UAAU,EAKhB,MAAM,iBAAiB,CAAA;AAGxB,MAAM,MAAM,cAAc,GAAG,QAAQ,GAAG,QAAQ,GAAG,OAAO,GAAG,cAAc,CAAA;AAE3E,MAAM,WAAW,wBAAwB;IACvC,IAAI,EAAE,cAAc,CAAA;IACpB,oEAAoE;IACpE,KAAK,EAAE,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAA;IACvB,6BAA6B;IAC7B,MAAM,EAAE,MAAM,CAAA;CACf;AAED,MAAM,MAAM,YAAY,GAAG,uBAAuB,GAAG,wBAAwB,GAAG,mBAAmB,CAAA;AAEnG,MAAM,WAAW,gBAAgB;IAC/B,EAAE,EAAE,YAAY,CAAA;IAChB,IAAI,EAAE,MAAM,CAAA;IACZ,GAAG,EAAE,MAAM,CAAA;IACX,GAAG,EAAE,MAAM,CAAA;IACX,OAAO,EAAE,MAAM,CAAA;IACf,UAAU,EAAE,MAAM,GAAG,SAAS,CAAA;CAC/B;AAED,MAAM,WAAW,YAAY;IAC3B,WAAW,EAAE,gBAAgB,EAAE,CAAA;IAC/B,qCAAqC;IACrC,OAAO,EAAE,GAAG,CACV,MAAM,EACN;QACE,eAAe,EAAE,MAAM,CAAA;QACvB,MAAM,EAAE,MAAM,CAAA;QACd,MAAM,EAAE,MAAM,CAAA;QACd,KAAK,EAAE,MAAM,CAAA;QACb,UAAU,EAAE,MAAM,CAAA;KACnB,CACF,CAAA;CACF;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,EAAE,CAAC,MAAM,EACjB,OAAO,EAAE,EAAE,CAAC,WAAW,GACtB,wBAAwB,CA0D1B;AA8LD;;;;GAIG;AACH,wBAAgB,WAAW,CACzB,OAAO,EAAE,EAAE,CAAC,OAAO,EACnB,OAAO,GAAE;IAAE,MAAM,CAAC,EAAE,CAAC,UAAU,EAAE,EAAE,CAAC,UAAU,KAAK,OAAO,CAAA;CAAO,GAChE,YAAY,CA0Dd;AA6CD;;;;GAIG;AACH,wBAAgB,qBAAqB,CACnC,CAAC,EAAE,gBAAgB,EACnB,UAAU,EAAE,MAAM,EAClB,WAAW,EAAE,MAAM,GAClB,UAAU,CAaZ;AAoBD;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,sBAAsB,CACpC,OAAO,EAAE,EAAE,CAAC,OAAO,EACnB,SAAS,EAAE,EAAE,CAAC,UAAU,GACvB;IAAE,KAAK,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IAAC,MAAM,EAAE,OAAO,CAAA;CAAE,CA+BzC"}

package/dist/cross-file-walker.js

@@ -418,6 +418,7 @@ export function toCanonicalDiagnostic(d, sourceText, projectRoot) {
 export function crossFileAccessorPaths(program, focalFile) {
     const checker = program.getTypeChecker();
     const paths = new Set();
+    const opaqueOut = { value: false };
     const visitedHelpers = new Set();
     const isViewHelperCallArg0 = (arrow) => {
         const parent = arrow.parent;
@@ -436,14 +437,14 @@ export function crossFileAccessorPaths(program, focalFile) {
             const p0 = node.parameters[0];
             if (ts.isIdentifier(p0.name) && node.body) {
                 if (isReactiveAccessor(node) || isViewHelperCallArg0(node)) {
-                    walkAccessorBody(node.body, p0.name.text, paths, checker, visitedHelpers);
+                    walkAccessorBody(node.body, p0.name.text, paths, checker, visitedHelpers, opaqueOut);
                 }
             }
         }
         ts.forEachChild(node, visit);
     };
     visit(focalFile);
-    return paths;
+    return { paths, opaque: opaqueOut.value };
 }
 // Helpers whose arrow args are NOT state accessors — same exclusion list
 // the file-local walker uses (collect-deps.ts § NON_DELEGATION_HELPERS).
@@ -452,7 +453,7 @@ export function crossFileAccessorPaths(program, focalFile) {
 // `unsafeHtml` already have their inline arrow walked by the top-level
 // visitor — we'd double-count if we recursed through the call again.
 const NON_DELEGATION_CALLEES = new Set(['sample', 'item', 'memo', 'text', 'unsafeHtml']);
-function walkAccessorBody(body, paramName, paths, checker, visitedHelpers) {
+function walkAccessorBody(body, paramName, paths, checker, visitedHelpers, opaqueOut) {
     const visit = (node) => {
         // Property-chain extraction (mirrors collect-deps' depth-2 normaliser).
         if (ts.isPropertyAccessExpression(node)) {
@@ -460,6 +461,43 @@ function walkAccessorBody(body, paramName, paths, checker, visitedHelpers) {
             if (chain)
                 paths.add(chain);
         }
+        // Opaque-state-flow classifier (mirrors the per-binding mask
+        // classifier in transform.ts:computeAccessorMask). Any standalone
+        // appearance of the param identifier in a non-tracked container
+        // means the helper reads through an expression we can't trace, so
+        // a precise prefix table is insufficient — the host needs a
+        // whole-state sentinel in `__prefixes`.
+        if (ts.isIdentifier(node) && node.text === paramName) {
+            const parent = node.parent;
+            const isBinding = !!parent && ts.isParameter(parent);
+            if (!isBinding) {
+                let isTracked = false;
+                if (parent) {
+                    if (ts.isPropertyAccessExpression(parent) && parent.expression === node) {
+                        isTracked = true;
+                    }
+                    else if (ts.isElementAccessExpression(parent) && parent.expression === node) {
+                        isTracked =
+                            ts.isStringLiteralLike(parent.argumentExpression) ||
+                                ts.isNumericLiteral(parent.argumentExpression);
+                    }
+                    else if (ts.isCallExpression(parent) &&
+                        ts.isIdentifier(parent.expression) &&
+                        parent.arguments[0] === node &&
+                        !NON_DELEGATION_CALLEES.has(parent.expression.text)) {
+                        // Identifier-callee delegations are handled by the
+                        // descend-into-helper branch below — if the callee
+                        // resolves, recursion finds opaque inside; if not, the
+                        // call's `sym` is undefined and the host sees no descent.
+                        // Treat as tracked here so this branch alone doesn't flip
+                        // opaque on every well-formed `helper(s)`.
+                        isTracked = true;
+                    }
+                }
+                if (!isTracked)
+                    opaqueOut.value = true;
+            }
+        }
         if (ts.isCallExpression(node)) {
             const callee = node.expression;
             const sym = resolveAliasedSymbol(callee, checker);
@@ -471,7 +509,7 @@ function walkAccessorBody(body, paramName, paths, checker, visitedHelpers) {
                     // into our state, identifier args pass our state through).
                     visitedHelpers.add(decl);
                     descendIntoHelper(decl, node, paramName, paths, checker, visitedHelpers, 
-                    /*viewHelper*/ true);
+                    /*viewHelper*/ true, opaqueOut);
                 }
                 else if (decl && !visitedHelpers.has(decl)) {
                     // Non-view-helper: only follow if our state param is passed
@@ -490,10 +528,35 @@ function walkAccessorBody(body, paramName, paths, checker, visitedHelpers) {
                         !NON_DELEGATION_CALLEES.has(callee.text) &&
                         callPassesParamIdent(node, paramName)) {
                         visitedHelpers.add(decl);
-                        descendIntoHelper(decl, node, paramName, paths, checker, visitedHelpers, 
-                        /*viewHelper*/ false);
+                        const fnDecl = decl;
+                        if (fnDecl.body) {
+                            descendIntoHelper(decl, node, paramName, paths, checker, visitedHelpers, 
+                            /*viewHelper*/ false, opaqueOut);
+                        }
+                        else {
+                            // Declaration without a body — ambient `declare function`,
+                            // overload signature, or compiled .d.ts. State flows in
+                            // but we can't see what it reads. Conservative: opaque.
+                            opaqueOut.value = true;
+                        }
                     }
                 }
+                else if (!decl && ts.isIdentifier(callee) && !NON_DELEGATION_CALLEES.has(callee.text)) {
+                    // Callee resolved to a symbol but no function-like
+                    // declaration (e.g., ambient declaration, type-only import,
+                    // or a binding whose initializer the checker can't pin
+                    // down). If state flows in, treat as opaque — same
+                    // conservative read as the file-local classifier.
+                    if (callPassesParamIdent(node, paramName))
+                        opaqueOut.value = true;
+                }
+            }
+            else if (ts.isIdentifier(callee) && !NON_DELEGATION_CALLEES.has(callee.text)) {
+                // Callee identifier didn't resolve to ANY symbol (declared
+                // outside the program, lost through transient binding, etc.).
+                // The standalone `s` classifier above already flagged the arg
+                // as opaque, so no additional bookkeeping is needed here; the
+                // branch is kept to mirror the file-local handling shape.
             }
         }
         ts.forEachChild(node, visit);
@@ -507,7 +570,7 @@ function callPassesParamIdent(call, paramName) {
     }
     return false;
 }
-function descendIntoHelper(decl, callSite, outerParamName, paths, checker, visitedHelpers, viewHelper) {
+function descendIntoHelper(decl, callSite, outerParamName, paths, checker, visitedHelpers, viewHelper, opaqueOut) {
     // Match each parameter to its argument at the call site.
     //
     // For §2.1 view-helpers: arrow-arg accessors like `(t) => t.foo` are
@@ -533,11 +596,11 @@ function descendIntoHelper(decl, callSite, outerParamName, paths, checker, visit
         if (viewHelper && (ts.isArrowFunction(arg) || ts.isFunctionExpression(arg))) {
             const a0 = arg.parameters[0];
             if (a0 && ts.isIdentifier(a0.name) && arg.body) {
-                walkAccessorBody(arg.body, a0.name.text, paths, checker, visitedHelpers);
+                walkAccessorBody(arg.body, a0.name.text, paths, checker, visitedHelpers, opaqueOut);
             }
         }
         else if (ts.isIdentifier(arg) && arg.text === outerParamName) {
-            walkAccessorBody(fnDecl.body, param.name.text, paths, checker, visitedHelpers);
+            walkAccessorBody(fnDecl.body, param.name.text, paths, checker, visitedHelpers, opaqueOut);
         }
     }
 }