codeseeker 1.4.0

package/dist/shared/validation-cycle.d.ts

@@ -0,0 +1,12 @@
+/**
+ * CodeSeeker Validation Cycle System - SOLID Architecture
+ *
+ * Implements automatic quality and safety validation that runs before every Claude Code response.
+ * Refactored using SOLID principles for better maintainability and testability.
+ *
+ * This module exports the SOLID-compliant validation cycle and maintains backward compatibility.
+ */
+export { CodeSeekerValidationCycle, createValidationCycle, DEFAULT_VALIDATION_CONFIG } from './validation-cycle/validation-cycle';
+export type { ProjectContext, CycleResult, ValidationWarning, ValidationError, CycleConfig, SafetyCheckResult, QualityMetrics, ICoreSafetyService, IQualityValidationService, IValidationAggregatorService, IValidationReportService, IProjectAnalysisService } from './validation-cycle/interfaces/index';
+export { CodeSeekerValidationCycle as default } from './validation-cycle/validation-cycle';
+//# sourceMappingURL=validation-cycle.d.ts.map

package/dist/shared/validation-cycle.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"validation-cycle.d.ts","sourceRoot":"","sources":["../../src/shared/validation-cycle.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,EACL,yBAAyB,EACzB,qBAAqB,EACrB,yBAAyB,EAC1B,MAAM,qCAAqC,CAAC;AAG7C,YAAY,EACV,cAAc,EACd,WAAW,EACX,iBAAiB,EACjB,eAAe,EACf,WAAW,EACX,iBAAiB,EACjB,cAAc,EACd,kBAAkB,EAClB,yBAAyB,EACzB,4BAA4B,EAC5B,wBAAwB,EACxB,uBAAuB,EACxB,MAAM,qCAAqC,CAAC;AAG7C,OAAO,EAAE,yBAAyB,IAAI,OAAO,EAAE,MAAM,qCAAqC,CAAC"}

package/dist/shared/validation-cycle.js

@@ -0,0 +1,20 @@
+"use strict";
+/**
+ * CodeSeeker Validation Cycle System - SOLID Architecture
+ *
+ * Implements automatic quality and safety validation that runs before every Claude Code response.
+ * Refactored using SOLID principles for better maintainability and testability.
+ *
+ * This module exports the SOLID-compliant validation cycle and maintains backward compatibility.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.default = exports.DEFAULT_VALIDATION_CONFIG = exports.createValidationCycle = exports.CodeSeekerValidationCycle = void 0;
+// Re-export the new SOLID-compliant validation cycle
+var validation_cycle_1 = require("./validation-cycle/validation-cycle");
+Object.defineProperty(exports, "CodeSeekerValidationCycle", { enumerable: true, get: function () { return validation_cycle_1.CodeSeekerValidationCycle; } });
+Object.defineProperty(exports, "createValidationCycle", { enumerable: true, get: function () { return validation_cycle_1.createValidationCycle; } });
+Object.defineProperty(exports, "DEFAULT_VALIDATION_CONFIG", { enumerable: true, get: function () { return validation_cycle_1.DEFAULT_VALIDATION_CONFIG; } });
+// Legacy compatibility - create backward-compatible wrapper
+var validation_cycle_2 = require("./validation-cycle/validation-cycle");
+Object.defineProperty(exports, "default", { enumerable: true, get: function () { return validation_cycle_2.CodeSeekerValidationCycle; } });
+//# sourceMappingURL=validation-cycle.js.map

package/dist/shared/validation-cycle.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"validation-cycle.js","sourceRoot":"","sources":["../../src/shared/validation-cycle.ts"],"names":[],"mappings":";AAAA;;;;;;;GAOG;;;AAEH,qDAAqD;AACrD,wEAI6C;AAH3C,6HAAA,yBAAyB,OAAA;AACzB,yHAAA,qBAAqB,OAAA;AACrB,6HAAA,yBAAyB,OAAA;AAmB3B,4DAA4D;AAC5D,wEAA2F;AAAlF,2GAAA,yBAAyB,OAAW"}

package/dist/storage/embedded/graphology-graph-store.d.ts

@@ -0,0 +1,39 @@
+/**
+ * Graphology-based Graph Store
+ *
+ * Provides in-memory graph database functionality using graphology with:
+ * - Directed graph for code relationships
+ * - Automatic JSON persistence to disk
+ * - Rich traversal and query capabilities
+ * - Zero external dependencies (no Neo4j server required)
+ *
+ * Persists graph state to JSON file periodically and on close.
+ */
+import { IGraphStore, GraphNode, GraphEdge } from '../interfaces';
+export declare class GraphologyGraphStore implements IGraphStore {
+    private flushIntervalSeconds;
+    private graph;
+    private dataDir;
+    private dbPath;
+    private isDirty;
+    private flushTimer;
+    constructor(dataDir: string, flushIntervalSeconds?: number);
+    private loadFromDisk;
+    private saveToDisk;
+    private startFlushTimer;
+    upsertNode(node: GraphNode): Promise<void>;
+    upsertEdge(edge: GraphEdge): Promise<void>;
+    upsertNodes(nodes: GraphNode[]): Promise<void>;
+    upsertEdges(edges: GraphEdge[]): Promise<void>;
+    findNodes(projectId: string, type?: GraphNode['type']): Promise<GraphNode[]>;
+    getNode(id: string): Promise<GraphNode | null>;
+    getEdges(nodeId: string, direction?: 'in' | 'out' | 'both'): Promise<GraphEdge[]>;
+    getNeighbors(nodeId: string, edgeType?: GraphEdge['type']): Promise<GraphNode[]>;
+    findPath(sourceId: string, targetId: string, maxDepth?: number): Promise<GraphNode[]>;
+    deleteByProject(projectId: string): Promise<number>;
+    countNodes(projectId: string): Promise<number>;
+    flush(): Promise<void>;
+    close(): Promise<void>;
+    private extractProperties;
+}
+//# sourceMappingURL=graphology-graph-store.d.ts.map

