dbgraph 0.1.0

package/dist/db/sqlite-adapter.d.ts

@@ -0,0 +1,30 @@
+/**
+ * SQLite Adapter
+ *
+ * Thin wrapper over Node's built-in `node:sqlite` (`DatabaseSync`).
+ * Requires Node >= 22.5.
+ */
+export interface SqliteStatement {
+    run(...params: any[]): {
+        changes: number;
+        lastInsertRowid: number | bigint;
+    };
+    get(...params: any[]): any;
+    all(...params: any[]): any[];
+}
+export interface SqliteDatabase {
+    prepare(sql: string): SqliteStatement;
+    exec(sql: string): void;
+    pragma(str: string, options?: {
+        simple?: boolean;
+    }): any;
+    transaction<T>(fn: (...args: any[]) => T): (...args: any[]) => T;
+    close(): void;
+    readonly open: boolean;
+}
+export type SqliteBackend = 'node-sqlite';
+export declare function createDatabase(dbPath: string): {
+    db: SqliteDatabase;
+    backend: SqliteBackend;
+};
+//# sourceMappingURL=sqlite-adapter.d.ts.map

package/dist/db/sqlite-adapter.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"sqlite-adapter.d.ts","sourceRoot":"","sources":["../../src/db/sqlite-adapter.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,MAAM,WAAW,eAAe;IAC9B,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,EAAE,GAAG;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,eAAe,EAAE,MAAM,GAAG,MAAM,CAAA;KAAE,CAAC;IAC7E,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,EAAE,GAAG,GAAG,CAAC;IAC3B,GAAG,CAAC,GAAG,MAAM,EAAE,GAAG,EAAE,GAAG,GAAG,EAAE,CAAC;CAC9B;AAED,MAAM,WAAW,cAAc;IAC7B,OAAO,CAAC,GAAG,EAAE,MAAM,GAAG,eAAe,CAAC;IACtC,IAAI,CAAC,GAAG,EAAE,MAAM,GAAG,IAAI,CAAC;IACxB,MAAM,CAAC,GAAG,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE;QAAE,MAAM,CAAC,EAAE,OAAO,CAAA;KAAE,GAAG,GAAG,CAAC;IACzD,WAAW,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;IACjE,KAAK,IAAI,IAAI,CAAC;IACd,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC;CACxB;AAED,MAAM,MAAM,aAAa,GAAG,aAAa,CAAC;AAiE1C,wBAAgB,cAAc,CAAC,MAAM,EAAE,MAAM,GAAG;IAAE,EAAE,EAAE,cAAc,CAAC;IAAC,OAAO,EAAE,aAAa,CAAA;CAAE,CAW7F"}

package/dist/db/sqlite-adapter.js

