tskb 0.0.1

package/dist/core/graph/builder.js

@@ -0,0 +1,421 @@
+import path from "node:path";
+/**
+ * Builds a knowledge graph from extracted registry and documentation data.
+ *
+ * GRAPH STRUCTURE:
+ * A knowledge graph has two parts:
+ * 1. NODES: The "things" in your system (Folders, Modules, Terms, Docs)
+ * 2. EDGES: Relationships between nodes ("doc X references module Y")
+ *
+ * BUILDING PROCESS:
+ * 1. Create nodes from registry:
+ *    - Each Folder becomes a FolderNode with { id, desc, path }
+ *    - Each Module becomes a ModuleNode with { id, desc, typeSignature }
+ *    - Each Term becomes a TermNode with { id, desc }
+ *
+ * 2. Create nodes from docs:
+ *    - Each doc file becomes a DocNode with { id, filePath, content }
+ *
+ * 3. Create edges from references:
+ *    - For each doc, look at its references.modules/terms/folders
+ *    - Create an edge: { from: docId, to: moduleId, type: "references" }
+ *
+ * RESULT:
+ * A complete graph that can be queried: "What docs reference Module X?"
+ * "What terms are used in Folder Y?", etc.
+ *
+ * This is what feeds AI tools to understand your architecture.
+ *
+ * @param registry - Extracted vocabulary (Folders, Modules, Terms)
+ * @param docs - Extracted documentation files
+ * @param baseDir - Base directory (from tsconfig) to make paths relative to
+ * @returns Complete knowledge graph ready for JSON export
+ */
+export function buildGraph(registry, docs, baseDir) {
+    const graph = {
+        nodes: {
+            folders: {},
+            modules: {},
+            terms: {},
+            exports: {},
+            docs: {},
+        },
+        edges: [],
+        metadata: {
+            generatedAt: new Date().toISOString(),
+            version: "1.0.0",
+            stats: {
+                folderCount: 0,
+                moduleCount: 0,
+                termCount: 0,
+                exportCount: 0,
+                docCount: 0,
+                edgeCount: 0,
+            },
+        },
+    };
+    // Build nodes from registry
+    buildFolderNodes(registry, graph);
+    buildModuleNodes(registry, graph);
+    buildTermNodes(registry, graph);
+    buildExportNodes(registry, graph);
+    // Build nodes from docs
+    buildDocNodes(docs, graph, baseDir);
+    // Build edges (relationships)
+    buildEdges(docs, graph, baseDir);
+    // Build hierarchical edges
+    buildFolderHierarchy(graph);
+    buildModuleFolderMembership(graph);
+    buildExportMembership(graph);
+    // Update stats
+    updateStats(graph);
+    return graph;
+}
+/**
+ * Create Folder nodes from registry
+ */
+function buildFolderNodes(registry, graph) {
+    for (const [name, data] of registry.folders.entries()) {
+        const node = {
+            id: name,
+            type: "folder",
+            desc: data.desc,
+            path: data.path,
+            resolvedPath: data.resolvedPath,
+            pathExists: data.pathExists,
+        };
+        graph.nodes.folders[name] = node;
+    }
+}
+/**
+ * Create Module nodes from registry
+ */
+function buildModuleNodes(registry, graph) {
+    for (const [name, data] of registry.modules.entries()) {
+        const node = {
+            id: name,
+            type: "module",
+            desc: data.desc,
+            typeSignature: data.type,
+            importPath: data.importPath,
+            resolvedPath: data.resolvedPath,
+            pathExists: data.pathExists,
+        };
+        graph.nodes.modules[name] = node;
+    }
+}
+/**
+ * Create Term nodes from registry
+ */
+function buildTermNodes(registry, graph) {
+    for (const [name, desc] of registry.terms.entries()) {
+        const node = {
+            id: name,
+            type: "term",
+            desc,
+        };
+        graph.nodes.terms[name] = node;
+    }
+}
+/**
+ * Create Export nodes from registry
+ */
+function buildExportNodes(registry, graph) {
+    for (const [name, data] of registry.exports.entries()) {
+        const node = {
+            id: name,
+            type: "export",
+            desc: data.desc,
+            typeSignature: data.type,
+            importPath: data.importPath,
+            resolvedPath: data.resolvedPath,
+            pathExists: data.pathExists,
+        };
+        graph.nodes.exports[name] = node;
+    }
+}
+/**
+ * Create Doc nodes from extracted documentation
+ */
+function buildDocNodes(docs, graph, baseDir) {
+    for (const doc of docs) {
+        // doc.filePath is already relative from extraction, use it directly as both id and filePath
+        const id = doc.filePath;
+        const node = {
+            id,
+            type: "doc",
+            filePath: doc.filePath, // Now relative, not absolute
+            content: doc.content,
+            format: doc.format,
+        };
+        graph.nodes.docs[id] = node;
+    }
+}
+/**
+ * Build edges (relationships) between nodes.
+ *
+ * CREATING GRAPH RELATIONSHIPS:
+ * We have all the nodes, now we connect them based on references.
+ *
+ * For each doc file:
+ * - Look at doc.references.modules = ["AuthService", "PaymentAPI"]
+ * - For each module name, create edge: doc -> module (type: "references")
+ * - Same for terms and contexts
+ *
+ * VALIDATION:
+ * We only create edges if the target node actually exists in the graph.
+ * If doc references "NonExistentModule", we skip it (could log a warning).
+ *
+ * FUTURE EDGE TYPES:
+ * Could add more relationship types:
+ * - "belongs-to": Module belongs to Context (if we annotate that)
+ * - "related-to": Doc is related to another Doc
+ * - "implements": Module implements an interface
+ *
+ * Right now we just do "references" which is the most important.
+ */
+function buildEdges(docs, graph, baseDir) {
+    for (const doc of docs) {
+        // doc.filePath is already relative from extraction
+        const docId = doc.filePath;
+        // Create "references" edges from doc to modules/terms/contexts
+        for (const moduleName of doc.references.modules) {
+            if (graph.nodes.modules[moduleName]) {
+                graph.edges.push({
+                    from: docId,
+                    to: moduleName,
+                    type: "references",
+                });
+            }
+        }
+        for (const termName of doc.references.terms) {
+            if (graph.nodes.terms[termName]) {
+                graph.edges.push({
+                    from: docId,
+                    to: termName,
+                    type: "references",
+                });
+            }
+        }
+        for (const folderName of doc.references.folders) {
+            if (graph.nodes.folders[folderName]) {
+                graph.edges.push({
+                    from: docId,
+                    to: folderName,
+                    type: "references",
+                });
+            }
+        }
+        for (const exportName of doc.references.exports) {
+            if (graph.nodes.exports[exportName]) {
+                graph.edges.push({
+                    from: docId,
+                    to: exportName,
+                    type: "references",
+                });
+            }
+        }
+    }
+}
+/**
+ * Build folder hierarchy based on path nesting.
+ *
+ * HIERARCHICAL STRUCTURE:
+ * Folders with nested paths create parent-child relationships.
+ * For example:
+ * - "/electron-layers" contains "/electron-layers/main"
+ * - "/electron-layers/main" contains "/electron-layers/main/features/auth"
+ *
+ * This creates a tree structure that can be traversed:
+ * "Show me all folders under ElectronLayers"
+ * "What's the full path from Root to BoardCommunication?"
+ *
+ * ALGORITHM:
+ * For each pair of folders, if childPath starts with parentPath + '/',
+ * create a "contains" edge from parent to child.
+ */
+function buildFolderHierarchy(graph) {
+    const folders = Object.values(graph.nodes.folders);
+    for (const child of folders) {
+        if (!child.path)
+            continue;
+        // Find the most specific parent (longest matching path)
+        let bestParent = null;
+        let bestParentPathLength = 0;
+        for (const parent of folders) {
+            if (!parent.path || parent.id === child.id)
+                continue;
+            // Use path.relative to check if child is within parent
+            const relativePath = path.posix.relative(parent.path, child.path);
+            // If relative path doesn't start with '..' and isn't empty, child is within parent
+            const isChildOfParent = relativePath && !relativePath.startsWith("..") && relativePath !== ".";
+            if (isChildOfParent) {
+                // Use the longest matching parent (most specific)
+                if (parent.path.length > bestParentPathLength) {
+                    bestParent = parent;
+                    bestParentPathLength = parent.path.length;
+                }
+            }
+        }
+        // Create edge from parent to child
+        if (bestParent) {
+            graph.edges.push({
+                from: bestParent.id,
+                to: child.id,
+                type: "contains",
+            });
+        }
+    }
+}
+/**
+ * Build module-to-folder membership based on resolved paths.
+ *
+ * MODULE OWNERSHIP:
+ * If a module's resolvedPath falls within a folder's resolvedPath,
+ * that module belongs to that folder.
+ *
+ * For example:
+ * - Module at "electron-layers/main/src/features/auth/AuthService.ts"
+ * - Folder at "electron-layers/main/features/auth"
+ * - Creates "belongs-to" edge: AuthService -> Auth folder
+ *
+ * This answers:
+ * "What modules are part of the Auth folder?"
+ * "Is this module in the right place?"
+ *
+ * ALGORITHM:
+ * For each module with a resolvedPath, find the most specific folder
+ * whose resolvedPath is a prefix of the module's path.
+ */
+function buildModuleFolderMembership(graph) {
+    const modules = Object.values(graph.nodes.modules);
+    const folders = Object.values(graph.nodes.folders);
+    for (const module of modules) {
+        if (!module.resolvedPath)
+            continue;
+        // Find the most specific folder (longest matching path)
+        let bestFolder = null;
+        let bestFolderPathLength = 0;
+        for (const folder of folders) {
+            if (!folder.resolvedPath)
+                continue;
+            // Both paths are already relative to baseDir, just check prefix
+            // Normalize to forward slashes for consistent comparison
+            const folderPath = folder.resolvedPath.replace(/\\/g, "/");
+            const modulePath = module.resolvedPath.replace(/\\/g, "/");
+            // Check if module path starts with folder path
+            const isModuleInFolder = modulePath.startsWith(folderPath + "/") || modulePath.startsWith(folderPath);
+            if (isModuleInFolder) {
+                // Use the longest matching folder (most specific)
+                if (folderPath.length > bestFolderPathLength) {
+                    bestFolder = folder;
+                    bestFolderPathLength = folderPath.length;
+                }
+            }
+        }
+        // Create edge from module to folder
+        if (bestFolder) {
+            graph.edges.push({
+                from: module.id,
+                to: bestFolder.id,
+                type: "belongs-to",
+            });
+        }
+    }
+}
+/**
+ * Build export membership - connect exports to their parent module or folder.
+ *
+ * EXPORT OWNERSHIP:
+ * Exports can belong to:
+ * 1. A Module - if the export's resolvedPath matches a module's resolvedPath
+ * 2. A Folder - if the export's path falls within a folder's path (but no matching module)
+ *
+ * This creates a three-level hierarchy:
+ * Folder -> Module -> Export
+ * or
+ * Folder -> Export (if no module is defined for that file)
+ *
+ * ALGORITHM:
+ * For each export with a resolvedPath:
+ * 1. First try to find a matching module (same file)
+ * 2. If no module, find the most specific folder containing it
+ */
+function buildExportMembership(graph) {
+    const exports = Object.values(graph.nodes.exports);
+    const modules = Object.values(graph.nodes.modules);
+    const folders = Object.values(graph.nodes.folders);
+    for (const exp of exports) {
+        if (!exp.resolvedPath)
+            continue;
+        // Normalize path for comparison
+        const exportPath = exp.resolvedPath.replace(/\\/g, "/");
+        // First, try to find a matching module (same file)
+        let foundModule = false;
+        for (const module of modules) {
+            if (!module.resolvedPath)
+                continue;
+            const modulePath = module.resolvedPath.replace(/\\/g, "/");
+            // Check if they're from the same file (handle .ts/.tsx/.js variations)
+            const exportBase = exportPath.replace(/\.(ts|tsx|js|jsx)$/, "");
+            const moduleBase = modulePath.replace(/\.(ts|tsx|js|jsx)$/, "");
+            if (exportBase === moduleBase) {
+                graph.edges.push({
+                    from: exp.id,
+                    to: module.id,
+                    type: "belongs-to",
+                });
+                foundModule = true;
+                break;
+            }
+        }
+        // If no module found, try to find the most specific folder
+        if (!foundModule) {
+            let bestFolder = null;
+            let bestFolderPathLength = 0;
+            for (const folder of folders) {
+                if (!folder.resolvedPath)
+                    continue;
+                const folderPath = folder.resolvedPath.replace(/\\/g, "/");
+                // Check if export path starts with folder path
+                const isExportInFolder = exportPath.startsWith(folderPath + "/") || exportPath.startsWith(folderPath);
+                if (isExportInFolder) {
+                    // Use the longest matching folder (most specific)
+                    if (folderPath.length > bestFolderPathLength) {
+                        bestFolder = folder;
+                        bestFolderPathLength = folderPath.length;
+                    }
+                }
+            }
+            // Create edge from export to folder
+            if (bestFolder) {
+                graph.edges.push({
+                    from: exp.id,
+                    to: bestFolder.id,
+                    type: "belongs-to",
+                });
+            }
+        }
+    }
+}
+/**
+ * Update graph statistics
+ */
+function updateStats(graph) {
+    graph.metadata.stats.folderCount = Object.keys(graph.nodes.folders).length;
+    graph.metadata.stats.moduleCount = Object.keys(graph.nodes.modules).length;
+    graph.metadata.stats.termCount = Object.keys(graph.nodes.terms).length;
+    graph.metadata.stats.exportCount = Object.keys(graph.nodes.exports).length;
+    graph.metadata.stats.docCount = Object.keys(graph.nodes.docs).length;
+    graph.metadata.stats.edgeCount = graph.edges.length;
+}
+/**
+ * Normalize file path to use as node ID
+ * Converts absolute paths to relative from the base directory
+ */
+function normalizeFilePath(filePath, baseDir) {
+    // Make path relative to base directory and use forward slashes
+    const relativePath = path.relative(baseDir, filePath);
+    return relativePath.replace(/\\/g, "/");
+}
+//# sourceMappingURL=builder.js.map

