@vltpkg/graph 0.0.0-15 → 0.0.0-16

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

@@ -1,31 +1,84 @@
 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, node) {
+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, e))
+        .map(e => parseEdge(seenNodes, includedItems, depIdMapping, e))
         .filter(Boolean)
         .join('\n');
-    return `${encodeURIComponent(node.id)}(${nodeLabel(node)})${edges.length ? '\n' : ''}${edges}`;
+    const shortId = depIdMapping.get(node.id);
+    return `${shortId}(${nodeLabel(node)})${edges.length ? '\n' : ''}${edges}`;
 }
-function parseEdge(seenNodes, includedItems, edge) {
+function parseEdge(seenNodes, includedItems, depIdMapping, edge) {
     if (!includedItems.get(edge)) {
         return '';
     }
-    const edgeResult = `${encodeURIComponent(edge.from.id)}(${nodeLabel(edge.from)})` +
-        ` -->|"${String(edge.spec).replaceAll('@', '#64;')} (${edge.type})"| `;
+    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 +
-        `${encodeURIComponent(edge.to.id)}(${nodeLabel(edge.to)})\n` +
-        parseNode(seenNodes, includedItems, edge.to));
+        `${toShortId}(${nodeLabel(edge.to)})\n` +
+        parseNode(seenNodes, includedItems, depIdMapping, edge.to));
 }
 /**
  * Returns a mermaid string representation of the graph.
@@ -60,9 +113,11 @@ export function mermaidOutput({ edges, importers, nodes, }) {
             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, i))
+            .map(i => parseNode(new Set(), includedItems, depIdMapping, i))
             .join('\n'));
 }
 //# sourceMappingURL=mermaid-output.js.map

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

@@ -1 +1 @@
-{"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,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,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,CAAC,CAAC,CAAC;SAChD,MAAM,CAAC,OAAO,CAAC;SACf,IAAI,CAAC,IAAI,CAAC,CAAA;IACb,OAAO,GAAG,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,CAAA;AAChG,CAAC;AAED,SAAS,SAAS,CAChB,SAAqB,EACrB,aAAgD,EAChD,IAAc;IAEd,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7B,OAAO,EAAE,CAAA;IACX,CAAC;IAED,MAAM,UAAU,GACd,GAAG,kBAAkB,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG;QAC9D,SAAS,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,KAAK,IAAI,CAAC,IAAI,MAAM,CAAA;IAExE,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,OAAO,CACL,UAAU;QACV,GAAG,kBAAkB,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK;QAC5D,SAAS,CAAC,SAAS,EAAE,aAAa,EAAE,IAAI,CAAC,EAAE,CAAC,CAC7C,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,OAAO,CACL,gBAAgB;QAChB,CAAC,GAAG,SAAS,CAAC;aACX,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,IAAI,GAAG,EAAS,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC;aACvD,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 '../types.ts'\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\nconst nodeLabel = (node: NodeLike) =>\n  `\"${String(node).replaceAll('@', '#64;')}\"`\n\nfunction parseNode(\n  seenNodes: Set<DepID>,\n  includedItems: Map<EdgeLike | NodeLike, boolean>,\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, e))\n    .filter(Boolean)\n    .join('\\n')\n  return `${encodeURIComponent(node.id)}(${nodeLabel(node)})${edges.length ? '\\n' : ''}${edges}`\n}\n\nfunction parseEdge(\n  seenNodes: Set<DepID>,\n  includedItems: Map<EdgeLike | NodeLike, boolean>,\n  edge: EdgeLike,\n) {\n  if (!includedItems.get(edge)) {\n    return ''\n  }\n\n  const edgeResult =\n    `${encodeURIComponent(edge.from.id)}(${nodeLabel(edge.from)})` +\n    ` -->|\"${String(edge.spec).replaceAll('@', '#64;')} (${edge.type})\"| `\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  return (\n    edgeResult +\n    `${encodeURIComponent(edge.to.id)}(${nodeLabel(edge.to)})\\n` +\n    parseNode(seenNodes, includedItems, 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  return (\n    'flowchart TD\\n' +\n    [...importers]\n      .map(i => parseNode(new Set<DepID>(), includedItems, i))\n      .join('\\n')\n  )\n}\n"]}
+{"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 '../types.ts'\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/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@vltpkg/graph",
   "description": "A library that helps understanding & expressing what happens on an install",
-  "version": "0.0.0-15",
+  "version": "0.0.0-16",
   "repository": {
     "type": "git",
     "url": "git+https://github.com/vltpkg/vltpkg.git",
@@ -23,35 +23,35 @@
     "graph-run": "^1.1.0",
     "path-scurry": "^2.0.0",
     "promise-call-limit": "^3.0.2",
-    "@vltpkg/cmd-shim": "0.0.0-15",
-    "@vltpkg/dep-id": "0.0.0-15",
-    "@vltpkg/dss-breadcrumb": "0.0.0-15",
-    "@vltpkg/fast-split": "0.0.0-15",
-    "@vltpkg/output": "0.0.0-15",
-    "@vltpkg/error-cause": "0.0.0-15",
-    "@vltpkg/package-info": "0.0.0-15",
-    "@vltpkg/package-json": "0.0.0-15",
-    "@vltpkg/rollback-remove": "0.0.0-15",
-    "@vltpkg/run": "0.0.0-15",
-    "@vltpkg/pick-manifest": "0.0.0-15",
-    "@vltpkg/spec": "0.0.0-15",
-    "@vltpkg/types": "0.0.0-15",
-    "@vltpkg/satisfies": "0.0.0-15",
-    "@vltpkg/vlt-json": "0.0.0-15",
-    "@vltpkg/workspaces": "0.0.0-15"
+    "@vltpkg/cmd-shim": "0.0.0-16",
+    "@vltpkg/dss-breadcrumb": "0.0.0-16",
+    "@vltpkg/error-cause": "0.0.0-16",
+    "@vltpkg/fast-split": "0.0.0-16",
+    "@vltpkg/output": "0.0.0-16",
+    "@vltpkg/package-info": "0.0.0-16",
+    "@vltpkg/pick-manifest": "0.0.0-16",
+    "@vltpkg/rollback-remove": "0.0.0-16",
+    "@vltpkg/package-json": "0.0.0-16",
+    "@vltpkg/run": "0.0.0-16",
+    "@vltpkg/satisfies": "0.0.0-16",
+    "@vltpkg/types": "0.0.0-16",
+    "@vltpkg/vlt-json": "0.0.0-16",
+    "@vltpkg/dep-id": "0.0.0-16",
+    "@vltpkg/spec": "0.0.0-16",
+    "@vltpkg/workspaces": "0.0.0-16"
   },
   "devDependencies": {
     "@eslint/js": "^9.28.0",
     "@types/node": "^22.15.29",
     "eslint": "^9.28.0",
-    "prettier": "^3.5.3",
+    "prettier": "^3.6.0",
     "tap": "^21.1.0",
     "tar": "^7.4.3",
     "tshy": "^3.0.2",
     "typedoc": "~0.27.9",
     "typescript": "5.7.3",
     "typescript-eslint": "^8.33.1",
-    "@vltpkg/vlt-json": "0.0.0-15"
+    "@vltpkg/vlt-json": "0.0.0-16"
   },
   "license": "BSD-2-Clause-Patent",
   "engines": {

package/dist/esm/ideal/check-nodes.d.ts

@@ -1,33 +0,0 @@
-import type { DepID } from '@vltpkg/dep-id';
-import type { GraphModifier } from '../modifiers.ts';
-import type { PackageInfoClient } from '@vltpkg/package-info';
-import type { SpecOptions } from '@vltpkg/spec';
-import type { PathScurry } from 'path-scurry';
-import type { Dependency } from '../dependencies.ts';
-import type { BuildIdealFromGraphOptions } from './types.ts';
-export type CheckNodesOptions = BuildIdealFromGraphOptions & SpecOptions & {
-    /**
-     * The dependencies to check.
-     */
-    check: Map<DepID, Map<string, Dependency>>;
-    /**
-     * A {@link GraphModifier} instance that holds information on how to
-     * modify the graph, replacing nodes and edges as defined in the
-     * project configuration.
-     */
-    modifiers?: GraphModifier;
-    /**
-     * The package info client to use.
-     */
-    packageInfo: PackageInfoClient;
-    /**
-     * The path scurry instance to use.
-     */
-    scurry: PathScurry;
-};
-/**
- * Runs an extra check and apply modifiers in all nodes that are not part
- * of the the list of nodes to add.
- */
-export declare const checkNodes: ({ check, graph, modifiers, packageInfo, scurry, ...specOptions }: CheckNodesOptions) => Promise<void>;
-//# sourceMappingURL=check-nodes.d.ts.map

