studiograph 1.1.2 → 1.2.0-beta.1

package/dist/services/sync/graph-match.js

@@ -0,0 +1,316 @@
+/**
+ * Graph Match
+ *
+ * Compares reconciled records against existing graph entities to prevent
+ * duplicate creates. Uses heuristic scoring first (string similarity,
+ * shared wikilinks), then LLM for ambiguous candidates.
+ *
+ * Inserted between reconciliation and staging in the sync pipeline:
+ *   extract → derive → reconcile → graph-match → staging → commit
+ */
+import { existsSync, readdirSync, statSync } from 'fs';
+import { join, basename } from 'path';
+import pc from 'picocolors';
+import { MarkdownService } from '../../services/markdown.js';
+import { GraphMatchState } from './graph-match-state.js';
+import { llmGraphMatch } from './llm.js';
+import { loadWorkspaceConfig } from '../../utils/workspace-config.js';
+// ── Public API ──────────────────────────────────────────────────────────────
+export async function graphMatch(matches, options, onEvent) {
+    const emit = onEvent ?? (() => { });
+    const threshold = options.similarityThreshold ?? 0.4;
+    const { workspacePath } = options;
+    // 1. Load graph index
+    const graphIndex = buildGraphIndex(workspacePath, emit);
+    if (graphIndex.size === 0) {
+        return matches.map(m => ({ match: m }));
+    }
+    // Report index stats
+    let totalEntities = 0;
+    for (const entities of graphIndex.values())
+        totalEntities += entities.length;
+    emit({ type: 'index-loaded', entityCount: totalEntities, typeCount: graphIndex.size });
+    // 2. Load cached decisions
+    const state = new GraphMatchState(workspacePath);
+    const results = [];
+    let candidatesEvaluated = 0;
+    let matchesFound = 0;
+    for (let i = 0; i < matches.length; i++) {
+        const match = matches[i];
+        if (i > 0 && i % 500 === 0) {
+            emit({ type: 'progress', current: i, total: matches.length });
+        }
+        // Skip if already an update (reconciler found exact match on disk)
+        if (match.action === 'update') {
+            results.push({ match });
+            continue;
+        }
+        // Only try to match creates
+        const existingEntities = graphIndex.get(match.entity_type) ?? [];
+        if (existingEntities.length === 0) {
+            results.push({ match });
+            continue;
+        }
+        // 3. Heuristic pre-filter: score against all same-type entities
+        const candidates = [];
+        for (const existing of existingEntities) {
+            // Skip if same ID (reconciler already handles this)
+            if (existing.entity_id === match.entity_id)
+                continue;
+            const score = heuristicScore({ entity_id: match.entity_id, frontmatter: match.merged_frontmatter }, { entity_id: existing.entity_id, frontmatter: existing.frontmatter });
+            if (score >= threshold) {
+                candidates.push({ entity: existing, score });
+            }
+        }
+        if (candidates.length === 0) {
+            results.push({ match });
+            continue;
+        }
+        // Sort by score descending — best candidate first
+        candidates.sort((a, b) => b.score - a.score);
+        // 4. Check cache, then LLM for top candidates
+        let matched = false;
+        for (const candidate of candidates) {
+            candidatesEvaluated++;
+            const cached = state.getDecision(match.entity_id, candidate.entity.entity_id);
+            if (cached === false) {
+                // Previously decided: not the same
+                continue;
+            }
+            if (cached === true) {
+                // Previously decided: same entity
+                const updated = applyMatch(match, candidate.entity, 'cached');
+                emit({ type: 'matched', stagedId: match.entity_id, existingId: candidate.entity.entity_id, method: 'cached' });
+                results.push(updated);
+                matched = true;
+                matchesFound++;
+                break;
+            }
+            // No cached decision — ask LLM
+            try {
+                const llmResult = await llmGraphMatch(match.merged_frontmatter, candidate.entity.frontmatter, match.entity_type);
+                state.record(match.entity_id, candidate.entity.entity_id, llmResult.is_same);
+                if (llmResult.is_same) {
+                    const updated = applyMatch(match, candidate.entity, 'llm', llmResult.reasoning);
+                    emit({ type: 'matched', stagedId: match.entity_id, existingId: candidate.entity.entity_id, method: 'llm', reasoning: llmResult.reasoning });
+                    results.push(updated);
+                    matched = true;
+                    matchesFound++;
+                    break;
+                }
+            }
+            catch (err) {
+                const msg = err instanceof Error ? err.message : String(err);
+                emit({ type: 'error', stagedId: match.entity_id, existingId: candidate.entity.entity_id, error: msg });
+                // On error, skip this candidate but don't cache the decision
+            }
+        }
+        if (!matched) {
+            results.push({ match });
+        }
+    }
+    // Emit summary
+    emit({ type: 'summary', candidatesEvaluated, matchesFound });
+    // Persist cached decisions
+    state.save();
+    return results;
+}
+// ── Event Formatting ────────────────────────────────────────────────────────
+/**
+ * Format a GraphMatchEvent into a colored CLI string.
+ */
+export function formatGraphMatchEvent(event) {
+    switch (event.type) {
+        case 'index-scan':
+            return `  Scanning ${event.stagedId} (${event.entityCount} entities)...`;
+        case 'index-loaded':
+            return `  Loaded ${pc.bold(String(event.entityCount))} entities across ${pc.bold(String(event.typeCount))} types`;
+        case 'matched':
+            if (event.method === 'cached') {
+                return `  ${pc.green('✓')} ${pc.cyan(event.stagedId)} ${pc.dim('→')} ${pc.green(event.existingId)} ${pc.dim('(cached)')}`;
+            }
+            return `  ${pc.green('✓')} ${pc.cyan(event.stagedId)} ${pc.dim('→')} ${pc.green(event.existingId)}`;
+        case 'summary':
+            return `  Evaluated ${pc.bold(String(event.candidatesEvaluated))} candidates, ${pc.bold(String(event.matchesFound))} matched`;
+        case 'progress':
+            return `  Matching ${event.current}/${event.total}...`;
+        case 'error':
+            return `  ${pc.red('!')} ${pc.cyan(event.stagedId)} ${pc.red(event.error)}`;
+        default:
+            return '';
+    }
+}
+// ── Graph Index ─────────────────────────────────────────────────────────────
+function buildGraphIndex(workspacePath, emit) {
+    const index = new Map();
+    const repoDirs = findRepoDirs(workspacePath);
+    const markdownService = new MarkdownService();
+    for (const repoDir of repoDirs) {
+        const repoName = basename(repoDir);
+        const subdirs = listSubDirs(repoDir);
+        if (emit) {
+            emit({ type: 'index-scan', stagedId: repoName, entityCount: subdirs.length });
+        }
+        for (const entityId of subdirs) {
+            const mainPath = join(repoDir, entityId, 'main.md');
+            if (!existsSync(mainPath))
+                continue;
+            try {
+                const doc = markdownService.parseFile(mainPath);
+                const entityType = doc.frontmatter.entity_type ?? repoName;
+                if (!index.has(entityType)) {
+                    index.set(entityType, []);
+                }
+                index.get(entityType).push({
+                    entity_id: entityId,
+                    entity_type: entityType,
+                    frontmatter: doc.frontmatter,
+                    repo: repoName,
+                });
+            }
+            catch (err) {
+                // Log but don't fail — unparseable files shouldn't block the index
+                if (emit)
+                    emit({ type: 'error', stagedId: entityId, error: `Failed to parse ${mainPath}: ${err instanceof Error ? err.message : 'unknown error'}` });
+            }
+        }
+    }
+    return index;
+}
+function findRepoDirs(workspacePath) {
+    const config = loadWorkspaceConfig(workspacePath);
+    if (config?.repos && Array.isArray(config.repos)) {
+        return config.repos
+            .map((r) => join(workspacePath, r.path))
+            .filter((p) => existsSync(p));
+    }
+    // Fallback: scan top-level directories
+    return listSubDirs(workspacePath)
+        .map(d => join(workspacePath, d))
+        .filter(d => !d.includes('.studiograph') && !d.includes('node_modules') && !d.includes('.git'));
+}
+function listSubDirs(dir) {
+    if (!existsSync(dir))
+        return [];
+    return readdirSync(dir).filter(f => {
+        if (f.startsWith('.'))
+            return false;
+        try {
+            return statSync(join(dir, f)).isDirectory();
+        }
+        catch {
+            return false;
+        }
+    });
+}
+// ── Heuristic Scoring ───────────────────────────────────────────────────────
+export function heuristicScore(staged, existing) {
+    let score = 0;
+    // Name similarity via Dice coefficient on bigrams (0–1), weighted 0.5
+    score += diceCoefficient(staged.entity_id, existing.entity_id) * 0.5;
+    // Shared client/organization reference
+    if (staged.frontmatter.client && existing.frontmatter.client &&
+        extractId(staged.frontmatter.client) === extractId(existing.frontmatter.client)) {
+        score += 0.3;
+    }
+    // Shared team members (Jaccard similarity on wikilink arrays)
+    const stagedTeam = extractIds(staged.frontmatter.team ?? staged.frontmatter.attendees);
+    const existingTeam = extractIds(existing.frontmatter.team ?? existing.frontmatter.attendees);
+    if (stagedTeam.length > 0 && existingTeam.length > 0) {
+        score += jaccard(stagedTeam, existingTeam) * 0.2;
+    }
+    // One name contains the other (e.g. "existence" ⊂ "existence-dataviz-redesign")
+    if (staged.entity_id.includes(existing.entity_id) ||
+        existing.entity_id.includes(staged.entity_id)) {
+        score += 0.3;
+    }
+    return Math.min(score, 1);
+}
+// ── String Similarity Helpers ───────────────────────────────────────────────
+/** Dice coefficient on character bigrams. Returns 0–1. */
+export function diceCoefficient(a, b) {
+    if (a === b)
+        return 1;
+    if (a.length < 2 || b.length < 2)
+        return 0;
+    const bigramsA = new Map();
+    for (let i = 0; i < a.length - 1; i++) {
+        const bigram = a.substring(i, i + 2);
+        bigramsA.set(bigram, (bigramsA.get(bigram) ?? 0) + 1);
+    }
+    const bigramsB = new Map();
+    for (let i = 0; i < b.length - 1; i++) {
+        const bigram = b.substring(i, i + 2);
+        bigramsB.set(bigram, (bigramsB.get(bigram) ?? 0) + 1);
+    }
+    let intersection = 0;
+    for (const [bigram, count] of bigramsA) {
+        intersection += Math.min(count, bigramsB.get(bigram) ?? 0);
+    }
+    return (2 * intersection) / (a.length - 1 + b.length - 1);
+}
+/** Extract entity ID from a wikilink string like "[[entity-id]]" or "[[entity-id|Name]]" */
+function extractId(value) {
+    if (typeof value !== 'string')
+        return null;
+    const match = value.match(/\[\[([^\]|]+)/);
+    if (match)
+        return match[1];
+    if (/^[a-z0-9_-]+$/.test(value))
+        return value;
+    return null;
+}
+/** Extract entity IDs from an array of wikilink strings */
+function extractIds(value) {
+    if (!Array.isArray(value))
+        return [];
+    return value
+        .map(v => extractId(v))
+        .filter((id) => id !== null);
+}
+/** Jaccard similarity of two string arrays */
+function jaccard(a, b) {
+    const setA = new Set(a);
+    const setB = new Set(b);
+    let intersection = 0;
+    for (const item of setA) {
+        if (setB.has(item))
+            intersection++;
+    }
+    const union = setA.size + setB.size - intersection;
+    return union === 0 ? 0 : intersection / union;
+}
+// ── Match Application ───────────────────────────────────────────────────────
+/** Fields where the existing graph value is authoritative over the source value */
+const GRAPH_AUTHORITATIVE_FIELDS = new Set(['name', 'entity_id', 'entity_type']);
+function applyMatch(match, existing, method, reasoning) {
+    // Merge frontmatter: existing graph fields win for identity fields,
+    // staged fields fill in anything the graph doesn't have
+    const mergedFrontmatter = { ...match.merged_frontmatter };
+    for (const [key, value] of Object.entries(existing.frontmatter)) {
+        if (key.startsWith('_'))
+            continue; // skip staging metadata
+        if (GRAPH_AUTHORITATIVE_FIELDS.has(key)) {
+            // Identity fields: graph always wins (user may have curated these)
+            mergedFrontmatter[key] = value;
+        }
+        else if (mergedFrontmatter[key] === undefined || mergedFrontmatter[key] === null) {
+            // Other fields: staged wins if present, otherwise fill from graph
+            mergedFrontmatter[key] = value;
+        }
+    }
+    const matchNote = `Matched ${match.entity_id} → ${existing.entity_id} via ${method}${reasoning ? ': ' + reasoning : ''}`;
+    const updatedMatch = {
+        ...match,
+        entity_id: existing.entity_id,
+        action: 'update',
+        merged_frontmatter: mergedFrontmatter,
+        notes: match.notes ? `${match.notes}; ${matchNote}` : matchNote,
+    };
+    return {
+        match: updatedMatch,
+        matched_to: existing.entity_id,
+        match_method: method,
+    };
+}
+//# sourceMappingURL=graph-match.js.map

package/dist/services/sync/graph-match.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-match.js","sourceRoot":"","sources":["../../../src/services/sync/graph-match.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,OAAO,EAAE,UAAU,EAAE,WAAW,EAAE,QAAQ,EAAE,MAAM,IAAI,CAAC;AACvD,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,MAAM,CAAC;AACtC,OAAO,EAAE,MAAM,YAAY,CAAC;AAC5B,OAAO,EAAE,eAAe,EAAE,MAAM,4BAA4B,CAAC;AAC7D,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAC;AACzD,OAAO,EAAE,aAAa,EAAE,MAAM,UAAU,CAAC;AACzC,OAAO,EAAE,mBAAmB,EAAE,MAAM,iCAAiC,CAAC;AAyCtE,+EAA+E;AAE/E,MAAM,CAAC,KAAK,UAAU,UAAU,CAC9B,OAA8B,EAC9B,OAA0B,EAC1B,OAA0C;IAE1C,MAAM,IAAI,GAAG,OAAO,IAAI,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;IACnC,MAAM,SAAS,GAAG,OAAO,CAAC,mBAAmB,IAAI,GAAG,CAAC;IACrD,MAAM,EAAE,aAAa,EAAE,GAAG,OAAO,CAAC;IAElC,sBAAsB;IACtB,MAAM,UAAU,GAAG,eAAe,CAAC,aAAa,EAAE,IAAI,CAAC,CAAC;IACxD,IAAI,UAAU,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED,qBAAqB;IACrB,IAAI,aAAa,GAAG,CAAC,CAAC;IACtB,KAAK,MAAM,QAAQ,IAAI,UAAU,CAAC,MAAM,EAAE;QAAE,aAAa,IAAI,QAAQ,CAAC,MAAM,CAAC;IAC7E,IAAI,CAAC,EAAE,IAAI,EAAE,cAAc,EAAE,WAAW,EAAE,aAAa,EAAE,SAAS,EAAE,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;IAEvF,2BAA2B;IAC3B,MAAM,KAAK,GAAG,IAAI,eAAe,CAAC,aAAa,CAAC,CAAC;IAEjD,MAAM,OAAO,GAAuB,EAAE,CAAC;IACvC,IAAI,mBAAmB,GAAG,CAAC,CAAC;IAC5B,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,EAAE,CAAC;YAC3B,IAAI,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,CAAC,EAAE,KAAK,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAChE,CAAC;QACD,mEAAmE;QACnE,IAAI,KAAK,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;YAC9B,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;YACxB,SAAS;QACX,CAAC;QAED,4BAA4B;QAC5B,MAAM,gBAAgB,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,EAAE,CAAC;QACjE,IAAI,gBAAgB,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;YACxB,SAAS;QACX,CAAC;QAED,gEAAgE;QAChE,MAAM,UAAU,GAA6C,EAAE,CAAC;QAChE,KAAK,MAAM,QAAQ,IAAI,gBAAgB,EAAE,CAAC;YACxC,oDAAoD;YACpD,IAAI,QAAQ,CAAC,SAAS,KAAK,KAAK,CAAC,SAAS;gBAAE,SAAS;YAErD,MAAM,KAAK,GAAG,cAAc,CAC1B,EAAE,SAAS,EAAE,KAAK,CAAC,SAAS,EAAE,WAAW,EAAE,KAAK,CAAC,kBAAkB,EAAE,EACrE,EAAE,SAAS,EAAE,QAAQ,CAAC,SAAS,EAAE,WAAW,EAAE,QAAQ,CAAC,WAAW,EAAE,CACrE,CAAC;YAEF,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;gBACvB,UAAU,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;QAED,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;YACxB,SAAS;QACX,CAAC;QAED,kDAAkD;QAClD,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAE7C,8CAA8C;QAC9C,IAAI,OAAO,GAAG,KAAK,CAAC;QACpB,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,mBAAmB,EAAE,CAAC;YACtB,MAAM,MAAM,GAAG,KAAK,CAAC,WAAW,CAAC,KAAK,CAAC,SAAS,EAAE,SAAS,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;YAE9E,IAAI,MAAM,KAAK,KAAK,EAAE,CAAC;gBACrB,mCAAmC;gBACnC,SAAS;YACX,CAAC;YAED,IAAI,MAAM,KAAK,IAAI,EAAE,CAAC;gBACpB,kCAAkC;gBAClC,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;gBAC9D,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,CAAC,SAAS,EAAE,UAAU,EAAE,SAAS,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC;gBAC/G,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACtB,OAAO,GAAG,IAAI,CAAC;gBACf,YAAY,EAAE,CAAC;gBACf,MAAM;YACR,CAAC;YAED,+BAA+B;YAC/B,IAAI,CAAC;gBACH,MAAM,SAAS,GAAG,MAAM,aAAa,CACnC,KAAK,CAAC,kBAAkB,EACxB,SAAS,CAAC,MAAM,CAAC,WAAW,EAC5B,KAAK,CAAC,WAAW,CAClB,CAAC;gBAEF,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,EAAE,SAAS,CAAC,MAAM,CAAC,SAAS,EAAE,SAAS,CAAC,OAAO,CAAC,CAAC;gBAE7E,IAAI,SAAS,CAAC,OAAO,EAAE,CAAC;oBACtB,MAAM,OAAO,GAAG,UAAU,CAAC,KAAK,EAAE,SAAS,CAAC,MAAM,EAAE,KAAK,EAAE,SAAS,CAAC,SAAS,CAAC,CAAC;oBAChF,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,QAAQ,EAAE,KAAK,CAAC,SAAS,EAAE,UAAU,EAAE,SAAS,CAAC,MAAM,CAAC,SAAS,EAAE,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,SAAS,CAAC,SAAS,EAAE,CAAC,CAAC;oBAC5I,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;oBACtB,OAAO,GAAG,IAAI,CAAC;oBACf,YAAY,EAAE,CAAC;oBACf,MAAM;gBACR,CAAC;YACH,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,MAAM,GAAG,GAAG,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;gBAC7D,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,CAAC,SAAS,EAAE,UAAU,EAAE,SAAS,CAAC,MAAM,CAAC,SAAS,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;gBACvG,6DAA6D;YAC/D,CAAC;QACH,CAAC;QAED,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,OAAO,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC;QAC1B,CAAC;IACH,CAAC;IAED,eAAe;IACf,IAAI,CAAC,EAAE,IAAI,EAAE,SAAS,EAAE,mBAAmB,EAAE,YAAY,EAAE,CAAC,CAAC;IAE7D,2BAA2B;IAC3B,KAAK,CAAC,IAAI,EAAE,CAAC;IAEb,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,+EAA+E;AAE/E;;GAEG;AACH,MAAM,UAAU,qBAAqB,CAAC,KAAsB;IAC1D,QAAQ,KAAK,CAAC,IAAI,EAAE,CAAC;QACnB,KAAK,YAAY;YACf,OAAO,cAAc,KAAK,CAAC,QAAQ,KAAK,KAAK,CAAC,WAAW,eAAe,CAAC;QAE3E,KAAK,cAAc;YACjB,OAAO,YAAY,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,oBAAoB,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,QAAQ,CAAC;QAEpH,KAAK,SAAS;YACZ,IAAI,KAAK,CAAC,MAAM,KAAK,QAAQ,EAAE,CAAC;gBAC9B,OAAO,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,QAAS,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,UAAW,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YAC9H,CAAC;YACD,OAAO,KAAK,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,QAAS,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,UAAW,CAAC,EAAE,CAAC;QAExG,KAAK,SAAS;YACZ,OAAO,eAAe,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC,gBAAgB,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC,UAAU,CAAC;QAEhI,KAAK,UAAU;YACb,OAAO,cAAc,KAAK,CAAC,OAAO,IAAI,KAAK,CAAC,KAAK,KAAK,CAAC;QAEzD,KAAK,OAAO;YACV,OAAO,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,KAAK,CAAC,QAAS,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,KAAK,CAAC,KAAM,CAAC,EAAE,CAAC;QAEhF;YACE,OAAO,EAAE,CAAC;IACd,CAAC;AACH,CAAC;AAED,+EAA+E;AAE/E,SAAS,eAAe,CACtB,aAAqB,EACrB,IAAuC;IAEvC,MAAM,KAAK,GAAG,IAAI,GAAG,EAAyB,CAAC;IAC/C,MAAM,QAAQ,GAAG,YAAY,CAAC,aAAa,CAAC,CAAC;IAC7C,MAAM,eAAe,GAAG,IAAI,eAAe,EAAE,CAAC;IAE9C,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;QAC/B,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,CAAC;QACnC,MAAM,OAAO,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC;QACrC,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,QAAQ,EAAE,QAAQ,EAAE,WAAW,EAAE,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC;QAChF,CAAC;QAED,KAAK,MAAM,QAAQ,IAAI,OAAO,EAAE,CAAC;YAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;YACpD,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC;gBAAE,SAAS;YAEpC,IAAI,CAAC;gBACH,MAAM,GAAG,GAAG,eAAe,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;gBAChD,MAAM,UAAU,GAAI,GAAG,CAAC,WAAW,CAAC,WAAsB,IAAI,QAAQ,CAAC;gBAEvE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC3B,KAAK,CAAC,GAAG,CAAC,UAAU,EAAE,EAAE,CAAC,CAAC;gBAC5B,CAAC;gBACD,KAAK,CAAC,GAAG,CAAC,UAAU,CAAE,CAAC,IAAI,CAAC;oBAC1B,SAAS,EAAE,QAAQ;oBACnB,WAAW,EAAE,UAAU;oBACvB,WAAW,EAAE,GAAG,CAAC,WAAW;oBAC5B,IAAI,EAAE,QAAQ;iBACf,CAAC,CAAC;YACL,CAAC;YAAC,OAAO,GAAG,EAAE,CAAC;gBACb,mEAAmE;gBACnE,IAAI,IAAI;oBAAE,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,mBAAmB,QAAQ,KAAK,GAAG,YAAY,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,eAAe,EAAE,EAAE,CAAC,CAAC;YACvJ,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,SAAS,YAAY,CAAC,aAAqB;IACzC,MAAM,MAAM,GAAG,mBAAmB,CAAC,aAAa,CAAC,CAAC;IAClD,IAAI,MAAM,EAAE,KAAK,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;QACjD,OAAO,MAAM,CAAC,KAAK;aAChB,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;aAC5C,MAAM,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1C,CAAC;IAED,uCAAuC;IACvC,OAAO,WAAW,CAAC,aAAa,CAAC;SAC9B,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,EAAE,CAAC,CAAC,CAAC;SAChC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;AACpG,CAAC;AAED,SAAS,WAAW,CAAC,GAAW;IAC9B,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,EAAE,CAAC;IAChC,OAAO,WAAW,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE;QACjC,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;QACpC,IAAI,CAAC;YAAC,OAAO,QAAQ,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC;QAAC,CAAC;QAAC,MAAM,CAAC;YAAC,OAAO,KAAK,CAAC;QAAC,CAAC;IAC9E,CAAC,CAAC,CAAC;AACL,CAAC;AAED,+EAA+E;AAE/E,MAAM,UAAU,cAAc,CAC5B,MAA+D,EAC/D,QAAiE;IAEjE,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,sEAAsE;IACtE,KAAK,IAAI,eAAe,CAAC,MAAM,CAAC,SAAS,EAAE,QAAQ,CAAC,SAAS,CAAC,GAAG,GAAG,CAAC;IAErE,uCAAuC;IACvC,IAAI,MAAM,CAAC,WAAW,CAAC,MAAM,IAAI,QAAQ,CAAC,WAAW,CAAC,MAAM;QACxD,SAAS,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,KAAK,SAAS,CAAC,QAAQ,CAAC,WAAW,CAAC,MAAM,CAAC,EAAE,CAAC;QACpF,KAAK,IAAI,GAAG,CAAC;IACf,CAAC;IAED,8DAA8D;IAC9D,MAAM,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,IAAI,MAAM,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;IACvF,MAAM,YAAY,GAAG,UAAU,CAAC,QAAQ,CAAC,WAAW,CAAC,IAAI,IAAI,QAAQ,CAAC,WAAW,CAAC,SAAS,CAAC,CAAC;IAC7F,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACrD,KAAK,IAAI,OAAO,CAAC,UAAU,EAAE,YAAY,CAAC,GAAG,GAAG,CAAC;IACnD,CAAC;IAED,gFAAgF;IAChF,IAAI,MAAM,CAAC,SAAS,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC;QAC7C,QAAQ,CAAC,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC;QAClD,KAAK,IAAI,GAAG,CAAC;IACf,CAAC;IAED,OAAO,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;AAC5B,CAAC;AAED,+EAA+E;AAE/E,0DAA0D;AAC1D,MAAM,UAAU,eAAe,CAAC,CAAS,EAAE,CAAS;IAClD,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACtB,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,MAAM,GAAG,CAAC;QAAE,OAAO,CAAC,CAAC;IAE3C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,MAAM,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QACrC,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACxD,CAAC;IAED,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;QACvC,YAAY,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,OAAO,CAAC,CAAC,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,GAAG,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AAC5D,CAAC;AAED,4FAA4F;AAC5F,SAAS,SAAS,CAAC,KAAU;IAC3B,IAAI,OAAO,KAAK,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IAC3C,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,eAAe,CAAC,CAAC;IAC3C,IAAI,KAAK;QAAE,OAAO,KAAK,CAAC,CAAC,CAAC,CAAC;IAC3B,IAAI,eAAe,CAAC,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IAC9C,OAAO,IAAI,CAAC;AACd,CAAC;AAED,2DAA2D;AAC3D,SAAS,UAAU,CAAC,KAAU;IAC5B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACrC,OAAO,KAAK;SACT,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC;SACtB,MAAM,CAAC,CAAC,EAAE,EAAgB,EAAE,CAAC,EAAE,KAAK,IAAI,CAAC,CAAC;AAC/C,CAAC;AAED,8CAA8C;AAC9C,SAAS,OAAO,CAAC,CAAW,EAAE,CAAW;IACvC,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IACxB,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IACxB,IAAI,YAAY,GAAG,CAAC,CAAC;IACrB,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACxB,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,YAAY,EAAE,CAAC;IACrC,CAAC;IACD,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,GAAG,YAAY,CAAC;IACnD,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,YAAY,GAAG,KAAK,CAAC;AAChD,CAAC;AAED,+EAA+E;AAE/E,mFAAmF;AACnF,MAAM,0BAA0B,GAAG,IAAI,GAAG,CAAC,CAAC,MAAM,EAAE,WAAW,EAAE,aAAa,CAAC,CAAC,CAAC;AAEjF,SAAS,UAAU,CACjB,KAA0B,EAC1B,QAAqB,EACrB,MAAsC,EACtC,SAAkB;IAElB,oEAAoE;IACpE,wDAAwD;IACxD,MAAM,iBAAiB,GAAwB,EAAE,GAAG,KAAK,CAAC,kBAAkB,EAAE,CAAC;IAE/E,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC;QAChE,IAAI,GAAG,CAAC,UAAU,CAAC,GAAG,CAAC;YAAE,SAAS,CAAC,wBAAwB;QAE3D,IAAI,0BAA0B,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YACxC,mEAAmE;YACnE,iBAAiB,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QACjC,CAAC;aAAM,IAAI,iBAAiB,CAAC,GAAG,CAAC,KAAK,SAAS,IAAI,iBAAiB,CAAC,GAAG,CAAC,KAAK,IAAI,EAAE,CAAC;YACnF,kEAAkE;YAClE,iBAAiB,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;QACjC,CAAC;IACH,CAAC;IAED,MAAM,SAAS,GAAG,WAAW,KAAK,CAAC,SAAS,MAAM,QAAQ,CAAC,SAAS,QAAQ,MAAM,GAAG,SAAS,CAAC,CAAC,CAAC,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;IAEzH,MAAM,YAAY,GAAwB;QACxC,GAAG,KAAK;QACR,SAAS,EAAE,QAAQ,CAAC,SAAS;QAC7B,MAAM,EAAE,QAAQ;QAChB,kBAAkB,EAAE,iBAAiB;QACrC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC,CAAC,CAAC,SAAS;KAChE,CAAC;IAEF,OAAO;QACL,KAAK,EAAE,YAAY;QACnB,UAAU,EAAE,QAAQ,CAAC,SAAS;QAC9B,YAAY,EAAE,MAAM;KACrB,CAAC;AACJ,CAAC"}

package/dist/services/sync/graphrag-client.d.ts

@@ -0,0 +1,43 @@
+/**
+ * GraphRAG Client — in-process Graphology knowledge graph.
+ *
+ * Replaces the LightRAG HTTP client. Loads a serialized Graphology graph
+ * from disk, provides entity context via neighbor traversal.
+ */
+import Graph from 'graphology';
+import type { GraphRAGConfig } from './graphrag-config.js';
+import type { EntityContext } from './graphrag-context.js';
+export declare class GraphRAGClient {
+    private graph;
+    private config;
+    constructor(config: GraphRAGConfig);
+    /**
+     * Returns true if the graph has any nodes (i.e., has been indexed).
+     */
+    isAvailable(): Promise<boolean>;
+    /**
+     * Query the graph for context about an entity mentioned in source content.
+     * Scans source content for known node names, traverses neighbors.
+     */
+    getEntityContext(name: string, type: string, content: string): EntityContext;
+    /**
+     * Get stats about the current graph.
+     */
+    getStats(): {
+        nodes: number;
+        edges: number;
+        types: string[];
+    };
+    /**
+     * Look up a node by name and return its neighbors.
+     */
+    queryNode(name: string): {
+        node: Record<string, any>;
+        neighbors: Record<string, any>[];
+        edges: Record<string, any>[];
+    } | null;
+    /**
+     * Access the underlying graph (for testing / advanced use).
+     */
+    getGraph(): Graph;
+}

package/dist/services/sync/graphrag-client.js

@@ -0,0 +1,94 @@
+/**
+ * GraphRAG Client — in-process Graphology knowledge graph.
+ *
+ * Replaces the LightRAG HTTP client. Loads a serialized Graphology graph
+ * from disk, provides entity context via neighbor traversal.
+ */
+import Graph from 'graphology';
+import { existsSync, readFileSync } from 'fs';
+import { getEntityContext } from './graphrag-context.js';
+export class GraphRAGClient {
+    graph;
+    config;
+    constructor(config) {
+        this.config = config;
+        this.graph = new Graph();
+        if (existsSync(config.graph_path)) {
+            try {
+                const data = JSON.parse(readFileSync(config.graph_path, 'utf-8'));
+                this.graph.import(data);
+            }
+            catch {
+                // Start with empty graph if file is corrupted
+            }
+        }
+    }
+    /**
+     * Returns true if the graph has any nodes (i.e., has been indexed).
+     */
+    async isAvailable() {
+        return this.graph.order > 0;
+    }
+    /**
+     * Query the graph for context about an entity mentioned in source content.
+     * Scans source content for known node names, traverses neighbors.
+     */
+    getEntityContext(name, type, content) {
+        return getEntityContext(this.graph, name, type, content);
+    }
+    /**
+     * Get stats about the current graph.
+     */
+    getStats() {
+        const typeSet = new Set();
+        this.graph.forEachNode((_node, attrs) => {
+            if (attrs.type)
+                typeSet.add(attrs.type);
+        });
+        return {
+            nodes: this.graph.order,
+            edges: this.graph.size,
+            types: [...typeSet].sort(),
+        };
+    }
+    /**
+     * Look up a node by name and return its neighbors.
+     */
+    queryNode(name) {
+        const nameLower = name.toLowerCase();
+        let foundKey;
+        this.graph.forEachNode((node, attrs) => {
+            if (foundKey)
+                return;
+            const nodeName = attrs.name ?? node;
+            if (nodeName.toLowerCase() === nameLower) {
+                foundKey = node;
+            }
+        });
+        if (!foundKey)
+            return null;
+        const nodeAttrs = this.graph.getNodeAttributes(foundKey);
+        const neighbors = [];
+        const edges = [];
+        this.graph.forEachNeighbor(foundKey, (_neighbor, attrs) => {
+            neighbors.push({ ...attrs });
+        });
+        this.graph.forEachEdge(foundKey, (_edge, attrs, source, target) => {
+            const sourceAttrs = this.graph.getNodeAttributes(source);
+            const targetAttrs = this.graph.getNodeAttributes(target);
+            edges.push({
+                source: sourceAttrs.name ?? source,
+                target: targetAttrs.name ?? target,
+                ...attrs,
+            });
+        });
+        return { node: { ...nodeAttrs }, neighbors, edges };
+    }
+    /**
+     * Access the underlying graph (for testing / advanced use).
+     */
+    getGraph() {
+        return this.graph;
+    }
+}
+//# sourceMappingURL=graphrag-client.js.map

package/dist/services/sync/graphrag-client.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graphrag-client.js","sourceRoot":"","sources":["../../../src/services/sync/graphrag-client.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,MAAM,YAAY,CAAC;AAC/B,OAAO,EAAE,UAAU,EAAE,YAAY,EAAE,MAAM,IAAI,CAAC;AAE9C,OAAO,EAAE,gBAAgB,EAAE,MAAM,uBAAuB,CAAC;AAGzD,MAAM,OAAO,cAAc;IACjB,KAAK,CAAQ;IACb,MAAM,CAAiB;IAE/B,YAAY,MAAsB;QAChC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,KAAK,GAAG,IAAI,KAAK,EAAE,CAAC;QAEzB,IAAI,UAAU,CAAC,MAAM,CAAC,UAAU,CAAC,EAAE,CAAC;YAClC,IAAI,CAAC;gBACH,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,MAAM,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC,CAAC;gBAClE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;YAC1B,CAAC;YAAC,MAAM,CAAC;gBACP,8CAA8C;YAChD,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,WAAW;QACf,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC;IAC9B,CAAC;IAED;;;OAGG;IACH,gBAAgB,CAAC,IAAY,EAAE,IAAY,EAAE,OAAe;QAC1D,OAAO,gBAAgB,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IAC3D,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE;YACtC,IAAI,KAAK,CAAC,IAAI;gBAAE,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAc,CAAC,CAAC;QACpD,CAAC,CAAC,CAAC;QAEH,OAAO;YACL,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK;YACvB,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI;YACtB,KAAK,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,EAAE;SAC3B,CAAC;IACJ,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,IAAY;QACpB,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC;QACrC,IAAI,QAA4B,CAAC;QAEjC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE;YACrC,IAAI,QAAQ;gBAAE,OAAO;YACrB,MAAM,QAAQ,GAAI,KAAK,CAAC,IAAe,IAAI,IAAI,CAAC;YAChD,IAAI,QAAQ,CAAC,WAAW,EAAE,KAAK,SAAS,EAAE,CAAC;gBACzC,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,QAAQ;YAAE,OAAO,IAAI,CAAC;QAE3B,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,QAAQ,CAAC,CAAC;QACzD,MAAM,SAAS,GAA0B,EAAE,CAAC;QAC5C,MAAM,KAAK,GAA0B,EAAE,CAAC;QAExC,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,QAAQ,EAAE,CAAC,SAAS,EAAE,KAAK,EAAE,EAAE;YACxD,SAAS,CAAC,IAAI,CAAC,EAAE,GAAG,KAAK,EAAE,CAAC,CAAC;QAC/B,CAAC,CAAC,CAAC;QAEH,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,QAAQ,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE;YAChE,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;YACzD,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,MAAM,CAAC,CAAC;YACzD,KAAK,CAAC,IAAI,CAAC;gBACT,MAAM,EAAG,WAAW,CAAC,IAAe,IAAI,MAAM;gBAC9C,MAAM,EAAG,WAAW,CAAC,IAAe,IAAI,MAAM;gBAC9C,GAAG,KAAK;aACT,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,OAAO,EAAE,IAAI,EAAE,EAAE,GAAG,SAAS,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;IACtD,CAAC;IAED;;OAEG;IACH,QAAQ;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;CACF"}

package/dist/services/sync/graphrag-config.d.ts

@@ -0,0 +1,16 @@
+/**
+ * GraphRAG configuration — in-process Graphology graph.
+ *
+ * Config stored at ~/.studiograph/graphrag/config.json.
+ * Graph data stored at ~/.studiograph/graphrag/graph.json.
+ */
+export interface GraphRAGConfig {
+    enabled: boolean;
+    graph_path: string;
+    last_indexed?: string;
+    files_indexed?: number;
+}
+export declare const GRAPHRAG_CONFIG_PATH: string;
+export declare function loadGraphRAGConfig(): GraphRAGConfig;
+export declare function saveGraphRAGConfig(config: GraphRAGConfig): void;
+export declare function isGraphRAGEnabled(): boolean;

package/dist/services/sync/graphrag-config.js

@@ -0,0 +1,39 @@
+/**
+ * GraphRAG configuration — in-process Graphology graph.
+ *
+ * Config stored at ~/.studiograph/graphrag/config.json.
+ * Graph data stored at ~/.studiograph/graphrag/graph.json.
+ */
+import { existsSync, mkdirSync, readFileSync, writeFileSync } from 'fs';
+import { join } from 'path';
+import { homedir } from 'os';
+const GRAPHRAG_DIR = join(homedir(), '.studiograph', 'graphrag');
+export const GRAPHRAG_CONFIG_PATH = join(GRAPHRAG_DIR, 'config.json');
+function defaultGraphPath() {
+    return join(GRAPHRAG_DIR, 'graph.json');
+}
+export function loadGraphRAGConfig() {
+    if (!existsSync(GRAPHRAG_CONFIG_PATH)) {
+        return { enabled: false, graph_path: defaultGraphPath() };
+    }
+    try {
+        const raw = JSON.parse(readFileSync(GRAPHRAG_CONFIG_PATH, 'utf-8'));
+        return {
+            enabled: raw.enabled ?? false,
+            graph_path: raw.graph_path ?? defaultGraphPath(),
+            last_indexed: raw.last_indexed,
+            files_indexed: raw.files_indexed,
+        };
+    }
+    catch {
+        return { enabled: false, graph_path: defaultGraphPath() };
+    }
+}
+export function saveGraphRAGConfig(config) {
+    mkdirSync(GRAPHRAG_DIR, { recursive: true });
+    writeFileSync(GRAPHRAG_CONFIG_PATH, JSON.stringify(config, null, 2) + '\n');
+}
+export function isGraphRAGEnabled() {
+    return loadGraphRAGConfig().enabled;
+}
+//# sourceMappingURL=graphrag-config.js.map

package/dist/services/sync/graphrag-config.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graphrag-config.js","sourceRoot":"","sources":["../../../src/services/sync/graphrag-config.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,IAAI,CAAC;AACxE,OAAO,EAAE,IAAI,EAAE,MAAM,MAAM,CAAC;AAC5B,OAAO,EAAE,OAAO,EAAE,MAAM,IAAI,CAAC;AAS7B,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,EAAE,EAAE,cAAc,EAAE,UAAU,CAAC,CAAC;AACjE,MAAM,CAAC,MAAM,oBAAoB,GAAG,IAAI,CAAC,YAAY,EAAE,aAAa,CAAC,CAAC;AAEtE,SAAS,gBAAgB;IACvB,OAAO,IAAI,CAAC,YAAY,EAAE,YAAY,CAAC,CAAC;AAC1C,CAAC;AAED,MAAM,UAAU,kBAAkB;IAChC,IAAI,CAAC,UAAU,CAAC,oBAAoB,CAAC,EAAE,CAAC;QACtC,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,gBAAgB,EAAE,EAAE,CAAC;IAC5D,CAAC;IACD,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,YAAY,CAAC,oBAAoB,EAAE,OAAO,CAAC,CAAC,CAAC;QACpE,OAAO;YACL,OAAO,EAAE,GAAG,CAAC,OAAO,IAAI,KAAK;YAC7B,UAAU,EAAE,GAAG,CAAC,UAAU,IAAI,gBAAgB,EAAE;YAChD,YAAY,EAAE,GAAG,CAAC,YAAY;YAC9B,aAAa,EAAE,GAAG,CAAC,aAAa;SACjC,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,gBAAgB,EAAE,EAAE,CAAC;IAC5D,CAAC;AACH,CAAC;AAED,MAAM,UAAU,kBAAkB,CAAC,MAAsB;IACvD,SAAS,CAAC,YAAY,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAC7C,aAAa,CAAC,oBAAoB,EAAE,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC;AAC9E,CAAC;AAED,MAAM,UAAU,iBAAiB;IAC/B,OAAO,kBAAkB,EAAE,CAAC,OAAO,CAAC;AACtC,CAAC"}

package/dist/services/sync/graphrag-context.d.ts

@@ -0,0 +1,14 @@
+/**
+ * GraphRAG context builder — synchronous graph traversal.
+ *
+ * Scans source content for known node names, collects neighbors
+ * and edge descriptions, and formats as markdown context sections.
+ */
+import type Graph from 'graphology';
+export interface EntityContext {
+    formattedContext: string;
+}
+/**
+ * Find entities mentioned in source content and collect their graph neighbors.
+ */
+export declare function getEntityContext(graph: Graph, entityName: string, entityType: string, sourceContent: string): EntityContext;