package/dist/core/graph/builder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"builder.js","sourceRoot":"","sources":["../../../src/core/graph/builder.ts"],"names":[],"mappings":"AAWA,OAAO,IAAI,MAAM,WAAW,CAAC;AAE7B;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA+BG;AACH,MAAM,UAAU,UAAU,CACxB,QAA2B,EAC3B,IAAoB,EACpB,OAAe;IAEf,MAAM,KAAK,GAAmB;QAC5B,KAAK,EAAE;YACL,OAAO,EAAE,EAAE;YACX,OAAO,EAAE,EAAE;YACX,KAAK,EAAE,EAAE;YACT,OAAO,EAAE,EAAE;YACX,IAAI,EAAE,EAAE;SACT;QACD,KAAK,EAAE,EAAE;QACT,QAAQ,EAAE;YACR,WAAW,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;YACrC,OAAO,EAAE,OAAO;YAChB,KAAK,EAAE;gBACL,WAAW,EAAE,CAAC;gBACd,WAAW,EAAE,CAAC;gBACd,SAAS,EAAE,CAAC;gBACZ,WAAW,EAAE,CAAC;gBACd,QAAQ,EAAE,CAAC;gBACX,SAAS,EAAE,CAAC;aACb;SACF;KACF,CAAC;IAEF,4BAA4B;IAC5B,gBAAgB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAClC,gBAAgB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAClC,cAAc,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAChC,gBAAgB,CAAC,QAAQ,EAAE,KAAK,CAAC,CAAC;IAElC,wBAAwB;IACxB,aAAa,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IAEpC,8BAA8B;IAC9B,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;IAEjC,2BAA2B;IAC3B,oBAAoB,CAAC,KAAK,CAAC,CAAC;IAC5B,2BAA2B,CAAC,KAAK,CAAC,CAAC;IACnC,qBAAqB,CAAC,KAAK,CAAC,CAAC;IAE7B,eAAe;IACf,WAAW,CAAC,KAAK,CAAC,CAAC;IAEnB,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,QAA2B,EAAE,KAAqB;IAC1E,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,QAAQ,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QACtD,MAAM,IAAI,GAAe;YACvB,EAAE,EAAE,IAAI;YACR,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,UAAU,EAAE,IAAI,CAAC,UAAU;SAC5B,CAAC;QACF,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;IACnC,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,QAA2B,EAAE,KAAqB;IAC1E,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,QAAQ,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QACtD,MAAM,IAAI,GAAe;YACvB,EAAE,EAAE,IAAI;YACR,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,aAAa,EAAE,IAAI,CAAC,IAAI;YACxB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,UAAU,EAAE,IAAI,CAAC,UAAU;SAC5B,CAAC;QACF,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;IACnC,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CAAC,QAA2B,EAAE,KAAqB;IACxE,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE,CAAC;QACpD,MAAM,IAAI,GAAa;YACrB,EAAE,EAAE,IAAI;YACR,IAAI,EAAE,MAAM;YACZ,IAAI;SACL,CAAC;QACF,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;IACjC,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,QAA2B,EAAE,KAAqB;IAC1E,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,QAAQ,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QACtD,MAAM,IAAI,GAAe;YACvB,EAAE,EAAE,IAAI;YACR,IAAI,EAAE,QAAQ;YACd,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,aAAa,EAAE,IAAI,CAAC,IAAI;YACxB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,YAAY,EAAE,IAAI,CAAC,YAAY;YAC/B,UAAU,EAAE,IAAI,CAAC,UAAU;SAC5B,CAAC;QACF,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;IACnC,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,aAAa,CAAC,IAAoB,EAAE,KAAqB,EAAE,OAAe;IACjF,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,4FAA4F;QAC5F,MAAM,EAAE,GAAG,GAAG,CAAC,QAAQ,CAAC;QAExB,MAAM,IAAI,GAAY;YACpB,EAAE;YACF,IAAI,EAAE,KAAK;YACX,QAAQ,EAAE,GAAG,CAAC,QAAQ,EAAE,6BAA6B;YACrD,OAAO,EAAE,GAAG,CAAC,OAAO;YACpB,MAAM,EAAE,GAAG,CAAC,MAAM;SACnB,CAAC;QAEF,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;IAC9B,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,SAAS,UAAU,CAAC,IAAoB,EAAE,KAAqB,EAAE,OAAe;IAC9E,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;QACvB,mDAAmD;QACnD,MAAM,KAAK,GAAG,GAAG,CAAC,QAAQ,CAAC;QAE3B,+DAA+D;QAC/D,KAAK,MAAM,UAAU,IAAI,GAAG,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;YAChD,IAAI,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;gBACpC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;oBACf,IAAI,EAAE,KAAK;oBACX,EAAE,EAAE,UAAU;oBACd,IAAI,EAAE,YAAY;iBACnB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,UAAU,CAAC,KAAK,EAAE,CAAC;YAC5C,IAAI,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAChC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;oBACf,IAAI,EAAE,KAAK;oBACX,EAAE,EAAE,QAAQ;oBACZ,IAAI,EAAE,YAAY;iBACnB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,KAAK,MAAM,UAAU,IAAI,GAAG,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;YAChD,IAAI,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;gBACpC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;oBACf,IAAI,EAAE,KAAK;oBACX,EAAE,EAAE,UAAU;oBACd,IAAI,EAAE,YAAY;iBACnB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;QAED,KAAK,MAAM,UAAU,IAAI,GAAG,CAAC,UAAU,CAAC,OAAO,EAAE,CAAC;YAChD,IAAI,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,EAAE,CAAC;gBACpC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;oBACf,IAAI,EAAE,KAAK;oBACX,EAAE,EAAE,UAAU;oBACd,IAAI,EAAE,YAAY;iBACnB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,SAAS,oBAAoB,CAAC,KAAqB;IACjD,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAEnD,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,IAAI,CAAC,KAAK,CAAC,IAAI;YAAE,SAAS;QAE1B,wDAAwD;QACxD,IAAI,UAAU,GAAsB,IAAI,CAAC;QACzC,IAAI,oBAAoB,GAAG,CAAC,CAAC;QAE7B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,MAAM,CAAC,IAAI,IAAI,MAAM,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE;gBAAE,SAAS;YAErD,uDAAuD;YACvD,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC;YAElE,mFAAmF;YACnF,MAAM,eAAe,GACnB,YAAY,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,YAAY,KAAK,GAAG,CAAC;YAEzE,IAAI,eAAe,EAAE,CAAC;gBACpB,kDAAkD;gBAClD,IAAI,MAAM,CAAC,IAAI,CAAC,MAAM,GAAG,oBAAoB,EAAE,CAAC;oBAC9C,UAAU,GAAG,MAAM,CAAC;oBACpB,oBAAoB,GAAG,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC;gBAC5C,CAAC;YACH,CAAC;QACH,CAAC;QAED,mCAAmC;QACnC,IAAI,UAAU,EAAE,CAAC;YACf,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,UAAU,CAAC,EAAE;gBACnB,EAAE,EAAE,KAAK,CAAC,EAAE;gBACZ,IAAI,EAAE,UAAU;aACjB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;;;;;GAmBG;AACH,SAAS,2BAA2B,CAAC,KAAqB;IACxD,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IACnD,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAEnD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;QAC7B,IAAI,CAAC,MAAM,CAAC,YAAY;YAAE,SAAS;QAEnC,wDAAwD;QACxD,IAAI,UAAU,GAAsB,IAAI,CAAC;QACzC,IAAI,oBAAoB,GAAG,CAAC,CAAC;QAE7B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,MAAM,CAAC,YAAY;gBAAE,SAAS;YAEnC,gEAAgE;YAChE,yDAAyD;YACzD,MAAM,UAAU,GAAG,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAC3D,MAAM,UAAU,GAAG,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAE3D,+CAA+C;YAC/C,MAAM,gBAAgB,GACpB,UAAU,CAAC,UAAU,CAAC,UAAU,GAAG,GAAG,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;YAE/E,IAAI,gBAAgB,EAAE,CAAC;gBACrB,kDAAkD;gBAClD,IAAI,UAAU,CAAC,MAAM,GAAG,oBAAoB,EAAE,CAAC;oBAC7C,UAAU,GAAG,MAAM,CAAC;oBACpB,oBAAoB,GAAG,UAAU,CAAC,MAAM,CAAC;gBAC3C,CAAC;YACH,CAAC;QACH,CAAC;QAED,oCAAoC;QACpC,IAAI,UAAU,EAAE,CAAC;YACf,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;gBACf,IAAI,EAAE,MAAM,CAAC,EAAE;gBACf,EAAE,EAAE,UAAU,CAAC,EAAE;gBACjB,IAAI,EAAE,YAAY;aACnB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;;;;;;;;;;;;;;GAiBG;AACH,SAAS,qBAAqB,CAAC,KAAqB;IAClD,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IACnD,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IACnD,MAAM,OAAO,GAAG,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAEnD,KAAK,MAAM,GAAG,IAAI,OAAO,EAAE,CAAC;QAC1B,IAAI,CAAC,GAAG,CAAC,YAAY;YAAE,SAAS;QAEhC,gCAAgC;QAChC,MAAM,UAAU,GAAG,GAAG,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QAExD,mDAAmD;QACnD,IAAI,WAAW,GAAG,KAAK,CAAC;QACxB,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,MAAM,CAAC,YAAY;gBAAE,SAAS;YAEnC,MAAM,UAAU,GAAG,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAE3D,uEAAuE;YACvE,MAAM,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC,oBAAoB,EAAE,EAAE,CAAC,CAAC;YAChE,MAAM,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC,oBAAoB,EAAE,EAAE,CAAC,CAAC;YAEhE,IAAI,UAAU,KAAK,UAAU,EAAE,CAAC;gBAC9B,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;oBACf,IAAI,EAAE,GAAG,CAAC,EAAE;oBACZ,EAAE,EAAE,MAAM,CAAC,EAAE;oBACb,IAAI,EAAE,YAAY;iBACnB,CAAC,CAAC;gBACH,WAAW,GAAG,IAAI,CAAC;gBACnB,MAAM;YACR,CAAC;QACH,CAAC;QAED,2DAA2D;QAC3D,IAAI,CAAC,WAAW,EAAE,CAAC;YACjB,IAAI,UAAU,GAAsB,IAAI,CAAC;YACzC,IAAI,oBAAoB,GAAG,CAAC,CAAC;YAE7B,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;gBAC7B,IAAI,CAAC,MAAM,CAAC,YAAY;oBAAE,SAAS;gBAEnC,MAAM,UAAU,GAAG,MAAM,CAAC,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;gBAE3D,+CAA+C;gBAC/C,MAAM,gBAAgB,GACpB,UAAU,CAAC,UAAU,CAAC,UAAU,GAAG,GAAG,CAAC,IAAI,UAAU,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;gBAE/E,IAAI,gBAAgB,EAAE,CAAC;oBACrB,kDAAkD;oBAClD,IAAI,UAAU,CAAC,MAAM,GAAG,oBAAoB,EAAE,CAAC;wBAC7C,UAAU,GAAG,MAAM,CAAC;wBACpB,oBAAoB,GAAG,UAAU,CAAC,MAAM,CAAC;oBAC3C,CAAC;gBACH,CAAC;YACH,CAAC;YAED,oCAAoC;YACpC,IAAI,UAAU,EAAE,CAAC;gBACf,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;oBACf,IAAI,EAAE,GAAG,CAAC,EAAE;oBACZ,EAAE,EAAE,UAAU,CAAC,EAAE;oBACjB,IAAI,EAAE,YAAY;iBACnB,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,WAAW,CAAC,KAAqB;IACxC,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;IAC3E,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;IAC3E,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;IACvE,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,WAAW,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;IAC3E,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,QAAQ,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC;IACrE,KAAK,CAAC,QAAQ,CAAC,KAAK,CAAC,SAAS,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,CAAC;AACtD,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CAAC,QAAgB,EAAE,OAAe;IAC1D,+DAA+D;IAC/D,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IACtD,OAAO,YAAY,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;AAC1C,CAAC"}

