@sapiom/harness 0.8.9 → 0.9.0

package/dist/core/system-graph.js

@@ -0,0 +1,321 @@
+import { createHash } from "node:crypto";
+import * as path from "node:path";
+import { workspaceRelativeLocalKey } from "../shared/system-graph.js";
+import { canonicalGraphPath, isWithinGraphPath, } from "./system-graph-inventory.js";
+import { CachedAgentRelationshipProvider, SourceAgentRelationshipProvider, } from "./system-graph-relationships.js";
+export { HarnessRegistryInventoryProvider } from "./system-graph-inventory.js";
+export { CachedAgentRelationshipProvider, SourceAgentRelationshipProvider, } from "./system-graph-relationships.js";
+function workspaceKeyForRoot(root) {
+    return `workspace-${createHash("sha256").update(root).digest("hex").slice(0, 16)}`;
+}
+/**
+ * Resolves only roots the running Studio already knows about. A caller cannot
+ * manufacture a key and turn the graph endpoint into an arbitrary path scan.
+ */
+export class LocalWorkspaceScopeCatalog {
+    constructor(listRoots) {
+        this.listRoots = listRoots;
+    }
+    async list() {
+        const byRoot = new Map();
+        for (const root of await this.listRoots()) {
+            const canonical = canonicalGraphPath(root);
+            byRoot.set(canonical, {
+                workspaceKey: workspaceKeyForRoot(canonical),
+                cwd: root,
+            });
+        }
+        return [...byRoot.entries()]
+            .sort(([left], [right]) => left.localeCompare(right))
+            .map(([, summary]) => summary);
+    }
+    async resolve(workspaceKey) {
+        for (const root of await this.listRoots()) {
+            const canonical = canonicalGraphPath(root);
+            if (workspaceKeyForRoot(canonical) === workspaceKey) {
+                return { workspaceKey, root: canonical };
+            }
+        }
+        return null;
+    }
+}
+function warningOrder(left, right) {
+    return (left.code.localeCompare(right.code) ||
+        (left.agentKey ?? "").localeCompare(right.agentKey ?? "") ||
+        left.message.localeCompare(right.message));
+}
+function fallbackAgentKey(scope, sourceRoot) {
+    const canonicalScope = canonicalGraphPath(scope.root);
+    const canonicalSource = canonicalGraphPath(sourceRoot);
+    if (isWithinGraphPath(canonicalScope, canonicalSource)) {
+        const localKey = workspaceRelativeLocalKey(canonicalScope, canonicalSource);
+        if (localKey)
+            return localKey;
+    }
+    return `local:${createHash("sha256")
+        .update(canonicalSource)
+        .digest("hex")
+        .slice(0, 16)}`;
+}
+function safeAgentKey(value) {
+    const key = value.trim();
+    if (key === "" ||
+        /[\0\r\n]/.test(key) ||
+        path.posix.isAbsolute(key) ||
+        path.win32.isAbsolute(key) ||
+        key.includes("\\")) {
+        return null;
+    }
+    if (!key.startsWith("local:"))
+        return key.includes("/") ? null : key;
+    const relative = key.slice("local:".length);
+    if (relative === "" ||
+        path.posix.isAbsolute(relative) ||
+        path.win32.isAbsolute(relative) ||
+        relative
+            .split("/")
+            .some((segment) => segment === "" || segment === "." || segment === "..")) {
+        return null;
+    }
+    return key;
+}
+function safeLabel(value, agentKey) {
+    const label = value.trim();
+    if (label !== "" &&
+        !/[\0\r\n]/.test(label) &&
+        !path.posix.isAbsolute(label) &&
+        !path.win32.isAbsolute(label)) {
+        return label;
+    }
+    if (agentKey.startsWith("local:")) {
+        return agentKey.slice("local:".length) || "Local agent";
+    }
+    return agentKey;
+}
+/**
+ * The provider contract promises safe unique keys, but projection is the last
+ * server-side boundary before serialization. Re-assert that invariant here so
+ * a future provider cannot make the browser reject the whole graph payload.
+ */
+function normalizeInventory(scope, inventory) {
+    const prepared = inventory
+        .map((agent) => {
+        const fallbackKey = fallbackAgentKey(scope, agent.sourceRoot);
+        return {
+            agent,
+            candidateKey: safeAgentKey(agent.agentKey) ?? fallbackKey,
+            fallbackKey,
+        };
+    })
+        .sort((left, right) => left.candidateKey.localeCompare(right.candidateKey) ||
+        left.agent.sourceRoot.localeCompare(right.agent.sourceRoot) ||
+        left.agent.label.localeCompare(right.agent.label));
+    const counts = new Map();
+    for (const item of prepared) {
+        counts.set(item.candidateKey, (counts.get(item.candidateKey) ?? 0) + 1);
+    }
+    const used = new Set();
+    const duplicateKeys = new Set([...counts.entries()]
+        .filter(([, count]) => count > 1)
+        .map(([candidateKey]) => candidateKey));
+    const agents = prepared.map(({ agent, candidateKey, fallbackKey }) => {
+        const duplicate = (counts.get(candidateKey) ?? 0) > 1;
+        let agentKey = duplicate ? fallbackKey : candidateKey;
+        if (used.has(agentKey)) {
+            duplicateKeys.add(agentKey);
+            agentKey = fallbackKey;
+        }
+        const base = agentKey;
+        let suffix = 2;
+        while (used.has(agentKey)) {
+            duplicateKeys.add(base);
+            agentKey = `${base}~${suffix}`;
+            suffix += 1;
+        }
+        used.add(agentKey);
+        const resolutionAliases = [
+            ...new Set([
+                ...(agentKey !== candidateKey ? [candidateKey] : []),
+                ...agent.resolutionAliases,
+            ]
+                .map(safeAgentKey)
+                .filter((alias) => alias !== null)),
+        ];
+        return {
+            ...agent,
+            agentKey,
+            label: safeLabel(agent.label, agentKey),
+            resolutionAliases,
+        };
+    });
+    agents.sort((left, right) => left.agentKey.localeCompare(right.agentKey) ||
+        left.sourceRoot.localeCompare(right.sourceRoot));
+    const warnings = [];
+    for (const candidateKey of [...duplicateKeys].sort()) {
+        warnings.push({
+            code: "duplicate-agent-key",
+            agentKey: candidateKey,
+            message: `Multiple agents use ${candidateKey}; kept each with a local identity.`,
+        });
+    }
+    return { agents, warnings };
+}
+export class StaticSystemGraphBuilder {
+    constructor(inventory, relationships = new CachedAgentRelationshipProvider(new SourceAgentRelationshipProvider())) {
+        this.inventory = inventory;
+        this.relationships = relationships;
+        this.callersByWorkspace = new Map();
+    }
+    async build(scope) {
+        const inventory = await this.inventory.listAgents(scope);
+        const normalized = normalizeInventory(scope, inventory.agents);
+        const agents = normalized.agents;
+        this.callersByWorkspace.set(scope.workspaceKey, agents);
+        this.retainRelationshipCallers();
+        const nodes = agents.map((agent) => ({
+            id: `agent:${agent.agentKey}`,
+            agentKey: agent.agentKey,
+            label: agent.label,
+        }));
+        const byTarget = new Map();
+        const registerTarget = (key, agent) => {
+            const candidates = byTarget.get(key) ?? [];
+            if (!candidates.some((candidate) => candidate.agentKey === agent.agentKey)) {
+                candidates.push(agent);
+                byTarget.set(key, candidates);
+            }
+        };
+        for (const agent of agents) {
+            registerTarget(agent.agentKey, agent);
+            for (const alias of agent.resolutionAliases) {
+                registerTarget(alias, agent);
+            }
+        }
+        const edges = [];
+        const warnings = [
+            ...inventory.warnings,
+            ...normalized.warnings,
+        ];
+        const seenEdges = new Set();
+        let relationshipsComplete = true;
+        // Source walks are independent. Run them together so first-open latency is
+        // bounded by the slowest agent tree rather than the sum of every tree.
+        const scans = await Promise.all(agents.map(async (caller) => {
+            try {
+                return {
+                    caller,
+                    result: await this.relationships.listRelationships(caller),
+                    failed: false,
+                };
+            }
+            catch {
+                return {
+                    caller,
+                    result: {
+                        relationships: [],
+                        warnings: [],
+                    },
+                    failed: true,
+                };
+            }
+        }));
+        for (const { caller, result, failed } of scans) {
+            if (failed) {
+                relationshipsComplete = false;
+                warnings.push({
+                    code: "projection-failed",
+                    agentKey: caller.agentKey,
+                    message: `Could not inspect ${caller.label}.`,
+                });
+                continue;
+            }
+            for (const warning of result.warnings) {
+                if (warning.code === "dynamic-target") {
+                    warnings.push({
+                        code: "dynamic-target",
+                        agentKey: caller.agentKey,
+                        message: `${caller.label} has a dynamic agent target that V0 cannot resolve.`,
+                    });
+                }
+            }
+            for (const relationship of result.relationships) {
+                const candidates = byTarget.get(relationship.target) ?? [];
+                if (candidates.length !== 1) {
+                    const target = /^[A-Za-z0-9@_.:-]+$/.test(relationship.target)
+                        ? relationship.target
+                        : null;
+                    warnings.push({
+                        code: "unresolved-target",
+                        agentKey: caller.agentKey,
+                        message: candidates.length === 0
+                            ? target
+                                ? `${caller.label} invokes unknown agent ${target}.`
+                                : `${caller.label} invokes an invalid agent target.`
+                            : `${caller.label} invokes ambiguous agent ${target ?? "target"}.`,
+                    });
+                    continue;
+                }
+                const target = candidates[0];
+                if (target.agentKey === caller.agentKey)
+                    continue;
+                const from = `agent:${caller.agentKey}`;
+                const to = `agent:${target.agentKey}`;
+                const edgeKey = `${from}\0${to}\0${relationship.mode}`;
+                if (relationship.evidence.length > 1 || seenEdges.has(edgeKey)) {
+                    warnings.push({
+                        code: "duplicate-edge",
+                        agentKey: caller.agentKey,
+                        message: `${caller.label} invokes ${target.label} more than once.`,
+                    });
+                }
+                if (seenEdges.has(edgeKey))
+                    continue;
+                seenEdges.add(edgeKey);
+                edges.push({
+                    from,
+                    to,
+                    kind: "invokes",
+                    basis: "static",
+                    mode: relationship.mode,
+                });
+            }
+        }
+        const modeOrder = { blocking: 0, async: 1 };
+        edges.sort((left, right) => left.from.localeCompare(right.from) ||
+            left.to.localeCompare(right.to) ||
+            modeOrder[left.mode] - modeOrder[right.mode]);
+        const uniqueWarnings = [
+            ...new Map(warnings.map((warning) => [
+                `${warning.code}\0${warning.agentKey ?? ""}\0${warning.message}`,
+                warning,
+            ])).values(),
+        ].sort(warningOrder);
+        return {
+            cacheable: inventory.cacheable && relationshipsComplete,
+            graph: {
+                kind: "system",
+                scope: { kind: "working-tree", workspaceKey: scope.workspaceKey },
+                nodes,
+                edges,
+                warnings: uniqueWarnings,
+            },
+        };
+    }
+    retainWorkspaces(workspaceKeys) {
+        for (const workspaceKey of this.callersByWorkspace.keys()) {
+            if (!workspaceKeys.has(workspaceKey)) {
+                this.callersByWorkspace.delete(workspaceKey);
+            }
+        }
+        this.retainRelationshipCallers();
+    }
+    retainRelationshipCallers() {
+        try {
+            this.relationships.retainCallers?.([...this.callersByWorkspace.values()].flat());
+        }
+        catch {
+            // Cache pruning is an optimization and cannot make projection fail.
+        }
+    }
+}
+//# sourceMappingURL=system-graph.js.map

