driftdetect-cortex 0.9.41

package/dist/causal/storage/sqlite.js

@@ -0,0 +1,526 @@
+/**
+ * SQLite Causal Storage Implementation
+ *
+ * Persists causal edges to SQLite, enabling graph traversal
+ * and causal inference queries.
+ *
+ * @module causal/storage/sqlite
+ */
+import { generateCausalEdgeId } from '../../utils/id-generator.js';
+/**
+ * SQL for creating the causal_edges table
+ */
+export const CAUSAL_EDGES_SCHEMA = `
+CREATE TABLE IF NOT EXISTS memories (
+  id TEXT PRIMARY KEY,
+  type TEXT NOT NULL,
+  content TEXT NOT NULL,
+  summary TEXT NOT NULL,
+  recorded_at TEXT NOT NULL DEFAULT (datetime('now')),
+  valid_from TEXT NOT NULL DEFAULT (datetime('now')),
+  valid_until TEXT,
+  confidence REAL NOT NULL DEFAULT 1.0,
+  importance TEXT DEFAULT 'normal',
+  last_accessed TEXT,
+  access_count INTEGER DEFAULT 0,
+  created_at TEXT DEFAULT (datetime('now')),
+  updated_at TEXT DEFAULT (datetime('now')),
+  created_by TEXT,
+  tags TEXT,
+  archived INTEGER DEFAULT 0,
+  archive_reason TEXT,
+  superseded_by TEXT,
+  supersedes TEXT,
+  last_validated TEXT
+);
+
+CREATE TABLE IF NOT EXISTS causal_edges (
+  id TEXT PRIMARY KEY,
+  source_id TEXT NOT NULL,
+  target_id TEXT NOT NULL,
+  relation TEXT NOT NULL CHECK (relation IN (
+    'caused', 'enabled', 'prevented', 'contradicts',
+    'supersedes', 'supports', 'derived_from', 'triggered_by'
+  )),
+  strength REAL DEFAULT 1.0 CHECK (strength >= 0 AND strength <= 1),
+  evidence TEXT,  -- JSON array of CausalEvidence
+  inferred INTEGER DEFAULT 0,
+  created_at TEXT DEFAULT (datetime('now')),
+  validated_at TEXT,
+  created_by TEXT,
+  
+  FOREIGN KEY (source_id) REFERENCES memories(id) ON DELETE CASCADE,
+  FOREIGN KEY (target_id) REFERENCES memories(id) ON DELETE CASCADE
+);
+
+CREATE INDEX IF NOT EXISTS idx_causal_source ON causal_edges(source_id);
+CREATE INDEX IF NOT EXISTS idx_causal_target ON causal_edges(target_id);
+CREATE INDEX IF NOT EXISTS idx_causal_relation ON causal_edges(relation);
+CREATE INDEX IF NOT EXISTS idx_causal_strength ON causal_edges(strength);
+CREATE INDEX IF NOT EXISTS idx_causal_inferred ON causal_edges(inferred);
+CREATE INDEX IF NOT EXISTS idx_causal_validated ON causal_edges(validated_at);
+`;
+/**
+ * SQLite implementation of causal storage
+ */
+export class SQLiteCausalStorage {
+    db;
+    initialized = false;
+    constructor(database) {
+        this.db = database;
+    }
+    /**
+     * Initialize the storage (create tables)
+     */
+    async initialize() {
+        if (this.initialized)
+            return;
+        this.db.exec(CAUSAL_EDGES_SCHEMA);
+        this.initialized = true;
+    }
+    /**
+     * Close the storage connection
+     */
+    async close() {
+        // Database lifecycle managed by parent SQLiteClient
+        this.initialized = false;
+    }
+    /**
+     * Create a new causal edge
+     */
+    async createEdge(request) {
+        const id = generateCausalEdgeId();
+        const now = new Date().toISOString();
+        const stmt = this.db.prepare(`
+      INSERT INTO causal_edges (id, source_id, target_id, relation, strength, evidence, inferred, created_at, created_by)
+      VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?)
+    `);
+        stmt.run(id, request.sourceId, request.targetId, request.relation, request.strength ?? 1.0, request.evidence ? JSON.stringify(request.evidence) : null, request.inferred ? 1 : 0, now, request.createdBy ?? null);
+        return id;
+    }
+    /**
+     * Get an edge by ID
+     */
+    async getEdge(id) {
+        const stmt = this.db.prepare(`
+      SELECT * FROM causal_edges WHERE id = ?
+    `);
+        const row = stmt.get(id);
+        return row ? this.rowToEdge(row) : null;
+    }
+    /**
+     * Update an edge
+     */
+    async updateEdge(id, updates) {
+        const setClauses = [];
+        const params = [];
+        if (updates.strength !== undefined) {
+            setClauses.push('strength = ?');
+            params.push(updates.strength);
+        }
+        if (updates.evidence !== undefined) {
+            setClauses.push('evidence = ?');
+            params.push(JSON.stringify(updates.evidence));
+        }
+        if (updates.validatedAt !== undefined) {
+            setClauses.push('validated_at = ?');
+            params.push(updates.validatedAt);
+        }
+        if (setClauses.length === 0)
+            return;
+        params.push(id);
+        const stmt = this.db.prepare(`
+      UPDATE causal_edges SET ${setClauses.join(', ')} WHERE id = ?
+    `);
+        stmt.run(...params);
+    }
+    /**
+     * Delete an edge
+     */
+    async deleteEdge(id) {
+        const stmt = this.db.prepare('DELETE FROM causal_edges WHERE id = ?');
+        stmt.run(id);
+    }
+    /**
+     * Bulk create edges
+     */
+    async bulkCreateEdges(requests) {
+        const ids = [];
+        const errors = [];
+        let successful = 0;
+        let failed = 0;
+        const stmt = this.db.prepare(`
+      INSERT INTO causal_edges (id, source_id, target_id, relation, strength, evidence, inferred, created_at, created_by)
+      VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?)
+    `);
+        const now = new Date().toISOString();
+        const insertMany = this.db.transaction((reqs) => {
+            for (const request of reqs) {
+                try {
+                    const id = generateCausalEdgeId();
+                    stmt.run(id, request.sourceId, request.targetId, request.relation, request.strength ?? 1.0, request.evidence ? JSON.stringify(request.evidence) : null, request.inferred ? 1 : 0, now, request.createdBy ?? null);
+                    ids.push(id);
+                    successful++;
+                }
+                catch (err) {
+                    failed++;
+                    errors.push({ error: err.message });
+                }
+            }
+        });
+        insertMany(requests);
+        return { successful, failed, ids, errors: errors.length > 0 ? errors : undefined };
+    }
+    /**
+     * Bulk delete edges
+     */
+    async bulkDeleteEdges(ids) {
+        const stmt = this.db.prepare('DELETE FROM causal_edges WHERE id = ?');
+        let successful = 0;
+        let failed = 0;
+        const errors = [];
+        const deleteMany = this.db.transaction((edgeIds) => {
+            for (const id of edgeIds) {
+                try {
+                    const result = stmt.run(id);
+                    if (result.changes > 0) {
+                        successful++;
+                    }
+                    else {
+                        failed++;
+                        errors.push({ id, error: 'Edge not found' });
+                    }
+                }
+                catch (err) {
+                    failed++;
+                    errors.push({ id, error: err.message });
+                }
+            }
+        });
+        deleteMany(ids);
+        return { successful, failed, ids: [], errors: errors.length > 0 ? errors : undefined };
+    }
+    /**
+     * Get all edges from a source memory
+     */
+    async getEdgesFrom(sourceId, options) {
+        const { sql, params } = this.buildQuery('SELECT * FROM causal_edges WHERE source_id = ?', [sourceId], options);
+        const stmt = this.db.prepare(sql);
+        const rows = stmt.all(...params);
+        return rows.map(row => this.rowToEdge(row));
+    }
+    /**
+     * Get all edges to a target memory
+     */
+    async getEdgesTo(targetId, options) {
+        const { sql, params } = this.buildQuery('SELECT * FROM causal_edges WHERE target_id = ?', [targetId], options);
+        const stmt = this.db.prepare(sql);
+        const rows = stmt.all(...params);
+        return rows.map(row => this.rowToEdge(row));
+    }
+    /**
+     * Get all edges for a memory (both directions)
+     */
+    async getEdgesFor(memoryId, options) {
+        const { sql, params } = this.buildQuery('SELECT * FROM causal_edges WHERE source_id = ? OR target_id = ?', [memoryId, memoryId], options);
+        const stmt = this.db.prepare(sql);
+        const rows = stmt.all(...params);
+        return rows.map(row => this.rowToEdge(row));
+    }
+    /**
+     * Get edge between two specific memories
+     */
+    async getEdgeBetween(sourceId, targetId, relation) {
+        let sql = 'SELECT * FROM causal_edges WHERE source_id = ? AND target_id = ?';
+        const params = [sourceId, targetId];
+        if (relation) {
+            sql += ' AND relation = ?';
+            params.push(relation);
+        }
+        sql += ' LIMIT 1';
+        const stmt = this.db.prepare(sql);
+        const row = stmt.get(...params);
+        return row ? this.rowToEdge(row) : null;
+    }
+    /**
+     * Find edges by relation type
+     */
+    async findByRelation(relation, options) {
+        const { sql, params } = this.buildQuery('SELECT * FROM causal_edges WHERE relation = ?', [relation], options);
+        const stmt = this.db.prepare(sql);
+        const rows = stmt.all(...params);
+        return rows.map(row => this.rowToEdge(row));
+    }
+    /**
+     * Update edge strength
+     */
+    async updateStrength(id, strength) {
+        const clampedStrength = Math.max(0, Math.min(1, strength));
+        const stmt = this.db.prepare('UPDATE causal_edges SET strength = ? WHERE id = ?');
+        stmt.run(clampedStrength, id);
+    }
+    /**
+     * Increment edge strength
+     */
+    async incrementStrength(id, delta, maxStrength = 1.0) {
+        const stmt = this.db.prepare(`
+      UPDATE causal_edges 
+      SET strength = MIN(?, strength + ?) 
+      WHERE id = ?
+    `);
+        stmt.run(maxStrength, delta, id);
+    }
+    /**
+     * Decay edge strengths over time
+     */
+    async decayStrengths(decayFactor, minStrength = 0.1) {
+        const stmt = this.db.prepare(`
+      UPDATE causal_edges 
+      SET strength = MAX(?, strength * ?) 
+      WHERE strength > ?
+    `);
+        const result = stmt.run(minStrength, decayFactor, minStrength);
+        return result.changes;
+    }
+    /**
+     * Add evidence to an edge
+     */
+    async addEvidence(edgeId, evidence) {
+        const edge = await this.getEdge(edgeId);
+        if (!edge) {
+            throw new Error(`Edge not found: ${edgeId}`);
+        }
+        const updatedEvidence = [...edge.evidence, evidence];
+        const stmt = this.db.prepare('UPDATE causal_edges SET evidence = ? WHERE id = ?');
+        stmt.run(JSON.stringify(updatedEvidence), edgeId);
+    }
+    /**
+     * Remove evidence from an edge
+     */
+    async removeEvidence(edgeId, evidenceIndex) {
+        const edge = await this.getEdge(edgeId);
+        if (!edge) {
+            throw new Error(`Edge not found: ${edgeId}`);
+        }
+        if (evidenceIndex < 0 || evidenceIndex >= edge.evidence.length) {
+            throw new Error(`Invalid evidence index: ${evidenceIndex}`);
+        }
+        const updatedEvidence = edge.evidence.filter((_, i) => i !== evidenceIndex);
+        const stmt = this.db.prepare('UPDATE causal_edges SET evidence = ? WHERE id = ?');
+        stmt.run(JSON.stringify(updatedEvidence), edgeId);
+    }
+    /**
+     * Mark edge as validated
+     */
+    async markValidated(id, _validatedBy) {
+        const now = new Date().toISOString();
+        // If validatedBy provided, we could store it in evidence or a separate field
+        // For now, just update validated_at
+        const stmt = this.db.prepare('UPDATE causal_edges SET validated_at = ? WHERE id = ?');
+        stmt.run(now, id);
+    }
+    /**
+     * Get edges needing validation
+     */
+    async getUnvalidatedEdges(options) {
+        const { sql, params } = this.buildQuery('SELECT * FROM causal_edges WHERE validated_at IS NULL', [], options);
+        const stmt = this.db.prepare(sql);
+        const rows = stmt.all(...params);
+        return rows.map(row => this.rowToEdge(row));
+    }
+    /**
+     * Get graph statistics
+     */
+    async getStats() {
+        // Total edges
+        const totalStmt = this.db.prepare('SELECT COUNT(*) as count FROM causal_edges');
+        const totalResult = totalStmt.get();
+        // Edges by relation
+        const byRelationStmt = this.db.prepare(`
+      SELECT relation, COUNT(*) as count FROM causal_edges GROUP BY relation
+    `);
+        const byRelationRows = byRelationStmt.all();
+        const edgesByRelation = {
+            caused: 0,
+            enabled: 0,
+            prevented: 0,
+            contradicts: 0,
+            supersedes: 0,
+            supports: 0,
+            derived_from: 0,
+            triggered_by: 0,
+        };
+        for (const row of byRelationRows) {
+            edgesByRelation[row.relation] = row.count;
+        }
+        // Inferred vs explicit
+        const inferredStmt = this.db.prepare(`
+      SELECT inferred, COUNT(*) as count FROM causal_edges GROUP BY inferred
+    `);
+        const inferredRows = inferredStmt.all();
+        let inferredCount = 0;
+        let explicitCount = 0;
+        for (const row of inferredRows) {
+            if (row.inferred === 1) {
+                inferredCount = row.count;
+            }
+            else {
+                explicitCount = row.count;
+            }
+        }
+        // Average strength
+        const avgStmt = this.db.prepare('SELECT AVG(strength) as avg FROM causal_edges');
+        const avgResult = avgStmt.get();
+        // Most connected (by total edges)
+        const connectedStmt = this.db.prepare(`
+      SELECT memory_id, COUNT(*) as connection_count FROM (
+        SELECT source_id as memory_id FROM causal_edges
+        UNION ALL
+        SELECT target_id as memory_id FROM causal_edges
+      ) GROUP BY memory_id ORDER BY connection_count DESC LIMIT 10
+    `);
+        const connectedRows = connectedStmt.all();
+        const mostConnected = connectedRows.map(row => ({
+            memoryId: row.memory_id,
+            connectionCount: row.connection_count,
+        }));
+        // Connected components (simplified - just count unique memories)
+        const uniqueMemoriesStmt = this.db.prepare(`
+      SELECT COUNT(DISTINCT memory_id) as count FROM (
+        SELECT source_id as memory_id FROM causal_edges
+        UNION
+        SELECT target_id as memory_id FROM causal_edges
+      )
+    `);
+        const uniqueResult = uniqueMemoriesStmt.get();
+        return {
+            totalEdges: totalResult.count,
+            edgesByRelation,
+            inferredCount,
+            explicitCount,
+            averageStrength: avgResult.avg ?? 0,
+            connectedComponents: uniqueResult.count, // Simplified
+            mostConnected,
+        };
+    }
+    /**
+     * Count edges
+     */
+    async countEdges(options) {
+        let sql = 'SELECT COUNT(*) as count FROM causal_edges WHERE 1=1';
+        const params = [];
+        if (options?.relationTypes?.length) {
+            sql += ` AND relation IN (${options.relationTypes.map(() => '?').join(', ')})`;
+            params.push(...options.relationTypes);
+        }
+        if (options?.minStrength !== undefined) {
+            sql += ' AND strength >= ?';
+            params.push(options.minStrength);
+        }
+        if (options?.includeInferred === false) {
+            sql += ' AND inferred = 0';
+        }
+        const stmt = this.db.prepare(sql);
+        const result = stmt.get(...params);
+        return result.count;
+    }
+    /**
+     * Get most connected memories
+     */
+    async getMostConnected(limit = 10) {
+        const stmt = this.db.prepare(`
+      SELECT memory_id, COUNT(*) as connection_count FROM (
+        SELECT source_id as memory_id FROM causal_edges
+        UNION ALL
+        SELECT target_id as memory_id FROM causal_edges
+      ) GROUP BY memory_id ORDER BY connection_count DESC LIMIT ?
+    `);
+        const rows = stmt.all(limit);
+        return rows.map(row => ({
+            memoryId: row.memory_id,
+            connectionCount: row.connection_count,
+        }));
+    }
+    /**
+     * Delete edges for a memory
+     */
+    async deleteEdgesForMemory(memoryId) {
+        const stmt = this.db.prepare(`
+      DELETE FROM causal_edges WHERE source_id = ? OR target_id = ?
+    `);
+        const result = stmt.run(memoryId, memoryId);
+        return result.changes;
+    }
+    /**
+     * Delete weak edges
+     */
+    async deleteWeakEdges(minStrength) {
+        const stmt = this.db.prepare('DELETE FROM causal_edges WHERE strength < ?');
+        const result = stmt.run(minStrength);
+        return result.changes;
+    }
+    /**
+     * Delete old unvalidated edges
+     */
+    async deleteOldUnvalidated(olderThanDays) {
+        const cutoffDate = new Date();
+        cutoffDate.setDate(cutoffDate.getDate() - olderThanDays);
+        const cutoffStr = cutoffDate.toISOString();
+        const stmt = this.db.prepare(`
+      DELETE FROM causal_edges 
+      WHERE validated_at IS NULL AND created_at < ?
+    `);
+        const result = stmt.run(cutoffStr);
+        return result.changes;
+    }
+    // Private helpers
+    rowToEdge(row) {
+        return {
+            id: row.id,
+            sourceId: row.source_id,
+            targetId: row.target_id,
+            relation: row.relation,
+            strength: row.strength,
+            evidence: row.evidence ? JSON.parse(row.evidence) : [],
+            inferred: row.inferred === 1,
+            createdAt: row.created_at,
+            validatedAt: row.validated_at ?? undefined,
+            createdBy: row.created_by ?? undefined,
+        };
+    }
+    buildQuery(baseSql, baseParams, options) {
+        let sql = baseSql;
+        const params = [...baseParams];
+        if (options?.relationTypes?.length) {
+            sql += ` AND relation IN (${options.relationTypes.map(() => '?').join(', ')})`;
+            params.push(...options.relationTypes);
+        }
+        if (options?.minStrength !== undefined) {
+            sql += ' AND strength >= ?';
+            params.push(options.minStrength);
+        }
+        if (options?.includeInferred === false) {
+            sql += ' AND inferred = 0';
+        }
+        // Order by
+        const orderBy = options?.orderBy ?? 'created_at';
+        const orderDir = options?.orderDir ?? 'desc';
+        const columnMap = {
+            strength: 'strength',
+            createdAt: 'created_at',
+            validatedAt: 'validated_at',
+        };
+        sql += ` ORDER BY ${columnMap[orderBy] ?? 'created_at'} ${orderDir}`;
+        // Limit and offset
+        if (options?.limit !== undefined) {
+            sql += ' LIMIT ?';
+            params.push(options.limit);
+        }
+        if (options?.offset !== undefined) {
+            sql += ' OFFSET ?';
+            params.push(options.offset);
+        }
+        return { sql, params };
+    }
+}
+//# sourceMappingURL=sqlite.js.map

