@depxray/core 1.3.0

package/dist/buildGraph.d.ts

@@ -0,0 +1,11 @@
+import type { ResolvedImport, DependencyGraph, ScanMetadata } from './types.js';
+/**
+ * Build a dependency graph from the resolved import data.
+ *
+ * @param fileImportsMap - Map from absolute file path → array of resolved imports
+ * @param rootDir        - Project root (for computing relative paths)
+ * @param metadata       - Scan metadata to include in the graph
+ * @returns A complete DependencyGraph (without circular dependency analysis)
+ */
+export declare function buildGraph(fileImportsMap: Map<string, ResolvedImport[]>, rootDir: string, metadata: ScanMetadata): DependencyGraph;
+//# sourceMappingURL=buildGraph.d.ts.map

package/dist/buildGraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"buildGraph.d.ts","sourceRoot":"","sources":["../src/buildGraph.ts"],"names":[],"mappings":"AAQA,OAAO,KAAK,EAGV,cAAc,EACd,eAAe,EACf,YAAY,EACb,MAAM,YAAY,CAAC;AAEpB;;;;;;;GAOG;AACH,wBAAgB,UAAU,CACxB,cAAc,EAAE,GAAG,CAAC,MAAM,EAAE,cAAc,EAAE,CAAC,EAC7C,OAAO,EAAE,MAAM,EACf,QAAQ,EAAE,YAAY,GACrB,eAAe,CAoEjB"}

package/dist/buildGraph.js

@@ -0,0 +1,111 @@
+"use strict";
+// ============================================================================
+// buildGraph — Construct the dependency graph from resolved imports
+// ============================================================================
+// Takes a map of files → resolved imports and builds the graph data structure
+// (nodes + edges). Calculates in/out degrees for each node.
+// ============================================================================
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.buildGraph = buildGraph;
+const path = __importStar(require("path"));
+/**
+ * Build a dependency graph from the resolved import data.
+ *
+ * @param fileImportsMap - Map from absolute file path → array of resolved imports
+ * @param rootDir        - Project root (for computing relative paths)
+ * @param metadata       - Scan metadata to include in the graph
+ * @returns A complete DependencyGraph (without circular dependency analysis)
+ */
+function buildGraph(fileImportsMap, rootDir, metadata) {
+    // ── Build edges ──────────────────────────────────────────────────────
+    const edges = [];
+    const inDegreeMap = new Map();
+    const outDegreeMap = new Map();
+    // Initialize degree counts for all known files
+    for (const filePath of fileImportsMap.keys()) {
+        inDegreeMap.set(filePath, 0);
+        outDegreeMap.set(filePath, 0);
+    }
+    for (const [sourceFile, resolvedImports] of fileImportsMap.entries()) {
+        for (const resolved of resolvedImports) {
+            // Skip unresolved imports (external packages, broken paths)
+            if (!resolved.resolvedPath) {
+                continue;
+            }
+            const targetFile = resolved.resolvedPath;
+            // Ensure target is in the degree maps (it might be an internal file
+            // that wasn't in our initial file list but is imported)
+            if (!inDegreeMap.has(targetFile)) {
+                inDegreeMap.set(targetFile, 0);
+            }
+            edges.push({
+                source: sourceFile,
+                target: targetFile,
+                importSpecifier: resolved.raw.source,
+                importedNames: resolved.raw.specifiers,
+                isTypeOnly: resolved.raw.isTypeOnly,
+                isDynamic: resolved.raw.isDynamic,
+            });
+            // Update degree counts
+            outDegreeMap.set(sourceFile, (outDegreeMap.get(sourceFile) || 0) + 1);
+            inDegreeMap.set(targetFile, (inDegreeMap.get(targetFile) || 0) + 1);
+        }
+    }
+    // ── Build nodes ──────────────────────────────────────────────────────
+    // Collect all unique file paths (from both source files and import targets)
+    const allFiles = new Set([
+        ...fileImportsMap.keys(),
+        ...edges.map((e) => e.target),
+    ]);
+    const nodes = Array.from(allFiles).map((filePath) => ({
+        id: filePath,
+        relativePath: path.relative(rootDir, filePath),
+        extension: path.extname(filePath),
+        inDegree: inDegreeMap.get(filePath) || 0,
+        outDegree: outDegreeMap.get(filePath) || 0,
+        isCircular: false, // Will be set by detectCircularDeps
+    }));
+    // Sort nodes by relative path for consistent output
+    nodes.sort((a, b) => a.relativePath.localeCompare(b.relativePath));
+    return {
+        rootDir,
+        nodes,
+        edges,
+        circularDependencies: [], // Populated later by detectCircularDeps
+        metadata,
+    };
+}
+//# sourceMappingURL=buildGraph.js.map