package/dist/core/system-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"system-graph.js","sourceRoot":"","sources":["../../src/core/system-graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,aAAa,CAAC;AACzC,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAUlC,OAAO,EAAE,yBAAyB,EAAE,MAAM,2BAA2B,CAAC;AACtE,OAAO,EACL,kBAAkB,EAClB,iBAAiB,GAIlB,MAAM,6BAA6B,CAAC;AACrC,OAAO,EACL,+BAA+B,EAC/B,+BAA+B,GAGhC,MAAM,iCAAiC,CAAC;AAEzC,OAAO,EAAE,gCAAgC,EAAE,MAAM,6BAA6B,CAAC;AAQ/E,OAAO,EACL,+BAA+B,EAC/B,+BAA+B,GAChC,MAAM,iCAAiC,CAAC;AA4BzC,SAAS,mBAAmB,CAAC,IAAY;IACvC,OAAO,aAAa,UAAU,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;AACrF,CAAC;AAED;;;GAGG;AACH,MAAM,OAAO,0BAA0B;IACrC,YACmB,SAEa;QAFb,cAAS,GAAT,SAAS,CAEI;IAC7B,CAAC;IAEJ,KAAK,CAAC,IAAI;QACR,MAAM,MAAM,GAAG,IAAI,GAAG,EAAiC,CAAC;QACxD,KAAK,MAAM,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;YAC1C,MAAM,SAAS,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;YAC3C,MAAM,CAAC,GAAG,CAAC,SAAS,EAAE;gBACpB,YAAY,EAAE,mBAAmB,CAAC,SAAS,CAAC;gBAC5C,GAAG,EAAE,IAAI;aACV,CAAC,CAAC;QACL,CAAC;QACD,OAAO,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;aACzB,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;aACpD,GAAG,CAAC,CAAC,CAAC,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC;IACnC,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,YAA0B;QACtC,KAAK,MAAM,IAAI,IAAI,MAAM,IAAI,CAAC,SAAS,EAAE,EAAE,CAAC;YAC1C,MAAM,SAAS,GAAG,kBAAkB,CAAC,IAAI,CAAC,CAAC;YAC3C,IAAI,mBAAmB,CAAC,SAAS,CAAC,KAAK,YAAY,EAAE,CAAC;gBACpD,OAAO,EAAE,YAAY,EAAE,IAAI,EAAE,SAAS,EAAE,CAAC;YAC3C,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;CACF;AAED,SAAS,YAAY,CAAC,IAAkB,EAAE,KAAmB;IAC3D,OAAO,CACL,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC;QACnC,CAAC,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,aAAa,CAAC,KAAK,CAAC,QAAQ,IAAI,EAAE,CAAC;QACzD,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,OAAO,CAAC,CAC1C,CAAC;AACJ,CAAC;AAED,SAAS,gBAAgB,CAAC,KAAqB,EAAE,UAAkB;IACjE,MAAM,cAAc,GAAG,kBAAkB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACtD,MAAM,eAAe,GAAG,kBAAkB,CAAC,UAAU,CAAC,CAAC;IACvD,IAAI,iBAAiB,CAAC,cAAc,EAAE,eAAe,CAAC,EAAE,CAAC;QACvD,MAAM,QAAQ,GAAG,yBAAyB,CAAC,cAAc,EAAE,eAAe,CAAC,CAAC;QAC5E,IAAI,QAAQ;YAAE,OAAO,QAAQ,CAAC;IAChC,CAAC;IACD,OAAO,SAAS,UAAU,CAAC,QAAQ,CAAC;SACjC,MAAM,CAAC,eAAe,CAAC;SACvB,MAAM,CAAC,KAAK,CAAC;SACb,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC;AACpB,CAAC;AAED,SAAS,YAAY,CAAC,KAAa;IACjC,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IACzB,IACE,GAAG,KAAK,EAAE;QACV,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC;QACpB,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC;QAC1B,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC;QAC1B,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,EAClB,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,QAAQ,CAAC;QAAE,OAAO,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC;IAErE,MAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC5C,IACE,QAAQ,KAAK,EAAE;QACf,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC;QAC/B,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC;QAC/B,QAAQ;aACL,KAAK,CAAC,GAAG,CAAC;aACV,IAAI,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,OAAO,KAAK,EAAE,IAAI,OAAO,KAAK,GAAG,IAAI,OAAO,KAAK,IAAI,CAAC,EAC3E,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,SAAS,CAAC,KAAa,EAAE,QAAkB;IAClD,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;IAC3B,IACE,KAAK,KAAK,EAAE;QACZ,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC;QACvB,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC;QAC7B,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,KAAK,CAAC,EAC7B,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC;IACD,IAAI,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;QAClC,OAAO,QAAQ,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,aAAa,CAAC;IAC1D,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAQD;;;;GAIG;AACH,SAAS,kBAAkB,CACzB,KAAqB,EACrB,SAAwC;IAExC,MAAM,QAAQ,GAA4B,SAAS;SAChD,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE;QACb,MAAM,WAAW,GAAG,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,UAAU,CAAC,CAAC;QAC9D,OAAO;YACL,KAAK;YACL,YAAY,EAAE,YAAY,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,WAAW;YACzD,WAAW;SACZ,CAAC;IACJ,CAAC,CAAC;SACD,IAAI,CACH,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,IAAI,CAAC,YAAY,CAAC,aAAa,CAAC,KAAK,CAAC,YAAY,CAAC;QACnD,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,UAAU,CAAC;QAC3D,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,aAAa,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CACpD,CAAC;IACJ,MAAM,MAAM,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAAY,CAAC;IACjC,MAAM,aAAa,GAAG,IAAI,GAAG,CAC3B,CAAC,GAAG,MAAM,CAAC,OAAO,EAAE,CAAC;SAClB,MAAM,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,CAAC;SAChC,GAAG,CAAC,CAAC,CAAC,YAAY,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,CACzC,CAAC;IACF,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,EAAE,YAAY,EAAE,WAAW,EAAE,EAAE,EAAE;QACnE,MAAM,SAAS,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACtD,IAAI,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,YAAY,CAAC;QACtD,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACvB,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAC5B,QAAQ,GAAG,WAAW,CAAC;QACzB,CAAC;QACD,MAAM,IAAI,GAAG,QAAQ,CAAC;QACtB,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,OAAO,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC1B,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YACxB,QAAQ,GAAG,GAAG,IAAI,IAAI,MAAM,EAAE,CAAC;YAC/B,MAAM,IAAI,CAAC,CAAC;QACd,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAEnB,MAAM,iBAAiB,GAAG;YACxB,GAAG,IAAI,GAAG,CACR;gBACE,GAAG,CAAC,QAAQ,KAAK,YAAY,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACpD,GAAG,KAAK,CAAC,iBAAiB;aAC3B;iBACE,GAAG,CAAC,YAAY,CAAC;iBACjB,MAAM,CAAC,CAAC,KAAK,EAAqB,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,CACxD;SACF,CAAC;QACF,OAAO;YACL,GAAG,KAAK;YACR,QAAQ;YACR,KAAK,EAAE,SAAS,CAAC,KAAK,CAAC,KAAK,EAAE,QAAQ,CAAC;YACvC,iBAAiB;SAClB,CAAC;IACJ,CAAC,CAAC,CAAC;IACH,MAAM,CAAC,IAAI,CACT,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,IAAI,CAAC,QAAQ,CAAC,aAAa,CAAC,KAAK,CAAC,QAAQ,CAAC;QAC3C,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,KAAK,CAAC,UAAU,CAAC,CAClD,CAAC;IAEF,MAAM,QAAQ,GAAmB,EAAE,CAAC;IACpC,KAAK,MAAM,YAAY,IAAI,CAAC,GAAG,aAAa,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;QACrD,QAAQ,CAAC,IAAI,CAAC;YACZ,IAAI,EAAE,qBAAqB;YAC3B,QAAQ,EAAE,YAAY;YACtB,OAAO,EAAE,uBAAuB,YAAY,oCAAoC;SACjF,CAAC,CAAC;IACL,CAAC;IACD,OAAO,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC;AAC9B,CAAC;AAED,MAAM,OAAO,wBAAwB;IAMnC,YACmB,SAAiC,EACjC,gBAA2C,IAAI,+BAA+B,CAC7F,IAAI,+BAA+B,EAAE,CACtC;QAHgB,cAAS,GAAT,SAAS,CAAwB;QACjC,kBAAa,GAAb,aAAa,CAE7B;QATc,uBAAkB,GAAG,IAAI,GAAG,EAG1C,CAAC;IAOD,CAAC;IAEJ,KAAK,CAAC,KAAK,CAAC,KAAqB;QAC/B,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;QACzD,MAAM,UAAU,GAAG,kBAAkB,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC;QAC/D,MAAM,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC;QACjC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,KAAK,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC;QACxD,IAAI,CAAC,yBAAyB,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YACnC,EAAE,EAAE,SAAS,KAAK,CAAC,QAAQ,EAAE;YAC7B,QAAQ,EAAE,KAAK,CAAC,QAAQ;YACxB,KAAK,EAAE,KAAK,CAAC,KAAK;SACnB,CAAC,CAAC,CAAC;QACJ,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAgC,CAAC;QACzD,MAAM,cAAc,GAAG,CAAC,GAAW,EAAE,KAAyB,EAAQ,EAAE;YACtE,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YAC3C,IACE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,SAAS,EAAE,EAAE,CAAC,SAAS,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ,CAAC,EACtE,CAAC;gBACD,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACvB,QAAQ,CAAC,GAAG,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;YAChC,CAAC;QACH,CAAC,CAAC;QACF,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,cAAc,CAAC,KAAK,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;YACtC,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,iBAAiB,EAAE,CAAC;gBAC5C,cAAc,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC/B,CAAC;QACH,CAAC;QAED,MAAM,KAAK,GAAsB,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAmB;YAC/B,GAAG,SAAS,CAAC,QAAQ;YACrB,GAAG,UAAU,CAAC,QAAQ;SACvB,CAAC;QACF,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;QACpC,IAAI,qBAAqB,GAAG,IAAI,CAAC;QAEjC,2EAA2E;QAC3E,uEAAuE;QACvE,MAAM,KAAK,GAAG,MAAM,OAAO,CAAC,GAAG,CAC7B,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,EAAE;YAC1B,IAAI,CAAC;gBACH,OAAO;oBACL,MAAM;oBACN,MAAM,EAAE,MAAM,IAAI,CAAC,aAAa,CAAC,iBAAiB,CAAC,MAAM,CAAC;oBAC1D,MAAM,EAAE,KAAc;iBACvB,CAAC;YACJ,CAAC;YAAC,MAAM,CAAC;gBACP,OAAO;oBACL,MAAM;oBACN,MAAM,EAAE;wBACN,aAAa,EAAE,EAAE;wBACjB,QAAQ,EAAE,EAAE;qBAC6B;oBAC3C,MAAM,EAAE,IAAa;iBACtB,CAAC;YACJ,CAAC;QACH,CAAC,CAAC,CACH,CAAC;QAEF,KAAK,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YAC/C,IAAI,MAAM,EAAE,CAAC;gBACX,qBAAqB,GAAG,KAAK,CAAC;gBAC9B,QAAQ,CAAC,IAAI,CAAC;oBACZ,IAAI,EAAE,mBAAmB;oBACzB,QAAQ,EAAE,MAAM,CAAC,QAAQ;oBACzB,OAAO,EAAE,qBAAqB,MAAM,CAAC,KAAK,GAAG;iBAC9C,CAAC,CAAC;gBACH,SAAS;YACX,CAAC;YAED,KAAK,MAAM,OAAO,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACtC,IAAI,OAAO,CAAC,IAAI,KAAK,gBAAgB,EAAE,CAAC;oBACtC,QAAQ,CAAC,IAAI,CAAC;wBACZ,IAAI,EAAE,gBAAgB;wBACtB,QAAQ,EAAE,MAAM,CAAC,QAAQ;wBACzB,OAAO,EAAE,GAAG,MAAM,CAAC,KAAK,qDAAqD;qBAC9E,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;YAED,KAAK,MAAM,YAAY,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC;gBAChD,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC,YAAY,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;gBAC3D,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;oBAC5B,MAAM,MAAM,GAAG,qBAAqB,CAAC,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC;wBAC5D,CAAC,CAAC,YAAY,CAAC,MAAM;wBACrB,CAAC,CAAC,IAAI,CAAC;oBACT,QAAQ,CAAC,IAAI,CAAC;wBACZ,IAAI,EAAE,mBAAmB;wBACzB,QAAQ,EAAE,MAAM,CAAC,QAAQ;wBACzB,OAAO,EACL,UAAU,CAAC,MAAM,KAAK,CAAC;4BACrB,CAAC,CAAC,MAAM;gCACN,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,0BAA0B,MAAM,GAAG;gCACpD,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,mCAAmC;4BACtD,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,4BAA4B,MAAM,IAAI,QAAQ,GAAG;qBACvE,CAAC,CAAC;oBACH,SAAS;gBACX,CAAC;gBACD,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAE,CAAC;gBAC9B,IAAI,MAAM,CAAC,QAAQ,KAAK,MAAM,CAAC,QAAQ;oBAAE,SAAS;gBAClD,MAAM,IAAI,GAAG,SAAS,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACxC,MAAM,EAAE,GAAG,SAAS,MAAM,CAAC,QAAQ,EAAE,CAAC;gBACtC,MAAM,OAAO,GAAG,GAAG,IAAI,KAAK,EAAE,KAAK,YAAY,CAAC,IAAI,EAAE,CAAC;gBACvD,IAAI,YAAY,CAAC,QAAQ,CAAC,MAAM,GAAG,CAAC,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;oBAC/D,QAAQ,CAAC,IAAI,CAAC;wBACZ,IAAI,EAAE,gBAAgB;wBACtB,QAAQ,EAAE,MAAM,CAAC,QAAQ;wBACzB,OAAO,EAAE,GAAG,MAAM,CAAC,KAAK,YAAY,MAAM,CAAC,KAAK,kBAAkB;qBACnE,CAAC,CAAC;gBACL,CAAC;gBACD,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC;oBAAE,SAAS;gBACrC,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;gBACvB,KAAK,CAAC,IAAI,CAAC;oBACT,IAAI;oBACJ,EAAE;oBACF,IAAI,EAAE,SAAS;oBACf,KAAK,EAAE,QAAQ;oBACf,IAAI,EAAE,YAAY,CAAC,IAAI;iBACxB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,MAAM,SAAS,GAAG,EAAE,QAAQ,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAW,CAAC;QACrD,KAAK,CAAC,IAAI,CACR,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CACd,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,CAAC;YACnC,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,KAAK,CAAC,EAAE,CAAC;YAC/B,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,CAC/C,CAAC;QACF,MAAM,cAAc,GAAG;YACrB,GAAG,IAAI,GAAG,CACR,QAAQ,CAAC,GAAG,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;gBACxB,GAAG,OAAO,CAAC,IAAI,KAAK,OAAO,CAAC,QAAQ,IAAI,EAAE,KAAK,OAAO,CAAC,OAAO,EAAE;gBAChE,OAAO;aACR,CAAC,CACH,CAAC,MAAM,EAAE;SACX,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAErB,OAAO;YACL,SAAS,EAAE,SAAS,CAAC,SAAS,IAAI,qBAAqB;YACvD,KAAK,EAAE;gBACL,IAAI,EAAE,QAAQ;gBACd,KAAK,EAAE,EAAE,IAAI,EAAE,cAAc,EAAE,YAAY,EAAE,KAAK,CAAC,YAAY,EAAE;gBACjE,KAAK;gBACL,KAAK;gBACL,QAAQ,EAAE,cAAc;aACzB;SACF,CAAC;IACJ,CAAC;IAED,gBAAgB,CAAC,aAAwC;QACvD,KAAK,MAAM,YAAY,IAAI,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,EAAE,CAAC;YAC1D,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,CAAC;gBACrC,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;QACD,IAAI,CAAC,yBAAyB,EAAE,CAAC;IACnC,CAAC;IAEO,yBAAyB;QAC/B,IAAI,CAAC;YACH,IAAI,CAAC,aAAa,CAAC,aAAa,EAAE,CAChC,CAAC,GAAG,IAAI,CAAC,kBAAkB,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,EAAE,CAC7C,CAAC;QACJ,CAAC;QAAC,MAAM,CAAC;YACP,oEAAoE;QACtE,CAAC;IACH,CAAC;CACF"}

