mindgraph-core 0.1.0

package/dist/schema/validation.js

@@ -0,0 +1,140 @@
+import { NodeType, RelType } from './types.js';
+// ─── Confidence gating ─────────────────────────────────────────────
+const DEFAULT_CONFIDENCE_THRESHOLD = 0.5;
+export function passesConfidenceGate(data, threshold = DEFAULT_CONFIDENCE_THRESHOLD) {
+    if (typeof data.confidence === 'number') {
+        return data.confidence >= threshold;
+    }
+    return true; // no confidence field → pass
+}
+// ─── Node validation ───────────────────────────────────────────────
+const REQUIRED_NODE_FIELDS = {
+    [NodeType.Note]: ['title', 'path', 'contentHash'],
+    [NodeType.Chunk]: ['notePath', 'text', 'startOffset', 'endOffset', 'contentHash'],
+    [NodeType.Entity]: ['name', 'entityType'],
+    [NodeType.Concept]: ['name'],
+    [NodeType.Location]: ['name', 'locationType'],
+    [NodeType.Event]: ['name'],
+    [NodeType.Proposition]: ['statement', 'statementHash'],
+    [NodeType.Thought]: ['statement', 'stance'],
+    [NodeType.Agent]: ['name', 'agentType'],
+    [NodeType.Emotion]: ['name'],
+    [NodeType.EmotionalEvent]: ['emotion', 'intensity'],
+    [NodeType.ReasoningChain]: ['topic'],
+    [NodeType.ReasoningStep]: ['stepIndex', 'claim'],
+};
+export function validateNode(node) {
+    const errors = [];
+    if (!node.id)
+        errors.push('Node id is required');
+    if (!node.nodeType)
+        errors.push('Node nodeType is required');
+    if (!Object.values(NodeType).includes(node.nodeType)) {
+        errors.push(`Unknown nodeType: ${node.nodeType}`);
+    }
+    const required = REQUIRED_NODE_FIELDS[node.nodeType];
+    if (required) {
+        for (const field of required) {
+            if (node.data[field] === undefined || node.data[field] === null) {
+                errors.push(`${node.nodeType} node requires field: ${field}`);
+            }
+        }
+    }
+    return errors;
+}
+// ─── Edge validation ───────────────────────────────────────────────
+/** Rules for which node types can appear as source/target for a given rel type. */
+const EDGE_CONSTRAINTS = {
+    [RelType.HAS_CHUNK]: {
+        source: [NodeType.Note],
+        target: [NodeType.Chunk],
+    },
+    [RelType.DERIVED_FROM]: {
+        target: [NodeType.Chunk],
+    },
+    [RelType.MENTIONS]: {
+        source: [NodeType.Chunk],
+        target: [NodeType.Entity, NodeType.Concept, NodeType.Location],
+    },
+    [RelType.BELIEVES]: {
+        source: [NodeType.Agent],
+        target: [NodeType.Proposition],
+    },
+    [RelType.ENDORSES]: {
+        source: [NodeType.Agent],
+        target: [NodeType.Thought],
+    },
+    [RelType.ABOUT]: {
+        source: [NodeType.Proposition, NodeType.Thought],
+        target: [NodeType.Entity, NodeType.Concept, NodeType.Event],
+    },
+    [RelType.SUPPORTS]: {
+        source: [NodeType.Proposition, NodeType.Thought],
+        target: [NodeType.Proposition, NodeType.Thought],
+    },
+    [RelType.CONTRADICTS]: {
+        source: [NodeType.Proposition, NodeType.Thought],
+        target: [NodeType.Proposition, NodeType.Thought],
+    },
+};
+export function validateEdge(edge, sourceNode, targetNode) {
+    const errors = [];
+    if (!edge.id)
+        errors.push('Edge id is required');
+    if (!edge.sourceId)
+        errors.push('Edge sourceId is required');
+    if (!edge.targetId)
+        errors.push('Edge targetId is required');
+    if (!edge.relType)
+        errors.push('Edge relType is required');
+    if (!Object.values(RelType).includes(edge.relType)) {
+        errors.push(`Unknown relType: ${edge.relType}`);
+    }
+    // Check type constraints if nodes are provided
+    const constraints = EDGE_CONSTRAINTS[edge.relType];
+    if (constraints) {
+        if (constraints.source && sourceNode && !constraints.source.includes(sourceNode.nodeType)) {
+            errors.push(`${edge.relType} edge source must be one of [${constraints.source.join(', ')}], got ${sourceNode.nodeType}`);
+        }
+        if (constraints.target && targetNode && !constraints.target.includes(targetNode.nodeType)) {
+            errors.push(`${edge.relType} edge target must be one of [${constraints.target.join(', ')}], got ${targetNode.nodeType}`);
+        }
+    }
+    // DERIVED_FROM must have provenance
+    if (edge.relType === RelType.DERIVED_FROM) {
+        const prov = edge.data?.provenance;
+        if (!prov) {
+            errors.push('DERIVED_FROM edge requires provenance data');
+        }
+        else {
+            if (!prov.notePath)
+                errors.push('Provenance requires notePath');
+            if (!prov.chunkId)
+                errors.push('Provenance requires chunkId');
+            if (typeof prov.startOffset !== 'number')
+                errors.push('Provenance requires startOffset');
+            if (typeof prov.endOffset !== 'number')
+                errors.push('Provenance requires endOffset');
+        }
+    }
+    return errors;
+}
+// ─── Provenance validation ─────────────────────────────────────────
+export function validateProvenance(prov) {
+    const errors = [];
+    if (!prov.notePath)
+        errors.push('notePath is required');
+    if (!prov.chunkId)
+        errors.push('chunkId is required');
+    if (typeof prov.startOffset !== 'number' || prov.startOffset < 0) {
+        errors.push('startOffset must be a non-negative number');
+    }
+    if (typeof prov.endOffset !== 'number' || prov.endOffset < 0) {
+        errors.push('endOffset must be a non-negative number');
+    }
+    if (prov.endOffset <= prov.startOffset) {
+        errors.push('endOffset must be greater than startOffset');
+    }
+    return errors;
+}
+//# sourceMappingURL=validation.js.map

