codebase-onboarder 0.6.0 → 1.0.0

package/cli/explorer/graphs.js

@@ -5,17 +5,14 @@
 // honest translation of "a dependency tree" is the one everybody already knows
 // how to read: an indented tree with arrows. Neither is a worse version of the
 // web view — they are the terminal's own idiom, drawn from the same numbers.
-
 import { fit, termWidth } from '../ui.js';
 import { width } from '../../server/layout.js';
-
 // Five ramp steps. Unicode 2591–2588, with an ASCII floor for terminals that
 // cannot show them. Density reads as "how dark", which survives being printed in
 // black and white, redirected to a file, or read by someone who cannot tell the
 // ramp apart — the thing a color-only heatmap cannot promise.
 const RAMP_UNICODE = [' ', '░', '▒', '▓', '█'];
 const RAMP_ASCII = ['.', ':', '+', '*', '#'];
-
 // A row that is `marker + value + tail`, where the tail is the first thing to go
 // when the terminal is too narrow to hold it.
 //
@@ -29,7 +26,6 @@ const RAMP_ASCII = ['.', ':', '+', '*', '#'];
 // characters as if they occupied cells, which is how a "fitted" row still
 // overflows by the length of the color codes.
 const MIN_PATH = 8;
-
 // `pad` is the indent *inside* the width budget, not a prefix glued on
 // afterwards. An earlier version returned `marker + value` and let the caller
 // prepend `'    '`, which is four cells the helper could not see — so every row
@@ -42,18 +38,17 @@ const MIN_PATH = 8;
 // over-wide marker is still an overflow, so the value is clamped by `w` itself
 // and the marker is fitted too.
 export function labelled(marker, value, tail = '', { pad = 0 } = {}) {
-  const w = termWidth();
-  const indent = ' '.repeat(Math.max(0, Math.min(pad, Math.max(0, w - 1))));
-  const markerRoom = Math.max(0, w - width(indent) - 1);
-  const head = fit(marker, markerRoom);
-  const lead = width(indent) + width(head);
-  const withTail = w - lead - width(tail);
-  if (tail && withTail > MIN_PATH) return indent + head + fit(value, withTail) + tail;
-  return indent + head + fit(value, Math.max(0, w - lead));
+    const w = termWidth();
+    const indent = ' '.repeat(Math.max(0, Math.min(pad, Math.max(0, w - 1))));
+    const markerRoom = Math.max(0, w - width(indent) - 1);
+    const head = fit(marker, markerRoom);
+    const lead = width(indent) + width(head);
+    const withTail = w - lead - width(tail);
+    if (tail && withTail > MIN_PATH)
+        return indent + head + fit(value, withTail) + tail;
+    return indent + head + fit(value, Math.max(0, w - lead));
 }
-
 const glyphs = () => (process.platform === 'win32' && !process.env.WT_SESSION ? RAMP_ASCII : RAMP_UNICODE);
-
 // The strongest signal a number gets, as a fraction of the largest, in five
 // steps. Zero is always the blank cell rather than the faintest mark: "nothing"
 // and "a little" are different facts, and a heat grid that gives zero a speck of