@@ -0,0 +1,78 @@
+"use strict";
+/**
+ * SQLite Adapter
+ *
+ * Thin wrapper over Node's built-in `node:sqlite` (`DatabaseSync`).
+ * Requires Node >= 22.5.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.createDatabase = createDatabase;
+class NodeSqliteAdapter {
+    _db;
+    constructor(dbPath) {
+        const { DatabaseSync } = require('node:sqlite');
+        this._db = new DatabaseSync(dbPath);
+    }
+    get open() {
+        return this._db.isOpen;
+    }
+    prepare(sql) {
+        const stmt = this._db.prepare(sql);
+        return {
+            run(...params) {
+                const r = stmt.run(...params);
+                return {
+                    changes: Number(r?.changes ?? 0),
+                    lastInsertRowid: r?.lastInsertRowid ?? 0,
+                };
+            },
+            get(...params) { return stmt.get(...params); },
+            all(...params) { return stmt.all(...params); },
+        };
+    }
+    exec(sql) {
+        this._db.exec(sql);
+    }
+    pragma(str, options) {
+        const trimmed = str.trim();
+        if (trimmed.includes('=')) {
+            this._db.exec(`PRAGMA ${trimmed}`);
+            return;
+        }
+        const row = this._db.prepare(`PRAGMA ${trimmed}`).get();
+        if (options?.simple) {
+            return row && typeof row === 'object' ? Object.values(row)[0] : row;
+        }
+        return row;
+    }
+    transaction(fn) {
+        return (...args) => {
+            this._db.exec('BEGIN');
+            try {
+                const result = fn(...args);
+                this._db.exec('COMMIT');
+                return result;
+            }
+            catch (error) {
+                this._db.exec('ROLLBACK');
+                throw error;
+            }
+        };
+    }
+    close() {
+        if (this._db.isOpen)
+            this._db.close();
+    }
+}
+function createDatabase(dbPath) {
+    try {
+        return { db: new NodeSqliteAdapter(dbPath), backend: 'node-sqlite' };
+    }
+    catch (error) {
+        const msg = error instanceof Error ? error.message : String(error);
+        throw new Error('Failed to open SQLite via node:sqlite module.\n' +
+            'DBGraph requires Node.js 22.5+.\n' +
+            `Error: ${msg}`);
+    }
+}
+//# sourceMappingURL=sqlite-adapter.js.map

package/dist/db/sqlite-adapter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"sqlite-adapter.js","sourceRoot":"","sources":["../../src/db/sqlite-adapter.ts"],"names":[],"mappings":";AAAA;;;;;GAKG;;AAkFH,wCAWC;AA1ED,MAAM,iBAAiB;IACb,GAAG,CAAM;IAEjB,YAAY,MAAc;QACxB,MAAM,EAAE,YAAY,EAAE,GAAG,OAAO,CAAC,aAAa,CAAC,CAAC;QAChD,IAAI,CAAC,GAAG,GAAG,IAAI,YAAY,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;IACzB,CAAC;IAED,OAAO,CAAC,GAAW;QACjB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACnC,OAAO;YACL,GAAG,CAAC,GAAG,MAAa;gBAClB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;gBAC9B,OAAO;oBACL,OAAO,EAAE,MAAM,CAAC,CAAC,EAAE,OAAO,IAAI,CAAC,CAAC;oBAChC,eAAe,EAAE,CAAC,EAAE,eAAe,IAAI,CAAC;iBACzC,CAAC;YACJ,CAAC;YACD,GAAG,CAAC,GAAG,MAAa,IAAI,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;YACrD,GAAG,CAAC,GAAG,MAAa,IAAI,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;SACtD,CAAC;IACJ,CAAC;IAED,IAAI,CAAC,GAAW;QACd,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;IAED,MAAM,CAAC,GAAW,EAAE,OAA8B;QAChD,MAAM,OAAO,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC;QAC3B,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;YAC1B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,OAAO,EAAE,CAAC,CAAC;YACnC,OAAO;QACT,CAAC;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,UAAU,OAAO,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC;QACxD,IAAI,OAAO,EAAE,MAAM,EAAE,CAAC;YACpB,OAAO,GAAG,IAAI,OAAO,GAAG,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QACtE,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IAED,WAAW,CAAI,EAAyB;QACtC,OAAO,CAAC,GAAG,IAAW,EAAE,EAAE;YACxB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACvB,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC;gBAC3B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACxB,OAAO,MAAM,CAAC;YAChB,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;gBAC1B,MAAM,KAAK,CAAC;YACd,CAAC;QACH,CAAC,CAAC;IACJ,CAAC;IAED,KAAK;QACH,IAAI,IAAI,CAAC,GAAG,CAAC,MAAM;YAAE,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC;IACxC,CAAC;CACF;AAED,SAAgB,cAAc,CAAC,MAAc;IAC3C,IAAI,CAAC;QACH,OAAO,EAAE,EAAE,EAAE,IAAI,iBAAiB,CAAC,MAAM,CAAC,EAAE,OAAO,EAAE,aAAa,EAAE,CAAC;IACvE,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,MAAM,GAAG,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACnE,MAAM,IAAI,KAAK,CACb,iDAAiD;YACjD,mCAAmC;YACnC,UAAU,GAAG,EAAE,CAChB,CAAC;IACJ,CAAC;AACH,CAAC"}

package/dist/directory.d.ts

@@ -0,0 +1,37 @@
+/**
+ * Directory Management
+ *
+ * Manages the .dbgraph/ directory structure for DBGraph data.
+ */
+/**
+ * DBGraph directory name
+ */
+export declare const DBGRAPH_DIR = ".dbgraph";
+/**
+ * Get the .dbgraph directory path for a project
+ */
+export declare function getDBGraphDir(projectRoot: string): string;
+/**
+ * Check if a project has been initialized with DBGraph
+ */
+export declare function isInitialized(projectRoot: string): boolean;
+/**
+ * Find the nearest parent directory containing .dbgraph/
+ */
+export declare function findNearestDBGraphRoot(startPath: string): string | null;
+/**
+ * Create the .dbgraph directory structure
+ */
+export declare function createDirectory(projectRoot: string): void;
+/**
+ * Remove the .dbgraph directory
+ */
+export declare function removeDirectory(projectRoot: string): void;
+/**
+ * Validate the .dbgraph directory structure
+ */
+export declare function validateDirectory(projectRoot: string): {
+    valid: boolean;
+    errors: string[];
+};
+//# sourceMappingURL=directory.d.ts.map