package/dist/schema/validation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validation.js","sourceRoot":"","sources":["../../src/schema/validation.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAmD,MAAM,YAAY,CAAC;AAEhG,sEAAsE;AAEtE,MAAM,4BAA4B,GAAG,GAAG,CAAC;AAEzC,MAAM,UAAU,oBAAoB,CAClC,IAA6B,EAC7B,YAAoB,4BAA4B;IAEhD,IAAI,OAAO,IAAI,CAAC,UAAU,KAAK,QAAQ,EAAE,CAAC;QACxC,OAAO,IAAI,CAAC,UAAU,IAAI,SAAS,CAAC;IACtC,CAAC;IACD,OAAO,IAAI,CAAC,CAAC,6BAA6B;AAC5C,CAAC;AAED,sEAAsE;AAEtE,MAAM,oBAAoB,GAA+B;IACvD,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,MAAM,EAAE,aAAa,CAAC;IACjD,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,UAAU,EAAE,MAAM,EAAE,aAAa,EAAE,WAAW,EAAE,aAAa,CAAC;IACjF,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,MAAM,EAAE,YAAY,CAAC;IACzC,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,MAAM,CAAC;IAC5B,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,MAAM,EAAE,cAAc,CAAC;IAC7C,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,CAAC;IAC1B,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAE,CAAC,WAAW,EAAE,eAAe,CAAC;IACtD,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,WAAW,EAAE,QAAQ,CAAC;IAC3C,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,MAAM,EAAE,WAAW,CAAC;IACvC,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC,MAAM,CAAC;IAC5B,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,SAAS,EAAE,WAAW,CAAC;IACnD,CAAC,QAAQ,CAAC,cAAc,CAAC,EAAE,CAAC,OAAO,CAAC;IACpC,CAAC,QAAQ,CAAC,aAAa,CAAC,EAAE,CAAC,WAAW,EAAE,OAAO,CAAC;CACjD,CAAC;AAEF,MAAM,UAAU,YAAY,CAAC,IAAe;IAC1C,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,IAAI,CAAC,IAAI,CAAC,EAAE;QAAE,MAAM,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;IACjD,IAAI,CAAC,IAAI,CAAC,QAAQ;QAAE,MAAM,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;IAC7D,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC;QACrD,MAAM,CAAC,IAAI,CAAC,qBAAqB,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;IACpD,CAAC;IAED,MAAM,QAAQ,GAAG,oBAAoB,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACrD,IAAI,QAAQ,EAAE,CAAC;QACb,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC7B,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,EAAE,CAAC;gBAChE,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,QAAQ,yBAAyB,KAAK,EAAE,CAAC,CAAC;YAChE,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,sEAAsE;AAEtE,mFAAmF;AACnF,MAAM,gBAAgB,GAElB;IACF,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE;QACnB,MAAM,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC;QACvB,MAAM,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;KACzB;IACD,CAAC,OAAO,CAAC,YAAY,CAAC,EAAE;QACtB,MAAM,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;KACzB;IACD,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;QAClB,MAAM,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;QACxB,MAAM,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,QAAQ,CAAC;KAC/D;IACD,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;QAClB,MAAM,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;QACxB,MAAM,EAAE,CAAC,QAAQ,CAAC,WAAW,CAAC;KAC/B;IACD,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;QAClB,MAAM,EAAE,CAAC,QAAQ,CAAC,KAAK,CAAC;QACxB,MAAM,EAAE,CAAC,QAAQ,CAAC,OAAO,CAAC;KAC3B;IACD,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;QACf,MAAM,EAAE,CAAC,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,OAAO,CAAC;QAChD,MAAM,EAAE,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,KAAK,CAAC;KAC5D;IACD,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;QAClB,MAAM,EAAE,CAAC,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,OAAO,CAAC;QAChD,MAAM,EAAE,CAAC,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,OAAO,CAAC;KACjD;IACD,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE;QACrB,MAAM,EAAE,CAAC,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,OAAO,CAAC;QAChD,MAAM,EAAE,CAAC,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,OAAO,CAAC;KACjD;CACF,CAAC;AAEF,MAAM,UAAU,YAAY,CAC1B,IAAe,EACf,UAAsB,EACtB,UAAsB;IAEtB,MAAM,MAAM,GAAa,EAAE,CAAC;IAE5B,IAAI,CAAC,IAAI,CAAC,EAAE;QAAE,MAAM,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;IACjD,IAAI,CAAC,IAAI,CAAC,QAAQ;QAAE,MAAM,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;IAC7D,IAAI,CAAC,IAAI,CAAC,QAAQ;QAAE,MAAM,CAAC,IAAI,CAAC,2BAA2B,CAAC,CAAC;IAC7D,IAAI,CAAC,IAAI,CAAC,OAAO;QAAE,MAAM,CAAC,IAAI,CAAC,0BAA0B,CAAC,CAAC;IAC3D,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QACnD,MAAM,CAAC,IAAI,CAAC,oBAAoB,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;IAClD,CAAC;IAED,+CAA+C;IAC/C,MAAM,WAAW,GAAG,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACnD,IAAI,WAAW,EAAE,CAAC;QAChB,IAAI,WAAW,CAAC,MAAM,IAAI,UAAU,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC1F,MAAM,CAAC,IAAI,CACT,GAAG,IAAI,CAAC,OAAO,gCAAgC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,UAAU,CAAC,QAAQ,EAAE,CAC5G,CAAC;QACJ,CAAC;QACD,IAAI,WAAW,CAAC,MAAM,IAAI,UAAU,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC1F,MAAM,CAAC,IAAI,CACT,GAAG,IAAI,CAAC,OAAO,gCAAgC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,UAAU,CAAC,QAAQ,EAAE,CAC5G,CAAC;QACJ,CAAC;IACH,CAAC;IAED,oCAAoC;IACpC,IAAI,IAAI,CAAC,OAAO,KAAK,OAAO,CAAC,YAAY,EAAE,CAAC;QAC1C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,EAAE,UAAoC,CAAC;QAC7D,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,CAAC,IAAI,CAAC,4CAA4C,CAAC,CAAC;QAC5D,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,IAAI,CAAC,QAAQ;gBAAE,MAAM,CAAC,IAAI,CAAC,8BAA8B,CAAC,CAAC;YAChE,IAAI,CAAC,IAAI,CAAC,OAAO;gBAAE,MAAM,CAAC,IAAI,CAAC,6BAA6B,CAAC,CAAC;YAC9D,IAAI,OAAO,IAAI,CAAC,WAAW,KAAK,QAAQ;gBAAE,MAAM,CAAC,IAAI,CAAC,iCAAiC,CAAC,CAAC;YACzF,IAAI,OAAO,IAAI,CAAC,SAAS,KAAK,QAAQ;gBAAE,MAAM,CAAC,IAAI,CAAC,+BAA+B,CAAC,CAAC;QACvF,CAAC;IACH,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,sEAAsE;AAEtE,MAAM,UAAU,kBAAkB,CAAC,IAAgB;IACjD,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,IAAI,CAAC,IAAI,CAAC,QAAQ;QAAE,MAAM,CAAC,IAAI,CAAC,sBAAsB,CAAC,CAAC;IACxD,IAAI,CAAC,IAAI,CAAC,OAAO;QAAE,MAAM,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;IACtD,IAAI,OAAO,IAAI,CAAC,WAAW,KAAK,QAAQ,IAAI,IAAI,CAAC,WAAW,GAAG,CAAC,EAAE,CAAC;QACjE,MAAM,CAAC,IAAI,CAAC,2CAA2C,CAAC,CAAC;IAC3D,CAAC;IACD,IAAI,OAAO,IAAI,CAAC,SAAS,KAAK,QAAQ,IAAI,IAAI,CAAC,SAAS,GAAG,CAAC,EAAE,CAAC;QAC7D,MAAM,CAAC,IAAI,CAAC,yCAAyC,CAAC,CAAC;IACzD,CAAC;IACD,IAAI,IAAI,CAAC,SAAS,IAAI,IAAI,CAAC,WAAW,EAAE,CAAC;QACvC,MAAM,CAAC,IAAI,CAAC,4CAA4C,CAAC,CAAC;IAC5D,CAAC;IACD,OAAO,MAAM,CAAC;AAChB,CAAC"}

