@vltpkg/graph 0.0.0-9 → 1.0.0-rc.10

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;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"]}
+{"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;;OAEG;IACH,YAAY,GAAG,IAAI,CAAA;IAEnB,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;gBACxB,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,CAAC;oBACnB,IAAI,CAAC,YAAY,GAAG,KAAK,CAAA;gBAC3B,CAAC;YACH,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,MAAM;QACJ,OAAO;YACL,KAAK,EAAE;gBACL,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACnD,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;aAC1D;YACD,KAAK,EAAE;gBACL,GAAG,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;gBACnD,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;aAC1D;SACF,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  /**\n   * True if the diff only contains optional nodes (computed during construction)\n   */\n  optionalOnly = true\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        if (!node.optional) {\n          this.optionalOnly = false\n        }\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  toJSON() {\n    return {\n      nodes: {\n        add: [...this.nodes.add].map(node => node.toJSON()),\n        delete: [...this.nodes.delete].map(node => node.toJSON()),\n      },\n      edges: {\n        add: [...this.edges.add].map(edge => edge.toJSON()),\n        delete: [...this.edges.delete].map(edge => edge.toJSON()),\n      },\n    }\n  }\n}\n"]}

package/dist/esm/edge.d.ts

@@ -1,8 +1,7 @@
 import type { Spec } from '@vltpkg/spec';
 import type { InspectOptions } from 'node:util';
-import type { DependencyTypeShort } from '@vltpkg/types';
+import type { DependencyTypeShort, EdgeLike } from '@vltpkg/types';
 import type { Node } from './node.ts';
