@nithin554/code-crawler 0.0.0 → 0.1.2

package/dist/graph/queries.js

@@ -0,0 +1,265 @@
+function nodeToRef(node) {
+    return {
+        id: node.id,
+        qualifiedName: node.qualifiedName,
+        name: node.properties.name,
+        kind: node.kind,
+        filePath: node.filePath,
+    };
+}
+/** Resolve a node by exact id or by qualified name, favoring id. */
+function resolveNode(store, symbol) {
+    return store.getNode(symbol) ?? store.getNodeByQualifiedName(symbol);
+}
+/**
+ * Find every symbol that calls the given symbol, directly or transitively.
+ * Each row includes the edge chain depth so clients can render a call tree.
+ */
+export function getCallers(store, symbol, opts = {}) {
+    const target = resolveNode(store, symbol);
+    if (!target)
+        return null;
+    const transitive = opts.transitive ?? true;
+    const maxDepth = Math.max(1, opts.maxDepth ?? store.maxDepth ?? 10);
+    const limit = opts.limit ?? 100;
+    if (!transitive) {
+        const rows = store.raw(`SELECT n.id, n.qualified_name, n.kind, n.file_path, n.properties, e.properties AS edge_props
+       FROM edges e
+       JOIN nodes n ON n.id = e.source
+       WHERE e.target = ? AND e.kind = 'CALLS'
+       ORDER BY e.source
+       LIMIT ?`, symbol, limit);
+        return {
+            target: nodeToRef(target),
+            callers: rows.map((r) => ({
+                caller: rowToRef(r),
+                depth: 1,
+                callSiteLine: edgeLine(r.edge_props),
+            })),
+        };
+    }
+    const rows = store.raw(`WITH RECURSIVE callers(id, depth, path) AS (
+       SELECT e.source, 1, e.source || '/' || e.target
+       FROM edges e
+       WHERE e.target = ? AND e.kind = 'CALLS'
+       UNION ALL
+       SELECT e.source, c.depth + 1, c.path || '/' || e.source
+       FROM edges e
+       JOIN callers c ON e.target = c.id
+       WHERE e.kind = 'CALLS'
+         AND c.depth < ?
+         AND e.source || '/' || e.target NOT LIKE c.path || '/%'
+     )
+     SELECT n.id, n.qualified_name, n.kind, n.file_path, n.properties, c.depth
+     FROM callers c
+     JOIN nodes n ON n.id = c.id
+     ORDER BY c.depth, n.id
+     LIMIT ?`, symbol, maxDepth, limit);
+    return {
+        target: nodeToRef(target),
+        callers: rows.map((r) => ({ caller: rowToRef(r), depth: r.depth })),
+    };
+}
+/**
+ * Find every symbol the given symbol calls, directly or transitively.
+ */
+export function getCallees(store, symbol, opts = {}) {
+    const source = resolveNode(store, symbol);
+    if (!source)
+        return null;
+    const transitive = opts.transitive ?? true;
+    const maxDepth = Math.max(1, opts.maxDepth ?? store.maxDepth ?? 10);
+    const limit = opts.limit ?? 100;
+    if (!transitive) {
+        const rows = store.raw(`SELECT n.id, n.qualified_name, n.kind, n.file_path, n.properties, e.properties AS edge_props
+       FROM edges e
+       JOIN nodes n ON n.id = e.target
+       WHERE e.source = ? AND e.kind = 'CALLS'
+       ORDER BY e.target
+       LIMIT ?`, symbol, limit);
+        return {
+            source: nodeToRef(source),
+            callees: rows.map((r) => ({
+                callee: rowToRef(r),
+                depth: 1,
+                callSiteLine: edgeLine(r.edge_props),
+            })),
+        };
+    }
+    const rows = store.raw(`WITH RECURSIVE callees(id, depth, path) AS (
+       SELECT e.target, 1, e.source || '/' || e.target
+       FROM edges e
+       WHERE e.source = ? AND e.kind = 'CALLS'
+       UNION ALL
+       SELECT e.target, c.depth + 1, c.path || '/' || e.target
+       FROM edges e
+       JOIN callees c ON e.source = c.id
+       WHERE e.kind = 'CALLS'
+         AND c.depth < ?
+         AND e.source || '/' || e.target NOT LIKE c.path || '/%'
+     )
+     SELECT n.id, n.qualified_name, n.kind, n.file_path, n.properties, c.depth
+     FROM callees c
+     JOIN nodes n ON n.id = c.id
+     ORDER BY c.depth, n.id
+     LIMIT ?`, symbol, maxDepth, limit);
+    return {
+        source: nodeToRef(source),
+        callees: rows.map((r) => ({ callee: rowToRef(r), depth: r.depth })),
+    };
+}
+/**
+ * Find up to `limit` static call paths between two symbols.
+ * BFS over CALLS edges so the shortest paths come first.
+ */
+export function tracePath(store, from, to, opts = {}) {
+    const start = resolveNode(store, from);
+    const goal = resolveNode(store, to);
+    if (!start || !goal)
+        return null;
+    const maxDepth = Math.max(1, opts.maxDepth ?? store.maxDepth ?? 10);
+    const limit = opts.limit ?? 10;
+    // BFS in SQL via recursive CTE that accumulates the path taken.
+    const rows = store.raw(`WITH RECURSIVE paths(id, depth, path, edge_path) AS (
+       SELECT e.target, 1, e.source || '/' || e.target, e.source || '/' || e.target
+       FROM edges e
+       WHERE e.source = ? AND e.kind = 'CALLS'
+       UNION ALL
+       SELECT e.target, p.depth + 1, p.path || '/' || e.target, p.edge_path || '|' || e.source || '/' || e.target
+       FROM edges e
+       JOIN paths p ON e.source = p.id
+       WHERE e.kind = 'CALLS'
+         AND p.depth < ?
+         AND instr('|' || p.path || '|', '|' || e.target || '|') = 0
+     )
+     SELECT path, edge_path, depth
+     FROM paths
+     WHERE id = ?
+     ORDER BY depth
+     LIMIT ?`, from, maxDepth, to, limit);
+    return rows.map((r) => {
+        const ids = r.path.split("/");
+        const edges = r.edge_path.split("|").map((pair) => {
+            const [src, tgt] = pair.split("/");
+            return { source: src ?? "", target: tgt ?? "" };
+        });
+        return { path: ids, length: r.depth, edges };
+    });
+}
+/**
+ * Extract the neighborhood around a symbol (any edge kinds), useful for
+ * visualization and for letting an LLM see the local shape of the graph.
+ */
+export function getSubgraph(store, symbol, opts = {}) {
+    const center = resolveNode(store, symbol);
+    if (!center)
+        return { center: null, nodes: [], edges: [] };
+    const radius = Math.max(1, opts.radius ?? 2);
+    const edgeKinds = opts.edgeKinds ?? ["CALLS", "DECLARED_IN", "CONTAINS", "EXTENDS", "IMPLEMENTS", "REFERENCES", "IMPORTS"];
+    const limit = opts.limit ?? 500;
+    const kinds = edgeKinds.map((k) => `'${k}'`).join(",");
+    const rows = store.raw(`WITH RECURSIVE reach(id, depth) AS (
+       SELECT ? , 0
+       UNION
+       SELECT e.target, r.depth + 1
+       FROM edges e
+       JOIN reach r ON e.source = r.id
+       WHERE e.kind IN (${kinds}) AND r.depth < ?
+       UNION
+       SELECT e.source, r.depth + 1
+       FROM edges e
+       JOIN reach r ON e.target = r.id
+       WHERE e.kind IN (${kinds}) AND r.depth < ?
+     )
+     SELECT n.id, n.qualified_name, n.kind, n.file_path, n.properties, r.depth
+     FROM reach r
+     JOIN nodes n ON n.id = r.id
+     ORDER BY r.depth, n.id
+     LIMIT ?`, symbol, radius, radius, limit);
+    const nodes = rows.map(rowToRef);
+    const ids = nodes.map((n) => n.id);
+    if (ids.length === 0)
+        return { center: nodeToRef(center), nodes, edges: [] };
+    const placeholders = ids.map(() => "?").join(",");
+    const edgeRows = store.raw(`SELECT source, target, kind, properties
+     FROM edges
+     WHERE kind IN (${kinds})
+       AND source IN (${placeholders}) AND target IN (${placeholders})
+     LIMIT ?`, ...ids, ...ids, limit);
+    return {
+        center: nodeToRef(center),
+        nodes,
+        edges: edgeRows.map((r) => ({
+            source: r.source,
+            target: r.target,
+            kind: r.kind,
+            callSiteLine: edgeLine(r.properties),
+        })),
+    };
+}
+/**
+ * Fuzzy symbol lookup by short name or FQN. Matches substring of either the
+ * id, the qualified name, or the display name.
+ */
+export function searchSymbols(store, query, opts = {}) {
+    const q = query.trim().toLowerCase();
+    if (!q)
+        return [];
+    const limit = opts.limit ?? store.defaultLimit ?? 50;
+    const like = `%${q}%`;
+    const kindClause = opts.kind ? "AND n.kind = ?" : "";
+    const params = [like, like, like];
+    if (opts.kind)
+        params.push(opts.kind);
+    // ORDER BY CASE params: exact-qualified-name, then prefix/name match
+    params.push(q, like, limit);
+    const rows = store.raw(`SELECT n.id, n.qualified_name, n.kind, n.file_path, n.properties
+     FROM nodes n
+     WHERE LOWER(n.id) LIKE ? OR LOWER(n.qualified_name) LIKE ? OR LOWER(n.properties) LIKE ?
+     ${kindClause}
+     ORDER BY
+       CASE WHEN LOWER(n.qualified_name) = ? THEN 0
+            WHEN LOWER(n.id) LIKE ? THEN 1
+            ELSE 2 END,
+       n.qualified_name
+     LIMIT ?`, ...params);
+    // Re-rank: exact-qualified-name matches first.
+    return rows
+        .map((r) => rowToRef(r))
+        .sort((a, b) => rank(a, q) - rank(b, q));
+}
+function rank(ref, q) {
+    if (ref.qualifiedName.toLowerCase() === q)
+        return 0;
+    const name = ref.name?.toLowerCase() ?? "";
+    if (name === q)
+        return 1;
+    if (ref.qualifiedName.toLowerCase().startsWith(q))
+        return 2;
+    return 3;
+}
+/** Suggest similar symbols when an exact lookup fails. */
+export function suggestSymbols(store, symbol, limit = 8) {
+    const tokens = symbol
+        .split(/[.#$<>]/)
+        .filter((t) => t.length > 1)
+        .slice(-1);
+    const best = tokens[0] ?? symbol.slice(-20);
+    return searchSymbols(store, best, { limit });
+}
+function rowToRef(r) {
+    return {
+        id: r.id,
+        qualifiedName: r.qualified_name,
+        kind: r.kind,
+        filePath: r.file_path,
+        name: JSON.parse(r.properties).name,
+    };
+}
+function edgeLine(props) {
+    if (!props)
+        return undefined;
+    const line = JSON.parse(props).line;
+    return typeof line === "number" ? line : undefined;
+}
+//# 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":"AA2BA,SAAS,SAAS,CAAC,IAAe;IAChC,OAAO;QACL,EAAE,EAAE,IAAI,CAAC,EAAE;QACX,aAAa,EAAE,IAAI,CAAC,aAAa;QACjC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,IAAI;QAC1B,IAAI,EAAE,IAAI,CAAC,IAAI;QACf,QAAQ,EAAE,IAAI,CAAC,QAAQ;KACxB,CAAC;AACJ,CAAC;AAED,oEAAoE;AACpE,SAAS,WAAW,CAAC,KAAiB,EAAE,MAAc;IACpD,OAAO,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,sBAAsB,CAAC,MAAM,CAAC,CAAC;AACvE,CAAC;AAWD;;;GAGG;AACH,MAAM,UAAU,UAAU,CACxB,KAAiB,EACjB,MAAc,EACd,OAA2B,EAAE;IAE7B,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC1C,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAEzB,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC;IAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC;IACpE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC;IAEhC,IAAI,CAAC,UAAU,EAAE,CAAC;QAChB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CACpB;;;;;eAKS,EACT,MAAM,EACN,KAAK,CACW,CAAC;QACnB,OAAO;YACL,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC;YACzB,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACxB,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC;gBACnB,KAAK,EAAE,CAAC;gBACR,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC;aACrC,CAAC,CAAC;SACJ,CAAC;IACJ,CAAC;IAED,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CACpB;;;;;;;;;;;;;;;;aAgBS,EACT,MAAM,EACN,QAAQ,EACR,KAAK,CACyB,CAAC;IAEjC,OAAO;QACL,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC;QACzB,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;KACpE,CAAC;AACJ,CAAC;AASD;;GAEG;AACH,MAAM,UAAU,UAAU,CACxB,KAAiB,EACjB,MAAc,EACd,OAA2B,EAAE;IAE7B,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC1C,IAAI,CAAC,MAAM;QAAE,OAAO,IAAI,CAAC;IAEzB,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC;IAC3C,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC;IACpE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC;IAEhC,IAAI,CAAC,UAAU,EAAE,CAAC;QAChB,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CACpB;;;;;eAKS,EACT,MAAM,EACN,KAAK,CACW,CAAC;QACnB,OAAO;YACL,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC;YACzB,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;gBACxB,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC;gBACnB,KAAK,EAAE,CAAC;gBACR,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC;aACrC,CAAC,CAAC;SACJ,CAAC;IACJ,CAAC;IAED,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CACpB;;;;;;;;;;;;;;;;aAgBS,EACT,MAAM,EACN,QAAQ,EACR,KAAK,CACyB,CAAC;IAEjC,OAAO;QACL,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC;QACzB,OAAO,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,MAAM,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC;KACpE,CAAC;AACJ,CAAC;AAmBD;;;GAGG;AACH,MAAM,UAAU,SAAS,CACvB,KAAiB,EACjB,IAAY,EACZ,EAAU,EACV,OAAyB,EAAE;IAE3B,MAAM,KAAK,GAAG,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;IACvC,MAAM,IAAI,GAAG,WAAW,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IACpC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI;QAAE,OAAO,IAAI,CAAC;IAEjC,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC;IACpE,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,EAAE,CAAC;IAE/B,gEAAgE;IAChE,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CACpB;;;;;;;;;;;;;;;;aAgBS,EACT,IAAI,EACJ,QAAQ,EACR,EAAE,EACF,KAAK,CACkD,CAAC;IAE1D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACpB,MAAM,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YAChD,MAAM,CAAC,GAAG,EAAE,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;YACnC,OAAO,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,EAAE,MAAM,EAAE,GAAG,IAAI,EAAE,EAAE,CAAC;QAClD,CAAC,CAAC,CAAC;QACH,OAAO,EAAE,IAAI,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,CAAC;IAC/C,CAAC,CAAC,CAAC;AACL,CAAC;AAcD;;;GAGG;AACH,MAAM,UAAU,WAAW,CACzB,KAAiB,EACjB,MAAc,EACd,OAAwB,EAAE;IAE1B,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAC1C,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IAE3D,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;IAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,SAAS,IAAI,CAAC,OAAO,EAAE,aAAa,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,EAAE,YAAY,EAAE,SAAS,CAAC,CAAC;IAC3H,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,GAAG,CAAC;IAEhC,MAAM,KAAK,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACvD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CACpB;;;;;;0BAMsB,KAAK;;;;;0BAKL,KAAK;;;;;;aAMlB,EACT,MAAM,EACN,MAAM,EACN,MAAM,EACN,KAAK,CACG,CAAC;IAEX,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACjC,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;IACnC,IAAI,GAAG,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,EAAE,CAAC;IAE7E,MAAM,YAAY,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAClD,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CACxB;;sBAEkB,KAAK;wBACH,YAAY,oBAAoB,YAAY;aACvD,EACT,GAAG,GAAG,EACN,GAAG,GAAG,EACN,KAAK,CACsE,CAAC;IAE9E,OAAO;QACL,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC;QACzB,KAAK;QACL,KAAK,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;YAC1B,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,IAAI,EAAE,CAAC,CAAC,IAAI;YACZ,YAAY,EAAE,QAAQ,CAAC,CAAC,CAAC,UAAU,CAAC;SACrC,CAAC,CAAC;KACJ,CAAC;AACJ,CAAC;AAOD;;;GAGG;AACH,MAAM,UAAU,aAAa,CAC3B,KAAiB,EACjB,KAAa,EACb,OAAsB,EAAE;IAExB,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACrC,IAAI,CAAC,CAAC;QAAE,OAAO,EAAE,CAAC;IAClB,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,YAAY,IAAI,EAAE,CAAC;IACrD,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC;IAEtB,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,gBAAgB,CAAC,CAAC,CAAC,EAAE,CAAC;IACrD,MAAM,MAAM,GAAc,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IAC7C,IAAI,IAAI,CAAC,IAAI;QAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtC,qEAAqE;IACrE,MAAM,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,EAAE,KAAK,CAAC,CAAC;IAE5B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CACpB;;;OAGG,UAAU;;;;;;aAMJ,EACT,GAAG,MAAM,CACD,CAAC;IAEX,+CAA+C;IAC/C,OAAO,IAAI;SACR,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC;SACvB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;AAC7C,CAAC;AAED,SAAS,IAAI,CAAC,GAAc,EAAE,CAAS;IACrC,IAAI,GAAG,CAAC,aAAa,CAAC,WAAW,EAAE,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACpD,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,CAAC;IAC3C,IAAI,IAAI,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IACzB,IAAI,GAAG,CAAC,aAAa,CAAC,WAAW,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC;QAAE,OAAO,CAAC,CAAC;IAC5D,OAAO,CAAC,CAAC;AACX,CAAC;AAED,0DAA0D;AAC1D,MAAM,UAAU,cAAc,CAAC,KAAiB,EAAE,MAAc,EAAE,KAAK,GAAG,CAAC;IACzE,MAAM,MAAM,GAAG,MAAM;SAClB,KAAK,CAAC,SAAS,CAAC;SAChB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC;SAC3B,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACb,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC;IAC5C,OAAO,aAAa,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;AAC/C,CAAC;AAeD,SAAS,QAAQ,CAAC,CAAM;IACtB,OAAO;QACL,EAAE,EAAE,CAAC,CAAC,EAAE;QACR,aAAa,EAAE,CAAC,CAAC,cAAc;QAC/B,IAAI,EAAE,CAAC,CAAC,IAAI;QACZ,QAAQ,EAAE,CAAC,CAAC,SAAS;QACrB,IAAI,EAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,UAAU,CAAuB,CAAC,IAAI;KAC3D,CAAC;AACJ,CAAC;AAED,SAAS,QAAQ,CAAC,KAAyB;IACzC,IAAI,CAAC,KAAK;QAAE,OAAO,SAAS,CAAC;IAC7B,MAAM,IAAI,GAAI,IAAI,CAAC,KAAK,CAAC,KAAK,CAAuB,CAAC,IAAI,CAAC;IAC3D,OAAO,OAAO,IAAI,KAAK,QAAQ,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC;AACrD,CAAC"}

package/dist/graph/schema.d.ts

@@ -0,0 +1,63 @@
+/**
+ * Graph schema for the code-crawler property graph.
+ *
+ * The graph is a labelled property graph stored in SQLite:
+ *   - Nodes represent source-level symbols (files, classes, methods, fields, ...)
+ *   - Directed edges represent relationships between symbols (calls, contains, ...)
+ *
+ * Both nodes and edges carry an arbitrary `properties` JSON blob so languages
+ * can attach extra metadata (signatures, modifiers, confidence scores) without
+ * schema migrations.
+ */
+export declare const NODE_KINDS: readonly ["file", "package", "class", "interface", "enum", "method", "constructor", "field", "import", "unknown_symbol"];
+export type NodeKind = (typeof NODE_KINDS)[number];
+export declare const EDGE_KINDS: readonly ["CALLS", "DECLARED_IN", "CONTAINS", "IMPLEMENTS", "EXTENDS", "IMPORTS", "REFERENCES"];
+export type EdgeKind = (typeof EDGE_KINDS)[number];
+/** Kinds that may appear as call *targets* (nodes at the arrow end of CALLS). */
+export declare const CALLABLE_KINDS: readonly NodeKind[];
+export interface NodeProperties {
+    /** Zero-based line of the declaration start. */
+    startLine?: number;
+    /** Zero-based line of the declaration end. */
+    endLine?: number;
+    /** Short display name (method/field/class simple name). */
+    name?: string;
+    /** Fully-qualified name when distinct from the node id. */
+    qualifiedName?: string;
+    /** Free-form language-specific metadata. */
+    [key: string]: string | number | boolean | (string | number)[] | undefined;
+}
+export interface GraphNode {
+    id: string;
+    kind: NodeKind;
+    /** Globally unique fully-qualified name, e.g. `com.acme.Foo#run`. */
+    qualifiedName: string;
+    /** Absolute path of the source file that declares this symbol. */
+    filePath: string | null;
+    properties: NodeProperties;
+}
+export interface EdgeProperties {
+    /** Zero-based line number of the call site / reference. */
+    line?: number;
+    /** For CALLS edges: whether the target was statically resolved. */
+    resolved?: boolean;
+    /** For CALLS edges: heuristic confidence 0..1 when resolved. */
+    confidence?: number;
+    /** Free-form language-specific metadata. */
+    [key: string]: string | number | boolean | undefined;
+}
+export interface GraphEdge {
+    source: string;
+    target: string;
+    kind: EdgeKind;
+    properties: EdgeProperties;
+}
+/** Node id scheme. `#` separates type from member so FQNs stay readable. */
+export declare function methodNodeId(qualifiedType: string, methodName: string): string;
+export declare function constructorNodeId(qualifiedType: string): string;
+/** Field ids use `$` so they never collide with nested-type FQNs (`.`). */
+export declare function fieldNodeId(qualifiedType: string, fieldName: string): string;
+/** Import nodes represent external (or unindexed) dependencies. */
+export declare function importNodeId(fqn: string): string;
+/** Fallback id for calls that could not be statically resolved. */
+export declare function unknownNodeId(qualifiedName: string): string;

package/dist/graph/schema.js

@@ -0,0 +1,54 @@
+/**
+ * Graph schema for the code-crawler property graph.
+ *
+ * The graph is a labelled property graph stored in SQLite:
+ *   - Nodes represent source-level symbols (files, classes, methods, fields, ...)
+ *   - Directed edges represent relationships between symbols (calls, contains, ...)
+ *
+ * Both nodes and edges carry an arbitrary `properties` JSON blob so languages
+ * can attach extra metadata (signatures, modifiers, confidence scores) without
+ * schema migrations.
+ */
+export const NODE_KINDS = [
+    "file",
+    "package",
+    "class",
+    "interface",
+    "enum",
+    "method",
+    "constructor",
+    "field",
+    "import",
+    "unknown_symbol",
+];
+export const EDGE_KINDS = [
+    "CALLS",
+    "DECLARED_IN",
+    "CONTAINS",
+    "IMPLEMENTS",
+    "EXTENDS",
+    "IMPORTS",
+    "REFERENCES",
+];
+/** Kinds that may appear as call *targets* (nodes at the arrow end of CALLS). */
+export const CALLABLE_KINDS = ["method", "constructor"];
+/** Node id scheme. `#` separates type from member so FQNs stay readable. */
+export function methodNodeId(qualifiedType, methodName) {
+    return `${qualifiedType}#${methodName}`;
+}
+export function constructorNodeId(qualifiedType) {
+    return `${qualifiedType}#<init>`;
+}
+/** Field ids use `$` so they never collide with nested-type FQNs (`.`). */
+export function fieldNodeId(qualifiedType, fieldName) {
+    return `${qualifiedType}$${fieldName}`;
+}
+/** Import nodes represent external (or unindexed) dependencies. */
+export function importNodeId(fqn) {
+    return `__import__:${fqn}`;
+}
+/** Fallback id for calls that could not be statically resolved. */
+export function unknownNodeId(qualifiedName) {
+    return `__unknown__:${qualifiedName}`;
+}
+//# 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;;;;;;;;;;GAUG;AAEH,MAAM,CAAC,MAAM,UAAU,GAAG;IACxB,MAAM;IACN,SAAS;IACT,OAAO;IACP,WAAW;IACX,MAAM;IACN,QAAQ;IACR,aAAa;IACb,OAAO;IACP,QAAQ;IACR,gBAAgB;CACR,CAAC;AAGX,MAAM,CAAC,MAAM,UAAU,GAAG;IACxB,OAAO;IACP,aAAa;IACb,UAAU;IACV,YAAY;IACZ,SAAS;IACT,SAAS;IACT,YAAY;CACJ,CAAC;AAGX,iFAAiF;AACjF,MAAM,CAAC,MAAM,cAAc,GAAwB,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;AA2C7E,4EAA4E;AAC5E,MAAM,UAAU,YAAY,CAAC,aAAqB,EAAE,UAAkB;IACpE,OAAO,GAAG,aAAa,IAAI,UAAU,EAAE,CAAC;AAC1C,CAAC;AAED,MAAM,UAAU,iBAAiB,CAAC,aAAqB;IACrD,OAAO,GAAG,aAAa,SAAS,CAAC;AACnC,CAAC;AAED,2EAA2E;AAC3E,MAAM,UAAU,WAAW,CAAC,aAAqB,EAAE,SAAiB;IAClE,OAAO,GAAG,aAAa,IAAI,SAAS,EAAE,CAAC;AACzC,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,YAAY,CAAC,GAAW;IACtC,OAAO,cAAc,GAAG,EAAE,CAAC;AAC7B,CAAC;AAED,mEAAmE;AACnE,MAAM,UAAU,aAAa,CAAC,aAAqB;IACjD,OAAO,eAAe,aAAa,EAAE,CAAC;AACxC,CAAC"}

package/dist/graph/store.d.ts

@@ -0,0 +1,66 @@
+import Database from "better-sqlite3";
+import type { EdgeKind, GraphEdge, GraphNode, EdgeProperties } from "./schema.js";
+export interface StoreStats {
+    nodes: number;
+    edges: number;
+    files: number;
+    lastCrawl: string | null;
+}
+export declare class GraphStore {
+    readonly db: Database.Database;
+    /** Default cap on transitive traversal depth (config override). */
+    readonly maxDepth: number;
+    /** Default result cap for list queries (config override). */
+    readonly defaultLimit: number;
+    private insertNodeStmt;
+    private insertEdgeStmt;
+    private deleteFileNodesStmt;
+    private updateMetaStmt;
+    constructor(dbPath: string, options?: {
+        maxDepth?: number;
+        defaultLimit?: number;
+    });
+    close(): void;
+    /**
+     * Persist a node. Idempotent: re-indexing an existing symbol just updates it.
+     */
+    upsertNode(node: GraphNode): void;
+    /**
+     * Persist multiple nodes in a single transaction for batch ingestion.
+     */
+    upsertNodes(nodes: GraphNode[]): void;
+    /**
+     * Persist an edge. Both endpoints must exist (FK enforced).
+     */
+    upsertEdge(edge: GraphEdge): void;
+    upsertEdges(edges: GraphEdge[]): void;
+    getNode(id: string): GraphNode | null;
+    getNodeByQualifiedName(qn: string): GraphNode | null;
+    /** All nodes originating from one source file (for reindex + stats). */
+    getFileNodes(filePath: string): GraphNode[];
+    /**
+     * Remove every node declared in a file, plus their incident edges
+     * (cascade). Nodes referenced by the file but declared elsewhere survive.
+     */
+    removeFile(filePath: string): void;
+    /**
+     * Rebuild the graph for a single file: drop its symbols and edges, then
+     * re-ingest. Call inside a caller-supplied transaction when batching.
+     */
+    replaceFile(filePath: string, nodes: GraphNode[], edges: GraphEdge[]): void;
+    /** Ensure every CALLS edge endpoint exists (e.g. phantom unknown symbols). */
+    ensureNode(node: GraphNode): void;
+    setMeta(key: string, value: string): void;
+    getMeta(key: string): string | null;
+    stats(): StoreStats;
+    clearAll(): void;
+    /** Run a function inside a transaction. */
+    withTransaction<T>(fn: () => T): T;
+    /**
+     * SQLite uses 0-based row/col; tree-sitter uses 0-based row but 1-based col.
+     * Store and expose tree-sitter-compatible positions (0-based line) and let
+     * the presentation layer add +1 where humans expect 1-based lines.
+     */
+    raw(sql: string, ...params: unknown[]): unknown;
+}
+export type { EdgeKind, EdgeProperties };