@timmeck/brain-core 2.36.23 → 2.36.25

package/dist/knowledge-graph/fact-extractor.js

@@ -0,0 +1,70 @@
+import { getLogger } from '../utils/logger.js';
+const EXTRACTION_PATTERNS = [
+    { regex: /(.+?)\s+causes\s+(.+)/i, predicate: 'causes' },
+    { regex: /(.+?)\s+solves\s+(.+)/i, predicate: 'solves' },
+    { regex: /(.+?)\s+requires\s+(.+)/i, predicate: 'requires' },
+    { regex: /(.+?)\s+improves\s+(.+)/i, predicate: 'improves' },
+    { regex: /(.+?)\s+prevents\s+(.+)/i, predicate: 'prevents' },
+    { regex: /when\s+(.+?)\s+then\s+(.+)/i, predicate: 'leads_to' },
+];
+// ── Extractor ───────────────────────────────────────────
+export class FactExtractor {
+    db;
+    config;
+    log = getLogger();
+    llm = null;
+    constructor(db, config) {
+        this.db = db;
+        this.config = config;
+        this.log.info(`[FactExtractor] Initialized for ${this.config.brainName}`);
+    }
+    // ── Setters ──────────────────────────────────────────
+    setLLMService(llm) { this.llm = llm; }
+    // ── Extraction Methods ───────────────────────────────
+    extractFromInsight(text, sourceId) {
+        const facts = [];
+        // Split text into sentences for multi-sentence processing
+        const sentences = text.split(/[.;!?\n]+/).map(s => s.trim()).filter(s => s.length > 0);
+        for (const sentence of sentences) {
+            for (const pattern of EXTRACTION_PATTERNS) {
+                const match = sentence.match(pattern.regex);
+                if (match && match[1] && match[2]) {
+                    facts.push({
+                        subject: match[1].trim(),
+                        predicate: pattern.predicate,
+                        object: match[2].trim(),
+                        context: `insight:${sourceId}`,
+                        confidence: 0.6,
+                    });
+                }
+            }
+        }
+        this.log.debug(`[FactExtractor] Extracted ${facts.length} fact(s) from insight ${sourceId}`);
+        return facts;
+    }
+    extractFromRule(condition, action, sourceId) {
+        const facts = [];
+        facts.push({
+            subject: condition.trim(),
+            predicate: 'triggers',
+            object: action.trim(),
+            context: `rule:${sourceId}`,
+            confidence: 0.8,
+        });
+        this.log.debug(`[FactExtractor] Extracted rule fact: ${condition} triggers ${action}`);
+        return facts;
+    }
+    extractFromErrorSolution(error, solution, context, sourceId) {
+        const facts = [];
+        facts.push({
+            subject: error.trim(),
+            predicate: 'solved_by',
+            object: solution.trim(),
+            context: `error:${sourceId}:${context}`,
+            confidence: 0.7,
+        });
+        this.log.debug(`[FactExtractor] Extracted error-solution fact: ${error} solved_by ${solution}`);
+        return facts;
+    }
+}
+//# sourceMappingURL=fact-extractor.js.map

package/dist/knowledge-graph/fact-extractor.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fact-extractor.js","sourceRoot":"","sources":["../../src/knowledge-graph/fact-extractor.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAwB/C,MAAM,mBAAmB,GAAwB;IAC/C,EAAE,KAAK,EAAE,wBAAwB,EAAE,SAAS,EAAE,QAAQ,EAAE;IACxD,EAAE,KAAK,EAAE,wBAAwB,EAAE,SAAS,EAAE,QAAQ,EAAE;IACxD,EAAE,KAAK,EAAE,0BAA0B,EAAE,SAAS,EAAE,UAAU,EAAE;IAC5D,EAAE,KAAK,EAAE,0BAA0B,EAAE,SAAS,EAAE,UAAU,EAAE;IAC5D,EAAE,KAAK,EAAE,0BAA0B,EAAE,SAAS,EAAE,UAAU,EAAE;IAC5D,EAAE,KAAK,EAAE,6BAA6B,EAAE,SAAS,EAAE,UAAU,EAAE;CAChE,CAAC;AAEF,2DAA2D;AAE3D,MAAM,OAAO,aAAa;IACP,EAAE,CAAoB;IACtB,MAAM,CAAsB;IAC5B,GAAG,GAAG,SAAS,EAAE,CAAC;IAC3B,GAAG,GAAsB,IAAI,CAAC;IAEtC,YAAY,EAAqB,EAAE,MAA2B;QAC5D,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,mCAAmC,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;IAC5E,CAAC;IAED,wDAAwD;IAExD,aAAa,CAAC,GAAe,IAAU,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;IAExD,wDAAwD;IAExD,kBAAkB,CAAC,IAAY,EAAE,QAAgB;QAC/C,MAAM,KAAK,GAAoB,EAAE,CAAC;QAElC,0DAA0D;QAC1D,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAEvF,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,KAAK,MAAM,OAAO,IAAI,mBAAmB,EAAE,CAAC;gBAC1C,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAC5C,IAAI,KAAK,IAAI,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC;oBAClC,KAAK,CAAC,IAAI,CAAC;wBACT,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE;wBACxB,SAAS,EAAE,OAAO,CAAC,SAAS;wBAC5B,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE;wBACvB,OAAO,EAAE,WAAW,QAAQ,EAAE;wBAC9B,UAAU,EAAE,GAAG;qBAChB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,6BAA6B,KAAK,CAAC,MAAM,yBAAyB,QAAQ,EAAE,CAAC,CAAC;QAC7F,OAAO,KAAK,CAAC;IACf,CAAC;IAED,eAAe,CAAC,SAAiB,EAAE,MAAc,EAAE,QAAgB;QACjE,MAAM,KAAK,GAAoB,EAAE,CAAC;QAElC,KAAK,CAAC,IAAI,CAAC;YACT,OAAO,EAAE,SAAS,CAAC,IAAI,EAAE;YACzB,SAAS,EAAE,UAAU;YACrB,MAAM,EAAE,MAAM,CAAC,IAAI,EAAE;YACrB,OAAO,EAAE,QAAQ,QAAQ,EAAE;YAC3B,UAAU,EAAE,GAAG;SAChB,CAAC,CAAC;QAEH,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,wCAAwC,SAAS,aAAa,MAAM,EAAE,CAAC,CAAC;QACvF,OAAO,KAAK,CAAC;IACf,CAAC;IAED,wBAAwB,CACtB,KAAa,EACb,QAAgB,EAChB,OAAe,EACf,QAAgB;QAEhB,MAAM,KAAK,GAAoB,EAAE,CAAC;QAElC,KAAK,CAAC,IAAI,CAAC;YACT,OAAO,EAAE,KAAK,CAAC,IAAI,EAAE;YACrB,SAAS,EAAE,WAAW;YACtB,MAAM,EAAE,QAAQ,CAAC,IAAI,EAAE;YACvB,OAAO,EAAE,SAAS,QAAQ,IAAI,OAAO,EAAE;YACvC,UAAU,EAAE,GAAG;SAChB,CAAC,CAAC;QAEH,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,kDAAkD,KAAK,cAAc,QAAQ,EAAE,CAAC,CAAC;QAChG,OAAO,KAAK,CAAC;IACf,CAAC;CACF"}

