@shvmgyl15/tsgraph 0.1.0

package/AGENTS.md

@@ -0,0 +1,64 @@
+# tsgraph — Project DNA
+
+## Vision
+A fast, local-only CLI tool that indexes Next.js / React / TypeScript codebases using AST
+parsing into a queryable graph.json for AI coding agents. Equivalent to gograph but for TS.
+Output is Markdown + JSON. No network calls, no telemetry, no SaaS backend.
+
+## Design Philosophy (Go → TS Adaptation)
+tsgraph is inspired by gograph (Go) but adapted for TypeScript/React/Next.js — NOT a blind copy.
+Key language-driven differences:
+- **Export model**: TS `export` keyword maps to `isExported`; class methods are always considered exported (default `public`)
+- **No goroutines/channels** — replaced by async/promise/setTimeout concurrency
+- **No struct tags** — TS has no native equivalent
+- **Router detection** is Next.js App Router / Pages Router, not Gin/mux
+- **React components** tracked via `isClientComponent` / `isServerComponent`
+- **Interface satisfaction** is structural in TS — `ImplementsEdge` may be dropped if unused
+- Go-specific concepts (structs with fields+tests, `MutationEdge`, `StructField.tags`) are present but may be removed if they don't earn their keep for TS
+
+## Tech Stack
+- Runtime: Node.js + tsx (dev) / tsc (build)
+- AST: ts-morph (wraps TypeScript compiler API)
+- CLI: commander
+- MCP: @modelcontextprotocol/sdk
+- Testing: vitest
+- Linting: none (tsc strict mode is sufficient)
+
+## Agent Rules
+
+### Task Management
+- READ TODOS.md at session start to know what's done and what's next
+- UPDATE TODOS.md when you start/finish a task (`[.]` in-progress, `[x]` done)
+- Work in phase order unless a task has no blockers
+
+### Orchestration
+- This is a single-orchestrator project. When a task has multiple independent
+  sub-tasks, delegate via the `task` tool (`subagent_type: general`) rather
+  than doing them sequentially.
+- For each delegated sub-task, specify:
+  1. Exact files the sub-agent may modify
+  2. Which phase from TODOS.md it belongs to
+  3. What to return (never let sub-agents commit or merge)
+- After all sub-tasks complete, run `npm run build && npm test` and fix
+  any issues directly. Do NOT re-delegate broken builds.
+
+### Quality
+- Run `npm run build` (tsc) AND `npm test` (vitest) after every task completion
+- Fix all type errors and test failures before marking `[x]`
+- If build is already broken when you start, note it in TODOS.md and fix it first
+
+### Research
+- Use webfetch when unsure about an API — check ts-morph docs, Next.js docs,
+  or reference gograph's Go source at https://github.com/ozgurcd/gograph
+- DO NOT guess API signatures
+
+### Code Style
+- No comments in source files unless logic is non-obvious
+- Named exports only (no default exports)
+- Strict TypeScript everywhere, avoid `any`
+- Follow patterns from adjacent files in the codebase
+- No emojis in source code or commit messages
+
+### Communication
+- Be concise. Use TODOS.md for status, respond with only what's needed.
+- If stuck, explain the blocker clearly rather than overthinking.

package/README.md