package/dist/storage/export-import.d.ts

@@ -0,0 +1,28 @@
+import type { StorageAdapter } from './storage-interface.js';
+export type ImportStrategy = 'replace' | 'merge' | 'skip_existing';
+export interface ImportResult {
+    nodesImported: number;
+    edgesImported: number;
+    embeddingsImported: number;
+    nodesSkipped: number;
+    edgesSkipped: number;
+    errors: string[];
+}
+export declare class GraphExporter {
+    private storage;
+    constructor(storage: StorageAdapter);
+    /**
+     * Export all graph data as JSONL string.
+     * Line 1: header, then nodes, edges, embeddings.
+     */
+    export(): Promise<string>;
+}
+export declare class GraphImporter {
+    private storage;
+    constructor(storage: StorageAdapter);
+    /**
+     * Import graph data from a JSONL string.
+     */
+    import(jsonlData: string, strategy?: ImportStrategy): Promise<ImportResult>;
+}
+//# sourceMappingURL=export-import.d.ts.map

package/dist/storage/export-import.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"export-import.d.ts","sourceRoot":"","sources":["../../src/storage/export-import.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAC;AAiB7D,MAAM,MAAM,cAAc,GAAG,SAAS,GAAG,OAAO,GAAG,eAAe,CAAC;AAEnE,MAAM,WAAW,YAAY;IAC3B,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;IACtB,kBAAkB,EAAE,MAAM,CAAC;IAC3B,YAAY,EAAE,MAAM,CAAC;IACrB,YAAY,EAAE,MAAM,CAAC;IACrB,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB;AAwBD,qBAAa,aAAa;IACZ,OAAO,CAAC,OAAO;gBAAP,OAAO,EAAE,cAAc;IAE3C;;;OAGG;IACG,MAAM,IAAI,OAAO,CAAC,MAAM,CAAC;CA+DhC;AAID,qBAAa,aAAa;IACZ,OAAO,CAAC,OAAO;gBAAP,OAAO,EAAE,cAAc;IAE3C;;OAEG;IACG,MAAM,CAAC,SAAS,EAAE,MAAM,EAAE,QAAQ,GAAE,cAAwB,GAAG,OAAO,CAAC,YAAY,CAAC;CAyG3F"}