package/dist/knowledge-graph/graph-engine.d.ts

@@ -0,0 +1,78 @@
+import type Database from 'better-sqlite3';
+import type { ThoughtStream } from '../consciousness/thought-stream.js';
+import type { LLMService } from '../llm/llm-service.js';
+export interface KnowledgeGraphConfig {
+    brainName: string;
+    /** Maximum transitive inference depth. Default: 3 */
+    maxInferenceDepth?: number;
+    /** Minimum confidence to consider a fact "high confidence". Default: 0.5 */
+    highConfidenceThreshold?: number;
+}
+export interface KnowledgeFact {
+    id?: number;
+    subject: string;
+    predicate: string;
+    object: string;
+    context: string | null;
+    confidence: number;
+    evidence_count: number;
+    source_type: string | null;
+    source_id: string | null;
+    created_at: string;
+    updated_at: string;
+}
+export interface FactQuery {
+    subject?: string;
+    predicate?: string;
+    object?: string;
+}
+export interface InferenceChain {
+    path: KnowledgeFact[];
+    startSubject: string;
+    endObject: string;
+    predicate: string;
+    confidence: number;
+}
+export interface Contradiction {
+    subject: string;
+    predicate: string;
+    facts: KnowledgeFact[];
+}
+export interface KnowledgeGraphStatus {
+    totalFacts: number;
+    predicateDistribution: Record<string, number>;
+    avgConfidence: number;
+}
+export declare function runKnowledgeGraphMigration(db: Database.Database): void;
+export declare class KnowledgeGraphEngine {
+    private readonly db;
+    private readonly config;
+    private readonly log;
+    private ts;
+    private llm;
+    private readonly stmtInsertFact;
+    private readonly stmtFindExact;
+    private readonly stmtUpdateFact;
+    private readonly stmtQueryAll;
+    private readonly stmtQueryBySubject;
+    private readonly stmtQueryByPredicate;
+    private readonly stmtQueryByObject;
+    private readonly stmtQueryBySubjectPredicate;
+    private readonly stmtQueryBySubjectObject;
+    private readonly stmtQueryByPredicateObject;
+    private readonly stmtQueryExact;
+    private readonly stmtGetBySubjectPredicate;
+    private readonly stmtGetNeighbors;
+    private readonly stmtTotalFacts;
+    private readonly stmtPredicateDistribution;
+    private readonly stmtAvgConfidence;
+    constructor(db: Database.Database, config: KnowledgeGraphConfig);
+    setThoughtStream(ts: ThoughtStream): void;
+    setLLMService(llm: LLMService): void;
+    addFact(subject: string, predicate: string, object: string, context?: string, confidence?: number, sourceType?: string, sourceId?: string): KnowledgeFact;
+    query(filter: FactQuery): KnowledgeFact[];
+    infer(subject: string, predicate: string): InferenceChain[];
+    contradictions(): Contradiction[];
+    subgraph(topic: string, depth: number): KnowledgeFact[];
+    getStatus(): KnowledgeGraphStatus;
+}

package/dist/knowledge-graph/graph-engine.js