package/dist/directory.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"directory.d.ts","sourceRoot":"","sources":["../src/directory.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAKH;;GAEG;AACH,eAAO,MAAM,WAAW,aAAa,CAAC;AAEtC;;GAEG;AACH,wBAAgB,aAAa,CAAC,WAAW,EAAE,MAAM,GAAG,MAAM,CAEzD;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAO1D;AAED;;GAEG;AACH,wBAAgB,sBAAsB,CAAC,SAAS,EAAE,MAAM,GAAG,MAAM,GAAG,IAAI,CAkBvE;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CA8BzD;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,WAAW,EAAE,MAAM,GAAG,IAAI,CAkBzD;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,WAAW,EAAE,MAAM,GAAG;IACtD,KAAK,EAAE,OAAO,CAAC;IACf,MAAM,EAAE,MAAM,EAAE,CAAC;CAClB,CAkBA"}

package/dist/directory.js

@@ -0,0 +1,160 @@
+"use strict";
+/**
+ * Directory Management
+ *
+ * Manages the .dbgraph/ directory structure for DBGraph data.
+ */
+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.DBGRAPH_DIR = void 0;
+exports.getDBGraphDir = getDBGraphDir;
+exports.isInitialized = isInitialized;
+exports.findNearestDBGraphRoot = findNearestDBGraphRoot;
+exports.createDirectory = createDirectory;
+exports.removeDirectory = removeDirectory;
+exports.validateDirectory = validateDirectory;
+const fs = __importStar(require("fs"));
+const path = __importStar(require("path"));
+/**
+ * DBGraph directory name
+ */
+exports.DBGRAPH_DIR = '.dbgraph';
+/**
+ * Get the .dbgraph directory path for a project
+ */
+function getDBGraphDir(projectRoot) {
+    return path.join(projectRoot, exports.DBGRAPH_DIR);
+}
+/**
+ * Check if a project has been initialized with DBGraph
+ */
+function isInitialized(projectRoot) {
+    const dbgraphDir = getDBGraphDir(projectRoot);
+    if (!fs.existsSync(dbgraphDir) || !fs.statSync(dbgraphDir).isDirectory()) {
+        return false;
+    }
+    const dbPath = path.join(dbgraphDir, 'dbgraph.db');
+    return fs.existsSync(dbPath);
+}
+/**
+ * Find the nearest parent directory containing .dbgraph/
+ */
+function findNearestDBGraphRoot(startPath) {
+    let current = path.resolve(startPath);
+    const root = path.parse(current).root;
+    while (current !== root) {
+        if (isInitialized(current)) {
+            return current;
+        }
+        const parent = path.dirname(current);
+        if (parent === current)
+            break;
+        current = parent;
+    }
+    if (isInitialized(current)) {
+        return current;
+    }
+    return null;
+}
+/**
+ * Create the .dbgraph directory structure
+ */
+function createDirectory(projectRoot) {
+    const dbgraphDir = getDBGraphDir(projectRoot);
+    const dbPath = path.join(dbgraphDir, 'dbgraph.db');
+    if (fs.existsSync(dbPath)) {
+        throw new Error(`DBGraph already initialized in ${projectRoot}`);
+    }
+    fs.mkdirSync(dbgraphDir, { recursive: true });
+    // Create .gitignore inside .dbgraph
+    const gitignorePath = path.join(dbgraphDir, '.gitignore');
+    if (!fs.existsSync(gitignorePath)) {
+        const gitignoreContent = [
+            '# DBGraph data files',
+            '# These are local to each machine and should not be committed',
+            '',
+            '# Database',
+            '*.db',
+            '*.db-wal',
+            '*.db-shm',
+            '',
+            '# Cache',
+            'cache/',
+            '',
+            '# Logs',
+            '*.log',
+        ].join('\n');
+        fs.writeFileSync(gitignorePath, gitignoreContent, 'utf-8');
+    }
+}
+/**
+ * Remove the .dbgraph directory
+ */
+function removeDirectory(projectRoot) {
+    const dbgraphDir = getDBGraphDir(projectRoot);
+    if (!fs.existsSync(dbgraphDir)) {
+        return;
+    }
+    const lstat = fs.lstatSync(dbgraphDir);
+    if (lstat.isSymbolicLink()) {
+        fs.unlinkSync(dbgraphDir);
+        return;
+    }
+    if (!lstat.isDirectory()) {
+        fs.unlinkSync(dbgraphDir);
+        return;
+    }
+    fs.rmSync(dbgraphDir, { recursive: true, force: true });
+}
+/**
+ * Validate the .dbgraph directory structure
+ */
+function validateDirectory(projectRoot) {
+    const errors = [];
+    const dbgraphDir = getDBGraphDir(projectRoot);
+    if (!fs.existsSync(dbgraphDir)) {
+        errors.push('DBGraph directory does not exist');
+        return { valid: false, errors };
+    }
+    if (!fs.statSync(dbgraphDir).isDirectory()) {
+        errors.push('.dbgraph exists but is not a directory');
+        return { valid: false, errors };
+    }
+    return {
+        valid: errors.length === 0,
+        errors,
+    };
+}
+//# sourceMappingURL=directory.js.map

