@thoughtflow/core 0.1.2

package/dist/libs/subgraph.js

@@ -0,0 +1,438 @@
+"use strict";
+/**
+ * Subgraph support for workflow reuse and team separation
+ *
+ * Enables composing reusable graph definitions as nodes within larger graphs.
+ * Inspired by LangGraph's subgraph support.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GraphBuilder = exports.SubgraphNodeBuilder = exports.SubgraphRegistry = void 0;
+/**
+ * Subgraph registry for managing reusable graph definitions
+ */
+class SubgraphRegistry {
+    graphs = new Map();
+    executionHistory = new Map();
+    maxHistorySize = 100;
+    /**
+     * Register a graph definition
+     */
+    registerGraph(graph) {
+        if (!graph.id) {
+            throw new Error("Graph must have an id");
+        }
+        if (!graph.entryPoint) {
+            throw new Error("Graph must have an entryPoint");
+        }
+        // Validate nodes exist
+        const nodeIds = new Set(graph.nodes.map((n) => n.id));
+        if (!nodeIds.has(graph.entryPoint)) {
+            throw new Error(`Entry point '${graph.entryPoint}' not found in nodes`);
+        }
+        for (const exit of graph.exitPoints) {
+            if (!nodeIds.has(exit)) {
+                throw new Error(`Exit point '${exit}' not found in nodes`);
+            }
+        }
+        // Validate edges reference existing nodes
+        for (const edge of graph.edges) {
+            if (!nodeIds.has(edge.from)) {
+                throw new Error(`Edge from '${edge.from}' references non-existent node`);
+            }
+            if (!nodeIds.has(edge.to)) {
+                throw new Error(`Edge to '${edge.to}' references non-existent node`);
+            }
+        }
+        this.graphs.set(graph.id, graph);
+        this.executionHistory.set(graph.id, []);
+        return this;
+    }
+    /**
+     * Get a registered graph definition
+     */
+    getGraph(graphId) {
+        return this.graphs.get(graphId);
+    }
+    /**
+     * Check if a graph exists
+     */
+    hasGraph(graphId) {
+        return this.graphs.has(graphId);
+    }
+    /**
+     * List all registered graph IDs
+     */
+    listGraphs() {
+        return Array.from(this.graphs.keys());
+    }
+    /**
+     * Execute a graph
+     */
+    async executeGraph(graphId, initialState) {
+        const graph = this.graphs.get(graphId);
+        if (!graph) {
+            throw new Error(`Graph '${graphId}' not found`);
+        }
+        const startedAt = new Date();
+        const executedNodes = [];
+        const failedNodes = [];
+        let currentState = { ...initialState };
+        let currentNode = graph.entryPoint;
+        const visited = new Set();
+        try {
+            while (true) {
+                // Prevent infinite loops
+                if (visited.has(currentNode)) {
+                    throw new Error(`Cycle detected at node '${currentNode}'`);
+                }
+                visited.add(currentNode);
+                const nodeDefIndex = graph.nodes.findIndex((n) => n.id === currentNode);
+                if (nodeDefIndex === -1) {
+                    throw new Error(`Node '${currentNode}' not defined`);
+                }
+                const nodeDef = graph.nodes[nodeDefIndex];
+                executedNodes.push(currentNode);
+                try {
+                    // Execute node based on type
+                    if (nodeDef.type === "runnable" && nodeDef.runnable) {
+                        const timeout = nodeDef.timeoutMs || 30000;
+                        currentState = await this.executeWithTimeout(() => nodeDef.runnable(currentState), timeout, nodeDef.retries || 0);
+                    }
+                    else if (nodeDef.type === "conditional" && nodeDef.condition) {
+                        currentNode = nodeDef.condition(currentState);
+                        continue;
+                    }
+                    else if (nodeDef.type === "subgraph" && nodeDef.subgraphId) {
+                        const result = await this.executeGraph(nodeDef.subgraphId, currentState);
+                        if (!result.success) {
+                            throw result.error || new Error("Subgraph execution failed");
+                        }
+                        currentState = result.finalState;
+                    }
+                    // Check if we're at an exit point
+                    if (graph.exitPoints.includes(currentNode)) {
+                        break;
+                    }
+                    // Find next node
+                    const nextEdge = graph.edges.find((e) => e.from === currentNode &&
+                        (!e.condition || e.condition(currentState)));
+                    if (!nextEdge) {
+                        // No edge found - look for any edge from current node
+                        const anyEdge = graph.edges.find((e) => e.from === currentNode);
+                        if (anyEdge) {
+                            currentNode = anyEdge.to;
+                        }
+                        else {
+                            // No edges available - check if we're at exit
+                            if (graph.exitPoints.includes(currentNode)) {
+                                break;
+                            }
+                            else {
+                                throw new Error(`No outgoing edge from '${currentNode}' and not at exit point`);
+                            }
+                        }
+                    }
+                    else {
+                        currentNode = nextEdge.to;
+                    }
+                }
+                catch (error) {
+                    failedNodes.push(currentNode);
+                    throw error;
+                }
+            }
+            const durationMs = new Date().getTime() - startedAt.getTime();
+            const result = {
+                success: true,
+                finalState: currentState,
+                executionPath: executedNodes,
+                startedAt,
+                durationMs,
+                executedNodes,
+                failedNodes,
+            };
+            this.recordExecutionResult(graphId, result);
+            return result;
+        }
+        catch (error) {
+            const durationMs = new Date().getTime() - startedAt.getTime();
+            const result = {
+                success: false,
+                finalState: currentState,
+                executionPath: executedNodes,
+                startedAt,
+                durationMs,
+                executedNodes,
+                failedNodes,
+                error: error,
+            };
+            this.recordExecutionResult(graphId, result);
+            return result;
+        }
+    }
+    /**
+     * Execute a function with timeout and retries
+     */
+    async executeWithTimeout(fn, timeoutMs, retries) {
+        let lastError;
+        for (let attempt = 0; attempt <= retries; attempt++) {
+            try {
+                return await Promise.race([
+                    fn(),
+                    new Promise((_, reject) => setTimeout(() => reject(new Error(`Timeout after ${timeoutMs}ms`)), timeoutMs)),
+                ]);
+            }
+            catch (error) {
+                lastError = error;
+                if (attempt < retries) {
+                    // Exponential backoff: 100ms * 2^attempt
+                    await new Promise((resolve) => setTimeout(resolve, 100 * Math.pow(2, attempt)));
+                }
+            }
+        }
+        throw lastError || new Error("Execution failed");
+    }
+    /**
+     * Record execution result in history
+     */
+    recordExecutionResult(graphId, result) {
+        const history = this.executionHistory.get(graphId) || [];
+        history.push(result);
+        // Keep only recent executions
+        if (history.length > this.maxHistorySize) {
+            history.shift();
+        }
+        this.executionHistory.set(graphId, history);
+    }
+    /**
+     * Get execution history for a graph
+     */
+    getExecutionHistory(graphId) {
+        return [...(this.executionHistory.get(graphId) || [])];
+    }
+    /**
+     * Get statistics for a graph
+     */
+    getStats(graphId) {
+        const history = this.executionHistory.get(graphId) || [];
+        const successful = history.filter((r) => r.success).length;
+        return {
+            totalExecutions: history.length,
+            successfulExecutions: successful,
+            failedExecutions: history.length - successful,
+            successRate: history.length > 0 ? (successful / history.length) * 100 : 0,
+        };
+    }
+    /**
+     * Unregister a graph
+     */
+    unregisterGraph(graphId) {
+        const existed = this.graphs.has(graphId);
+        this.graphs.delete(graphId);
+        this.executionHistory.delete(graphId);
+        return existed;
+    }
+    /**
+     * Clear all graphs
+     */
+    clearAll() {
+        this.graphs.clear();
+        this.executionHistory.clear();
+    }
+    /**
+     * Async dispose
+     */
+    async dispose() {
+        this.clearAll();
+    }
+}
+exports.SubgraphRegistry = SubgraphRegistry;
+/**
+ * Subgraph node builder for fluent graph construction
+ */
+class SubgraphNodeBuilder {
+    node = {};
+    /**
+     * Set node ID
+     */
+    withId(id) {
+        this.node.id = id;
+        return this;
+    }
+    /**
+     * Set node name
+     */
+    withName(name) {
+        this.node.name = name;
+        return this;
+    }
+    /**
+     * Create a runnable node
+     */
+    asRunnable(runnable) {
+        this.node.type = "runnable";
+        this.node.runnable = runnable;
+        return this;
+    }
+    /**
+     * Create a subgraph node
+     */
+    asSubgraph(subgraphId) {
+        this.node.type = "subgraph";
+        this.node.subgraphId = subgraphId;
+        return this;
+    }
+    /**
+     * Create a conditional node
+     */
+    asConditional(condition) {
+        this.node.type = "conditional";
+        this.node.condition = condition;
+        return this;
+    }
+    /**
+     * Set retry policy
+     */
+    withRetries(retries) {
+        this.node.retries = retries;
+        return this;
+    }
+    /**
+     * Set timeout
+     */
+    withTimeout(timeoutMs) {
+        this.node.timeoutMs = timeoutMs;
+        return this;
+    }
+    /**
+     * Add metadata
+     */
+    withMetadata(metadata) {
+        this.node.metadata = metadata;
+        return this;
+    }
+    /**
+     * Build the node
+     */
+    build() {
+        if (!this.node.id) {
+            throw new Error("Node must have an id");
+        }
+        return {
+            id: this.node.id,
+            name: this.node.name,
+            type: this.node.type || "runnable",
+            runnable: this.node.runnable,
+            subgraphId: this.node.subgraphId,
+            condition: this.node.condition,
+            retries: this.node.retries,
+            timeoutMs: this.node.timeoutMs,
+            metadata: this.node.metadata,
+        };
+    }
+}
+exports.SubgraphNodeBuilder = SubgraphNodeBuilder;
+/**
+ * Graph builder for fluent graph construction
+ */
+class GraphBuilder {
+    graph = {
+        nodes: [],
+        edges: [],
+        exitPoints: [],
+    };
+    /**
+     * Set graph ID
+     */
+    withId(id) {
+        this.graph.id = id;
+        return this;
+    }
+    /**
+     * Set graph name
+     */
+    withName(name) {
+        this.graph.name = name;
+        return this;
+    }
+    /**
+     * Add a node
+     */
+    addNode(node) {
+        this.graph.nodes.push(node);
+        return this;
+    }
+    /**
+     * Add multiple nodes
+     */
+    addNodes(nodes) {
+        this.graph.nodes.push(...nodes);
+        return this;
+    }
+    /**
+     * Add an edge
+     */
+    addEdge(from, to, condition) {
+        this.graph.edges.push({
+            from,
+            to,
+            condition,
+        });
+        return this;
+    }
+    /**
+     * Set entry point
+     */
+    withEntryPoint(entryPoint) {
+        this.graph.entryPoint = entryPoint;
+        return this;
+    }
+    /**
+     * Add exit point
+     */
+    addExitPoint(exitPoint) {
+        this.graph.exitPoints.push(exitPoint);
+        return this;
+    }
+    /**
+     * Add multiple exit points
+     */
+    addExitPoints(exitPoints) {
+        this.graph.exitPoints.push(...exitPoints);
+        return this;
+    }
+    /**
+     * Set version
+     */
+    withVersion(version) {
+        this.graph.version = version;
+        return this;
+    }
+    /**
+     * Set description
+     */
+    withDescription(description) {
+        this.graph.description = description;
+        return this;
+    }
+    /**
+     * Build graph definition
+     */
+    build() {
+        if (!this.graph.id || !this.graph.entryPoint) {
+            throw new Error("Graph must have id and entryPoint");
+        }
+        return {
+            id: this.graph.id,
+            name: this.graph.name,
+            nodes: this.graph.nodes || [],
+            edges: this.graph.edges || [],
+            entryPoint: this.graph.entryPoint,
+            exitPoints: this.graph.exitPoints || [],
+            version: this.graph.version || 1,
+            description: this.graph.description,
+        };
+    }
+}
+exports.GraphBuilder = GraphBuilder;
+//# sourceMappingURL=subgraph.js.map