@@ -63,79 +58,77 @@ const glyphs = () => (process.platform === 'win32' && !process.env.WT_SESSION ?
 // number 0 for "empty", which then blew up on `.padEnd()` the first time a
 // genuinely-zero cell was drawn, i.e. only on repos with real structure.
 function step(value, max) {
-  const ramp = glyphs();
-  if (!value || max <= 0) return ramp[0];
-  const i = Math.min(ramp.length - 1, Math.max(1, Math.ceil((value / max) * (ramp.length - 1))));
-  return ramp[i];
+    const ramp = glyphs();
+    if (!value || max <= 0)
+        return ramp[0];
+    const i = Math.min(ramp.length - 1, Math.max(1, Math.ceil((value / max) * (ramp.length - 1))));
+    return ramp[i];
 }
-
 export { step };
-
 // A horizontal bar, sized as a fraction of the largest value. Exported so every
 // ranked list draws its bars identically instead of each view re-deriving the
 // scale and drifting.
 export function bar(value, max, room) {
-  if (room <= 0 || !value || max <= 0) return '';
-  const ramp = glyphs();
-  const full = Math.max(1, Math.round((value / max) * room));
-  return ramp[ramp.length - 1].repeat(Math.min(room, full));
+    if (room <= 0 || !value || max <= 0)
+        return '';
+    const ramp = glyphs();
+    const full = Math.max(1, Math.round((value / max) * room));
+    return ramp[ramp.length - 1].repeat(Math.min(room, full));
 }
-
 // A vertical bar chart, because some questions are about magnitude across
 // categories and reading them off a horizontal list is harder than it needs to
 // be. Columns collapse to a single row when the terminal is too narrow to hold
 // them, rather than drawing a squeezed, unreadable grid.
 export function columns(items, { room = 40, rows = 10 } = {}) {
-  if (!items.length) return [];
-  const width = Math.max(1, Math.min(items.length, room));
-  const stepSize = Math.ceil(items.length / width);
-  const shown = stepSize > 1 ? items.filter((_, i) => i % stepSize === 0).slice(0, width) : items;
-  const top = Math.max(...shown.map((i) => i.value)) || 1;
-  const solid = glyphs()[glyphs().length - 1];
-  const out = [];
-  for (let level = rows; level >= 1; level--) {
-    const threshold = (level / rows) * top;
-    const line = shown.map((i) => (i.value >= threshold ? solid : ' ')).join('');
-    if (line.trim()) out.push('  ' + line);
-  }
-  out.push('  ' + shown.map((i) => String(i.label).slice(0, 1)).join(''));
-  return out;
+    if (!items.length)
+        return [];
+    const width = Math.max(1, Math.min(items.length, room));
+    const stepSize = Math.ceil(items.length / width);
+    const shown = stepSize > 1 ? items.filter((_, i) => i % stepSize === 0).slice(0, width) : items;
+    const top = Math.max(...shown.map((i) => i.value)) || 1;
+    const solid = glyphs()[glyphs().length - 1];
+    const out = [];
+    for (let level = rows; level >= 1; level--) {
+        const threshold = (level / rows) * top;
+        const line = shown.map((i) => (i.value >= threshold ? solid : ' ')).join('');
+        if (line.trim())
+            out.push('  ' + line);
+    }
+    out.push('  ' + shown.map((i) => String(i.label).slice(0, 1)).join(''));
+    return out;
 }
-
 // The folder-to-folder coupling grid, as a matrix. Row label, then one cell per
 // folder, heaviest traffic darkest. Columns are addressed by letter so a cell
 // can be named rather than counted. The diagonal is blank: a folder's traffic
 // with itself is not coupling, it is just being that folder.
 export function couplingGrid(repo, { maxFolders = 8, columns: cols } = {}) {
-  const matrix = repo.coupling;
-  if (!matrix || !matrix.folders.length) return [];
-  const folders = matrix.folders.slice(0, maxFolders);
-  const w = cols || termWidth();
-  const labelRoom = Math.min(18, Math.max(...folders.map((f) => f.length)) + 1);
-  const cellRoom = Math.max(1, Math.floor((w - labelRoom - 4) / folders.length));
-  const cellW = Math.max(1, Math.min(2, cellRoom));
-
-  const head = ' '.repeat(labelRoom) + folders.map((_, i) => String.fromCharCode(65 + i).padEnd(cellW)).join('');
-  // The rule is sized to the grid but never past the terminal, so a very narrow
-  // window gets a short rule rather than a wrapped one.
-  const rule = '─'.repeat(Math.max(1, Math.min(labelRoom + folders.length * cellW, Math.max(1, w - 2))));
-  const out = ['  ' + fit(head, w - 2), '  ' + rule];
-
-  folders.forEach((from, r) => {
-    let line = fit(from, labelRoom);
-    folders.forEach((to, c) => {
-      if (r === c) {
-        line += ' '.repeat(cellW);
-        return;
-      }
-      const n = matrix.counts.get(from + '->' + to) || 0;
-      line += step(n, matrix.max).padEnd(cellW);
+    const matrix = repo.coupling;
+    if (!matrix || !matrix.folders.length)
+        return [];
+    const folders = matrix.folders.slice(0, maxFolders);
+    const w = cols || termWidth();
+    const labelRoom = Math.min(18, Math.max(...folders.map((f) => f.length)) + 1);
+    const cellRoom = Math.max(1, Math.floor((w - labelRoom - 4) / folders.length));
+    const cellW = Math.max(1, Math.min(2, cellRoom));
+    const head = ' '.repeat(labelRoom) + folders.map((_, i) => String.fromCharCode(65 + i).padEnd(cellW)).join('');
+    // The rule is sized to the grid but never past the terminal, so a very narrow
+    // window gets a short rule rather than a wrapped one.
+    const rule = '─'.repeat(Math.max(1, Math.min(labelRoom + folders.length * cellW, Math.max(1, w - 2))));
+    const out = ['  ' + fit(head, w - 2), '  ' + rule];
+    folders.forEach((from, r) => {
+        let line = fit(from, labelRoom);
+        folders.forEach((to, c) => {
+            if (r === c) {
+                line += ' '.repeat(cellW);
+                return;
+            }
+            const n = matrix.counts.get(from + '->' + to) || 0;
+            line += step(n, matrix.max).padEnd(cellW);
+        });
+        out.push('  ' + fit(line, w - 2));
     });
-    out.push('  ' + fit(line, w - 2));
-  });
-  return out;
+    return out;
 }
-
 // A dependency tree rooted at a file, drawn as a tree with the one piece of
 // information that makes a tree readable — which way each edge points. This is
 // the terminal's answer to the site's force-directed graph: a browser can show
@@ -147,32 +140,34 @@ export function couplingGrid(repo, { maxFolders = 8, columns: cols } = {}) {
 // a file reached by two different paths is drawn only under the first, which is
 // the right trade for a bounded tree.
 export function depTree(repo, rootPath, { depth = 2, direction = 'both', room } = {}) {
-  const w = room || termWidth();
-  const out = [];
-  const seen = new Set([rootPath]);
-
-  const walk = (path, prefix, left, arrow) => {
-    out.push(fit(prefix + arrow + ' ' + path, w - 2));
-    if (left <= 0) return;
-
-    const kids = [];
-    if (direction !== 'up') {
-      for (const child of repo.facts.importsOf[path] || []) {
-        if (!seen.has(child)) kids.push({ path: child, arrow: '→' });
-      }
-    }
-    if (direction !== 'down') {
-      for (const parent of repo.facts.importers[path] || []) {
-        if (!seen.has(parent)) kids.push({ path: parent, arrow: '←' });
-      }
-    }
-    kids.forEach((k, i) => {
-      if (seen.has(k.path)) return;
-      seen.add(k.path);
-      walk(k.path, prefix + (i === kids.length - 1 ? '  ' : '│ '), left - 1, k.arrow);
-    });
-  };
-
-  walk(rootPath, '', depth, '●');
-  return out;
+    const w = room || termWidth();
+    const out = [];
+    const seen = new Set([rootPath]);
+    const walk = (path, prefix, left, arrow) => {
+        out.push(fit(prefix + arrow + ' ' + path, w - 2));
+        if (left <= 0)
+            return;
+        const kids = [];
+        if (direction !== 'up') {
+            for (const child of repo.facts.importsOf[path] || []) {
+                if (!seen.has(child))
+                    kids.push({ path: child, arrow: '→' });
+            }
+        }
+        if (direction !== 'down') {
+            for (const parent of repo.facts.importers[path] || []) {
+                if (!seen.has(parent))
+                    kids.push({ path: parent, arrow: '←' });
+            }
+        }
+        kids.forEach((k, i) => {
+            if (seen.has(k.path))
+                return;
+            seen.add(k.path);
+            walk(k.path, prefix + (i === kids.length - 1 ? '  ' : '│ '), left - 1, k.arrow);
+        });
+    };
+    walk(rootPath, '', depth, '●');
+    return out;
 }
+//# sourceMappingURL=graphs.js.map

package/cli/explorer/graphs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graphs.js","sourceRoot":"","sources":["../../src/cli/explorer/graphs.ts"],"names":[],"mappings":"AAAA,gFAAgF;AAChF,EAAE;AACF,iFAAiF;AACjF,gFAAgF;AAChF,+EAA+E;AAC/E,+EAA+E;AAC/E,6EAA6E;AAE7E,OAAO,EAAE,GAAG,EAAE,SAAS,EAAE,MAAM,UAAU,CAAC;AAC1C,OAAO,EAAE,KAAK,EAAE,MAAM,wBAAwB,CAAC;AAE/C,6EAA6E;AAC7E,iFAAiF;AACjF,gFAAgF;AAChF,8DAA8D;AAC9D,MAAM,YAAY,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAC/C,MAAM,UAAU,GAAG,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC;AAE7C,iFAAiF;AACjF,8CAA8C;AAC9C,EAAE;AACF,6EAA6E;AAC7E,iFAAiF;AACjF,+EAA+E;AAC/E,6EAA6E;AAC7E,EAAE;AACF,gFAAgF;AAChF,gFAAgF;AAChF,0EAA0E;AAC1E,8CAA8C;AAC9C,MAAM,QAAQ,GAAG,CAAC,CAAC;AAEnB,uEAAuE;AACvE,8EAA8E;AAC9E,gFAAgF;AAChF,6EAA6E;AAC7E,8CAA8C;AAC9C,EAAE;AACF,+EAA+E;AAC/E,iFAAiF;AACjF,oEAAoE;AACpE,+EAA+E;AAC/E,gCAAgC;AAChC,MAAM,UAAU,QAAQ,CAAC,MAAM,EAAE,KAAK,EAAE,IAAI,GAAG,EAAE,EAAE,EAAE,GAAG,GAAG,CAAC,EAAE,GAAwB,EAAE;IACtF,MAAM,CAAC,GAAG,SAAS,EAAE,CAAC;IACtB,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC;IACrC,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACzC,MAAM,QAAQ,GAAG,CAAC,GAAG,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;IACxC,IAAI,IAAI,IAAI,QAAQ,GAAG,QAAQ;QAAE,OAAO,MAAM,GAAG,IAAI,GAAG,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,GAAG,IAAI,CAAC;IACpF,OAAO,MAAM,GAAG,IAAI,GAAG,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;AAC3D,CAAC;AAED,MAAM,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,KAAK,OAAO,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC;AAE3G,4EAA4E;AAC5E,gFAAgF;AAChF,iFAAiF;AACjF,8CAA8C;AAC9C,EAAE;AACF,2EAA2E;AAC3E,2EAA2E;AAC3E,yEAAyE;AACzE,SAAS,IAAI,CAAC,KAAK,EAAE,GAAG;IACtB,MAAM,IAAI,GAAG,MAAM,EAAE,CAAC;IACtB,IAAI,CAAC,KAAK,IAAI,GAAG,IAAI,CAAC;QAAE,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;IACvC,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAC/F,OAAO,IAAI,CAAC,CAAC,CAAC,CAAC;AACjB,CAAC;AAED,OAAO,EAAE,IAAI,EAAE,CAAC;AAEhB,gFAAgF;AAChF,8EAA8E;AAC9E,sBAAsB;AACtB,MAAM,UAAU,GAAG,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI;IAClC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,IAAI,GAAG,IAAI,CAAC;QAAE,OAAO,EAAE,CAAC;IAC/C,MAAM,IAAI,GAAG,MAAM,EAAE,CAAC;IACtB,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IAC3D,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC;AAC5D,CAAC;AAED,0EAA0E;AAC1E,+EAA+E;AAC/E,+EAA+E;AAC/E,yDAAyD;AACzD,MAAM,UAAU,OAAO,CAAC,KAAK,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,IAAI,GAAG,EAAE,EAAE,GAAwB,EAAE;IAC/E,IAAI,CAAC,KAAK,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC;IAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAC;IACxD,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,KAAK,CAAC,CAAC;IACjD,MAAM,KAAK,GAAG,QAAQ,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,QAAQ,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;IAChG,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC;IACxD,MAAM,KAAK,GAAG,MAAM,EAAE,CAAC,MAAM,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IAC5C,MAAM,GAAG,GAAG,EAAE,CAAC;IACf,KAAK,IAAI,KAAK,GAAG,IAAI,EAAE,KAAK,IAAI,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QAC3C,MAAM,SAAS,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,GAAG,CAAC;QACvC,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,IAAI,SAAS,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7E,IAAI,IAAI,CAAC,IAAI,EAAE;YAAE,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC;IACzC,CAAC;IACD,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACxE,OAAO,GAAG,CAAC;AACb,CAAC;AAED,gFAAgF;AAChF,8EAA8E;AAC9E,8EAA8E;AAC9E,6DAA6D;AAC7D,MAAM,UAAU,YAAY,CAAC,IAAI,EAAE,EAAE,UAAU,GAAG,CAAC,EAAE,OAAO,EAAE,IAAI,EAAE,GAAwB,EAAE;IAC5F,MAAM,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC;IAC7B,IAAI,CAAC,MAAM,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC;IACjD,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,UAAU,CAAC,CAAC;IACpD,MAAM,CAAC,GAAG,IAAI,IAAI,SAAS,EAAE,CAAC;IAC9B,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC9E,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,GAAG,CAAC,CAAC,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC;IAC/E,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;IAEjD,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,SAAS,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC/G,8EAA8E;IAC9E,sDAAsD;IACtD,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,SAAS,GAAG,OAAO,CAAC,MAAM,GAAG,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvG,MAAM,GAAG,GAAG,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,IAAI,CAAC,CAAC;IAEnD,OAAO,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;QAC1B,IAAI,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;QAChC,OAAO,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE;YACxB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;gBACZ,IAAI,IAAI,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;gBAC1B,OAAO;YACT,CAAC;YACD,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,GAAG,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;YACnD,IAAI,IAAI,IAAI,CAAC,CAAC,EAAE,MAAM,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAC5C,CAAC,CAAC,CAAC;QACH,GAAG,CAAC,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IACH,OAAO,GAAG,CAAC;AACb,CAAC;AAED,4EAA4E;AAC5E,+EAA+E;AAC/E,+EAA+E;AAC/E,iFAAiF;AACjF,2BAA2B;AAC3B,EAAE;AACF,4EAA4E;AAC5E,iFAAiF;AACjF,gFAAgF;AAChF,sCAAsC;AACtC,MAAM,UAAU,OAAO,CAAC,IAAI,EAAE,QAAQ,EAAE,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,GAAG,MAAM,EAAE,IAAI,EAAE,GAAwB,EAAE;IACvG,MAAM,CAAC,GAAG,IAAI,IAAI,SAAS,EAAE,CAAC;IAC9B,MAAM,GAAG,GAAG,EAAE,CAAC;IACf,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IAEjC,MAAM,IAAI,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE;QACzC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,GAAG,KAAK,GAAG,GAAG,GAAG,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAClD,IAAI,IAAI,IAAI,CAAC;YAAE,OAAO;QAEtB,MAAM,IAAI,GAAG,EAAE,CAAC;QAChB,IAAI,SAAS,KAAK,IAAI,EAAE,CAAC;YACvB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;gBACrD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC;oBAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;YAC/D,CAAC;QACH,CAAC;QACD,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;YACzB,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;gBACtD,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC;oBAAE,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;YACjE,CAAC;QACH,CAAC;QACD,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YACpB,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;gBAAE,OAAO;YAC7B,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YACjB,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,IAAI,GAAG,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;QAClF,CAAC,CAAC,CAAC;IACL,CAAC,CAAC;IAEF,IAAI,CAAC,QAAQ,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,CAAC;IAC/B,OAAO,GAAG,CAAC;AACb,CAAC","sourcesContent":["// Rendering primitives that the terminal can do and a browser cannot afford to.\n//\n// The site's coupling matrix is a canvas heat grid and its mind map is SVG. In a\n// terminal the honest translation of \"a heat grid\" is block characters, and the\n// honest translation of \"a dependency tree\" is the one everybody already knows\n// how to read: an indented tree with arrows. Neither is a worse version of the\n// web view — they are the terminal's own idiom, drawn from the same numbers.\n\nimport { fit, termWidth } from '../ui.js';\nimport { width } from '../../server/layout.js';\n\n// Five ramp steps. Unicode 2591–2588, with an ASCII floor for terminals that\n// cannot show them. Density reads as \"how dark\", which survives being printed in\n// black and white, redirected to a file, or read by someone who cannot tell the\n// ramp apart — the thing a color-only heatmap cannot promise.\nconst RAMP_UNICODE = [' ', '░', '▒', '▓', '█'];\nconst RAMP_ASCII = ['.', ':', '+', '*', '#'];\n\n// A row that is `marker + value + tail`, where the tail is the first thing to go\n// when the terminal is too narrow to hold it.\n//\n// This is the same mistake in five places — health risks, security findings,\n// entry points, symbol rows, and layer notes — and fixing each by hand means the\n// sixth gets it wrong too. The rule in one place: if the tail leaves less than\n// `MIN_PATH` cells for the value, drop the tail and give the value the rest.\n//\n// `marker` may be styled, so its width is measured with `width()` (which strips\n// ANSI) rather than `.length`. Measuring a styled string counts escape-sequence\n// characters as if they occupied cells, which is how a \"fitted\" row still\n// overflows by the length of the color codes.\nconst MIN_PATH = 8;\n\n// `pad` is the indent *inside* the width budget, not a prefix glued on\n// afterwards. An earlier version returned `marker + value` and let the caller\n// prepend `'    '`, which is four cells the helper could not see — so every row\n// came out four cells too wide, which is exactly the overflow this exists to\n// prevent. The indent is part of the row now.\n//\n// The value always gets at least one cell and never more than the terminal has\n// left, even when the marker alone is wider than the terminal. That last case is\n// the one a `Math.max(1, …)` floor gets wrong: a floor of 1 plus an\n// over-wide marker is still an overflow, so the value is clamped by `w` itself\n// and the marker is fitted too.\nexport function labelled(marker, value, tail = '', { pad = 0 }: Record<string, any> = {}) {\n  const w = termWidth();\n  const indent = ' '.repeat(Math.max(0, Math.min(pad, Math.max(0, w - 1))));\n  const markerRoom = Math.max(0, w - width(indent) - 1);\n  const head = fit(marker, markerRoom);\n  const lead = width(indent) + width(head);\n  const withTail = w - lead - width(tail);\n  if (tail && withTail > MIN_PATH) return indent + head + fit(value, withTail) + tail;\n  return indent + head + fit(value, Math.max(0, w - lead));\n}\n\nconst glyphs = () => (process.platform === 'win32' && !process.env.WT_SESSION ? RAMP_ASCII : RAMP_UNICODE);\n\n// The strongest signal a number gets, as a fraction of the largest, in five\n// steps. Zero is always the blank cell rather than the faintest mark: \"nothing\"\n// and \"a little\" are different facts, and a heat grid that gives zero a speck of\n// ink makes every map look busier than it is.\n//\n// Returns the *character*, always a string — an early version returned the\n// number 0 for \"empty\", which then blew up on `.padEnd()` the first time a\n// genuinely-zero cell was drawn, i.e. only on repos with real structure.\nfunction step(value, max) {\n  const ramp = glyphs();\n  if (!value || max <= 0) return ramp[0];\n  const i = Math.min(ramp.length - 1, Math.max(1, Math.ceil((value / max) * (ramp.length - 1))));\n  return ramp[i];\n}\n\nexport { step };\n\n// A horizontal bar, sized as a fraction of the largest value. Exported so every\n// ranked list draws its bars identically instead of each view re-deriving the\n// scale and drifting.\nexport function bar(value, max, room) {\n  if (room <= 0 || !value || max <= 0) return '';\n  const ramp = glyphs();\n  const full = Math.max(1, Math.round((value / max) * room));\n  return ramp[ramp.length - 1].repeat(Math.min(room, full));\n}\n\n// A vertical bar chart, because some questions are about magnitude across\n// categories and reading them off a horizontal list is harder than it needs to\n// be. Columns collapse to a single row when the terminal is too narrow to hold\n// them, rather than drawing a squeezed, unreadable grid.\nexport function columns(items, { room = 40, rows = 10 }: Record<string, any> = {}) {\n  if (!items.length) return [];\n  const width = Math.max(1, Math.min(items.length, room));\n  const stepSize = Math.ceil(items.length / width);\n  const shown = stepSize > 1 ? items.filter((_, i) => i % stepSize === 0).slice(0, width) : items;\n  const top = Math.max(...shown.map((i) => i.value)) || 1;\n  const solid = glyphs()[glyphs().length - 1];\n  const out = [];\n  for (let level = rows; level >= 1; level--) {\n    const threshold = (level / rows) * top;\n    const line = shown.map((i) => (i.value >= threshold ? solid : ' ')).join('');\n    if (line.trim()) out.push('  ' + line);\n  }\n  out.push('  ' + shown.map((i) => String(i.label).slice(0, 1)).join(''));\n  return out;\n}\n\n// The folder-to-folder coupling grid, as a matrix. Row label, then one cell per\n// folder, heaviest traffic darkest. Columns are addressed by letter so a cell\n// can be named rather than counted. The diagonal is blank: a folder's traffic\n// with itself is not coupling, it is just being that folder.\nexport function couplingGrid(repo, { maxFolders = 8, columns: cols }: Record<string, any> = {}) {\n  const matrix = repo.coupling;\n  if (!matrix || !matrix.folders.length) return [];\n  const folders = matrix.folders.slice(0, maxFolders);\n  const w = cols || termWidth();\n  const labelRoom = Math.min(18, Math.max(...folders.map((f) => f.length)) + 1);\n  const cellRoom = Math.max(1, Math.floor((w - labelRoom - 4) / folders.length));\n  const cellW = Math.max(1, Math.min(2, cellRoom));\n\n  const head = ' '.repeat(labelRoom) + folders.map((_, i) => String.fromCharCode(65 + i).padEnd(cellW)).join('');\n  // The rule is sized to the grid but never past the terminal, so a very narrow\n  // window gets a short rule rather than a wrapped one.\n  const rule = '─'.repeat(Math.max(1, Math.min(labelRoom + folders.length * cellW, Math.max(1, w - 2))));\n  const out = ['  ' + fit(head, w - 2), '  ' + rule];\n\n  folders.forEach((from, r) => {\n    let line = fit(from, labelRoom);\n    folders.forEach((to, c) => {\n      if (r === c) {\n        line += ' '.repeat(cellW);\n        return;\n      }\n      const n = matrix.counts.get(from + '->' + to) || 0;\n      line += step(n, matrix.max).padEnd(cellW);\n    });\n    out.push('  ' + fit(line, w - 2));\n  });\n  return out;\n}\n\n// A dependency tree rooted at a file, drawn as a tree with the one piece of\n// information that makes a tree readable — which way each edge points. This is\n// the terminal's answer to the site's force-directed graph: a browser can show\n// every edge at once, a terminal cannot, so it shows the part that answers \"what\n// breaks if I break this\".\n//\n// The `seen` set makes the walk terminate on a cyclic graph — without it, a\n// two-file import cycle would recurse until the stack gave out. The cost is that\n// a file reached by two different paths is drawn only under the first, which is\n// the right trade for a bounded tree.\nexport function depTree(repo, rootPath, { depth = 2, direction = 'both', room }: Record<string, any> = {}) {\n  const w = room || termWidth();\n  const out = [];\n  const seen = new Set([rootPath]);\n\n  const walk = (path, prefix, left, arrow) => {\n    out.push(fit(prefix + arrow + ' ' + path, w - 2));\n    if (left <= 0) return;\n\n    const kids = [];\n    if (direction !== 'up') {\n      for (const child of repo.facts.importsOf[path] || []) {\n        if (!seen.has(child)) kids.push({ path: child, arrow: '→' });\n      }\n    }\n    if (direction !== 'down') {\n      for (const parent of repo.facts.importers[path] || []) {\n        if (!seen.has(parent)) kids.push({ path: parent, arrow: '←' });\n      }\n    }\n    kids.forEach((k, i) => {\n      if (seen.has(k.path)) return;\n      seen.add(k.path);\n      walk(k.path, prefix + (i === kids.length - 1 ? '  ' : '│ '), left - 1, k.arrow);\n    });\n  };\n\n  walk(rootPath, '', depth, '●');\n  return out;\n}\n"]}

package/cli/explorer/picker.d.ts

@@ -0,0 +1,22 @@
+export type PickerResult = {
+    done: true;
+    target: string | null;
+    message: string;
+} | {
+    done: false;
+    message: string;
+};
+/** A prompt-driven folder picker that can share an existing readline session. */
+export declare class SourcePicker {
+    private mode;
+    private location;
+    private page;
+    private directories;
+    private readonly pageSize;
+    constructor(start?: string);
+    get prompt(): string;
+    view(): Promise<string>;
+    choose(input: string): Promise<PickerResult>;
+    private browseView;
+    private validateTarget;
+}

package/cli/explorer/picker.js

@@ -0,0 +1,150 @@
+import { promises as fs } from 'node:fs';
+import os from 'node:os';
+import path from 'node:path';
+function render(lines) {
+    const width = Math.max(1, Number(process.env.COLUMNS) || process.stdout.columns || 80);
+    return lines.map((line) => {
+        const chars = [...line];
+        if (chars.length <= width)
+            return line;
+        const lead = Math.ceil((width - 1) * 0.4);
+        return chars.slice(0, lead).join('') + '…' + chars.slice(chars.length - (width - 1 - lead)).join('');
+    }).join('\n');
+}
+/** A prompt-driven folder picker that can share an existing readline session. */
+export class SourcePicker {
+    mode = 'menu';
+    location;
+    page = 0;
+    directories = [];
+    pageSize = 12;
+    constructor(start = process.cwd()) {
+        this.location = path.resolve(start);
+    }
+    get prompt() { return '  choose > '; }
+    async view() {
+        if (this.mode === 'menu')
+            return render([
+                '',
+                '  SELECT A REPOSITORY',
+                `  1  Use current folder  ${this.location}`,
+                '  2  Browse folders on this device',
+                '  3  Enter a folder path or Git URL',
+                '  q  Cancel',
+                '',
+            ]);
+        if (this.mode === 'entry')
+            return render([
+                '',
+                '  Enter an existing folder path or a Git URL.',
+                '  Examples: ~/Projects/my-app  ·  https://github.com/org/repo',
+                '  Type `back` to return to the menu.',
+                '',
+            ]);
+        return this.browseView();
+    }
+    async choose(input) {
+        const value = input.trim();
+        if (value === 'q' || value === 'quit' || value === 'cancel') {
+            return { done: true, target: null, message: '  Selection cancelled.' };
+        }
+        if (this.mode === 'menu') {
+            if (value === '1' || value === '')
+                return { done: true, target: this.location, message: '' };
+            if (value === '2') {
+                this.mode = 'browse';
+                this.page = 0;
+                return { done: false, message: await this.view() };
+            }
+            if (value === '3') {
+                this.mode = 'entry';
+                return { done: false, message: await this.view() };
+            }
+            // A pasted path or URL should work immediately, without selecting 3 first.
+            return this.validateTarget(value);
+        }
+        if (this.mode === 'entry') {
+            if (value === 'back' || !value) {
+                this.mode = 'menu';
+                return { done: false, message: await this.view() };
+            }
+            return this.validateTarget(value);
+        }
+        if (value === 'back') {
+            this.mode = 'menu';
+            return { done: false, message: await this.view() };
+        }
+        if (value === 'home') {
+            this.location = os.homedir();
+            this.page = 0;
+            return { done: false, message: await this.view() };
+        }
+        if (value === '..') {
+            this.location = path.dirname(this.location);
+            this.page = 0;
+            return { done: false, message: await this.view() };
+        }
+        if (value === 'use' || value === '.')
+            return { done: true, target: this.location, message: '' };
+        if (value === 'n' && (this.page + 1) * this.pageSize < this.directories.length) {
+            this.page++;
+            return { done: false, message: await this.view() };
+        }
+        if (value === 'p' && this.page > 0) {
+            this.page--;
+            return { done: false, message: await this.view() };
+        }
+        const number = Number(value);
+        if (Number.isInteger(number) && number >= 1 && number <= this.pageSize) {
+            const selected = this.directories[this.page * this.pageSize + number - 1];
+            if (selected) {
+                this.location = path.join(this.location, selected);
+                this.page = 0;
+                return { done: false, message: await this.view() };
+            }
+        }
+        if (value) {
+            const result = await this.validateTarget(value);
+            if (result.done)
+                return result;
+        }
+        return { done: false, message: '  Choose a listed folder, `use`, `..`, `home`, or paste a path.' };
+    }
+    async browseView() {
+        try {
+            const entries = await fs.readdir(this.location, { withFileTypes: true });
+            this.directories = entries.filter((entry) => entry.isDirectory()).map((entry) => entry.name)
+                .sort((a, b) => a.localeCompare(b));
+        }
+        catch (error) {
+            this.mode = 'menu';
+            const message = error instanceof Error ? error.message : String(error);
+            return `  Cannot browse ${this.location}: ${message}\n${await this.view()}`;
+        }
+        const pages = Math.max(1, Math.ceil(this.directories.length / this.pageSize));
+        this.page = Math.min(this.page, pages - 1);
+        const shown = this.directories.slice(this.page * this.pageSize, (this.page + 1) * this.pageSize);
+        return render([
+            '',
+            `  FOLDERS  ${this.location}`,
+            ...shown.map((name, index) => `  ${String(index + 1).padStart(2)}  ${name}/`),
+            ...(shown.length ? [] : ['  No subfolders here.']),
+            `  Page ${this.page + 1}/${pages}  ·  n/p next/previous`,
+            '  use  Select this folder    ..  Parent    home  Home    back  Menu',
+            '',
+        ]);
+    }
+    async validateTarget(value) {
+        if (/^(https?:\/\/|git@|ssh:\/\/)/i.test(value)) {
+            return { done: true, target: value, message: '' };
+        }
+        const expanded = value === '~' ? os.homedir() : value.startsWith('~/')
+            ? path.join(os.homedir(), value.slice(2)) : value;
+        const target = path.resolve(expanded);
+        const stat = await fs.stat(target).catch(() => null);
+        if (stat?.isDirectory())
+            return { done: true, target, message: '' };
+        return { done: false, message: `  No folder found at ${target}. Try another path or back.` };
+    }
+}
+//# sourceMappingURL=picker.js.map

package/cli/explorer/picker.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"picker.js","sourceRoot":"","sources":["../../src/cli/explorer/picker.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,IAAI,EAAE,EAAE,MAAM,SAAS,CAAC;AACzC,OAAO,EAAE,MAAM,SAAS,CAAC;AACzB,OAAO,IAAI,MAAM,WAAW,CAAC;AAI7B,SAAS,MAAM,CAAC,KAAe;IAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,OAAO,CAAC,MAAM,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;IACvF,OAAO,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACxB,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;QACxB,IAAI,KAAK,CAAC,MAAM,IAAI,KAAK;YAAE,OAAO,IAAI,CAAC;QACvC,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC;QAC1C,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACvG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAChB,CAAC;AAMD,iFAAiF;AACjF,MAAM,OAAO,YAAY;IACf,IAAI,GAAS,MAAM,CAAC;IACpB,QAAQ,CAAS;IACjB,IAAI,GAAG,CAAC,CAAC;IACT,WAAW,GAAa,EAAE,CAAC;IAClB,QAAQ,GAAG,EAAE,CAAC;IAE/B,YAAY,KAAK,GAAG,OAAO,CAAC,GAAG,EAAE;QAC/B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC;IACtC,CAAC;IAED,IAAI,MAAM,KAAa,OAAO,aAAa,CAAC,CAAC,CAAC;IAE9C,KAAK,CAAC,IAAI;QACR,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM;YAAE,OAAO,MAAM,CAAC;gBACtC,EAAE;gBACF,uBAAuB;gBACvB,4BAA4B,IAAI,CAAC,QAAQ,EAAE;gBAC3C,oCAAoC;gBACpC,qCAAqC;gBACrC,aAAa;gBACb,EAAE;aACH,CAAC,CAAC;QACH,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO;YAAE,OAAO,MAAM,CAAC;gBACvC,EAAE;gBACF,+CAA+C;gBAC/C,+DAA+D;gBAC/D,sCAAsC;gBACtC,EAAE;aACH,CAAC,CAAC;QACH,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC;IAC3B,CAAC;IAED,KAAK,CAAC,MAAM,CAAC,KAAa;QACxB,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC;QAC3B,IAAI,KAAK,KAAK,GAAG,IAAI,KAAK,KAAK,MAAM,IAAI,KAAK,KAAK,QAAQ,EAAE,CAAC;YAC5D,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,OAAO,EAAE,wBAAwB,EAAE,CAAC;QACzE,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YACzB,IAAI,KAAK,KAAK,GAAG,IAAI,KAAK,KAAK,EAAE;gBAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;YAC7F,IAAI,KAAK,KAAK,GAAG,EAAE,CAAC;gBAClB,IAAI,CAAC,IAAI,GAAG,QAAQ,CAAC;gBACrB,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;gBACd,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACrD,CAAC;YACD,IAAI,KAAK,KAAK,GAAG,EAAE,CAAC;gBAClB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;gBACpB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACrD,CAAC;YACD,2EAA2E;YAC3E,OAAO,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QACpC,CAAC;QACD,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC1B,IAAI,KAAK,KAAK,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;gBAC/B,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC;gBACnB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACrD,CAAC;YACD,OAAO,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;QACpC,CAAC;QACD,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC;YACrB,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC;YACnB,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QACrD,CAAC;QACD,IAAI,KAAK,KAAK,MAAM,EAAE,CAAC;YACrB,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YACd,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QACrD,CAAC;QACD,IAAI,KAAK,KAAK,IAAI,EAAE,CAAC;YACnB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC5C,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;YACd,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QACrD,CAAC;QACD,IAAI,KAAK,KAAK,KAAK,IAAI,KAAK,KAAK,GAAG;YAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,QAAQ,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;QAChG,IAAI,KAAK,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;YAC/E,IAAI,CAAC,IAAI,EAAE,CAAC;YACZ,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QACrD,CAAC;QACD,IAAI,KAAK,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YACnC,IAAI,CAAC,IAAI,EAAE,CAAC;YACZ,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QACrD,CAAC;QACD,MAAM,MAAM,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC;QAC7B,IAAI,MAAM,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,MAAM,IAAI,CAAC,IAAI,MAAM,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACvE,MAAM,QAAQ,GAAG,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC;YAC1E,IAAI,QAAQ,EAAE,CAAC;gBACb,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;gBACnD,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC;gBACd,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,MAAM,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YACrD,CAAC;QACH,CAAC;QACD,IAAI,KAAK,EAAE,CAAC;YACV,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,cAAc,CAAC,KAAK,CAAC,CAAC;YAChD,IAAI,MAAM,CAAC,IAAI;gBAAE,OAAO,MAAM,CAAC;QACjC,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,iEAAiE,EAAE,CAAC;IACrG,CAAC;IAEO,KAAK,CAAC,UAAU;QACtB,IAAI,CAAC;YACH,MAAM,OAAO,GAAG,MAAM,EAAE,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,EAAE,EAAE,aAAa,EAAE,IAAI,EAAE,CAAC,CAAC;YACzE,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC;iBACzF,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,CAAC;QACxC,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,IAAI,CAAC,IAAI,GAAG,MAAM,CAAC;YACnB,MAAM,OAAO,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACvE,OAAO,mBAAmB,IAAI,CAAC,QAAQ,KAAK,OAAO,KAAK,MAAM,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QAC9E,CAAC;QACD,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC;QAC9E,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAC3C,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,QAAQ,EAAE,CAAC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC;QACjG,OAAO,MAAM,CAAC;YACZ,EAAE;YACF,cAAc,IAAI,CAAC,QAAQ,EAAE;YAC7B,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,KAAK,EAAE,EAAE,CAAC,KAAK,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,KAAK,IAAI,GAAG,CAAC;YAC7E,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC;YAClD,UAAU,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,KAAK,wBAAwB;YACxD,qEAAqE;YACrE,EAAE;SACH,CAAC,CAAC;IACL,CAAC;IAEO,KAAK,CAAC,cAAc,CAAC,KAAa;QACxC,IAAI,+BAA+B,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YAChD,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;QACpD,CAAC;QACD,MAAM,QAAQ,GAAG,KAAK,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC;YACpE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,OAAO,EAAE,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QACtC,MAAM,IAAI,GAAG,MAAM,EAAE,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC;QACrD,IAAI,IAAI,EAAE,WAAW,EAAE;YAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,EAAE,CAAC;QACpE,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,wBAAwB,MAAM,6BAA6B,EAAE,CAAC;IAC/F,CAAC;CACF","sourcesContent":["import { promises as fs } from 'node:fs';\nimport os from 'node:os';\nimport path from 'node:path';\n\ntype Mode = 'menu' | 'browse' | 'entry';\n\nfunction render(lines: string[]): string {\n  const width = Math.max(1, Number(process.env.COLUMNS) || process.stdout.columns || 80);\n  return lines.map((line) => {\n    const chars = [...line];\n    if (chars.length <= width) return line;\n    const lead = Math.ceil((width - 1) * 0.4);\n    return chars.slice(0, lead).join('') + '…' + chars.slice(chars.length - (width - 1 - lead)).join('');\n  }).join('\\n');\n}\n\nexport type PickerResult =\n  | { done: true; target: string | null; message: string }\n  | { done: false; message: string };\n\n/** A prompt-driven folder picker that can share an existing readline session. */\nexport class SourcePicker {\n  private mode: Mode = 'menu';\n  private location: string;\n  private page = 0;\n  private directories: string[] = [];\n  private readonly pageSize = 12;\n\n  constructor(start = process.cwd()) {\n    this.location = path.resolve(start);\n  }\n\n  get prompt(): string { return '  choose > '; }\n\n  async view(): Promise<string> {\n    if (this.mode === 'menu') return render([\n      '',\n      '  SELECT A REPOSITORY',\n      `  1  Use current folder  ${this.location}`,\n      '  2  Browse folders on this device',\n      '  3  Enter a folder path or Git URL',\n      '  q  Cancel',\n      '',\n    ]);\n    if (this.mode === 'entry') return render([\n      '',\n      '  Enter an existing folder path or a Git URL.',\n      '  Examples: ~/Projects/my-app  ·  https://github.com/org/repo',\n      '  Type `back` to return to the menu.',\n      '',\n    ]);\n    return this.browseView();\n  }\n\n  async choose(input: string): Promise<PickerResult> {\n    const value = input.trim();\n    if (value === 'q' || value === 'quit' || value === 'cancel') {\n      return { done: true, target: null, message: '  Selection cancelled.' };\n    }\n    if (this.mode === 'menu') {\n      if (value === '1' || value === '') return { done: true, target: this.location, message: '' };\n      if (value === '2') {\n        this.mode = 'browse';\n        this.page = 0;\n        return { done: false, message: await this.view() };\n      }\n      if (value === '3') {\n        this.mode = 'entry';\n        return { done: false, message: await this.view() };\n      }\n      // A pasted path or URL should work immediately, without selecting 3 first.\n      return this.validateTarget(value);\n    }\n    if (this.mode === 'entry') {\n      if (value === 'back' || !value) {\n        this.mode = 'menu';\n        return { done: false, message: await this.view() };\n      }\n      return this.validateTarget(value);\n    }\n    if (value === 'back') {\n      this.mode = 'menu';\n      return { done: false, message: await this.view() };\n    }\n    if (value === 'home') {\n      this.location = os.homedir();\n      this.page = 0;\n      return { done: false, message: await this.view() };\n    }\n    if (value === '..') {\n      this.location = path.dirname(this.location);\n      this.page = 0;\n      return { done: false, message: await this.view() };\n    }\n    if (value === 'use' || value === '.') return { done: true, target: this.location, message: '' };\n    if (value === 'n' && (this.page + 1) * this.pageSize < this.directories.length) {\n      this.page++;\n      return { done: false, message: await this.view() };\n    }\n    if (value === 'p' && this.page > 0) {\n      this.page--;\n      return { done: false, message: await this.view() };\n    }\n    const number = Number(value);\n    if (Number.isInteger(number) && number >= 1 && number <= this.pageSize) {\n      const selected = this.directories[this.page * this.pageSize + number - 1];\n      if (selected) {\n        this.location = path.join(this.location, selected);\n        this.page = 0;\n        return { done: false, message: await this.view() };\n      }\n    }\n    if (value) {\n      const result = await this.validateTarget(value);\n      if (result.done) return result;\n    }\n    return { done: false, message: '  Choose a listed folder, `use`, `..`, `home`, or paste a path.' };\n  }\n\n  private async browseView(): Promise<string> {\n    try {\n      const entries = await fs.readdir(this.location, { withFileTypes: true });\n      this.directories = entries.filter((entry) => entry.isDirectory()).map((entry) => entry.name)\n        .sort((a, b) => a.localeCompare(b));\n    } catch (error) {\n      this.mode = 'menu';\n      const message = error instanceof Error ? error.message : String(error);\n      return `  Cannot browse ${this.location}: ${message}\\n${await this.view()}`;\n    }\n    const pages = Math.max(1, Math.ceil(this.directories.length / this.pageSize));\n    this.page = Math.min(this.page, pages - 1);\n    const shown = this.directories.slice(this.page * this.pageSize, (this.page + 1) * this.pageSize);\n    return render([\n      '',\n      `  FOLDERS  ${this.location}`,\n      ...shown.map((name, index) => `  ${String(index + 1).padStart(2)}  ${name}/`),\n      ...(shown.length ? [] : ['  No subfolders here.']),\n      `  Page ${this.page + 1}/${pages}  ·  n/p next/previous`,\n      '  use  Select this folder    ..  Parent    home  Home    back  Menu',\n      '',\n    ]);\n  }\n\n  private async validateTarget(value: string): Promise<PickerResult> {\n    if (/^(https?:\\/\\/|git@|ssh:\\/\\/)/i.test(value)) {\n      return { done: true, target: value, message: '' };\n    }\n    const expanded = value === '~' ? os.homedir() : value.startsWith('~/')\n      ? path.join(os.homedir(), value.slice(2)) : value;\n    const target = path.resolve(expanded);\n    const stat = await fs.stat(target).catch(() => null);\n    if (stat?.isDirectory()) return { done: true, target, message: '' };\n    return { done: false, message: `  No folder found at ${target}. Try another path or back.` };\n  }\n}\n"]}

package/cli/explorer/report.d.ts

@@ -0,0 +1,85 @@
+/** A stable, small snapshot for scripts and CI. It contains no source text. */
+export interface RepositoryReport {
+    schemaVersion: 1;
+    repository: {
+        name: string;
+        root: string;
+    };
+    scan: {
+        parsedFiles: number;
+        skipped: number;
+        partial: boolean;
+        imports: {
+            total: number;
+            internal: number;
+            external: number;
+            unresolved: number;
+            confidence: number;
+        };
+    };
+    architecture: {
+        entryPoints: string[];
+        cycles: number;
+        topHubs: Array<{
+            path: string;
+            importedBy: number;
+        }>;
+    };
+    health: {
+        grade: string;
+        score: number;
+        riskiestFiles: Array<{
+            path: string;
+            risk: number;
+        }>;
+    };
+    security: {
+        grade: string;
+        findings: number;
+    };
+    testReachability: {
+        reachable: number;
+        sourceFiles: number;
+        percent: number;
+    };
+}
+interface RepositoryInput {
+    name: string;
+    root: string;
+    scan: {
+        stats: {
+            filesParsed: number;
+            skipped: number;
+            truncated: unknown;
+            imports: RepositoryReport['scan']['imports'];
+        };
+    };
+    facts: {
+        entries: string[];
+        cycles: unknown[];
+        hubs: Array<{
+            path: string;
+            fanIn: number;
+        }>;
+        testCoverage: {
+            testedCount: number;
+            totalNonTest: number;
+            ratio: number;
+        };
+    };
+    health: {
+        grade: string;
+        score: number;
+        perFile: Array<{
+            path: string;
+            risk: number;
+        }>;
+    };
+    security: {
+        grade: string;
+        total: number;
+    };
+}
+export declare function createReport(repo: RepositoryInput): RepositoryReport;
+export declare function formatReport(report: RepositoryReport): string;
+export {};

package/cli/explorer/report.js

@@ -0,0 +1,60 @@
+export function createReport(repo) {
+    const stats = repo.scan.stats;
+    return {
+        schemaVersion: 1,
+        repository: { name: repo.name, root: repo.root },
+        scan: {
+            parsedFiles: stats.filesParsed,
+            skipped: stats.skipped,
+            partial: Boolean(stats.truncated),
+            imports: {
+                total: stats.imports.total,
+                internal: stats.imports.internal,
+                external: stats.imports.external,
+                unresolved: stats.imports.unresolved,
+                confidence: stats.imports.confidence,
+            },
+        },
+        architecture: {
+            entryPoints: repo.facts.entries,
+            cycles: repo.facts.cycles.length,
+            topHubs: repo.facts.hubs.slice(0, 5).map((hub) => ({ path: hub.path, importedBy: hub.fanIn })),
+        },
+        health: {
+            grade: repo.health.grade,
+            score: repo.health.score,
+            riskiestFiles: repo.health.perFile.slice(0, 5).map(({ path, risk }) => ({ path, risk })),
+        },
+        security: { grade: repo.security.grade, findings: repo.security.total },
+        testReachability: {
+            reachable: repo.facts.testCoverage.testedCount,
+            sourceFiles: repo.facts.testCoverage.totalNonTest,
+            percent: repo.facts.testCoverage.ratio,
+        },
+    };
+}
+export function formatReport(report) {
+    const lines = [
+        `${report.repository.name} — codebase report`,
+        report.repository.root,
+        '',
+        `Files             ${report.scan.parsedFiles} parsed${report.scan.partial ? ' (partial scan)' : ''}, ${report.scan.skipped} skipped`,
+        `Imports           ${report.scan.imports.internal} internal, ${report.scan.imports.external} external, ${report.scan.imports.unresolved} unresolved (${report.scan.imports.confidence}% placed)`,
+        `Architecture      ${report.architecture.entryPoints.length} entry points, ${report.architecture.cycles} cycles`,
+        `Health            ${report.health.grade} (${report.health.score}/100)`,
+        `Security          ${report.security.grade} (${report.security.findings} heuristic findings)`,
+        `Test reachability ${report.testReachability.reachable}/${report.testReachability.sourceFiles} source files (${report.testReachability.percent}%)`,
+    ];
+    if (report.architecture.topHubs.length) {
+        lines.push('', 'Most imported files');
+        for (const hub of report.architecture.topHubs)
+            lines.push(`  ${hub.path}  (${hub.importedBy} importers)`);
+    }
+    if (report.health.riskiestFiles.length) {
+        lines.push('', 'Highest risk files');
+        for (const file of report.health.riskiestFiles)
+            lines.push(`  ${file.path}  (risk ${file.risk})`);
+    }
+    return lines.join('\n');
+}
+//# sourceMappingURL=report.js.map