gitnexus 1.6.3-rc.2 → 1.6.3-rc.21

package/dist/_shared/scope-resolution/finalize-algorithm.js

@@ -0,0 +1,479 @@
+/**
+ * `finalize` — cross-file finalize algorithm for the SemanticModel
+ * (RFC §3.2 Phase 2; Ring 2 SHARED #915).
+ *
+ * Pure logic that takes per-file parse output (`ParsedImport[]` +
+ * `SymbolDefinition[]`) and returns:
+ *
+ *   - Linked `ImportEdge[]` per module scope, with `targetModuleScope` and
+ *     `targetDefId` filled where resolvable; edges that could not be
+ *     resolved within the hard fixpoint cap are marked
+ *     `linkStatus: 'unresolved'`.
+ *   - Materialized `bindings` per module scope — local defs merged with
+ *     imported / wildcard-expanded / re-exported names via the provider's
+ *     `mergeBindings` precedence.
+ *   - The SCC condensation of the import graph, exposed so disjoint SCCs
+ *     can be processed in parallel by callers that want that.
+ *
+ * The algorithm is **SCC-aware**: it runs Tarjan SCC over the file-level
+ * import graph, processes SCCs in reverse-topological order (leaves
+ * first), and within each SCC runs a bounded fixpoint link pass capped at
+ * `N = |edges in SCC|`. Cyclic imports finalize without hanging; malformed
+ * inputs are bounded by the cap.
+ *
+ * **No language-specific logic.** Target resolution, wildcard expansion,
+ * and binding precedence all go through caller-supplied hooks
+ * (`resolveImportTarget`, `expandsWildcardTo`, `mergeBindings`) that
+ * match the LanguageProvider surface from #911.
+ *
+ * **Dynamic imports rule.** `kind === 'dynamic-unresolved'` passes through
+ * as an `ImportEdge { kind: 'dynamic-unresolved', targetFile: null }`
+ * with no `BindingRef`. They are parse-time signals, not linkable targets.
+ */
+// ─── Entry point ───────────────────────────────────────────────────────────
+export function finalize(input, hooks) {
+    const byFilePath = new Map();
+    for (const f of input.files)
+        byFilePath.set(f.filePath, f);
+    // ── Phase 0: pre-resolve raw import targets (one syscall-equivalent per
+    // (file, parsedImport)). Edges with no resolvable target become
+    // `linkStatus: 'unresolved'` or, for dynamic-unresolved, pass through
+    // with `targetFile: null`.
+    const edgeIndex = new Map(); // filePath → drafts
+    let totalEdges = 0;
+    for (const file of input.files) {
+        const drafts = [];
+        for (const parsed of file.parsedImports) {
+            const draft = makeEdgeDraft(parsed, file, hooks, input.workspaceIndex);
+            drafts.push(draft);
+            totalEdges++;
+        }
+        edgeIndex.set(file.filePath, drafts);
+    }
+    // ── Phase 1: build file-level import graph (only resolvable edges form
+    // graph edges; unresolvable ones are terminal and contribute no
+    // fixpoint obligation).
+    const graph = new Map();
+    for (const file of input.files) {
+        graph.set(file.filePath, new Set());
+    }
+    for (const [fromFile, drafts] of edgeIndex) {
+        const edges = graph.get(fromFile);
+        for (const d of drafts) {
+            if (d.targetFile !== null && byFilePath.has(d.targetFile)) {
+                edges.add(d.targetFile);
+            }
+        }
+    }
+    // ── Phase 2: Tarjan SCC → reverse-topological list of SCCs.
+    const sccs = tarjanSccs(graph);
+    // ── Phase 3: process SCCs in reverse-topological order (leaves first).
+    // Within each SCC, run a bounded fixpoint that resolves intra-SCC edges.
+    // Edges leaving the SCC are already resolved (their target SCC is
+    // already finalized); edges inside the SCC may need multiple passes.
+    const linkedByScope = new Map();
+    let linkedEdges = 0;
+    for (const scc of sccs) {
+        const sccFiles = new Set(scc.files);
+        const capacity = countEdgesWithin(edgeIndex, sccFiles);
+        // Run the fixpoint up to `capacity` iterations. Each iteration tries to
+        // resolve every still-unlinked edge in the SCC; stops early if a pass
+        // makes no progress.
+        let progressed = true;
+        let iterations = 0;
+        while (progressed && iterations < capacity) {
+            progressed = false;
+            iterations++;
+            for (const filePath of scc.files) {
+                const drafts = edgeIndex.get(filePath);
+                for (const draft of drafts) {
+                    if (draft.finalized !== null)
+                        continue;
+                    const finalized = tryFinalize(draft, byFilePath);
+                    if (finalized !== null) {
+                        draft.finalized = finalized;
+                        progressed = true;
+                    }
+                }
+            }
+        }
+        // Any drafts still not finalized within this SCC hit the cap → unresolved.
+        for (const filePath of scc.files) {
+            const drafts = edgeIndex.get(filePath);
+            for (const draft of drafts) {
+                if (draft.finalized !== null)
+                    continue;
+                draft.finalized = {
+                    ...draft.base,
+                    linkStatus: 'unresolved',
+                };
+            }
+        }
+    }
+    // ── Phase 4: collect finalized `ImportEdge[]` per module scope, preserving
+    // input order within each file, and wildcard-expand where applicable.
+    for (const file of input.files) {
+        const drafts = edgeIndex.get(file.filePath);
+        const finalized = [];
+        for (const d of drafts) {
+            const edge = d.finalized;
+            if (d.source.kind === 'wildcard' && edge.linkStatus !== 'unresolved') {
+                // Produce one `wildcard-expanded` ImportEdge per exported name.
+                const expanded = expandWildcard(edge, byFilePath, hooks, input.workspaceIndex);
+                for (const e of expanded)
+                    finalized.push(e);
+            }
+            else {
+                finalized.push(edge);
+            }
+            if (edge.linkStatus !== 'unresolved')
+                linkedEdges++;
+        }
+        linkedByScope.set(file.moduleScope, Object.freeze(finalized));
+    }
+    // ── Phase 5: materialize module-scope bindings (local + imports + wildcards),
+    // delegating precedence to `provider.mergeBindings`.
+    const bindingsByScope = materializeBindings(input.files, linkedByScope, hooks);
+    // ── Stats.
+    const sccCount = sccs.length;
+    let largestSccSize = 0;
+    for (const scc of sccs) {
+        if (scc.files.length > largestSccSize)
+            largestSccSize = scc.files.length;
+    }
+    const stats = {
+        totalFiles: input.files.length,
+        totalEdges,
+        linkedEdges,
+        unresolvedEdges: totalEdges - linkedEdges,
+        sccCount,
+        largestSccSize,
+    };
+    return Object.freeze({
+        imports: linkedByScope,
+        bindings: bindingsByScope,
+        sccs,
+        stats,
+    });
+}
+function makeEdgeDraft(parsed, file, hooks, workspace) {
+    // Dynamic-unresolved passes through — no `BindingRef`, no target file.
+    if (parsed.kind === 'dynamic-unresolved') {
+        const base = {
+            localName: parsed.localName,
+            targetFile: null,
+            targetExportedName: '',
+            kind: 'dynamic-unresolved',
+        };
+        return {
+            source: parsed,
+            fromFile: file.filePath,
+            fromScope: file.moduleScope,
+            targetFile: null,
+            base,
+            finalized: base, // already fully finalized
+        };
+    }
+    const targetFile = hooks.resolveImportTarget(parsed.targetRaw ?? '', file.filePath, workspace);
+    // Edge is unresolvable at the file level — mark unresolved now.
+    if (targetFile === null) {
+        const edgeKind = parsed.kind === 'wildcard' ? 'wildcard-expanded' : parsed.kind;
+        const localName = parsed.kind === 'wildcard' ? '' : parsed.localName;
+        const targetExportedName = extractExportedName(parsed);
+        const base = {
+            localName,
+            targetFile: null,
+            targetExportedName,
+            kind: edgeKind,
+            linkStatus: 'unresolved',
+        };
+        return {
+            source: parsed,
+            fromFile: file.filePath,
+            fromScope: file.moduleScope,
+            targetFile: null,
+            base,
+            finalized: base,
+        };
+    }
+    // Resolvable at the file level; intra-SCC fixpoint may still fail to fill
+    // in `targetDefId` (e.g., symbol not exported from target).
+    const edgeKind = parsed.kind === 'wildcard' ? 'wildcard-expanded' : parsed.kind;
+    const localName = parsed.kind === 'wildcard' ? '' : parsed.localName;
+    const targetExportedName = extractExportedName(parsed);
+    const base = {
+        localName,
+        targetFile,
+        targetExportedName,
+        kind: edgeKind,
+    };
+    return {
+        source: parsed,
+        fromFile: file.filePath,
+        fromScope: file.moduleScope,
+        targetFile,
+        base,
+        finalized: null,
+    };
+}
+function extractExportedName(parsed) {
+    switch (parsed.kind) {
+        case 'named':
+        case 'alias':
+        case 'namespace':
+        case 'reexport':
+            return parsed.importedName;
+        case 'wildcard':
+        case 'dynamic-unresolved':
+            return '';
+    }
+}
+// ─── Internal: per-edge finalization (phase 3) ─────────────────────────────
+function tryFinalize(draft, byFilePath) {
+    const targetFile = draft.targetFile;
+    if (targetFile === null)
+        return draft.base; // already terminal
+    const targetModule = byFilePath.get(targetFile);
+    if (targetModule === undefined)
+        return draft.base; // external target — leave as-is
+    // Wildcards finalize at the file level; their per-name expansion happens
+    // in phase 4. At this stage we just record the target module scope.
+    if (draft.source.kind === 'wildcard') {
+        return {
+            ...draft.base,
+            targetModuleScope: targetModule.moduleScope,
+        };
+    }
+    // Namespace imports alias the target *module*; they don't name a
+    // specific export. Link the module scope unconditionally. If the target
+    // also exposes a def whose simple name matches `importedName` (some
+    // languages emit a synthetic module-def), pick it up as the `targetDefId`
+    // so consumers can reach the module as a symbol — but its absence is not
+    // a failure.
+    if (draft.source.kind === 'namespace') {
+        const moduleDef = findExportByName(targetModule.localDefs, extractExportedName(draft.source));
+        return {
+            ...draft.base,
+            targetModuleScope: targetModule.moduleScope,
+            ...(moduleDef !== undefined ? { targetDefId: moduleDef.nodeId } : {}),
+        };
+    }
+    // named / alias / reexport: look up the imported name in the target's
+    // local defs. Multi-hop re-export chains settle iteratively — each hop
+    // resolves once its prior hop is finalized.
+    const importedName = extractExportedName(draft.source);
+    const exported = findExportByName(targetModule.localDefs, importedName);
+    if (exported === undefined) {
+        // Target resolvable but the name isn't exported — keep trying in case a
+        // re-export inside the target's SCC surfaces it in a later iteration.
+        return null;
+    }
+    const transitiveVia = draft.source.kind === 'reexport' ? Object.freeze([targetFile]) : undefined;
+    return {
+        ...draft.base,
+        targetModuleScope: targetModule.moduleScope,
+        targetDefId: exported.nodeId,
+        ...(transitiveVia !== undefined ? { transitiveVia } : {}),
+    };
+}
+/**
+ * The "simple" (unqualified) name of a def, for import-name matching.
+ *
+ * Canonical source: `def.qualifiedName` — the tail after the last `.` (or
+ * the whole string if no dot). Defs without a qualifiedName can't be
+ * resolved by name here and return `null`; callers treat that as "name
+ * not exported" and either retry in a later fixpoint iteration or mark
+ * the edge unresolved.
+ */
+function deriveSimpleName(def) {
+    const q = def.qualifiedName;
+    if (q === undefined || q.length === 0)
+        return null;
+    const dot = q.lastIndexOf('.');
+    return dot === -1 ? q : q.slice(dot + 1);
+}
+function findExportByName(defs, name) {
+    for (const d of defs) {
+        if (deriveSimpleName(d) === name)
+            return d;
+    }
+    return undefined;
+}
+function countEdgesWithin(edgeIndex, files) {
+    let n = 0;
+    for (const filePath of files) {
+        const drafts = edgeIndex.get(filePath);
+        if (drafts === undefined)
+            continue;
+        for (const d of drafts) {
+            if (d.targetFile !== null && files.has(d.targetFile))
+                n++;
+        }
+    }
+    // Guarantee at least one pass even for a trivial SCC (ensures deterministic
+    // fixpoint termination even when a single-file SCC has zero intra-SCC edges
+    // but still needs one settle pass).
+    return Math.max(n, 1);
+}
+// ─── Internal: wildcard expansion (phase 4) ────────────────────────────────
+function expandWildcard(edge, byFilePath, hooks, workspace) {
+    if (edge.targetModuleScope === undefined || edge.targetFile === null) {
+        return [edge]; // unresolvable wildcard survives as a single unlinked edge
+    }
+    const target = byFilePath.get(edge.targetFile);
+    if (target === undefined)
+        return [edge];
+    const names = hooks.expandsWildcardTo(edge.targetModuleScope, workspace);
+    if (names.length === 0)
+        return [];
+    const expanded = [];
+    for (const name of names) {
+        const def = findExportByName(target.localDefs, name);
+        if (def === undefined)
+            continue;
+        expanded.push({
+            localName: name,
+            targetFile: edge.targetFile,
+            targetExportedName: name,
+            kind: 'wildcard-expanded',
+            targetModuleScope: edge.targetModuleScope,
+            targetDefId: def.nodeId,
+        });
+    }
+    return expanded;
+}
+// ─── Internal: bindings materialization (phase 5) ───────────────────────────
+function materializeBindings(files, linkedByScope, hooks) {
+    const out = new Map();
+    for (const file of files) {
+        const scopeBindings = new Map();
+        // Start with local defs as `origin: 'local'` bindings.
+        for (const def of file.localDefs) {
+            const name = deriveSimpleName(def);
+            if (name === null)
+                continue;
+            const incoming = [{ def, origin: 'local' }];
+            const existing = scopeBindings.get(name) ?? [];
+            scopeBindings.set(name, hooks.mergeBindings(existing, incoming, file.moduleScope));
+        }
+        // Layer in finalized imports.
+        const imports = linkedByScope.get(file.moduleScope) ?? [];
+        for (const edge of imports) {
+            if (edge.targetDefId === undefined || edge.linkStatus === 'unresolved')
+                continue;
+            // Every def the importing file needs to reach is in some other file's
+            // `localDefs`; walk all files to find it. In practice we could index
+            // this, but at finalize-time N(files) is small per workspace pass.
+            const def = findDefById(files, edge.targetDefId);
+            if (def === undefined)
+                continue;
+            const origin = edge.kind === 'namespace'
+                ? 'namespace'
+                : edge.kind === 'wildcard-expanded'
+                    ? 'wildcard'
+                    : edge.kind === 'reexport'
+                        ? 'reexport'
+                        : 'import';
+            const fallback = deriveSimpleName(def);
+            const name = edge.localName.length > 0 ? edge.localName : fallback;
+            if (name === null)
+                continue;
+            const incoming = [{ def, origin, via: edge }];
+            const existing = scopeBindings.get(name) ?? [];
+            scopeBindings.set(name, hooks.mergeBindings(existing, incoming, file.moduleScope));
+        }
+        // Freeze nested buckets for immutability.
+        const frozen = new Map();
+        for (const [name, refs] of scopeBindings) {
+            frozen.set(name, Object.freeze(refs.slice()));
+        }
+        out.set(file.moduleScope, frozen);
+    }
+    return out;
+}
+function findDefById(files, defId) {
+    for (const f of files) {
+        for (const d of f.localDefs) {
+            if (d.nodeId === defId)
+                return d;
+        }
+    }
+    return undefined;
+}
+// ─── Internal: Tarjan SCC ──────────────────────────────────────────────────
+/**
+ * Iterative Tarjan SCC. Returns SCCs in **reverse-topological** order
+ * (leaves first — a property Tarjan gives for free, and the order
+ * `finalize` wants so leaves are fully resolved before their dependents).
+ */
+function tarjanSccs(graph) {
+    const index = new Map();
+    const lowlink = new Map();
+    const onStack = new Set();
+    const stack = [];
+    const sccs = [];
+    let idx = 0;
+    // Iterative DFS to avoid stack overflow on deep import chains.
+    const allNodes = Array.from(graph.keys()).sort(); // deterministic order
+    const iterStack = [];
+    for (const root of allNodes) {
+        if (index.has(root))
+            continue;
+        iterStack.push({
+            node: root,
+            children: (graph.get(root) ?? new Set()).values(),
+            entered: false,
+        });
+        while (iterStack.length > 0) {
+            const frame = iterStack[iterStack.length - 1];
+            if (!frame.entered) {
+                frame.entered = true;
+                index.set(frame.node, idx);
+                lowlink.set(frame.node, idx);
+                idx++;
+                stack.push(frame.node);
+                onStack.add(frame.node);
+            }
+            const nextChild = frame.children.next();
+            if (nextChild.done) {
+                // Post-visit: compute SCC membership if frame.node is a root.
+                if (lowlink.get(frame.node) === index.get(frame.node)) {
+                    const scc = [];
+                    let selfInCycle = false;
+                    while (true) {
+                        const w = stack.pop();
+                        onStack.delete(w);
+                        scc.push(w);
+                        // A single-file self-loop counts as a cycle.
+                        if (w === frame.node) {
+                            selfInCycle = (graph.get(w) ?? new Set()).has(w);
+                            break;
+                        }
+                    }
+                    const isCycle = scc.length > 1 || selfInCycle;
+                    sccs.push({ files: Object.freeze(scc), isCycle });
+                }
+                iterStack.pop();
+                // Propagate lowlink to parent.
+                if (iterStack.length > 0) {
+                    const parent = iterStack[iterStack.length - 1];
+                    lowlink.set(parent.node, Math.min(lowlink.get(parent.node), lowlink.get(frame.node)));
+                }
+                continue;
+            }
+            const child = nextChild.value;
+            if (!index.has(child)) {
+                iterStack.push({
+                    node: child,
+                    children: (graph.get(child) ?? new Set()).values(),
+                    entered: false,
+                });
+            }
+            else if (onStack.has(child)) {
+                lowlink.set(frame.node, Math.min(lowlink.get(frame.node), index.get(child)));
+            }
+        }
+    }
+    return sccs;
+}
+//# sourceMappingURL=finalize-algorithm.js.map

