mapra 0.1.0

package/LICENSE

@@ -0,0 +1,21 @@
+MIT License
+
+Copyright (c) 2026 Joel Lopez Berrum
+
+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,144 @@
+# mapra
+
+**Stop exploring. Start building.**
+
+Mapra encodes your codebase's structure, risk, and complexity into a single version-controlled file — so you and your AI tools understand the whole picture before touching any code.
+
+## What does it do?
+
+AI coding agents spend significant time exploring codebases — listing directories, reading files to understand structure, figuring out what depends on what. In testing, a typical structural question required **45 tool calls** without mapra. With mapra: **zero**.
+
+Mapra scans your codebase and produces a `.mapra` file that captures:
+
+- **Risk** — blast radius, cascade depth, and hidden amplifiers (files where a small change breaks many things)
+- **Churn** — what's been changing and how fast
+- **Hotspots** — complexity scores for files that need the most care
+- **Infrastructure** — how your modules connect
+- **Conventions** — patterns your codebase already follows
+
+One file read gives your AI agent instant structural awareness.
+
+## Quick Start
+
+```bash
+npx mapra
+```
+
+That's it. This scans your codebase, generates `.mapra`, wires it into your `CLAUDE.md`, and installs git hooks to keep it fresh.
+
+### Requirements
+
+- Node.js >= 18
+- A git repository
+
+## What you get
+
+Here's a real `.mapra` file from a Next.js app (300 files, 53K lines):
+
+```
+MAPRA v3 | myapp | Nextjs | 300 files | 53,081 lines | generated 2026-03-06
+LEGEND: ×N=imported by N files | ×A→B=A direct, B total affected | dN=cascade depth | [AMP]=amplification>=2x
+
+─── RISK (blast radius — modifying these cascades broadly) ─
+[AMP] amp7.0  ×3→21     d3   3mod  T5   src/lib/constants.ts
+  exports: ORDER_ONLINE_URL
+[AMP] amp3.6  ×7→25     d4   3mod  T4   src/lib/ordering-server.ts
+  exports: PeriodAvailability
+  +55 more with blast radius > 1
+
+─── CHURN (last 30 days, top movers) ─────────────────────
+20 commits   +1159 -1011  src/app/api/orders/route.ts  "feat: pre-order core"
+12 commits   +306 -36     src/lib/ordering.ts  "feat: pre-order foundation"
+
+─── HOTSPOTS (complexity > 0.3) ─────────────────────────
+0.79  src/batch/runner.ts       543L 13imp
+0.75  src/cli/index.ts          833L  5imp
+```
+
+The RISK section is mapra's unique value — it shows **hidden amplifiers**: files with few direct importers but high cascade impact. `constants.ts` above has only 3 direct importers but affects 21 files (amp 7.0). No other tool surfaces this.
+
+### Reading the output
+
+The `.mapra` header includes a LEGEND that decodes the compact notation:
+
+| Symbol | Meaning | Example |
+|--------|---------|---------|
+| `×N` | Imported by N files | `×3` = 3 files import this |
+| `×A→B` | A direct importers, B total affected (cascade) | `×3→21` = 3 direct, 21 total |
+| `[AMP]` | Hidden amplifier — amplification ratio >= 2x | Few importers but large cascade |
+| `ampN` | Amplification ratio (affected / direct) | `amp7.0` = 7x amplification |
+| `dN` | Cascade depth (longest chain) | `d3` = 3 hops max |
+| `Nmod` | Number of modules affected | `3mod` = crosses 3 module boundaries |
+| `TN` | Number of test files covering this file | `T5` = 5 test files |
+| `NL` | Lines of code | `543L` = 543 lines |
+
+## Commands
+
+```
+mapra                        First-time setup (generate + wire + hooks)
+mapra update                 Regenerate .mapra after code changes
+mapra status                 Check .mapra freshness, hook state, wiring
+```
+
+### Setup details
+
+`mapra setup` does four things:
+
+1. Scans your codebase and writes `.mapra`
+2. Adds an `@.mapra` reference to your `CLAUDE.md`
+3. Installs git hooks (post-commit, post-merge, post-checkout) for auto-update
+4. Adds a `prepare` script to `package.json` so teammates get hooks on `npm install`
+
+### Other commands
+
+```
+mapra generate [path]        Scan and write .mapra (without wiring CLAUDE.md)
+mapra init [path]            Wire @.mapra into CLAUDE.md (without regenerating)
+mapra install-hooks [path]   Install git hooks manually
+mapra uninstall-hooks [path] Remove mapra git hooks
+mapra validate-plan <file>   Cross-reference a plan's file paths against .mapra
+```
+
+## Auto-Update
+
+After setup, `.mapra` stays fresh automatically:
+
+- **Git hooks** regenerate `.mapra` silently after every commit, merge, and branch switch
+- **Teammates** get hooks automatically via `npm install` (prepare script)
+- **Safe** — regeneration runs in the background; if it fails, your existing `.mapra` stays intact
+
+Run `mapra status` to verify everything is working. To remove: `mapra uninstall-hooks`.
+
+## Troubleshooting
+
+### Shallow clones
+
+If you cloned with `--depth`, the CHURN section will be empty or incomplete. Fix with:
+
+```bash
+git fetch --unshallow
+mapra update
+```
+
+### `.mapra` in `.gitignore`
+
+`.mapra` should be committed — it's how your team shares structural awareness. If `mapra status` warns about `.gitignore`, remove the `.mapra` entry.
+
+### Stale `.mapra`
+
+If `mapra status` shows "may be stale", run `mapra update`. With auto-update hooks installed, this shouldn't happen.
+
+## How It Works
+
+1. **Scan** — parses source files, extracting imports, exports, and module boundaries
+2. **Analyze** — computes blast radius, churn velocity, dead code, and convention patterns
+3. **Encode** — compresses everything into a compact `.mapra` file (~1-2K tokens for most projects)
+4. **Wire** — adds an `@.mapra` reference to your `CLAUDE.md` so AI tools load the map automatically
+
+## Language Support
+
+Currently supports TypeScript and JavaScript codebases (`.ts`, `.tsx`, `.js`, `.jsx`, `.mjs`, `.cjs`). Prisma schemas are also parsed for database relationships.
+
+## License
+
+MIT

