@telora/factory 0.4.5

package/dist/session-adapter.d.ts

@@ -0,0 +1,89 @@
+/**
+ * Session communication adapter -- abstracts how the daemon communicates
+ * with a running Claude Code agent session.
+ *
+ * McpAdapter detects work unit completion by polling the DB for status
+ * changes (agents call telora_factory_work_unit_update via MCP tool).
+ * Work dispatch and gate feedback go through stdin.
+ *
+ * All session monitoring and work dispatch goes through the adapter --
+ * no code outside this module should directly parse stdout or write to stdin.
+ */
+import type { Writable } from 'node:stream';
+import type { FactoryWorkUnit, FactoryInstanceState } from './types.js';
+/**
+ * Interface for communicating with a running agent session.
+ *
+ * Implementations wrap the concrete protocol (stdout signal parsing,
+ * MCP tools, etc.) behind a uniform API.
+ */
+export interface SessionCommunicationAdapter {
+    /**
+     * Register a callback for when a work unit is completed by the agent.
+     * Called with the work unit ID.
+     */
+    onWorkUnitComplete(callback: (workUnitId: string) => void): void;
+    /**
+     * Dispatch a batch of work units to the agent session.
+     */
+    dispatchWork(units: FactoryWorkUnit[], state: FactoryInstanceState): void;
+    /**
+     * Send a free-form message to the agent session (e.g., gate feedback).
+     * Returns true if the message was sent successfully.
+     */
+    sendMessage(content: string): boolean;
+    /**
+     * Clean up resources (detach listeners, etc.).
+     */
+    dispose(): void;
+}
+/**
+ * Dependencies injected into McpAdapter.
+ * Avoids direct imports for testability.
+ */
+export interface McpAdapterDeps {
+    /** Factory instance ID to poll work units for. */
+    instanceId: string;
+    /** Process stdin writable for sending messages. */
+    stdin: Writable | null;
+    /** sendMessage function from daemon-core. */
+    sendMessageFn: (stdin: Writable, content: string) => boolean;
+    /** Build work batch directive text. */
+    buildDirectiveFn: (units: FactoryWorkUnit[], state: FactoryInstanceState) => string;
+    /** Polling interval in ms (default 5000). */
+    pollIntervalMs?: number;
+    /** Injected query function for testability. Defaults to getCompletedWorkUnits. */
+    queryCompletedFn?: (instanceId: string) => Promise<FactoryWorkUnit[]>;
+}
+/**
+ * Adapter that detects work unit completion by polling the DB for status
+ * changes. Agents call telora_factory_work_unit_update via MCP to mark
+ * units completed; this adapter polls for those changes.
+ *
+ * Work dispatch and gate feedback still go through stdin (hybrid approach).
+ */
+export declare class McpAdapter implements SessionCommunicationAdapter {
+    private deps;
+    private disposed;
+    private pollTimer;
+    private callback;
+    /** Set of work unit IDs already reported as completed (prevents duplicates). */
+    private reportedCompletedIds;
+    constructor(deps: McpAdapterDeps);
+    onWorkUnitComplete(callback: (workUnitId: string) => void): void;
+    dispatchWork(units: FactoryWorkUnit[], state: FactoryInstanceState): void;
+    sendMessage(content: string): boolean;
+    /**
+     * Update the stdin reference (e.g., when it's nulled on process exit).
+     */
+    updateStdin(stdin: Writable | null): void;
+    dispose(): void;
+    /**
+     * Reset the reported completed set. Called when work units are cycled
+     * back to in_progress after a gate failure, so re-completions are detected.
+     */
+    resetCompleted(workUnitIds: string[]): void;
+    private startPolling;
+    private poll;
+}
+//# sourceMappingURL=session-adapter.d.ts.map

