claude-flow-novice 1.6.4 → 1.6.5

package/.claude-flow-novice/dist/src/coordination/archives/v2-sdk-typescript/v2/memory/dependency-storage.js

@@ -0,0 +1,367 @@
+/**
+ * Agent Coordination V2 - Dependency Storage
+ *
+ * High-level API for dependency graph persistence using artifact-backed storage.
+ * Integrates DependencyArtifactStorage backend with DependencyGraph operations.
+ *
+ * Performance targets (inherited from artifact backend):
+ * - Save/load: <12ms (p95) for dependency DAGs
+ * - Compression: 60-70% size reduction
+ * - Binary format: MessagePack + gzip
+ *
+ * @module coordination/v2/memory/dependency-storage
+ */ import { DependencyGraph } from '../core/dependency-graph.js';
+import { DependencyNodeImpl } from '../core/dependency-node.js';
+import { DependencyArtifactStorage } from '../dependency/artifact-storage.js';
+/**
+ * DependencyStorage - High-level persistence API for dependency graphs
+ *
+ * Provides simple save/load interface backed by high-performance binary storage.
+ * Automatically handles serialization, compression, and integrity verification.
+ *
+ * Features:
+ * - Automatic MessagePack serialization
+ * - Gzip compression (60-70% size reduction)
+ * - Integrity verification with checksums
+ * - Performance monitoring
+ * - Cache-backed retrieval
+ *
+ * @example
+ * ```typescript
+ * const storage = new DependencyStorage({
+ *   storagePath: '.claude-flow/dependencies'
+ * });
+ * await storage.initialize();
+ *
+ * // Save dependency graph
+ * const graph = new DependencyGraph();
+ * await storage.saveGraph('graph-123', graph);
+ *
+ * // Load dependency graph
+ * const loadedGraph = await storage.loadGraph('graph-123');
+ *
+ * // Check existence
+ * const exists = storage.hasGraph('graph-123');
+ *
+ * // List all graphs
+ * const graphIds = storage.listGraphs();
+ * ```
+ */ export class DependencyStorage {
+    backend;
+    metrics;
+    latencyBuffer;
+    /**
+   * Creates a new dependency storage instance
+   *
+   * @param config - Storage configuration
+   */ constructor(config = {}){
+        this.backend = new DependencyArtifactStorage(config);
+        this.metrics = this.initializeMetrics();
+        this.latencyBuffer = [];
+    }
+    // ===========================
+    // Lifecycle
+    // ===========================
+    /**
+   * Initialize storage backend
+   */ async initialize() {
+        await this.backend.initialize();
+    }
+    /**
+   * Close storage and persist state
+   */ async close() {
+        await this.backend.close();
+    }
+    /**
+   * Check if storage is ready
+   */ isReady() {
+        return this.backend.isReady();
+    }
+    // ===========================
+    // Core Operations
+    // ===========================
+    /**
+   * Save dependency graph to storage
+   *
+   * Performance target: <12ms (p95)
+   *
+   * @param graphId - Unique graph identifier
+   * @param graph - DependencyGraph to persist
+   * @throws Error if save fails
+   */ async saveGraph(graphId, graph) {
+        const startTime = Date.now();
+        try {
+            // Serialize graph
+            const serialized = this.serializeGraph(graphId, graph);
+            // Store via binary backend
+            await this.backend.store(graphId, serialized);
+            // Update metrics
+            const latency = Date.now() - startTime;
+            this.updateSaveMetrics(latency, graph.getAllNodes().length);
+            if (latency > 12) {
+                console.warn(`[DependencyStorage] Save latency ${latency}ms exceeds 12ms target for graph ${graphId}`);
+            }
+        } catch (error) {
+            throw new Error(`Failed to save graph ${graphId}: ${error instanceof Error ? error.message : String(error)}`);
+        }
+    }
+    /**
+   * Load dependency graph from storage
+   *
+   * Performance target: <12ms (p95)
+   *
+   * @param graphId - Graph identifier
+   * @returns Reconstructed DependencyGraph
+   * @throws Error if graph not found or load fails
+   */ async loadGraph(graphId) {
+        const startTime = Date.now();
+        try {
+            // Retrieve from binary backend
+            const serialized = await this.backend.retrieve(graphId);
+            // Deserialize graph
+            const graph = this.deserializeGraph(serialized);
+            // Update metrics
+            const latency = Date.now() - startTime;
+            this.updateLoadMetrics(latency);
+            if (latency > 12) {
+                console.warn(`[DependencyStorage] Load latency ${latency}ms exceeds 12ms target for graph ${graphId}`);
+            }
+            return graph;
+        } catch (error) {
+            throw new Error(`Failed to load graph ${graphId}: ${error instanceof Error ? error.message : String(error)}`);
+        }
+    }
+    /**
+   * Delete dependency graph
+   *
+   * @param graphId - Graph identifier to delete
+   */ async deleteGraph(graphId) {
+        await this.backend.delete(graphId);
+    }
+    /**
+   * Check if graph exists
+   *
+   * @param graphId - Graph identifier
+   * @returns True if exists
+   */ hasGraph(graphId) {
+        return this.backend.has(graphId);
+    }
+    /**
+   * List all stored graph IDs
+   *
+   * @returns Array of graph IDs
+   */ listGraphs() {
+        return this.backend.keys();
+    }
+    /**
+   * Clear all stored graphs
+   */ async clearAll() {
+        await this.backend.clear();
+        this.metrics = this.initializeMetrics();
+    }
+    // ===========================
+    // Incremental Operations
+    // ===========================
+    /**
+   * Update single node in stored graph
+   *
+   * Loads graph, updates node, and saves.
+   *
+   * @param graphId - Graph identifier
+   * @param node - Updated node
+   */ async updateNode(graphId, node) {
+        const graph = await this.loadGraph(graphId);
+        if (graph.hasNode(node.id)) {
+            graph.removeNode(node.id);
+        }
+        const nodeImpl = DependencyNodeImpl.fromJSON(node);
+        graph.addNode(nodeImpl);
+        await this.saveGraph(graphId, graph);
+    }
+    /**
+   * Add dependency edge to stored graph
+   *
+   * @param graphId - Graph identifier
+   * @param fromTaskId - Source task ID
+   * @param toTaskId - Target task ID
+   */ async addDependency(graphId, fromTaskId, toTaskId) {
+        const graph = await this.loadGraph(graphId);
+        graph.addDependency(fromTaskId, toTaskId);
+        await this.saveGraph(graphId, graph);
+    }
+    /**
+   * Remove dependency edge from stored graph
+   *
+   * @param graphId - Graph identifier
+   * @param fromTaskId - Source task ID
+   * @param toTaskId - Target task ID
+   */ async removeDependency(graphId, fromTaskId, toTaskId) {
+        const graph = await this.loadGraph(graphId);
+        graph.removeDependency(fromTaskId, toTaskId);
+        await this.saveGraph(graphId, graph);
+    }
+    // ===========================
+    // Maintenance
+    // ===========================
+    /**
+   * Optimize storage backend
+   *
+   * Compacts binary data file and removes deleted entries.
+   */ async optimize() {
+        await this.backend.optimize();
+    }
+    /**
+   * Get storage metrics
+   */ getMetrics() {
+        const backendMetrics = this.backend.getMetrics();
+        return {
+            ...this.metrics,
+            totalGraphs: backendMetrics.totalArtifacts,
+            averageCompressionRatio: backendMetrics.averageCompressionRatio
+        };
+    }
+    /**
+   * Get backend storage metrics
+   */ getBackendMetrics() {
+        return this.backend.getMetrics();
+    }
+    // ===========================
+    // Serialization Helpers
+    // ===========================
+    /**
+   * Serialize dependency graph to storage format
+   */ serializeGraph(graphId, graph) {
+        const nodes = graph.getAllNodes();
+        const stats = graph.getStatistics();
+        // Serialize nodes
+        const serializedNodes = nodes.map((node)=>({
+                id: node.id,
+                agentId: node.agentId,
+                taskId: node.taskId,
+                dependencies: node.dependencies,
+                dependents: node.dependents,
+                status: node.status,
+                priority: node.priority,
+                metadata: node.metadata,
+                createdAt: node.createdAt,
+                updatedAt: node.updatedAt
+            }));
+        // Serialize edges
+        const edges = [];
+        for (const node of nodes){
+            const deps = graph.getDependencies(node.id);
+            for (const depId of Array.from(deps)){
+                edges.push([
+                    node.id,
+                    depId
+                ]);
+            }
+        }
+        return {
+            id: graphId,
+            nodes: serializedNodes,
+            edges,
+            config: {
+                allowDuplicateEdges: false,
+                autoValidate: true,
+                maxSize: 10000
+            },
+            metadata: {
+                createdAt: Date.now(),
+                updatedAt: Date.now(),
+                nodeCount: nodes.length,
+                edgeCount: stats.edgeCount
+            }
+        };
+    }
+    /**
+   * Deserialize dependency graph from storage format
+   */ deserializeGraph(serialized) {
+        const graph = new DependencyGraph(serialized.config);
+        // Reconstruct nodes
+        for (const nodeData of serialized.nodes){
+            const node = new DependencyNodeImpl({
+                id: nodeData.id,
+                agentId: nodeData.agentId,
+                taskId: nodeData.taskId,
+                dependencies: nodeData.dependencies,
+                priority: nodeData.priority,
+                metadata: nodeData.metadata
+            });
+            // Restore internal state
+            node._status = nodeData.status;
+            node._dependents = new Set(nodeData.dependents);
+            node._createdAt = nodeData.createdAt;
+            node._updatedAt = nodeData.updatedAt;
+            graph.addNode(node);
+        }
+        // Reconstruct edges
+        for (const [fromId, toId] of serialized.edges){
+            if (graph.hasNode(fromId) && graph.hasNode(toId)) {
+                graph.addDependency(fromId, toId);
+            }
+        }
+        return graph;
+    }
+    // ===========================
+    // Metrics Helpers
+    // ===========================
+    /**
+   * Initialize metrics structure
+   */ initializeMetrics() {
+        return {
+            totalGraphs: 0,
+            totalSaves: 0,
+            totalLoads: 0,
+            averageSaveLatencyMs: 0,
+            averageLoadLatencyMs: 0,
+            p95SaveLatencyMs: 0,
+            p95LoadLatencyMs: 0,
+            averageGraphSize: 0,
+            averageCompressionRatio: 0
+        };
+    }
+    /**
+   * Update save operation metrics
+   */ updateSaveMetrics(latency, nodeCount) {
+        this.metrics.totalSaves++;
+        // Update average latency
+        const totalLatency = this.metrics.averageSaveLatencyMs * (this.metrics.totalSaves - 1) + latency;
+        this.metrics.averageSaveLatencyMs = totalLatency / this.metrics.totalSaves;
+        // Update P95
+        this.latencyBuffer.push(latency);
+        if (this.latencyBuffer.length > 1000) {
+            this.latencyBuffer = this.latencyBuffer.slice(-1000);
+        }
+        this.metrics.p95SaveLatencyMs = this.calculateP95(this.latencyBuffer);
+        // Update average graph size
+        const totalNodes = this.metrics.averageGraphSize * (this.metrics.totalSaves - 1) + nodeCount;
+        this.metrics.averageGraphSize = totalNodes / this.metrics.totalSaves;
+    }
+    /**
+   * Update load operation metrics
+   */ updateLoadMetrics(latency) {
+        this.metrics.totalLoads++;
+        // Update average latency
+        const totalLatency = this.metrics.averageLoadLatencyMs * (this.metrics.totalLoads - 1) + latency;
+        this.metrics.averageLoadLatencyMs = totalLatency / this.metrics.totalLoads;
+        // Update P95
+        this.latencyBuffer.push(latency);
+        if (this.latencyBuffer.length > 1000) {
+            this.latencyBuffer = this.latencyBuffer.slice(-1000);
+        }
+        this.metrics.p95LoadLatencyMs = this.calculateP95(this.latencyBuffer);
+    }
+    /**
+   * Calculate 95th percentile latency
+   */ calculateP95(latencies) {
+        if (latencies.length === 0) return 0;
+        const sorted = [
+            ...latencies
+        ].sort((a, b)=>a - b);
+        const index = Math.floor(sorted.length * 0.95);
+        return sorted[index] || 0;
+    }
+}
+
+//# sourceMappingURL=dependency-storage.js.map

