@mduenas/codegraph 0.4.0

package/dist/vectors/search.js

@@ -0,0 +1,409 @@
+"use strict";
+/**
+ * Vector Search
+ *
+ * Provides vector similarity search using sqlite-vss extension.
+ * Falls back to brute-force cosine similarity if sqlite-vss is not available.
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.VectorSearchManager = void 0;
+exports.createVectorSearch = createVectorSearch;
+const embedder_1 = require("./embedder");
+/**
+ * Vector Search Manager
+ *
+ * Handles vector storage and similarity search for semantic code search.
+ */
+class VectorSearchManager {
+    db;
+    vssEnabled = false;
+    embeddingDimension;
+    constructor(db, dimension = embedder_1.EMBEDDING_DIMENSION) {
+        this.db = db;
+        this.embeddingDimension = dimension;
+    }
+    /**
+     * Initialize vector search
+     *
+     * Attempts to load sqlite-vss extension. Falls back to brute-force
+     * search if the extension is not available.
+     */
+    async initialize() {
+        try {
+            // Try to load sqlite-vss extension
+            await this.loadVssExtension();
+            this.vssEnabled = true;
+            console.log('sqlite-vss extension loaded successfully');
+            // Create the VSS virtual table
+            this.createVssTable();
+        }
+        catch (error) {
+            // Fall back to brute-force search
+            console.warn('sqlite-vss extension not available, falling back to brute-force search:', error instanceof Error ? error.message : String(error));
+            this.vssEnabled = false;
+        }
+        // Ensure the vectors table exists (for both VSS and fallback modes)
+        this.ensureVectorsTable();
+    }
+    /**
+     * Load the sqlite-vss extension
+     */
+    async loadVssExtension() {
+        try {
+            // The sqlite-vss npm package provides functions to load extensions
+            const vss = await Promise.resolve().then(() => __importStar(require('sqlite-vss')));
+            // Use the load function which loads both vector0 and vss0
+            if (typeof vss.load === 'function') {
+                vss.load(this.db);
+            }
+            else if (typeof vss.default?.load === 'function') {
+                vss.default.load(this.db);
+            }
+            else {
+                throw new Error('sqlite-vss load function not found');
+            }
+        }
+        catch (error) {
+            throw new Error(`Failed to load sqlite-vss: ${error instanceof Error ? error.message : String(error)}`);
+        }
+    }
+    /**
+     * Create the VSS virtual table for vector search
+     */
+    createVssTable() {
+        // Check if the table already exists
+        const tableExists = this.db
+            .prepare("SELECT name FROM sqlite_master WHERE type='table' AND name='vss_vectors'")
+            .get();
+        if (!tableExists) {
+            // Create VSS virtual table
+            // vss0 is the vector search extension
+            this.db.exec(`
+        CREATE VIRTUAL TABLE IF NOT EXISTS vss_vectors USING vss0(
+          embedding(${this.embeddingDimension})
+        );
+      `);
+            // Create mapping table to link VSS rowids to node IDs
+            this.db.exec(`
+        CREATE TABLE IF NOT EXISTS vss_map (
+          rowid INTEGER PRIMARY KEY,
+          node_id TEXT NOT NULL UNIQUE
+        );
+      `);
+            // Create index on node_id
+            this.db.exec(`
+        CREATE INDEX IF NOT EXISTS idx_vss_map_node ON vss_map(node_id);
+      `);
+        }
+    }
+    /**
+     * Ensure the basic vectors table exists (for fallback mode)
+     */
+    ensureVectorsTable() {
+        this.db.exec(`
+      CREATE TABLE IF NOT EXISTS vectors (
+        node_id TEXT PRIMARY KEY,
+        embedding BLOB NOT NULL,
+        model TEXT NOT NULL,
+        created_at INTEGER NOT NULL
+      );
+    `);
+    }
+    /**
+     * Check if VSS extension is enabled
+     */
+    isVssEnabled() {
+        return this.vssEnabled;
+    }
+    /**
+     * Store a vector embedding for a node
+     *
+     * @param nodeId - ID of the node
+     * @param embedding - Vector embedding
+     * @param model - Model used to generate embedding
+     */
+    storeVector(nodeId, embedding, model) {
+        const now = Date.now();
+        // Store in the vectors table (always, for persistence)
+        const blob = Buffer.from(embedding.buffer);
+        this.db
+            .prepare(`
+        INSERT OR REPLACE INTO vectors (node_id, embedding, model, created_at)
+        VALUES (?, ?, ?, ?)
+      `)
+            .run(nodeId, blob, model, now);
+        // Also store in VSS table if enabled
+        if (this.vssEnabled) {
+            this.storeInVss(nodeId, embedding);
+        }
+    }
+    /**
+     * Store vector in VSS virtual table
+     */
+    storeInVss(nodeId, embedding) {
+        try {
+            // Check if already exists
+            const existing = this.db
+                .prepare('SELECT rowid FROM vss_map WHERE node_id = ?')
+                .get(nodeId);
+            if (existing) {
+                // Update existing vector
+                const vectorJson = JSON.stringify(Array.from(embedding));
+                this.db
+                    .prepare('UPDATE vss_vectors SET embedding = ? WHERE rowid = ?')
+                    .run(vectorJson, existing.rowid);
+            }
+            else {
+                // Insert new vector - get max rowid and increment
+                const maxRow = this.db
+                    .prepare('SELECT MAX(rowid) as max FROM vss_map')
+                    .get();
+                const newRowid = (maxRow?.max ?? 0) + 1;
+                const vectorJson = JSON.stringify(Array.from(embedding));
+                this.db
+                    .prepare('INSERT INTO vss_vectors (rowid, embedding) VALUES (?, ?)')
+                    .run(newRowid, vectorJson);
+                // Map the rowid to node_id
+                this.db
+                    .prepare('INSERT INTO vss_map (rowid, node_id) VALUES (?, ?)')
+                    .run(newRowid, nodeId);
+            }
+        }
+        catch (error) {
+            // VSS operations can fail for various reasons (dimension mismatch, etc.)
+            // Fall back to brute-force search silently
+            console.warn('VSS storage failed, using brute-force search:', error instanceof Error ? error.message : String(error));
+        }
+    }
+    /**
+     * Store multiple vectors in a batch
+     *
+     * @param entries - Array of node IDs and embeddings
+     * @param model - Model used to generate embeddings
+     */
+    storeVectorBatch(entries, model) {
+        const now = Date.now();
+        // Use a transaction for better performance
+        this.db.transaction(() => {
+            for (const entry of entries) {
+                const blob = Buffer.from(entry.embedding.buffer);
+                this.db
+                    .prepare(`
+            INSERT OR REPLACE INTO vectors (node_id, embedding, model, created_at)
+            VALUES (?, ?, ?, ?)
+          `)
+                    .run(entry.nodeId, blob, model, now);
+                if (this.vssEnabled) {
+                    this.storeInVss(entry.nodeId, entry.embedding);
+                }
+            }
+        })();
+    }
+    /**
+     * Get vector for a node
+     *
+     * @param nodeId - ID of the node
+     * @returns Embedding or null if not found
+     */
+    getVector(nodeId) {
+        const row = this.db
+            .prepare('SELECT embedding FROM vectors WHERE node_id = ?')
+            .get(nodeId);
+        if (!row) {
+            return null;
+        }
+        return new Float32Array(row.embedding.buffer.slice(row.embedding.byteOffset, row.embedding.byteOffset + row.embedding.byteLength));
+    }
+    /**
+     * Delete vector for a node
+     *
+     * @param nodeId - ID of the node
+     */
+    deleteVector(nodeId) {
+        this.db.prepare('DELETE FROM vectors WHERE node_id = ?').run(nodeId);
+        if (this.vssEnabled) {
+            // Get the rowid before deleting
+            const mapping = this.db
+                .prepare('SELECT rowid FROM vss_map WHERE node_id = ?')
+                .get(nodeId);
+            if (mapping) {
+                this.db.prepare('DELETE FROM vss_vectors WHERE rowid = ?').run(mapping.rowid);
+                this.db.prepare('DELETE FROM vss_map WHERE node_id = ?').run(nodeId);
+            }
+        }
+    }
+    /**
+     * Search for similar vectors
+     *
+     * @param queryEmbedding - Query vector to search for
+     * @param options - Search options
+     * @returns Array of node IDs with similarity scores
+     */
+    search(queryEmbedding, options = {}) {
+        const { limit = 10, minScore = 0 } = options;
+        if (this.vssEnabled) {
+            return this.searchWithVss(queryEmbedding, limit, minScore);
+        }
+        else {
+            return this.searchBruteForce(queryEmbedding, limit, minScore);
+        }
+    }
+    /**
+     * Search using sqlite-vss KNN search
+     */
+    searchWithVss(queryEmbedding, limit, minScore) {
+        try {
+            const vectorJson = JSON.stringify(Array.from(queryEmbedding));
+            // Sanitize limit to prevent SQL injection (ensure it's a positive integer)
+            const safeLimit = Math.max(1, Math.floor(limit));
+            // Use VSS KNN search
+            // The distance is L2 (euclidean), we need to convert to similarity score
+            // Note: sqlite-vss requires LIMIT to be a literal, not a parameter
+            const rows = this.db
+                .prepare(`
+          SELECT
+            vss_map.node_id,
+            vss_vectors.distance
+          FROM vss_vectors
+          JOIN vss_map ON vss_map.rowid = vss_vectors.rowid
+          WHERE vss_search(vss_vectors.embedding, ?)
+          LIMIT ${safeLimit}
+        `)
+                .all(vectorJson);
+            // Convert L2 distance to similarity score (1 / (1 + distance))
+            return rows
+                .map((row) => ({
+                nodeId: row.node_id,
+                score: 1 / (1 + row.distance),
+            }))
+                .filter((r) => r.score >= minScore);
+        }
+        catch (error) {
+            // VSS search failed, fall back to brute force
+            console.warn('VSS search failed, using brute-force:', error instanceof Error ? error.message : String(error));
+            return this.searchBruteForce(queryEmbedding, limit, minScore);
+        }
+    }
+    /**
+     * Brute-force search using cosine similarity
+     */
+    searchBruteForce(queryEmbedding, limit, minScore) {
+        // Get all vectors
+        const rows = this.db
+            .prepare('SELECT node_id, embedding FROM vectors')
+            .all();
+        // Calculate cosine similarity for each
+        const results = [];
+        for (const row of rows) {
+            const embedding = new Float32Array(row.embedding.buffer.slice(row.embedding.byteOffset, row.embedding.byteOffset + row.embedding.byteLength));
+            const score = embedder_1.TextEmbedder.cosineSimilarity(queryEmbedding, embedding);
+            if (score >= minScore) {
+                results.push({ nodeId: row.node_id, score });
+            }
+        }
+        // Sort by score descending and limit
+        results.sort((a, b) => b.score - a.score);
+        return results.slice(0, limit);
+    }
+    /**
+     * Get count of stored vectors
+     */
+    getVectorCount() {
+        const result = this.db
+            .prepare('SELECT COUNT(*) as count FROM vectors')
+            .get();
+        return result.count;
+    }
+    /**
+     * Check if a node has a vector
+     */
+    hasVector(nodeId) {
+        const result = this.db
+            .prepare('SELECT 1 FROM vectors WHERE node_id = ? LIMIT 1')
+            .get(nodeId);
+        return !!result;
+    }
+    /**
+     * Get all node IDs that have vectors
+     */
+    getIndexedNodeIds() {
+        const rows = this.db
+            .prepare('SELECT node_id FROM vectors')
+            .all();
+        return rows.map((r) => r.node_id);
+    }
+    /**
+     * Clear all vectors
+     */
+    clear() {
+        this.db.prepare('DELETE FROM vectors').run();
+        if (this.vssEnabled) {
+            this.db.prepare('DELETE FROM vss_vectors').run();
+            this.db.prepare('DELETE FROM vss_map').run();
+        }
+    }
+    /**
+     * Rebuild VSS index from vectors table
+     *
+     * Useful after bulk operations or if VSS index gets out of sync.
+     */
+    rebuildVssIndex() {
+        if (!this.vssEnabled) {
+            return;
+        }
+        // Clear VSS tables
+        this.db.prepare('DELETE FROM vss_vectors').run();
+        this.db.prepare('DELETE FROM vss_map').run();
+        // Reload from vectors table
+        const rows = this.db
+            .prepare('SELECT node_id, embedding FROM vectors')
+            .all();
+        this.db.transaction(() => {
+            for (const row of rows) {
+                const embedding = new Float32Array(row.embedding.buffer.slice(row.embedding.byteOffset, row.embedding.byteOffset + row.embedding.byteLength));
+                this.storeInVss(row.node_id, embedding);
+            }
+        })();
+    }
+}
+exports.VectorSearchManager = VectorSearchManager;
+/**
+ * Create a vector search manager
+ */
+function createVectorSearch(db, dimension) {
+    return new VectorSearchManager(db, dimension);
+}
+//# sourceMappingURL=search.js.map