package/dist/analyzer/blast-radius.d.ts

@@ -0,0 +1,27 @@
+/**
+ * Blast Radius Analyzer — computes transitive impact of changing a file.
+ *
+ * Uses reverse adjacency (who imports X?) + BFS to find all transitively
+ * affected files. Signal attenuation (0.7^depth) weights nearby files higher.
+ */
+export interface BlastResult {
+    nodeId: string;
+    directImporters: number;
+    affectedCount: number;
+    weightedImpact: number;
+    modulesAffected: number;
+    affectedModuleNames: string[];
+    maxDepth: number;
+    amplificationRatio: number;
+}
+/**
+ * Compute blast radius for a single node.
+ * reverseAdj should already exclude test edges.
+ */
+export declare function computeBlastRadius(nodeId: string, reverseAdj: Map<string, Set<string>>): BlastResult;
+/**
+ * Compute blast radius for all nodes that have at least one importer.
+ * Returns Map sorted by weightedImpact descending.
+ */
+export declare function computeAllBlastRadii(reverseAdj: Map<string, Set<string>>): Map<string, BlastResult>;
+//# sourceMappingURL=blast-radius.d.ts.map

package/dist/analyzer/blast-radius.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"blast-radius.d.ts","sourceRoot":"","sources":["../../src/analyzer/blast-radius.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE,MAAM,CAAC;IACf,eAAe,EAAE,MAAM,CAAC;IACxB,aAAa,EAAE,MAAM,CAAC;IACtB,cAAc,EAAE,MAAM,CAAC;IACvB,eAAe,EAAE,MAAM,CAAC;IACxB,mBAAmB,EAAE,MAAM,EAAE,CAAC;IAC9B,QAAQ,EAAE,MAAM,CAAC;IACjB,kBAAkB,EAAE,MAAM,CAAC;CAC5B;AAID;;;GAGG;AACH,wBAAgB,kBAAkB,CAChC,MAAM,EAAE,MAAM,EACd,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,GACnC,WAAW,CAmCb;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAClC,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC,GACnC,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAY1B"}

package/dist/analyzer/blast-radius.js

@@ -0,0 +1,58 @@
+/**
+ * Blast Radius Analyzer — computes transitive impact of changing a file.
+ *
+ * Uses reverse adjacency (who imports X?) + BFS to find all transitively
+ * affected files. Signal attenuation (0.7^depth) weights nearby files higher.
+ */
+import { bfs, getModuleId } from "./graph-utils.js";
+const ATTENUATION = 0.7;
+/**
+ * Compute blast radius for a single node.
+ * reverseAdj should already exclude test edges.
+ */
+export function computeBlastRadius(nodeId, reverseAdj) {
+    const directImporters = reverseAdj.get(nodeId)?.size ?? 0;
+    // BFS through reverse adjacency (who imports this → who imports them → ...)
+    const depths = bfs(nodeId, reverseAdj);
+    const affectedCount = depths.size;
+    let weightedImpact = 0;
+    let maxDepth = 0;
+    for (const depth of depths.values()) {
+        weightedImpact += Math.pow(ATTENUATION, depth);
+        if (depth > maxDepth)
+            maxDepth = depth;
+    }
+    const affectedModuleSet = new Set();
+    for (const id of depths.keys()) {
+        affectedModuleSet.add(getModuleId(id));
+    }
+    const modulesAffected = affectedModuleSet.size;
+    const affectedModuleNames = [...affectedModuleSet].sort();
+    const amplificationRatio = directImporters > 0 ? affectedCount / directImporters : 0;
+    return {
+        nodeId,
+        directImporters,
+        affectedCount,
+        weightedImpact: Math.round(weightedImpact * 100) / 100,
+        modulesAffected,
+        affectedModuleNames,
+        maxDepth,
+        amplificationRatio: Math.round(amplificationRatio * 10) / 10,
+    };
+}
+/**
+ * Compute blast radius for all nodes that have at least one importer.
+ * Returns Map sorted by weightedImpact descending.
+ */
+export function computeAllBlastRadii(reverseAdj) {
+    const results = new Map();
+    for (const nodeId of reverseAdj.keys()) {
+        const result = computeBlastRadius(nodeId, reverseAdj);
+        // Skip nodes with no transitive impact (only imported by 0 or directly by 1 with no cascade)
+        if (result.affectedCount > 1) {
+            results.set(nodeId, result);
+        }
+    }
+    return results;
+}
+//# sourceMappingURL=blast-radius.js.map