package/dist/buildGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"buildGraph.js","sourceRoot":"","sources":["../src/buildGraph.ts"],"names":[],"mappings":";AAAA,+EAA+E;AAC/E,oEAAoE;AACpE,+EAA+E;AAC/E,8EAA8E;AAC9E,4DAA4D;AAC5D,+EAA+E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmB/E,gCAwEC;AAzFD,2CAA6B;AAS7B;;;;;;;GAOG;AACH,SAAgB,UAAU,CACxB,cAA6C,EAC7C,OAAe,EACf,QAAsB;IAEtB,wEAAwE;IACxE,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,MAAM,WAAW,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC9C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE/C,+CAA+C;IAC/C,KAAK,MAAM,QAAQ,IAAI,cAAc,CAAC,IAAI,EAAE,EAAE,CAAC;QAC7C,WAAW,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;QAC7B,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC;IAChC,CAAC;IAED,KAAK,MAAM,CAAC,UAAU,EAAE,eAAe,CAAC,IAAI,cAAc,CAAC,OAAO,EAAE,EAAE,CAAC;QACrE,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;YACvC,4DAA4D;YAC5D,IAAI,CAAC,QAAQ,CAAC,YAAY,EAAE,CAAC;gBAC3B,SAAS;YACX,CAAC;YAED,MAAM,UAAU,GAAG,QAAQ,CAAC,YAAY,CAAC;YAEzC,oEAAoE;YACpE,wDAAwD;YACxD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;gBACjC,WAAW,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC;YACjC,CAAC;YAED,KAAK,CAAC,IAAI,CAAC;gBACT,MAAM,EAAE,UAAU;gBAClB,MAAM,EAAE,UAAU;gBAClB,eAAe,EAAE,QAAQ,CAAC,GAAG,CAAC,MAAM;gBACpC,aAAa,EAAE,QAAQ,CAAC,GAAG,CAAC,UAAU;gBACtC,UAAU,EAAE,QAAQ,CAAC,GAAG,CAAC,UAAU;gBACnC,SAAS,EAAE,QAAQ,CAAC,GAAG,CAAC,SAAS;aAClC,CAAC,CAAC;YAEH,uBAAuB;YACvB,YAAY,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtE,WAAW,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,WAAW,CAAC,GAAG,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QACtE,CAAC;IACH,CAAC;IAED,wEAAwE;IACxE,4EAA4E;IAC5E,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAS;QAC/B,GAAG,cAAc,CAAC,IAAI,EAAE;QACxB,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;KAC9B,CAAC,CAAC;IAEH,MAAM,KAAK,GAAgB,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,QAAQ,EAAE,EAAE,CAAC,CAAC;QACjE,EAAE,EAAE,QAAQ;QACZ,YAAY,EAAE,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC;QAC9C,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC;QACjC,QAAQ,EAAE,WAAW,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC;QACxC,SAAS,EAAE,YAAY,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC;QAC1C,UAAU,EAAE,KAAK,EAAE,oCAAoC;KACxD,CAAC,CAAC,CAAC;IAEJ,oDAAoD;IACpD,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC;IAEnE,OAAO;QACL,OAAO;QACP,KAAK;QACL,KAAK;QACL,oBAAoB,EAAE,EAAE,EAAE,wCAAwC;QAClE,QAAQ;KACT,CAAC;AACJ,CAAC"}

package/dist/buildStructureGraph.d.ts

@@ -0,0 +1,3 @@
+import type { FileTreeNode, StructureGraph } from './types.js';
+export declare function buildStructureGraph(rootNode: FileTreeNode, maxDepth?: number): StructureGraph;
+//# sourceMappingURL=buildStructureGraph.d.ts.map

package/dist/buildStructureGraph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"buildStructureGraph.d.ts","sourceRoot":"","sources":["../src/buildStructureGraph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EACV,YAAY,EACZ,cAAc,EAGf,MAAM,YAAY,CAAC;AAUpB,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,YAAY,EACtB,QAAQ,GAAE,MAAiB,GAC1B,cAAc,CAyChB"}

package/dist/buildStructureGraph.js