package/dist/directory.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"directory.js","sourceRoot":"","sources":["../src/directory.ts"],"names":[],"mappings":";AAAA;;;;GAIG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAaH,sCAEC;AAKD,sCAOC;AAKD,wDAkBC;AAKD,0CA8BC;AAKD,0CAkBC;AAKD,8CAqBC;AApID,uCAAyB;AACzB,2CAA6B;AAE7B;;GAEG;AACU,QAAA,WAAW,GAAG,UAAU,CAAC;AAEtC;;GAEG;AACH,SAAgB,aAAa,CAAC,WAAmB;IAC/C,OAAO,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,mBAAW,CAAC,CAAC;AAC7C,CAAC;AAED;;GAEG;AACH,SAAgB,aAAa,CAAC,WAAmB;IAC/C,MAAM,UAAU,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;IAC9C,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC;QACzE,OAAO,KAAK,CAAC;IACf,CAAC;IACD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;IACnD,OAAO,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;AAC/B,CAAC;AAED;;GAEG;AACH,SAAgB,sBAAsB,CAAC,SAAiB;IACtD,IAAI,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IACtC,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC;IAEtC,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;QACxB,IAAI,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC;YAC3B,OAAO,OAAO,CAAC;QACjB,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACrC,IAAI,MAAM,KAAK,OAAO;YAAE,MAAM;QAC9B,OAAO,GAAG,MAAM,CAAC;IACnB,CAAC;IAED,IAAI,aAAa,CAAC,OAAO,CAAC,EAAE,CAAC;QAC3B,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,SAAgB,eAAe,CAAC,WAAmB;IACjD,MAAM,UAAU,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;IAC9C,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;IAEnD,IAAI,EAAE,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,kCAAkC,WAAW,EAAE,CAAC,CAAC;IACnE,CAAC;IAED,EAAE,CAAC,SAAS,CAAC,UAAU,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAE9C,oCAAoC;IACpC,MAAM,aAAa,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,YAAY,CAAC,CAAC;IAC1D,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,aAAa,CAAC,EAAE,CAAC;QAClC,MAAM,gBAAgB,GAAG;YACvB,sBAAsB;YACtB,+DAA+D;YAC/D,EAAE;YACF,YAAY;YACZ,MAAM;YACN,UAAU;YACV,UAAU;YACV,EAAE;YACF,SAAS;YACT,QAAQ;YACR,EAAE;YACF,QAAQ;YACR,OAAO;SACR,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACb,EAAE,CAAC,aAAa,CAAC,aAAa,EAAE,gBAAgB,EAAE,OAAO,CAAC,CAAC;IAC7D,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAgB,eAAe,CAAC,WAAmB;IACjD,MAAM,UAAU,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;IAC9C,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;QAC/B,OAAO;IACT,CAAC;IAED,MAAM,KAAK,GAAG,EAAE,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;IACvC,IAAI,KAAK,CAAC,cAAc,EAAE,EAAE,CAAC;QAC3B,EAAE,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QAC1B,OAAO;IACT,CAAC;IAED,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,EAAE,CAAC;QACzB,EAAE,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;QAC1B,OAAO;IACT,CAAC;IAED,EAAE,CAAC,MAAM,CAAC,UAAU,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAC;AAC1D,CAAC;AAED;;GAEG;AACH,SAAgB,iBAAiB,CAAC,WAAmB;IAInD,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,UAAU,GAAG,aAAa,CAAC,WAAW,CAAC,CAAC;IAE9C,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;QAC/B,MAAM,CAAC,IAAI,CAAC,kCAAkC,CAAC,CAAC;QAChD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAClC,CAAC;IAED,IAAI,CAAC,EAAE,CAAC,QAAQ,CAAC,UAAU,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC;QAC3C,MAAM,CAAC,IAAI,CAAC,wCAAwC,CAAC,CAAC;QACtD,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,CAAC;IAClC,CAAC;IAED,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,MAAM,KAAK,CAAC;QAC1B,MAAM;KACP,CAAC;AACJ,CAAC"}