package/dist/analyzer/blast-radius.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"blast-radius.js","sourceRoot":"","sources":["../../src/analyzer/blast-radius.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,GAAG,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAC;AAapD,MAAM,WAAW,GAAG,GAAG,CAAC;AAExB;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAChC,MAAc,EACd,UAAoC;IAEpC,MAAM,eAAe,GAAG,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,IAAI,IAAI,CAAC,CAAC;IAE1D,4EAA4E;IAC5E,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IAEvC,MAAM,aAAa,GAAG,MAAM,CAAC,IAAI,CAAC;IAClC,IAAI,cAAc,GAAG,CAAC,CAAC;IACvB,IAAI,QAAQ,GAAG,CAAC,CAAC;IAEjB,KAAK,MAAM,KAAK,IAAI,MAAM,CAAC,MAAM,EAAE,EAAE,CAAC;QACpC,cAAc,IAAI,IAAI,CAAC,GAAG,CAAC,WAAW,EAAE,KAAK,CAAC,CAAC;QAC/C,IAAI,KAAK,GAAG,QAAQ;YAAE,QAAQ,GAAG,KAAK,CAAC;IACzC,CAAC;IAED,MAAM,iBAAiB,GAAG,IAAI,GAAG,EAAU,CAAC;IAC5C,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QAC/B,iBAAiB,CAAC,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC;IACzC,CAAC;IACD,MAAM,eAAe,GAAG,iBAAiB,CAAC,IAAI,CAAC;IAC/C,MAAM,mBAAmB,GAAG,CAAC,GAAG,iBAAiB,CAAC,CAAC,IAAI,EAAE,CAAC;IAE1D,MAAM,kBAAkB,GACtB,eAAe,GAAG,CAAC,CAAC,CAAC,CAAC,aAAa,GAAG,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC;IAE5D,OAAO;QACL,MAAM;QACN,eAAe;QACf,aAAa;QACb,cAAc,EAAE,IAAI,CAAC,KAAK,CAAC,cAAc,GAAG,GAAG,CAAC,GAAG,GAAG;QACtD,eAAe;QACf,mBAAmB;QACnB,QAAQ;QACR,kBAAkB,EAAE,IAAI,CAAC,KAAK,CAAC,kBAAkB,GAAG,EAAE,CAAC,GAAG,EAAE;KAC7D,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,oBAAoB,CAClC,UAAoC;IAEpC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAE/C,KAAK,MAAM,MAAM,IAAI,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC;QACvC,MAAM,MAAM,GAAG,kBAAkB,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;QACtD,6FAA6F;QAC7F,IAAI,MAAM,CAAC,aAAa,GAAG,CAAC,EAAE,CAAC;YAC7B,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC"}

package/dist/analyzer/churn.d.ts

@@ -0,0 +1,26 @@
+/**
+ * Git Churn Analyzer — computes per-file change frequency from git history.
+ *
+ * Shells out to `git log --numstat` once for the entire repo,
+ * parses the output, and returns per-file churn metrics.
+ */
+export interface ChurnResult {
+    nodeId: string;
+    commits30d: number;
+    linesAdded30d: number;
+    linesRemoved30d: number;
+    lastCommitHash: string;
+    lastCommitDate: string;
+    lastCommitMsg: string;
+}
+/**
+ * Parse raw `git log --numstat --format="%h|%aI|%s"` output
+ * into per-file churn metrics.
+ */
+export declare function parseGitLogOutput(raw: string): Map<string, ChurnResult>;
+/**
+ * Compute churn for all files in a git repo.
+ * Returns empty map if not in a git repo or git is unavailable.
+ */
+export declare function computeChurn(rootDir: string): Map<string, ChurnResult>;
+//# sourceMappingURL=churn.d.ts.map

package/dist/analyzer/churn.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"churn.d.ts","sourceRoot":"","sources":["../../src/analyzer/churn.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAIH,MAAM,WAAW,WAAW;IAC1B,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,MAAM,CAAC;IACtB,eAAe,EAAE,MAAM,CAAC;IACxB,cAAc,EAAE,MAAM,CAAC;IACvB,cAAc,EAAE,MAAM,CAAC;IACvB,aAAa,EAAE,MAAM,CAAC;CACvB;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAqDvE;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,OAAO,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,WAAW,CAAC,CAmCtE"}

