zod-compiler 1.23.0 → 1.23.2

package/dist/unplugin/dep-graph.js

@@ -1,289 +1,253 @@
-/**
- * Static per-file dependency graphs for disk-cache invalidation.
- *
- * The disk cache used to record `getFirstPartyModulePaths()` — the superset
- * of EVERY first-party module the loader had executed so far — as each
- * entry's dependency set. Supersets never serve stale results, but in a
- * large codebase every entry ends up recording the whole project (~1,900
- * deps, ~400KB JSON per entry in the field report), so ANY commit
- * invalidates essentially the entire cache and CI re-pays full discovery
- * every run.
- *
- * This module computes the file's ACTUAL import graph statically: scan
- * import/export/require specifiers, resolve them (relative paths with
- * extension probing, tsconfig path aliases via the loader's config, bare
- * specifiers through node resolution), and BFS across first-party files.
- * No file is executed. Type-only imports are included (over-approximation
- * only over-invalidates).
- *
- * Soundness rule: when anything cannot be analyzed — a non-literal dynamic
- * import, an unresolvable relative specifier — the crawl reports
- * `complete: false` and the caller falls back to the superset. A static
- * crawl may only replace the superset when it provably covers everything
- * the file can load.
- *
- * Cost discipline (this runs serialized on the bundler's main process, once
- * per discovery file, over closures that reach thousands of files):
- * - every existence probe uses `statSync(p, { throwIfNoEntry: false })` —
- *   a thrown ENOENT pays V8 error-plus-stack construction, and a cold crawl
- *   issues these probes by the million (the dominant cost in field samples);
- * - resolution is memoized at every level: realpath per path, createRequire
- *   per directory, resolved specifier per (directory, specifier), and the
- *   full edge list per file (mtime-validated) — repeat crawls over the
- *   shared core graph are Map lookups plus one cheap stat per file;
- * - the BFS aborts the moment the graph becomes unanalyzable: the caller
- *   discards an incomplete result for the superset anyway, so finishing the
- *   crawl would be pure waste (and incomplete is the COMMON outcome on
- *   large graphs — one dynamic import anywhere poisons the whole closure).
- */
-import * as fs from "node:fs";
-import { createRequire } from "node:module";
-import * as path from "node:path";
 import { resolveTsconfigPathCandidates } from "../loader.js";
-const SOURCE_EXTENSIONS = [".ts", ".tsx", ".mts", ".cts", ".js", ".jsx", ".mjs", ".cjs"];
-const NODE_MODULES_SEGMENT = `${path.sep}node_modules${path.sep}`;
+import { createRequire } from "node:module";
+import * as path$1 from "node:path";
+import * as fs$1 from "node:fs";
+//#region src/unplugin/dep-graph.ts
+/**
+* Static per-file dependency graphs for disk-cache invalidation.
+*
+* The disk cache used to record `getFirstPartyModulePaths()` — the superset
+* of EVERY first-party module the loader had executed so far — as each
+* entry's dependency set. Supersets never serve stale results, but in a
+* large codebase every entry ends up recording the whole project (~1,900
+* deps, ~400KB JSON per entry in the field report), so ANY commit
+* invalidates essentially the entire cache and CI re-pays full discovery
+* every run.
+*
+* This module computes the file's ACTUAL import graph statically: scan
+* import/export/require specifiers, resolve them (relative paths with
+* extension probing, tsconfig path aliases via the loader's config, bare
+* specifiers through node resolution), and BFS across first-party files.
+* No file is executed. Type-only imports are included (over-approximation
+* only over-invalidates).
+*
+* Soundness rule: when anything cannot be analyzed — a non-literal dynamic
+* import, an unresolvable relative specifier — the crawl reports
+* `complete: false` and the caller falls back to the superset. A static
+* crawl may only replace the superset when it provably covers everything
+* the file can load.
+*
+* Cost discipline (this runs serialized on the bundler's main process, once
+* per discovery file, over closures that reach thousands of files):
+* - every existence probe uses `statSync(p, { throwIfNoEntry: false })` —
+*   a thrown ENOENT pays V8 error-plus-stack construction, and a cold crawl
+*   issues these probes by the million (the dominant cost in field samples);
+* - resolution is memoized at every level: realpath per path, createRequire
+*   per directory, resolved specifier per (directory, specifier), and the
+*   full edge list per file (mtime-validated) — repeat crawls over the
+*   shared core graph are Map lookups plus one cheap stat per file;
+* - the BFS aborts the moment the graph becomes unanalyzable: the caller
+*   discards an incomplete result for the superset anyway, so finishing the
+*   crawl would be pure waste (and incomplete is the COMMON outcome on
+*   large graphs — one dynamic import anywhere poisons the whole closure).
+*/
+const SOURCE_EXTENSIONS = [
+	".ts",
+	".tsx",
+	".mts",
+	".cts",
+	".js",
+	".jsx",
+	".mjs",
+	".cjs"
+];
+const NODE_MODULES_SEGMENT = `${path$1.sep}node_modules${path$1.sep}`;
 /** Specifier schemes that never resolve to project files. */
-// oxlint-disable-next-line no-control-regex -- rollup-convention virtual module ids begin with NUL
 const SKIP_SPECIFIER = /^(?:node:|data:|virtual:|\u0000)/;
 /** Runaway guard — graphs larger than this fall back to the superset. */
-const MAX_FILES = 10_000;
-const INCOMPLETE = { deps: [], complete: false };
+const MAX_FILES = 1e4;
+const INCOMPLETE = {
+	deps: [],
+	complete: false
+};
 /**
- * Resolution-failure sentinel. A unique symbol rather than a string literal:
- * `"incomplete" | string` collapses to `string`, so the type system could
- * not distinguish a resolved path from the failure marker.
- */
+* Resolution-failure sentinel. A unique symbol rather than a string literal:
+* `"incomplete" | string` collapses to `string`, so the type system could
+* not distinguish a resolved path from the failure marker.
+*/
 const UNRESOLVED = Symbol("unresolved");
 /**
- * Per-process memos. The file node memo is revalidated by mtime on every
- * visit; the resolution memos (specifier, realpath, require) depend on the
- * filesystem layout rather than file contents and are only dropped by
- * resetDepGraphMemo() — the same wholesale invalidation watch mode already
- * applies to the module cache (a memoized resolution can only go stale when
- * files appear/move, which fires watchChange).
- */
-const nodeMemo = new Map();
-const resolveMemo = new Map();
-const realpathMemo = new Map();
-const requireMemo = new Map();
+* Per-process memos. The file node memo is revalidated by mtime on every
+* visit; the resolution memos (specifier, realpath, require) depend on the
+* filesystem layout rather than file contents and are only dropped by
+* resetDepGraphMemo() — the same wholesale invalidation watch mode already
+* applies to the module cache (a memoized resolution can only go stale when
+* files appear/move, which fires watchChange).
+*/
+const nodeMemo = /* @__PURE__ */ new Map();
+const resolveMemo = /* @__PURE__ */ new Map();
+const realpathMemo = /* @__PURE__ */ new Map();
+const requireMemo = /* @__PURE__ */ new Map();
 /** Reset the per-process dep-graph memos (watch-mode file changes). */