package/dist/session-adapter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"session-adapter.d.ts","sourceRoot":"","sources":["../src/session-adapter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAEH,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAC;AAC5C,OAAO,KAAK,EAAE,eAAe,EAAE,oBAAoB,EAAE,MAAM,YAAY,CAAC;AAOxE;;;;;GAKG;AACH,MAAM,WAAW,2BAA2B;IAC1C;;;OAGG;IACH,kBAAkB,CAAC,QAAQ,EAAE,CAAC,UAAU,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI,CAAC;IAEjE;;OAEG;IACH,YAAY,CAAC,KAAK,EAAE,eAAe,EAAE,EAAE,KAAK,EAAE,oBAAoB,GAAG,IAAI,CAAC;IAE1E;;;OAGG;IACH,WAAW,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC;IAEtC;;OAEG;IACH,OAAO,IAAI,IAAI,CAAC;CACjB;AASD;;;GAGG;AACH,MAAM,WAAW,cAAc;IAC7B,kDAAkD;IAClD,UAAU,EAAE,MAAM,CAAC;IACnB,mDAAmD;IACnD,KAAK,EAAE,QAAQ,GAAG,IAAI,CAAC;IACvB,6CAA6C;IAC7C,aAAa,EAAE,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,MAAM,KAAK,OAAO,CAAC;IAC7D,uCAAuC;IACvC,gBAAgB,EAAE,CAAC,KAAK,EAAE,eAAe,EAAE,EAAE,KAAK,EAAE,oBAAoB,KAAK,MAAM,CAAC;IACpF,6CAA6C;IAC7C,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,kFAAkF;IAClF,gBAAgB,CAAC,EAAE,CAAC,UAAU,EAAE,MAAM,KAAK,OAAO,CAAC,eAAe,EAAE,CAAC,CAAC;CACvE;AAED;;;;;;GAMG;AACH,qBAAa,UAAW,YAAW,2BAA2B;IAC5D,OAAO,CAAC,IAAI,CAAiB;IAC7B,OAAO,CAAC,QAAQ,CAAS;IACzB,OAAO,CAAC,SAAS,CAA+C;IAChE,OAAO,CAAC,QAAQ,CAA+C;IAC/D,gFAAgF;IAChF,OAAO,CAAC,oBAAoB,CAAqB;gBAErC,IAAI,EAAE,cAAc;IAIhC,kBAAkB,CAAC,QAAQ,EAAE,CAAC,UAAU,EAAE,MAAM,KAAK,IAAI,GAAG,IAAI;IAKhE,YAAY,CAAC,KAAK,EAAE,eAAe,EAAE,EAAE,KAAK,EAAE,oBAAoB,GAAG,IAAI;IAMzE,WAAW,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO;IAKrC;;OAEG;IACH,WAAW,CAAC,KAAK,EAAE,QAAQ,GAAG,IAAI,GAAG,IAAI;IAIzC,OAAO,IAAI,IAAI;IAQf;;;OAGG;IACH,cAAc,CAAC,WAAW,EAAE,MAAM,EAAE,GAAG,IAAI;IAU3C,OAAO,CAAC,YAAY;YAaN,IAAI;CAyBnB"}

package/dist/session-adapter.js

@@ -0,0 +1,108 @@
+/**
+ * Session communication adapter -- abstracts how the daemon communicates
+ * with a running Claude Code agent session.
+ *
+ * McpAdapter detects work unit completion by polling the DB for status
+ * changes (agents call telora_factory_work_unit_update via MCP tool).
+ * Work dispatch and gate feedback go through stdin.
+ *
+ * All session monitoring and work dispatch goes through the adapter --
+ * no code outside this module should directly parse stdout or write to stdin.
+ */
+import { getCompletedWorkUnits } from './queries/work-units.js';
+// ============================================================================
+// MCP adapter (DB polling based)
+// ============================================================================
+/** Default polling interval for MCP adapter (ms). */
+const DEFAULT_MCP_POLL_INTERVAL_MS = 5000;
+/**
+ * Adapter that detects work unit completion by polling the DB for status
+ * changes. Agents call telora_factory_work_unit_update via MCP to mark
+ * units completed; this adapter polls for those changes.
+ *
+ * Work dispatch and gate feedback still go through stdin (hybrid approach).
+ */
+export class McpAdapter {
+    deps;
+    disposed = false;
+    pollTimer = null;
+    callback = null;
+    /** Set of work unit IDs already reported as completed (prevents duplicates). */
+    reportedCompletedIds = new Set();
+    constructor(deps) {
+        this.deps = deps;
+    }
+    onWorkUnitComplete(callback) {
+        this.callback = callback;
+        this.startPolling();
+    }
+    dispatchWork(units, state) {
+        if (this.disposed || !this.deps.stdin || this.deps.stdin.destroyed)
+            return;
+        const directive = this.deps.buildDirectiveFn(units, state);
+        this.deps.sendMessageFn(this.deps.stdin, directive);
+    }
+    sendMessage(content) {
+        if (this.disposed || !this.deps.stdin || this.deps.stdin.destroyed)
+            return false;
+        return this.deps.sendMessageFn(this.deps.stdin, content);
+    }
+    /**
+     * Update the stdin reference (e.g., when it's nulled on process exit).
+     */
+    updateStdin(stdin) {
+        this.deps.stdin = stdin;
+    }
+    dispose() {
+        this.disposed = true;
+        if (this.pollTimer) {
+            clearInterval(this.pollTimer);
+            this.pollTimer = null;
+        }
+    }
+    /**
+     * Reset the reported completed set. Called when work units are cycled
+     * back to in_progress after a gate failure, so re-completions are detected.
+     */
+    resetCompleted(workUnitIds) {
+        for (const id of workUnitIds) {
+            this.reportedCompletedIds.delete(id);
+        }
+    }
+    // --------------------------------------------------------------------------
+    // Internal polling
+    // --------------------------------------------------------------------------
+    startPolling() {
+        if (this.pollTimer || this.disposed)
+            return;
+        const intervalMs = this.deps.pollIntervalMs ?? DEFAULT_MCP_POLL_INTERVAL_MS;
+        this.pollTimer = setInterval(() => {
+            this.poll().catch((err) => {
+                console.error('[McpAdapter] Poll error:', err.message);
+            });
+        }, intervalMs);
+    }
+    async poll() {
+        if (this.disposed || !this.callback)
+            return;
+        const queryFn = this.deps.queryCompletedFn ?? getCompletedWorkUnits;
+        const completed = await queryFn(this.deps.instanceId);
+        // Build set of currently completed IDs from DB
+        const currentlyCompleted = new Set(completed.map((u) => u.id));
+        // Detect units cycled back from completed (gate failure retry).
+        // Remove them from reportedCompletedIds so re-completion is detected.
+        for (const id of this.reportedCompletedIds) {
+            if (!currentlyCompleted.has(id)) {
+                this.reportedCompletedIds.delete(id);
+            }
+        }
+        // Report newly completed units
+        for (const unit of completed) {
+            if (!this.reportedCompletedIds.has(unit.id)) {
+                this.reportedCompletedIds.add(unit.id);
+                this.callback(unit.id);
+            }
+        }
+    }
+}
+//# sourceMappingURL=session-adapter.js.map