@@ -0,0 +1,128 @@
+# @shvmgyl15/tsgraph
+
+A fast, local-only CLI tool that indexes TypeScript/React/Next.js codebases using AST parsing into a queryable graph.json for AI coding agents.
+
+No network calls, no telemetry, no SaaS backend.
+
+## Install
+
+```bash
+npm install -g @shvmgyl15/tsgraph
+
+# Or use directly via npx:
+npx @shvmgyl15/tsgraph build .
+```
+
+## Quick Start
+
+```bash
+# Index your project
+cd my-project
+tsgraph build .
+
+# Query the graph
+tsgraph query "getUser"          # search symbols
+tsgraph callers "getUser"        # who calls getUser
+tsgraph callees "getUser"        # what getUser calls
+tsgraph node "getUser"           # symbol details
+tsgraph source "getUser"         # symbol source code
+
+# Analysis
+tsgraph hotspots                 # files needing refactoring
+tsgraph complexity --sort        # cyclomatic complexity
+tsgraph orphans                  # dead code detection
+tsgraph coupling                 # package dependency coupling
+
+# Traversal
+tsgraph impact "getUser"         # downstream blast radius
+tsgraph path "foo" "bar"         # shortest call path
+tsgraph trace "error msg"        # trace string literal upstream
+```
+
+## All Commands
+
+| Command | Description |
+|---------|-------------|
+| `build <root>` | Index project into `.tsgraph/graph.json` + `GRAPH_REPORT.md` |
+| `callers <symbol>` | Show callers of a symbol |
+| `callees <symbol>` | Show callees of a symbol |
+| `node <symbol>` | Show symbol details |
+| `source <symbol>` | Extract source code for a symbol |
+| `query <pattern>` | Search symbols by pattern |
+| `imports <path>` | Find files importing a package path |
+| `public [package]` | List exported symbols |
+| `focus <package>` | Show all assets for a package |
+| `context <symbol>` | Bundle node + source + callers + callees |
+| `complexity [file]` | Cyclomatic complexity analysis |
+| `hotspot` | Rank files by complexity × size |
+| `coupling` | Package coupling analysis |
+| `deps <symbol>` | Call dependency tree |
+| `impact <symbol>` | Downstream blast radius (BFS) |
+| `path <from> <to>` | Shortest call path (BFS) |
+| `orphans` | Dead code detection |
+| `trace <string>` | String literal trace upstream |
+| `boundaries` | Architecture enforcement via `.tsgraph/boundaries.json` |
+| `changes [--base]` | Git-aware changed files and symbols |
+| `stale [--days]` | Files not modified recently |
+| `plan <files...>` | Change planning with blast radius |
+| `review [--base]` | Code review summary |
+| `add-opencode-plugin` | Configure opencode MCP + agent |
+| `mcp` | Start MCP stdio server |
+
+## Next.js Support
+
+@shvmgyl15/tsgraph automatically detects Next.js project structure:
+
+- **App Router**: `page.tsx`, `layout.tsx`, `loading.tsx`, `error.tsx`, `route.ts`
+- **Pages Router**: `pages/` directory structure
+- **Client/Server**: `'use client'` / `'use server'` directives
+- **React Hooks**: detects hooks usage for client component inference
+- **API Routes**: extracts route handlers from `route.ts` files
+
+## Architecture Boundaries
+
+Define layer rules in `.tsgraph/boundaries.json`:
+
+```json
+{
+  "layers": [
+    { "name": "ui", "path": "src/components", "dependsOn": ["shared"] },
+    { "name": "shared", "path": "src/shared", "dependsOn": ["lib"] },
+    { "name": "lib", "path": "src/lib", "dependsOn": [] }
+  ]
+}
+```
+
+```bash
+tsgraph boundaries
+```
+
+## AI Agent Integration
+
+### opencode
+
+```bash
+tsgraph add-opencode-plugin
+```
+Updates `opencode.json` with the tsgraph MCP server and creates `.opencode/agents/tsgraph.json`.
+
+### Claude / Any MCP Client
+
+```bash
+tsgraph mcp
+```
+Starts an MCP stdio server exposing all query/search commands as tools. Configure your MCP client to launch `tsgraph mcp` as a subprocess.
+
+## Development
+
+```bash
+git clone https://github.com/shvmgyl15/tsgraph.git
+cd tsgraph
+npm install
+npm run build
+npm test
+```
+
+## License
+
+MIT

package/TODOS.md

@@ -0,0 +1,61 @@
+# tsgraph — Implementation Plan
+
+## Phase 1: Project Scaffold
+- [x] Update opencode.json with AGENTS.md reference
+- [x] Create AGENTS.md with project DNA
+- [x] Create TODOS.md (this file)
+- [x] Initialize package.json with dependencies
+- [x] Configure tsconfig.json (strict, ESNext)
+- [x] Setup vitest config
+- [x] Create src directory structure
+
+## Phase 2: Core Data Model
+- [x] Define graph types (Graph, PackageNode, FileNode, SymbolNode, etc.)
+- [x] Add JSON serialization / deserialization
+- [x] Write unit tests for graph types
+
+## Phase 3: Scanner + Parser Core
+- [x] Implement file scanner (walk tree, gitignore support, file classification)
+- [x] Implement symbol extractor (ts-morph: functions, classes, interfaces, types, enums, vars)
+- [x] Implement call expression extractor
+- [x] Implement import edge + dependency (package.json) extractor
+- [x] Wire up `build` command end-to-end
+- [x] Write parser/scanner unit tests
+
+## Phase 4: Query Commands
+- [x] callers / callees
+- [x] node / source / query
+- [x] context (bundle — node + source + callers + callees + tests)
+- [x] imports / public / focus
+- [x] Write query command tests
+
+## Phase 5: Next.js / React Extractors
+- [x] App Router tree detection (page/layout/loading/error/route files)
+- [x] Pages Router detection
+- [x] 'use client' / 'use server' + hooks analysis
+- [x] Route extraction from API / route handlers
+- [x] Write extractor tests
+
+## Phase 6: Analysis Commands
+- [x] complexity (cyclomatic)
+- [x] hotspot / coupling / deps
+- [x] Write analysis tests
+
+## Phase 7: Graph Traversal
+- [x] impact (BFS downstream blast radius)
+- [x] path (BFS shortest path between symbols)
+- [x] orphans (dead code detection)
+- [x] trace / errorflow (reverse BFS from string literal)
+- [x] Write traversal tests
+
+## Phase 8: MCP Server
+- [x] MCP stdio server wrapping all query tools
+- [x] Tool definition for each search/query command
+- [x] MCP integration test
+
+## Phase 9: Advanced Features
+- [x] boundaries (architecture enforcement via .tsgraph/boundaries.json)
+- [x] changes / stale (git-aware incremental analysis)
+- [x] plan / review (change planning reports)
+- [x] add-opencode-plugin (auto-configure opencode MCP + agent)
+- [x] Enhanced GRAPH_REPORT.md (hotspots, boundaries, coupling, stale)

