@kridaydave/code-mapper 1.0.0

package/AGENTS.md

@@ -0,0 +1,174 @@
+# Codebase Cartographer Agent Guidelines
+
+## Build, Lint, and Test Commands
+
+### Build Commands
+- `npm run build` - Compiles TypeScript to JavaScript using tsc
+- Output directory: ./dist (configured in tsconfig.json)
+- Entry point: dist/index.js
+
+### Development Commands
+- `npm run dev` - Runs the MCP server directly with tsx for development
+- Uses tsx for instant TypeScript execution without compilation
+- Primary development workflow
+
+### Production Commands
+- `npm start` - Runs the compiled JavaScript from dist/index.js
+- Used after running npm run build
+
+### Testing Guidelines
+No existing test framework is configured in this repository. For adding tests:
+
+1. **Recommended Setup**:
+   ```bash
+   npm install --save-dev vitest @vitest/coverage-v8
+   ```
+
+2. **Add to package.json**:
+   ```json
+   "scripts": {
+     "test": "vitest run",
+     "test:watch": "vitest",
+     "test:cover": "vitest run --coverage"
+   }
+   ```
+
+3. **Test File Convention**:
+   - Place tests in __tests__ directory or alongside source files with .test.ts suffix
+   - Example: src/mcp/tools.test.ts
+
+4. **Running Specific Tests**:
+   - Single test file: `npx vitest src/mcp/tools.test.ts`
+   - Test with pattern: `npx vitest run -t "scan_codebase"`
+
+### Type Checking
+- `npx tsc --noEmit` - Performs type checking without emitting files
+- Already enabled via "strict": true in tsconfig.json
+- Run as part of CI/CD pipeline
+
+## Code Style Guidelines
+
+### Import Order
+1. Node.js built-in modules (`node:path`, `node:fs`)
+2. External libraries (`@modelcontextprotocol/server`, `zod`, `ts-morph`)
+3. Internal project imports (relative paths)
+4. Sort alphabetically within each group
+5. Prefer named imports over default imports when practical
+
+Example:
+```typescript
+import { resolve } from "node:path";
+import * as fs from "node:fs";
+import { McpServer } from "@modelcontextprotocol/server";
+import { z } from "zod";
+import { ProjectParser } from "../parser/ProjectParser.js";
+```
+
+### Formatting
+- Indentation: 2 spaces
+- Line width: Maximum 100 characters (soft limit)
+- Semicolons: Required
+- Quotes: Single quotes for strings
+- Trailing commas: Multiline objects and arrays
+- Function spacing: Empty line between function declarations
+- Brace style: Opening brace on same line, closing brace on new line
+
+### Types and Interfaces
+- Prefer interfaces for object shapes that may be extended
+- Use type aliases for unions, primitives, and mapped types
+- Enable strict null checks (`strict`: true in tsconfig)
+- Explicit return types for exported functions
+- Use `unknown` instead of `any` when type is truly unknown
+- Specify generic constraints when possible
+
+Example:
+```typescript
+interface FileInfo {
+  relativePath: string;
+  functions: FunctionInfo[];
+  classes: ClassInfo[];
+  imports: ImportInfo[];
+  exports: ExportInfo[];
+  totalLines: number;
+}
+
+type GraphCallback = (node: GraphNode) => boolean | void;
+```
+
+### Naming Conventions
+- Variables and functions: camelCase
+- Classes and interfaces: PascalCase
+- Constants: UPPER_SNAKE_CASE
+- File names: kebab-case (.ts files)
+- Acronyms: Treat as normal words (e.g., "getNodeID" not "getNodeId")
+- Private properties: No underscore prefix (use TypeScript privacy modifiers)
+
+Example:
+```typescript
+class ProjectParser {
+  private cache: Map<string, ParseResult> = new Map();
+  
+  async parse(directory: string): Promise<ParseResult> {
+    // implementation
+  }
+  
+  private findFiles(directory: string): string[] {
+    // implementation
+  }
+}
+```
+
+### Error Handling
+- Use try/catch for asynchronous operations
+- Provide meaningful error messages with context
+- Don't catch errors unless you can handle or enhance them
+- For MCP tools, errors are automatically caught and returned as error content
+- Validate inputs early using Zod schemas (already implemented)
+- Process exits with non-zero code for unrecoverable errors (see index.ts)
+
+### Comments and Documentation
+- JSDoc comments for all exported functions and classes
+- Explain non-obvious logic with inline comments
+- Keep comments up-to-date when modifying code
+- Use TODO: and FIXME: comments for tracking work
+- Document complex type manipulations
+
+Example:
+```typescript
+/**
+ * Scans a directory and returns a summary of all files, functions, classes, and their relationships.
+ * Use this first before any other analysis.
+ */
+server.registerTool("scan_codebase", {
+  // ...
+});
+```
+
+### Project-Specific Patterns
+- MCP tool registration follows consistent pattern in tools.ts
+- Shared cache pattern used in mcp/cache.ts for analyzer instances
+- Error handling in main() function with process.exit(1) for fatal errors
+- Shebang line in index.ts for direct execution
+- Graph algorithms separated from MCP interface layer
+- Parsing and analysis layers clearly separated
+
+### Dependency Management
+- Keep dependencies up-to-date with `npm update`
+- Audit for vulnerabilities with `npm audit`
+- Peer dependencies not used in this project
+- Dev dependencies limited to TypeScript tooling
+
+## MCP Protocol Implementation
+All MCP tools follow this pattern:
+1. Define tool name, description, and input/output schemas using Zod
+2. Implement handler function with proper async/await
+3. Return structured content with text and structuredContent fields
+4. Handle edge cases (empty results, not found, etc.)
+5. Use analyzer cache to avoid reprocessing same directories
+
+## File Organization
+- src/index.ts - MCP server entry point
+- src/mcp/ - MCP-specific code (tools, resources, caching)
+- src/parser/ - TS-Morph based code analysis
+- src/graph/ - Graph theory algorithms and data structures
+- Separation of concerns between parsing, analysis, and MCP interface

