pi-shazam 0.1.0

package/dist/core/graph.js

@@ -0,0 +1,224 @@
+/**
+ * pi-shazam core/graph — Symbol dependency graph data model.
+ *
+ * Ported from repomap/src/__init__.py (Symbol, Edge, RepoGraph dataclasses).
+ * All other core/ modules depend on these types.
+ */
+// ── Factory ──────────────────────────────────────────────────────────────────
+export function createRepoGraph() {
+    return {
+        symbols: new Map(),
+        outgoing: new Map(),
+        incoming: new Map(),
+        fileSymbols: new Map(),
+        fileImports: new Map(),
+        fileCalls: new Map(),
+        fileImportBindings: new Map(),
+        fileExports: new Map(),
+    };
+}
+// ── Symbol factory ───────────────────────────────────────────────────────────
+export function createSymbol(id, name, kind, file, line, overrides = {}) {
+    return {
+        id,
+        name,
+        kind,
+        file,
+        line,
+        endLine: overrides.endLine ?? line,
+        col: overrides.col ?? 0,
+        visibility: overrides.visibility ?? "public",
+        docstring: overrides.docstring ?? "",
+        signature: overrides.signature ?? "",
+        returnType: overrides.returnType ?? "",
+        params: overrides.params ?? "",
+        pagerank: overrides.pagerank ?? 0.0,
+    };
+}
+// ── Edge factory ─────────────────────────────────────────────────────────────
+export function createEdge(source, target, weight, kind, confidence = 1.0) {
+    return { source, target, weight, kind, confidence };
+}
+export function serializeSymbol(sym) {
+    return {
+        id: sym.id,
+        name: sym.name,
+        kind: sym.kind,
+        file: sym.file,
+        line: sym.line,
+        endLine: sym.endLine,
+        col: sym.col,
+        visibility: sym.visibility,
+        signature: sym.signature,
+        returnType: sym.returnType,
+        params: sym.params,
+        docstring: sym.docstring,
+        pagerank: sym.pagerank,
+    };
+}
+export function serializeEdge(edge) {
+    return {
+        source: edge.source,
+        target: edge.target,
+        weight: edge.weight,
+        kind: edge.kind,
+    };
+}
+export function serializeGraph(graph) {
+    const symbols = [];
+    for (const sym of graph.symbols.values()) {
+        symbols.push(serializeSymbol(sym));
+    }
+    const edges = [];
+    for (const [, edgeList] of graph.outgoing) {
+        for (const edge of edgeList) {
+            edges.push(serializeEdge(edge));
+        }
+    }
+    return {
+        symbols,
+        edges,
+        version: 1,
+        timestamp: Date.now(),
+    };
+}
+function edgeIdentity(edge) {
+    return `${edge.source}|${edge.target}|${edge.kind}`;
+}
+function edgeIdentityFromRow(row) {
+    return `${row.source}|${row.target}|${row.kind}`;
+}
+function stableKey(sym) {
+    return `${sym.file}::${sym.name}::${sym.kind}`;
+}
+export function compareGraphSnapshots(currentSymbols, currentEdges, previousSymbols, previousEdges) {
+    const currentSymMap = new Map(currentSymbols.map((s) => [s.id, s]));
+    const prevSymMap = new Map(previousSymbols.map((s) => [s.id, s]));
+    const currentIds = new Set(currentSymMap.keys());
+    const prevIds = new Set(prevSymMap.keys());
+    let addedIds = [...currentIds].filter((id) => !prevIds.has(id));
+    let removedIds = [...prevIds].filter((id) => !currentIds.has(id));
+    // Stable key matching for line-drift reconciliation
+    const addedByKey = new Map();
+    for (const sid of addedIds) {
+        const s = currentSymMap.get(sid);
+        const key = stableKey(s);
+        const arr = addedByKey.get(key) || [];
+        arr.push(sid);
+        addedByKey.set(key, arr);
+    }
+    const removedByKey = new Map();
+    for (const sid of removedIds) {
+        const s = prevSymMap.get(sid);
+        const key = stableKey(s);
+        const arr = removedByKey.get(key) || [];
+        arr.push(sid);
+        removedByKey.set(key, arr);
+    }
+    const reconciledPairs = [];
+    for (const [key, adds] of addedByKey) {
+        const rems = removedByKey.get(key) || [];
+        for (let i = 0; i < Math.min(adds.length, rems.length); i++) {
+            reconciledPairs.push([rems[i], adds[i]]);
+        }
+    }
+    const reconciledAdded = new Set(reconciledPairs.map((p) => p[1]));
+    const reconciledRemoved = new Set(reconciledPairs.map((p) => p[0]));
+    addedIds = addedIds.filter((id) => !reconciledAdded.has(id));
+    removedIds = removedIds.filter((id) => !reconciledRemoved.has(id));
+    // Modified: same ID, signature or location changed
+    const commonIds = [...currentIds].filter((id) => prevIds.has(id));
+    const modifiedSymbols = [];
+    for (const id of commonIds) {
+        const cur = currentSymMap.get(id);
+        const prev = prevSymMap.get(id);
+        const sigChanged = cur.signature !== prev.signature;
+        const locChanged = cur.line !== prev.line ||
+            cur.endLine !== prev.endLine ||
+            cur.file !== prev.file;
+        if (sigChanged || locChanged) {
+            modifiedSymbols.push({
+                id: cur.id,
+                name: cur.name,
+                file: cur.file,
+                visibility: cur.visibility,
+                kind: cur.kind,
+                lineChange: `${prev.line} -> ${cur.line}`,
+                oldSignature: prev.signature,
+                newSignature: cur.signature,
+                signatureChanged: sigChanged,
+                risk: sigChanged ? "HIGH" : "LOW",
+            });
+        }
+    }
+    // Reconciled pairs as modified
+    for (const [prevId, curId] of reconciledPairs) {
+        const cur = currentSymMap.get(curId);
+        const prev = prevSymMap.get(prevId);
+        const sigChanged = cur.signature !== prev.signature;
+        modifiedSymbols.push({
+            id: cur.id,
+            name: cur.name,
+            file: cur.file,
+            visibility: cur.visibility,
+            kind: cur.kind,
+            lineChange: `${prev.line} -> ${cur.line}`,
+            oldSignature: prev.signature,
+            newSignature: cur.signature,
+            signatureChanged: sigChanged,
+            risk: sigChanged ? "HIGH" : "LOW",
+        });
+    }
+    // Edge changes
+    const currentEdgeSet = new Set(currentEdges.map(edgeIdentity));
+    const prevEdgeSet = new Set(previousEdges.map(edgeIdentityFromRow));
+    const edgesAdded = [...currentEdgeSet].filter((e) => !prevEdgeSet.has(e));
+    const edgesRemoved = [...prevEdgeSet].filter((e) => !currentEdgeSet.has(e));
+    return {
+        summary: {
+            added: addedIds.length,
+            removed: removedIds.length,
+            modified: modifiedSymbols.length,
+            edgesAdded: edgesAdded.length,
+            edgesRemoved: edgesRemoved.length,
+        },
+        addedSymbols: addedIds.map((id) => {
+            const s = currentSymMap.get(id);
+            return { id: s.id, name: s.name, file: s.file, line: s.line };
+        }),
+        removedSymbols: removedIds.map((id) => {
+            const s = prevSymMap.get(id);
+            return { id: s.id, name: s.name, file: s.file, line: s.line };
+        }),
+        modifiedSymbols,
+        callChainChanges: {
+            newCalls: edgesAdded.slice(0, 20).map((e) => {
+                const [from, to, kind] = e.split("|");
+                return { from, to, kind };
+            }),
+            removedCalls: edgesRemoved.slice(0, 20).map((e) => {
+                const [from, to, kind] = e.split("|");
+                return { from, to, kind };
+            }),
+        },
+    };
+}
+// ── Constants ────────────────────────────────────────────────────────────────
+export const LOW_SIGNAL_KINDS = new Set([
+    "element",
+    "selector",
+    "class_selector",
+    "id_selector",
+    "json_key",
+]);
+export const BOILERPLATE_NAMES = new Set(["__init__", "__main__"]);
+export function signalWeightForSymbol(kind, name, visibility) {
+    if (LOW_SIGNAL_KINDS.has(kind))
+        return 0.002;
+    if (BOILERPLATE_NAMES.has(name))
+        return 0.35;
+    if (name.startsWith("_") && visibility === "private")
+        return 0.85;
+    return 1.0;
+}
+//# sourceMappingURL=graph.js.map