package/dist/core/graph/index.d.ts

@@ -0,0 +1,23 @@
+/**
+ * Graph Module - Builds knowledge graphs from extracted data
+ *
+ * Public API for creating queryable graph structures.
+ */
+export type { KnowledgeGraph, FolderNode, ModuleNode, TermNode, DocNode, GraphEdge, EdgeType, } from "./types.js";
+export { buildGraph } from "./builder.js";
+/**
+ * Build a knowledge graph from extraction results.
+ *
+ * This is the main entry point for graph building. It:
+ * - Creates nodes from folders, modules, terms, and docs
+ * - Builds reference edges between nodes
+ * - Infers hierarchical relationships from paths
+ * - Determines module-to-folder membership
+ *
+ * @param registry - Extracted vocabulary (folders, modules, terms)
+ * @param documentation - Extracted documentation files
+ * @param baseDir - Base directory for normalizing file paths
+ * @returns Complete knowledge graph with nodes and edges
+ */
+export declare function buildKnowledgeGraph(registry: import("../extraction/index.js").ExtractedRegistry, documentation: import("../extraction/index.js").ExtractedDoc[], baseDir: string): import("./types.js").KnowledgeGraph;
+//# sourceMappingURL=index.d.ts.map

package/dist/core/graph/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/core/graph/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,YAAY,EACV,cAAc,EACd,UAAU,EACV,UAAU,EACV,QAAQ,EACR,OAAO,EACP,SAAS,EACT,QAAQ,GACT,MAAM,YAAY,CAAC;AAIpB,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1C;;;;;;;;;;;;;GAaG;AACH,wBAAgB,mBAAmB,CACjC,QAAQ,EAAE,OAAO,wBAAwB,EAAE,iBAAiB,EAC5D,aAAa,EAAE,OAAO,wBAAwB,EAAE,YAAY,EAAE,EAC9D,OAAO,EAAE,MAAM,GACd,OAAO,YAAY,EAAE,cAAc,CAErC"}

