codegraph-java 0.1.0

package/dist/resolution/path-aliases.js

@@ -0,0 +1,346 @@
+"use strict";
+/**
+ * Project-level import-path alias loading.
+ *
+ * Reads `compilerOptions.paths` from `tsconfig.json` / `jsconfig.json`
+ * at the project root and converts the patterns into a form the
+ * import-resolver can consult.
+ *
+ * This is the single biggest blocker to accurate resolution on modern
+ * JS/TS codebases: aliases like `@/components/Foo` (Next, Nuxt, Nest,
+ * Vite scaffolds) point into a `paths` map the resolver previously
+ * ignored — every import through an alias was treated as unresolvable
+ * unless it happened to match the small hard-coded fallback list.
+ *
+ * Scope:
+ *   - reads tsconfig.json, then jsconfig.json, then tsconfig.base.json
+ *   - honours `compilerOptions.baseUrl` and `compilerOptions.paths`
+ *   - follows `extends` chains, nearest config wins (#1534) — Nx-style
+ *     monorepos keep every alias in a `tsconfig.base.json` the root
+ *     config merely inherits, so without this they resolved nothing
+ *   - supports `*` wildcard (the only TS-supported wildcard)
+ *   - does NOT read Vite/webpack/Rollup configs (separate follow-up)
+ *
+ * The file is parsed as JSON-with-comments-tolerant — tsconfigs in the
+ * wild routinely contain `//` and `/* *\/` comments and trailing
+ * commas, which JSON.parse rejects. We strip those before parsing.
+ */
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.loadProjectAliases = loadProjectAliases;
+exports.applyAliases = applyAliases;
+const fs = __importStar(require("fs"));
+const path = __importStar(require("path"));
+const errors_1 = require("../errors");
+/**
+ * Strip JSONC comments + trailing commas so a tsconfig with the usual
+ * VS Code-style annotations parses cleanly. Walks the source as a
+ * tiny state machine that tracks string context — the previous
+ * regex-only version corrupted any URL inside a string value
+ * (`"baseUrl": "https://cdn.example.com"` had everything after `//`
+ * truncated).
+ */
+function stripJsonc(src) {
+    let out = '';
+    let i = 0;
+    let inString = false;
+    while (i < src.length) {
+        const ch = src[i];
+        if (inString) {
+            out += ch;
+            if (ch === '\\' && i + 1 < src.length) {
+                out += src[i + 1];
+                i += 2;
+                continue;
+            }
+            if (ch === '"')
+                inString = false;
+            i++;
+            continue;
+        }
+        if (ch === '"') {
+            inString = true;
+            out += ch;
+            i++;
+            continue;
+        }
+        if (ch === '/' && src[i + 1] === '/') {
+            while (i < src.length && src[i] !== '\n')
+                i++;
+            continue;
+        }
+        if (ch === '/' && src[i + 1] === '*') {
+            i += 2;
+            while (i < src.length && !(src[i] === '*' && src[i + 1] === '/'))
+                i++;
+            i += 2;
+            continue;
+        }
+        out += ch;
+        i++;
+    }
+    // Trailing commas before } or ] — outside strings, so safe to
+    // run on the comment-stripped output.
+    return out.replace(/,(\s*[}\]])/g, '$1');
+}
+/** Guards against a pathological chain; real ones are 1-3 deep. */
+const MAX_EXTENDS_DEPTH = 32;
+/**
+ * Locate an `extends` target the way tsc does: `./x`-style values are
+ * relative to the referencing config, anything else is a node_modules
+ * package specifier resolved by walking up from that config. A missing
+ * `.json` extension is implied, and a bare package name means its
+ * `tsconfig.json`.
+ */
+function resolveExtendsTarget(spec, fromDir) {
+    const isFile = (p) => {
+        try {
+            return fs.statSync(p).isFile();
+        }
+        catch {
+            return false;
+        }
+    };
+    if (spec.startsWith('./') || spec.startsWith('../') || path.isAbsolute(spec)) {
+        const base = path.resolve(fromDir, spec);
+        for (const cand of [base, `${base}.json`, path.join(base, 'tsconfig.json')]) {
+            if (isFile(cand))
+                return cand;
+        }
+        return null;
+    }
+    let dir = fromDir;
+    for (;;) {
+        const base = path.join(dir, 'node_modules', spec);
+        for (const cand of [base, `${base}.json`, path.join(base, 'tsconfig.json')]) {
+            if (isFile(cand))
+                return cand;
+        }
+        const parent = path.dirname(dir);
+        if (parent === dir)
+            return null;
+        dir = parent;
+    }
+}
+/**
+ * Read `filePath` and fold its `extends` chain into a single set of
+ * effective options. Parents are applied first and the nearest config
+ * wins — tsc replaces `paths` wholesale rather than merging it.
+ *
+ * `stack` holds the configs currently being resolved, so a cycle
+ * (`a extends b extends a`) stops instead of recursing forever.
+ */
+function loadEffectiveOptions(filePath, stack, depth) {
+    const abs = path.resolve(filePath);
+    if (stack.has(abs) || depth > MAX_EXTENDS_DEPTH) {
+        (0, errors_1.logDebug)('path-aliases: extends chain cycle or too deep', { filePath: abs, depth });
+        return null;
+    }
+    const raw = readTsconfigLike(abs);
+    if (!raw)
+        return null;
+    stack.add(abs);
+    const dir = path.dirname(abs);
+    const effective = {};
+    const parents = typeof raw.extends === 'string' ? [raw.extends] : (raw.extends ?? []);
+    for (const spec of parents) {
+        if (typeof spec !== 'string')
+            continue;
+        const target = resolveExtendsTarget(spec, dir);
+        if (!target) {
+            (0, errors_1.logDebug)('path-aliases: unresolved extends', { from: abs, spec });
+            continue;
+        }
+        const inherited = loadEffectiveOptions(target, stack, depth + 1);
+        if (!inherited)
+            continue;
+        if (inherited.baseUrl !== undefined)
+            effective.baseUrl = inherited.baseUrl;
+        if (inherited.paths !== undefined) {
+            effective.paths = inherited.paths;
+            effective.pathsDir = inherited.pathsDir;
+        }
+    }
+    stack.delete(abs);
+    const co = raw.compilerOptions ?? {};
+    // Both are relative to the file that declared them, not to whichever
+    // config started the chain.
+    if (typeof co.baseUrl === 'string')
+        effective.baseUrl = path.resolve(dir, co.baseUrl);
+    if (co.paths && typeof co.paths === 'object') {
+        effective.paths = co.paths;
+        effective.pathsDir = dir;
+    }
+    return effective;
+}
+function readTsconfigLike(filePath) {
+    try {
+        const raw = fs.readFileSync(filePath, 'utf-8');
+        const parsed = JSON.parse(stripJsonc(raw));
+        return parsed && typeof parsed === 'object' ? parsed : null;
+    }
+    catch (err) {
+        (0, errors_1.logDebug)('path-aliases: failed to parse', { filePath, err: String(err) });
+        return null;
+    }
+}
+function splitWildcard(pattern) {
+    const star = pattern.indexOf('*');
+    if (star === -1)
+        return { prefix: pattern, suffix: '', hasWildcard: false };
+    return {
+        prefix: pattern.slice(0, star),
+        suffix: pattern.slice(star + 1),
+        hasWildcard: true,
+    };
+}
+/**
+ * Load aliases for `projectRoot`. Returns `null` when no tsconfig /
+ * jsconfig is present or when the file has no usable `paths`.
+ *
+ * Cheap to call repeatedly — caching is the caller's job (the
+ * resolver does it via {@link aliasCache}).
+ */
+function loadProjectAliases(projectRoot) {
+    // `tsconfig.base.json` comes last on purpose: when a root `tsconfig.json`
+    // exists it stays authoritative and reaches the base through `extends`.
+    // The fallback is for the Nx layouts where that never happens — a
+    // solution-style root config (`references`, no `extends`, no `paths`), or
+    // no root `tsconfig.json` at all.
+    const candidates = ['tsconfig.json', 'jsconfig.json', 'tsconfig.base.json'];
+    let effective = null;
+    let usedFile = null;
+    for (const name of candidates) {
+        const p = path.join(projectRoot, name);
+        if (!fs.existsSync(p))
+            continue;
+        const opts = loadEffectiveOptions(p, new Set(), 0);
+        if (!opts)
+            continue;
+        // Remember the first readable config so a `paths`-less project still
+        // logs the file it was judged on, but keep looking: a config that
+        // contributes no aliases must not shadow one that does.
+        if (!effective) {
+            effective = opts;
+            usedFile = name;
+        }
+        if (opts.paths) {
+            effective = opts;
+            usedFile = name;
+            break;
+        }
+    }
+    if (!effective)
+        return null;
+    // With no explicit baseUrl, `paths` targets are relative to the config that
+    // declared them — which is the project root only when that config is the
+    // root one (the pre-`extends` assumption).
+    const baseUrl = effective.baseUrl ?? effective.pathsDir ?? projectRoot;
+    const paths = effective.paths;
+    if (!paths || typeof paths !== 'object') {
+        // baseUrl alone isn't an "alias" per se; with no paths we'd just
+        // be redirecting the whole tree. Skip — the existing resolver
+        // already handles relative imports.
+        return null;
+    }
+    const patterns = [];
+    for (const [pattern, targets] of Object.entries(paths)) {
+        if (!Array.isArray(targets) || targets.length === 0)
+            continue;
+        const filtered = targets.filter((t) => typeof t === 'string');
+        if (filtered.length === 0)
+            continue;
+        const { prefix, suffix, hasWildcard } = splitWildcard(pattern);
+        patterns.push({ prefix, suffix, hasWildcard, replacements: filtered });
+    }
+    if (patterns.length === 0)
+        return null;
+    // Specificity sort: longer prefix first; literal patterns before
+    // wildcard patterns of the same prefix length. TypeScript itself
+    // uses a similar "most specific match wins" rule.
+    patterns.sort((a, b) => {
+        if (a.prefix.length !== b.prefix.length)
+            return b.prefix.length - a.prefix.length;
+        if (a.hasWildcard !== b.hasWildcard)
+            return a.hasWildcard ? 1 : -1;
+        return 0;
+    });
+    (0, errors_1.logDebug)('path-aliases loaded', {
+        file: usedFile,
+        baseUrl,
+        patternCount: patterns.length,
+    });
+    return { baseUrl, patterns };
+}
+/**
+ * Resolve an import path through an {@link AliasMap}. Returns the list
+ * of candidate filesystem paths (relative to `projectRoot`), in the
+ * priority order defined by tsconfig (multiple replacements per alias
+ * are tried in order). Returns `[]` when no alias matches.
+ *
+ * Callers still need to try each candidate with the language's
+ * extension list — this function only does the alias rewrite.
+ */
+function applyAliases(importPath, aliases, projectRoot) {
+    for (const pat of aliases.patterns) {
+        if (!importPath.startsWith(pat.prefix))
+            continue;
+        if (pat.suffix && !importPath.endsWith(pat.suffix))
+            continue;
+        let captured = '';
+        if (pat.hasWildcard) {
+            captured = importPath.slice(pat.prefix.length, importPath.length - pat.suffix.length);
+        }
+        else if (importPath !== pat.prefix) {
+            // Literal pattern must match exactly.
+            continue;
+        }
+        const out = [];
+        for (const target of pat.replacements) {
+            const filled = pat.hasWildcard ? target.replace('*', captured) : target;
+            // baseUrl is absolute; produce a path relative to projectRoot
+            const absolute = path.resolve(aliases.baseUrl, filled);
+            const relative = path.relative(projectRoot, absolute);
+            // Skip if the rewrite escapes the project root (unsafe + can't
+            // be looked up via the file index anyway).
+            if (relative.startsWith('..'))
+                continue;
+            out.push(relative.replace(/\\/g, '/'));
+        }
+        return out;
+    }
+    return [];
+}
+//# sourceMappingURL=path-aliases.js.map

