@vltpkg/graph 0.0.0-22 → 0.0.0-24

package/dist/esm/diff.d.ts

@@ -45,6 +45,10 @@ export declare class Diff {
     constructor(from: Graph, to: Graph);
     [kCustomInspect](_: number, options?: InspectOptions): string;
     hasChanges(): boolean;
+    /**
+     * Return true if the diff only contains optional nodes.
+     */
+    optionalOnly(): boolean;
 }
 export {};
 //# sourceMappingURL=diff.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"diff.d.ts","sourceRoot":"","sources":["../../src/diff.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,WAAW,CAAA;AAC/C,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AACrC,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AACvC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAOrC,QAAA,MAAM,cAAc,eAA2C,CAAA;AAE/D;;;;;;;;;;GAUG;AACH,qBAAa,IAAI;IACf,IAAI,EAAE,KAAK,CAAA;IACX,EAAE,EAAE,KAAK,CAAA;IAET,WAAW,EAAE,MAAM,CAAA;IAEnB;;;OAGG;IACH,mBAAmB,UAAQ;IAE3B;;OAEG;IACH,KAAK;QACH,+DAA+D;;QAE/D,+DAA+D;;MAEhE;IAED;;OAEG;IACH,KAAK;QACH,qEAAqE;;QAErE,qEAAqE;;MAEtE;IAED,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,WAEvB;gBAEW,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK;IAyClC,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,cAAc,GAAG,MAAM;IAwC7D,UAAU,IAAI,OAAO;CAQtB"}
+{"version":3,"file":"diff.d.ts","sourceRoot":"","sources":["../../src/diff.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,WAAW,CAAA;AAC/C,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AACrC,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AACvC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAOrC,QAAA,MAAM,cAAc,eAA2C,CAAA;AAE/D;;;;;;;;;;GAUG;AACH,qBAAa,IAAI;IACf,IAAI,EAAE,KAAK,CAAA;IACX,EAAE,EAAE,KAAK,CAAA;IAET,WAAW,EAAE,MAAM,CAAA;IAEnB;;;OAGG;IACH,mBAAmB,UAAQ;IAE3B;;OAEG;IACH,KAAK;QACH,+DAA+D;;QAE/D,+DAA+D;;MAEhE;IAED;;OAEG;IACH,KAAK;QACH,qEAAqE;;QAErE,qEAAqE;;MAEtE;IAED,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,WAEvB;gBAEW,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,KAAK;IAyClC,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,CAAC,EAAE,cAAc,GAAG,MAAM;IAwC7D,UAAU,IAAI,OAAO;IASrB;;OAEG;IACH,YAAY,IAAI,OAAO;CAMxB"}

package/dist/esm/diff.js

@@ -125,5 +125,15 @@ ${lines
             this.edges.add.size > 0 ||
             this.edges.delete.size > 0);
     }
+    /**
+     * Return true if the diff only contains optional nodes.
+     */
+    optionalOnly() {
+        for (const node of this.nodes.add) {
+            if (!node.optional)
+                return false;
+        }
+        return true;
+    }
 }
 //# sourceMappingURL=diff.js.map

package/dist/esm/diff.js.map

