mcard-js 2.0.0 → 2.1.0

package/dist/rag/graph/store.js

@@ -0,0 +1,504 @@
+/**
+ * Graph Store
+ *
+ * SQLite-based knowledge graph storage with traversal capabilities.
+ *
+ * Mirrors Python: mcard/rag/graph/store.py
+ */
+import Database from 'better-sqlite3';
+import { initGraphSchemas } from '../../storage/schema';
+// ─────────────────────────────────────────────────────────────────────────────
+// GraphStore Class
+// ─────────────────────────────────────────────────────────────────────────────
+/**
+ * SQLite-based storage for knowledge graph.
+ *
+ * Features:
+ * - Entity and relationship storage
+ * - Graph traversal (BFS)
+ * - Multi-hop pathfinding
+ * - Community management
+ *
+ * Usage:
+ *     const store = new GraphStore('graph.db');
+ *
+ *     // Add entities
+ *     const entityId = store.addEntity(entity, sourceHash);
+ *
+ *     // Add relationships
+ *     store.addRelationship(sourceId, targetId, 'relates_to', sourceHash);
+ *
+ *     // Find related entities
+ *     const related = store.findRelated('MCard', 2);
+ */
+export class GraphStore {
+    db;
+    dbPath;
+    constructor(dbPath = ':memory:') {
+        this.dbPath = dbPath;
+        this.db = this.initDatabase();
+    }
+    initDatabase() {
+        const db = new Database(this.dbPath);
+        // Create all graph tables using SSoT schema
+        initGraphSchemas(db);
+        console.debug(`Initialized graph store at ${this.dbPath}`);
+        return db;
+    }
+    // ─────────────────────────────────────────────────────────────────────────
+    // Entity Operations
+    // ─────────────────────────────────────────────────────────────────────────
+    /**
+     * Add an entity to the graph.
+     *
+     * @param entity - Entity to add
+     * @param sourceHash - Source MCard hash
+     * @param embedding - Optional entity embedding
+     * @returns Entity ID
+     */
+    addEntity(entity, sourceHash, embedding) {
+        const now = new Date().toISOString();
+        try {
+            const stmt = this.db.prepare(`
+                INSERT INTO graph_entities (name, type, description, source_hash, embedding, created_at)
+                VALUES (?, ?, ?, ?, ?, ?)
+            `);
+            const result = stmt.run(entity.name, entity.type, entity.description, sourceHash, embedding || null, now);
+            return result.lastInsertRowid;
+        }
+        catch (error) {
+            // Entity already exists, get its ID
+            if (error.code === 'SQLITE_CONSTRAINT_UNIQUE' || error.message?.includes('UNIQUE')) {
+                const stmt = this.db.prepare(`
+                    SELECT id FROM graph_entities 
+                    WHERE name = ? AND type = ? AND source_hash = ?
+                `);
+                const row = stmt.get(entity.name, entity.type, sourceHash);
+                return row?.id ?? -1;
+            }
+            throw error;
+        }
+    }
+    /**
+     * Get entity by name (case-insensitive)
+     */
+    getEntityByName(name) {
+        const stmt = this.db.prepare(`
+            SELECT id, name, type, description, source_hash, created_at
+            FROM graph_entities
+            WHERE LOWER(name) = LOWER(?)
+            LIMIT 1
+        `);
+        const row = stmt.get(name);
+        if (row) {
+            return {
+                id: row.id,
+                name: row.name,
+                type: row.type,
+                description: row.description,
+                sourceHash: row.source_hash,
+                createdAt: row.created_at,
+            };
+        }
+        return null;
+    }
+    /**
+     * Get entity by ID
+     */
+    getEntityById(entityId) {
+        const stmt = this.db.prepare(`
+            SELECT id, name, type, description, source_hash, created_at
+            FROM graph_entities
+            WHERE id = ?
+        `);
+        const row = stmt.get(entityId);
+        if (row) {
+            return {
+                id: row.id,
+                name: row.name,
+                type: row.type,
+                description: row.description,
+                sourceHash: row.source_hash,
+                createdAt: row.created_at,
+            };
+        }
+        return null;
+    }
+    /**
+     * Search entities by name pattern
+     */
+    searchEntities(query, typeFilter, limit = 10) {
+        let stmt;
+        let rows;
+        if (typeFilter) {
+            stmt = this.db.prepare(`
+                SELECT id, name, type, description, source_hash
+                FROM graph_entities
+                WHERE name LIKE ? AND type = ?
+                LIMIT ?
+            `);
+            rows = stmt.all(`%${query}%`, typeFilter, limit);
+        }
+        else {
+            stmt = this.db.prepare(`
+                SELECT id, name, type, description, source_hash
+                FROM graph_entities
+                WHERE name LIKE ?
+                LIMIT ?
+            `);
+            rows = stmt.all(`%${query}%`, limit);
+        }
+        return rows.map(r => ({
+            id: r.id,
+            name: r.name,
+            type: r.type,
+            description: r.description,
+            sourceHash: r.source_hash,
+        }));
+    }
+    /**
+     * Get all entities from a source MCard
+     */
+    getEntitiesBySource(sourceHash) {
+        const stmt = this.db.prepare(`
+            SELECT id, name, type, description
+            FROM graph_entities
+            WHERE source_hash = ?
+        `);
+        const rows = stmt.all(sourceHash);
+        return rows.map(r => ({
+            id: r.id,
+            name: r.name,
+            type: r.type,
+            description: r.description,
+            sourceHash: sourceHash,
+        }));
+    }
+    // ─────────────────────────────────────────────────────────────────────────
+    // Relationship Operations
+    // ─────────────────────────────────────────────────────────────────────────
+    /**
+     * Add a relationship between entities.
+     *
+     * @param sourceEntityId - Source entity ID
+     * @param targetEntityId - Target entity ID
+     * @param relationship - Relationship type/verb
+     * @param sourceHash - Source MCard hash
+     * @param description - Optional description
+     * @param weight - Relationship weight
+     * @returns Relationship ID
+     */
+    addRelationship(sourceEntityId, targetEntityId, relationship, sourceHash, description = '', weight = 1.0) {
+        const now = new Date().toISOString();
+        try {
+            const stmt = this.db.prepare(`
+                INSERT INTO graph_relationships 
+                (source_entity_id, target_entity_id, relationship, description, weight, source_hash, created_at)
+                VALUES (?, ?, ?, ?, ?, ?, ?)
+            `);
+            const result = stmt.run(sourceEntityId, targetEntityId, relationship, description, weight, sourceHash, now);
+            return result.lastInsertRowid;
+        }
+        catch (error) {
+            // Relationship already exists
+            if (error.code === 'SQLITE_CONSTRAINT_UNIQUE' || error.message?.includes('UNIQUE')) {
+                return -1;
+            }
+            throw error;
+        }
+    }
+    /**
+     * Get outgoing relationships from an entity
+     */
+    getRelationshipsFrom(entityId) {
+        const stmt = this.db.prepare(`
+            SELECT r.id, r.relationship, r.description, r.weight,
+                   e.id as target_id, e.name as target_name, e.type as target_type
+            FROM graph_relationships r
+            JOIN graph_entities e ON r.target_entity_id = e.id
+            WHERE r.source_entity_id = ?
+        `);
+        const rows = stmt.all(entityId);
+        return rows.map(r => ({
+            relId: r.id,
+            relationship: r.relationship,
+            description: r.description,
+            weight: r.weight,
+            targetId: r.target_id,
+            targetName: r.target_name,
+            targetType: r.target_type,
+        }));
+    }
+    /**
+     * Get incoming relationships to an entity
+     */
+    getRelationshipsTo(entityId) {
+        const stmt = this.db.prepare(`
+            SELECT r.id, r.relationship, r.description, r.weight,
+                   e.id as source_id, e.name as source_name, e.type as source_type
+            FROM graph_relationships r
+            JOIN graph_entities e ON r.source_entity_id = e.id
+            WHERE r.target_entity_id = ?
+        `);
+        const rows = stmt.all(entityId);
+        return rows.map(r => ({
+            relId: r.id,
+            relationship: r.relationship,
+            description: r.description,
+            weight: r.weight,
+            sourceId: r.source_id,
+            sourceName: r.source_name,
+            sourceType: r.source_type,
+        }));
+    }
+    // ─────────────────────────────────────────────────────────────────────────
+    // Community Operations
+    // ─────────────────────────────────────────────────────────────────────────
+    /**
+     * Add a community summary
+     */
+    addCommunity(title, summary, memberIds, level = 0, parentId, embedding) {
+        const now = new Date().toISOString();
+        const stmt = this.db.prepare(`
+            INSERT INTO graph_communities 
+            (title, summary, member_entity_ids, level, parent_community_id, embedding, created_at)
+            VALUES (?, ?, ?, ?, ?, ?, ?)
+        `);
+        const result = stmt.run(title, summary, JSON.stringify(memberIds), level, parentId ?? null, embedding ?? null, now);
+        return result.lastInsertRowid;
+    }
+    /**
+     * Get communities by level
+     */
+    getCommunities(level = 0) {
+        const stmt = this.db.prepare(`
+            SELECT id, title, summary, member_entity_ids, level
+            FROM graph_communities
+            WHERE level = ?
+        `);
+        const rows = stmt.all(level);
+        return rows.map(r => ({
+            id: r.id,
+            title: r.title,
+            summary: r.summary,
+            memberIds: r.member_entity_ids ? JSON.parse(r.member_entity_ids) : [],
+            level: r.level,
+        }));
+    }
+    // ─────────────────────────────────────────────────────────────────────────
+    // Graph Traversal
+    // ─────────────────────────────────────────────────────────────────────────
+    /**
+     * Find entities within N hops of a given entity.
+     *
+     * @param entityName - Starting entity name
+     * @param hops - Maximum traversal depth
+     * @param direction - 'outgoing', 'incoming', or 'both'
+     * @returns List of related entities with their paths
+     */
+    findRelated(entityName, hops = 2, direction = 'both') {
+        // Find starting entity
+        const start = this.getEntityByName(entityName);
+        if (!start)
+            return [];
+        const visited = new Set([start.id]);
+        const results = [];
+        const frontier = [[start.id, 0, [start.name]]];
+        while (frontier.length > 0) {
+            const [currentId, depth, path] = frontier.shift();
+            if (depth >= hops)
+                continue;
+            // Get adjacent entities
+            const neighbors = [];
+            if (direction === 'outgoing' || direction === 'both') {
+                for (const rel of this.getRelationshipsFrom(currentId)) {
+                    neighbors.push([
+                        rel.targetId,
+                        rel.targetName,
+                        rel.relationship,
+                        'outgoing'
+                    ]);
+                }
+            }
+            if (direction === 'incoming' || direction === 'both') {
+                for (const rel of this.getRelationshipsTo(currentId)) {
+                    neighbors.push([
+                        rel.sourceId,
+                        rel.sourceName,
+                        rel.relationship,
+                        'incoming'
+                    ]);
+                }
+            }
+            for (const [neighborId, neighborName, rel, dir] of neighbors) {
+                if (!visited.has(neighborId)) {
+                    visited.add(neighborId);
+                    const newPath = [...path, `--${rel}->`, neighborName];
+                    const entity = this.getEntityById(neighborId);
+                    if (entity) {
+                        results.push({
+                            entity,
+                            depth: depth + 1,
+                            path: newPath,
+                            relationship: rel,
+                        });
+                    }
+                    frontier.push([neighborId, depth + 1, newPath]);
+                }
+            }
+        }
+        return results;
+    }
+    /**
+     * Find shortest path between two entities.
+     *
+     * @param sourceName - Starting entity name
+     * @param targetName - Target entity name
+     * @param maxDepth - Maximum path length
+     * @returns List of entity names in path, or null if no path
+     */
+    findPath(sourceName, targetName, maxDepth = 4) {
+        const source = this.getEntityByName(sourceName);
+        const target = this.getEntityByName(targetName);
+        if (!source || !target)
+            return null;
+        if (source.id === target.id)
+            return [sourceName];
+        // BFS for shortest path
+        const visited = new Set([source.id]);
+        const queue = [[source.id, [source.name]]];
+        while (queue.length > 0) {
+            const [currentId, path] = queue.shift();
+            if (path.length > maxDepth)
+                continue;
+            for (const rel of this.getRelationshipsFrom(currentId)) {
+                const neighborId = rel.targetId;
+                if (neighborId === target.id) {
+                    return [...path, `--${rel.relationship}->`, targetName];
+                }
+                if (!visited.has(neighborId)) {
+                    visited.add(neighborId);
+                    queue.push([
+                        neighborId,
+                        [...path, `--${rel.relationship}->`, rel.targetName]
+                    ]);
+                }
+            }
+        }
+        return null;
+    }
+    // ─────────────────────────────────────────────────────────────────────────
+    // Extraction Tracking
+    // ─────────────────────────────────────────────────────────────────────────
+    /**
+     * Mark a source as having been extracted
+     */
+    markExtracted(sourceHash, entityCount, relCount) {
+        const now = new Date().toISOString();
+        const stmt = this.db.prepare(`
+            INSERT OR REPLACE INTO graph_extractions 
+            (hash, entity_count, relationship_count, extracted_at)
+            VALUES (?, ?, ?, ?)
+        `);
+        stmt.run(sourceHash, entityCount, relCount, now);
+    }
+    /**
+     * Check if a source has been extracted
+     */
+    isExtracted(sourceHash) {
+        const stmt = this.db.prepare('SELECT 1 FROM graph_extractions WHERE hash = ?');
+        return stmt.get(sourceHash) !== undefined;
+    }
+    // ─────────────────────────────────────────────────────────────────────────
+    // Statistics
+    // ─────────────────────────────────────────────────────────────────────────
+    countEntities() {
+        const stmt = this.db.prepare('SELECT COUNT(*) as count FROM graph_entities');
+        return stmt.get().count;
+    }
+    countRelationships() {
+        const stmt = this.db.prepare('SELECT COUNT(*) as count FROM graph_relationships');
+        return stmt.get().count;
+    }
+    countExtractions() {
+        const stmt = this.db.prepare('SELECT COUNT(*) as count FROM graph_extractions');
+        return stmt.get().count;
+    }
+    getEntityTypes() {
+        const stmt = this.db.prepare(`
+            SELECT type, COUNT(*) as count FROM graph_entities
+            GROUP BY type
+            ORDER BY COUNT(*) DESC
+        `);
+        const rows = stmt.all();
+        const result = {};
+        for (const row of rows) {
+            result[row.type] = row.count;
+        }
+        return result;
+    }
+    getStats() {
+        return {
+            entityCount: this.countEntities(),
+            relationshipCount: this.countRelationships(),
+            extractionCount: this.countExtractions(),
+            entityTypes: this.getEntityTypes(),
+        };
+    }
+    /**
+     * Clear all graph data
+     */
+    clear() {
+        this.db.exec('DELETE FROM graph_relationships');
+        this.db.exec('DELETE FROM graph_entities');
+        this.db.exec('DELETE FROM graph_communities');
+        this.db.exec('DELETE FROM graph_extractions');
+        console.info('Graph store cleared');
+    }
+    /**
+     * Close the database connection
+     */
+    close() {
+        this.db.close();
+    }
+}
+// ─────────────────────────────────────────────────────────────────────────────
+// Batch Operations
+// ─────────────────────────────────────────────────────────────────────────────
+/**
+ * Store an extraction result in the graph.
+ *
+ * @param store - GraphStore instance
+ * @param result - ExtractionResult from GraphExtractor
+ * @param sourceHash - Source MCard hash
+ * @returns Tuple of [entityCount, relationshipCount] stored
+ */
+export function storeExtractionResult(store, result, sourceHash) {
+    if (!result.success) {
+        return [0, 0];
+    }
+    const entityMap = {};
+    // Add entities
+    for (const entity of result.entities) {
+        const entityId = store.addEntity(entity, sourceHash);
+        if (entityId > 0) {
+            entityMap[entity.name.toLowerCase()] = entityId;
+        }
+    }
+    // Add relationships
+    let relCount = 0;
+    for (const rel of result.relationships) {
+        const sourceId = entityMap[rel.source.toLowerCase()];
+        const targetId = entityMap[rel.target.toLowerCase()];
+        if (sourceId && targetId) {
+            const relId = store.addRelationship(sourceId, targetId, rel.relationship, sourceHash, rel.description);
+            if (relId > 0) {
+                relCount++;
+            }
+        }
+    }
+    // Mark as extracted
+    store.markExtracted(sourceHash, Object.keys(entityMap).length, relCount);
+    return [Object.keys(entityMap).length, relCount];
+}
+//# sourceMappingURL=store.js.map

