codebase-onboarder 0.6.0 → 1.0.0

package/shared/diagram/aiMermaid.js

@@ -1,59 +1,63 @@
 // Turns an LLM's raw answer into trustworthy Mermaid source.
 // Models wrap, apologize, and explain — this strips all of that back to the
 // diagram itself plus the one-line caption we ask for.
-
 // Pulls `{ caption, body }` out of `text`; returns null when there is no
 // flowchart to be found. `body` starts at the `flowchart`/`graph` line and
 // has trailing prose trimmed away.
 export function extractAIDiagram(text) {
-  if (!text || typeof text !== 'string') return null;
-
-  // Fences gone first — ```mermaid and plain ``` alike.
-  const unfenced = text.replace(/```(?:mermaid)?/gi, '\n');
-
-  const capMatch = unfenced.match(/^%%\s*caption:\s*(.+)$/m);
-  const caption = capMatch ? capMatch[1].trim() : '';
-
-  const start = unfenced.search(/^\s*(flowchart|graph)\b/m);
-  if (start === -1) return null;
-
-  const lines = unfenced.slice(start).split('\n');
-  // Trim trailing prose: walk back past anything that doesn't look like
-  // Mermaid. Labels, edges, subgraph blocks and classDefs all survive.
-  const MERMAID_HINT = /-->|---|\[|\]|\(|\)|\bsubgraph\b|\bend\b|classDef|^class\b|%%|:::|^\s*[\w$]+\s*:/;
-  while (lines.length) {
-    const tail = lines[lines.length - 1].trim();
-    if (!tail) {
-      lines.pop();
-      continue;
+    if (!text || typeof text !== 'string')
+        return null;
+    // Fences gone first — ```mermaid and plain ``` alike.
+    const unfenced = text.replace(/```(?:mermaid)?/gi, '\n');
+    const capMatch = unfenced.match(/^%%\s*caption:\s*(.+)$/m);
+    const caption = capMatch ? capMatch[1].trim() : '';
+    const start = unfenced.search(/^\s*(flowchart|graph)\b/m);
+    if (start === -1)
+        return null;
+    const lines = unfenced.slice(start).split('\n');
+    // Trim trailing prose: walk back past anything that doesn't look like
+    // Mermaid. Labels, edges, subgraph blocks and classDefs all survive.
+    const MERMAID_HINT = /-->|---|\[|\]|\(|\)|\bsubgraph\b|\bend\b|classDef|^class\b|%%|:::|^\s*[\w$]+\s*:/;
+    while (lines.length) {
+        const tail = lines[lines.length - 1].trim();
+        if (!tail) {
+            lines.pop();
+            continue;
+        }
+        if (MERMAID_HINT.test(tail))
+            break;
+        lines.pop(); // a sentence, not a diagram line
     }
-    if (MERMAID_HINT.test(tail)) break;
-    lines.pop(); // a sentence, not a diagram line
-  }
-
-  const body = lines.join('\n').trim();
-  const meaningful = lines.filter((l) => l.trim() && !l.trim().startsWith('%%')).length;
-  if (meaningful < 2) return null;
-
-  return { caption, body };
+    const body = lines.join('\n').trim();
+    const meaningful = lines.filter((l) => l.trim() && !l.trim().startsWith('%%')).length;
+    if (meaningful < 2)
+        return null;
+    return { caption, body };
 }
