mincut-context 1.0.0

package/dist/core/select.d.ts

@@ -0,0 +1,60 @@
+import type { SymbolGraph } from './graph.js';
+export interface SelectOptions {
+    /** Seed node ids — always included in the result. */
+    seeds: ReadonlySet<string>;
+    /** Personalized PageRank values per node (or any node-relevance scoring). */
+    ranks: ReadonlyMap<string, number>;
+    /** Token budget the selection must respect. */
+    budget: number;
+    /**
+     * Weight on the rank term in the greedy objective.  Default 1.
+     * Higher → favor task-relevant nodes more, even if loosely attached.
+     */
+    rankWeight?: number;
+    /**
+     * Weight on the attachment term.  Default 1.
+     * Higher → favor nodes that close off the cut boundary,
+     * even at the cost of some rank.
+     */
+    attachmentWeight?: number;
+}
+export interface SelectionEntry {
+    id: string;
+    tokens: number;
+    rank: number;
+    reason: string;
+}
+export interface SelectionResult {
+    selected: Set<string>;
+    entries: SelectionEntry[];
+    tokens: number;
+    cutCost: number;
+}
+/**
+ * Greedy budget-constrained min-cut approximation.
+ *
+ *     Given a graph G, seed set S, node-relevance r, and token budget B,
+ *     find T ⊇ S with Σ tokens(T) ≤ B that approximately maximizes
+ *
+ *        f(T) = Σ_{v∈T} r(v) − λ · cut(T, V\T) / (cut(∅,V) + 1)
+ *
+ *     The objective is monotone submodular over the relevance term and
+ *     the negative-cut term is submodular w.r.t. inclusion, so the classic
+ *     greedy algorithm achieves a  (1 − 1/e)  approximation under a
+ *     knapsack constraint (Sviridenko 2004 / Krause & Guestrin 2005).
+ *
+ * Implementation note: instead of recomputing cut(T) at every step (O(|V|)),
+ * we track each candidate's incremental "attachment ratio":
+ *
+ *      attach(v, T) = w(edges(v) ∩ T) / w(edges(v))
+ *
+ * which is monotone increasing as T grows and gives a per-token figure of
+ * merit:
+ *
+ *      score(v, T) = ( rankWeight · r(v) · (attach(v, T) + ε) ) / tokens(v)
+ *
+ * Greedy picks the unselected v with the highest score that still fits in
+ * the remaining budget.
+ */
+export declare function greedySelect(graph: SymbolGraph, options: SelectOptions): SelectionResult;
+//# sourceMappingURL=select.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"select.d.ts","sourceRoot":"","sources":["../../src/core/select.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,YAAY,CAAC;AAE9C,MAAM,WAAW,aAAa;IAC5B,qDAAqD;IACrD,KAAK,EAAE,WAAW,CAAC,MAAM,CAAC,CAAC;IAC3B,6EAA6E;IAC7E,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IACnC,+CAA+C;IAC/C,MAAM,EAAE,MAAM,CAAC;IACf;;;OAGG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;;;OAIG;IACH,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC3B;AAED,MAAM,WAAW,cAAc;IAC7B,EAAE,EAAE,MAAM,CAAC;IACX,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,eAAe;IAC9B,QAAQ,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACtB,OAAO,EAAE,cAAc,EAAE,CAAC;IAC1B,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;CACjB;AAED;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,WAAW,EAAE,OAAO,EAAE,aAAa,GAAG,eAAe,CAoFxF"}

package/dist/core/select.js