package/dist/_shared/scope-resolution/finalize-algorithm.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"finalize-algorithm.js","sourceRoot":"","sources":["../../src/scope-resolution/finalize-algorithm.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AA8HH,8EAA8E;AAE9E,MAAM,UAAU,QAAQ,CAAC,KAAoB,EAAE,KAAoB;IACjE,MAAM,UAAU,GAAG,IAAI,GAAG,EAAwB,CAAC;IACnD,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK;QAAE,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IAE3D,yEAAyE;IACzE,gEAAgE;IAChE,sEAAsE;IACtE,2BAA2B;IAC3B,MAAM,SAAS,GAAG,IAAI,GAAG,EAA6B,CAAC,CAAC,oBAAoB;IAC5E,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAsB,EAAE,CAAC;QACrC,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,aAAa,EAAE,CAAC;YACxC,MAAM,KAAK,GAAG,aAAa,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,cAAc,CAAC,CAAC;YACvE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnB,UAAU,EAAE,CAAC;QACf,CAAC;QACD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IACvC,CAAC;IAED,wEAAwE;IACxE,gEAAgE;IAChE,wBAAwB;IACxB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC7C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,EAAE,IAAI,GAAG,EAAE,CAAC,CAAC;IACtC,CAAC;IACD,KAAK,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;QAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,CAAC,CAAC,UAAU,KAAK,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,EAAE,CAAC;gBAC1D,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;IACH,CAAC;IAED,6DAA6D;IAC7D,MAAM,IAAI,GAAG,UAAU,CAAC,KAAK,CAAC,CAAC;IAE/B,wEAAwE;IACxE,yEAAyE;IACzE,kEAAkE;IAClE,qEAAqE;IACrE,MAAM,aAAa,GAAG,IAAI,GAAG,EAAkC,CAAC;IAChE,IAAI,WAAW,GAAG,CAAC,CAAC;IAEpB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACpC,MAAM,QAAQ,GAAG,gBAAgB,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;QAEvD,wEAAwE;QACxE,sEAAsE;QACtE,qBAAqB;QACrB,IAAI,UAAU,GAAG,IAAI,CAAC;QACtB,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,OAAO,UAAU,IAAI,UAAU,GAAG,QAAQ,EAAE,CAAC;YAC3C,UAAU,GAAG,KAAK,CAAC;YACnB,UAAU,EAAE,CAAC;YACb,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;gBACjC,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;gBACxC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;oBAC3B,IAAI,KAAK,CAAC,SAAS,KAAK,IAAI;wBAAE,SAAS;oBACvC,MAAM,SAAS,GAAG,WAAW,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;oBACjD,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;wBACvB,KAAK,CAAC,SAAS,GAAG,SAAS,CAAC;wBAC5B,UAAU,GAAG,IAAI,CAAC;oBACpB,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAED,2EAA2E;QAC3E,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;YACjC,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC;YACxC,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;gBAC3B,IAAI,KAAK,CAAC,SAAS,KAAK,IAAI;oBAAE,SAAS;gBACvC,KAAK,CAAC,SAAS,GAAG;oBAChB,GAAG,KAAK,CAAC,IAAI;oBACb,UAAU,EAAE,YAAqB;iBAClC,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,4EAA4E;IAC5E,sEAAsE;IACtE,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAE,CAAC;QAC7C,MAAM,SAAS,GAAiB,EAAE,CAAC;QACnC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,MAAM,IAAI,GAAG,CAAC,CAAC,SAAU,CAAC;YAC1B,IAAI,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,UAAU,KAAK,YAAY,EAAE,CAAC;gBACrE,gEAAgE;gBAChE,MAAM,QAAQ,GAAG,cAAc,CAAC,IAAI,EAAE,UAAU,EAAE,KAAK,EAAE,KAAK,CAAC,cAAc,CAAC,CAAC;gBAC/E,KAAK,MAAM,CAAC,IAAI,QAAQ;oBAAE,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC9C,CAAC;iBAAM,CAAC;gBACN,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACvB,CAAC;YACD,IAAI,IAAI,CAAC,UAAU,KAAK,YAAY;gBAAE,WAAW,EAAE,CAAC;QACtD,CAAC;QACD,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC,CAAC;IAChE,CAAC;IAED,+EAA+E;IAC/E,qDAAqD;IACrD,MAAM,eAAe,GAAG,mBAAmB,CAAC,KAAK,CAAC,KAAK,EAAE,aAAa,EAAE,KAAK,CAAC,CAAC;IAE/E,YAAY;IACZ,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC;IAC7B,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,IAAI,GAAG,CAAC,KAAK,CAAC,MAAM,GAAG,cAAc;YAAE,cAAc,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC;IAC3E,CAAC;IACD,MAAM,KAAK,GAAkB;QAC3B,UAAU,EAAE,KAAK,CAAC,KAAK,CAAC,MAAM;QAC9B,UAAU;QACV,WAAW;QACX,eAAe,EAAE,UAAU,GAAG,WAAW;QACzC,QAAQ;QACR,cAAc;KACf,CAAC;IAEF,OAAO,MAAM,CAAC,MAAM,CAAC;QACnB,OAAO,EAAE,aAAa;QACtB,QAAQ,EAAE,eAAe;QACzB,IAAI;QACJ,KAAK;KACN,CAAC,CAAC;AACL,CAAC;AAaD,SAAS,aAAa,CACpB,MAAoB,EACpB,IAAkB,EAClB,KAAoB,EACpB,SAAyB;IAEzB,uEAAuE;IACvE,IAAI,MAAM,CAAC,IAAI,KAAK,oBAAoB,EAAE,CAAC;QACzC,MAAM,IAAI,GAAe;YACvB,SAAS,EAAE,MAAM,CAAC,SAAS;YAC3B,UAAU,EAAE,IAAI;YAChB,kBAAkB,EAAE,EAAE;YACtB,IAAI,EAAE,oBAAoB;SAC3B,CAAC;QACF,OAAO;YACL,MAAM,EAAE,MAAM;YACd,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,SAAS,EAAE,IAAI,CAAC,WAAW;YAC3B,UAAU,EAAE,IAAI;YAChB,IAAI;YACJ,SAAS,EAAE,IAAI,EAAE,0BAA0B;SAC5C,CAAC;IACJ,CAAC;IAED,MAAM,UAAU,GAAG,KAAK,CAAC,mBAAmB,CAAC,MAAM,CAAC,SAAS,IAAI,EAAE,EAAE,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;IAE/F,gEAAgE;IAChE,IAAI,UAAU,KAAK,IAAI,EAAE,CAAC;QACxB,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;QAChF,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC;QACrE,MAAM,kBAAkB,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC;QACvD,MAAM,IAAI,GAAe;YACvB,SAAS;YACT,UAAU,EAAE,IAAI;YAChB,kBAAkB;YAClB,IAAI,EAAE,QAAQ;YACd,UAAU,EAAE,YAAY;SACzB,CAAC;QACF,OAAO;YACL,MAAM,EAAE,MAAM;YACd,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,SAAS,EAAE,IAAI,CAAC,WAAW;YAC3B,UAAU,EAAE,IAAI;YAChB,IAAI;YACJ,SAAS,EAAE,IAAI;SAChB,CAAC;IACJ,CAAC;IAED,0EAA0E;IAC1E,4DAA4D;IAC5D,MAAM,QAAQ,GAAG,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC;IAChF,MAAM,SAAS,GAAG,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,SAAS,CAAC;IACrE,MAAM,kBAAkB,GAAG,mBAAmB,CAAC,MAAM,CAAC,CAAC;IACvD,MAAM,IAAI,GAAe;QACvB,SAAS;QACT,UAAU;QACV,kBAAkB;QAClB,IAAI,EAAE,QAAQ;KACf,CAAC;IACF,OAAO;QACL,MAAM,EAAE,MAAM;QACd,QAAQ,EAAE,IAAI,CAAC,QAAQ;QACvB,SAAS,EAAE,IAAI,CAAC,WAAW;QAC3B,UAAU;QACV,IAAI;QACJ,SAAS,EAAE,IAAI;KAChB,CAAC;AACJ,CAAC;AAED,SAAS,mBAAmB,CAAC,MAAoB;IAC/C,QAAQ,MAAM,CAAC,IAAI,EAAE,CAAC;QACpB,KAAK,OAAO,CAAC;QACb,KAAK,OAAO,CAAC;QACb,KAAK,WAAW,CAAC;QACjB,KAAK,UAAU;YACb,OAAO,MAAM,CAAC,YAAY,CAAC;QAC7B,KAAK,UAAU,CAAC;QAChB,KAAK,oBAAoB;YACvB,OAAO,EAAE,CAAC;IACd,CAAC;AACH,CAAC;AAED,8EAA8E;AAE9E,SAAS,WAAW,CAClB,KAAsB,EACtB,UAAqC;IAErC,MAAM,UAAU,GAAG,KAAK,CAAC,UAAU,CAAC;IACpC,IAAI,UAAU,KAAK,IAAI;QAAE,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,mBAAmB;IAE/D,MAAM,YAAY,GAAG,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;IAChD,IAAI,YAAY,KAAK,SAAS;QAAE,OAAO,KAAK,CAAC,IAAI,CAAC,CAAC,gCAAgC;IAEnF,yEAAyE;IACzE,oEAAoE;IACpE,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;QACrC,OAAO;YACL,GAAG,KAAK,CAAC,IAAI;YACb,iBAAiB,EAAE,YAAY,CAAC,WAAW;SAC5C,CAAC;IACJ,CAAC;IAED,iEAAiE;IACjE,wEAAwE;IACxE,oEAAoE;IACpE,0EAA0E;IAC1E,yEAAyE;IACzE,aAAa;IACb,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;QACtC,MAAM,SAAS,GAAG,gBAAgB,CAAC,YAAY,CAAC,SAAS,EAAE,mBAAmB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;QAC9F,OAAO;YACL,GAAG,KAAK,CAAC,IAAI;YACb,iBAAiB,EAAE,YAAY,CAAC,WAAW;YAC3C,GAAG,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,WAAW,EAAE,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACtE,CAAC;IACJ,CAAC;IAED,sEAAsE;IACtE,uEAAuE;IACvE,4CAA4C;IAC5C,MAAM,YAAY,GAAG,mBAAmB,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC;IACvD,MAAM,QAAQ,GAAG,gBAAgB,CAAC,YAAY,CAAC,SAAS,EAAE,YAAY,CAAC,CAAC;IAExE,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;QAC3B,wEAAwE;QACxE,sEAAsE;QACtE,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAEjG,OAAO;QACL,GAAG,KAAK,CAAC,IAAI;QACb,iBAAiB,EAAE,YAAY,CAAC,WAAW;QAC3C,WAAW,EAAE,QAAQ,CAAC,MAAM;QAC5B,GAAG,CAAC,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KAC1D,CAAC;AACJ,CAAC;AAED;;;;;;;;GAQG;AACH,SAAS,gBAAgB,CAAC,GAAqB;IAC7C,MAAM,CAAC,GAAG,GAAG,CAAC,aAAa,CAAC;IAC5B,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IACnD,MAAM,GAAG,GAAG,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC;IAC/B,OAAO,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC;AAC3C,CAAC;AAED,SAAS,gBAAgB,CACvB,IAAiC,EACjC,IAAY;IAEZ,KAAK,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;QACrB,IAAI,gBAAgB,CAAC,CAAC,CAAC,KAAK,IAAI;YAAE,OAAO,CAAC,CAAC;IAC7C,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,gBAAgB,CAAC,SAAyC,EAAE,KAAkB;IACrF,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,KAAK,MAAM,QAAQ,IAAI,KAAK,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QACvC,IAAI,MAAM,KAAK,SAAS;YAAE,SAAS;QACnC,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,IAAI,CAAC,CAAC,UAAU,KAAK,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,UAAU,CAAC;gBAAE,CAAC,EAAE,CAAC;QAC5D,CAAC;IACH,CAAC;IACD,4EAA4E;IAC5E,4EAA4E;IAC5E,oCAAoC;IACpC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;AACxB,CAAC;AAED,8EAA8E;AAE9E,SAAS,cAAc,CACrB,IAAgB,EAChB,UAAqC,EACrC,KAAoB,EACpB,SAAyB;IAEzB,IAAI,IAAI,CAAC,iBAAiB,KAAK,SAAS,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,EAAE,CAAC;QACrE,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,2DAA2D;IAC5E,CAAC;IACD,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;IAC/C,IAAI,MAAM,KAAK,SAAS;QAAE,OAAO,CAAC,IAAI,CAAC,CAAC;IAExC,MAAM,KAAK,GAAG,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,iBAAiB,EAAE,SAAS,CAAC,CAAC;IACzE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,MAAM,QAAQ,GAAiB,EAAE,CAAC;IAClC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,GAAG,GAAG,gBAAgB,CAAC,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,CAAC;QACrD,IAAI,GAAG,KAAK,SAAS;YAAE,SAAS;QAChC,QAAQ,CAAC,IAAI,CAAC;YACZ,SAAS,EAAE,IAAI;YACf,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,kBAAkB,EAAE,IAAI;YACxB,IAAI,EAAE,mBAAmB;YACzB,iBAAiB,EAAE,IAAI,CAAC,iBAAiB;YACzC,WAAW,EAAE,GAAG,CAAC,MAAM;SACxB,CAAC,CAAC;IACL,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,+EAA+E;AAE/E,SAAS,mBAAmB,CAC1B,KAA8B,EAC9B,aAA0D,EAC1D,KAAoB;IAEpB,MAAM,GAAG,GAAG,IAAI,GAAG,EAAuD,CAAC;IAE3E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,aAAa,GAAG,IAAI,GAAG,EAAiC,CAAC;QAE/D,uDAAuD;QACvD,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACjC,MAAM,IAAI,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;YACnC,IAAI,IAAI,KAAK,IAAI;gBAAE,SAAS;YAC5B,MAAM,QAAQ,GAAiB,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC,CAAC;YAC1D,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAC/C,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,aAAa,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;QACrF,CAAC;QAED,8BAA8B;QAC9B,MAAM,OAAO,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QAC1D,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;YAC3B,IAAI,IAAI,CAAC,WAAW,KAAK,SAAS,IAAI,IAAI,CAAC,UAAU,KAAK,YAAY;gBAAE,SAAS;YACjF,sEAAsE;YACtE,qEAAqE;YACrE,mEAAmE;YACnE,MAAM,GAAG,GAAG,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;YACjD,IAAI,GAAG,KAAK,SAAS;gBAAE,SAAS;YAEhC,MAAM,MAAM,GACV,IAAI,CAAC,IAAI,KAAK,WAAW;gBACvB,CAAC,CAAC,WAAW;gBACb,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,mBAAmB;oBACjC,CAAC,CAAC,UAAU;oBACZ,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,UAAU;wBACxB,CAAC,CAAC,UAAU;wBACZ,CAAC,CAAC,QAAQ,CAAC;YACnB,MAAM,QAAQ,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;YACvC,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,CAAC;YACnE,IAAI,IAAI,KAAK,IAAI;gBAAE,SAAS;YAC5B,MAAM,QAAQ,GAAiB,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC;YAC5D,MAAM,QAAQ,GAAG,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAC/C,aAAa,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,aAAa,CAAC,QAAQ,EAAE,QAAQ,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC;QACrF,CAAC;QAED,0CAA0C;QAC1C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAiC,CAAC;QACxD,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,aAAa,EAAE,CAAC;YACzC,MAAM,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAChD,CAAC;QACD,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;IACpC,CAAC;IAED,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,WAAW,CAAC,KAA8B,EAAE,KAAa;IAChE,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;QACtB,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,CAAC;YAC5B,IAAI,CAAC,CAAC,MAAM,KAAK,KAAK;gBAAE,OAAO,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,8EAA8E;AAE9E;;;;GAIG;AACH,SAAS,UAAU,CAAC,KAA+C;IACjE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAmB,EAAE,CAAC;IAChC,IAAI,GAAG,GAAG,CAAC,CAAC;IAEZ,+DAA+D;IAC/D,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,sBAAsB;IACxE,MAAM,SAAS,GAA0E,EAAE,CAAC;IAE5F,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAC9B,SAAS,CAAC,IAAI,CAAC;YACb,IAAI,EAAE,IAAI;YACV,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC,CAAC,MAAM,EAAE;YACzD,OAAO,EAAE,KAAK;SACf,CAAC,CAAC;QACH,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,MAAM,KAAK,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;YAE/C,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;gBACnB,KAAK,CAAC,OAAO,GAAG,IAAI,CAAC;gBACrB,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBAC3B,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;gBAC7B,GAAG,EAAE,CAAC;gBACN,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBACvB,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;YAC1B,CAAC;YAED,MAAM,SAAS,GAAG,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC;YACxC,IAAI,SAAS,CAAC,IAAI,EAAE,CAAC;gBACnB,8DAA8D;gBAC9D,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;oBACtD,MAAM,GAAG,GAAa,EAAE,CAAC;oBACzB,IAAI,WAAW,GAAG,KAAK,CAAC;oBACxB,OAAO,IAAI,EAAE,CAAC;wBACZ,MAAM,CAAC,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;wBACvB,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;wBAClB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;wBACZ,6CAA6C;wBAC7C,IAAI,CAAC,KAAK,KAAK,CAAC,IAAI,EAAE,CAAC;4BACrB,WAAW,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;4BACjD,MAAM;wBACR,CAAC;oBACH,CAAC;oBACD,MAAM,OAAO,GAAG,GAAG,CAAC,MAAM,GAAG,CAAC,IAAI,WAAW,CAAC;oBAC9C,IAAI,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,CAAC,CAAC;gBACpD,CAAC;gBACD,SAAS,CAAC,GAAG,EAAE,CAAC;gBAChB,+BAA+B;gBAC/B,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBACzB,MAAM,MAAM,GAAG,SAAS,CAAC,SAAS,CAAC,MAAM,GAAG,CAAC,CAAE,CAAC;oBAChD,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAE,CAAC,CAAC,CAAC;gBAC1F,CAAC;gBACD,SAAS;YACX,CAAC;YAED,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC;YAC9B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBACtB,SAAS,CAAC,IAAI,CAAC;oBACb,IAAI,EAAE,KAAK;oBACX,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,IAAI,GAAG,EAAU,CAAC,CAAC,MAAM,EAAE;oBAC1D,OAAO,EAAE,KAAK;iBACf,CAAC,CAAC;YACL,CAAC;iBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC9B,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAE,EAAE,KAAK,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC,CAAC,CAAC;YACjF,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/_shared/scope-resolution/method-dispatch-index.d.ts

@@ -0,0 +1,80 @@
+/**
+ * `MethodDispatchIndex` — materialized view of class hierarchies keyed by
+ * `DefId` (RFC §3.1; Ring 2 SHARED #914).
+ *
+ * Two O(1)-access maps used by `Registry.lookupMethod` and interface-
+ * dispatch callers:
+ *
+ *   - `mroByOwnerDefId`       : owner class → full MRO ancestor chain
+ *                               (excludes the owner itself, in per-language
+ *                               strategy order).
+ *   - `implsByInterfaceDefId` : interface/trait → classes that implement it.
+ *
+ * **Not an MRO implementation.** The build function is a pure aggregator: it
+ * asks the caller (via `computeMro` and `implementsOf` callbacks) for the
+ * per-language answers and materializes the two-way index. MRO strategies
+ * live where they already do today (`model/resolve.ts § c3Linearize`,
+ * `languages/ruby.ts § selectDispatch`, etc.) — this index does not
+ * reimplement them.
+ *
+ * Why callbacks and not a shared strategy registry: the five strategies
+ * (Python C3, Ruby kind-aware, Java/Kotlin linear, Rust qualified-syntax,
+ * COBOL none) already exist in the CLI package and depend on the CLI's
+ * `HeritageMap` + `SemanticModel`. Pulling them into `gitnexus-shared` would
+ * require migrating both — out of scope for #914. Callbacks let the shared
+ * build stay pure while honoring existing strategies verbatim.
+ *
+ * Consumed by: #917 (`Registry.lookupMethod` MRO fast path, interface
+ * dispatch resolver).
+ */
+import type { DefId } from './types.js';
+export interface MethodDispatchIndex {
+    /**
+     * Full MRO ancestor chain per owner class (excludes the owner itself).
+     * Order reflects the per-language strategy used by `computeMro`.
+     */
+    readonly mroByOwnerDefId: ReadonlyMap<DefId, readonly DefId[]>;
+    /** Interfaces / traits → classes that implement them. */
+    readonly implsByInterfaceDefId: ReadonlyMap<DefId, readonly DefId[]>;
+    /** `mroByOwnerDefId.get`, with an empty frozen array on miss. */
+    mroFor(ownerDefId: DefId): readonly DefId[];
+    /** `implsByInterfaceDefId.get`, with an empty frozen array on miss. */
+    implementorsOf(interfaceDefId: DefId): readonly DefId[];
+}
+export interface MethodDispatchInput {
+    /**
+     * Owner defs to index (classes, structs, traits, interfaces — any kind
+     * that can appear on the owner side of a method-dispatch graph).
+     */
+    readonly owners: readonly DefId[];
+    /**
+     * Return the full MRO ancestor chain for `ownerDefId`, **excluding the
+     * owner itself**, in the order dictated by the owner's language-specific
+     * MRO strategy.
+     *
+     * Contract:
+     *   - Pure (no side effects).
+     *   - Deterministic per input.
+     *   - `undefined` not allowed — return `[]` when the owner has no parents.
+     */
+    readonly computeMro: (ownerDefId: DefId) => readonly DefId[];
+    /**
+     * Return the set of interface/trait defs that `ownerDefId` implements.
+     * Transitive inclusion (e.g., `implements` on a parent class) is the
+     * caller's choice — the build function simply inverts whatever is
+     * returned.
+     *
+     * Repeated IDs in the output are deduplicated automatically.
+     *
+     * **Call-count contract.** `implementsOf` is invoked **once per
+     * occurrence** of an owner in `input.owners`, not once per unique
+     * owner. Duplicate owners therefore re-invoke it; dedup happens at
+     * the bucket layer (after the callback returns). Callers with
+     * expensive `implementsOf` implementations should pass a deduplicated
+     * `owners` list. `computeMro`, by contrast, is memoized by the first-
+     * write-wins policy and fires at most once per unique owner.
+     */
+    readonly implementsOf: (ownerDefId: DefId) => readonly DefId[];
+}
+export declare function buildMethodDispatchIndex(input: MethodDispatchInput): MethodDispatchIndex;
+//# sourceMappingURL=method-dispatch-index.d.ts.map

package/dist/_shared/scope-resolution/method-dispatch-index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"method-dispatch-index.d.ts","sourceRoot":"","sources":["../../src/scope-resolution/method-dispatch-index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA4BG;AAEH,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAC;AAIxC,MAAM,WAAW,mBAAmB;IAClC;;;OAGG;IACH,QAAQ,CAAC,eAAe,EAAE,WAAW,CAAC,KAAK,EAAE,SAAS,KAAK,EAAE,CAAC,CAAC;IAC/D,yDAAyD;IACzD,QAAQ,CAAC,qBAAqB,EAAE,WAAW,CAAC,KAAK,EAAE,SAAS,KAAK,EAAE,CAAC,CAAC;IAErE,iEAAiE;IACjE,MAAM,CAAC,UAAU,EAAE,KAAK,GAAG,SAAS,KAAK,EAAE,CAAC;IAC5C,uEAAuE;IACvE,cAAc,CAAC,cAAc,EAAE,KAAK,GAAG,SAAS,KAAK,EAAE,CAAC;CACzD;AAED,MAAM,WAAW,mBAAmB;IAClC;;;OAGG;IACH,QAAQ,CAAC,MAAM,EAAE,SAAS,KAAK,EAAE,CAAC;IAClC;;;;;;;;;OASG;IACH,QAAQ,CAAC,UAAU,EAAE,CAAC,UAAU,EAAE,KAAK,KAAK,SAAS,KAAK,EAAE,CAAC;IAC7D;;;;;;;;;;;;;;;OAeG;IACH,QAAQ,CAAC,YAAY,EAAE,CAAC,UAAU,EAAE,KAAK,KAAK,SAAS,KAAK,EAAE,CAAC;CAChE;AAID,wBAAgB,wBAAwB,CAAC,KAAK,EAAE,mBAAmB,GAAG,mBAAmB,CAqCxF"}

package/dist/_shared/scope-resolution/method-dispatch-index.js

@@ -0,0 +1,79 @@
+/**
+ * `MethodDispatchIndex` — materialized view of class hierarchies keyed by
+ * `DefId` (RFC §3.1; Ring 2 SHARED #914).
+ *
+ * Two O(1)-access maps used by `Registry.lookupMethod` and interface-
+ * dispatch callers:
+ *
+ *   - `mroByOwnerDefId`       : owner class → full MRO ancestor chain
+ *                               (excludes the owner itself, in per-language
+ *                               strategy order).
+ *   - `implsByInterfaceDefId` : interface/trait → classes that implement it.
+ *
+ * **Not an MRO implementation.** The build function is a pure aggregator: it
+ * asks the caller (via `computeMro` and `implementsOf` callbacks) for the
+ * per-language answers and materializes the two-way index. MRO strategies
+ * live where they already do today (`model/resolve.ts § c3Linearize`,
+ * `languages/ruby.ts § selectDispatch`, etc.) — this index does not
+ * reimplement them.
+ *
+ * Why callbacks and not a shared strategy registry: the five strategies
+ * (Python C3, Ruby kind-aware, Java/Kotlin linear, Rust qualified-syntax,
+ * COBOL none) already exist in the CLI package and depend on the CLI's
+ * `HeritageMap` + `SemanticModel`. Pulling them into `gitnexus-shared` would
+ * require migrating both — out of scope for #914. Callbacks let the shared
+ * build stay pure while honoring existing strategies verbatim.
+ *
+ * Consumed by: #917 (`Registry.lookupMethod` MRO fast path, interface
+ * dispatch resolver).
+ */
+// ─── Builder ────────────────────────────────────────────────────────────────
+export function buildMethodDispatchIndex(input) {
+    const mroByOwnerDefId = new Map();
+    const implsBuilding = new Map();
+    const implsSeen = new Map();
+    for (const ownerId of input.owners) {
+        // First-write-wins on duplicate owner ids: a stable policy consistent
+        // with sibling indexes (#913 DefIndex / ModuleScopeIndex).
+        if (!mroByOwnerDefId.has(ownerId)) {
+            const chain = input.computeMro(ownerId);
+            mroByOwnerDefId.set(ownerId, Object.freeze(chain.slice()));
+        }
+        for (const ifaceId of input.implementsOf(ownerId)) {
+            let seen = implsSeen.get(ifaceId);
+            if (seen === undefined) {
+                seen = new Set();
+                implsSeen.set(ifaceId, seen);
+            }
+            if (seen.has(ownerId))
+                continue;
+            seen.add(ownerId);
+            let bucket = implsBuilding.get(ifaceId);
+            if (bucket === undefined) {
+                bucket = [];
+                implsBuilding.set(ifaceId, bucket);
+            }
+            bucket.push(ownerId);
+        }
+    }
+    const implsByInterfaceDefId = new Map();
+    for (const [ifaceId, owners] of implsBuilding) {
+        implsByInterfaceDefId.set(ifaceId, Object.freeze(owners.slice()));
+    }
+    return wrapIndex(mroByOwnerDefId, implsByInterfaceDefId);
+}
+// ─── Internal ───────────────────────────────────────────────────────────────
+const EMPTY = Object.freeze([]);
+function wrapIndex(mroByOwnerDefId, implsByInterfaceDefId) {
+    return {
+        mroByOwnerDefId,
+        implsByInterfaceDefId,
+        mroFor(ownerDefId) {
+            return mroByOwnerDefId.get(ownerDefId) ?? EMPTY;
+        },
+        implementorsOf(interfaceDefId) {
+            return implsByInterfaceDefId.get(interfaceDefId) ?? EMPTY;
+        },
+    };
+}
+//# sourceMappingURL=method-dispatch-index.js.map