-
 // AI nodes carry no stable ids, so clicks are matched by their text: a full
 // path hit first, then a unique-basename hit. Imperfect and honest about it.
 export function matchNodeText(text, files) {
-  const t = String(text || '').trim();
-  if (!t) return null;
-  const exact = files.find((f) => t === f.path || t.endsWith('/' + f.path) || t === f.name && false);
-  if (exact) return exact.path;
-  let hit = null;
-  for (const f of files) {
-    if (!t.includes(f.name)) continue;
-    if (hit && hit !== f.path) {
-      // same basename twice — ambiguous only if the paths differ
-      const dup = files.filter((x) => x.name === f.name);
-      if (dup.length > 1) return null;
-    }
-    hit = f.path;
-  }
-  return hit;
+    const t = String(text || '').trim();
+    if (!t)
+        return null;
+    const exact = files.find((f) => t === f.path || t.endsWith('/' + f.path));
+    if (exact)
+        return exact.path;
+    const containsLabel = (label) => {
+        let at = t.indexOf(label);
+        while (at !== -1) {
+            if (!/[\w./-]/.test(t[at - 1] || '') && !/[\w./-]/.test(t[at + label.length] || ''))
+                return true;
+            at = t.indexOf(label, at + 1);
+        }
+        return false;
+    };
+    // Models often annotate the full path with a role or dependency count.
+    // Prefer that path before considering potentially duplicated basenames.
+    const paths = files.filter(f => containsLabel(f.path));
+    if (paths.length)
+        return paths.length === 1 ? paths[0].path : null;
+    const names = files.filter(f => containsLabel(f.name));
+    return names.length === 1 ? names[0].path : null;
 }
+//# sourceMappingURL=aiMermaid.js.map

