@diegonogueiradev_/mcp-graph 1.0.0

package/dist/core/search/fts-search.js

@@ -0,0 +1,57 @@
+import { logger } from "../utils/logger.js";
+import { rerankWithTfIdf } from "./tfidf.js";
+/**
+ * Sanitize user query for FTS5 — escape special characters and
+ * convert spaces to implicit AND (FTS5 default).
+ */
+function sanitizeFtsQuery(raw) {
+    // Remove FTS5 special operators that could cause syntax errors
+    const cleaned = raw
+        .replace(/[*"(){}[\]:^~!@#$%&|\\]/g, " ")
+        .replace(/\b(AND|OR|NOT|NEAR)\b/gi, " ")
+        .trim()
+        .replace(/\s+/g, " ");
+    if (!cleaned)
+        return '""';
+    // Wrap each term in double quotes for exact matching, join with space (implicit AND)
+    const terms = cleaned.split(" ").filter(Boolean);
+    return terms.map((t) => `"${t}"`).join(" ");
+}
+/**
+ * Search nodes using FTS5 full-text search with BM25 ranking.
+ * Optionally applies TF-IDF reranking for better relevance.
+ */
+export function searchNodes(store, query, options = {}) {
+    const { limit = 20, rerank = false } = options;
+    const sanitized = sanitizeFtsQuery(query);
+    logger.info(`FTS search: "${query}" → ${sanitized}${rerank ? " (with TF-IDF rerank)" : ""}`);
+    // Stage 1: FTS5 candidates (fetch extra for reranking)
+    const candidateLimit = rerank ? Math.min(limit * 3, 100) : limit;
+    const ftsResults = store.searchNodes(sanitized, candidateLimit);
+    const resultMap = new Map();
+    for (const r of ftsResults) {
+        const { score, ...node } = r;
+        resultMap.set(node.id, node);
+    }
+    if (!rerank || ftsResults.length === 0) {
+        return ftsResults.map((r) => {
+            const { score, ...node } = r;
+            return { node: node, score };
+        });
+    }
+    // Stage 2: TF-IDF reranking
+    const candidates = ftsResults.map((r) => ({
+        id: r.id,
+        text: [r.title, r.description ?? "", r.tags?.join(" ") ?? ""].join(" "),
+    }));
+    const reranked = rerankWithTfIdf(candidates, query, limit);
+    return reranked
+        .map((r) => {
+        const node = resultMap.get(r.id);
+        if (!node)
+            return null;
+        return { node, score: r.score };
+    })
+        .filter((r) => r !== null);
+}
+//# sourceMappingURL=fts-search.js.map

package/dist/core/search/fts-search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fts-search.js","sourceRoot":"","sources":["../../../src/core/search/fts-search.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAC5C,OAAO,EAAE,eAAe,EAAE,MAAM,YAAY,CAAC;AAY7C;;;GAGG;AACH,SAAS,gBAAgB,CAAC,GAAW;IACnC,+DAA+D;IAC/D,MAAM,OAAO,GAAG,GAAG;SAChB,OAAO,CAAC,0BAA0B,EAAE,GAAG,CAAC;SACxC,OAAO,CAAC,yBAAyB,EAAE,GAAG,CAAC;SACvC,IAAI,EAAE;SACN,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;IAExB,IAAI,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IAE1B,qFAAqF;IACrF,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IACjD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC9C,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CACzB,KAAkB,EAClB,KAAa,EACb,UAAyB,EAAE;IAE3B,MAAM,EAAE,KAAK,GAAG,EAAE,EAAE,MAAM,GAAG,KAAK,EAAE,GAAG,OAAO,CAAC;IAC/C,MAAM,SAAS,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;IAC1C,MAAM,CAAC,IAAI,CAAC,gBAAgB,KAAK,OAAO,SAAS,GAAG,MAAM,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAE7F,uDAAuD;IACvD,MAAM,cAAc,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IACjE,MAAM,UAAU,GAAG,KAAK,CAAC,WAAW,CAAC,SAAS,EAAE,cAAc,CAAC,CAAC;IAEhE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAqB,CAAC;IAC/C,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC;QAC7B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAiB,CAAC,CAAC;IAC5C,CAAC;IAED,IAAI,CAAC,MAAM,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACvC,OAAO,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YAC1B,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,EAAE,GAAG,CAAC,CAAC;YAC7B,OAAO,EAAE,IAAI,EAAE,IAAiB,EAAE,KAAK,EAAE,CAAC;QAC5C,CAAC,CAAC,CAAC;IACL,CAAC;IAED,4BAA4B;IAC5B,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;QACxC,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,IAAI,EAAE,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,WAAW,IAAI,EAAE,EAAG,CAAoC,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC;KAC5G,CAAC,CAAC,CAAC;IAEJ,MAAM,QAAQ,GAAG,eAAe,CAAC,UAAU,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAE3D,OAAO,QAAQ;SACZ,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACT,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACjC,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC;QACvB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC;IAClC,CAAC,CAAC;SACD,MAAM,CAAC,CAAC,CAAC,EAAqB,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;AAClD,CAAC"}

package/dist/core/search/tfidf.d.ts

@@ -0,0 +1,32 @@
+/**
+ * Lightweight TF-IDF implementation for two-stage search reranking.
+ * No external dependencies — pure TypeScript.
+ */
+export declare class TfIdfIndex {
+    private docs;
+    private docFreq;
+    /**
+     * Add a document to the index.
+     */
+    addDocument(id: string, text: string): void;
+    /**
+     * Compute TF-IDF score for a query against all documents.
+     * Returns sorted results (highest score first).
+     */
+    search(query: string, limit?: number): Array<{
+        id: string;
+        score: number;
+    }>;
+}
+/**
+ * Build a TF-IDF index from search result nodes and rerank them.
+ * Two-stage: FTS5 candidates → TF-IDF reranking.
+ */
+export declare function rerankWithTfIdf(candidates: Array<{
+    id: string;
+    text: string;
+}>, query: string, limit?: number): Array<{
+    id: string;
+    score: number;
+}>;
+//# sourceMappingURL=tfidf.d.ts.map

package/dist/core/search/tfidf.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tfidf.d.ts","sourceRoot":"","sources":["../../../src/core/search/tfidf.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAUH,qBAAa,UAAU;IACrB,OAAO,CAAC,IAAI,CAAuB;IACnC,OAAO,CAAC,OAAO,CAAkC;IAEjD;;OAEG;IACH,WAAW,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI;IAgB3C;;;OAGG;IACH,MAAM,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,GAAE,MAAW,GAAG,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;CA+BhF;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAC7B,UAAU,EAAE,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,EAC/C,KAAK,EAAE,MAAM,EACb,KAAK,GAAE,MAAW,GACjB,KAAK,CAAC;IAAE,EAAE,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAAC,CAMtC"}

package/dist/core/search/tfidf.js

@@ -0,0 +1,67 @@
+/**
+ * Lightweight TF-IDF implementation for two-stage search reranking.
+ * No external dependencies — pure TypeScript.
+ */
+import { tokenize } from "./tokenizer.js";
+export class TfIdfIndex {
+    docs = [];
+    docFreq = new Map();
+    /**
+     * Add a document to the index.
+     */
+    addDocument(id, text) {
+        const tokens = tokenize(text);
+        const termFreq = new Map();
+        for (const token of tokens) {
+            termFreq.set(token, (termFreq.get(token) ?? 0) + 1);
+        }
+        // Update document frequency
+        for (const term of termFreq.keys()) {
+            this.docFreq.set(term, (this.docFreq.get(term) ?? 0) + 1);
+        }
+        this.docs.push({ id, tokens, termFreq });
+    }
+    /**
+     * Compute TF-IDF score for a query against all documents.
+     * Returns sorted results (highest score first).
+     */
+    search(query, limit = 20) {
+        const queryTokens = tokenize(query);
+        if (queryTokens.length === 0)
+            return [];
+        const n = this.docs.length;
+        if (n === 0)
+            return [];
+        const results = [];
+        for (const doc of this.docs) {
+            let score = 0;
+            const docLen = doc.tokens.length || 1;
+            for (const qt of queryTokens) {
+                const tf = (doc.termFreq.get(qt) ?? 0) / docLen;
+                const df = this.docFreq.get(qt) ?? 0;
+                if (df === 0)
+                    continue;
+                // IDF with smoothing: log(1 + N/df)
+                const idf = Math.log(1 + n / df);
+                score += tf * idf;
+            }
+            if (score > 0) {
+                results.push({ id: doc.id, score });
+            }
+        }
+        results.sort((a, b) => b.score - a.score);
+        return results.slice(0, limit);
+    }
+}
+/**
+ * Build a TF-IDF index from search result nodes and rerank them.
+ * Two-stage: FTS5 candidates → TF-IDF reranking.
+ */
+export function rerankWithTfIdf(candidates, query, limit = 20) {
+    const index = new TfIdfIndex();
+    for (const c of candidates) {
+        index.addDocument(c.id, c.text);
+    }
+    return index.search(query, limit);
+}
+//# sourceMappingURL=tfidf.js.map

package/dist/core/search/tfidf.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tfidf.js","sourceRoot":"","sources":["../../../src/core/search/tfidf.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAC;AAQ1C,MAAM,OAAO,UAAU;IACb,IAAI,GAAoB,EAAE,CAAC;IAC3B,OAAO,GAAwB,IAAI,GAAG,EAAE,CAAC;IAEjD;;OAEG;IACH,WAAW,CAAC,EAAU,EAAE,IAAY;QAClC,MAAM,MAAM,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC9B,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;QAE3C,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,QAAQ,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtD,CAAC;QAED,4BAA4B;QAC5B,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,IAAI,EAAE,EAAE,CAAC;YACnC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5D,CAAC;QAED,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,CAAC;IAC3C,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,KAAa,EAAE,QAAgB,EAAE;QACtC,MAAM,WAAW,GAAG,QAAQ,CAAC,KAAK,CAAC,CAAC;QACpC,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAExC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QAC3B,IAAI,CAAC,KAAK,CAAC;YAAE,OAAO,EAAE,CAAC;QAEvB,MAAM,OAAO,GAAyC,EAAE,CAAC;QAEzD,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YAC5B,IAAI,KAAK,GAAG,CAAC,CAAC;YACd,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,IAAI,CAAC,CAAC;YAEtC,KAAK,MAAM,EAAE,IAAI,WAAW,EAAE,CAAC;gBAC7B,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,MAAM,CAAC;gBAChD,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;gBACrC,IAAI,EAAE,KAAK,CAAC;oBAAE,SAAS;gBAEvB,oCAAoC;gBACpC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC;gBACjC,KAAK,IAAI,EAAE,GAAG,GAAG,CAAC;YACpB,CAAC;YAED,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACd,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;YACtC,CAAC;QACH,CAAC;QAED,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;QAC1C,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IACjC,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAC7B,UAA+C,EAC/C,KAAa,EACb,QAAgB,EAAE;IAElB,MAAM,KAAK,GAAG,IAAI,UAAU,EAAE,CAAC;IAC/B,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,KAAK,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;AACpC,CAAC"}

package/dist/core/search/tokenizer.d.ts

@@ -0,0 +1,9 @@
+/**
+ * Lightweight tokenizer for TF-IDF computation.
+ * Handles Portuguese and English text, strips accents and punctuation.
+ */
+/**
+ * Normalize and tokenize text into lowercase terms, stripping accents.
+ */
+export declare function tokenize(text: string): string[];
+//# sourceMappingURL=tokenizer.d.ts.map

package/dist/core/search/tokenizer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tokenizer.d.ts","sourceRoot":"","sources":["../../../src/core/search/tokenizer.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAkBH;;GAEG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,EAAE,CAc/C"}

package/dist/core/search/tokenizer.js

@@ -0,0 +1,37 @@
+/**
+ * Lightweight tokenizer for TF-IDF computation.
+ * Handles Portuguese and English text, strips accents and punctuation.
+ */
+const STOPWORDS = new Set([
+    // Portuguese
+    "a", "o", "e", "é", "de", "do", "da", "dos", "das", "em", "no", "na",
+    "nos", "nas", "um", "uma", "uns", "umas", "por", "para", "com", "sem",
+    "que", "se", "ou", "ao", "aos", "como", "mais", "mas", "este", "esta",
+    "esse", "essa", "não", "nao", "ser", "ter", "foi", "são", "sao",
+    // English
+    "the", "a", "an", "is", "are", "was", "were", "be", "been", "being",
+    "have", "has", "had", "do", "does", "did", "will", "would", "could",
+    "should", "may", "might", "can", "shall", "of", "in", "to", "for",
+    "with", "on", "at", "by", "from", "as", "into", "through", "and",
+    "but", "or", "not", "no", "if", "it", "its", "this", "that", "they",
+    "we", "he", "she", "you", "i", "me", "my", "your", "his", "her",
+    "our", "their", "what", "which", "who", "when", "where", "how",
+]);
+/**
+ * Normalize and tokenize text into lowercase terms, stripping accents.
+ */
+export function tokenize(text) {
+    const normalized = text
+        .normalize("NFD")
+        .replace(/[\u0300-\u036f]/g, "") // strip accents
+        .toLowerCase()
+        .replace(/[^a-z0-9_\s]/g, " ") // keep only alphanumeric + underscore
+        .replace(/\s+/g, " ")
+        .trim();
+    if (!normalized)
+        return [];
+    return normalized
+        .split(" ")
+        .filter((t) => t.length >= 2 && !STOPWORDS.has(t));
+}
+//# sourceMappingURL=tokenizer.js.map

package/dist/core/search/tokenizer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tokenizer.js","sourceRoot":"","sources":["../../../src/core/search/tokenizer.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC;IACxB,aAAa;IACb,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI;IACpE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK;IACrE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM;IACrE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK;IAC/D,UAAU;IACV,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO;IACnE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;IACnE,QAAQ,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK;IACjE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,SAAS,EAAE,KAAK;IAChE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM;IACnE,IAAI,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK;IAC/D,KAAK,EAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK;CAC/D,CAAC,CAAC;AAEH;;GAEG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY;IACnC,MAAM,UAAU,GAAG,IAAI;SACpB,SAAS,CAAC,KAAK,CAAC;SAChB,OAAO,CAAC,kBAAkB,EAAE,EAAE,CAAC,CAAC,gBAAgB;SAChD,WAAW,EAAE;SACb,OAAO,CAAC,eAAe,EAAE,GAAG,CAAC,CAAG,sCAAsC;SACtE,OAAO,CAAC,MAAM,EAAE,GAAG,CAAC;SACpB,IAAI,EAAE,CAAC;IAEV,IAAI,CAAC,UAAU;QAAE,OAAO,EAAE,CAAC;IAE3B,OAAO,UAAU;SACd,KAAK,CAAC,GAAG,CAAC;SACV,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;AACvD,CAAC"}

package/dist/core/store/migrations.d.ts

@@ -0,0 +1,4 @@
+import type Database from "better-sqlite3";
+export declare function runMigrations(db: Database.Database): void;
+export declare function configureDb(db: Database.Database): void;
+//# sourceMappingURL=migrations.d.ts.map

package/dist/core/store/migrations.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"migrations.d.ts","sourceRoot":"","sources":["../../../src/core/store/migrations.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,QAAQ,MAAM,gBAAgB,CAAC;AAuH3C,wBAAgB,aAAa,CAAC,EAAE,EAAE,QAAQ,CAAC,QAAQ,GAAG,IAAI,CA2BzD;AAED,wBAAgB,WAAW,CAAC,EAAE,EAAE,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAGvD"}

package/dist/core/store/migrations.js

@@ -0,0 +1,137 @@
+const migrations = [
+    {
+        version: 1,
+        description: "Initial schema — projects, nodes, edges, snapshots, import_history",
+        sql: `
+      CREATE TABLE IF NOT EXISTS projects (
+        id          TEXT PRIMARY KEY,
+        name        TEXT NOT NULL,
+        created_at  TEXT NOT NULL,
+        updated_at  TEXT NOT NULL
+      );
+
+      CREATE TABLE IF NOT EXISTS nodes (
+        id                  TEXT PRIMARY KEY,
+        project_id          TEXT NOT NULL REFERENCES projects(id),
+        type                TEXT NOT NULL,
+        title               TEXT NOT NULL,
+        description         TEXT,
+        status              TEXT NOT NULL DEFAULT 'backlog',
+        priority            INTEGER NOT NULL DEFAULT 3,
+        xp_size             TEXT,
+        estimate_minutes    INTEGER,
+        tags                TEXT, -- JSON array
+        parent_id           TEXT,
+        sprint              TEXT,
+        source_file         TEXT,
+        source_start_line   INTEGER,
+        source_end_line     INTEGER,
+        source_confidence   REAL,
+        acceptance_criteria TEXT, -- JSON array
+        blocked             INTEGER NOT NULL DEFAULT 0,
+        metadata            TEXT, -- JSON object
+        created_at          TEXT NOT NULL,
+        updated_at          TEXT NOT NULL
+      );
+
+      CREATE TABLE IF NOT EXISTS edges (
+        id            TEXT PRIMARY KEY,
+        project_id    TEXT NOT NULL REFERENCES projects(id),
+        from_node     TEXT NOT NULL REFERENCES nodes(id),
+        to_node       TEXT NOT NULL REFERENCES nodes(id),
+        relation_type TEXT NOT NULL,
+        weight        REAL,
+        reason        TEXT,
+        metadata      TEXT, -- JSON object
+        created_at    TEXT NOT NULL
+      );
+
+      CREATE TABLE IF NOT EXISTS snapshots (
+        id          INTEGER PRIMARY KEY AUTOINCREMENT,
+        project_id  TEXT NOT NULL REFERENCES projects(id),
+        data        TEXT NOT NULL, -- JSON dump of GraphDocument
+        created_at  TEXT NOT NULL
+      );
+
+      CREATE TABLE IF NOT EXISTS import_history (
+        id             INTEGER PRIMARY KEY AUTOINCREMENT,
+        project_id     TEXT NOT NULL REFERENCES projects(id),
+        source_file    TEXT NOT NULL,
+        nodes_created  INTEGER NOT NULL DEFAULT 0,
+        edges_created  INTEGER NOT NULL DEFAULT 0,
+        imported_at    TEXT NOT NULL
+      );
+
+      -- Indexes for common query patterns
+      CREATE INDEX IF NOT EXISTS idx_nodes_project     ON nodes(project_id);
+      CREATE INDEX IF NOT EXISTS idx_nodes_type        ON nodes(project_id, type);
+      CREATE INDEX IF NOT EXISTS idx_nodes_status      ON nodes(project_id, status);
+      CREATE INDEX IF NOT EXISTS idx_nodes_parent      ON nodes(parent_id);
+      CREATE INDEX IF NOT EXISTS idx_edges_project     ON edges(project_id);
+      CREATE INDEX IF NOT EXISTS idx_edges_from        ON edges(from_node);
+      CREATE INDEX IF NOT EXISTS idx_edges_to          ON edges(to_node);
+      CREATE INDEX IF NOT EXISTS idx_snapshots_project ON snapshots(project_id);
+      CREATE INDEX IF NOT EXISTS idx_imports_project   ON import_history(project_id);
+    `,
+    },
+    {
+        version: 2,
+        description: "FTS5 full-text search index on nodes",
+        sql: `
+      CREATE VIRTUAL TABLE IF NOT EXISTS nodes_fts USING fts5(
+        title, description, tags,
+        content='nodes', content_rowid='rowid'
+      );
+
+      -- Populate FTS from existing nodes
+      INSERT INTO nodes_fts(rowid, title, description, tags)
+        SELECT rowid, title, COALESCE(description, ''), COALESCE(tags, '')
+        FROM nodes;
+
+      -- Sync triggers: keep FTS in sync with nodes table
+      CREATE TRIGGER IF NOT EXISTS nodes_fts_insert AFTER INSERT ON nodes BEGIN
+        INSERT INTO nodes_fts(rowid, title, description, tags)
+          VALUES (NEW.rowid, NEW.title, COALESCE(NEW.description, ''), COALESCE(NEW.tags, ''));
+      END;
+
+      CREATE TRIGGER IF NOT EXISTS nodes_fts_delete AFTER DELETE ON nodes BEGIN
+        INSERT INTO nodes_fts(nodes_fts, rowid, title, description, tags)
+          VALUES ('delete', OLD.rowid, OLD.title, COALESCE(OLD.description, ''), COALESCE(OLD.tags, ''));
+      END;
+
+      CREATE TRIGGER IF NOT EXISTS nodes_fts_update AFTER UPDATE ON nodes BEGIN
+        INSERT INTO nodes_fts(nodes_fts, rowid, title, description, tags)
+          VALUES ('delete', OLD.rowid, OLD.title, COALESCE(OLD.description, ''), COALESCE(OLD.tags, ''));
+        INSERT INTO nodes_fts(rowid, title, description, tags)
+          VALUES (NEW.rowid, NEW.title, COALESCE(NEW.description, ''), COALESCE(NEW.tags, ''));
+      END;
+    `,
+    },
+];
+export function runMigrations(db) {
+    // Create migrations tracking table
+    db.exec(`
+    CREATE TABLE IF NOT EXISTS _migrations (
+      version     INTEGER PRIMARY KEY,
+      description TEXT NOT NULL,
+      applied_at  TEXT NOT NULL
+    );
+  `);
+    const applied = new Set(db
+        .prepare("SELECT version FROM _migrations")
+        .all()
+        .map((row) => row.version));
+    for (const migration of migrations) {
+        if (applied.has(migration.version))
+            continue;
+        db.transaction(() => {
+            db.exec(migration.sql);
+            db.prepare("INSERT INTO _migrations (version, description, applied_at) VALUES (?, ?, ?)").run(migration.version, migration.description, new Date().toISOString());
+        })();
+    }
+}
+export function configureDb(db) {
+    db.pragma("journal_mode = WAL");
+    db.pragma("foreign_keys = ON");
+}
+//# sourceMappingURL=migrations.js.map

package/dist/core/store/migrations.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"migrations.js","sourceRoot":"","sources":["../../../src/core/store/migrations.ts"],"names":[],"mappings":"AAQA,MAAM,UAAU,GAAgB;IAC9B;QACE,OAAO,EAAE,CAAC;QACV,WAAW,EAAE,oEAAoE;QACjF,GAAG,EAAE;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;KAsEJ;KACF;IACD;QACE,OAAO,EAAE,CAAC;QACV,WAAW,EAAE,sCAAsC;QACnD,GAAG,EAAE;;;;;;;;;;;;;;;;;;;;;;;;;;;;KA4BJ;KACF;CACF,CAAC;AAEF,MAAM,UAAU,aAAa,CAAC,EAAqB;IACjD,mCAAmC;IACnC,EAAE,CAAC,IAAI,CAAC;;;;;;GAMP,CAAC,CAAC;IAEH,MAAM,OAAO,GAAG,IAAI,GAAG,CACrB,EAAE;SACC,OAAO,CAAC,iCAAiC,CAAC;SAC1C,GAAG,EAAE;SACL,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAE,GAA2B,CAAC,OAAO,CAAC,CACtD,CAAC;IAEF,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,IAAI,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,CAAC;YAAE,SAAS;QAE7C,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;YAClB,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC;YACvB,EAAE,CAAC,OAAO,CACR,6EAA6E,CAC9E,CAAC,GAAG,CAAC,SAAS,CAAC,OAAO,EAAE,SAAS,CAAC,WAAW,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,CAAC;QAC5E,CAAC,CAAC,EAAE,CAAC;IACP,CAAC;AACH,CAAC;AAED,MAAM,UAAU,WAAW,CAAC,EAAqB;IAC/C,EAAE,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;IAChC,EAAE,CAAC,MAAM,CAAC,mBAAmB,CAAC,CAAC;AACjC,CAAC"}

package/dist/core/store/sqlite-store.d.ts

@@ -0,0 +1,68 @@
+import type { GraphDocument, GraphNode, GraphEdge, GraphProject, NodeType, NodeStatus } from "../graph/graph-types.js";
+export declare class SqliteStore {
+    private db;
+    private projectId;
+    private constructor();
+    /**
+     * Open (or create) a store at basePath/.mcp-graph/graph.db.
+     * Pass ":memory:" for in-memory testing.
+     */
+    static open(basePath?: string): SqliteStore;
+    close(): void;
+    initProject(name?: string): GraphProject;
+    getProject(): GraphProject | null;
+    private ensureProject;
+    insertNode(node: GraphNode): void;
+    getNodeById(id: string): GraphNode | null;
+    getAllNodes(): GraphNode[];
+    getNodesByType(type: NodeType): GraphNode[];
+    getNodesByStatus(status: NodeStatus): GraphNode[];
+    getChildNodes(parentId: string): GraphNode[];
+    updateNodeStatus(id: string, status: NodeStatus): GraphNode | null;
+    updateNode(id: string, fields: Partial<Pick<GraphNode, "title" | "description" | "type" | "priority" | "xpSize" | "estimateMinutes" | "tags" | "parentId" | "sprint" | "blocked" | "acceptanceCriteria" | "metadata">>): GraphNode | null;
+    deleteNode(id: string): boolean;
+    deleteEdge(id: string): boolean;
+    insertEdge(edge: GraphEdge): void;
+    getEdgesFrom(nodeId: string): GraphEdge[];
+    getEdgesTo(nodeId: string): GraphEdge[];
+    getAllEdges(): GraphEdge[];
+    /**
+     * Check if a source file has been previously imported.
+     */
+    hasImport(sourceFile: string): boolean;
+    /**
+     * Delete all nodes (and their edges) that were imported from a specific source file.
+     * Also removes the import history entry so re-import is clean.
+     */
+    clearImportedNodes(sourceFile: string): {
+        nodesDeleted: number;
+        edgesDeleted: number;
+    };
+    bulkInsert(nodes: GraphNode[], edges: GraphEdge[]): void;
+    createSnapshot(): number;
+    recordImport(sourceFile: string, nodesCreated: number, edgesCreated: number): void;
+    getStats(): {
+        totalNodes: number;
+        totalEdges: number;
+        byType: Record<string, number>;
+        byStatus: Record<string, number>;
+    };
+    /**
+     * Search nodes using FTS5 with BM25 ranking.
+     * Returns nodes ordered by relevance score.
+     */
+    searchNodes(query: string, limit?: number): Array<GraphNode & {
+        score: number;
+    }>;
+    bulkUpdateStatus(ids: string[], status: NodeStatus): {
+        updated: string[];
+        notFound: string[];
+    };
+    restoreSnapshot(snapshotId: number): void;
+    listSnapshots(): Array<{
+        snapshotId: number;
+        createdAt: string;
+    }>;
+    toGraphDocument(): GraphDocument;
+}
+//# sourceMappingURL=sqlite-store.d.ts.map

package/dist/core/store/sqlite-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sqlite-store.d.ts","sourceRoot":"","sources":["../../../src/core/store/sqlite-store.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EACV,aAAa,EACb,SAAS,EACT,SAAS,EACT,YAAY,EACZ,QAAQ,EACR,UAAU,EAEX,MAAM,yBAAyB,CAAC;AAgKjC,qBAAa,WAAW;IACtB,OAAO,CAAC,EAAE,CAAoB;IAC9B,OAAO,CAAC,SAAS,CAAuB;IAExC,OAAO;IAIP;;;OAGG;IACH,MAAM,CAAC,IAAI,CAAC,QAAQ,GAAE,MAAsB,GAAG,WAAW;IA0B1D,KAAK,IAAI,IAAI;IAMb,WAAW,CAAC,IAAI,GAAE,MAA0B,GAAG,YAAY;IAkB3D,UAAU,IAAI,YAAY,GAAG,IAAI;IAcjC,OAAO,CAAC,aAAa;IASrB,UAAU,CAAC,IAAI,EAAE,SAAS,GAAG,IAAI;IA2BjC,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,SAAS,GAAG,IAAI;IAQzC,WAAW,IAAI,SAAS,EAAE;IAQ1B,cAAc,CAAC,IAAI,EAAE,QAAQ,GAAG,SAAS,EAAE;IAU3C,gBAAgB,CAAC,MAAM,EAAE,UAAU,GAAG,SAAS,EAAE;IAUjD,aAAa,CAAC,QAAQ,EAAE,MAAM,GAAG,SAAS,EAAE;IAU5C,gBAAgB,CAAC,EAAE,EAAE,MAAM,EAAE,MAAM,EAAE,UAAU,GAAG,SAAS,GAAG,IAAI;IAalE,UAAU,CACR,EAAE,EAAE,MAAM,EACV,MAAM,EAAE,OAAO,CACb,IAAI,CACF,SAAS,EACP,OAAO,GACP,aAAa,GACb,MAAM,GACN,UAAU,GACV,QAAQ,GACR,iBAAiB,GACjB,MAAM,GACN,UAAU,GACV,QAAQ,GACR,SAAS,GACT,oBAAoB,GACpB,UAAU,CACb,CACF,GACA,SAAS,GAAG,IAAI;IA6EnB,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAmB/B,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAU/B,UAAU,CAAC,IAAI,EAAE,SAAS,GAAG,IAAI;IAqBjC,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,EAAE;IAQzC,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,SAAS,EAAE;IAQvC,WAAW,IAAI,SAAS,EAAE;IAU1B;;OAEG;IACH,SAAS,CAAC,UAAU,EAAE,MAAM,GAAG,OAAO;IAUtC;;;OAGG;IACH,kBAAkB,CAAC,UAAU,EAAE,MAAM,GAAG;QAAE,YAAY,EAAE,MAAM,CAAC;QAAC,YAAY,EAAE,MAAM,CAAA;KAAE;IAyCtF,UAAU,CAAC,KAAK,EAAE,SAAS,EAAE,EAAE,KAAK,EAAE,SAAS,EAAE,GAAG,IAAI;IAsCxD,cAAc,IAAI,MAAM;IAaxB,YAAY,CACV,UAAU,EAAE,MAAM,EAClB,YAAY,EAAE,MAAM,EACpB,YAAY,EAAE,MAAM,GACnB,IAAI;IAYP,QAAQ,IAAI;QACV,UAAU,EAAE,MAAM,CAAC;QACnB,UAAU,EAAE,MAAM,CAAC;QACnB,MAAM,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC/B,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;KAClC;IAoCD;;;OAGG;IACH,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,GAAE,MAAW,GAAG,KAAK,CAAC,SAAS,GAAG;QAAE,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC;IAwBpF,gBAAgB,CAAC,GAAG,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,UAAU,GAAG;QAAE,OAAO,EAAE,MAAM,EAAE,CAAC;QAAC,QAAQ,EAAE,MAAM,EAAE,CAAA;KAAE;IAqB9F,eAAe,CAAC,UAAU,EAAE,MAAM,GAAG,IAAI;IA+CzC,aAAa,IAAI,KAAK,CAAC;QAAE,UAAU,EAAE,MAAM,CAAC;QAAC,SAAS,EAAE,MAAM,CAAA;KAAE,CAAC;IAYjE,eAAe,IAAI,aAAa;CAoCjC"}