ariadne-mcp 0.1.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2025 Madan Gopal
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
+OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
+SOFTWARE.

package/README.md

@@ -0,0 +1,113 @@
+# Ariadne
+
+**IDE-grade code navigation for AI agents — as an MCP server.**
+
+Ariadne indexes your codebase into a local graph and exposes it as [MCP](https://modelcontextprotocol.io) tools, so coding agents like Claude can navigate your code structurally instead of grepping raw text.
+
+```
+get_definition("processPayment")   →  payments/service.ts:142
+get_callers("processPayment")      →  [checkout.controller.ts:88, retry.worker.ts:34]
+get_call_path("checkout", "save")  →  checkout → processPayment → repository.save
+```
+
+## Why
+
+When Claude (or any coding agent) needs to understand a codebase, it typically:
+- Greps for symbol names across thousands of files
+- Reads entire files to find one function
+- Loses the thread across long call chains
+
+This burns tokens fast and produces shallow answers. Ariadne gives agents the same navigation primitives an IDE has — go-to-definition, find-references, call hierarchy — but queryable over MCP.
+
+**Same question, different approach:**
+
+| Without Ariadne | With Ariadne |
+|---|---|
+| Grep 8 files, read 4 in full | 3 tool calls |
+| ~8,000 tokens | ~400 tokens |
+| Guesses at call chains | Exact paths from SCIP index |
+
+## Setup
+
+Add this to your MCP config (Claude Desktop, Cursor, or any MCP-compatible editor) — once, and never touch it again:
+
+```json
+{
+  "mcpServers": {
+    "ariadne": {
+      "command": "npx",
+      "args": ["-y", "ariadne"]
+    }
+  }
+}
+```
+
+That's it. Ariadne is spawned as a subprocess and inherits the editor's working directory (your project root). No flags, no paths, no configuration.
+
+## What happens on first run
+
+```
+→ Detecting languages... found TypeScript
+→ Reusing existing TypeScript SCIP index (< 24 h old).
+→ Loading TypeScript/JavaScript index...
+→ Graph ready: 148,363 symbols, 364,387 edges
+→ Ariadne ready.
+```
+
+- **First startup**: runs `scip-typescript` or `scip-python` to build a full semantic index (5–10 min for large repos, auto-installed via npx/pip)
+- **Subsequent startups**: reuses the cached `.scip` file if < 24h old — loads in ~10s
+- **File saves**: tree-sitter patches the graph incrementally within ~150ms
+
+## MCP Tools
+
+| Tool | Description |
+|---|---|
+| `get_definition` | Where is this symbol defined? File, line, signature |
+| `get_source_definition` | Same, but skips barrel/re-export files |
+| `get_callers` | Every call site that invokes this symbol |
+| `get_callees` | Every symbol this function calls |
+| `get_call_path` | Shortest call chain between two symbols |
+| `get_references` | Every usage across the repo |
+| `get_implementations` | All classes implementing this interface |
+| `get_type_definition` | Where the type of this symbol is defined |
+| `get_file_symbols` | Full symbol map of a file |
+| `get_index_status` | Current indexing state — check this if tools return empty results |
+
+## Supported Languages
+
+| Language | Full index (SCIP) | Incremental (tree-sitter) |
+|---|---|---|
+| TypeScript / TSX | ✅ | ✅ |
+| JavaScript / JSX | ✅ | ✅ |
+| Python | ✅ | ✅ |
+
+## How it works
+
+```
+npx ariadne
+  → process.cwd()                    repo root (inherited from editor)
+  → scip-typescript / scip-python    full semantic index → .ariadne/index.scip
+  → loadScipIndex()                  symbols + edges → .ariadne/graph.db (SQLite)
+  → chokidar watcher                 incremental tree-sitter patches on file save
+  → MCP stdio transport              ready for tool calls
+```
+
+- **SCIP** ([Semantic Code Intelligence Protocol](https://github.com/sourcegraph/scip)) produces cross-file symbol resolution — something tree-sitter alone can't do
+- **SQLite** (via `better-sqlite3`) stores the graph — fast point lookups, no server required
+- **tree-sitter** patches individual files on save between SCIP runs
+
+Graph lives at `<repo>/.ariadne/graph.db` — add `.ariadne/` to your `.gitignore`.
+
+## Requirements
+
+- Node.js 20+
+- For TypeScript/JavaScript indexing: nothing extra (scip-typescript installed via npx)
+- For Python indexing: Python 3.8+ with pip (scip-python installed via pip)
+
+## Contributing
+
+See [CONTRIBUTING.md](CONTRIBUTING.md).
+
+## License
+
+[MIT](LICENSE)

package/dist/graph/db.d.ts

@@ -0,0 +1,26 @@
+import Database from "better-sqlite3";
+export type { Database };
+/**
+ * Open (or create) the graph database at <repoRoot>/.ariadne/graph.db.
+ * Applies WAL mode, safety PRAGMAs, and runs all schema statements.
+ * Safe to call multiple times — subsequent calls are no-ops.
+ */
+export declare function init(repoRoot: string): Promise<void>;
+/**
+ * Returns the active SQLite database.
+ * Throws if init() has not been called yet.
+ */
+export declare function getDb(): Database.Database;
+/**
+ * Close the database synchronously.
+ */
+export declare function close(): void;
+/**
+ * Close the DB, delete all related files (graph.db, WAL, SHM), then reopen
+ * a fresh empty database.  Used before a full re-index so stale data from a
+ * prior partial load doesn't persist.
+ *
+ * SQLite WAL files are named graph.db-wal and graph.db-shm (unlike DuckDB).
+ */
+export declare function wipAndReinit(repoRoot: string): Promise<void>;
+//# sourceMappingURL=db.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"db.d.ts","sourceRoot":"","sources":["../../src/graph/db.ts"],"names":[],"mappings":"AAGA,OAAO,QAAQ,MAAM,gBAAgB,CAAC;AAKtC,YAAY,EAAE,QAAQ,EAAE,CAAC;AAIzB;;;;GAIG;AACH,wBAAsB,IAAI,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CA8B1D;AAED;;;GAGG;AACH,wBAAgB,KAAK,IAAI,QAAQ,CAAC,QAAQ,CAGzC;AAED;;GAEG;AACH,wBAAgB,KAAK,IAAI,IAAI,CAI5B;AAED;;;;;;GAMG;AACH,wBAAsB,YAAY,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAalE"}

package/dist/graph/db.js

@@ -0,0 +1,84 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.init = init;
+exports.getDb = getDb;
+exports.close = close;
+exports.wipAndReinit = wipAndReinit;
+// Singleton better-sqlite3 connection for the lifetime of the process.
+const promises_1 = __importDefault(require("node:fs/promises"));
+const node_path_1 = __importDefault(require("node:path"));
+const better_sqlite3_1 = __importDefault(require("better-sqlite3"));
+const schema_js_1 = require("./schema.js");
+let _db = null;
+/**
+ * Open (or create) the graph database at <repoRoot>/.ariadne/graph.db.
+ * Applies WAL mode, safety PRAGMAs, and runs all schema statements.
+ * Safe to call multiple times — subsequent calls are no-ops.
+ */
+async function init(repoRoot) {
+    if (_db)
+        return;
+    const ariadneDir = node_path_1.default.join(repoRoot, ".ariadne");
+    await promises_1.default.mkdir(ariadneDir, { recursive: true });
+    const dbPath = node_path_1.default.join(ariadneDir, "graph.db");
+    const db = new better_sqlite3_1.default(dbPath);
+    // WAL mode: multiple concurrent readers never block each other, and readers
+    // don't block the writer.  Auto-recovers the WAL on open after a crash —
+    // no manual CHECKPOINT required unlike DuckDB.
+    db.pragma("journal_mode = WAL");
+    // NORMAL: safe on crash (no corruption), only risks losing the last partial
+    // uncommitted transaction — acceptable for an index that can be rebuilt.
+    db.pragma("synchronous = NORMAL");
+    // Wait up to 5 s before throwing SQLITE_BUSY instead of failing immediately.
+    db.pragma("busy_timeout = 5000");
+    // 64 MB page cache in memory.
+    db.pragma("cache_size = -64000");
+    // Keep temp tables in memory.
+    db.pragma("temp_store = MEMORY");
+    // 256 MB memory-mapped I/O for faster reads on large DBs.
+    db.pragma("mmap_size = 268435456");
+    for (const sql of schema_js_1.ALL_SCHEMA_STATEMENTS) {
+        db.exec(sql);
+    }
+    _db = db;
+}
+/**
+ * Returns the active SQLite database.
+ * Throws if init() has not been called yet.
+ */
+function getDb() {
+    if (!_db)
+        throw new Error("DB not initialised — call init() first");
+    return _db;
+}
+/**
+ * Close the database synchronously.
+ */
+function close() {
+    if (!_db)
+        return;
+    _db.close();
+    _db = null;
+}
+/**
+ * Close the DB, delete all related files (graph.db, WAL, SHM), then reopen
+ * a fresh empty database.  Used before a full re-index so stale data from a
+ * prior partial load doesn't persist.
+ *
+ * SQLite WAL files are named graph.db-wal and graph.db-shm (unlike DuckDB).
+ */
+async function wipAndReinit(repoRoot) {
+    const ariadneDir = node_path_1.default.join(repoRoot, ".ariadne");
+    const dbPath = node_path_1.default.join(ariadneDir, "graph.db");
+    close();
+    await Promise.all([
+        promises_1.default.rm(dbPath, { force: true }),
+        promises_1.default.rm(dbPath + "-wal", { force: true }),
+        promises_1.default.rm(dbPath + "-shm", { force: true }),
+    ]);
+    await init(repoRoot);
+}
+//# sourceMappingURL=db.js.map

package/dist/graph/db.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"db.js","sourceRoot":"","sources":["../../src/graph/db.ts"],"names":[],"mappings":";;;;;AAiBA,oBA8BC;AAMD,sBAGC;AAKD,sBAIC;AASD,oCAaC;AAvFD,uEAAuE;AACvE,gEAAkC;AAClC,0DAA6B;AAC7B,oEAAsC;AACtC,2CAAoD;AAMpD,IAAI,GAAG,GAA6B,IAAI,CAAC;AAEzC;;;;GAIG;AACI,KAAK,UAAU,IAAI,CAAC,QAAgB;IACzC,IAAI,GAAG;QAAE,OAAO;IAEhB,MAAM,UAAU,GAAG,mBAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;IACnD,MAAM,kBAAE,CAAC,KAAK,CAAC,UAAU,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IAEhD,MAAM,MAAM,GAAG,mBAAI,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IACjD,MAAM,EAAE,GAAG,IAAI,wBAAQ,CAAC,MAAM,CAAC,CAAC;IAEhC,4EAA4E;IAC5E,yEAAyE;IACzE,+CAA+C;IAC/C,EAAE,CAAC,MAAM,CAAC,oBAAoB,CAAC,CAAC;IAChC,4EAA4E;IAC5E,yEAAyE;IACzE,EAAE,CAAC,MAAM,CAAC,sBAAsB,CAAC,CAAC;IAClC,6EAA6E;IAC7E,EAAE,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC;IACjC,8BAA8B;IAC9B,EAAE,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC;IACjC,8BAA8B;IAC9B,EAAE,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC;IACjC,0DAA0D;IAC1D,EAAE,CAAC,MAAM,CAAC,uBAAuB,CAAC,CAAC;IAEnC,KAAK,MAAM,GAAG,IAAI,iCAAqB,EAAE,CAAC;QACxC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACf,CAAC;IAED,GAAG,GAAG,EAAE,CAAC;AACX,CAAC;AAED;;;GAGG;AACH,SAAgB,KAAK;IACnB,IAAI,CAAC,GAAG;QAAE,MAAM,IAAI,KAAK,CAAC,wCAAwC,CAAC,CAAC;IACpE,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;GAEG;AACH,SAAgB,KAAK;IACnB,IAAI,CAAC,GAAG;QAAE,OAAO;IACjB,GAAG,CAAC,KAAK,EAAE,CAAC;IACZ,GAAG,GAAG,IAAI,CAAC;AACb,CAAC;AAED;;;;;;GAMG;AACI,KAAK,UAAU,YAAY,CAAC,QAAgB;IACjD,MAAM,UAAU,GAAG,mBAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,UAAU,CAAC,CAAC;IACnD,MAAM,MAAM,GAAG,mBAAI,CAAC,IAAI,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC;IAEjD,KAAK,EAAE,CAAC;IAER,MAAM,OAAO,CAAC,GAAG,CAAC;QAChB,kBAAE,CAAC,EAAE,CAAC,MAAM,EAAa,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QACzC,kBAAE,CAAC,EAAE,CAAC,MAAM,GAAG,MAAM,EAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;QACzC,kBAAE,CAAC,EAAE,CAAC,MAAM,GAAG,MAAM,EAAI,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC;KAC1C,CAAC,CAAC;IAEH,MAAM,IAAI,CAAC,QAAQ,CAAC,CAAC;AACvB,CAAC"}

package/dist/graph/queries.d.ts

@@ -0,0 +1,41 @@
+import type { Database } from "./db.js";
+import type { Symbol, DefinitionResult, CallSite, CallPath } from "../types/index.js";
+/**
+ * Find where a symbol is defined.
+ * If `file` is provided, restricts the search to that file.
+ */
+export declare function getDefinition(db: Database.Database, name: string, file?: string): Promise<DefinitionResult | null>;
+/**
+ * Find all call sites that invoke symbols matching `symbolName`.
+ */
+export declare function getCallers(db: Database.Database, symbolName: string): Promise<CallSite[]>;
+/**
+ * Find all symbols called by symbols matching `symbolName`.
+ */
+export declare function getCallees(db: Database.Database, symbolName: string): Promise<Symbol[]>;
+/**
+ * Find all edges pointing at symbols matching `symbolName`, any edge kind.
+ */
+export declare function getReferences(db: Database.Database, symbolName: string): Promise<CallSite[]>;
+/**
+ * Find all symbols that implement the given interface/base class.
+ */
+export declare function getImplementations(db: Database.Database, symbolName: string): Promise<DefinitionResult[]>;
+/**
+ * Return all symbols defined in a given file, ordered by line number.
+ */
+export declare function getFileSymbols(db: Database.Database, filePath: string): Promise<Symbol[]>;
+/**
+ * Best-effort: find the type/interface a symbol references.
+ */
+export declare function getTypeDefinition(db: Database.Database, symbolName: string): Promise<DefinitionResult[]>;
+/**
+ * Like getDefinition but skips barrel/index files.
+ */
+export declare function getSourceDefinition(db: Database.Database, name: string, file?: string): Promise<DefinitionResult | null>;
+/**
+ * BFS over 'calls' edges to find the shortest call chain between two symbols.
+ * Loads all calls edges into an in-process Map once, then runs BFS.
+ */
+export declare function getCallPath(db: Database.Database, fromName: string, toName: string): Promise<CallPath | null>;
+//# sourceMappingURL=queries.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"queries.d.ts","sourceRoot":"","sources":["../../src/graph/queries.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACxC,OAAO,KAAK,EAAE,MAAM,EAAQ,gBAAgB,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAsB5F;;;GAGG;AACH,wBAAsB,aAAa,CACjC,EAAE,EAAE,QAAQ,CAAC,QAAQ,EACrB,IAAI,EAAE,MAAM,EACZ,IAAI,CAAC,EAAE,MAAM,GACZ,OAAO,CAAC,gBAAgB,GAAG,IAAI,CAAC,CASlC;AAED;;GAEG;AACH,wBAAsB,UAAU,CAC9B,EAAE,EAAE,QAAQ,CAAC,QAAQ,EACrB,UAAU,EAAE,MAAM,GACjB,OAAO,CAAC,QAAQ,EAAE,CAAC,CAgBrB;AAED;;GAEG;AACH,wBAAsB,UAAU,CAC9B,EAAE,EAAE,QAAQ,CAAC,QAAQ,EACrB,UAAU,EAAE,MAAM,GACjB,OAAO,CAAC,MAAM,EAAE,CAAC,CAcnB;AAED;;GAEG;AACH,wBAAsB,aAAa,CACjC,EAAE,EAAE,QAAQ,CAAC,QAAQ,EACrB,UAAU,EAAE,MAAM,GACjB,OAAO,CAAC,QAAQ,EAAE,CAAC,CAerB;AAED;;GAEG;AACH,wBAAsB,kBAAkB,CACtC,EAAE,EAAE,QAAQ,CAAC,QAAQ,EACrB,UAAU,EAAE,MAAM,GACjB,OAAO,CAAC,gBAAgB,EAAE,CAAC,CAW7B;AAED;;GAEG;AACH,wBAAsB,cAAc,CAClC,EAAE,EAAE,QAAQ,CAAC,QAAQ,EACrB,QAAQ,EAAE,MAAM,GACf,OAAO,CAAC,MAAM,EAAE,CAAC,CAMnB;AAED;;GAEG;AACH,wBAAsB,iBAAiB,CACrC,EAAE,EAAE,QAAQ,CAAC,QAAQ,EACrB,UAAU,EAAE,MAAM,GACjB,OAAO,CAAC,gBAAgB,EAAE,CAAC,CAiB7B;AAED;;GAEG;AACH,wBAAsB,mBAAmB,CACvC,EAAE,EAAE,QAAQ,CAAC,QAAQ,EACrB,IAAI,EAAE,MAAM,EACZ,IAAI,CAAC,EAAE,MAAM,GACZ,OAAO,CAAC,gBAAgB,GAAG,IAAI,CAAC,CAgBlC;AAED;;;GAGG;AACH,wBAAsB,WAAW,CAC/B,EAAE,EAAE,QAAQ,CAAC,QAAQ,EACrB,QAAQ,EAAE,MAAM,EAChB,MAAM,EAAE,MAAM,GACb,OAAO,CAAC,QAAQ,GAAG,IAAI,CAAC,CA8E1B"}

package/dist/graph/queries.js

@@ -0,0 +1,219 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.getDefinition = getDefinition;
+exports.getCallers = getCallers;
+exports.getCallees = getCallees;
+exports.getReferences = getReferences;
+exports.getImplementations = getImplementations;
+exports.getFileSymbols = getFileSymbols;
+exports.getTypeDefinition = getTypeDefinition;
+exports.getSourceDefinition = getSourceDefinition;
+exports.getCallPath = getCallPath;
+// ---------------------------------------------------------------------------
+// Internal helpers
+// ---------------------------------------------------------------------------
+function rowToSymbol(row) {
+    return {
+        id: row["id"],
+        name: row["name"],
+        kind: row["kind"],
+        file: row["file"],
+        line: row["line"],
+        signature: row["signature"] ?? undefined,
+        docstring: row["docstring"] ?? undefined,
+    };
+}
+// ---------------------------------------------------------------------------
+// Queries
+// ---------------------------------------------------------------------------
+/**
+ * Find where a symbol is defined.
+ * If `file` is provided, restricts the search to that file.
+ */
+async function getDefinition(db, name, file) {
+    const row = file
+        ? db.prepare(`SELECT * FROM symbols WHERE name = $name AND file = $file LIMIT 1`)
+            .get({ name, file })
+        : db.prepare(`SELECT * FROM symbols WHERE name = $name LIMIT 1`)
+            .get({ name });
+    if (!row)
+        return null;
+    return { symbol: rowToSymbol(row) };
+}
+/**
+ * Find all call sites that invoke symbols matching `symbolName`.
+ */
+async function getCallers(db, symbolName) {
+    const rows = db.prepare(`
+    SELECT
+      s.id, s.name, s.kind, s.file, s.line, s.signature, s.docstring,
+      e.line AS call_line
+    FROM edges e
+    JOIN symbols s ON s.id = e.from_symbol
+    WHERE e.to_symbol IN (SELECT id FROM symbols WHERE name = $name)
+      AND e.kind = 'calls'
+    ORDER BY s.file, e.line
+  `).all({ name: symbolName });
+    return rows.map((row) => ({
+        caller: rowToSymbol(row),
+        line: row["call_line"] ?? row["line"],
+    }));
+}
+/**
+ * Find all symbols called by symbols matching `symbolName`.
+ */
+async function getCallees(db, symbolName) {
+    const rows = db.prepare(`
+    SELECT DISTINCT s.id, s.name, s.kind, s.file, s.line, s.signature, s.docstring
+    FROM edges e
+    JOIN symbols s ON s.id = e.to_symbol
+    WHERE e.from_symbol IN (SELECT id FROM symbols WHERE name = $name)
+      AND e.kind = 'calls'
+      AND s.name NOT LIKE '%<get>%'
+      AND s.name NOT LIKE '%<set>%'
+      AND NOT (s.name LIKE '<%' AND s.name LIKE '%>')
+    ORDER BY s.name
+  `).all({ name: symbolName });
+    return rows.map(rowToSymbol);
+}
+/**
+ * Find all edges pointing at symbols matching `symbolName`, any edge kind.
+ */
+async function getReferences(db, symbolName) {
+    const rows = db.prepare(`
+    SELECT
+      s.id, s.name, s.kind, s.file, s.line, s.signature, s.docstring,
+      e.line AS ref_line
+    FROM edges e
+    JOIN symbols s ON s.id = e.from_symbol
+    WHERE e.to_symbol IN (SELECT id FROM symbols WHERE name = $name)
+    ORDER BY s.file, e.line
+  `).all({ name: symbolName });
+    return rows.map((row) => ({
+        caller: rowToSymbol(row),
+        line: row["ref_line"] ?? row["line"],
+    }));
+}
+/**
+ * Find all symbols that implement the given interface/base class.
+ */
+async function getImplementations(db, symbolName) {
+    const rows = db.prepare(`
+    SELECT DISTINCT s.id, s.name, s.kind, s.file, s.line, s.signature, s.docstring
+    FROM edges e
+    JOIN symbols s ON s.id = e.from_symbol
+    WHERE e.to_symbol IN (SELECT id FROM symbols WHERE name = $name)
+      AND e.kind = 'implements'
+    ORDER BY s.file, s.line
+  `).all({ name: symbolName });
+    return rows.map((row) => ({ symbol: rowToSymbol(row) }));
+}
+/**
+ * Return all symbols defined in a given file, ordered by line number.
+ */
+async function getFileSymbols(db, filePath) {
+    const rows = db.prepare(`SELECT * FROM symbols WHERE file = $file ORDER BY line`).all({ file: filePath });
+    return rows.map(rowToSymbol);
+}
+/**
+ * Best-effort: find the type/interface a symbol references.
+ */
+async function getTypeDefinition(db, symbolName) {
+    const rows = db.prepare(`
+    SELECT DISTINCT s.id, s.name, s.kind, s.file, s.line, s.signature, s.docstring
+    FROM edges e
+    JOIN symbols s ON s.id = e.to_symbol
+    WHERE e.from_symbol IN (SELECT id FROM symbols WHERE name = $name)
+      AND e.kind = 'references'
+      AND (
+        s.signature LIKE '%interface %'
+        OR s.signature LIKE '%type %'
+        OR s.kind = 'class'
+      )
+    ORDER BY s.file, s.line
+    LIMIT 20
+  `).all({ name: symbolName });
+    return rows.map((row) => ({ symbol: rowToSymbol(row) }));
+}
+/**
+ * Like getDefinition but skips barrel/index files.
+ */
+async function getSourceDefinition(db, name, file) {
+    const base = `
+    SELECT * FROM symbols
+    WHERE name = $name
+      AND file NOT LIKE '%/index.ts'
+      AND file NOT LIKE '%/index.js'
+      AND file NOT LIKE '%/index.mts'
+      AND file NOT LIKE '%/index.mjs'
+  `;
+    const row = file
+        ? db.prepare(base + ` AND file = $file LIMIT 1`).get({ name, file })
+        : db.prepare(base + ` LIMIT 1`).get({ name });
+    if (!row)
+        return null;
+    return { symbol: rowToSymbol(row) };
+}
+/**
+ * BFS over 'calls' edges to find the shortest call chain between two symbols.
+ * Loads all calls edges into an in-process Map once, then runs BFS.
+ */
+async function getCallPath(db, fromName, toName) {
+    const MAX_DEPTH = 12;
+    // ── Load all calls edges into adjacency list ──────────────────────────────
+    const edgeRows = db.prepare(`SELECT from_symbol, to_symbol, line FROM edges WHERE kind = 'calls'`).all();
+    const adj = new Map();
+    for (const row of edgeRows) {
+        let bucket = adj.get(row.from_symbol);
+        if (!bucket) {
+            bucket = [];
+            adj.set(row.from_symbol, bucket);
+        }
+        bucket.push({ to: row.to_symbol, line: row.line ?? undefined });
+    }
+    // ── Resolve start/end symbol IDs ─────────────────────────────────────────
+    const startIds = db.prepare(`SELECT id FROM symbols WHERE name = $name`).all({ name: fromName }).map((r) => r.id);
+    if (startIds.length === 0)
+        return null;
+    const endIds = new Set(db.prepare(`SELECT id FROM symbols WHERE name = $name`).all({ name: toName })
+        .map((r) => r.id));
+    if (endIds.size === 0)
+        return null;
+    const visited = new Set(startIds);
+    const queue = startIds.map((id) => ({ id, symbolPath: [id], edgePath: [] }));
+    let foundPath = null;
+    bfs: while (queue.length > 0) {
+        const item = queue.shift();
+        if (endIds.has(item.id)) {
+            foundPath = { symbolIds: item.symbolPath, edges: item.edgePath };
+            break bfs;
+        }
+        if (item.symbolPath.length >= MAX_DEPTH)
+            continue;
+        for (const next of adj.get(item.id) ?? []) {
+            if (!visited.has(next.to)) {
+                visited.add(next.to);
+                queue.push({
+                    id: next.to,
+                    symbolPath: [...item.symbolPath, next.to],
+                    edgePath: [
+                        ...item.edgePath,
+                        { from: item.id, to: next.to, kind: "calls", line: next.line },
+                    ],
+                });
+            }
+        }
+    }
+    if (!foundPath)
+        return null;
+    // ── Resolve symbol IDs → Symbol objects ──────────────────────────────────
+    const ids = foundPath.symbolIds;
+    const placeholders = ids.map((_, i) => `$id${i}`).join(", ");
+    const idParams = {};
+    ids.forEach((id, i) => { idParams[`id${i}`] = id; });
+    const symRows = db.prepare(`SELECT * FROM symbols WHERE id IN (${placeholders})`).all(idParams);
+    const symMap = new Map(symRows.map((row) => [row["id"], rowToSymbol(row)]));
+    const symbols = ids.map((id) => symMap.get(id)).filter((s) => s !== undefined);
+    return { symbols, edges: foundPath.edges };
+}
+//# sourceMappingURL=queries.js.map

package/dist/graph/queries.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"queries.js","sourceRoot":"","sources":["../../src/graph/queries.ts"],"names":[],"mappings":";;AA4BA,sCAaC;AAKD,gCAmBC;AAKD,gCAiBC;AAKD,sCAkBC;AAKD,gDAcC;AAKD,wCASC;AAKD,8CAoBC;AAKD,kDAoBC;AAMD,kCAkFC;AArRD,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAE9E,SAAS,WAAW,CAAC,GAA4B;IAC/C,OAAO;QACL,EAAE,EAAS,GAAG,CAAC,IAAI,CAAW;QAC9B,IAAI,EAAO,GAAG,CAAC,MAAM,CAAW;QAChC,IAAI,EAAO,GAAG,CAAC,MAAM,CAAmB;QACxC,IAAI,EAAO,GAAG,CAAC,MAAM,CAAW;QAChC,IAAI,EAAO,GAAG,CAAC,MAAM,CAAW;QAChC,SAAS,EAAG,GAAG,CAAC,WAAW,CAAmB,IAAI,SAAS;QAC3D,SAAS,EAAG,GAAG,CAAC,WAAW,CAAmB,IAAI,SAAS;KAC5D,CAAC;AACJ,CAAC;AAED,8EAA8E;AAC9E,UAAU;AACV,8EAA8E;AAE9E;;;GAGG;AACI,KAAK,UAAU,aAAa,CACjC,EAAqB,EACrB,IAAY,EACZ,IAAa;IAEb,MAAM,GAAG,GAAG,IAAI;QACd,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,mEAAmE,CAAC;aAC3E,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAwC;QAChE,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,kDAAkD,CAAC;aAC1D,GAAG,CAAC,EAAE,IAAI,EAAE,CAAwC,CAAC;IAE7D,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IACtB,OAAO,EAAE,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;AACtC,CAAC;AAED;;GAEG;AACI,KAAK,UAAU,UAAU,CAC9B,EAAqB,EACrB,UAAkB;IAElB,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;;;;GASvB,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAA8B,CAAC;IAE1D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACxB,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC;QACxB,IAAI,EAAK,GAAG,CAAC,WAAW,CAAmB,IAAK,GAAG,CAAC,MAAM,CAAY;KACvE,CAAC,CAAC,CAAC;AACN,CAAC;AAED;;GAEG;AACI,KAAK,UAAU,UAAU,CAC9B,EAAqB,EACrB,UAAkB;IAElB,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;;;;;GAUvB,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAA8B,CAAC;IAE1D,OAAO,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;AAC/B,CAAC;AAED;;GAEG;AACI,KAAK,UAAU,aAAa,CACjC,EAAqB,EACrB,UAAkB;IAElB,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;;;GAQvB,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAA8B,CAAC;IAE1D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACxB,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC;QACxB,IAAI,EAAK,GAAG,CAAC,UAAU,CAAmB,IAAK,GAAG,CAAC,MAAM,CAAY;KACtE,CAAC,CAAC,CAAC;AACN,CAAC;AAED;;GAEG;AACI,KAAK,UAAU,kBAAkB,CACtC,EAAqB,EACrB,UAAkB;IAElB,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;;GAOvB,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAA8B,CAAC;IAE1D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AAC3D,CAAC;AAED;;GAEG;AACI,KAAK,UAAU,cAAc,CAClC,EAAqB,EACrB,QAAgB;IAEhB,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CACrB,wDAAwD,CACzD,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAA8B,CAAC;IAEvD,OAAO,IAAI,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;AAC/B,CAAC;AAED;;GAEG;AACI,KAAK,UAAU,iBAAiB,CACrC,EAAqB,EACrB,UAAkB;IAElB,MAAM,IAAI,GAAG,EAAE,CAAC,OAAO,CAAC;;;;;;;;;;;;;GAavB,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,UAAU,EAAE,CAA8B,CAAC;IAE1D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;AAC3D,CAAC;AAED;;GAEG;AACI,KAAK,UAAU,mBAAmB,CACvC,EAAqB,EACrB,IAAY,EACZ,IAAa;IAEb,MAAM,IAAI,GAAG;;;;;;;GAOZ,CAAC;IAEF,MAAM,GAAG,GAAG,IAAI;QACd,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,GAAG,2BAA2B,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,CAAwC;QAC3G,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,IAAI,GAAG,UAAU,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,CAAwC,CAAC;IAEvF,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IACtB,OAAO,EAAE,MAAM,EAAE,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC;AACtC,CAAC;AAED;;;GAGG;AACI,KAAK,UAAU,WAAW,CAC/B,EAAqB,EACrB,QAAgB,EAChB,MAAc;IAEd,MAAM,SAAS,GAAG,EAAE,CAAC;IAErB,6EAA6E;IAC7E,MAAM,QAAQ,GAAG,EAAE,CAAC,OAAO,CACzB,qEAAqE,CACtE,CAAC,GAAG,EAAuE,CAAC;IAE7E,MAAM,GAAG,GAAG,IAAI,GAAG,EAA2D,CAAC;IAC/E,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC3B,IAAI,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACtC,IAAI,CAAC,MAAM,EAAE,CAAC;YAAC,MAAM,GAAG,EAAE,CAAC;YAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,WAAW,EAAE,MAAM,CAAC,CAAC;QAAC,CAAC;QAC/D,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,CAAC,SAAS,EAAE,IAAI,EAAE,GAAG,CAAC,IAAI,IAAI,SAAS,EAAE,CAAC,CAAC;IAClE,CAAC;IAED,4EAA4E;IAC5E,MAAM,QAAQ,GACZ,EAAE,CAAC,OAAO,CAAC,2CAA2C,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,QAAQ,EAAE,CAC/E,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IAEnB,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEvC,MAAM,MAAM,GAAG,IAAI,GAAG,CACnB,EAAE,CAAC,OAAO,CAAC,2CAA2C,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAsB;SAChG,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CACpB,CAAC;IAEF,IAAI,MAAM,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAKnC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,QAAQ,CAAC,CAAC;IAC1C,MAAM,KAAK,GAAY,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,UAAU,EAAE,CAAC,EAAE,CAAC,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;IAEtF,IAAI,SAAS,GAAkD,IAAI,CAAC;IAEpE,GAAG,EAAE,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAE5B,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACxB,SAAS,GAAG,EAAE,SAAS,EAAE,IAAI,CAAC,UAAU,EAAE,KAAK,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC;YACjE,MAAM,GAAG,CAAC;QACZ,CAAC;QAED,IAAI,IAAI,CAAC,UAAU,CAAC,MAAM,IAAI,SAAS;YAAE,SAAS;QAElD,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YAC1C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;gBAC1B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC;oBACT,EAAE,EAAU,IAAI,CAAC,EAAE;oBACnB,UAAU,EAAE,CAAC,GAAG,IAAI,CAAC,UAAU,EAAE,IAAI,CAAC,EAAE,CAAC;oBACzC,QAAQ,EAAI;wBACV,GAAG,IAAI,CAAC,QAAQ;wBAChB,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE;qBAC/D;iBACF,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,IAAI,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IAE5B,4EAA4E;IAC5E,MAAM,GAAG,GAAG,SAAS,CAAC,SAAS,CAAC;IAChC,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7D,MAAM,QAAQ,GAA2B,EAAE,CAAC;IAC5C,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,GAAG,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAErD,MAAM,OAAO,GAAG,EAAE,CAAC,OAAO,CACxB,sCAAsC,YAAY,GAAG,CACtD,CAAC,GAAG,CAAC,QAAQ,CAA8B,CAAC;IAE7C,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAW,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACtF,MAAM,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;IAE5F,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,SAAS,CAAC,KAAK,EAAE,CAAC;AAC7C,CAAC"}

package/dist/graph/schema.d.ts

@@ -0,0 +1,6 @@
+export declare const CREATE_SYMBOLS_TABLE = "\nCREATE TABLE IF NOT EXISTS symbols (\n  id        TEXT PRIMARY KEY,\n  name      TEXT NOT NULL,\n  kind      TEXT NOT NULL,\n  file      TEXT NOT NULL,\n  line      INTEGER NOT NULL,\n  signature TEXT,\n  docstring TEXT\n) WITHOUT ROWID";
+export declare const CREATE_EDGES_TABLE = "\nCREATE TABLE IF NOT EXISTS edges (\n  from_symbol TEXT NOT NULL,\n  to_symbol   TEXT NOT NULL,\n  kind        TEXT NOT NULL,\n  line        INTEGER,\n  PRIMARY KEY (from_symbol, to_symbol, kind)\n)";
+export declare const CREATE_META_TABLE = "\nCREATE TABLE IF NOT EXISTS meta (\n  key   TEXT PRIMARY KEY,\n  value TEXT NOT NULL\n) WITHOUT ROWID";
+export declare const INDEX_STATEMENTS: string[];
+export declare const ALL_SCHEMA_STATEMENTS: string[];
+//# sourceMappingURL=schema.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"schema.d.ts","sourceRoot":"","sources":["../../src/graph/schema.ts"],"names":[],"mappings":"AAMA,eAAO,MAAM,oBAAoB,mPASjB,CAAC;AAIjB,eAAO,MAAM,kBAAkB,4MAO7B,CAAC;AAEH,eAAO,MAAM,iBAAiB,2GAId,CAAC;AAIjB,eAAO,MAAM,gBAAgB,UAK5B,CAAC;AAEF,eAAO,MAAM,qBAAqB,UAKjC,CAAC"}

package/dist/graph/schema.js

@@ -0,0 +1,48 @@
+"use strict";
+// SQLite DDL for the ariadne graph store.
+// All table creation is idempotent (CREATE TABLE IF NOT EXISTS).
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.ALL_SCHEMA_STATEMENTS = exports.INDEX_STATEMENTS = exports.CREATE_META_TABLE = exports.CREATE_EDGES_TABLE = exports.CREATE_SYMBOLS_TABLE = void 0;
+// WITHOUT ROWID: stores rows in a B-tree keyed directly by the TEXT primary
+// key, eliminating the secondary index lookup rowid→row.  ~2× faster on PK
+// lookups and ~50% smaller on disk for TEXT-heavy rows like SCIP symbol IDs.
+exports.CREATE_SYMBOLS_TABLE = `
+CREATE TABLE IF NOT EXISTS symbols (
+  id        TEXT PRIMARY KEY,
+  name      TEXT NOT NULL,
+  kind      TEXT NOT NULL,
+  file      TEXT NOT NULL,
+  line      INTEGER NOT NULL,
+  signature TEXT,
+  docstring TEXT
+) WITHOUT ROWID`;
+// Edges use a composite PRIMARY KEY for deduplication.
+// No separate id column — the (from, to, kind) triple is the natural key.
+exports.CREATE_EDGES_TABLE = `
+CREATE TABLE IF NOT EXISTS edges (
+  from_symbol TEXT NOT NULL,
+  to_symbol   TEXT NOT NULL,
+  kind        TEXT NOT NULL,
+  line        INTEGER,
+  PRIMARY KEY (from_symbol, to_symbol, kind)
+)`;
+exports.CREATE_META_TABLE = `
+CREATE TABLE IF NOT EXISTS meta (
+  key   TEXT PRIMARY KEY,
+  value TEXT NOT NULL
+) WITHOUT ROWID`;
+// Extra indexes — PRIMARY KEY already covers from_symbol on edges;
+// add to_symbol and kind for reverse lookups and kind filters.
+exports.INDEX_STATEMENTS = [
+    `CREATE INDEX IF NOT EXISTS idx_symbols_name ON symbols(name)`,
+    `CREATE INDEX IF NOT EXISTS idx_symbols_file ON symbols(file)`,
+    `CREATE INDEX IF NOT EXISTS idx_edges_to     ON edges(to_symbol)`,
+    `CREATE INDEX IF NOT EXISTS idx_edges_kind   ON edges(kind)`,
+];
+exports.ALL_SCHEMA_STATEMENTS = [
+    exports.CREATE_SYMBOLS_TABLE,
+    exports.CREATE_EDGES_TABLE,
+    exports.CREATE_META_TABLE,
+    ...exports.INDEX_STATEMENTS,
+];
+//# sourceMappingURL=schema.js.map

package/dist/graph/schema.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"schema.js","sourceRoot":"","sources":["../../src/graph/schema.ts"],"names":[],"mappings":";AAAA,0CAA0C;AAC1C,iEAAiE;;;AAEjE,4EAA4E;AAC5E,2EAA2E;AAC3E,6EAA6E;AAChE,QAAA,oBAAoB,GAAG;;;;;;;;;gBASpB,CAAC;AAEjB,uDAAuD;AACvD,0EAA0E;AAC7D,QAAA,kBAAkB,GAAG;;;;;;;EAOhC,CAAC;AAEU,QAAA,iBAAiB,GAAG;;;;gBAIjB,CAAC;AAEjB,mEAAmE;AACnE,+DAA+D;AAClD,QAAA,gBAAgB,GAAG;IAC9B,8DAA8D;IAC9D,8DAA8D;IAC9D,iEAAiE;IACjE,4DAA4D;CAC7D,CAAC;AAEW,QAAA,qBAAqB,GAAG;IACnC,4BAAoB;IACpB,0BAAkB;IAClB,yBAAiB;IACjB,GAAG,wBAAgB;CACpB,CAAC"}