package/dist/storage/export-import.js

@@ -0,0 +1,189 @@
+// ─── Helpers ──────────────────────────────────────────────────────
+function float32ToBase64(arr) {
+    const bytes = new Uint8Array(arr.buffer, arr.byteOffset, arr.byteLength);
+    let binary = '';
+    for (let i = 0; i < bytes.length; i++) {
+        binary += String.fromCharCode(bytes[i]);
+    }
+    return btoa(binary);
+}
+function base64ToFloat32(base64, dimensions) {
+    const binary = atob(base64);
+    const bytes = new Uint8Array(binary.length);
+    for (let i = 0; i < binary.length; i++) {
+        bytes[i] = binary.charCodeAt(i);
+    }
+    return new Float32Array(bytes.buffer, bytes.byteOffset, dimensions);
+}
+// ─── GraphExporter ────────────────────────────────────────────────
+export class GraphExporter {
+    constructor(storage) {
+        this.storage = storage;
+    }
+    /**
+     * Export all graph data as JSONL string.
+     * Line 1: header, then nodes, edges, embeddings.
+     */
+    async export() {
+        const stats = await this.storage.getStats();
+        const lines = [];
+        // Header
+        let schemaVersion = 0;
+        if (typeof this.storage.getSchemaVersion === 'function') {
+            schemaVersion = this.storage.getSchemaVersion();
+        }
+        // Collect embedding model ID from first embedding if available
+        let embeddingModelId = null;
+        const header = {
+            format: 'mindgraph-jsonl',
+            schemaVersion,
+            embeddingModelId: null, // updated below
+            exportedAt: new Date().toISOString(),
+            nodeCount: stats.nodeCount,
+            edgeCount: stats.edgeCount,
+            embeddingCount: stats.embeddingCount,
+        };
+        // Nodes
+        const nodes = await this.storage.queryNodes({});
+        const nodeLines = [];
+        for (const node of nodes) {
+            nodeLines.push(JSON.stringify({ type: 'node', data: node }));
+        }
+        // Edges
+        const edges = await this.storage.queryEdges({});
+        const edgeLines = [];
+        for (const edge of edges) {
+            edgeLines.push(JSON.stringify({ type: 'edge', data: edge }));
+        }
+        // Embeddings — query all chunks and get their embeddings
+        const embeddingLines = [];
+        const chunks = await this.storage.queryNodes({ nodeType: 'CHUNK' });
+        for (const chunk of chunks) {
+            const embedding = await this.storage.getEmbedding(chunk.id);
+            if (embedding) {
+                if (!embeddingModelId)
+                    embeddingModelId = embedding.modelId;
+                embeddingLines.push(JSON.stringify({
+                    type: 'embedding',
+                    data: {
+                        chunkId: embedding.chunkId,
+                        vector: float32ToBase64(embedding.vector),
+                        modelId: embedding.modelId,
+                        dimensions: embedding.dimensions,
+                        createdAt: embedding.createdAt,
+                    },
+                }));
+            }
+        }
+        header.embeddingModelId = embeddingModelId;
+        lines.push(JSON.stringify({ type: 'header', data: header }));
+        lines.push(...nodeLines, ...edgeLines, ...embeddingLines);
+        return lines.join('\n') + '\n';
+    }
+}
+// ─── GraphImporter ────────────────────────────────────────────────
+export class GraphImporter {
+    constructor(storage) {
+        this.storage = storage;
+    }
+    /**
+     * Import graph data from a JSONL string.
+     */
+    async import(jsonlData, strategy = 'merge') {
+        const result = {
+            nodesImported: 0,
+            edgesImported: 0,
+            embeddingsImported: 0,
+            nodesSkipped: 0,
+            edgesSkipped: 0,
+            errors: [],
+        };
+        const lines = jsonlData.trim().split('\n').filter(Boolean);
+        if (lines.length === 0) {
+            result.errors.push('Empty import data');
+            return result;
+        }
+        // Parse header
+        let header = null;
+        try {
+            const firstLine = JSON.parse(lines[0]);
+            if (firstLine.type === 'header') {
+                header = firstLine.data;
+                if (header.format !== 'mindgraph-jsonl') {
+                    result.errors.push(`Unknown format: ${header.format}`);
+                    return result;
+                }
+            }
+        }
+        catch (e) {
+            result.errors.push(`Failed to parse header: ${e}`);
+            return result;
+        }
+        // If strategy is replace, wipe existing data first
+        if (strategy === 'replace') {
+            const allNodes = await this.storage.queryNodes({});
+            for (const node of allNodes) {
+                await this.storage.deleteEdgesByNode(node.id);
+                await this.storage.deleteNode(node.id);
+            }
+        }
+        // Process data lines (skip header)
+        const startIdx = header ? 1 : 0;
+        for (let i = startIdx; i < lines.length; i++) {
+            try {
+                const line = JSON.parse(lines[i]);
+                switch (line.type) {
+                    case 'node': {
+                        const node = line.data;
+                        if (strategy === 'skip_existing') {
+                            const existing = await this.storage.getNode(node.id);
+                            if (existing) {
+                                result.nodesSkipped++;
+                                break;
+                            }
+                        }
+                        await this.storage.upsertNode(node);
+                        result.nodesImported++;
+                        break;
+                    }
+                    case 'edge': {
+                        const edge = line.data;
+                        if (strategy === 'skip_existing') {
+                            const existing = await this.storage.getEdge(edge.id);
+                            if (existing) {
+                                result.edgesSkipped++;
+                                break;
+                            }
+                        }
+                        await this.storage.upsertEdge(edge);
+                        result.edgesImported++;
+                        break;
+                    }
+                    case 'embedding': {
+                        const emb = line.data;
+                        const vector = base64ToFloat32(emb.vector, emb.dimensions);
+                        await this.storage.upsertEmbedding({
+                            chunkId: emb.chunkId,
+                            vector,
+                            modelId: emb.modelId,
+                            dimensions: emb.dimensions,
+                            createdAt: emb.createdAt,
+                        });
+                        result.embeddingsImported++;
+                        break;
+                    }
+                    case 'header':
+                        // Already processed
+                        break;
+                    default:
+                        result.errors.push(`Unknown line type at line ${i + 1}: ${line.type}`);
+                }
+            }
+            catch (e) {
+                result.errors.push(`Error at line ${i + 1}: ${e}`);
+            }
+        }
+        return result;
+    }
+}
+//# sourceMappingURL=export-import.js.map