package/dist/resolution/path-aliases.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"path-aliases.js","sourceRoot":"","sources":["../../src/resolution/path-aliases.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;GAyBG;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmOH,gDAqEC;AAWD,oCA+BC;AAhVD,uCAAyB;AACzB,2CAA6B;AAC7B,sCAAqC;AA6BrC;;;;;;;GAOG;AACH,SAAS,UAAU,CAAC,GAAW;IAC7B,IAAI,GAAG,GAAG,EAAE,CAAC;IACb,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,OAAO,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;QACtB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAE,CAAC;QACnB,IAAI,QAAQ,EAAE,CAAC;YACb,GAAG,IAAI,EAAE,CAAC;YACV,IAAI,EAAE,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,CAAC;gBACtC,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAE,CAAC;gBACnB,CAAC,IAAI,CAAC,CAAC;gBACP,SAAS;YACX,CAAC;YACD,IAAI,EAAE,KAAK,GAAG;gBAAE,QAAQ,GAAG,KAAK,CAAC;YACjC,CAAC,EAAE,CAAC;YACJ,SAAS;QACX,CAAC;QACD,IAAI,EAAE,KAAK,GAAG,EAAE,CAAC;YACf,QAAQ,GAAG,IAAI,CAAC;YAChB,GAAG,IAAI,EAAE,CAAC;YACV,CAAC,EAAE,CAAC;YACJ,SAAS;QACX,CAAC;QACD,IAAI,EAAE,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YACrC,OAAO,CAAC,GAAG,GAAG,CAAC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,IAAI;gBAAE,CAAC,EAAE,CAAC;YAC9C,SAAS;QACX,CAAC;QACD,IAAI,EAAE,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC;YACrC,CAAC,IAAI,CAAC,CAAC;YACP,OAAO,CAAC,GAAG,GAAG,CAAC,MAAM,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC;gBAAE,CAAC,EAAE,CAAC;YACtE,CAAC,IAAI,CAAC,CAAC;YACP,SAAS;QACX,CAAC;QACD,GAAG,IAAI,EAAE,CAAC;QACV,CAAC,EAAE,CAAC;IACN,CAAC;IACD,8DAA8D;IAC9D,sCAAsC;IACtC,OAAO,GAAG,CAAC,OAAO,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;AAC3C,CAAC;AAsBD,mEAAmE;AACnE,MAAM,iBAAiB,GAAG,EAAE,CAAC;AAE7B;;;;;;GAMG;AACH,SAAS,oBAAoB,CAAC,IAAY,EAAE,OAAe;IACzD,MAAM,MAAM,GAAG,CAAC,CAAS,EAAW,EAAE;QACpC,IAAI,CAAC;YACH,OAAO,EAAE,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,EAAE,CAAC;QACjC,CAAC;QAAC,MAAM,CAAC;YACP,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC,CAAC;IAEF,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7E,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;QACzC,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE,GAAG,IAAI,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC,EAAE,CAAC;YAC5E,IAAI,MAAM,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;QAChC,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,IAAI,GAAG,GAAG,OAAO,CAAC;IAClB,SAAS,CAAC;QACR,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,cAAc,EAAE,IAAI,CAAC,CAAC;QAClD,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,EAAE,GAAG,IAAI,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,eAAe,CAAC,CAAC,EAAE,CAAC;YAC5E,IAAI,MAAM,CAAC,IAAI,CAAC;gBAAE,OAAO,IAAI,CAAC;QAChC,CAAC;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACjC,IAAI,MAAM,KAAK,GAAG;YAAE,OAAO,IAAI,CAAC;QAChC,GAAG,GAAG,MAAM,CAAC;IACf,CAAC;AACH,CAAC;AAED;;;;;;;GAOG;AACH,SAAS,oBAAoB,CAC3B,QAAgB,EAChB,KAAkB,EAClB,KAAa;IAEb,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACnC,IAAI,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,KAAK,GAAG,iBAAiB,EAAE,CAAC;QAChD,IAAA,iBAAQ,EAAC,+CAA+C,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC;QACpF,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,GAAG,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;IAClC,IAAI,CAAC,GAAG;QAAE,OAAO,IAAI,CAAC;IAEtB,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACf,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC9B,MAAM,SAAS,GAAqB,EAAE,CAAC;IAEvC,MAAM,OAAO,GAAG,OAAO,GAAG,CAAC,OAAO,KAAK,QAAQ,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;IACtF,KAAK,MAAM,IAAI,IAAI,OAAO,EAAE,CAAC;QAC3B,IAAI,OAAO,IAAI,KAAK,QAAQ;YAAE,SAAS;QACvC,MAAM,MAAM,GAAG,oBAAoB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC/C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,IAAA,iBAAQ,EAAC,kCAAkC,EAAE,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC;YAClE,SAAS;QACX,CAAC;QACD,MAAM,SAAS,GAAG,oBAAoB,CAAC,MAAM,EAAE,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACjE,IAAI,CAAC,SAAS;YAAE,SAAS;QACzB,IAAI,SAAS,CAAC,OAAO,KAAK,SAAS;YAAE,SAAS,CAAC,OAAO,GAAG,SAAS,CAAC,OAAO,CAAC;QAC3E,IAAI,SAAS,CAAC,KAAK,KAAK,SAAS,EAAE,CAAC;YAClC,SAAS,CAAC,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC;YAClC,SAAS,CAAC,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC;QAC1C,CAAC;IACH,CAAC;IACD,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAElB,MAAM,EAAE,GAAG,GAAG,CAAC,eAAe,IAAI,EAAE,CAAC;IACrC,qEAAqE;IACrE,4BAA4B;IAC5B,IAAI,OAAO,EAAE,CAAC,OAAO,KAAK,QAAQ;QAAE,SAAS,CAAC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,GAAG,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC;IACtF,IAAI,EAAE,CAAC,KAAK,IAAI,OAAO,EAAE,CAAC,KAAK,KAAK,QAAQ,EAAE,CAAC;QAC7C,SAAS,CAAC,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC;QAC3B,SAAS,CAAC,QAAQ,GAAG,GAAG,CAAC;IAC3B,CAAC;IACD,OAAO,SAAS,CAAC;AACnB,CAAC;AAED,SAAS,gBAAgB,CAAC,QAAgB;IACxC,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,EAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,GAAG,CAAC,CAAgB,CAAC;QAC1D,OAAO,MAAM,IAAI,OAAO,MAAM,KAAK,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC;IAC9D,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAA,iBAAQ,EAAC,+BAA+B,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC1E,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED,SAAS,aAAa,CAAC,OAAe;IAKpC,MAAM,IAAI,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAClC,IAAI,IAAI,KAAK,CAAC,CAAC;QAAE,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,MAAM,EAAE,EAAE,EAAE,WAAW,EAAE,KAAK,EAAE,CAAC;IAC5E,OAAO;QACL,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC;QAC9B,MAAM,EAAE,OAAO,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,CAAC;QAC/B,WAAW,EAAE,IAAI;KAClB,CAAC;AACJ,CAAC;AAED;;;;;;GAMG;AACH,SAAgB,kBAAkB,CAAC,WAAmB;IACpD,0EAA0E;IAC1E,wEAAwE;IACxE,kEAAkE;IAClE,0EAA0E;IAC1E,kCAAkC;IAClC,MAAM,UAAU,GAAG,CAAC,eAAe,EAAE,eAAe,EAAE,oBAAoB,CAAC,CAAC;IAC5E,IAAI,SAAS,GAA4B,IAAI,CAAC;IAC9C,IAAI,QAAQ,GAAkB,IAAI,CAAC;IACnC,KAAK,MAAM,IAAI,IAAI,UAAU,EAAE,CAAC;QAC9B,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;QACvC,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,CAAC,CAAC;YAAE,SAAS;QAChC,MAAM,IAAI,GAAG,oBAAoB,CAAC,CAAC,EAAE,IAAI,GAAG,EAAE,EAAE,CAAC,CAAC,CAAC;QACnD,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,qEAAqE;QACrE,kEAAkE;QAClE,wDAAwD;QACxD,IAAI,CAAC,SAAS,EAAE,CAAC;YACf,SAAS,GAAG,IAAI,CAAC;YACjB,QAAQ,GAAG,IAAI,CAAC;QAClB,CAAC;QACD,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YACf,SAAS,GAAG,IAAI,CAAC;YACjB,QAAQ,GAAG,IAAI,CAAC;YAChB,MAAM;QACR,CAAC;IACH,CAAC;IACD,IAAI,CAAC,SAAS;QAAE,OAAO,IAAI,CAAC;IAE5B,4EAA4E;IAC5E,yEAAyE;IACzE,2CAA2C;IAC3C,MAAM,OAAO,GAAG,SAAS,CAAC,OAAO,IAAI,SAAS,CAAC,QAAQ,IAAI,WAAW,CAAC;IAEvE,MAAM,KAAK,GAAG,SAAS,CAAC,KAAK,CAAC;IAC9B,IAAI,CAAC,KAAK,IAAI,OAAO,KAAK,KAAK,QAAQ,EAAE,CAAC;QACxC,iEAAiE;QACjE,8DAA8D;QAC9D,oCAAoC;QACpC,OAAO,IAAI,CAAC;IACd,CAAC;IAED,MAAM,QAAQ,GAAmB,EAAE,CAAC;IACpC,KAAK,MAAM,CAAC,OAAO,EAAE,OAAO,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;QACvD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAC9D,MAAM,QAAQ,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAC;QAC3E,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QACpC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,GAAG,aAAa,CAAC,OAAO,CAAC,CAAC;QAC/D,QAAQ,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,YAAY,EAAE,QAAQ,EAAE,CAAC,CAAC;IACzE,CAAC;IAED,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEvC,iEAAiE;IACjE,iEAAiE;IACjE,kDAAkD;IAClD,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACrB,IAAI,CAAC,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,CAAC,MAAM;YAAE,OAAO,CAAC,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QAClF,IAAI,CAAC,CAAC,WAAW,KAAK,CAAC,CAAC,WAAW;YAAE,OAAO,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACnE,OAAO,CAAC,CAAC;IACX,CAAC,CAAC,CAAC;IAEH,IAAA,iBAAQ,EAAC,qBAAqB,EAAE;QAC9B,IAAI,EAAE,QAAQ;QACd,OAAO;QACP,YAAY,EAAE,QAAQ,CAAC,MAAM;KAC9B,CAAC,CAAC;IAEH,OAAO,EAAE,OAAO,EAAE,QAAQ,EAAE,CAAC;AAC/B,CAAC;AAED;;;;;;;;GAQG;AACH,SAAgB,YAAY,CAC1B,UAAkB,EAClB,OAAiB,EACjB,WAAmB;IAEnB,KAAK,MAAM,GAAG,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;QACnC,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,SAAS;QACjD,IAAI,GAAG,CAAC,MAAM,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC;YAAE,SAAS;QAE7D,IAAI,QAAQ,GAAG,EAAE,CAAC;QAClB,IAAI,GAAG,CAAC,WAAW,EAAE,CAAC;YACpB,QAAQ,GAAG,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACxF,CAAC;aAAM,IAAI,UAAU,KAAK,GAAG,CAAC,MAAM,EAAE,CAAC;YACrC,sCAAsC;YACtC,SAAS;QACX,CAAC;QAED,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,KAAK,MAAM,MAAM,IAAI,GAAG,CAAC,YAAY,EAAE,CAAC;YACtC,MAAM,MAAM,GAAG,GAAG,CAAC,WAAW,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACxE,8DAA8D;YAC9D,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;YACvD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;YACtD,+DAA+D;YAC/D,2CAA2C;YAC3C,IAAI,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAC;gBAAE,SAAS;YACxC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;QACzC,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC;IACD,OAAO,EAAE,CAAC;AACZ,CAAC"}