@@ -0,0 +1,45 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.buildStructureGraph = buildStructureGraph;
+const filterTreeByDepth_js_1 = require("./filterTreeByDepth.js");
+function countDescendants(node) {
+    return node.children.reduce((count, child) => count + 1 + countDescendants(child), 0);
+}
+function buildStructureGraph(rootNode, maxDepth = Infinity) {
+    const nodes = [];
+    const edges = [];
+    const visibleTree = (0, filterTreeByDepth_js_1.filterTreeByDepth)(rootNode, maxDepth);
+    function visit(node, parentId) {
+        nodes.push({
+            id: node.id,
+            label: node.name,
+            relativePath: node.relativePath,
+            absolutePath: node.absolutePath,
+            kind: node.kind,
+            extension: node.extension,
+            depth: node.depth,
+            collapsed: false,
+            hidden: false,
+            childCount: node.children.length,
+            descendantCount: countDescendants(node),
+            ...(node.sizeBytes !== undefined ? { sizeBytes: node.sizeBytes } : {}),
+        });
+        if (parentId) {
+            edges.push({
+                id: `${parentId}->${node.id}`,
+                source: parentId,
+                target: node.id,
+            });
+        }
+        for (const child of node.children) {
+            visit(child, node.id);
+        }
+    }
+    visit(visibleTree, null);
+    return {
+        rootDir: rootNode.absolutePath,
+        nodes,
+        edges,
+    };
+}
+//# sourceMappingURL=buildStructureGraph.js.map

package/dist/buildStructureGraph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"buildStructureGraph.js","sourceRoot":"","sources":["../src/buildStructureGraph.ts"],"names":[],"mappings":";;AAeA,kDA4CC;AArDD,iEAA2D;AAE3D,SAAS,gBAAgB,CAAC,IAAkB;IAC1C,OAAO,IAAI,CAAC,QAAQ,CAAC,MAAM,CACzB,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,GAAG,CAAC,GAAG,gBAAgB,CAAC,KAAK,CAAC,EACrD,CAAC,CACF,CAAC;AACJ,CAAC;AAED,SAAgB,mBAAmB,CACjC,QAAsB,EACtB,WAAmB,QAAQ;IAE3B,MAAM,KAAK,GAAyB,EAAE,CAAC;IACvC,MAAM,KAAK,GAAyB,EAAE,CAAC;IACvC,MAAM,WAAW,GAAG,IAAA,wCAAiB,EAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;IAE1D,SAAS,KAAK,CAAC,IAAkB,EAAE,QAAuB;QACxD,KAAK,CAAC,IAAI,CAAC;YACT,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,KAAK,EAAE,IAAI,CAAC,IAAI;YAChB,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,KAAK,EAAE,IAAI,CAAC,KAAK;YACjB,SAAS,EAAE,KAAK;YAChB,MAAM,EAAE,KAAK;YACb,UAAU,EAAE,IAAI,CAAC,QAAQ,CAAC,MAAM;YAChC,eAAe,EAAE,gBAAgB,CAAC,IAAI,CAAC;YACvC,GAAG,CAAC,IAAI,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;SACvE,CAAC,CAAC;QAEH,IAAI,QAAQ,EAAE,CAAC;YACb,KAAK,CAAC,IAAI,CAAC;gBACT,EAAE,EAAE,GAAG,QAAQ,KAAK,IAAI,CAAC,EAAE,EAAE;gBAC7B,MAAM,EAAE,QAAQ;gBAChB,MAAM,EAAE,IAAI,CAAC,EAAE;aAChB,CAAC,CAAC;QACL,CAAC;QAED,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClC,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QACxB,CAAC;IACH,CAAC;IAED,KAAK,CAAC,WAAW,EAAE,IAAI,CAAC,CAAC;IAEzB,OAAO;QACL,OAAO,EAAE,QAAQ,CAAC,YAAY;QAC9B,KAAK;QACL,KAAK;KACN,CAAC;AACJ,CAAC"}

package/dist/configLoader.d.ts

@@ -0,0 +1,18 @@
+import type { AliasMapping } from './types.js';
+/**
+ * Load path alias mappings from tsconfig.json or jsconfig.json.
+ *
+ * Tries tsconfig.json first, then falls back to jsconfig.json.
+ * Follows the `extends` chain to find inherited path mappings.
+ *
+ * @param rootDir - The project root directory
+ * @returns Array of alias mappings, empty if none found
+ *
+ * @example
+ * ```typescript
+ * const aliases = loadAliases('/path/to/project');
+ * // [{ prefix: '@/', paths: ['/path/to/project/src/'] }]
+ * ```
+ */
+export declare function loadAliases(rootDir: string): AliasMapping[];
+//# sourceMappingURL=configLoader.d.ts.map

package/dist/configLoader.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"configLoader.d.ts","sourceRoot":"","sources":["../src/configLoader.ts"],"names":[],"mappings":"AA0BA,OAAO,KAAK,EAAE,YAAY,EAAE,MAAM,YAAY,CAAC;AAgG/C;;;;;;;;;;;;;;GAcG;AACH,wBAAgB,WAAW,CAAC,OAAO,EAAE,MAAM,GAAG,YAAY,EAAE,CA2C3D"}

package/dist/configLoader.js