package/dist/storage/export-import.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"export-import.js","sourceRoot":"","sources":["../../src/storage/export-import.ts"],"names":[],"mappings":"AA4BA,qEAAqE;AAErE,SAAS,eAAe,CAAC,GAAiB;IACxC,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;IACzE,IAAI,MAAM,GAAG,EAAE,CAAC;IAChB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,MAAM,CAAC,YAAY,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC;IAC3C,CAAC;IACD,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC;AACtB,CAAC;AAED,SAAS,eAAe,CAAC,MAAc,EAAE,UAAkB;IACzD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC;IAC5B,MAAM,KAAK,GAAG,IAAI,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACvC,KAAK,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC;IACD,OAAO,IAAI,YAAY,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;AACtE,CAAC;AAED,qEAAqE;AAErE,MAAM,OAAO,aAAa;IACxB,YAAoB,OAAuB;QAAvB,YAAO,GAAP,OAAO,CAAgB;IAAG,CAAC;IAE/C;;;OAGG;IACH,KAAK,CAAC,MAAM;QACV,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,CAAC;QAC5C,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,SAAS;QACT,IAAI,aAAa,GAAG,CAAC,CAAC;QACtB,IAAI,OAAQ,IAAI,CAAC,OAAe,CAAC,gBAAgB,KAAK,UAAU,EAAE,CAAC;YACjE,aAAa,GAAI,IAAI,CAAC,OAAe,CAAC,gBAAgB,EAAE,CAAC;QAC3D,CAAC;QAED,+DAA+D;QAC/D,IAAI,gBAAgB,GAAkB,IAAI,CAAC;QAE3C,MAAM,MAAM,GAAiB;YAC3B,MAAM,EAAE,iBAAiB;YACzB,aAAa;YACb,gBAAgB,EAAE,IAAI,EAAE,gBAAgB;YACxC,UAAU,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACpC,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,cAAc,EAAE,KAAK,CAAC,cAAc;SACrC,CAAC;QAEF,QAAQ;QACR,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAChD,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QAC/D,CAAC;QAED,QAAQ;QACR,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;QAChD,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;QAC/D,CAAC;QAED,yDAAyD;QACzD,MAAM,cAAc,GAAa,EAAE,CAAC;QACpC,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,QAAQ,EAAE,OAAc,EAAE,CAAC,CAAC;QAC3E,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;YAC3B,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC5D,IAAI,SAAS,EAAE,CAAC;gBACd,IAAI,CAAC,gBAAgB;oBAAE,gBAAgB,GAAG,SAAS,CAAC,OAAO,CAAC;gBAC5D,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC;oBACjC,IAAI,EAAE,WAAW;oBACjB,IAAI,EAAE;wBACJ,OAAO,EAAE,SAAS,CAAC,OAAO;wBAC1B,MAAM,EAAE,eAAe,CAAC,SAAS,CAAC,MAAM,CAAC;wBACzC,OAAO,EAAE,SAAS,CAAC,OAAO;wBAC1B,UAAU,EAAE,SAAS,CAAC,UAAU;wBAChC,SAAS,EAAE,SAAS,CAAC,SAAS;qBAC/B;iBACF,CAAC,CAAC,CAAC;YACN,CAAC;QACH,CAAC;QAED,MAAM,CAAC,gBAAgB,GAAG,gBAAgB,CAAC;QAC3C,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC;QAC7D,KAAK,CAAC,IAAI,CAAC,GAAG,SAAS,EAAE,GAAG,SAAS,EAAE,GAAG,cAAc,CAAC,CAAC;QAE1D,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;IACjC,CAAC;CACF;AAED,qEAAqE;AAErE,MAAM,OAAO,aAAa;IACxB,YAAoB,OAAuB;QAAvB,YAAO,GAAP,OAAO,CAAgB;IAAG,CAAC;IAE/C;;OAEG;IACH,KAAK,CAAC,MAAM,CAAC,SAAiB,EAAE,WAA2B,OAAO;QAChE,MAAM,MAAM,GAAiB;YAC3B,aAAa,EAAE,CAAC;YAChB,aAAa,EAAE,CAAC;YAChB,kBAAkB,EAAE,CAAC;YACrB,YAAY,EAAE,CAAC;YACf,YAAY,EAAE,CAAC;YACf,MAAM,EAAE,EAAE;SACX,CAAC;QAEF,MAAM,KAAK,GAAG,SAAS,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QAC3D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACvB,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,mBAAmB,CAAC,CAAC;YACxC,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,eAAe;QACf,IAAI,MAAM,GAAwB,IAAI,CAAC;QACvC,IAAI,CAAC;YACH,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC;YACxC,IAAI,SAAS,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;gBAChC,MAAM,GAAG,SAAS,CAAC,IAAoB,CAAC;gBACxC,IAAI,MAAM,CAAC,MAAM,KAAK,iBAAiB,EAAE,CAAC;oBACxC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,mBAAmB,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;oBACvD,OAAO,MAAM,CAAC;gBAChB,CAAC;YACH,CAAC;QACH,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,2BAA2B,CAAC,EAAE,CAAC,CAAC;YACnD,OAAO,MAAM,CAAC;QAChB,CAAC;QAED,mDAAmD;QACnD,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC3B,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;YACnD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,MAAM,IAAI,CAAC,OAAO,CAAC,iBAAiB,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBAC9C,MAAM,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACzC,CAAC;QACH,CAAC;QAED,mCAAmC;QACnC,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAEhC,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7C,IAAI,CAAC;gBACH,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAE,CAAC,CAAC;gBAEnC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;oBAClB,KAAK,MAAM,CAAC,CAAC,CAAC;wBACZ,MAAM,IAAI,GAAG,IAAI,CAAC,IAAiB,CAAC;wBACpC,IAAI,QAAQ,KAAK,eAAe,EAAE,CAAC;4BACjC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;4BACrD,IAAI,QAAQ,EAAE,CAAC;gCACb,MAAM,CAAC,YAAY,EAAE,CAAC;gCACtB,MAAM;4BACR,CAAC;wBACH,CAAC;wBACD,MAAM,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;wBACpC,MAAM,CAAC,aAAa,EAAE,CAAC;wBACvB,MAAM;oBACR,CAAC;oBAED,KAAK,MAAM,CAAC,CAAC,CAAC;wBACZ,MAAM,IAAI,GAAG,IAAI,CAAC,IAAiB,CAAC;wBACpC,IAAI,QAAQ,KAAK,eAAe,EAAE,CAAC;4BACjC,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;4BACrD,IAAI,QAAQ,EAAE,CAAC;gCACb,MAAM,CAAC,YAAY,EAAE,CAAC;gCACtB,MAAM;4BACR,CAAC;wBACH,CAAC;wBACD,MAAM,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;wBACpC,MAAM,CAAC,aAAa,EAAE,CAAC;wBACvB,MAAM;oBACR,CAAC;oBAED,KAAK,WAAW,CAAC,CAAC,CAAC;wBACjB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC;wBACtB,MAAM,MAAM,GAAG,eAAe,CAAC,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,UAAU,CAAC,CAAC;wBAC3D,MAAM,IAAI,CAAC,OAAO,CAAC,eAAe,CAAC;4BACjC,OAAO,EAAE,GAAG,CAAC,OAAO;4BACpB,MAAM;4BACN,OAAO,EAAE,GAAG,CAAC,OAAO;4BACpB,UAAU,EAAE,GAAG,CAAC,UAAU;4BAC1B,SAAS,EAAE,GAAG,CAAC,SAAS;yBACzB,CAAC,CAAC;wBACH,MAAM,CAAC,kBAAkB,EAAE,CAAC;wBAC5B,MAAM;oBACR,CAAC;oBAED,KAAK,QAAQ;wBACX,oBAAoB;wBACpB,MAAM;oBAER;wBACE,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,6BAA6B,CAAC,GAAG,CAAC,KAAK,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;gBAC3E,CAAC;YACH,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,iBAAiB,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YACrD,CAAC;QACH,CAAC;QAED,OAAO,MAAM,CAAC;IAChB,CAAC;CACF"}