package/dist/session-adapter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"session-adapter.js","sourceRoot":"","sources":["../src/session-adapter.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH,OAAO,EAAE,qBAAqB,EAAE,MAAM,yBAAyB,CAAC;AAoChE,+EAA+E;AAC/E,iCAAiC;AACjC,+EAA+E;AAE/E,qDAAqD;AACrD,MAAM,4BAA4B,GAAG,IAAI,CAAC;AAqB1C;;;;;;GAMG;AACH,MAAM,OAAO,UAAU;IACb,IAAI,CAAiB;IACrB,QAAQ,GAAG,KAAK,CAAC;IACjB,SAAS,GAA0C,IAAI,CAAC;IACxD,QAAQ,GAA0C,IAAI,CAAC;IAC/D,gFAAgF;IACxE,oBAAoB,GAAG,IAAI,GAAG,EAAU,CAAC;IAEjD,YAAY,IAAoB;QAC9B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAED,kBAAkB,CAAC,QAAsC;QACvD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QACzB,IAAI,CAAC,YAAY,EAAE,CAAC;IACtB,CAAC;IAED,YAAY,CAAC,KAAwB,EAAE,KAA2B;QAChE,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS;YAAE,OAAO;QAC3E,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC3D,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,CAAC,CAAC;IACtD,CAAC;IAED,WAAW,CAAC,OAAe;QACzB,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS;YAAE,OAAO,KAAK,CAAC;QACjF,OAAO,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAC3D,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,KAAsB;QAChC,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IAC1B,CAAC;IAED,OAAO;QACL,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC;QACrB,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,aAAa,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC9B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC;QACxB,CAAC;IACH,CAAC;IAED;;;OAGG;IACH,cAAc,CAAC,WAAqB;QAClC,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;YAC7B,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAED,6EAA6E;IAC7E,mBAAmB;IACnB,6EAA6E;IAErE,YAAY;QAClB,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,QAAQ;YAAE,OAAO;QAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,cAAc,IAAI,4BAA4B,CAAC;QAC5E,IAAI,CAAC,SAAS,GAAG,WAAW,CAAC,GAAG,EAAE;YAChC,IAAI,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,GAAG,EAAE,EAAE;gBACxB,OAAO,CAAC,KAAK,CACX,0BAA0B,EACzB,GAAa,CAAC,OAAO,CACvB,CAAC;YACJ,CAAC,CAAC,CAAC;QACL,CAAC,EAAE,UAAU,CAAC,CAAC;IACjB,CAAC;IAEO,KAAK,CAAC,IAAI;QAChB,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ;YAAE,OAAO;QAE5C,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,gBAAgB,IAAI,qBAAqB,CAAC;QACpE,MAAM,SAAS,GAAG,MAAM,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAEtD,+CAA+C;QAC/C,MAAM,kBAAkB,GAAG,IAAI,GAAG,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAE/D,gEAAgE;QAChE,sEAAsE;QACtE,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,oBAAoB,EAAE,CAAC;YAC3C,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;gBAChC,IAAI,CAAC,oBAAoB,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACvC,CAAC;QACH,CAAC;QAED,+BAA+B;QAC/B,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,IAAI,CAAC,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC5C,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACvC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACzB,CAAC;QACH,CAAC;IACH,CAAC;CACF"}