package/dist/core/graph/index.js

@@ -0,0 +1,25 @@
+/**
+ * Graph Module - Builds knowledge graphs from extracted data
+ *
+ * Public API for creating queryable graph structures.
+ */
+import { buildGraph } from "./builder.js";
+export { buildGraph } from "./builder.js";
+/**
+ * Build a knowledge graph from extraction results.
+ *
+ * This is the main entry point for graph building. It:
+ * - Creates nodes from folders, modules, terms, and docs
+ * - Builds reference edges between nodes
+ * - Infers hierarchical relationships from paths
+ * - Determines module-to-folder membership
+ *
+ * @param registry - Extracted vocabulary (folders, modules, terms)
+ * @param documentation - Extracted documentation files
+ * @param baseDir - Base directory for normalizing file paths
+ * @returns Complete knowledge graph with nodes and edges
+ */
+export function buildKnowledgeGraph(registry, documentation, baseDir) {
+    return buildGraph(registry, documentation, baseDir);
+}
+//# sourceMappingURL=index.js.map

package/dist/core/graph/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/core/graph/index.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAYH,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1C,OAAO,EAAE,UAAU,EAAE,MAAM,cAAc,CAAC;AAE1C;;;;;;;;;;;;;GAaG;AACH,MAAM,UAAU,mBAAmB,CACjC,QAA4D,EAC5D,aAA8D,EAC9D,OAAe;IAEf,OAAO,UAAU,CAAC,QAAQ,EAAE,aAAa,EAAE,OAAO,CAAC,CAAC;AACtD,CAAC"}