package/LICENSE.md

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 CodeGraph
+
+Permission is hereby granted, free of charge, to any person obtaining a copy
+of this software and associated documentation files (the "Software"), to deal
+in the Software without restriction, including without limitation the rights
+to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
+copies of the Software, and to permit persons to whom the Software is
+furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all
+copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
+IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
+AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
+LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING
+FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER
+DEALINGS IN THE SOFTWARE.

package/README.md

@@ -0,0 +1,113 @@
+# CodeGraph
+
+An MCP server that uses AST parsing to map TypeScript/JavaScript codebase structure and expose codebase intelligence for AI assistants.
+
+## Features
+
+- **AST-based analysis** - Uses `ts-morph` (TypeScript compiler API) to parse code without running it
+- **Dependency graphs** - Builds graph representations of how files, functions, and classes relate
+- **Impact ranking** - Identifies the most central/critical files using graph centrality metrics
+- **Call chain tracing** - Finds dependency paths between any two symbols
+- **Mermaid diagrams** - Generates visual dependency diagrams
+
+## MCP Tools
+
+| Tool | Description |
+|------|-------------|
+| `scan_codebase` | Scan a directory and return a summary of all files, functions, classes, and relationships |
+| `find_function` | Search for a function or class by name, returns location, signature, callers, and callees |
+| `analyze_dependencies` | Returns the full dependency graph or a subgraph for a specific file (JSON or Mermaid) |
+| `rank_impact` | Ranks files by centrality (in-degree, out-degree, betweenness) to identify critical modules |
+| `trace_call_chain` | Traces the call chain / dependency path from one function or file to another |
+
+## MCP Resources
+
+| Resource | Description |
+|----------|-------------|
+| `codebase://summary` | Cached summary of the most recently scanned codebase |
+| `codebase://graph/{format}` | Dependency graph in `json` or `mermaid` format |
+
+## Setup
+
+### Install
+
+```bash
+npm install
+npm run build
+```
+
+### Use with Claude Desktop (or any MCP client)
+
+Add this to your MCP client configuration:
+
+```json
+{
+  "mcpServers": {
+    "CodeGraph": {
+      "command": "npx",
+      "args": ["tsx", "/absolute/path/to/CodeGraph/src/index.ts"]
+    }
+  }
+}
+```
+
+Or after building:
+
+```json
+{
+  "mcpServers": {
+    "CodeGraph": {
+      "command": "node",
+      "args": ["/absolute/path/to/CodeGraph/dist/index.js"]
+    }
+  }
+}
+```
+
+## Usage
+
+Once connected, AI assistants can:
+
+1. **Scan your codebase**: "Scan my codebase at ./src"
+2. **Find symbols**: "Where is the authenticate function defined and who calls it?"
+3. **Analyze dependencies**: "Show me the dependency graph as mermaid"
+4. **Rank impact**: "What's the most central file in my project?"
+5. **Trace paths**: "Trace the call chain from handleRequest to saveToDatabase"
+
+## Architecture
+
+```
+src/
+├── index.ts              # MCP server entry point (stdio transport)
+├── parser/
+│   ├── types.ts          # FileInfo, FunctionInfo, ClassInfo, etc.
+│   ├── FileAnalyzer.ts   # ts-morph single-file analysis
+│   └── ProjectParser.ts  # Directory scanning with caching
+├── graph/
+│   ├── types.ts          # GraphNode, GraphEdge, RankedFile, etc.
+│   ├── GraphBuilder.ts   # Converts ParseResult to graphology Graph
+│   └── GraphAnalyzer.ts  # Centrality, path finding, cycle detection
+└── mcp/
+    ├── cache.ts          # Shared analyzer cache
+    ├── tools.ts          # 5 MCP tool definitions
+    └── resources.ts      # MCP resource definitions
+```
+
+## Tech Stack
+
+- **ts-morph** - TypeScript AST parsing (wraps the TypeScript compiler API)
+- **graphology** - Graph data structure for dependency mapping
+- **graphology-metrics** - Centrality algorithms (betweenness, degree, etc.)
+- **graphology-shortest-path** - Bidirectional shortest path finding
+- **@modelcontextprotocol/server** - MCP server SDK with stdio transport
+- **zod** - Schema validation for tool inputs
+
+## Ignored Directories
+
+By default, these directories are excluded from scanning:
+- `node_modules`, `dist`, `build`, `.git`, `coverage`
+- `.next`, `.nuxt`, `.svelte-kit`, `__tests__`, `.cache`
+
+## License
+
+MIT

