npm - importree - Versions diffs - 1.0.1 → 2.0.1 - Mend

importree 1.0.1 → 2.0.1

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.

Files changed (10) hide show

package/README.md CHANGED Viewed

@@ -29,28 +29,28 @@ Measured with [Vitest bench](https://vitest.dev/guide/features.html#benchmarking
 Each tool brings different strengths — [dependency-tree](https://github.com/dependents/node-dependency-tree) offers robust AST-based analysis via detective, [madge](https://github.com/pahen/madge) supports multiple languages and provides circular dependency detection with visualization. importree trades those features for raw speed through regex-based extraction.
-| Scenario | importree | [dependency-tree](https://github.com/dependents/node-dependency-tree) | [madge](https://github.com/pahen/madge) | Manual glob+regex | ts.createProgram |
-|----------|-----------|-----------------|-------|-------------------|------------------|
-| Small (10 files) | **0.4 ms** | 3.1 ms | 3.7 ms | 0.6 ms | 49.9 ms |
-| Medium (100 files) | **2.1 ms** | 14.3 ms | 15.1 ms | 5.2 ms | 48.4 ms |
-| Large (500 files) | **12.7 ms** | 44.4 ms | 43.3 ms | 26.5 ms | 50.9 ms |
+| Scenario           | importree  | [dependency-tree](https://github.com/dependents/node-dependency-tree) | [madge](https://github.com/pahen/madge) | Manual glob+regex | ts.createProgram |
+| ------------------ | ---------- | --------------------------------------------------------------------- | --------------------------------------- | ----------------- | ---------------- |
+| Small (10 files)   | **0.2 ms** | 1.3 ms                                                                | 1.4 ms                                  | 0.7 ms            | ~100 ms          |
+| Medium (100 files) | **1.1 ms** | 8.7 ms                                                                | 8.8 ms                                  | 5.6 ms            | ~100 ms          |
+| Large (500 files)  | **6.0 ms** | 21.5 ms                                                               | 25.8 ms                                 | 27.6 ms           | ~100 ms          |
 ### Full tree build
-| Project size | Mean time | Throughput |
-|-------------|-----------|------------|
-| 10 files | 0.4 ms | ~2,548 ops/s |
-| 100 files | 2.5 ms | ~406 ops/s |
-| 500 files | 12.1 ms | ~83 ops/s |
-| 1,000 files | 26.4 ms | ~38 ops/s |
+| Project size | Mean time | Throughput   |
+| ------------ | --------- | ------------ |
+| 10 files     | 0.2 ms    | ~5,121 ops/s |
+| 100 files    | 1.2 ms    | ~863 ops/s   |
+| 500 files    | 5.1 ms    | ~197 ops/s   |
+| 1,000 files  | 10.3 ms   | ~97 ops/s    |
 ### Scanner throughput
-| Operation | Throughput |
-|-----------|-----------|
-| `scanImports` (3 imports) | ~661K ops/s |
-| `scanImports` (50 imports) | ~41K ops/s |
-| `stripComments` (1,000 lines) | ~2,497 ops/s |
+| Operation                     | Throughput    |
+| ----------------------------- | ------------- |
+| `scanImports` (3 imports)     | ~706K ops/s   |
+| `scanImports` (50 imports)    | ~79K ops/s    |
+| `stripComments` (1,000 lines) | ~12,337 ops/s |
 > Run `pnpm bench:run` to reproduce locally.
@@ -58,6 +58,12 @@ Each tool brings different strengths — [dependency-tree](https://github.com/de
 ```sh
 npm install importree
+# or
+pnpm add importree
+# or
+yarn add importree
+# or
+bun add importree
 ```
 Requires Node.js >= 18.
@@ -67,10 +73,10 @@ Requires Node.js >= 18.
 ### Build the tree
 ```ts
-import { importree } from 'importree';
+import { importree } from "importree";
-const tree = await importree('./src/index.ts', {
-  aliases: { '@': './src' },
+const tree = await importree("./src/index.ts", {
+  aliases: { "@": "./src" },
 });
 console.log(tree.files);
@@ -86,12 +92,12 @@ console.log(tree.graph);
 ### Find affected files
 ```ts
-import { importree, getAffectedFiles } from 'importree';
+import { importree, getAffectedFiles } from "importree";
-const tree = await importree('./src/index.ts');
+const tree = await importree("./src/index.ts");
 // When utils.ts changes, what needs rebuilding?
-const affected = getAffectedFiles(tree, './src/utils.ts');
+const affected = getAffectedFiles(tree, "./src/utils.ts");
 console.log(affected);
 // ['/abs/src/app.ts', '/abs/src/index.ts']
@@ -110,18 +116,18 @@ importree(entry: string, options?: ImportreeOptions): Promise<ImportTree>
 #### Parameters
-| Parameter | Type | Required | Description |
-|-----------|------|----------|-------------|
-| `entry` | `string` | Yes | Path to the entry file (resolved against `cwd`) |
-| `options` | `ImportreeOptions` | No | Configuration for resolution behavior |
+| Parameter | Type               | Required | Description                                     |
+| --------- | ------------------ | -------- | ----------------------------------------------- |
+| `entry`   | `string`           | Yes      | Path to the entry file (resolved against `cwd`) |
+| `options` | `ImportreeOptions` | No       | Configuration for resolution behavior           |
 #### `ImportreeOptions`
-| Option | Type | Default | Description |
-|--------|------|---------|-------------|
-| `rootDir` | `string` | `process.cwd()` | Root directory for resolving relative alias paths |
-| `aliases` | `Record<string, string>` | `{}` | Path alias mappings (e.g., `{ '@': './src' }`) |
-| `extensions` | `string[]` | `['.ts', '.tsx', '.js', '.jsx', '.mjs', '.cjs']` | File extensions to try when resolving extensionless imports |
+| Option       | Type                     | Default                                          | Description                                                 |
+| ------------ | ------------------------ | ------------------------------------------------ | ----------------------------------------------------------- |
+| `rootDir`    | `string`                 | `process.cwd()`                                  | Root directory for resolving relative alias paths           |
+| `aliases`    | `Record<string, string>` | `{}`                                             | Path alias mappings (e.g., `{ '@': './src' }`)              |
+| `extensions` | `string[]`               | `['.ts', '.tsx', '.js', '.jsx', '.mjs', '.cjs']` | File extensions to try when resolving extensionless imports |
 #### Returns
@@ -139,10 +145,10 @@ getAffectedFiles(tree: ImportTree, changedFile: string): string[]
 #### Parameters
-| Parameter | Type | Required | Description |
-|-----------|------|----------|-------------|
-| `tree` | `ImportTree` | Yes | A tree previously returned by `importree()` |
-| `changedFile` | `string` | Yes | Path to the file that changed (resolved to absolute) |
+| Parameter     | Type         | Required | Description                                          |
+| ------------- | ------------ | -------- | ---------------------------------------------------- |
+| `tree`        | `ImportTree` | Yes      | A tree previously returned by `importree()`          |
+| `changedFile` | `string`     | Yes      | Path to the file that changed (resolved to absolute) |
 #### Returns
@@ -154,13 +160,13 @@ getAffectedFiles(tree: ImportTree, changedFile: string): string[]
 The result object returned by `importree()`.
-| Field | Type | Description |
-|-------|------|-------------|
-| `entrypoint` | `string` | Absolute path of the entry file |
-| `files` | `string[]` | Sorted absolute paths of all local files in the dependency tree |
-| `externals` | `string[]` | Sorted unique bare import specifiers — packages like `react`, `lodash`, `node:fs` |
-| `graph` | `Record<string, string[]>` | Forward adjacency list. Each file maps to its direct local imports. |
-| `reverseGraph` | `Record<string, string[]>` | Reverse adjacency list. Each file maps to files that import it. |
+| Field          | Type                       | Description                                                                       |
+| -------------- | -------------------------- | --------------------------------------------------------------------------------- |
+| `entrypoint`   | `string`                   | Absolute path of the entry file                                                   |
+| `files`        | `string[]`                 | Sorted absolute paths of all local files in the dependency tree                   |
+| `externals`    | `string[]`                 | Sorted unique bare import specifiers — packages like `react`, `lodash`, `node:fs` |
+| `graph`        | `Record<string, string[]>` | Forward adjacency list. Each file maps to its direct local imports.               |
+| `reverseGraph` | `Record<string, string[]>` | Reverse adjacency list. Each file maps to files that import it.                   |
 ## What gets detected

package/dist/index.cjs CHANGED Viewed

@@ -1,101 +1,88 @@
 Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
-let node_path = require("node:path");
-let node_fs_promises = require("node:fs/promises");
 let node_fs = require("node:fs");
+let node_path = require("node:path");
 //#region src/scanner.ts
 /**
 * Strips comments from source code while preserving string literals.
 *
-* Comments are replaced with spaces (preserving newlines). Strings and
+* Line comments (`//`) are removed entirely. Block comments are replaced
+* with a single space (newlines within them are preserved). Strings and
 * template literals are left intact so that import specifiers inside
 * `from 'specifier'` remain extractable. The function correctly handles
 * comment-like sequences inside strings (e.g., `'//'` won't start a comment).
 */
 function stripComments(code) {
 	const len = code.length;
-	const result = new Array(len);
+	const parts = [];
 	let i = 0;
+	let segStart = 0;
 	while (i < len) {
 		const ch = code[i];
 		const next = i + 1 < len ? code[i + 1] : "";
 		if (ch === "/" && next === "/") {
-			result[i++] = " ";
-			result[i++] = " ";
-			while (i < len && code[i] !== "\n") result[i++] = " ";
+			parts.push(code.slice(segStart, i));
+			while (i < len && code[i] !== "\n") i++;
+			segStart = i;
 			continue;
 		}
 		if (ch === "/" && next === "*") {
-			result[i++] = " ";
-			result[i++] = " ";
+			parts.push(code.slice(segStart, i));
+			i += 2;
 			while (i < len && !(code[i] === "*" && i + 1 < len && code[i + 1] === "/")) {
-				result[i] = code[i] === "\n" ? "\n" : " ";
+				if (code[i] === "\n") parts.push("\n");
 				i++;
 			}
-			if (i < len) {
-				result[i++] = " ";
-				result[i++] = " ";
-			}
+			if (i < len) i += 2;
+			parts.push(" ");
+			segStart = i;
 			continue;
 		}
 		if (ch === "'" || ch === "\"") {
 			const quote = ch;
-			result[i] = code[i];
 			i++;
-			while (i < len && code[i] !== quote) if (code[i] === "\\" && i + 1 < len) {
-				result[i] = code[i];
-				i++;
-				result[i] = code[i];
-				i++;
-			} else {
-				result[i] = code[i];
-				i++;
-			}
-			if (i < len) {
-				result[i] = code[i];
+			while (i < len && code[i] !== quote) {
+				if (code[i] === "\\" && i + 1 < len) i++;
 				i++;
 			}
+			if (i < len) i++;
 			continue;
 		}
 		if (ch === "`") {
-			result[i] = code[i];
 			i++;
 			let depth = 0;
-			while (i < len) if (code[i] === "\\" && i + 1 < len) {
-				result[i] = code[i];
-				i++;
-				result[i] = code[i];
-				i++;
-			} else if (code[i] === "$" && i + 1 < len && code[i + 1] === "{") {
-				result[i] = code[i];
-				i++;
-				result[i] = code[i];
-				i++;
+			while (i < len) if (code[i] === "\\" && i + 1 < len) i += 2;
+			else if (code[i] === "$" && i + 1 < len && code[i + 1] === "{") {
+				i += 2;
 				depth++;
 			} else if (code[i] === "}" && depth > 0) {
-				result[i] = code[i];
 				i++;
 				depth--;
 			} else if (code[i] === "`" && depth === 0) {
-				result[i] = code[i];
 				i++;
 				break;
-			} else {
-				result[i] = code[i];
-				i++;
-			}
+			} else i++;
 			continue;
 		}
-		result[i] = ch;
 		i++;
 	}
-	return result.join("");
+	parts.push(code.slice(segStart));
+	return parts.join("");
 }
-const fromRe = /\bfrom\s+['"]([^'"]+)['"]/g;
+const nsImportRe = /\bimport\s+\*\s+as\s+[$\w]+\s+from\s+['"]([^'"]+)['"]/g;
+const namedImportRe = /\bimport\s+(?:type\s+)?(?:([$\w]+)\s*,\s*)?\{([^}]*)\}\s+from\s+['"]([^'"]+)['"]/g;
+const defaultImportRe = /\bimport\s+(?:type\s+)?([$\w]+)\s+from\s+['"]([^'"]+)['"]/g;
+const reexportStarRe = /\bexport\s+\*\s+(?:as\s+[$\w]+\s+)?from\s+['"]([^'"]+)['"]/g;
+const reexportNamedRe = /\bexport\s+(?:type\s+)?\{([^}]*)\}\s+from\s+['"]([^'"]+)['"]/g;
 const sideEffectRe = /\bimport\s+['"]([^'"]+)['"]/g;
 const dynamicRe = /\bimport\s*\(\s*['"]([^'"]+)['"]\s*\)/g;
 const requireRe = /\brequire\s*\(\s*['"]([^'"]+)['"]\s*\)/g;
+function parseSpecifiers(clause) {
+	return clause.split(",").map((s) => s.trim()).filter(Boolean).map((s) => {
+		return s.replace(/^type\s+/, "").split(/\s+as\s+/)[0].trim();
+	}).filter(Boolean);
+}
 /**
-* Scans source code and extracts all import/require specifiers.
+* Scans source code and extracts all imports with metadata.
 *
 * Handles: static imports, dynamic imports, require(), re-exports.
 * Ignores imports inside comments. Imports inside string literals may
@@ -104,12 +91,41 @@ const requireRe = /\brequire\s*\(\s*['"]([^'"]+)['"]\s*\)/g;
 */
 function scanImports(code) {
 	const stripped = stripComments(code);
-	const specifiers = /* @__PURE__ */ new Set();
-	for (const m of stripped.matchAll(fromRe)) specifiers.add(m[1]);
-	for (const m of stripped.matchAll(sideEffectRe)) specifiers.add(m[1]);
-	for (const m of stripped.matchAll(dynamicRe)) specifiers.add(m[1]);
-	for (const m of stripped.matchAll(requireRe)) specifiers.add(m[1]);
-	return [...specifiers];
+	const results = [];
+	for (const m of stripped.matchAll(nsImportRe)) results.push({
+		path: m[1],
+		isNamespace: true
+	});
+	for (const m of stripped.matchAll(namedImportRe)) {
+		const specifiers = parseSpecifiers(m[2]);
+		if (m[1]) specifiers.unshift("default");
+		results.push({
+			path: m[3],
+			specifiers
+		});
+	}
+	for (const m of stripped.matchAll(defaultImportRe)) results.push({
+		path: m[2],
+		specifiers: ["default"]
+	});
+	for (const m of stripped.matchAll(reexportStarRe)) results.push({
+		path: m[1],
+		isNamespace: true
+	});
+	for (const m of stripped.matchAll(reexportNamedRe)) results.push({
+		path: m[2],
+		specifiers: parseSpecifiers(m[1])
+	});
+	for (const m of stripped.matchAll(sideEffectRe)) results.push({
+		path: m[1],
+		isSideEffect: true
+	});
+	for (const m of stripped.matchAll(dynamicRe)) results.push({
+		path: m[1],
+		isDynamic: true
+	});
+	for (const m of stripped.matchAll(requireRe)) results.push({ path: m[1] });
+	return results;
 }
 //#endregion
 //#region src/resolver.ts
@@ -193,9 +209,43 @@ function createResolver(basedir, options) {
 }
 //#endregion
 //#region src/walker.ts
+function buildEdges(rawImports, resolveSpecifier, filePath) {
+	const edges = [];
+	const externals = [];
+	for (const raw of rawImports) {
+		const resolved = resolveSpecifier(raw.path, filePath);
+		if (!resolved) continue;
+		if (resolved.type === "external" && resolved.specifier) externals.push(resolved.specifier);
+		else if (resolved.type === "local" && resolved.absolutePath) {
+			const existing = edges.find((e) => e.path === resolved.absolutePath);
+			if (existing) {
+				if (raw.isNamespace) {
+					existing.isNamespace = true;
+					existing.specifiers = void 0;
+					existing.isSideEffect = void 0;
+				} else if (raw.specifiers && !existing.isNamespace) {
+					(existing.specifiers ??= []).push(...raw.specifiers);
+					existing.isSideEffect = void 0;
+				}
+				if (raw.isSideEffect && !existing.specifiers && !existing.isNamespace) existing.isSideEffect = true;
+				if (raw.isDynamic) existing.isDynamic = true;
+			} else edges.push({
+				path: resolved.absolutePath,
+				specifiers: raw.specifiers,
+				isNamespace: raw.isNamespace,
+				isDynamic: raw.isDynamic,
+				isSideEffect: raw.isSideEffect
+			});
+		}
+	}
+	return {
+		edges,
+		externals
+	};
+}
 /**
-* Recursively walks imports starting from an entry file and builds
-* the full dependency tree.
+* Walks imports starting from an entry file and builds the full dependency tree.
+* Uses iterative DFS with an explicit stack to avoid call-stack limits on deep chains.
 */
 async function walk(entryFile, options) {
 	const entrypoint = (0, node_path.resolve)(entryFile);
@@ -203,26 +253,27 @@ async function walk(entryFile, options) {
 	const graph = {};
 	const externals = /* @__PURE__ */ new Set();
 	const visited = /* @__PURE__ */ new Set();
-	async function visit(filePath) {
-		if (visited.has(filePath)) return;
+	const stack = [entrypoint];
+	while (stack.length > 0) {
+		const filePath = stack.pop();
+		if (visited.has(filePath)) continue;
 		visited.add(filePath);
-		const specifiers = scanImports(await (0, node_fs_promises.readFile)(filePath, "utf-8"));
-		const localDeps = [];
-		for (const spec of specifiers) {
-			const resolved = resolveSpecifier(spec, filePath);
-			if (!resolved) continue;
-			if (resolved.type === "external" && resolved.specifier) externals.add(resolved.specifier);
-			else if (resolved.type === "local" && resolved.absolutePath) localDeps.push(resolved.absolutePath);
-		}
-		graph[filePath] = localDeps;
-		await Promise.all(localDeps.map((dep) => visit(dep)));
+		const { edges, externals: fileExternals } = buildEdges(scanImports((0, node_fs.readFileSync)(filePath, "utf-8")), resolveSpecifier, filePath);
+		for (const ext of fileExternals) externals.add(ext);
+		graph[filePath] = edges;
+		for (const edge of edges) stack.push(edge.path);
 	}
-	await visit(entrypoint);
 	const reverseGraph = {};
 	for (const file of Object.keys(graph)) reverseGraph[file] = [];
-	for (const [file, deps] of Object.entries(graph)) for (const dep of deps) {
-		if (!reverseGraph[dep]) reverseGraph[dep] = [];
-		reverseGraph[dep].push(file);
+	for (const [file, edges] of Object.entries(graph)) for (const edge of edges) {
+		if (!reverseGraph[edge.path]) reverseGraph[edge.path] = [];
+		reverseGraph[edge.path].push({
+			path: file,
+			specifiers: edge.specifiers,
+			isNamespace: edge.isNamespace,
+			isDynamic: edge.isDynamic,
+			isSideEffect: edge.isSideEffect
+		});
 	}
 	return {
 		entrypoint,
@@ -255,6 +306,26 @@ async function importree(entry, options) {
 	return walk(entry, options ?? {});
 }
 /**
+* Parses a single file and returns its direct import edges without recursive traversal.
+*
+* @example
+* ```ts
+* const edges = parseImports('./src/components/Button.tsx', {
+*   aliases: { '@': './src' },
+* });
+*
+* for (const edge of edges) {
+*   console.log(edge.path, edge.specifiers);
+* }
+* ```
+*/
+function parseImports(filePath, options) {
+	const absolutePath = (0, node_path.resolve)(filePath);
+	const resolveSpecifier = createResolver(options?.rootDir ? (0, node_path.resolve)(options.rootDir) : process.cwd(), options ?? {});
+	const { edges } = buildEdges(scanImports((0, node_fs.readFileSync)(absolutePath, "utf-8")), resolveSpecifier, absolutePath);
+	return edges;
+}
+/**
 * Given an import tree and a changed file, returns all files that
 * transitively depend on the changed file (i.e., files that would
 * need to be re-evaluated if the changed file is modified).
@@ -270,9 +341,9 @@ function getAffectedFiles(tree, changedFile) {
 		const current = queue.shift();
 		const dependents = tree.reverseGraph[current];
 		if (!dependents) continue;
-		for (const parent of dependents) if (!affected.has(parent)) {
-			affected.add(parent);
-			queue.push(parent);
+		for (const edge of dependents) if (!affected.has(edge.path)) {
+			affected.add(edge.path);
+			queue.push(edge.path);
 		}
 	}
 	affected.delete(absolute);
@@ -281,5 +352,6 @@ function getAffectedFiles(tree, changedFile) {
 //#endregion
 exports.getAffectedFiles = getAffectedFiles;
 exports.importree = importree;
+exports.parseImports = parseImports;
 //# sourceMappingURL=index.cjs.map

package/dist/index.cjs.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"index.cjs","names":[],"sources":["../src/scanner.ts","../src/resolver.ts","../src/walker.ts","../src/index.ts"],"sourcesContent":["/*\n Strips comments from source code while preserving string literals.\n \n Comments are replaced with spaces (preserving newlines). Strings and\n * template literals are left intact so that import specifiers inside\n * `from 'specifier'` remain extractable. The function correctly handles\n * comment-like sequences inside strings (e.g., `'//'` won't start a comment).\n /\nexport function stripComments(code: string): string {\n const len = code.length;\n const result: string[] = new Array(len);\n let i = 0;\n\n while (i < len) {\n const ch = code[i];\n const next = i + 1 < len ? code[i + 1] : '';\n\n // Line comment → blank to end of line\n if (ch === '/' && next === '/') {\n result[i++] = ' ';\n result[i++] = ' ';\n while (i < len && code[i] !== '\\n') {\n result[i++] = ' ';\n }\n continue;\n }\n\n // Block comment → blank to closing /\n if (ch === '/' && next === '') {\n result[i++] = ' ';\n result[i++] = ' ';\n while (i < len && !(code[i] === '' && i + 1 < len && code[i + 1] === '/')) {\n result[i] = code[i] === '\\n' ? '\\n' : ' ';\n i++;\n }\n if (i < len) {\n result[i++] = ' '; // \n result[i++] = ' '; // /\n }\n continue;\n }\n\n // Single or double quoted string — copy verbatim (skip past to avoid\n // misidentifying comment markers inside strings)\n if (ch === \"'\" \|\| ch === '\"') {\n const quote = ch;\n result[i] = code[i];\n i++;\n while (i < len && code[i] !== quote) {\n if (code[i] === '\\\\' && i + 1 < len) {\n result[i] = code[i];\n i++;\n result[i] = code[i];\n i++;\n } else {\n result[i] = code[i];\n i++;\n }\n }\n if (i < len) {\n result[i] = code[i];\n i++;\n }\n continue;\n }\n\n // Template literal — copy verbatim, handling ${} nesting\n if (ch === '`') {\n result[i] = code[i];\n i++;\n let depth = 0;\n while (i < len) {\n if (code[i] === '\\\\' && i + 1 < len) {\n result[i] = code[i];\n i++;\n result[i] = code[i];\n i++;\n } else if (code[i] === '$' && i + 1 < len && code[i + 1] === '{') {\n result[i] = code[i];\n i++;\n result[i] = code[i];\n i++;\n depth++;\n } else if (code[i] === '}' && depth > 0) {\n result[i] = code[i];\n i++;\n depth--;\n } else if (code[i] === '`' && depth === 0) {\n result[i] = code[i];\n i++;\n break;\n } else {\n result[i] = code[i];\n i++;\n }\n }\n continue;\n }\n\n // Regular character\n result[i] = ch;\n i++;\n }\n\n return result.join('');\n}\n\n// Static regex patterns — compiled once\nconst fromRe = /\\bfrom\\s+['\"]([^'\"]+)['\"]/g;\nconst sideEffectRe = /\\bimport\\s+['\"]([^'\"]+)['\"]/g;\nconst dynamicRe = /\\bimport\\s\$\\s['\"]([^'\"]+)['\"]\\s\$/g;\nconst requireRe = /\\brequire\\s\$\\s['\"]([^'\"]+)['\"]\\s\$/g;\n\n/\n Scans source code and extracts all import/require specifiers.\n \n Handles: static imports, dynamic imports, require(), re-exports.\n * Ignores imports inside comments. Imports inside string literals may\n * produce false positives, but unresolvable paths are silently skipped\n * by the resolver.\n /\nexport function scanImports(code: string): string[] {\n const stripped = stripComments(code);\n const specifiers = new Set<string>();\n\n for (const m of stripped.matchAll(fromRe)) specifiers.add(m[1]);\n for (const m of stripped.matchAll(sideEffectRe)) specifiers.add(m[1]);\n for (const m of stripped.matchAll(dynamicRe)) specifiers.add(m[1]);\n for (const m of stripped.matchAll(requireRe)) specifiers.add(m[1]);\n\n return [...specifiers];\n}\n","import { statSync } from 'node:fs';\nimport { dirname, join, resolve, isAbsolute } from 'node:path';\nimport type { ImportreeOptions, ResolvedImport } from './types.js';\n\nconst DEFAULT_EXTENSIONS = ['.ts', '.tsx', '.js', '.jsx', '.mjs', '.cjs'];\n\nfunction fileExists(filePath: string): boolean {\n const stat = statSync(filePath, { throwIfNoEntry: false });\n return stat !== undefined && stat.isFile();\n}\n\nfunction dirExists(filePath: string): boolean {\n const stat = statSync(filePath, { throwIfNoEntry: false });\n return stat !== undefined && stat.isDirectory();\n}\n\n/\n Extract the bare package name from an import specifier.\n * - Scoped: `@scope/pkg/path` → `@scope/pkg`\n * - Unscoped: `pkg/path` → `pkg`\n /\nfunction getBareSpecifier(specifier: string): string {\n if (specifier.startsWith('@')) {\n const parts = specifier.split('/');\n return parts.length >= 2 ? `${parts[0]}/${parts[1]}` : specifier;\n }\n return specifier.split('/')[0];\n}\n\nfunction resolveFile(\n filePath: string,\n extensions: string[],\n): string \| undefined {\n // Try exact path\n if (fileExists(filePath)) return filePath;\n\n // Try with each extension\n for (const ext of extensions) {\n const withExt = filePath + ext;\n if (fileExists(withExt)) return withExt;\n }\n\n // Try as directory with index file\n if (dirExists(filePath)) {\n for (const ext of extensions) {\n const indexPath = join(filePath, `index${ext}`);\n if (fileExists(indexPath)) return indexPath;\n }\n }\n\n return undefined;\n}\n\nexport interface Resolver {\n (specifier: string, fromFile: string): ResolvedImport \| undefined;\n}\n\n/\n Creates a resolver function that resolves import specifiers to absolute\n * file paths, with support for aliases and extension probing.\n /\nexport function createResolver(\n basedir: string,\n options: ImportreeOptions,\n): Resolver {\n const extensions = options.extensions ?? DEFAULT_EXTENSIONS;\n\n // Sort aliases by key length descending for longest-prefix matching\n const aliases = options.aliases\n ? Object.entries(options.aliases).sort((a, b) => b[0].length - a[0].length)\n : [];\n\n const resolvedAliasValues = aliases.map(([key, value]) => [\n key,\n isAbsolute(value) ? value : resolve(basedir, value),\n ] as const);\n\n const cache = new Map<string, ResolvedImport \| undefined>();\n\n return function resolveSpecifier(\n specifier: string,\n fromFile: string,\n ): ResolvedImport \| undefined {\n const fromDir = dirname(fromFile);\n const cacheKey = `${specifier}\\0${fromDir}`;\n\n if (cache.has(cacheKey)) return cache.get(cacheKey);\n\n let result: ResolvedImport \| undefined;\n\n // Relative import\n if (specifier.startsWith('./') \|\| specifier.startsWith('../')) {\n const absolutePath = resolveFile(resolve(fromDir, specifier), extensions);\n if (absolutePath) {\n result = { type: 'local', absolutePath };\n }\n }\n // Check aliases\n else {\n let matched = false;\n for (const [prefix, replacement] of resolvedAliasValues) {\n if (specifier === prefix \|\| specifier.startsWith(prefix + '/')) {\n const rest = specifier === prefix ? '' : specifier.slice(prefix.length);\n const absolutePath = resolveFile(join(replacement, rest), extensions);\n if (absolutePath) {\n result = { type: 'local', absolutePath };\n }\n matched = true;\n break;\n }\n }\n\n // Bare specifier → external\n if (!matched) {\n result = { type: 'external', specifier: getBareSpecifier(specifier) };\n }\n }\n\n cache.set(cacheKey, result);\n return result;\n };\n}\n","import { readFile } from 'node:fs/promises';\nimport { resolve } from 'node:path';\nimport type { ImportreeOptions, ImportTree } from './types.js';\nimport { scanImports } from './scanner.js';\nimport { createResolver } from './resolver.js';\n\n/\n Recursively walks imports starting from an entry file and builds\n * the full dependency tree.\n /\nexport async function walk(\n entryFile: string,\n options: ImportreeOptions,\n): Promise<ImportTree> {\n const entrypoint = resolve(entryFile);\n const basedir = options.rootDir ? resolve(options.rootDir) : process.cwd();\n const resolveSpecifier = createResolver(basedir, options);\n\n const graph: Record<string, string[]> = {};\n const externals = new Set<string>();\n const visited = new Set<string>();\n\n async function visit(filePath: string): Promise<void> {\n if (visited.has(filePath)) return;\n visited.add(filePath);\n\n const content = await readFile(filePath, 'utf-8');\n const specifiers = scanImports(content);\n\n const localDeps: string[] = [];\n for (const spec of specifiers) {\n const resolved = resolveSpecifier(spec, filePath);\n if (!resolved) continue;\n\n if (resolved.type === 'external' && resolved.specifier) {\n externals.add(resolved.specifier);\n } else if (resolved.type === 'local' && resolved.absolutePath) {\n localDeps.push(resolved.absolutePath);\n }\n }\n\n graph[filePath] = localDeps;\n\n await Promise.all(localDeps.map((dep) => visit(dep)));\n }\n\n await visit(entrypoint);\n\n // Build reverse graph\n const reverseGraph: Record<string, string[]> = {};\n for (const file of Object.keys(graph)) {\n reverseGraph[file] = [];\n }\n for (const [file, deps] of Object.entries(graph)) {\n for (const dep of deps) {\n if (!reverseGraph[dep]) reverseGraph[dep] = [];\n reverseGraph[dep].push(file);\n }\n }\n\n return {\n entrypoint,\n files: Object.keys(graph).sort(),\n externals: [...externals].sort(),\n graph,\n reverseGraph,\n };\n}\n","import { resolve } from 'node:path';\nimport type { ImportreeOptions, ImportTree } from './types.js';\nimport { walk } from './walker.js';\n\nexport type { ImportreeOptions, ImportTree } from './types.js';\n\n/\n Builds a full import dependency tree starting from an entry file.\n \n Recursively resolves all static imports, dynamic imports, require() calls,\n * and re-exports. Supports path aliases for custom resolution.\n \n @example\n * ```ts\n * const tree = await importree('./src/index.ts', {\n * aliases: { '@': './src' },\n * });\n \n console.log(tree.files); // all local dependency file paths\n * console.log(tree.externals); // external package names\n * console.log(tree.graph); // file → direct dependencies\n * ```\n /\nexport async function importree(\n entry: string,\n options?: ImportreeOptions,\n): Promise<ImportTree> {\n return walk(entry, options ?? {});\n}\n\n/\n Given an import tree and a changed file, returns all files that\n * transitively depend on the changed file (i.e., files that would\n * need to be re-evaluated if the changed file is modified).\n \n The changed file itself is NOT included in the result.\n */\nexport function getAffectedFiles(\n tree: ImportTree,\n changedFile: string,\n): string[] {\n const absolute = resolve(changedFile);\n\n if (!tree.reverseGraph[absolute]) return [];\n\n const affected = new Set<string>();\n const queue = [absolute];\n\n while (queue.length > 0) {\n const current = queue.shift()!;\n const dependents = tree.reverseGraph[current];\n if (!dependents) continue;\n\n for (const parent of dependents) {\n if (!affected.has(parent)) {\n affected.add(parent);\n queue.push(parent);\n }\n }\n }\n\n affected.delete(absolute);\n return [...affected].sort();\n}\n"],"mappings":";;;;;;;;;;;;;AAQA,SAAgB,cAAc,MAAsB;CAClD,MAAM,MAAM,KAAK;CACjB,MAAM,SAAmB,IAAI,MAAM,IAAI;CACvC,IAAI,IAAI;AAER,QAAO,IAAI,KAAK;EACd,MAAM,KAAK,KAAK;EAChB,MAAM,OAAO,IAAI,IAAI,MAAM,KAAK,IAAI,KAAK;AAGzC,MAAI,OAAO,OAAO,SAAS,KAAK;AAC9B,UAAO,OAAO;AACd,UAAO,OAAO;AACd,UAAO,IAAI,OAAO,KAAK,OAAO,KAC5B,QAAO,OAAO;AAEhB;;AAIF,MAAI,OAAO,OAAO,SAAS,KAAK;AAC9B,UAAO,OAAO;AACd,UAAO,OAAO;AACd,UAAO,IAAI,OAAO,EAAE,KAAK,OAAO,OAAO,IAAI,IAAI,OAAO,KAAK,IAAI,OAAO,MAAM;AAC1E,WAAO,KAAK,KAAK,OAAO,OAAO,OAAO;AACtC;;AAEF,OAAI,IAAI,KAAK;AACX,WAAO,OAAO;AACd,WAAO,OAAO;;AAEhB;;AAKF,MAAI,OAAO,OAAO,OAAO,MAAK;GAC5B,MAAM,QAAQ;AACd,UAAO,KAAK,KAAK;AACjB;AACA,UAAO,IAAI,OAAO,KAAK,OAAO,MAC5B,KAAI,KAAK,OAAO,QAAQ,IAAI,IAAI,KAAK;AACnC,WAAO,KAAK,KAAK;AACjB;AACA,WAAO,KAAK,KAAK;AACjB;UACK;AACL,WAAO,KAAK,KAAK;AACjB;;AAGJ,OAAI,IAAI,KAAK;AACX,WAAO,KAAK,KAAK;AACjB;;AAEF;;AAIF,MAAI,OAAO,KAAK;AACd,UAAO,KAAK,KAAK;AACjB;GACA,IAAI,QAAQ;AACZ,UAAO,IAAI,IACT,KAAI,KAAK,OAAO,QAAQ,IAAI,IAAI,KAAK;AACnC,WAAO,KAAK,KAAK;AACjB;AACA,WAAO,KAAK,KAAK;AACjB;cACS,KAAK,OAAO,OAAO,IAAI,IAAI,OAAO,KAAK,IAAI,OAAO,KAAK;AAChE,WAAO,KAAK,KAAK;AACjB;AACA,WAAO,KAAK,KAAK;AACjB;AACA;cACS,KAAK,OAAO,OAAO,QAAQ,GAAG;AACvC,WAAO,KAAK,KAAK;AACjB;AACA;cACS,KAAK,OAAO,OAAO,UAAU,GAAG;AACzC,WAAO,KAAK,KAAK;AACjB;AACA;UACK;AACL,WAAO,KAAK,KAAK;AACjB;;AAGJ;;AAIF,SAAO,KAAK;AACZ;;AAGF,QAAO,OAAO,KAAK,GAAG;;AAIxB,MAAM,SAAS;AACf,MAAM,eAAe;AACrB,MAAM,YAAY;AAClB,MAAM,YAAY;;;;;;;;;AAUlB,SAAgB,YAAY,MAAwB;CAClD,MAAM,WAAW,cAAc,KAAK;CACpC,MAAM,6BAAa,IAAI,KAAa;AAEpC,MAAK,MAAM,KAAK,SAAS,SAAS,OAAO,CAAE,YAAW,IAAI,EAAE,GAAG;AAC/D,MAAK,MAAM,KAAK,SAAS,SAAS,aAAa,CAAE,YAAW,IAAI,EAAE,GAAG;AACrE,MAAK,MAAM,KAAK,SAAS,SAAS,UAAU,CAAE,YAAW,IAAI,EAAE,GAAG;AAClE,MAAK,MAAM,KAAK,SAAS,SAAS,UAAU,CAAE,YAAW,IAAI,EAAE,GAAG;AAElE,QAAO,CAAC,GAAG,WAAW;;;;AC9HxB,MAAM,qBAAqB;CAAC;CAAO;CAAQ;CAAO;CAAQ;CAAQ;CAAO;AAEzE,SAAS,WAAW,UAA2B;CAC7C,MAAM,QAAA,GAAA,QAAA,UAAgB,UAAU,EAAE,gBAAgB,OAAO,CAAC;AAC1D,QAAO,SAAS,KAAA,KAAa,KAAK,QAAQ;;AAG5C,SAAS,UAAU,UAA2B;CAC5C,MAAM,QAAA,GAAA,QAAA,UAAgB,UAAU,EAAE,gBAAgB,OAAO,CAAC;AAC1D,QAAO,SAAS,KAAA,KAAa,KAAK,aAAa;;;;;;;AAQjD,SAAS,iBAAiB,WAA2B;AACnD,KAAI,UAAU,WAAW,IAAI,EAAE;EAC7B,MAAM,QAAQ,UAAU,MAAM,IAAI;AAClC,SAAO,MAAM,UAAU,IAAI,GAAG,MAAM,GAAG,GAAG,MAAM,OAAO;;AAEzD,QAAO,UAAU,MAAM,IAAI,CAAC;;AAG9B,SAAS,YACP,UACA,YACoB;AAEpB,KAAI,WAAW,SAAS,CAAE,QAAO;AAGjC,MAAK,MAAM,OAAO,YAAY;EAC5B,MAAM,UAAU,WAAW;AAC3B,MAAI,WAAW,QAAQ,CAAE,QAAO;;AAIlC,KAAI,UAAU,SAAS,CACrB,MAAK,MAAM,OAAO,YAAY;EAC5B,MAAM,aAAA,GAAA,UAAA,MAAiB,UAAU,QAAQ,MAAM;AAC/C,MAAI,WAAW,UAAU,CAAE,QAAO;;;;;;;AAexC,SAAgB,eACd,SACA,SACU;CACV,MAAM,aAAa,QAAQ,cAAc;CAOzC,MAAM,uBAJU,QAAQ,UACpB,OAAO,QAAQ,QAAQ,QAAQ,CAAC,MAAM,GAAG,MAAM,EAAE,GAAG,SAAS,EAAE,GAAG,OAAO,GACzE,EAAE,EAE8B,KAAK,CAAC,KAAK,WAAW,CACxD,MAAA,GAAA,UAAA,YACW,MAAM,GAAG,SAAA,GAAA,UAAA,SAAgB,SAAS,MAAM,CACpD,CAAU;CAEX,MAAM,wBAAQ,IAAI,KAAyC;AAE3D,QAAO,SAAS,iBACd,WACA,UAC4B;EAC5B,MAAM,WAAA,GAAA,UAAA,SAAkB,SAAS;EACjC,MAAM,WAAW,GAAG,UAAU,IAAI;AAElC,MAAI,MAAM,IAAI,SAAS,CAAE,QAAO,MAAM,IAAI,SAAS;EAEnD,IAAI;AAGJ,MAAI,UAAU,WAAW,KAAK,IAAI,UAAU,WAAW,MAAM,EAAE;GAC7D,MAAM,eAAe,aAAA,GAAA,UAAA,SAAoB,SAAS,UAAU,EAAE,WAAW;AACzE,OAAI,aACF,UAAS;IAAE,MAAM;IAAS;IAAc;SAIvC;GACH,IAAI,UAAU;AACd,QAAK,MAAM,CAAC,QAAQ,gBAAgB,oBAClC,KAAI,cAAc,UAAU,UAAU,WAAW,SAAS,IAAI,EAAE;IAE9D,MAAM,eAAe,aAAA,GAAA,UAAA,MAAiB,aADzB,cAAc,SAAS,KAAK,UAAU,MAAM,OAAO,OAAO,CACf,EAAE,WAAW;AACrE,QAAI,aACF,UAAS;KAAE,MAAM;KAAS;KAAc;AAE1C,cAAU;AACV;;AAKJ,OAAI,CAAC,QACH,UAAS;IAAE,MAAM;IAAY,WAAW,iBAAiB,UAAU;IAAE;;AAIzE,QAAM,IAAI,UAAU,OAAO;AAC3B,SAAO;;;;;;;;;AC7GX,eAAsB,KACpB,WACA,SACqB;CACrB,MAAM,cAAA,GAAA,UAAA,SAAqB,UAAU;CAErC,MAAM,mBAAmB,eADT,QAAQ,WAAA,GAAA,UAAA,SAAkB,QAAQ,QAAQ,GAAG,QAAQ,KAAK,EACzB,QAAQ;CAEzD,MAAM,QAAkC,EAAE;CAC1C,MAAM,4BAAY,IAAI,KAAa;CACnC,MAAM,0BAAU,IAAI,KAAa;CAEjC,eAAe,MAAM,UAAiC;AACpD,MAAI,QAAQ,IAAI,SAAS,CAAE;AAC3B,UAAQ,IAAI,SAAS;EAGrB,MAAM,aAAa,YADH,OAAA,GAAA,iBAAA,UAAe,UAAU,QAAQ,CACV;EAEvC,MAAM,YAAsB,EAAE;AAC9B,OAAK,MAAM,QAAQ,YAAY;GAC7B,MAAM,WAAW,iBAAiB,MAAM,SAAS;AACjD,OAAI,CAAC,SAAU;AAEf,OAAI,SAAS,SAAS,cAAc,SAAS,UAC3C,WAAU,IAAI,SAAS,UAAU;YACxB,SAAS,SAAS,WAAW,SAAS,aAC/C,WAAU,KAAK,SAAS,aAAa;;AAIzC,QAAM,YAAY;AAElB,QAAM,QAAQ,IAAI,UAAU,KAAK,QAAQ,MAAM,IAAI,CAAC,CAAC;;AAGvD,OAAM,MAAM,WAAW;CAGvB,MAAM,eAAyC,EAAE;AACjD,MAAK,MAAM,QAAQ,OAAO,KAAK,MAAM,CACnC,cAAa,QAAQ,EAAE;AAEzB,MAAK,MAAM,CAAC,MAAM,SAAS,OAAO,QAAQ,MAAM,CAC9C,MAAK,MAAM,OAAO,MAAM;AACtB,MAAI,CAAC,aAAa,KAAM,cAAa,OAAO,EAAE;AAC9C,eAAa,KAAK,KAAK,KAAK;;AAIhC,QAAO;EACL;EACA,OAAO,OAAO,KAAK,MAAM,CAAC,MAAM;EAChC,WAAW,CAAC,GAAG,UAAU,CAAC,MAAM;EAChC;EACA;EACD;;;;;;;;;;;;;;;;;;;;;AC3CH,eAAsB,UACpB,OACA,SACqB;AACrB,QAAO,KAAK,OAAO,WAAW,EAAE,CAAC;;;;;;;;;AAUnC,SAAgB,iBACd,MACA,aACU;CACV,MAAM,YAAA,GAAA,UAAA,SAAmB,YAAY;AAErC,KAAI,CAAC,KAAK,aAAa,UAAW,QAAO,EAAE;CAE3C,MAAM,2BAAW,IAAI,KAAa;CAClC,MAAM,QAAQ,CAAC,SAAS;AAExB,QAAO,MAAM,SAAS,GAAG;EACvB,MAAM,UAAU,MAAM,OAAO;EAC7B,MAAM,aAAa,KAAK,aAAa;AACrC,MAAI,CAAC,WAAY;AAEjB,OAAK,MAAM,UAAU,WACnB,KAAI,CAAC,SAAS,IAAI,OAAO,EAAE;AACzB,YAAS,IAAI,OAAO;AACpB,SAAM,KAAK,OAAO;;;AAKxB,UAAS,OAAO,SAAS;AACzB,QAAO,CAAC,GAAG,SAAS,CAAC,MAAM"}
1	+ {"version":3,"file":"index.cjs","names":[],"sources":["../src/scanner.ts","../src/resolver.ts","../src/walker.ts","../src/index.ts"],"sourcesContent":["/*\n Strips comments from source code while preserving string literals.\n \n Line comments (`//`) are removed entirely. Block comments are replaced\n * with a single space (newlines within them are preserved). Strings and\n * template literals are left intact so that import specifiers inside\n * `from 'specifier'` remain extractable. The function correctly handles\n * comment-like sequences inside strings (e.g., `'//'` won't start a comment).\n /\nexport function stripComments(code: string): string {\n const len = code.length;\n const parts: string[] = [];\n let i = 0;\n let segStart = 0;\n\n while (i < len) {\n const ch = code[i];\n const next = i + 1 < len ? code[i + 1] : \"\";\n\n if (ch === \"/\" && next === \"/\") {\n parts.push(code.slice(segStart, i));\n while (i < len && code[i] !== \"\\n\") i++;\n segStart = i;\n continue;\n }\n\n if (ch === \"/\" && next === \"\") {\n parts.push(code.slice(segStart, i));\n i += 2;\n while (i < len && !(code[i] === \"\" && i + 1 < len && code[i + 1] === \"/\")) {\n if (code[i] === \"\\n\") parts.push(\"\\n\");\n i++;\n }\n if (i < len) i += 2;\n parts.push(\" \");\n segStart = i;\n continue;\n }\n\n if (ch === \"'\" \|\| ch === '\"') {\n const quote = ch;\n i++;\n while (i < len && code[i] !== quote) {\n if (code[i] === \"\\\\\" && i + 1 < len) i++;\n i++;\n }\n if (i < len) i++;\n continue;\n }\n\n if (ch === \"`\") {\n i++;\n let depth = 0;\n while (i < len) {\n if (code[i] === \"\\\\\" && i + 1 < len) {\n i += 2;\n } else if (code[i] === \"$\" && i + 1 < len && code[i + 1] === \"{\") {\n i += 2;\n depth++;\n } else if (code[i] === \"}\" && depth > 0) {\n i++;\n depth--;\n } else if (code[i] === \"`\" && depth === 0) {\n i++;\n break;\n } else {\n i++;\n }\n }\n continue;\n }\n\n i++;\n }\n\n parts.push(code.slice(segStart));\n return parts.join(\"\");\n}\n\nexport interface RawImport {\n path: string;\n specifiers?: string[];\n isNamespace?: boolean;\n isDynamic?: boolean;\n isSideEffect?: boolean;\n}\n\n// Static regex patterns — compiled once\nconst nsImportRe = /\\bimport\\s+\\\\s+as\\s+[$\\w]+\\s+from\\s+['\"]([^'\"]+)['\"]/g;\nconst namedImportRe =\n /\\bimport\\s+(?:type\\s+)?(?:([$\\w]+)\\s,\\s)?\\{([^}])\\}\\s+from\\s+['\"]([^'\"]+)['\"]/g;\nconst defaultImportRe = /\\bimport\\s+(?:type\\s+)?([$\\w]+)\\s+from\\s+['\"]([^'\"]+)['\"]/g;\nconst reexportStarRe = /\\bexport\\s+\\\\s+(?:as\\s+[$\\w]+\\s+)?from\\s+['\"]([^'\"]+)['\"]/g;\nconst reexportNamedRe = /\\bexport\\s+(?:type\\s+)?\\{([^}])\\}\\s+from\\s+['\"]([^'\"]+)['\"]/g;\nconst sideEffectRe = /\\bimport\\s+['\"]([^'\"]+)['\"]/g;\nconst dynamicRe = /\\bimport\\s\$\\s['\"]([^'\"]+)['\"]\\s\$/g;\nconst requireRe = /\\brequire\\s\$\\s['\"]([^'\"]+)['\"]\\s\$/g;\n\nexport function parseSpecifiers(clause: string): string[] {\n return clause\n .split(\",\")\n .map((s) => s.trim())\n .filter(Boolean)\n .map((s) => {\n const withoutType = s.replace(/^type\\s+/, \"\");\n const parts = withoutType.split(/\\s+as\\s+/);\n return parts[0].trim();\n })\n .filter(Boolean);\n}\n\n/\n Scans source code and extracts all imports with metadata.\n \n Handles: static imports, dynamic imports, require(), re-exports.\n * Ignores imports inside comments. Imports inside string literals may\n * produce false positives, but unresolvable paths are silently skipped\n * by the resolver.\n /\nexport function scanImports(code: string): RawImport[] {\n const stripped = stripComments(code);\n const results: RawImport[] = [];\n\n for (const m of stripped.matchAll(nsImportRe)) {\n results.push({ path: m[1], isNamespace: true });\n }\n\n for (const m of stripped.matchAll(namedImportRe)) {\n const specifiers = parseSpecifiers(m[2]);\n if (m[1]) specifiers.unshift(\"default\");\n results.push({ path: m[3], specifiers });\n }\n\n for (const m of stripped.matchAll(defaultImportRe)) {\n results.push({ path: m[2], specifiers: [\"default\"] });\n }\n\n for (const m of stripped.matchAll(reexportStarRe)) {\n results.push({ path: m[1], isNamespace: true });\n }\n\n for (const m of stripped.matchAll(reexportNamedRe)) {\n results.push({ path: m[2], specifiers: parseSpecifiers(m[1]) });\n }\n\n for (const m of stripped.matchAll(sideEffectRe)) {\n results.push({ path: m[1], isSideEffect: true });\n }\n\n for (const m of stripped.matchAll(dynamicRe)) {\n results.push({ path: m[1], isDynamic: true });\n }\n\n for (const m of stripped.matchAll(requireRe)) {\n results.push({ path: m[1] });\n }\n\n return results;\n}\n","import { statSync } from \"node:fs\";\nimport { dirname, join, resolve, isAbsolute } from \"node:path\";\nimport type { ImportreeOptions, ResolvedImport } from \"./types.js\";\n\nconst DEFAULT_EXTENSIONS = [\".ts\", \".tsx\", \".js\", \".jsx\", \".mjs\", \".cjs\"];\n\nfunction fileExists(filePath: string): boolean {\n const stat = statSync(filePath, { throwIfNoEntry: false });\n return stat !== undefined && stat.isFile();\n}\n\nfunction dirExists(filePath: string): boolean {\n const stat = statSync(filePath, { throwIfNoEntry: false });\n return stat !== undefined && stat.isDirectory();\n}\n\n/\n Extract the bare package name from an import specifier.\n * - Scoped: `@scope/pkg/path` → `@scope/pkg`\n * - Unscoped: `pkg/path` → `pkg`\n /\nfunction getBareSpecifier(specifier: string): string {\n if (specifier.startsWith(\"@\")) {\n const parts = specifier.split(\"/\");\n return parts.length >= 2 ? `${parts[0]}/${parts[1]}` : specifier;\n }\n return specifier.split(\"/\")[0];\n}\n\nfunction resolveFile(filePath: string, extensions: string[]): string \| undefined {\n // Try exact path\n if (fileExists(filePath)) return filePath;\n\n // Try with each extension\n for (const ext of extensions) {\n const withExt = filePath + ext;\n if (fileExists(withExt)) return withExt;\n }\n\n // Try as directory with index file\n if (dirExists(filePath)) {\n for (const ext of extensions) {\n const indexPath = join(filePath, `index${ext}`);\n if (fileExists(indexPath)) return indexPath;\n }\n }\n\n return undefined;\n}\n\nexport interface Resolver {\n (specifier: string, fromFile: string): ResolvedImport \| undefined;\n}\n\n/\n Creates a resolver function that resolves import specifiers to absolute\n * file paths, with support for aliases and extension probing.\n /\nexport function createResolver(basedir: string, options: ImportreeOptions): Resolver {\n const extensions = options.extensions ?? DEFAULT_EXTENSIONS;\n\n // Sort aliases by key length descending for longest-prefix matching\n const aliases = options.aliases\n ? Object.entries(options.aliases).sort((a, b) => b[0].length - a[0].length)\n : [];\n\n const resolvedAliasValues = aliases.map(\n ([key, value]) => [key, isAbsolute(value) ? value : resolve(basedir, value)] as const,\n );\n\n const cache = new Map<string, ResolvedImport \| undefined>();\n\n return function resolveSpecifier(\n specifier: string,\n fromFile: string,\n ): ResolvedImport \| undefined {\n const fromDir = dirname(fromFile);\n const cacheKey = `${specifier}\\0${fromDir}`;\n\n if (cache.has(cacheKey)) return cache.get(cacheKey);\n\n let result: ResolvedImport \| undefined;\n\n // Relative import\n if (specifier.startsWith(\"./\") \|\| specifier.startsWith(\"../\")) {\n const absolutePath = resolveFile(resolve(fromDir, specifier), extensions);\n if (absolutePath) {\n result = { type: \"local\", absolutePath };\n }\n }\n // Check aliases\n else {\n let matched = false;\n for (const [prefix, replacement] of resolvedAliasValues) {\n if (specifier === prefix \|\| specifier.startsWith(prefix + \"/\")) {\n const rest = specifier === prefix ? \"\" : specifier.slice(prefix.length);\n const absolutePath = resolveFile(join(replacement, rest), extensions);\n if (absolutePath) {\n result = { type: \"local\", absolutePath };\n }\n matched = true;\n break;\n }\n }\n\n // Bare specifier → external\n if (!matched) {\n result = { type: \"external\", specifier: getBareSpecifier(specifier) };\n }\n }\n\n cache.set(cacheKey, result);\n return result;\n };\n}\n","import { readFileSync } from \"node:fs\";\nimport { resolve } from \"node:path\";\nimport type { ImportreeOptions, ImportTree, ImportEdge } from \"./types.js\";\nimport type { RawImport } from \"./scanner.js\";\nimport { scanImports } from \"./scanner.js\";\nimport type { Resolver } from \"./resolver.js\";\nimport { createResolver } from \"./resolver.js\";\n\nexport function buildEdges(\n rawImports: RawImport[],\n resolveSpecifier: Resolver,\n filePath: string,\n): { edges: ImportEdge[]; externals: string[] } {\n const edges: ImportEdge[] = [];\n const externals: string[] = [];\n\n for (const raw of rawImports) {\n const resolved = resolveSpecifier(raw.path, filePath);\n if (!resolved) continue;\n\n if (resolved.type === \"external\" && resolved.specifier) {\n externals.push(resolved.specifier);\n } else if (resolved.type === \"local\" && resolved.absolutePath) {\n const existing = edges.find((e) => e.path === resolved.absolutePath);\n if (existing) {\n if (raw.isNamespace) {\n existing.isNamespace = true;\n existing.specifiers = undefined;\n existing.isSideEffect = undefined;\n } else if (raw.specifiers && !existing.isNamespace) {\n (existing.specifiers ??= []).push(...raw.specifiers);\n existing.isSideEffect = undefined;\n }\n if (raw.isSideEffect && !existing.specifiers && !existing.isNamespace) {\n existing.isSideEffect = true;\n }\n if (raw.isDynamic) existing.isDynamic = true;\n } else {\n edges.push({\n path: resolved.absolutePath,\n specifiers: raw.specifiers,\n isNamespace: raw.isNamespace,\n isDynamic: raw.isDynamic,\n isSideEffect: raw.isSideEffect,\n });\n }\n }\n }\n\n return { edges, externals };\n}\n\n/\n Walks imports starting from an entry file and builds the full dependency tree.\n * Uses iterative DFS with an explicit stack to avoid call-stack limits on deep chains.\n /\nexport async function walk(entryFile: string, options: ImportreeOptions): Promise<ImportTree> {\n const entrypoint = resolve(entryFile);\n const basedir = options.rootDir ? resolve(options.rootDir) : process.cwd();\n const resolveSpecifier = createResolver(basedir, options);\n\n const graph: Record<string, ImportEdge[]> = {};\n const externals = new Set<string>();\n const visited = new Set<string>();\n const stack = [entrypoint];\n\n while (stack.length > 0) {\n const filePath = stack.pop()!;\n if (visited.has(filePath)) continue;\n visited.add(filePath);\n\n const content = readFileSync(filePath, \"utf-8\");\n const rawImports = scanImports(content);\n const { edges, externals: fileExternals } = buildEdges(rawImports, resolveSpecifier, filePath);\n\n for (const ext of fileExternals) externals.add(ext);\n graph[filePath] = edges;\n\n for (const edge of edges) stack.push(edge.path);\n }\n\n // Build reverse graph\n const reverseGraph: Record<string, ImportEdge[]> = {};\n for (const file of Object.keys(graph)) {\n reverseGraph[file] = [];\n }\n for (const [file, edges] of Object.entries(graph)) {\n for (const edge of edges) {\n if (!reverseGraph[edge.path]) reverseGraph[edge.path] = [];\n reverseGraph[edge.path].push({\n path: file,\n specifiers: edge.specifiers,\n isNamespace: edge.isNamespace,\n isDynamic: edge.isDynamic,\n isSideEffect: edge.isSideEffect,\n });\n }\n }\n\n return {\n entrypoint,\n files: Object.keys(graph).sort(),\n externals: [...externals].sort(),\n graph,\n reverseGraph,\n };\n}\n","import { readFileSync } from \"node:fs\";\nimport { resolve } from \"node:path\";\nimport type { ImportreeOptions, ImportTree, ImportEdge } from \"./types.js\";\nimport { buildEdges, walk } from \"./walker.js\";\nimport { scanImports } from \"./scanner.js\";\nimport { createResolver } from \"./resolver.js\";\n\nexport type { ImportreeOptions, ImportTree, ImportEdge } from \"./types.js\";\n\n/\n Builds a full import dependency tree starting from an entry file.\n \n Recursively resolves all static imports, dynamic imports, require() calls,\n * and re-exports. Supports path aliases for custom resolution.\n \n @example\n * ```ts\n * const tree = await importree('./src/index.ts', {\n * aliases: { '@': './src' },\n * });\n \n console.log(tree.files); // all local dependency file paths\n * console.log(tree.externals); // external package names\n * console.log(tree.graph); // file → direct dependencies\n * ```\n /\nexport async function importree(entry: string, options?: ImportreeOptions): Promise<ImportTree> {\n return walk(entry, options ?? {});\n}\n\n/\n Parses a single file and returns its direct import edges without recursive traversal.\n \n @example\n * ```ts\n * const edges = parseImports('./src/components/Button.tsx', {\n * aliases: { '@': './src' },\n * });\n \n for (const edge of edges) {\n * console.log(edge.path, edge.specifiers);\n * }\n * ```\n /\nexport function parseImports(filePath: string, options?: ImportreeOptions): ImportEdge[] {\n const absolutePath = resolve(filePath);\n const basedir = options?.rootDir ? resolve(options.rootDir) : process.cwd();\n const resolveSpecifier = createResolver(basedir, options ?? {});\n\n const content = readFileSync(absolutePath, \"utf-8\");\n const rawImports = scanImports(content);\n const { edges } = buildEdges(rawImports, resolveSpecifier, absolutePath);\n\n return edges;\n}\n\n/\n Given an import tree and a changed file, returns all files that\n * transitively depend on the changed file (i.e., files that would\n * need to be re-evaluated if the changed file is modified).\n \n The changed file itself is NOT included in the result.\n */\nexport function getAffectedFiles(tree: ImportTree, changedFile: string): string[] {\n const absolute = resolve(changedFile);\n\n if (!tree.reverseGraph[absolute]) return [];\n\n const affected = new Set<string>();\n const queue = [absolute];\n\n while (queue.length > 0) {\n const current = queue.shift()!;\n const dependents = tree.reverseGraph[current];\n if (!dependents) continue;\n\n for (const edge of dependents) {\n if (!affected.has(edge.path)) {\n affected.add(edge.path);\n queue.push(edge.path);\n }\n }\n }\n\n affected.delete(absolute);\n return [...affected].sort();\n}\n"],"mappings":";;;;;;;;;;;;;AASA,SAAgB,cAAc,MAAsB;CAClD,MAAM,MAAM,KAAK;CACjB,MAAM,QAAkB,EAAE;CAC1B,IAAI,IAAI;CACR,IAAI,WAAW;AAEf,QAAO,IAAI,KAAK;EACd,MAAM,KAAK,KAAK;EAChB,MAAM,OAAO,IAAI,IAAI,MAAM,KAAK,IAAI,KAAK;AAEzC,MAAI,OAAO,OAAO,SAAS,KAAK;AAC9B,SAAM,KAAK,KAAK,MAAM,UAAU,EAAE,CAAC;AACnC,UAAO,IAAI,OAAO,KAAK,OAAO,KAAM;AACpC,cAAW;AACX;;AAGF,MAAI,OAAO,OAAO,SAAS,KAAK;AAC9B,SAAM,KAAK,KAAK,MAAM,UAAU,EAAE,CAAC;AACnC,QAAK;AACL,UAAO,IAAI,OAAO,EAAE,KAAK,OAAO,OAAO,IAAI,IAAI,OAAO,KAAK,IAAI,OAAO,MAAM;AAC1E,QAAI,KAAK,OAAO,KAAM,OAAM,KAAK,KAAK;AACtC;;AAEF,OAAI,IAAI,IAAK,MAAK;AAClB,SAAM,KAAK,IAAI;AACf,cAAW;AACX;;AAGF,MAAI,OAAO,OAAO,OAAO,MAAK;GAC5B,MAAM,QAAQ;AACd;AACA,UAAO,IAAI,OAAO,KAAK,OAAO,OAAO;AACnC,QAAI,KAAK,OAAO,QAAQ,IAAI,IAAI,IAAK;AACrC;;AAEF,OAAI,IAAI,IAAK;AACb;;AAGF,MAAI,OAAO,KAAK;AACd;GACA,IAAI,QAAQ;AACZ,UAAO,IAAI,IACT,KAAI,KAAK,OAAO,QAAQ,IAAI,IAAI,IAC9B,MAAK;YACI,KAAK,OAAO,OAAO,IAAI,IAAI,OAAO,KAAK,IAAI,OAAO,KAAK;AAChE,SAAK;AACL;cACS,KAAK,OAAO,OAAO,QAAQ,GAAG;AACvC;AACA;cACS,KAAK,OAAO,OAAO,UAAU,GAAG;AACzC;AACA;SAEA;AAGJ;;AAGF;;AAGF,OAAM,KAAK,KAAK,MAAM,SAAS,CAAC;AAChC,QAAO,MAAM,KAAK,GAAG;;AAYvB,MAAM,aAAa;AACnB,MAAM,gBACJ;AACF,MAAM,kBAAkB;AACxB,MAAM,iBAAiB;AACvB,MAAM,kBAAkB;AACxB,MAAM,eAAe;AACrB,MAAM,YAAY;AAClB,MAAM,YAAY;AAElB,SAAgB,gBAAgB,QAA0B;AACxD,QAAO,OACJ,MAAM,IAAI,CACV,KAAK,MAAM,EAAE,MAAM,CAAC,CACpB,OAAO,QAAQ,CACf,KAAK,MAAM;AAGV,SAFoB,EAAE,QAAQ,YAAY,GAAG,CACnB,MAAM,WAAW,CAC9B,GAAG,MAAM;GACtB,CACD,OAAO,QAAQ;;;;;;;;;;AAWpB,SAAgB,YAAY,MAA2B;CACrD,MAAM,WAAW,cAAc,KAAK;CACpC,MAAM,UAAuB,EAAE;AAE/B,MAAK,MAAM,KAAK,SAAS,SAAS,WAAW,CAC3C,SAAQ,KAAK;EAAE,MAAM,EAAE;EAAI,aAAa;EAAM,CAAC;AAGjD,MAAK,MAAM,KAAK,SAAS,SAAS,cAAc,EAAE;EAChD,MAAM,aAAa,gBAAgB,EAAE,GAAG;AACxC,MAAI,EAAE,GAAI,YAAW,QAAQ,UAAU;AACvC,UAAQ,KAAK;GAAE,MAAM,EAAE;GAAI;GAAY,CAAC;;AAG1C,MAAK,MAAM,KAAK,SAAS,SAAS,gBAAgB,CAChD,SAAQ,KAAK;EAAE,MAAM,EAAE;EAAI,YAAY,CAAC,UAAU;EAAE,CAAC;AAGvD,MAAK,MAAM,KAAK,SAAS,SAAS,eAAe,CAC/C,SAAQ,KAAK;EAAE,MAAM,EAAE;EAAI,aAAa;EAAM,CAAC;AAGjD,MAAK,MAAM,KAAK,SAAS,SAAS,gBAAgB,CAChD,SAAQ,KAAK;EAAE,MAAM,EAAE;EAAI,YAAY,gBAAgB,EAAE,GAAG;EAAE,CAAC;AAGjE,MAAK,MAAM,KAAK,SAAS,SAAS,aAAa,CAC7C,SAAQ,KAAK;EAAE,MAAM,EAAE;EAAI,cAAc;EAAM,CAAC;AAGlD,MAAK,MAAM,KAAK,SAAS,SAAS,UAAU,CAC1C,SAAQ,KAAK;EAAE,MAAM,EAAE;EAAI,WAAW;EAAM,CAAC;AAG/C,MAAK,MAAM,KAAK,SAAS,SAAS,UAAU,CAC1C,SAAQ,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC;AAG9B,QAAO;;;;ACzJT,MAAM,qBAAqB;CAAC;CAAO;CAAQ;CAAO;CAAQ;CAAQ;CAAO;AAEzE,SAAS,WAAW,UAA2B;CAC7C,MAAM,QAAA,GAAA,QAAA,UAAgB,UAAU,EAAE,gBAAgB,OAAO,CAAC;AAC1D,QAAO,SAAS,KAAA,KAAa,KAAK,QAAQ;;AAG5C,SAAS,UAAU,UAA2B;CAC5C,MAAM,QAAA,GAAA,QAAA,UAAgB,UAAU,EAAE,gBAAgB,OAAO,CAAC;AAC1D,QAAO,SAAS,KAAA,KAAa,KAAK,aAAa;;;;;;;AAQjD,SAAS,iBAAiB,WAA2B;AACnD,KAAI,UAAU,WAAW,IAAI,EAAE;EAC7B,MAAM,QAAQ,UAAU,MAAM,IAAI;AAClC,SAAO,MAAM,UAAU,IAAI,GAAG,MAAM,GAAG,GAAG,MAAM,OAAO;;AAEzD,QAAO,UAAU,MAAM,IAAI,CAAC;;AAG9B,SAAS,YAAY,UAAkB,YAA0C;AAE/E,KAAI,WAAW,SAAS,CAAE,QAAO;AAGjC,MAAK,MAAM,OAAO,YAAY;EAC5B,MAAM,UAAU,WAAW;AAC3B,MAAI,WAAW,QAAQ,CAAE,QAAO;;AAIlC,KAAI,UAAU,SAAS,CACrB,MAAK,MAAM,OAAO,YAAY;EAC5B,MAAM,aAAA,GAAA,UAAA,MAAiB,UAAU,QAAQ,MAAM;AAC/C,MAAI,WAAW,UAAU,CAAE,QAAO;;;;;;;AAexC,SAAgB,eAAe,SAAiB,SAAqC;CACnF,MAAM,aAAa,QAAQ,cAAc;CAOzC,MAAM,uBAJU,QAAQ,UACpB,OAAO,QAAQ,QAAQ,QAAQ,CAAC,MAAM,GAAG,MAAM,EAAE,GAAG,SAAS,EAAE,GAAG,OAAO,GACzE,EAAE,EAE8B,KACjC,CAAC,KAAK,WAAW,CAAC,MAAA,GAAA,UAAA,YAAgB,MAAM,GAAG,SAAA,GAAA,UAAA,SAAgB,SAAS,MAAM,CAAC,CAC7E;CAED,MAAM,wBAAQ,IAAI,KAAyC;AAE3D,QAAO,SAAS,iBACd,WACA,UAC4B;EAC5B,MAAM,WAAA,GAAA,UAAA,SAAkB,SAAS;EACjC,MAAM,WAAW,GAAG,UAAU,IAAI;AAElC,MAAI,MAAM,IAAI,SAAS,CAAE,QAAO,MAAM,IAAI,SAAS;EAEnD,IAAI;AAGJ,MAAI,UAAU,WAAW,KAAK,IAAI,UAAU,WAAW,MAAM,EAAE;GAC7D,MAAM,eAAe,aAAA,GAAA,UAAA,SAAoB,SAAS,UAAU,EAAE,WAAW;AACzE,OAAI,aACF,UAAS;IAAE,MAAM;IAAS;IAAc;SAIvC;GACH,IAAI,UAAU;AACd,QAAK,MAAM,CAAC,QAAQ,gBAAgB,oBAClC,KAAI,cAAc,UAAU,UAAU,WAAW,SAAS,IAAI,EAAE;IAE9D,MAAM,eAAe,aAAA,GAAA,UAAA,MAAiB,aADzB,cAAc,SAAS,KAAK,UAAU,MAAM,OAAO,OAAO,CACf,EAAE,WAAW;AACrE,QAAI,aACF,UAAS;KAAE,MAAM;KAAS;KAAc;AAE1C,cAAU;AACV;;AAKJ,OAAI,CAAC,QACH,UAAS;IAAE,MAAM;IAAY,WAAW,iBAAiB,UAAU;IAAE;;AAIzE,QAAM,IAAI,UAAU,OAAO;AAC3B,SAAO;;;;;ACxGX,SAAgB,WACd,YACA,kBACA,UAC8C;CAC9C,MAAM,QAAsB,EAAE;CAC9B,MAAM,YAAsB,EAAE;AAE9B,MAAK,MAAM,OAAO,YAAY;EAC5B,MAAM,WAAW,iBAAiB,IAAI,MAAM,SAAS;AACrD,MAAI,CAAC,SAAU;AAEf,MAAI,SAAS,SAAS,cAAc,SAAS,UAC3C,WAAU,KAAK,SAAS,UAAU;WACzB,SAAS,SAAS,WAAW,SAAS,cAAc;GAC7D,MAAM,WAAW,MAAM,MAAM,MAAM,EAAE,SAAS,SAAS,aAAa;AACpE,OAAI,UAAU;AACZ,QAAI,IAAI,aAAa;AACnB,cAAS,cAAc;AACvB,cAAS,aAAa,KAAA;AACtB,cAAS,eAAe,KAAA;eACf,IAAI,cAAc,CAAC,SAAS,aAAa;AAClD,MAAC,SAAS,eAAe,EAAE,EAAE,KAAK,GAAG,IAAI,WAAW;AACpD,cAAS,eAAe,KAAA;;AAE1B,QAAI,IAAI,gBAAgB,CAAC,SAAS,cAAc,CAAC,SAAS,YACxD,UAAS,eAAe;AAE1B,QAAI,IAAI,UAAW,UAAS,YAAY;SAExC,OAAM,KAAK;IACT,MAAM,SAAS;IACf,YAAY,IAAI;IAChB,aAAa,IAAI;IACjB,WAAW,IAAI;IACf,cAAc,IAAI;IACnB,CAAC;;;AAKR,QAAO;EAAE;EAAO;EAAW;;;;;;AAO7B,eAAsB,KAAK,WAAmB,SAAgD;CAC5F,MAAM,cAAA,GAAA,UAAA,SAAqB,UAAU;CAErC,MAAM,mBAAmB,eADT,QAAQ,WAAA,GAAA,UAAA,SAAkB,QAAQ,QAAQ,GAAG,QAAQ,KAAK,EACzB,QAAQ;CAEzD,MAAM,QAAsC,EAAE;CAC9C,MAAM,4BAAY,IAAI,KAAa;CACnC,MAAM,0BAAU,IAAI,KAAa;CACjC,MAAM,QAAQ,CAAC,WAAW;AAE1B,QAAO,MAAM,SAAS,GAAG;EACvB,MAAM,WAAW,MAAM,KAAK;AAC5B,MAAI,QAAQ,IAAI,SAAS,CAAE;AAC3B,UAAQ,IAAI,SAAS;EAIrB,MAAM,EAAE,OAAO,WAAW,kBAAkB,WADzB,aAAA,GAAA,QAAA,cADU,UAAU,QAAQ,CACR,EAC4B,kBAAkB,SAAS;AAE9F,OAAK,MAAM,OAAO,cAAe,WAAU,IAAI,IAAI;AACnD,QAAM,YAAY;AAElB,OAAK,MAAM,QAAQ,MAAO,OAAM,KAAK,KAAK,KAAK;;CAIjD,MAAM,eAA6C,EAAE;AACrD,MAAK,MAAM,QAAQ,OAAO,KAAK,MAAM,CACnC,cAAa,QAAQ,EAAE;AAEzB,MAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,MAAM,CAC/C,MAAK,MAAM,QAAQ,OAAO;AACxB,MAAI,CAAC,aAAa,KAAK,MAAO,cAAa,KAAK,QAAQ,EAAE;AAC1D,eAAa,KAAK,MAAM,KAAK;GAC3B,MAAM;GACN,YAAY,KAAK;GACjB,aAAa,KAAK;GAClB,WAAW,KAAK;GAChB,cAAc,KAAK;GACpB,CAAC;;AAIN,QAAO;EACL;EACA,OAAO,OAAO,KAAK,MAAM,CAAC,MAAM;EAChC,WAAW,CAAC,GAAG,UAAU,CAAC,MAAM;EAChC;EACA;EACD;;;;;;;;;;;;;;;;;;;;;AC/EH,eAAsB,UAAU,OAAe,SAAiD;AAC9F,QAAO,KAAK,OAAO,WAAW,EAAE,CAAC;;;;;;;;;;;;;;;;AAiBnC,SAAgB,aAAa,UAAkB,SAA0C;CACvF,MAAM,gBAAA,GAAA,UAAA,SAAuB,SAAS;CAEtC,MAAM,mBAAmB,eADT,SAAS,WAAA,GAAA,UAAA,SAAkB,QAAQ,QAAQ,GAAG,QAAQ,KAAK,EAC1B,WAAW,EAAE,CAAC;CAI/D,MAAM,EAAE,UAAU,WADC,aAAA,GAAA,QAAA,cADU,cAAc,QAAQ,CACZ,EACE,kBAAkB,aAAa;AAExE,QAAO;;;;;;;;;AAUT,SAAgB,iBAAiB,MAAkB,aAA+B;CAChF,MAAM,YAAA,GAAA,UAAA,SAAmB,YAAY;AAErC,KAAI,CAAC,KAAK,aAAa,UAAW,QAAO,EAAE;CAE3C,MAAM,2BAAW,IAAI,KAAa;CAClC,MAAM,QAAQ,CAAC,SAAS;AAExB,QAAO,MAAM,SAAS,GAAG;EACvB,MAAM,UAAU,MAAM,OAAO;EAC7B,MAAM,aAAa,KAAK,aAAa;AACrC,MAAI,CAAC,WAAY;AAEjB,OAAK,MAAM,QAAQ,WACjB,KAAI,CAAC,SAAS,IAAI,KAAK,KAAK,EAAE;AAC5B,YAAS,IAAI,KAAK,KAAK;AACvB,SAAM,KAAK,KAAK,KAAK;;;AAK3B,UAAS,OAAO,SAAS;AACzB,QAAO,CAAC,GAAG,SAAS,CAAC,MAAM"}

package/dist/index.d.cts CHANGED Viewed

@@ -23,6 +23,25 @@ interface ImportreeOptions {
   extensions?: string[];
 }
 /**
+* A single directed edge in the import graph, carrying metadata about
+* how one file imports another.
+*/
+interface ImportEdge {
+  /** Absolute path of the imported file. */
+  path: string;
+  /**
+  * Specifiers imported (original names, not aliases).
+  * Contains `"default"` for default imports (e.g., `import X from '...'`).
+  */
+  specifiers?: string[];
+  /** True when the import is `import * as X from '...'` or `export * from '...'`. */
+  isNamespace?: boolean;
+  /** True when the import is `import('...')`. */
+  isDynamic?: boolean;
+  /** True when the import is `import '...'` (side-effect only). */
+  isSideEffect?: boolean;
+}
+/**
 * The result of building an import dependency tree.
 */
 interface ImportTree {
@@ -34,14 +53,14 @@ interface ImportTree {
   externals: string[];
   /**
   * Forward adjacency list: each key is an absolute file path, and its value
-  * is an array of absolute paths of files it directly imports.
+  * is an array of import edges describing how it depends on other files.
   */
-  graph: Record<string, string[]>;
+  graph: Record<string, ImportEdge[]>;
   /**
   * Reverse adjacency list: each key is an absolute file path, and its value
-  * is an array of absolute paths of files that import it.
+  * is an array of import edges describing files that import it.
   */
-  reverseGraph: Record<string, string[]>;
+  reverseGraph: Record<string, ImportEdge[]>;
 }
 //#endregion
 //#region src/index.d.ts
@@ -64,6 +83,21 @@ interface ImportTree {
 */
 declare function importree(entry: string, options?: ImportreeOptions): Promise<ImportTree>;
 /**
+* Parses a single file and returns its direct import edges without recursive traversal.
+*
+* @example
+* ```ts
+* const edges = parseImports('./src/components/Button.tsx', {
+*   aliases: { '@': './src' },
+* });
+*
+* for (const edge of edges) {
+*   console.log(edge.path, edge.specifiers);
+* }
+* ```
+*/
+declare function parseImports(filePath: string, options?: ImportreeOptions): ImportEdge[];
+/**
 * Given an import tree and a changed file, returns all files that
 * transitively depend on the changed file (i.e., files that would
 * need to be re-evaluated if the changed file is modified).
@@ -72,5 +106,5 @@ declare function importree(entry: string, options?: ImportreeOptions): Promise<I
 */
 declare function getAffectedFiles(tree: ImportTree, changedFile: string): string[];
 //#endregion
-export { type ImportTree, type ImportreeOptions, getAffectedFiles, importree };
+export { type ImportEdge, type ImportTree, type ImportreeOptions, getAffectedFiles, importree, parseImports };
 //# sourceMappingURL=index.d.cts.map

package/dist/index.d.cts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"index.d.cts","names":[],"sources":["../src/types.ts","../src/index.ts"],"mappings":";;AAGA;;UAAiB,gBAAA;EAaL;;;;EARV,OAAA;;;~~AAqBF~~;;;;~~EAbE~~,OAAA,GAAU,MAAA;;;;;;EAOV,UAAA;AAAA;;;;UAMe,UAAA;~~ECNjB~~;~~EDQE~~,UAAA;;EAGA,KAAA;;EAGA,SAAA~~;;;;;EAMA~~,KAAA,EAAO,MAAA~~;;;;;EAMP~~,YAAA,EAAc,MAAA;AAAA;;;;;;;;;;;;~~AApBhB~~;;;;;;;;~~iBCNsB~~,SAAA,~~CACpB~~,KAAA,~~UACA~~,OAAA,GAAU,gBAAA,~~GACT~~,OAAA,CAAQ,UAAA;;;;;;;;~~iBAWK~~,gBAAA,~~CACd~~,IAAA,EAAM,UAAA,~~EACN~~,WAAA"}
1	+ {"version":3,"file":"index.d.cts","names":[],"sources":["../src/types.ts","../src/index.ts"],"mappings":";;AAGA;;UAAiB,gBAAA;EAaL;;;;EARV,OAAA;;;AAsBF;;;;EAdE,OAAA,GAAU,MAAA;;;;;;EAOV,UAAA;AAAA;;;;;UAOe,UAAA;;EAEf,IAAA;EAyCc;;;;EAnCd,UAAA;;EAGA,WAAA;;EAGA,SAAA;;EAGA,YAAA;AAAA;;;;UAMe,UAAA;EC3BK;ED6BpB,UAAA;;EAGA,KAAA;;EAGA,SAAA;ECnC0E;;;;EDyC1E,KAAA,EAAO,MAAA,SAAe,UAAA;;;;ACvBxB;ED6BE,YAAA,EAAc,MAAA,SAAe,UAAA;AAAA;;;;;;;;;;;;AA3C/B;;;;;;;;iBCJsB,SAAA,CAAU,KAAA,UAAe,OAAA,GAAU,gBAAA,GAAmB,OAAA,CAAQ,UAAA;;;AD2BpF;;;;;;;;;;;;iBCTgB,YAAA,CAAa,QAAA,UAAkB,OAAA,GAAU,gBAAA,GAAmB,UAAA;;;;;;;;iBAmB5D,gBAAA,CAAiB,IAAA,EAAM,UAAA,EAAY,WAAA"}

package/dist/index.d.mts CHANGED Viewed

@@ -23,6 +23,25 @@ interface ImportreeOptions {
   extensions?: string[];
 }
 /**
+* A single directed edge in the import graph, carrying metadata about
+* how one file imports another.
+*/
+interface ImportEdge {
+  /** Absolute path of the imported file. */
+  path: string;
+  /**
+  * Specifiers imported (original names, not aliases).
+  * Contains `"default"` for default imports (e.g., `import X from '...'`).
+  */
+  specifiers?: string[];
+  /** True when the import is `import * as X from '...'` or `export * from '...'`. */
+  isNamespace?: boolean;
+  /** True when the import is `import('...')`. */
+  isDynamic?: boolean;
+  /** True when the import is `import '...'` (side-effect only). */
+  isSideEffect?: boolean;
+}
+/**
 * The result of building an import dependency tree.
 */
 interface ImportTree {
@@ -34,14 +53,14 @@ interface ImportTree {
   externals: string[];
   /**
   * Forward adjacency list: each key is an absolute file path, and its value
-  * is an array of absolute paths of files it directly imports.
+  * is an array of import edges describing how it depends on other files.
   */
-  graph: Record<string, string[]>;
+  graph: Record<string, ImportEdge[]>;
   /**
   * Reverse adjacency list: each key is an absolute file path, and its value
-  * is an array of absolute paths of files that import it.
+  * is an array of import edges describing files that import it.
   */
-  reverseGraph: Record<string, string[]>;
+  reverseGraph: Record<string, ImportEdge[]>;
 }
 //#endregion
 //#region src/index.d.ts
@@ -64,6 +83,21 @@ interface ImportTree {
 */
 declare function importree(entry: string, options?: ImportreeOptions): Promise<ImportTree>;
 /**
+* Parses a single file and returns its direct import edges without recursive traversal.
+*
+* @example
+* ```ts
+* const edges = parseImports('./src/components/Button.tsx', {
+*   aliases: { '@': './src' },
+* });
+*
+* for (const edge of edges) {
+*   console.log(edge.path, edge.specifiers);
+* }
+* ```
+*/
+declare function parseImports(filePath: string, options?: ImportreeOptions): ImportEdge[];
+/**
 * Given an import tree and a changed file, returns all files that
 * transitively depend on the changed file (i.e., files that would
 * need to be re-evaluated if the changed file is modified).
@@ -72,5 +106,5 @@ declare function importree(entry: string, options?: ImportreeOptions): Promise<I
 */
 declare function getAffectedFiles(tree: ImportTree, changedFile: string): string[];
 //#endregion
-export { type ImportTree, type ImportreeOptions, getAffectedFiles, importree };
+export { type ImportEdge, type ImportTree, type ImportreeOptions, getAffectedFiles, importree, parseImports };
 //# sourceMappingURL=index.d.mts.map

package/dist/index.d.mts.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"index.d.mts","names":[],"sources":["../src/types.ts","../src/index.ts"],"mappings":";;AAGA;;UAAiB,gBAAA;EAaL;;;;EARV,OAAA;;;~~AAqBF~~;;;;~~EAbE~~,OAAA,GAAU,MAAA;;;;;;EAOV,UAAA;AAAA;;;;UAMe,UAAA;~~ECNjB~~;~~EDQE~~,UAAA;;EAGA,KAAA;;EAGA,SAAA~~;;;;;EAMA~~,KAAA,EAAO,MAAA~~;;;;;EAMP~~,YAAA,EAAc,MAAA;AAAA;;;;;;;;;;;;~~AApBhB~~;;;;;;;;~~iBCNsB~~,SAAA,~~CACpB~~,KAAA,~~UACA~~,OAAA,GAAU,gBAAA,~~GACT~~,OAAA,CAAQ,UAAA;;;;;;;;~~iBAWK~~,gBAAA,~~CACd~~,IAAA,EAAM,UAAA,~~EACN~~,WAAA"}
1	+ {"version":3,"file":"index.d.mts","names":[],"sources":["../src/types.ts","../src/index.ts"],"mappings":";;AAGA;;UAAiB,gBAAA;EAaL;;;;EARV,OAAA;;;AAsBF;;;;EAdE,OAAA,GAAU,MAAA;;;;;;EAOV,UAAA;AAAA;;;;;UAOe,UAAA;;EAEf,IAAA;EAyCc;;;;EAnCd,UAAA;;EAGA,WAAA;;EAGA,SAAA;;EAGA,YAAA;AAAA;;;;UAMe,UAAA;EC3BK;ED6BpB,UAAA;;EAGA,KAAA;;EAGA,SAAA;ECnC0E;;;;EDyC1E,KAAA,EAAO,MAAA,SAAe,UAAA;;;;ACvBxB;ED6BE,YAAA,EAAc,MAAA,SAAe,UAAA;AAAA;;;;;;;;;;;;AA3C/B;;;;;;;;iBCJsB,SAAA,CAAU,KAAA,UAAe,OAAA,GAAU,gBAAA,GAAmB,OAAA,CAAQ,UAAA;;;AD2BpF;;;;;;;;;;;;iBCTgB,YAAA,CAAa,QAAA,UAAkB,OAAA,GAAU,gBAAA,GAAmB,UAAA;;;;;;;;iBAmB5D,gBAAA,CAAiB,IAAA,EAAM,UAAA,EAAY,WAAA"}

package/dist/index.mjs CHANGED Viewed

@@ -1,100 +1,87 @@
+import { readFileSync, statSync } from "node:fs";
 import { dirname, isAbsolute, join, resolve } from "node:path";
-import { readFile } from "node:fs/promises";
-import { statSync } from "node:fs";
 //#region src/scanner.ts
 /**
 * Strips comments from source code while preserving string literals.
 *
-* Comments are replaced with spaces (preserving newlines). Strings and
+* Line comments (`//`) are removed entirely. Block comments are replaced
+* with a single space (newlines within them are preserved). Strings and
 * template literals are left intact so that import specifiers inside
 * `from 'specifier'` remain extractable. The function correctly handles
 * comment-like sequences inside strings (e.g., `'//'` won't start a comment).
 */
 function stripComments(code) {
 	const len = code.length;
-	const result = new Array(len);
+	const parts = [];
 	let i = 0;
+	let segStart = 0;
 	while (i < len) {
 		const ch = code[i];
 		const next = i + 1 < len ? code[i + 1] : "";
 		if (ch === "/" && next === "/") {
-			result[i++] = " ";
-			result[i++] = " ";
-			while (i < len && code[i] !== "\n") result[i++] = " ";
+			parts.push(code.slice(segStart, i));
+			while (i < len && code[i] !== "\n") i++;
+			segStart = i;
 			continue;
 		}
 		if (ch === "/" && next === "*") {
-			result[i++] = " ";
-			result[i++] = " ";
+			parts.push(code.slice(segStart, i));
+			i += 2;
 			while (i < len && !(code[i] === "*" && i + 1 < len && code[i + 1] === "/")) {
-				result[i] = code[i] === "\n" ? "\n" : " ";
+				if (code[i] === "\n") parts.push("\n");
 				i++;
 			}
-			if (i < len) {
-				result[i++] = " ";
-				result[i++] = " ";
-			}
+			if (i < len) i += 2;
+			parts.push(" ");
+			segStart = i;
 			continue;
 		}
 		if (ch === "'" || ch === "\"") {
 			const quote = ch;
-			result[i] = code[i];
 			i++;
-			while (i < len && code[i] !== quote) if (code[i] === "\\" && i + 1 < len) {
-				result[i] = code[i];
-				i++;
-				result[i] = code[i];
-				i++;
-			} else {
-				result[i] = code[i];
-				i++;
-			}
-			if (i < len) {
-				result[i] = code[i];
+			while (i < len && code[i] !== quote) {
+				if (code[i] === "\\" && i + 1 < len) i++;
 				i++;
 			}
+			if (i < len) i++;
 			continue;
 		}
 		if (ch === "`") {
-			result[i] = code[i];
 			i++;
 			let depth = 0;
-			while (i < len) if (code[i] === "\\" && i + 1 < len) {
-				result[i] = code[i];
-				i++;
-				result[i] = code[i];
-				i++;
-			} else if (code[i] === "$" && i + 1 < len && code[i + 1] === "{") {
-				result[i] = code[i];
-				i++;
-				result[i] = code[i];
-				i++;
+			while (i < len) if (code[i] === "\\" && i + 1 < len) i += 2;
+			else if (code[i] === "$" && i + 1 < len && code[i + 1] === "{") {
+				i += 2;
 				depth++;
 			} else if (code[i] === "}" && depth > 0) {
-				result[i] = code[i];
 				i++;
 				depth--;
 			} else if (code[i] === "`" && depth === 0) {
-				result[i] = code[i];
 				i++;
 				break;
-			} else {
-				result[i] = code[i];
-				i++;
-			}
+			} else i++;
 			continue;
 		}
-		result[i] = ch;
 		i++;
 	}
-	return result.join("");
+	parts.push(code.slice(segStart));
+	return parts.join("");
 }
-const fromRe = /\bfrom\s+['"]([^'"]+)['"]/g;
+const nsImportRe = /\bimport\s+\*\s+as\s+[$\w]+\s+from\s+['"]([^'"]+)['"]/g;
+const namedImportRe = /\bimport\s+(?:type\s+)?(?:([$\w]+)\s*,\s*)?\{([^}]*)\}\s+from\s+['"]([^'"]+)['"]/g;
+const defaultImportRe = /\bimport\s+(?:type\s+)?([$\w]+)\s+from\s+['"]([^'"]+)['"]/g;
+const reexportStarRe = /\bexport\s+\*\s+(?:as\s+[$\w]+\s+)?from\s+['"]([^'"]+)['"]/g;
+const reexportNamedRe = /\bexport\s+(?:type\s+)?\{([^}]*)\}\s+from\s+['"]([^'"]+)['"]/g;
 const sideEffectRe = /\bimport\s+['"]([^'"]+)['"]/g;
 const dynamicRe = /\bimport\s*\(\s*['"]([^'"]+)['"]\s*\)/g;
 const requireRe = /\brequire\s*\(\s*['"]([^'"]+)['"]\s*\)/g;
+function parseSpecifiers(clause) {
+	return clause.split(",").map((s) => s.trim()).filter(Boolean).map((s) => {
+		return s.replace(/^type\s+/, "").split(/\s+as\s+/)[0].trim();
+	}).filter(Boolean);
+}
 /**
-* Scans source code and extracts all import/require specifiers.
+* Scans source code and extracts all imports with metadata.
 *
 * Handles: static imports, dynamic imports, require(), re-exports.
 * Ignores imports inside comments. Imports inside string literals may
@@ -103,12 +90,41 @@ const requireRe = /\brequire\s*\(\s*['"]([^'"]+)['"]\s*\)/g;
 */
 function scanImports(code) {
 	const stripped = stripComments(code);
-	const specifiers = /* @__PURE__ */ new Set();
-	for (const m of stripped.matchAll(fromRe)) specifiers.add(m[1]);
-	for (const m of stripped.matchAll(sideEffectRe)) specifiers.add(m[1]);
-	for (const m of stripped.matchAll(dynamicRe)) specifiers.add(m[1]);
-	for (const m of stripped.matchAll(requireRe)) specifiers.add(m[1]);
-	return [...specifiers];
+	const results = [];
+	for (const m of stripped.matchAll(nsImportRe)) results.push({
+		path: m[1],
+		isNamespace: true
+	});
+	for (const m of stripped.matchAll(namedImportRe)) {
+		const specifiers = parseSpecifiers(m[2]);
+		if (m[1]) specifiers.unshift("default");
+		results.push({
+			path: m[3],
+			specifiers
+		});
+	}
+	for (const m of stripped.matchAll(defaultImportRe)) results.push({
+		path: m[2],
+		specifiers: ["default"]
+	});
+	for (const m of stripped.matchAll(reexportStarRe)) results.push({
+		path: m[1],
+		isNamespace: true
+	});
+	for (const m of stripped.matchAll(reexportNamedRe)) results.push({
+		path: m[2],
+		specifiers: parseSpecifiers(m[1])
+	});
+	for (const m of stripped.matchAll(sideEffectRe)) results.push({
+		path: m[1],
+		isSideEffect: true
+	});
+	for (const m of stripped.matchAll(dynamicRe)) results.push({
+		path: m[1],
+		isDynamic: true
+	});
+	for (const m of stripped.matchAll(requireRe)) results.push({ path: m[1] });
+	return results;
 }
 //#endregion
 //#region src/resolver.ts
@@ -192,9 +208,43 @@ function createResolver(basedir, options) {
 }
 //#endregion
 //#region src/walker.ts
+function buildEdges(rawImports, resolveSpecifier, filePath) {
+	const edges = [];
+	const externals = [];
+	for (const raw of rawImports) {
+		const resolved = resolveSpecifier(raw.path, filePath);
+		if (!resolved) continue;
+		if (resolved.type === "external" && resolved.specifier) externals.push(resolved.specifier);
+		else if (resolved.type === "local" && resolved.absolutePath) {
+			const existing = edges.find((e) => e.path === resolved.absolutePath);
+			if (existing) {
+				if (raw.isNamespace) {
+					existing.isNamespace = true;
+					existing.specifiers = void 0;
+					existing.isSideEffect = void 0;
+				} else if (raw.specifiers && !existing.isNamespace) {
+					(existing.specifiers ??= []).push(...raw.specifiers);
+					existing.isSideEffect = void 0;
+				}
+				if (raw.isSideEffect && !existing.specifiers && !existing.isNamespace) existing.isSideEffect = true;
+				if (raw.isDynamic) existing.isDynamic = true;
+			} else edges.push({
+				path: resolved.absolutePath,
+				specifiers: raw.specifiers,
+				isNamespace: raw.isNamespace,
+				isDynamic: raw.isDynamic,
+				isSideEffect: raw.isSideEffect
+			});
+		}
+	}
+	return {
+		edges,
+		externals
+	};
+}
 /**
-* Recursively walks imports starting from an entry file and builds
-* the full dependency tree.
+* Walks imports starting from an entry file and builds the full dependency tree.
+* Uses iterative DFS with an explicit stack to avoid call-stack limits on deep chains.
 */
 async function walk(entryFile, options) {
 	const entrypoint = resolve(entryFile);
@@ -202,26 +252,27 @@ async function walk(entryFile, options) {
 	const graph = {};
 	const externals = /* @__PURE__ */ new Set();
 	const visited = /* @__PURE__ */ new Set();
-	async function visit(filePath) {
-		if (visited.has(filePath)) return;
+	const stack = [entrypoint];
+	while (stack.length > 0) {
+		const filePath = stack.pop();
+		if (visited.has(filePath)) continue;
 		visited.add(filePath);
-		const specifiers = scanImports(await readFile(filePath, "utf-8"));
-		const localDeps = [];
-		for (const spec of specifiers) {
-			const resolved = resolveSpecifier(spec, filePath);
-			if (!resolved) continue;
-			if (resolved.type === "external" && resolved.specifier) externals.add(resolved.specifier);
-			else if (resolved.type === "local" && resolved.absolutePath) localDeps.push(resolved.absolutePath);
-		}
-		graph[filePath] = localDeps;
-		await Promise.all(localDeps.map((dep) => visit(dep)));
+		const { edges, externals: fileExternals } = buildEdges(scanImports(readFileSync(filePath, "utf-8")), resolveSpecifier, filePath);
+		for (const ext of fileExternals) externals.add(ext);
+		graph[filePath] = edges;
+		for (const edge of edges) stack.push(edge.path);
 	}
-	await visit(entrypoint);
 	const reverseGraph = {};
 	for (const file of Object.keys(graph)) reverseGraph[file] = [];
-	for (const [file, deps] of Object.entries(graph)) for (const dep of deps) {
-		if (!reverseGraph[dep]) reverseGraph[dep] = [];
-		reverseGraph[dep].push(file);
+	for (const [file, edges] of Object.entries(graph)) for (const edge of edges) {
+		if (!reverseGraph[edge.path]) reverseGraph[edge.path] = [];
+		reverseGraph[edge.path].push({
+			path: file,
+			specifiers: edge.specifiers,
+			isNamespace: edge.isNamespace,
+			isDynamic: edge.isDynamic,
+			isSideEffect: edge.isSideEffect
+		});
 	}
 	return {
 		entrypoint,
@@ -254,6 +305,26 @@ async function importree(entry, options) {
 	return walk(entry, options ?? {});
 }
 /**
+* Parses a single file and returns its direct import edges without recursive traversal.
+*
+* @example
+* ```ts
+* const edges = parseImports('./src/components/Button.tsx', {
+*   aliases: { '@': './src' },
+* });
+*
+* for (const edge of edges) {
+*   console.log(edge.path, edge.specifiers);
+* }
+* ```
+*/
+function parseImports(filePath, options) {
+	const absolutePath = resolve(filePath);
+	const resolveSpecifier = createResolver(options?.rootDir ? resolve(options.rootDir) : process.cwd(), options ?? {});
+	const { edges } = buildEdges(scanImports(readFileSync(absolutePath, "utf-8")), resolveSpecifier, absolutePath);
+	return edges;
+}
+/**
 * Given an import tree and a changed file, returns all files that
 * transitively depend on the changed file (i.e., files that would
 * need to be re-evaluated if the changed file is modified).
@@ -269,15 +340,15 @@ function getAffectedFiles(tree, changedFile) {
 		const current = queue.shift();
 		const dependents = tree.reverseGraph[current];
 		if (!dependents) continue;
-		for (const parent of dependents) if (!affected.has(parent)) {
-			affected.add(parent);
-			queue.push(parent);
+		for (const edge of dependents) if (!affected.has(edge.path)) {
+			affected.add(edge.path);
+			queue.push(edge.path);
 		}
 	}
 	affected.delete(absolute);
 	return [...affected].sort();
 }
 //#endregion
-export { getAffectedFiles, importree };
+export { getAffectedFiles, importree, parseImports };
 //# sourceMappingURL=index.mjs.map

package/dist/index.mjs.map CHANGED Viewed

	@@ -1 +1 @@
1	- {"version":3,"file":"index.mjs","names":[],"sources":["../src/scanner.ts","../src/resolver.ts","../src/walker.ts","../src/index.ts"],"sourcesContent":["/*\n Strips comments from source code while preserving string literals.\n \n Comments are replaced with spaces (preserving newlines). Strings and\n * template literals are left intact so that import specifiers inside\n * `from 'specifier'` remain extractable. The function correctly handles\n * comment-like sequences inside strings (e.g., `'//'` won't start a comment).\n /\nexport function stripComments(code: string): string {\n const len = code.length;\n const result: string[] = new Array(len);\n let i = 0;\n\n while (i < len) {\n const ch = code[i];\n const next = i + 1 < len ? code[i + 1] : '';\n\n // Line comment → blank to end of line\n if (ch === '/' && next === '/') {\n result[i++] = ' ';\n result[i++] = ' ';\n while (i < len && code[i] !== '\\n') {\n result[i++] = ' ';\n }\n continue;\n }\n\n // Block comment → blank to closing /\n if (ch === '/' && next === '') {\n result[i++] = ' ';\n result[i++] = ' ';\n while (i < len && !(code[i] === '' && i + 1 < len && code[i + 1] === '/')) {\n result[i] = code[i] === '\\n' ? '\\n' : ' ';\n i++;\n }\n if (i < len) {\n result[i++] = ' '; // \n result[i++] = ' '; // /\n }\n continue;\n }\n\n // Single or double quoted string — copy verbatim (skip past to avoid\n // misidentifying comment markers inside strings)\n if (ch === \"'\" \|\| ch === '\"') {\n const quote = ch;\n result[i] = code[i];\n i++;\n while (i < len && code[i] !== quote) {\n if (code[i] === '\\\\' && i + 1 < len) {\n result[i] = code[i];\n i++;\n result[i] = code[i];\n i++;\n } else {\n result[i] = code[i];\n i++;\n }\n }\n if (i < len) {\n result[i] = code[i];\n i++;\n }\n continue;\n }\n\n // Template literal — copy verbatim, handling ${} nesting\n if (ch === '`') {\n result[i] = code[i];\n i++;\n let depth = 0;\n while (i < len) {\n if (code[i] === '\\\\' && i + 1 < len) {\n result[i] = code[i];\n i++;\n result[i] = code[i];\n i++;\n } else if (code[i] === '$' && i + 1 < len && code[i + 1] === '{') {\n result[i] = code[i];\n i++;\n result[i] = code[i];\n i++;\n depth++;\n } else if (code[i] === '}' && depth > 0) {\n result[i] = code[i];\n i++;\n depth--;\n } else if (code[i] === '`' && depth === 0) {\n result[i] = code[i];\n i++;\n break;\n } else {\n result[i] = code[i];\n i++;\n }\n }\n continue;\n }\n\n // Regular character\n result[i] = ch;\n i++;\n }\n\n return result.join('');\n}\n\n// Static regex patterns — compiled once\nconst fromRe = /\\bfrom\\s+['\"]([^'\"]+)['\"]/g;\nconst sideEffectRe = /\\bimport\\s+['\"]([^'\"]+)['\"]/g;\nconst dynamicRe = /\\bimport\\s\$\\s['\"]([^'\"]+)['\"]\\s\$/g;\nconst requireRe = /\\brequire\\s\$\\s['\"]([^'\"]+)['\"]\\s\$/g;\n\n/\n Scans source code and extracts all import/require specifiers.\n \n Handles: static imports, dynamic imports, require(), re-exports.\n * Ignores imports inside comments. Imports inside string literals may\n * produce false positives, but unresolvable paths are silently skipped\n * by the resolver.\n /\nexport function scanImports(code: string): string[] {\n const stripped = stripComments(code);\n const specifiers = new Set<string>();\n\n for (const m of stripped.matchAll(fromRe)) specifiers.add(m[1]);\n for (const m of stripped.matchAll(sideEffectRe)) specifiers.add(m[1]);\n for (const m of stripped.matchAll(dynamicRe)) specifiers.add(m[1]);\n for (const m of stripped.matchAll(requireRe)) specifiers.add(m[1]);\n\n return [...specifiers];\n}\n","import { statSync } from 'node:fs';\nimport { dirname, join, resolve, isAbsolute } from 'node:path';\nimport type { ImportreeOptions, ResolvedImport } from './types.js';\n\nconst DEFAULT_EXTENSIONS = ['.ts', '.tsx', '.js', '.jsx', '.mjs', '.cjs'];\n\nfunction fileExists(filePath: string): boolean {\n const stat = statSync(filePath, { throwIfNoEntry: false });\n return stat !== undefined && stat.isFile();\n}\n\nfunction dirExists(filePath: string): boolean {\n const stat = statSync(filePath, { throwIfNoEntry: false });\n return stat !== undefined && stat.isDirectory();\n}\n\n/\n Extract the bare package name from an import specifier.\n * - Scoped: `@scope/pkg/path` → `@scope/pkg`\n * - Unscoped: `pkg/path` → `pkg`\n /\nfunction getBareSpecifier(specifier: string): string {\n if (specifier.startsWith('@')) {\n const parts = specifier.split('/');\n return parts.length >= 2 ? `${parts[0]}/${parts[1]}` : specifier;\n }\n return specifier.split('/')[0];\n}\n\nfunction resolveFile(\n filePath: string,\n extensions: string[],\n): string \| undefined {\n // Try exact path\n if (fileExists(filePath)) return filePath;\n\n // Try with each extension\n for (const ext of extensions) {\n const withExt = filePath + ext;\n if (fileExists(withExt)) return withExt;\n }\n\n // Try as directory with index file\n if (dirExists(filePath)) {\n for (const ext of extensions) {\n const indexPath = join(filePath, `index${ext}`);\n if (fileExists(indexPath)) return indexPath;\n }\n }\n\n return undefined;\n}\n\nexport interface Resolver {\n (specifier: string, fromFile: string): ResolvedImport \| undefined;\n}\n\n/\n Creates a resolver function that resolves import specifiers to absolute\n * file paths, with support for aliases and extension probing.\n /\nexport function createResolver(\n basedir: string,\n options: ImportreeOptions,\n): Resolver {\n const extensions = options.extensions ?? DEFAULT_EXTENSIONS;\n\n // Sort aliases by key length descending for longest-prefix matching\n const aliases = options.aliases\n ? Object.entries(options.aliases).sort((a, b) => b[0].length - a[0].length)\n : [];\n\n const resolvedAliasValues = aliases.map(([key, value]) => [\n key,\n isAbsolute(value) ? value : resolve(basedir, value),\n ] as const);\n\n const cache = new Map<string, ResolvedImport \| undefined>();\n\n return function resolveSpecifier(\n specifier: string,\n fromFile: string,\n ): ResolvedImport \| undefined {\n const fromDir = dirname(fromFile);\n const cacheKey = `${specifier}\\0${fromDir}`;\n\n if (cache.has(cacheKey)) return cache.get(cacheKey);\n\n let result: ResolvedImport \| undefined;\n\n // Relative import\n if (specifier.startsWith('./') \|\| specifier.startsWith('../')) {\n const absolutePath = resolveFile(resolve(fromDir, specifier), extensions);\n if (absolutePath) {\n result = { type: 'local', absolutePath };\n }\n }\n // Check aliases\n else {\n let matched = false;\n for (const [prefix, replacement] of resolvedAliasValues) {\n if (specifier === prefix \|\| specifier.startsWith(prefix + '/')) {\n const rest = specifier === prefix ? '' : specifier.slice(prefix.length);\n const absolutePath = resolveFile(join(replacement, rest), extensions);\n if (absolutePath) {\n result = { type: 'local', absolutePath };\n }\n matched = true;\n break;\n }\n }\n\n // Bare specifier → external\n if (!matched) {\n result = { type: 'external', specifier: getBareSpecifier(specifier) };\n }\n }\n\n cache.set(cacheKey, result);\n return result;\n };\n}\n","import { readFile } from 'node:fs/promises';\nimport { resolve } from 'node:path';\nimport type { ImportreeOptions, ImportTree } from './types.js';\nimport { scanImports } from './scanner.js';\nimport { createResolver } from './resolver.js';\n\n/\n Recursively walks imports starting from an entry file and builds\n * the full dependency tree.\n /\nexport async function walk(\n entryFile: string,\n options: ImportreeOptions,\n): Promise<ImportTree> {\n const entrypoint = resolve(entryFile);\n const basedir = options.rootDir ? resolve(options.rootDir) : process.cwd();\n const resolveSpecifier = createResolver(basedir, options);\n\n const graph: Record<string, string[]> = {};\n const externals = new Set<string>();\n const visited = new Set<string>();\n\n async function visit(filePath: string): Promise<void> {\n if (visited.has(filePath)) return;\n visited.add(filePath);\n\n const content = await readFile(filePath, 'utf-8');\n const specifiers = scanImports(content);\n\n const localDeps: string[] = [];\n for (const spec of specifiers) {\n const resolved = resolveSpecifier(spec, filePath);\n if (!resolved) continue;\n\n if (resolved.type === 'external' && resolved.specifier) {\n externals.add(resolved.specifier);\n } else if (resolved.type === 'local' && resolved.absolutePath) {\n localDeps.push(resolved.absolutePath);\n }\n }\n\n graph[filePath] = localDeps;\n\n await Promise.all(localDeps.map((dep) => visit(dep)));\n }\n\n await visit(entrypoint);\n\n // Build reverse graph\n const reverseGraph: Record<string, string[]> = {};\n for (const file of Object.keys(graph)) {\n reverseGraph[file] = [];\n }\n for (const [file, deps] of Object.entries(graph)) {\n for (const dep of deps) {\n if (!reverseGraph[dep]) reverseGraph[dep] = [];\n reverseGraph[dep].push(file);\n }\n }\n\n return {\n entrypoint,\n files: Object.keys(graph).sort(),\n externals: [...externals].sort(),\n graph,\n reverseGraph,\n };\n}\n","import { resolve } from 'node:path';\nimport type { ImportreeOptions, ImportTree } from './types.js';\nimport { walk } from './walker.js';\n\nexport type { ImportreeOptions, ImportTree } from './types.js';\n\n/\n Builds a full import dependency tree starting from an entry file.\n \n Recursively resolves all static imports, dynamic imports, require() calls,\n * and re-exports. Supports path aliases for custom resolution.\n \n @example\n * ```ts\n * const tree = await importree('./src/index.ts', {\n * aliases: { '@': './src' },\n * });\n \n console.log(tree.files); // all local dependency file paths\n * console.log(tree.externals); // external package names\n * console.log(tree.graph); // file → direct dependencies\n * ```\n /\nexport async function importree(\n entry: string,\n options?: ImportreeOptions,\n): Promise<ImportTree> {\n return walk(entry, options ?? {});\n}\n\n/\n Given an import tree and a changed file, returns all files that\n * transitively depend on the changed file (i.e., files that would\n * need to be re-evaluated if the changed file is modified).\n \n The changed file itself is NOT included in the result.\n */\nexport function getAffectedFiles(\n tree: ImportTree,\n changedFile: string,\n): string[] {\n const absolute = resolve(changedFile);\n\n if (!tree.reverseGraph[absolute]) return [];\n\n const affected = new Set<string>();\n const queue = [absolute];\n\n while (queue.length > 0) {\n const current = queue.shift()!;\n const dependents = tree.reverseGraph[current];\n if (!dependents) continue;\n\n for (const parent of dependents) {\n if (!affected.has(parent)) {\n affected.add(parent);\n queue.push(parent);\n }\n }\n }\n\n affected.delete(absolute);\n return [...affected].sort();\n}\n"],"mappings":";;;;;;;;;;;;AAQA,SAAgB,cAAc,MAAsB;CAClD,MAAM,MAAM,KAAK;CACjB,MAAM,SAAmB,IAAI,MAAM,IAAI;CACvC,IAAI,IAAI;AAER,QAAO,IAAI,KAAK;EACd,MAAM,KAAK,KAAK;EAChB,MAAM,OAAO,IAAI,IAAI,MAAM,KAAK,IAAI,KAAK;AAGzC,MAAI,OAAO,OAAO,SAAS,KAAK;AAC9B,UAAO,OAAO;AACd,UAAO,OAAO;AACd,UAAO,IAAI,OAAO,KAAK,OAAO,KAC5B,QAAO,OAAO;AAEhB;;AAIF,MAAI,OAAO,OAAO,SAAS,KAAK;AAC9B,UAAO,OAAO;AACd,UAAO,OAAO;AACd,UAAO,IAAI,OAAO,EAAE,KAAK,OAAO,OAAO,IAAI,IAAI,OAAO,KAAK,IAAI,OAAO,MAAM;AAC1E,WAAO,KAAK,KAAK,OAAO,OAAO,OAAO;AACtC;;AAEF,OAAI,IAAI,KAAK;AACX,WAAO,OAAO;AACd,WAAO,OAAO;;AAEhB;;AAKF,MAAI,OAAO,OAAO,OAAO,MAAK;GAC5B,MAAM,QAAQ;AACd,UAAO,KAAK,KAAK;AACjB;AACA,UAAO,IAAI,OAAO,KAAK,OAAO,MAC5B,KAAI,KAAK,OAAO,QAAQ,IAAI,IAAI,KAAK;AACnC,WAAO,KAAK,KAAK;AACjB;AACA,WAAO,KAAK,KAAK;AACjB;UACK;AACL,WAAO,KAAK,KAAK;AACjB;;AAGJ,OAAI,IAAI,KAAK;AACX,WAAO,KAAK,KAAK;AACjB;;AAEF;;AAIF,MAAI,OAAO,KAAK;AACd,UAAO,KAAK,KAAK;AACjB;GACA,IAAI,QAAQ;AACZ,UAAO,IAAI,IACT,KAAI,KAAK,OAAO,QAAQ,IAAI,IAAI,KAAK;AACnC,WAAO,KAAK,KAAK;AACjB;AACA,WAAO,KAAK,KAAK;AACjB;cACS,KAAK,OAAO,OAAO,IAAI,IAAI,OAAO,KAAK,IAAI,OAAO,KAAK;AAChE,WAAO,KAAK,KAAK;AACjB;AACA,WAAO,KAAK,KAAK;AACjB;AACA;cACS,KAAK,OAAO,OAAO,QAAQ,GAAG;AACvC,WAAO,KAAK,KAAK;AACjB;AACA;cACS,KAAK,OAAO,OAAO,UAAU,GAAG;AACzC,WAAO,KAAK,KAAK;AACjB;AACA;UACK;AACL,WAAO,KAAK,KAAK;AACjB;;AAGJ;;AAIF,SAAO,KAAK;AACZ;;AAGF,QAAO,OAAO,KAAK,GAAG;;AAIxB,MAAM,SAAS;AACf,MAAM,eAAe;AACrB,MAAM,YAAY;AAClB,MAAM,YAAY;;;;;;;;;AAUlB,SAAgB,YAAY,MAAwB;CAClD,MAAM,WAAW,cAAc,KAAK;CACpC,MAAM,6BAAa,IAAI,KAAa;AAEpC,MAAK,MAAM,KAAK,SAAS,SAAS,OAAO,CAAE,YAAW,IAAI,EAAE,GAAG;AAC/D,MAAK,MAAM,KAAK,SAAS,SAAS,aAAa,CAAE,YAAW,IAAI,EAAE,GAAG;AACrE,MAAK,MAAM,KAAK,SAAS,SAAS,UAAU,CAAE,YAAW,IAAI,EAAE,GAAG;AAClE,MAAK,MAAM,KAAK,SAAS,SAAS,UAAU,CAAE,YAAW,IAAI,EAAE,GAAG;AAElE,QAAO,CAAC,GAAG,WAAW;;;;AC9HxB,MAAM,qBAAqB;CAAC;CAAO;CAAQ;CAAO;CAAQ;CAAQ;CAAO;AAEzE,SAAS,WAAW,UAA2B;CAC7C,MAAM,OAAO,SAAS,UAAU,EAAE,gBAAgB,OAAO,CAAC;AAC1D,QAAO,SAAS,KAAA,KAAa,KAAK,QAAQ;;AAG5C,SAAS,UAAU,UAA2B;CAC5C,MAAM,OAAO,SAAS,UAAU,EAAE,gBAAgB,OAAO,CAAC;AAC1D,QAAO,SAAS,KAAA,KAAa,KAAK,aAAa;;;;;;;AAQjD,SAAS,iBAAiB,WAA2B;AACnD,KAAI,UAAU,WAAW,IAAI,EAAE;EAC7B,MAAM,QAAQ,UAAU,MAAM,IAAI;AAClC,SAAO,MAAM,UAAU,IAAI,GAAG,MAAM,GAAG,GAAG,MAAM,OAAO;;AAEzD,QAAO,UAAU,MAAM,IAAI,CAAC;;AAG9B,SAAS,YACP,UACA,YACoB;AAEpB,KAAI,WAAW,SAAS,CAAE,QAAO;AAGjC,MAAK,MAAM,OAAO,YAAY;EAC5B,MAAM,UAAU,WAAW;AAC3B,MAAI,WAAW,QAAQ,CAAE,QAAO;;AAIlC,KAAI,UAAU,SAAS,CACrB,MAAK,MAAM,OAAO,YAAY;EAC5B,MAAM,YAAY,KAAK,UAAU,QAAQ,MAAM;AAC/C,MAAI,WAAW,UAAU,CAAE,QAAO;;;;;;;AAexC,SAAgB,eACd,SACA,SACU;CACV,MAAM,aAAa,QAAQ,cAAc;CAOzC,MAAM,uBAJU,QAAQ,UACpB,OAAO,QAAQ,QAAQ,QAAQ,CAAC,MAAM,GAAG,MAAM,EAAE,GAAG,SAAS,EAAE,GAAG,OAAO,GACzE,EAAE,EAE8B,KAAK,CAAC,KAAK,WAAW,CACxD,KACA,WAAW,MAAM,GAAG,QAAQ,QAAQ,SAAS,MAAM,CACpD,CAAU;CAEX,MAAM,wBAAQ,IAAI,KAAyC;AAE3D,QAAO,SAAS,iBACd,WACA,UAC4B;EAC5B,MAAM,UAAU,QAAQ,SAAS;EACjC,MAAM,WAAW,GAAG,UAAU,IAAI;AAElC,MAAI,MAAM,IAAI,SAAS,CAAE,QAAO,MAAM,IAAI,SAAS;EAEnD,IAAI;AAGJ,MAAI,UAAU,WAAW,KAAK,IAAI,UAAU,WAAW,MAAM,EAAE;GAC7D,MAAM,eAAe,YAAY,QAAQ,SAAS,UAAU,EAAE,WAAW;AACzE,OAAI,aACF,UAAS;IAAE,MAAM;IAAS;IAAc;SAIvC;GACH,IAAI,UAAU;AACd,QAAK,MAAM,CAAC,QAAQ,gBAAgB,oBAClC,KAAI,cAAc,UAAU,UAAU,WAAW,SAAS,IAAI,EAAE;IAE9D,MAAM,eAAe,YAAY,KAAK,aADzB,cAAc,SAAS,KAAK,UAAU,MAAM,OAAO,OAAO,CACf,EAAE,WAAW;AACrE,QAAI,aACF,UAAS;KAAE,MAAM;KAAS;KAAc;AAE1C,cAAU;AACV;;AAKJ,OAAI,CAAC,QACH,UAAS;IAAE,MAAM;IAAY,WAAW,iBAAiB,UAAU;IAAE;;AAIzE,QAAM,IAAI,UAAU,OAAO;AAC3B,SAAO;;;;;;;;;AC7GX,eAAsB,KACpB,WACA,SACqB;CACrB,MAAM,aAAa,QAAQ,UAAU;CAErC,MAAM,mBAAmB,eADT,QAAQ,UAAU,QAAQ,QAAQ,QAAQ,GAAG,QAAQ,KAAK,EACzB,QAAQ;CAEzD,MAAM,QAAkC,EAAE;CAC1C,MAAM,4BAAY,IAAI,KAAa;CACnC,MAAM,0BAAU,IAAI,KAAa;CAEjC,eAAe,MAAM,UAAiC;AACpD,MAAI,QAAQ,IAAI,SAAS,CAAE;AAC3B,UAAQ,IAAI,SAAS;EAGrB,MAAM,aAAa,YADH,MAAM,SAAS,UAAU,QAAQ,CACV;EAEvC,MAAM,YAAsB,EAAE;AAC9B,OAAK,MAAM,QAAQ,YAAY;GAC7B,MAAM,WAAW,iBAAiB,MAAM,SAAS;AACjD,OAAI,CAAC,SAAU;AAEf,OAAI,SAAS,SAAS,cAAc,SAAS,UAC3C,WAAU,IAAI,SAAS,UAAU;YACxB,SAAS,SAAS,WAAW,SAAS,aAC/C,WAAU,KAAK,SAAS,aAAa;;AAIzC,QAAM,YAAY;AAElB,QAAM,QAAQ,IAAI,UAAU,KAAK,QAAQ,MAAM,IAAI,CAAC,CAAC;;AAGvD,OAAM,MAAM,WAAW;CAGvB,MAAM,eAAyC,EAAE;AACjD,MAAK,MAAM,QAAQ,OAAO,KAAK,MAAM,CACnC,cAAa,QAAQ,EAAE;AAEzB,MAAK,MAAM,CAAC,MAAM,SAAS,OAAO,QAAQ,MAAM,CAC9C,MAAK,MAAM,OAAO,MAAM;AACtB,MAAI,CAAC,aAAa,KAAM,cAAa,OAAO,EAAE;AAC9C,eAAa,KAAK,KAAK,KAAK;;AAIhC,QAAO;EACL;EACA,OAAO,OAAO,KAAK,MAAM,CAAC,MAAM;EAChC,WAAW,CAAC,GAAG,UAAU,CAAC,MAAM;EAChC;EACA;EACD;;;;;;;;;;;;;;;;;;;;;AC3CH,eAAsB,UACpB,OACA,SACqB;AACrB,QAAO,KAAK,OAAO,WAAW,EAAE,CAAC;;;;;;;;;AAUnC,SAAgB,iBACd,MACA,aACU;CACV,MAAM,WAAW,QAAQ,YAAY;AAErC,KAAI,CAAC,KAAK,aAAa,UAAW,QAAO,EAAE;CAE3C,MAAM,2BAAW,IAAI,KAAa;CAClC,MAAM,QAAQ,CAAC,SAAS;AAExB,QAAO,MAAM,SAAS,GAAG;EACvB,MAAM,UAAU,MAAM,OAAO;EAC7B,MAAM,aAAa,KAAK,aAAa;AACrC,MAAI,CAAC,WAAY;AAEjB,OAAK,MAAM,UAAU,WACnB,KAAI,CAAC,SAAS,IAAI,OAAO,EAAE;AACzB,YAAS,IAAI,OAAO;AACpB,SAAM,KAAK,OAAO;;;AAKxB,UAAS,OAAO,SAAS;AACzB,QAAO,CAAC,GAAG,SAAS,CAAC,MAAM"}
1	+ {"version":3,"file":"index.mjs","names":[],"sources":["../src/scanner.ts","../src/resolver.ts","../src/walker.ts","../src/index.ts"],"sourcesContent":["/*\n Strips comments from source code while preserving string literals.\n \n Line comments (`//`) are removed entirely. Block comments are replaced\n * with a single space (newlines within them are preserved). Strings and\n * template literals are left intact so that import specifiers inside\n * `from 'specifier'` remain extractable. The function correctly handles\n * comment-like sequences inside strings (e.g., `'//'` won't start a comment).\n /\nexport function stripComments(code: string): string {\n const len = code.length;\n const parts: string[] = [];\n let i = 0;\n let segStart = 0;\n\n while (i < len) {\n const ch = code[i];\n const next = i + 1 < len ? code[i + 1] : \"\";\n\n if (ch === \"/\" && next === \"/\") {\n parts.push(code.slice(segStart, i));\n while (i < len && code[i] !== \"\\n\") i++;\n segStart = i;\n continue;\n }\n\n if (ch === \"/\" && next === \"\") {\n parts.push(code.slice(segStart, i));\n i += 2;\n while (i < len && !(code[i] === \"\" && i + 1 < len && code[i + 1] === \"/\")) {\n if (code[i] === \"\\n\") parts.push(\"\\n\");\n i++;\n }\n if (i < len) i += 2;\n parts.push(\" \");\n segStart = i;\n continue;\n }\n\n if (ch === \"'\" \|\| ch === '\"') {\n const quote = ch;\n i++;\n while (i < len && code[i] !== quote) {\n if (code[i] === \"\\\\\" && i + 1 < len) i++;\n i++;\n }\n if (i < len) i++;\n continue;\n }\n\n if (ch === \"`\") {\n i++;\n let depth = 0;\n while (i < len) {\n if (code[i] === \"\\\\\" && i + 1 < len) {\n i += 2;\n } else if (code[i] === \"$\" && i + 1 < len && code[i + 1] === \"{\") {\n i += 2;\n depth++;\n } else if (code[i] === \"}\" && depth > 0) {\n i++;\n depth--;\n } else if (code[i] === \"`\" && depth === 0) {\n i++;\n break;\n } else {\n i++;\n }\n }\n continue;\n }\n\n i++;\n }\n\n parts.push(code.slice(segStart));\n return parts.join(\"\");\n}\n\nexport interface RawImport {\n path: string;\n specifiers?: string[];\n isNamespace?: boolean;\n isDynamic?: boolean;\n isSideEffect?: boolean;\n}\n\n// Static regex patterns — compiled once\nconst nsImportRe = /\\bimport\\s+\\\\s+as\\s+[$\\w]+\\s+from\\s+['\"]([^'\"]+)['\"]/g;\nconst namedImportRe =\n /\\bimport\\s+(?:type\\s+)?(?:([$\\w]+)\\s,\\s)?\\{([^}])\\}\\s+from\\s+['\"]([^'\"]+)['\"]/g;\nconst defaultImportRe = /\\bimport\\s+(?:type\\s+)?([$\\w]+)\\s+from\\s+['\"]([^'\"]+)['\"]/g;\nconst reexportStarRe = /\\bexport\\s+\\\\s+(?:as\\s+[$\\w]+\\s+)?from\\s+['\"]([^'\"]+)['\"]/g;\nconst reexportNamedRe = /\\bexport\\s+(?:type\\s+)?\\{([^}])\\}\\s+from\\s+['\"]([^'\"]+)['\"]/g;\nconst sideEffectRe = /\\bimport\\s+['\"]([^'\"]+)['\"]/g;\nconst dynamicRe = /\\bimport\\s\$\\s['\"]([^'\"]+)['\"]\\s\$/g;\nconst requireRe = /\\brequire\\s\$\\s['\"]([^'\"]+)['\"]\\s\$/g;\n\nexport function parseSpecifiers(clause: string): string[] {\n return clause\n .split(\",\")\n .map((s) => s.trim())\n .filter(Boolean)\n .map((s) => {\n const withoutType = s.replace(/^type\\s+/, \"\");\n const parts = withoutType.split(/\\s+as\\s+/);\n return parts[0].trim();\n })\n .filter(Boolean);\n}\n\n/\n Scans source code and extracts all imports with metadata.\n \n Handles: static imports, dynamic imports, require(), re-exports.\n * Ignores imports inside comments. Imports inside string literals may\n * produce false positives, but unresolvable paths are silently skipped\n * by the resolver.\n /\nexport function scanImports(code: string): RawImport[] {\n const stripped = stripComments(code);\n const results: RawImport[] = [];\n\n for (const m of stripped.matchAll(nsImportRe)) {\n results.push({ path: m[1], isNamespace: true });\n }\n\n for (const m of stripped.matchAll(namedImportRe)) {\n const specifiers = parseSpecifiers(m[2]);\n if (m[1]) specifiers.unshift(\"default\");\n results.push({ path: m[3], specifiers });\n }\n\n for (const m of stripped.matchAll(defaultImportRe)) {\n results.push({ path: m[2], specifiers: [\"default\"] });\n }\n\n for (const m of stripped.matchAll(reexportStarRe)) {\n results.push({ path: m[1], isNamespace: true });\n }\n\n for (const m of stripped.matchAll(reexportNamedRe)) {\n results.push({ path: m[2], specifiers: parseSpecifiers(m[1]) });\n }\n\n for (const m of stripped.matchAll(sideEffectRe)) {\n results.push({ path: m[1], isSideEffect: true });\n }\n\n for (const m of stripped.matchAll(dynamicRe)) {\n results.push({ path: m[1], isDynamic: true });\n }\n\n for (const m of stripped.matchAll(requireRe)) {\n results.push({ path: m[1] });\n }\n\n return results;\n}\n","import { statSync } from \"node:fs\";\nimport { dirname, join, resolve, isAbsolute } from \"node:path\";\nimport type { ImportreeOptions, ResolvedImport } from \"./types.js\";\n\nconst DEFAULT_EXTENSIONS = [\".ts\", \".tsx\", \".js\", \".jsx\", \".mjs\", \".cjs\"];\n\nfunction fileExists(filePath: string): boolean {\n const stat = statSync(filePath, { throwIfNoEntry: false });\n return stat !== undefined && stat.isFile();\n}\n\nfunction dirExists(filePath: string): boolean {\n const stat = statSync(filePath, { throwIfNoEntry: false });\n return stat !== undefined && stat.isDirectory();\n}\n\n/\n Extract the bare package name from an import specifier.\n * - Scoped: `@scope/pkg/path` → `@scope/pkg`\n * - Unscoped: `pkg/path` → `pkg`\n /\nfunction getBareSpecifier(specifier: string): string {\n if (specifier.startsWith(\"@\")) {\n const parts = specifier.split(\"/\");\n return parts.length >= 2 ? `${parts[0]}/${parts[1]}` : specifier;\n }\n return specifier.split(\"/\")[0];\n}\n\nfunction resolveFile(filePath: string, extensions: string[]): string \| undefined {\n // Try exact path\n if (fileExists(filePath)) return filePath;\n\n // Try with each extension\n for (const ext of extensions) {\n const withExt = filePath + ext;\n if (fileExists(withExt)) return withExt;\n }\n\n // Try as directory with index file\n if (dirExists(filePath)) {\n for (const ext of extensions) {\n const indexPath = join(filePath, `index${ext}`);\n if (fileExists(indexPath)) return indexPath;\n }\n }\n\n return undefined;\n}\n\nexport interface Resolver {\n (specifier: string, fromFile: string): ResolvedImport \| undefined;\n}\n\n/\n Creates a resolver function that resolves import specifiers to absolute\n * file paths, with support for aliases and extension probing.\n /\nexport function createResolver(basedir: string, options: ImportreeOptions): Resolver {\n const extensions = options.extensions ?? DEFAULT_EXTENSIONS;\n\n // Sort aliases by key length descending for longest-prefix matching\n const aliases = options.aliases\n ? Object.entries(options.aliases).sort((a, b) => b[0].length - a[0].length)\n : [];\n\n const resolvedAliasValues = aliases.map(\n ([key, value]) => [key, isAbsolute(value) ? value : resolve(basedir, value)] as const,\n );\n\n const cache = new Map<string, ResolvedImport \| undefined>();\n\n return function resolveSpecifier(\n specifier: string,\n fromFile: string,\n ): ResolvedImport \| undefined {\n const fromDir = dirname(fromFile);\n const cacheKey = `${specifier}\\0${fromDir}`;\n\n if (cache.has(cacheKey)) return cache.get(cacheKey);\n\n let result: ResolvedImport \| undefined;\n\n // Relative import\n if (specifier.startsWith(\"./\") \|\| specifier.startsWith(\"../\")) {\n const absolutePath = resolveFile(resolve(fromDir, specifier), extensions);\n if (absolutePath) {\n result = { type: \"local\", absolutePath };\n }\n }\n // Check aliases\n else {\n let matched = false;\n for (const [prefix, replacement] of resolvedAliasValues) {\n if (specifier === prefix \|\| specifier.startsWith(prefix + \"/\")) {\n const rest = specifier === prefix ? \"\" : specifier.slice(prefix.length);\n const absolutePath = resolveFile(join(replacement, rest), extensions);\n if (absolutePath) {\n result = { type: \"local\", absolutePath };\n }\n matched = true;\n break;\n }\n }\n\n // Bare specifier → external\n if (!matched) {\n result = { type: \"external\", specifier: getBareSpecifier(specifier) };\n }\n }\n\n cache.set(cacheKey, result);\n return result;\n };\n}\n","import { readFileSync } from \"node:fs\";\nimport { resolve } from \"node:path\";\nimport type { ImportreeOptions, ImportTree, ImportEdge } from \"./types.js\";\nimport type { RawImport } from \"./scanner.js\";\nimport { scanImports } from \"./scanner.js\";\nimport type { Resolver } from \"./resolver.js\";\nimport { createResolver } from \"./resolver.js\";\n\nexport function buildEdges(\n rawImports: RawImport[],\n resolveSpecifier: Resolver,\n filePath: string,\n): { edges: ImportEdge[]; externals: string[] } {\n const edges: ImportEdge[] = [];\n const externals: string[] = [];\n\n for (const raw of rawImports) {\n const resolved = resolveSpecifier(raw.path, filePath);\n if (!resolved) continue;\n\n if (resolved.type === \"external\" && resolved.specifier) {\n externals.push(resolved.specifier);\n } else if (resolved.type === \"local\" && resolved.absolutePath) {\n const existing = edges.find((e) => e.path === resolved.absolutePath);\n if (existing) {\n if (raw.isNamespace) {\n existing.isNamespace = true;\n existing.specifiers = undefined;\n existing.isSideEffect = undefined;\n } else if (raw.specifiers && !existing.isNamespace) {\n (existing.specifiers ??= []).push(...raw.specifiers);\n existing.isSideEffect = undefined;\n }\n if (raw.isSideEffect && !existing.specifiers && !existing.isNamespace) {\n existing.isSideEffect = true;\n }\n if (raw.isDynamic) existing.isDynamic = true;\n } else {\n edges.push({\n path: resolved.absolutePath,\n specifiers: raw.specifiers,\n isNamespace: raw.isNamespace,\n isDynamic: raw.isDynamic,\n isSideEffect: raw.isSideEffect,\n });\n }\n }\n }\n\n return { edges, externals };\n}\n\n/\n Walks imports starting from an entry file and builds the full dependency tree.\n * Uses iterative DFS with an explicit stack to avoid call-stack limits on deep chains.\n /\nexport async function walk(entryFile: string, options: ImportreeOptions): Promise<ImportTree> {\n const entrypoint = resolve(entryFile);\n const basedir = options.rootDir ? resolve(options.rootDir) : process.cwd();\n const resolveSpecifier = createResolver(basedir, options);\n\n const graph: Record<string, ImportEdge[]> = {};\n const externals = new Set<string>();\n const visited = new Set<string>();\n const stack = [entrypoint];\n\n while (stack.length > 0) {\n const filePath = stack.pop()!;\n if (visited.has(filePath)) continue;\n visited.add(filePath);\n\n const content = readFileSync(filePath, \"utf-8\");\n const rawImports = scanImports(content);\n const { edges, externals: fileExternals } = buildEdges(rawImports, resolveSpecifier, filePath);\n\n for (const ext of fileExternals) externals.add(ext);\n graph[filePath] = edges;\n\n for (const edge of edges) stack.push(edge.path);\n }\n\n // Build reverse graph\n const reverseGraph: Record<string, ImportEdge[]> = {};\n for (const file of Object.keys(graph)) {\n reverseGraph[file] = [];\n }\n for (const [file, edges] of Object.entries(graph)) {\n for (const edge of edges) {\n if (!reverseGraph[edge.path]) reverseGraph[edge.path] = [];\n reverseGraph[edge.path].push({\n path: file,\n specifiers: edge.specifiers,\n isNamespace: edge.isNamespace,\n isDynamic: edge.isDynamic,\n isSideEffect: edge.isSideEffect,\n });\n }\n }\n\n return {\n entrypoint,\n files: Object.keys(graph).sort(),\n externals: [...externals].sort(),\n graph,\n reverseGraph,\n };\n}\n","import { readFileSync } from \"node:fs\";\nimport { resolve } from \"node:path\";\nimport type { ImportreeOptions, ImportTree, ImportEdge } from \"./types.js\";\nimport { buildEdges, walk } from \"./walker.js\";\nimport { scanImports } from \"./scanner.js\";\nimport { createResolver } from \"./resolver.js\";\n\nexport type { ImportreeOptions, ImportTree, ImportEdge } from \"./types.js\";\n\n/\n Builds a full import dependency tree starting from an entry file.\n \n Recursively resolves all static imports, dynamic imports, require() calls,\n * and re-exports. Supports path aliases for custom resolution.\n \n @example\n * ```ts\n * const tree = await importree('./src/index.ts', {\n * aliases: { '@': './src' },\n * });\n \n console.log(tree.files); // all local dependency file paths\n * console.log(tree.externals); // external package names\n * console.log(tree.graph); // file → direct dependencies\n * ```\n /\nexport async function importree(entry: string, options?: ImportreeOptions): Promise<ImportTree> {\n return walk(entry, options ?? {});\n}\n\n/\n Parses a single file and returns its direct import edges without recursive traversal.\n \n @example\n * ```ts\n * const edges = parseImports('./src/components/Button.tsx', {\n * aliases: { '@': './src' },\n * });\n \n for (const edge of edges) {\n * console.log(edge.path, edge.specifiers);\n * }\n * ```\n /\nexport function parseImports(filePath: string, options?: ImportreeOptions): ImportEdge[] {\n const absolutePath = resolve(filePath);\n const basedir = options?.rootDir ? resolve(options.rootDir) : process.cwd();\n const resolveSpecifier = createResolver(basedir, options ?? {});\n\n const content = readFileSync(absolutePath, \"utf-8\");\n const rawImports = scanImports(content);\n const { edges } = buildEdges(rawImports, resolveSpecifier, absolutePath);\n\n return edges;\n}\n\n/\n Given an import tree and a changed file, returns all files that\n * transitively depend on the changed file (i.e., files that would\n * need to be re-evaluated if the changed file is modified).\n \n The changed file itself is NOT included in the result.\n */\nexport function getAffectedFiles(tree: ImportTree, changedFile: string): string[] {\n const absolute = resolve(changedFile);\n\n if (!tree.reverseGraph[absolute]) return [];\n\n const affected = new Set<string>();\n const queue = [absolute];\n\n while (queue.length > 0) {\n const current = queue.shift()!;\n const dependents = tree.reverseGraph[current];\n if (!dependents) continue;\n\n for (const edge of dependents) {\n if (!affected.has(edge.path)) {\n affected.add(edge.path);\n queue.push(edge.path);\n }\n }\n }\n\n affected.delete(absolute);\n return [...affected].sort();\n}\n"],"mappings":";;;;;;;;;;;;AASA,SAAgB,cAAc,MAAsB;CAClD,MAAM,MAAM,KAAK;CACjB,MAAM,QAAkB,EAAE;CAC1B,IAAI,IAAI;CACR,IAAI,WAAW;AAEf,QAAO,IAAI,KAAK;EACd,MAAM,KAAK,KAAK;EAChB,MAAM,OAAO,IAAI,IAAI,MAAM,KAAK,IAAI,KAAK;AAEzC,MAAI,OAAO,OAAO,SAAS,KAAK;AAC9B,SAAM,KAAK,KAAK,MAAM,UAAU,EAAE,CAAC;AACnC,UAAO,IAAI,OAAO,KAAK,OAAO,KAAM;AACpC,cAAW;AACX;;AAGF,MAAI,OAAO,OAAO,SAAS,KAAK;AAC9B,SAAM,KAAK,KAAK,MAAM,UAAU,EAAE,CAAC;AACnC,QAAK;AACL,UAAO,IAAI,OAAO,EAAE,KAAK,OAAO,OAAO,IAAI,IAAI,OAAO,KAAK,IAAI,OAAO,MAAM;AAC1E,QAAI,KAAK,OAAO,KAAM,OAAM,KAAK,KAAK;AACtC;;AAEF,OAAI,IAAI,IAAK,MAAK;AAClB,SAAM,KAAK,IAAI;AACf,cAAW;AACX;;AAGF,MAAI,OAAO,OAAO,OAAO,MAAK;GAC5B,MAAM,QAAQ;AACd;AACA,UAAO,IAAI,OAAO,KAAK,OAAO,OAAO;AACnC,QAAI,KAAK,OAAO,QAAQ,IAAI,IAAI,IAAK;AACrC;;AAEF,OAAI,IAAI,IAAK;AACb;;AAGF,MAAI,OAAO,KAAK;AACd;GACA,IAAI,QAAQ;AACZ,UAAO,IAAI,IACT,KAAI,KAAK,OAAO,QAAQ,IAAI,IAAI,IAC9B,MAAK;YACI,KAAK,OAAO,OAAO,IAAI,IAAI,OAAO,KAAK,IAAI,OAAO,KAAK;AAChE,SAAK;AACL;cACS,KAAK,OAAO,OAAO,QAAQ,GAAG;AACvC;AACA;cACS,KAAK,OAAO,OAAO,UAAU,GAAG;AACzC;AACA;SAEA;AAGJ;;AAGF;;AAGF,OAAM,KAAK,KAAK,MAAM,SAAS,CAAC;AAChC,QAAO,MAAM,KAAK,GAAG;;AAYvB,MAAM,aAAa;AACnB,MAAM,gBACJ;AACF,MAAM,kBAAkB;AACxB,MAAM,iBAAiB;AACvB,MAAM,kBAAkB;AACxB,MAAM,eAAe;AACrB,MAAM,YAAY;AAClB,MAAM,YAAY;AAElB,SAAgB,gBAAgB,QAA0B;AACxD,QAAO,OACJ,MAAM,IAAI,CACV,KAAK,MAAM,EAAE,MAAM,CAAC,CACpB,OAAO,QAAQ,CACf,KAAK,MAAM;AAGV,SAFoB,EAAE,QAAQ,YAAY,GAAG,CACnB,MAAM,WAAW,CAC9B,GAAG,MAAM;GACtB,CACD,OAAO,QAAQ;;;;;;;;;;AAWpB,SAAgB,YAAY,MAA2B;CACrD,MAAM,WAAW,cAAc,KAAK;CACpC,MAAM,UAAuB,EAAE;AAE/B,MAAK,MAAM,KAAK,SAAS,SAAS,WAAW,CAC3C,SAAQ,KAAK;EAAE,MAAM,EAAE;EAAI,aAAa;EAAM,CAAC;AAGjD,MAAK,MAAM,KAAK,SAAS,SAAS,cAAc,EAAE;EAChD,MAAM,aAAa,gBAAgB,EAAE,GAAG;AACxC,MAAI,EAAE,GAAI,YAAW,QAAQ,UAAU;AACvC,UAAQ,KAAK;GAAE,MAAM,EAAE;GAAI;GAAY,CAAC;;AAG1C,MAAK,MAAM,KAAK,SAAS,SAAS,gBAAgB,CAChD,SAAQ,KAAK;EAAE,MAAM,EAAE;EAAI,YAAY,CAAC,UAAU;EAAE,CAAC;AAGvD,MAAK,MAAM,KAAK,SAAS,SAAS,eAAe,CAC/C,SAAQ,KAAK;EAAE,MAAM,EAAE;EAAI,aAAa;EAAM,CAAC;AAGjD,MAAK,MAAM,KAAK,SAAS,SAAS,gBAAgB,CAChD,SAAQ,KAAK;EAAE,MAAM,EAAE;EAAI,YAAY,gBAAgB,EAAE,GAAG;EAAE,CAAC;AAGjE,MAAK,MAAM,KAAK,SAAS,SAAS,aAAa,CAC7C,SAAQ,KAAK;EAAE,MAAM,EAAE;EAAI,cAAc;EAAM,CAAC;AAGlD,MAAK,MAAM,KAAK,SAAS,SAAS,UAAU,CAC1C,SAAQ,KAAK;EAAE,MAAM,EAAE;EAAI,WAAW;EAAM,CAAC;AAG/C,MAAK,MAAM,KAAK,SAAS,SAAS,UAAU,CAC1C,SAAQ,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC;AAG9B,QAAO;;;;ACzJT,MAAM,qBAAqB;CAAC;CAAO;CAAQ;CAAO;CAAQ;CAAQ;CAAO;AAEzE,SAAS,WAAW,UAA2B;CAC7C,MAAM,OAAO,SAAS,UAAU,EAAE,gBAAgB,OAAO,CAAC;AAC1D,QAAO,SAAS,KAAA,KAAa,KAAK,QAAQ;;AAG5C,SAAS,UAAU,UAA2B;CAC5C,MAAM,OAAO,SAAS,UAAU,EAAE,gBAAgB,OAAO,CAAC;AAC1D,QAAO,SAAS,KAAA,KAAa,KAAK,aAAa;;;;;;;AAQjD,SAAS,iBAAiB,WAA2B;AACnD,KAAI,UAAU,WAAW,IAAI,EAAE;EAC7B,MAAM,QAAQ,UAAU,MAAM,IAAI;AAClC,SAAO,MAAM,UAAU,IAAI,GAAG,MAAM,GAAG,GAAG,MAAM,OAAO;;AAEzD,QAAO,UAAU,MAAM,IAAI,CAAC;;AAG9B,SAAS,YAAY,UAAkB,YAA0C;AAE/E,KAAI,WAAW,SAAS,CAAE,QAAO;AAGjC,MAAK,MAAM,OAAO,YAAY;EAC5B,MAAM,UAAU,WAAW;AAC3B,MAAI,WAAW,QAAQ,CAAE,QAAO;;AAIlC,KAAI,UAAU,SAAS,CACrB,MAAK,MAAM,OAAO,YAAY;EAC5B,MAAM,YAAY,KAAK,UAAU,QAAQ,MAAM;AAC/C,MAAI,WAAW,UAAU,CAAE,QAAO;;;;;;;AAexC,SAAgB,eAAe,SAAiB,SAAqC;CACnF,MAAM,aAAa,QAAQ,cAAc;CAOzC,MAAM,uBAJU,QAAQ,UACpB,OAAO,QAAQ,QAAQ,QAAQ,CAAC,MAAM,GAAG,MAAM,EAAE,GAAG,SAAS,EAAE,GAAG,OAAO,GACzE,EAAE,EAE8B,KACjC,CAAC,KAAK,WAAW,CAAC,KAAK,WAAW,MAAM,GAAG,QAAQ,QAAQ,SAAS,MAAM,CAAC,CAC7E;CAED,MAAM,wBAAQ,IAAI,KAAyC;AAE3D,QAAO,SAAS,iBACd,WACA,UAC4B;EAC5B,MAAM,UAAU,QAAQ,SAAS;EACjC,MAAM,WAAW,GAAG,UAAU,IAAI;AAElC,MAAI,MAAM,IAAI,SAAS,CAAE,QAAO,MAAM,IAAI,SAAS;EAEnD,IAAI;AAGJ,MAAI,UAAU,WAAW,KAAK,IAAI,UAAU,WAAW,MAAM,EAAE;GAC7D,MAAM,eAAe,YAAY,QAAQ,SAAS,UAAU,EAAE,WAAW;AACzE,OAAI,aACF,UAAS;IAAE,MAAM;IAAS;IAAc;SAIvC;GACH,IAAI,UAAU;AACd,QAAK,MAAM,CAAC,QAAQ,gBAAgB,oBAClC,KAAI,cAAc,UAAU,UAAU,WAAW,SAAS,IAAI,EAAE;IAE9D,MAAM,eAAe,YAAY,KAAK,aADzB,cAAc,SAAS,KAAK,UAAU,MAAM,OAAO,OAAO,CACf,EAAE,WAAW;AACrE,QAAI,aACF,UAAS;KAAE,MAAM;KAAS;KAAc;AAE1C,cAAU;AACV;;AAKJ,OAAI,CAAC,QACH,UAAS;IAAE,MAAM;IAAY,WAAW,iBAAiB,UAAU;IAAE;;AAIzE,QAAM,IAAI,UAAU,OAAO;AAC3B,SAAO;;;;;ACxGX,SAAgB,WACd,YACA,kBACA,UAC8C;CAC9C,MAAM,QAAsB,EAAE;CAC9B,MAAM,YAAsB,EAAE;AAE9B,MAAK,MAAM,OAAO,YAAY;EAC5B,MAAM,WAAW,iBAAiB,IAAI,MAAM,SAAS;AACrD,MAAI,CAAC,SAAU;AAEf,MAAI,SAAS,SAAS,cAAc,SAAS,UAC3C,WAAU,KAAK,SAAS,UAAU;WACzB,SAAS,SAAS,WAAW,SAAS,cAAc;GAC7D,MAAM,WAAW,MAAM,MAAM,MAAM,EAAE,SAAS,SAAS,aAAa;AACpE,OAAI,UAAU;AACZ,QAAI,IAAI,aAAa;AACnB,cAAS,cAAc;AACvB,cAAS,aAAa,KAAA;AACtB,cAAS,eAAe,KAAA;eACf,IAAI,cAAc,CAAC,SAAS,aAAa;AAClD,MAAC,SAAS,eAAe,EAAE,EAAE,KAAK,GAAG,IAAI,WAAW;AACpD,cAAS,eAAe,KAAA;;AAE1B,QAAI,IAAI,gBAAgB,CAAC,SAAS,cAAc,CAAC,SAAS,YACxD,UAAS,eAAe;AAE1B,QAAI,IAAI,UAAW,UAAS,YAAY;SAExC,OAAM,KAAK;IACT,MAAM,SAAS;IACf,YAAY,IAAI;IAChB,aAAa,IAAI;IACjB,WAAW,IAAI;IACf,cAAc,IAAI;IACnB,CAAC;;;AAKR,QAAO;EAAE;EAAO;EAAW;;;;;;AAO7B,eAAsB,KAAK,WAAmB,SAAgD;CAC5F,MAAM,aAAa,QAAQ,UAAU;CAErC,MAAM,mBAAmB,eADT,QAAQ,UAAU,QAAQ,QAAQ,QAAQ,GAAG,QAAQ,KAAK,EACzB,QAAQ;CAEzD,MAAM,QAAsC,EAAE;CAC9C,MAAM,4BAAY,IAAI,KAAa;CACnC,MAAM,0BAAU,IAAI,KAAa;CACjC,MAAM,QAAQ,CAAC,WAAW;AAE1B,QAAO,MAAM,SAAS,GAAG;EACvB,MAAM,WAAW,MAAM,KAAK;AAC5B,MAAI,QAAQ,IAAI,SAAS,CAAE;AAC3B,UAAQ,IAAI,SAAS;EAIrB,MAAM,EAAE,OAAO,WAAW,kBAAkB,WADzB,YADH,aAAa,UAAU,QAAQ,CACR,EAC4B,kBAAkB,SAAS;AAE9F,OAAK,MAAM,OAAO,cAAe,WAAU,IAAI,IAAI;AACnD,QAAM,YAAY;AAElB,OAAK,MAAM,QAAQ,MAAO,OAAM,KAAK,KAAK,KAAK;;CAIjD,MAAM,eAA6C,EAAE;AACrD,MAAK,MAAM,QAAQ,OAAO,KAAK,MAAM,CACnC,cAAa,QAAQ,EAAE;AAEzB,MAAK,MAAM,CAAC,MAAM,UAAU,OAAO,QAAQ,MAAM,CAC/C,MAAK,MAAM,QAAQ,OAAO;AACxB,MAAI,CAAC,aAAa,KAAK,MAAO,cAAa,KAAK,QAAQ,EAAE;AAC1D,eAAa,KAAK,MAAM,KAAK;GAC3B,MAAM;GACN,YAAY,KAAK;GACjB,aAAa,KAAK;GAClB,WAAW,KAAK;GAChB,cAAc,KAAK;GACpB,CAAC;;AAIN,QAAO;EACL;EACA,OAAO,OAAO,KAAK,MAAM,CAAC,MAAM;EAChC,WAAW,CAAC,GAAG,UAAU,CAAC,MAAM;EAChC;EACA;EACD;;;;;;;;;;;;;;;;;;;;;AC/EH,eAAsB,UAAU,OAAe,SAAiD;AAC9F,QAAO,KAAK,OAAO,WAAW,EAAE,CAAC;;;;;;;;;;;;;;;;AAiBnC,SAAgB,aAAa,UAAkB,SAA0C;CACvF,MAAM,eAAe,QAAQ,SAAS;CAEtC,MAAM,mBAAmB,eADT,SAAS,UAAU,QAAQ,QAAQ,QAAQ,GAAG,QAAQ,KAAK,EAC1B,WAAW,EAAE,CAAC;CAI/D,MAAM,EAAE,UAAU,WADC,YADH,aAAa,cAAc,QAAQ,CACZ,EACE,kBAAkB,aAAa;AAExE,QAAO;;;;;;;;;AAUT,SAAgB,iBAAiB,MAAkB,aAA+B;CAChF,MAAM,WAAW,QAAQ,YAAY;AAErC,KAAI,CAAC,KAAK,aAAa,UAAW,QAAO,EAAE;CAE3C,MAAM,2BAAW,IAAI,KAAa;CAClC,MAAM,QAAQ,CAAC,SAAS;AAExB,QAAO,MAAM,SAAS,GAAG;EACvB,MAAM,UAAU,MAAM,OAAO;EAC7B,MAAM,aAAa,KAAK,aAAa;AACrC,MAAI,CAAC,WAAY;AAEjB,OAAK,MAAM,QAAQ,WACjB,KAAI,CAAC,SAAS,IAAI,KAAK,KAAK,EAAE;AAC5B,YAAS,IAAI,KAAK,KAAK;AACvB,SAAM,KAAK,KAAK,KAAK;;;AAK3B,UAAS,OAAO,SAAS;AACzB,QAAO,CAAC,GAAG,SAAS,CAAC,MAAM"}

package/package.json CHANGED Viewed

@@ -1,31 +1,31 @@
 {
   "name": "importree",
-  "version": "1.0.1",
-  "type": "module",
+  "version": "2.0.1",
   "description": "Build import dependency trees for TypeScript and JavaScript files. Fast, zero-dependency static analysis for dependency detection and cache invalidation.",
-  "author": "Alex Grozav <alex@grozav.com>",
-  "license": "ISC",
-  "repository": {
-    "type": "git",
-    "url": "git+https://github.com/alexgrozav/importree.git"
-  },
-  "homepage": "https://importree.js.org",
-  "bugs": {
-    "url": "https://github.com/alexgrozav/importree/issues"
-  },
   "keywords": [
-    "imports",
+    "cache-invalidation",
     "dependencies",
     "dependency-graph",
     "import-tree",
+    "imports",
+    "javascript",
     "static-analysis",
-    "cache-invalidation",
-    "typescript",
-    "javascript"
+    "typescript"
   ],
-  "engines": {
-    "node": ">=18"
+  "homepage": "https://importree.js.org",
+  "bugs": {
+    "url": "https://github.com/alexgrozav/importree/issues"
   },
+  "license": "ISC",
+  "author": "Alex Grozav <alex@grozav.com>",
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/alexgrozav/importree.git"
+  },
+  "files": [
+    "dist"
+  ],
+  "type": "module",
   "main": "./dist/index.cjs",
   "module": "./dist/index.mjs",
   "types": "./dist/index.d.mts",
@@ -41,17 +41,20 @@
       }
     }
   },
-  "files": [
-    "dist"
-  ],
   "devDependencies": {
+    "@types/node": "^25.3.5",
     "@vitest/coverage-v8": "^4.0.18",
     "dependency-tree": "^11.4.0",
     "madge": "^8.0.0",
+    "oxfmt": "^0.36.0",
+    "oxlint": "^1.51.0",
     "tsdown": "^0.21.0",
     "typescript": "^5.7.0",
     "vitest": "^4.0.18"
   },
+  "engines": {
+    "node": ">=18"
+  },
   "scripts": {
     "build": "tsdown",
     "build:docs": "cp -r docs dist-docs",
@@ -60,7 +63,13 @@
     "dev:docs": "npx http-server docs -p 8765 -o",
     "bench": "vitest bench",
     "bench:run": "vitest bench --run",
+    "typecheck": "tsc --noEmit",
+    "lint": "oxlint",
+    "lint:fix": "oxlint --fix",
+    "fmt": "oxfmt",
+    "fmt:check": "oxfmt --check",
     "test": "vitest run",
+    "test:coverage": "vitest run --coverage",
     "test:watch": "vitest"
   }
 }