-export function resetDepGraphMemo() {
-    nodeMemo.clear();
-    resolveMemo.clear();
-    realpathMemo.clear();
-    requireMemo.clear();
+function resetDepGraphMemo() {
+	nodeMemo.clear();
+	resolveMemo.clear();
+	realpathMemo.clear();
+	requireMemo.clear();
 }
 const STATIC_SPECIFIER = /(?:\bfrom\s*|\bimport\s+|\bimport\s*\(\s*|\brequire\s*\(\s*)["']([^"'\n]+)["']/g;
-// No /g flag: `.test()` on a global regex resumes from lastIndex of the
-// PREVIOUS file's match, silently missing dynamic imports (a missed
-// detection records a falsely-complete dep set — stale cache).
 const DYNAMIC_CALL = /\b(?:import|require)\s*\(\s*(?!["'])[^)\s]/;
 /** statSync that reports ENOENT as undefined instead of an exception. */
 function tryStat(p) {
-    try {
-        return fs.statSync(p, { throwIfNoEntry: false });
-    }
-    catch {
-        // Non-ENOENT errors (ENOTDIR from probing `file.ts/index.ts`, EACCES):
-        // treat as absent.
-        return undefined;
-    }
+	try {
+		return fs$1.statSync(p, { throwIfNoEntry: false });
+	} catch {
+		return;
+	}
 }
 function tryFile(p) {
-    return tryStat(p)?.isFile() ? p : null;
+	return tryStat(p)?.isFile() ? p : null;
 }
 /** Probe a path (possibly extensionless) to an existing file. */
 function probeFile(base) {
-    const hasExtension = path.extname(base) !== "";
-    if (hasExtension) {
-        if (tryFile(base))
-            return base;
-        // Extensioned path that doesn't exist as-is: TS source referenced with a
-        // .js specifier (nodenext style). Probe the extension-family swap before
-        // the append/index probes — in nodenext codebases this is the common hit
-        // and skips ~16 dead probes per import.
-        if (/\.[cm]?js$/.test(base)) {
-            const hit = tryFile(base.replace(/\.([cm]?)js$/, ".$1ts")) ??
-                tryFile(base.replace(/\.[cm]?js$/, ".tsx"));
-            if (hit)
-                return hit;
-        }
-    }
-    for (const ext of SOURCE_EXTENSIONS) {
-        const hit = tryFile(base + ext);
-        if (hit)
-            return hit;
-    }
-    for (const ext of SOURCE_EXTENSIONS) {
-        const hit = tryFile(path.join(base, `index${ext}`));
-        if (hit)
-            return hit;
-    }
-    // Extensionless path that exists exactly (e.g. ./bin/cli).
-    return hasExtension ? null : tryFile(base);
+	const hasExtension = path$1.extname(base) !== "";
+	if (hasExtension) {
+		if (tryFile(base)) return base;
+		if (/\.[cm]?js$/.test(base)) {
+			const hit = tryFile(base.replace(/\.([cm]?)js$/, ".$1ts")) ?? tryFile(base.replace(/\.[cm]?js$/, ".tsx"));
+			if (hit) return hit;
+		}
+	}
+	for (const ext of SOURCE_EXTENSIONS) {
+		const hit = tryFile(base + ext);
+		if (hit) return hit;
+	}
+	for (const ext of SOURCE_EXTENSIONS) {
+		const hit = tryFile(path$1.join(base, `index${ext}`));
+		if (hit) return hit;
+	}
+	return hasExtension ? null : tryFile(base);
 }
 function realpathOf(p) {
-    let real = realpathMemo.get(p);
-    if (real === undefined) {
-        try {
-            real = fs.realpathSync(p);
-        }
-        catch {
-            real = p; // keep the unresolved path
-        }
-        realpathMemo.set(p, real);
-    }
-    return real;
+	let real = realpathMemo.get(p);
+	if (real === void 0) {
+		try {
+			real = fs$1.realpathSync(p);
+		} catch {
+			real = p;
+		}
+		realpathMemo.set(p, real);
+	}
+	return real;
 }
 function firstPartyOrNull(resolved) {
-    const real = realpathOf(resolved);
-    return real.includes(NODE_MODULES_SEGMENT) ? null : real;
+	const real = realpathOf(resolved);
+	return real.includes(NODE_MODULES_SEGMENT) ? null : real;
 }
 /** Node resolution is a function of the importing DIRECTORY, not the file. */
 function requireFor(dir) {
-    let req = requireMemo.get(dir);
-    if (req === undefined) {
-        req = createRequire(path.join(dir, "__zod_compiler_resolve__.js"));
-        requireMemo.set(dir, req);
-    }
-    return req;
+	let req = requireMemo.get(dir);
+	if (req === void 0) {
+		req = createRequire(path$1.join(dir, "__zod_compiler_resolve__.js"));
+		requireMemo.set(dir, req);
+	}
+	return req;
 }
 /**
- * Resolve one specifier from a directory. Returns:
- * - an absolute path (first-party file to record + crawl)
- * - null when the dep is intentionally out of scope (node_modules, builtins)
- * - UNRESOLVED when resolution failed and the graph cannot be trusted
- */
+* Resolve one specifier from a directory. Returns:
+* - an absolute path (first-party file to record + crawl)
+* - null when the dep is intentionally out of scope (node_modules, builtins)
+* - UNRESOLVED when resolution failed and the graph cannot be trusted
+*/
 function resolveSpecifier(rawSpec, fromDir) {
-    if (SKIP_SPECIFIER.test(rawSpec))
-        return null;
-    const memoKey = `${fromDir}\0${rawSpec}`;
-    const memoized = resolveMemo.get(memoKey);
-    if (memoized !== undefined)
-        return memoized;
-    const result = resolveSpecifierUncached(rawSpec, fromDir);
-    resolveMemo.set(memoKey, result);
-    return result;
+	if (SKIP_SPECIFIER.test(rawSpec)) return null;
+	const memoKey = `${fromDir}\0${rawSpec}`;
+	const memoized = resolveMemo.get(memoKey);
+	if (memoized !== void 0) return memoized;
+	const result = resolveSpecifierUncached(rawSpec, fromDir);
+	resolveMemo.set(memoKey, result);
+	return result;
 }
 function resolveSpecifierUncached(rawSpec, fromDir) {
-    // Vite-style resource queries (./logo.svg?url, ./shader.glsl?raw) resolve
-    // to the underlying file.
-    const q = rawSpec.indexOf("?");
-    const spec = q === -1 ? rawSpec : rawSpec.slice(0, q);
-    if (spec === "")
-        return null;
-    if (spec.startsWith("./") || spec.startsWith("../")) {
-        const hit = probeFile(path.resolve(fromDir, spec));
-        return hit === null ? UNRESOLVED : firstPartyOrNull(hit);
-    }
-    const { candidates, authoritative } = resolveTsconfigPathCandidates(fromDir, spec);
-    for (const candidate of candidates) {
-        const hit = probeFile(candidate);
-        if (hit !== null) {
-            return firstPartyOrNull(hit);
-        }
-    }
-    // An authoritative miss (explicit `paths` pattern matched, or the paths
-    // config is present but uninterpretable) means the import cannot be
-    // trusted. Implicit baseUrl candidates are proposed for EVERY bare
-    // specifier (npm packages, `#` imports) and only mean "try baseDir
-    // first" — a miss falls through to node resolution below.
-    if (authoritative)
-        return UNRESOLVED;
-    // Bare specifier (package) or package.json "imports" (#...): node
-    // resolution from the importing directory. node_modules results are out of
-    // scope (zod's version is part of the cache key); symlinked workspace
-    // packages realpath outside node_modules and are crawled as first-party.
-    try {
-        const resolved = requireFor(fromDir).resolve(spec);
-        if (!path.isAbsolute(resolved))
-            return null; // node builtin
-        return firstPartyOrNull(resolved);
-    }
-    catch {
-        // Unresolvable from Node's algorithm. jiti may still resolve it (e.g.
-        // ESM-only packages without CJS entries) — the file itself stays a dep
-        // through the entry, but its subtree is unknown for bare packages.
-        // Treat unresolvable BARE specifiers as out-of-scope third-party
-        // (caught by the zod-version/plugin key when relevant) only when they
-        // cannot be project files; '#' subpath imports stay strict.
-        return spec.startsWith("#") ? UNRESOLVED : null;
-    }
+	const q = rawSpec.indexOf("?");
+	const spec = q === -1 ? rawSpec : rawSpec.slice(0, q);
+	if (spec === "") return null;
+	if (spec.startsWith("./") || spec.startsWith("../")) {
+		const hit = probeFile(path$1.resolve(fromDir, spec));
+		return hit === null ? UNRESOLVED : firstPartyOrNull(hit);
+	}
+	const { candidates, authoritative } = resolveTsconfigPathCandidates(fromDir, spec);
+	for (const candidate of candidates) {
+		const hit = probeFile(candidate);
+		if (hit !== null) return firstPartyOrNull(hit);
+	}
+	if (authoritative) return UNRESOLVED;
+	try {
+		const resolved = requireFor(fromDir).resolve(spec);
+		if (!path$1.isAbsolute(resolved)) return null;
+		return firstPartyOrNull(resolved);
+	} catch {
+		return spec.startsWith("#") ? UNRESOLVED : null;
+	}
 }
 /**
- * Scan + resolve one file into its edge list. Memoized by mtime, so the
- * shared core graph is read and resolved once per process — each entry's
- * closure walk after that is one cheap stat plus Map lookups per file.
- * Returns null for unreadable files.
- */
+* Scan + resolve one file into its edge list. Memoized by mtime, so the
+* shared core graph is read and resolved once per process — each entry's
+* closure walk after that is one cheap stat plus Map lookups per file.
+* Returns null for unreadable files.
+*/
 function fileNode(filePath) {
-    const stat = tryStat(filePath);
-    if (stat === undefined || !stat.isFile()) {
-        nodeMemo.set(filePath, null);
-        return null;
-    }
-    const memo = nodeMemo.get(filePath);
-    if (memo !== undefined && memo !== null && memo.mtimeMs === stat.mtimeMs)
-        return memo;
-    let source;
-    try {
-        source = fs.readFileSync(filePath, "utf8");
-    }
-    catch {
-        nodeMemo.set(filePath, null);
-        return null;
-    }
-    // String/comment contents can false-positive both patterns; extra
-    // specifiers only add deps (safe), a false `incomplete` only falls back
-    // to the superset (safe).
-    let incomplete = DYNAMIC_CALL.test(source);
-    const edges = [];
-    const seen = new Set();
-    const dir = path.dirname(filePath);
-    for (const m of source.matchAll(STATIC_SPECIFIER)) {
-        const spec = m[1];
-        if (!spec)
-            continue;
-        const resolved = resolveSpecifier(spec, dir);
-        if (resolved === UNRESOLVED) {
-            incomplete = true;
-        }
-        else if (resolved !== null && !seen.has(resolved)) {
-            seen.add(resolved);
-            edges.push(resolved);
-        }
-    }
-    const node = { mtimeMs: stat.mtimeMs, edges, incomplete };
-    nodeMemo.set(filePath, node);
-    return node;
+	const stat = tryStat(filePath);
+	if (stat === void 0 || !stat.isFile()) {
+		nodeMemo.set(filePath, null);
+		return null;
+	}
+	const memo = nodeMemo.get(filePath);
+	if (memo !== void 0 && memo !== null && memo.mtimeMs === stat.mtimeMs) return memo;
+	let source;
+	try {
+		source = fs$1.readFileSync(filePath, "utf8");
+	} catch {
+		nodeMemo.set(filePath, null);
+		return null;
+	}
+	let incomplete = DYNAMIC_CALL.test(source);
+	const edges = [];
+	const seen = /* @__PURE__ */ new Set();
+	const dir = path$1.dirname(filePath);
+	for (const m of source.matchAll(STATIC_SPECIFIER)) {
+		const spec = m[1];
+		if (!spec) continue;
+		const resolved = resolveSpecifier(spec, dir);
+		if (resolved === UNRESOLVED) incomplete = true;
+		else if (resolved !== null && !seen.has(resolved)) {
+			seen.add(resolved);
+			edges.push(resolved);
+		}
+	}
+	const node = {
+		mtimeMs: stat.mtimeMs,
+		edges,
+		incomplete
+	};
+	nodeMemo.set(filePath, node);
+	return node;
 }
 /**
- * Compute the static first-party dependency closure of `entryFile`.
- * The entry itself is excluded (its content is part of the cache key).
- */
-export function collectStaticDeps(entryFile) {
-    const entry = firstPartyOrNull(path.resolve(entryFile));
-    if (entry === null)
-        return INCOMPLETE;
-    const visited = new Set([entry]);
-    const queue = [entry];
-    while (queue.length > 0) {
-        if (visited.size > MAX_FILES)
-            return INCOMPLETE;
-        const file = queue.pop();
-        const node = fileNode(file);
-        // Any unanalyzable node poisons the whole closure; the caller falls back
-        // to the superset, so abort instead of crawling to exhaustion.
-        if (node === null || node.incomplete)
-            return INCOMPLETE;
-        for (const dep of node.edges) {
-            if (!visited.has(dep)) {
-                visited.add(dep);
-                queue.push(dep);
-            }
-        }
-    }
-    visited.delete(entry);
-    return { deps: [...visited], complete: true };
+* Compute the static first-party dependency closure of `entryFile`.
+* The entry itself is excluded (its content is part of the cache key).
+*/
+function collectStaticDeps(entryFile) {
+	const entry = firstPartyOrNull(path$1.resolve(entryFile));
+	if (entry === null) return INCOMPLETE;
+	const visited = /* @__PURE__ */ new Set([entry]);
+	const queue = [entry];
+	while (queue.length > 0) {
+		if (visited.size > MAX_FILES) return INCOMPLETE;
+		const node = fileNode(queue.pop());
+		if (node === null || node.incomplete) return INCOMPLETE;
+		for (const dep of node.edges) if (!visited.has(dep)) {
+			visited.add(dep);
+			queue.push(dep);
+		}
+	}
+	visited.delete(entry);
+	return {
+		deps: [...visited],
+		complete: true
+	};
 }
+//#endregion
+export { collectStaticDeps, resetDepGraphMemo };
+
 //# sourceMappingURL=dep-graph.js.map

package/dist/unplugin/dep-graph.js.map

@@ -1 +1 @@
-{"version":3,"file":"dep-graph.js","sourceRoot":"","sources":["../../src/unplugin/dep-graph.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAqCG;AAEH,OAAO,KAAK,EAAE,MAAM,SAAS,CAAC;AAC9B,OAAO,EAAE,aAAa,EAAE,MAAM,aAAa,CAAC;AAC5C,OAAO,KAAK,IAAI,MAAM,WAAW,CAAC;AAClC,OAAO,EAAE,6BAA6B,EAAE,MAAM,cAAc,CAAC;AAS7D,MAAM,iBAAiB,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;AACzF,MAAM,oBAAoB,GAAG,GAAG,IAAI,CAAC,GAAG,eAAe,IAAI,CAAC,GAAG,EAAE,CAAC;AAClE,6DAA6D;AAC7D,mGAAmG;AACnG,MAAM,cAAc,GAAG,kCAAkC,CAAC;AAC1D,yEAAyE;AACzE,MAAM,SAAS,GAAG,MAAM,CAAC;AAEzB,MAAM,UAAU,GAAe,EAAE,IAAI,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;AAE7D;;;;GAIG;AACH,MAAM,UAAU,GAAG,MAAM,CAAC,YAAY,CAAC,CAAC;AAUxC;;;;;;;GAOG;AACH,MAAM,QAAQ,GAAG,IAAI,GAAG,EAA2B,CAAC;AACpD,MAAM,WAAW,GAAG,IAAI,GAAG,EAA6C,CAAC;AACzE,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;AAC/C,MAAM,WAAW,GAAG,IAAI,GAAG,EAA4C,CAAC;AAExE,uEAAuE;AACvE,MAAM,UAAU,iBAAiB;IAC/B,QAAQ,CAAC,KAAK,EAAE,CAAC;IACjB,WAAW,CAAC,KAAK,EAAE,CAAC;IACpB,YAAY,CAAC,KAAK,EAAE,CAAC;IACrB,WAAW,CAAC,KAAK,EAAE,CAAC;AACtB,CAAC;AAED,MAAM,gBAAgB,GACpB,iFAAiF,CAAC;AACpF,wEAAwE;AACxE,oEAAoE;AACpE,+DAA+D;AAC/D,MAAM,YAAY,GAAG,4CAA4C,CAAC;AAElE,yEAAyE;AACzE,SAAS,OAAO,CAAC,CAAS;IACxB,IAAI,CAAC;QACH,OAAO,EAAE,CAAC,QAAQ,CAAC,CAAC,EAAE,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC,CAAC;IACnD,CAAC;IAAC,MAAM,CAAC;QACP,uEAAuE;QACvE,mBAAmB;QACnB,OAAO,SAAS,CAAC;IACnB,CAAC;AACH,CAAC;AAED,SAAS,OAAO,CAAC,CAAS;IACxB,OAAO,OAAO,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC;AACzC,CAAC;AAED,iEAAiE;AACjE,SAAS,SAAS,CAAC,IAAY;IAC7B,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;IAC/C,IAAI,YAAY,EAAE,CAAC;QACjB,IAAI,OAAO,CAAC,IAAI,CAAC;YAAE,OAAO,IAAI,CAAC;QAC/B,yEAAyE;QACzE,yEAAyE;QACzE,yEAAyE;QACzE,wCAAwC;QACxC,IAAI,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5B,MAAM,GAAG,GACP,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,cAAc,EAAE,OAAO,CAAC,CAAC;gBAC9C,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,MAAM,CAAC,CAAC,CAAC;YAC9C,IAAI,GAAG;gBAAE,OAAO,GAAG,CAAC;QACtB,CAAC;IACH,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,iBAAiB,EAAE,CAAC;QACpC,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,GAAG,GAAG,CAAC,CAAC;QAChC,IAAI,GAAG;YAAE,OAAO,GAAG,CAAC;IACtB,CAAC;IACD,KAAK,MAAM,GAAG,IAAI,iBAAiB,EAAE,CAAC;QACpC,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,GAAG,EAAE,CAAC,CAAC,CAAC;QACpD,IAAI,GAAG;YAAE,OAAO,GAAG,CAAC;IACtB,CAAC;IACD,2DAA2D;IAC3D,OAAO,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;AAC7C,CAAC;AAED,SAAS,UAAU,CAAC,CAAS;IAC3B,IAAI,IAAI,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAC/B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;QACvB,IAAI,CAAC;YACH,IAAI,GAAG,EAAE,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAC5B,CAAC;QAAC,MAAM,CAAC;YACP,IAAI,GAAG,CAAC,CAAC,CAAC,2BAA2B;QACvC,CAAC;QACD,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;IAC5B,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,gBAAgB,CAAC,QAAgB;IACxC,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,CAAC;IAClC,OAAO,IAAI,CAAC,QAAQ,CAAC,oBAAoB,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AAC3D,CAAC;AAED,8EAA8E;AAC9E,SAAS,UAAU,CAAC,GAAW;IAC7B,IAAI,GAAG,GAAG,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IAC/B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;QACtB,GAAG,GAAG,aAAa,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,6BAA6B,CAAC,CAAC,CAAC;QACnE,WAAW,CAAC,GAAG,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;IAC5B,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;;;GAKG;AACH,SAAS,gBAAgB,CAAC,OAAe,EAAE,OAAe;IACxD,IAAI,cAAc,CAAC,IAAI,CAAC,OAAO,CAAC;QAAE,OAAO,IAAI,CAAC;IAC9C,MAAM,OAAO,GAAG,GAAG,OAAO,KAAK,OAAO,EAAE,CAAC;IACzC,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAC1C,IAAI,QAAQ,KAAK,SAAS;QAAE,OAAO,QAAQ,CAAC;IAC5C,MAAM,MAAM,GAAG,wBAAwB,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;IAC1D,WAAW,CAAC,GAAG,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;IACjC,OAAO,MAAM,CAAC;AAChB,CAAC;AAED,SAAS,wBAAwB,CAC/B,OAAe,EACf,OAAe;IAEf,0EAA0E;IAC1E,0BAA0B;IAC1B,MAAM,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IAC/B,MAAM,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACtD,IAAI,IAAI,KAAK,EAAE;QAAE,OAAO,IAAI,CAAC;IAE7B,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,EAAE,CAAC;QACpD,MAAM,GAAG,GAAG,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC,CAAC;QACnD,OAAO,GAAG,KAAK,IAAI,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,gBAAgB,CAAC,GAAG,CAAC,CAAC;IAC3D,CAAC;IAED,MAAM,EAAE,UAAU,EAAE,aAAa,EAAE,GAAG,6BAA6B,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IACnF,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,GAAG,GAAG,SAAS,CAAC,SAAS,CAAC,CAAC;QACjC,IAAI,GAAG,KAAK,IAAI,EAAE,CAAC;YACjB,OAAO,gBAAgB,CAAC,GAAG,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IACD,wEAAwE;IACxE,oEAAoE;IACpE,mEAAmE;IACnE,mEAAmE;IACnE,0DAA0D;IAC1D,IAAI,aAAa;QAAE,OAAO,UAAU,CAAC;IAErC,kEAAkE;IAClE,2EAA2E;IAC3E,sEAAsE;IACtE,yEAAyE;IACzE,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACnD,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC;YAAE,OAAO,IAAI,CAAC,CAAC,eAAe;QAC5D,OAAO,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IACpC,CAAC;IAAC,MAAM,CAAC;QACP,sEAAsE;QACtE,uEAAuE;QACvE,mEAAmE;QACnE,iEAAiE;QACjE,sEAAsE;QACtE,4DAA4D;QAC5D,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC;IAClD,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,SAAS,QAAQ,CAAC,QAAgB;IAChC,MAAM,IAAI,GAAG,OAAO,CAAC,QAAQ,CAAC,CAAC;IAC/B,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,CAAC;QACzC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;IACpC,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,OAAO,KAAK,IAAI,CAAC,OAAO;QAAE,OAAO,IAAI,CAAC;IAEtF,IAAI,MAAc,CAAC;IACnB,IAAI,CAAC;QACH,MAAM,GAAG,EAAE,CAAC,YAAY,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC;IAC7C,CAAC;IAAC,MAAM,CAAC;QACP,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;QAC7B,OAAO,IAAI,CAAC;IACd,CAAC;IACD,kEAAkE;IAClE,wEAAwE;IACxE,0BAA0B;IAC1B,IAAI,UAAU,GAAG,YAAY,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC3C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACnC,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,QAAQ,CAAC,gBAAgB,CAAC,EAAE,CAAC;QAClD,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,MAAM,QAAQ,GAAG,gBAAgB,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;QAC7C,IAAI,QAAQ,KAAK,UAAU,EAAE,CAAC;YAC5B,UAAU,GAAG,IAAI,CAAC;QACpB,CAAC;aAAM,IAAI,QAAQ,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACpD,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YACnB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IACD,MAAM,IAAI,GAAa,EAAE,OAAO,EAAE,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;IACpE,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAC7B,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,SAAiB;IACjD,MAAM,KAAK,GAAG,gBAAgB,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC,CAAC;IACxD,IAAI,KAAK,KAAK,IAAI;QAAE,OAAO,UAAU,CAAC;IAEtC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAS,CAAC,KAAK,CAAC,CAAC,CAAC;IACzC,MAAM,KAAK,GAAa,CAAC,KAAK,CAAC,CAAC;IAEhC,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,IAAI,OAAO,CAAC,IAAI,GAAG,SAAS;YAAE,OAAO,UAAU,CAAC;QAChD,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,EAAY,CAAC;QACnC,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC5B,yEAAyE;QACzE,+DAA+D;QAC/D,IAAI,IAAI,KAAK,IAAI,IAAI,IAAI,CAAC,UAAU;YAAE,OAAO,UAAU,CAAC;QACxD,KAAK,MAAM,GAAG,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC7B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBACtB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBACjB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IACtB,OAAO,EAAE,IAAI,EAAE,CAAC,GAAG,OAAO,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC;AAChD,CAAC"}
+{"version":3,"file":"dep-graph.js","names":["path","fs"],"sources":["../../src/unplugin/dep-graph.ts"],"sourcesContent":["/**\n * Static per-file dependency graphs for disk-cache invalidation.\n *\n * The disk cache used to record `getFirstPartyModulePaths()` — the superset\n * of EVERY first-party module the loader had executed so far — as each\n * entry's dependency set. Supersets never serve stale results, but in a\n * large codebase every entry ends up recording the whole project (~1,900\n * deps, ~400KB JSON per entry in the field report), so ANY commit\n * invalidates essentially the entire cache and CI re-pays full discovery\n * every run.\n *\n * This module computes the file's ACTUAL import graph statically: scan\n * import/export/require specifiers, resolve them (relative paths with\n * extension probing, tsconfig path aliases via the loader's config, bare\n * specifiers through node resolution), and BFS across first-party files.\n * No file is executed. Type-only imports are included (over-approximation\n * only over-invalidates).\n *\n * Soundness rule: when anything cannot be analyzed — a non-literal dynamic\n * import, an unresolvable relative specifier — the crawl reports\n * `complete: false` and the caller falls back to the superset. A static\n * crawl may only replace the superset when it provably covers everything\n * the file can load.\n *\n * Cost discipline (this runs serialized on the bundler's main process, once\n * per discovery file, over closures that reach thousands of files):\n * - every existence probe uses `statSync(p, { throwIfNoEntry: false })` —\n *   a thrown ENOENT pays V8 error-plus-stack construction, and a cold crawl\n *   issues these probes by the million (the dominant cost in field samples);\n * - resolution is memoized at every level: realpath per path, createRequire\n *   per directory, resolved specifier per (directory, specifier), and the\n *   full edge list per file (mtime-validated) — repeat crawls over the\n *   shared core graph are Map lookups plus one cheap stat per file;\n * - the BFS aborts the moment the graph becomes unanalyzable: the caller\n *   discards an incomplete result for the superset anyway, so finishing the\n *   crawl would be pure waste (and incomplete is the COMMON outcome on\n *   large graphs — one dynamic import anywhere poisons the whole closure).\n */\n\nimport * as fs from \"node:fs\";\nimport { createRequire } from \"node:module\";\nimport * as path from \"node:path\";\nimport { resolveTsconfigPathCandidates } from \"../loader.js\";\n\nexport interface StaticDeps {\n  /** Absolute real paths of first-party files reachable from the entry. */\n  deps: string[];\n  /** False when the graph could not be fully analyzed — use the superset. */\n  complete: boolean;\n}\n\nconst SOURCE_EXTENSIONS = [\".ts\", \".tsx\", \".mts\", \".cts\", \".js\", \".jsx\", \".mjs\", \".cjs\"];\nconst NODE_MODULES_SEGMENT = `${path.sep}node_modules${path.sep}`;\n/** Specifier schemes that never resolve to project files. */\n// oxlint-disable-next-line no-control-regex -- rollup-convention virtual module ids begin with NUL\nconst SKIP_SPECIFIER = /^(?:node:|data:|virtual:|\\u0000)/;\n/** Runaway guard — graphs larger than this fall back to the superset. */\nconst MAX_FILES = 10_000;\n\nconst INCOMPLETE: StaticDeps = { deps: [], complete: false };\n\n/**\n * Resolution-failure sentinel. A unique symbol rather than a string literal:\n * `\"incomplete\" | string` collapses to `string`, so the type system could\n * not distinguish a resolved path from the failure marker.\n */\nconst UNRESOLVED = Symbol(\"unresolved\");\n\ninterface FileNode {\n  mtimeMs: number;\n  /** Resolved first-party imports (absolute real paths), deduped. */\n  edges: string[];\n  /** Non-literal dynamic import/require or unresolvable specifier. */\n  incomplete: boolean;\n}\n\n/**\n * Per-process memos. The file node memo is revalidated by mtime on every\n * visit; the resolution memos (specifier, realpath, require) depend on the\n * filesystem layout rather than file contents and are only dropped by\n * resetDepGraphMemo() — the same wholesale invalidation watch mode already\n * applies to the module cache (a memoized resolution can only go stale when\n * files appear/move, which fires watchChange).\n */\nconst nodeMemo = new Map<string, FileNode | null>();\nconst resolveMemo = new Map<string, string | null | typeof UNRESOLVED>();\nconst realpathMemo = new Map<string, string>();\nconst requireMemo = new Map<string, ReturnType<typeof createRequire>>();\n\n/** Reset the per-process dep-graph memos (watch-mode file changes). */\nexport function resetDepGraphMemo(): void {\n  nodeMemo.clear();\n  resolveMemo.clear();\n  realpathMemo.clear();\n  requireMemo.clear();\n}\n\nconst STATIC_SPECIFIER =\n  /(?:\\bfrom\\s*|\\bimport\\s+|\\bimport\\s*\\(\\s*|\\brequire\\s*\\(\\s*)[\"']([^\"'\\n]+)[\"']/g;\n// No /g flag: `.test()` on a global regex resumes from lastIndex of the\n// PREVIOUS file's match, silently missing dynamic imports (a missed\n// detection records a falsely-complete dep set — stale cache).\nconst DYNAMIC_CALL = /\\b(?:import|require)\\s*\\(\\s*(?![\"'])[^)\\s]/;\n\n/** statSync that reports ENOENT as undefined instead of an exception. */\nfunction tryStat(p: string): fs.Stats | undefined {\n  try {\n    return fs.statSync(p, { throwIfNoEntry: false });\n  } catch {\n    // Non-ENOENT errors (ENOTDIR from probing `file.ts/index.ts`, EACCES):\n    // treat as absent.\n    return undefined;\n  }\n}\n\nfunction tryFile(p: string): string | null {\n  return tryStat(p)?.isFile() ? p : null;\n}\n\n/** Probe a path (possibly extensionless) to an existing file. */\nfunction probeFile(base: string): string | null {\n  const hasExtension = path.extname(base) !== \"\";\n  if (hasExtension) {\n    if (tryFile(base)) return base;\n    // Extensioned path that doesn't exist as-is: TS source referenced with a\n    // .js specifier (nodenext style). Probe the extension-family swap before\n    // the append/index probes — in nodenext codebases this is the common hit\n    // and skips ~16 dead probes per import.\n    if (/\\.[cm]?js$/.test(base)) {\n      const hit =\n        tryFile(base.replace(/\\.([cm]?)js$/, \".$1ts\")) ??\n        tryFile(base.replace(/\\.[cm]?js$/, \".tsx\"));\n      if (hit) return hit;\n    }\n  }\n  for (const ext of SOURCE_EXTENSIONS) {\n    const hit = tryFile(base + ext);\n    if (hit) return hit;\n  }\n  for (const ext of SOURCE_EXTENSIONS) {\n    const hit = tryFile(path.join(base, `index${ext}`));\n    if (hit) return hit;\n  }\n  // Extensionless path that exists exactly (e.g. ./bin/cli).\n  return hasExtension ? null : tryFile(base);\n}\n\nfunction realpathOf(p: string): string {\n  let real = realpathMemo.get(p);\n  if (real === undefined) {\n    try {\n      real = fs.realpathSync(p);\n    } catch {\n      real = p; // keep the unresolved path\n    }\n    realpathMemo.set(p, real);\n  }\n  return real;\n}\n\nfunction firstPartyOrNull(resolved: string): string | null {\n  const real = realpathOf(resolved);\n  return real.includes(NODE_MODULES_SEGMENT) ? null : real;\n}\n\n/** Node resolution is a function of the importing DIRECTORY, not the file. */\nfunction requireFor(dir: string): ReturnType<typeof createRequire> {\n  let req = requireMemo.get(dir);\n  if (req === undefined) {\n    req = createRequire(path.join(dir, \"__zod_compiler_resolve__.js\"));\n    requireMemo.set(dir, req);\n  }\n  return req;\n}\n\n/**\n * Resolve one specifier from a directory. Returns:\n * - an absolute path (first-party file to record + crawl)\n * - null when the dep is intentionally out of scope (node_modules, builtins)\n * - UNRESOLVED when resolution failed and the graph cannot be trusted\n */\nfunction resolveSpecifier(rawSpec: string, fromDir: string): string | null | typeof UNRESOLVED {\n  if (SKIP_SPECIFIER.test(rawSpec)) return null;\n  const memoKey = `${fromDir}\\0${rawSpec}`;\n  const memoized = resolveMemo.get(memoKey);\n  if (memoized !== undefined) return memoized;\n  const result = resolveSpecifierUncached(rawSpec, fromDir);\n  resolveMemo.set(memoKey, result);\n  return result;\n}\n\nfunction resolveSpecifierUncached(\n  rawSpec: string,\n  fromDir: string,\n): string | null | typeof UNRESOLVED {\n  // Vite-style resource queries (./logo.svg?url, ./shader.glsl?raw) resolve\n  // to the underlying file.\n  const q = rawSpec.indexOf(\"?\");\n  const spec = q === -1 ? rawSpec : rawSpec.slice(0, q);\n  if (spec === \"\") return null;\n\n  if (spec.startsWith(\"./\") || spec.startsWith(\"../\")) {\n    const hit = probeFile(path.resolve(fromDir, spec));\n    return hit === null ? UNRESOLVED : firstPartyOrNull(hit);\n  }\n\n  const { candidates, authoritative } = resolveTsconfigPathCandidates(fromDir, spec);\n  for (const candidate of candidates) {\n    const hit = probeFile(candidate);\n    if (hit !== null) {\n      return firstPartyOrNull(hit);\n    }\n  }\n  // An authoritative miss (explicit `paths` pattern matched, or the paths\n  // config is present but uninterpretable) means the import cannot be\n  // trusted. Implicit baseUrl candidates are proposed for EVERY bare\n  // specifier (npm packages, `#` imports) and only mean \"try baseDir\n  // first\" — a miss falls through to node resolution below.\n  if (authoritative) return UNRESOLVED;\n\n  // Bare specifier (package) or package.json \"imports\" (#...): node\n  // resolution from the importing directory. node_modules results are out of\n  // scope (zod's version is part of the cache key); symlinked workspace\n  // packages realpath outside node_modules and are crawled as first-party.\n  try {\n    const resolved = requireFor(fromDir).resolve(spec);\n    if (!path.isAbsolute(resolved)) return null; // node builtin\n    return firstPartyOrNull(resolved);\n  } catch {\n    // Unresolvable from Node's algorithm. jiti may still resolve it (e.g.\n    // ESM-only packages without CJS entries) — the file itself stays a dep\n    // through the entry, but its subtree is unknown for bare packages.\n    // Treat unresolvable BARE specifiers as out-of-scope third-party\n    // (caught by the zod-version/plugin key when relevant) only when they\n    // cannot be project files; '#' subpath imports stay strict.\n    return spec.startsWith(\"#\") ? UNRESOLVED : null;\n  }\n}\n\n/**\n * Scan + resolve one file into its edge list. Memoized by mtime, so the\n * shared core graph is read and resolved once per process — each entry's\n * closure walk after that is one cheap stat plus Map lookups per file.\n * Returns null for unreadable files.\n */\nfunction fileNode(filePath: string): FileNode | null {\n  const stat = tryStat(filePath);\n  if (stat === undefined || !stat.isFile()) {\n    nodeMemo.set(filePath, null);\n    return null;\n  }\n  const memo = nodeMemo.get(filePath);\n  if (memo !== undefined && memo !== null && memo.mtimeMs === stat.mtimeMs) return memo;\n\n  let source: string;\n  try {\n    source = fs.readFileSync(filePath, \"utf8\");\n  } catch {\n    nodeMemo.set(filePath, null);\n    return null;\n  }\n  // String/comment contents can false-positive both patterns; extra\n  // specifiers only add deps (safe), a false `incomplete` only falls back\n  // to the superset (safe).\n  let incomplete = DYNAMIC_CALL.test(source);\n  const edges: string[] = [];\n  const seen = new Set<string>();\n  const dir = path.dirname(filePath);\n  for (const m of source.matchAll(STATIC_SPECIFIER)) {\n    const spec = m[1];\n    if (!spec) continue;\n    const resolved = resolveSpecifier(spec, dir);\n    if (resolved === UNRESOLVED) {\n      incomplete = true;\n    } else if (resolved !== null && !seen.has(resolved)) {\n      seen.add(resolved);\n      edges.push(resolved);\n    }\n  }\n  const node: FileNode = { mtimeMs: stat.mtimeMs, edges, incomplete };\n  nodeMemo.set(filePath, node);\n  return node;\n}\n\n/**\n * Compute the static first-party dependency closure of `entryFile`.\n * The entry itself is excluded (its content is part of the cache key).\n */\nexport function collectStaticDeps(entryFile: string): StaticDeps {\n  const entry = firstPartyOrNull(path.resolve(entryFile));\n  if (entry === null) return INCOMPLETE;\n\n  const visited = new Set<string>([entry]);\n  const queue: string[] = [entry];\n\n  while (queue.length > 0) {\n    if (visited.size > MAX_FILES) return INCOMPLETE;\n    const file = queue.pop() as string;\n    const node = fileNode(file);\n    // Any unanalyzable node poisons the whole closure; the caller falls back\n    // to the superset, so abort instead of crawling to exhaustion.\n    if (node === null || node.incomplete) return INCOMPLETE;\n    for (const dep of node.edges) {\n      if (!visited.has(dep)) {\n        visited.add(dep);\n        queue.push(dep);\n      }\n    }\n  }\n\n  visited.delete(entry);\n  return { deps: [...visited], complete: true };\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmDA,MAAM,oBAAoB;CAAC;CAAO;CAAQ;CAAQ;CAAQ;CAAO;CAAQ;CAAQ;AAAM;AACvF,MAAM,uBAAuB,GAAGA,OAAK,IAAI,cAAcA,OAAK;;AAG5D,MAAM,iBAAiB;;AAEvB,MAAM,YAAY;AAElB,MAAM,aAAyB;CAAE,MAAM,CAAC;CAAG,UAAU;AAAM;;;;;;AAO3D,MAAM,aAAa,OAAO,YAAY;;;;;;;;;AAkBtC,MAAM,2BAAW,IAAI,IAA6B;AAClD,MAAM,8BAAc,IAAI,IAA+C;AACvE,MAAM,+BAAe,IAAI,IAAoB;AAC7C,MAAM,8BAAc,IAAI,IAA8C;;AAGtE,SAAgB,oBAA0B;CACxC,SAAS,MAAM;CACf,YAAY,MAAM;CAClB,aAAa,MAAM;CACnB,YAAY,MAAM;AACpB;AAEA,MAAM,mBACJ;AAIF,MAAM,eAAe;;AAGrB,SAAS,QAAQ,GAAiC;CAChD,IAAI;EACF,OAAOC,KAAG,SAAS,GAAG,EAAE,gBAAgB,MAAM,CAAC;CACjD,QAAQ;EAGN;CACF;AACF;AAEA,SAAS,QAAQ,GAA0B;CACzC,OAAO,QAAQ,CAAC,CAAC,EAAE,OAAO,IAAI,IAAI;AACpC;;AAGA,SAAS,UAAU,MAA6B;CAC9C,MAAM,eAAeD,OAAK,QAAQ,IAAI,MAAM;CAC5C,IAAI,cAAc;EAChB,IAAI,QAAQ,IAAI,GAAG,OAAO;EAK1B,IAAI,aAAa,KAAK,IAAI,GAAG;GAC3B,MAAM,MACJ,QAAQ,KAAK,QAAQ,gBAAgB,OAAO,CAAC,KAC7C,QAAQ,KAAK,QAAQ,cAAc,MAAM,CAAC;GAC5C,IAAI,KAAK,OAAO;EAClB;CACF;CACA,KAAK,MAAM,OAAO,mBAAmB;EACnC,MAAM,MAAM,QAAQ,OAAO,GAAG;EAC9B,IAAI,KAAK,OAAO;CAClB;CACA,KAAK,MAAM,OAAO,mBAAmB;EACnC,MAAM,MAAM,QAAQA,OAAK,KAAK,MAAM,QAAQ,KAAK,CAAC;EAClD,IAAI,KAAK,OAAO;CAClB;CAEA,OAAO,eAAe,OAAO,QAAQ,IAAI;AAC3C;AAEA,SAAS,WAAW,GAAmB;CACrC,IAAI,OAAO,aAAa,IAAI,CAAC;CAC7B,IAAI,SAAS,KAAA,GAAW;EACtB,IAAI;GACF,OAAOC,KAAG,aAAa,CAAC;EAC1B,QAAQ;GACN,OAAO;EACT;EACA,aAAa,IAAI,GAAG,IAAI;CAC1B;CACA,OAAO;AACT;AAEA,SAAS,iBAAiB,UAAiC;CACzD,MAAM,OAAO,WAAW,QAAQ;CAChC,OAAO,KAAK,SAAS,oBAAoB,IAAI,OAAO;AACtD;;AAGA,SAAS,WAAW,KAA+C;CACjE,IAAI,MAAM,YAAY,IAAI,GAAG;CAC7B,IAAI,QAAQ,KAAA,GAAW;EACrB,MAAM,cAAcD,OAAK,KAAK,KAAK,6BAA6B,CAAC;EACjE,YAAY,IAAI,KAAK,GAAG;CAC1B;CACA,OAAO;AACT;;;;;;;AAQA,SAAS,iBAAiB,SAAiB,SAAoD;CAC7F,IAAI,eAAe,KAAK,OAAO,GAAG,OAAO;CACzC,MAAM,UAAU,GAAG,QAAQ,IAAI;CAC/B,MAAM,WAAW,YAAY,IAAI,OAAO;CACxC,IAAI,aAAa,KAAA,GAAW,OAAO;CACnC,MAAM,SAAS,yBAAyB,SAAS,OAAO;CACxD,YAAY,IAAI,SAAS,MAAM;CAC/B,OAAO;AACT;AAEA,SAAS,yBACP,SACA,SACmC;CAGnC,MAAM,IAAI,QAAQ,QAAQ,GAAG;CAC7B,MAAM,OAAO,MAAM,KAAK,UAAU,QAAQ,MAAM,GAAG,CAAC;CACpD,IAAI,SAAS,IAAI,OAAO;CAExB,IAAI,KAAK,WAAW,IAAI,KAAK,KAAK,WAAW,KAAK,GAAG;EACnD,MAAM,MAAM,UAAUA,OAAK,QAAQ,SAAS,IAAI,CAAC;EACjD,OAAO,QAAQ,OAAO,aAAa,iBAAiB,GAAG;CACzD;CAEA,MAAM,EAAE,YAAY,kBAAkB,8BAA8B,SAAS,IAAI;CACjF,KAAK,MAAM,aAAa,YAAY;EAClC,MAAM,MAAM,UAAU,SAAS;EAC/B,IAAI,QAAQ,MACV,OAAO,iBAAiB,GAAG;CAE/B;CAMA,IAAI,eAAe,OAAO;CAM1B,IAAI;EACF,MAAM,WAAW,WAAW,OAAO,CAAC,CAAC,QAAQ,IAAI;EACjD,IAAI,CAACA,OAAK,WAAW,QAAQ,GAAG,OAAO;EACvC,OAAO,iBAAiB,QAAQ;CAClC,QAAQ;EAON,OAAO,KAAK,WAAW,GAAG,IAAI,aAAa;CAC7C;AACF;;;;;;;AAQA,SAAS,SAAS,UAAmC;CACnD,MAAM,OAAO,QAAQ,QAAQ;CAC7B,IAAI,SAAS,KAAA,KAAa,CAAC,KAAK,OAAO,GAAG;EACxC,SAAS,IAAI,UAAU,IAAI;EAC3B,OAAO;CACT;CACA,MAAM,OAAO,SAAS,IAAI,QAAQ;CAClC,IAAI,SAAS,KAAA,KAAa,SAAS,QAAQ,KAAK,YAAY,KAAK,SAAS,OAAO;CAEjF,IAAI;CACJ,IAAI;EACF,SAASC,KAAG,aAAa,UAAU,MAAM;CAC3C,QAAQ;EACN,SAAS,IAAI,UAAU,IAAI;EAC3B,OAAO;CACT;CAIA,IAAI,aAAa,aAAa,KAAK,MAAM;CACzC,MAAM,QAAkB,CAAC;CACzB,MAAM,uBAAO,IAAI,IAAY;CAC7B,MAAM,MAAMD,OAAK,QAAQ,QAAQ;CACjC,KAAK,MAAM,KAAK,OAAO,SAAS,gBAAgB,GAAG;EACjD,MAAM,OAAO,EAAE;EACf,IAAI,CAAC,MAAM;EACX,MAAM,WAAW,iBAAiB,MAAM,GAAG;EAC3C,IAAI,aAAa,YACf,aAAa;OACR,IAAI,aAAa,QAAQ,CAAC,KAAK,IAAI,QAAQ,GAAG;GACnD,KAAK,IAAI,QAAQ;GACjB,MAAM,KAAK,QAAQ;EACrB;CACF;CACA,MAAM,OAAiB;EAAE,SAAS,KAAK;EAAS;EAAO;CAAW;CAClE,SAAS,IAAI,UAAU,IAAI;CAC3B,OAAO;AACT;;;;;AAMA,SAAgB,kBAAkB,WAA+B;CAC/D,MAAM,QAAQ,iBAAiBA,OAAK,QAAQ,SAAS,CAAC;CACtD,IAAI,UAAU,MAAM,OAAO;CAE3B,MAAM,0BAAU,IAAI,IAAY,CAAC,KAAK,CAAC;CACvC,MAAM,QAAkB,CAAC,KAAK;CAE9B,OAAO,MAAM,SAAS,GAAG;EACvB,IAAI,QAAQ,OAAO,WAAW,OAAO;EAErC,MAAM,OAAO,SADA,MAAM,IACM,CAAC;EAG1B,IAAI,SAAS,QAAQ,KAAK,YAAY,OAAO;EAC7C,KAAK,MAAM,OAAO,KAAK,OACrB,IAAI,CAAC,QAAQ,IAAI,GAAG,GAAG;GACrB,QAAQ,IAAI,GAAG;GACf,MAAM,KAAK,GAAG;EAChB;CAEJ;CAEA,QAAQ,OAAO,KAAK;CACpB,OAAO;EAAE,MAAM,CAAC,GAAG,OAAO;EAAG,UAAU;CAAK;AAC9C"}