@@ -0,0 +1,121 @@
+/**
+ * Greedy budget-constrained min-cut approximation.
+ *
+ *     Given a graph G, seed set S, node-relevance r, and token budget B,
+ *     find T ⊇ S with Σ tokens(T) ≤ B that approximately maximizes
+ *
+ *        f(T) = Σ_{v∈T} r(v) − λ · cut(T, V\T) / (cut(∅,V) + 1)
+ *
+ *     The objective is monotone submodular over the relevance term and
+ *     the negative-cut term is submodular w.r.t. inclusion, so the classic
+ *     greedy algorithm achieves a  (1 − 1/e)  approximation under a
+ *     knapsack constraint (Sviridenko 2004 / Krause & Guestrin 2005).
+ *
+ * Implementation note: instead of recomputing cut(T) at every step (O(|V|)),
+ * we track each candidate's incremental "attachment ratio":
+ *
+ *      attach(v, T) = w(edges(v) ∩ T) / w(edges(v))
+ *
+ * which is monotone increasing as T grows and gives a per-token figure of
+ * merit:
+ *
+ *      score(v, T) = ( rankWeight · r(v) · (attach(v, T) + ε) ) / tokens(v)
+ *
+ * Greedy picks the unselected v with the highest score that still fits in
+ * the remaining budget.
+ */
+export function greedySelect(graph, options) {
+    const { seeds, ranks, budget, rankWeight = 1, attachmentWeight = 1, } = options;
+    const selected = new Set();
+    const entries = [];
+    let usedTokens = 0;
+    // 1. Seeds first.  They must all fit.
+    for (const id of seeds) {
+        const data = graph.getNode(id);
+        if (!data)
+            throw new Error(`seed not in graph: ${id}`);
+        if (usedTokens + data.tokens > budget) {
+            throw new Error(`seeds exceed budget: seed "${id}" needs ${data.tokens} tokens, ${budget - usedTokens} remaining of budget ${budget}`);
+        }
+        selected.add(id);
+        usedTokens += data.tokens;
+        entries.push({
+            id,
+            tokens: data.tokens,
+            rank: ranks.get(id) ?? 0,
+            reason: 'seed — matched directly by task',
+        });
+    }
+    // 2. Greedy fill.
+    while (true) {
+        const remaining = budget - usedTokens;
+        if (remaining <= 0)
+            break;
+        let best = null;
+        for (const id of graph.nodes()) {
+            if (selected.has(id))
+                continue;
+            const data = graph.getNode(id);
+            if (!data || data.tokens > remaining)
+                continue;
+            const attach = attachmentRatio(graph, id, selected);
+            // Hard cut-boundary constraint: never extend into a disconnected node.
+            // Adding it would strictly increase cut(T,V\T) without benefit, which
+            // contradicts the min-cut objective.  This is also what gives us the
+            // "auth-only for an auth task" cohesion.
+            if (attach === 0)
+                continue;
+            const rank = ranks.get(id) ?? 0;
+            const score = (rankWeight * rank * attach * attachmentWeight) / Math.max(data.tokens, 1);
+            if (!best || score > best.score) {
+                best = { id, score, tokens: data.tokens, rank, attach };
+            }
+        }
+        if (!best)
+            break;
+        selected.add(best.id);
+        usedTokens += best.tokens;
+        entries.push({
+            id: best.id,
+            tokens: best.tokens,
+            rank: best.rank,
+            reason: reasonFor(best.attach, best.rank),
+        });
+    }
+    return {
+        selected,
+        entries,
+        tokens: usedTokens,
+        cutCost: graph.cutCost(selected),
+    };
+}
+function attachmentRatio(graph, id, t) {
+    let inside = 0;
+    let total = 0;
+    for (const e of graph.outEdges(id)) {
+        total += e.data.weight;
+        if (t.has(e.target))
+            inside += e.data.weight;
+    }
+    for (const e of graph.inEdges(id)) {
+        total += e.data.weight;
+        if (t.has(e.target))
+            inside += e.data.weight;
+    }
+    if (total === 0)
+        return 0;
+    return inside / total;
+}
+function reasonFor(attach, rank) {
+    if (attach >= 0.5 && rank > 0)
+        return `attached (${pct(attach)}) + ranked (${rank.toFixed(3)})`;
+    if (attach > 0)
+        return `attached (${pct(attach)})`;
+    if (rank > 0)
+        return `ranked (${rank.toFixed(3)})`;
+    return 'opportunistic';
+}
+function pct(x) {
+    return `${Math.round(x * 100)}%`;
+}
+//# sourceMappingURL=select.js.map

package/dist/core/select.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"select.js","sourceRoot":"","sources":["../../src/core/select.ts"],"names":[],"mappings":"AAoCA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;AACH,MAAM,UAAU,YAAY,CAAC,KAAkB,EAAE,OAAsB;IACrE,MAAM,EACJ,KAAK,EACL,KAAK,EACL,MAAM,EACN,UAAU,GAAG,CAAC,EACd,gBAAgB,GAAG,CAAC,GACrB,GAAG,OAAO,CAAC;IAEZ,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,OAAO,GAAqB,EAAE,CAAC;IACrC,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,sCAAsC;IACtC,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;QACvB,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC/B,IAAI,CAAC,IAAI;YAAE,MAAM,IAAI,KAAK,CAAC,sBAAsB,EAAE,EAAE,CAAC,CAAC;QACvD,IAAI,UAAU,GAAG,IAAI,CAAC,MAAM,GAAG,MAAM,EAAE,CAAC;YACtC,MAAM,IAAI,KAAK,CACb,8BAA8B,EAAE,WAAW,IAAI,CAAC,MAAM,YACpD,MAAM,GAAG,UACX,wBAAwB,MAAM,EAAE,CACjC,CAAC;QACJ,CAAC;QACD,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QACjB,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC;QAC1B,OAAO,CAAC,IAAI,CAAC;YACX,EAAE;YACF,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,IAAI,EAAE,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC;YACxB,MAAM,EAAE,iCAAiC;SAC1C,CAAC,CAAC;IACL,CAAC;IAED,kBAAkB;IAClB,OAAO,IAAI,EAAE,CAAC;QACZ,MAAM,SAAS,GAAG,MAAM,GAAG,UAAU,CAAC;QACtC,IAAI,SAAS,IAAI,CAAC;YAAE,MAAM;QAE1B,IAAI,IAAI,GAMG,IAAI,CAAC;QAEhB,KAAK,MAAM,EAAE,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;YAC/B,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YAC/B,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;YAC/B,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,MAAM,GAAG,SAAS;gBAAE,SAAS;YAE/C,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,EAAE,EAAE,EAAE,QAAQ,CAAC,CAAC;YACpD,uEAAuE;YACvE,sEAAsE;YACtE,qEAAqE;YACrE,yCAAyC;YACzC,IAAI,MAAM,KAAK,CAAC;gBAAE,SAAS;YAE3B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;YAChC,MAAM,KAAK,GAAG,CAAC,UAAU,GAAG,IAAI,GAAG,MAAM,GAAG,gBAAgB,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAEzF,IAAI,CAAC,IAAI,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,EAAE,CAAC;gBAChC,IAAI,GAAG,EAAE,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC;YAC1D,CAAC;QACH,CAAC;QAED,IAAI,CAAC,IAAI;YAAE,MAAM;QACjB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtB,UAAU,IAAI,IAAI,CAAC,MAAM,CAAC;QAC1B,OAAO,CAAC,IAAI,CAAC;YACX,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,MAAM,EAAE,IAAI,CAAC,MAAM;YACnB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,MAAM,EAAE,SAAS,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC;SAC1C,CAAC,CAAC;IACL,CAAC;IAED,OAAO;QACL,QAAQ;QACR,OAAO;QACP,MAAM,EAAE,UAAU;QAClB,OAAO,EAAE,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC;KACjC,CAAC;AACJ,CAAC;AAED,SAAS,eAAe,CACtB,KAAkB,EAClB,EAAU,EACV,CAAsB;IAEtB,IAAI,MAAM,GAAG,CAAC,CAAC;IACf,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC,EAAE,CAAC;QACnC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;QACvB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;IAC/C,CAAC;IACD,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC;QAClC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;QACvB,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC;YAAE,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;IAC/C,CAAC;IACD,IAAI,KAAK,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAC1B,OAAO,MAAM,GAAG,KAAK,CAAC;AACxB,CAAC;AAED,SAAS,SAAS,CAAC,MAAc,EAAE,IAAY;IAC7C,IAAI,MAAM,IAAI,GAAG,IAAI,IAAI,GAAG,CAAC;QAAE,OAAO,aAAa,GAAG,CAAC,MAAM,CAAC,eAAe,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;IAChG,IAAI,MAAM,GAAG,CAAC;QAAE,OAAO,aAAa,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC;IACnD,IAAI,IAAI,GAAG,CAAC;QAAE,OAAO,WAAW,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;IACnD,OAAO,eAAe,CAAC;AACzB,CAAC;AAED,SAAS,GAAG,CAAC,CAAS;IACpB,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC;AACnC,CAAC"}