package/dist/storage/embedded/graphology-graph-store.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graphology-graph-store.d.ts","sourceRoot":"","sources":["../../../src/storage/embedded/graphology-graph-store.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAKH,OAAO,EACL,WAAW,EACX,SAAS,EACT,SAAS,EACV,MAAM,eAAe,CAAC;AAEvB,qBAAa,oBAAqB,YAAW,WAAW;IASpD,OAAO,CAAC,oBAAoB;IAR9B,OAAO,CAAC,KAAK,CAAQ;IACrB,OAAO,CAAC,OAAO,CAAS;IACxB,OAAO,CAAC,MAAM,CAAS;IACvB,OAAO,CAAC,OAAO,CAAS;IACxB,OAAO,CAAC,UAAU,CAA+B;gBAG/C,OAAO,EAAE,MAAM,EACP,oBAAoB,SAAK;IAcnC,OAAO,CAAC,YAAY;IA4BpB,OAAO,CAAC,UAAU;IAsBlB,OAAO,CAAC,eAAe;IAUjB,UAAU,CAAC,IAAI,EAAE,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC;IAkB1C,UAAU,CAAC,IAAI,EAAE,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC;IAyB1C,WAAW,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAM9C,WAAW,CAAC,KAAK,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC;IAM9C,SAAS,CAAC,SAAS,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;IAqB5E,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,GAAG,IAAI,CAAC;IAgB9C,QAAQ,CAAC,MAAM,EAAE,MAAM,EAAE,SAAS,GAAE,IAAI,GAAG,KAAK,GAAG,MAAe,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;IAkCzF,YAAY,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,CAAC,EAAE,SAAS,CAAC,MAAM,CAAC,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;IAoChF,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,SAAI,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC;IAmDhF,eAAe,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAiBnD,UAAU,CAAC,SAAS,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC;IAU9C,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAItB,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAS5B,OAAO,CAAC,iBAAiB;CAc1B"}

package/dist/storage/embedded/graphology-graph-store.js