package/dist/rag/graph/store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"store.js","sourceRoot":"","sources":["../../../src/rag/graph/store.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AACtC,OAAO,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAyDxD,gFAAgF;AAChF,mBAAmB;AACnB,gFAAgF;AAEhF;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,OAAO,UAAU;IACX,EAAE,CAAoB;IACrB,MAAM,CAAS;IAExB,YAAY,SAAiB,UAAU;QACnC,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,CAAC,EAAE,GAAG,IAAI,CAAC,YAAY,EAAE,CAAC;IAClC,CAAC;IAEO,YAAY;QAChB,MAAM,EAAE,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAErC,4CAA4C;QAC5C,gBAAgB,CAAC,EAAE,CAAC,CAAC;QAErB,OAAO,CAAC,KAAK,CAAC,8BAA8B,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QAC3D,OAAO,EAAE,CAAC;IACd,CAAC;IAED,4EAA4E;IAC5E,oBAAoB;IACpB,4EAA4E;IAE5E;;;;;;;OAOG;IACH,SAAS,CACL,MAAc,EACd,UAAkB,EAClB,SAAsB;QAEtB,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAErC,IAAI,CAAC;YACD,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;aAG5B,CAAC,CAAC;YAEH,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CACnB,MAAM,CAAC,IAAI,EACX,MAAM,CAAC,IAAI,EACX,MAAM,CAAC,WAAW,EAClB,UAAU,EACV,SAAS,IAAI,IAAI,EACjB,GAAG,CACN,CAAC;YAEF,OAAO,MAAM,CAAC,eAAyB,CAAC;QAE5C,CAAC;QAAC,OAAO,KAAU,EAAE,CAAC;YAClB,oCAAoC;YACpC,IAAI,KAAK,CAAC,IAAI,KAAK,0BAA0B,IAAI,KAAK,CAAC,OAAO,EAAE,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACjF,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;iBAG5B,CAAC,CAAC;gBACH,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,IAAI,EAAE,UAAU,CAA+B,CAAC;gBACzF,OAAO,GAAG,EAAE,EAAE,IAAI,CAAC,CAAC,CAAC;YACzB,CAAC;YACD,MAAM,KAAK,CAAC;QAChB,CAAC;IACL,CAAC;IAED;;OAEG;IACH,eAAe,CAAC,IAAY;QACxB,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;SAK5B,CAAC,CAAC;QAEH,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAQ,CAAC;QAClC,IAAI,GAAG,EAAE,CAAC;YACN,OAAO;gBACH,EAAE,EAAE,GAAG,CAAC,EAAE;gBACV,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,WAAW,EAAE,GAAG,CAAC,WAAW;gBAC5B,UAAU,EAAE,GAAG,CAAC,WAAW;gBAC3B,SAAS,EAAE,GAAG,CAAC,UAAU;aAC5B,CAAC;QACN,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,QAAgB;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;SAI5B,CAAC,CAAC;QAEH,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAQ,CAAC;QACtC,IAAI,GAAG,EAAE,CAAC;YACN,OAAO;gBACH,EAAE,EAAE,GAAG,CAAC,EAAE;gBACV,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,WAAW,EAAE,GAAG,CAAC,WAAW;gBAC5B,UAAU,EAAE,GAAG,CAAC,WAAW;gBAC3B,SAAS,EAAE,GAAG,CAAC,UAAU;aAC5B,CAAC;QACN,CAAC;QACD,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,cAAc,CACV,KAAa,EACb,UAAmB,EACnB,QAAgB,EAAE;QAElB,IAAI,IAAI,CAAC;QACT,IAAI,IAAI,CAAC;QAET,IAAI,UAAU,EAAE,CAAC;YACb,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;aAKtB,CAAC,CAAC;YACH,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,UAAU,EAAE,KAAK,CAAU,CAAC;QAC9D,CAAC;aAAM,CAAC;YACJ,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;aAKtB,CAAC,CAAC;YACH,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,KAAK,GAAG,EAAE,KAAK,CAAU,CAAC;QAClD,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAClB,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,UAAU,EAAE,CAAC,CAAC,WAAW;SAC5B,CAAC,CAAC,CAAC;IACR,CAAC;IAED;;OAEG;IACH,mBAAmB,CAAC,UAAkB;QAClC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;SAI5B,CAAC,CAAC;QAEH,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,UAAU,CAAU,CAAC;QAC3C,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAClB,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,UAAU,EAAE,UAAU;SACzB,CAAC,CAAC,CAAC;IACR,CAAC;IAED,4EAA4E;IAC5E,0BAA0B;IAC1B,4EAA4E;IAE5E;;;;;;;;;;OAUG;IACH,eAAe,CACX,cAAsB,EACtB,cAAsB,EACtB,YAAoB,EACpB,UAAkB,EAClB,cAAsB,EAAE,EACxB,SAAiB,GAAG;QAEpB,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAErC,IAAI,CAAC;YACD,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;aAI5B,CAAC,CAAC;YAEH,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CACnB,cAAc,EACd,cAAc,EACd,YAAY,EACZ,WAAW,EACX,MAAM,EACN,UAAU,EACV,GAAG,CACN,CAAC;YAEF,OAAO,MAAM,CAAC,eAAyB,CAAC;QAE5C,CAAC;QAAC,OAAO,KAAU,EAAE,CAAC;YAClB,8BAA8B;YAC9B,IAAI,KAAK,CAAC,IAAI,KAAK,0BAA0B,IAAI,KAAK,CAAC,OAAO,EAAE,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACjF,OAAO,CAAC,CAAC,CAAC;YACd,CAAC;YACD,MAAM,KAAK,CAAC;QAChB,CAAC;IACL,CAAC;IAED;;OAEG;IACH,oBAAoB,CAAC,QAAgB;QACjC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;SAM5B,CAAC,CAAC;QAEH,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAU,CAAC;QACzC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAClB,KAAK,EAAE,CAAC,CAAC,EAAE;YACX,YAAY,EAAE,CAAC,CAAC,YAAY;YAC5B,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,QAAQ,EAAE,CAAC,CAAC,SAAS;YACrB,UAAU,EAAE,CAAC,CAAC,WAAW;YACzB,UAAU,EAAE,CAAC,CAAC,WAAW;SAC5B,CAAC,CAAC,CAAC;IACR,CAAC;IAED;;OAEG;IACH,kBAAkB,CAAC,QAAgB;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;;;SAM5B,CAAC,CAAC;QAEH,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAU,CAAC;QACzC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAClB,KAAK,EAAE,CAAC,CAAC,EAAE;YACX,YAAY,EAAE,CAAC,CAAC,YAAY;YAC5B,WAAW,EAAE,CAAC,CAAC,WAAW;YAC1B,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,QAAQ,EAAE,CAAC,CAAC,SAAS;YACrB,UAAU,EAAE,CAAC,CAAC,WAAW;YACzB,UAAU,EAAE,CAAC,CAAC,WAAW;SAC5B,CAAC,CAAC,CAAC;IACR,CAAC;IAED,4EAA4E;IAC5E,uBAAuB;IACvB,4EAA4E;IAE5E;;OAEG;IACH,YAAY,CACR,KAAa,EACb,OAAe,EACf,SAAmB,EACnB,QAAgB,CAAC,EACjB,QAAiB,EACjB,SAAsB;QAEtB,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAErC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;SAI5B,CAAC,CAAC;QAEH,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CACnB,KAAK,EACL,OAAO,EACP,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,EACzB,KAAK,EACL,QAAQ,IAAI,IAAI,EAChB,SAAS,IAAI,IAAI,EACjB,GAAG,CACN,CAAC;QAEF,OAAO,MAAM,CAAC,eAAyB,CAAC;IAC5C,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,QAAgB,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;SAI5B,CAAC,CAAC;QAEH,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,CAAU,CAAC;QACtC,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAClB,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,KAAK,EAAE,CAAC,CAAC,KAAK;YACd,OAAO,EAAE,CAAC,CAAC,OAAO;YAClB,SAAS,EAAE,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,iBAAiB,CAAC,CAAC,CAAC,CAAC,EAAE;YACrE,KAAK,EAAE,CAAC,CAAC,KAAK;SACjB,CAAC,CAAC,CAAC;IACR,CAAC;IAED,4EAA4E;IAC5E,kBAAkB;IAClB,4EAA4E;IAE5E;;;;;;;OAOG;IACH,WAAW,CACP,UAAkB,EAClB,OAAe,CAAC,EAChB,YAA8C,MAAM;QAEpD,uBAAuB;QACvB,MAAM,KAAK,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QAC/C,IAAI,CAAC,KAAK;YAAE,OAAO,EAAE,CAAC;QAEtB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;QAC5C,MAAM,OAAO,GAAoB,EAAE,CAAC;QACpC,MAAM,QAAQ,GAAsC,CAAC,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAElF,OAAO,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACzB,MAAM,CAAC,SAAS,EAAE,KAAK,EAAE,IAAI,CAAC,GAAG,QAAQ,CAAC,KAAK,EAAG,CAAC;YAEnD,IAAI,KAAK,IAAI,IAAI;gBAAE,SAAS;YAE5B,wBAAwB;YACxB,MAAM,SAAS,GAA4C,EAAE,CAAC;YAE9D,IAAI,SAAS,KAAK,UAAU,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;gBACnD,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,EAAE,CAAC;oBACrD,SAAS,CAAC,IAAI,CAAC;wBACX,GAAG,CAAC,QAAS;wBACb,GAAG,CAAC,UAAW;wBACf,GAAG,CAAC,YAAY;wBAChB,UAAU;qBACb,CAAC,CAAC;gBACP,CAAC;YACL,CAAC;YAED,IAAI,SAAS,KAAK,UAAU,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;gBACnD,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,kBAAkB,CAAC,SAAS,CAAC,EAAE,CAAC;oBACnD,SAAS,CAAC,IAAI,CAAC;wBACX,GAAG,CAAC,QAAS;wBACb,GAAG,CAAC,UAAW;wBACf,GAAG,CAAC,YAAY;wBAChB,UAAU;qBACb,CAAC,CAAC;gBACP,CAAC;YACL,CAAC;YAED,KAAK,MAAM,CAAC,UAAU,EAAE,YAAY,EAAE,GAAG,EAAE,GAAG,CAAC,IAAI,SAAS,EAAE,CAAC;gBAC3D,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC3B,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;oBACxB,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,EAAE,KAAK,GAAG,IAAI,EAAE,YAAY,CAAC,CAAC;oBAEtD,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,UAAU,CAAC,CAAC;oBAC9C,IAAI,MAAM,EAAE,CAAC;wBACT,OAAO,CAAC,IAAI,CAAC;4BACT,MAAM;4BACN,KAAK,EAAE,KAAK,GAAG,CAAC;4BAChB,IAAI,EAAE,OAAO;4BACb,YAAY,EAAE,GAAG;yBACpB,CAAC,CAAC;oBACP,CAAC;oBAED,QAAQ,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,KAAK,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC,CAAC;gBACpD,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,OAAO,CAAC;IACnB,CAAC;IAED;;;;;;;OAOG;IACH,QAAQ,CACJ,UAAkB,EAClB,UAAkB,EAClB,WAAmB,CAAC;QAEpB,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QAChD,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,UAAU,CAAC,CAAC;QAEhD,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM;YAAE,OAAO,IAAI,CAAC;QACpC,IAAI,MAAM,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE;YAAE,OAAO,CAAC,UAAU,CAAC,CAAC;QAEjD,wBAAwB;QACxB,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7C,MAAM,KAAK,GAA8B,CAAC,CAAC,MAAM,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAEtE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtB,MAAM,CAAC,SAAS,EAAE,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAEzC,IAAI,IAAI,CAAC,MAAM,GAAG,QAAQ;gBAAE,SAAS;YAErC,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,oBAAoB,CAAC,SAAS,CAAC,EAAE,CAAC;gBACrD,MAAM,UAAU,GAAG,GAAG,CAAC,QAAS,CAAC;gBAEjC,IAAI,UAAU,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC;oBAC3B,OAAO,CAAC,GAAG,IAAI,EAAE,KAAK,GAAG,CAAC,YAAY,IAAI,EAAE,UAAU,CAAC,CAAC;gBAC5D,CAAC;gBAED,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC3B,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;oBACxB,KAAK,CAAC,IAAI,CAAC;wBACP,UAAU;wBACV,CAAC,GAAG,IAAI,EAAE,KAAK,GAAG,CAAC,YAAY,IAAI,EAAE,GAAG,CAAC,UAAW,CAAC;qBACxD,CAAC,CAAC;gBACP,CAAC;YACL,CAAC;QACL,CAAC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,4EAA4E;IAC5E,sBAAsB;IACtB,4EAA4E;IAE5E;;OAEG;IACH,aAAa,CAAC,UAAkB,EAAE,WAAmB,EAAE,QAAgB;QACnE,MAAM,GAAG,GAAG,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAErC,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;SAI5B,CAAC,CAAC;QAEH,IAAI,CAAC,GAAG,CAAC,UAAU,EAAE,WAAW,EAAE,QAAQ,EAAE,GAAG,CAAC,CAAC;IACrD,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,UAAkB;QAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,gDAAgD,CAAC,CAAC;QAC/E,OAAO,IAAI,CAAC,GAAG,CAAC,UAAU,CAAC,KAAK,SAAS,CAAC;IAC9C,CAAC;IAED,4EAA4E;IAC5E,aAAa;IACb,4EAA4E;IAE5E,aAAa;QACT,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,8CAA8C,CAAC,CAAC;QAC7E,OAAQ,IAAI,CAAC,GAAG,EAAwB,CAAC,KAAK,CAAC;IACnD,CAAC;IAED,kBAAkB;QACd,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,mDAAmD,CAAC,CAAC;QAClF,OAAQ,IAAI,CAAC,GAAG,EAAwB,CAAC,KAAK,CAAC;IACnD,CAAC;IAED,gBAAgB;QACZ,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,iDAAiD,CAAC,CAAC;QAChF,OAAQ,IAAI,CAAC,GAAG,EAAwB,CAAC,KAAK,CAAC;IACnD,CAAC;IAED,cAAc;QACV,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC;;;;SAI5B,CAAC,CAAC;QAEH,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAA4C,CAAC;QAClE,MAAM,MAAM,GAA2B,EAAE,CAAC;QAC1C,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACrB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC;QACjC,CAAC;QACD,OAAO,MAAM,CAAC;IAClB,CAAC;IAED,QAAQ;QACJ,OAAO;YACH,WAAW,EAAE,IAAI,CAAC,aAAa,EAAE;YACjC,iBAAiB,EAAE,IAAI,CAAC,kBAAkB,EAAE;YAC5C,eAAe,EAAE,IAAI,CAAC,gBAAgB,EAAE;YACxC,WAAW,EAAE,IAAI,CAAC,cAAc,EAAE;SACrC,CAAC;IACN,CAAC;IAED;;OAEG;IACH,KAAK;QACD,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;QAChD,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,4BAA4B,CAAC,CAAC;QAC3C,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,+BAA+B,CAAC,CAAC;QAC9C,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,+BAA+B,CAAC,CAAC;QAC9C,OAAO,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;IACxC,CAAC;IAED;;OAEG;IACH,KAAK;QACD,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;IACpB,CAAC;CACJ;AAED,gFAAgF;AAChF,mBAAmB;AACnB,gFAAgF;AAEhF;;;;;;;GAOG;AACH,MAAM,UAAU,qBAAqB,CACjC,KAAiB,EACjB,MAAwB,EACxB,UAAkB;IAElB,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QAClB,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,MAAM,SAAS,GAA2B,EAAE,CAAC;IAE7C,eAAe;IACf,KAAK,MAAM,MAAM,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACnC,MAAM,QAAQ,GAAG,KAAK,CAAC,SAAS,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QACrD,IAAI,QAAQ,GAAG,CAAC,EAAE,CAAC;YACf,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,GAAG,QAAQ,CAAC;QACpD,CAAC;IACL,CAAC;IAED,oBAAoB;IACpB,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC;QACrC,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;QACrD,MAAM,QAAQ,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,WAAW,EAAE,CAAC,CAAC;QAErD,IAAI,QAAQ,IAAI,QAAQ,EAAE,CAAC;YACvB,MAAM,KAAK,GAAG,KAAK,CAAC,eAAe,CAC/B,QAAQ,EACR,QAAQ,EACR,GAAG,CAAC,YAAY,EAChB,UAAU,EACV,GAAG,CAAC,WAAW,CAClB,CAAC;YACF,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;gBACZ,QAAQ,EAAE,CAAC;YACf,CAAC;QACL,CAAC;IACL,CAAC;IAED,oBAAoB;IACpB,KAAK,CAAC,aAAa,CAAC,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;IAEzE,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;AACrD,CAAC"}