@@ -0,0 +1,276 @@
+import { getLogger } from '../utils/logger.js';
+// ── Migration ───────────────────────────────────────────
+export function runKnowledgeGraphMigration(db) {
+    db.exec(`
+    CREATE TABLE IF NOT EXISTS knowledge_facts (
+      id INTEGER PRIMARY KEY AUTOINCREMENT,
+      subject TEXT NOT NULL,
+      predicate TEXT NOT NULL,
+      object TEXT NOT NULL,
+      context TEXT,
+      confidence REAL DEFAULT 0.5,
+      evidence_count INTEGER DEFAULT 1,
+      source_type TEXT,
+      source_id TEXT,
+      created_at TEXT DEFAULT (datetime('now')),
+      updated_at TEXT DEFAULT (datetime('now'))
+    );
+    CREATE INDEX IF NOT EXISTS idx_knowledge_facts_subject ON knowledge_facts(subject);
+    CREATE INDEX IF NOT EXISTS idx_knowledge_facts_predicate ON knowledge_facts(predicate);
+  `);
+}
+// ── Engine ──────────────────────────────────────────────
+export class KnowledgeGraphEngine {
+    db;
+    config;
+    log = getLogger();
+    ts = null;
+    llm = null;
+    // ── Prepared statements ──────────────────────────────
+    stmtInsertFact;
+    stmtFindExact;
+    stmtUpdateFact;
+    stmtQueryAll;
+    stmtQueryBySubject;
+    stmtQueryByPredicate;
+    stmtQueryByObject;
+    stmtQueryBySubjectPredicate;
+    stmtQueryBySubjectObject;
+    stmtQueryByPredicateObject;
+    stmtQueryExact;
+    stmtGetBySubjectPredicate;
+    stmtGetNeighbors;
+    stmtTotalFacts;
+    stmtPredicateDistribution;
+    stmtAvgConfidence;
+    constructor(db, config) {
+        this.db = db;
+        this.config = {
+            brainName: config.brainName,
+            maxInferenceDepth: config.maxInferenceDepth ?? 3,
+            highConfidenceThreshold: config.highConfidenceThreshold ?? 0.5,
+        };
+        runKnowledgeGraphMigration(db);
+        // Prepare statements
+        this.stmtInsertFact = db.prepare(`
+      INSERT INTO knowledge_facts (subject, predicate, object, context, confidence, evidence_count, source_type, source_id)
+      VALUES (?, ?, ?, ?, ?, ?, ?, ?)
+    `);
+        this.stmtFindExact = db.prepare(`
+      SELECT * FROM knowledge_facts WHERE subject = ? AND predicate = ? AND object = ?
+    `);
+        this.stmtUpdateFact = db.prepare(`
+      UPDATE knowledge_facts SET evidence_count = ?, confidence = ?, context = ?, updated_at = datetime('now')
+      WHERE id = ?
+    `);
+        this.stmtQueryAll = db.prepare('SELECT * FROM knowledge_facts ORDER BY confidence DESC');
+        this.stmtQueryBySubject = db.prepare('SELECT * FROM knowledge_facts WHERE subject = ? ORDER BY confidence DESC');
+        this.stmtQueryByPredicate = db.prepare('SELECT * FROM knowledge_facts WHERE predicate = ? ORDER BY confidence DESC');
+        this.stmtQueryByObject = db.prepare('SELECT * FROM knowledge_facts WHERE object = ? ORDER BY confidence DESC');
+        this.stmtQueryBySubjectPredicate = db.prepare('SELECT * FROM knowledge_facts WHERE subject = ? AND predicate = ? ORDER BY confidence DESC');
+        this.stmtQueryBySubjectObject = db.prepare('SELECT * FROM knowledge_facts WHERE subject = ? AND object = ? ORDER BY confidence DESC');
+        this.stmtQueryByPredicateObject = db.prepare('SELECT * FROM knowledge_facts WHERE predicate = ? AND object = ? ORDER BY confidence DESC');
+        this.stmtQueryExact = db.prepare('SELECT * FROM knowledge_facts WHERE subject = ? AND predicate = ? AND object = ? ORDER BY confidence DESC');
+        this.stmtGetBySubjectPredicate = db.prepare('SELECT * FROM knowledge_facts WHERE subject = ? AND predicate = ? AND confidence > ? ORDER BY confidence DESC');
+        this.stmtGetNeighbors = db.prepare('SELECT * FROM knowledge_facts WHERE subject = ? OR object = ?');
+        this.stmtTotalFacts = db.prepare('SELECT COUNT(*) as cnt FROM knowledge_facts');
+        this.stmtPredicateDistribution = db.prepare('SELECT predicate, COUNT(*) as cnt FROM knowledge_facts GROUP BY predicate ORDER BY cnt DESC');
+        this.stmtAvgConfidence = db.prepare('SELECT AVG(confidence) as avg FROM knowledge_facts');
+        this.log.info(`[KnowledgeGraph] Initialized for ${this.config.brainName}`);
+    }
+    // ── Setters ──────────────────────────────────────────
+    setThoughtStream(ts) { this.ts = ts; }
+    setLLMService(llm) { this.llm = llm; }
+    // ── Core Operations ──────────────────────────────────
+    addFact(subject, predicate, object, context, confidence, sourceType, sourceId) {
+        const existing = this.stmtFindExact.get(subject, predicate, object);
+        if (existing) {
+            const newEvidenceCount = existing.evidence_count + 1;
+            const newConfidence = confidence !== undefined
+                ? Math.min(1, (existing.confidence + confidence) / 2 + 0.05)
+                : Math.min(1, existing.confidence + 0.05);
+            const newContext = context ?? existing.context;
+            this.stmtUpdateFact.run(newEvidenceCount, newConfidence, newContext, existing.id);
+            this.log.debug(`[KnowledgeGraph] Updated fact: (${subject}, ${predicate}, ${object}) evidence=${newEvidenceCount}`);
+            this.ts?.emit('knowledge-graph', 'analyzing', `Updated fact: ${subject} ${predicate} ${object}`, 'routine');
+            return {
+                ...existing,
+                evidence_count: newEvidenceCount,
+                confidence: newConfidence,
+                context: newContext,
+            };
+        }
+        const result = this.stmtInsertFact.run(subject, predicate, object, context ?? null, confidence ?? 0.5, 1, sourceType ?? null, sourceId ?? null);
+        this.log.debug(`[KnowledgeGraph] Added fact: (${subject}, ${predicate}, ${object})`);
+        this.ts?.emit('knowledge-graph', 'discovering', `New fact: ${subject} ${predicate} ${object}`, 'notable');
+        return {
+            id: Number(result.lastInsertRowid),
+            subject,
+            predicate,
+            object,
+            context: context ?? null,
+            confidence: confidence ?? 0.5,
+            evidence_count: 1,
+            source_type: sourceType ?? null,
+            source_id: sourceId ?? null,
+            created_at: new Date().toISOString(),
+            updated_at: new Date().toISOString(),
+        };
+    }
+    query(filter) {
+        const hasSubject = filter.subject !== undefined;
+        const hasPredicate = filter.predicate !== undefined;
+        const hasObject = filter.object !== undefined;
+        if (hasSubject && hasPredicate && hasObject) {
+            return this.stmtQueryExact.all(filter.subject, filter.predicate, filter.object);
+        }
+        if (hasSubject && hasPredicate) {
+            return this.stmtQueryBySubjectPredicate.all(filter.subject, filter.predicate);
+        }
+        if (hasSubject && hasObject) {
+            return this.stmtQueryBySubjectObject.all(filter.subject, filter.object);
+        }
+        if (hasPredicate && hasObject) {
+            return this.stmtQueryByPredicateObject.all(filter.predicate, filter.object);
+        }
+        if (hasSubject) {
+            return this.stmtQueryBySubject.all(filter.subject);
+        }
+        if (hasPredicate) {
+            return this.stmtQueryByPredicate.all(filter.predicate);
+        }
+        if (hasObject) {
+            return this.stmtQueryByObject.all(filter.object);
+        }
+        return this.stmtQueryAll.all();
+    }
+    infer(subject, predicate) {
+        const chains = [];
+        const maxDepth = this.config.maxInferenceDepth;
+        // BFS-style transitive inference
+        // If A-rel-B and B-rel-C, then A-rel-C (transitively)
+        const visited = new Set();
+        const queue = [];
+        // Get direct facts for subject+predicate
+        const directFacts = this.stmtQueryBySubjectPredicate.all(subject, predicate);
+        for (const fact of directFacts) {
+            visited.add(fact.object);
+            queue.push({ node: fact.object, path: [fact], depth: 1 });
+        }
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (current.depth >= maxDepth) {
+                // At max depth, record the chain if it has more than 1 hop
+                if (current.path.length > 1) {
+                    const chainConfidence = current.path.reduce((acc, f) => acc * f.confidence, 1);
+                    chains.push({
+                        path: current.path,
+                        startSubject: subject,
+                        endObject: current.node,
+                        predicate,
+                        confidence: chainConfidence,
+                    });
+                }
+                continue;
+            }
+            // Follow the chain: current.node -predicate-> ?
+            const nextFacts = this.stmtQueryBySubjectPredicate.all(current.node, predicate);
+            if (nextFacts.length === 0 && current.path.length > 1) {
+                // Dead end with multi-hop path - record chain
+                const chainConfidence = current.path.reduce((acc, f) => acc * f.confidence, 1);
+                chains.push({
+                    path: current.path,
+                    startSubject: subject,
+                    endObject: current.node,
+                    predicate,
+                    confidence: chainConfidence,
+                });
+            }
+            for (const fact of nextFacts) {
+                if (!visited.has(fact.object)) {
+                    visited.add(fact.object);
+                    queue.push({
+                        node: fact.object,
+                        path: [...current.path, fact],
+                        depth: current.depth + 1,
+                    });
+                }
+            }
+        }
+        this.log.debug(`[KnowledgeGraph] Inferred ${chains.length} chain(s) for (${subject}, ${predicate}, ?)`);
+        return chains;
+    }
+    contradictions() {
+        const threshold = this.config.highConfidenceThreshold;
+        const result = [];
+        // Get all subject+predicate combos that have multiple high-confidence objects
+        const allFacts = this.stmtQueryAll.all();
+        // Group by subject+predicate
+        const groups = new Map();
+        for (const fact of allFacts) {
+            const key = `${fact.subject}||${fact.predicate}`;
+            const list = groups.get(key) ?? [];
+            list.push(fact);
+            groups.set(key, list);
+        }
+        for (const [, facts] of groups) {
+            // Filter to high-confidence facts
+            const highConf = facts.filter(f => f.confidence > threshold);
+            if (highConf.length > 1) {
+                // Check if objects differ
+                const uniqueObjects = new Set(highConf.map(f => f.object));
+                if (uniqueObjects.size > 1) {
+                    result.push({
+                        subject: highConf[0].subject,
+                        predicate: highConf[0].predicate,
+                        facts: highConf,
+                    });
+                }
+            }
+        }
+        this.log.debug(`[KnowledgeGraph] Found ${result.length} contradiction(s)`);
+        this.ts?.emit('knowledge-graph', 'analyzing', `Found ${result.length} contradiction(s)`, result.length > 0 ? 'notable' : 'routine');
+        return result;
+    }
+    subgraph(topic, depth) {
+        const visited = new Set();
+        const result = [];
+        const queue = [{ node: topic, currentDepth: 0 }];
+        visited.add(topic);
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (current.currentDepth >= depth)
+                continue;
+            const neighbors = this.stmtGetNeighbors.all(current.node, current.node);
+            for (const fact of neighbors) {
+                // Add fact if not already in result (by id)
+                if (!result.some(r => r.id === fact.id)) {
+                    result.push(fact);
+                }
+                // Explore both subject and object sides
+                const nextNode = fact.subject === current.node ? fact.object : fact.subject;
+                if (!visited.has(nextNode)) {
+                    visited.add(nextNode);
+                    queue.push({ node: nextNode, currentDepth: current.currentDepth + 1 });
+                }
+            }
+        }
+        this.log.debug(`[KnowledgeGraph] Subgraph for "${topic}" depth=${depth}: ${result.length} fact(s)`);
+        return result;
+    }
+    getStatus() {
+        const totalRow = this.stmtTotalFacts.get();
+        const distRows = this.stmtPredicateDistribution.all();
+        const avgRow = this.stmtAvgConfidence.get();
+        const predicateDistribution = {};
+        for (const row of distRows) {
+            predicateDistribution[row.predicate] = row.cnt;
+        }
+        return {
+            totalFacts: totalRow.cnt,
+            predicateDistribution,
+            avgConfidence: avgRow.avg ?? 0,
+        };
+    }
+}
+//# sourceMappingURL=graph-engine.js.map