package/dist/core/graph/types.d.ts

@@ -0,0 +1,128 @@
+/**
+ * Graph structure types for the knowledge base.
+ *
+ * The graph consists of:
+ * - Nodes: Folders, Modules, Terms, and Documentation files
+ * - Edges: Relationships between nodes (references, belongs-to, etc.)
+ */
+export interface GraphNode {
+    id: string;
+    type: "folder" | "module" | "term" | "export" | "doc";
+}
+export interface FolderNode extends GraphNode {
+    type: "folder";
+    desc: string;
+    path?: string;
+    /**
+     * Resolved path relative to tsconfig directory (portable across machines)
+     */
+    resolvedPath?: string;
+    /**
+     * Whether the resolved path actually exists on disk
+     */
+    pathExists?: boolean;
+}
+export interface ModuleNode extends GraphNode {
+    type: "module";
+    desc: string;
+    /**
+     * The module's type signature (if available from typeof import)
+     */
+    typeSignature?: string;
+    /**
+     * Import path from typeof import("...")
+     */
+    importPath?: string;
+    /**
+     * Resolved path relative to tsconfig directory (portable across machines)
+     */
+    resolvedPath?: string;
+    /**
+     * Whether the resolved path actually exists on disk
+     */
+    pathExists?: boolean;
+}
+export interface TermNode extends GraphNode {
+    type: "term";
+    desc: string;
+}
+export interface ExportNode extends GraphNode {
+    type: "export";
+    desc: string;
+    /**
+     * The export's type signature (if available from typeof import)
+     */
+    typeSignature?: string;
+    /**
+     * Import path from typeof import("...")
+     */
+    importPath?: string;
+    /**
+     * Resolved path relative to tsconfig directory (portable across machines)
+     */
+    resolvedPath?: string;
+    /**
+     * Whether the resolved path actually exists on disk
+     */
+    pathExists?: boolean;
+}
+export interface DocNode extends GraphNode {
+    type: "doc";
+    /**
+     * File path relative to project root
+     */
+    filePath: string;
+    /**
+     * Full text content of the documentation
+     */
+    content: string;
+    /**
+     * Format of the doc file
+     */
+    format: "ts" | "tsx";
+}
+export type AnyNode = FolderNode | ModuleNode | TermNode | ExportNode | DocNode;
+/**
+ * Edge types representing relationships in the knowledge graph
+ */
+export type EdgeType = "references" | "belongs-to" | "contains" | "related-to";
+export interface GraphEdge {
+    from: string;
+    to: string;
+    type: EdgeType;
+}
+/**
+ * Complete knowledge graph structure
+ */
+export interface KnowledgeGraph {
+    /**
+     * All nodes in the graph, keyed by ID
+     */
+    nodes: {
+        folders: Record<string, FolderNode>;
+        modules: Record<string, ModuleNode>;
+        terms: Record<string, TermNode>;
+        exports: Record<string, ExportNode>;
+        docs: Record<string, DocNode>;
+    };
+    /**
+     * All edges (relationships) in the graph
+     */
+    edges: GraphEdge[];
+    /**
+     * Metadata about the graph
+     */
+    metadata: {
+        generatedAt: string;
+        version: string;
+        stats: {
+            folderCount: number;
+            moduleCount: number;
+            termCount: number;
+            exportCount: number;
+            docCount: number;
+            edgeCount: number;
+        };
+    };
+}
+//# sourceMappingURL=types.d.ts.map