package/dist/sop-generator.d.ts

@@ -0,0 +1,29 @@
+/**
+ * Factory SOP (Standard Operating Procedure) Generator.
+ *
+ * Generates a markdown SOP document from a pipeline graph's promise contracts.
+ * Each node's Consumes / Produces / Delegates contract is chained into a
+ * readable operating procedure that establishes what each pipeline stage
+ * handles versus what the factory infrastructure handles.
+ *
+ * Nodes without authored contracts fall back to template type defaults.
+ * Loop-back edges (e.g. review -> engineering) are surfaced as feedback
+ * paths rather than breaking the topological sort.
+ *
+ * @module factory/sop-generator
+ */
+import type { PipelineGraph } from './types.js';
+/**
+ * Generate a Factory SOP (Standard Operating Procedure) document from a
+ * pipeline graph.
+ *
+ * The SOP chains each node's promise contracts in topological order,
+ * establishing what each stage consumes, produces, and delegates to
+ * infrastructure. Loop-back edges are surfaced as feedback paths at
+ * the end of the document.
+ *
+ * @param graph - The pipeline graph from the blueprint
+ * @returns Markdown SOP document, or empty string for null/empty graphs
+ */
+export declare function generateFactorySOP(graph: PipelineGraph | null | undefined): string;
+//# sourceMappingURL=sop-generator.d.ts.map

package/dist/sop-generator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sop-generator.d.ts","sourceRoot":"","sources":["../src/sop-generator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,aAAa,EAA8B,MAAM,YAAY,CAAC;AA2K5E;;;;;;;;;;;GAWG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,aAAa,GAAG,IAAI,GAAG,SAAS,GAAG,MAAM,CA6ElF"}

package/dist/sop-generator.js