-import type { EdgeLike } from './types.ts';
 declare const kCustomInspect: unique symbol;
 export declare class Edge implements EdgeLike {
     get [Symbol.toStringTag](): string;
@@ -36,6 +35,13 @@ export declare class Edge implements EdgeLike {
     get peer(): boolean;
     get peerOptional(): boolean;
     valid(): boolean;
+    toJSON(): {
+        from: import("@vltpkg/dep-id").DepID;
+        to: import("@vltpkg/dep-id").DepID | undefined;
+        type: DependencyTypeShort;
+        spec: string;
+    };
+    toString(): string;
 }
 export {};
 //# sourceMappingURL=edge.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"edge.d.ts","sourceRoot":"","sources":["../../src/edge.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AAExC,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,WAAW,CAAA;AAC/C,OAAO,KAAK,EAAE,mBAAmB,EAAE,MAAM,eAAe,CAAA;AACxD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AACrC,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAA;AAE1C,QAAA,MAAM,cAAc,eAA2C,CAAA;AAE/D,qBAAa,IAAK,YAAW,QAAQ;IACnC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,WAEvB;IAED,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,cAAc;IAanD;;OAEG;IACH,IAAI,EAAE,IAAI,CAAA;IAEV;;OAEG;IACH,EAAE,CAAC,EAAE,IAAI,CAAA;IAET;;OAEG;IACH,IAAI,EAAE,mBAAmB,CAAA;IAEzB;;OAEG;IACH,IAAI,EAAE,IAAI,CAAA;gBAGR,IAAI,EAAE,mBAAmB,EACzB,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,IAAI,EACV,EAAE,CAAC,EAAE,IAAI;IAQX;;OAEG;IACH,IAAI,IAAI,WAEP;IAED;;OAEG;IACH,IAAI,GAAG,IAAI,OAAO,CAEjB;IAED,IAAI,QAAQ,IAAI,OAAO,CAEtB;IAED,IAAI,IAAI,IAAI,OAAO,CAElB;IAED,IAAI,YAAY,IAAI,OAAO,CAE1B;IAED,KAAK,IAAI,OAAO;CAUjB"}
+{"version":3,"file":"edge.d.ts","sourceRoot":"","sources":["../../src/edge.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AAExC,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,WAAW,CAAA;AAC/C,OAAO,KAAK,EAAE,mBAAmB,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AAClE,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAErC,QAAA,MAAM,cAAc,eAA2C,CAAA;AAE/D,qBAAa,IAAK,YAAW,QAAQ;IACnC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,WAEvB;IAED,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,cAAc;IAanD;;OAEG;IACH,IAAI,EAAE,IAAI,CAAA;IAEV;;OAEG;IACH,EAAE,CAAC,EAAE,IAAI,CAAA;IAET;;OAEG;IACH,IAAI,EAAE,mBAAmB,CAAA;IAEzB;;OAEG;IACH,IAAI,EAAE,IAAI,CAAA;gBAGR,IAAI,EAAE,mBAAmB,EACzB,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,IAAI,EACV,EAAE,CAAC,EAAE,IAAI;IAQX;;OAEG;IACH,IAAI,IAAI,WAEP;IAED;;OAEG;IACH,IAAI,GAAG,IAAI,OAAO,CAEjB;IAED,IAAI,QAAQ,IAAI,OAAO,CAEtB;IAED,IAAI,IAAI,IAAI,OAAO,CAElB;IAED,IAAI,YAAY,IAAI,OAAO,CAE1B;IAED,KAAK,IAAI,OAAO;IAWhB,MAAM;;;;;;IASN,QAAQ;CAIT"}

package/dist/esm/edge.js

@@ -62,5 +62,17 @@ export class Edge {
             this.optional
             : satisfies(this.to.id, this.spec, this.from.location, this.from.projectRoot);
     }
+    toJSON() {
+        return {
+            from: this.from.id,
+            to: this.to?.id,
+            type: this.type,
+            spec: String(this.spec),
+        };
+    }
+    toString() {
+        const to = `${this.name}${this.to ? '' : ' (missing)'}`;
+        return `Edge from: ${this.from.id} --|${this.type}|--> ${to}`;
+    }
 }
 //# sourceMappingURL=edge.js.map

package/dist/esm/edge.js.map

@@ -1 +1 @@
-{"version":3,"file":"edge.js","sourceRoot":"","sources":["../../src/edge.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AAE7C,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AAMnC,MAAM,cAAc,GAAG,MAAM,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAA;AAE/D,MAAM,OAAO,IAAI;IACf,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,oBAAoB,CAAA;IAC7B,CAAC;IAED,CAAC,cAAc,CAAC,CAAC,CAAS,EAAE,OAAuB;QACjD,MAAM,GAAG,GAAG,OAAO,CACjB;YACE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE;YAClB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;YACvB,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE;SAChB,EACD,OAAO,CACR,CAAA;QACD,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,GAAG,EAAE,CAAA;IAC7C,CAAC;IAED;;OAEG;IACH,IAAI,CAAM;IAEV;;OAEG;IACH,EAAE,CAAO;IAET;;OAEG;IACH,IAAI,CAAqB;IAEzB;;OAEG;IACH,IAAI,CAAM;IAEV,YACE,IAAyB,EACzB,IAAU,EACV,IAAU,EACV,EAAS;QAET,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,EAAE,GAAG,EAAE,CAAA;QACZ,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;IAClB,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAA;IACvB,CAAC;IAED;;OAEG;IACH,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,IAAI,KAAK,KAAK,CAAA;IAC5B,CAAC;IAED,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,IAAI,KAAK,cAAc,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,CAAA;IACjE,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc,CAAA;IAC7D,CAAC;IAED,IAAI,YAAY;QACd,OAAO,IAAI,CAAC,IAAI,KAAK,cAAc,CAAA;IACrC,CAAC;IAED,KAAK;QACH,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACb,IAAI,CAAC,QAAQ;YACf,CAAC,CAAC,SAAS,CACP,IAAI,CAAC,EAAE,CAAC,EAAE,EACV,IAAI,CAAC,IAAI,EACT,IAAI,CAAC,IAAI,CAAC,QAAQ,EAClB,IAAI,CAAC,IAAI,CAAC,WAAW,CACtB,CAAA;IACP,CAAC;CACF","sourcesContent":["import { satisfies } from '@vltpkg/satisfies'\nimport type { Spec } from '@vltpkg/spec'\nimport { inspect } from 'node:util'\nimport type { InspectOptions } from 'node:util'\nimport type { DependencyTypeShort } from '@vltpkg/types'\nimport type { Node } from './node.ts'\nimport type { EdgeLike } from './types.ts'\n\nconst kCustomInspect = Symbol.for('nodejs.util.inspect.custom')\n\nexport class Edge implements EdgeLike {\n  get [Symbol.toStringTag]() {\n    return '@vltpkg/graph.Edge'\n  }\n\n  [kCustomInspect](_: number, options: InspectOptions) {\n    const str = inspect(\n      {\n        from: this.from.id,\n        type: this.type,\n        spec: String(this.spec),\n        to: this.to?.id,\n      },\n      options,\n    )\n    return `${this[Symbol.toStringTag]} ${str}`\n  }\n\n  /**\n   * The Node this Edge is connecting from, this is usually the dependent.\n   */\n  from: Node\n\n  /**\n   * The node this Edge is connecting to, this is usually a direct dependency.\n   */\n  to?: Node\n\n  /**\n   * What type of dependency relationship `from` and `to` nodes have.\n   */\n  type: DependencyTypeShort\n\n  /**\n   * The defined spec value for `to` as parsed from the dependent metadata.\n   */\n  spec: Spec\n\n  constructor(\n    type: DependencyTypeShort,\n    spec: Spec,\n    from: Node,\n    to?: Node,\n  ) {\n    this.from = from\n    this.to = to\n    this.type = type\n    this.spec = spec\n  }\n\n  /**\n   * The name of the dependency `to` as defined in the dependent metadata.\n   */\n  get name() {\n    return this.spec.name\n  }\n\n  /**\n   * This edge was defined as part of a `devDependencies` in `package.json`\n   */\n  get dev(): boolean {\n    return this.type === 'dev'\n  }\n\n  get optional(): boolean {\n    return this.type === 'peerOptional' || this.type === 'optional'\n  }\n\n  get peer(): boolean {\n    return this.type === 'peer' || this.type === 'peerOptional'\n  }\n\n  get peerOptional(): boolean {\n    return this.type === 'peerOptional'\n  }\n\n  valid(): boolean {\n    return !this.to ?\n        this.optional\n      : satisfies(\n          this.to.id,\n          this.spec,\n          this.from.location,\n          this.from.projectRoot,\n        )\n  }\n}\n"]}
+{"version":3,"file":"edge.js","sourceRoot":"","sources":["../../src/edge.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AAE7C,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AAKnC,MAAM,cAAc,GAAG,MAAM,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAA;AAE/D,MAAM,OAAO,IAAI;IACf,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,oBAAoB,CAAA;IAC7B,CAAC;IAED,CAAC,cAAc,CAAC,CAAC,CAAS,EAAE,OAAuB;QACjD,MAAM,GAAG,GAAG,OAAO,CACjB;YACE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE;YAClB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;YACvB,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE;SAChB,EACD,OAAO,CACR,CAAA;QACD,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,GAAG,EAAE,CAAA;IAC7C,CAAC;IAED;;OAEG;IACH,IAAI,CAAM;IAEV;;OAEG;IACH,EAAE,CAAO;IAET;;OAEG;IACH,IAAI,CAAqB;IAEzB;;OAEG;IACH,IAAI,CAAM;IAEV,YACE,IAAyB,EACzB,IAAU,EACV,IAAU,EACV,EAAS;QAET,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,EAAE,GAAG,EAAE,CAAA;QACZ,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;QAChB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;IAClB,CAAC;IAED;;OAEG;IACH,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAA;IACvB,CAAC;IAED;;OAEG;IACH,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,IAAI,KAAK,KAAK,CAAA;IAC5B,CAAC;IAED,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,IAAI,KAAK,cAAc,IAAI,IAAI,CAAC,IAAI,KAAK,UAAU,CAAA;IACjE,CAAC;IAED,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,IAAI,KAAK,MAAM,IAAI,IAAI,CAAC,IAAI,KAAK,cAAc,CAAA;IAC7D,CAAC;IAED,IAAI,YAAY;QACd,OAAO,IAAI,CAAC,IAAI,KAAK,cAAc,CAAA;IACrC,CAAC;IAED,KAAK;QACH,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACb,IAAI,CAAC,QAAQ;YACf,CAAC,CAAC,SAAS,CACP,IAAI,CAAC,EAAE,CAAC,EAAE,EACV,IAAI,CAAC,IAAI,EACT,IAAI,CAAC,IAAI,CAAC,QAAQ,EAClB,IAAI,CAAC,IAAI,CAAC,WAAW,CACtB,CAAA;IACP,CAAC;IAED,MAAM;QACJ,OAAO;YACL,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE;YAClB,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,EAAE;YACf,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;SACxB,CAAA;IACH,CAAC;IAED,QAAQ;QACN,MAAM,EAAE,GAAG,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,YAAY,EAAE,CAAA;QACvD,OAAO,cAAc,IAAI,CAAC,IAAI,CAAC,EAAE,OAAO,IAAI,CAAC,IAAI,QAAQ,EAAE,EAAE,CAAA;IAC/D,CAAC;CACF","sourcesContent":["import { satisfies } from '@vltpkg/satisfies'\nimport type { Spec } from '@vltpkg/spec'\nimport { inspect } from 'node:util'\nimport type { InspectOptions } from 'node:util'\nimport type { DependencyTypeShort, EdgeLike } from '@vltpkg/types'\nimport type { Node } from './node.ts'\n\nconst kCustomInspect = Symbol.for('nodejs.util.inspect.custom')\n\nexport class Edge implements EdgeLike {\n  get [Symbol.toStringTag]() {\n    return '@vltpkg/graph.Edge'\n  }\n\n  [kCustomInspect](_: number, options: InspectOptions) {\n    const str = inspect(\n      {\n        from: this.from.id,\n        type: this.type,\n        spec: String(this.spec),\n        to: this.to?.id,\n      },\n      options,\n    )\n    return `${this[Symbol.toStringTag]} ${str}`\n  }\n\n  /**\n   * The Node this Edge is connecting from, this is usually the dependent.\n   */\n  from: Node\n\n  /**\n   * The node this Edge is connecting to, this is usually a direct dependency.\n   */\n  to?: Node\n\n  /**\n   * What type of dependency relationship `from` and `to` nodes have.\n   */\n  type: DependencyTypeShort\n\n  /**\n   * The defined spec value for `to` as parsed from the dependent metadata.\n   */\n  spec: Spec\n\n  constructor(\n    type: DependencyTypeShort,\n    spec: Spec,\n    from: Node,\n    to?: Node,\n  ) {\n    this.from = from\n    this.to = to\n    this.type = type\n    this.spec = spec\n  }\n\n  /**\n   * The name of the dependency `to` as defined in the dependent metadata.\n   */\n  get name() {\n    return this.spec.name\n  }\n\n  /**\n   * This edge was defined as part of a `devDependencies` in `package.json`\n   */\n  get dev(): boolean {\n    return this.type === 'dev'\n  }\n\n  get optional(): boolean {\n    return this.type === 'peerOptional' || this.type === 'optional'\n  }\n\n  get peer(): boolean {\n    return this.type === 'peer' || this.type === 'peerOptional'\n  }\n\n  get peerOptional(): boolean {\n    return this.type === 'peerOptional'\n  }\n\n  valid(): boolean {\n    return !this.to ?\n        this.optional\n      : satisfies(\n          this.to.id,\n          this.spec,\n          this.from.location,\n          this.from.projectRoot,\n        )\n  }\n\n  toJSON() {\n    return {\n      from: this.from.id,\n      to: this.to?.id,\n      type: this.type,\n      spec: String(this.spec),\n    }\n  }\n\n  toString() {\n    const to = `${this.name}${this.to ? '' : ' (missing)'}`\n    return `Edge from: ${this.from.id} --|${this.type}|--> ${to}`\n  }\n}\n"]}

package/dist/esm/fixup-added-names.d.ts

@@ -0,0 +1,16 @@
+import { Spec } from '@vltpkg/spec';
+import type { Dependency } from './dependencies.ts';
+import type { Manifest } from '@vltpkg/types';
+import type { SpecOptions } from '@vltpkg/spec';
+/**
+ * When adding new dependencies, it's very common to not have a dependency
+ * name directly available to reference, e.g: `file:local/folder` or
+ * `remote:tarball-url.tgz`. In these cases, a placeholder `(unknown)` name
+ * is used in the `Spec` object and the `add` Map structure that holds
+ * references to added dependencies will use the stringified spec as a key.
+ *
+ * This helper function fixes unknown names in the `add` map by replacing
+ * placeholder specs with the correct names from the provided manifest.
+ */
+export declare const fixupAddedNames: (add: Map<string, Dependency> | undefined, manifest: Pick<Manifest, "name"> | undefined, options: SpecOptions, spec: Spec) => Spec;
+//# sourceMappingURL=fixup-added-names.d.ts.map

package/dist/esm/fixup-added-names.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fixup-added-names.d.ts","sourceRoot":"","sources":["../../src/fixup-added-names.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AACnC,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,mBAAmB,CAAA;AACnD,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AAC7C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAE/C;;;;;;;;;GASG;AACH,eAAO,MAAM,eAAe,QACrB,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,GAAG,SAAS,YAC9B,IAAI,CAAC,QAAQ,EAAE,MAAM,CAAC,GAAG,SAAS,WACnC,WAAW,QACd,IAAI,KACT,IAkBF,CAAA"}

package/dist/esm/fixup-added-names.js

@@ -0,0 +1,31 @@
+import { Spec } from '@vltpkg/spec';
+/**
+ * When adding new dependencies, it's very common to not have a dependency
+ * name directly available to reference, e.g: `file:local/folder` or
+ * `remote:tarball-url.tgz`. In these cases, a placeholder `(unknown)` name
+ * is used in the `Spec` object and the `add` Map structure that holds
+ * references to added dependencies will use the stringified spec as a key.
+ *
+ * This helper function fixes unknown names in the `add` map by replacing
+ * placeholder specs with the correct names from the provided manifest.
+ */
+export const fixupAddedNames = (add, manifest, options, spec) => {
+    // Handle nameless dependencies
+    if (add && 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(manifest.name, spec.bareSpec, options);
+            // updates the add map with the fixed up spec
+            const n = {
+                type: s.type,
+                spec,
+            };
+            add.set(manifest.name, n);
+        }
+    }
+    return spec;
+};
+//# sourceMappingURL=fixup-added-names.js.map

package/dist/esm/fixup-added-names.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"fixup-added-names.js","sourceRoot":"","sources":["../../src/fixup-added-names.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AAKnC;;;;;;;;;GASG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAC7B,GAAwC,EACxC,QAA4C,EAC5C,OAAoB,EACpB,IAAU,EACJ,EAAE;IACR,+BAA+B;IAC/B,IAAI,GAAG,IAAI,QAAQ,EAAE,IAAI,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;QACvD,MAAM,CAAC,GAA2B,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA;QACvD,IAAI,CAAC,EAAE,CAAC;YACN,8CAA8C;YAC9C,GAAG,CAAC,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAA;YACxB,qDAAqD;YACrD,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAA;YACxD,6CAA6C;YAC7C,MAAM,CAAC,GAAG;gBACR,IAAI,EAAE,CAAC,CAAC,IAAI;gBACZ,IAAI;aACL,CAAA;YACD,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,EAAE,CAAC,CAAC,CAAA;QAC3B,CAAC;IACH,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC,CAAA","sourcesContent":["import { Spec } from '@vltpkg/spec'\nimport type { Dependency } from './dependencies.ts'\nimport type { Manifest } from '@vltpkg/types'\nimport type { SpecOptions } from '@vltpkg/spec'\n\n/**\n * When adding new dependencies, it's very common to not have a dependency\n * name directly available to reference, e.g: `file:local/folder` or\n * `remote:tarball-url.tgz`. In these cases, a placeholder `(unknown)` name\n * is used in the `Spec` object and the `add` Map structure that holds\n * references to added dependencies will use the stringified spec as a key.\n *\n * This helper function fixes unknown names in the `add` map by replacing\n * placeholder specs with the correct names from the provided manifest.\n */\nexport const fixupAddedNames = (\n  add: Map<string, Dependency> | undefined,\n  manifest: Pick<Manifest, 'name'> | undefined,\n  options: SpecOptions,\n  spec: Spec,\n): Spec => {\n  // Handle nameless dependencies\n  if (add && manifest?.name && spec.name === '(unknown)') {\n    const s: Dependency | undefined = 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 = {\n        type: s.type,\n        spec,\n      }\n      add.set(manifest.name, n)\n    }\n  }\n  return spec\n}\n"]}

package/dist/esm/graph.d.ts

@@ -1,19 +1,19 @@
 import type { DepID } from '@vltpkg/dep-id';
 import { Spec } from '@vltpkg/spec';
 import type { SpecOptions } from '@vltpkg/spec';
-import type { Manifest, DependencySaveType } from '@vltpkg/types';
+import type { GraphLike, NodeLike, NormalizedManifest, DependencySaveType } from '@vltpkg/types';
 import type { Monorepo } from '@vltpkg/workspaces';
 import type { InspectOptions } from 'node:util';
-import type { Edge } from './edge.ts';
+import { Edge } from './edge.ts';
 import { Node } from './node.ts';
-import type { GraphLike, NodeLike } from './types.ts';
+import type { PeerContext } from './ideal/types.ts';
 declare const kCustomInspect: unique symbol;
-export type ManifestInventory = Map<DepID, Manifest>;
+export type ManifestInventory = Map<DepID, NormalizedManifest>;
 export type GraphOptions = SpecOptions & {
     /**
      * The main importer manifest info.
      */
-    mainManifest: Manifest;
+    mainManifest: NormalizedManifest;
     /**
      * An inventory of seen manifests.
      */
@@ -74,9 +74,21 @@ export declare class Graph implements GraphLike {
      * The root of the project this graph represents
      */
     projectRoot: string;
+    /**
+     * The peer context sets used to resolve peer dependencies within this graph.
+     */
+    peerContexts: PeerContext[];
+    /**
+     * Tracks the current peer context index.
+     */
+    currentPeerContextIndex: number;
     constructor(options: GraphOptions);
     /**
-     * Delete all nodes that are unreachable from the importers.
+     * Get the next peer context index.
+     */
+    nextPeerContextIndex(): number;
+    /**
+     * Delete all nodes and edges that are unreachable from the importers.
      * The collection of deleted nodes is returned.
      *
      * NOTE: This can be extremely slow for large graphs, and is almost always
@@ -94,11 +106,11 @@ export declare class Graph implements GraphLike {
     /**
      * Find an existing node to satisfy a dependency
      */
-    findResolution(spec: Spec, fromNode: Node): Node | undefined;
+    findResolution(spec: Spec, fromNode: Node, extra?: string): Node | undefined;
     /**
      * Create a new node in the graph.
      */
-    addNode(id?: DepID, manifest?: Manifest, spec?: Spec, name?: string, version?: string): Node;
+    addNode(id?: DepID, manifest?: NormalizedManifest, spec?: Spec, name?: string, version?: string): Node;
     /**
      * Place a new package into the graph representation, creating the new
      * edges and possibly new nodes that are to be expected when traversing
@@ -107,15 +119,27 @@ export declare class Graph implements GraphLike {
      * For different uses that are not a direct top-down traversal of the graph
      * consider using `addNode()` and `addEdge()` instead.
      */
-    placePackage(fromNode: Node, depType: DependencySaveType, spec: Spec, manifest?: Manifest, id?: DepID): Node | undefined;
+    placePackage(fromNode: Node, depType: DependencySaveType, spec: Spec, manifest?: NormalizedManifest, id?: DepID, extra?: string): Node | undefined;
     /**
      * Removes a node and its relevant edges from the graph.
      *
+     * Use the `keepEdges` option to keep the edges that were pointing to
+     * this node and only removes their `to` property value.
+     *
      * If a replacement is provided, then any edges that were previously
      * pointing to the removed node will be directed to the replacement,
      * if it is valid to do so.
      */
-    removeNode(node: Node, replacement?: Node): void;
+    removeNode(node: Node, replacement?: Node, keepEdges?: boolean): void;
+    /**
+     * Removes the resolved node of a given edge.
+     */
+    removeEdgeResolution(edge: Edge, extra?: string): void;
+    /**
+     * Remove all edges from the graph while preserving nodes and resolution caches.
+     * This allows the graph to be reconstructed efficiently using the existing nodes.
+     */
+    resetEdges(): void;
     toJSON(): import("./index.ts").LockfileData;
     [kCustomInspect](_: number, options: InspectOptions): string;
 }

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

@@ -1 +1 @@
-{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../src/graph.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAA;AAG3C,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AACnC,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAC/C,OAAO,KAAK,EAAE,QAAQ,EAAE,kBAAkB,EAAE,MAAM,eAAe,CAAA;AACjE,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAA;AAElD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,WAAW,CAAA;AAC/C,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAErC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAEhC,OAAO,KAAK,EAAE,SAAS,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAA;AAGrD,QAAA,MAAM,cAAc,eAA2C,CAAA;AAM/D,MAAM,MAAM,iBAAiB,GAAG,GAAG,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;AAKpD,MAAM,MAAM,YAAY,GAAG,WAAW,GAAG;IACvC;;OAEG;IACH,YAAY,EAAE,QAAQ,CAAA;IACtB;;OAEG;IACH,SAAS,CAAC,EAAE,iBAAiB,CAAA;IAC7B;;OAEG;IACH,QAAQ,CAAC,EAAE,QAAQ,CAAA;IACnB;;OAEG;IACH,WAAW,EAAE,MAAM,CAAA;CACpB,CAAA;AAED,qBAAa,KAAM,YAAW,SAAS;;IACrC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,WAEvB;IAMD;;OAEG;IACH,QAAQ,CAAC,EAAE,QAAQ,CAAA;IAEnB;;OAEG;IACH,SAAS,EAAE,iBAAiB,CAAA;IAE5B;;OAEG;IACH,KAAK,YAAkB;IAEvB;;OAEG;IACH,KAAK,mBAAyB;IAE9B;;OAEG;IACH,WAAW,yBAA+B;IAE1C;;OAEG;IACH,WAAW,oBAA0B;IAErC;;OAEG;IACH,kBAAkB,yBAA+B;IAEjD;;OAEG;IACH,SAAS,YAAkB;IAE3B;;OAEG;IACH,YAAY,EAAE,IAAI,CAAA;IAElB;;OAEG;IACH,sBAAsB,YAAkB;IAExC;;OAEG;IACH,WAAW,EAAE,MAAM,CAAA;gBAEP,OAAO,EAAE,YAAY;IA+CjC;;;;;;;;OAQG;IACH,EAAE;IAqBF;;;;OAIG;IACH,OAAO,CACL,IAAI,EAAE,kBAAkB,EACxB,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,QAAQ,EACd,EAAE,CAAC,EAAE,QAAQ;IAuCf;;OAEG;IACH,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI;IA4BzC;;OAEG;IACH,OAAO,CACL,EAAE,CAAC,EAAE,KAAK,EACV,QAAQ,CAAC,EAAE,QAAQ,EACnB,IAAI,CAAC,EAAE,IAAI,EACX,IAAI,CAAC,EAAE,MAAM,EACb,OAAO,CAAC,EAAE,MAAM;IA+BlB;;;;;;;OAOG;IACH,YAAY,CACV,QAAQ,EAAE,IAAI,EACd,OAAO,EAAE,kBAAkB,EAC3B,IAAI,EAAE,IAAI,EACV,QAAQ,CAAC,EAAE,QAAQ,EACnB,EAAE,CAAC,EAAE,KAAK;IAkDZ;;;;;;OAMG;IACH,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,CAAC,EAAE,IAAI;IAiCzC,MAAM;IAQN,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,cAAc;CAIpD"}
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../src/graph.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAA;AAG3C,OAAO,EAAc,IAAI,EAAE,MAAM,cAAc,CAAA;AAC/C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAC/C,OAAO,KAAK,EACV,SAAS,EACT,QAAQ,EACR,kBAAkB,EAClB,kBAAkB,EACnB,MAAM,eAAe,CAAA;AACtB,OAAO,KAAK,EAAE,QAAQ,EAAE,MAAM,oBAAoB,CAAA;AAElD,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,WAAW,CAAA;AAE/C,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAChC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAGhC,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAA;AAEnD,QAAA,MAAM,cAAc,eAA2C,CAAA;AAQ/D,MAAM,MAAM,iBAAiB,GAAG,GAAG,CAAC,KAAK,EAAE,kBAAkB,CAAC,CAAA;AA8B9D,MAAM,MAAM,YAAY,GAAG,WAAW,GAAG;IACvC;;OAEG;IACH,YAAY,EAAE,kBAAkB,CAAA;IAChC;;OAEG;IACH,SAAS,CAAC,EAAE,iBAAiB,CAAA;IAC7B;;OAEG;IACH,QAAQ,CAAC,EAAE,QAAQ,CAAA;IACnB;;OAEG;IACH,WAAW,EAAE,MAAM,CAAA;CACpB,CAAA;AAED,qBAAa,KAAM,YAAW,SAAS;;IACrC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,WAEvB;IAMD;;OAEG;IACH,QAAQ,CAAC,EAAE,QAAQ,CAAA;IAEnB;;OAEG;IACH,SAAS,EAAE,iBAAiB,CAAA;IAE5B;;OAEG;IACH,KAAK,YAAkB;IAEvB;;OAEG;IACH,KAAK,mBAAyB;IAE9B;;OAEG;IACH,WAAW,yBAA+B;IAE1C;;OAEG;IACH,WAAW,oBAA0B;IAErC;;OAEG;IACH,kBAAkB,yBAA+B;IAEjD;;OAEG;IACH,SAAS,YAAkB;IAE3B;;OAEG;IACH,YAAY,EAAE,IAAI,CAAA;IAElB;;OAEG;IACH,sBAAsB,YAAkB;IAExC;;OAEG;IACH,WAAW,EAAE,MAAM,CAAA;IAEnB;;OAEG;IACH,YAAY,EAAE,WAAW,EAAE,CAAA;IAE3B;;OAEG;IACH,uBAAuB,SAAI;gBAEf,OAAO,EAAE,YAAY;IAyEjC;;OAEG;IACH,oBAAoB;IAIpB;;;;;;;;OAQG;IACH,EAAE;IAwBF;;;;OAIG;IACH,OAAO,CACL,IAAI,EAAE,kBAAkB,EACxB,IAAI,EAAE,IAAI,EACV,IAAI,EAAE,QAAQ,EACd,EAAE,CAAC,EAAE,QAAQ;IA0Cf;;OAEG;IACH,cAAc,CAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,SAAK;IAyBrD;;OAEG;IACH,OAAO,CACL,EAAE,CAAC,EAAE,KAAK,EACV,QAAQ,CAAC,EAAE,kBAAkB,EAC7B,IAAI,CAAC,EAAE,IAAI,EACX,IAAI,CAAC,EAAE,MAAM,EACb,OAAO,CAAC,EAAE,MAAM;IA2BlB;;;;;;;OAOG;IACH,YAAY,CACV,QAAQ,EAAE,IAAI,EACd,OAAO,EAAE,kBAAkB,EAC3B,IAAI,EAAE,IAAI,EACV,QAAQ,CAAC,EAAE,kBAAkB,EAC7B,EAAE,CAAC,EAAE,KAAK,EACV,KAAK,CAAC,EAAE,MAAM,GACb,IAAI,GAAG,SAAS;IAuFnB;;;;;;;;;OASG;IACH,UAAU,CAAC,IAAI,EAAE,IAAI,EAAE,WAAW,CAAC,EAAE,IAAI,EAAE,SAAS,CAAC,EAAE,OAAO;IAmC9D;;OAEG;IACH,oBAAoB,CAAC,IAAI,EAAE,IAAI,EAAE,KAAK,SAAK;IAmB3C;;;OAGG;IACH,UAAU;IAiBV,MAAM;IAQN,CAAC,cAAc,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE,cAAc;CAIpD"}

package/dist/esm/graph.js

@@ -1,16 +1,37 @@
-import { getId, joinDepIDTuple } from '@vltpkg/dep-id';
+import { getId, joinDepIDTuple, splitExtra } from '@vltpkg/dep-id';
 import { error } from '@vltpkg/error-cause';
 import { satisfies } from '@vltpkg/satisfies';
-import { Spec } from '@vltpkg/spec';
+import { getOptions, Spec } from '@vltpkg/spec';
 import { inspect } from 'node:util';
 import { lockfileData } from "./lockfile/save.js";
+import { Edge } from "./edge.js";
 import { Node } from "./node.js";
 import { resolveSaveType } from "./resolve-save-type.js";
 const kCustomInspect = Symbol.for('nodejs.util.inspect.custom');
+const cacheKeySeparator = '│';
 // this is always the same, but we don't hard code it as a string,
 // in case the DepID module needs to change its delimiter again ever.
 const mainDepID = joinDepIDTuple(['file', '.']);
 const getMap = (m) => m ?? new Map();
+/**
+ * Get a cache key for a resolution based on the
+ * spec, location and query modifier.
+ */
+const getResolutionCacheKey = (spec, location, extra) => {
+    const f = spec.final;
+    // if it's a file: dep, then the fromNode location matters
+    const fromPrefix = f.type === 'file' ? location + ' : ' : '';
+    // the unique key should also precise what is the type of the spec,
+    // and in the case of a registry, what registry it is from.
+    const typePrecisionKey = f.registry ?
+        `${cacheKeySeparator}registry` +
+            `${cacheKeySeparator}${f.registry}`
+        : f.gitRemote ?
+            `${cacheKeySeparator}git` + `${cacheKeySeparator}${f.gitRemote}`
+            : `${cacheKeySeparator}${f.type}`;
+    const modifierSuffix = `${cacheKeySeparator}${extra}`;
+    return fromPrefix + String(f) + typePrecisionKey + modifierSuffix;
+};
 export class Graph {
     get [Symbol.toStringTag]() {
         return '@vltpkg/graph.Graph';
@@ -61,13 +82,33 @@ export class Graph {
      * The root of the project this graph represents
      */
     projectRoot;
+    /**
+     * The peer context sets used to resolve peer dependencies within this graph.
+     */
+    peerContexts;
+    /**
+     * Tracks the current peer context index.
+     */
+    currentPeerContextIndex = 0;
     constructor(options) {
         const { mainManifest, monorepo } = options;
         this.#options = options;
+        // hydrate spec options to their full contents, including defaults
+        const specOptions = getOptions({
+            registry: options.registry,
+            registries: options.registries,
+            'git-hosts': options['git-hosts'],
+            'git-host-archives': options['git-host-archives'],
+            'scope-registries': options['scope-registries'],
+            'jsr-registries': options['jsr-registries'],
+            catalog: options.catalog,
+            catalogs: options.catalogs,
+        });
         this.manifests = getMap(options.manifests);
         this.projectRoot = options.projectRoot;
         this.#nodeOptions = {
             ...this.#options,
+            ...specOptions,
             graph: this,
         };
         // add the project root node
@@ -77,6 +118,7 @@ export class Graph {
         mainImporter.setImporterLocation(mainImporterLocation);
         mainImporter.mainImporter = true;
         this.mainImporter = mainImporter;
+        this.mainImporter.workspaces = new Map();
         this.importers.add(mainImporter);
         this.manifests.set(mainImporter.id, mainManifest);
         // uses the monorepo instance in order to retrieve info on
@@ -90,11 +132,24 @@ export class Graph {
                     this.manifests.set(wsNode.id, wsNode.manifest);
                 }
                 this.importers.add(wsNode);
+                // creates a virtual edge to connect the workspaces to the root node
+                const edge = new Edge('prod', Spec.parse(wsNode.name, 'workspace:*', this.#options), this.mainImporter, wsNode);
+                this.mainImporter.workspaces.set(wsNode.name, edge);
             }
         }
+        // initializes the peer context set collection
+        const initialPeerContext = new Map();
+        initialPeerContext.index = this.currentPeerContextIndex;
+        this.peerContexts = [initialPeerContext];
+    }
+    /**
+     * Get the next peer context index.
+     */
+    nextPeerContextIndex() {
+        return ++this.currentPeerContextIndex;
     }
     /**
-     * Delete all nodes that are unreachable from the importers.
+     * Delete all nodes and edges that are unreachable from the importers.
      * The collection of deleted nodes is returned.
      *
      * NOTE: This can be extremely slow for large graphs, and is almost always
@@ -104,13 +159,16 @@ export class Graph {
      */
     gc() {
         const { nodes } = this;
+        this.edges.clear();
         this.nodes = new Map();
         const marked = new Set(this.importers);
         for (const imp of marked) {
             // don't delete the importer!
             nodes.delete(imp.id);
             this.nodes.set(imp.id, imp);
-            for (const { to } of imp.edgesOut.values()) {
+            for (const edge of imp.edgesOut.values()) {
+                this.edges.add(edge);
+                const { to } = edge;
                 if (!to || marked.has(to))
                     continue;
                 marked.add(to);
@@ -145,6 +203,9 @@ export class Graph {
             if (edge.type === type &&
                 edge.spec.bareSpec === spec.bareSpec) {
                 if (to && to !== edge.to) {
+                    // removes this edge from its destination edgesIn ref
+                    edge.to?.edgesIn.delete(edge);
+                    // now swap the destination to the new one
                     edge.to = to;
                     edge.to.edgesIn.add(edge);
                 }
@@ -160,11 +221,9 @@ export class Graph {
     /**
      * Find an existing node to satisfy a dependency
      */
-    findResolution(spec, fromNode) {
+    findResolution(spec, fromNode, extra = '') {
         const f = spec.final;
-        // if it's a file: dep, then the fromNode location matters
-        const fromPref = f.type === 'file' ? fromNode.location + ' : ' : '';
-        const sf = fromPref + String(f);
+        const sf = getResolutionCacheKey(f, fromNode.location, extra);
         const cached = this.resolutions.get(sf);
         if (cached)
             return cached;
@@ -188,18 +247,10 @@ export class Graph {
         this.nodes.set(node.id, node);
         const nbn = this.nodesByName.get(node.name) ?? new Set();
         nbn.add(node);
-        this.nodesByName.set(node.name, nbn);
-        if (spec) {
-            const f = String(spec.final);
-            // if it's a file: type, then that is fromNode-specific,
-            // so we can't shortcut add it here.
-            if (spec.final.type !== 'file') {
-                this.resolutions.set(f, node);
-                const rrev = this.resolutionsReverse.get(node) ?? new Set();
-                rrev.add(f);
-                this.resolutionsReverse.set(node, rrev);
-            }
-        }
+        // ensure the nodes by name set is always sorted, this will help
+        // keeping a deterministic graph resolution when reusing nodes
+        const newByNameSet = new Set([...nbn].sort((a, b) => a.id.localeCompare(b.id)));
+        this.nodesByName.set(node.name, newByNameSet);
         if (manifest) {
             this.manifests.set(node.id, manifest);
         }
@@ -213,7 +264,7 @@ export class Graph {
      * For different uses that are not a direct top-down traversal of the graph
      * consider using `addNode()` and `addEdge()` instead.
      */
-    placePackage(fromNode, depType, spec, manifest, id) {
+    placePackage(fromNode, depType, spec, manifest, id, extra) {
         // if no manifest is available, then create an edge that has no
         // reference to any other node, representing a missing dependency
         if (!manifest && !id) {
@@ -227,7 +278,7 @@ export class Graph {
                 depType === 'optional' ||
                 depType === 'peerOptional',
         };
-        const depId = id || (manifest && getId(spec, manifest));
+        const depId = id || (manifest && getId(spec, manifest, extra));
         /* c8 ignore start - should not be possible */
         if (!depId) {
             throw error('Could not find dep id when placing package', {
@@ -243,26 +294,62 @@ export class Graph {
             this.addEdge(depType, spec, fromNode, toFoundNode);
             // the current only stays dev/optional if this dep lets it remain so
             // if it's not already, we don't make it dev or optional.
+            toFoundNode.detached = false;
             toFoundNode.dev &&= flags.dev;
             toFoundNode.optional &&= flags.optional;
             return toFoundNode;
         }
         // creates a new node and edges to its parent
-        const toNode = this.addNode(depId, manifest);
+        const toNode = this.addNode(depId, manifest, spec);
         toNode.registry = spec.registry;
         toNode.dev = flags.dev;
         toNode.optional = flags.optional;
+        // split extra into modifier and peerSetHash
+        if (extra) {
+            const { modifier, peerSetHash } = splitExtra(extra);
+            toNode.modifier = modifier;
+            toNode.peerSetHash = peerSetHash;
+        }
+        // add extra manifest info if available
+        if (manifest) {
+            const { bin, engines, os, cpu } = manifest;
+            // add platform info if available
+            if (engines || os || cpu) {
+                const platform = {};
+                if (engines)
+                    platform.engines = engines;
+                if (os)
+                    platform.os = os;
+                if (cpu)
+                    platform.cpu = cpu;
+                toNode.platform = platform;
+            }
+            // add bin info if available
+            if (bin) {
+                toNode.bins = bin;
+            }
+        }
+        toNode.maybeSetConfusedManifest(spec, manifest);
         this.addEdge(depType, spec, fromNode, toNode);
+        // populate resolution cache if applicable
+        const f = getResolutionCacheKey(spec.final, fromNode.location, extra || '');
+        this.resolutions.set(f, toNode);
+        const rrev = this.resolutionsReverse.get(toNode) ?? new Set();
+        rrev.add(f);
+        this.resolutionsReverse.set(toNode, rrev);
         return toNode;
     }
     /**
      * Removes a node and its relevant edges from the graph.
      *
+     * Use the `keepEdges` option to keep the edges that were pointing to
+     * this node and only removes their `to` property value.
+     *
      * If a replacement is provided, then any edges that were previously
      * pointing to the removed node will be directed to the replacement,
      * if it is valid to do so.
      */
-    removeNode(node, replacement) {
+    removeNode(node, replacement, keepEdges) {
         this.nodes.delete(node.id);
         const nbn = this.nodesByName.get(node.name);
         // if it's the last one, just remove the set
@@ -283,12 +370,51 @@ export class Graph {
                 satisfies(replacement.id, edge.spec, edge.from.location, this.projectRoot, this.monorepo)) {
                 edge.to = replacement;
             }
+            else if (keepEdges) {
+                edge.to = undefined;
+            }
             else {
                 edge.from.edgesOut.delete(edge.spec.name);
                 this.edges.delete(edge);
             }
         }
     }
+    /**
+     * Removes the resolved node of a given edge.
+     */
+    removeEdgeResolution(edge, extra = '') {
+        const node = edge.to;
+        const resolutionKey = getResolutionCacheKey(edge.spec, edge.from.location, extra);
+        if (node) {
+            edge.to = undefined;
+            this.resolutions.delete(resolutionKey);
+            this.resolutionsReverse.get(node)?.delete(resolutionKey);
+            this.nodesByName.delete(node.name);
+            node.edgesIn.delete(edge);
+            if (node.edgesIn.size === 0) {
+                this.nodes.delete(node.id);
+            }
+        }
+    }
+    /**
+     * Remove all edges from the graph while preserving nodes and resolution caches.
+     * This allows the graph to be reconstructed efficiently using the existing nodes.
+     */
+    resetEdges() {
+        // Clear the global edges set
+        this.edges.clear();
+        // Clear all node edge relationships
+        for (const node of this.nodes.values()) {
+            // marking nodes as detached needs to be restricted to only those
+            // that had a manifest, otherwise we'd be skipping fetching manifest
+            // for nodes we don't have a manifest during the ideal build phase
+            if (node.manifest)
+                node.detached = true;
+            // detaches all edges from this node
+            node.edgesOut.clear();
+            node.edgesIn.clear();
+        }
+    }
     toJSON() {
         return lockfileData({
             ...this.#options,