package/dist/core/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../core/graph.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AA4DH,gFAAgF;AAEhF,MAAM,UAAU,eAAe;IAC9B,OAAO;QACN,OAAO,EAAE,IAAI,GAAG,EAAE;QAClB,QAAQ,EAAE,IAAI,GAAG,EAAE;QACnB,QAAQ,EAAE,IAAI,GAAG,EAAE;QACnB,WAAW,EAAE,IAAI,GAAG,EAAE;QACtB,WAAW,EAAE,IAAI,GAAG,EAAE;QACtB,SAAS,EAAE,IAAI,GAAG,EAAE;QACpB,kBAAkB,EAAE,IAAI,GAAG,EAAE;QAC7B,WAAW,EAAE,IAAI,GAAG,EAAE;KACtB,CAAC;AACH,CAAC;AAED,gFAAgF;AAEhF,MAAM,UAAU,YAAY,CAC3B,EAAU,EACV,IAAY,EACZ,IAAY,EACZ,IAAY,EACZ,IAAY,EACZ,YAA6B,EAAE;IAE/B,OAAO;QACN,EAAE;QACF,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,IAAI;QACJ,OAAO,EAAE,SAAS,CAAC,OAAO,IAAI,IAAI;QAClC,GAAG,EAAE,SAAS,CAAC,GAAG,IAAI,CAAC;QACvB,UAAU,EAAE,SAAS,CAAC,UAAU,IAAI,QAAQ;QAC5C,SAAS,EAAE,SAAS,CAAC,SAAS,IAAI,EAAE;QACpC,SAAS,EAAE,SAAS,CAAC,SAAS,IAAI,EAAE;QACpC,UAAU,EAAE,SAAS,CAAC,UAAU,IAAI,EAAE;QACtC,MAAM,EAAE,SAAS,CAAC,MAAM,IAAI,EAAE;QAC9B,QAAQ,EAAE,SAAS,CAAC,QAAQ,IAAI,GAAG;KACnC,CAAC;AACH,CAAC;AAED,gFAAgF;AAEhF,MAAM,UAAU,UAAU,CACzB,MAAc,EACd,MAAc,EACd,MAAc,EACd,IAAY,EACZ,aAAqB,GAAG;IAExB,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,UAAU,EAAE,CAAC;AACrD,CAAC;AAkCD,MAAM,UAAU,eAAe,CAAC,GAAW;IAC1C,OAAO;QACN,EAAE,EAAE,GAAG,CAAC,EAAE;QACV,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,IAAI,EAAE,GAAG,CAAC,IAAI;QACd,OAAO,EAAE,GAAG,CAAC,OAAO;QACpB,GAAG,EAAE,GAAG,CAAC,GAAG;QACZ,UAAU,EAAE,GAAG,CAAC,UAAU;QAC1B,SAAS,EAAE,GAAG,CAAC,SAAS;QACxB,UAAU,EAAE,GAAG,CAAC,UAAU;QAC1B,MAAM,EAAE,GAAG,CAAC,MAAM;QAClB,SAAS,EAAE,GAAG,CAAC,SAAS;QACxB,QAAQ,EAAE,GAAG,CAAC,QAAQ;KACtB,CAAC;AACH,CAAC;AAED,MAAM,UAAU,aAAa,CAAC,IAAU;IACvC,OAAO;QACN,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,MAAM,EAAE,IAAI,CAAC,MAAM;QACnB,IAAI,EAAE,IAAI,CAAC,IAAI;KACf,CAAC;AACH,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,KAAgB;IAC9C,MAAM,OAAO,GAAuB,EAAE,CAAC;IACvC,KAAK,MAAM,GAAG,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QAC1C,OAAO,CAAC,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC;IACpC,CAAC;IACD,MAAM,KAAK,GAAqB,EAAE,CAAC;IACnC,KAAK,MAAM,CAAC,EAAE,QAAQ,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QAC3C,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,IAAI,CAAC,CAAC,CAAC;QACjC,CAAC;IACF,CAAC;IACD,OAAO;QACN,OAAO;QACP,KAAK;QACL,OAAO,EAAE,CAAC;QACV,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE;KACrB,CAAC;AACH,CAAC;AAoCD,SAAS,YAAY,CAAC,IAAU;IAC/B,OAAO,GAAG,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;AACrD,CAAC;AAED,SAAS,mBAAmB,CAAC,GAAmB;IAC/C,OAAO,GAAG,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC;AAClD,CAAC;AAED,SAAS,SAAS,CAAC,GAAiD;IACnE,OAAO,GAAG,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,EAAE,CAAC;AAChD,CAAC;AAED,MAAM,UAAU,qBAAqB,CACpC,cAAwB,EACxB,YAAoB,EACpB,eAAmC,EACnC,aAA+B;IAE/B,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAElE,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;IACjD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC;IAE3C,IAAI,QAAQ,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAChE,IAAI,UAAU,GAAG,CAAC,GAAG,OAAO,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAElE,oDAAoD;IACpD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC/C,KAAK,MAAM,GAAG,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QAClC,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,GAAG,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QACtC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACd,UAAU,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC1B,CAAC;IACD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;IACjD,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;QAC9B,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,GAAG,CAAE,CAAC;QAC/B,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QACxC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACd,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC5B,CAAC;IAED,MAAM,eAAe,GAAuB,EAAE,CAAC;IAC/C,KAAK,MAAM,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,UAAU,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;QACzC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7D,eAAe,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC;IACF,CAAC;IACD,MAAM,eAAe,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACpE,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,eAAe,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7D,UAAU,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,iBAAiB,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAEnE,mDAAmD;IACnD,MAAM,SAAS,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAClE,MAAM,eAAe,GAAqB,EAAE,CAAC;IAC7C,KAAK,MAAM,EAAE,IAAI,SAAS,EAAE,CAAC;QAC5B,MAAM,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QACnC,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;QACjC,MAAM,UAAU,GAAG,GAAG,CAAC,SAAS,KAAK,IAAI,CAAC,SAAS,CAAC;QACpD,MAAM,UAAU,GACf,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI;YACtB,GAAG,CAAC,OAAO,KAAK,IAAI,CAAC,OAAO;YAC5B,GAAG,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC;QACxB,IAAI,UAAU,IAAI,UAAU,EAAE,CAAC;YAC9B,eAAe,CAAC,IAAI,CAAC;gBACpB,EAAE,EAAE,GAAG,CAAC,EAAE;gBACV,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,UAAU,EAAE,GAAG,CAAC,UAAU;gBAC1B,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,UAAU,EAAE,GAAG,IAAI,CAAC,IAAI,OAAO,GAAG,CAAC,IAAI,EAAE;gBACzC,YAAY,EAAE,IAAI,CAAC,SAAS;gBAC5B,YAAY,EAAE,GAAG,CAAC,SAAS;gBAC3B,gBAAgB,EAAE,UAAU;gBAC5B,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK;aACjC,CAAC,CAAC;QACJ,CAAC;IACF,CAAC;IAED,+BAA+B;IAC/B,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,eAAe,EAAE,CAAC;QAC/C,MAAM,GAAG,GAAG,aAAa,CAAC,GAAG,CAAC,KAAK,CAAE,CAAC;QACtC,MAAM,IAAI,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAE,CAAC;QACrC,MAAM,UAAU,GAAG,GAAG,CAAC,SAAS,KAAK,IAAI,CAAC,SAAS,CAAC;QACpD,eAAe,CAAC,IAAI,CAAC;YACpB,EAAE,EAAE,GAAG,CAAC,EAAE;YACV,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,UAAU,EAAE,GAAG,CAAC,UAAU;YAC1B,IAAI,EAAE,GAAG,CAAC,IAAI;YACd,UAAU,EAAE,GAAG,IAAI,CAAC,IAAI,OAAO,GAAG,CAAC,IAAI,EAAE;YACzC,YAAY,EAAE,IAAI,CAAC,SAAS;YAC5B,YAAY,EAAE,GAAG,CAAC,SAAS;YAC3B,gBAAgB,EAAE,UAAU;YAC5B,IAAI,EAAE,UAAU,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK;SACjC,CAAC,CAAC;IACJ,CAAC;IAED,eAAe;IACf,MAAM,cAAc,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC;IAC/D,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,mBAAmB,CAAC,CAAC,CAAC;IAEpE,MAAM,UAAU,GAAG,CAAC,GAAG,cAAc,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,MAAM,YAAY,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,cAAc,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAE5E,OAAO;QACN,OAAO,EAAE;YACR,KAAK,EAAE,QAAQ,CAAC,MAAM;YACtB,OAAO,EAAE,UAAU,CAAC,MAAM;YAC1B,QAAQ,EAAE,eAAe,CAAC,MAAM;YAChC,UAAU,EAAE,UAAU,CAAC,MAAM;YAC7B,YAAY,EAAE,YAAY,CAAC,MAAM;SACjC;QACD,YAAY,EAAE,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE;YACjC,MAAM,CAAC,GAAG,aAAa,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YACjC,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QAC/D,CAAC,CAAC;QACF,cAAc,EAAE,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE;YACrC,MAAM,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC;YAC9B,OAAO,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QAC/D,CAAC,CAAC;QACF,eAAe;QACf,gBAAgB,EAAE;YACjB,QAAQ,EAAE,UAAU,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;gBAC3C,MAAM,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBACtC,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;YAC3B,CAAC,CAAC;YACF,YAAY,EAAE,YAAY,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;gBACjD,MAAM,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;gBACtC,OAAO,EAAE,IAAI,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC;YAC3B,CAAC,CAAC;SACF;KACD,CAAC;AACH,CAAC;AAED,gFAAgF;AAEhF,MAAM,CAAC,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC;IACvC,SAAS;IACT,UAAU;IACV,gBAAgB;IAChB,aAAa;IACb,UAAU;CACV,CAAC,CAAC;AAEH,MAAM,CAAC,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,CAAC,UAAU,EAAE,UAAU,CAAC,CAAC,CAAC;AAEnE,MAAM,UAAU,qBAAqB,CACpC,IAAY,EACZ,IAAY,EACZ,UAAkB;IAElB,IAAI,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC;QAAE,OAAO,KAAK,CAAC;IAC7C,IAAI,iBAAiB,CAAC,GAAG,CAAC,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC;IAC7C,IAAI,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,UAAU,KAAK,SAAS;QAAE,OAAO,IAAI,CAAC;IAClE,OAAO,GAAG,CAAC;AACZ,CAAC"}