@@ -0,0 +1,235 @@
+/**
+ * Factory SOP (Standard Operating Procedure) Generator.
+ *
+ * Generates a markdown SOP document from a pipeline graph's promise contracts.
+ * Each node's Consumes / Produces / Delegates contract is chained into a
+ * readable operating procedure that establishes what each pipeline stage
+ * handles versus what the factory infrastructure handles.
+ *
+ * Nodes without authored contracts fall back to template type defaults.
+ * Loop-back edges (e.g. review -> engineering) are surfaced as feedback
+ * paths rather than breaking the topological sort.
+ *
+ * @module factory/sop-generator
+ */
+const DEFAULT_CONTRACTS = {
+    planning: {
+        consumes: 'Blueprint spec (synthesized specification from the authoring conversation) and any prior cycle gate results if this is a re-planning iteration.',
+        produces: 'Prioritized work unit DAG with acceptance criteria per unit. Each work unit is independently implementable and testable.',
+        delegates: 'Gate execution (typecheck, lint, build, test), session management, codebase audit, and cycle evaluation to factory infrastructure.',
+    },
+    engineering: {
+        consumes: 'Approved work unit spec with acceptance criteria from the planning stage.',
+        produces: 'Committed code satisfying the work unit spec. All changes committed to the worktree branch.',
+        delegates: 'Gate execution (typecheck, lint, build, test) to factory infrastructure. Agents write code and tests but do not run the gate suite themselves.',
+    },
+    review: {
+        consumes: 'Committed code from the engineering stage plus gate results (pass/fail with output) from factory infrastructure.',
+        produces: 'Gap analysis report identifying unmet spec requirements. List of remediation work units if gaps are found.',
+        delegates: 'Re-running gates, session lifecycle, and cycle iteration decisions to factory infrastructure.',
+    },
+    qa: {
+        consumes: 'Committed code from engineering and gap analysis from the review stage.',
+        produces: 'QA pass/fail report with evidence. Critical failures trigger loop-back to engineering via pipeline edge conditions.',
+        delegates: 'Gate execution, cycle evaluation, and pipeline advancement decisions to factory infrastructure.',
+    },
+    terminal: {
+        consumes: '',
+        produces: '',
+        delegates: '',
+    },
+};
+// ============================================================================
+// Topological sort (Kahn's algorithm, loop-back edges excluded)
+// ============================================================================
+/**
+ * Identify loop-back edges in the graph. A loop-back edge is one whose
+ * target has lower topological order than its source in the forward DAG.
+ * We detect these by running Kahn's algorithm on the full graph and
+ * identifying edges that create cycles (i.e. nodes not reached by the sort).
+ *
+ * Simpler heuristic: an edge is a loop-back if it points from a node that
+ * appears later in the node list to one that appears earlier, OR if removing
+ * it makes the graph a DAG. We use the standard cycle-detection approach:
+ * run Kahn's, any edge whose target still has non-zero in-degree is part of
+ * a cycle and thus a loop-back.
+ */
+function partitionEdges(nodes, edges) {
+    const nodeIds = new Set(nodes.map((n) => n.id));
+    // Use DFS to classify edges. Back-edges (target is an ancestor in the DFS
+    // tree) are loop-backs; all other valid edges are forward.
+    const adjacency = new Map();
+    for (const node of nodes) {
+        adjacency.set(node.id, []);
+    }
+    for (const edge of edges) {
+        if (!nodeIds.has(edge.from) || !nodeIds.has(edge.to))
+            continue;
+        adjacency.get(edge.from)?.push({ to: edge.to, edge });
+    }
+    const WHITE = 0; // unvisited
+    const GRAY = 1; // in current DFS path (ancestor)
+    const BLACK = 2; // fully processed
+    const color = new Map();
+    for (const node of nodes)
+        color.set(node.id, WHITE);
+    const forwardEdges = [];
+    const loopBackEdges = [];
+    function dfs(nodeId) {
+        color.set(nodeId, GRAY);
+        for (const { to, edge } of adjacency.get(nodeId) ?? []) {
+            const toColor = color.get(to) ?? BLACK;
+            if (toColor === GRAY) {
+                // Target is an ancestor in current DFS path -> back-edge (loop-back)
+                loopBackEdges.push(edge);
+            }
+            else {
+                forwardEdges.push(edge);
+                if (toColor === WHITE) {
+                    dfs(to);
+                }
+            }
+        }
+        color.set(nodeId, BLACK);
+    }
+    for (const node of nodes) {
+        if (color.get(node.id) === WHITE) {
+            dfs(node.id);
+        }
+    }
+    return { forwardEdges, loopBackEdges };
+}
+/**
+ * Topologically sort pipeline nodes using only forward edges.
+ * Returns nodes in execution order (entry nodes first).
+ */
+function topoSort(nodes, forwardEdges) {
+    if (nodes.length === 0)
+        return [];
+    const inDegree = new Map();
+    const adjacency = new Map();
+    for (const node of nodes) {
+        inDegree.set(node.id, 0);
+        adjacency.set(node.id, []);
+    }
+    for (const edge of forwardEdges) {
+        inDegree.set(edge.to, (inDegree.get(edge.to) ?? 0) + 1);
+        adjacency.get(edge.from)?.push(edge.to);
+    }
+    const queue = [];
+    for (const [id, deg] of inDegree) {
+        if (deg === 0)
+            queue.push(id);
+    }
+    const sorted = [];
+    while (queue.length > 0) {
+        const current = queue.shift();
+        sorted.push(current);
+        for (const neighbor of adjacency.get(current) ?? []) {
+            const newDeg = (inDegree.get(neighbor) ?? 1) - 1;
+            inDegree.set(neighbor, newDeg);
+            if (newDeg === 0)
+                queue.push(neighbor);
+        }
+    }
+    const nodeMap = new Map(nodes.map((n) => [n.id, n]));
+    return sorted.map((id) => nodeMap.get(id)).filter(Boolean);
+}
+// ============================================================================
+// SOP generator
+// ============================================================================
+/**
+ * Resolve the promise contract for a node, falling back to template type
+ * defaults when the node has no authored contracts.
+ */
+function resolveContract(node) {
+    const defaults = DEFAULT_CONTRACTS[node.templateType ?? ''] ?? {
+        consumes: '',
+        produces: '',
+        delegates: '',
+    };
+    return {
+        consumes: node.consumes || defaults.consumes,
+        produces: node.produces || defaults.produces,
+        delegates: node.delegates || defaults.delegates,
+    };
+}
+/**
+ * Generate a Factory SOP (Standard Operating Procedure) document from a
+ * pipeline graph.
+ *
+ * The SOP chains each node's promise contracts in topological order,
+ * establishing what each stage consumes, produces, and delegates to
+ * infrastructure. Loop-back edges are surfaced as feedback paths at
+ * the end of the document.
+ *
+ * @param graph - The pipeline graph from the blueprint
+ * @returns Markdown SOP document, or empty string for null/empty graphs
+ */
+export function generateFactorySOP(graph) {
+    if (!graph || graph.nodes.length === 0)
+        return '';
+    const { forwardEdges, loopBackEdges } = partitionEdges(graph.nodes, graph.edges);
+    const sortedNodes = topoSort(graph.nodes, forwardEdges);
+    // If topo sort didn't include all nodes (shouldn't happen with loop-backs removed),
+    // append any missing nodes at the end
+    const sortedIds = new Set(sortedNodes.map((n) => n.id));
+    for (const node of graph.nodes) {
+        if (!sortedIds.has(node.id)) {
+            sortedNodes.push(node);
+        }
+    }
+    const lines = [];
+    lines.push('## Factory Operating Procedure');
+    lines.push('');
+    lines.push('This pipeline defines the execution stages, their responsibilities, and what');
+    lines.push('the factory infrastructure handles automatically. Each stage\'s contract');
+    lines.push('describes what it receives (Consumes), what it produces (Produces), and what');
+    lines.push('it delegates to infrastructure (Delegates).');
+    lines.push('');
+    // Emit each node in topological order
+    for (let i = 0; i < sortedNodes.length; i++) {
+        const node = sortedNodes[i];
+        const contract = resolveContract(node);
+        const typeLabel = node.templateType
+            ? ` (${node.templateType})`
+            : '';
+        lines.push(`### Stage ${i + 1}: ${node.label}${typeLabel}`);
+        lines.push('');
+        if (contract.consumes) {
+            lines.push(`**Consumes:** ${contract.consumes}`);
+            lines.push('');
+        }
+        if (contract.produces) {
+            lines.push(`**Produces:** ${contract.produces}`);
+            lines.push('');
+        }
+        if (contract.delegates) {
+            lines.push(`**Delegates:** ${contract.delegates}`);
+            lines.push('');
+        }
+    }
+    // Feedback paths (loop-back edges)
+    if (loopBackEdges.length > 0) {
+        const nodeMap = new Map(graph.nodes.map((n) => [n.id, n]));
+        lines.push('### Feedback Paths');
+        lines.push('');
+        lines.push('The following edges loop back to earlier stages when conditions are met:');
+        lines.push('');
+        for (const edge of loopBackEdges) {
+            const fromNode = nodeMap.get(edge.from);
+            const toNode = nodeMap.get(edge.to);
+            const fromLabel = fromNode?.label ?? edge.from;
+            const toLabel = toNode?.label ?? edge.to;
+            let conditionDesc = 'unconditionally';
+            if (edge.condition) {
+                const { field, operator, value } = edge.condition;
+                conditionDesc = `when ${field} ${operator} ${value}`;
+            }
+            lines.push(`- **${fromLabel}** loops back to **${toLabel}** ${conditionDesc}`);
+        }
+        lines.push('');
+    }
+    return lines.join('\n');
+}
+//# sourceMappingURL=sop-generator.js.map