package/dist/resolution/react-router-synthesizer.d.ts

@@ -0,0 +1,33 @@
+/**
+ * React Router — navigation written as markup.
+ *
+ *   <Link to="/placeorder">Continue</Link>
+ *   <NavLink to="/profile">Profile</NavLink>
+ *   <Navigate to="/login" replace />
+ *   <LinkContainer to="/payment">…</LinkContainer>   // react-router-bootstrap
+ *   <Link to={{ pathname: '/shipping' }}>…</Link>    // v5's object form
+ *
+ * A JSX attribute is not a call, so the extractor records no reference for it
+ * and the resolver in `frameworks/react-router.ts` — which binds
+ * `history.push` and `navigate` — never sees it. This pass reads every `to`
+ * attribute out of the source, attributes it to the component (the innermost
+ * function) it is written in, matches it against the React Router route
+ * table, and synthesizes one `navigates` edge from the component to the
+ * route. That is the edge the Screens view walks back from, so a screen's
+ * links are its transitions exactly as its pushes are.
+ *
+ * Edges are `provenance:'heuristic'`, `synthesizedBy:'react-router-link'`,
+ * with the path as written and `registeredAt` = the JSX site. A computed
+ * target (`to={next}`) is nothing; a path no route serves is nothing; a
+ * relative `to` is nothing, because it is resolved against a nesting this
+ * scan does not read. Nothing here runs on a project with no React Router
+ * routes.
+ *
+ * This is `next-router-synthesizer.ts`'s twin — the same shape over the other
+ * attribute (`to`, not `href`) and the other table.
+ */
+import type { Edge } from '../types';
+import type { ResolutionContext } from './types';
+import type { MaybeYield } from './cooperative-yield';
+export declare function reactRouterLinkEdges(ctx: ResolutionContext, onYield: MaybeYield): Promise<Edge[]>;
+//# sourceMappingURL=react-router-synthesizer.d.ts.map