package/.claude-flow-novice/dist/src/coordination/archives/v2-sdk-typescript/v2/memory/dependency-storage.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../../../src/coordination/archives/v2-sdk-typescript/v2/memory/dependency-storage.ts"],"names":["DependencyGraph","DependencyNodeImpl","DependencyArtifactStorage","DependencyStorage","backend","metrics","latencyBuffer","config","initializeMetrics","initialize","close","isReady","saveGraph","graphId","graph","startTime","Date","now","serialized","serializeGraph","store","latency","updateSaveMetrics","getAllNodes","length","console","warn","error","Error","message","String","loadGraph","retrieve","deserializeGraph","updateLoadMetrics","deleteGraph","delete","hasGraph","has","listGraphs","keys","clearAll","clear","updateNode","node","hasNode","id","removeNode","nodeImpl","fromJSON","addNode","addDependency","fromTaskId","toTaskId","removeDependency","optimize","getMetrics","backendMetrics","totalGraphs","totalArtifacts","averageCompressionRatio","getBackendMetrics","nodes","stats","getStatistics","serializedNodes","map","agentId","taskId","dependencies","dependents","status","priority","metadata","createdAt","updatedAt","edges","deps","getDependencies","depId","Array","from","push","allowDuplicateEdges","autoValidate","maxSize","nodeCount","edgeCount","nodeData","_status","_dependents","Set","_createdAt","_updatedAt","fromId","toId","totalSaves","totalLoads","averageSaveLatencyMs","averageLoadLatencyMs","p95SaveLatencyMs","p95LoadLatencyMs","averageGraphSize","totalLatency","slice","calculateP95","totalNodes","latencies","sorted","sort","a","b","index","Math","floor"],"mappings":"AAAA;;;;;;;;;;;;CAYC,GAED,SAASA,eAAe,QAAQ,8BAA8B;AAC9D,SAAyBC,kBAAkB,QAAQ,6BAA6B;AAChF,SAASC,yBAAyB,QAAQ,oCAAoC;AA+E9E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAiCC,GACD,OAAO,MAAMC;IACHC,QAAmC;IACnCC,QAAkC;IAClCC,cAAwB;IAEhC;;;;GAIC,GACD,YAAYC,SAGR,CAAC,CAAC,CAAE;QACN,IAAI,CAACH,OAAO,GAAG,IAAIF,0BAA0BK;QAC7C,IAAI,CAACF,OAAO,GAAG,IAAI,CAACG,iBAAiB;QACrC,IAAI,CAACF,aAAa,GAAG,EAAE;IACzB;IAEA,8BAA8B;IAC9B,YAAY;IACZ,8BAA8B;IAE9B;;GAEC,GACD,MAAMG,aAA4B;QAChC,MAAM,IAAI,CAACL,OAAO,CAACK,UAAU;IAC/B;IAEA;;GAEC,GACD,MAAMC,QAAuB;QAC3B,MAAM,IAAI,CAACN,OAAO,CAACM,KAAK;IAC1B;IAEA;;GAEC,GACDC,UAAmB;QACjB,OAAO,IAAI,CAACP,OAAO,CAACO,OAAO;IAC7B;IAEA,8BAA8B;IAC9B,kBAAkB;IAClB,8BAA8B;IAE9B;;;;;;;;GAQC,GACD,MAAMC,UAAUC,OAAe,EAAEC,KAAsB,EAAiB;QACtE,MAAMC,YAAYC,KAAKC,GAAG;QAE1B,IAAI;YACF,kBAAkB;YAClB,MAAMC,aAAa,IAAI,CAACC,cAAc,CAACN,SAASC;YAEhD,2BAA2B;YAC3B,MAAM,IAAI,CAACV,OAAO,CAACgB,KAAK,CAACP,SAASK;YAElC,iBAAiB;YACjB,MAAMG,UAAUL,KAAKC,GAAG,KAAKF;YAC7B,IAAI,CAACO,iBAAiB,CAACD,SAASP,MAAMS,WAAW,GAAGC,MAAM;YAE1D,IAAIH,UAAU,IAAI;gBAChBI,QAAQC,IAAI,CAAC,CAAC,iCAAiC,EAAEL,QAAQ,iCAAiC,EAAER,SAAS;YACvG;QACF,EAAE,OAAOc,OAAO;YACd,MAAM,IAAIC,MAAM,CAAC,qBAAqB,EAAEf,QAAQ,EAAE,EAAEc,iBAAiBC,QAAQD,MAAME,OAAO,GAAGC,OAAOH,QAAQ;QAC9G;IACF;IAEA;;;;;;;;GAQC,GACD,MAAMI,UAAUlB,OAAe,EAA4B;QACzD,MAAME,YAAYC,KAAKC,GAAG;QAE1B,IAAI;YACF,+BAA+B;YAC/B,MAAMC,aAAa,MAAM,IAAI,CAACd,OAAO,CAAC4B,QAAQ,CAACnB;YAE/C,oBAAoB;YACpB,MAAMC,QAAQ,IAAI,CAACmB,gBAAgB,CAACf;YAEpC,iBAAiB;YACjB,MAAMG,UAAUL,KAAKC,GAAG,KAAKF;YAC7B,IAAI,CAACmB,iBAAiB,CAACb;YAEvB,IAAIA,UAAU,IAAI;gBAChBI,QAAQC,IAAI,CAAC,CAAC,iCAAiC,EAAEL,QAAQ,iCAAiC,EAAER,SAAS;YACvG;YAEA,OAAOC;QACT,EAAE,OAAOa,OAAO;YACd,MAAM,IAAIC,MAAM,CAAC,qBAAqB,EAAEf,QAAQ,EAAE,EAAEc,iBAAiBC,QAAQD,MAAME,OAAO,GAAGC,OAAOH,QAAQ;QAC9G;IACF;IAEA;;;;GAIC,GACD,MAAMQ,YAAYtB,OAAe,EAAiB;QAChD,MAAM,IAAI,CAACT,OAAO,CAACgC,MAAM,CAACvB;IAC5B;IAEA;;;;;GAKC,GACDwB,SAASxB,OAAe,EAAW;QACjC,OAAO,IAAI,CAACT,OAAO,CAACkC,GAAG,CAACzB;IAC1B;IAEA;;;;GAIC,GACD0B,aAAuB;QACrB,OAAO,IAAI,CAACnC,OAAO,CAACoC,IAAI;IAC1B;IAEA;;GAEC,GACD,MAAMC,WAA0B;QAC9B,MAAM,IAAI,CAACrC,OAAO,CAACsC,KAAK;QACxB,IAAI,CAACrC,OAAO,GAAG,IAAI,CAACG,iBAAiB;IACvC;IAEA,8BAA8B;IAC9B,yBAAyB;IACzB,8BAA8B;IAE9B;;;;;;;GAOC,GACD,MAAMmC,WAAW9B,OAAe,EAAE+B,IAAoB,EAAiB;QACrE,MAAM9B,QAAQ,MAAM,IAAI,CAACiB,SAAS,CAAClB;QAEnC,IAAIC,MAAM+B,OAAO,CAACD,KAAKE,EAAE,GAAG;YAC1BhC,MAAMiC,UAAU,CAACH,KAAKE,EAAE;QAC1B;QAEA,MAAME,WAAW/C,mBAAmBgD,QAAQ,CAACL;QAC7C9B,MAAMoC,OAAO,CAACF;QAEd,MAAM,IAAI,CAACpC,SAAS,CAACC,SAASC;IAChC;IAEA;;;;;;GAMC,GACD,MAAMqC,cAActC,OAAe,EAAEuC,UAAkB,EAAEC,QAAgB,EAAiB;QACxF,MAAMvC,QAAQ,MAAM,IAAI,CAACiB,SAAS,CAAClB;QACnCC,MAAMqC,aAAa,CAACC,YAAYC;QAChC,MAAM,IAAI,CAACzC,SAAS,CAACC,SAASC;IAChC;IAEA;;;;;;GAMC,GACD,MAAMwC,iBAAiBzC,OAAe,EAAEuC,UAAkB,EAAEC,QAAgB,EAAiB;QAC3F,MAAMvC,QAAQ,MAAM,IAAI,CAACiB,SAAS,CAAClB;QACnCC,MAAMwC,gBAAgB,CAACF,YAAYC;QACnC,MAAM,IAAI,CAACzC,SAAS,CAACC,SAASC;IAChC;IAEA,8BAA8B;IAC9B,cAAc;IACd,8BAA8B;IAE9B;;;;GAIC,GACD,MAAMyC,WAA0B;QAC9B,MAAM,IAAI,CAACnD,OAAO,CAACmD,QAAQ;IAC7B;IAEA;;GAEC,GACDC,aAAuC;QACrC,MAAMC,iBAAiB,IAAI,CAACrD,OAAO,CAACoD,UAAU;QAE9C,OAAO;YACL,GAAG,IAAI,CAACnD,OAAO;YACfqD,aAAaD,eAAeE,cAAc;YAC1CC,yBAAyBH,eAAeG,uBAAuB;QACjE;IACF;IAEA;;GAEC,GACDC,oBAAoB;QAClB,OAAO,IAAI,CAACzD,OAAO,CAACoD,UAAU;IAChC;IAEA,8BAA8B;IAC9B,wBAAwB;IACxB,8BAA8B;IAE9B;;GAEC,GACD,AAAQrC,eAAeN,OAAe,EAAEC,KAAsB,EAA6B;QACzF,MAAMgD,QAAQhD,MAAMS,WAAW;QAC/B,MAAMwC,QAAQjD,MAAMkD,aAAa;QAEjC,kBAAkB;QAClB,MAAMC,kBAA8CH,MAAMI,GAAG,CAACtB,CAAAA,OAAS,CAAA;gBACrEE,IAAIF,KAAKE,EAAE;gBACXqB,SAASvB,KAAKuB,OAAO;gBACrBC,QAAQxB,KAAKwB,MAAM;gBACnBC,cAAczB,KAAKyB,YAAY;gBAC/BC,YAAY1B,KAAK0B,UAAU;gBAC3BC,QAAQ3B,KAAK2B,MAAM;gBACnBC,UAAU5B,KAAK4B,QAAQ;gBACvBC,UAAU7B,KAAK6B,QAAQ;gBACvBC,WAAW9B,KAAK8B,SAAS;gBACzBC,WAAW/B,KAAK+B,SAAS;YAC3B,CAAA;QAEA,kBAAkB;QAClB,MAAMC,QAA4B,EAAE;QACpC,KAAK,MAAMhC,QAAQkB,MAAO;YACxB,MAAMe,OAAO/D,MAAMgE,eAAe,CAAClC,KAAKE,EAAE;YAC1C,KAAK,MAAMiC,SAASC,MAAMC,IAAI,CAACJ,MAAO;gBACpCD,MAAMM,IAAI,CAAC;oBAACtC,KAAKE,EAAE;oBAAEiC;iBAAM;YAC7B;QACF;QAEA,OAAO;YACLjC,IAAIjC;YACJiD,OAAOG;YACPW;YACArE,QAAQ;gBACN4E,qBAAqB;gBACrBC,cAAc;gBACdC,SAAS;YACX;YACAZ,UAAU;gBACRC,WAAW1D,KAAKC,GAAG;gBACnB0D,WAAW3D,KAAKC,GAAG;gBACnBqE,WAAWxB,MAAMtC,MAAM;gBACvB+D,WAAWxB,MAAMwB,SAAS;YAC5B;QACF;IACF;IAEA;;GAEC,GACD,AAAQtD,iBAAiBf,UAAqC,EAAmB;QAC/E,MAAMJ,QAAQ,IAAId,gBAAgBkB,WAAWX,MAAM;QAEnD,oBAAoB;QACpB,KAAK,MAAMiF,YAAYtE,WAAW4C,KAAK,CAAE;YACvC,MAAMlB,OAAO,IAAI3C,mBAAmB;gBAClC6C,IAAI0C,SAAS1C,EAAE;gBACfqB,SAASqB,SAASrB,OAAO;gBACzBC,QAAQoB,SAASpB,MAAM;gBACvBC,cAAcmB,SAASnB,YAAY;gBACnCG,UAAUgB,SAAShB,QAAQ;gBAC3BC,UAAUe,SAASf,QAAQ;YAC7B;YAEA,yBAAyB;YACxB7B,KAAa6C,OAAO,GAAGD,SAASjB,MAAM;YACtC3B,KAAa8C,WAAW,GAAG,IAAIC,IAAIH,SAASlB,UAAU;YACtD1B,KAAagD,UAAU,GAAGJ,SAASd,SAAS;YAC5C9B,KAAaiD,UAAU,GAAGL,SAASb,SAAS;YAE7C7D,MAAMoC,OAAO,CAACN;QAChB;QAEA,oBAAoB;QACpB,KAAK,MAAM,CAACkD,QAAQC,KAAK,IAAI7E,WAAW0D,KAAK,CAAE;YAC7C,IAAI9D,MAAM+B,OAAO,CAACiD,WAAWhF,MAAM+B,OAAO,CAACkD,OAAO;gBAChDjF,MAAMqC,aAAa,CAAC2C,QAAQC;YAC9B;QACF;QAEA,OAAOjF;IACT;IAEA,8BAA8B;IAC9B,kBAAkB;IAClB,8BAA8B;IAE9B;;GAEC,GACD,AAAQN,oBAA8C;QACpD,OAAO;YACLkD,aAAa;YACbsC,YAAY;YACZC,YAAY;YACZC,sBAAsB;YACtBC,sBAAsB;YACtBC,kBAAkB;YAClBC,kBAAkB;YAClBC,kBAAkB;YAClB1C,yBAAyB;QAC3B;IACF;IAEA;;GAEC,GACD,AAAQtC,kBAAkBD,OAAe,EAAEiE,SAAiB,EAAQ;QAClE,IAAI,CAACjF,OAAO,CAAC2F,UAAU;QAEvB,yBAAyB;QACzB,MAAMO,eAAe,IAAI,CAAClG,OAAO,CAAC6F,oBAAoB,GAAI,CAAA,IAAI,CAAC7F,OAAO,CAAC2F,UAAU,GAAG,CAAA,IAAK3E;QACzF,IAAI,CAAChB,OAAO,CAAC6F,oBAAoB,GAAGK,eAAe,IAAI,CAAClG,OAAO,CAAC2F,UAAU;QAE1E,aAAa;QACb,IAAI,CAAC1F,aAAa,CAAC4E,IAAI,CAAC7D;QACxB,IAAI,IAAI,CAACf,aAAa,CAACkB,MAAM,GAAG,MAAM;YACpC,IAAI,CAAClB,aAAa,GAAG,IAAI,CAACA,aAAa,CAACkG,KAAK,CAAC,CAAC;QACjD;QACA,IAAI,CAACnG,OAAO,CAAC+F,gBAAgB,GAAG,IAAI,CAACK,YAAY,CAAC,IAAI,CAACnG,aAAa;QAEpE,4BAA4B;QAC5B,MAAMoG,aAAa,IAAI,CAACrG,OAAO,CAACiG,gBAAgB,GAAI,CAAA,IAAI,CAACjG,OAAO,CAAC2F,UAAU,GAAG,CAAA,IAAKV;QACnF,IAAI,CAACjF,OAAO,CAACiG,gBAAgB,GAAGI,aAAa,IAAI,CAACrG,OAAO,CAAC2F,UAAU;IACtE;IAEA;;GAEC,GACD,AAAQ9D,kBAAkBb,OAAe,EAAQ;QAC/C,IAAI,CAAChB,OAAO,CAAC4F,UAAU;QAEvB,yBAAyB;QACzB,MAAMM,eAAe,IAAI,CAAClG,OAAO,CAAC8F,oBAAoB,GAAI,CAAA,IAAI,CAAC9F,OAAO,CAAC4F,UAAU,GAAG,CAAA,IAAK5E;QACzF,IAAI,CAAChB,OAAO,CAAC8F,oBAAoB,GAAGI,eAAe,IAAI,CAAClG,OAAO,CAAC4F,UAAU;QAE1E,aAAa;QACb,IAAI,CAAC3F,aAAa,CAAC4E,IAAI,CAAC7D;QACxB,IAAI,IAAI,CAACf,aAAa,CAACkB,MAAM,GAAG,MAAM;YACpC,IAAI,CAAClB,aAAa,GAAG,IAAI,CAACA,aAAa,CAACkG,KAAK,CAAC,CAAC;QACjD;QACA,IAAI,CAACnG,OAAO,CAACgG,gBAAgB,GAAG,IAAI,CAACI,YAAY,CAAC,IAAI,CAACnG,aAAa;IACtE;IAEA;;GAEC,GACD,AAAQmG,aAAaE,SAAmB,EAAU;QAChD,IAAIA,UAAUnF,MAAM,KAAK,GAAG,OAAO;QAEnC,MAAMoF,SAAS;eAAID;SAAU,CAACE,IAAI,CAAC,CAACC,GAAGC,IAAMD,IAAIC;QACjD,MAAMC,QAAQC,KAAKC,KAAK,CAACN,OAAOpF,MAAM,GAAG;QACzC,OAAOoF,MAAM,CAACI,MAAM,IAAI;IAC1B;AACF"}

