@vltpkg/graph 0.0.0-3 → 0.0.0-30

package/dist/esm/uninstall.d.ts

@@ -1,10 +1,8 @@
-import type { PackageInfoClientOptions } from '@vltpkg/package-info';
-import type { PackageJson } from '@vltpkg/package-json';
+import type { PackageInfoClient } from '@vltpkg/package-info';
 import type { LoadOptions } from './actual/load.ts';
 import type { RemoveImportersDependenciesMap } from './dependencies.ts';
-export type UninstallOptions = PackageInfoClientOptions & LoadOptions & {
-    projectRoot: string;
-    packageJson: PackageJson;
+export type UninstallOptions = LoadOptions & {
+    packageInfo: PackageInfoClient;
 };
 export declare const uninstall: (options: UninstallOptions, remove?: RemoveImportersDependenciesMap) => Promise<{
     graph: import("./graph.ts").Graph;

package/dist/esm/uninstall.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"uninstall.d.ts","sourceRoot":"","sources":["../../src/uninstall.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,wBAAwB,EAAE,MAAM,sBAAsB,CAAA;AAEpE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAA;AACvD,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAA;AAEnD,OAAO,KAAK,EAAE,8BAA8B,EAAE,MAAM,mBAAmB,CAAA;AAIvE,MAAM,MAAM,gBAAgB,GAAG,wBAAwB,GACrD,WAAW,GAAG;IACZ,WAAW,EAAE,MAAM,CAAA;IACnB,WAAW,EAAE,WAAW,CAAA;CACzB,CAAA;AAEH,eAAO,MAAM,SAAS,YACX,gBAAgB,WAChB,8BAA8B;;;EA0BxC,CAAA"}
+{"version":3,"file":"uninstall.d.ts","sourceRoot":"","sources":["../../src/uninstall.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAC7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAA;AAEnD,OAAO,KAAK,EAAE,8BAA8B,EAAE,MAAM,mBAAmB,CAAA;AAIvE,MAAM,MAAM,gBAAgB,GAAG,WAAW,GAAG;IAC3C,WAAW,EAAE,iBAAiB,CAAA;CAC/B,CAAA;AAED,eAAO,MAAM,SAAS,YACX,gBAAgB,WAChB,8BAA8B;;;EAwBxC,CAAA"}

package/dist/esm/uninstall.js

@@ -1,4 +1,3 @@
-import { PackageInfoClient } from '@vltpkg/package-info';
 import { load as actualLoad } from "./actual/load.js";
 import { build as idealBuild } from "./ideal/build.js";
 import { reify } from "./reify/index.js";
@@ -6,7 +5,6 @@ export const uninstall = async (options, remove) => {
     const mainManifest = options.packageJson.read(options.projectRoot);
     const graph = await idealBuild({
         ...options,
-        packageInfo: new PackageInfoClient(options),
         remove,
         mainManifest,
         loadManifests: true,
@@ -18,7 +16,6 @@ export const uninstall = async (options, remove) => {
     });
     const diff = await reify({
         ...options,
-        packageInfo: new PackageInfoClient(options),
         remove,
         actual: act,
         graph,

package/dist/esm/uninstall.js.map

@@ -1 +1 @@
-{"version":3,"file":"uninstall.js","sourceRoot":"","sources":["../../src/uninstall.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAGxD,OAAO,EAAE,IAAI,IAAI,UAAU,EAAE,MAAM,kBAAkB,CAAA;AAErD,OAAO,EAAE,KAAK,IAAI,UAAU,EAAE,MAAM,kBAAkB,CAAA;AACtD,OAAO,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAA;AAQxC,MAAM,CAAC,MAAM,SAAS,GAAG,KAAK,EAC5B,OAAyB,EACzB,MAAuC,EACvC,EAAE;IACF,MAAM,YAAY,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAA;IAElE,MAAM,KAAK,GAAG,MAAM,UAAU,CAAC;QAC7B,GAAG,OAAO;QACV,WAAW,EAAE,IAAI,iBAAiB,CAAC,OAAO,CAAC;QAC3C,MAAM;QACN,YAAY;QACZ,aAAa,EAAE,IAAI;KACpB,CAAC,CAAA;IACF,MAAM,GAAG,GAAG,UAAU,CAAC;QACrB,GAAG,OAAO;QACV,YAAY;QACZ,aAAa,EAAE,IAAI;KACpB,CAAC,CAAA;IACF,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC;QACvB,GAAG,OAAO;QACV,WAAW,EAAE,IAAI,iBAAiB,CAAC,OAAO,CAAC;QAC3C,MAAM;QACN,MAAM,EAAE,GAAG;QACX,KAAK;QACL,aAAa,EAAE,IAAI;KACpB,CAAC,CAAA;IAEF,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;AACxB,CAAC,CAAA","sourcesContent":["import type { PackageInfoClientOptions } from '@vltpkg/package-info'\nimport { PackageInfoClient } from '@vltpkg/package-info'\nimport type { PackageJson } from '@vltpkg/package-json'\nimport type { LoadOptions } from './actual/load.ts'\nimport { load as actualLoad } from './actual/load.ts'\nimport type { RemoveImportersDependenciesMap } from './dependencies.ts'\nimport { build as idealBuild } from './ideal/build.ts'\nimport { reify } from './reify/index.ts'\n\nexport type UninstallOptions = PackageInfoClientOptions &\n  LoadOptions & {\n    projectRoot: string\n    packageJson: PackageJson\n  }\n\nexport const uninstall = async (\n  options: UninstallOptions,\n  remove?: RemoveImportersDependenciesMap,\n) => {\n  const mainManifest = options.packageJson.read(options.projectRoot)\n\n  const graph = await idealBuild({\n    ...options,\n    packageInfo: new PackageInfoClient(options),\n    remove,\n    mainManifest,\n    loadManifests: true,\n  })\n  const act = actualLoad({\n    ...options,\n    mainManifest,\n    loadManifests: true,\n  })\n  const diff = await reify({\n    ...options,\n    packageInfo: new PackageInfoClient(options),\n    remove,\n    actual: act,\n    graph,\n    loadManifests: true,\n  })\n\n  return { graph, diff }\n}\n"]}
+{"version":3,"file":"uninstall.js","sourceRoot":"","sources":["../../src/uninstall.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,IAAI,IAAI,UAAU,EAAE,MAAM,kBAAkB,CAAA;AAErD,OAAO,EAAE,KAAK,IAAI,UAAU,EAAE,MAAM,kBAAkB,CAAA;AACtD,OAAO,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAA;AAMxC,MAAM,CAAC,MAAM,SAAS,GAAG,KAAK,EAC5B,OAAyB,EACzB,MAAuC,EACvC,EAAE;IACF,MAAM,YAAY,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAA;IAElE,MAAM,KAAK,GAAG,MAAM,UAAU,CAAC;QAC7B,GAAG,OAAO;QACV,MAAM;QACN,YAAY;QACZ,aAAa,EAAE,IAAI;KACpB,CAAC,CAAA;IACF,MAAM,GAAG,GAAG,UAAU,CAAC;QACrB,GAAG,OAAO;QACV,YAAY;QACZ,aAAa,EAAE,IAAI;KACpB,CAAC,CAAA;IACF,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC;QACvB,GAAG,OAAO;QACV,MAAM;QACN,MAAM,EAAE,GAAG;QACX,KAAK;QACL,aAAa,EAAE,IAAI;KACpB,CAAC,CAAA;IAEF,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;AACxB,CAAC,CAAA","sourcesContent":["import type { PackageInfoClient } from '@vltpkg/package-info'\nimport type { LoadOptions } from './actual/load.ts'\nimport { load as actualLoad } from './actual/load.ts'\nimport type { RemoveImportersDependenciesMap } from './dependencies.ts'\nimport { build as idealBuild } from './ideal/build.ts'\nimport { reify } from './reify/index.ts'\n\nexport type UninstallOptions = LoadOptions & {\n  packageInfo: PackageInfoClient\n}\n\nexport const uninstall = async (\n  options: UninstallOptions,\n  remove?: RemoveImportersDependenciesMap,\n) => {\n  const mainManifest = options.packageJson.read(options.projectRoot)\n\n  const graph = await idealBuild({\n    ...options,\n    remove,\n    mainManifest,\n    loadManifests: true,\n  })\n  const act = actualLoad({\n    ...options,\n    mainManifest,\n    loadManifests: true,\n  })\n  const diff = await reify({\n    ...options,\n    remove,\n    actual: act,\n    graph,\n    loadManifests: true,\n  })\n\n  return { graph, diff }\n}\n"]}

package/dist/esm/update.d.ts

@@ -0,0 +1,11 @@
+import type { PackageInfoClient } from '@vltpkg/package-info';
+import type { LoadOptions } from './actual/load.ts';
+import { Graph } from './graph.ts';
+export type UpdateOptions = LoadOptions & {
+    packageInfo: PackageInfoClient;
+};
+export declare const update: (options: UpdateOptions) => Promise<{
+    graph: Graph;
+    diff: import("./diff.ts").Diff;
+}>;
+//# sourceMappingURL=update.d.ts.map

package/dist/esm/update.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"update.d.ts","sourceRoot":"","sources":["../../src/update.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAC7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAA;AACnD,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AAGlC,MAAM,MAAM,aAAa,GAAG,WAAW,GAAG;IACxC,WAAW,EAAE,iBAAiB,CAAA;CAC/B,CAAA;AAED,eAAO,MAAM,MAAM,YAAmB,aAAa;;;EA0ClD,CAAA"}

package/dist/esm/update.js

@@ -0,0 +1,49 @@
+import { load as actualLoad } from "./actual/load.js";
+import { buildIdealFromStartingGraph } from "./ideal/build-ideal-from-starting-graph.js";
+import { reify } from "./reify/index.js";
+import { GraphModifier } from "./modifiers.js";
+import { init } from '@vltpkg/init';
+import { asError } from '@vltpkg/types';
+import { Graph } from "./graph.js";
+import { graphStep } from '@vltpkg/output';
+export const update = async (options) => {
+    let mainManifest = undefined;
+    try {
+        mainManifest = options.packageJson.read(options.projectRoot);
+    }
+    catch (err) {
+        if (asError(err).message === 'Could not read package.json file') {
+            await init({ cwd: options.projectRoot });
+            mainManifest = options.packageJson.read(options.projectRoot, {
+                reload: true,
+            });
+        }
+        else {
+            throw err;
+        }
+    }
+    const modifiers = GraphModifier.maybeLoad(options);
+    const done = graphStep('build');
+    const graph = await buildIdealFromStartingGraph({
+        ...options,
+        add: Object.assign(new Map(), { modifiedDependencies: false }),
+        remove: Object.assign(new Map(), { modifiedDependencies: false }),
+        graph: new Graph({ ...options, mainManifest }),
+        modifiers,
+    });
+    done();
+    const act = actualLoad({
+        ...options,
+        mainManifest,
+        loadManifests: true,
+    });
+    const diff = await reify({
+        ...options,
+        actual: act,
+        graph,
+        loadManifests: true,
+        modifiers,
+    });
+    return { graph, diff };
+};
+//# sourceMappingURL=update.js.map

package/dist/esm/update.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"update.js","sourceRoot":"","sources":["../../src/update.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,IAAI,UAAU,EAAE,MAAM,kBAAkB,CAAA;AACrD,OAAO,EAAE,2BAA2B,EAAE,MAAM,4CAA4C,CAAA;AACxF,OAAO,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAA;AACxC,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAA;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AACnC,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAA;AAIvC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AAClC,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAM1C,MAAM,CAAC,MAAM,MAAM,GAAG,KAAK,EAAE,OAAsB,EAAE,EAAE;IACrD,IAAI,YAAY,GAAmC,SAAS,CAAA;IAC5D,IAAI,CAAC;QACH,YAAY,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAA;IAC9D,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,OAAO,KAAK,kCAAkC,EAAE,CAAC;YAChE,MAAM,IAAI,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,WAAW,EAAE,CAAC,CAAA;YACxC,YAAY,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE;gBAC3D,MAAM,EAAE,IAAI;aACb,CAAC,CAAA;QACJ,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,CAAA;QACX,CAAC;IACH,CAAC;IAED,MAAM,SAAS,GAAG,aAAa,CAAC,SAAS,CAAC,OAAO,CAAC,CAAA;IAElD,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,CAAA;IAC/B,MAAM,KAAK,GAAG,MAAM,2BAA2B,CAAC;QAC9C,GAAG,OAAO;QACV,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,EAAE,EAAE,EAAE,oBAAoB,EAAE,KAAK,EAAE,CAAC;QAC9D,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,EAAE,EAAE,EAAE,oBAAoB,EAAE,KAAK,EAAE,CAAC;QACjE,KAAK,EAAE,IAAI,KAAK,CAAC,EAAE,GAAG,OAAO,EAAE,YAAY,EAAE,CAAC;QAC9C,SAAS;KACV,CAAC,CAAA;IACF,IAAI,EAAE,CAAA;IAEN,MAAM,GAAG,GAAG,UAAU,CAAC;QACrB,GAAG,OAAO;QACV,YAAY;QACZ,aAAa,EAAE,IAAI;KACpB,CAAC,CAAA;IAEF,MAAM,IAAI,GAAG,MAAM,KAAK,CAAC;QACvB,GAAG,OAAO;QACV,MAAM,EAAE,GAAG;QACX,KAAK;QACL,aAAa,EAAE,IAAI;QACnB,SAAS;KACV,CAAC,CAAA;IAEF,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;AACxB,CAAC,CAAA","sourcesContent":["import { load as actualLoad } from './actual/load.ts'\nimport { buildIdealFromStartingGraph } from './ideal/build-ideal-from-starting-graph.ts'\nimport { reify } from './reify/index.ts'\nimport { GraphModifier } from './modifiers.ts'\nimport { init } from '@vltpkg/init'\nimport { asError } from '@vltpkg/types'\nimport type { NormalizedManifest } from '@vltpkg/types'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport type { LoadOptions } from './actual/load.ts'\nimport { Graph } from './graph.ts'\nimport { graphStep } from '@vltpkg/output'\n\nexport type UpdateOptions = LoadOptions & {\n  packageInfo: PackageInfoClient\n}\n\nexport const update = async (options: UpdateOptions) => {\n  let mainManifest: NormalizedManifest | undefined = undefined\n  try {\n    mainManifest = options.packageJson.read(options.projectRoot)\n  } catch (err) {\n    if (asError(err).message === 'Could not read package.json file') {\n      await init({ cwd: options.projectRoot })\n      mainManifest = options.packageJson.read(options.projectRoot, {\n        reload: true,\n      })\n    } else {\n      throw err\n    }\n  }\n\n  const modifiers = GraphModifier.maybeLoad(options)\n\n  const done = graphStep('build')\n  const graph = await buildIdealFromStartingGraph({\n    ...options,\n    add: Object.assign(new Map(), { modifiedDependencies: false }),\n    remove: Object.assign(new Map(), { modifiedDependencies: false }),\n    graph: new Graph({ ...options, mainManifest }),\n    modifiers,\n  })\n  done()\n\n  const act = actualLoad({\n    ...options,\n    mainManifest,\n    loadManifests: true,\n  })\n\n  const diff = await reify({\n    ...options,\n    actual: act,\n    graph,\n    loadManifests: true,\n    modifiers,\n  })\n\n  return { graph, diff }\n}\n"]}

package/dist/esm/virtual-root.d.ts

@@ -0,0 +1,16 @@
+import type { SpecOptions } from '@vltpkg/spec/browser';
+import type { NodeLike } from '@vltpkg/types';
+/**
+ * An unique DepID to identify the virtual root node.
+ */
+export declare const VIRTUAL_ROOT_ID: import("@vltpkg/dep-id/browser").DepID;
+/**
+ * A virtual root used to aggregate multiple importers into a single graph.
+ *
+ * This is meant to be used with visual tools that want a single root node
+ * starting point to represent the graph.
+ *
+ * Returns undefined if a virtual root is not needed.
+ */
+export declare const createVirtualRoot: (name: string | undefined, options: SpecOptions, mainImporters: NodeLike[]) => NodeLike | undefined;
+//# sourceMappingURL=virtual-root.d.ts.map

package/dist/esm/virtual-root.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"virtual-root.d.ts","sourceRoot":"","sources":["../../src/virtual-root.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAA;AACvD,OAAO,KAAK,EAAY,QAAQ,EAAa,MAAM,eAAe,CAAA;AAElE;;GAEG;AACH,eAAO,MAAM,eAAe,wCAG1B,CAAA;AAEF;;;;;;;GAOG;AACH,eAAO,MAAM,iBAAiB,sCAEnB,WAAW,iBACL,QAAQ,EAAE,KACxB,QAAQ,GAAG,SA6Db,CAAA"}

package/dist/esm/virtual-root.js

@@ -0,0 +1,78 @@
+import { Spec } from '@vltpkg/spec/browser';
+import { joinDepIDTuple } from '@vltpkg/dep-id/browser';
+/**
+ * An unique DepID to identify the virtual root node.
+ */
+export const VIRTUAL_ROOT_ID = joinDepIDTuple([
+    'file',
+    '__virtual%root__',
+]);
+/**
+ * A virtual root used to aggregate multiple importers into a single graph.
+ *
+ * This is meant to be used with visual tools that want a single root node
+ * starting point to represent the graph.
+ *
+ * Returns undefined if a virtual root is not needed.
+ */
+export const createVirtualRoot = (name = 'virtual-root', options, mainImporters) => {
+    const res = {
+        id: VIRTUAL_ROOT_ID,
+        name,
+        version: '1.0.0',
+        manifest: {
+            name,
+            version: '1.0.0',
+        },
+        edgesIn: new Set(),
+        edgesOut: new Map([]),
+        confused: false,
+        importer: true,
+        mainImporter: true,
+        location: '.',
+        graph: { importers: new Set() },
+        projectRoot: '',
+        dev: false,
+        optional: false,
+        options,
+        setConfusedManifest() { },
+        setResolved() { },
+        maybeSetConfusedManifest() { },
+        workspaces: undefined,
+        toJSON() {
+            return {
+                id: this.id,
+                name: this.name,
+                version: this.version,
+                location: this.location,
+                importer: this.importer,
+                manifest: this.manifest,
+                projectRoot: this.projectRoot,
+                integrity: this.integrity,
+                resolved: this.resolved,
+                dev: this.dev,
+                optional: this.optional,
+                confused: false,
+            };
+        },
+    };
+    // @ts-expect-error
+    res[Symbol.toStringTag] = '@vltpkg/graph.Node';
+    // link all mainImporters to the virtual root
+    for (const importer of mainImporters) {
+        const name = importer.name || '(unknown)';
+        if (importer.mainImporter) {
+            const spec = Spec.parse(name, 'file:.', options);
+            const edge = {
+                name: spec.name,
+                from: res,
+                to: importer,
+                spec,
+                type: 'prod',
+            };
+            res.edgesOut.set(name, edge);
+        }
+    }
+    return res;
+};
+//# sourceMappingURL=virtual-root.js.map

package/dist/esm/virtual-root.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"virtual-root.js","sourceRoot":"","sources":["../../src/virtual-root.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,sBAAsB,CAAA;AAC3C,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAA;AAIvD;;GAEG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,cAAc,CAAC;IAC5C,MAAM;IACN,kBAAkB;CACnB,CAAC,CAAA;AAEF;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAC/B,IAAI,GAAG,cAAc,EACrB,OAAoB,EACpB,aAAyB,EACH,EAAE;IACxB,MAAM,GAAG,GAAG;QACV,EAAE,EAAE,eAAe;QACnB,IAAI;QACJ,OAAO,EAAE,OAAO;QAChB,QAAQ,EAAE;YACR,IAAI;YACJ,OAAO,EAAE,OAAO;SACjB;QACD,OAAO,EAAE,IAAI,GAAG,EAAE;QAClB,QAAQ,EAAE,IAAI,GAAG,CAAmB,EAAE,CAAC;QACvC,QAAQ,EAAE,KAAK;QACf,QAAQ,EAAE,IAAI;QACd,YAAY,EAAE,IAAI;QAClB,QAAQ,EAAE,GAAG;QACb,KAAK,EAAE,EAAE,SAAS,EAAE,IAAI,GAAG,EAAE,EAAe;QAC5C,WAAW,EAAE,EAAE;QACf,GAAG,EAAE,KAAK;QACV,QAAQ,EAAE,KAAK;QACf,OAAO;QACP,mBAAmB,KAAI,CAAC;QACxB,WAAW,KAAI,CAAC;QAChB,wBAAwB,KAAI,CAAC;QAC7B,UAAU,EAAE,SAAS;QACrB,MAAM;YACJ,OAAO;gBACL,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,OAAO,EAAE,IAAI,CAAC,OAAO;gBACrB,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,WAAW,EAAE,IAAI,CAAC,WAAW;gBAC7B,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,GAAG,EAAE,IAAI,CAAC,GAAG;gBACb,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,QAAQ,EAAE,KAAK;aAChB,CAAA;QACH,CAAC;KACiB,CAAA;IAEpB,mBAAmB;IACnB,GAAG,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,oBAAoB,CAAA;IAE9C,6CAA6C;IAC7C,KAAK,MAAM,QAAQ,IAAI,aAAa,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,IAAI,WAAW,CAAA;QACzC,IAAI,QAAQ,CAAC,YAAY,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAA;YAChD,MAAM,IAAI,GAAG;gBACX,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,IAAI,EAAE,GAAG;gBACT,EAAE,EAAE,QAAQ;gBACZ,IAAI;gBACJ,IAAI,EAAE,MAAM;aACM,CAAA;YACpB,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QAC9B,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA","sourcesContent":["import { Spec } from '@vltpkg/spec/browser'\nimport { joinDepIDTuple } from '@vltpkg/dep-id/browser'\nimport type { SpecOptions } from '@vltpkg/spec/browser'\nimport type { EdgeLike, NodeLike, GraphLike } from '@vltpkg/types'\n\n/**\n * An unique DepID to identify the virtual root node.\n */\nexport const VIRTUAL_ROOT_ID = joinDepIDTuple([\n  'file',\n  '__virtual%root__',\n])\n\n/**\n * A virtual root used to aggregate multiple importers into a single graph.\n *\n * This is meant to be used with visual tools that want a single root node\n * starting point to represent the graph.\n *\n * Returns undefined if a virtual root is not needed.\n */\nexport const createVirtualRoot = (\n  name = 'virtual-root',\n  options: SpecOptions,\n  mainImporters: NodeLike[],\n): NodeLike | undefined => {\n  const res = {\n    id: VIRTUAL_ROOT_ID,\n    name,\n    version: '1.0.0',\n    manifest: {\n      name,\n      version: '1.0.0',\n    },\n    edgesIn: new Set(),\n    edgesOut: new Map<string, EdgeLike>([]),\n    confused: false,\n    importer: true,\n    mainImporter: true,\n    location: '.',\n    graph: { importers: new Set() } as GraphLike,\n    projectRoot: '',\n    dev: false,\n    optional: false,\n    options,\n    setConfusedManifest() {},\n    setResolved() {},\n    maybeSetConfusedManifest() {},\n    workspaces: undefined,\n    toJSON() {\n      return {\n        id: this.id,\n        name: this.name,\n        version: this.version,\n        location: this.location,\n        importer: this.importer,\n        manifest: this.manifest,\n        projectRoot: this.projectRoot,\n        integrity: this.integrity,\n        resolved: this.resolved,\n        dev: this.dev,\n        optional: this.optional,\n        confused: false,\n      }\n    },\n  } satisfies NodeLike\n\n  // @ts-expect-error\n  res[Symbol.toStringTag] = '@vltpkg/graph.Node'\n\n  // link all mainImporters to the virtual root\n  for (const importer of mainImporters) {\n    const name = importer.name || '(unknown)'\n    if (importer.mainImporter) {\n      const spec = Spec.parse(name, 'file:.', options)\n      const edge = {\n        name: spec.name,\n        from: res,\n        to: importer,\n        spec,\n        type: 'prod',\n      } satisfies EdgeLike\n      res.edgesOut.set(name, edge)\n    }\n  }\n  return res\n}\n"]}

package/dist/esm/visualization/human-readable-output.d.ts

@@ -1,5 +1,4 @@
-import type { EdgeLike, NodeLike } from '../types.ts';
-import type { ChalkInstance } from 'chalk';
+import type { EdgeLike, NodeLike } from '@vltpkg/types';
 export type TreeItem = {
     name?: string | null;
     edge: EdgeLike | undefined;
@@ -7,7 +6,7 @@ export type TreeItem = {
     prefix: string;
     padding: string;
     hasSibling: boolean;
-    deduped: boolean;
+    seen: boolean;
     include: boolean;
     parent: TreeItem | undefined;
 };
@@ -23,6 +22,6 @@ export type TreeMap = Map<EdgeLike | undefined, EdgeMap>;
  * Returns a human-readable output of the graph.
  */
 export declare function humanReadableOutput(options: HumanReadableOutputGraph, { colors }: {
-    colors?: ChalkInstance;
-}): string | null | undefined;
+    colors?: boolean;
+}): string;
 //# sourceMappingURL=human-readable-output.d.ts.map

package/dist/esm/visualization/human-readable-output.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"human-readable-output.d.ts","sourceRoot":"","sources":["../../../src/visualization/human-readable-output.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAA;AACrD,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,OAAO,CAAA;AAY1C,MAAM,MAAM,QAAQ,GAAG;IACrB,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;IACpB,IAAI,EAAE,QAAQ,GAAG,SAAS,CAAA;IAC1B,IAAI,EAAE,QAAQ,GAAG,SAAS,CAAA;IAC1B,MAAM,EAAE,MAAM,CAAA;IACd,OAAO,EAAE,MAAM,CAAA;IACf,UAAU,EAAE,OAAO,CAAA;IACnB,OAAO,EAAE,OAAO,CAAA;IAChB,OAAO,EAAE,OAAO,CAAA;IAChB,MAAM,EAAE,QAAQ,GAAG,SAAS,CAAA;CAC7B,CAAA;AAED,MAAM,MAAM,wBAAwB,GAAG;IACrC,KAAK,EAAE,QAAQ,EAAE,CAAA;IACjB,SAAS,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAA;IACxB,KAAK,EAAE,QAAQ,EAAE,CAAA;IACjB,kBAAkB,CAAC,EAAE,OAAO,CAAA;CAC7B,CAAA;AAED,MAAM,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,GAAG,SAAS,EAAE,QAAQ,CAAC,CAAA;AAEzD,MAAM,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,GAAG,SAAS,EAAE,OAAO,CAAC,CAAA;AA2DxD;;GAEG;AACH,wBAAgB,mBAAmB,CACjC,OAAO,EAAE,wBAAwB,EACjC,EAAE,MAAM,EAAE,EAAE;IAAE,MAAM,CAAC,EAAE,aAAa,CAAA;CAAE,6BAsGvC"}
+{"version":3,"file":"human-readable-output.d.ts","sourceRoot":"","sources":["../../../src/visualization/human-readable-output.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AAkBvD,MAAM,MAAM,QAAQ,GAAG;IACrB,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;IACpB,IAAI,EAAE,QAAQ,GAAG,SAAS,CAAA;IAC1B,IAAI,EAAE,QAAQ,GAAG,SAAS,CAAA;IAC1B,MAAM,EAAE,MAAM,CAAA;IACd,OAAO,EAAE,MAAM,CAAA;IACf,UAAU,EAAE,OAAO,CAAA;IACnB,IAAI,EAAE,OAAO,CAAA;IACb,OAAO,EAAE,OAAO,CAAA;IAChB,MAAM,EAAE,QAAQ,GAAG,SAAS,CAAA;CAC7B,CAAA;AAED,MAAM,MAAM,wBAAwB,GAAG;IACrC,KAAK,EAAE,QAAQ,EAAE,CAAA;IACjB,SAAS,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAA;IACxB,KAAK,EAAE,QAAQ,EAAE,CAAA;IACjB,kBAAkB,CAAC,EAAE,OAAO,CAAA;CAC7B,CAAA;AAED,MAAM,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,GAAG,SAAS,EAAE,QAAQ,CAAC,CAAA;AAEzD,MAAM,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,GAAG,SAAS,EAAE,OAAO,CAAC,CAAA;AAoExD;;GAEG;AACH,wBAAgB,mBAAmB,CACjC,OAAO,EAAE,wBAAwB,EACjC,EAAE,MAAM,EAAE,EAAE;IAAE,MAAM,CAAC,EAAE,OAAO,CAAA;CAAE,UAwHjC"}

package/dist/esm/visualization/human-readable-output.js

@@ -1,4 +1,6 @@
 import { splitDepID } from '@vltpkg/dep-id';
+import { styleText as utilStyleText } from 'node:util';
+const styleText = (format, s) => utilStyleText(format, s, { validateStream: false });
 const chars = new Map(Object.entries({
     connection: '─',
     down: '│',
@@ -6,8 +8,8 @@ const chars = new Map(Object.entries({
     'middle-child': '├',
     t: '┬',
 }));
-const isSelected = (options, edge, node) => !!((!node || options.nodes.includes(node)) &&
-    (!edge || options.edges.includes(edge)));
+const isSelected = (options, edge, node) => (!node || options.nodes.includes(node)) &&
+    (!edge || options.edges.includes(edge));
 /**
  * Returns a map of tree items to be printed.
  */
@@ -18,12 +20,21 @@ const getTreeItems = (initialItems, options) => {
     for (const item of traverse) {
         if (item.node) {
             if (seenNodes.has(item.node)) {
-                item.deduped = true;
+                item.seen = true;
                 continue;
             }
             seenNodes.add(item.node);
-            const edges = [...item.node.edgesOut.values()].sort(i => Number(i.to?.importer));
-            for (const edge of edges) {
+            const edges = [...item.node.edgesOut.values()];
+            const workspaces = item.node.workspaces ? [...item.node.workspaces.values()] : [];
+            const allEdges = [...edges, ...workspaces].sort((a, b) => a.name.localeCompare(b.name, 'en'));
+            // keeps track of seen edge names to avoid duplicating printed
+            // items when a workspace is also a regular dependency of the root
+            const seenEdgeName = new Set();
+            for (const edge of allEdges) {
+                if (seenEdgeName.has(edge.name)) {
+                    continue;
+                }
+                seenEdgeName.add(edge.name);
                 const toItems = treeItems.get(edge) ?? new Map();
                 const nextItem = {
                     edge,
@@ -31,7 +42,7 @@ const getTreeItems = (initialItems, options) => {
                     hasSibling: false,
                     padding: '',
                     prefix: '',
-                    deduped: false,
+                    seen: false,
                     include: isSelected(options, edge, edge.to),
                     parent: item,
                 };
@@ -53,8 +64,11 @@ const getTreeItems = (initialItems, options) => {
  */
 export function humanReadableOutput(options, { colors }) {
     const { importers } = options;
-    const noop = (s) => s;
-    const { dim = noop, red = noop, reset = noop, yellow = noop, } = colors ?? {};
+    const createStyleText = (style) => (s) => colors ? styleText(style, s) : s;
+    const dim = createStyleText('dim');
+    const red = createStyleText('red');
+    const reset = createStyleText('reset');
+    const yellow = createStyleText('yellow');
     const initialItems = new Set();
     for (const importer of importers) {
         initialItems.add({
@@ -64,7 +78,7 @@ export function humanReadableOutput(options, { colors }) {
             prefix: '',
             padding: '',
             hasSibling: false,
-            deduped: false,
+            seen: false,
             include: isSelected(options, undefined, importer),
             parent: undefined,
         });
@@ -74,11 +88,10 @@ export function humanReadableOutput(options, { colors }) {
     const traverse = (item) => {
         let header = '';
         let content = '';
-        const depIdTuple = item.node?.id && splitDepID(item.node.id);
-        const hasCustomReg = depIdTuple?.[0] === 'registry' && depIdTuple[1];
-        const name = hasCustomReg ? `${depIdTuple[1]}:${item.name}` : item.name;
+        const name = item.name;
         const decoratedName = (options.highlightSelection &&
-            isSelected(options, item.edge, item.node)) ?
+            isSelected(options, item.edge, item.node) &&
+            name) ?
             yellow(name)
             : name;
         if (!item.node && item.include) {
@@ -87,12 +100,15 @@ export function humanReadableOutput(options, { colors }) {
                 : red('(missing)');
             return `${item.padding}${item.prefix}${decoratedName} ${missing}\n`;
         }
-        const deduped = item.deduped ? ` ${dim('(deduped)')}` : '';
-        header += `${item.padding}${item.prefix}${decoratedName}${deduped}\n`;
-        // deduped items need not to be printed or traversed
-        if (!item.deduped) {
+        header += `${item.padding}${item.prefix}${decoratedName}\n`;
+        // seen items need not to be printed or traversed
+        if (!item.seen) {
             const edges = item.node ? [...item.node.edgesOut.values()] : [];
-            const nextItems = edges.map(i => treeItems.get(i)?.get(i.to));
+            const workspaces = item.node?.workspaces ?
+                [...item.node.workspaces.values()]
+                : [];
+            const allEdges = [...edges, ...workspaces].sort((a, b) => a.name.localeCompare(b.name, 'en'));
+            const nextItems = allEdges.map(i => treeItems.get(i)?.get(i.to));
             const includedItems = nextItems.filter(i => i?.include);
             for (const nextItem of nextItems) {
                 /* c8 ignore next -- impossible but TS doesn't know that */
@@ -100,15 +116,26 @@ export function humanReadableOutput(options, { colors }) {
                     continue;
                 const parent = item;
                 const isLast = includedItems.indexOf(nextItem) === includedItems.length - 1;
-                const toName = nextItem.node?.version ?
-                    `${nextItem.node.name}@${nextItem.node.version}`
+                // prefixes the node name with the registry name
+                // if a custom registry name is found
+                const depIdTuple = nextItem.node?.id && splitDepID(nextItem.node.id);
+                const hasCustomReg = depIdTuple?.[0] === 'registry' && depIdTuple[1];
+                const nodeName = hasCustomReg ?
+                    `${depIdTuple[1]}:${nextItem.node?.name}`
                     : nextItem.node?.name;
+                const toName = nextItem.node?.version ?
+                    `${nodeName}@${nextItem.node.version}`
+                    : nodeName;
                 const nextChar = isLast ? 'last-child' : 'middle-child';
+                const aliasedPackage = nextItem.node?.name && nextItem.edge?.name !== nodeName;
                 nextItem.name =
-                    (nextItem.node?.name &&
-                        nextItem.edge?.name !== nextItem.edge?.to?.name) ?
-                        `${nextItem.edge?.name} (${toName})`
-                        : `${nextItem.edge?.name}@${nextItem.node?.version || nextItem.edge?.spec.bareSpec}`;
+                    nextItem.node?.confused ?
+                        `${nextItem.edge?.name} ${red('(confused)')}`
+                        : nextItem.edge?.spec.overridden ?
+                            /* c8 ignore next */
+                            `${nextItem.edge.name}@${nextItem.node?.version || nextItem.edge.spec.bareSpec}${aliasedPackage ? ` (${toName})` : ''} ${yellow('(overridden)')}`
+                            : aliasedPackage ? `${nextItem.edge?.name} (${toName})`
+                                : `${nextItem.edge?.name}@${nextItem.node?.version || nextItem.edge?.spec.bareSpec}`;
                 nextItem.padding =
                     parent.prefix.length ?
                         `${parent.padding}${parent.hasSibling ? chars.get('down') : ' '} `

package/dist/esm/visualization/human-readable-output.js.map

@@ -1 +1 @@
-{"version":3,"file":"human-readable-output.js","sourceRoot":"","sources":["../../../src/visualization/human-readable-output.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAA;AAI3C,MAAM,KAAK,GAAG,IAAI,GAAG,CACnB,MAAM,CAAC,OAAO,CAAC;IACb,UAAU,EAAE,GAAG;IACf,IAAI,EAAE,GAAG;IACT,YAAY,EAAE,GAAG;IACjB,cAAc,EAAE,GAAG;IACnB,CAAC,EAAE,GAAG;CACP,CAAC,CACH,CAAA;AAyBD,MAAM,UAAU,GAAG,CACjB,OAAiC,EACjC,IAAe,EACf,IAAe,EACf,EAAE,CACF,CAAC,CAAC,CACA,CAAC,CAAC,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CACxC,CAAA;AAEH;;GAEG;AACH,MAAM,YAAY,GAAG,CACnB,YAA2B,EAC3B,OAAiC,EACjC,EAAE;IACF,MAAM,SAAS,GAAG,IAAI,GAAG,EAAY,CAAA;IACrC,MAAM,SAAS,GAAY,IAAI,GAAG,EAAE,CAAA;IACpC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAW,YAAY,CAAC,CAAA;IAChD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACd,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC7B,IAAI,CAAC,OAAO,GAAG,IAAI,CAAA;gBACnB,SAAQ;YACV,CAAC;YACD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACxB,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CACtD,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,QAAQ,CAAC,CACvB,CAAA;YACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,MAAM,OAAO,GACX,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAK,IAAI,GAAG,EAAc,CAAA;gBAC/C,MAAM,QAAQ,GAAa;oBACzB,IAAI;oBACJ,IAAI,EAAE,IAAI,CAAC,EAAE;oBACb,UAAU,EAAE,KAAK;oBACjB,OAAO,EAAE,EAAE;oBACX,MAAM,EAAE,EAAE;oBACV,OAAO,EAAE,KAAK;oBACd,OAAO,EAAE,UAAU,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;oBAC3C,MAAM,EAAE,IAAI;iBACb,CAAA;gBACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAA;gBAC9B,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;gBAC5B,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3C,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChC,IAAI,CAAC,MAAM,CAAC,OAAO,GAAG,IAAI,CAAA;QAC5B,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CACjC,OAAiC,EACjC,EAAE,MAAM,EAA8B;IAEtC,MAAM,EAAE,SAAS,EAAE,GAAG,OAAO,CAAA;IAC7B,MAAM,IAAI,GAAG,CAAC,CAAiB,EAAE,EAAE,CAAC,CAAC,CAAA;IACrC,MAAM,EACJ,GAAG,GAAG,IAAI,EACV,GAAG,GAAG,IAAI,EACV,KAAK,GAAG,IAAI,EACZ,MAAM,GAAG,IAAI,GACd,GAAG,MAAM,IAAI,EAAE,CAAA;IAChB,MAAM,YAAY,GAAG,IAAI,GAAG,EAAY,CAAA;IACxC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,YAAY,CAAC,GAAG,CAAC;YACf,IAAI,EAAE,QAAQ,CAAC,IAAI;YACnB,IAAI,EAAE,SAAS;YACf,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,EAAE;YACV,OAAO,EAAE,EAAE;YACX,UAAU,EAAE,KAAK;YACjB,OAAO,EAAE,KAAK;YACd,OAAO,EAAE,UAAU,CAAC,OAAO,EAAE,SAAS,EAAE,QAAQ,CAAC;YACjD,MAAM,EAAE,SAAS;SAClB,CAAC,CAAA;IACJ,CAAC;IACD,MAAM,SAAS,GAAG,YAAY,CAAC,YAAY,EAAE,OAAO,CAAC,CAAA;IAErD,IAAI,GAAG,GAAG,EAAE,CAAA;IACZ,MAAM,QAAQ,GAAG,CAAC,IAAc,EAAE,EAAE;QAClC,IAAI,MAAM,GAAG,EAAE,CAAA;QACf,IAAI,OAAO,GAAG,EAAE,CAAA;QAEhB,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,EAAE,EAAE,IAAI,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC5D,MAAM,YAAY,GAChB,UAAU,EAAE,CAAC,CAAC,CAAC,KAAK,UAAU,IAAI,UAAU,CAAC,CAAC,CAAC,CAAA;QACjD,MAAM,IAAI,GACR,YAAY,CAAC,CAAC,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;QAC5D,MAAM,aAAa,GACjB,CACE,OAAO,CAAC,kBAAkB;YAC1B,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAC1C,CAAC,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;YACd,CAAC,CAAC,IAAI,CAAA;QACR,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC/B,MAAM,OAAO,GACX,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;gBACnC,GAAG,CAAC,oBAAoB,CAAC;gBAC3B,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;YACpB,OAAO,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,aAAa,IAAI,OAAO,IAAI,CAAA;QACrE,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,WAAW,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAA;QAC1D,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,aAAa,GAAG,OAAO,IAAI,CAAA;QAErE,oDAAoD;QACpD,IAAI,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC;YAClB,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;YAC/D,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YAC7D,MAAM,aAAa,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;YAEvD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,2DAA2D;gBAC3D,IAAI,CAAC,QAAQ;oBAAE,SAAQ;gBAEvB,MAAM,MAAM,GAAG,IAAI,CAAA;gBACnB,MAAM,MAAM,GACV,aAAa,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,aAAa,CAAC,MAAM,GAAG,CAAC,CAAA;gBAC9D,MAAM,MAAM,GACV,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;oBACtB,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE;oBAClD,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;gBACvB,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,cAAc,CAAA;gBAEvD,QAAQ,CAAC,IAAI;oBACX,CACE,QAAQ,CAAC,IAAI,EAAE,IAAI;wBACnB,QAAQ,CAAC,IAAI,EAAE,IAAI,KAAK,QAAQ,CAAC,IAAI,EAAE,EAAE,EAAE,IAAI,CAChD,CAAC,CAAC;wBACD,GAAG,QAAQ,CAAC,IAAI,EAAE,IAAI,KAAK,MAAM,GAAG;wBACtC,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,IAAI,IAAI,QAAQ,CAAC,IAAI,EAAE,OAAO,IAAI,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAA;gBACtF,QAAQ,CAAC,OAAO;oBACd,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;wBACpB,GAAG,MAAM,CAAC,OAAO,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG;wBACpE,CAAC,CAAC,EAAE,CAAA;gBACN,QAAQ,CAAC,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAA;gBAC/F,QAAQ,CAAC,UAAU,GAAG,CAAC,MAAM,CAAA;gBAE7B,OAAO,IAAI,QAAQ,CAAC,QAAQ,CAAC,CAAA;YAC/B,CAAC;QACH,CAAC;QAED,MAAM,iBAAiB,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAA;QACvD,MAAM,gBAAgB,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAA;QAC7C,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC;YACjB,GAAG,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,iBAAiB,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,OAAO,EAAE;YACvF,CAAC,CAAC,EAAE,CAAA;IACR,CAAC,CAAA;IAED,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAA;IACvB,CAAC;IACD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAA;AACnB,CAAC","sourcesContent":["import { splitDepID } from '@vltpkg/dep-id'\nimport type { EdgeLike, NodeLike } from '../types.ts'\nimport type { ChalkInstance } from 'chalk'\n\nconst chars = new Map(\n  Object.entries({\n    connection: '─',\n    down: '│',\n    'last-child': '└',\n    'middle-child': '├',\n    t: '┬',\n  }),\n)\n\nexport type TreeItem = {\n  name?: string | null\n  edge: EdgeLike | undefined\n  node: NodeLike | undefined\n  prefix: string\n  padding: string\n  hasSibling: boolean\n  deduped: boolean\n  include: boolean\n  parent: TreeItem | undefined\n}\n\nexport type HumanReadableOutputGraph = {\n  edges: EdgeLike[]\n  importers: Set<NodeLike>\n  nodes: NodeLike[]\n  highlightSelection?: boolean\n}\n\nexport type EdgeMap = Map<NodeLike | undefined, TreeItem>\n\nexport type TreeMap = Map<EdgeLike | undefined, EdgeMap>\n\nconst isSelected = (\n  options: HumanReadableOutputGraph,\n  edge?: EdgeLike,\n  node?: NodeLike,\n) =>\n  !!(\n    (!node || options.nodes.includes(node)) &&\n    (!edge || options.edges.includes(edge))\n  )\n\n/**\n * Returns a map of tree items to be printed.\n */\nconst getTreeItems = (\n  initialItems: Set<TreeItem>,\n  options: HumanReadableOutputGraph,\n) => {\n  const seenNodes = new Set<NodeLike>()\n  const treeItems: TreeMap = new Map()\n  const traverse = new Set<TreeItem>(initialItems)\n  for (const item of traverse) {\n    if (item.node) {\n      if (seenNodes.has(item.node)) {\n        item.deduped = true\n        continue\n      }\n      seenNodes.add(item.node)\n      const edges = [...item.node.edgesOut.values()].sort(i =>\n        Number(i.to?.importer),\n      )\n      for (const edge of edges) {\n        const toItems: EdgeMap =\n          treeItems.get(edge) ?? (new Map() as EdgeMap)\n        const nextItem: TreeItem = {\n          edge,\n          node: edge.to,\n          hasSibling: false,\n          padding: '',\n          prefix: '',\n          deduped: false,\n          include: isSelected(options, edge, edge.to),\n          parent: item,\n        }\n        toItems.set(edge.to, nextItem)\n        treeItems.set(edge, toItems)\n        traverse.add(nextItem)\n      }\n    }\n  }\n  for (const item of [...traverse].reverse()) {\n    if (item.include && item.parent) {\n      item.parent.include = true\n    }\n  }\n  return treeItems\n}\n\n/**\n * Returns a human-readable output of the graph.\n */\nexport function humanReadableOutput(\n  options: HumanReadableOutputGraph,\n  { colors }: { colors?: ChalkInstance },\n) {\n  const { importers } = options\n  const noop = (s?: string | null) => s\n  const {\n    dim = noop,\n    red = noop,\n    reset = noop,\n    yellow = noop,\n  } = colors ?? {}\n  const initialItems = new Set<TreeItem>()\n  for (const importer of importers) {\n    initialItems.add({\n      name: importer.name,\n      edge: undefined,\n      node: importer,\n      prefix: '',\n      padding: '',\n      hasSibling: false,\n      deduped: false,\n      include: isSelected(options, undefined, importer),\n      parent: undefined,\n    })\n  }\n  const treeItems = getTreeItems(initialItems, options)\n\n  let res = ''\n  const traverse = (item: TreeItem) => {\n    let header = ''\n    let content = ''\n\n    const depIdTuple = item.node?.id && splitDepID(item.node.id)\n    const hasCustomReg =\n      depIdTuple?.[0] === 'registry' && depIdTuple[1]\n    const name =\n      hasCustomReg ? `${depIdTuple[1]}:${item.name}` : item.name\n    const decoratedName =\n      (\n        options.highlightSelection &&\n        isSelected(options, item.edge, item.node)\n      ) ?\n        yellow(name)\n      : name\n    if (!item.node && item.include) {\n      const missing =\n        item.edge?.type.endsWith('ptional') ?\n          dim('(missing optional)')\n        : red('(missing)')\n      return `${item.padding}${item.prefix}${decoratedName} ${missing}\\n`\n    }\n\n    const deduped = item.deduped ? ` ${dim('(deduped)')}` : ''\n    header += `${item.padding}${item.prefix}${decoratedName}${deduped}\\n`\n\n    // deduped items need not to be printed or traversed\n    if (!item.deduped) {\n      const edges = item.node ? [...item.node.edgesOut.values()] : []\n      const nextItems = edges.map(i => treeItems.get(i)?.get(i.to))\n      const includedItems = nextItems.filter(i => i?.include)\n\n      for (const nextItem of nextItems) {\n        /* c8 ignore next -- impossible but TS doesn't know that */\n        if (!nextItem) continue\n\n        const parent = item\n        const isLast =\n          includedItems.indexOf(nextItem) === includedItems.length - 1\n        const toName =\n          nextItem.node?.version ?\n            `${nextItem.node.name}@${nextItem.node.version}`\n          : nextItem.node?.name\n        const nextChar = isLast ? 'last-child' : 'middle-child'\n\n        nextItem.name =\n          (\n            nextItem.node?.name &&\n            nextItem.edge?.name !== nextItem.edge?.to?.name\n          ) ?\n            `${nextItem.edge?.name} (${toName})`\n          : `${nextItem.edge?.name}@${nextItem.node?.version || nextItem.edge?.spec.bareSpec}`\n        nextItem.padding =\n          parent.prefix.length ?\n            `${parent.padding}${parent.hasSibling ? chars.get('down') : ' '} `\n          : ''\n        nextItem.prefix = `${chars.get(nextChar)}${chars.get('connection')}${chars.get('connection')} `\n        nextItem.hasSibling = !isLast\n\n        content += traverse(nextItem)\n      }\n    }\n\n    const regularConnection = `${chars.get('connection')} `\n    const parentConnection = `${chars.get('t')} `\n    return item.include ?\n        `${content ? header.replace(regularConnection, parentConnection) : header}${content}`\n      : ''\n  }\n\n  for (const item of initialItems) {\n    res += traverse(item)\n  }\n  return reset(res)\n}\n"]}
+{"version":3,"file":"human-readable-output.js","sourceRoot":"","sources":["../../../src/visualization/human-readable-output.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAA;AAE3C,OAAO,EAAE,SAAS,IAAI,aAAa,EAAE,MAAM,WAAW,CAAA;AAEtD,MAAM,SAAS,GAAG,CAChB,MAA2C,EAC3C,CAAS,EACT,EAAE,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC,CAAA;AAExD,MAAM,KAAK,GAAG,IAAI,GAAG,CACnB,MAAM,CAAC,OAAO,CAAC;IACb,UAAU,EAAE,GAAG;IACf,IAAI,EAAE,GAAG;IACT,YAAY,EAAE,GAAG;IACjB,cAAc,EAAE,GAAG;IACnB,CAAC,EAAE,GAAG;CACP,CAAC,CACH,CAAA;AAyBD,MAAM,UAAU,GAAG,CACjB,OAAiC,EACjC,IAAe,EACf,IAAe,EACf,EAAE,CACF,CAAC,CAAC,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAA;AAEzC;;GAEG;AACH,MAAM,YAAY,GAAG,CACnB,YAA2B,EAC3B,OAAiC,EACjC,EAAE;IACF,MAAM,SAAS,GAAG,IAAI,GAAG,EAAY,CAAA;IACrC,MAAM,SAAS,GAAY,IAAI,GAAG,EAAE,CAAA;IACpC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAW,YAAY,CAAC,CAAA;IAChD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACd,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC7B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;gBAChB,SAAQ;YACV,CAAC;YACD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACxB,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAA;YAC9C,MAAM,UAAU,GACd,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;YAChE,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,EAAE,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACvD,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CACnC,CAAA;YAED,8DAA8D;YAC9D,kEAAkE;YAClE,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAA;YACtC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBAChC,SAAQ;gBACV,CAAC;gBACD,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAC3B,MAAM,OAAO,GACX,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAK,IAAI,GAAG,EAAc,CAAA;gBAC/C,MAAM,QAAQ,GAAa;oBACzB,IAAI;oBACJ,IAAI,EAAE,IAAI,CAAC,EAAE;oBACb,UAAU,EAAE,KAAK;oBACjB,OAAO,EAAE,EAAE;oBACX,MAAM,EAAE,EAAE;oBACV,IAAI,EAAE,KAAK;oBACX,OAAO,EAAE,UAAU,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;oBAC3C,MAAM,EAAE,IAAI;iBACb,CAAA;gBACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAA;gBAC9B,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;gBAC5B,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3C,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChC,IAAI,CAAC,MAAM,CAAC,OAAO,GAAG,IAAI,CAAA;QAC5B,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CACjC,OAAiC,EACjC,EAAE,MAAM,EAAwB;IAEhC,MAAM,EAAE,SAAS,EAAE,GAAG,OAAO,CAAA;IAC7B,MAAM,eAAe,GACnB,CAAC,KAAsC,EAAE,EAAE,CAAC,CAAC,CAAS,EAAE,EAAE,CACxD,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACpC,MAAM,GAAG,GAAG,eAAe,CAAC,KAAK,CAAC,CAAA;IAClC,MAAM,GAAG,GAAG,eAAe,CAAC,KAAK,CAAC,CAAA;IAClC,MAAM,KAAK,GAAG,eAAe,CAAC,OAAO,CAAC,CAAA;IACtC,MAAM,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAA;IACxC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAY,CAAA;IACxC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,YAAY,CAAC,GAAG,CAAC;YACf,IAAI,EAAE,QAAQ,CAAC,IAAI;YACnB,IAAI,EAAE,SAAS;YACf,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,EAAE;YACV,OAAO,EAAE,EAAE;YACX,UAAU,EAAE,KAAK;YACjB,IAAI,EAAE,KAAK;YACX,OAAO,EAAE,UAAU,CAAC,OAAO,EAAE,SAAS,EAAE,QAAQ,CAAC;YACjD,MAAM,EAAE,SAAS;SAClB,CAAC,CAAA;IACJ,CAAC;IACD,MAAM,SAAS,GAAG,YAAY,CAAC,YAAY,EAAE,OAAO,CAAC,CAAA;IAErD,IAAI,GAAG,GAAG,EAAE,CAAA;IACZ,MAAM,QAAQ,GAAG,CAAC,IAAc,EAAE,EAAE;QAClC,IAAI,MAAM,GAAG,EAAE,CAAA;QACf,IAAI,OAAO,GAAG,EAAE,CAAA;QAEhB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACtB,MAAM,aAAa,GACjB,CACE,OAAO,CAAC,kBAAkB;YAC1B,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC;YACzC,IAAI,CACL,CAAC,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;YACd,CAAC,CAAC,IAAI,CAAA;QACR,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC/B,MAAM,OAAO,GACX,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;gBACnC,GAAG,CAAC,oBAAoB,CAAC;gBAC3B,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;YACpB,OAAO,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,aAAa,IAAI,OAAO,IAAI,CAAA;QACrE,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,aAAa,IAAI,CAAA;QAE3D,iDAAiD;QACjD,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACf,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;YAC/D,MAAM,UAAU,GACd,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;gBACrB,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;gBACpC,CAAC,CAAC,EAAE,CAAA;YACN,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,EAAE,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACvD,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CACnC,CAAA;YACD,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YAChE,MAAM,aAAa,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;YAEvD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,2DAA2D;gBAC3D,IAAI,CAAC,QAAQ;oBAAE,SAAQ;gBAEvB,MAAM,MAAM,GAAG,IAAI,CAAA;gBACnB,MAAM,MAAM,GACV,aAAa,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,aAAa,CAAC,MAAM,GAAG,CAAC,CAAA;gBAE9D,gDAAgD;gBAChD,qCAAqC;gBACrC,MAAM,UAAU,GACd,QAAQ,CAAC,IAAI,EAAE,EAAE,IAAI,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBACnD,MAAM,YAAY,GAChB,UAAU,EAAE,CAAC,CAAC,CAAC,KAAK,UAAU,IAAI,UAAU,CAAC,CAAC,CAAC,CAAA;gBACjD,MAAM,QAAQ,GACZ,YAAY,CAAC,CAAC;oBACZ,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE;oBAC3C,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;gBAEvB,MAAM,MAAM,GACV,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;oBACtB,GAAG,QAAQ,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE;oBACxC,CAAC,CAAC,QAAQ,CAAA;gBACZ,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,cAAc,CAAA;gBAEvD,MAAM,cAAc,GAClB,QAAQ,CAAC,IAAI,EAAE,IAAI,IAAI,QAAQ,CAAC,IAAI,EAAE,IAAI,KAAK,QAAQ,CAAA;gBACzD,QAAQ,CAAC,IAAI;oBACX,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;wBACvB,GAAG,QAAQ,CAAC,IAAI,EAAE,IAAI,IAAI,GAAG,CAAC,YAAY,CAAC,EAAE;wBAC/C,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;4BAChC,oBAAoB;4BACpB,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,QAAQ,CAAC,IAAI,EAAE,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,cAAc,CAAC,CAAC,CAAC,KAAK,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,MAAM,CAAC,cAAc,CAAC,EAAE;4BACnJ,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,IAAI,KAAK,MAAM,GAAG;gCACvD,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,IAAI,IAAI,QAAQ,CAAC,IAAI,EAAE,OAAO,IAAI,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAA;gBACtF,QAAQ,CAAC,OAAO;oBACd,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;wBACpB,GAAG,MAAM,CAAC,OAAO,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG;wBACpE,CAAC,CAAC,EAAE,CAAA;gBACN,QAAQ,CAAC,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAA;gBAC/F,QAAQ,CAAC,UAAU,GAAG,CAAC,MAAM,CAAA;gBAE7B,OAAO,IAAI,QAAQ,CAAC,QAAQ,CAAC,CAAA;YAC/B,CAAC;QACH,CAAC;QAED,MAAM,iBAAiB,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAA;QACvD,MAAM,gBAAgB,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAA;QAC7C,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC;YACjB,GAAG,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,iBAAiB,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,OAAO,EAAE;YACvF,CAAC,CAAC,EAAE,CAAA;IACR,CAAC,CAAA;IAED,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAA;IACvB,CAAC;IACD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAA;AACnB,CAAC","sourcesContent":["import { splitDepID } from '@vltpkg/dep-id'\nimport type { EdgeLike, NodeLike } from '@vltpkg/types'\nimport { styleText as utilStyleText } from 'node:util'\n\nconst styleText = (\n  format: Parameters<typeof utilStyleText>[0],\n  s: string,\n) => utilStyleText(format, s, { validateStream: false })\n\nconst chars = new Map(\n  Object.entries({\n    connection: '─',\n    down: '│',\n    'last-child': '└',\n    'middle-child': '├',\n    t: '┬',\n  }),\n)\n\nexport type TreeItem = {\n  name?: string | null\n  edge: EdgeLike | undefined\n  node: NodeLike | undefined\n  prefix: string\n  padding: string\n  hasSibling: boolean\n  seen: boolean\n  include: boolean\n  parent: TreeItem | undefined\n}\n\nexport type HumanReadableOutputGraph = {\n  edges: EdgeLike[]\n  importers: Set<NodeLike>\n  nodes: NodeLike[]\n  highlightSelection?: boolean\n}\n\nexport type EdgeMap = Map<NodeLike | undefined, TreeItem>\n\nexport type TreeMap = Map<EdgeLike | undefined, EdgeMap>\n\nconst isSelected = (\n  options: HumanReadableOutputGraph,\n  edge?: EdgeLike,\n  node?: NodeLike,\n) =>\n  (!node || options.nodes.includes(node)) &&\n  (!edge || options.edges.includes(edge))\n\n/**\n * Returns a map of tree items to be printed.\n */\nconst getTreeItems = (\n  initialItems: Set<TreeItem>,\n  options: HumanReadableOutputGraph,\n) => {\n  const seenNodes = new Set<NodeLike>()\n  const treeItems: TreeMap = new Map()\n  const traverse = new Set<TreeItem>(initialItems)\n  for (const item of traverse) {\n    if (item.node) {\n      if (seenNodes.has(item.node)) {\n        item.seen = true\n        continue\n      }\n      seenNodes.add(item.node)\n      const edges = [...item.node.edgesOut.values()]\n      const workspaces =\n        item.node.workspaces ? [...item.node.workspaces.values()] : []\n      const allEdges = [...edges, ...workspaces].sort((a, b) =>\n        a.name.localeCompare(b.name, 'en'),\n      )\n\n      // keeps track of seen edge names to avoid duplicating printed\n      // items when a workspace is also a regular dependency of the root\n      const seenEdgeName = new Set<string>()\n      for (const edge of allEdges) {\n        if (seenEdgeName.has(edge.name)) {\n          continue\n        }\n        seenEdgeName.add(edge.name)\n        const toItems: EdgeMap =\n          treeItems.get(edge) ?? (new Map() as EdgeMap)\n        const nextItem: TreeItem = {\n          edge,\n          node: edge.to,\n          hasSibling: false,\n          padding: '',\n          prefix: '',\n          seen: false,\n          include: isSelected(options, edge, edge.to),\n          parent: item,\n        }\n        toItems.set(edge.to, nextItem)\n        treeItems.set(edge, toItems)\n        traverse.add(nextItem)\n      }\n    }\n  }\n  for (const item of [...traverse].reverse()) {\n    if (item.include && item.parent) {\n      item.parent.include = true\n    }\n  }\n  return treeItems\n}\n\n/**\n * Returns a human-readable output of the graph.\n */\nexport function humanReadableOutput(\n  options: HumanReadableOutputGraph,\n  { colors }: { colors?: boolean },\n) {\n  const { importers } = options\n  const createStyleText =\n    (style: Parameters<typeof styleText>[0]) => (s: string) =>\n      colors ? styleText(style, s) : s\n  const dim = createStyleText('dim')\n  const red = createStyleText('red')\n  const reset = createStyleText('reset')\n  const yellow = createStyleText('yellow')\n  const initialItems = new Set<TreeItem>()\n  for (const importer of importers) {\n    initialItems.add({\n      name: importer.name,\n      edge: undefined,\n      node: importer,\n      prefix: '',\n      padding: '',\n      hasSibling: false,\n      seen: false,\n      include: isSelected(options, undefined, importer),\n      parent: undefined,\n    })\n  }\n  const treeItems = getTreeItems(initialItems, options)\n\n  let res = ''\n  const traverse = (item: TreeItem) => {\n    let header = ''\n    let content = ''\n\n    const name = item.name\n    const decoratedName =\n      (\n        options.highlightSelection &&\n        isSelected(options, item.edge, item.node) &&\n        name\n      ) ?\n        yellow(name)\n      : name\n    if (!item.node && item.include) {\n      const missing =\n        item.edge?.type.endsWith('ptional') ?\n          dim('(missing optional)')\n        : red('(missing)')\n      return `${item.padding}${item.prefix}${decoratedName} ${missing}\\n`\n    }\n\n    header += `${item.padding}${item.prefix}${decoratedName}\\n`\n\n    // seen items need not to be printed or traversed\n    if (!item.seen) {\n      const edges = item.node ? [...item.node.edgesOut.values()] : []\n      const workspaces =\n        item.node?.workspaces ?\n          [...item.node.workspaces.values()]\n        : []\n      const allEdges = [...edges, ...workspaces].sort((a, b) =>\n        a.name.localeCompare(b.name, 'en'),\n      )\n      const nextItems = allEdges.map(i => treeItems.get(i)?.get(i.to))\n      const includedItems = nextItems.filter(i => i?.include)\n\n      for (const nextItem of nextItems) {\n        /* c8 ignore next -- impossible but TS doesn't know that */\n        if (!nextItem) continue\n\n        const parent = item\n        const isLast =\n          includedItems.indexOf(nextItem) === includedItems.length - 1\n\n        // prefixes the node name with the registry name\n        // if a custom registry name is found\n        const depIdTuple =\n          nextItem.node?.id && splitDepID(nextItem.node.id)\n        const hasCustomReg =\n          depIdTuple?.[0] === 'registry' && depIdTuple[1]\n        const nodeName =\n          hasCustomReg ?\n            `${depIdTuple[1]}:${nextItem.node?.name}`\n          : nextItem.node?.name\n\n        const toName =\n          nextItem.node?.version ?\n            `${nodeName}@${nextItem.node.version}`\n          : nodeName\n        const nextChar = isLast ? 'last-child' : 'middle-child'\n\n        const aliasedPackage =\n          nextItem.node?.name && nextItem.edge?.name !== nodeName\n        nextItem.name =\n          nextItem.node?.confused ?\n            `${nextItem.edge?.name} ${red('(confused)')}`\n          : nextItem.edge?.spec.overridden ?\n            /* c8 ignore next */\n            `${nextItem.edge.name}@${nextItem.node?.version || nextItem.edge.spec.bareSpec}${aliasedPackage ? ` (${toName})` : ''} ${yellow('(overridden)')}`\n          : aliasedPackage ? `${nextItem.edge?.name} (${toName})`\n          : `${nextItem.edge?.name}@${nextItem.node?.version || nextItem.edge?.spec.bareSpec}`\n        nextItem.padding =\n          parent.prefix.length ?\n            `${parent.padding}${parent.hasSibling ? chars.get('down') : ' '} `\n          : ''\n        nextItem.prefix = `${chars.get(nextChar)}${chars.get('connection')}${chars.get('connection')} `\n        nextItem.hasSibling = !isLast\n\n        content += traverse(nextItem)\n      }\n    }\n\n    const regularConnection = `${chars.get('connection')} `\n    const parentConnection = `${chars.get('t')} `\n    return item.include ?\n        `${content ? header.replace(regularConnection, parentConnection) : header}${content}`\n      : ''\n  }\n\n  for (const item of initialItems) {\n    res += traverse(item)\n  }\n  return reset(res)\n}\n"]}

package/dist/esm/visualization/json-output.d.ts

@@ -1,5 +1,5 @@
 import type { DepID } from '@vltpkg/dep-id';
-import type { EdgeLike, NodeLike } from '../types.ts';
+import type { EdgeLike, NodeLike } from '@vltpkg/types';
 /**
  * A JSON output item describes a package that is present in the install
  * graph. It represents an edge plus it's linking Node.
@@ -25,13 +25,17 @@ export type JSONOutputItem = {
      * A representation of the package object that fulfills this dependency.
      */
     to?: NodeLike;
+    /**
+     * Whether this edge was overridden by a graph modifier.
+     */
+    overridden: boolean;
 };
 export type JSONOutputGraph = {
     edges: EdgeLike[];
-    nodes: NodeLike[];
+    importers: Set<NodeLike>;
 };
 /**
  * Returns a JSON string representation of the graph.
  */
-export declare function jsonOutput({ edges, nodes }: JSONOutputGraph): JSONOutputItem[];
+export declare function jsonOutput({ edges, importers }: JSONOutputGraph): JSONOutputItem[];
 //# sourceMappingURL=json-output.d.ts.map

package/dist/esm/visualization/json-output.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"json-output.d.ts","sourceRoot":"","sources":["../../../src/visualization/json-output.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAA;AAC3C,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAA;AAErD;;;GAGG;AACH,MAAM,MAAM,cAAc,GAAG;IAC3B;;OAEG;IACH,IAAI,EAAE,MAAM,CAAA;IACZ;;OAEG;IACH,MAAM,CAAC,EAAE,KAAK,CAAA;IACd;;OAEG;IACH,IAAI,CAAC,EAAE,MAAM,CAAA;IACb;;OAEG;IACH,IAAI,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAA;IACvB;;OAEG;IACH,EAAE,CAAC,EAAE,QAAQ,CAAA;CACd,CAAA;AAED,MAAM,MAAM,eAAe,GAAG;IAC5B,KAAK,EAAE,QAAQ,EAAE,CAAA;IACjB,KAAK,EAAE,QAAQ,EAAE,CAAA;CAClB,CAAA;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,EAAE,KAAK,EAAE,KAAK,EAAE,EAAE,eAAe,oBA0B3D"}
+{"version":3,"file":"json-output.d.ts","sourceRoot":"","sources":["../../../src/visualization/json-output.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAA;AAC3C,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AAEvD;;;GAGG;AACH,MAAM,MAAM,cAAc,GAAG;IAC3B;;OAEG;IACH,IAAI,EAAE,MAAM,CAAA;IACZ;;OAEG;IACH,MAAM,CAAC,EAAE,KAAK,CAAA;IACd;;OAEG;IACH,IAAI,CAAC,EAAE,MAAM,CAAA;IACb;;OAEG;IACH,IAAI,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAA;IACvB;;OAEG;IACH,EAAE,CAAC,EAAE,QAAQ,CAAA;IACb;;OAEG;IACH,UAAU,EAAE,OAAO,CAAA;CACpB,CAAA;AAED,MAAM,MAAM,eAAe,GAAG;IAC5B,KAAK,EAAE,QAAQ,EAAE,CAAA;IACjB,SAAS,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAA;CACzB,CAAA;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,EAAE,KAAK,EAAE,SAAS,EAAE,EAAE,eAAe,oBA2C/D"}

package/dist/esm/visualization/json-output.js

@@ -1,26 +1,49 @@
 /**
  * Returns a JSON string representation of the graph.
  */
-export function jsonOutput({ edges, nodes }) {
+export function jsonOutput({ edges, importers }) {
     const res = [];
-    // Collects importer nodes as edgeless json output items
-    for (const node of nodes) {
-        if (node.importer) {
-            res.push({
-                /* c8 ignore next - name can't be missing but ts won't know */
-                name: node.name || node.id,
-                to: node,
-            });
-        }
-    }
+    const seenIds = new Set();
     // Collects edge & it's linked nodes as json output items
-    for (const edge of edges) {
+    const orderedEdges = [...edges].sort((a, b) => {
+        const aIsWorkspace = a.spec.type === 'workspace';
+        const bIsWorkspace = b.spec.type === 'workspace';
+        if (aIsWorkspace && !bIsWorkspace)
+            return -1;
+        /* c8 ignore next */
+        if (!aIsWorkspace && bIsWorkspace)
+            return 1;
+        return 0; // preserve original order otherwise
+    });
+    for (const edge of orderedEdges) {
+        if (edge.to)
+            seenIds.add(edge.to.id);
         res.push({
             name: edge.name,
             fromID: edge.from.id,
             spec: String(edge.spec),
             type: edge.type,
             to: edge.to,
+            overridden: edge.spec.overridden,
+        });
+    }
+    // Collects included importer nodes json output items
+    /* c8 ignore next 3 */
+    const orderedImporters = [...importers].sort((a, b) => {
+        if (!a.name)
+            return 1;
+        if (!b.name)
+            return -1;
+        return a.name.localeCompare(b.name);
+    });
+    for (const node of orderedImporters) {
+        if (seenIds.has(node.id))
+            continue;
+        res.unshift({
+            /* c8 ignore next - name can't be missing but ts won't know */
+            name: node.name || node.id,
+            to: node,
+            overridden: false,
         });
     }
     return res;

package/dist/esm/visualization/json-output.js.map

@@ -1 +1 @@
-{"version":3,"file":"json-output.js","sourceRoot":"","sources":["../../../src/visualization/json-output.ts"],"names":[],"mappings":"AAmCA;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,EAAE,KAAK,EAAE,KAAK,EAAmB;IAC1D,MAAM,GAAG,GAAqB,EAAE,CAAA;IAEhC,wDAAwD;IACxD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,GAAG,CAAC,IAAI,CAAC;gBACP,8DAA8D;gBAC9D,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE;gBAC1B,EAAE,EAAE,IAAI;aACT,CAAC,CAAA;QACJ,CAAC;IACH,CAAC;IAED,yDAAyD;IACzD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,GAAG,CAAC,IAAI,CAAC;YACP,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE;YACpB,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;YACvB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,EAAE,EAAE,IAAI,CAAC,EAAE;SACZ,CAAC,CAAA;IACJ,CAAC;IAED,OAAO,GAAG,CAAA;AACZ,CAAC","sourcesContent":["import type { DepID } from '@vltpkg/dep-id'\nimport type { EdgeLike, NodeLike } from '../types.ts'\n\n/**\n * A JSON output item describes a package that is present in the install\n * graph. It represents an edge plus it's linking Node.\n */\nexport type JSONOutputItem = {\n  /**\n   * The name of the package.\n   */\n  name: string\n  /**\n   * A reference to the id of the Node that this package is linked from.\n   */\n  fromID?: DepID\n  /**\n   * The dependency spec definition for this package.\n   */\n  spec?: string\n  /**\n   * The package type.\n   */\n  type?: EdgeLike['type']\n  /**\n   * A representation of the package object that fulfills this dependency.\n   */\n  to?: NodeLike\n}\n\nexport type JSONOutputGraph = {\n  edges: EdgeLike[]\n  nodes: NodeLike[]\n}\n\n/**\n * Returns a JSON string representation of the graph.\n */\nexport function jsonOutput({ edges, nodes }: JSONOutputGraph) {\n  const res: JSONOutputItem[] = []\n\n  // Collects importer nodes as edgeless json output items\n  for (const node of nodes) {\n    if (node.importer) {\n      res.push({\n        /* c8 ignore next - name can't be missing but ts won't know */\n        name: node.name || node.id,\n        to: node,\n      })\n    }\n  }\n\n  // Collects edge & it's linked nodes as json output items\n  for (const edge of edges) {\n    res.push({\n      name: edge.name,\n      fromID: edge.from.id,\n      spec: String(edge.spec),\n      type: edge.type,\n      to: edge.to,\n    })\n  }\n\n  return res\n}\n"]}
+{"version":3,"file":"json-output.js","sourceRoot":"","sources":["../../../src/visualization/json-output.ts"],"names":[],"mappings":"AAuCA;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,EAAE,KAAK,EAAE,SAAS,EAAmB;IAC9D,MAAM,GAAG,GAAqB,EAAE,CAAA;IAChC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAS,CAAA;IAEhC,yDAAyD;IACzD,MAAM,YAAY,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC5C,MAAM,YAAY,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,WAAW,CAAA;QAChD,MAAM,YAAY,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,WAAW,CAAA;QAChD,IAAI,YAAY,IAAI,CAAC,YAAY;YAAE,OAAO,CAAC,CAAC,CAAA;QAC5C,oBAAoB;QACpB,IAAI,CAAC,YAAY,IAAI,YAAY;YAAE,OAAO,CAAC,CAAA;QAC3C,OAAO,CAAC,CAAA,CAAC,oCAAoC;IAC/C,CAAC,CAAC,CAAA;IACF,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,IAAI,IAAI,CAAC,EAAE;YAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAA;QACpC,GAAG,CAAC,IAAI,CAAC;YACP,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE;YACpB,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;YACvB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,UAAU,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU;SACjC,CAAC,CAAA;IACJ,CAAC;IAED,qDAAqD;IACrD,sBAAsB;IACtB,MAAM,gBAAgB,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACpD,IAAI,CAAC,CAAC,CAAC,IAAI;YAAE,OAAO,CAAC,CAAA;QACrB,IAAI,CAAC,CAAC,CAAC,IAAI;YAAE,OAAO,CAAC,CAAC,CAAA;QACtB,OAAO,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IACrC,CAAC,CAAC,CAAA;IACF,KAAK,MAAM,IAAI,IAAI,gBAAgB,EAAE,CAAC;QACpC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAQ;QAClC,GAAG,CAAC,OAAO,CAAC;YACV,8DAA8D;YAC9D,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE;YAC1B,EAAE,EAAE,IAAI;YACR,UAAU,EAAE,KAAK;SAClB,CAAC,CAAA;IACJ,CAAC;IAED,OAAO,GAAG,CAAA;AACZ,CAAC","sourcesContent":["import type { DepID } from '@vltpkg/dep-id'\nimport type { EdgeLike, NodeLike } from '@vltpkg/types'\n\n/**\n * A JSON output item describes a package that is present in the install\n * graph. It represents an edge plus it's linking Node.\n */\nexport type JSONOutputItem = {\n  /**\n   * The name of the package.\n   */\n  name: string\n  /**\n   * A reference to the id of the Node that this package is linked from.\n   */\n  fromID?: DepID\n  /**\n   * The dependency spec definition for this package.\n   */\n  spec?: string\n  /**\n   * The package type.\n   */\n  type?: EdgeLike['type']\n  /**\n   * A representation of the package object that fulfills this dependency.\n   */\n  to?: NodeLike\n  /**\n   * Whether this edge was overridden by a graph modifier.\n   */\n  overridden: boolean\n}\n\nexport type JSONOutputGraph = {\n  edges: EdgeLike[]\n  importers: Set<NodeLike>\n}\n\n/**\n * Returns a JSON string representation of the graph.\n */\nexport function jsonOutput({ edges, importers }: JSONOutputGraph) {\n  const res: JSONOutputItem[] = []\n  const seenIds = new Set<DepID>()\n\n  // Collects edge & it's linked nodes as json output items\n  const orderedEdges = [...edges].sort((a, b) => {\n    const aIsWorkspace = a.spec.type === 'workspace'\n    const bIsWorkspace = b.spec.type === 'workspace'\n    if (aIsWorkspace && !bIsWorkspace) return -1\n    /* c8 ignore next */\n    if (!aIsWorkspace && bIsWorkspace) return 1\n    return 0 // preserve original order otherwise\n  })\n  for (const edge of orderedEdges) {\n    if (edge.to) seenIds.add(edge.to.id)\n    res.push({\n      name: edge.name,\n      fromID: edge.from.id,\n      spec: String(edge.spec),\n      type: edge.type,\n      to: edge.to,\n      overridden: edge.spec.overridden,\n    })\n  }\n\n  // Collects included importer nodes json output items\n  /* c8 ignore next 3 */\n  const orderedImporters = [...importers].sort((a, b) => {\n    if (!a.name) return 1\n    if (!b.name) return -1\n    return a.name.localeCompare(b.name)\n  })\n  for (const node of orderedImporters) {\n    if (seenIds.has(node.id)) continue\n    res.unshift({\n      /* c8 ignore next - name can't be missing but ts won't know */\n      name: node.name || node.id,\n      to: node,\n      overridden: false,\n    })\n  }\n\n  return res\n}\n"]}

package/dist/esm/visualization/mermaid-output.d.ts

@@ -1,9 +1,15 @@
-import type { EdgeLike, NodeLike } from '../types.ts';
+import type { EdgeLike, NodeLike } from '@vltpkg/types';
 export type MermaidOutputGraph = {
     edges: EdgeLike[];
     importers: Set<NodeLike>;
     nodes: NodeLike[];
 };
+/**
+ * Generates a short identifier for a given index following the pattern:
+ * 0 -> a, 1 -> b, ..., 25 -> z, 26 -> A, ..., 51 -> Z, 52 -> aa, 53 -> ab, etc.
+ * This implements a bijective base-52 numbering system where a-z = 0-25, A-Z = 26-51
+ */
+export declare function generateShortId(index: number): string;
 /**
  * Returns a mermaid string representation of the graph.
  */

package/dist/esm/visualization/mermaid-output.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"mermaid-output.d.ts","sourceRoot":"","sources":["../../../src/visualization/mermaid-output.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAA;AAErD,MAAM,MAAM,kBAAkB,GAAG;IAC/B,KAAK,EAAE,QAAQ,EAAE,CAAA;IACjB,SAAS,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAA;IACxB,KAAK,EAAE,QAAQ,EAAE,CAAA;CAClB,CAAA;AAsDD;;GAEG;AACH,wBAAgB,aAAa,CAAC,EAC5B,KAAK,EACL,SAAS,EACT,KAAK,GACN,EAAE,kBAAkB,UA0CpB"}
+{"version":3,"file":"mermaid-output.d.ts","sourceRoot":"","sources":["../../../src/visualization/mermaid-output.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AAEvD,MAAM,MAAM,kBAAkB,GAAG;IAC/B,KAAK,EAAE,QAAQ,EAAE,CAAA;IACjB,SAAS,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAA;IACxB,KAAK,EAAE,QAAQ,EAAE,CAAA;CAClB,CAAA;AASD;;;;GAIG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,CA0BrD;AA+ED;;GAEG;AACH,wBAAgB,aAAa,CAAC,EAC5B,KAAK,EACL,SAAS,EACT,KAAK,GACN,EAAE,kBAAkB,UA+CpB"}