package/dist/core/graph/types.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.d.ts","sourceRoot":"","sources":["../../../src/core/graph/types.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,MAAM,WAAW,SAAS;IACxB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,QAAQ,GAAG,QAAQ,GAAG,MAAM,GAAG,QAAQ,GAAG,KAAK,CAAC;CACvD;AAED,MAAM,WAAW,UAAW,SAAQ,SAAS;IAC3C,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,CAAC,EAAE,MAAM,CAAC;IACd;;OAEG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB;;OAEG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB;AAED,MAAM,WAAW,UAAW,SAAQ,SAAS;IAC3C,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb;;OAEG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;OAEG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;OAEG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB;;OAEG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB;AAED,MAAM,WAAW,QAAS,SAAQ,SAAS;IACzC,IAAI,EAAE,MAAM,CAAC;IACb,IAAI,EAAE,MAAM,CAAC;CACd;AAED,MAAM,WAAW,UAAW,SAAQ,SAAS;IAC3C,IAAI,EAAE,QAAQ,CAAC;IACf,IAAI,EAAE,MAAM,CAAC;IACb;;OAEG;IACH,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB;;OAEG;IACH,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB;;OAEG;IACH,YAAY,CAAC,EAAE,MAAM,CAAC;IACtB;;OAEG;IACH,UAAU,CAAC,EAAE,OAAO,CAAC;CACtB;AAED,MAAM,WAAW,OAAQ,SAAQ,SAAS;IACxC,IAAI,EAAE,KAAK,CAAC;IACZ;;OAEG;IACH,QAAQ,EAAE,MAAM,CAAC;IACjB;;OAEG;IACH,OAAO,EAAE,MAAM,CAAC;IAChB;;OAEG;IACH,MAAM,EAAE,IAAI,GAAG,KAAK,CAAC;CACtB;AAED,MAAM,MAAM,OAAO,GAAG,UAAU,GAAG,UAAU,GAAG,QAAQ,GAAG,UAAU,GAAG,OAAO,CAAC;AAEhF;;GAEG;AACH,MAAM,MAAM,QAAQ,GAChB,YAAY,GACZ,YAAY,GACZ,UAAU,GACV,YAAY,CAAC;AAEjB,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,EAAE,QAAQ,CAAC;CAChB;AAED;;GAEG;AACH,MAAM,WAAW,cAAc;IAC7B;;OAEG;IACH,KAAK,EAAE;QACL,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QACpC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QACpC,KAAK,EAAE,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;QAChC,OAAO,EAAE,MAAM,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QACpC,IAAI,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,CAAC;KAC/B,CAAC;IACF;;OAEG;IACH,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB;;OAEG;IACH,QAAQ,EAAE;QACR,WAAW,EAAE,MAAM,CAAC;QACpB,OAAO,EAAE,MAAM,CAAC;QAChB,KAAK,EAAE;YACL,WAAW,EAAE,MAAM,CAAC;YACpB,WAAW,EAAE,MAAM,CAAC;YACpB,SAAS,EAAE,MAAM,CAAC;YAClB,WAAW,EAAE,MAAM,CAAC;YACpB,QAAQ,EAAE,MAAM,CAAC;YACjB,SAAS,EAAE,MAAM,CAAC;SACnB,CAAC;KACH,CAAC;CACH"}