package/shared/diagram/aiMermaid.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"aiMermaid.js","sourceRoot":"","sources":["../../src/shared/diagram/aiMermaid.ts"],"names":[],"mappings":"AAAA,6DAA6D;AAC7D,4EAA4E;AAC5E,uDAAuD;AAEvD,yEAAyE;AACzE,2EAA2E;AAC3E,mCAAmC;AACnC,MAAM,UAAU,gBAAgB,CAAC,IAAI;IACnC,IAAI,CAAC,IAAI,IAAI,OAAO,IAAI,KAAK,QAAQ;QAAE,OAAO,IAAI,CAAC;IAEnD,sDAAsD;IACtD,MAAM,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,mBAAmB,EAAE,IAAI,CAAC,CAAC;IAEzD,MAAM,QAAQ,GAAG,QAAQ,CAAC,KAAK,CAAC,yBAAyB,CAAC,CAAC;IAC3D,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;IAEnD,MAAM,KAAK,GAAG,QAAQ,CAAC,MAAM,CAAC,0BAA0B,CAAC,CAAC;IAC1D,IAAI,KAAK,KAAK,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IAE9B,MAAM,KAAK,GAAG,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAChD,sEAAsE;IACtE,qEAAqE;IACrE,MAAM,YAAY,GAAG,kFAAkF,CAAC;IACxG,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QACpB,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QAC5C,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,KAAK,CAAC,GAAG,EAAE,CAAC;YACZ,SAAS;QACX,CAAC;QACD,IAAI,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,MAAM;QACnC,KAAK,CAAC,GAAG,EAAE,CAAC,CAAC,iCAAiC;IAChD,CAAC;IAED,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;IACrC,MAAM,UAAU,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC;IACtF,IAAI,UAAU,GAAG,CAAC;QAAE,OAAO,IAAI,CAAC;IAEhC,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC;AAC3B,CAAC;AAED,4EAA4E;AAC5E,6EAA6E;AAC7E,MAAM,UAAU,aAAa,CAAC,IAAI,EAAE,KAAK;IACvC,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;IACpC,IAAI,CAAC,CAAC;QAAE,OAAO,IAAI,CAAC;IACpB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,IAAI,CAAC,CAAC,QAAQ,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IAC1E,IAAI,KAAK;QAAE,OAAO,KAAK,CAAC,IAAI,CAAC;IAC7B,MAAM,aAAa,GAAG,CAAC,KAAa,EAAE,EAAE;QACtC,IAAI,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;QAC1B,OAAO,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC;YACjB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;gBAAE,OAAO,IAAI,CAAC;YACjG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,EAAE,GAAG,CAAC,CAAC,CAAC;QAChC,CAAC;QACD,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;IACF,uEAAuE;IACvE,wEAAwE;IACxE,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACvD,IAAI,KAAK,CAAC,MAAM;QAAE,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;IACnE,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACvD,OAAO,KAAK,CAAC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC;AACnD,CAAC","sourcesContent":["// Turns an LLM's raw answer into trustworthy Mermaid source.\n// Models wrap, apologize, and explain — this strips all of that back to the\n// diagram itself plus the one-line caption we ask for.\n\n// Pulls `{ caption, body }` out of `text`; returns null when there is no\n// flowchart to be found. `body` starts at the `flowchart`/`graph` line and\n// has trailing prose trimmed away.\nexport function extractAIDiagram(text) {\n  if (!text || typeof text !== 'string') return null;\n\n  // Fences gone first — ```mermaid and plain ``` alike.\n  const unfenced = text.replace(/```(?:mermaid)?/gi, '\\n');\n\n  const capMatch = unfenced.match(/^%%\\s*caption:\\s*(.+)$/m);\n  const caption = capMatch ? capMatch[1].trim() : '';\n\n  const start = unfenced.search(/^\\s*(flowchart|graph)\\b/m);\n  if (start === -1) return null;\n\n  const lines = unfenced.slice(start).split('\\n');\n  // Trim trailing prose: walk back past anything that doesn't look like\n  // Mermaid. Labels, edges, subgraph blocks and classDefs all survive.\n  const MERMAID_HINT = /-->|---|\\[|\\]|\\(|\\)|\\bsubgraph\\b|\\bend\\b|classDef|^class\\b|%%|:::|^\\s*[\\w$]+\\s*:/;\n  while (lines.length) {\n    const tail = lines[lines.length - 1].trim();\n    if (!tail) {\n      lines.pop();\n      continue;\n    }\n    if (MERMAID_HINT.test(tail)) break;\n    lines.pop(); // a sentence, not a diagram line\n  }\n\n  const body = lines.join('\\n').trim();\n  const meaningful = lines.filter((l) => l.trim() && !l.trim().startsWith('%%')).length;\n  if (meaningful < 2) return null;\n\n  return { caption, body };\n}\n\n// AI nodes carry no stable ids, so clicks are matched by their text: a full\n// path hit first, then a unique-basename hit. Imperfect and honest about it.\nexport function matchNodeText(text, files) {\n  const t = String(text || '').trim();\n  if (!t) return null;\n  const exact = files.find((f) => t === f.path || t.endsWith('/' + f.path));\n  if (exact) return exact.path;\n  const containsLabel = (label: string) => {\n    let at = t.indexOf(label);\n    while (at !== -1) {\n      if (!/[\\w./-]/.test(t[at - 1] || '') && !/[\\w./-]/.test(t[at + label.length] || '')) return true;\n      at = t.indexOf(label, at + 1);\n    }\n    return false;\n  };\n  // Models often annotate the full path with a role or dependency count.\n  // Prefer that path before considering potentially duplicated basenames.\n  const paths = files.filter(f => containsLabel(f.path));\n  if (paths.length) return paths.length === 1 ? paths[0].path : null;\n  const names = files.filter(f => containsLabel(f.name));\n  return names.length === 1 ? names[0].path : null;\n}\n"]}

package/shared/diagram/atlas.d.ts

@@ -0,0 +1,16 @@
+export declare function atlasSpecs(scan: any, facts: any, manifest: any, patterns: any): {
+    kind: string;
+    path: string;
+    title: string;
+    sub: string;
+}[];
+export declare function atlasDiagram(spec: any, { scan, facts, manifest, patterns }: {
+    facts: any;
+    manifest: any;
+    patterns: any;
+    scan: any;
+}): {
+    source: string;
+    nodes: {};
+};
+export declare function filterAtlasItems(specs: any, { text, showTests }?: Record<string, any>): any;

package/shared/diagram/atlas.js

@@ -9,85 +9,76 @@
 // reader will use one card's worth of.
 //
 // Pure, like everything under shared/: no DOM, no app state, no network.
-
-import {
-  overviewDiagram, folderDiagram, fileDetailDiagram, servicesDiagram, layersDiagram,
-} from './mermaid.js';
+import { overviewDiagram, folderDiagram, fileDetailDiagram, servicesDiagram, layersDiagram, } from './mermaid.js';
 import { isTestPath } from '../analyzer/pathUtil.js';