package/dist/resolution/react-router-synthesizer.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"react-router-synthesizer.d.ts","sourceRoot":"","sources":["../../src/resolution/react-router-synthesizer.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,UAAU,CAAC;AACrC,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,SAAS,CAAC;AACjD,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAoBtD,wBAAsB,oBAAoB,CAAC,GAAG,EAAE,iBAAiB,EAAE,OAAO,EAAE,UAAU,GAAG,OAAO,CAAC,IAAI,EAAE,CAAC,CAoEvG"}

package/dist/resolution/react-router-synthesizer.js

@@ -0,0 +1,126 @@
+"use strict";
+/**
+ * React Router — navigation written as markup.
+ *
+ *   <Link to="/placeorder">Continue</Link>
+ *   <NavLink to="/profile">Profile</NavLink>
+ *   <Navigate to="/login" replace />
+ *   <LinkContainer to="/payment">…</LinkContainer>   // react-router-bootstrap
+ *   <Link to={{ pathname: '/shipping' }}>…</Link>    // v5's object form
+ *
+ * A JSX attribute is not a call, so the extractor records no reference for it
+ * and the resolver in `frameworks/react-router.ts` — which binds
+ * `history.push` and `navigate` — never sees it. This pass reads every `to`
+ * attribute out of the source, attributes it to the component (the innermost
+ * function) it is written in, matches it against the React Router route
+ * table, and synthesizes one `navigates` edge from the component to the
+ * route. That is the edge the Screens view walks back from, so a screen's
+ * links are its transitions exactly as its pushes are.
+ *
+ * Edges are `provenance:'heuristic'`, `synthesizedBy:'react-router-link'`,
+ * with the path as written and `registeredAt` = the JSX site. A computed
+ * target (`to={next}`) is nothing; a path no route serves is nothing; a
+ * relative `to` is nothing, because it is resolved against a nesting this
+ * scan does not read. Nothing here runs on a project with no React Router
+ * routes.
+ *
+ * This is `next-router-synthesizer.ts`'s twin — the same shape over the other
+ * attribute (`to`, not `href`) and the other table.
+ */
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.reactRouterLinkEdges = reactRouterLinkEdges;
+const strip_comments_1 = require("./strip-comments");
+const query_utils_1 = require("../search/query-utils");
+const expo_router_1 = require("./frameworks/expo-router");
+const object_literal_1 = require("./frameworks/object-literal");
+const nextjs_1 = require("./frameworks/nextjs");
+const react_router_1 = require("./frameworks/react-router");
+const synth_utils_1 = require("./synth-utils");
+const JSX_FILE = /\.(?:[cm]?[jt]sx?|mdx)$/;
+/** The tags that carry a route as a `to` attribute, the attribute anywhere in the tag. */
+const LINK_TAG = /<(Link|NavLink|Navigate|LinkContainer|IndexLinkContainer)\b([^>]*?)\bto\s*=\s*(?:"([^"]*)"|'([^']*)'|(?=\{))/g;
+/** A tag this pass could possibly match — the cheap prefilter before stripping comments. */
+const HAS_LINK_TAG = /<(?:Link|NavLink|Navigate|LinkContainer|IndexLinkContainer)\b/;
+/** Links a single component may carry before it is a navigation menu, not a decision. */
+const MAX_LINKS_PER_COMPONENT = 24;
+async function reactRouterLinkEdges(ctx, onYield) {
+    const table = (0, react_router_1.reactRouterTable)(ctx);
+    if (table.byRoot.size === 0)
+        return [];
+    const edges = [];
+    const seen = new Set();
+    const perComponent = new Map();
+    let scanned = 0;
+    for (const file of ctx.getAllFiles()) {
+        if (!JSX_FILE.test(file) || (0, query_utils_1.isTestPath)(file))
+            continue;
+        const routes = (0, expo_router_1.routesForFile)(table, file);
+        if (!routes || routes.exact.size === 0)
+            continue;
+        if ((++scanned & 63) === 0)
+            await onYield();
+        const source = ctx.readFile(file);
+        if (!source || !HAS_LINK_TAG.test(source))
+            continue;
+        const safe = (0, strip_comments_1.stripCommentsForRegex)(source, 'typescript');
+        const nodes = ctx.getNodesInFile(file);
+        const lineOf = (0, synth_utils_1.makeLineAt)(safe, 1);
+        LINK_TAG.lastIndex = 0;
+        let m;
+        while ((m = LINK_TAG.exec(safe)) !== null) {
+            const tag = m[1];
+            const quoted = m[3] ?? m[4] ?? null;
+            let href;
+            if (quoted !== null)
+                href = (0, expo_router_1.toHref)(quoted);
+            else {
+                // `to={…}` holds an EXPRESSION, and it is read with the same reader
+                // the `history.push(…)` path uses — a string, a template, a
+                // `{ pathname }` object, or a conditional whose arms agree
+                // (`to={redirect ? `/register?redirect=${redirect}` : '/register'}`,
+                // which is how react-router apps write a link that carries state).
+                // Peeking at the first character instead missed every one of those.
+                const at = m.index + m[0].length;
+                const close = (0, object_literal_1.matchBracket)(safe, at);
+                if (close < 0)
+                    continue;
+                href = (0, expo_router_1.parseHrefExpression)(safe.slice(at + 1, close));
+            }
+            // A relative `to` is resolved against the route this markup renders
+            // under — a nesting this scan does not read, so it is not a destination.
+            if (!href || !href.path.startsWith('/'))
+                continue;
+            const line = lineOf(m.index);
+            const component = (0, synth_utils_1.enclosingFn)(nodes, line);
+            if (!component)
+                continue;
+            // A destination written as a choice names one route per arm, and the
+            // user reaches every one of them — each is drawn.
+            for (const { node: route, href: arm } of (0, nextjs_1.destinationsForHref)(href, routes)) {
+                const key = `${component.id}>${route.id}`;
+                if (seen.has(key))
+                    continue;
+                const count = (perComponent.get(component.id) ?? 0) + 1;
+                perComponent.set(component.id, count);
+                if (count > MAX_LINKS_PER_COMPONENT)
+                    continue;
+                seen.add(key);
+                edges.push({
+                    source: component.id,
+                    target: route.id,
+                    kind: 'navigates',
+                    line,
+                    provenance: 'heuristic',
+                    metadata: {
+                        synthesizedBy: 'react-router-link',
+                        href: arm.display,
+                        navMethod: tag === 'Navigate' ? 'navigate' : 'link',
+                        registeredAt: `${file}:${line}`,
+                    },
+                });
+            }
+        }
+    }
+    return edges;
+}
+//# sourceMappingURL=react-router-synthesizer.js.map