package/dist/knowledge-graph/graph-engine.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-engine.js","sourceRoot":"","sources":["../../src/knowledge-graph/graph-engine.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAC;AAsD/C,2DAA2D;AAE3D,MAAM,UAAU,0BAA0B,CAAC,EAAqB;IAC9D,EAAE,CAAC,IAAI,CAAC;;;;;;;;;;;;;;;;GAgBP,CAAC,CAAC;AACL,CAAC;AAED,2DAA2D;AAE3D,MAAM,OAAO,oBAAoB;IACd,EAAE,CAAoB;IACtB,MAAM,CAAiC;IACvC,GAAG,GAAG,SAAS,EAAE,CAAC;IAC3B,EAAE,GAAyB,IAAI,CAAC;IAChC,GAAG,GAAsB,IAAI,CAAC;IAEtC,wDAAwD;IACvC,cAAc,CAAqB;IACnC,aAAa,CAAqB;IAClC,cAAc,CAAqB;IACnC,YAAY,CAAqB;IACjC,kBAAkB,CAAqB;IACvC,oBAAoB,CAAqB;IACzC,iBAAiB,CAAqB;IACtC,2BAA2B,CAAqB;IAChD,wBAAwB,CAAqB;IAC7C,0BAA0B,CAAqB;IAC/C,cAAc,CAAqB;IACnC,yBAAyB,CAAqB;IAC9C,gBAAgB,CAAqB;IACrC,cAAc,CAAqB;IACnC,yBAAyB,CAAqB;IAC9C,iBAAiB,CAAqB;IAEvD,YAAY,EAAqB,EAAE,MAA4B;QAC7D,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,MAAM,GAAG;YACZ,SAAS,EAAE,MAAM,CAAC,SAAS;YAC3B,iBAAiB,EAAE,MAAM,CAAC,iBAAiB,IAAI,CAAC;YAChD,uBAAuB,EAAE,MAAM,CAAC,uBAAuB,IAAI,GAAG;SAC/D,CAAC;QAEF,0BAA0B,CAAC,EAAE,CAAC,CAAC;QAE/B,qBAAqB;QACrB,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC,OAAO,CAAC;;;KAGhC,CAAC,CAAC;QAEH,IAAI,CAAC,aAAa,GAAG,EAAE,CAAC,OAAO,CAAC;;KAE/B,CAAC,CAAC;QAEH,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC,OAAO,CAAC;;;KAGhC,CAAC,CAAC;QAEH,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC,OAAO,CAAC,wDAAwD,CAAC,CAAC;QAEzF,IAAI,CAAC,kBAAkB,GAAG,EAAE,CAAC,OAAO,CAClC,0EAA0E,CAC3E,CAAC;QAEF,IAAI,CAAC,oBAAoB,GAAG,EAAE,CAAC,OAAO,CACpC,4EAA4E,CAC7E,CAAC;QAEF,IAAI,CAAC,iBAAiB,GAAG,EAAE,CAAC,OAAO,CACjC,yEAAyE,CAC1E,CAAC;QAEF,IAAI,CAAC,2BAA2B,GAAG,EAAE,CAAC,OAAO,CAC3C,4FAA4F,CAC7F,CAAC;QAEF,IAAI,CAAC,wBAAwB,GAAG,EAAE,CAAC,OAAO,CACxC,yFAAyF,CAC1F,CAAC;QAEF,IAAI,CAAC,0BAA0B,GAAG,EAAE,CAAC,OAAO,CAC1C,2FAA2F,CAC5F,CAAC;QAEF,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC,OAAO,CAC9B,2GAA2G,CAC5G,CAAC;QAEF,IAAI,CAAC,yBAAyB,GAAG,EAAE,CAAC,OAAO,CACzC,+GAA+G,CAChH,CAAC;QAEF,IAAI,CAAC,gBAAgB,GAAG,EAAE,CAAC,OAAO,CAChC,+DAA+D,CAChE,CAAC;QAEF,IAAI,CAAC,cAAc,GAAG,EAAE,CAAC,OAAO,CAAC,6CAA6C,CAAC,CAAC;QAChF,IAAI,CAAC,yBAAyB,GAAG,EAAE,CAAC,OAAO,CACzC,6FAA6F,CAC9F,CAAC;QACF,IAAI,CAAC,iBAAiB,GAAG,EAAE,CAAC,OAAO,CAAC,oDAAoD,CAAC,CAAC;QAE1F,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,oCAAoC,IAAI,CAAC,MAAM,CAAC,SAAS,EAAE,CAAC,CAAC;IAC7E,CAAC;IAED,wDAAwD;IAExD,gBAAgB,CAAC,EAAiB,IAAU,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IAC3D,aAAa,CAAC,GAAe,IAAU,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC;IAExD,wDAAwD;IAExD,OAAO,CACL,OAAe,EACf,SAAiB,EACjB,MAAc,EACd,OAAgB,EAChB,UAAmB,EACnB,UAAmB,EACnB,QAAiB;QAEjB,MAAM,QAAQ,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,EAAE,MAAM,CAA8B,CAAC;QAEjG,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,gBAAgB,GAAG,QAAQ,CAAC,cAAc,GAAG,CAAC,CAAC;YACrD,MAAM,aAAa,GAAG,UAAU,KAAK,SAAS;gBAC5C,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC;gBAC5D,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,UAAU,GAAG,IAAI,CAAC,CAAC;YAC5C,MAAM,UAAU,GAAG,OAAO,IAAI,QAAQ,CAAC,OAAO,CAAC;YAE/C,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,gBAAgB,EAAE,aAAa,EAAE,UAAU,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAC;YAElF,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,mCAAmC,OAAO,KAAK,SAAS,KAAK,MAAM,cAAc,gBAAgB,EAAE,CAAC,CAAC;YACpH,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,iBAAiB,EAAE,WAAW,EAAE,iBAAiB,OAAO,IAAI,SAAS,IAAI,MAAM,EAAE,EAAE,SAAS,CAAC,CAAC;YAE5G,OAAO;gBACL,GAAG,QAAQ;gBACX,cAAc,EAAE,gBAAgB;gBAChC,UAAU,EAAE,aAAa;gBACzB,OAAO,EAAE,UAAU;aACpB,CAAC;QACJ,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,CACpC,OAAO,EAAE,SAAS,EAAE,MAAM,EAC1B,OAAO,IAAI,IAAI,EACf,UAAU,IAAI,GAAG,EACjB,CAAC,EACD,UAAU,IAAI,IAAI,EAClB,QAAQ,IAAI,IAAI,CACjB,CAAC;QAEF,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,iCAAiC,OAAO,KAAK,SAAS,KAAK,MAAM,GAAG,CAAC,CAAC;QACrF,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,iBAAiB,EAAE,aAAa,EAAE,aAAa,OAAO,IAAI,SAAS,IAAI,MAAM,EAAE,EAAE,SAAS,CAAC,CAAC;QAE1G,OAAO;YACL,EAAE,EAAE,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC;YAClC,OAAO;YACP,SAAS;YACT,MAAM;YACN,OAAO,EAAE,OAAO,IAAI,IAAI;YACxB,UAAU,EAAE,UAAU,IAAI,GAAG;YAC7B,cAAc,EAAE,CAAC;YACjB,WAAW,EAAE,UAAU,IAAI,IAAI;YAC/B,SAAS,EAAE,QAAQ,IAAI,IAAI;YAC3B,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACpC,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;SACrC,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,MAAiB;QACrB,MAAM,UAAU,GAAG,MAAM,CAAC,OAAO,KAAK,SAAS,CAAC;QAChD,MAAM,YAAY,GAAG,MAAM,CAAC,SAAS,KAAK,SAAS,CAAC;QACpD,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,KAAK,SAAS,CAAC;QAE9C,IAAI,UAAU,IAAI,YAAY,IAAI,SAAS,EAAE,CAAC;YAC5C,OAAO,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,MAAM,CAAoB,CAAC;QACrG,CAAC;QACD,IAAI,UAAU,IAAI,YAAY,EAAE,CAAC;YAC/B,OAAO,IAAI,CAAC,2BAA2B,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,SAAS,CAAoB,CAAC;QACnG,CAAC;QACD,IAAI,UAAU,IAAI,SAAS,EAAE,CAAC;YAC5B,OAAO,IAAI,CAAC,wBAAwB,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,EAAE,MAAM,CAAC,MAAM,CAAoB,CAAC;QAC7F,CAAC;QACD,IAAI,YAAY,IAAI,SAAS,EAAE,CAAC;YAC9B,OAAO,IAAI,CAAC,0BAA0B,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,CAAC,MAAM,CAAoB,CAAC;QACjG,CAAC;QACD,IAAI,UAAU,EAAE,CAAC;YACf,OAAO,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,OAAO,CAAoB,CAAC;QACxE,CAAC;QACD,IAAI,YAAY,EAAE,CAAC;YACjB,OAAO,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,MAAM,CAAC,SAAS,CAAoB,CAAC;QAC5E,CAAC;QACD,IAAI,SAAS,EAAE,CAAC;YACd,OAAO,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,CAAoB,CAAC;QACtE,CAAC;QAED,OAAO,IAAI,CAAC,YAAY,CAAC,GAAG,EAAqB,CAAC;IACpD,CAAC;IAED,KAAK,CAAC,OAAe,EAAE,SAAiB;QACtC,MAAM,MAAM,GAAqB,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAG,IAAI,CAAC,MAAM,CAAC,iBAAiB,CAAC;QAE/C,iCAAiC;QACjC,sDAAsD;QACtD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,KAAK,GAAkE,EAAE,CAAC;QAEhF,yCAAyC;QACzC,MAAM,WAAW,GAAG,IAAI,CAAC,2BAA2B,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,CAAoB,CAAC;QAEhG,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;YAC/B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAC5D,CAAC;QAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE/B,IAAI,OAAO,CAAC,KAAK,IAAI,QAAQ,EAAE,CAAC;gBAC9B,2DAA2D;gBAC3D,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;oBAC5B,MAAM,eAAe,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;oBAC/E,MAAM,CAAC,IAAI,CAAC;wBACV,IAAI,EAAE,OAAO,CAAC,IAAI;wBAClB,YAAY,EAAE,OAAO;wBACrB,SAAS,EAAE,OAAO,CAAC,IAAI;wBACvB,SAAS;wBACT,UAAU,EAAE,eAAe;qBAC5B,CAAC,CAAC;gBACL,CAAC;gBACD,SAAS;YACX,CAAC;YAED,gDAAgD;YAChD,MAAM,SAAS,GAAG,IAAI,CAAC,2BAA2B,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,SAAS,CAAoB,CAAC;YAEnG,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,IAAI,OAAO,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACtD,8CAA8C;gBAC9C,MAAM,eAAe,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;gBAC/E,MAAM,CAAC,IAAI,CAAC;oBACV,IAAI,EAAE,OAAO,CAAC,IAAI;oBAClB,YAAY,EAAE,OAAO;oBACrB,SAAS,EAAE,OAAO,CAAC,IAAI;oBACvB,SAAS;oBACT,UAAU,EAAE,eAAe;iBAC5B,CAAC,CAAC;YACL,CAAC;YAED,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;gBAC7B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;oBAC9B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;oBACzB,KAAK,CAAC,IAAI,CAAC;wBACT,IAAI,EAAE,IAAI,CAAC,MAAM;wBACjB,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC;wBAC7B,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC;qBACzB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,6BAA6B,MAAM,CAAC,MAAM,kBAAkB,OAAO,KAAK,SAAS,MAAM,CAAC,CAAC;QACxG,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,cAAc;QACZ,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC,uBAAuB,CAAC;QACtD,MAAM,MAAM,GAAoB,EAAE,CAAC;QAEnC,8EAA8E;QAC9E,MAAM,QAAQ,GAAG,IAAI,CAAC,YAAY,CAAC,GAAG,EAAqB,CAAC;QAE5D,6BAA6B;QAC7B,MAAM,MAAM,GAAG,IAAI,GAAG,EAA2B,CAAC;QAClD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC5B,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,SAAS,EAAE,CAAC;YACjD,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChB,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACxB,CAAC;QAED,KAAK,MAAM,CAAC,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;YAC/B,kCAAkC;YAClC,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,UAAU,GAAG,SAAS,CAAC,CAAC;YAC7D,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACxB,0BAA0B;gBAC1B,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;gBAC3D,IAAI,aAAa,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;oBAC3B,MAAM,CAAC,IAAI,CAAC;wBACV,OAAO,EAAE,QAAQ,CAAC,CAAC,CAAE,CAAC,OAAO;wBAC7B,SAAS,EAAE,QAAQ,CAAC,CAAC,CAAE,CAAC,SAAS;wBACjC,KAAK,EAAE,QAAQ;qBAChB,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,0BAA0B,MAAM,CAAC,MAAM,mBAAmB,CAAC,CAAC;QAC3E,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,iBAAiB,EAAE,WAAW,EAAE,SAAS,MAAM,CAAC,MAAM,mBAAmB,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;QAEpI,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,QAAQ,CAAC,KAAa,EAAE,KAAa;QACnC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,MAAM,GAAoB,EAAE,CAAC;QACnC,MAAM,KAAK,GAAkD,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,YAAY,EAAE,CAAC,EAAE,CAAC,CAAC;QAChG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QAEnB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE/B,IAAI,OAAO,CAAC,YAAY,IAAI,KAAK;gBAAE,SAAS;YAE5C,MAAM,SAAS,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,CAAoB,CAAC;YAE3F,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;gBAC7B,4CAA4C;gBAC5C,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBACxC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACpB,CAAC;gBAED,wCAAwC;gBACxC,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,KAAK,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;gBAC5E,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC3B,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACtB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,EAAE,OAAO,CAAC,YAAY,GAAG,CAAC,EAAE,CAAC,CAAC;gBACzE,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,kCAAkC,KAAK,WAAW,KAAK,KAAK,MAAM,CAAC,MAAM,UAAU,CAAC,CAAC;QACpG,OAAO,MAAM,CAAC;IAChB,CAAC;IAED,SAAS;QACP,MAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,CAAC,GAAG,EAAqB,CAAC;QAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,yBAAyB,CAAC,GAAG,EAA+C,CAAC;QACnG,MAAM,MAAM,GAAG,IAAI,CAAC,iBAAiB,CAAC,GAAG,EAA4B,CAAC;QAEtE,MAAM,qBAAqB,GAA2B,EAAE,CAAC;QACzD,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;YAC3B,qBAAqB,CAAC,GAAG,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC;QACjD,CAAC;QAED,OAAO;YACL,UAAU,EAAE,QAAQ,CAAC,GAAG;YACxB,qBAAqB;YACrB,aAAa,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC;SAC/B,CAAC;IACJ,CAAC;CACF"}