-
 // Both caps exist to keep the card list scrollable rather than endless. Files
 // are ranked by fan-in first, so the 200 that survive are the ones the rest of
 // the repo actually depends on — the cap trims the leaves, not the hubs.
 const MAX_FOLDERS = 120;
 const MAX_FILES = 200;
-
 const plural = (n, word) => `${n} ${n === 1 ? word : word + 's'}`;
-
 const strata = (patterns) => {
-  const n = patterns.layersInfo.layers.length;
-  return `${n} ${n === 1 ? 'stratum' : 'strata'}`;
+    const n = patterns.layersInfo.layers.length;
+    return `${n} ${n === 1 ? 'stratum' : 'strata'}`;
 };
-
 // The catalogue, in the order it is shown: the whole-repo maps first, then one
 // card per folder, then one per file.
 export function atlasSpecs(scan, facts, manifest, patterns) {
-  const specs = [
-    { kind: 'overview', path: '', title: 'Overview map', sub: plural(scan.stats.filesParsed, 'file') },
-    { kind: 'layers', path: '', title: 'Architecture layers', sub: strata(patterns) },
-  ];
-
-  // A services map only means something once a manifest declared some.
-  if (manifest?.services?.length) {
-    specs.push({
-      kind: 'services', path: '', title: 'Services',
-      sub: `${manifest.services.length} declared`,
-    });
-  }
-
-  const counts = new Map();
-  for (const f of scan.files) counts.set(f.dir, (counts.get(f.dir) || 0) + 1);
-  for (const folder of [...counts.keys()].sort().slice(0, MAX_FOLDERS)) {
-    specs.push({
-      kind: 'folder', path: folder,
-      title: (folder || '(repo root)') + '/',
-      sub: plural(counts.get(folder), 'file'),
-    });
-  }
-
-  const ranked = scan.files.slice()
-    .sort((a, b) => (facts.fanIn[b.path] || 0) - (facts.fanIn[a.path] || 0)
-      || a.path.localeCompare(b.path))
-    .slice(0, MAX_FILES);
-  for (const f of ranked) {
-    specs.push({
-      kind: 'file', path: f.path, title: f.path,
-      sub: plural(facts.fanIn[f.path] || 0, 'dependent'),
-    });
-  }
-
-  return specs;
+    const specs = [
+        { kind: 'overview', path: '', title: 'Overview map', sub: plural(scan.stats.filesParsed, 'file') },
+        { kind: 'layers', path: '', title: 'Architecture layers', sub: strata(patterns) },
+    ];
+    // A services map only means something once a manifest declared some.
+    if (manifest?.services?.length) {
+        specs.push({
+            kind: 'services', path: '', title: 'Services',
+            sub: `${manifest.services.length} declared`,
+        });
+    }
+    const counts = new Map();
+    for (const f of scan.files)
+        counts.set(f.dir, (counts.get(f.dir) || 0) + 1);
+    for (const folder of [...counts.keys()].sort().slice(0, MAX_FOLDERS)) {
+        specs.push({
+            kind: 'folder', path: folder,
+            title: (folder || '(repo root)') + '/',
+            sub: plural(counts.get(folder), 'file'),
+        });
+    }
+    const ranked = scan.files.slice()
+        .sort((a, b) => (facts.fanIn[b.path] || 0) - (facts.fanIn[a.path] || 0)
+        || a.path.localeCompare(b.path))
+        .slice(0, MAX_FILES);
+    for (const f of ranked) {
+        specs.push({
+            kind: 'file', path: f.path, title: f.path,
+            sub: plural(facts.fanIn[f.path] || 0, 'dependent'),
+        });
+    }
+    return specs;
 }