package/dist/core/pagerank.d.ts

@@ -0,0 +1,19 @@
+/**
+ * pi-shazam core/pagerank — PageRank importance scoring on RepoGraph.
+ *
+ * Ported from repomap/src/ranking.py (GraphAnalyzer.calculate_pagerank).
+ *
+ * The algorithm is pure iterative PageRank with convergence detection.
+ * No external dependencies beyond the graph data model.
+ */
+import type { RepoGraph } from "./graph.js";
+/**
+ * Calculate PageRank scores for all symbols in the graph.
+ * Scores are stored directly on each symbol's `.pagerank` field.
+ *
+ * Damping factor: 0.85 (standard PageRank)
+ * Max iterations: 50
+ * Convergence tolerance: 1e-6
+ */
+export declare function calculatePageRank(graph: RepoGraph, damping?: number, maxIter?: number, tol?: number): void;
+//# sourceMappingURL=pagerank.d.ts.map

package/dist/core/pagerank.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"pagerank.d.ts","sourceRoot":"","sources":["../../core/pagerank.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,YAAY,CAAC;AAE5C;;;;;;;GAOG;AACH,wBAAgB,iBAAiB,CAChC,KAAK,EAAE,SAAS,EAChB,OAAO,GAAE,MAAa,EACtB,OAAO,GAAE,MAAW,EACpB,GAAG,GAAE,MAAa,GAChB,IAAI,CAgGN"}