package/dist/causal/storage/sqlite.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sqlite.js","sourceRoot":"","sources":["../../../src/causal/storage/sqlite.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAgBH,OAAO,EAAE,oBAAoB,EAAE,MAAM,6BAA6B,CAAC;AAEnE;;GAEG;AACH,MAAM,CAAC,MAAM,mBAAmB,GAAG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;CAiDlC,CAAC;AAkBF;;GAEG;AACH,MAAM,OAAO,mBAAmB;IACtB,EAAE,CAAe;IACjB,WAAW,GAAG,KAAK,CAAC;IAE5B,YAAY,QAAsB;QAChC,IAAI,CAAC,EAAE,GAAG,QAAQ,CAAC;IACrB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU;QACd,IAAI,IAAI,CAAC,WAAW;YAAE,OAAO;QAE7B,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;QAClC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC;IAC1B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,oDAAoD;QACpD,IAAI,CAAC,WAAW,GAAG,KAAK,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,OAAgC;QAC/C,MAAM,EAAE,GAAG,oBAAoB,EAAE,CAAC;QAClC,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAErC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;KAG5B,CAAC,CAAC;QAEH,IAAI,CAAC,GAAG,CACN,EAAE,EACF,OAAO,CAAC,QAAQ,EAChB,OAAO,CAAC,QAAQ,EAChB,OAAO,CAAC,QAAQ,EAChB,OAAO,CAAC,QAAQ,IAAI,GAAG,EACvB,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,EAC1D,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACxB,GAAG,EACH,OAAO,CAAC,SAAS,IAAI,IAAI,CAC1B,CAAC;QAEF,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO,CAAC,EAAU;QACtB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;KAE5B,CAAC,CAAC;QAEH,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAA8B,CAAC;QACtD,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,EAAU,EAAE,OAAgC;QAC3D,MAAM,UAAU,GAAa,EAAE,CAAC;QAChC,MAAM,MAAM,GAAc,EAAE,CAAC;QAE7B,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YACnC,UAAU,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAChC,CAAC;QAED,IAAI,OAAO,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YACnC,UAAU,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;YAChC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC;QAChD,CAAC;QAED,IAAI,OAAO,CAAC,WAAW,KAAK,SAAS,EAAE,CAAC;YACtC,UAAU,CAAC,IAAI,CAAC,kBAAkB,CAAC,CAAC;YACpC,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACnC,CAAC;QAED,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO;QAEpC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEhB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;gCACD,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC;KAChD,CAAC,CAAC;QAEH,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,EAAU;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,uCAAuC,CAAC,CAAC;QACtE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACf,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,eAAe,CAAC,QAAmC;QACvD,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,MAAM,MAAM,GAA0C,EAAE,CAAC;QACzD,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,MAAM,GAAG,CAAC,CAAC;QAEf,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;KAG5B,CAAC,CAAC;QAEH,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAErC,MAAM,UAAU,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,IAA+B,EAAE,EAAE;YACzE,KAAK,MAAM,OAAO,IAAI,IAAI,EAAE,CAAC;gBAC3B,IAAI,CAAC;oBACH,MAAM,EAAE,GAAG,oBAAoB,EAAE,CAAC;oBAClC,IAAI,CAAC,GAAG,CACN,EAAE,EACF,OAAO,CAAC,QAAQ,EAChB,OAAO,CAAC,QAAQ,EAChB,OAAO,CAAC,QAAQ,EAChB,OAAO,CAAC,QAAQ,IAAI,GAAG,EACvB,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,EAC1D,OAAO,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EACxB,GAAG,EACH,OAAO,CAAC,SAAS,IAAI,IAAI,CAC1B,CAAC;oBACF,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;oBACb,UAAU,EAAE,CAAC;gBACf,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACb,MAAM,EAAE,CAAC;oBACT,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAG,GAAa,CAAC,OAAO,EAAE,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,UAAU,CAAC,QAAQ,CAAC,CAAC;QAErB,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IACrF,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,eAAe,CAAC,GAAa;QACjC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,uCAAuC,CAAC,CAAC;QACtE,IAAI,UAAU,GAAG,CAAC,CAAC;QACnB,IAAI,MAAM,GAAG,CAAC,CAAC;QACf,MAAM,MAAM,GAAyC,EAAE,CAAC;QAExD,MAAM,UAAU,GAAG,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,CAAC,OAAiB,EAAE,EAAE;YAC3D,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;gBACzB,IAAI,CAAC;oBACH,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBAC5B,IAAI,MAAM,CAAC,OAAO,GAAG,CAAC,EAAE,CAAC;wBACvB,UAAU,EAAE,CAAC;oBACf,CAAC;yBAAM,CAAC;wBACN,MAAM,EAAE,CAAC;wBACT,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,gBAAgB,EAAE,CAAC,CAAC;oBAC/C,CAAC;gBACH,CAAC;gBAAC,OAAO,GAAG,EAAE,CAAC;oBACb,MAAM,EAAE,CAAC;oBACT,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAG,GAAa,CAAC,OAAO,EAAE,CAAC,CAAC;gBACrD,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,UAAU,CAAC,GAAG,CAAC,CAAC;QAEhB,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,GAAG,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,SAAS,EAAE,CAAC;IACzF,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,YAAY,CAAC,QAAgB,EAAE,OAA4B;QAC/D,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CACrC,gDAAgD,EAChD,CAAC,QAAQ,CAAC,EACV,OAAO,CACR,CAAC;QAEF,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAoB,CAAC;QACpD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,QAAgB,EAAE,OAA4B;QAC7D,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CACrC,gDAAgD,EAChD,CAAC,QAAQ,CAAC,EACV,OAAO,CACR,CAAC;QAEF,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAoB,CAAC;QACpD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW,CAAC,QAAgB,EAAE,OAA4B;QAC9D,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CACrC,iEAAiE,EACjE,CAAC,QAAQ,EAAE,QAAQ,CAAC,EACpB,OAAO,CACR,CAAC;QAEF,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAoB,CAAC;QACpD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,cAAc,CAClB,QAAgB,EAChB,QAAgB,EAChB,QAAyB;QAEzB,IAAI,GAAG,GAAG,kEAAkE,CAAC;QAC7E,MAAM,MAAM,GAAc,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAE/C,IAAI,QAAQ,EAAE,CAAC;YACb,GAAG,IAAI,mBAAmB,CAAC;YAC3B,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACxB,CAAC;QAED,GAAG,IAAI,UAAU,CAAC;QAElB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAClC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAA8B,CAAC;QAC7D,OAAO,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;IAC1C,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,cAAc,CAAC,QAAwB,EAAE,OAA4B;QACzE,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CACrC,+CAA+C,EAC/C,CAAC,QAAQ,CAAC,EACV,OAAO,CACR,CAAC;QAEF,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAoB,CAAC;QACpD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,cAAc,CAAC,EAAU,EAAE,QAAgB;QAC/C,MAAM,eAAe,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;QAC3D,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,mDAAmD,CAAC,CAAC;QAClF,IAAI,CAAC,GAAG,CAAC,eAAe,EAAE,EAAE,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,iBAAiB,CAAC,EAAU,EAAE,KAAa,EAAE,WAAW,GAAG,GAAG;QAClE,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;KAI5B,CAAC,CAAC;QACH,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,EAAE,EAAE,CAAC,CAAC;IACnC,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,cAAc,CAAC,WAAmB,EAAE,WAAW,GAAG,GAAG;QACzD,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;KAI5B,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;QAC/D,OAAO,MAAM,CAAC,OAAO,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW,CAAC,MAAc,EAAE,QAAwB;QACxD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CAAC,mBAAmB,MAAM,EAAE,CAAC,CAAC;QAC/C,CAAC;QAED,MAAM,eAAe,GAAG,CAAC,GAAG,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QACrD,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,mDAAmD,CAAC,CAAC;QAClF,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,EAAE,MAAM,CAAC,CAAC;IACpD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,cAAc,CAAC,MAAc,EAAE,aAAqB;QACxD,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QACxC,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,IAAI,KAAK,CAAC,mBAAmB,MAAM,EAAE,CAAC,CAAC;QAC/C,CAAC;QAED,IAAI,aAAa,GAAG,CAAC,IAAI,aAAa,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;YAC/D,MAAM,IAAI,KAAK,CAAC,2BAA2B,aAAa,EAAE,CAAC,CAAC;QAC9D,CAAC;QAED,MAAM,eAAe,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,aAAa,CAAC,CAAC;QAC5E,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,mDAAmD,CAAC,CAAC;QAClF,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,eAAe,CAAC,EAAE,MAAM,CAAC,CAAC;IACpD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,aAAa,CAAC,EAAU,EAAE,YAAqB;QACnD,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAErC,6EAA6E;QAC7E,oCAAoC;QACpC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,uDAAuD,CAAC,CAAC;QACtF,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;IACpB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,mBAAmB,CAAC,OAA4B;QACpD,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CACrC,uDAAuD,EACvD,EAAE,EACF,OAAO,CACR,CAAC;QAEF,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAoB,CAAC;QACpD,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9C,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ;QACZ,cAAc;QACd,MAAM,SAAS,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,4CAA4C,CAAC,CAAC;QAChF,MAAM,WAAW,GAAG,SAAS,CAAC,GAAG,EAAuB,CAAC;QAEzD,oBAAoB;QACpB,MAAM,cAAc,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;KAEtC,CAAC,CAAC;QACH,MAAM,cAAc,GAAG,cAAc,CAAC,GAAG,EAAgD,CAAC;QAC1F,MAAM,eAAe,GAAmC;YACtD,MAAM,EAAE,CAAC;YACT,OAAO,EAAE,CAAC;YACV,SAAS,EAAE,CAAC;YACZ,WAAW,EAAE,CAAC;YACd,UAAU,EAAE,CAAC;YACb,QAAQ,EAAE,CAAC;YACX,YAAY,EAAE,CAAC;YACf,YAAY,EAAE,CAAC;SAChB,CAAC;QACF,KAAK,MAAM,GAAG,IAAI,cAAc,EAAE,CAAC;YACjC,eAAe,CAAC,GAAG,CAAC,QAA0B,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC;QAC9D,CAAC;QAED,uBAAuB;QACvB,MAAM,YAAY,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;KAEpC,CAAC,CAAC;QACH,MAAM,YAAY,GAAG,YAAY,CAAC,GAAG,EAAgD,CAAC;QACtF,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;YAC/B,IAAI,GAAG,CAAC,QAAQ,KAAK,CAAC,EAAE,CAAC;gBACvB,aAAa,GAAG,GAAG,CAAC,KAAK,CAAC;YAC5B,CAAC;iBAAM,CAAC;gBACN,aAAa,GAAG,GAAG,CAAC,KAAK,CAAC;YAC5B,CAAC;QACH,CAAC;QAED,mBAAmB;QACnB,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,+CAA+C,CAAC,CAAC;QACjF,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,EAA4B,CAAC;QAE1D,kCAAkC;QAClC,MAAM,aAAa,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;KAMrC,CAAC,CAAC;QACH,MAAM,aAAa,GAAG,aAAa,CAAC,GAAG,EAA4D,CAAC;QACpG,MAAM,aAAa,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC9C,QAAQ,EAAE,GAAG,CAAC,SAAS;YACvB,eAAe,EAAE,GAAG,CAAC,gBAAgB;SACtC,CAAC,CAAC,CAAC;QAEJ,iEAAiE;QACjE,MAAM,kBAAkB,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;KAM1C,CAAC,CAAC;QACH,MAAM,YAAY,GAAG,kBAAkB,CAAC,GAAG,EAAuB,CAAC;QAEnE,OAAO;YACL,UAAU,EAAE,WAAW,CAAC,KAAK;YAC7B,eAAe;YACf,aAAa;YACb,aAAa;YACb,eAAe,EAAE,SAAS,CAAC,GAAG,IAAI,CAAC;YACnC,mBAAmB,EAAE,YAAY,CAAC,KAAK,EAAE,aAAa;YACtD,aAAa;SACd,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,UAAU,CAAC,OAA4B;QAC3C,IAAI,GAAG,GAAG,sDAAsD,CAAC;QACjE,MAAM,MAAM,GAAc,EAAE,CAAC;QAE7B,IAAI,OAAO,EAAE,aAAa,EAAE,MAAM,EAAE,CAAC;YACnC,GAAG,IAAI,qBAAqB,OAAO,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;YAC/E,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC;QACxC,CAAC;QAED,IAAI,OAAO,EAAE,WAAW,KAAK,SAAS,EAAE,CAAC;YACvC,GAAG,IAAI,oBAAoB,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACnC,CAAC;QAED,IAAI,OAAO,EAAE,eAAe,KAAK,KAAK,EAAE,CAAC;YACvC,GAAG,IAAI,mBAAmB,CAAC;QAC7B,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAClC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAsB,CAAC;QACxD,OAAO,MAAM,CAAC,KAAK,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,gBAAgB,CAAC,KAAK,GAAG,EAAE;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;KAM5B,CAAC,CAAC;QAEH,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAA2D,CAAC;QACvF,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACtB,QAAQ,EAAE,GAAG,CAAC,SAAS;YACvB,eAAe,EAAE,GAAG,CAAC,gBAAgB;SACtC,CAAC,CAAC,CAAC;IACN,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,oBAAoB,CAAC,QAAgB;QACzC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;KAE5B,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAC5C,OAAO,MAAM,CAAC,OAAO,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,eAAe,CAAC,WAAmB;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,6CAA6C,CAAC,CAAC;QAC5E,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACrC,OAAO,MAAM,CAAC,OAAO,CAAC;IACxB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,oBAAoB,CAAC,aAAqB;QAC9C,MAAM,UAAU,GAAG,IAAI,IAAI,EAAE,CAAC;QAC9B,UAAU,CAAC,OAAO,CAAC,UAAU,CAAC,OAAO,EAAE,GAAG,aAAa,CAAC,CAAC;QACzD,MAAM,SAAS,GAAG,UAAU,CAAC,WAAW,EAAE,CAAC;QAE3C,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;KAG5B,CAAC,CAAC;QACH,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;QACnC,OAAO,MAAM,CAAC,OAAO,CAAC;IACxB,CAAC;IAED,kBAAkB;IAEV,SAAS,CAAC,GAAkB;QAClC,OAAO;YACL,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,QAAQ,EAAE,GAAG,CAAC,SAAS;YACvB,QAAQ,EAAE,GAAG,CAAC,SAAS;YACvB,QAAQ,EAAE,GAAG,CAAC,QAA0B;YACxC,QAAQ,EAAE,GAAG,CAAC,QAAQ;YACtB,QAAQ,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,EAAE;YACtD,QAAQ,EAAE,GAAG,CAAC,QAAQ,KAAK,CAAC;YAC5B,SAAS,EAAE,GAAG,CAAC,UAAU;YACzB,WAAW,EAAE,GAAG,CAAC,YAAY,IAAI,SAAS;YAC1C,SAAS,EAAE,GAAG,CAAC,UAAU,IAAI,SAAS;SACvC,CAAC;IACJ,CAAC;IAEO,UAAU,CAChB,OAAe,EACf,UAAqB,EACrB,OAA4B;QAE5B,IAAI,GAAG,GAAG,OAAO,CAAC;QAClB,MAAM,MAAM,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC;QAE/B,IAAI,OAAO,EAAE,aAAa,EAAE,MAAM,EAAE,CAAC;YACnC,GAAG,IAAI,qBAAqB,OAAO,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;YAC/E,MAAM,CAAC,IAAI,CAAC,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC;QACxC,CAAC;QAED,IAAI,OAAO,EAAE,WAAW,KAAK,SAAS,EAAE,CAAC;YACvC,GAAG,IAAI,oBAAoB,CAAC;YAC5B,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACnC,CAAC;QAED,IAAI,OAAO,EAAE,eAAe,KAAK,KAAK,EAAE,CAAC;YACvC,GAAG,IAAI,mBAAmB,CAAC;QAC7B,CAAC;QAED,WAAW;QACX,MAAM,OAAO,GAAG,OAAO,EAAE,OAAO,IAAI,YAAY,CAAC;QACjD,MAAM,QAAQ,GAAG,OAAO,EAAE,QAAQ,IAAI,MAAM,CAAC;QAC7C,MAAM,SAAS,GAA2B;YACxC,QAAQ,EAAE,UAAU;YACpB,SAAS,EAAE,YAAY;YACvB,WAAW,EAAE,cAAc;SAC5B,CAAC;QACF,GAAG,IAAI,aAAa,SAAS,CAAC,OAAO,CAAC,IAAI,YAAY,IAAI,QAAQ,EAAE,CAAC;QAErE,mBAAmB;QACnB,IAAI,OAAO,EAAE,KAAK,KAAK,SAAS,EAAE,CAAC;YACjC,GAAG,IAAI,UAAU,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAC7B,CAAC;QAED,IAAI,OAAO,EAAE,MAAM,KAAK,SAAS,EAAE,CAAC;YAClC,GAAG,IAAI,WAAW,CAAC;YACnB,MAAM,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;QAC9B,CAAC;QAED,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;IACzB,CAAC;CACF"}