package/dist/esm/ideal/check-nodes.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"check-nodes.d.ts","sourceRoot":"","sources":["../../../src/ideal/check-nodes.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAA;AAC3C,OAAO,KAAK,EACV,aAAa,EAEd,MAAM,iBAAiB,CAAA;AAExB,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAC7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAC/C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC7C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAA;AACpD,OAAO,KAAK,EAAE,0BAA0B,EAAE,MAAM,YAAY,CAAA;AAE5D,MAAM,MAAM,iBAAiB,GAAG,0BAA0B,GACxD,WAAW,GAAG;IACZ;;OAEG;IACH,KAAK,EAAE,GAAG,CAAC,KAAK,EAAE,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAA;IAC1C;;;;OAIG;IACH,SAAS,CAAC,EAAE,aAAa,CAAA;IACzB;;OAEG;IACH,WAAW,EAAE,iBAAiB,CAAA;IAC9B;;OAEG;IACH,MAAM,EAAE,UAAU,CAAA;CACnB,CAAA;AAEH;;;GAGG;AACH,eAAO,MAAM,UAAU,qEAOpB,iBAAiB,KAAG,OAAO,CAAC,IAAI,CAiDlC,CAAA"}

package/dist/esm/ideal/check-nodes.js

@@ -1,42 +0,0 @@
-import { appendNodes } from "./append-nodes.js";
-import { asDependency } from "../dependencies.js";
-/**
- * Runs an extra check and apply modifiers in all nodes that are not part
- * of the the list of nodes to add.
- */
-export const checkNodes = async ({ check, graph, modifiers, packageInfo, scurry, ...specOptions }) => {
-    const seen = new Set();
-    const importers = new Set(graph.importers);
-    // initializes the map of modifiers with any importers marked to check
-    for (const node of importers) {
-        const deps = check.get(node.id);
-        if (deps?.size) {
-            modifiers?.tryImporter(node);
-        }
-        else {
-            // otherwise we remove the importer from the list
-            importers.delete(node);
-        }
-    }
-    for (const node of importers) {
-        const modifiedDeps = new Map();
-        const modifierRefs = new Map();
-        for (const [name, edge] of node.edgesOut) {
-            // when we find a modifier that applies to a direct dependency, mark
-            // that dependency as a dependency to be added by append-nodes
-            const modifierRef = modifiers?.tryNewDependency(node, name);
-            if (modifierRef && 'spec' in modifierRef.modifier) {
-                modifiedDeps.set(name, asDependency({
-                    type: edge.type,
-                    spec: edge.spec,
-                }));
-                modifierRefs.set(name, modifierRef);
-            }
-        }
-        const deps = [...modifiedDeps.values()];
-        if (modifiedDeps.size) {
-            await appendNodes(modifiedDeps, packageInfo, graph, node, deps, scurry, specOptions, seen, modifiers, modifierRefs);
-        }
-    }
-};
-//# sourceMappingURL=check-nodes.js.map