package/dist/errors.d.ts

@@ -0,0 +1,46 @@
+/**
+ * DBGraph Error Classes
+ */
+/**
+ * Base error class for all DBGraph errors
+ */
+export declare class DBGraphError extends Error {
+    readonly code: string;
+    readonly context?: Record<string, unknown>;
+    constructor(message: string, code: string, context?: Record<string, unknown>);
+}
+/**
+ * Error with database introspection
+ */
+export declare class IntrospectError extends DBGraphError {
+    readonly source: string;
+    constructor(message: string, source: string, cause?: Error);
+}
+/**
+ * Error with database operations
+ */
+export declare class DatabaseError extends DBGraphError {
+    readonly operation: string;
+    constructor(message: string, operation: string, cause?: Error);
+}
+/**
+ * Error with search operations
+ */
+export declare class SearchError extends DBGraphError {
+    readonly query: string;
+    constructor(message: string, query: string, cause?: Error);
+}
+/**
+ * Error with configuration
+ */
+export declare class ConfigError extends DBGraphError {
+    constructor(message: string, details?: Record<string, unknown>);
+}
+/**
+ * Error with database connection
+ */
+export declare class ConnectionError extends DBGraphError {
+    readonly source: string;
+    constructor(message: string, source: string, cause?: Error);
+}
+//# sourceMappingURL=errors.d.ts.map

package/dist/errors.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"errors.d.ts","sourceRoot":"","sources":["../src/errors.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH;;GAEG;AACH,qBAAa,YAAa,SAAQ,KAAK;IACrC,QAAQ,CAAC,IAAI,EAAE,MAAM,CAAC;IACtB,QAAQ,CAAC,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;gBAE/B,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAS7E;AAED;;GAEG;AACH,qBAAa,eAAgB,SAAQ,YAAY;IAC/C,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;gBAEZ,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,KAAK;CAM3D;AAED;;GAEG;AACH,qBAAa,aAAc,SAAQ,YAAY;IAC7C,QAAQ,CAAC,SAAS,EAAE,MAAM,CAAC;gBAEf,OAAO,EAAE,MAAM,EAAE,SAAS,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,KAAK;CAM9D;AAED;;GAEG;AACH,qBAAa,WAAY,SAAQ,YAAY;IAC3C,QAAQ,CAAC,KAAK,EAAE,MAAM,CAAC;gBAEX,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,KAAK;CAM1D;AAED;;GAEG;AACH,qBAAa,WAAY,SAAQ,YAAY;gBAC/B,OAAO,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC;CAI/D;AAED;;GAEG;AACH,qBAAa,eAAgB,SAAQ,YAAY;IAC/C,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC;gBAEZ,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,KAAK;CAM3D"}

package/dist/errors.js