-
 // Draws one card. Called on open, so a card the reader never touches costs
 // nothing but its heading.
 export function atlasDiagram(spec, { scan, facts, manifest, patterns }) {
-  switch (spec.kind) {
-    case 'overview': return overviewDiagram(scan, facts);
-    case 'layers': return layersDiagram(scan, facts, patterns.layersInfo);
-    case 'services': return servicesDiagram(scan, manifest);
-    case 'file': return fileDetailDiagram(scan, facts, spec.path);
-    default: return folderDiagram(scan, facts, spec.path);
-  }
+    switch (spec.kind) {
+        case 'overview': return overviewDiagram(scan, facts);
+        case 'layers': return layersDiagram(scan, facts, patterns.layersInfo);
+        case 'services': return servicesDiagram(scan, manifest);
+        case 'file': return fileDetailDiagram(scan, facts, spec.path);
+        default: return folderDiagram(scan, facts, spec.path);
+    }
 }
-
 // The stage filters, applied to the catalogue. Matching is on the title so that
 // typing "overview" finds the overview card, which has no path of its own; the
 // tests toggle is by path, and only files have one worth testing.
 export function filterAtlasItems(specs, { text = '', showTests = true } = {}) {
-  const needle = text.trim().toLowerCase();
-  if (!needle && showTests) return specs;
-  return specs.filter((it) => {
-    if (!showTests && it.kind === 'file' && isTestPath(it.path)) return false;
-    return !needle || it.title.toLowerCase().includes(needle);
-  });
+    const needle = text.trim().toLowerCase();
+    if (!needle && showTests)
+        return specs;
+    return specs.filter((it) => {
+        if (!showTests && it.kind === 'file' && isTestPath(it.path))
+            return false;
+        return !needle || it.title.toLowerCase().includes(needle);
+    });
 }
+//# sourceMappingURL=atlas.js.map