package/dist/sop-generator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sop-generator.js","sourceRoot":"","sources":["../src/sop-generator.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAcH,MAAM,iBAAiB,GAAoC;IACzD,QAAQ,EAAE;QACR,QAAQ,EAAE,iJAAiJ;QAC3J,QAAQ,EAAE,0HAA0H;QACpI,SAAS,EAAE,oIAAoI;KAChJ;IACD,WAAW,EAAE;QACX,QAAQ,EAAE,2EAA2E;QACrF,QAAQ,EAAE,6FAA6F;QACvG,SAAS,EAAE,gJAAgJ;KAC5J;IACD,MAAM,EAAE;QACN,QAAQ,EAAE,kHAAkH;QAC5H,QAAQ,EAAE,4GAA4G;QACtH,SAAS,EAAE,+FAA+F;KAC3G;IACD,EAAE,EAAE;QACF,QAAQ,EAAE,yEAAyE;QACnF,QAAQ,EAAE,qHAAqH;QAC/H,SAAS,EAAE,iGAAiG;KAC7G;IACD,QAAQ,EAAE;QACR,QAAQ,EAAE,EAAE;QACZ,QAAQ,EAAE,EAAE;QACZ,SAAS,EAAE,EAAE;KACd;CACF,CAAC;AAEF,+EAA+E;AAC/E,gEAAgE;AAChE,+EAA+E;AAE/E;;;;;;;;;;;GAWG;AACH,SAAS,cAAc,CACrB,KAAqB,EACrB,KAAqB;IAErB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEhD,0EAA0E;IAC1E,2DAA2D;IAC3D,MAAM,SAAS,GAAG,IAAI,GAAG,EAAqD,CAAC;IAC/E,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC7B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAS;QAC/D,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC;IACxD,CAAC;IAED,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,YAAY;IAC7B,MAAM,IAAI,GAAG,CAAC,CAAC,CAAE,iCAAiC;IAClD,MAAM,KAAK,GAAG,CAAC,CAAC,CAAC,kBAAkB;IAEnC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAEpD,MAAM,YAAY,GAAmB,EAAE,CAAC;IACxC,MAAM,aAAa,GAAmB,EAAE,CAAC;IAEzC,SAAS,GAAG,CAAC,MAAc;QACzB,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACxB,KAAK,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YACvD,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC;YACvC,IAAI,OAAO,KAAK,IAAI,EAAE,CAAC;gBACrB,qEAAqE;gBACrE,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAC3B,CAAC;iBAAM,CAAC;gBACN,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACxB,IAAI,OAAO,KAAK,KAAK,EAAE,CAAC;oBACtB,GAAG,CAAC,EAAE,CAAC,CAAC;gBACV,CAAC;YACH,CAAC;QACH,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,KAAK,EAAE,CAAC;YACjC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,CAAC;IACH,CAAC;IAED,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,CAAC;AACzC,CAAC;AAED;;;GAGG;AACH,SAAS,QAAQ,CAAC,KAAqB,EAAE,YAA4B;IACnE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAE9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC7B,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACxD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC1C,CAAC;IAED,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,CAAC,EAAE,EAAE,GAAG,CAAC,IAAI,QAAQ,EAAE,CAAC;QACjC,IAAI,GAAG,KAAK,CAAC;YAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAChC,CAAC;IAED,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACrB,KAAK,MAAM,QAAQ,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YACpD,MAAM,MAAM,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YACjD,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC/B,IAAI,MAAM,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzC,CAAC;IACH,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAmB,CAAC;AAC/E,CAAC;AAED,+EAA+E;AAC/E,gBAAgB;AAChB,+EAA+E;AAE/E;;;GAGG;AACH,SAAS,eAAe,CAAC,IAAkB;IACzC,MAAM,QAAQ,GAAG,iBAAiB,CAAC,IAAI,CAAC,YAAY,IAAI,EAAE,CAAC,IAAI;QAC7D,QAAQ,EAAE,EAAE;QACZ,QAAQ,EAAE,EAAE;QACZ,SAAS,EAAE,EAAE;KACd,CAAC;IAEF,OAAO;QACL,QAAQ,EAAE,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,QAAQ;QAC5C,QAAQ,EAAE,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAC,QAAQ;QAC5C,SAAS,EAAE,IAAI,CAAC,SAAS,IAAI,QAAQ,CAAC,SAAS;KAChD,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;GAWG;AACH,MAAM,UAAU,kBAAkB,CAAC,KAAuC;IACxE,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElD,MAAM,EAAE,YAAY,EAAE,aAAa,EAAE,GAAG,cAAc,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;IACjF,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;IAExD,oFAAoF;IACpF,sCAAsC;IACtC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAC5B,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,CAAC,IAAI,CAAC,gCAAgC,CAAC,CAAC;IAC7C,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACf,KAAK,CAAC,IAAI,CAAC,8EAA8E,CAAC,CAAC;IAC3F,KAAK,CAAC,IAAI,CAAC,0EAA0E,CAAC,CAAC;IACvF,KAAK,CAAC,IAAI,CAAC,8EAA8E,CAAC,CAAC;IAC3F,KAAK,CAAC,IAAI,CAAC,6CAA6C,CAAC,CAAC;IAC1D,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAEf,sCAAsC;IACtC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC5C,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAC5B,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY;YACjC,CAAC,CAAC,KAAK,IAAI,CAAC,YAAY,GAAG;YAC3B,CAAC,CAAC,EAAE,CAAC;QAEP,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,KAAK,GAAG,SAAS,EAAE,CAAC,CAAC;QAC5D,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEf,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC;YACtB,KAAK,CAAC,IAAI,CAAC,iBAAiB,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC;YACjD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,CAAC;QACD,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC;YACtB,KAAK,CAAC,IAAI,CAAC,iBAAiB,QAAQ,CAAC,QAAQ,EAAE,CAAC,CAAC;YACjD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,CAAC;QACD,IAAI,QAAQ,CAAC,SAAS,EAAE,CAAC;YACvB,KAAK,CAAC,IAAI,CAAC,kBAAkB,QAAQ,CAAC,SAAS,EAAE,CAAC,CAAC;YACnD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IAED,mCAAmC;IACnC,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAE3D,KAAK,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;QACjC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,KAAK,CAAC,IAAI,CAAC,0EAA0E,CAAC,CAAC;QACvF,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEf,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;YACjC,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxC,MAAM,MAAM,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACpC,MAAM,SAAS,GAAG,QAAQ,EAAE,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC;YAC/C,MAAM,OAAO,GAAG,MAAM,EAAE,KAAK,IAAI,IAAI,CAAC,EAAE,CAAC;YAEzC,IAAI,aAAa,GAAG,iBAAiB,CAAC;YACtC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;gBACnB,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,SAAS,CAAC;gBAClD,aAAa,GAAG,QAAQ,KAAK,IAAI,QAAQ,IAAI,KAAK,EAAE,CAAC;YACvD,CAAC;YAED,KAAK,CAAC,IAAI,CAAC,OAAO,SAAS,sBAAsB,OAAO,MAAM,aAAa,EAAE,CAAC,CAAC;QACjF,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjB,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC1B,CAAC"}