@@ -1 +1 @@
-{"version":3,"file":"diff.js","sourceRoot":"","sources":["../../src/diff.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAM3C,uDAAuD;AACvD,6EAA6E;AAC7E,4BAA4B;AAC5B,wBAAwB;AAExB,MAAM,cAAc,GAAG,MAAM,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAA;AAE/D;;;;;;;;;;GAUG;AACH,MAAM,OAAO,IAAI;IACf,IAAI,CAAO;IACX,EAAE,CAAO;IAET,WAAW,CAAQ;IAEnB;;;OAGG;IACH,mBAAmB,GAAG,KAAK,CAAA;IAE3B;;OAEG;IACH,KAAK,GAAG;QACN,+DAA+D;QAC/D,GAAG,EAAE,IAAI,GAAG,EAAQ;QACpB,+DAA+D;QAC/D,MAAM,EAAE,IAAI,GAAG,EAAQ;KACxB,CAAA;IAED;;OAEG;IACH,KAAK,GAAG;QACN,qEAAqE;QACrE,GAAG,EAAE,IAAI,GAAG,EAAQ;QACpB,qEAAqE;QACrE,MAAM,EAAE,IAAI,GAAG,EAAQ;KACxB,CAAA;IAED,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,oBAAoB,CAAA;IAC7B,CAAC;IAED,YAAY,IAAW,EAAE,EAAS;QAChC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,EAAE,GAAG,EAAE,CAAA;QACZ,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAA;QACnC,IAAI,EAAE,CAAC,WAAW,KAAK,IAAI,CAAC,WAAW,EAAE,CAAC;YACxC,MAAM,KAAK,CAAC,oCAAoC,EAAE;gBAChD,MAAM,EAAE,IAAI,CAAC,WAAW;gBACxB,KAAK,EAAE,EAAE,CAAC,WAAW;aACtB,CAAC,CAAA;QACJ,CAAC;QAED,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YACzC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBACzC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YAC7B,CAAC;QACH,CAAC;QAED,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;YACvC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC3C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YAC1B,CAAC;QACH,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;YACjC,6CAA6C;YAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAClD,MAAM,QAAQ,GAAG,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACvD,IAAI,QAAQ,EAAE,EAAE,EAAE,EAAE,KAAK,IAAI,CAAC,EAAE,EAAE,EAAE;gBAAE,SAAQ;YAC9C,IAAI,QAAQ,EAAE,EAAE;gBAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;YACjD,IAAI,IAAI,CAAC,EAAE;gBAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACvC,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YACnC,0CAA0C;YAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAC9C,MAAM,MAAM,GAAG,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACnD,IAAI,MAAM,EAAE,EAAE,EAAE,EAAE,KAAK,IAAI,CAAC,EAAE,EAAE,EAAE;gBAAE,SAAQ;YAC5C,IAAI,IAAI,CAAC,EAAE;gBAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YACxC,IAAI,MAAM,EAAE,EAAE;gBAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QAC5C,CAAC;IACH,CAAC;IAED,CAAC,cAAc,CAAC,CAAC,CAAS,EAAE,OAAwB;QAClD,MAAM,GAAG,GACP,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;QACrD,MAAM,KAAK,GACT,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;QACrD,MAAM,KAAK,GAAa,EAAE,CAAA;QAC1B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;YAClC,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC,CAAA;QAC5B,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACrC,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC,CAAA;QAC5B,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;YAClC,oBAAoB;YACpB,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,CAAA;YAC5B,KAAK,CAAC,IAAI,CACR,KAAK,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,CAC3D,CAAA;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACrC,oBAAoB;YACpB,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,CAAA;YAC5B,KAAK,CAAC,IAAI,CACR,KAAK,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,CAC3D,CAAA;QACH,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAmB,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC1D,MAAM,KAAK,GACT,OAAO,EAAE,MAAM,CAAC,CAAC;YACf,CAAC,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;YACzD,CAAC,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAA;QAEpB,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;EACpC,KAAK;aACJ,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;aAClE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;aACzB,IAAI,CAAC,IAAI,CAAC;EACX,CAAA;IACA,CAAC;IAED,UAAU;QACR,OAAO,CACL,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC;YAC1B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAC3B,CAAA;IACH,CAAC;CACF","sourcesContent":["import { error } from '@vltpkg/error-cause'\nimport type { InspectOptions } from 'node:util'\nimport type { Edge } from './edge.ts'\nimport type { Graph } from './graph.ts'\nimport type { Node } from './node.ts'\n\n// XXX should file deps *always* be considered changed?\n// unless the thing containing it wasn't possibly changed because it's inside\n// a dep that didn't change?\n// Same with remote deps\n\nconst kCustomInspect = Symbol.for('nodejs.util.inspect.custom')\n\n/**\n * A Diff object is a representation of a set of changes from one\n * graph to another, typically from the actual graph as it is reified\n * on disk, to an intended ideal graph.\n *\n * The naming convention can get a bit confusing here, because it's a\n * set of directed changes from one set of directed objects to another.\n *\n * Within the context the Diff object, `from` is the Graph we're coming from,\n * and `to` is the Graph we're trying to create.\n */\nexport class Diff {\n  from: Graph\n  to: Graph\n\n  projectRoot: string\n\n  /**\n   * If changes need to be made later for failures of optional nodes,\n   * set this flag so that we know to call graph.gc() at the appropriate time.\n   */\n  hadOptionalFailures = false\n\n  /**\n   * Collection of nodes to add and delete\n   */\n  nodes = {\n    /** Nodes in the `to` graph that are not in the `from` graph */\n    add: new Set<Node>(),\n    /** Nodes in the `from` graph that are not in the `to` graph */\n    delete: new Set<Node>(),\n  }\n\n  /**\n   * Collection of nodes to add and delete\n   */\n  edges = {\n    /** Edges in the `to` graph that are not found in the `from` graph */\n    add: new Set<Edge>(),\n    /** Edges in the `from` graph that are not found in the `to` graph */\n    delete: new Set<Edge>(),\n  }\n\n  get [Symbol.toStringTag]() {\n    return '@vltpkg/graph.Diff'\n  }\n\n  constructor(from: Graph, to: Graph) {\n    this.from = from\n    this.to = to\n    this.projectRoot = from.projectRoot\n    if (to.projectRoot !== from.projectRoot) {\n      throw error('projectRoot mismatch in Graph diff', {\n        wanted: from.projectRoot,\n        found: to.projectRoot,\n      })\n    }\n\n    for (const [id, node] of this.from.nodes) {\n      if (!this.to.nodes.get(id)?.equals(node)) {\n        this.nodes.delete.add(node)\n      }\n    }\n\n    for (const [id, node] of this.to.nodes) {\n      if (!this.from.nodes.get(id)?.equals(node)) {\n        this.nodes.add.add(node)\n      }\n    }\n\n    for (const edge of this.to.edges) {\n      // the node with this dep, in the from  graph\n      const fromNode = this.from.nodes.get(edge.from.id)\n      const fromEdge = fromNode?.edgesOut.get(edge.spec.name)\n      if (fromEdge?.to?.id === edge.to?.id) continue\n      if (fromEdge?.to) this.edges.delete.add(fromEdge)\n      if (edge.to) this.edges.add.add(edge)\n    }\n    for (const edge of this.from.edges) {\n      // the node with this dep, in the to graph\n      const toNode = this.to.nodes.get(edge.from.id)\n      const toEdge = toNode?.edgesOut.get(edge.spec.name)\n      if (toEdge?.to?.id === edge.to?.id) continue\n      if (edge.to) this.edges.delete.add(edge)\n      if (toEdge?.to) this.edges.add.add(toEdge)\n    }\n  }\n\n  [kCustomInspect](_: number, options?: InspectOptions): string {\n    const red: [string, string] =\n      options?.colors ? ['\\x1b[31m', '\\x1b[m'] : ['', '']\n    const green: [string, string] =\n      options?.colors ? ['\\x1b[32m', '\\x1b[m'] : ['', '']\n    const lines: string[] = []\n    for (const node of this.nodes.add) {\n      lines.push(`+ ${node.id}`)\n    }\n    for (const node of this.nodes.delete) {\n      lines.push(`- ${node.id}`)\n    }\n    for (const edge of this.edges.add) {\n      /* c8 ignore next */\n      const to = edge.to?.id ?? ''\n      lines.push(\n        `+ ${edge.from.id} ${edge.type} ${edge.spec} ${to}`.trim(),\n      )\n    }\n    for (const edge of this.edges.delete) {\n      /* c8 ignore next */\n      const to = edge.to?.id ?? ''\n      lines.push(\n        `- ${edge.from.id} ${edge.type} ${edge.spec} ${to}`.trim(),\n      )\n    }\n    const wrap = (s: string, c: [string, string]) => c.join(s)\n    const color =\n      options?.colors ?\n        (s: string) => wrap(s, s.startsWith('+') ? green : red)\n      : (s: string) => s\n\n    return `${this[Symbol.toStringTag]} {\n${lines\n  .sort((a, b) => a.substring(1).localeCompare(b.substring(1), 'en'))\n  .map(s => '  ' + color(s))\n  .join('\\n')}\n}`\n  }\n\n  hasChanges(): boolean {\n    return (\n      this.nodes.add.size > 0 ||\n      this.nodes.delete.size > 0 ||\n      this.edges.add.size > 0 ||\n      this.edges.delete.size > 0\n    )\n  }\n}\n"]}
+{"version":3,"file":"diff.js","sourceRoot":"","sources":["../../src/diff.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAM3C,uDAAuD;AACvD,6EAA6E;AAC7E,4BAA4B;AAC5B,wBAAwB;AAExB,MAAM,cAAc,GAAG,MAAM,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAA;AAE/D;;;;;;;;;;GAUG;AACH,MAAM,OAAO,IAAI;IACf,IAAI,CAAO;IACX,EAAE,CAAO;IAET,WAAW,CAAQ;IAEnB;;;OAGG;IACH,mBAAmB,GAAG,KAAK,CAAA;IAE3B;;OAEG;IACH,KAAK,GAAG;QACN,+DAA+D;QAC/D,GAAG,EAAE,IAAI,GAAG,EAAQ;QACpB,+DAA+D;QAC/D,MAAM,EAAE,IAAI,GAAG,EAAQ;KACxB,CAAA;IAED;;OAEG;IACH,KAAK,GAAG;QACN,qEAAqE;QACrE,GAAG,EAAE,IAAI,GAAG,EAAQ;QACpB,qEAAqE;QACrE,MAAM,EAAE,IAAI,GAAG,EAAQ;KACxB,CAAA;IAED,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,oBAAoB,CAAA;IAC7B,CAAC;IAED,YAAY,IAAW,EAAE,EAAS;QAChC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,EAAE,GAAG,EAAE,CAAA;QACZ,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,WAAW,CAAA;QACnC,IAAI,EAAE,CAAC,WAAW,KAAK,IAAI,CAAC,WAAW,EAAE,CAAC;YACxC,MAAM,KAAK,CAAC,oCAAoC,EAAE;gBAChD,MAAM,EAAE,IAAI,CAAC,WAAW;gBACxB,KAAK,EAAE,EAAE,CAAC,WAAW;aACtB,CAAC,CAAA;QACJ,CAAC;QAED,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YACzC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBACzC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YAC7B,CAAC;QACH,CAAC;QAED,KAAK,MAAM,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;YACvC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC3C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YAC1B,CAAC;QACH,CAAC;QAED,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;YACjC,6CAA6C;YAC7C,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAClD,MAAM,QAAQ,GAAG,QAAQ,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACvD,IAAI,QAAQ,EAAE,EAAE,EAAE,EAAE,KAAK,IAAI,CAAC,EAAE,EAAE,EAAE;gBAAE,SAAQ;YAC9C,IAAI,QAAQ,EAAE,EAAE;gBAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;YACjD,IAAI,IAAI,CAAC,EAAE;gBAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACvC,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC;YACnC,0CAA0C;YAC1C,MAAM,MAAM,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAC9C,MAAM,MAAM,GAAG,MAAM,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACnD,IAAI,MAAM,EAAE,EAAE,EAAE,EAAE,KAAK,IAAI,CAAC,EAAE,EAAE,EAAE;gBAAE,SAAQ;YAC5C,IAAI,IAAI,CAAC,EAAE;gBAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YACxC,IAAI,MAAM,EAAE,EAAE;gBAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;QAC5C,CAAC;IACH,CAAC;IAED,CAAC,cAAc,CAAC,CAAC,CAAS,EAAE,OAAwB;QAClD,MAAM,GAAG,GACP,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;QACrD,MAAM,KAAK,GACT,OAAO,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC,UAAU,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;QACrD,MAAM,KAAK,GAAa,EAAE,CAAA;QAC1B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;YAClC,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC,CAAA;QAC5B,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACrC,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC,CAAA;QAC5B,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;YAClC,oBAAoB;YACpB,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,CAAA;YAC5B,KAAK,CAAC,IAAI,CACR,KAAK,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,CAC3D,CAAA;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;YACrC,oBAAoB;YACpB,MAAM,EAAE,GAAG,IAAI,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,CAAA;YAC5B,KAAK,CAAC,IAAI,CACR,KAAK,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI,EAAE,EAAE,CAAC,IAAI,EAAE,CAC3D,CAAA;QACH,CAAC;QACD,MAAM,IAAI,GAAG,CAAC,CAAS,EAAE,CAAmB,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAA;QAC1D,MAAM,KAAK,GACT,OAAO,EAAE,MAAM,CAAC,CAAC;YACf,CAAC,CAAS,EAAE,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC;YACzD,CAAC,CAAC,CAAC,CAAS,EAAE,EAAE,CAAC,CAAC,CAAA;QAEpB,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;EACpC,KAAK;aACJ,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC;aAClE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;aACzB,IAAI,CAAC,IAAI,CAAC;EACX,CAAA;IACA,CAAC;IAED,UAAU;QACR,OAAO,CACL,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC;YAC1B,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,GAAG,CAAC;YACvB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,GAAG,CAAC,CAC3B,CAAA;IACH,CAAC;IAED;;OAEG;IACH,YAAY;QACV,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;YAClC,IAAI,CAAC,IAAI,CAAC,QAAQ;gBAAE,OAAO,KAAK,CAAA;QAClC,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;CACF","sourcesContent":["import { error } from '@vltpkg/error-cause'\nimport type { InspectOptions } from 'node:util'\nimport type { Edge } from './edge.ts'\nimport type { Graph } from './graph.ts'\nimport type { Node } from './node.ts'\n\n// XXX should file deps *always* be considered changed?\n// unless the thing containing it wasn't possibly changed because it's inside\n// a dep that didn't change?\n// Same with remote deps\n\nconst kCustomInspect = Symbol.for('nodejs.util.inspect.custom')\n\n/**\n * A Diff object is a representation of a set of changes from one\n * graph to another, typically from the actual graph as it is reified\n * on disk, to an intended ideal graph.\n *\n * The naming convention can get a bit confusing here, because it's a\n * set of directed changes from one set of directed objects to another.\n *\n * Within the context the Diff object, `from` is the Graph we're coming from,\n * and `to` is the Graph we're trying to create.\n */\nexport class Diff {\n  from: Graph\n  to: Graph\n\n  projectRoot: string\n\n  /**\n   * If changes need to be made later for failures of optional nodes,\n   * set this flag so that we know to call graph.gc() at the appropriate time.\n   */\n  hadOptionalFailures = false\n\n  /**\n   * Collection of nodes to add and delete\n   */\n  nodes = {\n    /** Nodes in the `to` graph that are not in the `from` graph */\n    add: new Set<Node>(),\n    /** Nodes in the `from` graph that are not in the `to` graph */\n    delete: new Set<Node>(),\n  }\n\n  /**\n   * Collection of nodes to add and delete\n   */\n  edges = {\n    /** Edges in the `to` graph that are not found in the `from` graph */\n    add: new Set<Edge>(),\n    /** Edges in the `from` graph that are not found in the `to` graph */\n    delete: new Set<Edge>(),\n  }\n\n  get [Symbol.toStringTag]() {\n    return '@vltpkg/graph.Diff'\n  }\n\n  constructor(from: Graph, to: Graph) {\n    this.from = from\n    this.to = to\n    this.projectRoot = from.projectRoot\n    if (to.projectRoot !== from.projectRoot) {\n      throw error('projectRoot mismatch in Graph diff', {\n        wanted: from.projectRoot,\n        found: to.projectRoot,\n      })\n    }\n\n    for (const [id, node] of this.from.nodes) {\n      if (!this.to.nodes.get(id)?.equals(node)) {\n        this.nodes.delete.add(node)\n      }\n    }\n\n    for (const [id, node] of this.to.nodes) {\n      if (!this.from.nodes.get(id)?.equals(node)) {\n        this.nodes.add.add(node)\n      }\n    }\n\n    for (const edge of this.to.edges) {\n      // the node with this dep, in the from  graph\n      const fromNode = this.from.nodes.get(edge.from.id)\n      const fromEdge = fromNode?.edgesOut.get(edge.spec.name)\n      if (fromEdge?.to?.id === edge.to?.id) continue\n      if (fromEdge?.to) this.edges.delete.add(fromEdge)\n      if (edge.to) this.edges.add.add(edge)\n    }\n    for (const edge of this.from.edges) {\n      // the node with this dep, in the to graph\n      const toNode = this.to.nodes.get(edge.from.id)\n      const toEdge = toNode?.edgesOut.get(edge.spec.name)\n      if (toEdge?.to?.id === edge.to?.id) continue\n      if (edge.to) this.edges.delete.add(edge)\n      if (toEdge?.to) this.edges.add.add(toEdge)\n    }\n  }\n\n  [kCustomInspect](_: number, options?: InspectOptions): string {\n    const red: [string, string] =\n      options?.colors ? ['\\x1b[31m', '\\x1b[m'] : ['', '']\n    const green: [string, string] =\n      options?.colors ? ['\\x1b[32m', '\\x1b[m'] : ['', '']\n    const lines: string[] = []\n    for (const node of this.nodes.add) {\n      lines.push(`+ ${node.id}`)\n    }\n    for (const node of this.nodes.delete) {\n      lines.push(`- ${node.id}`)\n    }\n    for (const edge of this.edges.add) {\n      /* c8 ignore next */\n      const to = edge.to?.id ?? ''\n      lines.push(\n        `+ ${edge.from.id} ${edge.type} ${edge.spec} ${to}`.trim(),\n      )\n    }\n    for (const edge of this.edges.delete) {\n      /* c8 ignore next */\n      const to = edge.to?.id ?? ''\n      lines.push(\n        `- ${edge.from.id} ${edge.type} ${edge.spec} ${to}`.trim(),\n      )\n    }\n    const wrap = (s: string, c: [string, string]) => c.join(s)\n    const color =\n      options?.colors ?\n        (s: string) => wrap(s, s.startsWith('+') ? green : red)\n      : (s: string) => s\n\n    return `${this[Symbol.toStringTag]} {\n${lines\n  .sort((a, b) => a.substring(1).localeCompare(b.substring(1), 'en'))\n  .map(s => '  ' + color(s))\n  .join('\\n')}\n}`\n  }\n\n  hasChanges(): boolean {\n    return (\n      this.nodes.add.size > 0 ||\n      this.nodes.delete.size > 0 ||\n      this.edges.add.size > 0 ||\n      this.edges.delete.size > 0\n    )\n  }\n\n  /**\n   * Return true if the diff only contains optional nodes.\n   */\n  optionalOnly(): boolean {\n    for (const node of this.nodes.add) {\n      if (!node.optional) return false\n    }\n    return true\n  }\n}\n"]}

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

@@ -6,5 +6,12 @@ import type { Dependency } from '../dependencies.ts';
 import type { Graph } from '../graph.ts';
 import type { Node } from '../node.ts';
 import type { GraphModifier, ModifierActiveEntry } from '../modifiers.ts';
+/**
+ * Append new nodes in the given `graph` for dependencies specified at `add`
+ * and missing dependencies from the `deps` parameter.
+ *
+ * It also applies any modifiers that applies to a given node as it processes
+ * and builds the graph.
+ */
 export declare const appendNodes: (add: Map<string, Dependency>, packageInfo: PackageInfoClient, graph: Graph, fromNode: Node, deps: Dependency[], scurry: PathScurry, options: SpecOptions, seen: Set<DepID>, modifiers?: GraphModifier, modifierRefs?: Map<string, ModifierActiveEntry>) => Promise<void>;
 //# sourceMappingURL=append-nodes.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"append-nodes.d.ts","sourceRoot":"","sources":["../../../src/ideal/append-nodes.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAA;AAE3C,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAE7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAG/C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAE7C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAA;AACpD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AACxC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAEtC,OAAO,KAAK,EACV,aAAa,EACb,mBAAmB,EACpB,MAAM,iBAAiB,CAAA;AAsDxB,eAAO,MAAM,WAAW,QACjB,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,eACf,iBAAiB,SACvB,KAAK,YACF,IAAI,QACR,UAAU,EAAE,UACV,UAAU,WACT,WAAW,QACd,GAAG,CAAC,KAAK,CAAC,cACJ,aAAa,iBACV,GAAG,CAAC,MAAM,EAAE,mBAAmB,CAAC,kBAuKhD,CAAA"}
+{"version":3,"file":"append-nodes.d.ts","sourceRoot":"","sources":["../../../src/ideal/append-nodes.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAA;AAE3C,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAE7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAO/C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAE7C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAA;AACpD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AACxC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAEtC,OAAO,KAAK,EACV,aAAa,EACb,mBAAmB,EACpB,MAAM,iBAAiB,CAAA;AA4TxB;;;;;;GAMG;AACH,eAAO,MAAM,WAAW,QACjB,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,eACf,iBAAiB,SACvB,KAAK,YACF,IAAI,QACR,UAAU,EAAE,UACV,UAAU,WACT,WAAW,QACd,GAAG,CAAC,KAAK,CAAC,cACJ,aAAa,iBACV,GAAG,CAAC,MAAM,EAAE,mBAAmB,CAAC,kBAqEhD,CAAA"}

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

@@ -36,13 +36,14 @@ const getFileTypeInfo = (spec, fromNode, scurry) => {
     };
 };
 const isStringArray = (a) => Array.isArray(a) && !a.some(b => typeof b !== 'string');
-export const appendNodes = async (add, packageInfo, graph, fromNode, deps, scurry, options, seen, modifiers, modifierRefs) => {
-    /* c8 ignore next */
-    if (seen.has(fromNode.id))
-        return;
-    seen.add(fromNode.id);
-    await Promise.all(deps.map(async ({ spec, type }) => {
-        // see if there's a satisfying node in the graph currently
+/**
+ * Fetch manifests for dependencies and create placement tasks.
+ */
+const fetchManifestsForDeps = async (packageInfo, graph, fromNode, deps, scurry, modifierRefs, depth = 0) => {
+    // Create fetch tasks for all dependencies at this level
+    const fetchTasks = [];
+    for (const { spec: originalSpec, type } of deps) {
+        let spec = originalSpec;
         const fileTypeInfo = getFileTypeInfo(spec, fromNode, scurry);
         const activeModifier = modifierRefs?.get(spec.name);
         // here is the place we swap specs if a edge modifier was defined
@@ -55,17 +56,19 @@ export const appendNodes = async (add, packageInfo, graph, fromNode, deps, scurr
             'spec' in activeModifier.modifier) {
             spec = activeModifier.modifier.spec;
             if (spec.bareSpec === '-') {
-                return;
+                continue;
             }
         }
         const existingNode = graph.findResolution(spec, fromNode, queryModifier);
         if (existingNode) {
             graph.addEdge(type, spec, fromNode, existingNode);
-            return;
+            continue;
         }
         const edgeOptional = type === 'optional' || type === 'peerOptional';
-        const mani = await packageInfo
+        // Start manifest fetch immediately for parallel processing
+        const manifestPromise = packageInfo
             .manifest(spec, { from: scurry.resolve(fromNode.location) })
+            .then(manifest => manifest)
             .catch((er) => {
             // optional deps ignored if inaccessible
             if (edgeOptional || fromNode.optional) {
@@ -73,36 +76,72 @@ export const appendNodes = async (add, packageInfo, graph, fromNode, deps, scurr
             }
             throw er;
         });
-        // when an user is adding a nameless dependency, e.g: `github:foo/bar`,
-        // `file:./foo/bar`, we need to update the `add` option value to set the
-        // correct name once we have it, so that it can properly be stored in
-        // the `package.json` file at the end of reify.
-        if (mani?.name && spec.name === '(unknown)') {
+        const fetchTask = {
+            spec,
+            type,
+            fromNode,
+            fileTypeInfo,
+            activeModifier,
+            queryModifier,
+            edgeOptional,
+            manifestPromise,
+            depth,
+        };
+        fetchTasks.push(fetchTask);
+    }
+    // Create placement tasks
+    const placementTasks = [];
+    for (const fetchTask of fetchTasks) {
+        const manifest = await fetchTask.manifestPromise;
+        placementTasks.push({
+            fetchTask,
+            manifest,
+        });
+    }
+    return placementTasks;
+};
+/**
+ * Process placement tasks and collect child dependencies
+ */
+const processPlacementTasks = async (add, graph, options, placementTasks, modifiers) => {
+    const childDepsToProcess = [];
+    for (const placementTask of placementTasks) {
+        const { fetchTask, manifest } = placementTask;
+        let { spec } = fetchTask;
+        const type = fetchTask.type;
+        const fromNode = fetchTask.fromNode;
+        const fileTypeInfo = fetchTask.fileTypeInfo;
+        const activeModifier = fetchTask.activeModifier;
+        const queryModifier = fetchTask.queryModifier;
+        const edgeOptional = fetchTask.edgeOptional;
+        // Handle nameless dependencies
+        if (manifest?.name && spec.name === '(unknown)') {
             const s = add.get(String(spec));
             if (s) {
                 // removes the previous, placeholder entry key
                 add.delete(String(spec));
                 // replaces spec with a version with the correct name
-                spec = Spec.parse(mani.name, spec.bareSpec, options);
+                spec = Spec.parse(manifest.name, spec.bareSpec, options);
                 // updates the add map with the fixed up spec
                 const n = asDependency({
                     ...s,
                     spec,
                 });
-                add.set(mani.name, n);
+                add.set(manifest.name, n);
             }
         }
-        if (!mani) {
+        // handles missing manifest resolution
+        if (!manifest) {
             if (!edgeOptional && fromNode.isOptional()) {
                 // failed resolution of a non-optional dep of an optional node
                 // have to clean up the dependents
                 removeOptionalSubgraph(graph, fromNode);
-                return;
+                continue;
             }
             else if (edgeOptional) {
                 // failed resolution of an optional dep, just ignore it,
                 // nothing to prune because we never added it in the first place.
-                return;
+                continue;
             }
             else {
                 throw error('failed to resolve dependency', {
@@ -111,7 +150,8 @@ export const appendNodes = async (add, packageInfo, graph, fromNode, deps, scurr
                 });
             }
         }
-        const node = graph.placePackage(fromNode, type, spec, normalizeManifest(mani), fileTypeInfo?.id, queryModifier);
+        // places a new node in the graph representing a newly seen dependency
+        const node = graph.placePackage(fromNode, type, spec, normalizeManifest(manifest), fileTypeInfo?.id, queryModifier);
         /* c8 ignore start - not possible, already ensured manifest */
         if (!node) {
             throw error('failed to place package', {
@@ -120,29 +160,32 @@ export const appendNodes = async (add, packageInfo, graph, fromNode, deps, scurr
             });
         }
         /* c8 ignore stop */
+        // update the node modifier tracker
         if (activeModifier) {
             modifiers?.updateActiveEntry(node, activeModifier);
         }
+        // updates graph node information
         if (fileTypeInfo?.path && fileTypeInfo.isDirectory) {
             node.location = fileTypeInfo.path;
         }
         node.setResolved();
-        const nestedAppends = [];
-        const bundleDeps = node.manifest?.bundleDependencies;
+        // Collect child dependencies for processing in the next level
+        const bundleDeps = manifest.bundleDependencies;
         const bundled = new Set((node.id.startsWith('git') ||
             node.importer ||
             !isStringArray(bundleDeps)) ?
             []
             : bundleDeps);
+        // recursively process all child dependencies in the manifest
         const nextDeps = [];
         for (const depTypeName of longDependencyTypes) {
-            const depRecord = mani[depTypeName];
+            const depRecord = manifest[depTypeName];
             if (depRecord && shouldInstallDepType(node, depTypeName)) {
                 for (const [name, bareSpec] of Object.entries(depRecord)) {
                     if (bundled.has(name))
                         continue;
                     nextDeps.push({
-                        type: shorten(depTypeName, name, mani),
+                        type: shorten(depTypeName, name, manifest),
                         spec: Spec.parse(name, bareSpec, {
                             ...options,
                             registry: spec.registry,
@@ -151,10 +194,60 @@ export const appendNodes = async (add, packageInfo, graph, fromNode, deps, scurr
                 }
             }
         }
-        if (nextDeps.length) {
-            nestedAppends.push(appendNodes(add, packageInfo, graph, node, nextDeps, scurry, options, seen, modifiers, modifiers?.tryDependencies(node, nextDeps)));
+        if (nextDeps.length > 0) {
+            childDepsToProcess.push({
+                node,
+                deps: nextDeps,
+                modifierRefs: modifiers?.tryDependencies(node, nextDeps),
+            });
+        }
+    }
+    return { childDepsToProcess };
+};
+/**
+ * Append new nodes in the given `graph` for dependencies specified at `add`
+ * and missing dependencies from the `deps` parameter.
+ *
+ * It also applies any modifiers that applies to a given node as it processes
+ * and builds the graph.
+ */
+export const appendNodes = async (add, packageInfo, graph, fromNode, deps, scurry, options, seen, modifiers, modifierRefs) => {
+    /* c8 ignore next */
+    if (seen.has(fromNode.id))
+        return;
+    seen.add(fromNode.id);
+    // Use a queue for breadth-first processing
+    let currentLevelDeps = [
+        { node: fromNode, deps, modifierRefs, depth: 0 },
+    ];
+    while (currentLevelDeps.length > 0) {
+        const nextLevelDeps = [];
+        // Process all nodes at the current level in parallel
+        const levelResults = await Promise.all(currentLevelDeps.map(async ({ node, deps: nodeDeps, modifierRefs: nodeModifierRefs, depth, }) => {
+            // Mark node as seen when we start processing its dependencies
+            seen.add(node.id);
+            // Fetch manifests for this node's dependencies
+            const placementTasks = await fetchManifestsForDeps(packageInfo, graph, node, 
+            // Sort dependencies by spec.name for deterministic ordering
+            nodeDeps.sort((a, b) => a.spec.name.localeCompare(b.spec.name, 'en')), scurry, nodeModifierRefs, depth);
+            // Process the placement tasks and get child dependencies
+            return await processPlacementTasks(add, graph, options, placementTasks, modifiers);
+        }));
+        // Collect all child dependencies for the next level
+        for (const { childDepsToProcess } of levelResults) {
+            for (const childDep of childDepsToProcess) {
+                if (!seen.has(childDep.node.id)) {
+                    /* c8 ignore next */
+                    const currentDepth = currentLevelDeps[0]?.depth ?? 0;
+                    nextLevelDeps.push({
+                        ...childDep,
+                        depth: currentDepth + 1,
+                    });
+                }
+            }
         }
-        await Promise.all(nestedAppends);
-    }));
+        // Move to the next level
+        currentLevelDeps = nextLevelDeps;
+    }
 };
 //# sourceMappingURL=append-nodes.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"append-nodes.js","sourceRoot":"","sources":["../../../src/ideal/append-nodes.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAA;AAE/C,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAE3C,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AAEnC,OAAO,EAAE,mBAAmB,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAA;AAGtE,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAA;AAI1D,OAAO,EAAE,sBAAsB,EAAE,MAAM,gCAAgC,CAAA;AAYvE;;;GAGG;AACH,MAAM,oBAAoB,GAAG,CAC3B,IAAU,EACV,OAA2B,EAC3B,EAAE,CACF,OAAO,KAAK,iBAAiB;IAC7B,IAAI,CAAC,QAAQ;IACb,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;AAE3B;;GAEG;AACH,MAAM,eAAe,GAAG,CACtB,IAAU,EACV,QAAc,EACd,MAAkB,EACQ,EAAE;IAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAA;IACpB,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;QAAE,OAAM;IAE7B,4CAA4C;IAC5C,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACZ,MAAM,KAAK,CAAC,2BAA2B,EAAE,EAAE,IAAI,EAAE,CAAC,CAAA;IACpD,CAAC;IACD,oBAAoB;IAEpB,uEAAuE;IACvE,2EAA2E;IAC3E,uEAAuE;IACvE,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IACpE,MAAM,IAAI,GAAG,MAAM,CAAC,aAAa,EAAE,CAAA;IACnC,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAA;IAEzC,OAAO;QACL,IAAI;QACJ,EAAE;QACF,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,WAAW,EAAE;KACjD,CAAA;AACH,CAAC,CAAA;AAED,MAAM,aAAa,GAAG,CAAC,CAAU,EAAiB,EAAE,CAClD,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAA;AAEzD,MAAM,CAAC,MAAM,WAAW,GAAG,KAAK,EAC9B,GAA4B,EAC5B,WAA8B,EAC9B,KAAY,EACZ,QAAc,EACd,IAAkB,EAClB,MAAkB,EAClB,OAAoB,EACpB,IAAgB,EAChB,SAAyB,EACzB,YAA+C,EAC/C,EAAE;IACF,oBAAoB;IACpB,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QAAE,OAAM;IACjC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;IAErB,MAAM,OAAO,CAAC,GAAG,CACf,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,EAAE,EAAE;QAChC,0DAA0D;QAC1D,MAAM,YAAY,GAAG,eAAe,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAA;QAC5D,MAAM,cAAc,GAAG,YAAY,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAEnD,iEAAiE;QACjE,MAAM,aAAa,GAAG,cAAc,EAAE,QAAQ,CAAC,KAAK,CAAA;QACpD,MAAM,gBAAgB,GACpB,cAAc;YACd,cAAc,CAAC,qBAAqB,CAAC,OAAO;gBAC1C,cAAc,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAA;QAC3C,IACE,aAAa;YACb,gBAAgB;YAChB,MAAM,IAAI,cAAc,CAAC,QAAQ,EACjC,CAAC;YACD,IAAI,GAAG,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAA;YACnC,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,EAAE,CAAC;gBAC1B,OAAM;YACR,CAAC;QACH,CAAC;QAED,MAAM,YAAY,GAAG,KAAK,CAAC,cAAc,CACvC,IAAI,EACJ,QAAQ,EACR,aAAa,CACd,CAAA;QACD,IAAI,YAAY,EAAE,CAAC;YACjB,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAA;YACjD,OAAM;QACR,CAAC;QAED,MAAM,YAAY,GAChB,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,cAAc,CAAA;QAChD,MAAM,IAAI,GAAG,MAAM,WAAW;aAC3B,QAAQ,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;aAC3D,KAAK,CAAC,CAAC,EAAW,EAAE,EAAE;YACrB,wCAAwC;YACxC,IAAI,YAAY,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC;gBACtC,OAAO,SAAS,CAAA;YAClB,CAAC;YACD,MAAM,EAAE,CAAA;QACV,CAAC,CAAC,CAAA;QAEJ,uEAAuE;QACvE,wEAAwE;QACxE,qEAAqE;QACrE,+CAA+C;QAC/C,IAAI,IAAI,EAAE,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAC5C,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA;YAC/B,IAAI,CAAC,EAAE,CAAC;gBACN,8CAA8C;gBAC9C,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA;gBACxB,qDAAqD;gBACrD,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAA;gBACpD,6CAA6C;gBAC7C,MAAM,CAAC,GAAG,YAAY,CAAC;oBACrB,GAAG,CAAC;oBACJ,IAAI;iBACL,CAAC,CAAA;gBACF,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;YACvB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,IAAI,CAAC,YAAY,IAAI,QAAQ,CAAC,UAAU,EAAE,EAAE,CAAC;gBAC3C,8DAA8D;gBAC9D,kCAAkC;gBAClC,sBAAsB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;gBACvC,OAAM;YACR,CAAC;iBAAM,IAAI,YAAY,EAAE,CAAC;gBACxB,wDAAwD;gBACxD,iEAAiE;gBACjE,OAAM;YACR,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,CAAC,8BAA8B,EAAE;oBAC1C,IAAI;oBACJ,IAAI,EAAE,QAAQ,CAAC,QAAQ;iBACxB,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;QAED,MAAM,IAAI,GAAG,KAAK,CAAC,YAAY,CAC7B,QAAQ,EACR,IAAI,EACJ,IAAI,EACJ,iBAAiB,CAAC,IAAgB,CAAC,EACnC,YAAY,EAAE,EAAE,EAChB,aAAa,CACd,CAAA;QAED,8DAA8D;QAC9D,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,KAAK,CAAC,yBAAyB,EAAE;gBACrC,IAAI,EAAE,QAAQ,CAAC,QAAQ;gBACvB,IAAI;aACL,CAAC,CAAA;QACJ,CAAC;QACD,oBAAoB;QAEpB,IAAI,cAAc,EAAE,CAAC;YACnB,SAAS,EAAE,iBAAiB,CAAC,IAAI,EAAE,cAAc,CAAC,CAAA;QACpD,CAAC;QAED,IAAI,YAAY,EAAE,IAAI,IAAI,YAAY,CAAC,WAAW,EAAE,CAAC;YACnD,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAA;QACnC,CAAC;QACD,IAAI,CAAC,WAAW,EAAE,CAAA;QAClB,MAAM,aAAa,GAAuB,EAAE,CAAA;QAE5C,MAAM,UAAU,GAAG,IAAI,CAAC,QAAQ,EAAE,kBAAkB,CAAA;QACpD,MAAM,OAAO,GAAG,IAAI,GAAG,CACrB,CACE,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC;YACzB,IAAI,CAAC,QAAQ;YACb,CAAC,aAAa,CAAC,UAAU,CAAC,CAC3B,CAAC,CAAC;YACD,EAAE;YACJ,CAAC,CAAC,UAAU,CACb,CAAA;QAED,MAAM,QAAQ,GAAiB,EAAE,CAAA;QAEjC,KAAK,MAAM,WAAW,IAAI,mBAAmB,EAAE,CAAC;YAC9C,MAAM,SAAS,GACb,IAAI,CAAC,WAAW,CAAC,CAAA;YAEnB,IAAI,SAAS,IAAI,oBAAoB,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,CAAC;gBACzD,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;oBACzD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;wBAAE,SAAQ;oBAC/B,QAAQ,CAAC,IAAI,CAAC;wBACZ,IAAI,EAAE,OAAO,CAAC,WAAW,EAAE,IAAI,EAAE,IAAI,CAAC;wBACtC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,EAAE;4BAC/B,GAAG,OAAO;4BACV,QAAQ,EAAE,IAAI,CAAC,QAAQ;yBACxB,CAAC;qBACH,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,QAAQ,CAAC,MAAM,EAAE,CAAC;YACpB,aAAa,CAAC,IAAI,CAChB,WAAW,CACT,GAAG,EACH,WAAW,EACX,KAAK,EACL,IAAI,EACJ,QAAQ,EACR,MAAM,EACN,OAAO,EACP,IAAI,EACJ,SAAS,EACT,SAAS,EAAE,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC,CAC3C,CACF,CAAA;QACH,CAAC;QACD,MAAM,OAAO,CAAC,GAAG,CAAC,aAAa,CAAC,CAAA;IAClC,CAAC,CAAC,CACH,CAAA;AACH,CAAC,CAAA","sourcesContent":["import { joinDepIDTuple } from '@vltpkg/dep-id'\nimport type { DepID } from '@vltpkg/dep-id'\nimport { error } from '@vltpkg/error-cause'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport { Spec } from '@vltpkg/spec'\nimport type { SpecOptions } from '@vltpkg/spec'\nimport { longDependencyTypes, normalizeManifest } from '@vltpkg/types'\nimport type { DependencyTypeLong, Manifest } from '@vltpkg/types'\nimport type { PathScurry } from 'path-scurry'\nimport { asDependency, shorten } from '../dependencies.ts'\nimport type { Dependency } from '../dependencies.ts'\nimport type { Graph } from '../graph.ts'\nimport type { Node } from '../node.ts'\nimport { removeOptionalSubgraph } from '../remove-optional-subgraph.ts'\nimport type {\n  GraphModifier,\n  ModifierActiveEntry,\n} from '../modifiers.ts'\n\ntype FileTypeInfo = {\n  id: DepID\n  path: string\n  isDirectory: boolean\n}\n\n/**\n * Only install devDeps for git dependencies and importers\n * Everything else always gets installed\n */\nconst shouldInstallDepType = (\n  node: Node,\n  depType: DependencyTypeLong,\n) =>\n  depType !== 'devDependencies' ||\n  node.importer ||\n  node.id.startsWith('git')\n\n/**\n * Retrieve the {@link DepID} and location for a `file:` type {@link Node}.\n */\nconst getFileTypeInfo = (\n  spec: Spec,\n  fromNode: Node,\n  scurry: PathScurry,\n): FileTypeInfo | undefined => {\n  const f = spec.final\n  if (f.type !== 'file') return\n\n  /* c8 ignore start - should be impossible */\n  if (!f.file) {\n    throw error('no path on file specifier', { spec })\n  }\n  /* c8 ignore stop */\n\n  // Given that both linked folders and local tarballs (both defined with\n  // usage of the `file:` spec prefix) location needs to be relative to their\n  // parents, build the expected path and use it for both location and id\n  const target = scurry.cwd.resolve(fromNode.location).resolve(f.file)\n  const path = target.relativePosix()\n  const id = joinDepIDTuple(['file', path])\n\n  return {\n    path,\n    id,\n    isDirectory: !!target.lstatSync()?.isDirectory(),\n  }\n}\n\nconst isStringArray = (a: unknown): a is string[] =>\n  Array.isArray(a) && !a.some(b => typeof b !== 'string')\n\nexport const appendNodes = async (\n  add: Map<string, Dependency>,\n  packageInfo: PackageInfoClient,\n  graph: Graph,\n  fromNode: Node,\n  deps: Dependency[],\n  scurry: PathScurry,\n  options: SpecOptions,\n  seen: Set<DepID>,\n  modifiers?: GraphModifier,\n  modifierRefs?: Map<string, ModifierActiveEntry>,\n) => {\n  /* c8 ignore next */\n  if (seen.has(fromNode.id)) return\n  seen.add(fromNode.id)\n\n  await Promise.all(\n    deps.map(async ({ spec, type }) => {\n      // see if there's a satisfying node in the graph currently\n      const fileTypeInfo = getFileTypeInfo(spec, fromNode, scurry)\n      const activeModifier = modifierRefs?.get(spec.name)\n\n      // here is the place we swap specs if a edge modifier was defined\n      const queryModifier = activeModifier?.modifier.query\n      const completeModifier =\n        activeModifier &&\n        activeModifier.interactiveBreadcrumb.current ===\n          activeModifier.modifier.breadcrumb.last\n      if (\n        queryModifier &&\n        completeModifier &&\n        'spec' in activeModifier.modifier\n      ) {\n        spec = activeModifier.modifier.spec\n        if (spec.bareSpec === '-') {\n          return\n        }\n      }\n\n      const existingNode = graph.findResolution(\n        spec,\n        fromNode,\n        queryModifier,\n      )\n      if (existingNode) {\n        graph.addEdge(type, spec, fromNode, existingNode)\n        return\n      }\n\n      const edgeOptional =\n        type === 'optional' || type === 'peerOptional'\n      const mani = await packageInfo\n        .manifest(spec, { from: scurry.resolve(fromNode.location) })\n        .catch((er: unknown) => {\n          // optional deps ignored if inaccessible\n          if (edgeOptional || fromNode.optional) {\n            return undefined\n          }\n          throw er\n        })\n\n      // when an user is adding a nameless dependency, e.g: `github:foo/bar`,\n      // `file:./foo/bar`, we need to update the `add` option value to set the\n      // correct name once we have it, so that it can properly be stored in\n      // the `package.json` file at the end of reify.\n      if (mani?.name && spec.name === '(unknown)') {\n        const s = add.get(String(spec))\n        if (s) {\n          // removes the previous, placeholder entry key\n          add.delete(String(spec))\n          // replaces spec with a version with the correct name\n          spec = Spec.parse(mani.name, spec.bareSpec, options)\n          // updates the add map with the fixed up spec\n          const n = asDependency({\n            ...s,\n            spec,\n          })\n          add.set(mani.name, n)\n        }\n      }\n\n      if (!mani) {\n        if (!edgeOptional && fromNode.isOptional()) {\n          // failed resolution of a non-optional dep of an optional node\n          // have to clean up the dependents\n          removeOptionalSubgraph(graph, fromNode)\n          return\n        } else if (edgeOptional) {\n          // failed resolution of an optional dep, just ignore it,\n          // nothing to prune because we never added it in the first place.\n          return\n        } else {\n          throw error('failed to resolve dependency', {\n            spec,\n            from: fromNode.location,\n          })\n        }\n      }\n\n      const node = graph.placePackage(\n        fromNode,\n        type,\n        spec,\n        normalizeManifest(mani as Manifest),\n        fileTypeInfo?.id,\n        queryModifier,\n      )\n\n      /* c8 ignore start - not possible, already ensured manifest */\n      if (!node) {\n        throw error('failed to place package', {\n          from: fromNode.location,\n          spec,\n        })\n      }\n      /* c8 ignore stop */\n\n      if (activeModifier) {\n        modifiers?.updateActiveEntry(node, activeModifier)\n      }\n\n      if (fileTypeInfo?.path && fileTypeInfo.isDirectory) {\n        node.location = fileTypeInfo.path\n      }\n      node.setResolved()\n      const nestedAppends: Promise<unknown>[] = []\n\n      const bundleDeps = node.manifest?.bundleDependencies\n      const bundled = new Set<string>(\n        (\n          node.id.startsWith('git') ||\n          node.importer ||\n          !isStringArray(bundleDeps)\n        ) ?\n          []\n        : bundleDeps,\n      )\n\n      const nextDeps: Dependency[] = []\n\n      for (const depTypeName of longDependencyTypes) {\n        const depRecord: Record<string, string> | undefined =\n          mani[depTypeName]\n\n        if (depRecord && shouldInstallDepType(node, depTypeName)) {\n          for (const [name, bareSpec] of Object.entries(depRecord)) {\n            if (bundled.has(name)) continue\n            nextDeps.push({\n              type: shorten(depTypeName, name, mani),\n              spec: Spec.parse(name, bareSpec, {\n                ...options,\n                registry: spec.registry,\n              }),\n            })\n          }\n        }\n      }\n\n      if (nextDeps.length) {\n        nestedAppends.push(\n          appendNodes(\n            add,\n            packageInfo,\n            graph,\n            node,\n            nextDeps,\n            scurry,\n            options,\n            seen,\n            modifiers,\n            modifiers?.tryDependencies(node, nextDeps),\n          ),\n        )\n      }\n      await Promise.all(nestedAppends)\n    }),\n  )\n}\n"]}
+{"version":3,"file":"append-nodes.js","sourceRoot":"","sources":["../../../src/ideal/append-nodes.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAA;AAE/C,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAE3C,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AAEnC,OAAO,EAAE,mBAAmB,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAA;AAOtE,OAAO,EAAE,YAAY,EAAE,OAAO,EAAE,MAAM,oBAAoB,CAAA;AAI1D,OAAO,EAAE,sBAAsB,EAAE,MAAM,gCAAgC,CAAA;AAYvE;;;GAGG;AACH,MAAM,oBAAoB,GAAG,CAC3B,IAAU,EACV,OAA2B,EAC3B,EAAE,CACF,OAAO,KAAK,iBAAiB;IAC7B,IAAI,CAAC,QAAQ;IACb,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,CAAA;AAE3B;;GAEG;AACH,MAAM,eAAe,GAAG,CACtB,IAAU,EACV,QAAc,EACd,MAAkB,EACQ,EAAE;IAC5B,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAA;IACpB,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM;QAAE,OAAM;IAE7B,4CAA4C;IAC5C,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACZ,MAAM,KAAK,CAAC,2BAA2B,EAAE,EAAE,IAAI,EAAE,CAAC,CAAA;IACpD,CAAC;IACD,oBAAoB;IAEpB,uEAAuE;IACvE,2EAA2E;IAC3E,uEAAuE;IACvE,MAAM,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IACpE,MAAM,IAAI,GAAG,MAAM,CAAC,aAAa,EAAE,CAAA;IACnC,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC,CAAA;IAEzC,OAAO;QACL,IAAI;QACJ,EAAE;QACF,WAAW,EAAE,CAAC,CAAC,MAAM,CAAC,SAAS,EAAE,EAAE,WAAW,EAAE;KACjD,CAAA;AACH,CAAC,CAAA;AAED,MAAM,aAAa,GAAG,CAAC,CAAU,EAAiB,EAAE,CAClD,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,KAAK,QAAQ,CAAC,CAAA;AAsCzD;;GAEG;AACH,MAAM,qBAAqB,GAAG,KAAK,EACjC,WAA8B,EAC9B,KAAY,EACZ,QAAc,EACd,IAAkB,EAClB,MAAkB,EAClB,YAA+C,EAC/C,KAAK,GAAG,CAAC,EACqB,EAAE;IAChC,wDAAwD;IACxD,MAAM,UAAU,GAAwB,EAAE,CAAA;IAE1C,KAAK,MAAM,EAAE,IAAI,EAAE,YAAY,EAAE,IAAI,EAAE,IAAI,IAAI,EAAE,CAAC;QAChD,IAAI,IAAI,GAAG,YAAY,CAAA;QACvB,MAAM,YAAY,GAAG,eAAe,CAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAA;QAC5D,MAAM,cAAc,GAAG,YAAY,EAAE,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAEnD,iEAAiE;QACjE,MAAM,aAAa,GAAG,cAAc,EAAE,QAAQ,CAAC,KAAK,CAAA;QACpD,MAAM,gBAAgB,GACpB,cAAc;YACd,cAAc,CAAC,qBAAqB,CAAC,OAAO;gBAC1C,cAAc,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,CAAA;QAC3C,IACE,aAAa;YACb,gBAAgB;YAChB,MAAM,IAAI,cAAc,CAAC,QAAQ,EACjC,CAAC;YACD,IAAI,GAAG,cAAc,CAAC,QAAQ,CAAC,IAAI,CAAA;YACnC,IAAI,IAAI,CAAC,QAAQ,KAAK,GAAG,EAAE,CAAC;gBAC1B,SAAQ;YACV,CAAC;QACH,CAAC;QAED,MAAM,YAAY,GAAG,KAAK,CAAC,cAAc,CACvC,IAAI,EACJ,QAAQ,EACR,aAAa,CACd,CAAA;QACD,IAAI,YAAY,EAAE,CAAC;YACjB,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAA;YACjD,SAAQ;QACV,CAAC;QAED,MAAM,YAAY,GAChB,IAAI,KAAK,UAAU,IAAI,IAAI,KAAK,cAAc,CAAA;QAEhD,2DAA2D;QAC3D,MAAM,eAAe,GAAG,WAAW;aAChC,QAAQ,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;aAC3D,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,QAAgC,CAAC;aAClD,KAAK,CAAC,CAAC,EAAW,EAAE,EAAE;YACrB,wCAAwC;YACxC,IAAI,YAAY,IAAI,QAAQ,CAAC,QAAQ,EAAE,CAAC;gBACtC,OAAO,SAAS,CAAA;YAClB,CAAC;YACD,MAAM,EAAE,CAAA;QACV,CAAC,CAAC,CAAA;QAEJ,MAAM,SAAS,GAAsB;YACnC,IAAI;YACJ,IAAI;YACJ,QAAQ;YACR,YAAY;YACZ,cAAc;YACd,aAAa;YACb,YAAY;YACZ,eAAe;YACf,KAAK;SACN,CAAA;QAED,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;IAC5B,CAAC;IAED,yBAAyB;IACzB,MAAM,cAAc,GAAwB,EAAE,CAAA;IAC9C,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;QACnC,MAAM,QAAQ,GAAG,MAAM,SAAS,CAAC,eAAe,CAAA;QAEhD,cAAc,CAAC,IAAI,CAAC;YAClB,SAAS;YACT,QAAQ;SACT,CAAC,CAAA;IACJ,CAAC;IAED,OAAO,cAAc,CAAA;AACvB,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,qBAAqB,GAAG,KAAK,EACjC,GAA4B,EAC5B,KAAY,EACZ,OAAoB,EACpB,cAAmC,EACnC,SAAyB,EAGxB,EAAE;IACH,MAAM,kBAAkB,GAAqC,EAAE,CAAA;IAE/D,KAAK,MAAM,aAAa,IAAI,cAAc,EAAE,CAAC;QAC3C,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,aAAa,CAAA;QAC7C,IAAI,EAAE,IAAI,EAAE,GAAG,SAAS,CAAA;QACxB,MAAM,IAAI,GAAG,SAAS,CAAC,IAAI,CAAA;QAC3B,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAA;QACnC,MAAM,YAAY,GAAG,SAAS,CAAC,YAAY,CAAA;QAC3C,MAAM,cAAc,GAAG,SAAS,CAAC,cAAc,CAAA;QAC/C,MAAM,aAAa,GAAG,SAAS,CAAC,aAAa,CAAA;QAC7C,MAAM,YAAY,GAAG,SAAS,CAAC,YAAY,CAAA;QAE3C,+BAA+B;QAC/B,IAAI,QAAQ,EAAE,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAChD,MAAM,CAAC,GAAG,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA;YAC/B,IAAI,CAAC,EAAE,CAAC;gBACN,8CAA8C;gBAC9C,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA;gBACxB,qDAAqD;gBACrD,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAA;gBACxD,6CAA6C;gBAC7C,MAAM,CAAC,GAAG,YAAY,CAAC;oBACrB,GAAG,CAAC;oBACJ,IAAI;iBACL,CAAC,CAAA;gBACF,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;YAC3B,CAAC;QACH,CAAC;QAED,sCAAsC;QACtC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,IAAI,CAAC,YAAY,IAAI,QAAQ,CAAC,UAAU,EAAE,EAAE,CAAC;gBAC3C,8DAA8D;gBAC9D,kCAAkC;gBAClC,sBAAsB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;gBACvC,SAAQ;YACV,CAAC;iBAAM,IAAI,YAAY,EAAE,CAAC;gBACxB,wDAAwD;gBACxD,iEAAiE;gBACjE,SAAQ;YACV,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,CAAC,8BAA8B,EAAE;oBAC1C,IAAI;oBACJ,IAAI,EAAE,QAAQ,CAAC,QAAQ;iBACxB,CAAC,CAAA;YACJ,CAAC;QACH,CAAC;QAED,sEAAsE;QACtE,MAAM,IAAI,GAAG,KAAK,CAAC,YAAY,CAC7B,QAAQ,EACR,IAAI,EACJ,IAAI,EACJ,iBAAiB,CAAC,QAAQ,CAAC,EAC3B,YAAY,EAAE,EAAE,EAChB,aAAa,CACd,CAAA;QAED,8DAA8D;QAC9D,IAAI,CAAC,IAAI,EAAE,CAAC;YACV,MAAM,KAAK,CAAC,yBAAyB,EAAE;gBACrC,IAAI,EAAE,QAAQ,CAAC,QAAQ;gBACvB,IAAI;aACL,CAAC,CAAA;QACJ,CAAC;QACD,oBAAoB;QAEpB,mCAAmC;QACnC,IAAI,cAAc,EAAE,CAAC;YACnB,SAAS,EAAE,iBAAiB,CAAC,IAAI,EAAE,cAAc,CAAC,CAAA;QACpD,CAAC;QAED,iCAAiC;QACjC,IAAI,YAAY,EAAE,IAAI,IAAI,YAAY,CAAC,WAAW,EAAE,CAAC;YACnD,IAAI,CAAC,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAA;QACnC,CAAC;QACD,IAAI,CAAC,WAAW,EAAE,CAAA;QAElB,8DAA8D;QAC9D,MAAM,UAAU,GAAG,QAAQ,CAAC,kBAAkB,CAAA;QAC9C,MAAM,OAAO,GAAG,IAAI,GAAG,CACrB,CACE,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC;YACzB,IAAI,CAAC,QAAQ;YACb,CAAC,aAAa,CAAC,UAAU,CAAC,CAC3B,CAAC,CAAC;YACD,EAAE;YACJ,CAAC,CAAC,UAAU,CACb,CAAA;QAED,6DAA6D;QAC7D,MAAM,QAAQ,GAAiB,EAAE,CAAA;QAEjC,KAAK,MAAM,WAAW,IAAI,mBAAmB,EAAE,CAAC;YAC9C,MAAM,SAAS,GACb,QAAQ,CAAC,WAAW,CAAC,CAAA;YAEvB,IAAI,SAAS,IAAI,oBAAoB,CAAC,IAAI,EAAE,WAAW,CAAC,EAAE,CAAC;gBACzD,KAAK,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;oBACzD,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC;wBAAE,SAAQ;oBAC/B,QAAQ,CAAC,IAAI,CAAC;wBACZ,IAAI,EAAE,OAAO,CAAC,WAAW,EAAE,IAAI,EAAE,QAAQ,CAAC;wBAC1C,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,EAAE;4BAC/B,GAAG,OAAO;4BACV,QAAQ,EAAE,IAAI,CAAC,QAAQ;yBACxB,CAAC;qBACH,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QAED,IAAI,QAAQ,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACxB,kBAAkB,CAAC,IAAI,CAAC;gBACtB,IAAI;gBACJ,IAAI,EAAE,QAAQ;gBACd,YAAY,EAAE,SAAS,EAAE,eAAe,CAAC,IAAI,EAAE,QAAQ,CAAC;aACzD,CAAC,CAAA;QACJ,CAAC;IACH,CAAC;IAED,OAAO,EAAE,kBAAkB,EAAE,CAAA;AAC/B,CAAC,CAAA;AAED;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,KAAK,EAC9B,GAA4B,EAC5B,WAA8B,EAC9B,KAAY,EACZ,QAAc,EACd,IAAkB,EAClB,MAAkB,EAClB,OAAoB,EACpB,IAAgB,EAChB,SAAyB,EACzB,YAA+C,EAC/C,EAAE;IACF,oBAAoB;IACpB,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;QAAE,OAAM;IACjC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;IAErB,2CAA2C;IAC3C,IAAI,gBAAgB,GAAsB;QACxC,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,YAAY,EAAE,KAAK,EAAE,CAAC,EAAE;KACjD,CAAA;IAED,OAAO,gBAAgB,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACnC,MAAM,aAAa,GAAsB,EAAE,CAAA;QAE3C,qDAAqD;QACrD,MAAM,YAAY,GAAG,MAAM,OAAO,CAAC,GAAG,CACpC,gBAAgB,CAAC,GAAG,CAClB,KAAK,EAAE,EACL,IAAI,EACJ,IAAI,EAAE,QAAQ,EACd,YAAY,EAAE,gBAAgB,EAC9B,KAAK,GACW,EAAE,EAAE;YACpB,8DAA8D;YAC9D,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAEjB,+CAA+C;YAC/C,MAAM,cAAc,GAAG,MAAM,qBAAqB,CAChD,WAAW,EACX,KAAK,EACL,IAAI;YACJ,4DAA4D;YAC5D,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACrB,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAC7C,EACD,MAAM,EACN,gBAAgB,EAChB,KAAK,CACN,CAAA;YAED,yDAAyD;YACzD,OAAO,MAAM,qBAAqB,CAChC,GAAG,EACH,KAAK,EACL,OAAO,EACP,cAAc,EACd,SAAS,CACV,CAAA;QACH,CAAC,CACF,CACF,CAAA;QAED,oDAAoD;QACpD,KAAK,MAAM,EAAE,kBAAkB,EAAE,IAAI,YAAY,EAAE,CAAC;YAClD,KAAK,MAAM,QAAQ,IAAI,kBAAkB,EAAE,CAAC;gBAC1C,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBAChC,oBAAoB;oBACpB,MAAM,YAAY,GAAG,gBAAgB,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,CAAA;oBACpD,aAAa,CAAC,IAAI,CAAC;wBACjB,GAAG,QAAQ;wBACX,KAAK,EAAE,YAAY,GAAG,CAAC;qBACxB,CAAC,CAAA;gBACJ,CAAC;YACH,CAAC;QACH,CAAC;QAED,yBAAyB;QACzB,gBAAgB,GAAG,aAAa,CAAA;IAClC,CAAC;AACH,CAAC,CAAA","sourcesContent":["import { joinDepIDTuple } from '@vltpkg/dep-id'\nimport type { DepID } from '@vltpkg/dep-id'\nimport { error } from '@vltpkg/error-cause'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport { Spec } from '@vltpkg/spec'\nimport type { SpecOptions } from '@vltpkg/spec'\nimport { longDependencyTypes, normalizeManifest } from '@vltpkg/types'\nimport type {\n  DependencyTypeLong,\n  DependencySaveType,\n  Manifest,\n} from '@vltpkg/types'\nimport type { PathScurry } from 'path-scurry'\nimport { asDependency, shorten } from '../dependencies.ts'\nimport type { Dependency } from '../dependencies.ts'\nimport type { Graph } from '../graph.ts'\nimport type { Node } from '../node.ts'\nimport { removeOptionalSubgraph } from '../remove-optional-subgraph.ts'\nimport type {\n  GraphModifier,\n  ModifierActiveEntry,\n} from '../modifiers.ts'\n\ntype FileTypeInfo = {\n  id: DepID\n  path: string\n  isDirectory: boolean\n}\n\n/**\n * Only install devDeps for git dependencies and importers\n * Everything else always gets installed\n */\nconst shouldInstallDepType = (\n  node: Node,\n  depType: DependencyTypeLong,\n) =>\n  depType !== 'devDependencies' ||\n  node.importer ||\n  node.id.startsWith('git')\n\n/**\n * Retrieve the {@link DepID} and location for a `file:` type {@link Node}.\n */\nconst getFileTypeInfo = (\n  spec: Spec,\n  fromNode: Node,\n  scurry: PathScurry,\n): FileTypeInfo | undefined => {\n  const f = spec.final\n  if (f.type !== 'file') return\n\n  /* c8 ignore start - should be impossible */\n  if (!f.file) {\n    throw error('no path on file specifier', { spec })\n  }\n  /* c8 ignore stop */\n\n  // Given that both linked folders and local tarballs (both defined with\n  // usage of the `file:` spec prefix) location needs to be relative to their\n  // parents, build the expected path and use it for both location and id\n  const target = scurry.cwd.resolve(fromNode.location).resolve(f.file)\n  const path = target.relativePosix()\n  const id = joinDepIDTuple(['file', path])\n\n  return {\n    path,\n    id,\n    isDirectory: !!target.lstatSync()?.isDirectory(),\n  }\n}\n\nconst isStringArray = (a: unknown): a is string[] =>\n  Array.isArray(a) && !a.some(b => typeof b !== 'string')\n\n/**\n * Represents a manifest fetch operation with all the context needed.\n */\ntype ManifestFetchTask = {\n  spec: Spec\n  type: DependencySaveType\n  fromNode: Node\n  fileTypeInfo?: FileTypeInfo\n  activeModifier?: ModifierActiveEntry\n  queryModifier?: string\n  edgeOptional: boolean\n  manifestPromise: Promise<Manifest | undefined>\n  depth: number\n}\n\n/**\n * Represents a node placement operation that depends on a resolved manifest.\n */\ntype NodePlacementTask = {\n  fetchTask: ManifestFetchTask\n  manifest: Manifest | undefined\n  node?: Node\n  childDeps?: Dependency[]\n  childModifierRefs?: Map<string, ModifierActiveEntry>\n}\n\n/**\n * Represents an ongoing append operation for a node and its dependencies.\n */\ntype AppendNodeEntry = {\n  node: Node\n  deps: Dependency[]\n  modifierRefs?: Map<string, ModifierActiveEntry>\n  depth: number\n}\n\n/**\n * Fetch manifests for dependencies and create placement tasks.\n */\nconst fetchManifestsForDeps = async (\n  packageInfo: PackageInfoClient,\n  graph: Graph,\n  fromNode: Node,\n  deps: Dependency[],\n  scurry: PathScurry,\n  modifierRefs?: Map<string, ModifierActiveEntry>,\n  depth = 0,\n): Promise<NodePlacementTask[]> => {\n  // Create fetch tasks for all dependencies at this level\n  const fetchTasks: ManifestFetchTask[] = []\n\n  for (const { spec: originalSpec, type } of deps) {\n    let spec = originalSpec\n    const fileTypeInfo = getFileTypeInfo(spec, fromNode, scurry)\n    const activeModifier = modifierRefs?.get(spec.name)\n\n    // here is the place we swap specs if a edge modifier was defined\n    const queryModifier = activeModifier?.modifier.query\n    const completeModifier =\n      activeModifier &&\n      activeModifier.interactiveBreadcrumb.current ===\n        activeModifier.modifier.breadcrumb.last\n    if (\n      queryModifier &&\n      completeModifier &&\n      'spec' in activeModifier.modifier\n    ) {\n      spec = activeModifier.modifier.spec\n      if (spec.bareSpec === '-') {\n        continue\n      }\n    }\n\n    const existingNode = graph.findResolution(\n      spec,\n      fromNode,\n      queryModifier,\n    )\n    if (existingNode) {\n      graph.addEdge(type, spec, fromNode, existingNode)\n      continue\n    }\n\n    const edgeOptional =\n      type === 'optional' || type === 'peerOptional'\n\n    // Start manifest fetch immediately for parallel processing\n    const manifestPromise = packageInfo\n      .manifest(spec, { from: scurry.resolve(fromNode.location) })\n      .then(manifest => manifest as Manifest | undefined)\n      .catch((er: unknown) => {\n        // optional deps ignored if inaccessible\n        if (edgeOptional || fromNode.optional) {\n          return undefined\n        }\n        throw er\n      })\n\n    const fetchTask: ManifestFetchTask = {\n      spec,\n      type,\n      fromNode,\n      fileTypeInfo,\n      activeModifier,\n      queryModifier,\n      edgeOptional,\n      manifestPromise,\n      depth,\n    }\n\n    fetchTasks.push(fetchTask)\n  }\n\n  // Create placement tasks\n  const placementTasks: NodePlacementTask[] = []\n  for (const fetchTask of fetchTasks) {\n    const manifest = await fetchTask.manifestPromise\n\n    placementTasks.push({\n      fetchTask,\n      manifest,\n    })\n  }\n\n  return placementTasks\n}\n\n/**\n * Process placement tasks and collect child dependencies\n */\nconst processPlacementTasks = async (\n  add: Map<string, Dependency>,\n  graph: Graph,\n  options: SpecOptions,\n  placementTasks: NodePlacementTask[],\n  modifiers?: GraphModifier,\n): Promise<{\n  childDepsToProcess: Omit<AppendNodeEntry, 'depth'>[]\n}> => {\n  const childDepsToProcess: Omit<AppendNodeEntry, 'depth'>[] = []\n\n  for (const placementTask of placementTasks) {\n    const { fetchTask, manifest } = placementTask\n    let { spec } = fetchTask\n    const type = fetchTask.type\n    const fromNode = fetchTask.fromNode\n    const fileTypeInfo = fetchTask.fileTypeInfo\n    const activeModifier = fetchTask.activeModifier\n    const queryModifier = fetchTask.queryModifier\n    const edgeOptional = fetchTask.edgeOptional\n\n    // Handle nameless dependencies\n    if (manifest?.name && spec.name === '(unknown)') {\n      const s = add.get(String(spec))\n      if (s) {\n        // removes the previous, placeholder entry key\n        add.delete(String(spec))\n        // replaces spec with a version with the correct name\n        spec = Spec.parse(manifest.name, spec.bareSpec, options)\n        // updates the add map with the fixed up spec\n        const n = asDependency({\n          ...s,\n          spec,\n        })\n        add.set(manifest.name, n)\n      }\n    }\n\n    // handles missing manifest resolution\n    if (!manifest) {\n      if (!edgeOptional && fromNode.isOptional()) {\n        // failed resolution of a non-optional dep of an optional node\n        // have to clean up the dependents\n        removeOptionalSubgraph(graph, fromNode)\n        continue\n      } else if (edgeOptional) {\n        // failed resolution of an optional dep, just ignore it,\n        // nothing to prune because we never added it in the first place.\n        continue\n      } else {\n        throw error('failed to resolve dependency', {\n          spec,\n          from: fromNode.location,\n        })\n      }\n    }\n\n    // places a new node in the graph representing a newly seen dependency\n    const node = graph.placePackage(\n      fromNode,\n      type,\n      spec,\n      normalizeManifest(manifest),\n      fileTypeInfo?.id,\n      queryModifier,\n    )\n\n    /* c8 ignore start - not possible, already ensured manifest */\n    if (!node) {\n      throw error('failed to place package', {\n        from: fromNode.location,\n        spec,\n      })\n    }\n    /* c8 ignore stop */\n\n    // update the node modifier tracker\n    if (activeModifier) {\n      modifiers?.updateActiveEntry(node, activeModifier)\n    }\n\n    // updates graph node information\n    if (fileTypeInfo?.path && fileTypeInfo.isDirectory) {\n      node.location = fileTypeInfo.path\n    }\n    node.setResolved()\n\n    // Collect child dependencies for processing in the next level\n    const bundleDeps = manifest.bundleDependencies\n    const bundled = new Set<string>(\n      (\n        node.id.startsWith('git') ||\n        node.importer ||\n        !isStringArray(bundleDeps)\n      ) ?\n        []\n      : bundleDeps,\n    )\n\n    // recursively process all child dependencies in the manifest\n    const nextDeps: Dependency[] = []\n\n    for (const depTypeName of longDependencyTypes) {\n      const depRecord: Record<string, string> | undefined =\n        manifest[depTypeName]\n\n      if (depRecord && shouldInstallDepType(node, depTypeName)) {\n        for (const [name, bareSpec] of Object.entries(depRecord)) {\n          if (bundled.has(name)) continue\n          nextDeps.push({\n            type: shorten(depTypeName, name, manifest),\n            spec: Spec.parse(name, bareSpec, {\n              ...options,\n              registry: spec.registry,\n            }),\n          })\n        }\n      }\n    }\n\n    if (nextDeps.length > 0) {\n      childDepsToProcess.push({\n        node,\n        deps: nextDeps,\n        modifierRefs: modifiers?.tryDependencies(node, nextDeps),\n      })\n    }\n  }\n\n  return { childDepsToProcess }\n}\n\n/**\n * Append new nodes in the given `graph` for dependencies specified at `add`\n * and missing dependencies from the `deps` parameter.\n *\n * It also applies any modifiers that applies to a given node as it processes\n * and builds the graph.\n */\nexport const appendNodes = async (\n  add: Map<string, Dependency>,\n  packageInfo: PackageInfoClient,\n  graph: Graph,\n  fromNode: Node,\n  deps: Dependency[],\n  scurry: PathScurry,\n  options: SpecOptions,\n  seen: Set<DepID>,\n  modifiers?: GraphModifier,\n  modifierRefs?: Map<string, ModifierActiveEntry>,\n) => {\n  /* c8 ignore next */\n  if (seen.has(fromNode.id)) return\n  seen.add(fromNode.id)\n\n  // Use a queue for breadth-first processing\n  let currentLevelDeps: AppendNodeEntry[] = [\n    { node: fromNode, deps, modifierRefs, depth: 0 },\n  ]\n\n  while (currentLevelDeps.length > 0) {\n    const nextLevelDeps: AppendNodeEntry[] = []\n\n    // Process all nodes at the current level in parallel\n    const levelResults = await Promise.all(\n      currentLevelDeps.map(\n        async ({\n          node,\n          deps: nodeDeps,\n          modifierRefs: nodeModifierRefs,\n          depth,\n        }: AppendNodeEntry) => {\n          // Mark node as seen when we start processing its dependencies\n          seen.add(node.id)\n\n          // Fetch manifests for this node's dependencies\n          const placementTasks = await fetchManifestsForDeps(\n            packageInfo,\n            graph,\n            node,\n            // Sort dependencies by spec.name for deterministic ordering\n            nodeDeps.sort((a, b) =>\n              a.spec.name.localeCompare(b.spec.name, 'en'),\n            ),\n            scurry,\n            nodeModifierRefs,\n            depth,\n          )\n\n          // Process the placement tasks and get child dependencies\n          return await processPlacementTasks(\n            add,\n            graph,\n            options,\n            placementTasks,\n            modifiers,\n          )\n        },\n      ),\n    )\n\n    // Collect all child dependencies for the next level\n    for (const { childDepsToProcess } of levelResults) {\n      for (const childDep of childDepsToProcess) {\n        if (!seen.has(childDep.node.id)) {\n          /* c8 ignore next */\n          const currentDepth = currentLevelDeps[0]?.depth ?? 0\n          nextLevelDeps.push({\n            ...childDep,\n            depth: currentDepth + 1,\n          })\n        }\n      }\n    }\n\n    // Move to the next level\n    currentLevelDeps = nextLevelDeps\n  }\n}\n"]}

package/dist/esm/reify/index.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/reify/index.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAI7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAEpD,OAAO,KAAK,EACV,2BAA2B,EAC3B,8BAA8B,EAC/B,MAAM,oBAAoB,CAAA;AAC3B,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AACjC,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AAExC,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAA;AAqBpD,MAAM,MAAM,YAAY,GAAG,WAAW,GAAG;IACvC,GAAG,CAAC,EAAE,2BAA2B,CAAA;IACjC,MAAM,CAAC,EAAE,8BAA8B,CAAA;IACvC,KAAK,EAAE,KAAK,CAAA;IACZ,MAAM,CAAC,EAAE,KAAK,CAAA;IACd,WAAW,EAAE,iBAAiB,CAAA;IAC9B,SAAS,CAAC,EAAE,aAAa,CAAA;CAC1B,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,KAAK,YAAmB,YAAY,kBAoChD,CAAA"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/reify/index.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAI7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAEpD,OAAO,KAAK,EACV,2BAA2B,EAC3B,8BAA8B,EAC/B,MAAM,oBAAoB,CAAA;AAC3B,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AACjC,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AAExC,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAA;AAqBpD,MAAM,MAAM,YAAY,GAAG,WAAW,GAAG;IACvC,GAAG,CAAC,EAAE,2BAA2B,CAAA;IACjC,MAAM,CAAC,EAAE,8BAA8B,CAAA;IACvC,KAAK,EAAE,KAAK,CAAA;IACZ,MAAM,CAAC,EAAE,KAAK,CAAA;IACd,WAAW,EAAE,iBAAiB,CAAA;IAC9B,SAAS,CAAC,EAAE,aAAa,CAAA;CAC1B,CAAA;AAED;;GAEG;AACH,eAAO,MAAM,KAAK,YAAmB,YAAY,kBAsChD,CAAA"}

package/dist/esm/reify/index.js

@@ -28,7 +28,8 @@ export const reify = async (options) => {
             loadManifests: true,
         });
     const diff = new Diff(actual, graph);
-    if (!diff.hasChanges()) {
+    const skipOptionalOnly = options.add?.modifiedDependencies && diff.optionalOnly();
+    if (!diff.hasChanges() || skipOptionalOnly) {
         // nothing to do, so just return the diff
         done();
         return diff;

package/dist/esm/reify/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/reify/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAE1C,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAA;AACxD,OAAO,EAAE,oBAAoB,EAAE,MAAM,SAAS,CAAA;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAA;AAE9C,OAAO,EAAE,IAAI,IAAI,UAAU,EAAE,MAAM,mBAAmB,CAAA;AAKtD,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAEjC,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAA;AAEtC,OAAO,EACL,YAAY,EACZ,QAAQ,EACR,UAAU,GACX,MAAM,qBAAqB,CAAA;AAC5B,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AACzC,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AACzC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AAClC,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAC/C,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAA;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AACxC,OAAO,EAAE,iBAAiB,EAAE,MAAM,oCAAoC,CAAA;AACtE,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAA;AAEtC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,oBAAoB,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAA;AAczD;;GAEG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,KAAK,EAAE,OAAqB,EAAE,EAAE;IACnD,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,CAAA;IAE/B,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAA;IAEjC,MAAM,MAAM,GACV,OAAO,CAAC,MAAM;QACd,UAAU,CAAC;YACT,GAAG,OAAO;YACV,aAAa,EAAE,IAAI;SACpB,CAAC,CAAA;IAEJ,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IACpC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,EAAE,CAAC;QACvB,yCAAyC;QACzC,IAAI,EAAE,CAAA;QACN,OAAO,IAAI,CAAA;IACb,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,cAAc,EAAE,CAAA;IACpC,IAAI,OAAO,GAAG,KAAK,CAAA;IACnB,IAAI,CAAC;QACH,MAAM,MAAM,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;QACpC,OAAO,CAAC,OAAO,EAAE,CAAA;QACjB,OAAO,GAAG,IAAI,CAAA;IAChB,CAAC;YAAS,CAAC;QACT,qBAAqB;QACrB,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,MAAM,QAAQ,CAAC,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAA;QACvD,CAAC;QACD,oBAAoB;IACtB,CAAC;IAED,IAAI,EAAE,CAAA;IAEN,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAED,MAAM,MAAM,GAAG,KAAK,EAClB,OAAqB,EACrB,IAAU,EACV,OAAuB,EACvB,EAAE;IACF,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,EAAE,GAAG,OAAO,CAAA;IACjE,MAAM,wBAAwB,GAC5B,GAAG,EAAE,oBAAoB,IAAI,MAAM,EAAE,oBAAoB,CAAC,CAAC;QACzD,iBAAiB,CAAC;YAChB,GAAG;YACH,MAAM;YACN,KAAK,EAAE,OAAO,CAAC,KAAK;YACpB,WAAW;SACZ,CAAC;QACJ,CAAC,CAAC,SAAS,CAAA;IAEb,uEAAuE;IACvE,mEAAmE;IACnE,qEAAqE;IACrE,uBAAuB;IACvB,MAAM,MAAM,GAAG,YAAY,CAAC,OAAO,CAAC,CAAA;IACpC,MAAM,OAAO,GAA+B,QAAQ,CAClD,IAAI,EACJ,MAAM,EACN,OAAO,EACP,OAAO,EACP,WAAW,CACZ,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAA;IAE5C,mDAAmD;IACnD,IAAI,OAAO,CAAC,MAAM;QAAE,MAAM,SAAS,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,CAAC,CAAA;IAEvD,6DAA6D;IAC7D,MAAM,WAAW,GAAuB,QAAQ,CAC9C,IAAI,EACJ,WAAW,EACX,MAAM,EACN,OAAO,CACR,CAAA;IACD,IAAI,WAAW,CAAC,MAAM;QAAE,MAAM,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;IAEtD,MAAM,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;IAE9C,gCAAgC;IAChC,MAAM,KAAK,CAAC,IAAI,EAAE,WAAW,EAAE,MAAM,CAAC,CAAA;IAEtC,oBAAoB;IACpB,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IAEtB,sDAAsD;IACtD,yDAAyD;IACzD,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC7B,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC;YAC/C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAC3B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAC7B,CAAC;IACH,CAAC;IACD,UAAU,CAAC,OAAO,CAAC,CAAA;IAEnB,iCAAiC;IACjC,MAAM,SAAS,GAAuB,WAAW,CAC/C,IAAI,EACJ,OAAO,EACP,MAAM,CACP,CAAA;IACD,IAAI,SAAS,CAAC,MAAM;QAAE,MAAM,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;IAElD,6DAA6D;IAC7D,wBAAwB,EAAE,EAAE,CAAA;IAE5B,6CAA6C;IAC7C,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE,KAAK,CAAC,CAAA;IAExD,8DAA8D;IAC9D,IAAI,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,EAAE,CAAC;QACjC,YAAY,CACV,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAC1B,MAAM,CAAC,OAAO,CAAC,4BAA4B,CAAC,CAC7C,CAAA;IACH,CAAC;AACH,CAAC,CAAA","sourcesContent":["import { graphStep } from '@vltpkg/output'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport { RollbackRemove } from '@vltpkg/rollback-remove'\nimport { availableParallelism } from 'node:os'\nimport { callLimit } from 'promise-call-limit'\nimport type { LoadOptions } from '../actual/load.ts'\nimport { load as loadActual } from '../actual/load.ts'\nimport type {\n  AddImportersDependenciesMap,\n  RemoveImportersDependenciesMap,\n} from '../dependencies.ts'\nimport { Diff } from '../diff.ts'\nimport type { Graph } from '../graph.ts'\nimport { lockfile } from '../index.ts'\nimport type { GraphModifier } from '../modifiers.ts'\nimport {\n  lockfileData,\n  saveData,\n  saveHidden,\n} from '../lockfile/save.ts'\nimport { addEdges } from './add-edges.ts'\nimport { addNodes } from './add-nodes.ts'\nimport { build } from './build.ts'\nimport { deleteEdges } from './delete-edges.ts'\nimport { deleteNodes } from './delete-nodes.ts'\nimport { internalHoist } from './internal-hoist.ts'\nimport { rollback } from './rollback.ts'\nimport { updatePackageJson } from './update-importers-package-json.ts'\nimport { copyFileSync } from 'node:fs'\n\nconst limit = Math.max(availableParallelism() - 1, 1) * 8\n\n// - [ ] depid's with peer resolutions\n// - [ ] depid shortening\n\nexport type ReifyOptions = LoadOptions & {\n  add?: AddImportersDependenciesMap\n  remove?: RemoveImportersDependenciesMap\n  graph: Graph\n  actual?: Graph\n  packageInfo: PackageInfoClient\n  modifiers?: GraphModifier\n}\n\n/**\n * Make the current project match the supplied graph.\n */\nexport const reify = async (options: ReifyOptions) => {\n  const done = graphStep('reify')\n\n  const { graph, scurry } = options\n\n  const actual =\n    options.actual ??\n    loadActual({\n      ...options,\n      loadManifests: true,\n    })\n\n  const diff = new Diff(actual, graph)\n  if (!diff.hasChanges()) {\n    // nothing to do, so just return the diff\n    done()\n    return diff\n  }\n\n  const remover = new RollbackRemove()\n  let success = false\n  try {\n    await reify_(options, diff, remover)\n    remover.confirm()\n    success = true\n  } finally {\n    /* c8 ignore start */\n    if (!success) {\n      await rollback(remover, diff, scurry).catch(() => {})\n    }\n    /* c8 ignore stop */\n  }\n\n  done()\n\n  return diff\n}\n\nconst reify_ = async (\n  options: ReifyOptions,\n  diff: Diff,\n  remover: RollbackRemove,\n) => {\n  const { add, remove, packageInfo, packageJson, scurry } = options\n  const saveImportersPackageJson =\n    add?.modifiedDependencies || remove?.modifiedDependencies ?\n      updatePackageJson({\n        add,\n        remove,\n        graph: options.graph,\n        packageJson,\n      })\n    : undefined\n\n  // before anything else happens, grab the ideal tree as it was resolved\n  // so that we can store it in the lockfile. We do this here so that\n  // any failed/removed optional deps are not reflected in the lockfile\n  // data as it is saved.\n  const lfData = lockfileData(options)\n  const actions: (() => Promise<unknown>)[] = addNodes(\n    diff,\n    scurry,\n    remover,\n    options,\n    packageInfo,\n  ).concat(deleteEdges(diff, scurry, remover))\n\n  // need to wait, so that the nodes exist to link to\n  if (actions.length) await callLimit(actions, { limit })\n\n  // create all node_modules symlinks, and link bins to nm/.bin\n  const edgeActions: Promise<unknown>[] = addEdges(\n    diff,\n    packageJson,\n    scurry,\n    remover,\n  )\n  if (edgeActions.length) await Promise.all(edgeActions)\n\n  await internalHoist(diff.to, options, remover)\n\n  // run lifecycles and chmod bins\n  await build(diff, packageJson, scurry)\n\n  // save the lockfile\n  lockfile.save(options)\n\n  // if we had to change the actual graph along the way,\n  // make sure we do not leave behind any unreachable nodes\n  if (diff.hadOptionalFailures) {\n    for (const node of options.graph.gc().values()) {\n      diff.nodes.add.delete(node)\n      diff.nodes.delete.add(node)\n    }\n  }\n  saveHidden(options)\n\n  // delete garbage from the store.\n  const rmActions: Promise<unknown>[] = deleteNodes(\n    diff,\n    remover,\n    scurry,\n  )\n  if (rmActions.length) await Promise.all(rmActions)\n\n  // updates package.json files if anything was added / removed\n  saveImportersPackageJson?.()\n\n  // write the ideal graph data to the lockfile\n  saveData(lfData, scurry.resolve('vlt-lock.json'), false)\n\n  // update the store config reference if a config file was used\n  if (scurry.lstatSync('vlt.json')) {\n    copyFileSync(\n      scurry.resolve('vlt.json'),\n      scurry.resolve('node_modules/.vlt/vlt.json'),\n    )\n  }\n}\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/reify/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAE1C,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAA;AACxD,OAAO,EAAE,oBAAoB,EAAE,MAAM,SAAS,CAAA;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAA;AAE9C,OAAO,EAAE,IAAI,IAAI,UAAU,EAAE,MAAM,mBAAmB,CAAA;AAKtD,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAEjC,OAAO,EAAE,QAAQ,EAAE,MAAM,aAAa,CAAA;AAEtC,OAAO,EACL,YAAY,EACZ,QAAQ,EACR,UAAU,GACX,MAAM,qBAAqB,CAAA;AAC5B,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AACzC,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AACzC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AAClC,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAC/C,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAA;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AACxC,OAAO,EAAE,iBAAiB,EAAE,MAAM,oCAAoC,CAAA;AACtE,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAA;AAEtC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,oBAAoB,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAA;AAczD;;GAEG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,KAAK,EAAE,OAAqB,EAAE,EAAE;IACnD,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,CAAA;IAE/B,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,OAAO,CAAA;IAEjC,MAAM,MAAM,GACV,OAAO,CAAC,MAAM;QACd,UAAU,CAAC;YACT,GAAG,OAAO;YACV,aAAa,EAAE,IAAI;SACpB,CAAC,CAAA;IAEJ,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IACpC,MAAM,gBAAgB,GACpB,OAAO,CAAC,GAAG,EAAE,oBAAoB,IAAI,IAAI,CAAC,YAAY,EAAE,CAAA;IAC1D,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,gBAAgB,EAAE,CAAC;QAC3C,yCAAyC;QACzC,IAAI,EAAE,CAAA;QACN,OAAO,IAAI,CAAA;IACb,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,cAAc,EAAE,CAAA;IACpC,IAAI,OAAO,GAAG,KAAK,CAAA;IACnB,IAAI,CAAC;QACH,MAAM,MAAM,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;QACpC,OAAO,CAAC,OAAO,EAAE,CAAA;QACjB,OAAO,GAAG,IAAI,CAAA;IAChB,CAAC;YAAS,CAAC;QACT,qBAAqB;QACrB,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,MAAM,QAAQ,CAAC,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAA;QACvD,CAAC;QACD,oBAAoB;IACtB,CAAC;IAED,IAAI,EAAE,CAAA;IAEN,OAAO,IAAI,CAAA;AACb,CAAC,CAAA;AAED,MAAM,MAAM,GAAG,KAAK,EAClB,OAAqB,EACrB,IAAU,EACV,OAAuB,EACvB,EAAE;IACF,MAAM,EAAE,GAAG,EAAE,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,EAAE,GAAG,OAAO,CAAA;IACjE,MAAM,wBAAwB,GAC5B,GAAG,EAAE,oBAAoB,IAAI,MAAM,EAAE,oBAAoB,CAAC,CAAC;QACzD,iBAAiB,CAAC;YAChB,GAAG;YACH,MAAM;YACN,KAAK,EAAE,OAAO,CAAC,KAAK;YACpB,WAAW;SACZ,CAAC;QACJ,CAAC,CAAC,SAAS,CAAA;IAEb,uEAAuE;IACvE,mEAAmE;IACnE,qEAAqE;IACrE,uBAAuB;IACvB,MAAM,MAAM,GAAG,YAAY,CAAC,OAAO,CAAC,CAAA;IACpC,MAAM,OAAO,GAA+B,QAAQ,CAClD,IAAI,EACJ,MAAM,EACN,OAAO,EACP,OAAO,EACP,WAAW,CACZ,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAA;IAE5C,mDAAmD;IACnD,IAAI,OAAO,CAAC,MAAM;QAAE,MAAM,SAAS,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,CAAC,CAAA;IAEvD,6DAA6D;IAC7D,MAAM,WAAW,GAAuB,QAAQ,CAC9C,IAAI,EACJ,WAAW,EACX,MAAM,EACN,OAAO,CACR,CAAA;IACD,IAAI,WAAW,CAAC,MAAM;QAAE,MAAM,OAAO,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;IAEtD,MAAM,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;IAE9C,gCAAgC;IAChC,MAAM,KAAK,CAAC,IAAI,EAAE,WAAW,EAAE,MAAM,CAAC,CAAA;IAEtC,oBAAoB;IACpB,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;IAEtB,sDAAsD;IACtD,yDAAyD;IACzD,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC7B,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC;YAC/C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAC3B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAC7B,CAAC;IACH,CAAC;IACD,UAAU,CAAC,OAAO,CAAC,CAAA;IAEnB,iCAAiC;IACjC,MAAM,SAAS,GAAuB,WAAW,CAC/C,IAAI,EACJ,OAAO,EACP,MAAM,CACP,CAAA;IACD,IAAI,SAAS,CAAC,MAAM;QAAE,MAAM,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;IAElD,6DAA6D;IAC7D,wBAAwB,EAAE,EAAE,CAAA;IAE5B,6CAA6C;IAC7C,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE,KAAK,CAAC,CAAA;IAExD,8DAA8D;IAC9D,IAAI,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,EAAE,CAAC;QACjC,YAAY,CACV,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAC1B,MAAM,CAAC,OAAO,CAAC,4BAA4B,CAAC,CAC7C,CAAA;IACH,CAAC;AACH,CAAC,CAAA","sourcesContent":["import { graphStep } from '@vltpkg/output'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport { RollbackRemove } from '@vltpkg/rollback-remove'\nimport { availableParallelism } from 'node:os'\nimport { callLimit } from 'promise-call-limit'\nimport type { LoadOptions } from '../actual/load.ts'\nimport { load as loadActual } from '../actual/load.ts'\nimport type {\n  AddImportersDependenciesMap,\n  RemoveImportersDependenciesMap,\n} from '../dependencies.ts'\nimport { Diff } from '../diff.ts'\nimport type { Graph } from '../graph.ts'\nimport { lockfile } from '../index.ts'\nimport type { GraphModifier } from '../modifiers.ts'\nimport {\n  lockfileData,\n  saveData,\n  saveHidden,\n} from '../lockfile/save.ts'\nimport { addEdges } from './add-edges.ts'\nimport { addNodes } from './add-nodes.ts'\nimport { build } from './build.ts'\nimport { deleteEdges } from './delete-edges.ts'\nimport { deleteNodes } from './delete-nodes.ts'\nimport { internalHoist } from './internal-hoist.ts'\nimport { rollback } from './rollback.ts'\nimport { updatePackageJson } from './update-importers-package-json.ts'\nimport { copyFileSync } from 'node:fs'\n\nconst limit = Math.max(availableParallelism() - 1, 1) * 8\n\n// - [ ] depid's with peer resolutions\n// - [ ] depid shortening\n\nexport type ReifyOptions = LoadOptions & {\n  add?: AddImportersDependenciesMap\n  remove?: RemoveImportersDependenciesMap\n  graph: Graph\n  actual?: Graph\n  packageInfo: PackageInfoClient\n  modifiers?: GraphModifier\n}\n\n/**\n * Make the current project match the supplied graph.\n */\nexport const reify = async (options: ReifyOptions) => {\n  const done = graphStep('reify')\n\n  const { graph, scurry } = options\n\n  const actual =\n    options.actual ??\n    loadActual({\n      ...options,\n      loadManifests: true,\n    })\n\n  const diff = new Diff(actual, graph)\n  const skipOptionalOnly =\n    options.add?.modifiedDependencies && diff.optionalOnly()\n  if (!diff.hasChanges() || skipOptionalOnly) {\n    // nothing to do, so just return the diff\n    done()\n    return diff\n  }\n\n  const remover = new RollbackRemove()\n  let success = false\n  try {\n    await reify_(options, diff, remover)\n    remover.confirm()\n    success = true\n  } finally {\n    /* c8 ignore start */\n    if (!success) {\n      await rollback(remover, diff, scurry).catch(() => {})\n    }\n    /* c8 ignore stop */\n  }\n\n  done()\n\n  return diff\n}\n\nconst reify_ = async (\n  options: ReifyOptions,\n  diff: Diff,\n  remover: RollbackRemove,\n) => {\n  const { add, remove, packageInfo, packageJson, scurry } = options\n  const saveImportersPackageJson =\n    add?.modifiedDependencies || remove?.modifiedDependencies ?\n      updatePackageJson({\n        add,\n        remove,\n        graph: options.graph,\n        packageJson,\n      })\n    : undefined\n\n  // before anything else happens, grab the ideal tree as it was resolved\n  // so that we can store it in the lockfile. We do this here so that\n  // any failed/removed optional deps are not reflected in the lockfile\n  // data as it is saved.\n  const lfData = lockfileData(options)\n  const actions: (() => Promise<unknown>)[] = addNodes(\n    diff,\n    scurry,\n    remover,\n    options,\n    packageInfo,\n  ).concat(deleteEdges(diff, scurry, remover))\n\n  // need to wait, so that the nodes exist to link to\n  if (actions.length) await callLimit(actions, { limit })\n\n  // create all node_modules symlinks, and link bins to nm/.bin\n  const edgeActions: Promise<unknown>[] = addEdges(\n    diff,\n    packageJson,\n    scurry,\n    remover,\n  )\n  if (edgeActions.length) await Promise.all(edgeActions)\n\n  await internalHoist(diff.to, options, remover)\n\n  // run lifecycles and chmod bins\n  await build(diff, packageJson, scurry)\n\n  // save the lockfile\n  lockfile.save(options)\n\n  // if we had to change the actual graph along the way,\n  // make sure we do not leave behind any unreachable nodes\n  if (diff.hadOptionalFailures) {\n    for (const node of options.graph.gc().values()) {\n      diff.nodes.add.delete(node)\n      diff.nodes.delete.add(node)\n    }\n  }\n  saveHidden(options)\n\n  // delete garbage from the store.\n  const rmActions: Promise<unknown>[] = deleteNodes(\n    diff,\n    remover,\n    scurry,\n  )\n  if (rmActions.length) await Promise.all(rmActions)\n\n  // updates package.json files if anything was added / removed\n  saveImportersPackageJson?.()\n\n  // write the ideal graph data to the lockfile\n  saveData(lfData, scurry.resolve('vlt-lock.json'), false)\n\n  // update the store config reference if a config file was used\n  if (scurry.lstatSync('vlt.json')) {\n    copyFileSync(\n      scurry.resolve('vlt.json'),\n      scurry.resolve('node_modules/.vlt/vlt.json'),\n    )\n  }\n}\n"]}

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;AAkBrD,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;AA2DxD;;GAEG;AACH,wBAAgB,mBAAmB,CACjC,OAAO,EAAE,wBAAwB,EACjC,EAAE,MAAM,EAAE,EAAE;IAAE,MAAM,CAAC,EAAE,OAAO,CAAA;CAAE,UAiHjC"}
+{"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;AAkBrD,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;AAyDxD;;GAEG;AACH,wBAAgB,mBAAmB,CACjC,OAAO,EAAE,wBAAwB,EACjC,EAAE,MAAM,EAAE,EAAE;IAAE,MAAM,CAAC,EAAE,OAAO,CAAA;CAAE,UAiHjC"}

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

@@ -8,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.
  */

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;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,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,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,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,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,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;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 '../types.ts'\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  !!(\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.seen = 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          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 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\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"]}
+{"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,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,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,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;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 '../types.ts'\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()].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          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 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\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/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-22",
+  "version": "0.0.0-24",
   "repository": {
     "type": "git",
     "url": "git+https://github.com/vltpkg/vltpkg.git",
@@ -23,36 +23,36 @@
     "graph-run": "^1.1.0",
     "path-scurry": "^2.0.0",
     "promise-call-limit": "^3.0.2",
-    "@vltpkg/cmd-shim": "0.0.0-22",
-    "@vltpkg/dss-breadcrumb": "0.0.0-22",
-    "@vltpkg/error-cause": "0.0.0-22",
-    "@vltpkg/dep-id": "0.0.0-22",
-    "@vltpkg/init": "0.0.0-22",
-    "@vltpkg/fast-split": "0.0.0-22",
-    "@vltpkg/output": "0.0.0-22",
-    "@vltpkg/package-json": "0.0.0-22",
-    "@vltpkg/package-info": "0.0.0-22",
-    "@vltpkg/rollback-remove": "0.0.0-22",
-    "@vltpkg/pick-manifest": "0.0.0-22",
-    "@vltpkg/run": "0.0.0-22",
-    "@vltpkg/satisfies": "0.0.0-22",
-    "@vltpkg/spec": "0.0.0-22",
-    "@vltpkg/types": "0.0.0-22",
-    "@vltpkg/vlt-json": "0.0.0-22",
-    "@vltpkg/workspaces": "0.0.0-22"
+    "@vltpkg/cmd-shim": "0.0.0-24",
+    "@vltpkg/dep-id": "0.0.0-24",
+    "@vltpkg/error-cause": "0.0.0-24",
+    "@vltpkg/fast-split": "0.0.0-24",
+    "@vltpkg/dss-breadcrumb": "0.0.0-24",
+    "@vltpkg/init": "0.0.0-24",
+    "@vltpkg/package-info": "0.0.0-24",
+    "@vltpkg/output": "0.0.0-24",
+    "@vltpkg/package-json": "0.0.0-24",
+    "@vltpkg/pick-manifest": "0.0.0-24",
+    "@vltpkg/rollback-remove": "0.0.0-24",
+    "@vltpkg/spec": "0.0.0-24",
+    "@vltpkg/run": "0.0.0-24",
+    "@vltpkg/vlt-json": "0.0.0-24",
+    "@vltpkg/workspaces": "0.0.0-24",
+    "@vltpkg/satisfies": "0.0.0-24",
+    "@vltpkg/types": "0.0.0-24"
   },
   "devDependencies": {
-    "@eslint/js": "^9.28.0",
-    "@types/node": "^22.15.29",
-    "eslint": "^9.28.0",
-    "prettier": "^3.6.0",
+    "@eslint/js": "^9.34.0",
+    "@types/node": "^22.17.2",
+    "eslint": "^9.34.0",
+    "prettier": "^3.6.2",
     "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-22"
+    "typescript-eslint": "^8.40.0",
+    "@vltpkg/vlt-json": "0.0.0-24"
   },
   "license": "BSD-2-Clause-Patent",
   "engines": {