package/dist/core/pagerank.js

@@ -0,0 +1,106 @@
+/**
+ * pi-shazam core/pagerank — PageRank importance scoring on RepoGraph.
+ *
+ * Ported from repomap/src/ranking.py (GraphAnalyzer.calculate_pagerank).
+ *
+ * The algorithm is pure iterative PageRank with convergence detection.
+ * No external dependencies beyond the graph data model.
+ */
+/**
+ * Calculate PageRank scores for all symbols in the graph.
+ * Scores are stored directly on each symbol's `.pagerank` field.
+ *
+ * Damping factor: 0.85 (standard PageRank)
+ * Max iterations: 50
+ * Convergence tolerance: 1e-6
+ */
+export function calculatePageRank(graph, damping = 0.85, maxIter = 50, tol = 1e-6) {
+    const ids = [...graph.symbols.keys()];
+    const n = ids.length;
+    if (n === 0)
+        return;
+    // Initial uniform distribution
+    const pr = new Map();
+    for (const id of ids) {
+        pr.set(id, 1.0 / n);
+    }
+    // Compute outgoing weight sums
+    const outW = new Map();
+    for (const id of ids) {
+        const edges = graph.outgoing.get(id);
+        if (!edges || edges.length === 0) {
+            outW.set(id, 0);
+            continue;
+        }
+        let sum = 0;
+        for (const e of edges) {
+            sum += e.weight;
+        }
+        outW.set(id, sum);
+    }
+    // Active sources: nodes with positive outgoing weight
+    const activeSrcs = new Set();
+    for (const id of ids) {
+        const w = outW.get(id) || 0;
+        if (w > 0 && !isNaN(w) && isFinite(w)) {
+            activeSrcs.add(id);
+        }
+    }
+    // Build incoming index: tgt -> [(src, weight), ...]
+    const inc = new Map();
+    for (const [src, edges] of graph.outgoing) {
+        if (!activeSrcs.has(src))
+            continue;
+        for (const e of edges) {
+            const arr = inc.get(e.target) || [];
+            arr.push([src, e.weight]);
+            inc.set(e.target, arr);
+        }
+    }
+    const base = (1 - damping) / n;
+    for (let iter = 0; iter < maxIter; iter++) {
+        const newPr = new Map();
+        for (const id of ids) {
+            let score = base;
+            const incoming = inc.get(id);
+            if (incoming) {
+                for (const [src, w] of incoming) {
+                    const srcPr = pr.get(src) || 0;
+                    const srcOutW = outW.get(src) || 1;
+                    score += (damping * srcPr * w) / srcOutW;
+                }
+            }
+            newPr.set(id, score);
+        }
+        // Normalize
+        let total = 0;
+        for (const score of newPr.values()) {
+            total += score;
+        }
+        total = total || 1.0;
+        for (const [id, score] of newPr) {
+            newPr.set(id, score / total);
+        }
+        // Convergence check
+        let delta = 0;
+        for (const id of ids) {
+            const oldScore = pr.get(id) || 0;
+            const newScore = newPr.get(id) || 0;
+            delta = Math.max(delta, Math.abs(newScore - oldScore));
+        }
+        // Update pr for next iteration
+        for (const [id, score] of newPr) {
+            pr.set(id, score);
+        }
+        if (delta < tol)
+            break;
+    }
+    // Store scores back on symbols
+    for (const [id, score] of pr) {
+        const sym = graph.symbols.get(id);
+        if (sym) {
+            sym.pagerank = score;
+        }
+    }
+}
+//# sourceMappingURL=pagerank.js.map