package/dist/libs/subgraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"subgraph.js","sourceRoot":"","sources":["../../src/libs/subgraph.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;AAyHH;;GAEG;AACH,MAAa,gBAAgB;IACnB,MAAM,GAA0B,IAAI,GAAG,EAAE,CAAC;IAC1C,gBAAgB,GAAwC,IAAI,GAAG,EAAE,CAAC;IAClE,cAAc,GAAG,GAAG,CAAC;IAE7B;;OAEG;IACH,aAAa,CAAC,KAAe;QAC3B,IAAI,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC;YACd,MAAM,IAAI,KAAK,CAAC,uBAAuB,CAAC,CAAC;QAC3C,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;YACtB,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;QACnD,CAAC;QAED,uBAAuB;QACvB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACtD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC;YACnC,MAAM,IAAI,KAAK,CAAC,gBAAgB,KAAK,CAAC,UAAU,sBAAsB,CAAC,CAAC;QAC1E,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;YACpC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvB,MAAM,IAAI,KAAK,CAAC,eAAe,IAAI,sBAAsB,CAAC,CAAC;YAC7D,CAAC;QACH,CAAC;QAED,0CAA0C;QAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC5B,MAAM,IAAI,KAAK,CAAC,cAAc,IAAI,CAAC,IAAI,gCAAgC,CAAC,CAAC;YAC3E,CAAC;YACD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC1B,MAAM,IAAI,KAAK,CAAC,YAAY,IAAI,CAAC,EAAE,gCAAgC,CAAC,CAAC;YACvE,CAAC;QACH,CAAC;QAED,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACjC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAExC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,OAAe;QACtB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,OAAe;QACtB,OAAO,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAClC,CAAC;IAED;;OAEG;IACH,UAAU;QACR,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,YAAY,CAAC,OAAe,EAAE,YAAqC;QACvE,MAAM,KAAK,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACvC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,MAAM,IAAI,KAAK,CAAC,UAAU,OAAO,aAAa,CAAC,CAAC;QAClD,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,IAAI,EAAE,CAAC;QAC7B,MAAM,aAAa,GAAa,EAAE,CAAC;QACnC,MAAM,WAAW,GAAa,EAAE,CAAC;QACjC,IAAI,YAAY,GAAG,EAAE,GAAG,YAAY,EAAE,CAAC;QACvC,IAAI,WAAW,GAAG,KAAK,CAAC,UAAU,CAAC;QACnC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAElC,IAAI,CAAC;YACH,OAAO,IAAI,EAAE,CAAC;gBACZ,yBAAyB;gBACzB,IAAI,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC;oBAC7B,MAAM,IAAI,KAAK,CAAC,2BAA2B,WAAW,GAAG,CAAC,CAAC;gBAC7D,CAAC;gBACD,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;gBAEzB,MAAM,YAAY,GAAG,KAAK,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,WAAW,CAAC,CAAC;gBACxE,IAAI,YAAY,KAAK,CAAC,CAAC,EAAE,CAAC;oBACxB,MAAM,IAAI,KAAK,CAAC,SAAS,WAAW,eAAe,CAAC,CAAC;gBACvD,CAAC;gBAED,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;gBAC1C,aAAa,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBAEhC,IAAI,CAAC;oBACH,6BAA6B;oBAC7B,IAAI,OAAO,CAAC,IAAI,KAAK,UAAU,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;wBACpD,MAAM,OAAO,GAAG,OAAO,CAAC,SAAS,IAAI,KAAK,CAAC;wBAC3C,YAAY,GAAG,MAAM,IAAI,CAAC,kBAAkB,CAC1C,GAAG,EAAE,CAAC,OAAO,CAAC,QAAS,CAAC,YAAY,CAAC,EACrC,OAAO,EACP,OAAO,CAAC,OAAO,IAAI,CAAC,CACrB,CAAC;oBACJ,CAAC;yBAAM,IAAI,OAAO,CAAC,IAAI,KAAK,aAAa,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;wBAC/D,WAAW,GAAG,OAAO,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;wBAC9C,SAAS;oBACX,CAAC;yBAAM,IAAI,OAAO,CAAC,IAAI,KAAK,UAAU,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;wBAC7D,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,OAAO,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;wBACzE,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;4BACpB,MAAM,MAAM,CAAC,KAAK,IAAI,IAAI,KAAK,CAAC,2BAA2B,CAAC,CAAC;wBAC/D,CAAC;wBACD,YAAY,GAAG,MAAM,CAAC,UAAU,CAAC;oBACnC,CAAC;oBAED,kCAAkC;oBAClC,IAAI,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;wBAC3C,MAAM;oBACR,CAAC;oBAED,iBAAiB;oBACjB,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAC/B,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,IAAI,KAAK,WAAW;wBACtB,CAAC,CAAC,CAAC,CAAC,SAAS,IAAI,CAAC,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC,CAC9C,CAAC;oBAEF,IAAI,CAAC,QAAQ,EAAE,CAAC;wBACd,sDAAsD;wBACtD,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,WAAW,CAAC,CAAC;wBAChE,IAAI,OAAO,EAAE,CAAC;4BACZ,WAAW,GAAG,OAAO,CAAC,EAAE,CAAC;wBAC3B,CAAC;6BAAM,CAAC;4BACN,8CAA8C;4BAC9C,IAAI,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;gCAC3C,MAAM;4BACR,CAAC;iCAAM,CAAC;gCACN,MAAM,IAAI,KAAK,CACb,0BAA0B,WAAW,yBAAyB,CAC/D,CAAC;4BACJ,CAAC;wBACH,CAAC;oBACH,CAAC;yBAAM,CAAC;wBACN,WAAW,GAAG,QAAQ,CAAC,EAAE,CAAC;oBAC5B,CAAC;gBACH,CAAC;gBAAC,OAAO,KAAK,EAAE,CAAC;oBACf,WAAW,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;oBAC9B,MAAM,KAAK,CAAC;gBACd,CAAC;YACH,CAAC;YAED,MAAM,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,OAAO,EAAE,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC;YAC9D,MAAM,MAAM,GAAyB;gBACnC,OAAO,EAAE,IAAI;gBACb,UAAU,EAAE,YAAY;gBACxB,aAAa,EAAE,aAAa;gBAC5B,SAAS;gBACT,UAAU;gBACV,aAAa;gBACb,WAAW;aACZ,CAAC;YAEF,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YAC5C,OAAO,MAAM,CAAC;QAChB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC,OAAO,EAAE,GAAG,SAAS,CAAC,OAAO,EAAE,CAAC;YAC9D,MAAM,MAAM,GAAyB;gBACnC,OAAO,EAAE,KAAK;gBACd,UAAU,EAAE,YAAY;gBACxB,aAAa,EAAE,aAAa;gBAC5B,SAAS;gBACT,UAAU;gBACV,aAAa;gBACb,WAAW;gBACX,KAAK,EAAE,KAAc;aACtB,CAAC;YAEF,IAAI,CAAC,qBAAqB,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YAC5C,OAAO,MAAM,CAAC;QAChB,CAAC;IACH,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,kBAAkB,CAC9B,EAA0C,EAC1C,SAAiB,EACjB,OAAe;QAEf,IAAI,SAA4B,CAAC;QAEjC,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,IAAI,OAAO,EAAE,OAAO,EAAE,EAAE,CAAC;YACpD,IAAI,CAAC;gBACH,OAAO,MAAM,OAAO,CAAC,IAAI,CAAC;oBACxB,EAAE,EAAE;oBACJ,IAAI,OAAO,CAA0B,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,CACjD,UAAU,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,iBAAiB,SAAS,IAAI,CAAC,CAAC,EAAE,SAAS,CAAC,CAC/E;iBACF,CAAC,CAAC;YACL,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,SAAS,GAAG,KAAc,CAAC;gBAC3B,IAAI,OAAO,GAAG,OAAO,EAAE,CAAC;oBACtB,yCAAyC;oBACzC,MAAM,IAAI,OAAO,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC;gBAClF,CAAC;YACH,CAAC;QACH,CAAC;QAED,MAAM,SAAS,IAAI,IAAI,KAAK,CAAC,kBAAkB,CAAC,CAAC;IACnD,CAAC;IAED;;OAEG;IACK,qBAAqB,CAAC,OAAe,EAAE,MAA4B;QACzE,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QACzD,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAErB,8BAA8B;QAC9B,IAAI,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;YACzC,OAAO,CAAC,KAAK,EAAE,CAAC;QAClB,CAAC;QAED,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,mBAAmB,CAAC,OAAe;QACjC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACzD,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,OAAe;QAMtB,MAAM,OAAO,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC;QACzD,MAAM,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;QAE3D,OAAO;YACL,eAAe,EAAE,OAAO,CAAC,MAAM;YAC/B,oBAAoB,EAAE,UAAU;YAChC,gBAAgB,EAAE,OAAO,CAAC,MAAM,GAAG,UAAU;YAC7C,WAAW,EAAE,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,GAAG,OAAO,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;SAC1E,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,OAAe;QAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QACzC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC5B,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACtC,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO;QACX,IAAI,CAAC,QAAQ,EAAE,CAAC;IAClB,CAAC;CACF;AAzRD,4CAyRC;AAED;;GAEG;AACH,MAAa,mBAAmB;IACtB,IAAI,GAAqB,EAAE,CAAC;IAEpC;;OAEG;IACH,MAAM,CAAC,EAAU;QACf,IAAI,CAAC,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,IAAY;QACnB,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,UAAU,CACR,QAAiH;QAEjH,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,UAAkB;QAC3B,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,UAAU,CAAC;QAC5B,IAAI,CAAC,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;QAClC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,SAAqD;QACjE,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,aAAa,CAAC;QAC/B,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAChC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,OAAe;QACzB,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QAC5B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,SAAiB;QAC3B,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAChC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,QAAiC;QAC5C,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC;QAC9B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;YAClB,MAAM,IAAI,KAAK,CAAC,sBAAsB,CAAC,CAAC;QAC1C,CAAC;QAED,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE;YAChB,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI;YACpB,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,UAAU;YAClC,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ;YAC5B,UAAU,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU;YAChC,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS;YAC9B,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO;YAC1B,SAAS,EAAE,IAAI,CAAC,IAAI,CAAC,SAAS;YAC9B,QAAQ,EAAE,IAAI,CAAC,IAAI,CAAC,QAAQ;SAC7B,CAAC;IACJ,CAAC;CACF;AA5FD,kDA4FC;AAED;;GAEG;AACH,MAAa,YAAY;IACf,KAAK,GAAsB;QACjC,KAAK,EAAE,EAAE;QACT,KAAK,EAAE,EAAE;QACT,UAAU,EAAE,EAAE;KACf,CAAC;IAEF;;OAEG;IACH,MAAM,CAAC,EAAU;QACf,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,EAAE,CAAC;QACnB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,IAAY;QACnB,IAAI,CAAC,KAAK,CAAC,IAAI,GAAG,IAAI,CAAC;QACvB,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,IAAa;QACnB,IAAI,CAAC,KAAK,CAAC,KAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,KAAgB;QACvB,IAAI,CAAC,KAAK,CAAC,KAAM,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;QACjC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,OAAO,CAAC,IAAY,EAAE,EAAU,EAAE,SAAuD;QACvF,IAAI,CAAC,KAAK,CAAC,KAAM,CAAC,IAAI,CAAC;YACrB,IAAI;YACJ,EAAE;YACF,SAAS;SACV,CAAC,CAAC;QACH,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,UAAkB;QAC/B,IAAI,CAAC,KAAK,CAAC,UAAU,GAAG,UAAU,CAAC;QACnC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,YAAY,CAAC,SAAiB;QAC5B,IAAI,CAAC,KAAK,CAAC,UAAW,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QACvC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,UAAoB;QAChC,IAAI,CAAC,KAAK,CAAC,UAAW,CAAC,IAAI,CAAC,GAAG,UAAU,CAAC,CAAC;QAC3C,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,OAAe;QACzB,IAAI,CAAC,KAAK,CAAC,OAAO,GAAG,OAAO,CAAC;QAC7B,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,WAAmB;QACjC,IAAI,CAAC,KAAK,CAAC,WAAW,GAAG,WAAW,CAAC;QACrC,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;YAC7C,MAAM,IAAI,KAAK,CAAC,mCAAmC,CAAC,CAAC;QACvD,CAAC;QAED,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE;YACjB,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YACrB,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE;YAC7B,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE;YAC7B,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU;YACjC,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,UAAU,IAAI,EAAE;YACvC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,OAAO,IAAI,CAAC;YAChC,WAAW,EAAE,IAAI,CAAC,KAAK,CAAC,WAAW;SACpC,CAAC;IACJ,CAAC;CACF;AA9GD,oCA8GC"}