package/dist/analysis/analysis.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=analysis.test.d.ts.map

package/dist/analysis/analysis.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"analysis.test.d.ts","sourceRoot":"","sources":["../../src/analysis/analysis.test.ts"],"names":[],"mappings":""}

package/dist/analysis/analysis.test.js

@@ -0,0 +1,359 @@
+import { describe, it, expect } from "vitest";
+import path from "node:path";
+import fs from "node:fs";
+import os from "node:os";
+import { makeGraph, makeSymbolNode, makeCallEdge, makeImportEdge, makeFileNode, } from "../graph/types.js";
+import { cyclomaticComplexity, analyzeComplexity } from "./complexity.js";
+import { findHotspots } from "./hotspot.js";
+import { analyzeCoupling, dependencyTree } from "./coupling.js";
+function createTempDir() {
+    return fs.mkdtempSync(path.join(os.tmpdir(), "tsgraph-test-"));
+}
+describe("cyclomaticComplexity", () => {
+    it("returns 1 for a function with no branches", () => {
+        const code = `function greet() { return "hello"; }`;
+        expect(cyclomaticComplexity(code)).toBe(1);
+    });
+    it("counts if statements", () => {
+        const code = `function f() {
+      if (a) return 1;
+      if (b) return 2;
+    }`;
+        expect(cyclomaticComplexity(code)).toBe(3);
+    });
+    it("counts if-else as single branch point", () => {
+        const code = `function f() {
+      if (a) { return 1; }
+      else { return 2; }
+    }`;
+        expect(cyclomaticComplexity(code)).toBe(2);
+    });
+    it("counts else-if as additional branch", () => {
+        const code = `function f() {
+      if (a) { return 1; }
+      else if (b) { return 2; }
+      else { return 3; }
+    }`;
+        expect(cyclomaticComplexity(code)).toBe(3);
+    });
+    it("counts for loops", () => {
+        const code = `function f() {
+      for (let i = 0; i < 10; i++) {}
+    }`;
+        expect(cyclomaticComplexity(code)).toBe(2);
+    });
+    it("counts while loops", () => {
+        const code = `function f() {
+      while (true) { break; }
+    }`;
+        expect(cyclomaticComplexity(code)).toBe(2);
+    });
+    it("counts case labels", () => {
+        const code = `function f(x: number) {
+      switch (x) {
+        case 1: return "a";
+        case 2: return "b";
+        case 3: return "c";
+      }
+    }`;
+        expect(cyclomaticComplexity(code)).toBe(4);
+    });
+    it("counts catch clauses", () => {
+        const code = `function f() {
+      try { doStuff(); }
+      catch (e) { handle(); }
+    }`;
+        expect(cyclomaticComplexity(code)).toBe(2);
+    });
+    it("counts ternary operators", () => {
+        const code = `function f() {
+      return a ? b : c;
+    }`;
+        expect(cyclomaticComplexity(code)).toBe(2);
+    });
+    it("counts logical && and ||", () => {
+        const code = `function f() {
+      if (a && b || c) return 1;
+    }`;
+        expect(cyclomaticComplexity(code)).toBe(4);
+    });
+    it("avoids counting string literals", () => {
+        const code = `function f() {
+      const s = "if (true) { for(;;) {} }";
+      return s;
+    }`;
+        expect(cyclomaticComplexity(code)).toBe(1);
+    });
+    it("ignores comments", () => {
+        const code = `function f() {
+      // if (true) { return 1; }
+      /* for(;;) {} */
+      return 0;
+    }`;
+        expect(cyclomaticComplexity(code)).toBe(1);
+    });
+});
+describe("analyzeComplexity", () => {
+    it("returns complexity for all functions in a project", () => {
+        const dir = createTempDir();
+        const filePath = path.join(dir, "src/lib.ts");
+        fs.mkdirSync(path.dirname(filePath), { recursive: true });
+        fs.writeFileSync(filePath, [
+            "export function simple() { return 1; }",
+            "export function complex() {",
+            "  if (a) { for(;;) {} }",
+            "  return 0;",
+            "}",
+        ].join("\n"), "utf-8");
+        const graph = makeGraph({
+            root: dir,
+            files: [makeFileNode({ path: "src/lib.ts", lines: 5 })],
+            symbols: [
+                makeSymbolNode({
+                    id: "simple",
+                    name: "simple",
+                    kind: "function",
+                    file: "src/lib.ts",
+                    line: 1,
+                    endLine: 1,
+                    packageName: "app",
+                    isExported: true,
+                }),
+                makeSymbolNode({
+                    id: "complex",
+                    name: "complex",
+                    kind: "function",
+                    file: "src/lib.ts",
+                    line: 2,
+                    endLine: 5,
+                    packageName: "app",
+                    isExported: true,
+                }),
+            ],
+        });
+        const results = analyzeComplexity(graph);
+        expect(results).toHaveLength(2);
+        const simple = results.find((r) => r.symbol.name === "simple");
+        const complex = results.find((r) => r.symbol.name === "complex");
+        expect(simple.complexity).toBe(1);
+        expect(complex.complexity).toBeGreaterThanOrEqual(2);
+        fs.rmSync(dir, { recursive: true });
+    });
+    it("filters by file when specified", () => {
+        const dir = createTempDir();
+        const filePath = path.join(dir, "src/a.ts");
+        fs.mkdirSync(path.dirname(filePath), { recursive: true });
+        fs.writeFileSync(filePath, "export function foo() {}", "utf-8");
+        const graph = makeGraph({
+            root: dir,
+            symbols: [
+                makeSymbolNode({
+                    id: "foo",
+                    name: "foo",
+                    kind: "function",
+                    file: "src/a.ts",
+                    line: 1,
+                    endLine: 1,
+                }),
+                makeSymbolNode({
+                    id: "bar",
+                    name: "bar",
+                    kind: "function",
+                    file: "src/b.ts",
+                    line: 1,
+                    endLine: 1,
+                }),
+            ],
+        });
+        const results = analyzeComplexity(graph, "a.ts");
+        expect(results).toHaveLength(1);
+        expect(results[0].symbol.name).toBe("foo");
+        fs.rmSync(dir, { recursive: true });
+    });
+});
+describe("findHotspots", () => {
+    it("returns top hotspots sorted by score", () => {
+        const dir = createTempDir();
+        const filePath = path.join(dir, "src/hot.ts");
+        fs.mkdirSync(path.dirname(filePath), { recursive: true });
+        fs.writeFileSync(filePath, [
+            "export function a() {",
+            "  if (x) { for(;;) {} }",
+            "  if (y) { while(z) {} }",
+            "  return 0;",
+            "}",
+            "export function b() { return 1; }",
+        ].join("\n"), "utf-8");
+        const graph = makeGraph({
+            root: dir,
+            files: [makeFileNode({ path: "src/hot.ts", lines: 6 })],
+            symbols: [
+                makeSymbolNode({
+                    id: "a",
+                    name: "a",
+                    kind: "function",
+                    file: "src/hot.ts",
+                    line: 1,
+                    endLine: 5,
+                    packageName: "app",
+                }),
+                makeSymbolNode({
+                    id: "b",
+                    name: "b",
+                    kind: "function",
+                    file: "src/hot.ts",
+                    line: 6,
+                    endLine: 6,
+                    packageName: "app",
+                }),
+            ],
+        });
+        const hotspots = findHotspots(graph, 5);
+        expect(hotspots.length).toBeGreaterThanOrEqual(1);
+        expect(hotspots[0].file).toBe("src/hot.ts");
+        fs.rmSync(dir, { recursive: true });
+    });
+});
+describe("analyzeCoupling", () => {
+    it("finds packages importing from other modules", () => {
+        const graph = makeGraph({
+            files: [
+                makeFileNode({ path: "src/orders.ts", packageName: "orders" }),
+                makeFileNode({ path: "src/payment.ts", packageName: "payment" }),
+                makeFileNode({ path: "src/notify.ts", packageName: "notify" }),
+            ],
+            imports: [
+                makeImportEdge({
+                    fromFile: "src/orders.ts",
+                    fromPackage: "orders",
+                    importPath: "payment",
+                    alias: "payment",
+                    isDefault: true,
+                }),
+                makeImportEdge({
+                    fromFile: "src/orders.ts",
+                    fromPackage: "orders",
+                    importPath: "notify",
+                    alias: "notify",
+                    isDefault: true,
+                }),
+                makeImportEdge({
+                    fromFile: "src/orders.ts",
+                    fromPackage: "orders",
+                    importPath: "payment",
+                    alias: "processPayment",
+                    isDefault: false,
+                }),
+            ],
+        });
+        const results = analyzeCoupling(graph);
+        expect(results).toHaveLength(2);
+        const paymentCoupling = results.find((r) => r.coupledTo === "payment");
+        expect(paymentCoupling).toBeTruthy();
+        expect(paymentCoupling.importCount).toBe(2);
+        expect(paymentCoupling.packageName).toBe("orders");
+    });
+});
+describe("dependencyTree", () => {
+    it("builds a tree from call edges", () => {
+        const graph = makeGraph({
+            symbols: [
+                makeSymbolNode({
+                    id: "src/main.ts::serve",
+                    name: "serve",
+                    kind: "function",
+                    file: "src/main.ts",
+                    line: 1,
+                    endLine: 5,
+                    packageName: "app",
+                }),
+                makeSymbolNode({
+                    id: "src/main.ts::greet",
+                    name: "greet",
+                    kind: "function",
+                    file: "src/main.ts",
+                    line: 6,
+                    endLine: 8,
+                    packageName: "app",
+                }),
+                makeSymbolNode({
+                    id: "src/main.ts::log",
+                    name: "log",
+                    kind: "function",
+                    file: "src/main.ts",
+                    line: 9,
+                    endLine: 11,
+                    packageName: "app",
+                }),
+            ],
+            calls: [
+                makeCallEdge({
+                    callerSymbolId: "src/main.ts::serve",
+                    callerName: "serve",
+                    calleeRaw: "greet",
+                    file: "src/main.ts",
+                    line: 3,
+                }),
+                makeCallEdge({
+                    callerSymbolId: "src/main.ts::serve",
+                    callerName: "serve",
+                    calleeRaw: "log",
+                    file: "src/main.ts",
+                    line: 4,
+                }),
+            ],
+        });
+        const tree = dependencyTree(graph, "serve");
+        expect(tree).toBeTruthy();
+        expect(tree.name).toBe("serve");
+        expect(tree.children).toHaveLength(2);
+        const childNames = tree.children.map((c) => c.name).sort();
+        expect(childNames).toEqual(["greet", "log"]);
+    });
+    it("returns undefined for unknown symbol", () => {
+        const graph = makeGraph();
+        const tree = dependencyTree(graph, "noop");
+        expect(tree).toBeUndefined();
+    });
+    it("respects max depth", () => {
+        const graph = makeGraph({
+            symbols: [
+                makeSymbolNode({
+                    id: "a",
+                    name: "a",
+                    kind: "function",
+                    file: "a.ts",
+                    line: 1,
+                    endLine: 1,
+                    packageName: "app",
+                }),
+                makeSymbolNode({
+                    id: "b",
+                    name: "b",
+                    kind: "function",
+                    file: "b.ts",
+                    line: 1,
+                    endLine: 1,
+                    packageName: "app",
+                }),
+                makeSymbolNode({
+                    id: "c",
+                    name: "c",
+                    kind: "function",
+                    file: "c.ts",
+                    line: 1,
+                    endLine: 1,
+                    packageName: "app",
+                }),
+            ],
+            calls: [
+                makeCallEdge({ callerSymbolId: "a", callerName: "a", calleeRaw: "b", file: "a.ts", line: 1 }),
+                makeCallEdge({ callerSymbolId: "b", callerName: "b", calleeRaw: "c", file: "b.ts", line: 1 }),
+            ],
+        });
+        const tree = dependencyTree(graph, "a", 1);
+        expect(tree.children).toHaveLength(1);
+        expect(tree.children[0].children).toHaveLength(0);
+    });
+});
+//# sourceMappingURL=analysis.test.js.map