package/dist/analyzer/churn.js

@@ -0,0 +1,96 @@
+/**
+ * Git Churn Analyzer — computes per-file change frequency from git history.
+ *
+ * Shells out to `git log --numstat` once for the entire repo,
+ * parses the output, and returns per-file churn metrics.
+ */
+import { execSync } from "child_process";
+/**
+ * Parse raw `git log --numstat --format="%h|%aI|%s"` output
+ * into per-file churn metrics.
+ */
+export function parseGitLogOutput(raw) {
+    const results = new Map();
+    if (!raw.trim())
+        return results;
+    const lines = raw.split("\n");
+    let currentHash = "";
+    let currentDate = "";
+    let currentMsg = "";
+    for (const line of lines) {
+        // Header line: hash|date|message
+        const headerMatch = line.match(/^([a-f0-9]+)\|([^|]+)\|(.+)$/);
+        if (headerMatch) {
+            currentHash = headerMatch[1];
+            currentDate = headerMatch[2];
+            currentMsg = headerMatch[3];
+            continue;
+        }
+        // Numstat line: added\tremoved\tpath
+        const statMatch = line.match(/^(\d+|-)\t(\d+|-)\t(.+)$/);
+        if (statMatch) {
+            const added = statMatch[1];
+            const removed = statMatch[2];
+            const filePath = statMatch[3];
+            // Skip binary files (- - in numstat)
+            if (added === "-" || removed === "-")
+                continue;
+            // Normalize Windows backslashes
+            const normalized = filePath.replace(/\\/g, "/");
+            const existing = results.get(normalized);
+            if (existing) {
+                existing.commits30d++;
+                existing.linesAdded30d += parseInt(added, 10);
+                existing.linesRemoved30d += parseInt(removed, 10);
+                // Keep the first (most recent) commit info since git log is newest-first
+            }
+            else {
+                results.set(normalized, {
+                    nodeId: normalized,
+                    commits30d: 1,
+                    linesAdded30d: parseInt(added, 10),
+                    linesRemoved30d: parseInt(removed, 10),
+                    lastCommitHash: currentHash,
+                    lastCommitDate: currentDate,
+                    lastCommitMsg: currentMsg,
+                });
+            }
+        }
+    }
+    return results;
+}
+/**
+ * Compute churn for all files in a git repo.
+ * Returns empty map if not in a git repo or git is unavailable.
+ */
+export function computeChurn(rootDir) {
+    try {
+        // Detect shallow clone — churn data will be incomplete/empty
+        try {
+            const isShallow = execSync("git rev-parse --is-shallow-repository", {
+                cwd: rootDir,
+                encoding: "utf-8",
+                timeout: 5000,
+            }).trim();
+            if (isShallow === "true") {
+                console.warn("Warning: shallow clone detected — churn data will be incomplete.");
+                console.warn("  Run `git fetch --unshallow` for accurate CHURN section.\n");
+            }
+        }
+        catch {
+            // git rev-parse failed — proceed anyway
+        }
+        const raw = execSync(`git log --numstat --format="%h|%aI|%s" --since="30 days ago"`, {
+            cwd: rootDir,
+            encoding: "utf-8",
+            maxBuffer: 10 * 1024 * 1024, // 10MB
+            timeout: 15000, // 15s
+        });
+        return parseGitLogOutput(raw);
+    }
+    catch {
+        // Not a git repo or git unavailable — churn is optional
+        return new Map();
+    }
+}
+//# sourceMappingURL=churn.js.map

