@llui/compiler 0.3.0

package/dist/cross-file-walker.js

@@ -0,0 +1,516 @@
+// Cross-file walker — v2b prototype (Phase 1).
+//
+// Classifies every call expression in a TypeScript Program against the
+// §2.1 view-helper resolution rule. Returns diagnostics + a per-callsite
+// classification trace.
+//
+// This is *prototype-grade*: no manifest consumption, no incremental cache,
+// no reverse-deps tracking. Phase 3 adds those layers on top.
+//
+// The rule (§2.1):
+//   A call is a view-helper iff at least one of:
+//     case 1 — the callee accepts a parameter assignable to View<S,M> or
+//              one of the documented structural subsets (send-only,
+//              text-only, send+text, send+show+each+branch).
+//     case 2 — the callee's *declared* return type is assignable to
+//              Node, Node[], Node|undefined, or ReadonlyArray<Node>.
+//     case 3 — the callee has a `/** @llui-helper */` JSDoc tag.
+//
+// Async helpers (declared return Promise<Node[]>) are NOT view-helpers
+// and produce `llui/async-view-helper` (hard error).
+//
+// Everything else: opaque. Emits `llui/opaque-view-call` if the call site
+// is structurally a view position (its result flows into a view-returning
+// expression); otherwise the call is uninteresting and not reported.
+import ts from 'typescript';
+import { rangeFromOffsets, relativizeFile, } from './diagnostic.js';
+/**
+ * Classify the symbol's declaration against the §2.1 rule.
+ *
+ * Operates on the *declared* type (`getTypeOfSymbolAtLocation(symbol,
+ * symbol.declarations[0])`), not the inferred-at-call-site type. This is
+ * load-bearing: TypeScript inference at call sites widens to union
+ * shapes (`Node[] | undefined`, `JSX.Element | string`) that miss
+ * assignability for case 2. The rule's intent is "did the author commit
+ * to a view-helper signature in the declaration" — inference-narrowed
+ * types don't satisfy that intent.
+ */
+export function classifyViewHelper(symbol, checker) {
+    const decls = symbol.getDeclarations() ?? [];
+    const decl = decls.find(isCallableDeclaration);
+    if (!decl)
+        return { kind: 'not-a-helper', cases: [], reason: 'no callable declaration found' };
+    const cases = [];
+    const reasons = [];
+    // Case 3: @llui-helper JSDoc tag. Cheap to check, decisive when present.
+    if (hasLluiHelperTag(decl)) {
+        cases.push(3);
+        reasons.push('@llui-helper tag');
+    }
+    // Get the signature's parameters + return type from the *declaration*.
+    const declType = checker.getTypeOfSymbolAtLocation(symbol, decl);
+    const sigs = declType.getCallSignatures();
+    if (sigs.length === 0) {
+        if (cases.includes(3)) {
+            return { kind: 'walked', cases, reason: reasons.join('; ') };
+        }
+        return { kind: 'not-a-helper', cases: [], reason: 'declared type has no call signature' };
+    }
+    // Use the first signature. Overloaded helpers are rare in view code;
+    // production walker should iterate all.
+    const sig = sigs[0];
+    // Case 2: declared return type assignable to Node / Node[] / etc.
+    const returnType = checker.getReturnTypeOfSignature(sig);
+    const asyncMatch = returnTypeIsAsyncNode(returnType, checker);
+    if (asyncMatch) {
+        return { kind: 'async', cases: [], reason: 'declared return is Promise<Node[] | Node>' };
+    }
+    if (returnTypeIsNodeShape(returnType, checker)) {
+        cases.push(2);
+        reasons.push('declared return is Node[]-like');
+    }
+    // Case 1: at least one parameter assignable to View<S,M> or a documented
+    // structural subset. Match on the declared parameter type's shape — we
+    // use property-name plus per-property callability as a structural
+    // signature. The 5 documented subsets are listed below.
+    for (const param of sig.getParameters()) {
+        const paramDecl = param.getDeclarations()?.[0];
+        if (!paramDecl)
+            continue;
+        const paramType = checker.getTypeOfSymbolAtLocation(param, paramDecl);
+        const subset = matchViewSubset(paramType, checker);
+        if (subset) {
+            cases.push(1);
+            reasons.push(`accepts View subset (${subset})`);
+            break;
+        }
+    }
+    if (cases.length === 0) {
+        return { kind: 'opaque', cases: [], reason: 'no §2.1 case matched' };
+    }
+    return { kind: 'walked', cases, reason: reasons.join('; ') };
+}
+/**
+ * The 5 documented View subsets, enumerated. New subsets require a doc
+ * revision and a fixture per §2.1.
+ *
+ * Returns the subset's identifier when matched, undefined otherwise.
+ * Matching is by *property presence* — we check that the parameter type
+ * exposes the required property names, each with a callable type. We
+ * intentionally do NOT call `isTypeAssignableTo` against a synthetic
+ * subset type, because TypeScript's structural assignability would
+ * accept arbitrary supersets and lose the "documented subset" guarantee.
+ */
+function matchViewSubset(t, _checker) {
+    if (!isObjectLike(t))
+        return undefined;
+    const props = t.getProperties().map((p) => p.getName());
+    const has = (name) => props.includes(name);
+    // Full View<S,M> bag — must expose at least send + show + each + branch.
+    // Real-world callers spread or destructure; the type they pass is the
+    // full View<S,M> regardless of how much they use.
+    if (has('send') && has('show') && has('each') && has('branch') && has('text')) {
+        return 'View<S, M>';
+    }
+    // send + show + each + branch (no text)
+    if (has('send') && has('show') && has('each') && has('branch') && !has('text')) {
+        return '{ send, show, each, branch }';
+    }
+    // send + text
+    if (has('send') && has('text') && !has('show') && !has('each')) {
+        return '{ send, text }';
+    }
+    // send only
+    if (has('send') && !has('text') && !has('show') && !has('each')) {
+        return '{ send }';
+    }
+    // text only
+    if (has('text') && !has('send') && !has('show') && !has('each')) {
+        return '{ text }';
+    }
+    return undefined;
+}
+function isObjectLike(t) {
+    return (t.getFlags() & ts.TypeFlags.Object) !== 0;
+}
+/**
+ * Returns true if `t` is assignable to one of: `Node`, `Node[]`,
+ * `Node | undefined`, `ReadonlyArray<Node>`.
+ *
+ * Uses the type checker's structural matching against a synthesized
+ * `Node`-like — we look up the global `Node` symbol from the lib.dom
+ * declarations.
+ */
+function returnTypeIsNodeShape(t, checker) {
+    // Strip undefined from a union for the "Node | undefined" case.
+    const nonUndefined = stripUndefined(t);
+    // Array / ReadonlyArray case: element type is Node-like.
+    // TypeScript represents both as a `TypeReference` whose target is the
+    // global Array / ReadonlyArray and whose first type-arg is the element.
+    if (isArrayOrReadonlyArray(nonUndefined)) {
+        const elem = getFirstTypeArg(nonUndefined);
+        if (elem && isNodeLike(elem, checker))
+            return true;
+    }
+    // Singular Node return: `function (...): Node`.
+    if (isNodeLike(nonUndefined, checker))
+        return true;
+    // Union: any member is Node-shaped.
+    if (nonUndefined.isUnion()) {
+        for (const u of nonUndefined.types) {
+            if (returnTypeIsNodeShape(u, checker))
+                return true;
+        }
+    }
+    return false;
+}
+function returnTypeIsAsyncNode(t, checker) {
+    // Promise<X> where X is Node-shaped.
+    const sym = t.getSymbol();
+    if (!sym || sym.getName() !== 'Promise')
+        return false;
+    const args = t.typeArguments;
+    if (!args || args.length === 0)
+        return false;
+    return returnTypeIsNodeShape(args[0], checker);
+}
+function stripUndefined(t) {
+    if (!t.isUnion())
+        return t;
+    const nonUndef = t.types.filter((u) => (u.getFlags() & (ts.TypeFlags.Undefined | ts.TypeFlags.Void)) === 0);
+    if (nonUndef.length === t.types.length)
+        return t;
+    if (nonUndef.length === 1)
+        return nonUndef[0];
+    return t;
+}
+function isArrayOrReadonlyArray(t) {
+    const sym = t.getSymbol();
+    if (!sym)
+        return false;
+    const name = sym.getName();
+    return name === 'ReadonlyArray' || name === 'Array';
+}
+function getFirstTypeArg(t) {
+    const args = t.typeArguments;
+    return args?.[0];
+}
+function isNodeLike(t, _checker) {
+    const sym = t.getSymbol();
+    if (!sym)
+        return false;
+    const name = sym.getName();
+    // Built-in DOM Node base types — return true on the abstract names.
+    if (name === 'Node' ||
+        name === 'Element' ||
+        name === 'HTMLElement' ||
+        name === 'Text' ||
+        name === 'Comment' ||
+        name === 'DocumentFragment' ||
+        name === 'ChildNode') {
+        return true;
+    }
+    // The concrete `HTMLDivElement` / `SVGCircleElement` / `MathMLMathElement`
+    // names that `HTMLElementTagNameMap[K]` resolves to. Element helpers
+    // (`div(...)`, `button(...)`) all hit this branch — without it they
+    // would be misclassified as opaque and flood the diagnostic stream.
+    return (/^HTML[A-Z]\w*Element$/.test(name) ||
+        /^SVG[A-Z]\w*Element$/.test(name) ||
+        /^MathML[A-Z]\w*Element$/.test(name));
+}
+function hasLluiHelperTag(decl) {
+    const jsDocs = ts.getJSDocTags(decl);
+    for (const tag of jsDocs) {
+        if (tag.tagName.text === 'llui-helper')
+            return true;
+    }
+    return false;
+}
+function isCallableDeclaration(d) {
+    return (ts.isFunctionDeclaration(d) ||
+        ts.isFunctionExpression(d) ||
+        ts.isArrowFunction(d) ||
+        ts.isMethodDeclaration(d) ||
+        ts.isVariableDeclaration(d));
+}
+/**
+ * Whether the call site is structurally in a view position. A view
+ * position is one where the result flows into:
+ *   - the return of a `view()` callback,
+ *   - a `Node[]` literal element being built by a structural primitive
+ *     (`each.render`, `show.render`, `branch.cases.X`, `scope.render`),
+ *   - the children array of an element-helper call.
+ *
+ * Approximation for the prototype: the call is inside a function whose
+ * return type (declared OR inferred from the surrounding context) is
+ * Node-shaped. Less precise than tracking JSX-style returns, but
+ * sufficient to gate the diagnostic emission for the validation run.
+ */
+function isViewPositionCall(call, checker) {
+    // Walk up: an enclosing function declaration / arrow whose return is
+    // Node-shaped. Stop at the source file.
+    let cur = call.parent;
+    while (cur) {
+        if (ts.isFunctionDeclaration(cur) ||
+            ts.isFunctionExpression(cur) ||
+            ts.isArrowFunction(cur) ||
+            ts.isMethodDeclaration(cur)) {
+            const sig = checker.getSignatureFromDeclaration(cur);
+            if (sig) {
+                const ret = checker.getReturnTypeOfSignature(sig);
+                if (returnTypeIsNodeShape(ret, checker))
+                    return true;
+            }
+            return false;
+        }
+        cur = cur.parent;
+    }
+    return false;
+}
+/**
+ * Walk a Program looking for call expressions that should be classified
+ * by the §2.1 rule. Restricts the walk to files matching `filter` so
+ * tests can scope to a subdirectory.
+ */
+export function walkProgram(program, options = {}) {
+    const checker = program.getTypeChecker();
+    const filter = options.filter ?? (() => true);
+    const diagnostics = [];
+    const perFile = new Map();
+    for (const sf of program.getSourceFiles()) {
+        if (sf.isDeclarationFile)
+            continue;
+        if (!filter(sf))
+            continue;
+        const counts = { callsClassified: 0, walked: 0, opaque: 0, async: 0, notAHelper: 0 };
+        perFile.set(sf.fileName, counts);
+        const visit = (node) => {
+            if (ts.isCallExpression(node)) {
+                // Resolve the symbol of the callee.
+                const callee = node.expression;
+                let symbol = checker.getSymbolAtLocation(callee);
+                if (symbol && symbol.flags & ts.SymbolFlags.Alias) {
+                    symbol = checker.getAliasedSymbol(symbol);
+                }
+                if (symbol && !(symbol.flags & ts.SymbolFlags.Transient)) {
+                    const cls = classifyViewHelper(symbol, checker);
+                    counts.callsClassified++;
+                    if (cls.kind === 'walked')
+                        counts.walked++;
+                    else if (cls.kind === 'opaque')
+                        counts.opaque++;
+                    else if (cls.kind === 'async')
+                        counts.async++;
+                    else
+                        counts.notAHelper++;
+                    if (cls.kind === 'opaque' && isViewPositionCall(node, checker)) {
+                        diagnostics.push({
+                            id: 'llui/opaque-view-call',
+                            file: sf.fileName,
+                            pos: node.getStart(sf),
+                            end: node.getEnd(),
+                            helperName: getCalleeName(callee),
+                            message: `Call to "${getCalleeName(callee) ?? '<unknown>'}" in a view position is opaque to the cross-file walker (${cls.reason}). Either add an explicit return-type annotation (Node[] / Node / ReadonlyArray<Node>), accept a View bag parameter (or a documented subset), or mark with /** @llui-helper */ if the helper genuinely cannot be annotated. As a last resort, use track({ deps: ... }) at the call site.`,
+                        });
+                    }
+                    else if (cls.kind === 'async' && isViewPositionCall(node, checker)) {
+                        diagnostics.push({
+                            id: 'llui/async-view-helper',
+                            file: sf.fileName,
+                            pos: node.getStart(sf),
+                            end: node.getEnd(),
+                            helperName: getCalleeName(callee),
+                            message: `Call to "${getCalleeName(callee) ?? '<unknown>'}" in a view position returns Promise<Node[] | Node>. LLui's view layer is synchronous — wrap async work in onMount() or use clientOnly() instead.`,
+                        });
+                    }
+                }
+            }
+            ts.forEachChild(node, visit);
+        };
+        visit(sf);
+    }
+    return { diagnostics, perFile };
+}
+function getCalleeName(expr) {
+    if (ts.isIdentifier(expr))
+        return expr.text;
+    if (ts.isPropertyAccessExpression(expr))
+        return expr.name.text;
+    return undefined;
+}
+// ── Diagnostic schema integration (v2c §3) ──────────────────────────
+//
+// The walker emits a lightweight `WalkerDiagnostic` (with raw byte
+// offsets) for internal accumulation. Adapters and the host pipeline
+// want the canonical `Diagnostic` shape with project-relative paths
+// and line/column ranges. This converter resolves the position pair to
+// a Range and relativizes the file path; the caller supplies the
+// project root.
+const WALKER_DIAGNOSTIC_META = {
+    'llui/opaque-view-call': {
+        severity: 'warning',
+        category: 'reactivity',
+        documentation: 'https://github.com/fponticelli/llui/blob/main/docs/proposals/v2-compiler/v2b.md#21-view-helper-resolution-rule',
+    },
+    'llui/async-view-helper': {
+        severity: 'error',
+        category: 'composition',
+        documentation: 'https://github.com/fponticelli/llui/blob/main/docs/proposals/v2-compiler/v2b.md#21-view-helper-resolution-rule',
+    },
+    'llui/helper-cycle': {
+        severity: 'warning',
+        category: 'composition',
+        documentation: 'https://github.com/fponticelli/llui/blob/main/docs/proposals/v2-compiler/v2b.md#23-recursion-and-cycles',
+    },
+};
+/**
+ * Convert a walker-internal diagnostic to the canonical `Diagnostic`
+ * shape. Reads the source text (for line/column resolution) and a
+ * project root (for path relativization).
+ */
+export function toCanonicalDiagnostic(d, sourceText, projectRoot) {
+    const meta = WALKER_DIAGNOSTIC_META[d.id];
+    return {
+        id: d.id,
+        severity: meta.severity,
+        category: meta.category,
+        message: d.message,
+        location: {
+            file: relativizeFile(d.file, projectRoot),
+            range: rangeFromOffsets(sourceText, d.pos, d.end),
+        },
+        ...(meta.documentation ? { documentation: meta.documentation } : {}),
+    };
+}
+// ── Cross-file accessor path collection ─────────────────────────────
+//
+// Given a focal source file inside a Program, walk every reactive-accessor
+// arrow in the file. For each accessor:
+//   - Collect paths it reads directly (the existing AST-only collector
+//     handles this — see `collect-deps.ts`).
+//   - For every call site inside the accessor whose callee resolves to a
+//     view-helper (per §2.1), descend into the callee and merge its reads.
+//
+// This is the cross-file extension of `collectStatePathsFromSource`. The
+// AST-only collector terminates at the file boundary; the cross-file
+// version follows view-helper calls into other files using the TypeChecker.
+//
+// Used by the focal file's compiler to compute its __prefixes table. The
+// production wiring (Vite adapter builds a Program; compileFile consumes
+// it) is v2c module work — for v2b this is exposed as a callable engine
+// API that downstream tools can drive.
+/**
+ * Collect the cross-file union of accessor paths read from a focal file.
+ * Returns the union over every reactive accessor in `focalFile`, with
+ * cross-file view-helper descents merged in.
+ */
+export function crossFileAccessorPaths(program, focalFile) {
+    const checker = program.getTypeChecker();
+    const paths = new Set();
+    const visitedHelpers = new Set();
+    const visit = (node, paramName) => {
+        // Reactive accessor entry: a 1-param arrow or function expression.
+        if ((ts.isArrowFunction(node) || ts.isFunctionExpression(node)) &&
+            node.parameters.length === 1) {
+            const p0 = node.parameters[0];
+            if (ts.isIdentifier(p0.name) && node.body) {
+                // Inner walk over the body — collect property chains rooted at
+                // this accessor's param, AND chase view-helper call sites.
+                walkAccessorBody(node.body, p0.name.text, paths, checker, visitedHelpers);
+            }
+        }
+        ts.forEachChild(node, (child) => visit(child, paramName));
+    };
+    visit(focalFile, undefined);
+    return paths;
+}
+function walkAccessorBody(body, paramName, paths, checker, visitedHelpers) {
+    const visit = (node) => {
+        // Property-chain extraction (mirrors collect-deps' depth-2 normaliser).
+        if (ts.isPropertyAccessExpression(node)) {
+            const chain = resolveDepth2(node, paramName);
+            if (chain)
+                paths.add(chain);
+        }
+        // View-helper call chase. The call may pass the state through to the
+        // helper, in which case the helper's own reads contribute to our
+        // accessor's read set.
+        if (ts.isCallExpression(node)) {
+            const callee = node.expression;
+            const sym = resolveAliasedSymbol(callee, checker);
+            if (sym) {
+                const cls = classifyViewHelper(sym, checker);
+                if (cls.kind === 'walked') {
+                    const decl = sym.getDeclarations()?.find(isFunctionLikeDecl);
+                    if (decl && !visitedHelpers.has(decl)) {
+                        visitedHelpers.add(decl);
+                        descendIntoHelper(decl, node, paramName, paths, checker, visitedHelpers);
+                    }
+                }
+            }
+        }
+        ts.forEachChild(node, visit);
+    };
+    visit(body);
+}
+function descendIntoHelper(decl, callSite, outerParamName, paths, checker, visitedHelpers) {
+    // Match each parameter to its argument at the call site. For accessor
+    // arguments `(t) => t.foo`, the helper's body reads `t` which is our
+    // outer state slice. Track this so reads inside the helper get
+    // attributed to our state shape.
+    const fnDecl = decl;
+    if (!fnDecl.body)
+        return;
+    const params = fnDecl.parameters;
+    for (let i = 0; i < params.length; i++) {
+        const param = params[i];
+        const arg = callSite.arguments[i];
+        if (!arg)
+            continue;
+        if (!ts.isIdentifier(param.name))
+            continue;
+        if (ts.isArrowFunction(arg) || ts.isFunctionExpression(arg)) {
+            const a0 = arg.parameters[0];
+            if (a0 && ts.isIdentifier(a0.name) && arg.body) {
+                // The arg accessor binds the helper's lift; walk it under the
+                // outer paramName so paths chain into our state.
+                walkAccessorBody(arg.body, a0.name.text, paths, checker, visitedHelpers);
+            }
+        }
+        else if (ts.isIdentifier(arg) && arg.text === outerParamName) {
+            // The helper is called with our state directly — recurse into its
+            // body under the helper's parameter name.
+            walkAccessorBody(fnDecl.body, param.name.text, paths, checker, visitedHelpers);
+        }
+    }
+}
+function resolveAliasedSymbol(node, checker) {
+    let sym = checker.getSymbolAtLocation(node);
+    if (!sym)
+        return undefined;
+    if (sym.flags & ts.SymbolFlags.Alias)
+        sym = checker.getAliasedSymbol(sym);
+    if (sym.flags & ts.SymbolFlags.Transient)
+        return undefined;
+    return sym;
+}
+function resolveDepth2(node, paramName) {
+    const parts = [];
+    let current = node;
+    while (ts.isPropertyAccessExpression(current)) {
+        parts.unshift(current.name.text);
+        current = current.expression;
+    }
+    if (!ts.isIdentifier(current) || current.text !== paramName)
+        return null;
+    if (parts.length === 0)
+        return null;
+    return parts.slice(0, 2).join('.');
+}
+function isFunctionLikeDecl(d) {
+    return (ts.isFunctionDeclaration(d) ||
+        ts.isFunctionExpression(d) ||
+        ts.isArrowFunction(d) ||
+        ts.isMethodDeclaration(d));
+}
+//# sourceMappingURL=cross-file-walker.js.map