package/dist/libs/task-board.class.d.ts

@@ -0,0 +1,53 @@
+/**
+ * TaskBoard — Phase 3
+ *
+ * Persistent task lifecycle management with dependency awareness.
+ * Tasks link to KnowledgeGraph nodes for traceability.
+ *
+ * Features:
+ *   - Full task CRUD with typed properties
+ *   - Status transitions with validation
+ *   - Dependency-aware scheduling (can't start blocked tasks)
+ *   - Query by status, type, assignee, priority
+ *   - Transition history
+ *   - Statistics
+ *
+ * Backed by IStorageAdapter. Default: InMemoryAdapter.
+ */
+import type { BoardTask, BoardTaskStatus, TaskType, TaskPriority, TaskQueryOptions, TaskTransition, TaskBoardStatistics } from "../contracts/task-board.types";
+import type { IStorageAdapter } from "../contracts/storage.types";
+export interface CreateTaskInput {
+    title: string;
+    description: string;
+    type: TaskType;
+    priority: TaskPriority;
+    assignee?: string;
+    dependsOn?: string[];
+    relatedNodes?: string[];
+    acceptanceCriteria?: string[];
+    touchedFiles?: string[];
+    effort?: number;
+    metadata?: Record<string, unknown>;
+}
+export declare class TaskBoard {
+    private readonly tasks;
+    private readonly transitions;
+    constructor(adapter?: IStorageAdapter<BoardTask>);
+    createTask(input: CreateTaskInput): Promise<BoardTask>;
+    getTask(id: string): Promise<BoardTask | null>;
+    updateTask(id: string, patch: Partial<CreateTaskInput>): Promise<BoardTask>;
+    removeTask(id: string): Promise<void>;
+    transition(taskId: string, toStatus: BoardTaskStatus, reason?: string): Promise<BoardTask>;
+    /**
+     * Returns dependencies that are NOT yet DONE or CANCELLED.
+     */
+    getBlockingDependencies(taskId: string): Promise<BoardTask[]>;
+    /**
+     * Get tasks that are ready to start (PLANNED + all dependencies DONE).
+     */
+    getReadyTasks(): Promise<BoardTask[]>;
+    queryTasks(options?: TaskQueryOptions): Promise<BoardTask[]>;
+    getTransitions(taskId?: string): TaskTransition[];
+    getStatistics(): Promise<TaskBoardStatistics>;
+}
+//# sourceMappingURL=task-board.class.d.ts.map