package/dist/index/builder.d.ts

@@ -0,0 +1,13 @@
+import { SymbolGraph } from '../core/graph.js';
+import { type WalkOptions } from './walker.js';
+export interface IndexResult {
+    graph: SymbolGraph;
+    stats: {
+        files: number;
+        symbols: number;
+        edges: number;
+        unresolvedCalls: number;
+    };
+}
+export declare function indexRepo(root: string, options?: WalkOptions): IndexResult;
+//# sourceMappingURL=builder.d.ts.map

package/dist/index/builder.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"builder.d.ts","sourceRoot":"","sources":["../../src/index/builder.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAI/C,OAAO,EAAQ,KAAK,WAAW,EAAE,MAAM,aAAa,CAAC;AAYrD,MAAM,WAAW,WAAW;IAC1B,KAAK,EAAE,WAAW,CAAC;IACnB,KAAK,EAAE;QACL,KAAK,EAAE,MAAM,CAAC;QACd,OAAO,EAAE,MAAM,CAAC;QAChB,KAAK,EAAE,MAAM,CAAC;QACd,eAAe,EAAE,MAAM,CAAC;KACzB,CAAC;CACH;AAED,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,GAAE,WAAgB,GAAG,WAAW,CAwF9E"}

package/dist/index/builder.js