package/dist/resolution/react-router-synthesizer.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"react-router-synthesizer.js","sourceRoot":"","sources":["../../src/resolution/react-router-synthesizer.ts"],"names":[],"mappings":";AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;;AAwBH,oDAoEC;AAvFD,qDAAyD;AACzD,uDAAmD;AACnD,0DAAwG;AACxG,gEAA2D;AAC3D,gDAA0D;AAC1D,4DAA6D;AAC7D,+CAAwD;AAExD,MAAM,QAAQ,GAAG,yBAAyB,CAAC;AAE3C,0FAA0F;AAC1F,MAAM,QAAQ,GAAG,+GAA+G,CAAC;AAEjI,4FAA4F;AAC5F,MAAM,YAAY,GAAG,+DAA+D,CAAC;AAErF,yFAAyF;AACzF,MAAM,uBAAuB,GAAG,EAAE,CAAC;AAE5B,KAAK,UAAU,oBAAoB,CAAC,GAAsB,EAAE,OAAmB;IACpF,MAAM,KAAK,GAAG,IAAA,+BAAgB,EAAC,GAAG,CAAC,CAAC;IACpC,IAAI,KAAK,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IACvC,MAAM,KAAK,GAAW,EAAE,CAAC;IACzB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,WAAW,EAAE,EAAE,CAAC;QACrC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAA,wBAAU,EAAC,IAAI,CAAC;YAAE,SAAS;QACvD,MAAM,MAAM,GAAG,IAAA,2BAAa,EAAC,KAAK,EAAE,IAAI,CAAC,CAAC;QAC1C,IAAI,CAAC,MAAM,IAAI,MAAM,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;YAAE,SAAS;QACjD,IAAI,CAAC,EAAE,OAAO,GAAG,EAAE,CAAC,KAAK,CAAC;YAAE,MAAM,OAAO,EAAE,CAAC;QAC5C,MAAM,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAClC,IAAI,CAAC,MAAM,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC;YAAE,SAAS;QACpD,MAAM,IAAI,GAAG,IAAA,sCAAqB,EAAC,MAAM,EAAE,YAAY,CAAC,CAAC;QACzD,MAAM,KAAK,GAAG,GAAG,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,MAAM,GAAG,IAAA,wBAAU,EAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACnC,QAAQ,CAAC,SAAS,GAAG,CAAC,CAAC;QACvB,IAAI,CAAyB,CAAC;QAC9B,OAAO,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,IAAI,EAAE,CAAC;YAC1C,MAAM,GAAG,GAAG,CAAC,CAAC,CAAC,CAAE,CAAC;YAClB,MAAM,MAAM,GAAkB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;YACnD,IAAI,IAAwB,CAAC;YAC7B,IAAI,MAAM,KAAK,IAAI;gBAAE,IAAI,GAAG,IAAA,oBAAM,EAAC,MAAM,CAAC,CAAC;iBACtC,CAAC;gBACJ,oEAAoE;gBACpE,4DAA4D;gBAC5D,2DAA2D;gBAC3D,qEAAqE;gBACrE,mEAAmE;gBACnE,oEAAoE;gBACpE,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;gBACjC,MAAM,KAAK,GAAG,IAAA,6BAAY,EAAC,IAAI,EAAE,EAAE,CAAC,CAAC;gBACrC,IAAI,KAAK,GAAG,CAAC;oBAAE,SAAS;gBACxB,IAAI,GAAG,IAAA,iCAAmB,EAAC,IAAI,CAAC,KAAK,CAAC,EAAE,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC;YACxD,CAAC;YACD,oEAAoE;YACpE,yEAAyE;YACzE,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;gBAAE,SAAS;YAClD,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;YAC7B,MAAM,SAAS,GAAG,IAAA,yBAAW,EAAC,KAAK,EAAE,IAAI,CAAC,CAAC;YAC3C,IAAI,CAAC,SAAS;gBAAE,SAAS;YACzB,qEAAqE;YACrE,kDAAkD;YAClD,KAAK,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,IAAA,4BAAmB,EAAC,IAAI,EAAE,MAAM,CAAC,EAAE,CAAC;gBAC3E,MAAM,GAAG,GAAG,GAAG,SAAS,CAAC,EAAE,IAAI,KAAK,CAAC,EAAE,EAAE,CAAC;gBAC1C,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC;oBAAE,SAAS;gBAC5B,MAAM,KAAK,GAAG,CAAC,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;gBACxD,YAAY,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;gBACtC,IAAI,KAAK,GAAG,uBAAuB;oBAAE,SAAS;gBAC9C,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACd,KAAK,CAAC,IAAI,CAAC;oBACT,MAAM,EAAE,SAAS,CAAC,EAAE;oBACpB,MAAM,EAAE,KAAK,CAAC,EAAE;oBAChB,IAAI,EAAE,WAAW;oBACjB,IAAI;oBACJ,UAAU,EAAE,WAAW;oBACvB,QAAQ,EAAE;wBACR,aAAa,EAAE,mBAAmB;wBAClC,IAAI,EAAE,GAAG,CAAC,OAAO;wBACjB,SAAS,EAAE,GAAG,KAAK,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,MAAM;wBACnD,YAAY,EAAE,GAAG,IAAI,IAAI,IAAI,EAAE;qBAChC;iBACF,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/resolution/resolver-pool.d.ts