package/dist/storage/memory/memory-adapter.d.ts

@@ -0,0 +1,36 @@
+import type { StorageAdapter, NodeQuery, EdgeQuery, TraversalOptions, SimilarityQuery, FullTextQuery } from '../storage-interface.js';
+import type { GraphNode, GraphEdge, EmbeddingRecord, SearchResult, NodeType } from '../../schema/types.js';
+export declare class MemoryAdapter implements StorageAdapter {
+    private nodes;
+    private edges;
+    private embeddings;
+    private ftsEntries;
+    initialize(): Promise<void>;
+    close(): Promise<void>;
+    upsertNode(node: GraphNode): Promise<void>;
+    getNode(id: string): Promise<GraphNode | null>;
+    queryNodes(query: NodeQuery): Promise<GraphNode[]>;
+    deleteNode(id: string): Promise<void>;
+    deleteNodesByData(nodeType: NodeType, field: string, value: unknown): Promise<number>;
+    upsertEdge(edge: GraphEdge): Promise<void>;
+    getEdge(id: string): Promise<GraphEdge | null>;
+    queryEdges(query: EdgeQuery): Promise<GraphEdge[]>;
+    deleteEdge(id: string): Promise<void>;
+    deleteEdgesByNode(nodeId: string): Promise<number>;
+    traverse(options: TraversalOptions): Promise<GraphNode[]>;
+    upsertEmbedding(record: EmbeddingRecord): Promise<void>;
+    getEmbedding(chunkId: string): Promise<EmbeddingRecord | null>;
+    similaritySearch(query: SimilarityQuery): Promise<SearchResult[]>;
+    deleteEmbedding(chunkId: string): Promise<void>;
+    fullTextSearch(query: FullTextQuery): Promise<SearchResult[]>;
+    upsertFTSEntry(chunkId: string, text: string): Promise<void>;
+    deleteFTSEntry(chunkId: string): Promise<void>;
+    transaction<T>(fn: () => Promise<T>): Promise<T>;
+    getStats(): Promise<{
+        nodeCount: number;
+        edgeCount: number;
+        embeddingCount: number;
+        nodeCountByType: Record<string, number>;
+    }>;
+}
+//# sourceMappingURL=memory-adapter.d.ts.map