package/dist/vectors/search.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"search.js","sourceRoot":"","sources":["../../src/vectors/search.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2cH,gDAKC;AA5cD,yCAA+D;AAgB/D;;;;GAIG;AACH,MAAa,mBAAmB;IACtB,EAAE,CAAoB;IACtB,UAAU,GAAG,KAAK,CAAC;IACnB,kBAAkB,CAAS;IAEnC,YAAY,EAAqB,EAAE,YAAoB,8BAAmB;QACxE,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC;QACb,IAAI,CAAC,kBAAkB,GAAG,SAAS,CAAC;IACtC,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,UAAU;QACd,IAAI,CAAC;YACH,mCAAmC;YACnC,MAAM,IAAI,CAAC,gBAAgB,EAAE,CAAC;YAC9B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;YACvB,OAAO,CAAC,GAAG,CAAC,0CAA0C,CAAC,CAAC;YAExD,+BAA+B;YAC/B,IAAI,CAAC,cAAc,EAAE,CAAC;QACxB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,kCAAkC;YAClC,OAAO,CAAC,IAAI,CACV,yEAAyE,EACzE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CACvD,CAAC;YACF,IAAI,CAAC,UAAU,GAAG,KAAK,CAAC;QAC1B,CAAC;QAED,oEAAoE;QACpE,IAAI,CAAC,kBAAkB,EAAE,CAAC;IAC5B,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,gBAAgB;QAC5B,IAAI,CAAC;YACH,mEAAmE;YACnE,MAAM,GAAG,GAAG,wDAAa,YAAY,GAAC,CAAC;YAEvC,0DAA0D;YAC1D,IAAI,OAAO,GAAG,CAAC,IAAI,KAAK,UAAU,EAAE,CAAC;gBACnC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACpB,CAAC;iBAAM,IAAI,OAAO,GAAG,CAAC,OAAO,EAAE,IAAI,KAAK,UAAU,EAAE,CAAC;gBACnD,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAC5B,CAAC;iBAAM,CAAC;gBACN,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;YACxD,CAAC;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,MAAM,IAAI,KAAK,CAAC,8BAA8B,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QAC1G,CAAC;IACH,CAAC;IAED;;OAEG;IACK,cAAc;QACpB,oCAAoC;QACpC,MAAM,WAAW,GAAG,IAAI,CAAC,EAAE;aACxB,OAAO,CAAC,0EAA0E,CAAC;aACnF,GAAG,EAAE,CAAC;QAET,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,2BAA2B;YAC3B,sCAAsC;YACtC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;;sBAEG,IAAI,CAAC,kBAAkB;;OAEtC,CAAC,CAAC;YAEH,sDAAsD;YACtD,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;;;;;OAKZ,CAAC,CAAC;YAEH,0BAA0B;YAC1B,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;;OAEZ,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED;;OAEG;IACK,kBAAkB;QACxB,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC;;;;;;;KAOZ,CAAC,CAAC;IACL,CAAC;IAED;;OAEG;IACH,YAAY;QACV,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED;;;;;;OAMG;IACH,WAAW,CAAC,MAAc,EAAE,SAAuB,EAAE,KAAa;QAChE,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEvB,uDAAuD;QACvD,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,CAAC,EAAE;aACJ,OAAO,CACN;;;OAGD,CACA;aACA,GAAG,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;QAEjC,qCAAqC;QACrC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,SAAS,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED;;OAEG;IACK,UAAU,CAAC,MAAc,EAAE,SAAuB;QACxD,IAAI,CAAC;YACH,0BAA0B;YAC1B,MAAM,QAAQ,GAAG,IAAI,CAAC,EAAE;iBACrB,OAAO,CAAC,6CAA6C,CAAC;iBACtD,GAAG,CAAC,MAAM,CAAkC,CAAC;YAEhD,IAAI,QAAQ,EAAE,CAAC;gBACb,yBAAyB;gBACzB,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;gBACzD,IAAI,CAAC,EAAE;qBACJ,OAAO,CAAC,sDAAsD,CAAC;qBAC/D,GAAG,CAAC,UAAU,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;YACrC,CAAC;iBAAM,CAAC;gBACN,kDAAkD;gBAClD,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE;qBACnB,OAAO,CAAC,uCAAuC,CAAC;qBAChD,GAAG,EAAwC,CAAC;gBAC/C,MAAM,QAAQ,GAAG,CAAC,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBAExC,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC;gBACzD,IAAI,CAAC,EAAE;qBACJ,OAAO,CAAC,0DAA0D,CAAC;qBACnE,GAAG,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;gBAE7B,2BAA2B;gBAC3B,IAAI,CAAC,EAAE;qBACJ,OAAO,CAAC,oDAAoD,CAAC;qBAC7D,GAAG,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,yEAAyE;YACzE,2CAA2C;YAC3C,OAAO,CAAC,IAAI,CACV,+CAA+C,EAC/C,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CACvD,CAAC;QACJ,CAAC;IACH,CAAC;IAED;;;;;OAKG;IACH,gBAAgB,CACd,OAA2D,EAC3D,KAAa;QAEb,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,EAAE,CAAC;QAEvB,2CAA2C;QAC3C,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;YACvB,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;gBAC5B,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC;gBACjD,IAAI,CAAC,EAAE;qBACJ,OAAO,CACN;;;WAGD,CACA;qBACA,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;gBAEvC,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;oBACpB,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,SAAS,CAAC,CAAC;gBACjD,CAAC;YACH,CAAC;QACH,CAAC,CAAC,EAAE,CAAC;IACP,CAAC;IAED;;;;;OAKG;IACH,SAAS,CAAC,MAAc;QACtB,MAAM,GAAG,GAAG,IAAI,CAAC,EAAE;aAChB,OAAO,CAAC,iDAAiD,CAAC;aAC1D,GAAG,CAAC,MAAM,CAAsC,CAAC;QAEpD,IAAI,CAAC,GAAG,EAAE,CAAC;YACT,OAAO,IAAI,CAAC;QACd,CAAC;QAED,OAAO,IAAI,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAChD,GAAG,CAAC,SAAS,CAAC,UAAU,EACxB,GAAG,CAAC,SAAS,CAAC,UAAU,GAAG,GAAG,CAAC,SAAS,CAAC,UAAU,CACpD,CAAC,CAAC;IACL,CAAC;IAED;;;;OAIG;IACH,YAAY,CAAC,MAAc;QACzB,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,uCAAuC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAErE,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,gCAAgC;YAChC,MAAM,OAAO,GAAG,IAAI,CAAC,EAAE;iBACpB,OAAO,CAAC,6CAA6C,CAAC;iBACtD,GAAG,CAAC,MAAM,CAAkC,CAAC;YAEhD,IAAI,OAAO,EAAE,CAAC;gBACZ,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,yCAAyC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBAC9E,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,uCAAuC,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YACvE,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;OAMG;IACH,MAAM,CACJ,cAA4B,EAC5B,UAA+B,EAAE;QAEjC,MAAM,EAAE,KAAK,GAAG,EAAE,EAAE,QAAQ,GAAG,CAAC,EAAE,GAAG,OAAO,CAAC;QAE7C,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,OAAO,IAAI,CAAC,aAAa,CAAC,cAAc,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QAC7D,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC,gBAAgB,CAAC,cAAc,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QAChE,CAAC;IACH,CAAC;IAED;;OAEG;IACK,aAAa,CACnB,cAA4B,EAC5B,KAAa,EACb,QAAgB;QAEhB,IAAI,CAAC;YACH,MAAM,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC;YAC9D,2EAA2E;YAC3E,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;YAEjD,qBAAqB;YACrB,yEAAyE;YACzE,mEAAmE;YACnE,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;iBACjB,OAAO,CACN;;;;;;;kBAOQ,SAAS;SAClB,CACA;iBACA,GAAG,CAAC,UAAU,CAAiD,CAAC;YAEnE,+DAA+D;YAC/D,OAAO,IAAI;iBACR,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;gBACb,MAAM,EAAE,GAAG,CAAC,OAAO;gBACnB,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,QAAQ,CAAC;aAC9B,CAAC,CAAC;iBACF,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,QAAQ,CAAC,CAAC;QACxC,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,8CAA8C;YAC9C,OAAO,CAAC,IAAI,CACV,uCAAuC,EACvC,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CACvD,CAAC;YACF,OAAO,IAAI,CAAC,gBAAgB,CAAC,cAAc,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QAChE,CAAC;IACH,CAAC;IAED;;OAEG;IACK,gBAAgB,CACtB,cAA4B,EAC5B,KAAa,EACb,QAAgB;QAEhB,kBAAkB;QAClB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACjB,OAAO,CAAC,wCAAwC,CAAC;aACjD,GAAG,EAAmD,CAAC;QAE1D,uCAAuC;QACvC,MAAM,OAAO,GAA6C,EAAE,CAAC;QAE7D,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,SAAS,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAC3D,GAAG,CAAC,SAAS,CAAC,UAAU,EACxB,GAAG,CAAC,SAAS,CAAC,UAAU,GAAG,GAAG,CAAC,SAAS,CAAC,UAAU,CACpD,CAAC,CAAC;YAEH,MAAM,KAAK,GAAG,uBAAY,CAAC,gBAAgB,CAAC,cAAc,EAAE,SAAS,CAAC,CAAC;YAEvE,IAAI,KAAK,IAAI,QAAQ,EAAE,CAAC;gBACtB,OAAO,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC,CAAC;YAC/C,CAAC;QACH,CAAC;QAED,qCAAqC;QACrC,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;IAED;;OAEG;IACH,cAAc;QACZ,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE;aACnB,OAAO,CAAC,uCAAuC,CAAC;aAChD,GAAG,EAAuB,CAAC;QAC9B,OAAO,MAAM,CAAC,KAAK,CAAC;IACtB,CAAC;IAED;;OAEG;IACH,SAAS,CAAC,MAAc;QACtB,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE;aACnB,OAAO,CAAC,iDAAiD,CAAC;aAC1D,GAAG,CAAC,MAAM,CAAC,CAAC;QACf,OAAO,CAAC,CAAC,MAAM,CAAC;IAClB,CAAC;IAED;;OAEG;IACH,iBAAiB;QACf,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACjB,OAAO,CAAC,6BAA6B,CAAC;aACtC,GAAG,EAAgC,CAAC;QACvC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC;IACpC,CAAC;IAED;;OAEG;IACH,KAAK;QACH,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC,GAAG,EAAE,CAAC;QAE7C,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,yBAAyB,CAAC,CAAC,GAAG,EAAE,CAAC;YACjD,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC,GAAG,EAAE,CAAC;QAC/C,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,eAAe;QACb,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;YACrB,OAAO;QACT,CAAC;QAED,mBAAmB;QACnB,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,yBAAyB,CAAC,CAAC,GAAG,EAAE,CAAC;QACjD,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,qBAAqB,CAAC,CAAC,GAAG,EAAE,CAAC;QAE7C,4BAA4B;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE;aACjB,OAAO,CAAC,wCAAwC,CAAC;aACjD,GAAG,EAAmD,CAAC;QAE1D,IAAI,CAAC,EAAE,CAAC,WAAW,CAAC,GAAG,EAAE;YACvB,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;gBACvB,MAAM,SAAS,GAAG,IAAI,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAC3D,GAAG,CAAC,SAAS,CAAC,UAAU,EACxB,GAAG,CAAC,SAAS,CAAC,UAAU,GAAG,GAAG,CAAC,SAAS,CAAC,UAAU,CACpD,CAAC,CAAC;gBACH,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,EAAE,SAAS,CAAC,CAAC;YAC1C,CAAC;QACH,CAAC,CAAC,EAAE,CAAC;IACP,CAAC;CACF;AA7aD,kDA6aC;AAED;;GAEG;AACH,SAAgB,kBAAkB,CAChC,EAAqB,EACrB,SAAkB;IAElB,OAAO,IAAI,mBAAmB,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;AAChD,CAAC"}