package/dist/analyzer/churn.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"churn.js","sourceRoot":"","sources":["../../src/analyzer/churn.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAYzC;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAC,GAAW;IAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAuB,CAAC;IAC/C,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE;QAAE,OAAO,OAAO,CAAC;IAEhC,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC9B,IAAI,WAAW,GAAG,EAAE,CAAC;IACrB,IAAI,WAAW,GAAG,EAAE,CAAC;IACrB,IAAI,UAAU,GAAG,EAAE,CAAC;IAEpB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,iCAAiC;QACjC,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,8BAA8B,CAAC,CAAC;QAC/D,IAAI,WAAW,EAAE,CAAC;YAChB,WAAW,GAAG,WAAW,CAAC,CAAC,CAAE,CAAC;YAC9B,WAAW,GAAG,WAAW,CAAC,CAAC,CAAE,CAAC;YAC9B,UAAU,GAAG,WAAW,CAAC,CAAC,CAAE,CAAC;YAC7B,SAAS;QACX,CAAC;QAED,qCAAqC;QACrC,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,0BAA0B,CAAC,CAAC;QACzD,IAAI,SAAS,EAAE,CAAC;YACd,MAAM,KAAK,GAAG,SAAS,CAAC,CAAC,CAAE,CAAC;YAC5B,MAAM,OAAO,GAAG,SAAS,CAAC,CAAC,CAAE,CAAC;YAC9B,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAE,CAAC;YAE/B,qCAAqC;YACrC,IAAI,KAAK,KAAK,GAAG,IAAI,OAAO,KAAK,GAAG;gBAAE,SAAS;YAE/C,gCAAgC;YAChC,MAAM,UAAU,GAAG,QAAQ,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;YAEhD,MAAM,QAAQ,GAAG,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACzC,IAAI,QAAQ,EAAE,CAAC;gBACb,QAAQ,CAAC,UAAU,EAAE,CAAC;gBACtB,QAAQ,CAAC,aAAa,IAAI,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;gBAC9C,QAAQ,CAAC,eAAe,IAAI,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC,CAAC;gBAClD,yEAAyE;YAC3E,CAAC;iBAAM,CAAC;gBACN,OAAO,CAAC,GAAG,CAAC,UAAU,EAAE;oBACtB,MAAM,EAAE,UAAU;oBAClB,UAAU,EAAE,CAAC;oBACb,aAAa,EAAE,QAAQ,CAAC,KAAK,EAAE,EAAE,CAAC;oBAClC,eAAe,EAAE,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;oBACtC,cAAc,EAAE,WAAW;oBAC3B,cAAc,EAAE,WAAW;oBAC3B,aAAa,EAAE,UAAU;iBAC1B,CAAC,CAAC;YACL,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,OAAe;IAC1C,IAAI,CAAC;QACH,6DAA6D;QAC7D,IAAI,CAAC;YACH,MAAM,SAAS,GAAG,QAAQ,CAAC,uCAAuC,EAAE;gBAClE,GAAG,EAAE,OAAO;gBACZ,QAAQ,EAAE,OAAO;gBACjB,OAAO,EAAE,IAAI;aACd,CAAC,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;gBACzB,OAAO,CAAC,IAAI,CACV,kEAAkE,CACnE,CAAC;gBACF,OAAO,CAAC,IAAI,CACV,6DAA6D,CAC9D,CAAC;YACJ,CAAC;QACH,CAAC;QAAC,MAAM,CAAC;YACP,wCAAwC;QAC1C,CAAC;QAED,MAAM,GAAG,GAAG,QAAQ,CAClB,8DAA8D,EAC9D;YACE,GAAG,EAAE,OAAO;YACZ,QAAQ,EAAE,OAAO;YACjB,SAAS,EAAE,EAAE,GAAG,IAAI,GAAG,IAAI,EAAE,OAAO;YACpC,OAAO,EAAE,KAAK,EAAE,MAAM;SACvB,CACF,CAAC;QACF,OAAO,iBAAiB,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IAAC,MAAM,CAAC;QACP,wDAAwD;QACxD,OAAO,IAAI,GAAG,EAAE,CAAC;IACnB,CAAC;AACH,CAAC"}

package/dist/analyzer/co-change.d.ts

@@ -0,0 +1,60 @@
+/**
+ * Co-change Analyzer — finds files that frequently change together in git history.
+ *
+ * Builds a co-occurrence matrix from `git log --name-only` across recent commits,
+ * then surfaces pairs with high co-change frequency but low import-graph proximity
+ * (the most surprising signal: files that change together but don't import each other).
+ */
+export interface CoChangePair {
+    fileA: string;
+    fileB: string;
+    coChangeCount: number;
+    totalCommitsA: number;
+    totalCommitsB: number;
+    confidence: number;
+    importConnected: boolean;
+}
+/**
+ * Parse `git log --name-only --format="%h"` output into per-commit file lists.
+ * Returns an array of sets, each set being the files changed in one commit.
+ */
+export declare function parseGitLogNameOnly(raw: string): Set<string>[];
+/**
+ * Build co-occurrence counts from commit file sets.
+ * Only considers commits with <= maxFilesPerCommit files to filter out
+ * large merges/reformats that would create noise.
+ *
+ * Returns a map of "fileA\0fileB" -> count (canonical order: fileA < fileB).
+ */
+export declare function buildCoOccurrenceMatrix(commits: Set<string>[], maxFilesPerCommit?: number): {
+    pairs: Map<string, number>;
+    fileCounts: Map<string, number>;
+};
+/**
+ * Compute co-change pairs, prioritizing those with high co-change frequency
+ * but low import-graph proximity (surprising co-changes).
+ *
+ * @param commits  Per-commit file sets from parseGitLogNameOnly
+ * @param importEdges  Set of "from\0to" keys representing import relationships
+ * @param topN  Maximum number of pairs to return
+ * @param minCoChanges  Minimum co-change count to consider
+ */
+export declare function findCoChangePairs(commits: Set<string>[], importEdges: Set<string>, topN?: number, minCoChanges?: number): CoChangePair[];
+/**
+ * Build a set of import edge keys from graph edges for import-proximity checking.
+ */
+export declare function buildImportEdgeSet(edges: Array<{
+    from: string;
+    to: string;
+    type: string;
+}>): Set<string>;
+/**
+ * Shell out to git and compute co-change pairs for a repository.
+ * Returns empty array if not in a git repo or git is unavailable.
+ */
+export declare function computeCoChanges(rootDir: string, edges: Array<{
+    from: string;
+    to: string;
+    type: string;
+}>): CoChangePair[];
+//# sourceMappingURL=co-change.d.ts.map