package/dist/core/graph/types.js

@@ -0,0 +1,9 @@
+/**
+ * Graph structure types for the knowledge base.
+ *
+ * The graph consists of:
+ * - Nodes: Folders, Modules, Terms, and Documentation files
+ * - Edges: Relationships between nodes (references, belongs-to, etc.)
+ */
+export {};
+//# sourceMappingURL=types.js.map

package/dist/core/graph/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../../src/core/graph/types.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG"}

package/dist/core/visualization/dot-generator.d.ts

@@ -0,0 +1,13 @@
+import type { KnowledgeGraph } from "../graph/types.js";
+/**
+ * Generate a Graphviz DOT file from a knowledge graph.
+ *
+ * This creates a hierarchical visualization showing:
+ * - Folders as nested subgraphs (boxes)
+ * - Modules within their folders (ellipses)
+ * - Terms as separate cluster (diamonds)
+ * - Docs as separate cluster (notes)
+ * - Reference relationships as directed edges
+ */
+export declare function generateDot(graph: KnowledgeGraph): string;
+//# sourceMappingURL=dot-generator.d.ts.map

package/dist/core/visualization/dot-generator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dot-generator.d.ts","sourceRoot":"","sources":["../../../src/core/visualization/dot-generator.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,cAAc,EAAc,MAAM,mBAAmB,CAAC;AAEpE;;;;;;;;;GASG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,cAAc,GAAG,MAAM,CAuIzD"}