@@ -0,0 +1,357 @@
+"use strict";
+/**
+ * Graphology-based Graph Store
+ *
+ * Provides in-memory graph database functionality using graphology with:
+ * - Directed graph for code relationships
+ * - Automatic JSON persistence to disk
+ * - Rich traversal and query capabilities
+ * - Zero external dependencies (no Neo4j server required)
+ *
+ * Persists graph state to JSON file periodically and on close.
+ */
+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;
+    };
+})();
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.GraphologyGraphStore = void 0;
+const graphology_1 = __importDefault(require("graphology"));
+const path = __importStar(require("path"));
+const fs = __importStar(require("fs"));
+class GraphologyGraphStore {
+    flushIntervalSeconds;
+    graph;
+    dataDir;
+    dbPath;
+    isDirty = false;
+    flushTimer = null;
+    constructor(dataDir, flushIntervalSeconds = 30) {
+        this.flushIntervalSeconds = flushIntervalSeconds;
+        this.dataDir = dataDir;
+        this.dbPath = path.join(dataDir, 'graph.json');
+        // Ensure data directory exists
+        fs.mkdirSync(dataDir, { recursive: true });
+        // Create or load graph
+        this.graph = new graphology_1.default({ type: 'directed', allowSelfLoops: false });
+        this.loadFromDisk();
+        this.startFlushTimer();
+    }
+    loadFromDisk() {
+        try {
+            if (fs.existsSync(this.dbPath)) {
+                const data = fs.readFileSync(this.dbPath, 'utf-8');
+                const parsed = JSON.parse(data);
+                // Import nodes
+                if (parsed.nodes) {
+                    for (const node of parsed.nodes) {
+                        this.graph.addNode(node.key, node.attributes);
+                    }
+                }
+                // Import edges
+                if (parsed.edges) {
+                    for (const edge of parsed.edges) {
+                        if (!this.graph.hasEdge(edge.source, edge.target)) {
+                            this.graph.addEdge(edge.source, edge.target, edge.attributes);
+                        }
+                    }
+                }
+            }
+        }
+        catch (error) {
+            console.warn('Failed to load graph from disk, starting fresh:', error);
+            this.graph = new graphology_1.default({ type: 'directed', allowSelfLoops: false });
+        }
+    }
+    saveToDisk() {
+        try {
+            const data = {
+                nodes: this.graph.nodes().map(key => ({
+                    key,
+                    attributes: this.graph.getNodeAttributes(key)
+                })),
+                edges: this.graph.edges().map(key => ({
+                    key,
+                    source: this.graph.source(key),
+                    target: this.graph.target(key),
+                    attributes: this.graph.getEdgeAttributes(key)
+                }))
+            };
+            fs.writeFileSync(this.dbPath, JSON.stringify(data, null, 2), 'utf-8');
+            this.isDirty = false;
+        }
+        catch (error) {
+            console.error('Failed to save graph to disk:', error);
+        }
+    }
+    startFlushTimer() {
+        if (this.flushIntervalSeconds > 0) {
+            this.flushTimer = setInterval(() => {
+                if (this.isDirty) {
+                    this.flush().catch(console.error);
+                }
+            }, this.flushIntervalSeconds * 1000);
+        }
+    }
+    async upsertNode(node) {
+        const attributes = {
+            type: node.type,
+            name: node.name,
+            filePath: node.filePath,
+            projectId: node.projectId,
+            ...node.properties
+        };
+        if (this.graph.hasNode(node.id)) {
+            this.graph.mergeNodeAttributes(node.id, attributes);
+        }
+        else {
+            this.graph.addNode(node.id, attributes);
+        }
+        this.isDirty = true;
+    }
+    async upsertEdge(edge) {
+        // Ensure both nodes exist
+        if (!this.graph.hasNode(edge.source)) {
+            this.graph.addNode(edge.source, {});
+        }
+        if (!this.graph.hasNode(edge.target)) {
+            this.graph.addNode(edge.target, {});
+        }
+        const attributes = {
+            type: edge.type,
+            ...edge.properties
+        };
+        // Check if edge already exists
+        const existingEdge = this.graph.edge(edge.source, edge.target);
+        if (existingEdge) {
+            this.graph.mergeEdgeAttributes(existingEdge, attributes);
+        }
+        else {
+            this.graph.addEdge(edge.source, edge.target, attributes);
+        }
+        this.isDirty = true;
+    }
+    async upsertNodes(nodes) {
+        for (const node of nodes) {
+            await this.upsertNode(node);
+        }
+    }
+    async upsertEdges(edges) {
+        for (const edge of edges) {
+            await this.upsertEdge(edge);
+        }
+    }
+    async findNodes(projectId, type) {
+        const nodes = [];
+        this.graph.forEachNode((nodeId, attributes) => {
+            if (attributes.projectId === projectId) {
+                if (!type || attributes.type === type) {
+                    nodes.push({
+                        id: nodeId,
+                        type: attributes.type,
+                        name: attributes.name,
+                        filePath: attributes.filePath,
+                        projectId: attributes.projectId,
+                        properties: this.extractProperties(attributes)
+                    });
+                }
+            }
+        });
+        return nodes;
+    }
+    async getNode(id) {
+        if (!this.graph.hasNode(id)) {
+            return null;
+        }
+        const attributes = this.graph.getNodeAttributes(id);
+        return {
+            id,
+            type: attributes.type,
+            name: attributes.name,
+            filePath: attributes.filePath,
+            projectId: attributes.projectId,
+            properties: this.extractProperties(attributes)
+        };
+    }
+    async getEdges(nodeId, direction = 'both') {
+        if (!this.graph.hasNode(nodeId)) {
+            return [];
+        }
+        const edges = [];
+        if (direction === 'out' || direction === 'both') {
+            this.graph.forEachOutEdge(nodeId, (edgeId, attributes, source, target) => {
+                edges.push({
+                    id: edgeId,
+                    source,
+                    target,
+                    type: attributes.type,
+                    properties: this.extractProperties(attributes)
+                });
+            });
+        }
+        if (direction === 'in' || direction === 'both') {
+            this.graph.forEachInEdge(nodeId, (edgeId, attributes, source, target) => {
+                edges.push({
+                    id: edgeId,
+                    source,
+                    target,
+                    type: attributes.type,
+                    properties: this.extractProperties(attributes)
+                });
+            });
+        }
+        return edges;
+    }
+    async getNeighbors(nodeId, edgeType) {
+        if (!this.graph.hasNode(nodeId)) {
+            return [];
+        }
+        const neighbors = [];
+        const neighborIds = new Set();
+        this.graph.forEachNeighbor(nodeId, (neighborId, attributes) => {
+            // Check edge type if specified
+            if (edgeType) {
+                const edge = this.graph.edge(nodeId, neighborId) || this.graph.edge(neighborId, nodeId);
+                if (edge) {
+                    const edgeAttrs = this.graph.getEdgeAttributes(edge);
+                    if (edgeAttrs.type !== edgeType) {
+                        return;
+                    }
+                }
+            }
+            if (!neighborIds.has(neighborId)) {
+                neighborIds.add(neighborId);
+                neighbors.push({
+                    id: neighborId,
+                    type: attributes.type,
+                    name: attributes.name,
+                    filePath: attributes.filePath,
+                    projectId: attributes.projectId,
+                    properties: this.extractProperties(attributes)
+                });
+            }
+        });
+        return neighbors;
+    }
+    async findPath(sourceId, targetId, maxDepth = 5) {
+        if (!this.graph.hasNode(sourceId) || !this.graph.hasNode(targetId)) {
+            return [];
+        }
+        // BFS to find shortest path
+        const visited = new Set();
+        const parent = new Map();
+        const queue = [{ id: sourceId, depth: 0 }];
+        visited.add(sourceId);
+        while (queue.length > 0) {
+            const current = queue.shift();
+            if (current.id === targetId) {
+                // Reconstruct path
+                const path = [];
+                let node = targetId;
+                while (node) {
+                    path.unshift(node);
+                    node = parent.get(node);
+                }
+                // Convert to GraphNode[]
+                const result = [];
+                for (const nodeId of path) {
+                    const graphNode = await this.getNode(nodeId);
+                    if (graphNode) {
+                        result.push(graphNode);
+                    }
+                }
+                return result;
+            }
+            if (current.depth >= maxDepth) {
+                continue;
+            }
+            this.graph.forEachNeighbor(current.id, (neighborId) => {
+                if (!visited.has(neighborId)) {
+                    visited.add(neighborId);
+                    parent.set(neighborId, current.id);
+                    queue.push({ id: neighborId, depth: current.depth + 1 });
+                }
+            });
+        }
+        return [];
+    }
+    async deleteByProject(projectId) {
+        const nodesToDelete = [];
+        this.graph.forEachNode((nodeId, attributes) => {
+            if (attributes.projectId === projectId) {
+                nodesToDelete.push(nodeId);
+            }
+        });
+        for (const nodeId of nodesToDelete) {
+            this.graph.dropNode(nodeId);
+        }
+        this.isDirty = true;
+        return nodesToDelete.length;
+    }
+    async countNodes(projectId) {
+        let count = 0;
+        this.graph.forEachNode((_, attributes) => {
+            if (attributes.projectId === projectId) {
+                count++;
+            }
+        });
+        return count;
+    }
+    async flush() {
+        this.saveToDisk();
+    }
+    async close() {
+        if (this.flushTimer) {
+            clearInterval(this.flushTimer);
+            this.flushTimer = null;
+        }
+        await this.flush();
+    }
+    // Extract custom properties from attributes
+    extractProperties(attributes) {
+        const reserved = ['type', 'name', 'filePath', 'projectId'];
+        const properties = {};
+        let hasProperties = false;
+        for (const [key, value] of Object.entries(attributes)) {
+            if (!reserved.includes(key)) {
+                properties[key] = value;
+                hasProperties = true;
+            }
+        }
+        return hasProperties ? properties : undefined;
+    }
+}
+exports.GraphologyGraphStore = GraphologyGraphStore;
+//# sourceMappingURL=graphology-graph-store.js.map