@@ -0,0 +1,188 @@
+"use strict";
+// ============================================================================
+// configLoader — Load path aliases from tsconfig.json / jsconfig.json
+// ============================================================================
+// Parses the `compilerOptions.paths` and `compilerOptions.baseUrl` fields
+// from tsconfig.json (or jsconfig.json) to build alias mappings.
+//
+// Example tsconfig.json:
+//   {
+//     "compilerOptions": {
+//       "baseUrl": ".",
+//       "paths": {
+//         "@/*": ["./src/*"],
+//         "@components/*": ["./src/components/*"]
+//       }
+//     }
+//   }
+//
+// This produces aliases:
+//   [
+//     { prefix: '@/', paths: ['/abs/path/to/src/'] },
+//     { prefix: '@components/', paths: ['/abs/path/to/src/components/'] }
+//   ]
+// ============================================================================
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.loadAliases = loadAliases;
+const path = __importStar(require("path"));
+const fs = __importStar(require("fs"));
+/**
+ * Strip JSON comments (single-line // and multi-line) and trailing commas
+ * so that JSON.parse can handle tsconfig.json files, which allow comments.
+ */
+function stripJsonComments(jsonString) {
+    // Remove single-line comments
+    let result = jsonString.replace(/\/\/.*$/gm, '');
+    // Remove multi-line comments
+    result = result.replace(/\/\*[\s\S]*?\*\//g, '');
+    // Remove trailing commas before } or ]
+    result = result.replace(/,\s*([\]}])/g, '$1');
+    return result;
+}
+/**
+ * Read and parse a JSON config file, handling comments and trailing commas
+ * (which are allowed in tsconfig.json but not standard JSON).
+ */
+function readJsonConfig(configPath) {
+    try {
+        const raw = fs.readFileSync(configPath, 'utf-8');
+        const cleaned = stripJsonComments(raw);
+        return JSON.parse(cleaned);
+    }
+    catch {
+        return null;
+    }
+}
+/**
+ * Resolve the `extends` chain in tsconfig.json to merge configurations.
+ *
+ * Many projects use `"extends": "@tsconfig/react-native"` or similar.
+ * We follow the chain to find `paths` definitions in parent configs.
+ */
+function resolveExtendsChain(configPath, visited = new Set()) {
+    const absPath = path.resolve(configPath);
+    // Prevent infinite loops
+    if (visited.has(absPath)) {
+        return {};
+    }
+    visited.add(absPath);
+    const config = readJsonConfig(absPath);
+    if (!config) {
+        return {};
+    }
+    // If this config extends another, merge them
+    if (typeof config.extends === 'string') {
+        let parentPath = config.extends;
+        // Resolve the parent config path
+        if (parentPath.startsWith('.')) {
+            parentPath = path.resolve(path.dirname(absPath), parentPath);
+        }
+        else {
+            // It's a package reference like "@tsconfig/react"
+            // Try to resolve it from node_modules
+            try {
+                parentPath = require.resolve(parentPath, {
+                    paths: [path.dirname(absPath)],
+                });
+            }
+            catch {
+                // Can't resolve the parent — skip it
+                return config;
+            }
+        }
+        // Ensure .json extension
+        if (!parentPath.endsWith('.json')) {
+            parentPath += '.json';
+        }
+        const parentConfig = resolveExtendsChain(parentPath, visited);
+        // Merge: child overrides parent
+        return {
+            ...parentConfig,
+            ...config,
+            compilerOptions: {
+                ...(parentConfig.compilerOptions || {}),
+                ...(config.compilerOptions || {}),
+            },
+        };
+    }
+    return config;
+}
+/**
+ * Load path alias mappings from tsconfig.json or jsconfig.json.
+ *
+ * Tries tsconfig.json first, then falls back to jsconfig.json.
+ * Follows the `extends` chain to find inherited path mappings.
+ *
+ * @param rootDir - The project root directory
+ * @returns Array of alias mappings, empty if none found
+ *
+ * @example
+ * ```typescript
+ * const aliases = loadAliases('/path/to/project');
+ * // [{ prefix: '@/', paths: ['/path/to/project/src/'] }]
+ * ```
+ */
+function loadAliases(rootDir) {
+    // Try tsconfig.json first, then jsconfig.json
+    const configNames = ['tsconfig.json', 'jsconfig.json'];
+    for (const configName of configNames) {
+        const configPath = path.join(rootDir, configName);
+        if (!fs.existsSync(configPath)) {
+            continue;
+        }
+        const config = resolveExtendsChain(configPath);
+        const compilerOptions = config.compilerOptions;
+        if (!compilerOptions) {
+            continue;
+        }
+        const baseUrl = compilerOptions.baseUrl || '.';
+        const paths = compilerOptions.paths || {};
+        // No path mappings defined
+        if (Object.keys(paths).length === 0) {
+            continue;
+        }
+        const absoluteBaseUrl = path.resolve(rootDir, baseUrl);
+        const aliases = Object.entries(paths).map(([pattern, targets]) => ({
+            // Remove the wildcard: '@/*' → '@/'
+            prefix: pattern.replace(/\*$/, ''),
+            // Resolve each target to an absolute path, remove wildcard
+            paths: targets.map((t) => path.resolve(absoluteBaseUrl, t.replace(/\*$/, ''))),
+        }));
+        return aliases;
+    }
+    return [];
+}
+//# sourceMappingURL=configLoader.js.map