package/dist/causal/traversal/index.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Causal Traversal Module
+ *
+ * Graph traversal algorithms for causal chains.
+ */
+export * from './traverser.js';
+export * from './path-finder.js';
+export * from './subgraph.js';
+//# sourceMappingURL=index.d.ts.map

package/dist/causal/traversal/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/causal/traversal/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,cAAc,gBAAgB,CAAC;AAC/B,cAAc,kBAAkB,CAAC;AACjC,cAAc,eAAe,CAAC"}

package/dist/causal/traversal/index.js

@@ -0,0 +1,9 @@
+/**
+ * Causal Traversal Module
+ *
+ * Graph traversal algorithms for causal chains.
+ */
+export * from './traverser.js';
+export * from './path-finder.js';
+export * from './subgraph.js';
+//# sourceMappingURL=index.js.map

package/dist/causal/traversal/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/causal/traversal/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,cAAc,gBAAgB,CAAC;AAC/B,cAAc,kBAAkB,CAAC;AACjC,cAAc,eAAe,CAAC"}

package/dist/causal/traversal/path-finder.d.ts

@@ -0,0 +1,79 @@
+/**
+ * Causal Path Finder
+ *
+ * Finds paths between two memories in the causal graph,
+ * useful for understanding how two pieces of knowledge
+ * are connected.
+ *
+ * @module causal/traversal/path-finder
+ */
+import type { CausalEdge, CausalChain, CausalRelation } from '../../types/causal.js';
+import type { ICausalStorage } from '../storage/interface.js';
+import type { IMemoryStorage } from '../../storage/interface.js';
+/**
+ * Path finding options
+ */
+export interface PathFinderOptions {
+    /** Maximum path length */
+    maxLength?: number;
+    /** Minimum edge strength */
+    minStrength?: number;
+    /** Relation types to follow */
+    relationTypes?: CausalRelation[];
+    /** Include inferred edges */
+    includeInferred?: boolean;
+    /** Find all paths or just shortest */
+    findAll?: boolean;
+    /** Maximum paths to return */
+    maxPaths?: number;
+}
+/**
+ * A single path through the graph
+ */
+export interface CausalPath {
+    /** Ordered list of memory IDs */
+    memoryIds: string[];
+    /** Edges in the path */
+    edges: CausalEdge[];
+    /** Path length (number of edges) */
+    length: number;
+    /** Path strength (product of edge strengths) */
+    strength: number;
+}
+/**
+ * Causal path finder
+ *
+ * Uses BFS for shortest path and DFS for all paths.
+ */
+export declare class CausalPathFinder {
+    private causalStorage;
+    private memoryStorage;
+    constructor(causalStorage: ICausalStorage, memoryStorage: IMemoryStorage);
+    /**
+     * Find a path between two memories
+     *
+     * Returns the shortest path if findAll is false,
+     * otherwise returns all paths up to maxPaths.
+     */
+    findPath(fromId: string, toId: string, options?: PathFinderOptions): Promise<CausalChain | null>;
+    /**
+     * Find shortest path using BFS
+     */
+    findShortestPath(fromId: string, toId: string, options: Required<PathFinderOptions>): Promise<CausalPath[]>;
+    /**
+     * Find all paths using DFS
+     */
+    findAllPaths(fromId: string, toId: string, options: Required<PathFinderOptions>): Promise<CausalPath[]>;
+    /**
+     * Check if a path exists between two memories
+     */
+    pathExists(fromId: string, toId: string, options?: PathFinderOptions): Promise<boolean>;
+    /**
+     * Get the distance (shortest path length) between two memories
+     */
+    getDistance(fromId: string, toId: string, options?: PathFinderOptions): Promise<number | null>;
+    private dfs;
+    private createSingleNodeChain;
+    private pathToChain;
+}
+//# sourceMappingURL=path-finder.d.ts.map