@@ -0,0 +1,90 @@
+"use strict";
+/**
+ * DBGraph Error Classes
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ConnectionError = exports.ConfigError = exports.SearchError = exports.DatabaseError = exports.IntrospectError = exports.DBGraphError = void 0;
+/**
+ * Base error class for all DBGraph errors
+ */
+class DBGraphError extends Error {
+    code;
+    context;
+    constructor(message, code, context) {
+        super(message);
+        this.name = 'DBGraphError';
+        this.code = code;
+        this.context = context;
+        if (Error.captureStackTrace) {
+            Error.captureStackTrace(this, this.constructor);
+        }
+    }
+}
+exports.DBGraphError = DBGraphError;
+/**
+ * Error with database introspection
+ */
+class IntrospectError extends DBGraphError {
+    source;
+    constructor(message, source, cause) {
+        super(message, 'INTROSPECT_ERROR', { source, cause: cause?.message });
+        this.name = 'IntrospectError';
+        this.source = source;
+        if (cause)
+            this.cause = cause;
+    }
+}
+exports.IntrospectError = IntrospectError;
+/**
+ * Error with database operations
+ */
+class DatabaseError extends DBGraphError {
+    operation;
+    constructor(message, operation, cause) {
+        super(message, 'DATABASE_ERROR', { operation, cause: cause?.message });
+        this.name = 'DatabaseError';
+        this.operation = operation;
+        if (cause)
+            this.cause = cause;
+    }
+}
+exports.DatabaseError = DatabaseError;
+/**
+ * Error with search operations
+ */
+class SearchError extends DBGraphError {
+    query;
+    constructor(message, query, cause) {
+        super(message, 'SEARCH_ERROR', { query, cause: cause?.message });
+        this.name = 'SearchError';
+        this.query = query;
+        if (cause)
+            this.cause = cause;
+    }
+}
+exports.SearchError = SearchError;
+/**
+ * Error with configuration
+ */
+class ConfigError extends DBGraphError {
+    constructor(message, details) {
+        super(message, 'CONFIG_ERROR', details);
+        this.name = 'ConfigError';
+    }
+}
+exports.ConfigError = ConfigError;
+/**
+ * Error with database connection
+ */
+class ConnectionError extends DBGraphError {
+    source;
+    constructor(message, source, cause) {
+        super(message, 'CONNECTION_ERROR', { source, cause: cause?.message });
+        this.name = 'ConnectionError';
+        this.source = source;
+        if (cause)
+            this.cause = cause;
+    }
+}
+exports.ConnectionError = ConnectionError;
+//# sourceMappingURL=errors.js.map

package/dist/errors.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"errors.js","sourceRoot":"","sources":["../src/errors.ts"],"names":[],"mappings":";AAAA;;GAEG;;;AAEH;;GAEG;AACH,MAAa,YAAa,SAAQ,KAAK;IAC5B,IAAI,CAAS;IACb,OAAO,CAA2B;IAE3C,YAAY,OAAe,EAAE,IAAY,EAAE,OAAiC;QAC1E,KAAK,CAAC,OAAO,CAAC,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,cAAc,CAAC;QAC3B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,KAAK,CAAC,iBAAiB,EAAE,CAAC;YAC5B,KAAK,CAAC,iBAAiB,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;CACF;AAbD,oCAaC;AAED;;GAEG;AACH,MAAa,eAAgB,SAAQ,YAAY;IACtC,MAAM,CAAS;IAExB,YAAY,OAAe,EAAE,MAAc,EAAE,KAAa;QACxD,KAAK,CAAC,OAAO,EAAE,kBAAkB,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;QACtE,IAAI,CAAC,IAAI,GAAG,iBAAiB,CAAC;QAC9B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,KAAK;YAAE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IAChC,CAAC;CACF;AATD,0CASC;AAED;;GAEG;AACH,MAAa,aAAc,SAAQ,YAAY;IACpC,SAAS,CAAS;IAE3B,YAAY,OAAe,EAAE,SAAiB,EAAE,KAAa;QAC3D,KAAK,CAAC,OAAO,EAAE,gBAAgB,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;QACvE,IAAI,CAAC,IAAI,GAAG,eAAe,CAAC;QAC5B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,KAAK;YAAE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IAChC,CAAC;CACF;AATD,sCASC;AAED;;GAEG;AACH,MAAa,WAAY,SAAQ,YAAY;IAClC,KAAK,CAAS;IAEvB,YAAY,OAAe,EAAE,KAAa,EAAE,KAAa;QACvD,KAAK,CAAC,OAAO,EAAE,cAAc,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;QACjE,IAAI,CAAC,IAAI,GAAG,aAAa,CAAC;QAC1B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,KAAK;YAAE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IAChC,CAAC;CACF;AATD,kCASC;AAED;;GAEG;AACH,MAAa,WAAY,SAAQ,YAAY;IAC3C,YAAY,OAAe,EAAE,OAAiC;QAC5D,KAAK,CAAC,OAAO,EAAE,cAAc,EAAE,OAAO,CAAC,CAAC;QACxC,IAAI,CAAC,IAAI,GAAG,aAAa,CAAC;IAC5B,CAAC;CACF;AALD,kCAKC;AAED;;GAEG;AACH,MAAa,eAAgB,SAAQ,YAAY;IACtC,MAAM,CAAS;IAExB,YAAY,OAAe,EAAE,MAAc,EAAE,KAAa;QACxD,KAAK,CAAC,OAAO,EAAE,kBAAkB,EAAE,EAAE,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,CAAC,CAAC;QACtE,IAAI,CAAC,IAAI,GAAG,iBAAiB,CAAC;QAC9B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;QACrB,IAAI,KAAK;YAAE,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IAChC,CAAC;CACF;AATD,0CASC"}