package/dist/libs/task-board.class.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"task-board.class.d.ts","sourceRoot":"","sources":["../../src/libs/task-board.class.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;GAeG;AAGH,OAAO,KAAK,EACV,SAAS,EACT,eAAe,EACf,QAAQ,EACR,YAAY,EACZ,gBAAgB,EAChB,cAAc,EACd,mBAAmB,EACpB,MAAM,+BAA+B,CAAC;AAEvC,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAgBlE,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,MAAM,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;IACpB,IAAI,EAAE,QAAQ,CAAC;IACf,QAAQ,EAAE,YAAY,CAAC;IACvB,QAAQ,CAAC,EAAE,MAAM,CAAC;IAClB,SAAS,CAAC,EAAE,MAAM,EAAE,CAAC;IACrB,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;IACxB,kBAAkB,CAAC,EAAE,MAAM,EAAE,CAAC;IAC9B,YAAY,CAAC,EAAE,MAAM,EAAE,CAAC;IACxB,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,QAAQ,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;CACpC;AAID,qBAAa,SAAS;IACpB,OAAO,CAAC,QAAQ,CAAC,KAAK,CAA6B;IACnD,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAwB;gBAExC,OAAO,CAAC,EAAE,eAAe,CAAC,SAAS,CAAC;IAM1C,UAAU,CAAC,KAAK,EAAE,eAAe,GAAG,OAAO,CAAC,SAAS,CAAC;IAoBtD,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC;IAI9C,UAAU,CAAC,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,CAAC,eAAe,CAAC,GAAG,OAAO,CAAC,SAAS,CAAC;IAO3E,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAMrC,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,EAAE,eAAe,EAAE,MAAM,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,CAAC;IA2DhG;;OAEG;IACG,uBAAuB,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;IAcnE;;OAEG;IACG,aAAa,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;IAyBrC,UAAU,CAAC,OAAO,GAAE,gBAAqB,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;IA8DtE,cAAc,CAAC,MAAM,CAAC,EAAE,MAAM,GAAG,cAAc,EAAE;IAS3C,aAAa,IAAI,OAAO,CAAC,mBAAmB,CAAC;CAiCpD"}