package/dist/configLoader.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"configLoader.js","sourceRoot":"","sources":["../src/configLoader.ts"],"names":[],"mappings":";AAAA,+EAA+E;AAC/E,sEAAsE;AACtE,+EAA+E;AAC/E,0EAA0E;AAC1E,iEAAiE;AACjE,EAAE;AACF,yBAAyB;AACzB,MAAM;AACN,2BAA2B;AAC3B,wBAAwB;AACxB,mBAAmB;AACnB,8BAA8B;AAC9B,kDAAkD;AAClD,UAAU;AACV,QAAQ;AACR,MAAM;AACN,EAAE;AACF,yBAAyB;AACzB,MAAM;AACN,sDAAsD;AACtD,0EAA0E;AAC1E,MAAM;AACN,+EAA+E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAmH/E,kCA2CC;AA5JD,2CAA6B;AAC7B,uCAAyB;AAGzB;;;GAGG;AACH,SAAS,iBAAiB,CAAC,UAAkB;IAC3C,8BAA8B;IAC9B,IAAI,MAAM,GAAG,UAAU,CAAC,OAAO,CAAC,WAAW,EAAE,EAAE,CAAC,CAAC;IACjD,6BAA6B;IAC7B,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,mBAAmB,EAAE,EAAE,CAAC,CAAC;IACjD,uCAAuC;IACvC,MAAM,GAAG,MAAM,CAAC,OAAO,CAAC,cAAc,EAAE,IAAI,CAAC,CAAC;IAC9C,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,SAAS,cAAc,CACrB,UAAkB;IAElB,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,EAAE,CAAC,YAAY,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;QACjD,MAAM,OAAO,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;QACvC,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC7B,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC;AAED;;;;;GAKG;AACH,SAAS,mBAAmB,CAC1B,UAAkB,EAClB,UAAuB,IAAI,GAAG,EAAE;IAEhC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;IAEzC,yBAAyB;IACzB,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;QACzB,OAAO,EAAE,CAAC;IACZ,CAAC;IACD,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;IAErB,MAAM,MAAM,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;IACvC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,6CAA6C;IAC7C,IAAI,OAAO,MAAM,CAAC,OAAO,KAAK,QAAQ,EAAE,CAAC;QACvC,IAAI,UAAU,GAAG,MAAM,CAAC,OAAO,CAAC;QAEhC,iCAAiC;QACjC,IAAI,UAAU,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;YAC/B,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,UAAU,CAAC,CAAC;QAC/D,CAAC;aAAM,CAAC;YACN,kDAAkD;YAClD,sCAAsC;YACtC,IAAI,CAAC;gBACH,UAAU,GAAG,OAAO,CAAC,OAAO,CAAC,UAAU,EAAE;oBACvC,KAAK,EAAE,CAAC,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;iBAC/B,CAAC,CAAC;YACL,CAAC;YAAC,MAAM,CAAC;gBACP,qCAAqC;gBACrC,OAAO,MAAM,CAAC;YAChB,CAAC;QACH,CAAC;QAED,yBAAyB;QACzB,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,EAAE,CAAC;YAClC,UAAU,IAAI,OAAO,CAAC;QACxB,CAAC;QAED,MAAM,YAAY,GAAG,mBAAmB,CAAC,UAAU,EAAE,OAAO,CAAC,CAAC;QAE9D,gCAAgC;QAChC,OAAO;YACL,GAAG,YAAY;YACf,GAAG,MAAM;YACT,eAAe,EAAE;gBACf,GAAG,CAAC,YAAY,CAAC,eAA0C,IAAI,EAAE,CAAC;gBAClE,GAAG,CAAC,MAAM,CAAC,eAA0C,IAAI,EAAE,CAAC;aAC7D;SACF,CAAC;IACJ,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;;;;;;;;;;;;GAcG;AACH,SAAgB,WAAW,CAAC,OAAe;IACzC,8CAA8C;IAC9C,MAAM,WAAW,GAAG,CAAC,eAAe,EAAE,eAAe,CAAC,CAAC;IAEvD,KAAK,MAAM,UAAU,IAAI,WAAW,EAAE,CAAC;QACrC,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QAElD,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,UAAU,CAAC,EAAE,CAAC;YAC/B,SAAS;QACX,CAAC;QAED,MAAM,MAAM,GAAG,mBAAmB,CAAC,UAAU,CAAC,CAAC;QAC/C,MAAM,eAAe,GAAG,MAAM,CAAC,eAAsD,CAAC;QAEtF,IAAI,CAAC,eAAe,EAAE,CAAC;YACrB,SAAS;QACX,CAAC;QAED,MAAM,OAAO,GAAI,eAAe,CAAC,OAAkB,IAAI,GAAG,CAAC;QAC3D,MAAM,KAAK,GAAI,eAAe,CAAC,KAAkC,IAAI,EAAE,CAAC;QAExE,2BAA2B;QAC3B,IAAI,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACpC,SAAS;QACX,CAAC;QAED,MAAM,eAAe,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAEvD,MAAM,OAAO,GAAmB,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,GAAG,CACvD,CAAC,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,EAAE,CAAC,CAAC;YACvB,oCAAoC;YACpC,MAAM,EAAE,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC;YAClC,2DAA2D;YAC3D,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CACvB,IAAI,CAAC,OAAO,CAAC,eAAe,EAAE,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,CACpD;SACF,CAAC,CACH,CAAC;QAEF,OAAO,OAAO,CAAC;IACjB,CAAC;IAED,OAAO,EAAE,CAAC;AACZ,CAAC"}