package/dist/esm/ideal/check-nodes.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"check-nodes.js","sourceRoot":"","sources":["../../../src/ideal/check-nodes.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAC/C,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAA;AAmCjD;;;GAGG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG,KAAK,EAAE,EAC/B,KAAK,EACL,KAAK,EACL,SAAS,EACT,WAAW,EACX,MAAM,EACN,GAAG,WAAW,EACI,EAAiB,EAAE;IACrC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAS,CAAA;IAC7B,MAAM,SAAS,GAAG,IAAI,GAAG,CAAO,KAAK,CAAC,SAAS,CAAC,CAAA;IAEhD,sEAAsE;IACtE,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC/B,IAAI,IAAI,EAAE,IAAI,EAAE,CAAC;YACf,SAAS,EAAE,WAAW,CAAC,IAAI,CAAC,CAAA;QAC9B,CAAC;aAAM,CAAC;YACN,iDAAiD;YACjD,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACxB,CAAC;IACH,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,MAAM,YAAY,GAAG,IAAI,GAAG,EAAsB,CAAA;QAClD,MAAM,YAAY,GAAG,IAAI,GAAG,EAA+B,CAAA;QAC3D,KAAK,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YACzC,oEAAoE;YACpE,8DAA8D;YAC9D,MAAM,WAAW,GAAG,SAAS,EAAE,gBAAgB,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;YAC3D,IAAI,WAAW,IAAI,MAAM,IAAI,WAAW,CAAC,QAAQ,EAAE,CAAC;gBAClD,YAAY,CAAC,GAAG,CACd,IAAI,EACJ,YAAY,CAAC;oBACX,IAAI,EAAE,IAAI,CAAC,IAAI;oBACf,IAAI,EAAE,IAAI,CAAC,IAAI;iBAChB,CAAC,CACH,CAAA;gBACD,YAAY,CAAC,GAAG,CAAC,IAAI,EAAE,WAAW,CAAC,CAAA;YACrC,CAAC;QACH,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,CAAA;QACvC,IAAI,YAAY,CAAC,IAAI,EAAE,CAAC;YACtB,MAAM,WAAW,CACf,YAAY,EACZ,WAAW,EACX,KAAK,EACL,IAAI,EACJ,IAAI,EACJ,MAAM,EACN,WAAW,EACX,IAAI,EACJ,SAAS,EACT,YAAY,CACb,CAAA;QACH,CAAC;IACH,CAAC;AACH,CAAC,CAAA","sourcesContent":["import { appendNodes } from './append-nodes.ts'\nimport { asDependency } from '../dependencies.ts'\nimport type { DepID } from '@vltpkg/dep-id'\nimport type {\n  GraphModifier,\n  ModifierActiveEntry,\n} from '../modifiers.ts'\nimport type { Node } from '../node.ts'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport type { SpecOptions } from '@vltpkg/spec'\nimport type { PathScurry } from 'path-scurry'\nimport type { Dependency } from '../dependencies.ts'\nimport type { BuildIdealFromGraphOptions } from './types.ts'\n\nexport type CheckNodesOptions = BuildIdealFromGraphOptions &\n  SpecOptions & {\n    /**\n     * The dependencies to check.\n     */\n    check: Map<DepID, Map<string, Dependency>>\n    /**\n     * A {@link GraphModifier} instance that holds information on how to\n     * modify the graph, replacing nodes and edges as defined in the\n     * project configuration.\n     */\n    modifiers?: GraphModifier\n    /**\n     * The package info client to use.\n     */\n    packageInfo: PackageInfoClient\n    /**\n     * The path scurry instance to use.\n     */\n    scurry: PathScurry\n  }\n\n/**\n * Runs an extra check and apply modifiers in all nodes that are not part\n * of the the list of nodes to add.\n */\nexport const checkNodes = async ({\n  check,\n  graph,\n  modifiers,\n  packageInfo,\n  scurry,\n  ...specOptions\n}: CheckNodesOptions): Promise<void> => {\n  const seen = new Set<DepID>()\n  const importers = new Set<Node>(graph.importers)\n\n  // initializes the map of modifiers with any importers marked to check\n  for (const node of importers) {\n    const deps = check.get(node.id)\n    if (deps?.size) {\n      modifiers?.tryImporter(node)\n    } else {\n      // otherwise we remove the importer from the list\n      importers.delete(node)\n    }\n  }\n\n  for (const node of importers) {\n    const modifiedDeps = new Map<string, Dependency>()\n    const modifierRefs = new Map<string, ModifierActiveEntry>()\n    for (const [name, edge] of node.edgesOut) {\n      // when we find a modifier that applies to a direct dependency, mark\n      // that dependency as a dependency to be added by append-nodes\n      const modifierRef = modifiers?.tryNewDependency(node, name)\n      if (modifierRef && 'spec' in modifierRef.modifier) {\n        modifiedDeps.set(\n          name,\n          asDependency({\n            type: edge.type,\n            spec: edge.spec,\n          }),\n        )\n        modifierRefs.set(name, modifierRef)\n      }\n    }\n    const deps = [...modifiedDeps.values()]\n    if (modifiedDeps.size) {\n      await appendNodes(\n        modifiedDeps,\n        packageInfo,\n        graph,\n        node,\n        deps,\n        scurry,\n        specOptions,\n        seen,\n        modifiers,\n        modifierRefs,\n      )\n    }\n  }\n}\n"]}