package/package.json

@@ -0,0 +1,67 @@
+{
+  "name": "@mduenas/codegraph",
+  "version": "0.4.0",
+  "description": "Supercharge Claude Code with semantic code intelligence. 30% fewer tokens, 25% fewer tool calls, 100% local.",
+  "main": "dist/index.js",
+  "types": "dist/index.d.ts",
+  "bin": {
+    "codegraph": "./dist/bin/codegraph.js"
+  },
+  "files": [
+    "dist",
+    "scripts",
+    "README.md"
+  ],
+  "scripts": {
+    "build": "tsc && npm run copy-assets",
+    "postinstall": "node scripts/postinstall.js",
+    "copy-assets": "cp -r src/extraction/queries dist/extraction/ && cp src/db/schema.sql dist/db/",
+    "dev": "tsc --watch",
+    "cli": "npm run build && node dist/bin/codegraph.js",
+    "test": "vitest run",
+    "test:watch": "vitest",
+    "test:eval": "vitest run __tests__/evaluation/",
+    "eval": "npm run build && npx tsx __tests__/evaluation/runner.ts",
+    "clean": "rm -rf dist"
+  },
+  "keywords": [
+    "code-intelligence",
+    "knowledge-graph",
+    "static-analysis",
+    "semantic-search"
+  ],
+  "author": "",
+  "license": "MIT",
+  "dependencies": {
+    "@xenova/transformers": "^2.17.0",
+    "better-sqlite3": "^11.0.0",
+    "commander": "^14.0.2",
+    "figlet": "^1.8.0",
+    "sqlite-vss": "^0.1.2",
+    "tree-sitter": "^0.22.4",
+    "tree-sitter-c": "^0.23.4",
+    "tree-sitter-c-sharp": "^0.23.1",
+    "tree-sitter-cpp": "^0.23.4",
+    "tree-sitter-go": "^0.23.4",
+    "tree-sitter-java": "^0.23.5",
+    "tree-sitter-javascript": "^0.23.1",
+    "tree-sitter-kotlin": "^0.3.8",
+    "tree-sitter-liquid": "github:hankthetank27/tree-sitter-liquid",
+    "tree-sitter-php": "^0.23.11",
+    "tree-sitter-python": "^0.23.6",
+    "tree-sitter-ruby": "^0.23.1",
+    "tree-sitter-rust": "^0.23.2",
+    "tree-sitter-swift": "^0.7.1",
+    "tree-sitter-typescript": "^0.23.2"
+  },
+  "devDependencies": {
+    "@types/better-sqlite3": "^7.6.0",
+    "@types/figlet": "^1.5.8",
+    "@types/node": "^20.19.30",
+    "typescript": "^5.0.0",
+    "vitest": "^2.0.0"
+  },
+  "engines": {
+    "node": ">=18.0.0"
+  }
+}