package/shared/diagram/atlas.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"atlas.js","sourceRoot":"","sources":["../../src/shared/diagram/atlas.ts"],"names":[],"mappings":"AAAA,uEAAuE;AACvE,EAAE;AACF,4EAA4E;AAC5E,gFAAgF;AAChF,0EAA0E;AAC1E,+EAA+E;AAC/E,iFAAiF;AACjF,8EAA8E;AAC9E,uCAAuC;AACvC,EAAE;AACF,yEAAyE;AAEzE,OAAO,EACL,eAAe,EAAE,aAAa,EAAE,iBAAiB,EAAE,eAAe,EAAE,aAAa,GAClF,MAAM,cAAc,CAAC;AACtB,OAAO,EAAE,UAAU,EAAE,MAAM,yBAAyB,CAAC;AAErD,8EAA8E;AAC9E,+EAA+E;AAC/E,yEAAyE;AACzE,MAAM,WAAW,GAAG,GAAG,CAAC;AACxB,MAAM,SAAS,GAAG,GAAG,CAAC;AAEtB,MAAM,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,GAAG,GAAG,EAAE,CAAC;AAElE,MAAM,MAAM,GAAG,CAAC,QAAQ,EAAE,EAAE;IAC1B,MAAM,CAAC,GAAG,QAAQ,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC;IAC5C,OAAO,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,QAAQ,EAAE,CAAC;AAClD,CAAC,CAAC;AAEF,+EAA+E;AAC/E,sCAAsC;AACtC,MAAM,UAAU,UAAU,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ;IACxD,MAAM,KAAK,GAAG;QACZ,EAAE,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,cAAc,EAAE,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,EAAE,MAAM,CAAC,EAAE;QAClG,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,qBAAqB,EAAE,GAAG,EAAE,MAAM,CAAC,QAAQ,CAAC,EAAE;KAClF,CAAC;IAEF,qEAAqE;IACrE,IAAI,QAAQ,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;QAC/B,KAAK,CAAC,IAAI,CAAC;YACT,IAAI,EAAE,UAAU,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,UAAU;YAC7C,GAAG,EAAE,GAAG,QAAQ,CAAC,QAAQ,CAAC,MAAM,WAAW;SAC5C,CAAC,CAAC;IACL,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAE,CAAC;IACzB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,KAAK;QAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC5E,KAAK,MAAM,MAAM,IAAI,CAAC,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,WAAW,CAAC,EAAE,CAAC;QACrE,KAAK,CAAC,IAAI,CAAC;YACT,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM;YAC5B,KAAK,EAAE,CAAC,MAAM,IAAI,aAAa,CAAC,GAAG,GAAG;YACtC,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,MAAM,CAAC;SACxC,CAAC,CAAC;IACL,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE;SAC9B,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;WAClE,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;SACjC,KAAK,CAAC,CAAC,EAAE,SAAS,CAAC,CAAC;IACvB,KAAK,MAAM,CAAC,IAAI,MAAM,EAAE,CAAC;QACvB,KAAK,CAAC,IAAI,CAAC;YACT,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,CAAC,CAAC,IAAI;YACzC,GAAG,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,WAAW,CAAC;SACnD,CAAC,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED,2EAA2E;AAC3E,2BAA2B;AAC3B,MAAM,UAAU,YAAY,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE;IACpE,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;QAClB,KAAK,UAAU,EAAE,OAAO,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACrD,KAAK,QAAQ,EAAE,OAAO,aAAa,CAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,CAAC,UAAU,CAAC,CAAC;QACtE,KAAK,UAAU,EAAE,OAAO,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;QACxD,KAAK,MAAM,EAAE,OAAO,iBAAiB,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9D,SAAS,OAAO,aAAa,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACxD,CAAC;AACH,CAAC;AAED,gFAAgF;AAChF,+EAA+E;AAC/E,kEAAkE;AAClE,MAAM,UAAU,gBAAgB,CAAC,KAAK,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,SAAS,GAAG,IAAI,EAAE,GAAwB,EAAE;IAC/F,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;IACzC,IAAI,CAAC,MAAM,IAAI,SAAS;QAAE,OAAO,KAAK,CAAC;IACvC,OAAO,KAAK,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE;QACzB,IAAI,CAAC,SAAS,IAAI,EAAE,CAAC,IAAI,KAAK,MAAM,IAAI,UAAU,CAAC,EAAE,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;QAC1E,OAAO,CAAC,MAAM,IAAI,EAAE,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;IAC5D,CAAC,CAAC,CAAC;AACL,CAAC","sourcesContent":["// The atlas: every map the app knows how to draw, listed in one place.\n//\n// The list is a catalogue of *specs* — kind, subject, title, subtitle — and\n// nothing more. Drawing is deliberately separate: `atlasDiagram` turns one spec\n// into Mermaid when a card is actually opened. The list used to carry the\n// generated source for all of its entries, which meant opening the atlas built\n// three whole-repo maps, 120 folder graphs and 200 file graphs up front, to show\n// a page of headings. On a mid-size repo that is a visible stall for work the\n// reader will use one card's worth of.\n//\n// Pure, like everything under shared/: no DOM, no app state, no network.\n\nimport {\n  overviewDiagram, folderDiagram, fileDetailDiagram, servicesDiagram, layersDiagram,\n} from './mermaid.js';\nimport { isTestPath } from '../analyzer/pathUtil.js';\n\n// Both caps exist to keep the card list scrollable rather than endless. Files\n// are ranked by fan-in first, so the 200 that survive are the ones the rest of\n// the repo actually depends on — the cap trims the leaves, not the hubs.\nconst MAX_FOLDERS = 120;\nconst MAX_FILES = 200;\n\nconst plural = (n, word) => `${n} ${n === 1 ? word : word + 's'}`;\n\nconst strata = (patterns) => {\n  const n = patterns.layersInfo.layers.length;\n  return `${n} ${n === 1 ? 'stratum' : 'strata'}`;\n};\n\n// The catalogue, in the order it is shown: the whole-repo maps first, then one\n// card per folder, then one per file.\nexport function atlasSpecs(scan, facts, manifest, patterns) {\n  const specs = [\n    { kind: 'overview', path: '', title: 'Overview map', sub: plural(scan.stats.filesParsed, 'file') },\n    { kind: 'layers', path: '', title: 'Architecture layers', sub: strata(patterns) },\n  ];\n\n  // A services map only means something once a manifest declared some.\n  if (manifest?.services?.length) {\n    specs.push({\n      kind: 'services', path: '', title: 'Services',\n      sub: `${manifest.services.length} declared`,\n    });\n  }\n\n  const counts = new Map();\n  for (const f of scan.files) counts.set(f.dir, (counts.get(f.dir) || 0) + 1);\n  for (const folder of [...counts.keys()].sort().slice(0, MAX_FOLDERS)) {\n    specs.push({\n      kind: 'folder', path: folder,\n      title: (folder || '(repo root)') + '/',\n      sub: plural(counts.get(folder), 'file'),\n    });\n  }\n\n  const ranked = scan.files.slice()\n    .sort((a, b) => (facts.fanIn[b.path] || 0) - (facts.fanIn[a.path] || 0)\n      || a.path.localeCompare(b.path))\n    .slice(0, MAX_FILES);\n  for (const f of ranked) {\n    specs.push({\n      kind: 'file', path: f.path, title: f.path,\n      sub: plural(facts.fanIn[f.path] || 0, 'dependent'),\n    });\n  }\n\n  return specs;\n}\n\n// Draws one card. Called on open, so a card the reader never touches costs\n// nothing but its heading.\nexport function atlasDiagram(spec, { scan, facts, manifest, patterns }) {\n  switch (spec.kind) {\n    case 'overview': return overviewDiagram(scan, facts);\n    case 'layers': return layersDiagram(scan, facts, patterns.layersInfo);\n    case 'services': return servicesDiagram(scan, manifest);\n    case 'file': return fileDetailDiagram(scan, facts, spec.path);\n    default: return folderDiagram(scan, facts, spec.path);\n  }\n}\n\n// The stage filters, applied to the catalogue. Matching is on the title so that\n// typing \"overview\" finds the overview card, which has no path of its own; the\n// tests toggle is by path, and only files have one worth testing.\nexport function filterAtlasItems(specs, { text = '', showTests = true }: Record<string, any> = {}) {\n  const needle = text.trim().toLowerCase();\n  if (!needle && showTests) return specs;\n  return specs.filter((it) => {\n    if (!showTests && it.kind === 'file' && isTestPath(it.path)) return false;\n    return !needle || it.title.toLowerCase().includes(needle);\n  });\n}\n"]}