package/dist/storage/embedded/graphology-graph-store.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graphology-graph-store.js","sourceRoot":"","sources":["../../../src/storage/embedded/graphology-graph-store.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;GAUG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAEH,4DAA+B;AAC/B,2CAA6B;AAC7B,uCAAyB;AAOzB,MAAa,oBAAoB;IASrB;IARF,KAAK,CAAQ;IACb,OAAO,CAAS;IAChB,MAAM,CAAS;IACf,OAAO,GAAG,KAAK,CAAC;IAChB,UAAU,GAA0B,IAAI,CAAC;IAEjD,YACE,OAAe,EACP,uBAAuB,EAAE;QAAzB,yBAAoB,GAApB,oBAAoB,CAAK;QAEjC,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QAE/C,+BAA+B;QAC/B,EAAE,CAAC,SAAS,CAAC,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAE3C,uBAAuB;QACvB,IAAI,CAAC,KAAK,GAAG,IAAI,oBAAK,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC,CAAC;QACpE,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,IAAI,CAAC,eAAe,EAAE,CAAC;IACzB,CAAC;IAEO,YAAY;QAClB,IAAI,CAAC;YACH,IAAI,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC/B,MAAM,IAAI,GAAG,EAAE,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;gBACnD,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;gBAEhC,eAAe;gBACf,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;oBACjB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;wBAChC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;oBAChD,CAAC;gBACH,CAAC;gBAED,eAAe;gBACf,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;oBACjB,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;wBAChC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;4BAClD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;wBAChE,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;QACH,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,IAAI,CAAC,iDAAiD,EAAE,KAAK,CAAC,CAAC;YACvE,IAAI,CAAC,KAAK,GAAG,IAAI,oBAAK,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC,CAAC;QACtE,CAAC;IACH,CAAC;IAEO,UAAU;QAChB,IAAI,CAAC;YACH,MAAM,IAAI,GAAG;gBACX,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACpC,GAAG;oBACH,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC;iBAC9C,CAAC,CAAC;gBACH,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;oBACpC,GAAG;oBACH,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC;oBAC9B,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC;oBAC9B,UAAU,EAAE,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC;iBAC9C,CAAC,CAAC;aACJ,CAAC;YAEF,EAAE,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAC;YACtE,IAAI,CAAC,OAAO,GAAG,KAAK,CAAC;QACvB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,OAAO,CAAC,KAAK,CAAC,+BAA+B,EAAE,KAAK,CAAC,CAAC;QACxD,CAAC;IACH,CAAC;IAEO,eAAe;QACrB,IAAI,IAAI,CAAC,oBAAoB,GAAG,CAAC,EAAE,CAAC;YAClC,IAAI,CAAC,UAAU,GAAG,WAAW,CAAC,GAAG,EAAE;gBACjC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;oBACjB,IAAI,CAAC,KAAK,EAAE,CAAC,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;gBACpC,CAAC;YACH,CAAC,EAAE,IAAI,CAAC,oBAAoB,GAAG,IAAI,CAAC,CAAC;QACvC,CAAC;IACH,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,IAAe;QAC9B,MAAM,UAAU,GAAG;YACjB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,GAAG,IAAI,CAAC,UAAU;SACnB,CAAC;QAEF,IAAI,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YAChC,IAAI,CAAC,KAAK,CAAC,mBAAmB,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;QACtD,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,CAAC;QAC1C,CAAC;QAED,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;IACtB,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,IAAe;QAC9B,0BAA0B;QAC1B,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACrC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACtC,CAAC;QACD,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC;YACrC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC,CAAC;QACtC,CAAC;QAED,MAAM,UAAU,GAAG;YACjB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,GAAG,IAAI,CAAC,UAAU;SACnB,CAAC;QAEF,+BAA+B;QAC/B,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QAC/D,IAAI,YAAY,EAAE,CAAC;YACjB,IAAI,CAAC,KAAK,CAAC,mBAAmB,CAAC,YAAY,EAAE,UAAU,CAAC,CAAC;QAC3D,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QAC3D,CAAC;QAED,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;IACtB,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,KAAkB;QAClC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,KAAK,CAAC,WAAW,CAAC,KAAkB;QAClC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;YACzB,MAAM,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,KAAK,CAAC,SAAS,CAAC,SAAiB,EAAE,IAAwB;QACzD,MAAM,KAAK,GAAgB,EAAE,CAAC;QAE9B,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE;YAC5C,IAAI,UAAU,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACvC,IAAI,CAAC,IAAI,IAAI,UAAU,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;oBACtC,KAAK,CAAC,IAAI,CAAC;wBACT,EAAE,EAAE,MAAM;wBACV,IAAI,EAAE,UAAU,CAAC,IAAI;wBACrB,IAAI,EAAE,UAAU,CAAC,IAAI;wBACrB,QAAQ,EAAE,UAAU,CAAC,QAAQ;wBAC7B,SAAS,EAAE,UAAU,CAAC,SAAS;wBAC/B,UAAU,EAAE,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC;qBAC/C,CAAC,CAAC;gBACL,CAAC;YACH,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,OAAO,KAAK,CAAC;IACf,CAAC;IAED,KAAK,CAAC,OAAO,CAAC,EAAU;QACtB,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;YAC5B,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC;QACpD,OAAO;YACL,EAAE;YACF,IAAI,EAAE,UAAU,CAAC,IAAI;YACrB,IAAI,EAAE,UAAU,CAAC,IAAI;YACrB,QAAQ,EAAE,UAAU,CAAC,QAAQ;YAC7B,SAAS,EAAE,UAAU,CAAC,SAAS;YAC/B,UAAU,EAAE,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC;SAC/C,CAAC;IACJ,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,MAAc,EAAE,YAAmC,MAAM;QACtE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAChC,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,KAAK,GAAgB,EAAE,CAAC;QAE9B,IAAI,SAAS,KAAK,KAAK,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YAChD,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE;gBACvE,KAAK,CAAC,IAAI,CAAC;oBACT,EAAE,EAAE,MAAM;oBACV,MAAM;oBACN,MAAM;oBACN,IAAI,EAAE,UAAU,CAAC,IAAI;oBACrB,UAAU,EAAE,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC;iBAC/C,CAAC,CAAC;YACL,CAAC,CAAC,CAAC;QACL,CAAC;QAED,IAAI,SAAS,KAAK,IAAI,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YAC/C,IAAI,CAAC,KAAK,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,MAAM,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,EAAE,EAAE;gBACtE,KAAK,CAAC,IAAI,CAAC;oBACT,EAAE,EAAE,MAAM;oBACV,MAAM;oBACN,MAAM;oBACN,IAAI,EAAE,UAAU,CAAC,IAAI;oBACrB,UAAU,EAAE,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC;iBAC/C,CAAC,CAAC;YACL,CAAC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,KAAK,CAAC,YAAY,CAAC,MAAc,EAAE,QAA4B;QAC7D,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;YAChC,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,SAAS,GAAgB,EAAE,CAAC;QAClC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;QAEtC,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,MAAM,EAAE,CAAC,UAAU,EAAE,UAAU,EAAE,EAAE;YAC5D,+BAA+B;YAC/B,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,UAAU,CAAC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,CAAC,CAAC;gBACxF,IAAI,IAAI,EAAE,CAAC;oBACT,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,iBAAiB,CAAC,IAAI,CAAC,CAAC;oBACrD,IAAI,SAAS,CAAC,IAAI,KAAK,QAAQ,EAAE,CAAC;wBAChC,OAAO;oBACT,CAAC;gBACH,CAAC;YACH,CAAC;YAED,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;gBACjC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;gBAC5B,SAAS,CAAC,IAAI,CAAC;oBACb,EAAE,EAAE,UAAU;oBACd,IAAI,EAAE,UAAU,CAAC,IAAI;oBACrB,IAAI,EAAE,UAAU,CAAC,IAAI;oBACrB,QAAQ,EAAE,UAAU,CAAC,QAAQ;oBAC7B,SAAS,EAAE,UAAU,CAAC,SAAS;oBAC/B,UAAU,EAAE,IAAI,CAAC,iBAAiB,CAAC,UAAU,CAAC;iBAC/C,CAAC,CAAC;YACL,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,KAAK,CAAC,QAAQ,CAAC,QAAgB,EAAE,QAAgB,EAAE,QAAQ,GAAG,CAAC;QAC7D,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;YACnE,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,4BAA4B;QAC5B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;QAClC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;QACzC,MAAM,KAAK,GAAyC,CAAC,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;QAEjF,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;QAEtB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;YAE/B,IAAI,OAAO,CAAC,EAAE,KAAK,QAAQ,EAAE,CAAC;gBAC5B,mBAAmB;gBACnB,MAAM,IAAI,GAAa,EAAE,CAAC;gBAC1B,IAAI,IAAI,GAAuB,QAAQ,CAAC;gBACxC,OAAO,IAAI,EAAE,CAAC;oBACZ,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBACnB,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;gBAC1B,CAAC;gBAED,yBAAyB;gBACzB,MAAM,MAAM,GAAgB,EAAE,CAAC;gBAC/B,KAAK,MAAM,MAAM,IAAI,IAAI,EAAE,CAAC;oBAC1B,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC;oBAC7C,IAAI,SAAS,EAAE,CAAC;wBACd,MAAM,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;oBACzB,CAAC;gBACH,CAAC;gBACD,OAAO,MAAM,CAAC;YAChB,CAAC;YAED,IAAI,OAAO,CAAC,KAAK,IAAI,QAAQ,EAAE,CAAC;gBAC9B,SAAS;YACX,CAAC;YAED,IAAI,CAAC,KAAK,CAAC,eAAe,CAAC,OAAO,CAAC,EAAE,EAAE,CAAC,UAAU,EAAE,EAAE;gBACpD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;oBAC7B,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;oBACxB,MAAM,CAAC,GAAG,CAAC,UAAU,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;oBACnC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,EAAE,CAAC,CAAC;gBAC3D,CAAC;YACH,CAAC,CAAC,CAAC;QACL,CAAC;QAED,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,KAAK,CAAC,eAAe,CAAC,SAAiB;QACrC,MAAM,aAAa,GAAa,EAAE,CAAC;QAEnC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,MAAM,EAAE,UAAU,EAAE,EAAE;YAC5C,IAAI,UAAU,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACvC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC7B,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,KAAK,MAAM,MAAM,IAAI,aAAa,EAAE,CAAC;YACnC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAC9B,CAAC;QAED,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC;QACpB,OAAO,aAAa,CAAC,MAAM,CAAC;IAC9B,CAAC;IAED,KAAK,CAAC,UAAU,CAAC,SAAiB;QAChC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,UAAU,EAAE,EAAE;YACvC,IAAI,UAAU,CAAC,SAAS,KAAK,SAAS,EAAE,CAAC;gBACvC,KAAK,EAAE,CAAC;YACV,CAAC;QACH,CAAC,CAAC,CAAC;QACH,OAAO,KAAK,CAAC;IACf,CAAC;IAED,KAAK,CAAC,KAAK;QACT,IAAI,CAAC,UAAU,EAAE,CAAC;IACpB,CAAC;IAED,KAAK,CAAC,KAAK;QACT,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACpB,aAAa,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;YAC/B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACzB,CAAC;QACD,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;IACrB,CAAC;IAED,4CAA4C;IACpC,iBAAiB,CAAC,UAAmC;QAC3D,MAAM,QAAQ,GAAG,CAAC,MAAM,EAAE,MAAM,EAAE,UAAU,EAAE,WAAW,CAAC,CAAC;QAC3D,MAAM,UAAU,GAA4B,EAAE,CAAC;QAC/C,IAAI,aAAa,GAAG,KAAK,CAAC;QAE1B,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;YACtD,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC5B,UAAU,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;gBACxB,aAAa,GAAG,IAAI,CAAC;YACvB,CAAC;QACH,CAAC;QAED,OAAO,aAAa,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,SAAS,CAAC;IAChD,CAAC;CACF;AA9VD,oDA8VC"}