package/.claude-flow-novice/dist/src/coordination/archives/v2-sdk-typescript/v2/memory/index.js

@@ -0,0 +1,14 @@
+/**
+ * Agent Coordination V2 - Memory Module
+ *
+ * Exports storage implementations for coordination artifacts.
+ *
+ * @module coordination/v2/memory
+ */ export { DependencyGraphStorage } from './dependency-graph-storage.js';
+export { DependencyStorage, DependencyStorageMetrics } from './dependency-storage.js';
+export { CompletionStorage, CompletionMetrics, CompletionQueryFilter } from './completion-storage.js';
+export { MessageStorage } from './message-storage.js';
+export { StateStorage } from './state-storage.js';
+export { ArtifactAdapter } from './artifact-adapter.js';
+
+//# sourceMappingURL=index.js.map

package/.claude-flow-novice/dist/src/coordination/archives/v2-sdk-typescript/v2/memory/index.js.map

@@ -0,0 +1 @@
+{"version":3,"sources":["../../../../../../../../src/coordination/archives/v2-sdk-typescript/v2/memory/index.ts"],"names":["DependencyGraphStorage","DependencyStorage","DependencyStorageMetrics","CompletionStorage","CompletionMetrics","CompletionQueryFilter","MessageStorage","StateStorage","ArtifactAdapter"],"mappings":"AAAA;;;;;;CAMC,GAED,SACEA,sBAAsB,QACjB,gCAAgC;AAEvC,SACEC,iBAAiB,EACjBC,wBAAwB,QACnB,0BAA0B;AAEjC,SACEC,iBAAiB,EACjBC,iBAAiB,EACjBC,qBAAqB,QAChB,0BAA0B;AAEjC,SACEC,cAAc,QACT,uBAAuB;AAE9B,SACEC,YAAY,QACP,qBAAqB;AAE5B,SACEC,eAAe,QACV,wBAAwB"}