package/dist/analyzer/co-change.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"co-change.d.ts","sourceRoot":"","sources":["../../src/analyzer/co-change.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAIH,MAAM,WAAW,YAAY;IAC3B,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;IACtB,aAAa,EAAE,MAAM,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;IACnB,eAAe,EAAE,OAAO,CAAC;CAC1B;AAED;;;GAGG;AACH,wBAAgB,mBAAmB,CAAC,GAAG,EAAE,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAuC9D;AAED;;;;;;GAMG;AACH,wBAAgB,uBAAuB,CACrC,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,EACtB,iBAAiB,SAAK,GACrB;IAAE,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAAC,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;CAAE,CAyBjE;AAED;;;;;;;;GAQG;AACH,wBAAgB,iBAAiB,CAC/B,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,EAAE,EACtB,WAAW,EAAE,GAAG,CAAC,MAAM,CAAC,EACxB,IAAI,SAAI,EACR,YAAY,SAAI,GACf,YAAY,EAAE,CAwChB;AAED;;GAEG;AACH,wBAAgB,kBAAkB,CAChC,KAAK,EAAE,KAAK,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,GACvD,GAAG,CAAC,MAAM,CAAC,CAOb;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAC9B,OAAO,EAAE,MAAM,EACf,KAAK,EAAE,KAAK,CAAC;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,EAAE,EAAE,MAAM,CAAC;IAAC,IAAI,EAAE,MAAM,CAAA;CAAE,CAAC,GACvD,YAAY,EAAE,CAmBhB"}

package/dist/analyzer/co-change.js

@@ -0,0 +1,153 @@
+/**
+ * Co-change Analyzer — finds files that frequently change together in git history.
+ *
+ * Builds a co-occurrence matrix from `git log --name-only` across recent commits,
+ * then surfaces pairs with high co-change frequency but low import-graph proximity
+ * (the most surprising signal: files that change together but don't import each other).
+ */
+import { execSync } from "child_process";
+/**
+ * Parse `git log --name-only --format="%h"` output into per-commit file lists.
+ * Returns an array of sets, each set being the files changed in one commit.
+ */
+export function parseGitLogNameOnly(raw) {
+    const commits = [];
+    if (!raw.trim())
+        return commits;
+    let currentFiles = null;
+    for (const line of raw.split("\n")) {
+        const trimmed = line.trim();
+        if (!trimmed) {
+            // Blank line = end of commit block (only if we have files)
+            if (currentFiles && currentFiles.size > 0) {
+                commits.push(currentFiles);
+                currentFiles = null;
+            }
+            continue;
+        }
+        // Header line: short hash
+        if (/^[a-f0-9]{7,40}$/.test(trimmed)) {
+            if (currentFiles && currentFiles.size > 0) {
+                commits.push(currentFiles);
+            }
+            currentFiles = new Set();
+            continue;
+        }
+        // File path line
+        if (currentFiles) {
+            // Normalize Windows backslashes
+            currentFiles.add(trimmed.replace(/\\/g, "/"));
+        }
+    }
+    // Don't forget the last commit block
+    if (currentFiles && currentFiles.size > 0) {
+        commits.push(currentFiles);
+    }
+    return commits;
+}
+/**
+ * Build co-occurrence counts from commit file sets.
+ * Only considers commits with <= maxFilesPerCommit files to filter out
+ * large merges/reformats that would create noise.
+ *
+ * Returns a map of "fileA\0fileB" -> count (canonical order: fileA < fileB).
+ */
+export function buildCoOccurrenceMatrix(commits, maxFilesPerCommit = 20) {
+    const pairs = new Map();
+    const fileCounts = new Map();
+    for (const files of commits) {
+        // Skip large commits (merges, reformats, CI-generated changes)
+        if (files.size > maxFilesPerCommit || files.size < 2)
+            continue;
+        const sorted = [...files].sort();
+        // Count per-file occurrences
+        for (const f of sorted) {
+            fileCounts.set(f, (fileCounts.get(f) ?? 0) + 1);
+        }
+        // Count pairwise co-occurrences
+        for (let i = 0; i < sorted.length; i++) {
+            for (let j = i + 1; j < sorted.length; j++) {
+                const key = `${sorted[i]}\0${sorted[j]}`;
+                pairs.set(key, (pairs.get(key) ?? 0) + 1);
+            }
+        }
+    }
+    return { pairs, fileCounts };
+}
+/**
+ * Compute co-change pairs, prioritizing those with high co-change frequency
+ * but low import-graph proximity (surprising co-changes).
+ *
+ * @param commits  Per-commit file sets from parseGitLogNameOnly
+ * @param importEdges  Set of "from\0to" keys representing import relationships
+ * @param topN  Maximum number of pairs to return
+ * @param minCoChanges  Minimum co-change count to consider
+ */
+export function findCoChangePairs(commits, importEdges, topN = 8, minCoChanges = 3) {
+    const { pairs, fileCounts } = buildCoOccurrenceMatrix(commits);
+    const results = [];
+    for (const [key, count] of pairs) {
+        if (count < minCoChanges)
+            continue;
+        const [fileA, fileB] = key.split("\0");
+        const totalA = fileCounts.get(fileA) ?? count;
+        const totalB = fileCounts.get(fileB) ?? count;
+        const confidence = count / Math.min(totalA, totalB);
+        // Check if there's a direct import relationship
+        const importConnected = importEdges.has(`${fileA}\0${fileB}`) ||
+            importEdges.has(`${fileB}\0${fileA}`);
+        results.push({
+            fileA,
+            fileB,
+            coChangeCount: count,
+            totalCommitsA: totalA,
+            totalCommitsB: totalB,
+            confidence,
+            importConnected,
+        });
+    }
+    // Sort: prioritize unconnected pairs (surprising), then by confidence * count
+    results.sort((a, b) => {
+        // Unconnected pairs first (most surprising signal)
+        if (a.importConnected !== b.importConnected) {
+            return a.importConnected ? 1 : -1;
+        }
+        // Then by confidence * coChangeCount (frequency-weighted)
+        return b.confidence * b.coChangeCount - a.confidence * a.coChangeCount;
+    });
+    return results.slice(0, topN);
+}
+/**
+ * Build a set of import edge keys from graph edges for import-proximity checking.
+ */
+export function buildImportEdgeSet(edges) {
+    const set = new Set();
+    for (const edge of edges) {
+        if (edge.type === "tests")
+            continue;
+        set.add(`${edge.from}\0${edge.to}`);
+    }
+    return set;
+}
+/**
+ * Shell out to git and compute co-change pairs for a repository.
+ * Returns empty array if not in a git repo or git is unavailable.
+ */
+export function computeCoChanges(rootDir, edges) {
+    try {
+        const raw = execSync(`git log --name-only --format="%h" --since="30 days ago"`, {
+            cwd: rootDir,
+            encoding: "utf-8",
+            maxBuffer: 10 * 1024 * 1024, // 10MB
+            timeout: 15000, // 15s
+        });
+        const commits = parseGitLogNameOnly(raw);
+        const importEdges = buildImportEdgeSet(edges);
+        return findCoChangePairs(commits, importEdges);
+    }
+    catch {
+        // Not a git repo or git unavailable — co-change is optional
+        return [];
+    }
+}
+//# sourceMappingURL=co-change.js.map