package/dist/core/pagerank.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"pagerank.js","sourceRoot":"","sources":["../../core/pagerank.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAIH;;;;;;;GAOG;AACH,MAAM,UAAU,iBAAiB,CAChC,KAAgB,EAChB,UAAkB,IAAI,EACtB,UAAkB,EAAE,EACpB,MAAc,IAAI;IAElB,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,CAAC;IACtC,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,CAAC;IACrB,IAAI,CAAC,KAAK,CAAC;QAAE,OAAO;IAEpB,+BAA+B;IAC/B,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;IACrC,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACtB,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC;IACrB,CAAC;IAED,+BAA+B;IAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACtB,MAAM,KAAK,GAAG,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAClC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YAChB,SAAS;QACV,CAAC;QACD,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACvB,GAAG,IAAI,CAAC,CAAC,MAAM,CAAC;QACjB,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;IACnB,CAAC;IAED,sDAAsD;IACtD,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IACrC,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;QACtB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC5B,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC;YACvC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACpB,CAAC;IACF,CAAC;IAED,oDAAoD;IACpD,MAAM,GAAG,GAAG,IAAI,GAAG,EAA8B,CAAC;IAClD,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,KAAK,CAAC,QAAQ,EAAE,CAAC;QAC3C,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,GAAG,CAAC;YAAE,SAAS;QACnC,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACvB,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;YACpC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;YAC1B,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC;QACxB,CAAC;IACF,CAAC;IAED,MAAM,IAAI,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;IAE/B,KAAK,IAAI,IAAI,GAAG,CAAC,EAAE,IAAI,GAAG,OAAO,EAAE,IAAI,EAAE,EAAE,CAAC;QAC3C,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QACxC,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACtB,IAAI,KAAK,GAAG,IAAI,CAAC;YACjB,MAAM,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YAC7B,IAAI,QAAQ,EAAE,CAAC;gBACd,KAAK,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,IAAI,QAAQ,EAAE,CAAC;oBACjC,MAAM,KAAK,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBAC/B,MAAM,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;oBACnC,KAAK,IAAI,CAAC,OAAO,GAAG,KAAK,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC;gBAC1C,CAAC;YACF,CAAC;YACD,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACtB,CAAC;QAED,YAAY;QACZ,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACpC,KAAK,IAAI,KAAK,CAAC;QAChB,CAAC;QACD,KAAK,GAAG,KAAK,IAAI,GAAG,CAAC;QACrB,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE,CAAC;YACjC,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,GAAG,KAAK,CAAC,CAAC;QAC9B,CAAC;QAED,oBAAoB;QACpB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACtB,MAAM,QAAQ,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,QAAQ,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YACpC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,GAAG,QAAQ,CAAC,CAAC,CAAC;QACxD,CAAC;QAED,+BAA+B;QAC/B,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE,CAAC;YACjC,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACnB,CAAC;QAED,IAAI,KAAK,GAAG,GAAG;YAAE,MAAM;IACxB,CAAC;IAED,+BAA+B;IAC/B,KAAK,MAAM,CAAC,EAAE,EAAE,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC;QAC9B,MAAM,GAAG,GAAG,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAClC,IAAI,GAAG,EAAE,CAAC;YACT,GAAG,CAAC,QAAQ,GAAG,KAAK,CAAC;QACtB,CAAC;IACF,CAAC;AACF,CAAC"}