@@ -0,0 +1,106 @@
+/**
+ * ResolverPool — main-thread client for the parallel-resolution workers.
+ *
+ * resolveBatch() splits a rowid-ordered batch into ordered chunks, fans the
+ * chunks across the pool, and reassembles the results IN CHUNK ORDER, so the
+ * caller's admission (edge inserts, row cleanup, failure parking, deferred
+ * post-pass queues) is byte-for-byte the sequence the single-threaded loop
+ * would have produced. Any worker failure fails the batch — the caller falls
+ * back to the sequential path. Kill switch: CODEGRAPH_NO_PARALLEL_RESOLVE=1.
+ */
+import type { Edge, UnresolvedReference } from '../types';
+import type { ResolvedRef, UnresolvedRef } from './types';
+/** One synthesis pass's output: its edge list + worker-measured wall clock. */
+export interface SynthPassResult {
+    edges: Edge[];
+    ms: number;
+}
+export interface ChunkResult {
+    resolved: ResolvedRef[];
+    unresolved: UnresolvedRef[];
+    deferredChain: UnresolvedRef[];
+    deferredThisMember: UnresolvedRef[];
+    byMethod: Record<string, number>;
+}
+/**
+ * Minimum TOTAL pending refs before the pool is created at all. Pool boot
+ * (module load + readonly DB open + framework detect + cache warm, times N
+ * workers) costs real CPU that CONTENDS with sequential resolution on the
+ * same cores — measured on a medium repo (~40k refs, ~1.2s of resolution)
+ * the pool made indexing slower. It pays off when resolution runs for tens
+ * of seconds to minutes (large JVM/Spring-class repos). Override:
+ * CODEGRAPH_PARALLEL_RESOLVE_MIN=<refs> (0 forces the pool on).
+ */
+export declare function minRefsForPool(): number;
+export declare class ResolverPool {
+    private workers;
+    private nextId;
+    private waiters;
+    private synthWaiters;
+    private recycleWaiters;
+    private failed;
+    /**
+     * Pool size from CPU headroom, memory headroom, and the explicit override.
+     * Pure — every input injected — so the whole matrix is unit-testable.
+     *
+     * CPU term: `availableParallelism` (cpuset/affinity-honest — `os.cpus()`
+     * enumerates the host's CPUs and sized SIX workers inside a 2-CPU cpuset,
+     * §7a.1's false-premise finding), minus one for the persisting main thread,
+     * floored at 2 so a true 2-core box keeps the pool's ~2× on synthesis,
+     * capped at the long-standing 6.
+     *
+     * Memory term: workers hold real heap at scale (~1GB each against a 4.6GB
+     * kernel-scale DB — six of them OOM-killed a 7GB container once real
+     * 8-core concurrency let them peak simultaneously). Estimate per-worker
+     * cost from the DB size, keep 30% of the budget for the main thread, and
+     * let the smaller term win. Below 2 workers the pool isn't worth its boot
+     * cost — callers get null and stay sequential.
+     */
+    static resolvePoolSize(opts: {
+        explicit?: string;
+        availableParallelism: number;
+        memoryBudget: number;
+        dbSizeBytes: number;
+    }): number | null;
+    /**
+     * Create a pool when the compiled worker exists (absent when running from
+     * source in tests → callers use the sequential path), the kill switch is
+     * off, and the machine has the cores AND memory to carry it. Returns null
+     * otherwise. `CODEGRAPH_RESOLVE_WORKERS` overrides the computed size
+     * (0 disables the pool; values are capped at 16).
+     */
+    static tryCreate(dbPath: string, projectRoot: string): ResolverPool | null;
+    private constructor();
+    private fail;
+    /** Whether this batch is worth fanning out. */
+    static worthParallel(batchLength: number): boolean;
+    ready(): Promise<void>;
+    /**
+     * Resolve `refs` across the pool. Chunks preserve input order; the returned
+     * arrays are the in-order concatenation of the chunk results.
+     */
+    resolveBatch(refs: UnresolvedReference[]): Promise<ChunkResult>;
+    /**
+     * Run one synthesis pass (by SYNTH_PASSES name) on the least-busy worker.
+     * The worker reads the committed graph on its own connection and returns
+     * the pass's edge list; the caller merges in canonical order. Rejects on
+     * worker failure — the caller retries the pass on the main thread.
+     */
+    runSynthPass(passName: string): Promise<SynthPassResult>;
+    /**
+     * Ask every worker to close and reopen its read-only connection, and wait
+     * for all acks. MUST be called only at the pool-idle boundary (all fanned
+     * chunks settled, next batch not yet dispatched) — the workers close their
+     * connections in place. Why: a long-lived reader pins WAL checkpoint
+     * progress, and the deep WAL behind it taxes every main-thread B-tree
+     * page operation (writes-under-readers, plan §7a.6 — deletes 42.6→118.8s
+     * from 0 to 4 attached readers). Releasing the read marks periodically
+     * lets the existing checkpoints advance, keeping the WAL shallow WITHOUT
+     * the full-park folds an aggressive valve pays (+129s measured at 64MB).
+     * A recycle failure fails the pool — the caller's sequential fallback
+     * covers the rest of the run.
+     */
+    recycleWorkers(): Promise<void>;
+    destroy(): Promise<void>;
+}
+//# sourceMappingURL=resolver-pool.d.ts.map

