@vltpkg/graph 1.0.0-rc.2 → 1.0.0-rc.22

package/dist/esm/virtual-root.js

@@ -1,79 +0,0 @@
-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);
-            importer.edgesIn.add(edge);
-        }
-    }
-    return res;
-};
-//# sourceMappingURL=virtual-root.js.map

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

@@ -1 +0,0 @@
-{"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;YAC5B,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAC5B,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      importer.edgesIn.add(edge)\n    }\n  }\n  return res\n}\n"]}

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

@@ -1,27 +0,0 @@
-import type { EdgeLike, NodeLike } from '@vltpkg/types';
-export type TreeItem = {
-    name?: string | null;
-    edge: EdgeLike | undefined;
-    node: NodeLike | undefined;
-    prefix: string;
-    padding: string;
-    hasSibling: boolean;
-    seen: boolean;
-    include: boolean;
-    parent: TreeItem | undefined;
-};
-export type HumanReadableOutputGraph = {
-    edges: EdgeLike[];
-    importers: Set<NodeLike>;
-    nodes: NodeLike[];
-    highlightSelection?: boolean;
-};
-export type EdgeMap = Map<NodeLike | undefined, TreeItem>;
-export type TreeMap = Map<EdgeLike | undefined, EdgeMap>;
-/**
- * Returns a human-readable output of the graph.
- */
-export declare function humanReadableOutput(options: HumanReadableOutputGraph, { colors }: {
-    colors?: boolean;
-}): string;
-//# sourceMappingURL=human-readable-output.d.ts.map

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

@@ -1 +0,0 @@
-{"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,159 +0,0 @@
-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: '│',
-    'last-child': '└',
-    'middle-child': '├',
-    t: '┬',
-}));
-const isSelected = (options, edge, node) => (!node || options.nodes.includes(node)) &&
-    (!edge || options.edges.includes(edge));
-/**
- * Returns a map of tree items to be printed.
- */
-const getTreeItems = (initialItems, options) => {
-    const seenNodes = new Set();
-    const treeItems = new Map();
-    const traverse = new Set(initialItems);
-    for (const item of traverse) {
-        if (item.node) {
-            if (seenNodes.has(item.node)) {
-                item.seen = true;
-                continue;
-            }
-            seenNodes.add(item.node);
-            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,
-                    node: edge.to,
-                    hasSibling: false,
-                    padding: '',
-                    prefix: '',
-                    seen: false,
-                    include: isSelected(options, edge, edge.to),
-                    parent: item,
-                };
-                toItems.set(edge.to, nextItem);
-                treeItems.set(edge, toItems);
-                traverse.add(nextItem);
-            }
-        }
-    }
-    for (const item of [...traverse].reverse()) {
-        if (item.include && item.parent) {
-            item.parent.include = true;
-        }
-    }
-    return treeItems;
-};
-/**
- * Returns a human-readable output of the graph.
- */
-export function humanReadableOutput(options, { colors }) {
-    const { importers } = options;
-    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({
-            name: importer.name,
-            edge: undefined,
-            node: importer,
-            prefix: '',
-            padding: '',
-            hasSibling: false,
-            seen: false,
-            include: isSelected(options, undefined, importer),
-            parent: undefined,
-        });
-    }
-    const treeItems = getTreeItems(initialItems, options);
-    let res = '';
-    const traverse = (item) => {
-        let header = '';
-        let content = '';
-        const name = item.name;
-        const decoratedName = (options.highlightSelection &&
-            isSelected(options, item.edge, item.node) &&
-            name) ?
-            yellow(name)
-            : name;
-        if (!item.node && item.include) {
-            const missing = item.edge?.type.endsWith('ptional') ?
-                dim('(missing optional)')
-                : red('(missing)');
-            return `${item.padding}${item.prefix}${decoratedName} ${missing}\n`;
-        }
-        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 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 */
-                if (!nextItem)
-                    continue;
-                const parent = item;
-                const isLast = includedItems.indexOf(nextItem) === includedItems.length - 1;
-                // 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?.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') : ' '} `
-                        : '';
-                nextItem.prefix = `${chars.get(nextChar)}${chars.get('connection')}${chars.get('connection')} `;
-                nextItem.hasSibling = !isLast;
-                content += traverse(nextItem);
-            }
-        }
-        const regularConnection = `${chars.get('connection')} `;
-        const parentConnection = `${chars.get('t')} `;
-        return item.include ?
-            `${content ? header.replace(regularConnection, parentConnection) : header}${content}`
-            : '';
-    };
-    for (const item of initialItems) {
-        res += traverse(item);
-    }
-    return reset(res);
-}
-//# sourceMappingURL=human-readable-output.js.map

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