package/dist/graph/writer.d.ts

@@ -0,0 +1,24 @@
+import type { Database } from "./db.js";
+import type { Symbol, Edge } from "../types/index.js";
+/**
+ * Insert or replace a symbol.  Uses the SCIP symbol string as the primary key
+ * so re-indexing the same file is idempotent.
+ */
+export declare function upsertSymbol(db: Database.Database, symbol: Symbol): void;
+/**
+ * Insert an edge if it doesn't already exist.
+ * The composite PK (from_symbol, to_symbol, kind) enforces uniqueness.
+ */
+export declare function upsertEdge(db: Database.Database, edge: Edge): void;
+/**
+ * Remove all symbols (and their edges) for a given file.
+ * Called before re-parsing a changed file so stale data doesn't accumulate.
+ */
+export declare function deleteSymbolsByFile(db: Database.Database, file: string): void;
+/**
+ * Wipe the entire graph.  Prefer wipAndReinit() from db.ts for full re-index
+ * (file deletion is faster and avoids any MVCC overhead).
+ * This function is kept for use in tests and small-scale resets.
+ */
+export declare function clearAll(db: Database.Database): void;
+//# sourceMappingURL=writer.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"writer.d.ts","sourceRoot":"","sources":["../../src/graph/writer.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,SAAS,CAAC;AACxC,OAAO,KAAK,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,mBAAmB,CAAC;AAEtD;;;GAGG;AACH,wBAAgB,YAAY,CAAC,EAAE,EAAE,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,CAaxE;AAED;;;GAGG;AACH,wBAAgB,UAAU,CAAC,EAAE,EAAE,QAAQ,CAAC,QAAQ,EAAE,IAAI,EAAE,IAAI,GAAG,IAAI,CAUlE;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,EAAE,EAAE,QAAQ,CAAC,QAAQ,EAAE,IAAI,EAAE,MAAM,GAAG,IAAI,CAS7E;AAED;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,EAAE,EAAE,QAAQ,CAAC,QAAQ,GAAG,IAAI,CAMpD"}