package/dist/resolution/resolver-pool.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolver-pool.d.ts","sourceRoot":"","sources":["../../src/resolution/resolver-pool.ts"],"names":[],"mappings":"AAAA;;;;;;;;;GASG;AAMH,OAAO,KAAK,EAAE,IAAI,EAAE,mBAAmB,EAAE,MAAM,UAAU,CAAC;AAC1D,OAAO,KAAK,EAAE,WAAW,EAAE,aAAa,EAAE,MAAM,SAAS,CAAC;AAG1D,+EAA+E;AAC/E,MAAM,WAAW,eAAe;IAC9B,KAAK,EAAE,IAAI,EAAE,CAAC;IACd,EAAE,EAAE,MAAM,CAAC;CACZ;AAED,MAAM,WAAW,WAAW;IAC1B,QAAQ,EAAE,WAAW,EAAE,CAAC;IACxB,UAAU,EAAE,aAAa,EAAE,CAAC;IAC5B,aAAa,EAAE,aAAa,EAAE,CAAC;IAC/B,kBAAkB,EAAE,aAAa,EAAE,CAAC;IACpC,QAAQ,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CAClC;AAWD;;;;;;;;GAQG;AACH,wBAAgB,cAAc,IAAI,MAAM,CAOvC;AAED,qBAAa,YAAY;IACvB,OAAO,CAAC,OAAO,CAAoB;IACnC,OAAO,CAAC,MAAM,CAAK;IACnB,OAAO,CAAC,OAAO,CAAwF;IACvG,OAAO,CAAC,YAAY,CAA4F;IAChH,OAAO,CAAC,cAAc,CAAiC;IACvD,OAAO,CAAC,MAAM,CAAsB;IAEpC;;;;;;;;;;;;;;;;OAgBG;IACH,MAAM,CAAC,eAAe,CAAC,IAAI,EAAE;QAC3B,QAAQ,CAAC,EAAE,MAAM,CAAC;QAClB,oBAAoB,EAAE,MAAM,CAAC;QAC7B,YAAY,EAAE,MAAM,CAAC;QACrB,WAAW,EAAE,MAAM,CAAC;KACrB,GAAG,MAAM,GAAG,IAAI;IAoBjB;;;;;;OAMG;IACH,MAAM,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,EAAE,WAAW,EAAE,MAAM,GAAG,YAAY,GAAG,IAAI;IA+B1E,OAAO;IAgEP,OAAO,CAAC,IAAI;IAYZ,+CAA+C;IAC/C,MAAM,CAAC,aAAa,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO;IAI5C,KAAK,IAAI,OAAO,CAAC,IAAI,CAAC;IAI5B;;;OAGG;IACG,YAAY,CAAC,IAAI,EAAE,mBAAmB,EAAE,GAAG,OAAO,CAAC,WAAW,CAAC;IA8BrE;;;;;OAKG;IACG,YAAY,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,eAAe,CAAC;IAW9D;;;;;;;;;;;;OAYG;IACG,cAAc,IAAI,OAAO,CAAC,IAAI,CAAC;IAwB/B,OAAO,IAAI,OAAO,CAAC,IAAI,CAAC;CAiB/B"}