package/scripts/postinstall.js

@@ -0,0 +1,68 @@
+#!/usr/bin/env node
+/**
+ * Postinstall script - downloads the embedding model to ~/.codegraph/models
+ * This runs after `npm install` or `npx @colbymchenry/codegraph`
+ */
+const { existsSync, mkdirSync } = require('fs');
+const { join } = require('path');
+const { homedir } = require('os');
+
+const CODEGRAPH_DIR = join(homedir(), '.codegraph');
+const MODELS_DIR = join(CODEGRAPH_DIR, 'models');
+const MODEL_ID = 'nomic-ai/nomic-embed-text-v1.5';
+
+async function downloadModel() {
+  // Ensure directories exist
+  if (!existsSync(CODEGRAPH_DIR)) {
+    mkdirSync(CODEGRAPH_DIR, { recursive: true });
+  }
+  if (!existsSync(MODELS_DIR)) {
+    mkdirSync(MODELS_DIR, { recursive: true });
+  }
+
+  // Check if model is already cached
+  const modelCachePath = join(MODELS_DIR, MODEL_ID.replace('/', '/'));
+  if (existsSync(modelCachePath)) {
+    console.log('Embedding model already downloaded.');
+    return;
+  }
+
+  console.log('Downloading embedding model (~130MB)...');
+  console.log('This is a one-time download for semantic code search.\n');
+
+  try {
+    // Dynamic import for @xenova/transformers (ESM-only package)
+    const { pipeline, env } = await import('@xenova/transformers');
+
+    // Configure cache directory
+    env.cacheDir = MODELS_DIR;
+
+    // Download with progress
+    await pipeline('feature-extraction', MODEL_ID, {
+      progress_callback: (progress) => {
+        if (progress.status === 'progress' && progress.file && progress.progress !== undefined) {
+          const fileName = progress.file.split('/').pop();
+          const percent = Math.round(progress.progress);
+          process.stdout.write(`\rDownloading ${fileName}... ${percent}%   `);
+        } else if (progress.status === 'done') {
+          process.stdout.write('\n');
+        }
+      },
+    });
+
+    console.log('\nEmbedding model ready!');
+  } catch (error) {
+    // Don't fail the install if model download fails
+    // User can still use codegraph without semantic search
+    console.log('\nNote: Could not download embedding model.');
+    console.log('Semantic search will download it on first use.');
+    if (process.env.DEBUG) {
+      console.error(error);
+    }
+  }
+}
+
+downloadModel().catch(() => {
+  // Silent exit - don't break npm install
+  process.exit(0);
+});