package/dist/storage/memory/memory-adapter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"memory-adapter.d.ts","sourceRoot":"","sources":["../../../src/storage/memory/memory-adapter.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,cAAc,EACd,SAAS,EACT,SAAS,EACT,gBAAgB,EAChB,eAAe,EACf,aAAa,EACd,MAAM,yBAAyB,CAAC;AACjC,OAAO,KAAK,EACV,SAAS,EACT,SAAS,EACT,eAAe,EACf,YAAY,EACZ,QAAQ,EACT,MAAM,uBAAuB,CAAC;AAe/B,qBAAa,aAAc,YAAW,cAAc;IAClD,OAAO,CAAC,KAAK,CAAgC;IAC7C,OAAO,CAAC,KAAK,CAAgC;IAC7C,OAAO,CAAC,UAAU,CAAsC;IACxD,OAAO,CAAC,UAAU,CAAwD;IAEpE,UAAU,IAAI,OAAO,CAAC,IAAI,CAAC;IAI3B,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAStB,UAAU,CAAC,IAAI,EAAE,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC;IAI1C,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC;IAI9C,UAAU,CAAC,KAAK,EAAE,SAAS,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;IA2BlD,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAIrC,iBAAiB,CAAC,QAAQ,EAAE,QAAQ,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,GAAG,OAAO,CAAC,MAAM,CAAC;IAarF,UAAU,CAAC,IAAI,EAAE,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC;IAI1C,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC;IAI9C,UAAU,CAAC,KAAK,EAAE,SAAS,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;IAmBlD,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAIrC,iBAAiB,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAalD,QAAQ,CAAC,OAAO,EAAE,gBAAgB,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;IA4CzD,eAAe,CAAC,MAAM,EAAE,eAAe,GAAG,OAAO,CAAC,IAAI,CAAC;IAIvD,YAAY,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,GAAG,IAAI,CAAC;IAI9D,gBAAgB,CAAC,KAAK,EAAE,eAAe,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IAiCjE,eAAe,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAM/C,cAAc,CAAC,KAAK,EAAE,aAAa,GAAG,OAAO,CAAC,YAAY,EAAE,CAAC;IA2B7D,cAAc,CAAC,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAI5D,cAAc,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC;IAM9C,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC;IAMhD,QAAQ,IAAI,OAAO,CAAC;QACxB,SAAS,EAAE,MAAM,CAAC;QAClB,SAAS,EAAE,MAAM,CAAC;QAClB,cAAc,EAAE,MAAM,CAAC;QACvB,eAAe,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;KACzC,CAAC;CAaH"}

package/dist/storage/memory/memory-adapter.js