@@ -0,0 +1,186 @@
+import path from 'node:path';
+import { SymbolGraph } from '../core/graph.js';
+import { parseTypeScript } from '../parsers/ts.js';
+import { parsePython } from '../parsers/py.js';
+import { walk } from './walker.js';
+const TS_EXT = new Set(['.ts', '.tsx', '.js', '.jsx', '.mjs', '.cjs']);
+const PY_EXT = new Set(['.py', '.pyi']);
+function parseForExt(file, source) {
+    const ext = path.extname(file);
+    if (TS_EXT.has(ext))
+        return parseTypeScript(file, source);
+    if (PY_EXT.has(ext))
+        return parsePython(file, source);
+    return null;
+}
+export function indexRepo(root, options = {}) {
+    const graph = new SymbolGraph();
+    // Per-file accumulators we need for cross-file resolution.
+    const fileImports = new Map();
+    const symbolsByFile = new Map();
+    const symbolByName = new Map();
+    const pendingCalls = [];
+    let fileCount = 0;
+    let unresolved = 0;
+    for (const file of walk(root, options)) {
+        const parsed = parseForExt(file.relPath, file.source);
+        if (!parsed)
+            continue;
+        fileCount += 1;
+        fileImports.set(file.relPath, parsed.imports);
+        symbolsByFile.set(file.relPath, parsed.symbols);
+        for (const sym of parsed.symbols) {
+            if (graph.hasNode(sym.id))
+                continue;
+            graph.addNode(sym.id, {
+                tokens: sym.tokens,
+                file: sym.file,
+                kind: sym.kind,
+                name: sym.name,
+                startLine: sym.startLine,
+                endLine: sym.endLine,
+            });
+            const arr = symbolByName.get(sym.name) ?? [];
+            arr.push(sym.id);
+            symbolByName.set(sym.name, arr);
+        }
+        for (const call of parsed.calls) {
+            pendingCalls.push({ from: call.from, toName: call.toName, file: file.relPath });
+        }
+    }
+    const knownFiles = new Set(symbolsByFile.keys());
+    const resolve = (file, spec) => resolveImportPath(file, spec, knownFiles);
+    // Resolve calls in a second pass.
+    for (const call of pendingCalls) {
+        const target = resolveCall(call.from, call.toName, call.file, fileImports, symbolsByFile, symbolByName, resolve);
+        if (!target) {
+            unresolved += 1;
+            continue;
+        }
+        if (!graph.hasNode(call.from) || !graph.hasNode(target))
+            continue;
+        if (call.from === target)
+            continue;
+        graph.addEdge(call.from, target, { weight: 1, kind: 'call' });
+    }
+    // Add import-level structural edges (lower weight than calls).
+    for (const [file, imports] of fileImports) {
+        const callers = (symbolsByFile.get(file) ?? []).map((s) => s.id);
+        if (callers.length === 0)
+            continue;
+        for (const imp of imports) {
+            const resolvedFile = resolve(file, imp.source);
+            if (!resolvedFile)
+                continue;
+            const targets = symbolsByFile.get(resolvedFile);
+            if (!targets)
+                continue;
+            for (const name of imp.names) {
+                const targetSym = targets.find((s) => s.name === name);
+                if (!targetSym)
+                    continue;
+                for (const caller of callers) {
+                    if (caller === targetSym.id)
+                        continue;
+                    if (!graph.hasNode(caller) || !graph.hasNode(targetSym.id))
+                        continue;
+                    if (graph.hasEdge(caller, targetSym.id))
+                        continue;
+                    graph.addEdge(caller, targetSym.id, { weight: 0.5, kind: 'import' });
+                }
+            }
+        }
+    }
+    return {
+        graph,
+        stats: {
+            files: fileCount,
+            symbols: graph.order(),
+            edges: graph.size(),
+            unresolvedCalls: unresolved,
+        },
+    };
+}
+function resolveCall(fromId, name, file, fileImports, symbolsByFile, symbolByName, resolve) {
+    // 1. Try imports in the caller's file.
+    const imports = fileImports.get(file) ?? [];
+    for (const imp of imports) {
+        if (!imp.names.includes(name))
+            continue;
+        const resolved = resolve(file, imp.source);
+        if (!resolved)
+            continue;
+        const targetSym = symbolsByFile.get(resolved)?.find((s) => s.name === name);
+        if (targetSym)
+            return targetSym.id;
+    }
+    // 2. Same-file lookup.
+    const candidates = symbolByName.get(name) ?? [];
+    const sameFile = candidates.find((id) => id.startsWith(`${file}:`));
+    if (sameFile && sameFile !== fromId)
+        return sameFile;
+    // 3. Unique global match (heuristic).
+    if (candidates.length === 1 && candidates[0] !== fromId)
+        return candidates[0];
+    return null;
+}
+function resolveImportPath(fromFile, spec, knownFiles) {
+    const isPython = fromFile.endsWith('.py') || fromFile.endsWith('.pyi');
+    if (isPython)
+        return resolvePythonImport(fromFile, spec, knownFiles);
+    return resolveJsImport(fromFile, spec, knownFiles);
+}
+function resolveJsImport(fromFile, spec, knownFiles) {
+    if (!spec.startsWith('.'))
+        return null;
+    const fromDir = path.posix.dirname(fromFile);
+    const base = path.posix.normalize(path.posix.join(fromDir, spec));
+    const candidates = [
+        base,
+        `${base}.ts`, `${base}.tsx`, `${base}.js`, `${base}.jsx`, `${base}.mjs`, `${base}.cjs`,
+        `${base}/index.ts`, `${base}/index.tsx`, `${base}/index.js`,
+    ];
+    for (const c of candidates)
+        if (knownFiles.has(c))
+            return c;
+    return null;
+}
+/**
+ * Python import resolution.  Maps:
+ *   `from .session import X`     →  same-dir/session.py
+ *   `from ..auth import X`       →  parent-dir/auth.py
+ *   `from pkg.sub import X`      →  pkg/sub.py
+ *   `from . import X`            →  same-dir/X.py
+ * Falls back to same-package layout.
+ */
+function resolvePythonImport(fromFile, spec, knownFiles) {
+    const fromDir = path.posix.dirname(fromFile);
+    let resolvedDir = fromDir;
+    let remainder = spec;
+    // Leading dots = relative level.
+    while (remainder.startsWith('.')) {
+        if (remainder.startsWith('..')) {
+            resolvedDir = path.posix.dirname(resolvedDir);
+            remainder = remainder.slice(1);
+        }
+        else {
+            remainder = remainder.slice(1);
+        }
+    }
+    // dotted_name → path segments.
+    const moduleSegments = remainder ? remainder.split('.') : [];
+    const base = moduleSegments.length
+        ? path.posix.normalize(path.posix.join(resolvedDir, ...moduleSegments))
+        : path.posix.normalize(resolvedDir);
+    const candidates = [
+        `${base}.py`,
+        `${base}.pyi`,
+        `${base}/__init__.py`,
+        base,
+    ];
+    for (const c of candidates)
+        if (knownFiles.has(c))
+            return c;
+    return null;
+}
+//# sourceMappingURL=builder.js.map