package/dist/knowledge-graph/index.d.ts

@@ -0,0 +1,4 @@
+export { KnowledgeGraphEngine, runKnowledgeGraphMigration } from './graph-engine.js';
+export type { KnowledgeGraphConfig, KnowledgeFact, FactQuery, InferenceChain, Contradiction, KnowledgeGraphStatus, } from './graph-engine.js';
+export { FactExtractor } from './fact-extractor.js';
+export type { ExtractedFact, FactExtractorConfig, } from './fact-extractor.js';

package/dist/knowledge-graph/index.js

@@ -0,0 +1,3 @@
+export { KnowledgeGraphEngine, runKnowledgeGraphMigration } from './graph-engine.js';
+export { FactExtractor } from './fact-extractor.js';
+//# sourceMappingURL=index.js.map

package/dist/knowledge-graph/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/knowledge-graph/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,oBAAoB,EAAE,0BAA0B,EAAE,MAAM,mBAAmB,CAAC;AAUrF,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAC"}

package/dist/proactive/__tests__/proactive-engine.test.d.ts

@@ -0,0 +1 @@
+export {};

package/dist/proactive/__tests__/proactive-engine.test.js

@@ -0,0 +1,183 @@
+import { describe, it, expect, vi, beforeEach, afterEach } from 'vitest';
+import Database from 'better-sqlite3';
+vi.mock('../../utils/logger.js', () => ({
+    getLogger: () => ({
+        info: vi.fn(), warn: vi.fn(), error: vi.fn(), debug: vi.fn(),
+    }),
+}));
+import { ProactiveEngine, runProactiveMigration } from '../proactive-engine.js';
+function createDb() {
+    return new Database(':memory:');
+}
+describe('ProactiveEngine', () => {
+    let db;
+    beforeEach(() => {
+        db = createDb();
+    });
+    afterEach(() => {
+        db.close();
+    });
+    it('creates a suggestion and retrieves it', () => {
+        const engine = new ProactiveEngine(db, { brainName: 'test' });
+        const ok = engine.createSuggestion('info', 'Test Suggestion', 'A description', 'Do something', 0.7);
+        expect(ok).toBe(true);
+        const suggestions = engine.getSuggestions();
+        expect(suggestions).toHaveLength(1);
+        expect(suggestions[0].title).toBe('Test Suggestion');
+        expect(suggestions[0].priority).toBe(0.7);
+        expect(suggestions[0].type).toBe('info');
+    });
+    it('returns suggestions sorted by priority descending', () => {
+        const engine = new ProactiveEngine(db, { brainName: 'test' });
+        engine.createSuggestion('low', 'Low Priority', undefined, undefined, 0.2);
+        engine.createSuggestion('high', 'High Priority', undefined, undefined, 0.9);
+        engine.createSuggestion('mid', 'Mid Priority', undefined, undefined, 0.5);
+        const suggestions = engine.getSuggestions();
+        expect(suggestions).toHaveLength(3);
+        expect(suggestions[0].title).toBe('High Priority');
+        expect(suggestions[1].title).toBe('Mid Priority');
+        expect(suggestions[2].title).toBe('Low Priority');
+    });
+    it('dismisses a suggestion', () => {
+        const engine = new ProactiveEngine(db, { brainName: 'test' });
+        engine.createSuggestion('info', 'To Dismiss', 'desc');
+        const before = engine.getSuggestions();
+        expect(before).toHaveLength(1);
+        engine.dismiss(before[0].id);
+        const after = engine.getSuggestions();
+        expect(after).toHaveLength(0);
+    });
+    it('respects rate limiting (max per hour)', () => {
+        const engine = new ProactiveEngine(db, {
+            brainName: 'test',
+            maxSuggestionsPerHour: 2,
+        });
+        expect(engine.createSuggestion('a', 'First')).toBe(true);
+        expect(engine.createSuggestion('b', 'Second')).toBe(true);
+        expect(engine.createSuggestion('c', 'Third')).toBe(false); // Rate limited
+    });
+    it('checks recurring errors trigger', () => {
+        const engine = new ProactiveEngine(db, {
+            brainName: 'test',
+            recurringThreshold: 3,
+        });
+        // Create error_memory table and populate
+        db.exec(`
+      CREATE TABLE error_memory (
+        id INTEGER PRIMARY KEY,
+        fingerprint TEXT NOT NULL,
+        message TEXT NOT NULL
+      )
+    `);
+        // Insert 3 errors with same fingerprint
+        const insert = db.prepare('INSERT INTO error_memory (fingerprint, message) VALUES (?, ?)');
+        insert.run('null-ref-001', 'Cannot read property of null');
+        insert.run('null-ref-001', 'Cannot read property of null');
+        insert.run('null-ref-001', 'Cannot read property of null');
+        const created = engine.analyze({ db });
+        expect(created).toBeGreaterThanOrEqual(1);
+        const suggestions = engine.getSuggestions();
+        const errorSuggestion = suggestions.find(s => s.type === 'recurring_error');
+        expect(errorSuggestion).toBeDefined();
+        expect(errorSuggestion.title).toContain('null-ref-001');
+    });
+    it('checks stale knowledge trigger', () => {
+        const engine = new ProactiveEngine(db, {
+            brainName: 'test',
+            staleDays: 30,
+        });
+        // Create insights table with old high-confidence insight
+        db.exec(`
+      CREATE TABLE insights (
+        id INTEGER PRIMARY KEY,
+        topic TEXT NOT NULL,
+        created_at TEXT NOT NULL,
+        confidence REAL NOT NULL
+      )
+    `);
+        db.prepare(`
+      INSERT INTO insights (topic, created_at, confidence)
+      VALUES (?, datetime('now', '-60 days'), 0.9)
+    `).run('old-topic');
+        const created = engine.analyze({ db });
+        expect(created).toBeGreaterThanOrEqual(1);
+        const suggestions = engine.getSuggestions();
+        const staleSuggestion = suggestions.find(s => s.type === 'stale_knowledge');
+        expect(staleSuggestion).toBeDefined();
+        expect(staleSuggestion.title).toContain('old-topic');
+    });
+    it('getStatus returns correct counts', () => {
+        const engine = new ProactiveEngine(db, { brainName: 'test' });
+        engine.createSuggestion('a', 'Active 1');
+        engine.createSuggestion('b', 'Active 2');
+        const suggestions = engine.getSuggestions();
+        engine.dismiss(suggestions[0].id);
+        const status = engine.getStatus();
+        expect(status.totalSuggestions).toBe(2);
+        expect(status.activeSuggestions).toBe(1);
+        expect(status.dismissedCount).toBe(1);
+        expect(status.lastAnalysis).toBeNull(); // No analyze() called
+    });
+    it('migration is idempotent', () => {
+        const engine1 = new ProactiveEngine(db, { brainName: 'test' });
+        engine1.createSuggestion('test', 'Survives Migration');
+        // Run migration again
+        runProactiveMigration(db);
+        const engine2 = new ProactiveEngine(db, { brainName: 'test' });
+        const suggestions = engine2.getSuggestions();
+        expect(suggestions).toHaveLength(1);
+        expect(suggestions[0].title).toBe('Survives Migration');
+    });
+    it('returns zero suggestions from empty analysis', () => {
+        const engine = new ProactiveEngine(db, { brainName: 'test' });
+        // No error_memory, insights, or tool_usage tables exist
+        const created = engine.analyze({ db });
+        expect(created).toBe(0);
+    });
+    it('dismissed suggestions not returned by default', () => {
+        const engine = new ProactiveEngine(db, { brainName: 'test' });
+        engine.createSuggestion('a', 'Visible');
+        engine.createSuggestion('b', 'Hidden');
+        const all = engine.getSuggestions();
+        engine.dismiss(all.find(s => s.title === 'Hidden').id);
+        const active = engine.getSuggestions();
+        expect(active).toHaveLength(1);
+        expect(active[0].title).toBe('Visible');
+        const withDismissed = engine.getSuggestions(20, true);
+        expect(withDismissed).toHaveLength(2);
+    });
+    it('deduplicates suggestions with same title', () => {
+        const engine = new ProactiveEngine(db, { brainName: 'test' });
+        expect(engine.createSuggestion('a', 'Same Title')).toBe(true);
+        expect(engine.createSuggestion('b', 'Same Title')).toBe(false); // Duplicate
+        const suggestions = engine.getSuggestions();
+        expect(suggestions).toHaveLength(1);
+    });
+    it('checks quick wins trigger (tool_usage table)', () => {
+        const engine = new ProactiveEngine(db, { brainName: 'test' });
+        // Create tool_usage table
+        db.exec(`
+      CREATE TABLE IF NOT EXISTS tool_usage (
+        id INTEGER PRIMARY KEY,
+        tool_name TEXT NOT NULL,
+        context TEXT,
+        duration_ms INTEGER,
+        outcome TEXT DEFAULT 'success',
+        metadata TEXT,
+        created_at TEXT DEFAULT (datetime('now'))
+      )
+    `);
+        // Insert a tool with high success rate but low usage
+        const insert = db.prepare('INSERT INTO tool_usage (tool_name, outcome) VALUES (?, ?)');
+        insert.run('rare-but-good', 'success');
+        insert.run('rare-but-good', 'success');
+        insert.run('rare-but-good', 'success');
+        const created = engine.analyze({ db });
+        expect(created).toBeGreaterThanOrEqual(1);
+        const suggestions = engine.getSuggestions();
+        const quickWin = suggestions.find(s => s.type === 'quick_win');
+        expect(quickWin).toBeDefined();
+        expect(quickWin.title).toContain('rare-but-good');
+    });
+});
+//# sourceMappingURL=proactive-engine.test.js.map