package/dist/core/workflow-registry.d.ts

@@ -1,15 +1,55 @@
 /**
  * Workflow registry (workstream W2's backend slice).
  *
- * Discovers orchestration projects by scanning a directory tree (bounded
- * depth) for `sapiom.json` marker files, tracks manually-connected paths,
- * and persists the combined list to HARNESS_PATHS.workflows. Exposes an
+ * Discovers orchestration projects by scanning a directory tree (bounded by
+ * depth, by directories visited, and by the scan root's own repository) for
+ * `sapiom.json` marker files, tracks
+ * manually-connected paths, and persists the combined list to
+ * HARNESS_PATHS.workflows. Exposes an
  * Express router implementing the /api/workflows surface from
  * src/shared/types.ts; the integrator mounts it (and express.json()) on the
  * shared app.
  */
 import { type Router as ExpressRouter } from "express";
 import { type WorkflowInfo } from "../shared/types.js";
+import { AgentProjectScanBudget, type AgentProjectWalkOptions } from "./agent-project-discovery.js";
+/** What one scan of a root turned up, and how far it can be trusted. */
+export interface AgentProjectScanResult {
+    /** Projects discovered on this pass. */
+    found: WorkflowInfo[];
+    /** Subtrees left opaque by a transient filesystem error. */
+    unreconciledRoots: string[];
+    /**
+     * Nested repository checkouts the walk declined to enter (see
+     * {@link isForeignRepositoryRoot}). A scan that comes back short is then able
+     * to say WHY it came back short, which is the difference between "there are
+     * no agents there" and "there is another repo there and you did not ask for
+     * it". The server logs the count on every scan.
+     */
+    repositoryBoundaries: string[];
+    /** The traversal allowance this scan spent — `visited`, `envelopeDepth`. */
+    budget: AgentProjectScanBudget;
+}
+/**
+ * Scans `root` for agent projects, bounded by depth, by directories visited,
+ * AND by the repository the root belongs to (core/agent-project-discovery.ts
+ * owns that policy and the numbers behind it). A directory carrying a marker is
+ * registered and not descended into; a directory that is a repository checkout
+ * of its own is reported as a boundary and not descended into either, so one
+ * scan registers one project tree rather than every neighbouring clone.
+ *
+ * Every directory touched is confined to `root` (the tree the caller asked to
+ * scan): the walk starts at `root` itself and only ever descends into a direct
+ * child, so no crafted entry name can walk the scan outside `root` — and
+ * `resolveWithinRoot` re-asserts that at the sink, local to each fs read.
+ * Symlinked entries report `isDirectory() === false` (withFileTypes uses raw
+ * dirent info, not a followed stat) and so are never descended into either,
+ * which is what makes a symlink cycle terminate.
+ *
+ * Exported so the perf benchmark can measure the real scanner against an
+ * explicit budget rather than a copy of its traversal.
+ */
+export declare function scanAgentProjects(root: string, budget?: AgentProjectScanBudget, options?: AgentProjectWalkOptions): Promise<AgentProjectScanResult>;
 export declare class WorkflowRegistry {
     private readonly registryPath;
     private workflows;
@@ -18,12 +58,22 @@ export declare class WorkflowRegistry {
      *  interleave and drop entries from the persisted file. Mirrors the pattern
      *  used by SessionManager.persist() (session-manager.ts:278,851-853). */
     private writeQueue;
+    /** Epoch ms of the last confirmed-missing sweep — see LAZY_PRUNE_INTERVAL_MS. */
+    private lastPruneAt;
     constructor(registryPath?: string);
     private ensureLoaded;
     private persist;
     /** Chains `run` onto the write queue so concurrent mutations never
      *  interleave — a failed run never poisons later ones. */
     private enqueue;
+    /**
+     * The registry as it stands — and the point at which stale entries actually
+     * leave. A read runs {@link prune} when one is due
+     * (LAZY_PRUNE_INTERVAL_MS), so an agent whose directory the user deleted
+     * disappears from `GET /api/workflows` on its own rather than waiting for the
+     * next server boot. Cheap by construction: one `stat` per entry, throttled,
+     * and the file is only rewritten when something was actually dropped.
+     */
     list(): Promise<WorkflowInfo[]>;
     /**
      * Drops entries whose `path` no longer exists on disk and persists the
@@ -35,12 +85,18 @@ export declare class WorkflowRegistry {
      */
     prune(): Promise<WorkflowInfo[]>;
     /**
+     * `budget` is overridable so a caller (and the tests that pin this rule) can
+     * scan with a narrower allowance than the shipped default; the reconciliation
+     * envelope follows whatever the scan actually managed to cover.
+     *
      * Scans `root`, refreshes discovered projects, and removes scan-sourced rows
      * in this scan's traversal envelope when their marker is confirmed gone or
-     * invalid. Rows beneath a temporarily unreadable directory survive this pass;
-     * manually connected rows remain until their path itself is pruned.
+     * invalid. Rows beneath a temporarily unreadable directory survive this pass,
+     * as do rows below the depth the scan actually completed when the node budget
+     * cut it short; manually connected rows remain until their path itself is
+     * pruned.
      */
-    scan(root: string): Promise<WorkflowInfo[]>;
+    scan(root: string, budget?: AgentProjectScanBudget): Promise<WorkflowInfo[]>;
     /** Registers an arbitrary path (the "+ Connect" flow); marker is optional at connect time. */
     connectPath(inputPath: string): Promise<WorkflowInfo>;
 }
@@ -50,9 +106,31 @@ export declare class WorkflowRegistry {
  * with resolved slugs) without an unsafe cast — a missing method is then a
  * compile error, not a runtime crash.
  */
+/**
+ * What a requested scan found, AND what it deliberately declined to enter.
+ *
+ * The second half exists because the two are only honest together. A scan stops
+ * at a foreign repository root, so pointing it at a folder that is not itself a
+ * repo but holds several clones finds NOTHING while several agents sit on disk —
+ * and a UI told only `found: []` will state, in good faith, that the folder is
+ * empty and offer to create the *first* agent in it. `repositoryBoundaries`
+ * turns that false statement into the true one: these checkouts were not
+ * searched, open one as its own project.
+ */
+export interface WorkflowScanOutcome {
+    found: WorkflowInfo[];
+    /** Absolute paths of checkouts the walk stopped at rather than entering. */
+    repositoryBoundaries: string[];
+}
 export interface WorkflowRegistryLike {
     list(): Promise<WorkflowInfo[]>;
     scan(root: string): Promise<WorkflowInfo[]>;
+    /**
+     * The same scan, reporting the boundaries it stopped at. Optional so an
+     * embedder implementing this interface keeps compiling; the route degrades to
+     * `scan` with an empty boundary list, which is the pre-existing behaviour.
+     */
+    scanWithBoundaries?(root: string): Promise<WorkflowScanOutcome>;
     connectPath(inputPath: string): Promise<WorkflowInfo>;
 }
 export declare function createWorkflowsRouter(registry: WorkflowRegistryLike): ExpressRouter;

package/dist/core/workflow-registry.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"workflow-registry.d.ts","sourceRoot":"","sources":["../../src/core/workflow-registry.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAKH,OAAO,EAAU,KAAK,MAAM,IAAI,aAAa,EAAE,MAAM,SAAS,CAAC;AAE/D,OAAO,EAAiB,KAAK,YAAY,EAAE,MAAM,oBAAoB,CAAC;AAiJtE,qBAAa,gBAAgB;IAQf,OAAO,CAAC,QAAQ,CAAC,YAAY;IAPzC,OAAO,CAAC,SAAS,CAAsB;IACvC,OAAO,CAAC,MAAM,CAAS;IACvB;;6EAEyE;IACzE,OAAO,CAAC,UAAU,CAAoC;gBAEzB,YAAY,GAAE,MAA4C;YAEzE,YAAY;YAWZ,OAAO;IAYrB;8DAC0D;IAC1D,OAAO,CAAC,OAAO;IAST,IAAI,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC;IAKrC;;;;;;;OAOG;IACG,KAAK,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC;IAuBtC;;;;;OAKG;IACG,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IA+BjD,8FAA8F;IACxF,WAAW,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC;CAsB5D;AAED;;;;;GAKG;AACH,MAAM,WAAW,oBAAoB;IACnC,IAAI,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;IAChC,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;IAC5C,WAAW,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC;CACvD;AAED,wBAAgB,qBAAqB,CAAC,QAAQ,EAAE,oBAAoB,GAAG,aAAa,CAkCnF"}
+{"version":3,"file":"workflow-registry.d.ts","sourceRoot":"","sources":["../../src/core/workflow-registry.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;GAWG;AAKH,OAAO,EAAU,KAAK,MAAM,IAAI,aAAa,EAAE,MAAM,SAAS,CAAC;AAE/D,OAAO,EAAiB,KAAK,YAAY,EAAE,MAAM,oBAAoB,CAAC;AACtE,OAAO,EAGL,sBAAsB,EAEtB,KAAK,uBAAuB,EAK7B,MAAM,8BAA8B,CAAC;AAwCtC,wEAAwE;AACxE,MAAM,WAAW,sBAAsB;IACrC,wCAAwC;IACxC,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,4DAA4D;IAC5D,iBAAiB,EAAE,MAAM,EAAE,CAAC;IAC5B;;;;;;OAMG;IACH,oBAAoB,EAAE,MAAM,EAAE,CAAC;IAC/B,4EAA4E;IAC5E,MAAM,EAAE,sBAAsB,CAAC;CAChC;AAED;;;;;;;;;;;;;;;;;;GAkBG;AACH,wBAAsB,iBAAiB,CACrC,IAAI,EAAE,MAAM,EACZ,MAAM,GAAE,sBAAqD,EAC7D,OAAO,GAAE,uBAA4B,GACpC,OAAO,CAAC,sBAAsB,CAAC,CAmDjC;AA8FD,qBAAa,gBAAgB;IAUf,OAAO,CAAC,QAAQ,CAAC,YAAY;IATzC,OAAO,CAAC,SAAS,CAAsB;IACvC,OAAO,CAAC,MAAM,CAAS;IACvB;;6EAEyE;IACzE,OAAO,CAAC,UAAU,CAAoC;IACtD,iFAAiF;IACjF,OAAO,CAAC,WAAW,CAAK;gBAEK,YAAY,GAAE,MAA4C;YAEzE,YAAY;YAWZ,OAAO;IAYrB;8DAC0D;IAC1D,OAAO,CAAC,OAAO;IASf;;;;;;;OAOG;IACG,IAAI,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC;IAarC;;;;;;;OAOG;IACG,KAAK,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC;IA2BtC;;;;;;;;;;;OAWG;IACG,IAAI,CACR,IAAI,EAAE,MAAM,EACZ,MAAM,GAAE,sBAAqD,GAC5D,OAAO,CAAC,YAAY,EAAE,CAAC;IA0C1B,8FAA8F;IACxF,WAAW,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC;CAsB5D;AAED;;;;;GAKG;AACH;;;;;;;;;;GAUG;AACH,MAAM,WAAW,mBAAmB;IAClC,KAAK,EAAE,YAAY,EAAE,CAAC;IACtB,4EAA4E;IAC5E,oBAAoB,EAAE,MAAM,EAAE,CAAC;CAChC;AAED,MAAM,WAAW,oBAAoB;IACnC,IAAI,IAAI,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;IAChC,IAAI,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC,CAAC;IAC5C;;;;OAIG;IACH,kBAAkB,CAAC,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,mBAAmB,CAAC,CAAC;IAChE,WAAW,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,YAAY,CAAC,CAAC;CACvD;AAED,wBAAgB,qBAAqB,CAAC,QAAQ,EAAE,oBAAoB,GAAG,aAAa,CAuCnF"}