@@ -1 +0,0 @@
-{"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,41 +0,0 @@
-import type { DepID } from '@vltpkg/dep-id';
-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.
- */
-export type JSONOutputItem = {
-    /**
-     * The name of the package.
-     */
-    name: string;
-    /**
-     * A reference to the id of the Node that this package is linked from.
-     */
-    fromID?: DepID;
-    /**
-     * The dependency spec definition for this package.
-     */
-    spec?: string;
-    /**
-     * The package type.
-     */
-    type?: EdgeLike['type'];
-    /**
-     * 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[];
-    importers: Set<NodeLike>;
-};
-/**
- * Returns a JSON string representation of the graph.
- */
-export declare function jsonOutput({ edges, importers }: JSONOutputGraph): JSONOutputItem[];
-//# sourceMappingURL=json-output.d.ts.map

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

@@ -1 +0,0 @@
-{"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,51 +0,0 @@
-/**
- * Returns a JSON string representation of the graph.
- */
-export function jsonOutput({ edges, importers }) {
-    const res = [];
-    const seenIds = new Set();
-    // Collects edge & it's linked nodes as json output items
-    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;
-}
-//# sourceMappingURL=json-output.js.map

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

@@ -1 +0,0 @@
-{"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,17 +0,0 @@
-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.
- */
-export declare function mermaidOutput({ edges, importers, nodes, }: MermaidOutputGraph): string;
-//# sourceMappingURL=mermaid-output.d.ts.map

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

@@ -1 +0,0 @@
-{"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"}

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

@@ -1,123 +0,0 @@
-import { Edge } from "../edge.js";
-import { Node } from "../node.js";
-let missingCount = 0;
-/**
- * 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 function generateShortId(index) {
-    const base = 52;
-    // Helper function to convert a digit (0-51) to character
-    const digitToChar = (digit) => {
-        if (digit < 26) {
-            // a-z (0-25)
-            return String.fromCharCode(97 + digit);
-        }
-        else {
-            // A-Z (26-51)
-            return String.fromCharCode(65 + (digit - 26));
-        }
-    };
-    // Bijective base-52 conversion
-    let result = '';
-    let num = index + 1; // Convert to 1-based for bijective base
-    while (num > 0) {
-        num--; // Adjust for 0-based indexing in each position
-        const remainder = num % base;
-        result = digitToChar(remainder) + result;
-        num = Math.floor(num / base);
-    }
-    return result;
-}
-/**
- * Creates a mapping from DepID to short identifier
- */
-function createDepIdMapping(importers) {
-    const mapping = new Map();
-    const uniqueDepIds = new Set();
-    // Collect all unique DepIDs from nodes & importers
-    const [importer] = importers;
-    if (importer) {
-        for (const node of importer.graph.nodes.values()) {
-            uniqueDepIds.add(node.id);
-        }
-    }
-    // Create mapping for each unique DepID
-    let index = 0;
-    for (const depId of uniqueDepIds) {
-        mapping.set(depId, generateShortId(index++));
-    }
-    return mapping;
-}
-const nodeLabel = (node) => `"${String(node).replaceAll('@', '#64;')}"`;
-function parseNode(seenNodes, includedItems, depIdMapping, node) {
-    if (seenNodes.has(node.id) || !includedItems.get(node)) {
-        return '';
-    }
-    seenNodes.add(node.id);
-    const edges = [...node.edgesOut.values()]
-        .map(e => parseEdge(seenNodes, includedItems, depIdMapping, e))
-        .filter(Boolean)
-        .join('\n');
-    const shortId = depIdMapping.get(node.id);
-    return `${shortId}(${nodeLabel(node)})${edges.length ? '\n' : ''}${edges}`;
-}
-function parseEdge(seenNodes, includedItems, depIdMapping, edge) {
-    if (!includedItems.get(edge)) {
-        return '';
-    }
-    const fromShortId = depIdMapping.get(edge.from.id);
-    const edgeType = edge.type === 'prod' ? '' : ` (${edge.type})`;
-    const edgeResult = `${fromShortId}(${nodeLabel(edge.from)})` +
-        ` -->|"${String(edge.spec).replaceAll('@', '#64;')}${edgeType}"| `;
-    const missingLabel = edge.type.endsWith('ptional') ? 'Missing Optional' : 'Missing';
-    if (!edge.to) {
-        return edgeResult + `missing-${missingCount++}(${missingLabel})\n`;
-    }
-    const toShortId = depIdMapping.get(edge.to.id);
-    return (edgeResult +
-        `${toShortId}(${nodeLabel(edge.to)})\n` +
-        parseNode(seenNodes, includedItems, depIdMapping, edge.to));
-}
-/**
- * Returns a mermaid string representation of the graph.
- */
-export function mermaidOutput({ edges, importers, nodes, }) {
-    const seen = new Set();
-    const includedItems = new Map();
-    const traverse = new Set([...importers].map(i => ({ self: i, parent: undefined })));
-    for (const item of traverse) {
-        if (seen.has(item.self))
-            continue;
-        seen.add(item.self);
-        if (item.self instanceof Edge) {
-            if (edges.includes(item.self)) {
-                includedItems.set(item.self, true);
-            }
-            if (item.self.to) {
-                traverse.add({ self: item.self.to, parent: item.self });
-            }
-        }
-        if (item.self instanceof Node) {
-            if (nodes.includes(item.self)) {
-                includedItems.set(item.self, true);
-            }
-            for (const edge of item.self.edgesOut.values()) {
-                traverse.add({ self: edge, parent: item.self });
-            }
-        }
-    }
-    for (const item of [...traverse].reverse()) {
-        if (includedItems.has(item.self) && item.parent) {
-            includedItems.set(item.parent, true);
-        }
-    }
-    // Create DepID to short identifier mapping
-    const depIdMapping = createDepIdMapping(importers);
-    return ('flowchart TD\n' +
-        [...importers]
-            .map(i => parseNode(new Set(), includedItems, depIdMapping, i))
-            .join('\n'));
-}
-//# sourceMappingURL=mermaid-output.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"mermaid-output.js","sourceRoot":"","sources":["../../../src/visualization/mermaid-output.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AACjC,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAcjC,IAAI,YAAY,GAAG,CAAC,CAAA;AAEpB;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,KAAa;IAC3C,MAAM,IAAI,GAAG,EAAE,CAAA;IAEf,yDAAyD;IACzD,MAAM,WAAW,GAAG,CAAC,KAAa,EAAU,EAAE;QAC5C,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;YACf,aAAa;YACb,OAAO,MAAM,CAAC,YAAY,CAAC,EAAE,GAAG,KAAK,CAAC,CAAA;QACxC,CAAC;aAAM,CAAC;YACN,cAAc;YACd,OAAO,MAAM,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAA;QAC/C,CAAC;IACH,CAAC,CAAA;IAED,+BAA+B;IAC/B,IAAI,MAAM,GAAG,EAAE,CAAA;IACf,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,CAAA,CAAC,wCAAwC;IAE5D,OAAO,GAAG,GAAG,CAAC,EAAE,CAAC;QACf,GAAG,EAAE,CAAA,CAAC,+CAA+C;QACrD,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI,CAAA;QAC5B,MAAM,GAAG,WAAW,CAAC,SAAS,CAAC,GAAG,MAAM,CAAA;QACxC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,IAAI,CAAC,CAAA;IAC9B,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CACzB,SAAwB;IAExB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAiB,CAAA;IACxC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAS,CAAA;IAErC,mDAAmD;IACnD,MAAM,CAAC,QAAQ,CAAC,GAAG,SAAS,CAAA;IAC5B,IAAI,QAAQ,EAAE,CAAC;QACb,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACjD,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC3B,CAAC;IACH,CAAC;IAED,uCAAuC;IACvC,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;QACjC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,eAAe,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;IAC9C,CAAC;IAED,OAAO,OAAO,CAAA;AAChB,CAAC;AAED,MAAM,SAAS,GAAG,CAAC,IAAc,EAAE,EAAE,CACnC,IAAI,MAAM,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,CAAA;AAE7C,SAAS,SAAS,CAChB,SAAqB,EACrB,aAAgD,EAChD,YAAgC,EAChC,IAAc;IAEd,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QACvD,OAAO,EAAE,CAAA;IACX,CAAC;IACD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACtB,MAAM,KAAK,GAAW,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC;SAC9C,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,SAAS,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC,CAAC,CAAC;SAC9D,MAAM,CAAC,OAAO,CAAC;SACf,IAAI,CAAC,IAAI,CAAC,CAAA;IACb,MAAM,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACzC,OAAO,GAAG,OAAO,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,CAAA;AAC5E,CAAC;AAED,SAAS,SAAS,CAChB,SAAqB,EACrB,aAAgD,EAChD,YAAgC,EAChC,IAAc;IAEd,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7B,OAAO,EAAE,CAAA;IACX,CAAC;IAED,MAAM,WAAW,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAClD,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,GAAG,CAAA;IAC9D,MAAM,UAAU,GACd,GAAG,WAAW,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;QACzC,SAAS,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,QAAQ,KAAK,CAAA;IAEpE,MAAM,YAAY,GAChB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,SAAS,CAAA;IAChE,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;QACb,OAAO,UAAU,GAAG,WAAW,YAAY,EAAE,IAAI,YAAY,KAAK,CAAA;IACpE,CAAC;IAED,MAAM,SAAS,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAA;IAC9C,OAAO,CACL,UAAU;QACV,GAAG,SAAS,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK;QACvC,SAAS,CAAC,SAAS,EAAE,aAAa,EAAE,YAAY,EAAE,IAAI,CAAC,EAAE,CAAC,CAC3D,CAAA;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,EAC5B,KAAK,EACL,SAAS,EACT,KAAK,GACc;IACnB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAuB,CAAA;IAC3C,MAAM,aAAa,GAAG,IAAI,GAAG,EAAgC,CAAA;IAC7D,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC,CAC1D,CAAA;IAED,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAQ;QACjC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAEnB,IAAI,IAAI,CAAC,IAAI,YAAY,IAAI,EAAE,CAAC;YAC9B,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9B,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;YACpC,CAAC;YACD,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;gBACjB,QAAQ,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;YACzD,CAAC;QACH,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,YAAY,IAAI,EAAE,CAAC;YAC9B,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9B,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;YACpC,CAAC;YACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC/C,QAAQ,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;YACjD,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3C,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChD,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;QACtC,CAAC;IACH,CAAC;IAED,2CAA2C;IAC3C,MAAM,YAAY,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAA;IAElD,OAAO,CACL,gBAAgB;QAChB,CAAC,GAAG,SAAS,CAAC;aACX,GAAG,CAAC,CAAC,CAAC,EAAE,CACP,SAAS,CAAC,IAAI,GAAG,EAAS,EAAE,aAAa,EAAE,YAAY,EAAE,CAAC,CAAC,CAC5D;aACA,IAAI,CAAC,IAAI,CAAC,CACd,CAAA;AACH,CAAC","sourcesContent":["import type { DepID } from '@vltpkg/dep-id'\nimport { Edge } from '../edge.ts'\nimport { Node } from '../node.ts'\nimport type { EdgeLike, NodeLike } from '@vltpkg/types'\n\nexport type MermaidOutputGraph = {\n  edges: EdgeLike[]\n  importers: Set<NodeLike>\n  nodes: NodeLike[]\n}\n\ntype TraverseItem = {\n  self: EdgeLike | NodeLike\n  parent: EdgeLike | NodeLike | undefined\n}\n\nlet missingCount = 0\n\n/**\n * Generates a short identifier for a given index following the pattern:\n * 0 -> a, 1 -> b, ..., 25 -> z, 26 -> A, ..., 51 -> Z, 52 -> aa, 53 -> ab, etc.\n * This implements a bijective base-52 numbering system where a-z = 0-25, A-Z = 26-51\n */\nexport function generateShortId(index: number): string {\n  const base = 52\n\n  // Helper function to convert a digit (0-51) to character\n  const digitToChar = (digit: number): string => {\n    if (digit < 26) {\n      // a-z (0-25)\n      return String.fromCharCode(97 + digit)\n    } else {\n      // A-Z (26-51)\n      return String.fromCharCode(65 + (digit - 26))\n    }\n  }\n\n  // Bijective base-52 conversion\n  let result = ''\n  let num = index + 1 // Convert to 1-based for bijective base\n\n  while (num > 0) {\n    num-- // Adjust for 0-based indexing in each position\n    const remainder = num % base\n    result = digitToChar(remainder) + result\n    num = Math.floor(num / base)\n  }\n\n  return result\n}\n\n/**\n * Creates a mapping from DepID to short identifier\n */\nfunction createDepIdMapping(\n  importers: Set<NodeLike>,\n): Map<DepID, string> {\n  const mapping = new Map<DepID, string>()\n  const uniqueDepIds = new Set<DepID>()\n\n  // Collect all unique DepIDs from nodes & importers\n  const [importer] = importers\n  if (importer) {\n    for (const node of importer.graph.nodes.values()) {\n      uniqueDepIds.add(node.id)\n    }\n  }\n\n  // Create mapping for each unique DepID\n  let index = 0\n  for (const depId of uniqueDepIds) {\n    mapping.set(depId, generateShortId(index++))\n  }\n\n  return mapping\n}\n\nconst nodeLabel = (node: NodeLike) =>\n  `\"${String(node).replaceAll('@', '#64;')}\"`\n\nfunction parseNode(\n  seenNodes: Set<DepID>,\n  includedItems: Map<EdgeLike | NodeLike, boolean>,\n  depIdMapping: Map<DepID, string>,\n  node: NodeLike,\n) {\n  if (seenNodes.has(node.id) || !includedItems.get(node)) {\n    return ''\n  }\n  seenNodes.add(node.id)\n  const edges: string = [...node.edgesOut.values()]\n    .map(e => parseEdge(seenNodes, includedItems, depIdMapping, e))\n    .filter(Boolean)\n    .join('\\n')\n  const shortId = depIdMapping.get(node.id)\n  return `${shortId}(${nodeLabel(node)})${edges.length ? '\\n' : ''}${edges}`\n}\n\nfunction parseEdge(\n  seenNodes: Set<DepID>,\n  includedItems: Map<EdgeLike | NodeLike, boolean>,\n  depIdMapping: Map<DepID, string>,\n  edge: EdgeLike,\n) {\n  if (!includedItems.get(edge)) {\n    return ''\n  }\n\n  const fromShortId = depIdMapping.get(edge.from.id)\n  const edgeType = edge.type === 'prod' ? '' : ` (${edge.type})`\n  const edgeResult =\n    `${fromShortId}(${nodeLabel(edge.from)})` +\n    ` -->|\"${String(edge.spec).replaceAll('@', '#64;')}${edgeType}\"| `\n\n  const missingLabel =\n    edge.type.endsWith('ptional') ? 'Missing Optional' : 'Missing'\n  if (!edge.to) {\n    return edgeResult + `missing-${missingCount++}(${missingLabel})\\n`\n  }\n\n  const toShortId = depIdMapping.get(edge.to.id)\n  return (\n    edgeResult +\n    `${toShortId}(${nodeLabel(edge.to)})\\n` +\n    parseNode(seenNodes, includedItems, depIdMapping, edge.to)\n  )\n}\n\n/**\n * Returns a mermaid string representation of the graph.\n */\nexport function mermaidOutput({\n  edges,\n  importers,\n  nodes,\n}: MermaidOutputGraph) {\n  const seen = new Set<EdgeLike | NodeLike>()\n  const includedItems = new Map<EdgeLike | NodeLike, boolean>()\n  const traverse = new Set<TraverseItem>(\n    [...importers].map(i => ({ self: i, parent: undefined })),\n  )\n\n  for (const item of traverse) {\n    if (seen.has(item.self)) continue\n    seen.add(item.self)\n\n    if (item.self instanceof Edge) {\n      if (edges.includes(item.self)) {\n        includedItems.set(item.self, true)\n      }\n      if (item.self.to) {\n        traverse.add({ self: item.self.to, parent: item.self })\n      }\n    }\n\n    if (item.self instanceof Node) {\n      if (nodes.includes(item.self)) {\n        includedItems.set(item.self, true)\n      }\n      for (const edge of item.self.edgesOut.values()) {\n        traverse.add({ self: edge, parent: item.self })\n      }\n    }\n  }\n\n  for (const item of [...traverse].reverse()) {\n    if (includedItems.has(item.self) && item.parent) {\n      includedItems.set(item.parent, true)\n    }\n  }\n\n  // Create DepID to short identifier mapping\n  const depIdMapping = createDepIdMapping(importers)\n\n  return (\n    'flowchart TD\\n' +\n    [...importers]\n      .map(i =>\n        parseNode(new Set<DepID>(), includedItems, depIdMapping, i),\n      )\n      .join('\\n')\n  )\n}\n"]}

package/dist/esm/visualization/object-like-output.d.ts

@@ -1,3 +0,0 @@
-import type { GraphLike } from '@vltpkg/types';
-export declare function objectLikeOutput(graph: GraphLike): string;
-//# sourceMappingURL=object-like-output.d.ts.map

package/dist/esm/visualization/object-like-output.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"object-like-output.d.ts","sourceRoot":"","sources":["../../../src/visualization/object-like-output.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAY,SAAS,EAAY,MAAM,eAAe,CAAA;AA8DlE,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,SAAS,UAOhD"}

package/dist/esm/visualization/object-like-output.js

@@ -1,48 +0,0 @@
-import { inspect } from 'node:util';
-const addInspect = (o, fn) => (o[inspect.custom] = fn);
-function parseNode(seenNodes, graph, node) {
-    addInspect(node, () => {
-        const res = 'Node ' +
-            inspect(seenNodes.has(node) ?
-                { ref: node.id }
-                : {
-                    id: node.id,
-                    location: node.location,
-                    ...(node.importer ? { importer: true } : null),
-                    ...(node.dev ? { dev: true } : null),
-                    ...(node.optional ? { optional: true } : null),
-                    ...(node.resolved ? { resolved: node.resolved } : null),
-                    ...(node.integrity ?
-                        { integrity: node.integrity }
-                        : null),
-                    ...(node.edgesOut.size ?
-                        {
-                            edgesOut: [...node.edgesOut.values()].map(i => {
-                                seenNodes.add(node);
-                                return parseEdge(seenNodes, graph, i);
-                            }),
-                        }
-                        : (seenNodes.add(node), null)),
-                }, { depth: Infinity });
-        return res;
-    });
-    return node;
-}
-function parseEdge(seenNodes, graph, edge) {
-    addInspect(edge, () => {
-        const missingNode = `[missing package]: <${edge.name}@${edge.spec.bareSpec}>`;
-        const toLabel = edge.to ?
-            inspect(parseNode(seenNodes, graph, edge.to), {
-                depth: Infinity,
-            })
-            : missingNode;
-        return `Edge spec(${String(edge.spec)}) -${edge.type}-> to: ${toLabel}`;
-    });
-    return edge;
-}
-export function objectLikeOutput(graph) {
-    const seenNodes = new Set();
-    const importers = [...graph.importers];
-    return inspect(importers.map(i => parseNode(seenNodes, graph, i)), { depth: Infinity });
-}
-//# sourceMappingURL=object-like-output.js.map