package/dist/analyzer/co-change.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"co-change.js","sourceRoot":"","sources":["../../src/analyzer/co-change.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAC;AAYzC;;;GAGG;AACH,MAAM,UAAU,mBAAmB,CAAC,GAAW;IAC7C,MAAM,OAAO,GAAkB,EAAE,CAAC;IAClC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE;QAAE,OAAO,OAAO,CAAC;IAEhC,IAAI,YAAY,GAAuB,IAAI,CAAC;IAE5C,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QACnC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;QAC5B,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,2DAA2D;YAC3D,IAAI,YAAY,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBAC1C,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;gBAC3B,YAAY,GAAG,IAAI,CAAC;YACtB,CAAC;YACD,SAAS;QACX,CAAC;QAED,0BAA0B;QAC1B,IAAI,kBAAkB,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;YACrC,IAAI,YAAY,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;gBAC1C,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;YAC7B,CAAC;YACD,YAAY,GAAG,IAAI,GAAG,EAAE,CAAC;YACzB,SAAS;QACX,CAAC;QAED,iBAAiB;QACjB,IAAI,YAAY,EAAE,CAAC;YACjB,gCAAgC;YAChC,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;QAChD,CAAC;IACH,CAAC;IAED,qCAAqC;IACrC,IAAI,YAAY,IAAI,YAAY,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QAC1C,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;IAC7B,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,uBAAuB,CACrC,OAAsB,EACtB,iBAAiB,GAAG,EAAE;IAEtB,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,MAAM,UAAU,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE7C,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,+DAA+D;QAC/D,IAAI,KAAK,CAAC,IAAI,GAAG,iBAAiB,IAAI,KAAK,CAAC,IAAI,GAAG,CAAC;YAAE,SAAS;QAE/D,MAAM,MAAM,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,EAAE,CAAC;QAEjC,6BAA6B;QAC7B,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;YACvB,UAAU,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,CAAC;QAED,gCAAgC;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC3C,MAAM,GAAG,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;gBACzC,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAC5C,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,EAAE,KAAK,EAAE,UAAU,EAAE,CAAC;AAC/B,CAAC;AAED;;;;;;;;GAQG;AACH,MAAM,UAAU,iBAAiB,CAC/B,OAAsB,EACtB,WAAwB,EACxB,IAAI,GAAG,CAAC,EACR,YAAY,GAAG,CAAC;IAEhB,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,GAAG,uBAAuB,CAAC,OAAO,CAAC,CAAC;IAE/D,MAAM,OAAO,GAAmB,EAAE,CAAC;IAEnC,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,KAAK,EAAE,CAAC;QACjC,IAAI,KAAK,GAAG,YAAY;YAAE,SAAS;QAEnC,MAAM,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAqB,CAAC;QAC3D,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;QAC9C,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC;QAC9C,MAAM,UAAU,GAAG,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;QAEpD,gDAAgD;QAChD,MAAM,eAAe,GACnB,WAAW,CAAC,GAAG,CAAC,GAAG,KAAK,KAAK,KAAK,EAAE,CAAC;YACrC,WAAW,CAAC,GAAG,CAAC,GAAG,KAAK,KAAK,KAAK,EAAE,CAAC,CAAC;QAExC,OAAO,CAAC,IAAI,CAAC;YACX,KAAK;YACL,KAAK;YACL,aAAa,EAAE,KAAK;YACpB,aAAa,EAAE,MAAM;YACrB,aAAa,EAAE,MAAM;YACrB,UAAU;YACV,eAAe;SAChB,CAAC,CAAC;IACL,CAAC;IAED,8EAA8E;IAC9E,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACpB,mDAAmD;QACnD,IAAI,CAAC,CAAC,eAAe,KAAK,CAAC,CAAC,eAAe,EAAE,CAAC;YAC5C,OAAO,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpC,CAAC;QACD,0DAA0D;QAC1D,OAAO,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,aAAa,GAAG,CAAC,CAAC,UAAU,GAAG,CAAC,CAAC,aAAa,CAAC;IACzE,CAAC,CAAC,CAAC;IAEH,OAAO,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;AAChC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,kBAAkB,CAChC,KAAwD;IAExD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAU,CAAC;IAC9B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;YAAE,SAAS;QACpC,GAAG,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;IACtC,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAC9B,OAAe,EACf,KAAwD;IAExD,IAAI,CAAC;QACH,MAAM,GAAG,GAAG,QAAQ,CAClB,yDAAyD,EACzD;YACE,GAAG,EAAE,OAAO;YACZ,QAAQ,EAAE,OAAO;YACjB,SAAS,EAAE,EAAE,GAAG,IAAI,GAAG,IAAI,EAAE,OAAO;YACpC,OAAO,EAAE,KAAK,EAAE,MAAM;SACvB,CACF,CAAC;QAEF,MAAM,OAAO,GAAG,mBAAmB,CAAC,GAAG,CAAC,CAAC;QACzC,MAAM,WAAW,GAAG,kBAAkB,CAAC,KAAK,CAAC,CAAC;QAC9C,OAAO,iBAAiB,CAAC,OAAO,EAAE,WAAW,CAAC,CAAC;IACjD,CAAC;IAAC,MAAM,CAAC;QACP,4DAA4D;QAC5D,OAAO,EAAE,CAAC;IACZ,CAAC;AACH,CAAC"}