package/dist/cross-file-walker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cross-file-walker.js","sourceRoot":"","sources":["../src/cross-file-walker.ts"],"names":[],"mappings":"AAAA,+CAA+C;AAC/C,EAAE;AACF,uEAAuE;AACvE,yEAAyE;AACzE,wBAAwB;AACxB,EAAE;AACF,4EAA4E;AAC5E,8DAA8D;AAC9D,EAAE;AACF,mBAAmB;AACnB,iDAAiD;AACjD,yEAAyE;AACzE,oEAAoE;AACpE,6DAA6D;AAC7D,oEAAoE;AACpE,qEAAqE;AACrE,iEAAiE;AACjE,EAAE;AACF,uEAAuE;AACvE,qDAAqD;AACrD,EAAE;AACF,0EAA0E;AAC1E,0EAA0E;AAC1E,qEAAqE;AAErE,OAAO,EAAE,MAAM,YAAY,CAAA;AAC3B,OAAO,EAIL,gBAAgB,EAChB,cAAc,GACf,MAAM,iBAAiB,CAAA;AAsCxB;;;;;;;;;;GAUG;AACH,MAAM,UAAU,kBAAkB,CAChC,MAAiB,EACjB,OAAuB;IAEvB,MAAM,KAAK,GAAG,MAAM,CAAC,eAAe,EAAE,IAAI,EAAE,CAAA;IAC5C,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAA;IAC9C,IAAI,CAAC,IAAI;QAAE,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,+BAA+B,EAAE,CAAA;IAE9F,MAAM,KAAK,GAAqB,EAAE,CAAA;IAClC,MAAM,OAAO,GAAa,EAAE,CAAA;IAE5B,yEAAyE;IACzE,IAAI,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACb,OAAO,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAA;IAClC,CAAC;IAED,uEAAuE;IACvE,MAAM,QAAQ,GAAG,OAAO,CAAC,yBAAyB,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;IAChE,MAAM,IAAI,GAAG,QAAQ,CAAC,iBAAiB,EAAE,CAAA;IACzC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACtB,IAAI,KAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YACtB,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAA;QAC9D,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,cAAc,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,qCAAqC,EAAE,CAAA;IAC3F,CAAC;IACD,qEAAqE;IACrE,wCAAwC;IACxC,MAAM,GAAG,GAAG,IAAI,CAAC,CAAC,CAAE,CAAA;IAEpB,kEAAkE;IAClE,MAAM,UAAU,GAAG,OAAO,CAAC,wBAAwB,CAAC,GAAG,CAAC,CAAA;IACxD,MAAM,UAAU,GAAG,qBAAqB,CAAC,UAAU,EAAE,OAAO,CAAC,CAAA;IAC7D,IAAI,UAAU,EAAE,CAAC;QACf,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,2CAA2C,EAAE,CAAA;IAC1F,CAAC;IACD,IAAI,qBAAqB,CAAC,UAAU,EAAE,OAAO,CAAC,EAAE,CAAC;QAC/C,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QACb,OAAO,CAAC,IAAI,CAAC,gCAAgC,CAAC,CAAA;IAChD,CAAC;IAED,yEAAyE;IACzE,uEAAuE;IACvE,kEAAkE;IAClE,wDAAwD;IACxD,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,aAAa,EAAE,EAAE,CAAC;QACxC,MAAM,SAAS,GAAG,KAAK,CAAC,eAAe,EAAE,EAAE,CAAC,CAAC,CAAC,CAAA;QAC9C,IAAI,CAAC,SAAS;YAAE,SAAQ;QACxB,MAAM,SAAS,GAAG,OAAO,CAAC,yBAAyB,CAAC,KAAK,EAAE,SAAS,CAAC,CAAA;QACrE,MAAM,MAAM,GAAG,eAAe,CAAC,SAAS,EAAE,OAAO,CAAC,CAAA;QAClD,IAAI,MAAM,EAAE,CAAC;YACX,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;YACb,OAAO,CAAC,IAAI,CAAC,wBAAwB,MAAM,GAAG,CAAC,CAAA;YAC/C,MAAK;QACP,CAAC;IACH,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,EAAE,EAAE,MAAM,EAAE,sBAAsB,EAAE,CAAA;IACtE,CAAC;IACD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAA;AAC9D,CAAC;AAED;;;;;;;;;;GAUG;AACH,SAAS,eAAe,CAAC,CAAU,EAAE,QAAwB;IAC3D,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC;QAAE,OAAO,SAAS,CAAA;IACtC,MAAM,KAAK,GAAG,CAAC,CAAC,aAAa,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,CAAA;IACvD,MAAM,GAAG,GAAG,CAAC,IAAY,EAAW,EAAE,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;IAE3D,yEAAyE;IACzE,sEAAsE;IACtE,kDAAkD;IAClD,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QAC9E,OAAO,YAAY,CAAA;IACrB,CAAC;IACD,wCAAwC;IACxC,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QAC/E,OAAO,8BAA8B,CAAA;IACvC,CAAC;IACD,cAAc;IACd,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QAC/D,OAAO,gBAAgB,CAAA;IACzB,CAAC;IACD,YAAY;IACZ,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QAChE,OAAO,UAAU,CAAA;IACnB,CAAC;IACD,YAAY;IACZ,IAAI,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;QAChE,OAAO,UAAU,CAAA;IACnB,CAAC;IAED,OAAO,SAAS,CAAA;AAClB,CAAC;AAED,SAAS,YAAY,CAAC,CAAU;IAC9B,OAAO,CAAC,CAAC,CAAC,QAAQ,EAAE,GAAG,EAAE,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;AACnD,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,qBAAqB,CAAC,CAAU,EAAE,OAAuB;IAChE,gEAAgE;IAChE,MAAM,YAAY,GAAG,cAAc,CAAC,CAAC,CAAC,CAAA;IAEtC,yDAAyD;IACzD,sEAAsE;IACtE,wEAAwE;IACxE,IAAI,sBAAsB,CAAC,YAAY,CAAC,EAAE,CAAC;QACzC,MAAM,IAAI,GAAG,eAAe,CAAC,YAAY,CAAC,CAAA;QAC1C,IAAI,IAAI,IAAI,UAAU,CAAC,IAAI,EAAE,OAAO,CAAC;YAAE,OAAO,IAAI,CAAA;IACpD,CAAC;IACD,gDAAgD;IAChD,IAAI,UAAU,CAAC,YAAY,EAAE,OAAO,CAAC;QAAE,OAAO,IAAI,CAAA;IAClD,oCAAoC;IACpC,IAAI,YAAY,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3B,KAAK,MAAM,CAAC,IAAI,YAAY,CAAC,KAAK,EAAE,CAAC;YACnC,IAAI,qBAAqB,CAAC,CAAC,EAAE,OAAO,CAAC;gBAAE,OAAO,IAAI,CAAA;QACpD,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,SAAS,qBAAqB,CAAC,CAAU,EAAE,OAAuB;IAChE,qCAAqC;IACrC,MAAM,GAAG,GAAG,CAAC,CAAC,SAAS,EAAE,CAAA;IACzB,IAAI,CAAC,GAAG,IAAI,GAAG,CAAC,OAAO,EAAE,KAAK,SAAS;QAAE,OAAO,KAAK,CAAA;IACrD,MAAM,IAAI,GAAI,CAAsB,CAAC,aAAa,CAAA;IAClD,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAA;IAC5C,OAAO,qBAAqB,CAAC,IAAI,CAAC,CAAC,CAAE,EAAE,OAAO,CAAC,CAAA;AACjD,CAAC;AAED,SAAS,cAAc,CAAC,CAAU;IAChC,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE;QAAE,OAAO,CAAC,CAAA;IAC1B,MAAM,QAAQ,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAC7B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,EAAE,GAAG,CAAC,EAAE,CAAC,SAAS,CAAC,SAAS,GAAG,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAC3E,CAAA;IACD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,CAAC,KAAK,CAAC,MAAM;QAAE,OAAO,CAAC,CAAA;IAChD,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,QAAQ,CAAC,CAAC,CAAE,CAAA;IAC9C,OAAO,CAAC,CAAA;AACV,CAAC;AAED,SAAS,sBAAsB,CAAC,CAAU;IACxC,MAAM,GAAG,GAAG,CAAC,CAAC,SAAS,EAAE,CAAA;IACzB,IAAI,CAAC,GAAG;QAAE,OAAO,KAAK,CAAA;IACtB,MAAM,IAAI,GAAG,GAAG,CAAC,OAAO,EAAE,CAAA;IAC1B,OAAO,IAAI,KAAK,eAAe,IAAI,IAAI,KAAK,OAAO,CAAA;AACrD,CAAC;AAED,SAAS,eAAe,CAAC,CAAU;IACjC,MAAM,IAAI,GAAI,CAAsB,CAAC,aAAa,CAAA;IAClD,OAAO,IAAI,EAAE,CAAC,CAAC,CAAC,CAAA;AAClB,CAAC;AAED,SAAS,UAAU,CAAC,CAAU,EAAE,QAAwB;IACtD,MAAM,GAAG,GAAG,CAAC,CAAC,SAAS,EAAE,CAAA;IACzB,IAAI,CAAC,GAAG;QAAE,OAAO,KAAK,CAAA;IACtB,MAAM,IAAI,GAAG,GAAG,CAAC,OAAO,EAAE,CAAA;IAC1B,oEAAoE;IACpE,IACE,IAAI,KAAK,MAAM;QACf,IAAI,KAAK,SAAS;QAClB,IAAI,KAAK,aAAa;QACtB,IAAI,KAAK,MAAM;QACf,IAAI,KAAK,SAAS;QAClB,IAAI,KAAK,kBAAkB;QAC3B,IAAI,KAAK,WAAW,EACpB,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IACD,2EAA2E;IAC3E,qEAAqE;IACrE,oEAAoE;IACpE,oEAAoE;IACpE,OAAO,CACL,uBAAuB,CAAC,IAAI,CAAC,IAAI,CAAC;QAClC,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC;QACjC,yBAAyB,CAAC,IAAI,CAAC,IAAI,CAAC,CACrC,CAAA;AACH,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAoB;IAC5C,MAAM,MAAM,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,CAAA;IACpC,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;QACzB,IAAI,GAAG,CAAC,OAAO,CAAC,IAAI,KAAK,aAAa;YAAE,OAAO,IAAI,CAAA;IACrD,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,SAAS,qBAAqB,CAAC,CAAiB;IAC9C,OAAO,CACL,EAAE,CAAC,qBAAqB,CAAC,CAAC,CAAC;QAC3B,EAAE,CAAC,oBAAoB,CAAC,CAAC,CAAC;QAC1B,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC;QACrB,EAAE,CAAC,mBAAmB,CAAC,CAAC,CAAC;QACzB,EAAE,CAAC,qBAAqB,CAAC,CAAC,CAAC,CAC5B,CAAA;AACH,CAAC;AAED;;;;;;;;;;;;GAYG;AACH,SAAS,kBAAkB,CAAC,IAAuB,EAAE,OAAuB;IAC1E,qEAAqE;IACrE,wCAAwC;IACxC,IAAI,GAAG,GAAwB,IAAI,CAAC,MAAM,CAAA;IAC1C,OAAO,GAAG,EAAE,CAAC;QACX,IACE,EAAE,CAAC,qBAAqB,CAAC,GAAG,CAAC;YAC7B,EAAE,CAAC,oBAAoB,CAAC,GAAG,CAAC;YAC5B,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC;YACvB,EAAE,CAAC,mBAAmB,CAAC,GAAG,CAAC,EAC3B,CAAC;YACD,MAAM,GAAG,GAAG,OAAO,CAAC,2BAA2B,CAAC,GAAG,CAAC,CAAA;YACpD,IAAI,GAAG,EAAE,CAAC;gBACR,MAAM,GAAG,GAAG,OAAO,CAAC,wBAAwB,CAAC,GAAG,CAAC,CAAA;gBACjD,IAAI,qBAAqB,CAAC,GAAG,EAAE,OAAO,CAAC;oBAAE,OAAO,IAAI,CAAA;YACtD,CAAC;YACD,OAAO,KAAK,CAAA;QACd,CAAC;QACD,GAAG,GAAG,GAAG,CAAC,MAAM,CAAA;IAClB,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,WAAW,CACzB,OAAmB,EACnB,UAA+D,EAAE;IAEjE,MAAM,OAAO,GAAG,OAAO,CAAC,cAAc,EAAE,CAAA;IACxC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAM,IAAI,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAA;IAC7C,MAAM,WAAW,GAAuB,EAAE,CAAA;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAGpB,CAAA;IAEH,KAAK,MAAM,EAAE,IAAI,OAAO,CAAC,cAAc,EAAE,EAAE,CAAC;QAC1C,IAAI,EAAE,CAAC,iBAAiB;YAAE,SAAQ;QAClC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YAAE,SAAQ;QACzB,MAAM,MAAM,GAAG,EAAE,eAAe,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,UAAU,EAAE,CAAC,EAAE,CAAA;QACpF,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAA;QAEhC,MAAM,KAAK,GAAG,CAAC,IAAa,EAAQ,EAAE;YACpC,IAAI,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9B,oCAAoC;gBACpC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAA;gBAC9B,IAAI,MAAM,GAAG,OAAO,CAAC,mBAAmB,CAAC,MAAM,CAAC,CAAA;gBAChD,IAAI,MAAM,IAAI,MAAM,CAAC,KAAK,GAAG,EAAE,CAAC,WAAW,CAAC,KAAK,EAAE,CAAC;oBAClD,MAAM,GAAG,OAAO,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAA;gBAC3C,CAAC;gBACD,IAAI,MAAM,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,GAAG,EAAE,CAAC,WAAW,CAAC,SAAS,CAAC,EAAE,CAAC;oBACzD,MAAM,GAAG,GAAG,kBAAkB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;oBAC/C,MAAM,CAAC,eAAe,EAAE,CAAA;oBACxB,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ;wBAAE,MAAM,CAAC,MAAM,EAAE,CAAA;yBACrC,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ;wBAAE,MAAM,CAAC,MAAM,EAAE,CAAA;yBAC1C,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO;wBAAE,MAAM,CAAC,KAAK,EAAE,CAAA;;wBACxC,MAAM,CAAC,UAAU,EAAE,CAAA;oBAExB,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,IAAI,kBAAkB,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC;wBAC/D,WAAW,CAAC,IAAI,CAAC;4BACf,EAAE,EAAE,uBAAuB;4BAC3B,IAAI,EAAE,EAAE,CAAC,QAAQ;4BACjB,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;4BACtB,GAAG,EAAE,IAAI,CAAC,MAAM,EAAE;4BAClB,UAAU,EAAE,aAAa,CAAC,MAAM,CAAC;4BACjC,OAAO,EAAE,YAAY,aAAa,CAAC,MAAM,CAAC,IAAI,WAAW,4DAA4D,GAAG,CAAC,MAAM,0RAA0R;yBAC1Z,CAAC,CAAA;oBACJ,CAAC;yBAAM,IAAI,GAAG,CAAC,IAAI,KAAK,OAAO,IAAI,kBAAkB,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC;wBACrE,WAAW,CAAC,IAAI,CAAC;4BACf,EAAE,EAAE,wBAAwB;4BAC5B,IAAI,EAAE,EAAE,CAAC,QAAQ;4BACjB,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;4BACtB,GAAG,EAAE,IAAI,CAAC,MAAM,EAAE;4BAClB,UAAU,EAAE,aAAa,CAAC,MAAM,CAAC;4BACjC,OAAO,EAAE,YAAY,aAAa,CAAC,MAAM,CAAC,IAAI,WAAW,mJAAmJ;yBAC7M,CAAC,CAAA;oBACJ,CAAC;gBACH,CAAC;YACH,CAAC;YACD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;QAC9B,CAAC,CAAA;QACD,KAAK,CAAC,EAAE,CAAC,CAAA;IACX,CAAC;IAED,OAAO,EAAE,WAAW,EAAE,OAAO,EAAE,CAAA;AACjC,CAAC;AAED,SAAS,aAAa,CAAC,IAAmB;IACxC,IAAI,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC,IAAI,CAAA;IAC3C,IAAI,EAAE,CAAC,0BAA0B,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAA;IAC9D,OAAO,SAAS,CAAA;AAClB,CAAC;AAED,uEAAuE;AACvE,EAAE;AACF,mEAAmE;AACnE,qEAAqE;AACrE,oEAAoE;AACpE,uEAAuE;AACvE,iEAAiE;AACjE,gBAAgB;AAEhB,MAAM,sBAAsB,GAOxB;IACF,uBAAuB,EAAE;QACvB,QAAQ,EAAE,SAAS;QACnB,QAAQ,EAAE,YAAY;QACtB,aAAa,EACX,gHAAgH;KACnH;IACD,wBAAwB,EAAE;QACxB,QAAQ,EAAE,OAAO;QACjB,QAAQ,EAAE,aAAa;QACvB,aAAa,EACX,gHAAgH;KACnH;IACD,mBAAmB,EAAE;QACnB,QAAQ,EAAE,SAAS;QACnB,QAAQ,EAAE,aAAa;QACvB,aAAa,EACX,yGAAyG;KAC5G;CACF,CAAA;AAED;;;;GAIG;AACH,MAAM,UAAU,qBAAqB,CACnC,CAAmB,EACnB,UAAkB,EAClB,WAAmB;IAEnB,MAAM,IAAI,GAAG,sBAAsB,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;IACzC,OAAO;QACL,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,OAAO,EAAE,CAAC,CAAC,OAAO;QAClB,QAAQ,EAAE;YACR,IAAI,EAAE,cAAc,CAAC,CAAC,CAAC,IAAI,EAAE,WAAW,CAAC;YACzC,KAAK,EAAE,gBAAgB,CAAC,UAAU,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC;SAClD;QACD,GAAG,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACrE,CAAA;AACH,CAAC;AAED,uEAAuE;AACvE,EAAE;AACF,2EAA2E;AAC3E,wCAAwC;AACxC,uEAAuE;AACvE,6CAA6C;AAC7C,yEAAyE;AACzE,2EAA2E;AAC3E,EAAE;AACF,yEAAyE;AACzE,qEAAqE;AACrE,4EAA4E;AAC5E,EAAE;AACF,yEAAyE;AACzE,yEAAyE;AACzE,wEAAwE;AACxE,uCAAuC;AAEvC;;;;GAIG;AACH,MAAM,UAAU,sBAAsB,CAAC,OAAmB,EAAE,SAAwB;IAClF,MAAM,OAAO,GAAG,OAAO,CAAC,cAAc,EAAE,CAAA;IACxC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAA;IAC/B,MAAM,cAAc,GAAG,IAAI,GAAG,EAAkB,CAAA;IAEhD,MAAM,KAAK,GAAG,CAAC,IAAa,EAAE,SAA6B,EAAQ,EAAE;QACnE,mEAAmE;QACnE,IACE,CAAC,EAAE,CAAC,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC;YAC3D,IAAI,CAAC,UAAU,CAAC,MAAM,KAAK,CAAC,EAC5B,CAAC;YACD,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,CAAC,CAAE,CAAA;YAC9B,IAAI,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;gBAC1C,+DAA+D;gBAC/D,2DAA2D;gBAC3D,gBAAgB,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,cAAc,CAAC,CAAA;YAC3E,CAAC;QACH,CAAC;QACD,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC,CAAA;IAC3D,CAAC,CAAA;IACD,KAAK,CAAC,SAAS,EAAE,SAAS,CAAC,CAAA;IAC3B,OAAO,KAAK,CAAA;AACd,CAAC;AAED,SAAS,gBAAgB,CACvB,IAAa,EACb,SAAiB,EACjB,KAAkB,EAClB,OAAuB,EACvB,cAAmC;IAEnC,MAAM,KAAK,GAAG,CAAC,IAAa,EAAQ,EAAE;QACpC,wEAAwE;QACxE,IAAI,EAAE,CAAC,0BAA0B,CAAC,IAAI,CAAC,EAAE,CAAC;YACxC,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,EAAE,SAAS,CAAC,CAAA;YAC5C,IAAI,KAAK;gBAAE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QAC7B,CAAC;QAED,qEAAqE;QACrE,iEAAiE;QACjE,uBAAuB;QACvB,IAAI,EAAE,CAAC,gBAAgB,CAAC,IAAI,CAAC,EAAE,CAAC;YAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAA;YAC9B,MAAM,GAAG,GAAG,oBAAoB,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;YACjD,IAAI,GAAG,EAAE,CAAC;gBACR,MAAM,GAAG,GAAG,kBAAkB,CAAC,GAAG,EAAE,OAAO,CAAC,CAAA;gBAC5C,IAAI,GAAG,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;oBAC1B,MAAM,IAAI,GAAG,GAAG,CAAC,eAAe,EAAE,EAAE,IAAI,CAAC,kBAAkB,CAAC,CAAA;oBAC5D,IAAI,IAAI,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;wBACtC,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;wBACxB,iBAAiB,CAAC,IAAI,EAAE,IAAI,EAAE,SAAS,EAAE,KAAK,EAAE,OAAO,EAAE,cAAc,CAAC,CAAA;oBAC1E,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,EAAE,CAAC,YAAY,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;IAC9B,CAAC,CAAA;IACD,KAAK,CAAC,IAAI,CAAC,CAAA;AACb,CAAC;AAED,SAAS,iBAAiB,CACxB,IAAoB,EACpB,QAA2B,EAC3B,cAAsB,EACtB,KAAkB,EAClB,OAAuB,EACvB,cAAmC;IAEnC,sEAAsE;IACtE,qEAAqE;IACrE,+DAA+D;IAC/D,iCAAiC;IACjC,MAAM,MAAM,GAAG,IAAkC,CAAA;IACjD,IAAI,CAAC,MAAM,CAAC,IAAI;QAAE,OAAM;IACxB,MAAM,MAAM,GAAG,MAAM,CAAC,UAAU,CAAA;IAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,MAAM,KAAK,GAAG,MAAM,CAAC,CAAC,CAAE,CAAA;QACxB,MAAM,GAAG,GAAG,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAA;QACjC,IAAI,CAAC,GAAG;YAAE,SAAQ;QAClB,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,KAAK,CAAC,IAAI,CAAC;YAAE,SAAQ;QAC1C,IAAI,EAAE,CAAC,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,oBAAoB,CAAC,GAAG,CAAC,EAAE,CAAC;YAC5D,MAAM,EAAE,GAAG,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAA;YAC5B,IAAI,EAAE,IAAI,EAAE,CAAC,YAAY,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC;gBAC/C,8DAA8D;gBAC9D,iDAAiD;gBACjD,gBAAgB,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,cAAc,CAAC,CAAA;YAC1E,CAAC;QACH,CAAC;aAAM,IAAI,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC,IAAI,KAAK,cAAc,EAAE,CAAC;YAC/D,kEAAkE;YAClE,0CAA0C;YAC1C,gBAAgB,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,cAAc,CAAC,CAAA;QAChF,CAAC;IACH,CAAC;AACH,CAAC;AAED,SAAS,oBAAoB,CAAC,IAAa,EAAE,OAAuB;IAClE,IAAI,GAAG,GAAG,OAAO,CAAC,mBAAmB,CAAC,IAAI,CAAC,CAAA;IAC3C,IAAI,CAAC,GAAG;QAAE,OAAO,SAAS,CAAA;IAC1B,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC,WAAW,CAAC,KAAK;QAAE,GAAG,GAAG,OAAO,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAA;IACzE,IAAI,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC,WAAW,CAAC,SAAS;QAAE,OAAO,SAAS,CAAA;IAC1D,OAAO,GAAG,CAAA;AACZ,CAAC;AAED,SAAS,aAAa,CAAC,IAAiC,EAAE,SAAiB;IACzE,MAAM,KAAK,GAAa,EAAE,CAAA;IAC1B,IAAI,OAAO,GAAkB,IAAI,CAAA;IACjC,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;IACD,IAAI,CAAC,EAAE,CAAC,YAAY,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,IAAI,KAAK,SAAS;QAAE,OAAO,IAAI,CAAA;IACxE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAA;IACnC,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAA;AACpC,CAAC;AAED,SAAS,kBAAkB,CAAC,CAAiB;IAC3C,OAAO,CACL,EAAE,CAAC,qBAAqB,CAAC,CAAC,CAAC;QAC3B,EAAE,CAAC,oBAAoB,CAAC,CAAC,CAAC;QAC1B,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC;QACrB,EAAE,CAAC,mBAAmB,CAAC,CAAC,CAAC,CAC1B,CAAA;AACH,CAAC","sourcesContent":["// Cross-file walker — v2b prototype (Phase 1).\n//\n// Classifies every call expression in a TypeScript Program against the\n// §2.1 view-helper resolution rule. Returns diagnostics + a per-callsite\n// classification trace.\n//\n// This is *prototype-grade*: no manifest consumption, no incremental cache,\n// no reverse-deps tracking. Phase 3 adds those layers on top.\n//\n// The rule (§2.1):\n//   A call is a view-helper iff at least one of:\n//     case 1 — the callee accepts a parameter assignable to View<S,M> or\n//              one of the documented structural subsets (send-only,\n//              text-only, send+text, send+show+each+branch).\n//     case 2 — the callee's *declared* return type is assignable to\n//              Node, Node[], Node|undefined, or ReadonlyArray<Node>.\n//     case 3 — the callee has a `/** @llui-helper */` JSDoc tag.\n//\n// Async helpers (declared return Promise<Node[]>) are NOT view-helpers\n// and produce `llui/async-view-helper` (hard error).\n//\n// Everything else: opaque. Emits `llui/opaque-view-call` if the call site\n// is structurally a view position (its result flows into a view-returning\n// expression); otherwise the call is uninteresting and not reported.\n\nimport ts from 'typescript'\nimport {\n  type Diagnostic,\n  type DiagnosticCategory,\n  type DiagnosticSeverity,\n  rangeFromOffsets,\n  relativizeFile,\n} from './diagnostic.js'\n\nexport type ViewHelperKind = 'walked' | 'opaque' | 'async' | 'not-a-helper'\n\nexport interface ViewHelperClassification {\n  kind: ViewHelperKind\n  /** Which §2.1 case fired. Only populated when kind === 'walked'. */\n  cases: Array<1 | 2 | 3>\n  /** Human-readable reason. */\n  reason: string\n}\n\nexport type DiagnosticId = 'llui/opaque-view-call' | 'llui/async-view-helper' | 'llui/helper-cycle'\n\nexport interface WalkerDiagnostic {\n  id: DiagnosticId\n  file: string\n  pos: number\n  end: number\n  message: string\n  helperName: string | undefined\n}\n\nexport interface WalkerResult {\n  diagnostics: WalkerDiagnostic[]\n  /** Per-file counts for telemetry. */\n  perFile: Map<\n    string,\n    {\n      callsClassified: number\n      walked: number\n      opaque: number\n      async: number\n      notAHelper: number\n    }\n  >\n}\n\n/**\n * Classify the symbol's declaration against the §2.1 rule.\n *\n * Operates on the *declared* type (`getTypeOfSymbolAtLocation(symbol,\n * symbol.declarations[0])`), not the inferred-at-call-site type. This is\n * load-bearing: TypeScript inference at call sites widens to union\n * shapes (`Node[] | undefined`, `JSX.Element | string`) that miss\n * assignability for case 2. The rule's intent is \"did the author commit\n * to a view-helper signature in the declaration\" — inference-narrowed\n * types don't satisfy that intent.\n */\nexport function classifyViewHelper(\n  symbol: ts.Symbol,\n  checker: ts.TypeChecker,\n): ViewHelperClassification {\n  const decls = symbol.getDeclarations() ?? []\n  const decl = decls.find(isCallableDeclaration)\n  if (!decl) return { kind: 'not-a-helper', cases: [], reason: 'no callable declaration found' }\n\n  const cases: Array<1 | 2 | 3> = []\n  const reasons: string[] = []\n\n  // Case 3: @llui-helper JSDoc tag. Cheap to check, decisive when present.\n  if (hasLluiHelperTag(decl)) {\n    cases.push(3)\n    reasons.push('@llui-helper tag')\n  }\n\n  // Get the signature's parameters + return type from the *declaration*.\n  const declType = checker.getTypeOfSymbolAtLocation(symbol, decl)\n  const sigs = declType.getCallSignatures()\n  if (sigs.length === 0) {\n    if (cases.includes(3)) {\n      return { kind: 'walked', cases, reason: reasons.join('; ') }\n    }\n    return { kind: 'not-a-helper', cases: [], reason: 'declared type has no call signature' }\n  }\n  // Use the first signature. Overloaded helpers are rare in view code;\n  // production walker should iterate all.\n  const sig = sigs[0]!\n\n  // Case 2: declared return type assignable to Node / Node[] / etc.\n  const returnType = checker.getReturnTypeOfSignature(sig)\n  const asyncMatch = returnTypeIsAsyncNode(returnType, checker)\n  if (asyncMatch) {\n    return { kind: 'async', cases: [], reason: 'declared return is Promise<Node[] | Node>' }\n  }\n  if (returnTypeIsNodeShape(returnType, checker)) {\n    cases.push(2)\n    reasons.push('declared return is Node[]-like')\n  }\n\n  // Case 1: at least one parameter assignable to View<S,M> or a documented\n  // structural subset. Match on the declared parameter type's shape — we\n  // use property-name plus per-property callability as a structural\n  // signature. The 5 documented subsets are listed below.\n  for (const param of sig.getParameters()) {\n    const paramDecl = param.getDeclarations()?.[0]\n    if (!paramDecl) continue\n    const paramType = checker.getTypeOfSymbolAtLocation(param, paramDecl)\n    const subset = matchViewSubset(paramType, checker)\n    if (subset) {\n      cases.push(1)\n      reasons.push(`accepts View subset (${subset})`)\n      break\n    }\n  }\n\n  if (cases.length === 0) {\n    return { kind: 'opaque', cases: [], reason: 'no §2.1 case matched' }\n  }\n  return { kind: 'walked', cases, reason: reasons.join('; ') }\n}\n\n/**\n * The 5 documented View subsets, enumerated. New subsets require a doc\n * revision and a fixture per §2.1.\n *\n * Returns the subset's identifier when matched, undefined otherwise.\n * Matching is by *property presence* — we check that the parameter type\n * exposes the required property names, each with a callable type. We\n * intentionally do NOT call `isTypeAssignableTo` against a synthetic\n * subset type, because TypeScript's structural assignability would\n * accept arbitrary supersets and lose the \"documented subset\" guarantee.\n */\nfunction matchViewSubset(t: ts.Type, _checker: ts.TypeChecker): string | undefined {\n  if (!isObjectLike(t)) return undefined\n  const props = t.getProperties().map((p) => p.getName())\n  const has = (name: string): boolean => props.includes(name)\n\n  // Full View<S,M> bag — must expose at least send + show + each + branch.\n  // Real-world callers spread or destructure; the type they pass is the\n  // full View<S,M> regardless of how much they use.\n  if (has('send') && has('show') && has('each') && has('branch') && has('text')) {\n    return 'View<S, M>'\n  }\n  // send + show + each + branch (no text)\n  if (has('send') && has('show') && has('each') && has('branch') && !has('text')) {\n    return '{ send, show, each, branch }'\n  }\n  // send + text\n  if (has('send') && has('text') && !has('show') && !has('each')) {\n    return '{ send, text }'\n  }\n  // send only\n  if (has('send') && !has('text') && !has('show') && !has('each')) {\n    return '{ send }'\n  }\n  // text only\n  if (has('text') && !has('send') && !has('show') && !has('each')) {\n    return '{ text }'\n  }\n\n  return undefined\n}\n\nfunction isObjectLike(t: ts.Type): boolean {\n  return (t.getFlags() & ts.TypeFlags.Object) !== 0\n}\n\n/**\n * Returns true if `t` is assignable to one of: `Node`, `Node[]`,\n * `Node | undefined`, `ReadonlyArray<Node>`.\n *\n * Uses the type checker's structural matching against a synthesized\n * `Node`-like — we look up the global `Node` symbol from the lib.dom\n * declarations.\n */\nfunction returnTypeIsNodeShape(t: ts.Type, checker: ts.TypeChecker): boolean {\n  // Strip undefined from a union for the \"Node | undefined\" case.\n  const nonUndefined = stripUndefined(t)\n\n  // Array / ReadonlyArray case: element type is Node-like.\n  // TypeScript represents both as a `TypeReference` whose target is the\n  // global Array / ReadonlyArray and whose first type-arg is the element.\n  if (isArrayOrReadonlyArray(nonUndefined)) {\n    const elem = getFirstTypeArg(nonUndefined)\n    if (elem && isNodeLike(elem, checker)) return true\n  }\n  // Singular Node return: `function (...): Node`.\n  if (isNodeLike(nonUndefined, checker)) return true\n  // Union: any member is Node-shaped.\n  if (nonUndefined.isUnion()) {\n    for (const u of nonUndefined.types) {\n      if (returnTypeIsNodeShape(u, checker)) return true\n    }\n  }\n  return false\n}\n\nfunction returnTypeIsAsyncNode(t: ts.Type, checker: ts.TypeChecker): boolean {\n  // Promise<X> where X is Node-shaped.\n  const sym = t.getSymbol()\n  if (!sym || sym.getName() !== 'Promise') return false\n  const args = (t as ts.TypeReference).typeArguments\n  if (!args || args.length === 0) return false\n  return returnTypeIsNodeShape(args[0]!, checker)\n}\n\nfunction stripUndefined(t: ts.Type): ts.Type {\n  if (!t.isUnion()) return t\n  const nonUndef = t.types.filter(\n    (u) => (u.getFlags() & (ts.TypeFlags.Undefined | ts.TypeFlags.Void)) === 0,\n  )\n  if (nonUndef.length === t.types.length) return t\n  if (nonUndef.length === 1) return nonUndef[0]!\n  return t\n}\n\nfunction isArrayOrReadonlyArray(t: ts.Type): boolean {\n  const sym = t.getSymbol()\n  if (!sym) return false\n  const name = sym.getName()\n  return name === 'ReadonlyArray' || name === 'Array'\n}\n\nfunction getFirstTypeArg(t: ts.Type): ts.Type | undefined {\n  const args = (t as ts.TypeReference).typeArguments\n  return args?.[0]\n}\n\nfunction isNodeLike(t: ts.Type, _checker: ts.TypeChecker): boolean {\n  const sym = t.getSymbol()\n  if (!sym) return false\n  const name = sym.getName()\n  // Built-in DOM Node base types — return true on the abstract names.\n  if (\n    name === 'Node' ||\n    name === 'Element' ||\n    name === 'HTMLElement' ||\n    name === 'Text' ||\n    name === 'Comment' ||\n    name === 'DocumentFragment' ||\n    name === 'ChildNode'\n  ) {\n    return true\n  }\n  // The concrete `HTMLDivElement` / `SVGCircleElement` / `MathMLMathElement`\n  // names that `HTMLElementTagNameMap[K]` resolves to. Element helpers\n  // (`div(...)`, `button(...)`) all hit this branch — without it they\n  // would be misclassified as opaque and flood the diagnostic stream.\n  return (\n    /^HTML[A-Z]\\w*Element$/.test(name) ||\n    /^SVG[A-Z]\\w*Element$/.test(name) ||\n    /^MathML[A-Z]\\w*Element$/.test(name)\n  )\n}\n\nfunction hasLluiHelperTag(decl: ts.Declaration): boolean {\n  const jsDocs = ts.getJSDocTags(decl)\n  for (const tag of jsDocs) {\n    if (tag.tagName.text === 'llui-helper') return true\n  }\n  return false\n}\n\nfunction isCallableDeclaration(d: ts.Declaration): boolean {\n  return (\n    ts.isFunctionDeclaration(d) ||\n    ts.isFunctionExpression(d) ||\n    ts.isArrowFunction(d) ||\n    ts.isMethodDeclaration(d) ||\n    ts.isVariableDeclaration(d)\n  )\n}\n\n/**\n * Whether the call site is structurally in a view position. A view\n * position is one where the result flows into:\n *   - the return of a `view()` callback,\n *   - a `Node[]` literal element being built by a structural primitive\n *     (`each.render`, `show.render`, `branch.cases.X`, `scope.render`),\n *   - the children array of an element-helper call.\n *\n * Approximation for the prototype: the call is inside a function whose\n * return type (declared OR inferred from the surrounding context) is\n * Node-shaped. Less precise than tracking JSX-style returns, but\n * sufficient to gate the diagnostic emission for the validation run.\n */\nfunction isViewPositionCall(call: ts.CallExpression, checker: ts.TypeChecker): boolean {\n  // Walk up: an enclosing function declaration / arrow whose return is\n  // Node-shaped. Stop at the source file.\n  let cur: ts.Node | undefined = call.parent\n  while (cur) {\n    if (\n      ts.isFunctionDeclaration(cur) ||\n      ts.isFunctionExpression(cur) ||\n      ts.isArrowFunction(cur) ||\n      ts.isMethodDeclaration(cur)\n    ) {\n      const sig = checker.getSignatureFromDeclaration(cur)\n      if (sig) {\n        const ret = checker.getReturnTypeOfSignature(sig)\n        if (returnTypeIsNodeShape(ret, checker)) return true\n      }\n      return false\n    }\n    cur = cur.parent\n  }\n  return false\n}\n\n/**\n * Walk a Program looking for call expressions that should be classified\n * by the §2.1 rule. Restricts the walk to files matching `filter` so\n * tests can scope to a subdirectory.\n */\nexport function walkProgram(\n  program: ts.Program,\n  options: { filter?: (sourceFile: ts.SourceFile) => boolean } = {},\n): WalkerResult {\n  const checker = program.getTypeChecker()\n  const filter = options.filter ?? (() => true)\n  const diagnostics: WalkerDiagnostic[] = []\n  const perFile = new Map<\n    string,\n    WalkerResult['perFile'] extends Map<string, infer V> ? V : never\n  >()\n\n  for (const sf of program.getSourceFiles()) {\n    if (sf.isDeclarationFile) continue\n    if (!filter(sf)) continue\n    const counts = { callsClassified: 0, walked: 0, opaque: 0, async: 0, notAHelper: 0 }\n    perFile.set(sf.fileName, counts)\n\n    const visit = (node: ts.Node): void => {\n      if (ts.isCallExpression(node)) {\n        // Resolve the symbol of the callee.\n        const callee = node.expression\n        let symbol = checker.getSymbolAtLocation(callee)\n        if (symbol && symbol.flags & ts.SymbolFlags.Alias) {\n          symbol = checker.getAliasedSymbol(symbol)\n        }\n        if (symbol && !(symbol.flags & ts.SymbolFlags.Transient)) {\n          const cls = classifyViewHelper(symbol, checker)\n          counts.callsClassified++\n          if (cls.kind === 'walked') counts.walked++\n          else if (cls.kind === 'opaque') counts.opaque++\n          else if (cls.kind === 'async') counts.async++\n          else counts.notAHelper++\n\n          if (cls.kind === 'opaque' && isViewPositionCall(node, checker)) {\n            diagnostics.push({\n              id: 'llui/opaque-view-call',\n              file: sf.fileName,\n              pos: node.getStart(sf),\n              end: node.getEnd(),\n              helperName: getCalleeName(callee),\n              message: `Call to \"${getCalleeName(callee) ?? '<unknown>'}\" in a view position is opaque to the cross-file walker (${cls.reason}). Either add an explicit return-type annotation (Node[] / Node / ReadonlyArray<Node>), accept a View bag parameter (or a documented subset), or mark with /** @llui-helper */ if the helper genuinely cannot be annotated. As a last resort, use track({ deps: ... }) at the call site.`,\n            })\n          } else if (cls.kind === 'async' && isViewPositionCall(node, checker)) {\n            diagnostics.push({\n              id: 'llui/async-view-helper',\n              file: sf.fileName,\n              pos: node.getStart(sf),\n              end: node.getEnd(),\n              helperName: getCalleeName(callee),\n              message: `Call to \"${getCalleeName(callee) ?? '<unknown>'}\" in a view position returns Promise<Node[] | Node>. LLui's view layer is synchronous — wrap async work in onMount() or use clientOnly() instead.`,\n            })\n          }\n        }\n      }\n      ts.forEachChild(node, visit)\n    }\n    visit(sf)\n  }\n\n  return { diagnostics, perFile }\n}\n\nfunction getCalleeName(expr: ts.Expression): string | undefined {\n  if (ts.isIdentifier(expr)) return expr.text\n  if (ts.isPropertyAccessExpression(expr)) return expr.name.text\n  return undefined\n}\n\n// ── Diagnostic schema integration (v2c §3) ──────────────────────────\n//\n// The walker emits a lightweight `WalkerDiagnostic` (with raw byte\n// offsets) for internal accumulation. Adapters and the host pipeline\n// want the canonical `Diagnostic` shape with project-relative paths\n// and line/column ranges. This converter resolves the position pair to\n// a Range and relativizes the file path; the caller supplies the\n// project root.\n\nconst WALKER_DIAGNOSTIC_META: Record<\n  DiagnosticId,\n  {\n    severity: DiagnosticSeverity\n    category: DiagnosticCategory\n    documentation?: string\n  }\n> = {\n  'llui/opaque-view-call': {\n    severity: 'warning',\n    category: 'reactivity',\n    documentation:\n      'https://github.com/fponticelli/llui/blob/main/docs/proposals/v2-compiler/v2b.md#21-view-helper-resolution-rule',\n  },\n  'llui/async-view-helper': {\n    severity: 'error',\n    category: 'composition',\n    documentation:\n      'https://github.com/fponticelli/llui/blob/main/docs/proposals/v2-compiler/v2b.md#21-view-helper-resolution-rule',\n  },\n  'llui/helper-cycle': {\n    severity: 'warning',\n    category: 'composition',\n    documentation:\n      'https://github.com/fponticelli/llui/blob/main/docs/proposals/v2-compiler/v2b.md#23-recursion-and-cycles',\n  },\n}\n\n/**\n * Convert a walker-internal diagnostic to the canonical `Diagnostic`\n * shape. Reads the source text (for line/column resolution) and a\n * project root (for path relativization).\n */\nexport function toCanonicalDiagnostic(\n  d: WalkerDiagnostic,\n  sourceText: string,\n  projectRoot: string,\n): Diagnostic {\n  const meta = WALKER_DIAGNOSTIC_META[d.id]\n  return {\n    id: d.id,\n    severity: meta.severity,\n    category: meta.category,\n    message: d.message,\n    location: {\n      file: relativizeFile(d.file, projectRoot),\n      range: rangeFromOffsets(sourceText, d.pos, d.end),\n    },\n    ...(meta.documentation ? { documentation: meta.documentation } : {}),\n  }\n}\n\n// ── Cross-file accessor path collection ─────────────────────────────\n//\n// Given a focal source file inside a Program, walk every reactive-accessor\n// arrow in the file. For each accessor:\n//   - Collect paths it reads directly (the existing AST-only collector\n//     handles this — see `collect-deps.ts`).\n//   - For every call site inside the accessor whose callee resolves to a\n//     view-helper (per §2.1), descend into the callee and merge its reads.\n//\n// This is the cross-file extension of `collectStatePathsFromSource`. The\n// AST-only collector terminates at the file boundary; the cross-file\n// version follows view-helper calls into other files using the TypeChecker.\n//\n// Used by the focal file's compiler to compute its __prefixes table. The\n// production wiring (Vite adapter builds a Program; compileFile consumes\n// it) is v2c module work — for v2b this is exposed as a callable engine\n// API that downstream tools can drive.\n\n/**\n * Collect the cross-file union of accessor paths read from a focal file.\n * Returns the union over every reactive accessor in `focalFile`, with\n * cross-file view-helper descents merged in.\n */\nexport function crossFileAccessorPaths(program: ts.Program, focalFile: ts.SourceFile): Set<string> {\n  const checker = program.getTypeChecker()\n  const paths = new Set<string>()\n  const visitedHelpers = new Set<ts.Declaration>()\n\n  const visit = (node: ts.Node, paramName: string | undefined): void => {\n    // Reactive accessor entry: a 1-param arrow or function expression.\n    if (\n      (ts.isArrowFunction(node) || ts.isFunctionExpression(node)) &&\n      node.parameters.length === 1\n    ) {\n      const p0 = node.parameters[0]!\n      if (ts.isIdentifier(p0.name) && node.body) {\n        // Inner walk over the body — collect property chains rooted at\n        // this accessor's param, AND chase view-helper call sites.\n        walkAccessorBody(node.body, p0.name.text, paths, checker, visitedHelpers)\n      }\n    }\n    ts.forEachChild(node, (child) => visit(child, paramName))\n  }\n  visit(focalFile, undefined)\n  return paths\n}\n\nfunction walkAccessorBody(\n  body: ts.Node,\n  paramName: string,\n  paths: Set<string>,\n  checker: ts.TypeChecker,\n  visitedHelpers: Set<ts.Declaration>,\n): void {\n  const visit = (node: ts.Node): void => {\n    // Property-chain extraction (mirrors collect-deps' depth-2 normaliser).\n    if (ts.isPropertyAccessExpression(node)) {\n      const chain = resolveDepth2(node, paramName)\n      if (chain) paths.add(chain)\n    }\n\n    // View-helper call chase. The call may pass the state through to the\n    // helper, in which case the helper's own reads contribute to our\n    // accessor's read set.\n    if (ts.isCallExpression(node)) {\n      const callee = node.expression\n      const sym = resolveAliasedSymbol(callee, checker)\n      if (sym) {\n        const cls = classifyViewHelper(sym, checker)\n        if (cls.kind === 'walked') {\n          const decl = sym.getDeclarations()?.find(isFunctionLikeDecl)\n          if (decl && !visitedHelpers.has(decl)) {\n            visitedHelpers.add(decl)\n            descendIntoHelper(decl, node, paramName, paths, checker, visitedHelpers)\n          }\n        }\n      }\n    }\n\n    ts.forEachChild(node, visit)\n  }\n  visit(body)\n}\n\nfunction descendIntoHelper(\n  decl: ts.Declaration,\n  callSite: ts.CallExpression,\n  outerParamName: string,\n  paths: Set<string>,\n  checker: ts.TypeChecker,\n  visitedHelpers: Set<ts.Declaration>,\n): void {\n  // Match each parameter to its argument at the call site. For accessor\n  // arguments `(t) => t.foo`, the helper's body reads `t` which is our\n  // outer state slice. Track this so reads inside the helper get\n  // attributed to our state shape.\n  const fnDecl = decl as ts.FunctionLikeDeclaration\n  if (!fnDecl.body) return\n  const params = fnDecl.parameters\n  for (let i = 0; i < params.length; i++) {\n    const param = params[i]!\n    const arg = callSite.arguments[i]\n    if (!arg) continue\n    if (!ts.isIdentifier(param.name)) continue\n    if (ts.isArrowFunction(arg) || ts.isFunctionExpression(arg)) {\n      const a0 = arg.parameters[0]\n      if (a0 && ts.isIdentifier(a0.name) && arg.body) {\n        // The arg accessor binds the helper's lift; walk it under the\n        // outer paramName so paths chain into our state.\n        walkAccessorBody(arg.body, a0.name.text, paths, checker, visitedHelpers)\n      }\n    } else if (ts.isIdentifier(arg) && arg.text === outerParamName) {\n      // The helper is called with our state directly — recurse into its\n      // body under the helper's parameter name.\n      walkAccessorBody(fnDecl.body, param.name.text, paths, checker, visitedHelpers)\n    }\n  }\n}\n\nfunction resolveAliasedSymbol(node: ts.Node, checker: ts.TypeChecker): ts.Symbol | undefined {\n  let sym = checker.getSymbolAtLocation(node)\n  if (!sym) return undefined\n  if (sym.flags & ts.SymbolFlags.Alias) sym = checker.getAliasedSymbol(sym)\n  if (sym.flags & ts.SymbolFlags.Transient) return undefined\n  return sym\n}\n\nfunction resolveDepth2(node: ts.PropertyAccessExpression, paramName: string): string | null {\n  const parts: string[] = []\n  let current: ts.Expression = node\n  while (ts.isPropertyAccessExpression(current)) {\n    parts.unshift(current.name.text)\n    current = current.expression\n  }\n  if (!ts.isIdentifier(current) || current.text !== paramName) return null\n  if (parts.length === 0) return null\n  return parts.slice(0, 2).join('.')\n}\n\nfunction isFunctionLikeDecl(d: ts.Declaration): boolean {\n  return (\n    ts.isFunctionDeclaration(d) ||\n    ts.isFunctionExpression(d) ||\n    ts.isArrowFunction(d) ||\n    ts.isMethodDeclaration(d)\n  )\n}\n"]}