package/dist/core/scanner.d.ts

@@ -0,0 +1,19 @@
+/**
+ * pi-shazam core/scanner — Project scanning + graph building.
+ *
+ * Walks project directories, parses source files with tree-sitter,
+ * extracts symbols/imports/calls, and builds the full RepoGraph.
+ *
+ * This is the main entry point that all tools compose from.
+ */
+import type { RepoGraph } from "./graph.js";
+/**
+ * Scan a project directory, parse all source files, build the dependency graph,
+ * and compute PageRank scores.
+ *
+ * @param projectPath - Absolute or relative path to the project root
+ * @param log - Optional logger
+ * @returns The fully built RepoGraph with PageRank scores set
+ */
+export declare function scanProject(projectPath: string, log?: (msg: string) => void): RepoGraph;
+//# sourceMappingURL=scanner.d.ts.map

package/dist/core/scanner.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"scanner.d.ts","sourceRoot":"","sources":["../../core/scanner.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AASH,OAAO,KAAK,EAAE,SAAS,EAAgB,MAAM,YAAY,CAAC;AAgC1D;;;;;;;GAOG;AACH,wBAAgB,WAAW,CAC1B,WAAW,EAAE,MAAM,EACnB,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,MAAM,KAAK,IAAI,GACzB,SAAS,CAuIX"}

package/dist/core/scanner.js