package/dist/analyzer/conventions.d.ts

@@ -0,0 +1,22 @@
+/**
+ * Convention Detector — identifies import patterns repeated across files of the same type.
+ *
+ * A "convention" is a dependency imported by >= 60% of files with a given type
+ * (e.g., 8/12 API routes import Sentry). Minimum 3 files of that type required.
+ */
+import type { StrandNode, StrandEdge } from "../scanner/index.js";
+export interface Convention {
+    anchorFile: string;
+    anchorExports: string[];
+    consumerType: string;
+    adoption: number;
+    total: number;
+    coverage: number;
+    violators: string[];
+}
+/**
+ * Detect import conventions from graph data.
+ * Returns conventions sorted by coverage descending.
+ */
+export declare function detectConventions(nodes: StrandNode[], edges: StrandEdge[]): Convention[];
+//# sourceMappingURL=conventions.d.ts.map

package/dist/analyzer/conventions.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"conventions.d.ts","sourceRoot":"","sources":["../../src/analyzer/conventions.ts"],"names":[],"mappings":"AAAA;;;;;GAKG;AAEH,OAAO,KAAK,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,qBAAqB,CAAC;AAMlE,MAAM,WAAW,UAAU;IACzB,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,MAAM,EAAE,CAAC;IACxB,YAAY,EAAE,MAAM,CAAC;IACrB,QAAQ,EAAE,MAAM,CAAC;IACjB,KAAK,EAAE,MAAM,CAAC;IACd,QAAQ,EAAE,MAAM,CAAC;IACjB,SAAS,EAAE,MAAM,EAAE,CAAC;CACrB;AAED;;;GAGG;AACH,wBAAgB,iBAAiB,CAC/B,KAAK,EAAE,UAAU,EAAE,EACnB,KAAK,EAAE,UAAU,EAAE,GAClB,UAAU,EAAE,CAsEd"}