package/dist/index/builder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"builder.js","sourceRoot":"","sources":["../../src/index/builder.ts"],"names":[],"mappings":"AAAA,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAC/C,OAAO,EAAE,eAAe,EAAE,MAAM,kBAAkB,CAAC;AACnD,OAAO,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAE/C,OAAO,EAAE,IAAI,EAAoB,MAAM,aAAa,CAAC;AAErD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;AACvE,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;AAExC,SAAS,WAAW,CAAC,IAAY,EAAE,MAAc;IAC/C,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IAC/B,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;QAAE,OAAO,eAAe,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAC1D,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC;QAAE,OAAO,WAAW,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IACtD,OAAO,IAAI,CAAC;AACd,CAAC;AAYD,MAAM,UAAU,SAAS,CAAC,IAAY,EAAE,UAAuB,EAAE;IAC/D,MAAM,KAAK,GAAG,IAAI,WAAW,EAAE,CAAC;IAEhC,2DAA2D;IAC3D,MAAM,WAAW,GAAG,IAAI,GAAG,EAA0B,CAAC;IACtD,MAAM,aAAa,GAAG,IAAI,GAAG,EAA0B,CAAC;IACxD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAoB,CAAC;IACjD,MAAM,YAAY,GAAqD,EAAE,CAAC;IAE1E,IAAI,SAAS,GAAG,CAAC,CAAC;IAClB,IAAI,UAAU,GAAG,CAAC,CAAC;IAEnB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAC;QACvC,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;QACtD,IAAI,CAAC,MAAM;YAAE,SAAS;QAEtB,SAAS,IAAI,CAAC,CAAC;QACf,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;QAC9C,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC;QAEhD,KAAK,MAAM,GAAG,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;YACjC,IAAI,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBAAE,SAAS;YACpC,KAAK,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE;gBACpB,MAAM,EAAE,GAAG,CAAC,MAAM;gBAClB,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,IAAI,EAAE,GAAG,CAAC,IAAI;gBACd,SAAS,EAAE,GAAG,CAAC,SAAS;gBACxB,OAAO,EAAE,GAAG,CAAC,OAAO;aACrB,CAAC,CAAC;YACH,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YAC7C,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjB,YAAY,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAClC,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,KAAK,EAAE,CAAC;YAChC,YAAY,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC;QAClF,CAAC;IACH,CAAC;IAED,MAAM,UAAU,GAAG,IAAI,GAAG,CAAS,aAAa,CAAC,IAAI,EAAE,CAAC,CAAC;IAEzD,MAAM,OAAO,GAAG,CAAC,IAAY,EAAE,IAAY,EAAiB,EAAE,CAC5D,iBAAiB,CAAC,IAAI,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;IAE5C,kCAAkC;IAClC,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,MAAM,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,WAAW,EAAE,aAAa,EAAE,YAAY,EAAE,OAAO,CAAC,CAAC;QACjH,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,UAAU,IAAI,CAAC,CAAC;YAChB,SAAS;QACX,CAAC;QACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC;YAAE,SAAS;QAClE,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;YAAE,SAAS;QACnC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAC;IAChE,CAAC;IAED,+DAA+D;IAC/D,KAAK,MAAM,CAAC,IAAI,EAAE,OAAO,CAAC,IAAI,WAAW,EAAE,CAAC;QAC1C,MAAM,OAAO,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QACjE,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACnC,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;YAC1B,MAAM,YAAY,GAAG,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;YAC/C,IAAI,CAAC,YAAY;gBAAE,SAAS;YAC5B,MAAM,OAAO,GAAG,aAAa,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC;YAChD,IAAI,CAAC,OAAO;gBAAE,SAAS;YACvB,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;gBAC7B,MAAM,SAAS,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;gBACvD,IAAI,CAAC,SAAS;oBAAE,SAAS;gBACzB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;oBAC7B,IAAI,MAAM,KAAK,SAAS,CAAC,EAAE;wBAAE,SAAS;oBACtC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;wBAAE,SAAS;oBACrE,IAAI,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,CAAC;wBAAE,SAAS;oBAClD,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,SAAS,CAAC,EAAE,EAAE,EAAE,MAAM,EAAE,GAAG,EAAE,IAAI,EAAE,QAAQ,EAAE,CAAC,CAAC;gBACvE,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO;QACL,KAAK;QACL,KAAK,EAAE;YACL,KAAK,EAAE,SAAS;YAChB,OAAO,EAAE,KAAK,CAAC,KAAK,EAAE;YACtB,KAAK,EAAE,KAAK,CAAC,IAAI,EAAE;YACnB,eAAe,EAAE,UAAU;SAC5B;KACF,CAAC;AACJ,CAAC;AAED,SAAS,WAAW,CAClB,MAAc,EACd,IAAY,EACZ,IAAY,EACZ,WAAwC,EACxC,aAA0C,EAC1C,YAAmC,EACnC,OAAsD;IAEtD,uCAAuC;IACvC,MAAM,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAC5C,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC;YAAE,SAAS;QACxC,MAAM,QAAQ,GAAG,OAAO,CAAC,IAAI,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,CAAC,QAAQ;YAAE,SAAS;QACxB,MAAM,SAAS,GAAG,aAAa,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;QAC5E,IAAI,SAAS;YAAE,OAAO,SAAS,CAAC,EAAE,CAAC;IACrC,CAAC;IACD,uBAAuB;IACvB,MAAM,UAAU,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;IAChD,MAAM,QAAQ,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC;IACpE,IAAI,QAAQ,IAAI,QAAQ,KAAK,MAAM;QAAE,OAAO,QAAQ,CAAC;IACrD,sCAAsC;IACtC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,IAAI,UAAU,CAAC,CAAC,CAAC,KAAK,MAAM;QAAE,OAAO,UAAU,CAAC,CAAC,CAAC,CAAC;IAC9E,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,iBAAiB,CACxB,QAAgB,EAChB,IAAY,EACZ,UAA+B;IAE/B,MAAM,QAAQ,GAAG,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,IAAI,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IACvE,IAAI,QAAQ;QAAE,OAAO,mBAAmB,CAAC,QAAQ,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;IACrE,OAAO,eAAe,CAAC,QAAQ,EAAE,IAAI,EAAE,UAAU,CAAC,CAAC;AACrD,CAAC;AAED,SAAS,eAAe,CACtB,QAAgB,EAChB,IAAY,EACZ,UAA+B;IAE/B,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IACvC,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAC7C,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC;IAClE,MAAM,UAAU,GAAG;QACjB,IAAI;QACJ,GAAG,IAAI,KAAK,EAAE,GAAG,IAAI,MAAM,EAAE,GAAG,IAAI,KAAK,EAAE,GAAG,IAAI,MAAM,EAAE,GAAG,IAAI,MAAM,EAAE,GAAG,IAAI,MAAM;QACtF,GAAG,IAAI,WAAW,EAAE,GAAG,IAAI,YAAY,EAAE,GAAG,IAAI,WAAW;KAC5D,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,UAAU;QAAE,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;IAC5D,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,mBAAmB,CAC1B,QAAgB,EAChB,IAAY,EACZ,UAA+B;IAE/B,MAAM,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAC7C,IAAI,WAAW,GAAG,OAAO,CAAC;IAC1B,IAAI,SAAS,GAAG,IAAI,CAAC;IAErB,iCAAiC;IACjC,OAAO,SAAS,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;QACjC,IAAI,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YAC/B,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YAC9C,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC;aAAM,CAAC;YACN,SAAS,GAAG,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IACD,+BAA+B;IAC/B,MAAM,cAAc,GAAG,SAAS,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;IAC7D,MAAM,IAAI,GAAG,cAAc,CAAC,MAAM;QAChC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,WAAW,EAAE,GAAG,cAAc,CAAC,CAAC;QACvE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;IAEtC,MAAM,UAAU,GAAG;QACjB,GAAG,IAAI,KAAK;QACZ,GAAG,IAAI,MAAM;QACb,GAAG,IAAI,cAAc;QACrB,IAAI;KACL,CAAC;IACF,KAAK,MAAM,CAAC,IAAI,UAAU;QAAE,IAAI,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC;YAAE,OAAO,CAAC,CAAC;IAC5D,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/index/walker.d.ts