package/dist/graph/Graph.test.js

@@ -0,0 +1,173 @@
+import { describe, it, expect, beforeEach } from "vitest";
+import { ProjectParser } from "../parser/ProjectParser.js";
+import { GraphBuilder } from "../graph/GraphBuilder.js";
+import { GraphAnalyzer } from "../graph/GraphAnalyzer.js";
+import path from "node:path";
+describe("GraphBuilder", () => {
+    let parser;
+    let builder;
+    let parseResult;
+    beforeEach(async () => {
+        parser = new ProjectParser();
+        builder = new GraphBuilder();
+        const testDir = path.resolve("./fixtures/test-project");
+        parseResult = await parser.parse(testDir);
+    });
+    describe("build", () => {
+        it("should build a graph from parse result", () => {
+            const { graph, nodes, edges } = builder.build(parseResult);
+            expect(graph.order).toBeGreaterThan(0);
+            expect(nodes.length).toBeGreaterThan(0);
+            expect(edges.length).toBeGreaterThan(0);
+        });
+        it("should create file nodes", () => {
+            const { nodes } = builder.build(parseResult);
+            const fileNodes = nodes.filter(n => n.kind === "file");
+            expect(fileNodes.length).toBe(3);
+        });
+        it("should create function nodes", () => {
+            const { nodes } = builder.build(parseResult);
+            const fnNodes = nodes.filter(n => n.kind === "function");
+            expect(fnNodes.length).toBe(3);
+        });
+        it("should create class nodes", () => {
+            const { nodes } = builder.build(parseResult);
+            const classNodes = nodes.filter(n => n.kind === "class");
+            expect(classNodes.length).toBe(1);
+        });
+        it("should create import edges between files", () => {
+            const { edges } = builder.build(parseResult);
+            const importEdges = edges.filter(e => e.kind === "imports");
+            expect(importEdges.length).toBeGreaterThan(0);
+        });
+        it("should create containment edges", () => {
+            const { edges } = builder.build(parseResult);
+            const containsEdges = edges.filter(e => e.kind === "contains");
+            expect(containsEdges.length).toBeGreaterThan(0);
+        });
+    });
+});
+describe("GraphAnalyzer", () => {
+    let parser;
+    let builder;
+    let analyzer;
+    let parseResult;
+    beforeEach(async () => {
+        parser = new ProjectParser();
+        builder = new GraphBuilder();
+        const testDir = path.resolve("./fixtures/test-project");
+        parseResult = await parser.parse(testDir);
+        const { graph, nodes, edges } = builder.build(parseResult);
+        analyzer = new GraphAnalyzer(graph, parseResult, nodes, edges);
+    });
+    describe("rankImpact", () => {
+        it("should rank files by in-degree", () => {
+            const ranked = analyzer.rankImpact("inDegree");
+            expect(ranked.length).toBeGreaterThan(0);
+            expect(ranked[0]).toHaveProperty("relativePath");
+            expect(ranked[0]).toHaveProperty("score");
+        });
+        it("should rank files by out-degree", () => {
+            const ranked = analyzer.rankImpact("outDegree");
+            expect(ranked.length).toBeGreaterThan(0);
+        });
+        it("should rank files by betweenness", () => {
+            const ranked = analyzer.rankImpact("betweenness");
+            expect(ranked.length).toBeGreaterThan(0);
+        });
+        it("should include file metrics in ranking", () => {
+            const ranked = analyzer.rankImpact("inDegree");
+            expect(ranked[0]).toHaveProperty("functionCount");
+            expect(ranked[0]).toHaveProperty("classCount");
+            expect(ranked[0]).toHaveProperty("importCount");
+            expect(ranked[0]).toHaveProperty("exportCount");
+        });
+    });
+    describe("findFunction", () => {
+        it("should find functions by name", () => {
+            const matches = analyzer.findFunction("add", "function");
+            expect(matches.length).toBeGreaterThan(0);
+            expect(matches[0].name).toBe("add");
+        });
+        it("should find classes by name", () => {
+            const matches = analyzer.findFunction("Calculator", "class");
+            expect(matches.length).toBe(1);
+            expect(matches[0].name).toBe("Calculator");
+        });
+        it("should find both functions and classes when type is any", () => {
+            const matches = analyzer.findFunction("Calculator", "any");
+            expect(matches.length).toBe(1);
+        });
+        it("should return empty for non-existent symbol", () => {
+            const matches = analyzer.findFunction("NonExistentSymbol", "any");
+            expect(matches).toEqual([]);
+        });
+    });
+    describe("getCallers and getCallees", () => {
+        it("should get callers for a node", () => {
+            const nodes = analyzer.getNodes();
+            const fileNode = nodes.find(n => n.kind === "file" && n.label.includes("calculator"));
+            if (fileNode) {
+                const callers = analyzer.getCallers(fileNode.id);
+                expect(callers).toBeDefined();
+            }
+        });
+        it("should get callees for a node", () => {
+            const nodes = analyzer.getNodes();
+            const fileNode = nodes.find(n => n.kind === "file" && n.label.includes("calculator"));
+            if (fileNode) {
+                const callees = analyzer.getCallees(fileNode.id);
+                expect(callees).toBeDefined();
+            }
+        });
+    });
+    describe("traceCallChain", () => {
+        it("should find paths between nodes", () => {
+            const result = analyzer.traceCallChain("add", "Calculator");
+            expect(result).toHaveProperty("found");
+            expect(result).toHaveProperty("paths");
+        });
+        it("should return empty for non-existent nodes", () => {
+            const result = analyzer.traceCallChain("NonExistent", "AlsoNotHere");
+            expect(result.found).toBe(false);
+            expect(result.paths).toEqual([]);
+        });
+    });
+    describe("toMermaid", () => {
+        it("should generate mermaid diagram", () => {
+            const mermaid = analyzer.toMermaid();
+            expect(mermaid).toContain("graph TD");
+            expect(mermaid).toContain("-->");
+        });
+        it("should filter by target file", () => {
+            const mermaid = analyzer.toMermaid("calculator");
+            expect(mermaid).toContain("graph TD");
+        });
+    });
+    describe("detectCycles", () => {
+        it("should detect cycles in the graph", () => {
+            const cycles = analyzer.detectCycles();
+            expect(cycles).toBeDefined();
+            expect(Array.isArray(cycles)).toBe(true);
+        });
+    });
+    describe("getGraph, getNodes, getEdges, getParseResult", () => {
+        it("should return the graph", () => {
+            const graph = analyzer.getGraph();
+            expect(graph).toBeDefined();
+        });
+        it("should return nodes", () => {
+            const nodes = analyzer.getNodes();
+            expect(nodes.length).toBeGreaterThan(0);
+        });
+        it("should return edges", () => {
+            const edges = analyzer.getEdges();
+            expect(edges.length).toBeGreaterThan(0);
+        });
+        it("should return parse result", () => {
+            const result = analyzer.getParseResult();
+            expect(result.totalFiles).toBe(3);
+        });
+    });
+});
+//# sourceMappingURL=Graph.test.js.map