package/dist/storage/embedded/index.d.ts

@@ -0,0 +1,40 @@
+/**
+ * Embedded Storage Provider
+ *
+ * Zero-infrastructure storage using:
+ * - SQLite + better-sqlite3 for vector search and projects
+ * - Graphology for graph database
+ * - LRU-cache for caching
+ *
+ * All data persists to ~/.codeseeker/data by default.
+ * No Docker, no external services required.
+ */
+import { IStorageProvider, IVectorStore, IGraphStore, ICacheStore, IProjectStore, ITextStore, StorageMode, StorageConfig } from '../interfaces';
+export declare class EmbeddedStorageProvider implements IStorageProvider {
+    private vectorStore;
+    private graphStore;
+    private cacheStore;
+    private projectStore;
+    private dataDir;
+    constructor(config?: StorageConfig);
+    private getDefaultDataDir;
+    getVectorStore(): IVectorStore;
+    getGraphStore(): IGraphStore;
+    getCacheStore(): ICacheStore;
+    getProjectStore(): IProjectStore;
+    getTextStore(): ITextStore;
+    getMode(): StorageMode;
+    getDataDir(): string;
+    flushAll(): Promise<void>;
+    closeAll(): Promise<void>;
+    healthCheck(): Promise<{
+        healthy: boolean;
+        details: Record<string, boolean>;
+    }>;
+}
+export { SQLiteVectorStore } from './sqlite-vector-store';
+export { GraphologyGraphStore } from './graphology-graph-store';
+export { LRUCacheStore } from './lru-cache-store';
+export { SQLiteProjectStore } from './sqlite-project-store';
+export { MiniSearchTextStore } from './minisearch-text-store';
+//# sourceMappingURL=index.d.ts.map