@@ -0,0 +1,231 @@
+function cosineSimilarity(a, b) {
+    let dotProduct = 0;
+    let normA = 0;
+    let normB = 0;
+    for (let i = 0; i < a.length; i++) {
+        dotProduct += a[i] * b[i];
+        normA += a[i] * a[i];
+        normB += b[i] * b[i];
+    }
+    const denom = Math.sqrt(normA) * Math.sqrt(normB);
+    return denom === 0 ? 0 : dotProduct / denom;
+}
+export class MemoryAdapter {
+    constructor() {
+        this.nodes = new Map();
+        this.edges = new Map();
+        this.embeddings = new Map();
+        this.ftsEntries = new Map();
+    }
+    async initialize() {
+        // no-op
+    }
+    async close() {
+        this.nodes.clear();
+        this.edges.clear();
+        this.embeddings.clear();
+        this.ftsEntries.clear();
+    }
+    // ─── Node CRUD ───────────────────────────────────────────────────
+    async upsertNode(node) {
+        this.nodes.set(node.id, { ...node });
+    }
+    async getNode(id) {
+        return this.nodes.get(id) ?? null;
+    }
+    async queryNodes(query) {
+        let results = Array.from(this.nodes.values());
+        if (query.nodeType) {
+            results = results.filter((n) => n.nodeType === query.nodeType);
+        }
+        if (query.where) {
+            results = results.filter((n) => {
+                for (const [key, value] of Object.entries(query.where)) {
+                    if (n.data[key] !== value)
+                        return false;
+                }
+                return true;
+            });
+        }
+        if (query.offset) {
+            results = results.slice(query.offset);
+        }
+        if (query.limit) {
+            results = results.slice(0, query.limit);
+        }
+        return results;
+    }
+    async deleteNode(id) {
+        this.nodes.delete(id);
+    }
+    async deleteNodesByData(nodeType, field, value) {
+        let count = 0;
+        for (const [id, node] of this.nodes) {
+            if (node.nodeType === nodeType && node.data[field] === value) {
+                this.nodes.delete(id);
+                count++;
+            }
+        }
+        return count;
+    }
+    // ─── Edge CRUD ───────────────────────────────────────────────────
+    async upsertEdge(edge) {
+        this.edges.set(edge.id, { ...edge });
+    }
+    async getEdge(id) {
+        return this.edges.get(id) ?? null;
+    }
+    async queryEdges(query) {
+        let results = Array.from(this.edges.values());
+        if (query.sourceId) {
+            results = results.filter((e) => e.sourceId === query.sourceId);
+        }
+        if (query.targetId) {
+            results = results.filter((e) => e.targetId === query.targetId);
+        }
+        if (query.relType) {
+            results = results.filter((e) => e.relType === query.relType);
+        }
+        if (query.limit) {
+            results = results.slice(0, query.limit);
+        }
+        return results;
+    }
+    async deleteEdge(id) {
+        this.edges.delete(id);
+    }
+    async deleteEdgesByNode(nodeId) {
+        let count = 0;
+        for (const [id, edge] of this.edges) {
+            if (edge.sourceId === nodeId || edge.targetId === nodeId) {
+                this.edges.delete(id);
+                count++;
+            }
+        }
+        return count;
+    }
+    // ─── Graph traversal ────────────────────────────────────────────
+    async traverse(options) {
+        const visited = new Set();
+        const result = [];
+        const maxDepth = options.maxDepth ?? 3;
+        const direction = options.direction ?? 'outbound';
+        const queue = [
+            { nodeId: options.startNodeId, depth: 0 },
+        ];
+        while (queue.length > 0) {
+            const { nodeId, depth } = queue.shift();
+            if (visited.has(nodeId) || depth > maxDepth)
+                continue;
+            visited.add(nodeId);
+            const node = this.nodes.get(nodeId);
+            if (!node)
+                continue;
+            // Add to results if it passes the filter (but always continue traversal)
+            const passesFilter = !options.nodeTypeFilter || options.nodeTypeFilter.includes(node.nodeType);
+            if (nodeId !== options.startNodeId && passesFilter) {
+                result.push(node);
+            }
+            // Find connected edges
+            for (const edge of this.edges.values()) {
+                const relTypeMatch = !options.relTypes || options.relTypes.includes(edge.relType);
+                if (!relTypeMatch)
+                    continue;
+                if ((direction === 'outbound' || direction === 'both') && edge.sourceId === nodeId) {
+                    queue.push({ nodeId: edge.targetId, depth: depth + 1 });
+                }
+                if ((direction === 'inbound' || direction === 'both') && edge.targetId === nodeId) {
+                    queue.push({ nodeId: edge.sourceId, depth: depth + 1 });
+                }
+            }
+        }
+        return result;
+    }
+    // ─── Embeddings ──────────────────────────────────────────────────
+    async upsertEmbedding(record) {
+        this.embeddings.set(record.chunkId, { ...record });
+    }
+    async getEmbedding(chunkId) {
+        return this.embeddings.get(chunkId) ?? null;
+    }
+    async similaritySearch(query) {
+        const results = [];
+        for (const record of this.embeddings.values()) {
+            if (query.modelId && record.modelId !== query.modelId)
+                continue;
+            const score = cosineSimilarity(query.vector, record.vector);
+            if (query.threshold && score < query.threshold)
+                continue;
+            results.push({ chunkId: record.chunkId, score });
+        }
+        results.sort((a, b) => b.score - a.score);
+        const topK = results.slice(0, query.topK);
+        // Enrich with node data
+        const searchResults = [];
+        for (const r of topK) {
+            const chunkNode = this.nodes.get(r.chunkId);
+            if (chunkNode) {
+                searchResults.push({
+                    chunkId: r.chunkId,
+                    nodeId: r.chunkId,
+                    score: r.score,
+                    text: chunkNode.data.text ?? '',
+                    notePath: chunkNode.data.notePath ?? '',
+                });
+            }
+        }
+        return searchResults;
+    }
+    async deleteEmbedding(chunkId) {
+        this.embeddings.delete(chunkId);
+    }
+    // ─── Full-text search ────────────────────────────────────────────
+    async fullTextSearch(query) {
+        // Parse FTS5-style queries: strip quotes, handle OR operator
+        const rawTerms = query.query.toLowerCase().split(/\s+/);
+        const terms = rawTerms
+            .filter((t) => t !== 'or' && t !== 'and' && t !== 'not')
+            .map((t) => t.replace(/^"|"$/g, ''));
+        const results = [];
+        for (const entry of this.ftsEntries.values()) {
+            const textLower = entry.text.toLowerCase();
+            // OR semantics: match if any term is found
+            const matches = terms.some((term) => term.length > 0 && textLower.includes(term));
+            if (matches) {
+                const chunkNode = this.nodes.get(entry.chunkId);
+                results.push({
+                    chunkId: entry.chunkId,
+                    nodeId: entry.chunkId,
+                    score: 1.0,
+                    text: entry.text,
+                    notePath: chunkNode ? chunkNode.data.notePath ?? '' : '',
+                });
+            }
+        }
+        return results.slice(0, query.limit ?? 20);
+    }
+    async upsertFTSEntry(chunkId, text) {
+        this.ftsEntries.set(chunkId, { chunkId, text });
+    }
+    async deleteFTSEntry(chunkId) {
+        this.ftsEntries.delete(chunkId);
+    }
+    // ─── Bulk operations ─────────────────────────────────────────────
+    async transaction(fn) {
+        return fn(); // no real transaction in memory
+    }
+    // ─── Stats ───────────────────────────────────────────────────────
+    async getStats() {
+        const nodeCountByType = {};
+        for (const node of this.nodes.values()) {
+            nodeCountByType[node.nodeType] = (nodeCountByType[node.nodeType] ?? 0) + 1;
+        }
+        return {
+            nodeCount: this.nodes.size,
+            edgeCount: this.edges.size,
+            embeddingCount: this.embeddings.size,
+            nodeCountByType,
+        };
+    }
+}
+//# sourceMappingURL=memory-adapter.js.map