@@ -0,0 +1,15 @@
+export interface WalkOptions {
+    /** Glob-like patterns of files to include (matched against POSIX-style relative paths). */
+    include?: string[];
+    /** Extra ignore patterns appended to .gitignore rules. */
+    exclude?: string[];
+    /** Max bytes per file before we skip (default 256 KB). */
+    maxBytes?: number;
+}
+export interface WalkedFile {
+    absPath: string;
+    relPath: string;
+    source: string;
+}
+export declare function walk(root: string, options?: WalkOptions): IterableIterator<WalkedFile>;
+//# sourceMappingURL=walker.d.ts.map

package/dist/index/walker.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"walker.d.ts","sourceRoot":"","sources":["../../src/index/walker.ts"],"names":[],"mappings":"AAIA,MAAM,WAAW,WAAW;IAC1B,2FAA2F;IAC3F,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IACnB,0DAA0D;IAC1D,OAAO,CAAC,EAAE,MAAM,EAAE,CAAC;IACnB,0DAA0D;IAC1D,QAAQ,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,UAAU;IACzB,OAAO,EAAE,MAAM,CAAC;IAChB,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;CAChB;AA0BD,wBAAiB,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,GAAE,WAAgB,GAAG,gBAAgB,CAAC,UAAU,CAAC,CA2C3F"}

package/dist/index/walker.js