package/dist/causal/traversal/path-finder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"path-finder.d.ts","sourceRoot":"","sources":["../../../src/causal/traversal/path-finder.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EACV,UAAU,EACV,WAAW,EAEX,cAAc,EACf,MAAM,uBAAuB,CAAC;AAC/B,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAC;AAC9D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,4BAA4B,CAAC;AAEjE;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAChC,0BAA0B;IAC1B,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,4BAA4B;IAC5B,WAAW,CAAC,EAAE,MAAM,CAAC;IACrB,+BAA+B;IAC/B,aAAa,CAAC,EAAE,cAAc,EAAE,CAAC;IACjC,6BAA6B;IAC7B,eAAe,CAAC,EAAE,OAAO,CAAC;IAC1B,sCAAsC;IACtC,OAAO,CAAC,EAAE,OAAO,CAAC;IAClB,8BAA8B;IAC9B,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,UAAU;IACzB,iCAAiC;IACjC,SAAS,EAAE,MAAM,EAAE,CAAC;IACpB,wBAAwB;IACxB,KAAK,EAAE,UAAU,EAAE,CAAC;IACpB,oCAAoC;IACpC,MAAM,EAAE,MAAM,CAAC;IACf,gDAAgD;IAChD,QAAQ,EAAE,MAAM,CAAC;CAClB;AAcD;;;;GAIG;AACH,qBAAa,gBAAgB;IAEzB,OAAO,CAAC,aAAa;IACrB,OAAO,CAAC,aAAa;gBADb,aAAa,EAAE,cAAc,EAC7B,aAAa,EAAE,cAAc;IAGvC;;;;;OAKG;IACG,QAAQ,CACZ,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,EACZ,OAAO,CAAC,EAAE,iBAAiB,GAC1B,OAAO,CAAC,WAAW,GAAG,IAAI,CAAC;IAuB9B;;OAEG;IACG,gBAAgB,CACpB,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE,QAAQ,CAAC,iBAAiB,CAAC,GACnC,OAAO,CAAC,UAAU,EAAE,CAAC;IA4DxB;;OAEG;IACG,YAAY,CAChB,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,EACZ,OAAO,EAAE,QAAQ,CAAC,iBAAiB,CAAC,GACnC,OAAO,CAAC,UAAU,EAAE,CAAC;IAsBxB;;OAEG;IACG,UAAU,CACd,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,EACZ,OAAO,CAAC,EAAE,iBAAiB,GAC1B,OAAO,CAAC,OAAO,CAAC;IAKnB;;OAEG;IACG,WAAW,CACf,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,EACZ,OAAO,CAAC,EAAE,iBAAiB,GAC1B,OAAO,CAAC,MAAM,GAAG,IAAI,CAAC;YAWX,GAAG;YAmDH,qBAAqB;YAyBrB,WAAW;CAsC1B"}