@vinaes/succ 1.3.19

package/dist/lib/graph/llm-relations.js

@@ -0,0 +1,265 @@
+/**
+ * LLM Relation Extraction — classify link types using LLM
+ *
+ * Instead of blind "similar_to" links, uses LLM to determine
+ * the actual relationship between memories (caused_by, leads_to, etc.)
+ *
+ * Inspired by rahulnyk/knowledge_graph's approach of using LLM
+ * to extract ontological relationships from text.
+ */
+import { callLLM } from '../llm.js';
+import { LINK_RELATIONS } from '../storage/types.js';
+import { getAllMemoryLinksForExport, getMemoryById, updateMemoryLink, getMemoryLinks, } from '../storage/index.js';
+// ============================================================================
+// Relation Classification
+// ============================================================================
+const CLASSIFY_PROMPT_SINGLE = `Given two memories from a knowledge base, determine their relationship.
+
+Memory A (type: {typeA}): {contentA}
+
+Memory B (type: {typeB}): {contentB}
+
+Choose ONE relation from: caused_by, leads_to, contradicts, implements, supersedes, references, related, similar_to
+
+Rules:
+- caused_by: A was caused by or resulted from B
+- leads_to: A leads to or enables B
+- contradicts: A and B conflict or disagree
+- implements: A is an implementation/action based on B (a decision)
+- supersedes: A replaces or updates B
+- references: A mentions or cites B
+- related: connected but none of the above fit
+- similar_to: nearly identical content (keep only if truly duplicate-like)
+
+Reply with ONLY valid JSON: {"relation": "...", "confidence": 0.0-1.0}`;
+const CLASSIFY_PROMPT_BATCH = `Given pairs of memories from a knowledge base, determine the relationship for each pair.
+
+{pairs}
+
+For each pair, choose ONE relation from: caused_by, leads_to, contradicts, implements, supersedes, references, related, similar_to
+
+Rules:
+- caused_by: A was caused by or resulted from B
+- leads_to: A leads to or enables B
+- contradicts: A and B conflict or disagree
+- implements: A is an implementation/action based on B (a decision)
+- supersedes: A replaces or updates B
+- references: A mentions or cites B
+- related: connected but none of the above fit
+- similar_to: nearly identical content (keep only if truly duplicate-like)
+
+Reply with ONLY a valid JSON array: [{"pair": 1, "relation": "...", "confidence": 0.0-1.0}, ...]`;
+/**
+ * Classify the relation between two memories using LLM.
+ */
+export async function classifyRelation(memoryA, memoryB) {
+    const prompt = CLASSIFY_PROMPT_SINGLE.replace('{typeA}', memoryA.type)
+        .replace('{contentA}', memoryA.content.substring(0, 500))
+        .replace('{typeB}', memoryB.type)
+        .replace('{contentB}', memoryB.content.substring(0, 500));
+    try {
+        const response = await callLLM(prompt, { maxTokens: 100, temperature: 0.1 });
+        return parseClassifyResponse(response);
+    }
+    catch {
+        return { relation: 'similar_to', confidence: 0 };
+    }
+}
+/**
+ * Classify multiple pairs in a single LLM call (saves tokens).
+ */
+export async function classifyRelationsBatch(pairs) {
+    if (pairs.length === 0)
+        return [];
+    // Build pairs text
+    const pairsText = pairs
+        .map((p, i) => {
+        return `Pair ${i + 1}:
+  Memory A (type: ${p.a.type}): ${p.a.content.substring(0, 300)}
+  Memory B (type: ${p.b.type}): ${p.b.content.substring(0, 300)}`;
+    })
+        .join('\n\n');
+    const prompt = CLASSIFY_PROMPT_BATCH.replace('{pairs}', pairsText);
+    try {
+        const response = await callLLM(prompt, {
+            maxTokens: 50 * pairs.length,
+            temperature: 0.1,
+        });
+        return parseBatchResponse(response, pairs);
+    }
+    catch {
+        // Fallback: keep all as similar_to
+        return pairs.map((p) => ({
+            linkId: p.linkId,
+            relation: 'similar_to',
+            confidence: 0,
+        }));
+    }
+}
+// ============================================================================
+// Enrichment Pipeline
+// ============================================================================
+/**
+ * Enrich all existing similar_to links that haven't been LLM-enriched yet.
+ */
+export async function enrichExistingLinks(options = {}) {
+    const { force = false, limit, batchSize = 5 } = options;
+    // Get all links via storage
+    const allLinks = await getAllMemoryLinksForExport();
+    // Filter to similar_to links, optionally unenriched only
+    let links = allLinks.filter((l) => l.relation === 'similar_to');
+    if (!force) {
+        links = links.filter((l) => !l.llm_enriched);
+    }
+    if (limit) {
+        links = links.slice(0, limit);
+    }
+    if (links.length === 0) {
+        return { enriched: 0, failed: 0, skipped: 0 };
+    }
+    // Prefetch all needed memories
+    const memoryIds = new Set();
+    for (const link of links) {
+        memoryIds.add(link.source_id);
+        memoryIds.add(link.target_id);
+    }
+    const memories = new Map();
+    for (const id of memoryIds) {
+        const mem = await getMemoryById(id);
+        if (mem) {
+            const tags = Array.isArray(mem.tags)
+                ? mem.tags
+                : typeof mem.tags === 'string'
+                    ? (() => {
+                        try {
+                            return JSON.parse(mem.tags);
+                        }
+                        catch {
+                            return [];
+                        }
+                    })()
+                    : [];
+            memories.set(id, { id: mem.id, content: mem.content, type: mem.type || 'observation', tags });
+        }
+    }
+    let enriched = 0;
+    let failed = 0;
+    let skipped = 0;
+    // Process in batches
+    for (let i = 0; i < links.length; i += batchSize) {
+        const batch = links.slice(i, i + batchSize);
+        const pairs = batch
+            .map((link) => {
+            const a = memories.get(link.source_id);
+            const b = memories.get(link.target_id);
+            if (!a || !b)
+                return null;
+            return { a, b, linkId: link.id };
+        })
+            .filter((p) => p !== null);
+        if (pairs.length === 0) {
+            skipped += batch.length;
+            continue;
+        }
+        let results;
+        if (pairs.length === 1) {
+            // Single pair: use direct classification
+            const result = await classifyRelation(pairs[0].a, pairs[0].b);
+            results = [
+                { linkId: pairs[0].linkId, relation: result.relation, confidence: result.confidence },
+            ];
+        }
+        else {
+            // Batch classification
+            results = await classifyRelationsBatch(pairs);
+        }
+        // Apply results via storage
+        for (const result of results) {
+            if (result.confidence > 0) {
+                await updateMemoryLink(result.linkId, {
+                    relation: result.relation,
+                    weight: result.confidence,
+                    llmEnriched: true,
+                });
+                enriched++;
+            }
+            else {
+                // Mark as enriched but keep similar_to
+                await updateMemoryLink(result.linkId, { llmEnriched: true });
+                failed++;
+            }
+        }
+    }
+    return { enriched, failed, skipped };
+}
+/**
+ * Enrich links for a single memory (called async after auto-link).
+ */
+export async function enrichMemoryLinks(memoryId) {
+    const links = await getMemoryLinks(memoryId);
+    const unenriched = (links.outgoing || []).filter((l) => l.relation === 'similar_to' && !l.llm_enriched);
+    if (unenriched.length === 0)
+        return 0;
+    const result = await enrichExistingLinks({
+        limit: unenriched.length,
+        batchSize: unenriched.length,
+    });
+    return result.enriched;
+}
+// ============================================================================
+// Response Parsing
+// ============================================================================
+function parseClassifyResponse(response) {
+    try {
+        // Extract JSON from response (may have extra text around it)
+        const jsonMatch = response.match(/\{[^}]+\}/);
+        if (!jsonMatch)
+            return { relation: 'similar_to', confidence: 0 };
+        const parsed = JSON.parse(jsonMatch[0]);
+        const relation = validateRelation(parsed.relation);
+        const confidence = typeof parsed.confidence === 'number' ? Math.max(0, Math.min(1, parsed.confidence)) : 0.5;
+        return { relation, confidence };
+    }
+    catch {
+        return { relation: 'similar_to', confidence: 0 };
+    }
+}
+function parseBatchResponse(response, pairs) {
+    try {
+        // Extract JSON array from response
+        const jsonMatch = response.match(/\[[\s\S]*\]/);
+        if (!jsonMatch) {
+            return pairs.map((p) => ({
+                linkId: p.linkId,
+                relation: 'similar_to',
+                confidence: 0,
+            }));
+        }
+        const parsed = JSON.parse(jsonMatch[0]);
+        return pairs.map((p, i) => {
+            const result = parsed.find((r) => r.pair === i + 1) || parsed[i];
+            if (!result)
+                return { linkId: p.linkId, relation: 'similar_to', confidence: 0 };
+            return {
+                linkId: p.linkId,
+                relation: validateRelation(result.relation),
+                confidence: typeof result.confidence === 'number' ? Math.max(0, Math.min(1, result.confidence)) : 0.5,
+            };
+        });
+    }
+    catch {
+        return pairs.map((p) => ({
+            linkId: p.linkId,
+            relation: 'similar_to',
+            confidence: 0,
+        }));
+    }
+}
+function validateRelation(input) {
+    const normalized = (input || '').toLowerCase().trim();
+    if (LINK_RELATIONS.includes(normalized)) {
+        return normalized;
+    }
+    return 'related';
+}
+//# sourceMappingURL=llm-relations.js.map