package/dist/graph/Graph.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Graph.test.js","sourceRoot":"","sources":["../../src/graph/Graph.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,UAAU,EAAE,MAAM,QAAQ,CAAC;AAC1D,OAAO,EAAE,aAAa,EAAE,MAAM,4BAA4B,CAAC;AAC3D,OAAO,EAAE,YAAY,EAAE,MAAM,0BAA0B,CAAC;AACxD,OAAO,EAAE,aAAa,EAAE,MAAM,2BAA2B,CAAC;AAC1D,OAAO,IAAI,MAAM,WAAW,CAAC;AAE7B,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC5B,IAAI,MAAqB,CAAC;IAC1B,IAAI,OAAqB,CAAC;IAC1B,IAAI,WAAwD,CAAC;IAE7D,UAAU,CAAC,KAAK,IAAI,EAAE;QACpB,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;QAC7B,OAAO,GAAG,IAAI,YAAY,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,yBAAyB,CAAC,CAAC;QACxD,WAAW,GAAG,MAAM,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;IAC5C,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,OAAO,EAAE,GAAG,EAAE;QACrB,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAChD,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YAE3D,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YACvC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YACxC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;YAClC,MAAM,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YAE7C,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;YACvD,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;YACtC,MAAM,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YAE7C,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;YACzD,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,2BAA2B,EAAE,GAAG,EAAE;YACnC,MAAM,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YAE7C,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,OAAO,CAAC,CAAC;YACzD,MAAM,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,0CAA0C,EAAE,GAAG,EAAE;YAClD,MAAM,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YAE7C,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;YAC5D,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAChD,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YACzC,MAAM,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;YAE7C,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,UAAU,CAAC,CAAC;YAC/D,MAAM,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,eAAe,EAAE,GAAG,EAAE;IAC7B,IAAI,MAAqB,CAAC;IAC1B,IAAI,OAAqB,CAAC;IAC1B,IAAI,QAAuB,CAAC;IAC5B,IAAI,WAAwD,CAAC;IAE7D,UAAU,CAAC,KAAK,IAAI,EAAE;QACpB,MAAM,GAAG,IAAI,aAAa,EAAE,CAAC;QAC7B,OAAO,GAAG,IAAI,YAAY,EAAE,CAAC;QAC7B,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,yBAAyB,CAAC,CAAC;QACxD,WAAW,GAAG,MAAM,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC;QAC1C,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC;QAC3D,QAAQ,GAAG,IAAI,aAAa,CAAC,KAAK,EAAE,WAAW,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,YAAY,EAAE,GAAG,EAAE;QAC1B,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;YACxC,MAAM,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;YAE/C,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YACzC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,cAAc,CAAC,CAAC;YACjD,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QAC5C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YACzC,MAAM,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;YAEhD,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,kCAAkC,EAAE,GAAG,EAAE;YAC1C,MAAM,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC;YAElD,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,wCAAwC,EAAE,GAAG,EAAE;YAChD,MAAM,MAAM,GAAG,QAAQ,CAAC,UAAU,CAAC,UAAU,CAAC,CAAC;YAE/C,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,eAAe,CAAC,CAAC;YAClD,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,YAAY,CAAC,CAAC;YAC/C,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;YAChD,MAAM,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,cAAc,CAAC,aAAa,CAAC,CAAC;QAClD,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC5B,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACvC,MAAM,OAAO,GAAG,QAAQ,CAAC,YAAY,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;YAEzD,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;YAC1C,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6BAA6B,EAAE,GAAG,EAAE;YACrC,MAAM,OAAO,GAAG,QAAQ,CAAC,YAAY,CAAC,YAAY,EAAE,OAAO,CAAC,CAAC;YAE7D,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/B,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC7C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,yDAAyD,EAAE,GAAG,EAAE;YACjE,MAAM,OAAO,GAAG,QAAQ,CAAC,YAAY,CAAC,YAAY,EAAE,KAAK,CAAC,CAAC;YAE3D,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACjC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;YACrD,MAAM,OAAO,GAAG,QAAQ,CAAC,YAAY,CAAC,mBAAmB,EAAE,KAAK,CAAC,CAAC;YAElE,MAAM,CAAC,OAAO,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAC9B,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,2BAA2B,EAAE,GAAG,EAAE;QACzC,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACvC,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC;YAClC,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC;YAEtF,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,OAAO,GAAG,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACjD,MAAM,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;YAChC,CAAC;QACH,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;YACvC,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC;YAClC,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC,QAAQ,CAAC,YAAY,CAAC,CAAC,CAAC;YAEtF,IAAI,QAAQ,EAAE,CAAC;gBACb,MAAM,OAAO,GAAG,QAAQ,CAAC,UAAU,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;gBACjD,MAAM,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;YAChC,CAAC;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;QAC9B,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YACzC,MAAM,MAAM,GAAG,QAAQ,CAAC,cAAc,CAAC,KAAK,EAAE,YAAY,CAAC,CAAC;YAE5D,MAAM,CAAC,MAAM,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;YACvC,MAAM,CAAC,MAAM,CAAC,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4CAA4C,EAAE,GAAG,EAAE;YACpD,MAAM,MAAM,GAAG,QAAQ,CAAC,cAAc,CAAC,aAAa,EAAE,aAAa,CAAC,CAAC;YAErE,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,WAAW,EAAE,GAAG,EAAE;QACzB,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;YACzC,MAAM,OAAO,GAAG,QAAQ,CAAC,SAAS,EAAE,CAAC;YAErC,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;YACtC,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QACnC,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,8BAA8B,EAAE,GAAG,EAAE;YACtC,MAAM,OAAO,GAAG,QAAQ,CAAC,SAAS,CAAC,YAAY,CAAC,CAAC;YAEjD,MAAM,CAAC,OAAO,CAAC,CAAC,SAAS,CAAC,UAAU,CAAC,CAAC;QACxC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;QAC5B,EAAE,CAAC,mCAAmC,EAAE,GAAG,EAAE;YAC3C,MAAM,MAAM,GAAG,QAAQ,CAAC,YAAY,EAAE,CAAC;YAEvC,MAAM,CAAC,MAAM,CAAC,CAAC,WAAW,EAAE,CAAC;YAC7B,MAAM,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC3C,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,CAAC,8CAA8C,EAAE,GAAG,EAAE;QAC5D,EAAE,CAAC,yBAAyB,EAAE,GAAG,EAAE;YACjC,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC;YAClC,MAAM,CAAC,KAAK,CAAC,CAAC,WAAW,EAAE,CAAC;QAC9B,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC7B,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC;YAClC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,qBAAqB,EAAE,GAAG,EAAE;YAC7B,MAAM,KAAK,GAAG,QAAQ,CAAC,QAAQ,EAAE,CAAC;YAClC,MAAM,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QAC1C,CAAC,CAAC,CAAC;QAEH,EAAE,CAAC,4BAA4B,EAAE,GAAG,EAAE;YACpC,MAAM,MAAM,GAAG,QAAQ,CAAC,cAAc,EAAE,CAAC;YACzC,MAAM,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}