package/dist/analysis/analysis.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"analysis.test.js","sourceRoot":"","sources":["../../src/analysis/analysis.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,MAAM,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EAAE,MAAM,SAAS,CAAC;AACzB,OAAO,EAAE,MAAM,SAAS,CAAC;AACzB,OAAO,EACL,SAAS,EACT,cAAc,EACd,YAAY,EACZ,cAAc,EAEd,YAAY,GACb,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAE,oBAAoB,EAAE,iBAAiB,EAAE,MAAM,iBAAiB,CAAC;AAC1E,OAAO,EAAE,YAAY,EAAE,MAAM,cAAc,CAAC;AAC5C,OAAO,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,eAAe,CAAC;AAEhE,SAAS,aAAa;IACpB,OAAO,EAAE,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,EAAE,EAAE,eAAe,CAAC,CAAC,CAAC;AACjE,CAAC;AAED,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;IACpC,EAAE,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACnD,MAAM,IAAI,GAAG,sCAAsC,CAAC;QACpD,MAAM,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,MAAM,IAAI,GAAG;;;MAGX,CAAC;QACH,MAAM,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,uCAAuC,EAAE,GAAG,EAAE;QAC/C,MAAM,IAAI,GAAG;;;MAGX,CAAC;QACH,MAAM,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC7C,MAAM,IAAI,GAAG;;;;MAIX,CAAC;QACH,MAAM,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAC1B,MAAM,IAAI,GAAG;;MAEX,CAAC;QACH,MAAM,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC5B,MAAM,IAAI,GAAG;;MAEX,CAAC;QACH,MAAM,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC5B,MAAM,IAAI,GAAG;;;;;;MAMX,CAAC;QACH,MAAM,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sBAAsB,EAAE,GAAG,EAAE;QAC9B,MAAM,IAAI,GAAG;;;MAGX,CAAC;QACH,MAAM,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,MAAM,IAAI,GAAG;;MAEX,CAAC;QACH,MAAM,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,0BAA0B,EAAE,GAAG,EAAE;QAClC,MAAM,IAAI,GAAG;;MAEX,CAAC;QACH,MAAM,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,iCAAiC,EAAE,GAAG,EAAE;QACzC,MAAM,IAAI,GAAG;;;MAGX,CAAC;QACH,MAAM,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,kBAAkB,EAAE,GAAG,EAAE;QAC1B,MAAM,IAAI,GAAG;;;;MAIX,CAAC;QACH,MAAM,CAAC,oBAAoB,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAC7C,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IACjC,EAAE,CAAC,mDAAmD,EAAE,GAAG,EAAE;QAC3D,MAAM,GAAG,GAAG,aAAa,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;QAC9C,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAC1D,EAAE,CAAC,aAAa,CACd,QAAQ,EACR;YACE,wCAAwC;YACxC,6BAA6B;YAC7B,yBAAyB;YACzB,aAAa;YACb,GAAG;SACJ,CAAC,IAAI,CAAC,IAAI,CAAC,EACZ,OAAO,CACR,CAAC;QAEF,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,IAAI,EAAE,GAAG;YACT,KAAK,EAAE,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YACvD,OAAO,EAAE;gBACP,cAAc,CAAC;oBACb,EAAE,EAAE,QAAQ;oBACZ,IAAI,EAAE,QAAQ;oBACd,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,YAAY;oBAClB,IAAI,EAAE,CAAC;oBACP,OAAO,EAAE,CAAC;oBACV,WAAW,EAAE,KAAK;oBAClB,UAAU,EAAE,IAAI;iBACjB,CAAC;gBACF,cAAc,CAAC;oBACb,EAAE,EAAE,SAAS;oBACb,IAAI,EAAE,SAAS;oBACf,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,YAAY;oBAClB,IAAI,EAAE,CAAC;oBACP,OAAO,EAAE,CAAC;oBACV,WAAW,EAAE,KAAK;oBAClB,UAAU,EAAE,IAAI;iBACjB,CAAC;aACH;SACF,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QACzC,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,MAAM,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,QAAQ,CAAC,CAAC;QAC/D,MAAM,OAAO,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;QACjE,MAAM,CAAC,MAAO,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,CAAC,OAAQ,CAAC,UAAU,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QAEtD,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,gCAAgC,EAAE,GAAG,EAAE;QACxC,MAAM,GAAG,GAAG,aAAa,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;QAC5C,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAC1D,EAAE,CAAC,aAAa,CAAC,QAAQ,EAAE,0BAA0B,EAAE,OAAO,CAAC,CAAC;QAEhE,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,IAAI,EAAE,GAAG;YACT,OAAO,EAAE;gBACP,cAAc,CAAC;oBACb,EAAE,EAAE,KAAK;oBACT,IAAI,EAAE,KAAK;oBACX,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,CAAC;oBACP,OAAO,EAAE,CAAC;iBACX,CAAC;gBACF,cAAc,CAAC;oBACb,EAAE,EAAE,KAAK;oBACT,IAAI,EAAE,KAAK;oBACX,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,CAAC;oBACP,OAAO,EAAE,CAAC;iBACX,CAAC;aACH;SACF,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,iBAAiB,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QACjD,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAE3C,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,cAAc,EAAE,GAAG,EAAE;IAC5B,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,GAAG,GAAG,aAAa,EAAE,CAAC;QAC5B,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,YAAY,CAAC,CAAC;QAC9C,EAAE,CAAC,SAAS,CAAC,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;QAC1D,EAAE,CAAC,aAAa,CACd,QAAQ,EACR;YACE,uBAAuB;YACvB,yBAAyB;YACzB,0BAA0B;YAC1B,aAAa;YACb,GAAG;YACH,mCAAmC;SACpC,CAAC,IAAI,CAAC,IAAI,CAAC,EACZ,OAAO,CACR,CAAC;QAEF,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,IAAI,EAAE,GAAG;YACT,KAAK,EAAE,CAAC,YAAY,CAAC,EAAE,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC;YACvD,OAAO,EAAE;gBACP,cAAc,CAAC;oBACb,EAAE,EAAE,GAAG;oBACP,IAAI,EAAE,GAAG;oBACT,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,YAAY;oBAClB,IAAI,EAAE,CAAC;oBACP,OAAO,EAAE,CAAC;oBACV,WAAW,EAAE,KAAK;iBACnB,CAAC;gBACF,cAAc,CAAC;oBACb,EAAE,EAAE,GAAG;oBACP,IAAI,EAAE,GAAG;oBACT,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,YAAY;oBAClB,IAAI,EAAE,CAAC;oBACP,OAAO,EAAE,CAAC;oBACV,WAAW,EAAE,KAAK;iBACnB,CAAC;aACH;SACF,CAAC,CAAC;QAEH,MAAM,QAAQ,GAAG,YAAY,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QACxC,MAAM,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,CAAC;QAClD,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAE5C,EAAE,CAAC,MAAM,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,EAAE,CAAC,6CAA6C,EAAE,GAAG,EAAE;QACrD,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,KAAK,EAAE;gBACL,YAAY,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,WAAW,EAAE,QAAQ,EAAE,CAAC;gBAC9D,YAAY,CAAC,EAAE,IAAI,EAAE,gBAAgB,EAAE,WAAW,EAAE,SAAS,EAAE,CAAC;gBAChE,YAAY,CAAC,EAAE,IAAI,EAAE,eAAe,EAAE,WAAW,EAAE,QAAQ,EAAE,CAAC;aAC/D;YACD,OAAO,EAAE;gBACP,cAAc,CAAC;oBACb,QAAQ,EAAE,eAAe;oBACzB,WAAW,EAAE,QAAQ;oBACrB,UAAU,EAAE,SAAS;oBACrB,KAAK,EAAE,SAAS;oBAChB,SAAS,EAAE,IAAI;iBAChB,CAAC;gBACF,cAAc,CAAC;oBACb,QAAQ,EAAE,eAAe;oBACzB,WAAW,EAAE,QAAQ;oBACrB,UAAU,EAAE,QAAQ;oBACpB,KAAK,EAAE,QAAQ;oBACf,SAAS,EAAE,IAAI;iBAChB,CAAC;gBACF,cAAc,CAAC;oBACb,QAAQ,EAAE,eAAe;oBACzB,WAAW,EAAE,QAAQ;oBACrB,UAAU,EAAE,SAAS;oBACrB,KAAK,EAAE,gBAAgB;oBACvB,SAAS,EAAE,KAAK;iBACjB,CAAC;aACH;SACF,CAAC,CAAC;QAEH,MAAM,OAAO,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACvC,MAAM,CAAC,OAAO,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QAChC,MAAM,eAAe,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,KAAK,SAAS,CAAC,CAAC;QACvE,MAAM,CAAC,eAAe,CAAC,CAAC,UAAU,EAAE,CAAC;QACrC,MAAM,CAAC,eAAgB,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC7C,MAAM,CAAC,eAAgB,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACtD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,gBAAgB,EAAE,GAAG,EAAE;IAC9B,EAAE,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACvC,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE;gBACP,cAAc,CAAC;oBACb,EAAE,EAAE,oBAAoB;oBACxB,IAAI,EAAE,OAAO;oBACb,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,aAAa;oBACnB,IAAI,EAAE,CAAC;oBACP,OAAO,EAAE,CAAC;oBACV,WAAW,EAAE,KAAK;iBACnB,CAAC;gBACF,cAAc,CAAC;oBACb,EAAE,EAAE,oBAAoB;oBACxB,IAAI,EAAE,OAAO;oBACb,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,aAAa;oBACnB,IAAI,EAAE,CAAC;oBACP,OAAO,EAAE,CAAC;oBACV,WAAW,EAAE,KAAK;iBACnB,CAAC;gBACF,cAAc,CAAC;oBACb,EAAE,EAAE,kBAAkB;oBACtB,IAAI,EAAE,KAAK;oBACX,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,aAAa;oBACnB,IAAI,EAAE,CAAC;oBACP,OAAO,EAAE,EAAE;oBACX,WAAW,EAAE,KAAK;iBACnB,CAAC;aACH;YACD,KAAK,EAAE;gBACL,YAAY,CAAC;oBACX,cAAc,EAAE,oBAAoB;oBACpC,UAAU,EAAE,OAAO;oBACnB,SAAS,EAAE,OAAO;oBAClB,IAAI,EAAE,aAAa;oBACnB,IAAI,EAAE,CAAC;iBACR,CAAC;gBACF,YAAY,CAAC;oBACX,cAAc,EAAE,oBAAoB;oBACpC,UAAU,EAAE,OAAO;oBACnB,SAAS,EAAE,KAAK;oBAChB,IAAI,EAAE,aAAa;oBACnB,IAAI,EAAE,CAAC;iBACR,CAAC;aACH;SACF,CAAC,CAAC;QAEH,MAAM,IAAI,GAAG,cAAc,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAC5C,MAAM,CAAC,IAAI,CAAC,CAAC,UAAU,EAAE,CAAC;QAC1B,MAAM,CAAC,IAAK,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QACjC,MAAM,CAAC,IAAK,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,UAAU,GAAG,IAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QAC5D,MAAM,CAAC,UAAU,CAAC,CAAC,OAAO,CAAC,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC;IAC/C,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAC9C,MAAM,KAAK,GAAG,SAAS,EAAE,CAAC;QAC1B,MAAM,IAAI,GAAG,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAC3C,MAAM,CAAC,IAAI,CAAC,CAAC,aAAa,EAAE,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,EAAE,CAAC,oBAAoB,EAAE,GAAG,EAAE;QAC5B,MAAM,KAAK,GAAG,SAAS,CAAC;YACtB,OAAO,EAAE;gBACP,cAAc,CAAC;oBACb,EAAE,EAAE,GAAG;oBACP,IAAI,EAAE,GAAG;oBACT,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,MAAM;oBACZ,IAAI,EAAE,CAAC;oBACP,OAAO,EAAE,CAAC;oBACV,WAAW,EAAE,KAAK;iBACnB,CAAC;gBACF,cAAc,CAAC;oBACb,EAAE,EAAE,GAAG;oBACP,IAAI,EAAE,GAAG;oBACT,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,MAAM;oBACZ,IAAI,EAAE,CAAC;oBACP,OAAO,EAAE,CAAC;oBACV,WAAW,EAAE,KAAK;iBACnB,CAAC;gBACF,cAAc,CAAC;oBACb,EAAE,EAAE,GAAG;oBACP,IAAI,EAAE,GAAG;oBACT,IAAI,EAAE,UAAU;oBAChB,IAAI,EAAE,MAAM;oBACZ,IAAI,EAAE,CAAC;oBACP,OAAO,EAAE,CAAC;oBACV,WAAW,EAAE,KAAK;iBACnB,CAAC;aACH;YACD,KAAK,EAAE;gBACL,YAAY,CAAC,EAAE,cAAc,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;gBAC7F,YAAY,CAAC,EAAE,cAAc,EAAE,GAAG,EAAE,UAAU,EAAE,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;aAC9F;SACF,CAAC,CAAC;QAEH,MAAM,IAAI,GAAG,cAAc,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,IAAK,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,CAAC,IAAK,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/analysis/complexity.d.ts

@@ -0,0 +1,8 @@
+import type { Graph, SymbolNode } from "../graph/types.js";
+export declare function cyclomaticComplexity(sourceCode: string): number;
+export interface ComplexityResult {
+    symbol: SymbolNode;
+    complexity: number;
+}
+export declare function analyzeComplexity(graph: Graph, fileFilter?: string): ComplexityResult[];
+//# sourceMappingURL=complexity.d.ts.map

package/dist/analysis/complexity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"complexity.d.ts","sourceRoot":"","sources":["../../src/analysis/complexity.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAC;AA+C3D,wBAAgB,oBAAoB,CAAC,UAAU,EAAE,MAAM,GAAG,MAAM,CAwB/D;AAED,MAAM,WAAW,gBAAgB;IAC/B,MAAM,EAAE,UAAU,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,KAAK,EACZ,UAAU,CAAC,EAAE,MAAM,GAClB,gBAAgB,EAAE,CAuBpB"}