package/dist/detectCircularDeps.d.ts

@@ -0,0 +1,21 @@
+import type { DependencyGraph } from './types.js';
+/**
+ * Detect all circular dependency chains in a dependency graph.
+ *
+ * Modifies the graph in-place:
+ * - Sets `isCircular = true` on nodes that participate in cycles
+ * - Populates `circularDependencies` with all detected chains
+ *
+ * @param graph - The dependency graph to analyze (modified in-place)
+ * @returns The same graph reference, with circular dependency data populated
+ *
+ * @example
+ * ```typescript
+ * const graph = buildGraph(fileImportsMap, rootDir, metadata);
+ * detectCircularDeps(graph);
+ * console.log(graph.circularDependencies);
+ * // [{ chain: ['A.tsx', 'B.tsx', 'A.tsx'], description: 'A.tsx → B.tsx → A.tsx' }]
+ * ```
+ */
+export declare function detectCircularDeps(graph: DependencyGraph): DependencyGraph;
+//# sourceMappingURL=detectCircularDeps.d.ts.map

package/dist/detectCircularDeps.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"detectCircularDeps.d.ts","sourceRoot":"","sources":["../src/detectCircularDeps.ts"],"names":[],"mappings":"AAeA,OAAO,KAAK,EAAE,eAAe,EAAiB,MAAM,YAAY,CAAC;AAMjE;;;;;;;;;;;;;;;;;GAiBG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,eAAe,GAAG,eAAe,CAqG1E"}

package/dist/detectCircularDeps.js

