@teambit/component-issues 0.0.170 → 0.0.171

package/circular-dependencies.ts

@@ -2,7 +2,7 @@ import { ComponentIssue, formatTitle } from './component-issue';
 
 export class CircularDependencies extends ComponentIssue {
   description = 'circular dependencies';
-  solution = 'run `bit insights "circular"` to get the component-ids participating in the circular';
+  solution = 'run `bit deps circular` to get the component-ids participating in the circular';
   data: boolean;
   isTagBlocker = true;
   outputForCLI() {

package/dist/circular-dependencies.js

@@ -13,7 +13,7 @@ function _componentIssue() {
 }
 class CircularDependencies extends _componentIssue().ComponentIssue {
   description = 'circular dependencies';
-  solution = 'run `bit insights "circular"` to get the component-ids participating in the circular';
+  solution = 'run `bit deps circular` to get the component-ids participating in the circular';
   isTagBlocker = true;
   outputForCLI() {
     return (0, _componentIssue().formatTitle)(this.descriptionWithSolution, false);

package/dist/circular-dependencies.js.map

@@ -1 +1 @@
-{"version":3,"names":["_componentIssue","data","require","CircularDependencies","ComponentIssue","description","solution","isTagBlocker","outputForCLI","formatTitle","descriptionWithSolution","exports"],"sources":["circular-dependencies.ts"],"sourcesContent":["import { ComponentIssue, formatTitle } from './component-issue';\n\nexport class CircularDependencies extends ComponentIssue {\n  description = 'circular dependencies';\n  solution = 'run `bit insights \"circular\"` to get the component-ids participating in the circular';\n  data: boolean;\n  isTagBlocker = true;\n  outputForCLI() {\n    return formatTitle(this.descriptionWithSolution, false);\n  }\n}\n"],"mappings":";;;;;;AAAA,SAAAA,gBAAA;EAAA,MAAAC,IAAA,GAAAC,OAAA;EAAAF,eAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAEO,MAAME,oBAAoB,SAASC,gCAAc,CAAC;EACvDC,WAAW,GAAG,uBAAuB;EACrCC,QAAQ,GAAG,sFAAsF;EAEjGC,YAAY,GAAG,IAAI;EACnBC,YAAYA,CAAA,EAAG;IACb,OAAO,IAAAC,6BAAW,EAAC,IAAI,CAACC,uBAAuB,EAAE,KAAK,CAAC;EACzD;AACF;AAACC,OAAA,CAAAR,oBAAA,GAAAA,oBAAA","ignoreList":[]}
+{"version":3,"names":["_componentIssue","data","require","CircularDependencies","ComponentIssue","description","solution","isTagBlocker","outputForCLI","formatTitle","descriptionWithSolution","exports"],"sources":["circular-dependencies.ts"],"sourcesContent":["import { ComponentIssue, formatTitle } from './component-issue';\n\nexport class CircularDependencies extends ComponentIssue {\n  description = 'circular dependencies';\n  solution = 'run `bit deps circular` to get the component-ids participating in the circular';\n  data: boolean;\n  isTagBlocker = true;\n  outputForCLI() {\n    return formatTitle(this.descriptionWithSolution, false);\n  }\n}\n"],"mappings":";;;;;;AAAA,SAAAA,gBAAA;EAAA,MAAAC,IAAA,GAAAC,OAAA;EAAAF,eAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAEO,MAAME,oBAAoB,SAASC,gCAAc,CAAC;EACvDC,WAAW,GAAG,uBAAuB;EACrCC,QAAQ,GAAG,gFAAgF;EAE3FC,YAAY,GAAG,IAAI;EACnBC,YAAYA,CAAA,EAAG;IACb,OAAO,IAAAC,6BAAW,EAAC,IAAI,CAACC,uBAAuB,EAAE,KAAK,CAAC;EACzD;AACF;AAACC,OAAA,CAAAR,oBAAA,GAAAA,oBAAA","ignoreList":[]}

package/dist/index.d.ts

@@ -3,3 +3,4 @@ export { ISSUE_FORMAT_SPACE as MISSING_DEPS_SPACE, ComponentIssue } from './comp
 export { UntrackedFileDependencyEntry, MISSING_NESTED_DEPS_SPACE } from './untracked-dependencies';
 export { RelativeComponentsAuthoredEntry } from './relative-components-authored';
 export type { MissingPackagesData } from './missing-packages-dependencies-on-fs';
+export { renderCycles } from './render-cycles';

package/dist/index.js

@@ -51,6 +51,12 @@ Object.defineProperty(exports, "UntrackedFileDependencyEntry", {
     return _untrackedDependencies().UntrackedFileDependencyEntry;
   }
 });
+Object.defineProperty(exports, "renderCycles", {
+  enumerable: true,
+  get: function () {
+    return _renderCycles().renderCycles;
+  }
+});
 function _issuesList() {
   const data = require("./issues-list");
   _issuesList = function () {
@@ -79,5 +85,12 @@ function _relativeComponentsAuthored() {
   };
   return data;
 }
+function _renderCycles() {
+  const data = require("./render-cycles");
+  _renderCycles = function () {
+    return data;
+  };
+  return data;
+}
 
 //# sourceMappingURL=index.js.map

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"names":["_issuesList","data","require","_componentIssue","_untrackedDependencies","_relativeComponentsAuthored"],"sources":["index.ts"],"sourcesContent":["export { IssuesList, IssuesClasses, IssuesNames } from './issues-list';\nexport { ISSUE_FORMAT_SPACE as MISSING_DEPS_SPACE, ComponentIssue } from './component-issue';\nexport { UntrackedFileDependencyEntry, MISSING_NESTED_DEPS_SPACE } from './untracked-dependencies';\nexport { RelativeComponentsAuthoredEntry } from './relative-components-authored';\nexport type { MissingPackagesData } from './missing-packages-dependencies-on-fs';\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,SAAAA,YAAA;EAAA,MAAAC,IAAA,GAAAC,OAAA;EAAAF,WAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAE,gBAAA;EAAA,MAAAF,IAAA,GAAAC,OAAA;EAAAC,eAAA,YAAAA,CAAA;IAAA,OAAAF,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAG,uBAAA;EAAA,MAAAH,IAAA,GAAAC,OAAA;EAAAE,sBAAA,YAAAA,CAAA;IAAA,OAAAH,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAI,4BAAA;EAAA,MAAAJ,IAAA,GAAAC,OAAA;EAAAG,2BAAA,YAAAA,CAAA;IAAA,OAAAJ,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA","ignoreList":[]}
+{"version":3,"names":["_issuesList","data","require","_componentIssue","_untrackedDependencies","_relativeComponentsAuthored","_renderCycles"],"sources":["index.ts"],"sourcesContent":["export { IssuesList, IssuesClasses, IssuesNames } from './issues-list';\nexport { ISSUE_FORMAT_SPACE as MISSING_DEPS_SPACE, ComponentIssue } from './component-issue';\nexport { UntrackedFileDependencyEntry, MISSING_NESTED_DEPS_SPACE } from './untracked-dependencies';\nexport { RelativeComponentsAuthoredEntry } from './relative-components-authored';\nexport type { MissingPackagesData } from './missing-packages-dependencies-on-fs';\nexport { renderCycles } from './render-cycles';\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,SAAAA,YAAA;EAAA,MAAAC,IAAA,GAAAC,OAAA;EAAAF,WAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAE,gBAAA;EAAA,MAAAF,IAAA,GAAAC,OAAA;EAAAC,eAAA,YAAAA,CAAA;IAAA,OAAAF,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAG,uBAAA;EAAA,MAAAH,IAAA,GAAAC,OAAA;EAAAE,sBAAA,YAAAA,CAAA;IAAA,OAAAH,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAI,4BAAA;EAAA,MAAAJ,IAAA,GAAAC,OAAA;EAAAG,2BAAA,YAAAA,CAAA;IAAA,OAAAJ,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAEA,SAAAK,cAAA;EAAA,MAAAL,IAAA,GAAAC,OAAA;EAAAI,aAAA,YAAAA,CAAA;IAAA,OAAAL,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA","ignoreList":[]}

package/dist/render-cycles.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Render an array of cycles (each cycle is an array of component-id strings with the
+ * first element duplicated at the end) into a human-readable string with ASCII diagrams.
+ */
+export declare function renderCycles(cycles: string[][]): string;

package/dist/render-cycles.js

@@ -0,0 +1,151 @@
+"use strict";
+
+Object.defineProperty(exports, "__esModule", {
+  value: true
+});
+exports.renderCycles = renderCycles;
+function _chalk() {
+  const data = _interopRequireDefault(require("chalk"));
+  _chalk = function () {
+    return data;
+  };
+  return data;
+}
+function _interopRequireDefault(e) { return e && e.__esModule ? e : { default: e }; }
+const MAX_HORIZONTAL_WIDTH = 90;
+const ARROW = '  ───>  ';
+const ARROW_LEN = 8;
+function shortenNames(cycle) {
+  // cycle has the first element duplicated at the end; work with unique entries
+  const unique = cycle.slice(0, -1);
+
+  // extract scope: everything up to and including the last '/' before the component name
+  // e.g. "my-org.scope/ui/button@0.0.1" → scope "my-org.scope/ui", name "button", ver "0.0.1"
+  const parsed = unique.map(id => {
+    const atIdx = id.lastIndexOf('@');
+    const version = atIdx > 0 ? id.slice(atIdx + 1) : undefined;
+    const withoutVer = atIdx > 0 ? id.slice(0, atIdx) : id;
+    const slashIdx = withoutVer.lastIndexOf('/');
+    const scope = slashIdx > 0 ? withoutVer.slice(0, slashIdx) : undefined;
+    const name = slashIdx > 0 ? withoutVer.slice(slashIdx + 1) : withoutVer;
+    return {
+      scope,
+      name,
+      version
+    };
+  });
+
+  // common scope: only if ALL entries share the same scope
+  const scopes = new Set(parsed.map(p => p.scope));
+  const commonScope = scopes.size === 1 ? parsed[0].scope : undefined;
+
+  // common version: only if ALL entries share the same version
+  const versions = new Set(parsed.map(p => p.version));
+  const commonVersion = versions.size === 1 ? parsed[0].version : undefined;
+  const names = parsed.map(p => {
+    let display = commonScope ? p.name : p.scope ? `${p.scope}/${p.name}` : p.name;
+    if (!commonVersion && p.version) {
+      display += `@${p.version}`;
+    }
+    return display;
+  });
+  return {
+    names,
+    scope: commonScope,
+    version: commonVersion
+  };
+}
+function renderHeader(cycleIndex, totalCycles, componentCount, scope, version) {
+  const isSelf = componentCount === 1;
+  let header = '';
+  if (totalCycles > 1 && cycleIndex !== undefined) {
+    header += `Cycle ${cycleIndex + 1} of ${totalCycles}`;
+  } else {
+    header += 'Cycle';
+  }
+  header += isSelf ? ' - self-dependency' : ` - ${componentCount} components`;
+  if (scope) header += `   (scope: ${scope})`;
+  if (version) header += `  @${version}`;
+  return _chalk().default.bold(header);
+}
+function renderSelfCycle(name) {
+  return `  ${_chalk().default.cyan(name)}  ⟲`;
+}
+function renderHorizontal(names) {
+  // build chain: name0  ───>  name1  ───>  name2
+  const chainParts = [];
+  const plainParts = [];
+  for (let i = 0; i < names.length; i++) {
+    chainParts.push(_chalk().default.cyan(names[i]));
+    plainParts.push(names[i]);
+    if (i < names.length - 1) {
+      chainParts.push(_chalk().default.dim(ARROW));
+      plainParts.push(ARROW);
+    }
+  }
+  const chainStr = chainParts.join('');
+  const plainLen = plainParts.join('').length;
+
+  // the last segment connects to the closing edge: ───┘
+  const closingSuffix = _chalk().default.red('  ───┘');
+  const closingSuffixLen = 6; // "  ───┘"
+
+  const totalWidth = plainLen + closingSuffixLen;
+
+  // top bar spans from above ▼ (column 0) to the ┐ (at totalWidth - 1)
+  const topBar = _chalk().default.red('┌') + _chalk().default.red('─'.repeat(totalWidth - 2)) + _chalk().default.red('┐');
+  const sideLine = ' '.repeat(totalWidth - 1) + _chalk().default.red('│');
+  const entryArrow = _chalk().default.red('▼') + ' '.repeat(totalWidth - 2) + _chalk().default.red('│');
+  const lines = [topBar, sideLine, entryArrow, chainStr + closingSuffix];
+  return lines.join('\n');
+}
+function renderVertical(names) {
+  const lines = [];
+  for (let i = 0; i < names.length; i++) {
+    lines.push(_chalk().default.cyan(names[i]));
+    if (i < names.length - 1) {
+      lines.push(_chalk().default.dim('  │'));
+      lines.push(_chalk().default.dim('  ▼'));
+    }
+  }
+  // back-edge to start
+  lines.push(_chalk().default.red(`  ╰───▶ `) + _chalk().default.cyan(names[0]) + _chalk().default.dim('  (back to start)'));
+  return lines.join('\n');
+}
+
+/**
+ * Render an array of cycles (each cycle is an array of component-id strings with the
+ * first element duplicated at the end) into a human-readable string with ASCII diagrams.
+ */
+function renderCycles(cycles) {
+  if (!cycles.length) {
+    return 'No circular dependencies found';
+  }
+  const totalCycles = cycles.length;
+  const blocks = cycles.map((cycle, idx) => {
+    const componentCount = cycle.length - 1; // last entry is duplicate of first
+    const {
+      names,
+      scope,
+      version
+    } = shortenNames(cycle);
+    const cycleIndex = totalCycles > 1 ? idx : undefined;
+    const header = renderHeader(cycleIndex, totalCycles, componentCount, scope, version);
+    let body;
+    if (componentCount === 1) {
+      body = renderSelfCycle(names[0]);
+    } else {
+      const chainPlainLen = names.reduce((sum, n) => sum + n.length, 0) + (names.length - 1) * ARROW_LEN;
+      const horizontalWidth = chainPlainLen + 6; // + closing "  ───┘"
+      if (horizontalWidth <= MAX_HORIZONTAL_WIDTH) {
+        body = renderHorizontal(names);
+      } else {
+        body = renderVertical(names);
+      }
+    }
+    return `${header}\n\n${body}`;
+  });
+  return '\n' + blocks.join('\n\n') + '\n';
+}
+
+//# sourceMappingURL=render-cycles.js.map

package/dist/render-cycles.js.map

@@ -0,0 +1 @@
+{"version":3,"names":["_chalk","data","_interopRequireDefault","require","e","__esModule","default","MAX_HORIZONTAL_WIDTH","ARROW","ARROW_LEN","shortenNames","cycle","unique","slice","parsed","map","id","atIdx","lastIndexOf","version","undefined","withoutVer","slashIdx","scope","name","scopes","Set","p","commonScope","size","versions","commonVersion","names","display","renderHeader","cycleIndex","totalCycles","componentCount","isSelf","header","chalk","bold","renderSelfCycle","cyan","renderHorizontal","chainParts","plainParts","i","length","push","dim","chainStr","join","plainLen","closingSuffix","red","closingSuffixLen","totalWidth","topBar","repeat","sideLine","entryArrow","lines","renderVertical","renderCycles","cycles","blocks","idx","body","chainPlainLen","reduce","sum","n","horizontalWidth"],"sources":["render-cycles.ts"],"sourcesContent":["import chalk from 'chalk';\n\nconst MAX_HORIZONTAL_WIDTH = 90;\nconst ARROW = '  ───>  ';\nconst ARROW_LEN = 8;\n\ntype ShortenedInfo = {\n  names: string[];\n  scope: string | undefined;\n  version: string | undefined;\n};\n\nfunction shortenNames(cycle: string[]): ShortenedInfo {\n  // cycle has the first element duplicated at the end; work with unique entries\n  const unique = cycle.slice(0, -1);\n\n  // extract scope: everything up to and including the last '/' before the component name\n  // e.g. \"my-org.scope/ui/button@0.0.1\" → scope \"my-org.scope/ui\", name \"button\", ver \"0.0.1\"\n  const parsed = unique.map((id) => {\n    const atIdx = id.lastIndexOf('@');\n    const version = atIdx > 0 ? id.slice(atIdx + 1) : undefined;\n    const withoutVer = atIdx > 0 ? id.slice(0, atIdx) : id;\n    const slashIdx = withoutVer.lastIndexOf('/');\n    const scope = slashIdx > 0 ? withoutVer.slice(0, slashIdx) : undefined;\n    const name = slashIdx > 0 ? withoutVer.slice(slashIdx + 1) : withoutVer;\n    return { scope, name, version };\n  });\n\n  // common scope: only if ALL entries share the same scope\n  const scopes = new Set(parsed.map((p) => p.scope));\n  const commonScope = scopes.size === 1 ? parsed[0].scope : undefined;\n\n  // common version: only if ALL entries share the same version\n  const versions = new Set(parsed.map((p) => p.version));\n  const commonVersion = versions.size === 1 ? parsed[0].version : undefined;\n\n  const names = parsed.map((p) => {\n    let display = commonScope ? p.name : p.scope ? `${p.scope}/${p.name}` : p.name;\n    if (!commonVersion && p.version) {\n      display += `@${p.version}`;\n    }\n    return display;\n  });\n\n  return { names, scope: commonScope, version: commonVersion };\n}\n\nfunction renderHeader(\n  cycleIndex: number | undefined,\n  totalCycles: number,\n  componentCount: number,\n  scope: string | undefined,\n  version: string | undefined\n): string {\n  const isSelf = componentCount === 1;\n  let header = '';\n\n  if (totalCycles > 1 && cycleIndex !== undefined) {\n    header += `Cycle ${cycleIndex + 1} of ${totalCycles}`;\n  } else {\n    header += 'Cycle';\n  }\n\n  header += isSelf ? ' - self-dependency' : ` - ${componentCount} components`;\n\n  if (scope) header += `   (scope: ${scope})`;\n  if (version) header += `  @${version}`;\n\n  return chalk.bold(header);\n}\n\nfunction renderSelfCycle(name: string): string {\n  return `  ${chalk.cyan(name)}  ⟲`;\n}\n\nfunction renderHorizontal(names: string[]): string {\n  // build chain: name0  ───>  name1  ───>  name2\n  const chainParts: string[] = [];\n  const plainParts: string[] = [];\n  for (let i = 0; i < names.length; i++) {\n    chainParts.push(chalk.cyan(names[i]));\n    plainParts.push(names[i]);\n    if (i < names.length - 1) {\n      chainParts.push(chalk.dim(ARROW));\n      plainParts.push(ARROW);\n    }\n  }\n\n  const chainStr = chainParts.join('');\n  const plainLen = plainParts.join('').length;\n\n  // the last segment connects to the closing edge: ───┘\n  const closingSuffix = chalk.red('  ───┘');\n  const closingSuffixLen = 6; // \"  ───┘\"\n\n  const totalWidth = plainLen + closingSuffixLen;\n\n  // top bar spans from above ▼ (column 0) to the ┐ (at totalWidth - 1)\n  const topBar = chalk.red('┌') + chalk.red('─'.repeat(totalWidth - 2)) + chalk.red('┐');\n  const sideLine = ' '.repeat(totalWidth - 1) + chalk.red('│');\n  const entryArrow = chalk.red('▼') + ' '.repeat(totalWidth - 2) + chalk.red('│');\n\n  const lines = [topBar, sideLine, entryArrow, chainStr + closingSuffix];\n  return lines.join('\\n');\n}\n\nfunction renderVertical(names: string[]): string {\n  const lines: string[] = [];\n  for (let i = 0; i < names.length; i++) {\n    lines.push(chalk.cyan(names[i]));\n    if (i < names.length - 1) {\n      lines.push(chalk.dim('  │'));\n      lines.push(chalk.dim('  ▼'));\n    }\n  }\n  // back-edge to start\n  lines.push(chalk.red(`  ╰───▶ `) + chalk.cyan(names[0]) + chalk.dim('  (back to start)'));\n  return lines.join('\\n');\n}\n\n/**\n * Render an array of cycles (each cycle is an array of component-id strings with the\n * first element duplicated at the end) into a human-readable string with ASCII diagrams.\n */\nexport function renderCycles(cycles: string[][]): string {\n  if (!cycles.length) {\n    return 'No circular dependencies found';\n  }\n  const totalCycles = cycles.length;\n  const blocks = cycles.map((cycle, idx) => {\n    const componentCount = cycle.length - 1; // last entry is duplicate of first\n    const { names, scope, version } = shortenNames(cycle);\n    const cycleIndex = totalCycles > 1 ? idx : undefined;\n    const header = renderHeader(cycleIndex, totalCycles, componentCount, scope, version);\n\n    let body: string;\n    if (componentCount === 1) {\n      body = renderSelfCycle(names[0]);\n    } else {\n      const chainPlainLen = names.reduce((sum, n) => sum + n.length, 0) + (names.length - 1) * ARROW_LEN;\n      const horizontalWidth = chainPlainLen + 6; // + closing \"  ───┘\"\n      if (horizontalWidth <= MAX_HORIZONTAL_WIDTH) {\n        body = renderHorizontal(names);\n      } else {\n        body = renderVertical(names);\n      }\n    }\n\n    return `${header}\\n\\n${body}`;\n  });\n\n  return '\\n' + blocks.join('\\n\\n') + '\\n';\n}\n"],"mappings":";;;;;;AAAA,SAAAA,OAAA;EAAA,MAAAC,IAAA,GAAAC,sBAAA,CAAAC,OAAA;EAAAH,MAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAA0B,SAAAC,uBAAAE,CAAA,WAAAA,CAAA,IAAAA,CAAA,CAAAC,UAAA,GAAAD,CAAA,KAAAE,OAAA,EAAAF,CAAA;AAE1B,MAAMG,oBAAoB,GAAG,EAAE;AAC/B,MAAMC,KAAK,GAAG,UAAU;AACxB,MAAMC,SAAS,GAAG,CAAC;AAQnB,SAASC,YAAYA,CAACC,KAAe,EAAiB;EACpD;EACA,MAAMC,MAAM,GAAGD,KAAK,CAACE,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;;EAEjC;EACA;EACA,MAAMC,MAAM,GAAGF,MAAM,CAACG,GAAG,CAAEC,EAAE,IAAK;IAChC,MAAMC,KAAK,GAAGD,EAAE,CAACE,WAAW,CAAC,GAAG,CAAC;IACjC,MAAMC,OAAO,GAAGF,KAAK,GAAG,CAAC,GAAGD,EAAE,CAACH,KAAK,CAACI,KAAK,GAAG,CAAC,CAAC,GAAGG,SAAS;IAC3D,MAAMC,UAAU,GAAGJ,KAAK,GAAG,CAAC,GAAGD,EAAE,CAACH,KAAK,CAAC,CAAC,EAAEI,KAAK,CAAC,GAAGD,EAAE;IACtD,MAAMM,QAAQ,GAAGD,UAAU,CAACH,WAAW,CAAC,GAAG,CAAC;IAC5C,MAAMK,KAAK,GAAGD,QAAQ,GAAG,CAAC,GAAGD,UAAU,CAACR,KAAK,CAAC,CAAC,EAAES,QAAQ,CAAC,GAAGF,SAAS;IACtE,MAAMI,IAAI,GAAGF,QAAQ,GAAG,CAAC,GAAGD,UAAU,CAACR,KAAK,CAACS,QAAQ,GAAG,CAAC,CAAC,GAAGD,UAAU;IACvE,OAAO;MAAEE,KAAK;MAAEC,IAAI;MAAEL;IAAQ,CAAC;EACjC,CAAC,CAAC;;EAEF;EACA,MAAMM,MAAM,GAAG,IAAIC,GAAG,CAACZ,MAAM,CAACC,GAAG,CAAEY,CAAC,IAAKA,CAAC,CAACJ,KAAK,CAAC,CAAC;EAClD,MAAMK,WAAW,GAAGH,MAAM,CAACI,IAAI,KAAK,CAAC,GAAGf,MAAM,CAAC,CAAC,CAAC,CAACS,KAAK,GAAGH,SAAS;;EAEnE;EACA,MAAMU,QAAQ,GAAG,IAAIJ,GAAG,CAACZ,MAAM,CAACC,GAAG,CAAEY,CAAC,IAAKA,CAAC,CAACR,OAAO,CAAC,CAAC;EACtD,MAAMY,aAAa,GAAGD,QAAQ,CAACD,IAAI,KAAK,CAAC,GAAGf,MAAM,CAAC,CAAC,CAAC,CAACK,OAAO,GAAGC,SAAS;EAEzE,MAAMY,KAAK,GAAGlB,MAAM,CAACC,GAAG,CAAEY,CAAC,IAAK;IAC9B,IAAIM,OAAO,GAAGL,WAAW,GAAGD,CAAC,CAACH,IAAI,GAAGG,CAAC,CAACJ,KAAK,GAAG,GAAGI,CAAC,CAACJ,KAAK,IAAII,CAAC,CAACH,IAAI,EAAE,GAAGG,CAAC,CAACH,IAAI;IAC9E,IAAI,CAACO,aAAa,IAAIJ,CAAC,CAACR,OAAO,EAAE;MAC/Bc,OAAO,IAAI,IAAIN,CAAC,CAACR,OAAO,EAAE;IAC5B;IACA,OAAOc,OAAO;EAChB,CAAC,CAAC;EAEF,OAAO;IAAED,KAAK;IAAET,KAAK,EAAEK,WAAW;IAAET,OAAO,EAAEY;EAAc,CAAC;AAC9D;AAEA,SAASG,YAAYA,CACnBC,UAA8B,EAC9BC,WAAmB,EACnBC,cAAsB,EACtBd,KAAyB,EACzBJ,OAA2B,EACnB;EACR,MAAMmB,MAAM,GAAGD,cAAc,KAAK,CAAC;EACnC,IAAIE,MAAM,GAAG,EAAE;EAEf,IAAIH,WAAW,GAAG,CAAC,IAAID,UAAU,KAAKf,SAAS,EAAE;IAC/CmB,MAAM,IAAI,SAASJ,UAAU,GAAG,CAAC,OAAOC,WAAW,EAAE;EACvD,CAAC,MAAM;IACLG,MAAM,IAAI,OAAO;EACnB;EAEAA,MAAM,IAAID,MAAM,GAAG,oBAAoB,GAAG,MAAMD,cAAc,aAAa;EAE3E,IAAId,KAAK,EAAEgB,MAAM,IAAI,cAAchB,KAAK,GAAG;EAC3C,IAAIJ,OAAO,EAAEoB,MAAM,IAAI,MAAMpB,OAAO,EAAE;EAEtC,OAAOqB,gBAAK,CAACC,IAAI,CAACF,MAAM,CAAC;AAC3B;AAEA,SAASG,eAAeA,CAAClB,IAAY,EAAU;EAC7C,OAAO,KAAKgB,gBAAK,CAACG,IAAI,CAACnB,IAAI,CAAC,KAAK;AACnC;AAEA,SAASoB,gBAAgBA,CAACZ,KAAe,EAAU;EACjD;EACA,MAAMa,UAAoB,GAAG,EAAE;EAC/B,MAAMC,UAAoB,GAAG,EAAE;EAC/B,KAAK,IAAIC,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGf,KAAK,CAACgB,MAAM,EAAED,CAAC,EAAE,EAAE;IACrCF,UAAU,CAACI,IAAI,CAACT,gBAAK,CAACG,IAAI,CAACX,KAAK,CAACe,CAAC,CAAC,CAAC,CAAC;IACrCD,UAAU,CAACG,IAAI,CAACjB,KAAK,CAACe,CAAC,CAAC,CAAC;IACzB,IAAIA,CAAC,GAAGf,KAAK,CAACgB,MAAM,GAAG,CAAC,EAAE;MACxBH,UAAU,CAACI,IAAI,CAACT,gBAAK,CAACU,GAAG,CAAC1C,KAAK,CAAC,CAAC;MACjCsC,UAAU,CAACG,IAAI,CAACzC,KAAK,CAAC;IACxB;EACF;EAEA,MAAM2C,QAAQ,GAAGN,UAAU,CAACO,IAAI,CAAC,EAAE,CAAC;EACpC,MAAMC,QAAQ,GAAGP,UAAU,CAACM,IAAI,CAAC,EAAE,CAAC,CAACJ,MAAM;;EAE3C;EACA,MAAMM,aAAa,GAAGd,gBAAK,CAACe,GAAG,CAAC,QAAQ,CAAC;EACzC,MAAMC,gBAAgB,GAAG,CAAC,CAAC,CAAC;;EAE5B,MAAMC,UAAU,GAAGJ,QAAQ,GAAGG,gBAAgB;;EAE9C;EACA,MAAME,MAAM,GAAGlB,gBAAK,CAACe,GAAG,CAAC,GAAG,CAAC,GAAGf,gBAAK,CAACe,GAAG,CAAC,GAAG,CAACI,MAAM,CAACF,UAAU,GAAG,CAAC,CAAC,CAAC,GAAGjB,gBAAK,CAACe,GAAG,CAAC,GAAG,CAAC;EACtF,MAAMK,QAAQ,GAAG,GAAG,CAACD,MAAM,CAACF,UAAU,GAAG,CAAC,CAAC,GAAGjB,gBAAK,CAACe,GAAG,CAAC,GAAG,CAAC;EAC5D,MAAMM,UAAU,GAAGrB,gBAAK,CAACe,GAAG,CAAC,GAAG,CAAC,GAAG,GAAG,CAACI,MAAM,CAACF,UAAU,GAAG,CAAC,CAAC,GAAGjB,gBAAK,CAACe,GAAG,CAAC,GAAG,CAAC;EAE/E,MAAMO,KAAK,GAAG,CAACJ,MAAM,EAAEE,QAAQ,EAAEC,UAAU,EAAEV,QAAQ,GAAGG,aAAa,CAAC;EACtE,OAAOQ,KAAK,CAACV,IAAI,CAAC,IAAI,CAAC;AACzB;AAEA,SAASW,cAAcA,CAAC/B,KAAe,EAAU;EAC/C,MAAM8B,KAAe,GAAG,EAAE;EAC1B,KAAK,IAAIf,CAAC,GAAG,CAAC,EAAEA,CAAC,GAAGf,KAAK,CAACgB,MAAM,EAAED,CAAC,EAAE,EAAE;IACrCe,KAAK,CAACb,IAAI,CAACT,gBAAK,CAACG,IAAI,CAACX,KAAK,CAACe,CAAC,CAAC,CAAC,CAAC;IAChC,IAAIA,CAAC,GAAGf,KAAK,CAACgB,MAAM,GAAG,CAAC,EAAE;MACxBc,KAAK,CAACb,IAAI,CAACT,gBAAK,CAACU,GAAG,CAAC,KAAK,CAAC,CAAC;MAC5BY,KAAK,CAACb,IAAI,CAACT,gBAAK,CAACU,GAAG,CAAC,KAAK,CAAC,CAAC;IAC9B;EACF;EACA;EACAY,KAAK,CAACb,IAAI,CAACT,gBAAK,CAACe,GAAG,CAAC,UAAU,CAAC,GAAGf,gBAAK,CAACG,IAAI,CAACX,KAAK,CAAC,CAAC,CAAC,CAAC,GAAGQ,gBAAK,CAACU,GAAG,CAAC,mBAAmB,CAAC,CAAC;EACzF,OAAOY,KAAK,CAACV,IAAI,CAAC,IAAI,CAAC;AACzB;;AAEA;AACA;AACA;AACA;AACO,SAASY,YAAYA,CAACC,MAAkB,EAAU;EACvD,IAAI,CAACA,MAAM,CAACjB,MAAM,EAAE;IAClB,OAAO,gCAAgC;EACzC;EACA,MAAMZ,WAAW,GAAG6B,MAAM,CAACjB,MAAM;EACjC,MAAMkB,MAAM,GAAGD,MAAM,CAAClD,GAAG,CAAC,CAACJ,KAAK,EAAEwD,GAAG,KAAK;IACxC,MAAM9B,cAAc,GAAG1B,KAAK,CAACqC,MAAM,GAAG,CAAC,CAAC,CAAC;IACzC,MAAM;MAAEhB,KAAK;MAAET,KAAK;MAAEJ;IAAQ,CAAC,GAAGT,YAAY,CAACC,KAAK,CAAC;IACrD,MAAMwB,UAAU,GAAGC,WAAW,GAAG,CAAC,GAAG+B,GAAG,GAAG/C,SAAS;IACpD,MAAMmB,MAAM,GAAGL,YAAY,CAACC,UAAU,EAAEC,WAAW,EAAEC,cAAc,EAAEd,KAAK,EAAEJ,OAAO,CAAC;IAEpF,IAAIiD,IAAY;IAChB,IAAI/B,cAAc,KAAK,CAAC,EAAE;MACxB+B,IAAI,GAAG1B,eAAe,CAACV,KAAK,CAAC,CAAC,CAAC,CAAC;IAClC,CAAC,MAAM;MACL,MAAMqC,aAAa,GAAGrC,KAAK,CAACsC,MAAM,CAAC,CAACC,GAAG,EAAEC,CAAC,KAAKD,GAAG,GAAGC,CAAC,CAACxB,MAAM,EAAE,CAAC,CAAC,GAAG,CAAChB,KAAK,CAACgB,MAAM,GAAG,CAAC,IAAIvC,SAAS;MAClG,MAAMgE,eAAe,GAAGJ,aAAa,GAAG,CAAC,CAAC,CAAC;MAC3C,IAAII,eAAe,IAAIlE,oBAAoB,EAAE;QAC3C6D,IAAI,GAAGxB,gBAAgB,CAACZ,KAAK,CAAC;MAChC,CAAC,MAAM;QACLoC,IAAI,GAAGL,cAAc,CAAC/B,KAAK,CAAC;MAC9B;IACF;IAEA,OAAO,GAAGO,MAAM,OAAO6B,IAAI,EAAE;EAC/B,CAAC,CAAC;EAEF,OAAO,IAAI,GAAGF,MAAM,CAACd,IAAI,CAAC,MAAM,CAAC,GAAG,IAAI;AAC1C","ignoreList":[]}

package/index.ts

@@ -3,3 +3,4 @@ export { ISSUE_FORMAT_SPACE as MISSING_DEPS_SPACE, ComponentIssue } from './comp
 export { UntrackedFileDependencyEntry, MISSING_NESTED_DEPS_SPACE } from './untracked-dependencies';
 export { RelativeComponentsAuthoredEntry } from './relative-components-authored';
 export type { MissingPackagesData } from './missing-packages-dependencies-on-fs';
+export { renderCycles } from './render-cycles';

package/package.json

@@ -1,12 +1,12 @@
 {
   "name": "@teambit/component-issues",
-  "version": "0.0.170",
+  "version": "0.0.171",
   "homepage": "https://bit.cloud/teambit/component/component-issues",
   "main": "dist/index.js",
   "componentId": {
     "scope": "teambit.component",
     "name": "component-issues",
-    "version": "0.0.170"
+    "version": "0.0.171"
   },
   "dependencies": {
     "chalk": "4.1.2",

package/render-cycles.ts

@@ -0,0 +1,153 @@
+import chalk from 'chalk';
+
+const MAX_HORIZONTAL_WIDTH = 90;
+const ARROW = '  ───>  ';
+const ARROW_LEN = 8;
+
+type ShortenedInfo = {
+  names: string[];
+  scope: string | undefined;
+  version: string | undefined;
+};
+
+function shortenNames(cycle: string[]): ShortenedInfo {
+  // cycle has the first element duplicated at the end; work with unique entries
+  const unique = cycle.slice(0, -1);
+
+  // extract scope: everything up to and including the last '/' before the component name
+  // e.g. "my-org.scope/ui/button@0.0.1" → scope "my-org.scope/ui", name "button", ver "0.0.1"
+  const parsed = unique.map((id) => {
+    const atIdx = id.lastIndexOf('@');
+    const version = atIdx > 0 ? id.slice(atIdx + 1) : undefined;
+    const withoutVer = atIdx > 0 ? id.slice(0, atIdx) : id;
+    const slashIdx = withoutVer.lastIndexOf('/');
+    const scope = slashIdx > 0 ? withoutVer.slice(0, slashIdx) : undefined;
+    const name = slashIdx > 0 ? withoutVer.slice(slashIdx + 1) : withoutVer;
+    return { scope, name, version };
+  });
+
+  // common scope: only if ALL entries share the same scope
+  const scopes = new Set(parsed.map((p) => p.scope));
+  const commonScope = scopes.size === 1 ? parsed[0].scope : undefined;
+
+  // common version: only if ALL entries share the same version
+  const versions = new Set(parsed.map((p) => p.version));
+  const commonVersion = versions.size === 1 ? parsed[0].version : undefined;
+
+  const names = parsed.map((p) => {
+    let display = commonScope ? p.name : p.scope ? `${p.scope}/${p.name}` : p.name;
+    if (!commonVersion && p.version) {
+      display += `@${p.version}`;
+    }
+    return display;
+  });
+
+  return { names, scope: commonScope, version: commonVersion };
+}
+
+function renderHeader(
+  cycleIndex: number | undefined,
+  totalCycles: number,
+  componentCount: number,
+  scope: string | undefined,
+  version: string | undefined
+): string {
+  const isSelf = componentCount === 1;
+  let header = '';
+
+  if (totalCycles > 1 && cycleIndex !== undefined) {
+    header += `Cycle ${cycleIndex + 1} of ${totalCycles}`;
+  } else {
+    header += 'Cycle';
+  }
+
+  header += isSelf ? ' - self-dependency' : ` - ${componentCount} components`;
+
+  if (scope) header += `   (scope: ${scope})`;
+  if (version) header += `  @${version}`;
+
+  return chalk.bold(header);
+}
+
+function renderSelfCycle(name: string): string {
+  return `  ${chalk.cyan(name)}  ⟲`;
+}
+
+function renderHorizontal(names: string[]): string {
+  // build chain: name0  ───>  name1  ───>  name2
+  const chainParts: string[] = [];
+  const plainParts: string[] = [];
+  for (let i = 0; i < names.length; i++) {
+    chainParts.push(chalk.cyan(names[i]));
+    plainParts.push(names[i]);
+    if (i < names.length - 1) {
+      chainParts.push(chalk.dim(ARROW));
+      plainParts.push(ARROW);
+    }
+  }
+
+  const chainStr = chainParts.join('');
+  const plainLen = plainParts.join('').length;
+
+  // the last segment connects to the closing edge: ───┘
+  const closingSuffix = chalk.red('  ───┘');
+  const closingSuffixLen = 6; // "  ───┘"
+
+  const totalWidth = plainLen + closingSuffixLen;
+
+  // top bar spans from above ▼ (column 0) to the ┐ (at totalWidth - 1)
+  const topBar = chalk.red('┌') + chalk.red('─'.repeat(totalWidth - 2)) + chalk.red('┐');
+  const sideLine = ' '.repeat(totalWidth - 1) + chalk.red('│');
+  const entryArrow = chalk.red('▼') + ' '.repeat(totalWidth - 2) + chalk.red('│');
+
+  const lines = [topBar, sideLine, entryArrow, chainStr + closingSuffix];
+  return lines.join('\n');
+}
+
+function renderVertical(names: string[]): string {
+  const lines: string[] = [];
+  for (let i = 0; i < names.length; i++) {
+    lines.push(chalk.cyan(names[i]));
+    if (i < names.length - 1) {
+      lines.push(chalk.dim('  │'));
+      lines.push(chalk.dim('  ▼'));
+    }
+  }
+  // back-edge to start
+  lines.push(chalk.red(`  ╰───▶ `) + chalk.cyan(names[0]) + chalk.dim('  (back to start)'));
+  return lines.join('\n');
+}
+
+/**
+ * Render an array of cycles (each cycle is an array of component-id strings with the
+ * first element duplicated at the end) into a human-readable string with ASCII diagrams.
+ */
+export function renderCycles(cycles: string[][]): string {
+  if (!cycles.length) {
+    return 'No circular dependencies found';
+  }
+  const totalCycles = cycles.length;
+  const blocks = cycles.map((cycle, idx) => {
+    const componentCount = cycle.length - 1; // last entry is duplicate of first
+    const { names, scope, version } = shortenNames(cycle);
+    const cycleIndex = totalCycles > 1 ? idx : undefined;
+    const header = renderHeader(cycleIndex, totalCycles, componentCount, scope, version);
+
+    let body: string;
+    if (componentCount === 1) {
+      body = renderSelfCycle(names[0]);
+    } else {
+      const chainPlainLen = names.reduce((sum, n) => sum + n.length, 0) + (names.length - 1) * ARROW_LEN;
+      const horizontalWidth = chainPlainLen + 6; // + closing "  ───┘"
+      if (horizontalWidth <= MAX_HORIZONTAL_WIDTH) {
+        body = renderHorizontal(names);
+      } else {
+        body = renderVertical(names);
+      }
+    }
+
+    return `${header}\n\n${body}`;
+  });
+
+  return '\n' + blocks.join('\n\n') + '\n';
+}