package/dist/storage/embedded/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/storage/embedded/index.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAKH,OAAO,EACL,gBAAgB,EAChB,YAAY,EACZ,WAAW,EACX,WAAW,EACX,aAAa,EACb,UAAU,EACV,WAAW,EACX,aAAa,EACd,MAAM,eAAe,CAAC;AAOvB,qBAAa,uBAAwB,YAAW,gBAAgB;IAC9D,OAAO,CAAC,WAAW,CAAoB;IACvC,OAAO,CAAC,UAAU,CAAuB;IACzC,OAAO,CAAC,UAAU,CAAgB;IAClC,OAAO,CAAC,YAAY,CAAqB;IACzC,OAAO,CAAC,OAAO,CAAS;gBAEZ,MAAM,CAAC,EAAE,aAAa;IAkBlC,OAAO,CAAC,iBAAiB;IAgBzB,cAAc,IAAI,YAAY;IAI9B,aAAa,IAAI,WAAW;IAI5B,aAAa,IAAI,WAAW;IAI5B,eAAe,IAAI,aAAa;IAIhC,YAAY,IAAI,UAAU;IAK1B,OAAO,IAAI,WAAW;IAItB,UAAU,IAAI,MAAM;IAId,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;IASzB,QAAQ,IAAI,OAAO,CAAC,IAAI,CAAC;IASzB,WAAW,IAAI,OAAO,CAAC;QAAE,OAAO,EAAE,OAAO,CAAC;QAAC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAA;KAAE,CAAC;CAcrF;AAGD,OAAO,EAAE,iBAAiB,EAAE,MAAM,uBAAuB,CAAC;AAC1D,OAAO,EAAE,oBAAoB,EAAE,MAAM,0BAA0B,CAAC;AAChE,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,kBAAkB,EAAE,MAAM,wBAAwB,CAAC;AAC5D,OAAO,EAAE,mBAAmB,EAAE,MAAM,yBAAyB,CAAC"}