package/dist/lib/graph/llm-relations.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"llm-relations.js","sourceRoot":"","sources":["../../../src/lib/graph/llm-relations.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAC;AACpC,OAAO,EAAE,cAAc,EAAqB,MAAM,qBAAqB,CAAC;AACxE,OAAO,EACL,0BAA0B,EAC1B,aAAa,EACb,gBAAgB,EAChB,cAAc,GACf,MAAM,qBAAqB,CAAC;AAE7B,+EAA+E;AAC/E,0BAA0B;AAC1B,+EAA+E;AAE/E,MAAM,sBAAsB,GAAG;;;;;;;;;;;;;;;;;;uEAkBwC,CAAC;AAExE,MAAM,qBAAqB,GAAG;;;;;;;;;;;;;;;;iGAgBmE,CAAC;AAclG;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,OAAmB,EACnB,OAAmB;IAEnB,MAAM,MAAM,GAAG,sBAAsB,CAAC,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,IAAI,CAAC;SACnE,OAAO,CAAC,YAAY,EAAE,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;SACxD,OAAO,CAAC,SAAS,EAAE,OAAO,CAAC,IAAI,CAAC;SAChC,OAAO,CAAC,YAAY,EAAE,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC;IAE5D,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,MAAM,EAAE,EAAE,SAAS,EAAE,GAAG,EAAE,WAAW,EAAE,GAAG,EAAE,CAAC,CAAC;QAC7E,OAAO,qBAAqB,CAAC,QAAQ,CAAC,CAAC;IACzC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;IACnD,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,sBAAsB,CAC1C,KAA8D;IAE9D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAElC,mBAAmB;IACnB,MAAM,SAAS,GAAG,KAAK;SACpB,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACZ,OAAO,QAAQ,CAAC,GAAG,CAAC;oBACN,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC;oBAC3C,CAAC,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC;IAC9D,CAAC,CAAC;SACD,IAAI,CAAC,MAAM,CAAC,CAAC;IAEhB,MAAM,MAAM,GAAG,qBAAqB,CAAC,OAAO,CAAC,SAAS,EAAE,SAAS,CAAC,CAAC;IAEnE,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,MAAM,OAAO,CAAC,MAAM,EAAE;YACrC,SAAS,EAAE,EAAE,GAAG,KAAK,CAAC,MAAM;YAC5B,WAAW,EAAE,GAAG;SACjB,CAAC,CAAC;QACH,OAAO,kBAAkB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAC7C,CAAC;IAAC,MAAM,CAAC;QACP,mCAAmC;QACnC,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACvB,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,QAAQ,EAAE,YAA4B;YACtC,UAAU,EAAE,CAAC;SACd,CAAC,CAAC,CAAC;IACN,CAAC;AACH,CAAC;AAED,+EAA+E;AAC/E,sBAAsB;AACtB,+EAA+E;AAE/E;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,mBAAmB,CACvC,UAAmE,EAAE;IAErE,MAAM,EAAE,KAAK,GAAG,KAAK,EAAE,KAAK,EAAE,SAAS,GAAG,CAAC,EAAE,GAAG,OAAO,CAAC;IAExD,4BAA4B;IAC5B,MAAM,QAAQ,GAAG,MAAM,0BAA0B,EAAE,CAAC;IAEpD,yDAAyD;IACzD,IAAI,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,YAAY,CAAC,CAAC;IAChE,IAAI,CAAC,KAAK,EAAE,CAAC;QAIX,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAE,CAAwB,CAAC,YAAY,CAAC,CAAC;IACvE,CAAC;IACD,IAAI,KAAK,EAAE,CAAC;QACV,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAChC,CAAC;IAED,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvB,OAAO,EAAE,QAAQ,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,CAAC;IAChD,CAAC;IAED,+BAA+B;IAC/B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC9B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;IAChC,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC/C,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC3B,MAAM,GAAG,GAAG,MAAM,aAAa,CAAC,EAAE,CAAC,CAAC;QACpC,IAAI,GAAG,EAAE,CAAC;YACR,MAAM,IAAI,GAAa,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;gBAC5C,CAAC,CAAC,GAAG,CAAC,IAAI;gBACV,CAAC,CAAC,OAAO,GAAG,CAAC,IAAI,KAAK,QAAQ;oBAC5B,CAAC,CAAC,CAAC,GAAG,EAAE;wBACJ,IAAI,CAAC;4BACH,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAc,CAAC,CAAC;wBACxC,CAAC;wBAAC,MAAM,CAAC;4BACP,OAAO,EAAE,CAAC;wBACZ,CAAC;oBACH,CAAC,CAAC,EAAE;oBACN,CAAC,CAAC,EAAE,CAAC;YACT,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,GAAG,CAAC,OAAO,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;QAChG,CAAC;IACH,CAAC;IAED,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,OAAO,GAAG,CAAC,CAAC;IAEhB,qBAAqB;IACrB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;QACjD,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC;QAE5C,MAAM,KAAK,GAAG,KAAK;aAChB,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YACZ,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACvC,MAAM,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACvC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC;gBAAE,OAAO,IAAI,CAAC;YAC1B,OAAO,EAAE,CAAC,EAAE,CAAC,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,EAAE,CAAC;QACnC,CAAC,CAAC;aACD,MAAM,CAAC,CAAC,CAAC,EAA8B,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;QAEzD,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,OAAO,IAAI,KAAK,CAAC,MAAM,CAAC;YACxB,SAAS;QACX,CAAC;QAED,IAAI,OAA8E,CAAC;QAEnF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,yCAAyC;YACzC,MAAM,MAAM,GAAG,MAAM,gBAAgB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YAC9D,OAAO,GAAG;gBACR,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,MAAM,CAAC,QAAQ,EAAE,UAAU,EAAE,MAAM,CAAC,UAAU,EAAE;aACtF,CAAC;QACJ,CAAC;aAAM,CAAC;YACN,uBAAuB;YACvB,OAAO,GAAG,MAAM,sBAAsB,CAAC,KAAK,CAAC,CAAC;QAChD,CAAC;QAED,4BAA4B;QAC5B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,MAAM,CAAC,UAAU,GAAG,CAAC,EAAE,CAAC;gBAC1B,MAAM,gBAAgB,CAAC,MAAM,CAAC,MAAM,EAAE;oBACpC,QAAQ,EAAE,MAAM,CAAC,QAAQ;oBACzB,MAAM,EAAE,MAAM,CAAC,UAAU;oBACzB,WAAW,EAAE,IAAI;iBAClB,CAAC,CAAC;gBACH,QAAQ,EAAE,CAAC;YACb,CAAC;iBAAM,CAAC;gBACN,uCAAuC;gBACvC,MAAM,gBAAgB,CAAC,MAAM,CAAC,MAAM,EAAE,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC,CAAC;gBAC7D,MAAM,EAAE,CAAC;YACX,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,EAAE,CAAC;AACvC,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,iBAAiB,CAAC,QAAgB;IACtD,MAAM,KAAK,GAAG,MAAM,cAAc,CAAC,QAAQ,CAAC,CAAC;IAC7C,MAAM,UAAU,GAAG,CAAC,KAAK,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,MAAM,CAC9C,CAAC,CAAM,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,YAAY,IAAI,CAAC,CAAC,CAAC,YAAY,CAC3D,CAAC;IAEF,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAEtC,MAAM,MAAM,GAAG,MAAM,mBAAmB,CAAC;QACvC,KAAK,EAAE,UAAU,CAAC,MAAM;QACxB,SAAS,EAAE,UAAU,CAAC,MAAM;KAC7B,CAAC,CAAC;IAEH,OAAO,MAAM,CAAC,QAAQ,CAAC;AACzB,CAAC;AAED,+EAA+E;AAC/E,mBAAmB;AACnB,+EAA+E;AAE/E,SAAS,qBAAqB,CAAC,QAAgB;IAC7C,IAAI,CAAC;QACH,6DAA6D;QAC7D,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAC9C,IAAI,CAAC,SAAS;YAAE,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;QAEjE,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,MAAM,QAAQ,GAAG,gBAAgB,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC;QACnD,MAAM,UAAU,GACd,OAAO,MAAM,CAAC,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAE5F,OAAO,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;IAClC,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,QAAQ,EAAE,YAAY,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;IACnD,CAAC;AACH,CAAC;AAED,SAAS,kBAAkB,CACzB,QAAgB,EAChB,KAA8D;IAE9D,IAAI,CAAC;QACH,mCAAmC;QACnC,MAAM,SAAS,GAAG,QAAQ,CAAC,KAAK,CAAC,aAAa,CAAC,CAAC;QAChD,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACvB,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,QAAQ,EAAE,YAA4B;gBACtC,UAAU,EAAE,CAAC;aACd,CAAC,CAAC,CAAC;QACN,CAAC;QAED,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,CAIpC,CAAC;QAEH,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACxB,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,CAAC;YACjE,IAAI,CAAC,MAAM;gBACT,OAAO,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,QAAQ,EAAE,YAA4B,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC;YAErF,OAAO;gBACL,MAAM,EAAE,CAAC,CAAC,MAAM;gBAChB,QAAQ,EAAE,gBAAgB,CAAC,MAAM,CAAC,QAAQ,CAAC;gBAC3C,UAAU,EACR,OAAO,MAAM,CAAC,UAAU,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG;aAC5F,CAAC;QACJ,CAAC,CAAC,CAAC;IACL,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YACvB,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,QAAQ,EAAE,YAA4B;YACtC,UAAU,EAAE,CAAC;SACd,CAAC,CAAC,CAAC;IACN,CAAC;AACH,CAAC;AAED,SAAS,gBAAgB,CAAC,KAAa;IACrC,MAAM,UAAU,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,CAAC,IAAI,EAAE,CAAC;IACtD,IAAI,cAAc,CAAC,QAAQ,CAAC,UAA0B,CAAC,EAAE,CAAC;QACxD,OAAO,UAA0B,CAAC;IACpC,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC"}

package/dist/lib/graph-export.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Schedule an auto-export if enabled in config
+ * Debounced to avoid excessive exports during bulk operations
+ */
+export declare function scheduleAutoExport(): void;
+/**
+ * Export graph silently (no console output) - for auto-export
+ */
+export declare function exportGraphSilent(format?: 'obsidian' | 'json', outputDir?: string): Promise<{
+    memoriesExported: number;
+    linksExported: number;
+}>;
+//# sourceMappingURL=graph-export.d.ts.map

package/dist/lib/graph-export.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-export.d.ts","sourceRoot":"","sources":["../../src/lib/graph-export.ts"],"names":[],"mappings":"AAiGA;;;GAGG;AACH,wBAAgB,kBAAkB,IAAI,IAAI,CA0CzC;AAED;;GAEG;AACH,wBAAsB,iBAAiB,CACrC,MAAM,GAAE,UAAU,GAAG,MAAmB,EACxC,SAAS,CAAC,EAAE,MAAM,GACjB,OAAO,CAAC;IAAE,gBAAgB,EAAE,MAAM,CAAC;IAAC,aAAa,EAAE,MAAM,CAAA;CAAE,CAAC,CAmD9D"}