@@ -0,0 +1,159 @@
+"use strict";
+// ============================================================================
+// detectCircularDeps — Find circular dependency chains in the graph
+// ============================================================================
+// Uses DFS (Depth-First Search) with node coloring to detect cycles.
+//
+// Algorithm:
+//   WHITE (0) = unvisited
+//   GRAY  (1) = currently in the DFS stack (being explored)
+//   BLACK (2) = fully explored (all descendants visited)
+//
+// A cycle is found when we encounter a GRAY node during DFS traversal,
+// meaning we've reached a node that's still being explored — a back edge.
+// ============================================================================
+var __createBinding = (this && this.__createBinding) || (Object.create ? (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    var desc = Object.getOwnPropertyDescriptor(m, k);
+    if (!desc || ("get" in desc ? !m.__esModule : desc.writable || desc.configurable)) {
+      desc = { enumerable: true, get: function() { return m[k]; } };
+    }
+    Object.defineProperty(o, k2, desc);
+}) : (function(o, m, k, k2) {
+    if (k2 === undefined) k2 = k;
+    o[k2] = m[k];
+}));
+var __setModuleDefault = (this && this.__setModuleDefault) || (Object.create ? (function(o, v) {
+    Object.defineProperty(o, "default", { enumerable: true, value: v });
+}) : function(o, v) {
+    o["default"] = v;
+});
+var __importStar = (this && this.__importStar) || (function () {
+    var ownKeys = function(o) {
+        ownKeys = Object.getOwnPropertyNames || function (o) {
+            var ar = [];
+            for (var k in o) if (Object.prototype.hasOwnProperty.call(o, k)) ar[ar.length] = k;
+            return ar;
+        };
+        return ownKeys(o);
+    };
+    return function (mod) {
+        if (mod && mod.__esModule) return mod;
+        var result = {};
+        if (mod != null) for (var k = ownKeys(mod), i = 0; i < k.length; i++) if (k[i] !== "default") __createBinding(result, mod, k[i]);
+        __setModuleDefault(result, mod);
+        return result;
+    };
+})();
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.detectCircularDeps = detectCircularDeps;
+const path = __importStar(require("path"));
+const WHITE = 0;
+const GRAY = 1;
+const BLACK = 2;
+/**
+ * Detect all circular dependency chains in a dependency graph.
+ *
+ * Modifies the graph in-place:
+ * - Sets `isCircular = true` on nodes that participate in cycles
+ * - Populates `circularDependencies` with all detected chains
+ *
+ * @param graph - The dependency graph to analyze (modified in-place)
+ * @returns The same graph reference, with circular dependency data populated
+ *
+ * @example
+ * ```typescript
+ * const graph = buildGraph(fileImportsMap, rootDir, metadata);
+ * detectCircularDeps(graph);
+ * console.log(graph.circularDependencies);
+ * // [{ chain: ['A.tsx', 'B.tsx', 'A.tsx'], description: 'A.tsx → B.tsx → A.tsx' }]
+ * ```
+ */
+function detectCircularDeps(graph) {
+    const { nodes, edges, rootDir } = graph;
+    // Build adjacency list for fast traversal
+    const adjacency = new Map();
+    for (const node of nodes) {
+        adjacency.set(node.id, []);
+    }
+    for (const edge of edges) {
+        const targets = adjacency.get(edge.source);
+        if (targets) {
+            targets.push(edge.target);
+        }
+    }
+    // Track node state for DFS
+    const color = new Map();
+    for (const node of nodes) {
+        color.set(node.id, WHITE);
+    }
+    // Track the current DFS path for cycle extraction
+    const currentPath = [];
+    const cycles = [];
+    const circularNodeIds = new Set();
+    /**
+     * DFS visit function. Returns true if a cycle was found downstream.
+     */
+    function dfs(nodeId) {
+        color.set(nodeId, GRAY);
+        currentPath.push(nodeId);
+        const neighbors = adjacency.get(nodeId) || [];
+        for (const neighbor of neighbors) {
+            const neighborColor = color.get(neighbor);
+            if (neighborColor === GRAY) {
+                // Found a cycle! Extract the chain from the current path.
+                const cycleStart = currentPath.indexOf(neighbor);
+                if (cycleStart !== -1) {
+                    const chain = [
+                        ...currentPath.slice(cycleStart),
+                        neighbor, // Complete the cycle
+                    ];
+                    // Convert to relative paths for readability
+                    const relativeChain = chain.map((p) => path.relative(rootDir, p));
+                    const description = relativeChain.join(' → ');
+                    // Avoid duplicate cycle reports (same cycle can be found from
+                    // different starting nodes)
+                    const key = [...relativeChain]
+                        .slice(0, -1)
+                        .sort()
+                        .join('|');
+                    const isDuplicate = cycles.some((c) => {
+                        const existingKey = [...c.chain]
+                            .slice(0, -1)
+                            .sort()
+                            .join('|');
+                        return existingKey === key;
+                    });
+                    if (!isDuplicate) {
+                        cycles.push({ chain: relativeChain, description });
+                        // Mark all nodes in this cycle as circular
+                        for (const nodeInCycle of chain) {
+                            circularNodeIds.add(nodeInCycle);
+                        }
+                    }
+                }
+            }
+            else if (neighborColor === WHITE) {
+                dfs(neighbor);
+            }
+            // BLACK nodes are already fully explored — skip them
+        }
+        currentPath.pop();
+        color.set(nodeId, BLACK);
+    }
+    // Run DFS from every unvisited node
+    for (const node of nodes) {
+        if (color.get(node.id) === WHITE) {
+            dfs(node.id);
+        }
+    }
+    // Update the graph with results
+    graph.circularDependencies = cycles;
+    graph.metadata.circularCount = cycles.length;
+    // Mark circular nodes
+    for (const node of graph.nodes) {
+        node.isCircular = circularNodeIds.has(node.id);
+    }
+    return graph;
+}
+//# sourceMappingURL=detectCircularDeps.js.map