@@ -0,0 +1,103 @@
+import { readFileSync, statSync, readdirSync, existsSync } from 'node:fs';
+import path from 'node:path';
+import ignore from 'ignore';
+const DEFAULT_EXCLUDES = [
+    '.git/',
+    'node_modules/',
+    'dist/',
+    'build/',
+    'coverage/',
+    '.next/',
+    '.nuxt/',
+    '.turbo/',
+    '.cache/',
+    '.parcel-cache/',
+    '.svelte-kit/',
+    '.pnpm-store/',
+    '.idea/',
+    '.vscode/',
+    '.DS_Store',
+    '*.min.js',
+    '*.min.css',
+    '*.map',
+    '*.log',
+];
+const SUPPORTED_EXT = new Set(['.ts', '.tsx', '.js', '.jsx', '.mjs', '.cjs', '.py', '.pyi']);
+export function* walk(root, options = {}) {
+    const maxBytes = options.maxBytes ?? 256 * 1024;
+    const ig = buildIgnore(root, options.exclude);
+    const includePatterns = options.include?.map(globToPrefix) ?? null;
+    function* walkDir(dir) {
+        let entries;
+        try {
+            entries = readdirSync(dir);
+        }
+        catch {
+            return;
+        }
+        for (const name of entries) {
+            const abs = path.join(dir, name);
+            const rel = toPosix(path.relative(root, abs));
+            let stat;
+            try {
+                stat = statSync(abs);
+            }
+            catch {
+                continue;
+            }
+            const relForIgnore = stat.isDirectory() ? `${rel}/` : rel;
+            if (ig.ignores(relForIgnore))
+                continue;
+            if (stat.isDirectory()) {
+                yield* walkDir(abs);
+                continue;
+            }
+            if (!stat.isFile())
+                continue;
+            const ext = path.extname(name);
+            if (!SUPPORTED_EXT.has(ext))
+                continue;
+            if (stat.size > maxBytes)
+                continue;
+            if (includePatterns && !includePatterns.some((p) => rel.startsWith(p)))
+                continue;
+            let source;
+            try {
+                source = readFileSync(abs, 'utf8');
+            }
+            catch {
+                continue;
+            }
+            yield { absPath: abs, relPath: rel, source };
+        }
+    }
+    yield* walkDir(root);
+}
+function buildIgnore(root, extraExcludes) {
+    const ig = ignore();
+    ig.add(DEFAULT_EXCLUDES);
+    const gitignore = path.join(root, '.gitignore');
+    if (existsSync(gitignore)) {
+        try {
+            ig.add(readFileSync(gitignore, 'utf8'));
+        }
+        catch {
+            // ignore
+        }
+    }
+    if (extraExcludes?.length)
+        ig.add(extraExcludes);
+    return ig;
+}
+function toPosix(p) {
+    return p.replace(/\\/g, '/');
+}
+/**
+ * Convert simple glob like 'src/auth/**' into a path prefix.  For v1.0 we
+ * support only the trailing `**` / `*` wildcard form; anything fancier should
+ * fall back to a full glob library if needed.
+ */
+function globToPrefix(glob) {
+    return glob.replace(/\/\*\*$/, '/').replace(/\/\*$/, '/').replace(/\*\*$/, '');
+}
+//# sourceMappingURL=walker.js.map

package/dist/index/walker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"walker.js","sourceRoot":"","sources":["../../src/index/walker.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,YAAY,EAAE,QAAQ,EAAE,WAAW,EAAE,UAAU,EAAE,MAAM,SAAS,CAAC;AAC1E,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,MAAuB,MAAM,QAAQ,CAAC;AAiB7C,MAAM,gBAAgB,GAAG;IACvB,OAAO;IACP,eAAe;IACf,OAAO;IACP,QAAQ;IACR,WAAW;IACX,QAAQ;IACR,QAAQ;IACR,SAAS;IACT,SAAS;IACT,gBAAgB;IAChB,cAAc;IACd,cAAc;IACd,QAAQ;IACR,UAAU;IACV,WAAW;IACX,UAAU;IACV,WAAW;IACX,OAAO;IACP,OAAO;CACR,CAAC;AAEF,MAAM,aAAa,GAAG,IAAI,GAAG,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;AAE7F,MAAM,SAAS,CAAC,CAAC,IAAI,CAAC,IAAY,EAAE,UAAuB,EAAE;IAC3D,MAAM,QAAQ,GAAG,OAAO,CAAC,QAAQ,IAAI,GAAG,GAAG,IAAI,CAAC;IAChD,MAAM,EAAE,GAAG,WAAW,CAAC,IAAI,EAAE,OAAO,CAAC,OAAO,CAAC,CAAC;IAC9C,MAAM,eAAe,GAAG,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,YAAY,CAAC,IAAI,IAAI,CAAC;IAEnE,QAAQ,CAAC,CAAC,OAAO,CAAC,GAAW;QAC3B,IAAI,OAAiB,CAAC;QACtB,IAAI,CAAC;YACH,OAAO,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC;QAC7B,CAAC;QAAC,MAAM,CAAC;YACP,OAAO;QACT,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;YAC3B,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;YACjC,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;YAC9C,IAAI,IAAI,CAAC;YACT,IAAI,CAAC;gBACH,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC;YACvB,CAAC;YAAC,MAAM,CAAC;gBACP,SAAS;YACX,CAAC;YACD,MAAM,YAAY,GAAG,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC,GAAG,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC;YAC1D,IAAI,EAAE,CAAC,OAAO,CAAC,YAAY,CAAC;gBAAE,SAAS;YACvC,IAAI,IAAI,CAAC,WAAW,EAAE,EAAE,CAAC;gBACvB,KAAK,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;gBACpB,SAAS;YACX,CAAC;YACD,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE;gBAAE,SAAS;YAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC/B,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,GAAG,CAAC;gBAAE,SAAS;YACtC,IAAI,IAAI,CAAC,IAAI,GAAG,QAAQ;gBAAE,SAAS;YACnC,IAAI,eAAe,IAAI,CAAC,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC;gBAAE,SAAS;YACjF,IAAI,MAAc,CAAC;YACnB,IAAI,CAAC;gBACH,MAAM,GAAG,YAAY,CAAC,GAAG,EAAE,MAAM,CAAC,CAAC;YACrC,CAAC;YAAC,MAAM,CAAC;gBACP,SAAS;YACX,CAAC;YACD,MAAM,EAAE,OAAO,EAAE,GAAG,EAAE,OAAO,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC;QAC/C,CAAC;IACH,CAAC;IAED,KAAK,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;AACvB,CAAC;AAED,SAAS,WAAW,CAAC,IAAY,EAAE,aAAwB;IACzD,MAAM,EAAE,GAAG,MAAM,EAAE,CAAC;IACpB,EAAE,CAAC,GAAG,CAAC,gBAAgB,CAAC,CAAC;IACzB,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,CAAC,CAAC;IAChD,IAAI,UAAU,CAAC,SAAS,CAAC,EAAE,CAAC;QAC1B,IAAI,CAAC;YACH,EAAE,CAAC,GAAG,CAAC,YAAY,CAAC,SAAS,EAAE,MAAM,CAAC,CAAC,CAAC;QAC1C,CAAC;QAAC,MAAM,CAAC;YACP,SAAS;QACX,CAAC;IACH,CAAC;IACD,IAAI,aAAa,EAAE,MAAM;QAAE,EAAE,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;IACjD,OAAO,EAAE,CAAC;AACZ,CAAC;AAED,SAAS,OAAO,CAAC,CAAS;IACxB,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AAC/B,CAAC;AAED;;;;GAIG;AACH,SAAS,YAAY,CAAC,IAAY;IAChC,OAAO,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;AACjF,CAAC"}