package/dist/spec-profiles.d.ts

@@ -0,0 +1,41 @@
+/**
+ * Execution profiles for factory spec types.
+ *
+ * Each spec type (prototype, mvp, extend_existing) maps to a different
+ * execution profile that controls which gates run, iteration limits,
+ * audit depth, operational guidance, and prompt injection for strategy
+ * design and planning phases.
+ *
+ * Used by:
+ * - strategy-design.ts to inject spec type context into the design prompt
+ * - planning.ts to inject planning emphasis into prompts
+ * - gate-engine.ts to skip disabled gate layers
+ * - instance-lifecycle.ts for resolved execution configuration
+ */
+import type { FactoryBlueprint, SpecType } from './types.js';
+export type AuditDepth = 'shallow' | 'standard' | 'deep';
+export interface ExecutionProfile {
+    gatesEnabled: {
+        deterministic: boolean;
+        behavioral: boolean;
+        adversarial: boolean;
+    };
+    maxIterations: number;
+    auditDepth: AuditDepth;
+    conformanceChecks: boolean;
+    operationalNotes: string;
+    /** Strategy design guidance text for the AI. */
+    strategyDesignGuidance: string;
+    /** Planning emphasis text for the AI. */
+    planningGuidance: string;
+}
+/**
+ * Resolve an execution profile for a given spec type and blueprint.
+ *
+ * - `prototype`: deterministic gates only, 2 iterations max, shallow audit
+ * - `mvp`: all gates, blueprint-default iterations, standard audit
+ * - `extend_existing`: all gates + conformance checks, blueprint-default iterations, deep audit
+ * - `null` / unknown: returns blueprint defaults unchanged
+ */
+export declare function resolveExecutionProfile(specType: SpecType | string | null, blueprint?: FactoryBlueprint | null): ExecutionProfile;
+//# sourceMappingURL=spec-profiles.d.ts.map