package/dist/graph/traversal.d.ts

@@ -0,0 +1,157 @@
+/**
+ * Graph Traversal Algorithms
+ *
+ * BFS and DFS traversal for the database schema knowledge graph.
+ * Operates on nodes/edges stored in SQLite via QueryBuilder.
+ *
+ * All traversal methods use batch node lookups (getNodesByIds) to avoid
+ * N+1 query patterns and maintain performance on large schemas.
+ */
+import { Node, Edge, Subgraph, TraversalOptions, EdgeKind } from '../types';
+import { QueryBuilder } from '../db/queries';
+/**
+ * Graph traverser for BFS and DFS traversal of the database schema graph.
+ *
+ * Provides methods to navigate the graph structure — containment hierarchies,
+ * foreign-key references, and impact analysis — all with batched queries.
+ */
+export declare class GraphTraverser {
+    private queries;
+    constructor(queries: QueryBuilder);
+    /**
+     * Traverse the graph using breadth-first search.
+     *
+     * Structural edges (`contains`) are visited before reference edges so that
+     * BFS discovers internal structure first before fanning out.
+     *
+     * @param startId - Starting node ID
+     * @param options - Traversal options
+     * @returns Subgraph containing traversed nodes and edges
+     */
+    traverseBFS(startId: string, options?: TraversalOptions): Subgraph;
+    /**
+     * Traverse the graph using depth-first search.
+     *
+     * @param startId - Starting node ID
+     * @param options - Traversal options
+     * @returns Subgraph containing traversed nodes and edges
+     */
+    traverseDFS(startId: string, options?: TraversalOptions): Subgraph;
+    /**
+     * Recursive DFS helper with batch neighbor fetching.
+     */
+    private dfsRecursive;
+    /**
+     * Get adjacent edges based on direction.
+     */
+    private getAdjacentEdges;
+    /**
+     * Find all nodes that reference a given node (e.g., tables with foreign keys
+     * pointing to this table, or views referencing this table).
+     *
+     * Follows `references` edges incoming to the target.
+     *
+     * @param nodeId - ID of the node being referenced
+     * @param maxDepth - Maximum depth to traverse (default: 1)
+     * @returns Array of { caller node, edge } pairs
+     */
+    getCallers(nodeId: string, maxDepth?: number): Array<{
+        node: Node;
+        edge: Edge;
+    }>;
+    private getCallersRecursive;
+    /**
+     * Find all nodes referenced by a given node (e.g., tables this foreign key
+     * points to, tables this view depends on).
+     *
+     * Follows `references` edges outgoing from the source.
+     *
+     * @param nodeId - ID of the source node
+     * @param maxDepth - Maximum depth to traverse (default: 1)
+     * @returns Array of { callee node, edge } pairs
+     */
+    getCallees(nodeId: string, maxDepth?: number): Array<{
+        node: Node;
+        edge: Edge;
+    }>;
+    private getCalleesRecursive;
+    /**
+     * Find all usages of a node — all incoming edges regardless of kind.
+     *
+     * This returns every node that has any edge pointing to the given node,
+     * including foreign key references, dependencies, and structural containment.
+     *
+     * @param nodeId - ID of the node being examined
+     * @returns Array of { using node, edge } pairs
+     */
+    findUsages(nodeId: string): Array<{
+        node: Node;
+        edge: Edge;
+    }>;
+    /**
+     * Compute the impact radius of a node — all nodes that could be affected
+     * if this schema object changes.
+     *
+     * Traverses incoming edges (dependents), including following `contains`
+     * edges into container children (e.g., a column change impacts the table's
+     * foreign-key dependents).
+     *
+     * @param nodeId - ID of the node being changed
+     * @param maxDepth - Maximum depth to traverse (default: 3)
+     * @returns Subgraph containing potentially impacted nodes
+     */
+    getImpactRadius(nodeId: string, maxDepth?: number): Subgraph;
+    /**
+     * Recursive impact traversal — follows incoming edges and also descends
+     * into container children (e.g., table → columns → FK references).
+     */
+    private getImpactRecursive;
+    /**
+     * Find the shortest path between two nodes using bidirectional BFS.
+     *
+     * Each step follows outgoing edges from the direction being expanded.
+     * Returns the path as an ordered array of { node, edge } steps, where
+     * the first entry's `edge` is null (the start node has no incoming edge).
+     *
+     * @param fromId - Starting node ID
+     * @param toId - Target node ID
+     * @param edgeKinds - Edge types to consider (all if empty array)
+     * @returns Ordered path, or null if no path exists
+     */
+    findPath(fromId: string, toId: string, edgeKinds?: EdgeKind[]): Array<{
+        node: Node;
+        edge: Edge | null;
+    }> | null;
+    /**
+     * Expand one frontier of the bidirectional BFS by one layer.
+     *
+     * Returns the meeting node ID if frontiers intersect, or null otherwise.
+     */
+    private expandPathFrontier;
+    /**
+     * Merge forward and backward path fragments at the meeting node.
+     */
+    private mergePaths;
+    /**
+     * Walk up the containment hierarchy from a node to its ancestors.
+     *
+     * Follows `contains` edges in reverse (incoming edges of kind `contains`),
+     * which represent "parent → child" — so the incoming edge on this node
+     * points to its parent.
+     *
+     * @param nodeId - ID of the node to start from
+     * @returns Array of ancestor nodes from immediate parent to root
+     */
+    getAncestors(nodeId: string): Node[];
+    /**
+     * Get immediate children of a node via `contains` outgoing edges.
+     *
+     * For a table, these would be its columns, indexes, constraints, etc.
+     * For a schema, these would be its tables and views.
+     *
+     * @param nodeId - ID of the parent node
+     * @returns Array of child nodes
+     */
+    getChildren(nodeId: string): Node[];
+}
+//# sourceMappingURL=traversal.d.ts.map