package/dist/detectCircularDeps.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"detectCircularDeps.js","sourceRoot":"","sources":["../src/detectCircularDeps.ts"],"names":[],"mappings":";AAAA,+EAA+E;AAC/E,oEAAoE;AACpE,+EAA+E;AAC/E,qEAAqE;AACrE,EAAE;AACF,aAAa;AACb,0BAA0B;AAC1B,4DAA4D;AAC5D,yDAAyD;AACzD,EAAE;AACF,uEAAuE;AACvE,0EAA0E;AAC1E,+EAA+E;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AA2B/E,gDAqGC;AA9HD,2CAA6B;AAG7B,MAAM,KAAK,GAAG,CAAC,CAAC;AAChB,MAAM,IAAI,GAAG,CAAC,CAAC;AACf,MAAM,KAAK,GAAG,CAAC,CAAC;AAEhB;;;;;;;;;;;;;;;;;GAiBG;AACH,SAAgB,kBAAkB,CAAC,KAAsB;IACvD,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,GAAG,KAAK,CAAC;IAExC,0CAA0C;IAC1C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC7B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,OAAO,GAAG,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC3C,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,2BAA2B;IAC3B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,kDAAkD;IAClD,MAAM,WAAW,GAAa,EAAE,CAAC;IACjC,MAAM,MAAM,GAAoB,EAAE,CAAC;IACnC,MAAM,eAAe,GAAG,IAAI,GAAG,EAAU,CAAC;IAE1C;;OAEG;IACH,SAAS,GAAG,CAAC,MAAc;QACzB,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;QACxB,WAAW,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEzB,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAE9C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;YACjC,MAAM,aAAa,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAE1C,IAAI,aAAa,KAAK,IAAI,EAAE,CAAC;gBAC3B,0DAA0D;gBAC1D,MAAM,UAAU,GAAG,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;gBACjD,IAAI,UAAU,KAAK,CAAC,CAAC,EAAE,CAAC;oBACtB,MAAM,KAAK,GAAG;wBACZ,GAAG,WAAW,CAAC,KAAK,CAAC,UAAU,CAAC;wBAChC,QAAQ,EAAE,qBAAqB;qBAChC,CAAC;oBAEF,4CAA4C;oBAC5C,MAAM,aAAa,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC;oBAClE,MAAM,WAAW,GAAG,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;oBAE9C,8DAA8D;oBAC9D,4BAA4B;oBAC5B,MAAM,GAAG,GAAG,CAAC,GAAG,aAAa,CAAC;yBAC3B,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;yBACZ,IAAI,EAAE;yBACN,IAAI,CAAC,GAAG,CAAC,CAAC;oBACb,MAAM,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE;wBACpC,MAAM,WAAW,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC;6BAC7B,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;6BACZ,IAAI,EAAE;6BACN,IAAI,CAAC,GAAG,CAAC,CAAC;wBACb,OAAO,WAAW,KAAK,GAAG,CAAC;oBAC7B,CAAC,CAAC,CAAC;oBAEH,IAAI,CAAC,WAAW,EAAE,CAAC;wBACjB,MAAM,CAAC,IAAI,CAAC,EAAE,KAAK,EAAE,aAAa,EAAE,WAAW,EAAE,CAAC,CAAC;wBAEnD,2CAA2C;wBAC3C,KAAK,MAAM,WAAW,IAAI,KAAK,EAAE,CAAC;4BAChC,eAAe,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;wBACnC,CAAC;oBACH,CAAC;gBACH,CAAC;YACH,CAAC;iBAAM,IAAI,aAAa,KAAK,KAAK,EAAE,CAAC;gBACnC,GAAG,CAAC,QAAQ,CAAC,CAAC;YAChB,CAAC;YACD,qDAAqD;QACvD,CAAC;QAED,WAAW,CAAC,GAAG,EAAE,CAAC;QAClB,KAAK,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC3B,CAAC;IAED,oCAAoC;IACpC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,KAAK,EAAE,CAAC;YACjC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,CAAC;IACH,CAAC;IAED,gCAAgC;IAChC,KAAK,CAAC,oBAAoB,GAAG,MAAM,CAAC;IACpC,KAAK,CAAC,QAAQ,CAAC,aAAa,GAAG,MAAM,CAAC,MAAM,CAAC;IAE7C,sBAAsB;IACtB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC/B,IAAI,CAAC,UAAU,GAAG,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACjD,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC"}

package/dist/detectOrphanFiles.d.ts

@@ -0,0 +1,4 @@
+import type { DependencyGraph, OrphanDetectionOptions } from './types.js';
+export declare function matchesAnyPattern(relativePath: string, patterns: string[]): boolean;
+export declare function detectOrphanFiles(graph: DependencyGraph, options?: OrphanDetectionOptions): string[];
+//# sourceMappingURL=detectOrphanFiles.d.ts.map

package/dist/detectOrphanFiles.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"detectOrphanFiles.d.ts","sourceRoot":"","sources":["../src/detectOrphanFiles.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EACV,eAAe,EACf,sBAAsB,EACvB,MAAM,YAAY,CAAC;AAiDpB,wBAAgB,iBAAiB,CAC/B,YAAY,EAAE,MAAM,EACpB,QAAQ,EAAE,MAAM,EAAE,GACjB,OAAO,CAGT;AAED,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,eAAe,EACtB,OAAO,GAAE,sBAA2B,GACnC,MAAM,EAAE,CAQV"}