package/dist/spec-profiles.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"spec-profiles.d.ts","sourceRoot":"","sources":["../src/spec-profiles.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;GAaG;AAEH,OAAO,KAAK,EAAE,gBAAgB,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAM7D,MAAM,MAAM,UAAU,GAAG,SAAS,GAAG,UAAU,GAAG,MAAM,CAAC;AAEzD,MAAM,WAAW,gBAAgB;IAC/B,YAAY,EAAE;QAAE,aAAa,EAAE,OAAO,CAAC;QAAC,UAAU,EAAE,OAAO,CAAC;QAAC,WAAW,EAAE,OAAO,CAAA;KAAE,CAAC;IACpF,aAAa,EAAE,MAAM,CAAC;IACtB,UAAU,EAAE,UAAU,CAAC;IACvB,iBAAiB,EAAE,OAAO,CAAC;IAC3B,gBAAgB,EAAE,MAAM,CAAC;IACzB,gDAAgD;IAChD,sBAAsB,EAAE,MAAM,CAAC;IAC/B,yCAAyC;IACzC,gBAAgB,EAAE,MAAM,CAAC;CAC1B;AAiED;;;;;;;GAOG;AACH,wBAAgB,uBAAuB,CACrC,QAAQ,EAAE,QAAQ,GAAG,MAAM,GAAG,IAAI,EAClC,SAAS,CAAC,EAAE,gBAAgB,GAAG,IAAI,GAClC,gBAAgB,CA8BlB"}