package/dist/parsers/parser.d.ts

@@ -0,0 +1,35 @@
+import type { NodeKind } from '../core/graph.js';
+export interface ParsedSymbol {
+    id: string;
+    name: string;
+    file: string;
+    kind: NodeKind;
+    startLine: number;
+    endLine: number;
+    tokens: number;
+}
+export interface ParsedImport {
+    source: string;
+    names: string[];
+    namespace?: string;
+}
+export interface ParsedCall {
+    from: string;
+    toName: string;
+}
+export interface ParseResult {
+    symbols: ParsedSymbol[];
+    imports: ParsedImport[];
+    calls: ParsedCall[];
+}
+export interface LanguageParser {
+    /** File extensions this parser claims, e.g. ['.ts', '.tsx']. */
+    extensions: string[];
+    parse(file: string, source: string): ParseResult;
+}
+/**
+ * Approximate token count from a character count.
+ * 4 chars/token is the canonical OpenAI rule-of-thumb.  Good enough for budgeting.
+ */
+export declare function approxTokens(text: string): number;
+//# sourceMappingURL=parser.d.ts.map

package/dist/parsers/parser.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"parser.d.ts","sourceRoot":"","sources":["../../src/parsers/parser.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,kBAAkB,CAAC;AAEjD,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,QAAQ,CAAC;IACf,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,YAAY;IAC3B,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,SAAS,CAAC,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,UAAU;IACzB,IAAI,EAAE,MAAM,CAAC;IACb,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,WAAW;IAC1B,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,OAAO,EAAE,YAAY,EAAE,CAAC;IACxB,KAAK,EAAE,UAAU,EAAE,CAAC;CACrB;AAED,MAAM,WAAW,cAAc;IAC7B,gEAAgE;IAChE,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,KAAK,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,WAAW,CAAC;CAClD;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,CAEjD"}

package/dist/parsers/parser.js

@@ -0,0 +1,8 @@
+/**
+ * Approximate token count from a character count.
+ * 4 chars/token is the canonical OpenAI rule-of-thumb.  Good enough for budgeting.
+ */
+export function approxTokens(text) {
+    return Math.ceil(text.length / 4);
+}
+//# sourceMappingURL=parser.js.map

package/dist/parsers/parser.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parser.js","sourceRoot":"","sources":["../../src/parsers/parser.ts"],"names":[],"mappings":"AAmCA;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,IAAY;IACvC,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;AACpC,CAAC"}

package/dist/parsers/py.d.ts

@@ -0,0 +1,3 @@
+import { type ParseResult } from './parser.js';
+export declare function parsePython(file: string, source: string): ParseResult;
+//# sourceMappingURL=py.d.ts.map

package/dist/parsers/py.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"py.d.ts","sourceRoot":"","sources":["../../src/parsers/py.ts"],"names":[],"mappings":"AAEA,OAAO,EAIL,KAAK,WAAW,EACjB,MAAM,aAAa,CAAC;AAQrB,wBAAgB,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,WAAW,CAmBrE"}