package/dist/rag/index.d.ts

@@ -0,0 +1,19 @@
+/**
+ * RAG (Retrieval-Augmented Generation) Module
+ *
+ * Exports core RAG components for MCard including:
+ * - Persistent Indexing
+ * - Semantic Search (Vector Store)
+ * - Knowledge Graph (Nodes, Edges, Communities)
+ * - Embeddings (Text, Vision)
+ * - Semantic Versioning & Handle Management
+ */
+export * from './PersistentIndexer';
+export * from './graph/store';
+export * from './graph/extractor';
+export * from './graph/community';
+export * from './embeddings/VisionEmbeddingProvider';
+export * from '../storage/VectorStore';
+export * from './HandleVectorStore';
+export * from './semanticVersioning';
+//# sourceMappingURL=index.d.ts.map

package/dist/rag/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/rag/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAGH,cAAc,qBAAqB,CAAC;AAGpC,cAAc,eAAe,CAAC;AAC9B,cAAc,mBAAmB,CAAC;AAClC,cAAc,mBAAmB,CAAC;AAGlC,cAAc,sCAAsC,CAAC;AAGrD,cAAc,wBAAwB,CAAC;AAGvC,cAAc,qBAAqB,CAAC;AACpC,cAAc,sBAAsB,CAAC"}