package/dist/storage/embedded/index.js

@@ -0,0 +1,154 @@
+"use strict";
+/**
+ * Embedded Storage Provider
+ *
+ * Zero-infrastructure storage using:
+ * - SQLite + better-sqlite3 for vector search and projects
+ * - Graphology for graph database
+ * - LRU-cache for caching
+ *
+ * All data persists to ~/.codeseeker/data by default.
+ * No Docker, no external services required.
+ */
+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.MiniSearchTextStore = exports.SQLiteProjectStore = exports.LRUCacheStore = exports.GraphologyGraphStore = exports.SQLiteVectorStore = exports.EmbeddedStorageProvider = void 0;
+const path = __importStar(require("path"));
+const os = __importStar(require("os"));
+const fs = __importStar(require("fs"));
+const sqlite_vector_store_1 = require("./sqlite-vector-store");
+const graphology_graph_store_1 = require("./graphology-graph-store");
+const lru_cache_store_1 = require("./lru-cache-store");
+const sqlite_project_store_1 = require("./sqlite-project-store");
+class EmbeddedStorageProvider {
+    vectorStore;
+    graphStore;
+    cacheStore;
+    projectStore;
+    dataDir;
+    constructor(config) {
+        // Determine data directory
+        this.dataDir = config?.dataDir || this.getDefaultDataDir();
+        // Ensure data directory exists
+        fs.mkdirSync(this.dataDir, { recursive: true });
+        const flushInterval = config?.flushIntervalSeconds ?? 30;
+        // Initialize all stores
+        this.vectorStore = new sqlite_vector_store_1.SQLiteVectorStore(this.dataDir, flushInterval);
+        this.graphStore = new graphology_graph_store_1.GraphologyGraphStore(this.dataDir, flushInterval);
+        this.cacheStore = new lru_cache_store_1.LRUCacheStore(this.dataDir, flushInterval);
+        this.projectStore = new sqlite_project_store_1.SQLiteProjectStore(this.dataDir, flushInterval);
+        // Silent initialization - verbose output handled by CLI when needed
+    }
+    getDefaultDataDir() {
+        // Platform-specific default locations
+        const platform = os.platform();
+        if (platform === 'win32') {
+            // Windows: %APPDATA%\codeseeker\data
+            return path.join(process.env.APPDATA || path.join(os.homedir(), 'AppData', 'Roaming'), 'codeseeker', 'data');
+        }
+        else if (platform === 'darwin') {
+            // macOS: ~/Library/Application Support/codeseeker/data
+            return path.join(os.homedir(), 'Library', 'Application Support', 'codeseeker', 'data');
+        }
+        else {
+            // Linux/Unix: ~/.local/share/codeseeker/data (XDG standard)
+            return path.join(process.env.XDG_DATA_HOME || path.join(os.homedir(), '.local', 'share'), 'codeseeker', 'data');
+        }
+    }
+    getVectorStore() {
+        return this.vectorStore;
+    }
+    getGraphStore() {
+        return this.graphStore;
+    }
+    getCacheStore() {
+        return this.cacheStore;
+    }
+    getProjectStore() {
+        return this.projectStore;
+    }
+    getTextStore() {
+        // Text store is integrated into the vector store (MiniSearch)
+        return this.vectorStore.getTextStore();
+    }
+    getMode() {
+        return 'embedded';
+    }
+    getDataDir() {
+        return this.dataDir;
+    }
+    async flushAll() {
+        await Promise.all([
+            this.vectorStore.flush(),
+            this.graphStore.flush(),
+            this.cacheStore.flush(),
+            this.projectStore.flush()
+        ]);
+    }
+    async closeAll() {
+        await Promise.all([
+            this.vectorStore.close(),
+            this.graphStore.close(),
+            this.cacheStore.close(),
+            this.projectStore.close()
+        ]);
+    }
+    async healthCheck() {
+        const details = {
+            vectorStore: true,
+            graphStore: true,
+            cacheStore: true,
+            projectStore: true
+        };
+        // For embedded storage, all stores are always "healthy" if they initialized
+        return {
+            healthy: true,
+            details
+        };
+    }
+}
+exports.EmbeddedStorageProvider = EmbeddedStorageProvider;
+// Re-export individual stores for direct use
+var sqlite_vector_store_2 = require("./sqlite-vector-store");
+Object.defineProperty(exports, "SQLiteVectorStore", { enumerable: true, get: function () { return sqlite_vector_store_2.SQLiteVectorStore; } });
+var graphology_graph_store_2 = require("./graphology-graph-store");
+Object.defineProperty(exports, "GraphologyGraphStore", { enumerable: true, get: function () { return graphology_graph_store_2.GraphologyGraphStore; } });
+var lru_cache_store_2 = require("./lru-cache-store");
+Object.defineProperty(exports, "LRUCacheStore", { enumerable: true, get: function () { return lru_cache_store_2.LRUCacheStore; } });
+var sqlite_project_store_2 = require("./sqlite-project-store");
+Object.defineProperty(exports, "SQLiteProjectStore", { enumerable: true, get: function () { return sqlite_project_store_2.SQLiteProjectStore; } });
+var minisearch_text_store_1 = require("./minisearch-text-store");
+Object.defineProperty(exports, "MiniSearchTextStore", { enumerable: true, get: function () { return minisearch_text_store_1.MiniSearchTextStore; } });
+//# sourceMappingURL=index.js.map