package/shared/diagram/mermaid.d.ts

@@ -0,0 +1,43 @@
+export declare function setDiagramTheme(theme: any): void;
+export declare function getDiagramTheme(): string;
+export declare function diagramThemeBlock(): string;
+export declare function overviewDiagram(scan: any, facts: any): {
+    source: string;
+    nodes: Record<string, any>;
+};
+export declare function folderDiagram(scan: any, facts: any, folder: any, opts?: Record<string, any>): {
+    source: string;
+    nodes: {};
+};
+export declare function fileDetailDiagram(scan: any, facts: any, path: any): {
+    source: string;
+    nodes: {};
+};
+export declare function callsDiagram(file: any): {
+    source: string;
+    nodes: {};
+};
+export declare function servicesDiagram(scan: any, manifest: any): {
+    source: string;
+    nodes: {};
+};
+export declare function emptyDiagram(note: any): {
+    source: string;
+    nodes: {};
+};
+export declare function layersDiagram(scan: any, facts: any, layersInfo: any, opts?: Record<string, any>): {
+    source: string;
+    nodes: Record<string, any>;
+};
+export declare function healthDiagram(scan: any, facts: any, health: any, opts?: Record<string, any>): {
+    source: string;
+    nodes: Record<string, any>;
+};
+export declare function securityDiagram(scan: any, facts: any, security: any, opts?: Record<string, any>): {
+    source: string;
+    nodes: Record<string, any>;
+};
+export declare function historyDiagram(scan: any, facts: any, history: any, opts?: Record<string, any>): {
+    source: string;
+    nodes: {};
+};