@@ -0,0 +1,266 @@
+/**
+ * pi-shazam core/scanner — Project scanning + graph building.
+ *
+ * Walks project directories, parses source files with tree-sitter,
+ * extracts symbols/imports/calls, and builds the full RepoGraph.
+ *
+ * This is the main entry point that all tools compose from.
+ */
+import { readdirSync } from "node:fs";
+import { join, relative, resolve } from "node:path";
+import { TreeSitterAdapter, EXT_TO_LANG } from "./treesitter.js";
+import { createRepoGraph, createEdge, } from "./graph.js";
+import { calculatePageRank } from "./pagerank.js";
+import { readFileAdaptive } from "./encoding.js";
+// ── Constants ────────────────────────────────────────────────────────────────
+/** Directories to skip during project scan */
+const SKIP_DIRS = new Set([
+    "node_modules",
+    "dist",
+    ".git",
+    ".worktrees",
+    ".cache",
+    ".pi-shazam",
+    ".qoder",
+    "__pycache__",
+    "target", // Rust
+    ".venv",
+    "venv",
+    ".tox",
+    "coverage",
+    ".nyc_output",
+]);
+/** Maximum files to scan (safety limit) */
+const MAX_FILES = 20_000;
+/** File extensions to scan */
+const SOURCE_EXTS = new Set(Object.keys(EXT_TO_LANG));
+// ── Scanner ──────────────────────────────────────────────────────────────────
+/**
+ * Scan a project directory, parse all source files, build the dependency graph,
+ * and compute PageRank scores.
+ *
+ * @param projectPath - Absolute or relative path to the project root
+ * @param log - Optional logger
+ * @returns The fully built RepoGraph with PageRank scores set
+ */
+export function scanProject(projectPath, log) {
+    const root = resolve(projectPath);
+    const logger = log ?? (() => { });
+    const adapter = new TreeSitterAdapter(logger);
+    const graph = createRepoGraph();
+    // Collect all source files
+    const files = collectSourceFiles(root, MAX_FILES);
+    logger(`Scanned ${files.length} source files`);
+    // Phase 1: Extract symbols from all files
+    const fileSymbolMap = new Map();
+    for (const relPath of files) {
+        const absPath = join(root, relPath);
+        const ext = relPath.slice(relPath.lastIndexOf(".")).toLowerCase();
+        const lang = EXT_TO_LANG[ext];
+        if (!lang)
+            continue;
+        try {
+            const source = readFileAdaptive(absPath);
+            const tree = adapter.parse(source, lang);
+            if (!tree)
+                continue;
+            const symbols = adapter.extractSymbols(tree, lang, relPath);
+            fileSymbolMap.set(relPath, symbols);
+            for (const sym of symbols) {
+                graph.symbols.set(sym.id, sym);
+                const fileSyms = graph.fileSymbols.get(relPath) || [];
+                fileSyms.push(sym.id);
+                graph.fileSymbols.set(relPath, fileSyms);
+            }
+        }
+        catch {
+            // Skip unparseable files
+        }
+    }
+    logger(`Extracted ${graph.symbols.size} symbols`);
+    // Phase 2: Extract imports and calls, build edges
+    for (const relPath of files) {
+        const absPath = join(root, relPath);
+        const ext = relPath.slice(relPath.lastIndexOf(".")).toLowerCase();
+        const lang = EXT_TO_LANG[ext];
+        if (!lang)
+            continue;
+        try {
+            const source = readFileAdaptive(absPath);
+            const tree = adapter.parse(source, lang);
+            if (!tree)
+                continue;
+            // Import edges: file-level imports → link imported symbols to files
+            const imports = adapter.extractImports(tree, lang);
+            if (imports.length > 0) {
+                graph.fileImports.set(relPath, imports.map(([m]) => m));
+                // Create edges from this file's symbols to symbols in imported files
+                const thisFileSyms = graph.fileSymbols.get(relPath) || [];
+                for (const [importedModule] of imports) {
+                    const resolvedImport = resolveImport(importedModule, relPath);
+                    const targetFileSyms = graph.fileSymbols.get(resolvedImport) || [];
+                    for (const srcId of thisFileSyms) {
+                        for (const tgtId of targetFileSyms) {
+                            addEdge(graph, createEdge(srcId, tgtId, 0.3, "import", 0.5));
+                        }
+                    }
+                }
+            }
+            // Call edges: function calls → link caller to callee
+            const calls = adapter.extractCalls(tree, lang);
+            if (calls.length > 0) {
+                graph.fileCalls.set(relPath, calls);
+                const thisFileSyms = graph.fileSymbols.get(relPath) || [];
+                for (const [calledName, callLine] of calls) {
+                    // Find the most specific symbol in this file that could be the caller
+                    // (the symbol definition that contains this call line)
+                    const callerSyms = findCallerSymbols(thisFileSyms, graph.symbols, callLine);
+                    // Find callee symbols across the entire project
+                    const calleeSyms = findCalleeSymbols(calledName, graph.symbols);
+                    for (const caller of callerSyms) {
+                        for (const callee of calleeSyms) {
+                            if (caller.id !== callee.id) {
+                                addEdge(graph, createEdge(caller.id, callee.id, 1.0, "call", 0.9));
+                            }
+                        }
+                    }
+                }
+            }
+            // JS/TS import bindings (precise symbol-level imports)
+            const jsImports = adapter.extractJsTsImportBindings(tree, lang);
+            if (jsImports.length > 0) {
+                graph.fileImportBindings.set(relPath, jsImports);
+                for (const binding of jsImports) {
+                    // Find the local symbol that represents this import binding
+                    const localSym = findSymbolByNameInFile(binding.localName, relPath, graph.symbols);
+                    if (!localSym)
+                        continue;
+                    // Find the source symbol in the imported module
+                    const resolvedModule = resolveImport(binding.module, relPath);
+                    const sourceSym = findSymbolByNameInFile(binding.importedName, resolvedModule, graph.symbols);
+                    if (sourceSym) {
+                        addEdge(graph, createEdge(localSym.id, sourceSym.id, 0.8, "import-binding", 1.0));
+                    }
+                }
+            }
+        }
+        catch {
+            // Skip unparseable files
+        }
+    }
+    // Phase 3: Compute PageRank
+    calculatePageRank(graph);
+    return graph;
+}
+// ── File collection ──────────────────────────────────────────────────────────
+function collectSourceFiles(root, maxFiles) {
+    const files = [];
+    function walk(dir) {
+        if (files.length >= maxFiles)
+            return;
+        let entries;
+        try {
+            entries = readdirSync(dir, { withFileTypes: true });
+        }
+        catch {
+            return;
+        }
+        for (const entry of entries) {
+            if (files.length >= maxFiles)
+                return;
+            const relPath = relative(root, join(dir, entry.name));
+            if (entry.isDirectory()) {
+                if (SKIP_DIRS.has(entry.name))
+                    continue;
+                if (entry.name.startsWith(".") && !SKIP_DIRS.has(entry.name))
+                    continue;
+                walk(join(dir, entry.name));
+            }
+            else if (entry.isFile()) {
+                const ext = entry.name.slice(entry.name.lastIndexOf(".")).toLowerCase();
+                if (SOURCE_EXTS.has(ext)) {
+                    files.push(relPath);
+                }
+            }
+        }
+    }
+    walk(root);
+    return files;
+}
+// ── Edge helpers ─────────────────────────────────────────────────────────────
+function addEdge(graph, edge) {
+    const outgoing = graph.outgoing.get(edge.source) || [];
+    outgoing.push(edge);
+    graph.outgoing.set(edge.source, outgoing);
+    const incoming = graph.incoming.get(edge.target) || [];
+    incoming.push(edge);
+    graph.incoming.set(edge.target, incoming);
+}
+// ── Import resolution ─────────────────────────────────────────────────────────
+/**
+ * Resolve a relative import path to a file path that matches the fileSymbols keys.
+ * Handles extensionless imports (e.g., "./foo" → "./foo.ts" or "./foo/index.ts").
+ */
+function resolveImport(importPath, fromFile) {
+    // If it's a relative import, resolve against the fromFile's directory
+    if (importPath.startsWith(".")) {
+        const fromDir = fromFile.includes("/")
+            ? fromFile.slice(0, fromFile.lastIndexOf("/"))
+            : ".";
+        let resolved = join(fromDir, importPath);
+        // Try common extensions and index files
+        const candidates = [
+            resolved,
+            `${resolved}.ts`,
+            `${resolved}.tsx`,
+            `${resolved}.js`,
+            `${resolved}.jsx`,
+            `${resolved}/index.ts`,
+            `${resolved}/index.tsx`,
+            `${resolved}/index.js`,
+        ];
+        return candidates[0];
+    }
+    // For bare module imports (e.g., "react", "lodash"), we can't resolve
+    // them to project files, so we return the import path as-is
+    return importPath;
+}
+// ── Symbol lookup helpers ────────────────────────────────────────────────────
+function findCallerSymbols(fileSymIds, symbols, callLine) {
+    // Find symbols in the file that contain this call line within their range
+    const candidates = [];
+    for (const id of fileSymIds) {
+        const sym = symbols.get(id);
+        if (!sym)
+            continue;
+        if (sym.line <= callLine && callLine <= sym.endLine) {
+            candidates.push(sym);
+        }
+    }
+    // Return the most specific (narrowest range) match first
+    candidates.sort((a, b) => {
+        const aRange = a.endLine - a.line;
+        const bRange = b.endLine - b.line;
+        return aRange - bRange || a.line - b.line;
+    });
+    // Return the most specific one
+    return candidates.length > 0 ? [candidates[0]] : [];
+}
+function findCalleeSymbols(name, symbols) {
+    const results = [];
+    for (const sym of symbols.values()) {
+        if (sym.name === name) {
+            results.push(sym);
+        }
+    }
+    return results;
+}
+function findSymbolByNameInFile(name, file, symbols) {
+    for (const sym of symbols.values()) {
+        if (sym.file === file && sym.name === name) {
+            return sym;
+        }
+    }
+    return undefined;
+}
+//# sourceMappingURL=scanner.js.map