package/dist/graph/traversal.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"traversal.d.ts","sourceRoot":"","sources":["../../src/graph/traversal.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,EAAE,IAAI,EAAY,IAAI,EAAE,QAAQ,EAAE,gBAAgB,EAAE,QAAQ,EAAE,MAAM,UAAU,CAAC;AACtF,OAAO,EAAE,YAAY,EAAE,MAAM,eAAe,CAAC;AAuB7C;;;;;GAKG;AACH,qBAAa,cAAc;IACzB,OAAO,CAAC,OAAO,CAAe;gBAElB,OAAO,EAAE,YAAY;IAQjC;;;;;;;;;OASG;IACH,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,GAAE,gBAAqB,GAAG,QAAQ;IAwEtE;;;;;;OAMG;IACH,WAAW,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,GAAE,gBAAqB,GAAG,QAAQ;IAyBtE;;OAEG;IACH,OAAO,CAAC,YAAY;IA0CpB;;OAEG;IACH,OAAO,CAAC,gBAAgB;IAsBxB;;;;;;;;;OASG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAU,GAAG,KAAK,CAAC;QAAE,IAAI,EAAE,IAAI,CAAC;QAAC,IAAI,EAAE,IAAI,CAAA;KAAE,CAAC;IASnF,OAAO,CAAC,mBAAmB;IA4B3B;;;;;;;;;OASG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAU,GAAG,KAAK,CAAC;QAAE,IAAI,EAAE,IAAI,CAAC;QAAC,IAAI,EAAE,IAAI,CAAA;KAAE,CAAC;IASnF,OAAO,CAAC,mBAAmB;IAgC3B;;;;;;;;OAQG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,GAAG,KAAK,CAAC;QAAE,IAAI,EAAE,IAAI,CAAC;QAAC,IAAI,EAAE,IAAI,CAAA;KAAE,CAAC;IAgB7D;;;;;;;;;;;OAWG;IACH,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,QAAQ,GAAE,MAAU,GAAG,QAAQ;IAsB/D;;;OAGG;IACH,OAAO,CAAC,kBAAkB;IAuD1B;;;;;;;;;;;OAWG;IACH,QAAQ,CACN,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,EACZ,SAAS,GAAE,QAAQ,EAAO,GACzB,KAAK,CAAC;QAAE,IAAI,EAAE,IAAI,CAAC;QAAC,IAAI,EAAE,IAAI,GAAG,IAAI,CAAA;KAAE,CAAC,GAAG,IAAI;IA8ClD;;;;OAIG;IACH,OAAO,CAAC,kBAAkB;IAmE1B;;OAEG;IACH,OAAO,CAAC,UAAU;IAmBlB;;;;;;;;;OASG;IACH,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,EAAE;IAgCpC;;;;;;;;OAQG;IACH,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,EAAE;CAapC"}