package/dist/rag/index.js

@@ -0,0 +1,24 @@
+/**
+ * RAG (Retrieval-Augmented Generation) Module
+ *
+ * Exports core RAG components for MCard including:
+ * - Persistent Indexing
+ * - Semantic Search (Vector Store)
+ * - Knowledge Graph (Nodes, Edges, Communities)
+ * - Embeddings (Text, Vision)
+ * - Semantic Versioning & Handle Management
+ */
+// Persistent Indexer
+export * from './PersistentIndexer';
+// Graph Components
+export * from './graph/store';
+export * from './graph/extractor';
+export * from './graph/community';
+// Embeddings
+export * from './embeddings/VisionEmbeddingProvider';
+// Vector Store Utilities
+export * from '../storage/VectorStore';
+// Handle Management & Semantic Versioning
+export * from './HandleVectorStore';
+export * from './semanticVersioning';
+//# sourceMappingURL=index.js.map

package/dist/rag/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/rag/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAEH,qBAAqB;AACrB,cAAc,qBAAqB,CAAC;AAEpC,mBAAmB;AACnB,cAAc,eAAe,CAAC;AAC9B,cAAc,mBAAmB,CAAC;AAClC,cAAc,mBAAmB,CAAC;AAElC,aAAa;AACb,cAAc,sCAAsC,CAAC;AAErD,yBAAyB;AACzB,cAAc,wBAAwB,CAAC;AAEvC,0CAA0C;AAC1C,cAAc,qBAAqB,CAAC;AACpC,cAAc,sBAAsB,CAAC"}