@vltpkg/graph 1.0.0-rc.12 → 1.0.0-rc.14

package/dist/lockfile/types.js.map

@@ -1 +1 @@
-{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/lockfile/types.ts"],"names":[],"mappings":"AAkCA,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,IAGlC,EAAE,EAAE,CACH,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,2BAA2B;IACvD,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,wBAAwB;QAC1C,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,mBAAmB;YAChC,CAAC,CAAC,oBAAoB,CAAA;AAExB,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,KAAwB,EAAE,EAAE,CAAC,CAAC;IACnE,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,mBAAmB,CAAC;IACpC,QAAQ,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,wBAAwB,CAAC;CAC/C,CAAC,CAAA;AAEF,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,CAAA;AACrC,MAAM,CAAC,MAAM,wBAAwB,GAAG,CAAC,CAAA;AACzC,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,CAAA;AACpC,MAAM,CAAC,MAAM,2BAA2B,GAAG,CAAC,CAAA;AAO5C;;GAEG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,SAAS,CAAA;AACvC,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAA;AACjC,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,CAAA;AAChC,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAA;AAOjC,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,IAErC,EAAsB,EAAE;IACvB,QAAQ,IAAI,CAAC,UAAU,EAAE,CAAC;QACxB,KAAK,QAAQ;YACX,OAAO,gBAAgB,CAAA;QACzB,KAAK,OAAO;YACV,OAAO,eAAe,CAAA;QACxB,KAAK,QAAQ;YACX,OAAO,gBAAgB,CAAA;QACzB;YACE,OAAO,cAAc,CAAA;IACzB,CAAC;AACH,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAClC,KAAyB,EACe,EAAE;IAC1C,QAAQ,KAAK,EAAE,CAAC;QACd,KAAK,gBAAgB;YACnB,OAAO,QAAQ,CAAA;QACjB,KAAK,eAAe;YAClB,OAAO,OAAO,CAAA;QAChB,KAAK,gBAAgB;YACnB,OAAO,QAAQ,CAAA;QACjB;YACE,OAAO,MAAM,CAAA;IACjB,CAAC;AACH,CAAC,CAAA","sourcesContent":["import type { DepID } from '@vltpkg/dep-id'\nimport type { Spec, SpecOptions } from '@vltpkg/spec'\nimport type {\n  Integrity,\n  NormalizedManifest,\n  DependencyTypeShort,\n} from '@vltpkg/types'\nimport type { Graph } from '../graph.ts'\n\n/**\n * Platform requirements for a lockfile node\n */\nexport type LockfilePlatform = {\n  engines?: Record<string, string>\n  os?: string[] | string\n  cpu?: string[] | string\n}\n\n/**\n * This is the main type definition for the contents of the\n * `vlt-lock.json` file.\n *\n * The nodes and edges information from the lockfile are used to reconstruct\n * a {@link Graph} representing a previous install.\n */\nexport type LockfileData = {\n  lockfileVersion: number\n  options: SpecOptions & {\n    modifiers?: Record<string, string> | undefined\n  }\n  nodes: Record<DepID, LockfileNode>\n  edges: LockfileEdges\n}\n\nexport const getFlagNumFromNode = (node: {\n  optional?: boolean\n  dev?: boolean\n}) =>\n  node.optional && node.dev ? LockfileNodeFlagDevOptional\n  : node.optional ? LockfileNodeFlagOptional\n  : node.dev ? LockfileNodeFlagDev\n  : LockfileNodeFlagNone\n\nexport const getBooleanFlagsFromNum = (flags: LockfileNodeFlags) => ({\n  dev: !!(flags & LockfileNodeFlagDev),\n  optional: !!(flags & LockfileNodeFlagOptional),\n})\n\nexport const LockfileNodeFlagNone = 0\nexport const LockfileNodeFlagOptional = 1\nexport const LockfileNodeFlagDev = 2\nexport const LockfileNodeFlagDevOptional = 3\n\n/**\n * Bit flags indicating whether a node is optional and/or dev.\n */\nexport type LockfileNodeFlags = 0 | 1 | 2 | 3\n\n/**\n * Build state constants for lockfile nodes\n */\nexport const BuildStateNone = undefined\nexport const BuildStateNeeded = 1\nexport const BuildStateBuilt = 2\nexport const BuildStateFailed = 3\n\n/**\n * Build state for a node - tracks whether it needs building, has been built, or failed\n */\nexport type LockfileBuildState = undefined | 1 | 2 | 3\n\nexport const getBuildStateFromNode = (node: {\n  buildState?: 'none' | 'needed' | 'built' | 'failed'\n}): LockfileBuildState => {\n  switch (node.buildState) {\n    case 'needed':\n      return BuildStateNeeded\n    case 'built':\n      return BuildStateBuilt\n    case 'failed':\n      return BuildStateFailed\n    default:\n      return BuildStateNone\n  }\n}\n\nexport const getBuildStateFromNum = (\n  state: LockfileBuildState,\n): 'none' | 'needed' | 'built' | 'failed' => {\n  switch (state) {\n    case BuildStateNeeded:\n      return 'needed'\n    case BuildStateBuilt:\n      return 'built'\n    case BuildStateFailed:\n      return 'failed'\n    default:\n      return 'none'\n  }\n}\n\n/**\n * Lockfile representation of a node from the install graph.\n */\nexport type LockfileNode = [\n  flags: LockfileNodeFlags,\n  name?: string | null,\n  integrity?: Integrity | null,\n  resolved?: string | null,\n  location?: string | null,\n  manifest?: NormalizedManifest | null,\n  rawManifest?: NormalizedManifest | null,\n  platform?: LockfilePlatform | null,\n  bins?: Record<string, string> | null,\n  buildState?: LockfileBuildState | null,\n]\n\n/**\n * Lockfile edges are stored as a record object where the key\n * is `${from.id} ${spec.name}` and the value is\n * `${type} ${spec.bareSpec} ${to.id | 'MISSING'}`\n *\n * Storing them in a record like this means that we are guaranteed to\n * never end up with duplicates, and a standard `JSON.stringify()`\n * will nicely print them out one line per edge.\n */\nexport type LockfileEdges = {\n  [key: LockfileEdgeKey]: LockfileEdgeValue\n}\n\n/** `${from} ${dep name}` */\nexport type LockfileEdgeKey = `${DepID} ${string}`\n\n/** `${type} ${spec} ${to}` */\nexport type LockfileEdgeValue =\n  `${DependencyTypeShort} ${Spec['bareSpec']} ${DepID | 'MISSING'}`\n"]}
+{"version":3,"file":"types.js","sourceRoot":"","sources":["../../src/lockfile/types.ts"],"names":[],"mappings":"AAmCA,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,IAGlC,EAAE,EAAE,CACH,IAAI,CAAC,QAAQ,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,2BAA2B;IACvD,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,wBAAwB;QAC1C,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,mBAAmB;YAChC,CAAC,CAAC,oBAAoB,CAAA;AAExB,MAAM,CAAC,MAAM,sBAAsB,GAAG,CAAC,KAAwB,EAAE,EAAE,CAAC,CAAC;IACnE,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,mBAAmB,CAAC;IACpC,QAAQ,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,wBAAwB,CAAC;CAC/C,CAAC,CAAA;AAEF,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,CAAA;AACrC,MAAM,CAAC,MAAM,wBAAwB,GAAG,CAAC,CAAA;AACzC,MAAM,CAAC,MAAM,mBAAmB,GAAG,CAAC,CAAA;AACpC,MAAM,CAAC,MAAM,2BAA2B,GAAG,CAAC,CAAA;AAO5C;;GAEG;AACH,MAAM,CAAC,MAAM,cAAc,GAAG,SAAS,CAAA;AACvC,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAA;AACjC,MAAM,CAAC,MAAM,eAAe,GAAG,CAAC,CAAA;AAChC,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAAC,CAAA;AAOjC,MAAM,CAAC,MAAM,qBAAqB,GAAG,CAAC,IAErC,EAAsB,EAAE;IACvB,QAAQ,IAAI,CAAC,UAAU,EAAE,CAAC;QACxB,KAAK,QAAQ;YACX,OAAO,gBAAgB,CAAA;QACzB,KAAK,OAAO;YACV,OAAO,eAAe,CAAA;QACxB,KAAK,QAAQ;YACX,OAAO,gBAAgB,CAAA;QACzB;YACE,OAAO,cAAc,CAAA;IACzB,CAAC;AACH,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAClC,KAAyB,EACe,EAAE;IAC1C,QAAQ,KAAK,EAAE,CAAC;QACd,KAAK,gBAAgB;YACnB,OAAO,QAAQ,CAAA;QACjB,KAAK,eAAe;YAClB,OAAO,OAAO,CAAA;QAChB,KAAK,gBAAgB;YACnB,OAAO,QAAQ,CAAA;QACjB;YACE,OAAO,MAAM,CAAA;IACjB,CAAC;AACH,CAAC,CAAA","sourcesContent":["import type { DepID } from '@vltpkg/dep-id'\nimport type { Spec, SpecOptions } from '@vltpkg/spec'\nimport type {\n  Integrity,\n  NormalizedManifest,\n  DependencyTypeShort,\n} from '@vltpkg/types'\nimport type { Graph } from '../graph.ts'\n\n/**\n * Platform requirements for a lockfile node\n */\nexport type LockfilePlatform = {\n  engines?: Record<string, string>\n  os?: string[] | string\n  cpu?: string[] | string\n  libc?: string[] | string\n}\n\n/**\n * This is the main type definition for the contents of the\n * `vlt-lock.json` file.\n *\n * The nodes and edges information from the lockfile are used to reconstruct\n * a {@link Graph} representing a previous install.\n */\nexport type LockfileData = {\n  lockfileVersion: number\n  options: SpecOptions & {\n    modifiers?: Record<string, string> | undefined\n  }\n  nodes: Record<DepID, LockfileNode>\n  edges: LockfileEdges\n}\n\nexport const getFlagNumFromNode = (node: {\n  optional?: boolean\n  dev?: boolean\n}) =>\n  node.optional && node.dev ? LockfileNodeFlagDevOptional\n  : node.optional ? LockfileNodeFlagOptional\n  : node.dev ? LockfileNodeFlagDev\n  : LockfileNodeFlagNone\n\nexport const getBooleanFlagsFromNum = (flags: LockfileNodeFlags) => ({\n  dev: !!(flags & LockfileNodeFlagDev),\n  optional: !!(flags & LockfileNodeFlagOptional),\n})\n\nexport const LockfileNodeFlagNone = 0\nexport const LockfileNodeFlagOptional = 1\nexport const LockfileNodeFlagDev = 2\nexport const LockfileNodeFlagDevOptional = 3\n\n/**\n * Bit flags indicating whether a node is optional and/or dev.\n */\nexport type LockfileNodeFlags = 0 | 1 | 2 | 3\n\n/**\n * Build state constants for lockfile nodes\n */\nexport const BuildStateNone = undefined\nexport const BuildStateNeeded = 1\nexport const BuildStateBuilt = 2\nexport const BuildStateFailed = 3\n\n/**\n * Build state for a node - tracks whether it needs building, has been built, or failed\n */\nexport type LockfileBuildState = undefined | 1 | 2 | 3\n\nexport const getBuildStateFromNode = (node: {\n  buildState?: 'none' | 'needed' | 'built' | 'failed'\n}): LockfileBuildState => {\n  switch (node.buildState) {\n    case 'needed':\n      return BuildStateNeeded\n    case 'built':\n      return BuildStateBuilt\n    case 'failed':\n      return BuildStateFailed\n    default:\n      return BuildStateNone\n  }\n}\n\nexport const getBuildStateFromNum = (\n  state: LockfileBuildState,\n): 'none' | 'needed' | 'built' | 'failed' => {\n  switch (state) {\n    case BuildStateNeeded:\n      return 'needed'\n    case BuildStateBuilt:\n      return 'built'\n    case BuildStateFailed:\n      return 'failed'\n    default:\n      return 'none'\n  }\n}\n\n/**\n * Lockfile representation of a node from the install graph.\n */\nexport type LockfileNode = [\n  flags: LockfileNodeFlags,\n  name?: string | null,\n  integrity?: Integrity | null,\n  resolved?: string | null,\n  location?: string | null,\n  manifest?: NormalizedManifest | null,\n  rawManifest?: NormalizedManifest | null,\n  platform?: LockfilePlatform | null,\n  bins?: Record<string, string> | null,\n  buildState?: LockfileBuildState | null,\n]\n\n/**\n * Lockfile edges are stored as a record object where the key\n * is `${from.id} ${spec.name}` and the value is\n * `${type} ${spec.bareSpec} ${to.id | 'MISSING'}`\n *\n * Storing them in a record like this means that we are guaranteed to\n * never end up with duplicates, and a standard `JSON.stringify()`\n * will nicely print them out one line per edge.\n */\nexport type LockfileEdges = {\n  [key: LockfileEdgeKey]: LockfileEdgeValue\n}\n\n/** `${from} ${dep name}` */\nexport type LockfileEdgeKey = `${DepID} ${string}`\n\n/** `${type} ${spec} ${to}` */\nexport type LockfileEdgeValue =\n  `${DependencyTypeShort} ${Spec['bareSpec']} ${DepID | 'MISSING'}`\n"]}

package/dist/node.d.ts

@@ -117,6 +117,7 @@ export declare class Node implements NodeLike {
         engines?: Record<string, string>;
         os?: string[] | string;
         cpu?: string[] | string;
+        libc?: string[] | string;
     };
     /**
      * Record of binary names to their paths in the package, if any.
@@ -223,6 +224,7 @@ export declare class Node implements NodeLike {
             engines?: Record<string, string>;
             os?: string[] | string;
             cpu?: string[] | string;
+            libc?: string[] | string;
         } | undefined;
         buildState: "none" | "needed" | "built" | "failed";
     };

package/dist/node.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"node.d.ts","sourceRoot":"","sources":["../src/node.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAO7C,OAAO,KAAK,EAAE,KAAK,EAAc,MAAM,gBAAgB,CAAA;AAEvD,OAAO,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAErD,OAAO,KAAK,EACV,SAAS,EACT,kBAAkB,EAClB,mBAAmB,EACnB,SAAS,EACT,QAAQ,EACT,MAAM,eAAe,CAAA;AACtB,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAChC,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AAKvC,MAAM,MAAM,WAAW,GAAG,WAAW,GAAG;IACtC,WAAW,EAAE,MAAM,CAAA;IACnB,KAAK,EAAE,SAAS,CAAA;CACjB,CAAA;AAED,qBAAa,IAAK,YAAW,QAAQ;;IACnC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,WAEvB;IAOD;;;;;;OAMG;IACH,IAAI,QAAQ,IAGW,OAAO,CAD7B;IACD,IAAI,QAAQ,CAAC,QAAQ,EAAE,OAAO,EAS7B;IAED,UAAU,IAAI,IAAI,IAAI,IAAI,GAAG;QAAE,QAAQ,EAAE,IAAI,CAAA;KAAE;IAK/C;;;;;OAKG;IACH,IAAI,GAAG,IAGM,OAAO,CADnB;IACD,IAAI,GAAG,CAAC,GAAG,EAAE,OAAO,EASnB;IAED,KAAK,IAAI,IAAI,IAAI,IAAI,GAAG;QAAE,GAAG,EAAE,IAAI,CAAA;KAAE;IAIrC;;OAEG;IACH,QAAQ,UAAQ;IAEhB;;OAEG;IACH,SAAS,UAAQ;IAEjB;;OAEG;IACH,OAAO,YAAkB;IAEzB;;;OAGG;IACH,QAAQ,oBAA0B;IAElC;;;OAGG;IACH,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,SAAS,CAAA;IAEzC;;OAEG;IACH,EAAE,EAAE,KAAK,CAAA;IAET;;OAEG;IACH,QAAQ,UAAQ;IAEhB;;OAEG;IACH,YAAY,UAAQ;IAEpB;;OAEG;IACH,KAAK,EAAE,KAAK,CAAA;IAEZ;;OAEG;IACH,SAAS,CAAC,EAAE,SAAS,CAAA;IAErB;;OAEG;IACH,QAAQ,CAAC,EAAE,kBAAkB,CAAA;IAE7B;;OAEG;IACH,WAAW,EAAE,MAAM,CAAA;IAEnB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAA;IAEjB;;;;OAIG;IACH,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAA;IAS5B,IAAI,IAAI,WAIP;IAED;;;;;OAKG;IACH,OAAO,CAAC,EAAE,MAAM,CAAA;IAEhB;;OAEG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAA;IAEjB;;;;OAIG;IACH,QAAQ,CAAC,EAAE;QACT,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;QAChC,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAAA;QACtB,GAAG,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAAA;KACxB,CAAA;IAED;;OAEG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAE7B;;OAEG;IACH,KAAK,UAAQ;IAEb;;;;;;OAMG;IACH,UAAU,EAAE,MAAM,GAAG,QAAQ,GAAG,OAAO,GAAG,QAAQ,CAAS;IAE3D;;;;OAIG;IACH,WAAW,CAAC,EAAE,MAAM,CAAA;IAEpB;;;;;OAKG;IACH,QAAQ,UAAQ;IAEhB;;OAEG;IACH,IAAI,QAAQ,IAAI,MAAM,CAQrB;IAED,IAAI,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAM5B;IAED;;OAEG;IACH,gBAAgB,CAAC,MAAM,EAAE,UAAU,GAAG,MAAM;IAI5C;;;;;;;OAOG;IACH,WAAW,CAAC,MAAM,EAAE,UAAU,GAAG,MAAM;gBAQrC,OAAO,EAAE,WAAW,EACpB,EAAE,CAAC,EAAE,KAAK,EACV,QAAQ,CAAC,EAAE,kBAAkB,EAC7B,IAAI,CAAC,EAAE,IAAI,EACX,IAAI,CAAC,EAAE,MAAM,EACb,OAAO,CAAC,EAAE,MAAM;IAwBlB;;;;OAIG;IACH,UAAU,IAAI,OAAO;IAkBrB,IAAI,OAAO,IAKQ,WAAW,CAH7B;IAGD,IAAI,OAAO,CAAC,KAAK,EAAE,WAAW,EAAI;IAElC,MAAM,CAAC,KAAK,EAAE,IAAI;IAIlB;;OAEG;IACH,mBAAmB,CAAC,QAAQ,EAAE,MAAM;IAKpC;;;;OAIG;IACH,WAAW;IAqBX,kBAAkB;IAclB;;OAEG;IACH,UAAU,CAAC,IAAI,EAAE,mBAAmB,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI;IAO7D;;;OAGG;IACH,IAAI,WAAW,IAAI,kBAAkB,GAAG,SAAS,CAEhD;IAED;;OAEG;IACH,mBAAmB,CACjB,KAAK,EAAE,kBAAkB,EACzB,QAAQ,CAAC,EAAE,kBAAkB;IAQ/B;;OAEG;IACH,wBAAwB,CACtB,IAAI,EAAE,IAAI,EACV,QAAQ,CAAC,EAAE,kBAAkB;IAa/B,MAAM;;;;;;;;;;;;;;;;;sBAnPM,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;iBAC3B,MAAM,EAAE,GAAG,MAAM;kBAChB,MAAM,EAAE,GAAG,MAAM;;;;IA6QzB,QAAQ;CAGT;AAED,eAAO,MAAM,MAAM,UAAW,OAAO,KAAG,KAAK,IAAI,IAQhD,CAAA;AAED,eAAO,MAAM,MAAM,UAAW,OAAO,KAAG,IAKvC,CAAA"}
+{"version":3,"file":"node.d.ts","sourceRoot":"","sources":["../src/node.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAO7C,OAAO,KAAK,EAAE,KAAK,EAAc,MAAM,gBAAgB,CAAA;AAEvD,OAAO,KAAK,EAAE,IAAI,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAErD,OAAO,KAAK,EACV,SAAS,EACT,kBAAkB,EAClB,mBAAmB,EACnB,SAAS,EACT,QAAQ,EACT,MAAM,eAAe,CAAA;AACtB,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAChC,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AAKvC,MAAM,MAAM,WAAW,GAAG,WAAW,GAAG;IACtC,WAAW,EAAE,MAAM,CAAA;IACnB,KAAK,EAAE,SAAS,CAAA;CACjB,CAAA;AAED,qBAAa,IAAK,YAAW,QAAQ;;IACnC,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,WAEvB;IAOD;;;;;;OAMG;IACH,IAAI,QAAQ,IAGW,OAAO,CAD7B;IACD,IAAI,QAAQ,CAAC,QAAQ,EAAE,OAAO,EAS7B;IAED,UAAU,IAAI,IAAI,IAAI,IAAI,GAAG;QAAE,QAAQ,EAAE,IAAI,CAAA;KAAE;IAK/C;;;;;OAKG;IACH,IAAI,GAAG,IAGM,OAAO,CADnB;IACD,IAAI,GAAG,CAAC,GAAG,EAAE,OAAO,EASnB;IAED,KAAK,IAAI,IAAI,IAAI,IAAI,GAAG;QAAE,GAAG,EAAE,IAAI,CAAA;KAAE;IAIrC;;OAEG;IACH,QAAQ,UAAQ;IAEhB;;OAEG;IACH,SAAS,UAAQ;IAEjB;;OAEG;IACH,OAAO,YAAkB;IAEzB;;;OAGG;IACH,QAAQ,oBAA0B;IAElC;;;OAGG;IACH,UAAU,EAAE,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,SAAS,CAAA;IAEzC;;OAEG;IACH,EAAE,EAAE,KAAK,CAAA;IAET;;OAEG;IACH,QAAQ,UAAQ;IAEhB;;OAEG;IACH,YAAY,UAAQ;IAEpB;;OAEG;IACH,KAAK,EAAE,KAAK,CAAA;IAEZ;;OAEG;IACH,SAAS,CAAC,EAAE,SAAS,CAAA;IAErB;;OAEG;IACH,QAAQ,CAAC,EAAE,kBAAkB,CAAA;IAE7B;;OAEG;IACH,WAAW,EAAE,MAAM,CAAA;IAEnB;;;;OAIG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAA;IAEjB;;;;OAIG;IACH,QAAQ,EAAE,MAAM,GAAG,SAAS,CAAA;IAS5B,IAAI,IAAI,WAIP;IAED;;;;;OAKG;IACH,OAAO,CAAC,EAAE,MAAM,CAAA;IAEhB;;OAEG;IACH,QAAQ,CAAC,EAAE,MAAM,CAAA;IAEjB;;;;OAIG;IACH,QAAQ,CAAC,EAAE;QACT,OAAO,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;QAChC,EAAE,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAAA;QACtB,GAAG,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAAA;QACvB,IAAI,CAAC,EAAE,MAAM,EAAE,GAAG,MAAM,CAAA;KACzB,CAAA;IAED;;OAEG;IACH,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAA;IAE7B;;OAEG;IACH,KAAK,UAAQ;IAEb;;;;;;OAMG;IACH,UAAU,EAAE,MAAM,GAAG,QAAQ,GAAG,OAAO,GAAG,QAAQ,CAAS;IAE3D;;;;OAIG;IACH,WAAW,CAAC,EAAE,MAAM,CAAA;IAEpB;;;;;OAKG;IACH,QAAQ,UAAQ;IAEhB;;OAEG;IACH,IAAI,QAAQ,IAAI,MAAM,CAQrB;IAED,IAAI,QAAQ,CAAC,QAAQ,EAAE,MAAM,EAM5B;IAED;;OAEG;IACH,gBAAgB,CAAC,MAAM,EAAE,UAAU,GAAG,MAAM;IAI5C;;;;;;;OAOG;IACH,WAAW,CAAC,MAAM,EAAE,UAAU,GAAG,MAAM;gBAQrC,OAAO,EAAE,WAAW,EACpB,EAAE,CAAC,EAAE,KAAK,EACV,QAAQ,CAAC,EAAE,kBAAkB,EAC7B,IAAI,CAAC,EAAE,IAAI,EACX,IAAI,CAAC,EAAE,MAAM,EACb,OAAO,CAAC,EAAE,MAAM;IAwBlB;;;;OAIG;IACH,UAAU,IAAI,OAAO;IAkBrB,IAAI,OAAO,IAKQ,WAAW,CAH7B;IAGD,IAAI,OAAO,CAAC,KAAK,EAAE,WAAW,EAAI;IAElC,MAAM,CAAC,KAAK,EAAE,IAAI;IAIlB;;OAEG;IACH,mBAAmB,CAAC,QAAQ,EAAE,MAAM;IAKpC;;;;OAIG;IACH,WAAW;IAqBX,kBAAkB;IAclB;;OAEG;IACH,UAAU,CAAC,IAAI,EAAE,mBAAmB,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,IAAI;IAO7D;;;OAGG;IACH,IAAI,WAAW,IAAI,kBAAkB,GAAG,SAAS,CAEhD;IAED;;OAEG;IACH,mBAAmB,CACjB,KAAK,EAAE,kBAAkB,EACzB,QAAQ,CAAC,EAAE,kBAAkB;IAQ/B;;OAEG;IACH,wBAAwB,CACtB,IAAI,EAAE,IAAI,EACV,QAAQ,CAAC,EAAE,kBAAkB;IAa/B,MAAM;;;;;;;;;;;;;;;;;sBApPM,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC;iBAC3B,MAAM,EAAE,GAAG,MAAM;kBAChB,MAAM,EAAE,GAAG,MAAM;mBAChB,MAAM,EAAE,GAAG,MAAM;;;;IA6Q1B,QAAQ;CAGT;AAED,eAAO,MAAM,MAAM,UAAW,OAAO,KAAG,KAAK,IAAI,IAQhD,CAAA;AAED,eAAO,MAAM,MAAM,UAAW,OAAO,KAAG,IAKvC,CAAA"}

package/dist/node.js.map

@@ -1 +1 @@
-{"version":3,"file":"node.js","sourceRoot":"","sources":["../src/node.ts"],"names":[],"mappings":"AACA,OAAO,EACL,qBAAqB,EACrB,KAAK,EACL,YAAY,EACZ,UAAU,GACX,MAAM,gBAAgB,CAAA;AAEvB,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAA;AAE/C,OAAO,EAAE,+BAA+B,EAAE,MAAM,eAAe,CAAA;AAQ/D,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAEhC,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAA;AASnD,MAAM,OAAO,IAAI;IACf,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,oBAAoB,CAAA;IAC7B,CAAC;IAED,QAAQ,CAAa;IACrB,SAAS,CAAS;IAClB,YAAY,CAAqB;IAEjC,SAAS,GAAG,KAAK,CAAA;IACjB;;;;;;OAMG;IACH,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,SAAS,CAAA;IACvB,CAAC;IACD,IAAI,QAAQ,CAAC,QAAiB;QAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAA;QAC7B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QACzB,IAAI,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;YACxB,8BAA8B;YAC9B,KAAK,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBACtD,IAAI,CAAC,QAAQ,IAAI,EAAE,EAAE,QAAQ;oBAAE,EAAE,CAAC,QAAQ,GAAG,KAAK,CAAA;YACpD,CAAC;QACH,CAAC;IACH,CAAC;IAED,UAAU;QACR,OAAO,IAAI,CAAC,SAAS,CAAA;IACvB,CAAC;IAED,IAAI,GAAG,KAAK,CAAA;IACZ;;;;;OAKG;IACH,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,IAAI,CAAA;IAClB,CAAC;IACD,IAAI,GAAG,CAAC,GAAY;QAClB,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAA;QACxB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAA;QACf,IAAI,MAAM,IAAI,CAAC,GAAG,EAAE,CAAC;YACnB,8BAA8B;YAC9B,KAAK,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBACjD,IAAI,CAAC,GAAG,IAAI,EAAE,EAAE,GAAG;oBAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAA;YACrC,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK;QACH,OAAO,IAAI,CAAC,IAAI,CAAA;IAClB,CAAC;IAED;;OAEG;IACH,QAAQ,GAAG,KAAK,CAAA;IAEhB;;OAEG;IACH,SAAS,GAAG,KAAK,CAAA;IAEjB;;OAEG;IACH,OAAO,GAAG,IAAI,GAAG,EAAQ,CAAA;IAEzB;;;OAGG;IACH,QAAQ,GAAG,IAAI,GAAG,EAAgB,CAAA;IAElC;;;OAGG;IACH,UAAU,CAA+B;IAEzC;;OAEG;IACH,EAAE,CAAO;IAET;;OAEG;IACH,QAAQ,GAAG,KAAK,CAAA;IAEhB;;OAEG;IACH,YAAY,GAAG,KAAK,CAAA;IAEpB;;OAEG;IACH,KAAK,CAAO;IAEZ;;OAEG;IACH,SAAS,CAAY;IAErB;;OAEG;IACH,QAAQ,CAAqB;IAE7B;;OAEG;IACH,WAAW,CAAQ;IAEnB;;;;OAIG;IACH,QAAQ,CAAS;IAEjB;;;;OAIG;IACH,QAAQ,CAAoB;IAE5B;;;;;OAKG;IACH,KAAK,CAAS;IACd,IAAI,IAAI;QACN,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC,KAAK,CAAA;QACjC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,EAAE,CAAA;QACpB,OAAO,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAS;IAEhB;;OAEG;IACH,QAAQ,CAAS;IAEjB;;;;OAIG;IACH,QAAQ,CAIP;IAED;;OAEG;IACH,IAAI,CAAyB;IAE7B;;OAEG;IACH,KAAK,GAAG,KAAK,CAAA;IAEb;;;;;;OAMG;IACH,UAAU,GAA2C,MAAM,CAAA;IAE3D;;;;OAIG;IACH,WAAW,CAAS;IAEpB;;;;;OAKG;IACH,QAAQ,GAAG,KAAK,CAAA;IAEhB;;OAEG;IACH,IAAI,QAAQ;QACV,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,SAAS,CAAA;QACvB,CAAC;QACD,IAAI,CAAC,SAAS,GAAG,uBAAuB,IAAI,CAAC,EAAE,iBAAiB,IAAI,CAAC,IAAI,EAAE,CAAA;QAC3E,oDAAoD;QACpD,IAAI,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC,IAAI,CAAA;QAC5B,OAAO,IAAI,CAAC,SAAS,CAAA;IACvB,CAAC;IAED,IAAI,QAAQ,CAAC,QAAgB;QAC3B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QACzB,qDAAqD;QACrD,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC;YAClD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAA;QAC7C,CAAC;IACH,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,MAAkB;QACjC,OAAO,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,QAAQ,EAAE,CAAA;IACrD,CAAC;IAED;;;;;;;OAOG;IACH,WAAW,CAAC,MAAkB;QAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAA;QACzC,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;YACtB,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YACrD,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,EAAE,cAAc,CAAC,CAAA;IACzC,CAAC;IAED,YACE,OAAoB,EACpB,EAAU,EACV,QAA6B,EAC7B,IAAW,EACX,IAAa,EACb,OAAgB;QAEhB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAA;QACvB,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAA;QACtC,IAAI,EAAE,EAAE,CAAC;YACP,IAAI,CAAC,EAAE,GAAG,EAAE,CAAA;QACd,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;gBACvB,MAAM,SAAS,CACb,8DAA8D,EAC9D;oBACE,QAAQ;iBACT,CACF,CAAA;YACH,CAAC;YACD,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;QACjC,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAc,CAAA;QACnC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QAExB,IAAI,CAAC,KAAK,GAAG,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAA;QACxC,IAAI,CAAC,OAAO,GAAG,OAAO,IAAI,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAA;IAClD,CAAC;IAED;;;;OAIG;IACH,UAAU;QACR,uEAAuE;QACvE,mEAAmE;QACnE,wDAAwD;QACxD,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CACpC,QAAQ,IAAI,CAAC,EAAE,iBAAiB,IAAI,CAAC,IAAI,EAAE,CAC5C,CAAA;QACD,IAAI,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC,OAAO,CAAA;QAC/B,OAAO,OAAO,CAAA;IAChB,CAAC;IAED,qBAAqB,CAAC,KAAiB;QACrC,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;QAC3D,IAAI,CAAC,QAAQ;YACX,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,IAAI,IAAI,CAAC,2BAA2B,CAAA;QAClE,IAAI,CAAC,SAAS,KAAK,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,SAAS,CAAA;IACnD,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,QAAQ,CAAA;IACtB,CAAC;IAED,oBAAoB;IACpB,IAAI,OAAO,CAAC,KAAkB,IAAG,CAAC;IAElC,MAAM,CAAC,KAAW;QAChB,OAAO,IAAI,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ,CAAA;IACjE,CAAC;IAED;;OAEG;IACH,mBAAmB,CAAC,QAAgB;QAClC,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QACzB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;IACtB,CAAC;IAED;;;;OAIG;IACH,WAAW;QACT,iEAAiE;QACjE,8DAA8D;QAC9D,mBAAmB;QACnB,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACjC,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,GAAG,KAAK,CAAA;QAC9B,QAAQ,IAAI,EAAE,CAAC;YACb,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACd,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;gBACxB,IAAI,CAAC,SAAS,KAAK,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,SAAS,CAAA;gBACjD,MAAK;YACP,CAAC;YACD,KAAK,UAAU;gBACb,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAA;gBACjC,MAAK;YACP;gBACE,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;gBACxB,MAAK;QACT,CAAC;IACH,CAAC;IAED,kBAAkB;QAChB,MAAM,GAAG,GAAG,uBAAuB,IAAI,CAAC,EAAE,iBAAiB,IAAI,CAAC,IAAI,EAAE,CAAA;QAEtE,2DAA2D;QAC3D,IACE,CAAC,IAAI,CAAC,QAAQ;YACd,CAAC,CAAC,IAAI,CAAC,SAAS;gBACd,CAAC,IAAI,CAAC,SAAS,KAAK,GAAG;oBACrB,0BAA0B,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EACrD,CAAC;YACD,IAAI,CAAC,SAAS,GAAG,GAAG,CAAA;QACtB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,IAAyB,EAAE,IAAU,EAAE,IAAW;QAC3D,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;QAC7C,IAAI,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACvB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QAClC,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;;OAGG;IACH,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,QAAQ,CAAA;IAC3C,CAAC;IAED;;OAEG;IACH,mBAAmB,CACjB,KAAyB,EACzB,QAA6B;QAE7B,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAA;QACrB,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAA;QAC5B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;QACpB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAA;IACjC,CAAC;IAED;;OAEG;IACH,wBAAwB,CACtB,IAAU,EACV,QAA6B;QAE7B,IAAI,qBAAqB,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC;YACrD,IAAI,CAAC,mBAAmB,CACtB;gBACE,GAAG,IAAI,CAAC,QAAQ;gBAChB,IAAI,EAAE,IAAI,CAAC,IAAI;aAChB,EACD,QAAQ,CACT,CAAA;QACH,CAAC;IACH,CAAC;IAED,MAAM;QACJ,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EACN,IAAI,CAAC,QAAQ;gBACb,+BAA+B,CAAC,IAAI,CAAC,QAAQ,CAAC;YAChD,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,GAAG,EAAE,IAAI,CAAC,GAAG;YACb,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBACpB,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE;gBACnC,CAAC,CAAC,SAAS,CAAC;YACZ,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACjB,EAAE,WAAW,EAAE,IAAI,CAAC,YAAY,EAAE;gBACpC,CAAC,CAAC,SAAS,CAAC;SACb,CAAA;IACH,CAAC;IAED,QAAQ;QACN,OAAO,aAAa,CAAC,IAAI,CAAC,CAAA;IAC5B,CAAC;CACF;AAED,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,KAAc,EAAiB,EAAE;IACtD,OAAO,CACL,OAAO,KAAK,KAAK,QAAQ;QACzB,KAAK,IAAI,IAAI;QACb,IAAI,IAAI,KAAK;QACb,UAAU,IAAI,KAAK;QAClB,KAAc,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,oBAAoB,CAC7D,CAAA;AACH,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,KAAc,EAAQ,EAAE;IAC7C,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;QACnB,MAAM,SAAS,CAAC,iBAAiB,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAA;IACtD,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC,CAAA","sourcesContent":["import type { PathScurry } from 'path-scurry'\nimport {\n  isPackageNameConfused,\n  getId,\n  hydrateTuple,\n  splitDepID,\n} from '@vltpkg/dep-id'\nimport type { DepID, DepIDTuple } from '@vltpkg/dep-id'\nimport { typeError } from '@vltpkg/error-cause'\nimport type { Spec, SpecOptions } from '@vltpkg/spec'\nimport { expandNormalizedManifestSymbols } from '@vltpkg/types'\nimport type {\n  Integrity,\n  NormalizedManifest,\n  DependencyTypeShort,\n  GraphLike,\n  NodeLike,\n} from '@vltpkg/types'\nimport { Edge } from './edge.ts'\nimport type { Graph } from './graph.ts'\nimport { stringifyNode } from './stringify-node.ts'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport type { GraphModifier } from './modifiers.ts'\n\nexport type NodeOptions = SpecOptions & {\n  projectRoot: string\n  graph: GraphLike\n}\n\nexport class Node implements NodeLike {\n  get [Symbol.toStringTag]() {\n    return '@vltpkg/graph.Node'\n  }\n\n  #options: SpecOptions\n  #location?: string\n  #rawManifest?: NormalizedManifest\n\n  #optional = false\n  /**\n   * True if a node is only reachable via optional or peerOptional edges from\n   * any importer.\n   *\n   * Setting this to false, if previously set to true, will also unset\n   * the flag on any optional-flagged non-optional dependencies.\n   */\n  get optional() {\n    return this.#optional\n  }\n  set optional(optional: boolean) {\n    const before = this.#optional\n    this.#optional = optional\n    if (before && !optional) {\n      // unset for all deps, as well\n      for (const { to, optional } of this.edgesOut.values()) {\n        if (!optional && to?.optional) to.optional = false\n      }\n    }\n  }\n\n  isOptional(): this is Node & { optional: true } {\n    return this.#optional\n  }\n\n  #dev = false\n  /**\n   * True if a node is only reachable via dev edges from any importer.\n   *\n   * Setting this to false, if previously set to true, will also unset\n   * the flag on any dev-flagged non-dev dependencies.\n   */\n  get dev() {\n    return this.#dev\n  }\n  set dev(dev: boolean) {\n    const before = this.#dev\n    this.#dev = dev\n    if (before && !dev) {\n      // unset for all deps, as well\n      for (const { to, dev } of this.edgesOut.values()) {\n        if (!dev && to?.dev) to.dev = false\n      }\n    }\n  }\n\n  isDev(): this is Node & { dev: true } {\n    return this.#dev\n  }\n\n  /**\n   * True if there's a manifest-confused package name.\n   */\n  confused = false\n\n  /**\n   * True if this node has been extracted to the file system.\n   */\n  extracted = false\n\n  /**\n   * List of edges coming into this node.\n   */\n  edgesIn = new Set<Edge>()\n\n  /**\n   * List of edges from this node into other nodes. This usually represents\n   * that the connected node is a direct dependency of this node.\n   */\n  edgesOut = new Map<string, Edge>()\n\n  /**\n   * A `mainImporter` node may have workspace connected to it,\n   * equivalent to its `edgesOut` linked deps.\n   */\n  workspaces: Map<string, Edge> | undefined\n\n  /**\n   * A reference to the {@link DepID} this node represents in the graph.\n   */\n  id: DepID\n\n  /**\n   * True if this node is an importer node.\n   */\n  importer = false\n\n  /**\n   * True if this node is the project root node.\n   */\n  mainImporter = false\n\n  /**\n   * A reference to the graph this node is a part of.\n   */\n  graph: Graph\n\n  /**\n   * The manifest integrity value.\n   */\n  integrity?: Integrity\n\n  /**\n   * The manifest this node represents in the graph.\n   */\n  manifest?: NormalizedManifest\n\n  /**\n   * Project where this node resides\n   */\n  projectRoot: string\n\n  /**\n   * For registry nodes, this is the registry we fetched them from.\n   * Needed because their un-prefixed dependencies need to come from\n   * the same registry, if it's not the default.\n   */\n  registry?: string\n\n  /**\n   * If this node has been modified as part of applying a {@link GraphModifier}\n   * then this field will contain the modifier query that was applied.\n   * Otherwise, it will be `undefined`.\n   */\n  modifier: string | undefined\n\n  /**\n   * The name of the package represented by this node, this is usually\n   * equivalent to `manifest.name` but in a few ways it may differ such as\n   * nodes loaded from a lockfile that lacks a loaded manifest.\n   * This field should be used to retrieve package names instead.\n   */\n  #name?: string\n  get name() {\n    if (this.#name) return this.#name\n    this.#name = this.id\n    return this.#name\n  }\n\n  /**\n   * The version of the package represented by this node, this is usually\n   * equivalent to `manifest.version` but in a few ways it may differ such as\n   * nodes loaded from a lockfile that lacks a loaded manifest.\n   * This field should be used to retrieve package versions instead.\n   */\n  version?: string\n\n  /**\n   * An address {@link PackageInfoClient} may use to extract this package.\n   */\n  resolved?: string\n\n  /**\n   * Platform requirements (engines, os, cpu) extracted from manifest.\n   * Stored separately for optional dependencies to enable platform checks\n   * when manifest is not loaded.\n   */\n  platform?: {\n    engines?: Record<string, string>\n    os?: string[] | string\n    cpu?: string[] | string\n  }\n\n  /**\n   * Record of binary names to their paths in the package, if any.\n   */\n  bins?: Record<string, string>\n\n  /**\n   * True if this node has been built as part of the reify step.\n   */\n  built = false\n\n  /**\n   * Build state of this node - tracks whether it needs building, has been built, or failed.\n   * - 'none': No build state (default)\n   * - 'needed': Node needs to be built\n   * - 'built': Node has been successfully built\n   * - 'failed': Node build has failed\n   */\n  buildState: 'none' | 'needed' | 'built' | 'failed' = 'none'\n\n  /**\n   * Deterministic unique string used to identify (and ultimately duplicate)\n   * nodes that are affected by a peer context set modified resolution.\n   * These are appended to the node {@link DepID} as the `extra` suffix.\n   */\n  peerSetHash?: string\n\n  /**\n   * True if this node is detached from the graph.\n   * This is used to indicate that the node is not part of the graph\n   * although the node is still available as part of the resolution process.\n   * Allows for skipping fetching manifests for detached nodes.\n   */\n  detached = false\n\n  /**\n   * The file system location for this node.\n   */\n  get location(): string {\n    if (this.#location) {\n      return this.#location\n    }\n    this.#location = `./node_modules/.vlt/${this.id}/node_modules/${this.name}`\n    // if using the default location, it is in the store\n    this.inVltStore = () => true\n    return this.#location\n  }\n\n  set location(location: string) {\n    this.#location = location\n    // reset memoization, since it might be elsewhere now\n    if (this.inVltStore !== Node.prototype.inVltStore) {\n      this.inVltStore = Node.prototype.inVltStore\n    }\n  }\n\n  /**\n   * The resolved location of the node in the file system.\n   */\n  resolvedLocation(scurry: PathScurry): string {\n    return scurry.cwd.resolve(this.location).fullpath()\n  }\n\n  /**\n   * The location of the node_modules folder where this node's edgesOut\n   * should be linked into. For nodes in the store, this is the parent\n   * directory, since they're extracted into a node_modules folder\n   * side by side with links to their deps. For nodes outside of the store\n   * (ie, importers and arbitrary link deps) this is the node_modules folder\n   * directly inside the node's directory.\n   */\n  nodeModules(scurry: PathScurry): string {\n    const loc = this.resolvedLocation(scurry)\n    return this.inVltStore() ?\n        loc.substring(0, loc.length - this.name.length - 1)\n      : scurry.resolve(loc, 'node_modules')\n  }\n\n  constructor(\n    options: NodeOptions,\n    id?: DepID,\n    manifest?: NormalizedManifest,\n    spec?: Spec,\n    name?: string,\n    version?: string,\n  ) {\n    this.#options = options\n    this.projectRoot = options.projectRoot\n    if (id) {\n      this.id = id\n    } else {\n      if (!manifest || !spec) {\n        throw typeError(\n          'A new Node needs either a manifest & spec or an id parameter',\n          {\n            manifest,\n          },\n        )\n      }\n      this.id = getId(spec, manifest)\n    }\n    this.graph = options.graph as Graph\n    this.manifest = manifest\n\n    this.#name = name || this.manifest?.name\n    this.version = version || this.manifest?.version\n  }\n\n  /**\n   * return true if this node is located in the vlt store\n   * memoized the first time it's called, since the store location\n   * doesn't change within the context of a single operation.\n   */\n  inVltStore(): boolean {\n    // technically this just means it's in *a* vlt store, but we can safely\n    // assume that a user won't construct a path like this by accident,\n    // and there's only ever one store in any given project.\n    const inStore = this.location.endsWith(\n      `.vlt/${this.id}/node_modules/${this.name}`,\n    )\n    this.inVltStore = () => inStore\n    return inStore\n  }\n\n  #registryNodeResolved(tuple: DepIDTuple) {\n    const spec = hydrateTuple(tuple, this.#name, this.#options)\n    this.resolved =\n      this.manifest?.dist?.tarball || spec.conventionalRegistryTarball\n    this.integrity ??= this.manifest?.dist?.integrity\n  }\n\n  get options() {\n    return this.#options\n  }\n\n  /* c8 ignore next */\n  set options(_opts: SpecOptions) {}\n\n  equals(other: Node) {\n    return this.id === other.id && this.location === other.location\n  }\n\n  /**\n   * Sets the node as an importer along with its location.\n   */\n  setImporterLocation(location: string) {\n    this.#location = location\n    this.importer = true\n  }\n\n  /**\n   * Sets the appropriate resolve / integrity value for this node.\n   * Note that other places might also set these values, like for\n   * example the lockfile that might have already have this info.\n   */\n  setResolved() {\n    // file | remote | workspace type of ids all points to a URI that\n    // can be used as the `resolved` value, so we split the dep id\n    // for these cases.\n    const tuple = splitDepID(this.id)\n    const [type, resolved] = tuple\n    switch (type) {\n      case 'remote': {\n        this.resolved = resolved\n        this.integrity ??= this.manifest?.dist?.integrity\n        break\n      }\n      case 'registry':\n        this.#registryNodeResolved(tuple)\n        break\n      default:\n        this.resolved = resolved\n        break\n    }\n  }\n\n  setDefaultLocation() {\n    const def = `./node_modules/.vlt/${this.id}/node_modules/${this.name}`\n\n    // only relocate if the location is in node_modules already\n    if (\n      !this.importer &&\n      (!this.#location ||\n        (this.#location !== def &&\n          /^(?:\\.\\/)?node_modules\\//.test(this.#location)))\n    ) {\n      this.#location = def\n    }\n  }\n\n  /**\n   * Add an edge from this node connecting it to a direct dependency.\n   */\n  addEdgesTo(type: DependencyTypeShort, spec: Spec, node?: Node) {\n    const edge = new Edge(type, spec, this, node)\n    node?.edgesIn.add(edge)\n    this.edgesOut.set(spec.name, edge)\n    return edge\n  }\n\n  /**\n   * The raw manifest before any modifications.\n   * If not set, falls back to the current manifest.\n   */\n  get rawManifest(): NormalizedManifest | undefined {\n    return this.#rawManifest ?? this.manifest\n  }\n\n  /**\n   * Sets this node as having a manifest-confused manifest.\n   */\n  setConfusedManifest(\n    fixed: NormalizedManifest,\n    confused?: NormalizedManifest,\n  ) {\n    this.manifest = fixed\n    this.#rawManifest = confused\n    this.confused = true\n    this.#name = this.manifest.name\n  }\n\n  /**\n   * Sets this node as having a manifest-confused manifest.\n   */\n  maybeSetConfusedManifest(\n    spec: Spec,\n    confused?: NormalizedManifest,\n  ) {\n    if (isPackageNameConfused(spec, this.manifest?.name)) {\n      this.setConfusedManifest(\n        {\n          ...this.manifest,\n          name: spec.name,\n        },\n        confused,\n      )\n    }\n  }\n\n  toJSON() {\n    return {\n      id: this.id,\n      name: this.name,\n      version: this.version,\n      location: this.location,\n      importer: this.importer,\n      manifest:\n        this.manifest &&\n        expandNormalizedManifestSymbols(this.manifest),\n      projectRoot: this.projectRoot,\n      integrity: this.integrity,\n      resolved: this.resolved,\n      dev: this.dev,\n      optional: this.optional,\n      confused: this.confused,\n      modifier: this.modifier,\n      platform: this.platform,\n      buildState: this.buildState,\n      ...(this.peerSetHash ?\n        { peerSetHash: this.peerSetHash }\n      : undefined),\n      ...(this.confused ?\n        { rawManifest: this.#rawManifest }\n      : undefined),\n    }\n  }\n\n  toString() {\n    return stringifyNode(this)\n  }\n}\n\nexport const isNode = (value: unknown): value is Node => {\n  return (\n    typeof value === 'object' &&\n    value != null &&\n    'id' in value &&\n    'manifest' in value &&\n    (value as Node)[Symbol.toStringTag] === '@vltpkg/graph.Node'\n  )\n}\n\nexport const asNode = (value: unknown): Node => {\n  if (!isNode(value)) {\n    throw typeError('Expected a node', { found: value })\n  }\n  return value\n}\n"]}
+{"version":3,"file":"node.js","sourceRoot":"","sources":["../src/node.ts"],"names":[],"mappings":"AACA,OAAO,EACL,qBAAqB,EACrB,KAAK,EACL,YAAY,EACZ,UAAU,GACX,MAAM,gBAAgB,CAAA;AAEvB,OAAO,EAAE,SAAS,EAAE,MAAM,qBAAqB,CAAA;AAE/C,OAAO,EAAE,+BAA+B,EAAE,MAAM,eAAe,CAAA;AAQ/D,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAEhC,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAA;AASnD,MAAM,OAAO,IAAI;IACf,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,oBAAoB,CAAA;IAC7B,CAAC;IAED,QAAQ,CAAa;IACrB,SAAS,CAAS;IAClB,YAAY,CAAqB;IAEjC,SAAS,GAAG,KAAK,CAAA;IACjB;;;;;;OAMG;IACH,IAAI,QAAQ;QACV,OAAO,IAAI,CAAC,SAAS,CAAA;IACvB,CAAC;IACD,IAAI,QAAQ,CAAC,QAAiB;QAC5B,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAA;QAC7B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QACzB,IAAI,MAAM,IAAI,CAAC,QAAQ,EAAE,CAAC;YACxB,8BAA8B;YAC9B,KAAK,MAAM,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBACtD,IAAI,CAAC,QAAQ,IAAI,EAAE,EAAE,QAAQ;oBAAE,EAAE,CAAC,QAAQ,GAAG,KAAK,CAAA;YACpD,CAAC;QACH,CAAC;IACH,CAAC;IAED,UAAU;QACR,OAAO,IAAI,CAAC,SAAS,CAAA;IACvB,CAAC;IAED,IAAI,GAAG,KAAK,CAAA;IACZ;;;;;OAKG;IACH,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,IAAI,CAAA;IAClB,CAAC;IACD,IAAI,GAAG,CAAC,GAAY;QAClB,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAA;QACxB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAA;QACf,IAAI,MAAM,IAAI,CAAC,GAAG,EAAE,CAAC;YACnB,8BAA8B;YAC9B,KAAK,MAAM,EAAE,EAAE,EAAE,GAAG,EAAE,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBACjD,IAAI,CAAC,GAAG,IAAI,EAAE,EAAE,GAAG;oBAAE,EAAE,CAAC,GAAG,GAAG,KAAK,CAAA;YACrC,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK;QACH,OAAO,IAAI,CAAC,IAAI,CAAA;IAClB,CAAC;IAED;;OAEG;IACH,QAAQ,GAAG,KAAK,CAAA;IAEhB;;OAEG;IACH,SAAS,GAAG,KAAK,CAAA;IAEjB;;OAEG;IACH,OAAO,GAAG,IAAI,GAAG,EAAQ,CAAA;IAEzB;;;OAGG;IACH,QAAQ,GAAG,IAAI,GAAG,EAAgB,CAAA;IAElC;;;OAGG;IACH,UAAU,CAA+B;IAEzC;;OAEG;IACH,EAAE,CAAO;IAET;;OAEG;IACH,QAAQ,GAAG,KAAK,CAAA;IAEhB;;OAEG;IACH,YAAY,GAAG,KAAK,CAAA;IAEpB;;OAEG;IACH,KAAK,CAAO;IAEZ;;OAEG;IACH,SAAS,CAAY;IAErB;;OAEG;IACH,QAAQ,CAAqB;IAE7B;;OAEG;IACH,WAAW,CAAQ;IAEnB;;;;OAIG;IACH,QAAQ,CAAS;IAEjB;;;;OAIG;IACH,QAAQ,CAAoB;IAE5B;;;;;OAKG;IACH,KAAK,CAAS;IACd,IAAI,IAAI;QACN,IAAI,IAAI,CAAC,KAAK;YAAE,OAAO,IAAI,CAAC,KAAK,CAAA;QACjC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,EAAE,CAAA;QACpB,OAAO,IAAI,CAAC,KAAK,CAAA;IACnB,CAAC;IAED;;;;;OAKG;IACH,OAAO,CAAS;IAEhB;;OAEG;IACH,QAAQ,CAAS;IAEjB;;;;OAIG;IACH,QAAQ,CAKP;IAED;;OAEG;IACH,IAAI,CAAyB;IAE7B;;OAEG;IACH,KAAK,GAAG,KAAK,CAAA;IAEb;;;;;;OAMG;IACH,UAAU,GAA2C,MAAM,CAAA;IAE3D;;;;OAIG;IACH,WAAW,CAAS;IAEpB;;;;;OAKG;IACH,QAAQ,GAAG,KAAK,CAAA;IAEhB;;OAEG;IACH,IAAI,QAAQ;QACV,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,OAAO,IAAI,CAAC,SAAS,CAAA;QACvB,CAAC;QACD,IAAI,CAAC,SAAS,GAAG,uBAAuB,IAAI,CAAC,EAAE,iBAAiB,IAAI,CAAC,IAAI,EAAE,CAAA;QAC3E,oDAAoD;QACpD,IAAI,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC,IAAI,CAAA;QAC5B,OAAO,IAAI,CAAC,SAAS,CAAA;IACvB,CAAC;IAED,IAAI,QAAQ,CAAC,QAAgB;QAC3B,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QACzB,qDAAqD;QACrD,IAAI,IAAI,CAAC,UAAU,KAAK,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,CAAC;YAClD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,SAAS,CAAC,UAAU,CAAA;QAC7C,CAAC;IACH,CAAC;IAED;;OAEG;IACH,gBAAgB,CAAC,MAAkB;QACjC,OAAO,MAAM,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,QAAQ,EAAE,CAAA;IACrD,CAAC;IAED;;;;;;;OAOG;IACH,WAAW,CAAC,MAAkB;QAC5B,MAAM,GAAG,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAA;QACzC,OAAO,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;YACtB,GAAG,CAAC,SAAS,CAAC,CAAC,EAAE,GAAG,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;YACrD,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,EAAE,cAAc,CAAC,CAAA;IACzC,CAAC;IAED,YACE,OAAoB,EACpB,EAAU,EACV,QAA6B,EAC7B,IAAW,EACX,IAAa,EACb,OAAgB;QAEhB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAA;QACvB,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAA;QACtC,IAAI,EAAE,EAAE,CAAC;YACP,IAAI,CAAC,EAAE,GAAG,EAAE,CAAA;QACd,CAAC;aAAM,CAAC;YACN,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,EAAE,CAAC;gBACvB,MAAM,SAAS,CACb,8DAA8D,EAC9D;oBACE,QAAQ;iBACT,CACF,CAAA;YACH,CAAC;YACD,IAAI,CAAC,EAAE,GAAG,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;QACjC,CAAC;QACD,IAAI,CAAC,KAAK,GAAG,OAAO,CAAC,KAAc,CAAA;QACnC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QAExB,IAAI,CAAC,KAAK,GAAG,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAA;QACxC,IAAI,CAAC,OAAO,GAAG,OAAO,IAAI,IAAI,CAAC,QAAQ,EAAE,OAAO,CAAA;IAClD,CAAC;IAED;;;;OAIG;IACH,UAAU;QACR,uEAAuE;QACvE,mEAAmE;QACnE,wDAAwD;QACxD,MAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,QAAQ,CACpC,QAAQ,IAAI,CAAC,EAAE,iBAAiB,IAAI,CAAC,IAAI,EAAE,CAC5C,CAAA;QACD,IAAI,CAAC,UAAU,GAAG,GAAG,EAAE,CAAC,OAAO,CAAA;QAC/B,OAAO,OAAO,CAAA;IAChB,CAAC;IAED,qBAAqB,CAAC,KAAiB;QACrC,MAAM,IAAI,GAAG,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAA;QAC3D,IAAI,CAAC,QAAQ;YACX,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,OAAO,IAAI,IAAI,CAAC,2BAA2B,CAAA;QAClE,IAAI,CAAC,SAAS,KAAK,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,SAAS,CAAA;IACnD,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,QAAQ,CAAA;IACtB,CAAC;IAED,oBAAoB;IACpB,IAAI,OAAO,CAAC,KAAkB,IAAG,CAAC;IAElC,MAAM,CAAC,KAAW;QAChB,OAAO,IAAI,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE,IAAI,IAAI,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ,CAAA;IACjE,CAAC;IAED;;OAEG;IACH,mBAAmB,CAAC,QAAgB;QAClC,IAAI,CAAC,SAAS,GAAG,QAAQ,CAAA;QACzB,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;IACtB,CAAC;IAED;;;;OAIG;IACH,WAAW;QACT,iEAAiE;QACjE,8DAA8D;QAC9D,mBAAmB;QACnB,MAAM,KAAK,GAAG,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QACjC,MAAM,CAAC,IAAI,EAAE,QAAQ,CAAC,GAAG,KAAK,CAAA;QAC9B,QAAQ,IAAI,EAAE,CAAC;YACb,KAAK,QAAQ,CAAC,CAAC,CAAC;gBACd,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;gBACxB,IAAI,CAAC,SAAS,KAAK,IAAI,CAAC,QAAQ,EAAE,IAAI,EAAE,SAAS,CAAA;gBACjD,MAAK;YACP,CAAC;YACD,KAAK,UAAU;gBACb,IAAI,CAAC,qBAAqB,CAAC,KAAK,CAAC,CAAA;gBACjC,MAAK;YACP;gBACE,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;gBACxB,MAAK;QACT,CAAC;IACH,CAAC;IAED,kBAAkB;QAChB,MAAM,GAAG,GAAG,uBAAuB,IAAI,CAAC,EAAE,iBAAiB,IAAI,CAAC,IAAI,EAAE,CAAA;QAEtE,2DAA2D;QAC3D,IACE,CAAC,IAAI,CAAC,QAAQ;YACd,CAAC,CAAC,IAAI,CAAC,SAAS;gBACd,CAAC,IAAI,CAAC,SAAS,KAAK,GAAG;oBACrB,0BAA0B,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,EACrD,CAAC;YACD,IAAI,CAAC,SAAS,GAAG,GAAG,CAAA;QACtB,CAAC;IACH,CAAC;IAED;;OAEG;IACH,UAAU,CAAC,IAAyB,EAAE,IAAU,EAAE,IAAW;QAC3D,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;QAC7C,IAAI,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACvB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;QAClC,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;;OAGG;IACH,IAAI,WAAW;QACb,OAAO,IAAI,CAAC,YAAY,IAAI,IAAI,CAAC,QAAQ,CAAA;IAC3C,CAAC;IAED;;OAEG;IACH,mBAAmB,CACjB,KAAyB,EACzB,QAA6B;QAE7B,IAAI,CAAC,QAAQ,GAAG,KAAK,CAAA;QACrB,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAA;QAC5B,IAAI,CAAC,QAAQ,GAAG,IAAI,CAAA;QACpB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAA;IACjC,CAAC;IAED;;OAEG;IACH,wBAAwB,CACtB,IAAU,EACV,QAA6B;QAE7B,IAAI,qBAAqB,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC;YACrD,IAAI,CAAC,mBAAmB,CACtB;gBACE,GAAG,IAAI,CAAC,QAAQ;gBAChB,IAAI,EAAE,IAAI,CAAC,IAAI;aAChB,EACD,QAAQ,CACT,CAAA;QACH,CAAC;IACH,CAAC;IAED,MAAM;QACJ,OAAO;YACL,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,OAAO,EAAE,IAAI,CAAC,OAAO;YACrB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EACN,IAAI,CAAC,QAAQ;gBACb,+BAA+B,CAAC,IAAI,CAAC,QAAQ,CAAC;YAChD,WAAW,EAAE,IAAI,CAAC,WAAW;YAC7B,SAAS,EAAE,IAAI,CAAC,SAAS;YACzB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,GAAG,EAAE,IAAI,CAAC,GAAG;YACb,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;YACvB,UAAU,EAAE,IAAI,CAAC,UAAU;YAC3B,GAAG,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;gBACpB,EAAE,WAAW,EAAE,IAAI,CAAC,WAAW,EAAE;gBACnC,CAAC,CAAC,SAAS,CAAC;YACZ,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACjB,EAAE,WAAW,EAAE,IAAI,CAAC,YAAY,EAAE;gBACpC,CAAC,CAAC,SAAS,CAAC;SACb,CAAA;IACH,CAAC;IAED,QAAQ;QACN,OAAO,aAAa,CAAC,IAAI,CAAC,CAAA;IAC5B,CAAC;CACF;AAED,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,KAAc,EAAiB,EAAE;IACtD,OAAO,CACL,OAAO,KAAK,KAAK,QAAQ;QACzB,KAAK,IAAI,IAAI;QACb,IAAI,IAAI,KAAK;QACb,UAAU,IAAI,KAAK;QAClB,KAAc,CAAC,MAAM,CAAC,WAAW,CAAC,KAAK,oBAAoB,CAC7D,CAAA;AACH,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,MAAM,GAAG,CAAC,KAAc,EAAQ,EAAE;IAC7C,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;QACnB,MAAM,SAAS,CAAC,iBAAiB,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAA;IACtD,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC,CAAA","sourcesContent":["import type { PathScurry } from 'path-scurry'\nimport {\n  isPackageNameConfused,\n  getId,\n  hydrateTuple,\n  splitDepID,\n} from '@vltpkg/dep-id'\nimport type { DepID, DepIDTuple } from '@vltpkg/dep-id'\nimport { typeError } from '@vltpkg/error-cause'\nimport type { Spec, SpecOptions } from '@vltpkg/spec'\nimport { expandNormalizedManifestSymbols } from '@vltpkg/types'\nimport type {\n  Integrity,\n  NormalizedManifest,\n  DependencyTypeShort,\n  GraphLike,\n  NodeLike,\n} from '@vltpkg/types'\nimport { Edge } from './edge.ts'\nimport type { Graph } from './graph.ts'\nimport { stringifyNode } from './stringify-node.ts'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport type { GraphModifier } from './modifiers.ts'\n\nexport type NodeOptions = SpecOptions & {\n  projectRoot: string\n  graph: GraphLike\n}\n\nexport class Node implements NodeLike {\n  get [Symbol.toStringTag]() {\n    return '@vltpkg/graph.Node'\n  }\n\n  #options: SpecOptions\n  #location?: string\n  #rawManifest?: NormalizedManifest\n\n  #optional = false\n  /**\n   * True if a node is only reachable via optional or peerOptional edges from\n   * any importer.\n   *\n   * Setting this to false, if previously set to true, will also unset\n   * the flag on any optional-flagged non-optional dependencies.\n   */\n  get optional() {\n    return this.#optional\n  }\n  set optional(optional: boolean) {\n    const before = this.#optional\n    this.#optional = optional\n    if (before && !optional) {\n      // unset for all deps, as well\n      for (const { to, optional } of this.edgesOut.values()) {\n        if (!optional && to?.optional) to.optional = false\n      }\n    }\n  }\n\n  isOptional(): this is Node & { optional: true } {\n    return this.#optional\n  }\n\n  #dev = false\n  /**\n   * True if a node is only reachable via dev edges from any importer.\n   *\n   * Setting this to false, if previously set to true, will also unset\n   * the flag on any dev-flagged non-dev dependencies.\n   */\n  get dev() {\n    return this.#dev\n  }\n  set dev(dev: boolean) {\n    const before = this.#dev\n    this.#dev = dev\n    if (before && !dev) {\n      // unset for all deps, as well\n      for (const { to, dev } of this.edgesOut.values()) {\n        if (!dev && to?.dev) to.dev = false\n      }\n    }\n  }\n\n  isDev(): this is Node & { dev: true } {\n    return this.#dev\n  }\n\n  /**\n   * True if there's a manifest-confused package name.\n   */\n  confused = false\n\n  /**\n   * True if this node has been extracted to the file system.\n   */\n  extracted = false\n\n  /**\n   * List of edges coming into this node.\n   */\n  edgesIn = new Set<Edge>()\n\n  /**\n   * List of edges from this node into other nodes. This usually represents\n   * that the connected node is a direct dependency of this node.\n   */\n  edgesOut = new Map<string, Edge>()\n\n  /**\n   * A `mainImporter` node may have workspace connected to it,\n   * equivalent to its `edgesOut` linked deps.\n   */\n  workspaces: Map<string, Edge> | undefined\n\n  /**\n   * A reference to the {@link DepID} this node represents in the graph.\n   */\n  id: DepID\n\n  /**\n   * True if this node is an importer node.\n   */\n  importer = false\n\n  /**\n   * True if this node is the project root node.\n   */\n  mainImporter = false\n\n  /**\n   * A reference to the graph this node is a part of.\n   */\n  graph: Graph\n\n  /**\n   * The manifest integrity value.\n   */\n  integrity?: Integrity\n\n  /**\n   * The manifest this node represents in the graph.\n   */\n  manifest?: NormalizedManifest\n\n  /**\n   * Project where this node resides\n   */\n  projectRoot: string\n\n  /**\n   * For registry nodes, this is the registry we fetched them from.\n   * Needed because their un-prefixed dependencies need to come from\n   * the same registry, if it's not the default.\n   */\n  registry?: string\n\n  /**\n   * If this node has been modified as part of applying a {@link GraphModifier}\n   * then this field will contain the modifier query that was applied.\n   * Otherwise, it will be `undefined`.\n   */\n  modifier: string | undefined\n\n  /**\n   * The name of the package represented by this node, this is usually\n   * equivalent to `manifest.name` but in a few ways it may differ such as\n   * nodes loaded from a lockfile that lacks a loaded manifest.\n   * This field should be used to retrieve package names instead.\n   */\n  #name?: string\n  get name() {\n    if (this.#name) return this.#name\n    this.#name = this.id\n    return this.#name\n  }\n\n  /**\n   * The version of the package represented by this node, this is usually\n   * equivalent to `manifest.version` but in a few ways it may differ such as\n   * nodes loaded from a lockfile that lacks a loaded manifest.\n   * This field should be used to retrieve package versions instead.\n   */\n  version?: string\n\n  /**\n   * An address {@link PackageInfoClient} may use to extract this package.\n   */\n  resolved?: string\n\n  /**\n   * Platform requirements (engines, os, cpu) extracted from manifest.\n   * Stored separately for optional dependencies to enable platform checks\n   * when manifest is not loaded.\n   */\n  platform?: {\n    engines?: Record<string, string>\n    os?: string[] | string\n    cpu?: string[] | string\n    libc?: string[] | string\n  }\n\n  /**\n   * Record of binary names to their paths in the package, if any.\n   */\n  bins?: Record<string, string>\n\n  /**\n   * True if this node has been built as part of the reify step.\n   */\n  built = false\n\n  /**\n   * Build state of this node - tracks whether it needs building, has been built, or failed.\n   * - 'none': No build state (default)\n   * - 'needed': Node needs to be built\n   * - 'built': Node has been successfully built\n   * - 'failed': Node build has failed\n   */\n  buildState: 'none' | 'needed' | 'built' | 'failed' = 'none'\n\n  /**\n   * Deterministic unique string used to identify (and ultimately duplicate)\n   * nodes that are affected by a peer context set modified resolution.\n   * These are appended to the node {@link DepID} as the `extra` suffix.\n   */\n  peerSetHash?: string\n\n  /**\n   * True if this node is detached from the graph.\n   * This is used to indicate that the node is not part of the graph\n   * although the node is still available as part of the resolution process.\n   * Allows for skipping fetching manifests for detached nodes.\n   */\n  detached = false\n\n  /**\n   * The file system location for this node.\n   */\n  get location(): string {\n    if (this.#location) {\n      return this.#location\n    }\n    this.#location = `./node_modules/.vlt/${this.id}/node_modules/${this.name}`\n    // if using the default location, it is in the store\n    this.inVltStore = () => true\n    return this.#location\n  }\n\n  set location(location: string) {\n    this.#location = location\n    // reset memoization, since it might be elsewhere now\n    if (this.inVltStore !== Node.prototype.inVltStore) {\n      this.inVltStore = Node.prototype.inVltStore\n    }\n  }\n\n  /**\n   * The resolved location of the node in the file system.\n   */\n  resolvedLocation(scurry: PathScurry): string {\n    return scurry.cwd.resolve(this.location).fullpath()\n  }\n\n  /**\n   * The location of the node_modules folder where this node's edgesOut\n   * should be linked into. For nodes in the store, this is the parent\n   * directory, since they're extracted into a node_modules folder\n   * side by side with links to their deps. For nodes outside of the store\n   * (ie, importers and arbitrary link deps) this is the node_modules folder\n   * directly inside the node's directory.\n   */\n  nodeModules(scurry: PathScurry): string {\n    const loc = this.resolvedLocation(scurry)\n    return this.inVltStore() ?\n        loc.substring(0, loc.length - this.name.length - 1)\n      : scurry.resolve(loc, 'node_modules')\n  }\n\n  constructor(\n    options: NodeOptions,\n    id?: DepID,\n    manifest?: NormalizedManifest,\n    spec?: Spec,\n    name?: string,\n    version?: string,\n  ) {\n    this.#options = options\n    this.projectRoot = options.projectRoot\n    if (id) {\n      this.id = id\n    } else {\n      if (!manifest || !spec) {\n        throw typeError(\n          'A new Node needs either a manifest & spec or an id parameter',\n          {\n            manifest,\n          },\n        )\n      }\n      this.id = getId(spec, manifest)\n    }\n    this.graph = options.graph as Graph\n    this.manifest = manifest\n\n    this.#name = name || this.manifest?.name\n    this.version = version || this.manifest?.version\n  }\n\n  /**\n   * return true if this node is located in the vlt store\n   * memoized the first time it's called, since the store location\n   * doesn't change within the context of a single operation.\n   */\n  inVltStore(): boolean {\n    // technically this just means it's in *a* vlt store, but we can safely\n    // assume that a user won't construct a path like this by accident,\n    // and there's only ever one store in any given project.\n    const inStore = this.location.endsWith(\n      `.vlt/${this.id}/node_modules/${this.name}`,\n    )\n    this.inVltStore = () => inStore\n    return inStore\n  }\n\n  #registryNodeResolved(tuple: DepIDTuple) {\n    const spec = hydrateTuple(tuple, this.#name, this.#options)\n    this.resolved =\n      this.manifest?.dist?.tarball || spec.conventionalRegistryTarball\n    this.integrity ??= this.manifest?.dist?.integrity\n  }\n\n  get options() {\n    return this.#options\n  }\n\n  /* c8 ignore next */\n  set options(_opts: SpecOptions) {}\n\n  equals(other: Node) {\n    return this.id === other.id && this.location === other.location\n  }\n\n  /**\n   * Sets the node as an importer along with its location.\n   */\n  setImporterLocation(location: string) {\n    this.#location = location\n    this.importer = true\n  }\n\n  /**\n   * Sets the appropriate resolve / integrity value for this node.\n   * Note that other places might also set these values, like for\n   * example the lockfile that might have already have this info.\n   */\n  setResolved() {\n    // file | remote | workspace type of ids all points to a URI that\n    // can be used as the `resolved` value, so we split the dep id\n    // for these cases.\n    const tuple = splitDepID(this.id)\n    const [type, resolved] = tuple\n    switch (type) {\n      case 'remote': {\n        this.resolved = resolved\n        this.integrity ??= this.manifest?.dist?.integrity\n        break\n      }\n      case 'registry':\n        this.#registryNodeResolved(tuple)\n        break\n      default:\n        this.resolved = resolved\n        break\n    }\n  }\n\n  setDefaultLocation() {\n    const def = `./node_modules/.vlt/${this.id}/node_modules/${this.name}`\n\n    // only relocate if the location is in node_modules already\n    if (\n      !this.importer &&\n      (!this.#location ||\n        (this.#location !== def &&\n          /^(?:\\.\\/)?node_modules\\//.test(this.#location)))\n    ) {\n      this.#location = def\n    }\n  }\n\n  /**\n   * Add an edge from this node connecting it to a direct dependency.\n   */\n  addEdgesTo(type: DependencyTypeShort, spec: Spec, node?: Node) {\n    const edge = new Edge(type, spec, this, node)\n    node?.edgesIn.add(edge)\n    this.edgesOut.set(spec.name, edge)\n    return edge\n  }\n\n  /**\n   * The raw manifest before any modifications.\n   * If not set, falls back to the current manifest.\n   */\n  get rawManifest(): NormalizedManifest | undefined {\n    return this.#rawManifest ?? this.manifest\n  }\n\n  /**\n   * Sets this node as having a manifest-confused manifest.\n   */\n  setConfusedManifest(\n    fixed: NormalizedManifest,\n    confused?: NormalizedManifest,\n  ) {\n    this.manifest = fixed\n    this.#rawManifest = confused\n    this.confused = true\n    this.#name = this.manifest.name\n  }\n\n  /**\n   * Sets this node as having a manifest-confused manifest.\n   */\n  maybeSetConfusedManifest(\n    spec: Spec,\n    confused?: NormalizedManifest,\n  ) {\n    if (isPackageNameConfused(spec, this.manifest?.name)) {\n      this.setConfusedManifest(\n        {\n          ...this.manifest,\n          name: spec.name,\n        },\n        confused,\n      )\n    }\n  }\n\n  toJSON() {\n    return {\n      id: this.id,\n      name: this.name,\n      version: this.version,\n      location: this.location,\n      importer: this.importer,\n      manifest:\n        this.manifest &&\n        expandNormalizedManifestSymbols(this.manifest),\n      projectRoot: this.projectRoot,\n      integrity: this.integrity,\n      resolved: this.resolved,\n      dev: this.dev,\n      optional: this.optional,\n      confused: this.confused,\n      modifier: this.modifier,\n      platform: this.platform,\n      buildState: this.buildState,\n      ...(this.peerSetHash ?\n        { peerSetHash: this.peerSetHash }\n      : undefined),\n      ...(this.confused ?\n        { rawManifest: this.#rawManifest }\n      : undefined),\n    }\n  }\n\n  toString() {\n    return stringifyNode(this)\n  }\n}\n\nexport const isNode = (value: unknown): value is Node => {\n  return (\n    typeof value === 'object' &&\n    value != null &&\n    'id' in value &&\n    'manifest' in value &&\n    (value as Node)[Symbol.toStringTag] === '@vltpkg/graph.Node'\n  )\n}\n\nexport const asNode = (value: unknown): Node => {\n  if (!isNode(value)) {\n    throw typeError('Expected a node', { found: value })\n  }\n  return value\n}\n"]}

package/dist/reify/check-needed-build.d.ts

@@ -1,4 +1,5 @@
 import type { PathScurry } from 'path-scurry';
+import type { PackageJson } from '@vltpkg/package-json';
 import type { Diff } from '../diff.ts';
 import type { Node } from '../node.ts';
 /**
@@ -19,6 +20,10 @@ export type CheckNeededBuildOptions = {
      * PathScurry instance for filesystem access
      */
     scurry: PathScurry;
+    /**
+     * PackageJson instance for reading manifests from disk
+     */
+    packageJson: PackageJson;
 };
 /**
  * Check which nodes need to be built and set buildState accordingly

package/dist/reify/check-needed-build.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"check-needed-build.d.ts","sourceRoot":"","sources":["../../src/reify/check-needed-build.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC7C,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AACtC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAGtC;;GAEG;AACH,MAAM,MAAM,SAAS,GAAG;IACtB,eAAe,EAAE,IAAI,EAAE,CAAA;CACxB,CAAA;AAED;;GAEG;AACH,MAAM,MAAM,uBAAuB,GAAG;IACpC;;OAEG;IACH,IAAI,EAAE,IAAI,CAAA;IACV;;OAEG;IACH,MAAM,EAAE,UAAU,CAAA;CACnB,CAAA;AAmDD;;;;;GAKG;AACH,eAAO,MAAM,gBAAgB,YAClB,uBAAuB,KAC/B,SAkBF,CAAA"}
+{"version":3,"file":"check-needed-build.d.ts","sourceRoot":"","sources":["../../src/reify/check-needed-build.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC7C,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAA;AACvD,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AACtC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAGtC;;GAEG;AACH,MAAM,MAAM,SAAS,GAAG;IACtB,eAAe,EAAE,IAAI,EAAE,CAAA;CACxB,CAAA;AAED;;GAEG;AACH,MAAM,MAAM,uBAAuB,GAAG;IACpC;;OAEG;IACH,IAAI,EAAE,IAAI,CAAA;IACV;;OAEG;IACH,MAAM,EAAE,UAAU,CAAA;IAClB;;OAEG;IACH,WAAW,EAAE,WAAW,CAAA;CACzB,CAAA;AAkED;;;;;GAKG;AACH,eAAO,MAAM,gBAAgB,YAClB,uBAAuB,KAC/B,SAkBF,CAAA"}

package/dist/reify/check-needed-build.js

@@ -6,14 +6,25 @@ import { join } from 'node:path';
  * 3. Is an importer or git dependency with prepare scripts (prepare, preprepare, postprepare)
  * 4. Has binary files that need to be linked
  */
-const nodeNeedsBuild = (node, scurry) => {
+const nodeNeedsBuild = (node, scurry, packageJson) => {
     // If the node has already been built during reify, no need to build again
     if (node.built)
         return false;
-    const { manifest } = node;
-    /* c8 ignore next */
-    if (!manifest)
-        return false;
+    // If the manifest is not available on the node, read it from disk.
+    // This can happen when the ideal graph is loaded from a lockfile
+    // and there's no actual graph available to hydrate the manifest data from.
+    let manifest = node.manifest;
+    if (!manifest) {
+        try {
+            manifest = packageJson.read(node.resolvedLocation(scurry));
+            node.manifest = manifest;
+        }
+        catch {
+            // If the manifest cannot be read (missing/corrupted), treat as
+            // "no build needed" to avoid failing the entire reification.
+            return false;
+        }
+    }
     const { scripts = {} } = manifest;
     // Check for install lifecycle scripts
     const runInstall = !!(scripts.install ||
@@ -46,9 +57,9 @@ const nodeNeedsBuild = (node, scurry) => {
  * @returns {BuildData} The BuildData object containing Node objects that need building
  */
 export const checkNeededBuild = (options) => {
-    const { diff, scurry } = options;
+    const { diff, scurry, packageJson } = options;
     // Filter nodes to only include those that actually need to be built
-    const nodesToBuild = [...diff.nodes.add].filter(node => nodeNeedsBuild(node, scurry));
+    const nodesToBuild = [...diff.nodes.add].filter(node => nodeNeedsBuild(node, scurry, packageJson));
     // Set buildState = 'needed' on all nodes that require building
     for (const node of nodesToBuild) {
         node.buildState = 'needed';

package/dist/reify/check-needed-build.js.map

@@ -1 +1 @@
-{"version":3,"file":"check-needed-build.js","sourceRoot":"","sources":["../../src/reify/check-needed-build.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAuBhC;;;;;;GAMG;AACH,MAAM,cAAc,GAAG,CAAC,IAAU,EAAE,MAAkB,EAAW,EAAE;IACjE,0EAA0E;IAC1E,IAAI,IAAI,CAAC,KAAK;QAAE,OAAO,KAAK,CAAA;IAE5B,MAAM,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAA;IACzB,oBAAoB;IACpB,IAAI,CAAC,QAAQ;QAAE,OAAO,KAAK,CAAA;IAE3B,MAAM,EAAE,OAAO,GAAG,EAAE,EAAE,GAAG,QAAQ,CAAA;IAEjC,sCAAsC;IACtC,MAAM,UAAU,GAAG,CAAC,CAAC,CACnB,OAAO,CAAC,OAAO;QACf,OAAO,CAAC,UAAU;QAClB,OAAO,CAAC,WAAW,CACpB,CAAA;IACD,IAAI,UAAU;QAAE,OAAO,IAAI,CAAA;IAE3B,gEAAgE;IAChE,sEAAsE;IACtE,2EAA2E;IAC3E,sEAAsE;IACtE,MAAM,aAAa,GACjB,MAAM;SACH,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE,aAAa,CAAC,CAAC;QAC9D,EAAE,MAAM,EAAE,IAAI,KAAK,CAAA;IACvB,IAAI,aAAa,IAAI,CAAC,OAAO,CAAC,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU;QAC1D,OAAO,IAAI,CAAA;IAEb,6DAA6D;IAC7D,MAAM,QAAQ,GACZ,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAA;IAClE,MAAM,UAAU,GACd,CAAC,CAAC,CACA,CAAC,OAAO,CAAC,OAAO,IAAI,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,WAAW,CAAC;IAC9D,sBAAsB;KACvB,IAAI,QAAQ,CAAA;IACf,IAAI,UAAU;QAAE,OAAO,IAAI,CAAA;IAE3B,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAC9B,OAAgC,EACrB,EAAE;IACb,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,GAAG,OAAO,CAAA;IAEhC,oEAAoE;IACpE,MAAM,YAAY,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CACrD,cAAc,CAAC,IAAI,EAAE,MAAM,CAAC,CAC7B,CAAA;IAED,+DAA+D;IAC/D,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAA;IAC5B,CAAC;IAED,MAAM,SAAS,GAAc;QAC3B,eAAe,EAAE,YAAY;KAC9B,CAAA;IAED,OAAO,SAAS,CAAA;AAClB,CAAC,CAAA","sourcesContent":["import type { PathScurry } from 'path-scurry'\nimport type { Diff } from '../diff.ts'\nimport type { Node } from '../node.ts'\nimport { join } from 'node:path'\n\n/**\n * Build data containing the queue of DepIDs that need building\n */\nexport type BuildData = {\n  needsBuildNodes: Node[]\n}\n\n/**\n * Options for checking needed build data\n */\nexport type CheckNeededBuildOptions = {\n  /**\n   * The diff object containing nodes to process\n   */\n  diff: Diff\n  /**\n   * PathScurry instance for filesystem access\n   */\n  scurry: PathScurry\n}\n\n/**\n * Checks if a node needs to be built based on the conditions from build.ts:\n * 1. Has install lifecycle scripts (install, preinstall, postinstall)\n * 2. Has binding.gyp file with no install/preinstall scripts (implicit install)\n * 3. Is an importer or git dependency with prepare scripts (prepare, preprepare, postprepare)\n * 4. Has binary files that need to be linked\n */\nconst nodeNeedsBuild = (node: Node, scurry: PathScurry): boolean => {\n  // If the node has already been built during reify, no need to build again\n  if (node.built) return false\n\n  const { manifest } = node\n  /* c8 ignore next */\n  if (!manifest) return false\n\n  const { scripts = {} } = manifest\n\n  // Check for install lifecycle scripts\n  const runInstall = !!(\n    scripts.install ||\n    scripts.preinstall ||\n    scripts.postinstall\n  )\n  if (runInstall) return true\n\n  // Check for binding.gyp file (npm's implicit install detection)\n  // \"If there is a binding.gyp file in the root of your package and you\n  // haven't defined your own install or preinstall scripts, npm will default\n  // the install command to compile using node-gyp via node-gyp rebuild\"\n  const hasBindingGyp =\n    scurry\n      .lstatSync(join(node.resolvedLocation(scurry), 'binding.gyp'))\n      ?.isFile() ?? false\n  if (hasBindingGyp && !scripts.install && !scripts.preinstall)\n    return true\n\n  // Check for prepare scripts on importers or git dependencies\n  const prepable =\n    node.id.startsWith('git') || node.importer || !node.inVltStore()\n  const runPrepare =\n    !!(\n      (scripts.prepare || scripts.preprepare || scripts.postprepare)\n      /* c8 ignore next 2 */\n    ) && prepable\n  if (runPrepare) return true\n\n  return false\n}\n\n/**\n * Check which nodes need to be built and set buildState accordingly\n * Marks nodes with buildState = 'needed' for those that require\n * install lifecycle scripts as part of `vlt build`\n * @returns {BuildData} The BuildData object containing Node objects that need building\n */\nexport const checkNeededBuild = (\n  options: CheckNeededBuildOptions,\n): BuildData => {\n  const { diff, scurry } = options\n\n  // Filter nodes to only include those that actually need to be built\n  const nodesToBuild = [...diff.nodes.add].filter(node =>\n    nodeNeedsBuild(node, scurry),\n  )\n\n  // Set buildState = 'needed' on all nodes that require building\n  for (const node of nodesToBuild) {\n    node.buildState = 'needed'\n  }\n\n  const buildData: BuildData = {\n    needsBuildNodes: nodesToBuild,\n  }\n\n  return buildData\n}\n"]}
+{"version":3,"file":"check-needed-build.js","sourceRoot":"","sources":["../../src/reify/check-needed-build.ts"],"names":[],"mappings":"AAIA,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AA2BhC;;;;;;GAMG;AACH,MAAM,cAAc,GAAG,CACrB,IAAU,EACV,MAAkB,EAClB,WAAwB,EACf,EAAE;IACX,0EAA0E;IAC1E,IAAI,IAAI,CAAC,KAAK;QAAE,OAAO,KAAK,CAAA;IAE5B,mEAAmE;IACnE,iEAAiE;IACjE,2EAA2E;IAC3E,IAAI,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;IAC5B,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,IAAI,CAAC;YACH,QAAQ,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC,CAAA;YAC1D,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QAC1B,CAAC;QAAC,MAAM,CAAC;YACP,+DAA+D;YAC/D,6DAA6D;YAC7D,OAAO,KAAK,CAAA;QACd,CAAC;IACH,CAAC;IAED,MAAM,EAAE,OAAO,GAAG,EAAE,EAAE,GAAG,QAAQ,CAAA;IAEjC,sCAAsC;IACtC,MAAM,UAAU,GAAG,CAAC,CAAC,CACnB,OAAO,CAAC,OAAO;QACf,OAAO,CAAC,UAAU;QAClB,OAAO,CAAC,WAAW,CACpB,CAAA;IACD,IAAI,UAAU;QAAE,OAAO,IAAI,CAAA;IAE3B,gEAAgE;IAChE,sEAAsE;IACtE,2EAA2E;IAC3E,sEAAsE;IACtE,MAAM,aAAa,GACjB,MAAM;SACH,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,EAAE,aAAa,CAAC,CAAC;QAC9D,EAAE,MAAM,EAAE,IAAI,KAAK,CAAA;IACvB,IAAI,aAAa,IAAI,CAAC,OAAO,CAAC,OAAO,IAAI,CAAC,OAAO,CAAC,UAAU;QAC1D,OAAO,IAAI,CAAA;IAEb,6DAA6D;IAC7D,MAAM,QAAQ,GACZ,IAAI,CAAC,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAA;IAClE,MAAM,UAAU,GACd,CAAC,CAAC,CACA,CAAC,OAAO,CAAC,OAAO,IAAI,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,WAAW,CAAC;IAC9D,sBAAsB;KACvB,IAAI,QAAQ,CAAA;IACf,IAAI,UAAU;QAAE,OAAO,IAAI,CAAA;IAE3B,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAC9B,OAAgC,EACrB,EAAE;IACb,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,WAAW,EAAE,GAAG,OAAO,CAAA;IAE7C,oEAAoE;IACpE,MAAM,YAAY,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CACrD,cAAc,CAAC,IAAI,EAAE,MAAM,EAAE,WAAW,CAAC,CAC1C,CAAA;IAED,+DAA+D;IAC/D,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,IAAI,CAAC,UAAU,GAAG,QAAQ,CAAA;IAC5B,CAAC;IAED,MAAM,SAAS,GAAc;QAC3B,eAAe,EAAE,YAAY;KAC9B,CAAA;IAED,OAAO,SAAS,CAAA;AAClB,CAAC,CAAA","sourcesContent":["import type { PathScurry } from 'path-scurry'\nimport type { PackageJson } from '@vltpkg/package-json'\nimport type { Diff } from '../diff.ts'\nimport type { Node } from '../node.ts'\nimport { join } from 'node:path'\n\n/**\n * Build data containing the queue of DepIDs that need building\n */\nexport type BuildData = {\n  needsBuildNodes: Node[]\n}\n\n/**\n * Options for checking needed build data\n */\nexport type CheckNeededBuildOptions = {\n  /**\n   * The diff object containing nodes to process\n   */\n  diff: Diff\n  /**\n   * PathScurry instance for filesystem access\n   */\n  scurry: PathScurry\n  /**\n   * PackageJson instance for reading manifests from disk\n   */\n  packageJson: PackageJson\n}\n\n/**\n * Checks if a node needs to be built based on the conditions from build.ts:\n * 1. Has install lifecycle scripts (install, preinstall, postinstall)\n * 2. Has binding.gyp file with no install/preinstall scripts (implicit install)\n * 3. Is an importer or git dependency with prepare scripts (prepare, preprepare, postprepare)\n * 4. Has binary files that need to be linked\n */\nconst nodeNeedsBuild = (\n  node: Node,\n  scurry: PathScurry,\n  packageJson: PackageJson,\n): boolean => {\n  // If the node has already been built during reify, no need to build again\n  if (node.built) return false\n\n  // If the manifest is not available on the node, read it from disk.\n  // This can happen when the ideal graph is loaded from a lockfile\n  // and there's no actual graph available to hydrate the manifest data from.\n  let manifest = node.manifest\n  if (!manifest) {\n    try {\n      manifest = packageJson.read(node.resolvedLocation(scurry))\n      node.manifest = manifest\n    } catch {\n      // If the manifest cannot be read (missing/corrupted), treat as\n      // \"no build needed\" to avoid failing the entire reification.\n      return false\n    }\n  }\n\n  const { scripts = {} } = manifest\n\n  // Check for install lifecycle scripts\n  const runInstall = !!(\n    scripts.install ||\n    scripts.preinstall ||\n    scripts.postinstall\n  )\n  if (runInstall) return true\n\n  // Check for binding.gyp file (npm's implicit install detection)\n  // \"If there is a binding.gyp file in the root of your package and you\n  // haven't defined your own install or preinstall scripts, npm will default\n  // the install command to compile using node-gyp via node-gyp rebuild\"\n  const hasBindingGyp =\n    scurry\n      .lstatSync(join(node.resolvedLocation(scurry), 'binding.gyp'))\n      ?.isFile() ?? false\n  if (hasBindingGyp && !scripts.install && !scripts.preinstall)\n    return true\n\n  // Check for prepare scripts on importers or git dependencies\n  const prepable =\n    node.id.startsWith('git') || node.importer || !node.inVltStore()\n  const runPrepare =\n    !!(\n      (scripts.prepare || scripts.preprepare || scripts.postprepare)\n      /* c8 ignore next 2 */\n    ) && prepable\n  if (runPrepare) return true\n\n  return false\n}\n\n/**\n * Check which nodes need to be built and set buildState accordingly\n * Marks nodes with buildState = 'needed' for those that require\n * install lifecycle scripts as part of `vlt build`\n * @returns {BuildData} The BuildData object containing Node objects that need building\n */\nexport const checkNeededBuild = (\n  options: CheckNeededBuildOptions,\n): BuildData => {\n  const { diff, scurry, packageJson } = options\n\n  // Filter nodes to only include those that actually need to be built\n  const nodesToBuild = [...diff.nodes.add].filter(node =>\n    nodeNeedsBuild(node, scurry, packageJson),\n  )\n\n  // Set buildState = 'needed' on all nodes that require building\n  for (const node of nodesToBuild) {\n    node.buildState = 'needed'\n  }\n\n  const buildData: BuildData = {\n    needsBuildNodes: nodesToBuild,\n  }\n\n  return buildData\n}\n"]}

package/dist/reify/extract-node.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"extract-node.d.ts","sourceRoot":"","sources":["../../src/reify/extract-node.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAE7D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAA;AAC7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAC/C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC7C,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AACtC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAItC;;;GAGG;AACH,MAAM,MAAM,aAAa,GACrB;IACE,OAAO,EAAE,IAAI,CAAA;IACb,IAAI,EAAE,IAAI,CAAA;CACX,GACD;IACE,OAAO,EAAE,KAAK,CAAA;IACd,IAAI,EAAE,IAAI,CAAA;IACV,KAAK,EAAE,OAAO,CAAA;CACf,CAAA;AAgBL;;;GAGG;AACH,eAAO,MAAM,WAAW,SAChB,IAAI,UACF,UAAU,WACT,cAAc,WACd,WAAW,eACP,iBAAiB,SACvB,IAAI,KACV,OAAO,CAAC,aAAa,CA0EvB,CAAA"}
+{"version":3,"file":"extract-node.d.ts","sourceRoot":"","sources":["../../src/reify/extract-node.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAE7D,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAA;AAC7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAC/C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAC7C,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AACtC,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAItC;;;GAGG;AACH,MAAM,MAAM,aAAa,GACrB;IACE,OAAO,EAAE,IAAI,CAAA;IACb,IAAI,EAAE,IAAI,CAAA;CACX,GACD;IACE,OAAO,EAAE,KAAK,CAAA;IACd,IAAI,EAAE,IAAI,CAAA;IACV,KAAK,EAAE,OAAO,CAAA;CACf,CAAA;AAgBL;;;GAGG;AACH,eAAO,MAAM,WAAW,SAChB,IAAI,UACF,UAAU,WACT,cAAc,WACd,WAAW,eACP,iBAAiB,SACvB,IAAI,KACV,OAAO,CAAC,aAAa,CA2EvB,CAAA"}

package/dist/reify/extract-node.js.map

@@ -1 +1 @@
-{"version":3,"file":"extract-node.js","sourceRoot":"","sources":["../../src/reify/extract-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAA;AAExC,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAA;AAMrD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAA;AACjD,OAAO,EAAE,sBAAsB,EAAE,MAAM,gCAAgC,CAAA;AAiBvE;;;;GAIG;AACH,MAAM,4BAA4B,GAAG,CAAC,IAAU,EAAE,IAAW,EAAE,EAAE;IAC/D,OAAO,CACL,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC;QAC/B,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;YACnB,GAAG,EAAE,CAAC,sBAAsB,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC;YAChD,CAAC,CAAC,SAAS,CACZ,CAAA;AACH,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,KAAK,EAC9B,IAAU,EACV,MAAkB,EAClB,OAAuB,EACvB,OAAoB,EACpB,WAA8B,EAC9B,IAAW,EACa,EAAE;IAC1B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAA;IACrB,MAAM,EAAE,QAAQ,GAAG,EAAE,EAAE,GAAG,IAAI,CAAA;IAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAA;IAC5C,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;IAC/B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;IACjD,MAAM,wBAAwB,GAAG,4BAA4B,CAC3D,IAAI,EACJ,IAAI,CACL,CAAA;IACD,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAA;IAEpC,4FAA4F;IAC5F,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAA;IAE9C,mFAAmF;IACnF,IACE,wBAAwB;QACxB,CAAC,QAAQ,CAAC,UAAU;YAClB,CAAC,aAAa,CACZ,YAAY,EACZ,OAAO,CAAC,OAAO,EACf,OAAO,CAAC,QAAQ,EAChB,OAAO,CAAC,IAAI,CACb,CAAC,EACJ,CAAC;QACD,wBAAwB,EAAE,CAAA;QAC1B,OAAO;YACL,OAAO,EAAE,KAAK;YACd,IAAI;YACJ,KAAK,EAAE,IAAI,KAAK,CAAC,6CAA6C,CAAC;SAChE,CAAA;IACH,CAAC;IAED,IAAI,CAAC;QACH,MAAM,OAAO,CAAC,EAAE,CAAC,MAAM,CAAC,CAAA;QAExB,IAAI,wBAAwB,EAAE,CAAC;YAC7B,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE;oBACrD,IAAI;oBACJ,SAAS;oBACT,QAAQ;iBACT,CAAC,CAAA;gBACF,+CAA+C;gBAC/C,IAAI,MAAM,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;oBACxC,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,CAAA;gBACnC,CAAC;gBACD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;YAChC,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,wBAAwB,EAAE,CAAA;gBAC1B,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;YACxC,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE;gBACrD,IAAI;gBACJ,SAAS;gBACT,QAAQ;aACT,CAAC,CAAA;YACF,+CAA+C;YAC/C,IAAI,MAAM,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;gBACxC,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,CAAA;YACnC,CAAC;YACD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;QAChC,CAAC;IACH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,qBAAqB;QACrB,IAAI,wBAAwB,EAAE,CAAC;YAC7B,wBAAwB,EAAE,CAAA;YAC1B,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;QACxC,CAAC;QACD,oBAAoB;QACpB,MAAM,KAAK,CAAA;IACb,CAAC;AACH,CAAC,CAAA","sourcesContent":["import { hydrate } from '@vltpkg/dep-id'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport { platformCheck } from '@vltpkg/pick-manifest'\nimport type { RollbackRemove } from '@vltpkg/rollback-remove'\nimport type { SpecOptions } from '@vltpkg/spec'\nimport type { PathScurry } from 'path-scurry'\nimport type { Diff } from '../diff.ts'\nimport type { Node } from '../node.ts'\nimport { optionalFail } from './optional-fail.ts'\nimport { removeOptionalSubgraph } from '../remove-optional-subgraph.ts'\n\n/**\n * Result of the extraction operation.\n * Either the extracted package data or an error if extraction failed.\n */\nexport type ExtractResult =\n  | {\n      success: true\n      node: Node\n    }\n  | {\n      success: false\n      node: Node\n      error: unknown\n    }\n\n/**\n * Returns a function that handles removing\n * a failed optional node from its graph.\n * Returns undefined for non-optional nodes when no diff is provided.\n */\nconst getOptionalFailedNodeRemover = (node: Node, diff?: Diff) => {\n  return (\n    diff ? optionalFail(diff, node)\n    : node.isOptional() ?\n      () => removeOptionalSubgraph(node.graph, node)\n    : undefined\n  )\n}\n\n/**\n * Extract a single node to the file system.\n * Returns a promise that resolves when the extraction is complete.\n */\nexport const extractNode = async (\n  node: Node,\n  scurry: PathScurry,\n  remover: RollbackRemove,\n  options: SpecOptions,\n  packageInfo: PackageInfoClient,\n  diff?: Diff,\n): Promise<ExtractResult> => {\n  node.extracted = true\n  const { manifest = {} } = node\n  const target = node.resolvedLocation(scurry)\n  const from = scurry.resolve('')\n  const spec = hydrate(node.id, node.name, options)\n  const removeOptionalFailedNode = getOptionalFailedNodeRemover(\n    node,\n    diff,\n  )\n  const { integrity, resolved } = node\n\n  // Use platform data from node if available (from lockfile), otherwise fall back to manifest\n  const platformData = node.platform ?? manifest\n\n  // Check if we should skip this node due to platform incompatibility or deprecation\n  if (\n    removeOptionalFailedNode &&\n    (manifest.deprecated ||\n      !platformCheck(\n        platformData,\n        process.version,\n        process.platform,\n        process.arch,\n      ))\n  ) {\n    removeOptionalFailedNode()\n    return {\n      success: false,\n      node,\n      error: new Error('Platform check failed or package deprecated'),\n    }\n  }\n\n  try {\n    await remover.rm(target)\n\n    if (removeOptionalFailedNode) {\n      try {\n        const result = await packageInfo.extract(spec, target, {\n          from,\n          integrity,\n          resolved,\n        })\n        // Store computed integrity for git/remote deps\n        if (result.integrity && !node.integrity) {\n          node.integrity = result.integrity\n        }\n        return { success: true, node }\n      } catch (error) {\n        removeOptionalFailedNode()\n        return { success: false, node, error }\n      }\n    } else {\n      const result = await packageInfo.extract(spec, target, {\n        from,\n        integrity,\n        resolved,\n      })\n      // Store computed integrity for git/remote deps\n      if (result.integrity && !node.integrity) {\n        node.integrity = result.integrity\n      }\n      return { success: true, node }\n    }\n  } catch (error) {\n    /* c8 ignore start */\n    if (removeOptionalFailedNode) {\n      removeOptionalFailedNode()\n      return { success: false, node, error }\n    }\n    /* c8 ignore stop */\n    throw error\n  }\n}\n"]}
+{"version":3,"file":"extract-node.js","sourceRoot":"","sources":["../../src/reify/extract-node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,gBAAgB,CAAA;AAExC,OAAO,EAAE,aAAa,EAAE,MAAM,uBAAuB,CAAA;AAMrD,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAA;AACjD,OAAO,EAAE,sBAAsB,EAAE,MAAM,gCAAgC,CAAA;AAiBvE;;;;GAIG;AACH,MAAM,4BAA4B,GAAG,CAAC,IAAU,EAAE,IAAW,EAAE,EAAE;IAC/D,OAAO,CACL,IAAI,CAAC,CAAC,CAAC,YAAY,CAAC,IAAI,EAAE,IAAI,CAAC;QAC/B,CAAC,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC;YACnB,GAAG,EAAE,CAAC,sBAAsB,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC;YAChD,CAAC,CAAC,SAAS,CACZ,CAAA;AACH,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,KAAK,EAC9B,IAAU,EACV,MAAkB,EAClB,OAAuB,EACvB,OAAoB,EACpB,WAA8B,EAC9B,IAAW,EACa,EAAE;IAC1B,IAAI,CAAC,SAAS,GAAG,IAAI,CAAA;IACrB,MAAM,EAAE,QAAQ,GAAG,EAAE,EAAE,GAAG,IAAI,CAAA;IAC9B,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAA;IAC5C,MAAM,IAAI,GAAG,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAA;IAC/B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;IACjD,MAAM,wBAAwB,GAAG,4BAA4B,CAC3D,IAAI,EACJ,IAAI,CACL,CAAA;IACD,MAAM,EAAE,SAAS,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAA;IAEpC,4FAA4F;IAC5F,MAAM,YAAY,GAAG,IAAI,CAAC,QAAQ,IAAI,QAAQ,CAAA;IAE9C,mFAAmF;IACnF,IACE,wBAAwB;QACxB,CAAC,QAAQ,CAAC,UAAU;YAClB,CAAC,aAAa,CACZ,YAAY,EACZ,OAAO,CAAC,OAAO,EACf,OAAO,CAAC,QAAQ,EAChB,OAAO,CAAC,IAAI,CAEb,CAAC,EACJ,CAAC;QACD,wBAAwB,EAAE,CAAA;QAC1B,OAAO;YACL,OAAO,EAAE,KAAK;YACd,IAAI;YACJ,KAAK,EAAE,IAAI,KAAK,CAAC,6CAA6C,CAAC;SAChE,CAAA;IACH,CAAC;IAED,IAAI,CAAC;QACH,MAAM,OAAO,CAAC,EAAE,CAAC,MAAM,CAAC,CAAA;QAExB,IAAI,wBAAwB,EAAE,CAAC;YAC7B,IAAI,CAAC;gBACH,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE;oBACrD,IAAI;oBACJ,SAAS;oBACT,QAAQ;iBACT,CAAC,CAAA;gBACF,+CAA+C;gBAC/C,IAAI,MAAM,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;oBACxC,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,CAAA;gBACnC,CAAC;gBACD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;YAChC,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,wBAAwB,EAAE,CAAA;gBAC1B,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;YACxC,CAAC;QACH,CAAC;aAAM,CAAC;YACN,MAAM,MAAM,GAAG,MAAM,WAAW,CAAC,OAAO,CAAC,IAAI,EAAE,MAAM,EAAE;gBACrD,IAAI;gBACJ,SAAS;gBACT,QAAQ;aACT,CAAC,CAAA;YACF,+CAA+C;YAC/C,IAAI,MAAM,CAAC,SAAS,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE,CAAC;gBACxC,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,SAAS,CAAA;YACnC,CAAC;YACD,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,CAAA;QAChC,CAAC;IACH,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,qBAAqB;QACrB,IAAI,wBAAwB,EAAE,CAAC;YAC7B,wBAAwB,EAAE,CAAA;YAC1B,OAAO,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,CAAA;QACxC,CAAC;QACD,oBAAoB;QACpB,MAAM,KAAK,CAAA;IACb,CAAC;AACH,CAAC,CAAA","sourcesContent":["import { hydrate } from '@vltpkg/dep-id'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport { platformCheck } from '@vltpkg/pick-manifest'\nimport type { RollbackRemove } from '@vltpkg/rollback-remove'\nimport type { SpecOptions } from '@vltpkg/spec'\nimport type { PathScurry } from 'path-scurry'\nimport type { Diff } from '../diff.ts'\nimport type { Node } from '../node.ts'\nimport { optionalFail } from './optional-fail.ts'\nimport { removeOptionalSubgraph } from '../remove-optional-subgraph.ts'\n\n/**\n * Result of the extraction operation.\n * Either the extracted package data or an error if extraction failed.\n */\nexport type ExtractResult =\n  | {\n      success: true\n      node: Node\n    }\n  | {\n      success: false\n      node: Node\n      error: unknown\n    }\n\n/**\n * Returns a function that handles removing\n * a failed optional node from its graph.\n * Returns undefined for non-optional nodes when no diff is provided.\n */\nconst getOptionalFailedNodeRemover = (node: Node, diff?: Diff) => {\n  return (\n    diff ? optionalFail(diff, node)\n    : node.isOptional() ?\n      () => removeOptionalSubgraph(node.graph, node)\n    : undefined\n  )\n}\n\n/**\n * Extract a single node to the file system.\n * Returns a promise that resolves when the extraction is complete.\n */\nexport const extractNode = async (\n  node: Node,\n  scurry: PathScurry,\n  remover: RollbackRemove,\n  options: SpecOptions,\n  packageInfo: PackageInfoClient,\n  diff?: Diff,\n): Promise<ExtractResult> => {\n  node.extracted = true\n  const { manifest = {} } = node\n  const target = node.resolvedLocation(scurry)\n  const from = scurry.resolve('')\n  const spec = hydrate(node.id, node.name, options)\n  const removeOptionalFailedNode = getOptionalFailedNodeRemover(\n    node,\n    diff,\n  )\n  const { integrity, resolved } = node\n\n  // Use platform data from node if available (from lockfile), otherwise fall back to manifest\n  const platformData = node.platform ?? manifest\n\n  // Check if we should skip this node due to platform incompatibility or deprecation\n  if (\n    removeOptionalFailedNode &&\n    (manifest.deprecated ||\n      !platformCheck(\n        platformData,\n        process.version,\n        process.platform,\n        process.arch,\n        // libc is auto-detected by platformCheck when not provided\n      ))\n  ) {\n    removeOptionalFailedNode()\n    return {\n      success: false,\n      node,\n      error: new Error('Platform check failed or package deprecated'),\n    }\n  }\n\n  try {\n    await remover.rm(target)\n\n    if (removeOptionalFailedNode) {\n      try {\n        const result = await packageInfo.extract(spec, target, {\n          from,\n          integrity,\n          resolved,\n        })\n        // Store computed integrity for git/remote deps\n        if (result.integrity && !node.integrity) {\n          node.integrity = result.integrity\n        }\n        return { success: true, node }\n      } catch (error) {\n        removeOptionalFailedNode()\n        return { success: false, node, error }\n      }\n    } else {\n      const result = await packageInfo.extract(spec, target, {\n        from,\n        integrity,\n        resolved,\n      })\n      // Store computed integrity for git/remote deps\n      if (result.integrity && !node.integrity) {\n        node.integrity = result.integrity\n      }\n      return { success: true, node }\n    }\n  } catch (error) {\n    /* c8 ignore start */\n    if (removeOptionalFailedNode) {\n      removeOptionalFailedNode()\n      return { success: false, node, error }\n    }\n    /* c8 ignore stop */\n    throw error\n  }\n}\n"]}

package/dist/reify/index.js

@@ -119,7 +119,7 @@ const reify_ = async (options, diff, remover) => {
     await internalHoist(diff.to, options, remover);
     // looks up all nodes setting buildState = 'needed'
     // on nodes that require building
-    checkNeededBuild({ diff, scurry });
+    checkNeededBuild({ diff, scurry, packageJson });
     // Filter nodes allowed to run scripts if allowScripts query is provided
     const allowScriptsNodes = await filterNodesByQuery(diff.to, allowScripts);
     // ensure that all added bins are chmod +x

package/dist/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;AAG1C,OAAO,EAAE,oBAAoB,EAAE,MAAM,SAAS,CAAA;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAA;AAG9C,OAAO,EAAE,IAAI,IAAI,UAAU,EAAE,MAAM,mBAAmB,CAAA;AAKtD,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAGjC,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,gBAAgB,EAAE,MAAM,yBAAyB,CAAA;AAC1D,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;AACtC,OAAO,EAAE,KAAK,EAAE,MAAM,eAAe,CAAA;AACrC,OAAO,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAA;AAE1D,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAA;AAE5C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,oBAAoB,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAA;AAEzD;;GAEG;AACH,MAAM,kBAAkB,GAAG,KAAK,EAC9B,KAAY,EACZ,iBAA0B,EACL,EAAE;IACvB,gCAAgC;IAChC,IACE,iBAAiB,KAAK,SAAS,CAAC,oBAAoB;QACpD,CAAC,iBAAiB,EAClB,CAAC;QACD,OAAO,IAAI,GAAG,EAAE,CAAA;IAClB,CAAC;IACD,iCAAiC;IACjC,IAAI,iBAAiB,KAAK,GAAG,EAAE,CAAC;QAC9B,OAAO,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAA;IACpC,CAAC;IACD,qBAAqB;IACrB,MAAM,eAAe,GACnB,KAAK,CAAC,oBAAoB,CAAC,iBAAiB,CAAC,CAAC,CAAC;QAC7C,MAAM,eAAe,CAAC,KAAK,CAAC;YAC1B,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;SACjC,CAAC;QACJ,CAAC,CAAC,SAAS,CAAA;IACb,oBAAoB;IAEpB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAA;IACzB,MAAM,KAAK,GAAG,IAAI,GAAG,CAAW,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAA;IACrD,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAA;IAEjC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC;QACtB,KAAK;QACL,KAAK;QACL,SAAS;QACT,eAAe;KAChB,CAAC,CAAA;IAEF,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,GAAG,MAAM,KAAK,CAAC,MAAM,CAC/C,iBAAiB,EACjB;QACE,MAAM,EAAE,IAAI,eAAe,EAAE,CAAC,MAAM;KACrC,CACF,CAAA;IAED,OAAO,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;AAClD,CAAC,CAAA;AA4BD;;GAEG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,KAAK,EACxB,OAAqB,EACC,EAAE;IACxB,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,CAAA;IAE/B,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAA;IAE1C,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,sBAAsB,GAC1B,CAAC,OAAO,CAAC,GAAG,EAAE,oBAAoB;QAClC,CAAC,OAAO,CAAC,MAAM,EAAE,oBAAoB,CAAA;IACvC,MAAM,gBAAgB,GAAG,sBAAsB,IAAI,IAAI,CAAC,YAAY,CAAA;IACpE,MAAM,GAAG,GAAgB,EAAE,IAAI,EAAE,CAAA;IACjC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,gBAAgB,EAAE,CAAC;QAC3C,yCAAyC;QACzC,IAAI,EAAE,CAAA;QACN,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,IAAI,OAAO,GAAG,KAAK,CAAA;IACnB,IAAI,CAAC;QACH,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,MAAM,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;QAC3D,OAAO,CAAC,OAAO,EAAE,CAAA;QACjB,OAAO,GAAG,IAAI,CAAA;QACd,GAAG,CAAC,UAAU,GAAG,UAAU,CAAA;IAC7B,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,GAAG,CAAA;AACZ,CAAC,CAAA;AAED,MAAM,MAAM,GAAG,KAAK,EAClB,OAAqB,EACrB,IAAU,EACV,OAAuB,EACa,EAAE;IACtC,MAAM,GAAG,GAA8B,EAAE,CAAA;IACzC,MAAM,EACJ,GAAG,EACH,MAAM,EACN,WAAW,EACX,WAAW,EACX,MAAM,EACN,YAAY,GACb,GAAG,OAAO,CAAA;IACX,MAAM,wBAAwB;IAC5B,oBAAoB;IACpB,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,GAAG,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAA;IACnD,IAAI,WAAW,CAAC,MAAM;QAAE,MAAM,SAAS,CAAC,WAAW,EAAE,EAAE,KAAK,EAAE,CAAC,CAAA;IAE/D,MAAM,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;IAE9C,mDAAmD;IACnD,iCAAiC;IACjC,gBAAgB,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAA;IAElC,wEAAwE;IACxE,MAAM,iBAAiB,GAAG,MAAM,kBAAkB,CAChD,IAAI,CAAC,EAAE,EACP,YAAY,CACb,CAAA;IAED,0CAA0C;IAC1C,MAAM,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;IAEzC,0DAA0D;IAC1D,MAAM,KAAK,CAAC,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,iBAAiB,CAAC,CAAA;IAEzD,qDAAqD;IACrD,wDAAwD;IACxD,GAAG,CAAC,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;SACjC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,KAAK,QAAQ,CAAC;SAC5C,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAEvB,sDAAsD;IACtD,yDAAyD;IACzD,gCAAgC;IAChC,qBAAqB;IACrB,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,oBAAoB;IACpB,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;IAED,4BAA4B;IAC5B,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA","sourcesContent":["import { graphStep } from '@vltpkg/output'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport type { RollbackRemove } from '@vltpkg/rollback-remove'\nimport { availableParallelism } from 'node:os'\nimport { callLimit } from 'promise-call-limit'\nimport type { DepID } from '@vltpkg/dep-id'\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 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 { checkNeededBuild } from './check-needed-build.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'\nimport { Query } from '@vltpkg/query'\nimport { SecurityArchive } from '@vltpkg/security-archive'\nimport type { NodeLike } from '@vltpkg/types'\nimport { binChmodAll } from './bin-chmod.ts'\n\nconst limit = Math.max(availableParallelism() - 1, 1) * 8\n\n/**\n * Filter nodes using a DSS query string\n */\nconst filterNodesByQuery = async (\n  graph: Graph,\n  allowScriptsQuery?: string,\n): Promise<Set<DepID>> => {\n  // shortcut no packages included\n  if (\n    allowScriptsQuery === ':not(*)' /* c8 ignore next */ ||\n    !allowScriptsQuery\n  ) {\n    return new Set()\n  }\n  // shortcut all packages included\n  if (allowScriptsQuery === '*') {\n    return new Set(graph.nodes.keys())\n  }\n  /* c8 ignore start */\n  const securityArchive =\n    Query.hasSecuritySelectors(allowScriptsQuery) ?\n      await SecurityArchive.start({\n        nodes: [...graph.nodes.values()],\n      })\n    : undefined\n  /* c8 ignore stop */\n\n  const edges = graph.edges\n  const nodes = new Set<NodeLike>(graph.nodes.values())\n  const importers = graph.importers\n\n  const query = new Query({\n    edges,\n    nodes,\n    importers,\n    securityArchive,\n  })\n\n  const { nodes: resultNodes } = await query.search(\n    allowScriptsQuery,\n    {\n      signal: new AbortController().signal,\n    },\n  )\n\n  return new Set(resultNodes.map(node => node.id))\n}\n\n// - [ ] depid's with peer resolutions\n// - [ ] depid shortening\n\nexport type ReifyOptions = LoadOptions & {\n  add?: AddImportersDependenciesMap\n  allowScripts: string\n  remove?: RemoveImportersDependenciesMap\n  graph: Graph\n  actual?: Graph\n  packageInfo: PackageInfoClient\n  modifiers?: GraphModifier\n  remover: RollbackRemove\n}\n\nexport type ReifyResult = {\n  /**\n   * The diff object that was used to reify the project.\n   */\n  diff: Diff\n  /**\n   * Optional queue of DepIDs that requires building (running lifecycle scripts\n   * and binary linking) after the reification is complete.\n   */\n  buildQueue?: DepID[]\n}\n\n/**\n * Make the current project match the supplied graph.\n */\nexport const reify = async (\n  options: ReifyOptions,\n): Promise<ReifyResult> => {\n  const done = graphStep('reify')\n\n  const { graph, scurry, remover } = 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 noModifiedDependencies =\n    !options.add?.modifiedDependencies &&\n    !options.remove?.modifiedDependencies\n  const skipOptionalOnly = noModifiedDependencies && diff.optionalOnly\n  const res: ReifyResult = { diff }\n  if (!diff.hasChanges() || skipOptionalOnly) {\n    // nothing to do, so just return the diff\n    done()\n    return res\n  }\n\n  let success = false\n  try {\n    const { buildQueue } = await reify_(options, diff, remover)\n    remover.confirm()\n    success = true\n    res.buildQueue = buildQueue\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 res\n}\n\nconst reify_ = async (\n  options: ReifyOptions,\n  diff: Diff,\n  remover: RollbackRemove,\n): Promise<Omit<ReifyResult, 'diff'>> => {\n  const res: Omit<ReifyResult, 'diff'> = {}\n  const {\n    add,\n    remove,\n    packageInfo,\n    packageJson,\n    scurry,\n    allowScripts,\n  } = options\n  const saveImportersPackageJson =\n    /* c8 ignore next */\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 = addEdges(diff, scurry, remover)\n  if (edgeActions.length) await callLimit(edgeActions, { limit })\n\n  await internalHoist(diff.to, options, remover)\n\n  // looks up all nodes setting buildState = 'needed'\n  // on nodes that require building\n  checkNeededBuild({ diff, scurry })\n\n  // Filter nodes allowed to run scripts if allowScripts query is provided\n  const allowScriptsNodes = await filterNodesByQuery(\n    diff.to,\n    allowScripts,\n  )\n\n  // ensure that all added bins are chmod +x\n  await binChmodAll(diff.nodes.add, scurry)\n\n  // run install lifecycle scripts and link any binary files\n  await build(diff, packageJson, scurry, allowScriptsNodes)\n\n  // set the buildQueue on the result object containing\n  // an array with all the ids of nodes that need building\n  res.buildQueue = [...diff.nodes.add]\n    .filter(node => node.buildState === 'needed')\n    .map(node => node.id)\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  // TODO: add tests to cover this\n  /* c8 ignore start */\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  /* c8 ignore stop */\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  // returns the result object\n  return res\n}\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/reify/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAG1C,OAAO,EAAE,oBAAoB,EAAE,MAAM,SAAS,CAAA;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAA;AAG9C,OAAO,EAAE,IAAI,IAAI,UAAU,EAAE,MAAM,mBAAmB,CAAA;AAKtD,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAGjC,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,gBAAgB,EAAE,MAAM,yBAAyB,CAAA;AAC1D,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;AACtC,OAAO,EAAE,KAAK,EAAE,MAAM,eAAe,CAAA;AACrC,OAAO,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAA;AAE1D,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAA;AAE5C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,oBAAoB,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAA;AAEzD;;GAEG;AACH,MAAM,kBAAkB,GAAG,KAAK,EAC9B,KAAY,EACZ,iBAA0B,EACL,EAAE;IACvB,gCAAgC;IAChC,IACE,iBAAiB,KAAK,SAAS,CAAC,oBAAoB;QACpD,CAAC,iBAAiB,EAClB,CAAC;QACD,OAAO,IAAI,GAAG,EAAE,CAAA;IAClB,CAAC;IACD,iCAAiC;IACjC,IAAI,iBAAiB,KAAK,GAAG,EAAE,CAAC;QAC9B,OAAO,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAA;IACpC,CAAC;IACD,qBAAqB;IACrB,MAAM,eAAe,GACnB,KAAK,CAAC,oBAAoB,CAAC,iBAAiB,CAAC,CAAC,CAAC;QAC7C,MAAM,eAAe,CAAC,KAAK,CAAC;YAC1B,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;SACjC,CAAC;QACJ,CAAC,CAAC,SAAS,CAAA;IACb,oBAAoB;IAEpB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAA;IACzB,MAAM,KAAK,GAAG,IAAI,GAAG,CAAW,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAA;IACrD,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAA;IAEjC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC;QACtB,KAAK;QACL,KAAK;QACL,SAAS;QACT,eAAe;KAChB,CAAC,CAAA;IAEF,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,GAAG,MAAM,KAAK,CAAC,MAAM,CAC/C,iBAAiB,EACjB;QACE,MAAM,EAAE,IAAI,eAAe,EAAE,CAAC,MAAM;KACrC,CACF,CAAA;IAED,OAAO,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;AAClD,CAAC,CAAA;AA4BD;;GAEG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,KAAK,EACxB,OAAqB,EACC,EAAE;IACxB,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,CAAA;IAE/B,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAA;IAE1C,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,sBAAsB,GAC1B,CAAC,OAAO,CAAC,GAAG,EAAE,oBAAoB;QAClC,CAAC,OAAO,CAAC,MAAM,EAAE,oBAAoB,CAAA;IACvC,MAAM,gBAAgB,GAAG,sBAAsB,IAAI,IAAI,CAAC,YAAY,CAAA;IACpE,MAAM,GAAG,GAAgB,EAAE,IAAI,EAAE,CAAA;IACjC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,gBAAgB,EAAE,CAAC;QAC3C,yCAAyC;QACzC,IAAI,EAAE,CAAA;QACN,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,IAAI,OAAO,GAAG,KAAK,CAAA;IACnB,IAAI,CAAC;QACH,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,MAAM,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;QAC3D,OAAO,CAAC,OAAO,EAAE,CAAA;QACjB,OAAO,GAAG,IAAI,CAAA;QACd,GAAG,CAAC,UAAU,GAAG,UAAU,CAAA;IAC7B,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,GAAG,CAAA;AACZ,CAAC,CAAA;AAED,MAAM,MAAM,GAAG,KAAK,EAClB,OAAqB,EACrB,IAAU,EACV,OAAuB,EACa,EAAE;IACtC,MAAM,GAAG,GAA8B,EAAE,CAAA;IACzC,MAAM,EACJ,GAAG,EACH,MAAM,EACN,WAAW,EACX,WAAW,EACX,MAAM,EACN,YAAY,GACb,GAAG,OAAO,CAAA;IACX,MAAM,wBAAwB;IAC5B,oBAAoB;IACpB,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,GAAG,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAA;IACnD,IAAI,WAAW,CAAC,MAAM;QAAE,MAAM,SAAS,CAAC,WAAW,EAAE,EAAE,KAAK,EAAE,CAAC,CAAA;IAE/D,MAAM,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;IAE9C,mDAAmD;IACnD,iCAAiC;IACjC,gBAAgB,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAA;IAE/C,wEAAwE;IACxE,MAAM,iBAAiB,GAAG,MAAM,kBAAkB,CAChD,IAAI,CAAC,EAAE,EACP,YAAY,CACb,CAAA;IAED,0CAA0C;IAC1C,MAAM,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;IAEzC,0DAA0D;IAC1D,MAAM,KAAK,CAAC,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,iBAAiB,CAAC,CAAA;IAEzD,qDAAqD;IACrD,wDAAwD;IACxD,GAAG,CAAC,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;SACjC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,KAAK,QAAQ,CAAC;SAC5C,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAEvB,sDAAsD;IACtD,yDAAyD;IACzD,gCAAgC;IAChC,qBAAqB;IACrB,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,oBAAoB;IACpB,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;IAED,4BAA4B;IAC5B,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA","sourcesContent":["import { graphStep } from '@vltpkg/output'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport type { RollbackRemove } from '@vltpkg/rollback-remove'\nimport { availableParallelism } from 'node:os'\nimport { callLimit } from 'promise-call-limit'\nimport type { DepID } from '@vltpkg/dep-id'\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 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 { checkNeededBuild } from './check-needed-build.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'\nimport { Query } from '@vltpkg/query'\nimport { SecurityArchive } from '@vltpkg/security-archive'\nimport type { NodeLike } from '@vltpkg/types'\nimport { binChmodAll } from './bin-chmod.ts'\n\nconst limit = Math.max(availableParallelism() - 1, 1) * 8\n\n/**\n * Filter nodes using a DSS query string\n */\nconst filterNodesByQuery = async (\n  graph: Graph,\n  allowScriptsQuery?: string,\n): Promise<Set<DepID>> => {\n  // shortcut no packages included\n  if (\n    allowScriptsQuery === ':not(*)' /* c8 ignore next */ ||\n    !allowScriptsQuery\n  ) {\n    return new Set()\n  }\n  // shortcut all packages included\n  if (allowScriptsQuery === '*') {\n    return new Set(graph.nodes.keys())\n  }\n  /* c8 ignore start */\n  const securityArchive =\n    Query.hasSecuritySelectors(allowScriptsQuery) ?\n      await SecurityArchive.start({\n        nodes: [...graph.nodes.values()],\n      })\n    : undefined\n  /* c8 ignore stop */\n\n  const edges = graph.edges\n  const nodes = new Set<NodeLike>(graph.nodes.values())\n  const importers = graph.importers\n\n  const query = new Query({\n    edges,\n    nodes,\n    importers,\n    securityArchive,\n  })\n\n  const { nodes: resultNodes } = await query.search(\n    allowScriptsQuery,\n    {\n      signal: new AbortController().signal,\n    },\n  )\n\n  return new Set(resultNodes.map(node => node.id))\n}\n\n// - [ ] depid's with peer resolutions\n// - [ ] depid shortening\n\nexport type ReifyOptions = LoadOptions & {\n  add?: AddImportersDependenciesMap\n  allowScripts: string\n  remove?: RemoveImportersDependenciesMap\n  graph: Graph\n  actual?: Graph\n  packageInfo: PackageInfoClient\n  modifiers?: GraphModifier\n  remover: RollbackRemove\n}\n\nexport type ReifyResult = {\n  /**\n   * The diff object that was used to reify the project.\n   */\n  diff: Diff\n  /**\n   * Optional queue of DepIDs that requires building (running lifecycle scripts\n   * and binary linking) after the reification is complete.\n   */\n  buildQueue?: DepID[]\n}\n\n/**\n * Make the current project match the supplied graph.\n */\nexport const reify = async (\n  options: ReifyOptions,\n): Promise<ReifyResult> => {\n  const done = graphStep('reify')\n\n  const { graph, scurry, remover } = 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 noModifiedDependencies =\n    !options.add?.modifiedDependencies &&\n    !options.remove?.modifiedDependencies\n  const skipOptionalOnly = noModifiedDependencies && diff.optionalOnly\n  const res: ReifyResult = { diff }\n  if (!diff.hasChanges() || skipOptionalOnly) {\n    // nothing to do, so just return the diff\n    done()\n    return res\n  }\n\n  let success = false\n  try {\n    const { buildQueue } = await reify_(options, diff, remover)\n    remover.confirm()\n    success = true\n    res.buildQueue = buildQueue\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 res\n}\n\nconst reify_ = async (\n  options: ReifyOptions,\n  diff: Diff,\n  remover: RollbackRemove,\n): Promise<Omit<ReifyResult, 'diff'>> => {\n  const res: Omit<ReifyResult, 'diff'> = {}\n  const {\n    add,\n    remove,\n    packageInfo,\n    packageJson,\n    scurry,\n    allowScripts,\n  } = options\n  const saveImportersPackageJson =\n    /* c8 ignore next */\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 = addEdges(diff, scurry, remover)\n  if (edgeActions.length) await callLimit(edgeActions, { limit })\n\n  await internalHoist(diff.to, options, remover)\n\n  // looks up all nodes setting buildState = 'needed'\n  // on nodes that require building\n  checkNeededBuild({ diff, scurry, packageJson })\n\n  // Filter nodes allowed to run scripts if allowScripts query is provided\n  const allowScriptsNodes = await filterNodesByQuery(\n    diff.to,\n    allowScripts,\n  )\n\n  // ensure that all added bins are chmod +x\n  await binChmodAll(diff.nodes.add, scurry)\n\n  // run install lifecycle scripts and link any binary files\n  await build(diff, packageJson, scurry, allowScriptsNodes)\n\n  // set the buildQueue on the result object containing\n  // an array with all the ids of nodes that need building\n  res.buildQueue = [...diff.nodes.add]\n    .filter(node => node.buildState === 'needed')\n    .map(node => node.id)\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  // TODO: add tests to cover this\n  /* c8 ignore start */\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  /* c8 ignore stop */\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  // returns the result object\n  return res\n}\n"]}

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

@@ -3,6 +3,7 @@ export type MermaidOutputGraph = {
     edges: EdgeLike[];
     importers: Set<NodeLike>;
     nodes: NodeLike[];
+    highlightSelection?: boolean;
 };
 /**
  * Generates a short identifier for a given index following the pattern:
@@ -13,5 +14,5 @@ export declare function generateShortId(index: number): string;
 /**
  * Returns a mermaid string representation of the graph.
  */
-export declare function mermaidOutput({ edges, importers, nodes, }: MermaidOutputGraph): string;
+export declare function mermaidOutput(options: MermaidOutputGraph): string;
 //# sourceMappingURL=mermaid-output.d.ts.map

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

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

package/dist/visualization/mermaid-output.js

@@ -1,6 +1,8 @@
 import { Edge } from "../edge.js";
 import { Node } from "../node.js";
 let missingCount = 0;
+const isSelected = (options, edge, node) => (!node || options.nodes.includes(node)) &&
+    /* c8 ignore next */ (!edge || options.edges.includes(edge));
 /**
  * Generates a short identifier for a given index following the pattern:
  * 0 -> a, 1 -> b, ..., 25 -> z, 26 -> A, ..., 51 -> Z, 52 -> aa, 53 -> ab, etc.
@@ -58,29 +60,35 @@ function createDepIdMapping(importers) {
  * been labeled. This tracking is shared across multiple importers to prevent duplicate
  * labels in the output.
  */
-const nodeRef = (node, labeledNodes, depIdMapping) => {
+const nodeRef = (node, labeledNodes, depIdMapping, options) => {
     const shortId = depIdMapping.get(node.id) /* c8 ignore next - should not be possible */ ?? '';
+    const selectedClass = (options.highlightSelection &&
+        isSelected(options, undefined, node)) ?
+        ':::selected'
+        : '';
     if (labeledNodes.has(node.id)) {
-        return shortId;
+        return shortId + selectedClass;
     }
     labeledNodes.add(node.id);
-    return `${shortId}("${String(node).replaceAll('@', '#64;')}")`;
+    return `${shortId}("${String(node).replaceAll('@', '#64;')}")${selectedClass}`;
 };
-function parseNode(seenNodes, labeledNodes, includedItems, depIdMapping, node, isImporter = false) {
+function parseNode(seenNodes, labeledNodes, includedItems, depIdMapping, options, node, isImporter = false) {
     if (seenNodes.has(node.id) || !includedItems.get(node)) {
         return '';
     }
     seenNodes.add(node.id);
     // For importers, render the node label first as a standalone line before processing edges,
     // since they appear at the top of the graph. Non-importer nodes are labeled inline as part of edge definitions.
-    const nodeLabel = isImporter ? nodeRef(node, labeledNodes, depIdMapping) : '';
+    const nodeLabel = isImporter ?
+        nodeRef(node, labeledNodes, depIdMapping, options)
+        : '';
     // Include both regular edges and workspace edges (if any)
     const allEdges = [
         ...node.edgesOut.values(),
         ...(node.workspaces?.values() ?? []),
     ];
     const edges = allEdges
-        .map(e => parseEdge(seenNodes, labeledNodes, includedItems, depIdMapping, e))
+        .map(e => parseEdge(seenNodes, labeledNodes, includedItems, depIdMapping, options, e))
         .filter(Boolean)
         .join('\n');
     // Only render node standalone for importers, others are rendered as part of edges
@@ -90,12 +98,12 @@ function parseNode(seenNodes, labeledNodes, includedItems, depIdMapping, node, i
     }
     return edges;
 }
-function parseEdge(seenNodes, labeledNodes, includedItems, depIdMapping, edge) {
+function parseEdge(seenNodes, labeledNodes, includedItems, depIdMapping, options, edge) {
     if (!includedItems.get(edge)) {
         return '';
     }
     const edgeType = edge.type === 'prod' ? '' : ` (${edge.type})`;
-    const edgeResult = nodeRef(edge.from, labeledNodes, depIdMapping) +
+    const edgeResult = nodeRef(edge.from, labeledNodes, depIdMapping, options) +
         ` -->|"${String(edge.spec).replaceAll('@', '#64;')}${edgeType}"| `;
     const missingLabel = edge.type.endsWith('ptional') ? 'Missing Optional' : 'Missing';
     if (!edge.to) {
@@ -103,14 +111,15 @@ function parseEdge(seenNodes, labeledNodes, includedItems, depIdMapping, edge) {
     }
     // Label the target node first so that if it's referenced again later in the graph,
     // it will use the short identifier instead of repeating the full label.
-    const toRef = nodeRef(edge.to, labeledNodes, depIdMapping);
-    const childEdges = parseNode(seenNodes, labeledNodes, includedItems, depIdMapping, edge.to);
+    const toRef = nodeRef(edge.to, labeledNodes, depIdMapping, options);
+    const childEdges = parseNode(seenNodes, labeledNodes, includedItems, depIdMapping, options, edge.to);
     return edgeResult + toRef + (childEdges ? '\n' + childEdges : '');
 }
 /**
  * Returns a mermaid string representation of the graph.
  */
-export function mermaidOutput({ edges, importers, nodes, }) {
+export function mermaidOutput(options) {
+    const { edges, importers, nodes, highlightSelection } = options;
     const seen = new Set();
     const includedItems = new Map();
     const traverse = new Set([...importers].map(i => ({ self: i, parent: undefined })));
@@ -155,10 +164,13 @@ export function mermaidOutput({ edges, importers, nodes, }) {
     const labeledNodes = new Set();
     // Track nodes that have been processed (shared across all importers to avoid duplicates)
     const seenNodes = new Set();
-    return ('flowchart TD\n' +
-        [...importers]
-            .map(i => parseNode(seenNodes, labeledNodes, includedItems, depIdMapping, i, true))
-            .filter(Boolean)
-            .join('\n'));
+    const graphOutput = [...importers]
+        .map(i => parseNode(seenNodes, labeledNodes, includedItems, depIdMapping, options, i, true))
+        .filter(Boolean)
+        .join('\n');
+    const styleDefinition = highlightSelection ?
+        '\nclassDef selected fill:gold,color:#242424'
+        : '';
+    return 'flowchart TD\n' + graphOutput + styleDefinition;
 }
 //# sourceMappingURL=mermaid-output.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"mermaid-output.js","sourceRoot":"","sources":["../../src/visualization/mermaid-output.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AACjC,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAcjC,IAAI,YAAY,GAAG,CAAC,CAAA;AAEpB;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,KAAa;IAC3C,MAAM,IAAI,GAAG,EAAE,CAAA;IAEf,yDAAyD;IACzD,MAAM,WAAW,GAAG,CAAC,KAAa,EAAU,EAAE;QAC5C,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;YACf,aAAa;YACb,OAAO,MAAM,CAAC,YAAY,CAAC,EAAE,GAAG,KAAK,CAAC,CAAA;QACxC,CAAC;aAAM,CAAC;YACN,cAAc;YACd,OAAO,MAAM,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAA;QAC/C,CAAC;IACH,CAAC,CAAA;IAED,+BAA+B;IAC/B,IAAI,MAAM,GAAG,EAAE,CAAA;IACf,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,CAAA,CAAC,wCAAwC;IAE5D,OAAO,GAAG,GAAG,CAAC,EAAE,CAAC;QACf,GAAG,EAAE,CAAA,CAAC,+CAA+C;QACrD,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI,CAAA;QAC5B,MAAM,GAAG,WAAW,CAAC,SAAS,CAAC,GAAG,MAAM,CAAA;QACxC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,IAAI,CAAC,CAAA;IAC9B,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CACzB,SAAwB;IAExB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAiB,CAAA;IACxC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAS,CAAA;IAErC,mDAAmD;IACnD,MAAM,CAAC,QAAQ,CAAC,GAAG,SAAS,CAAA;IAC5B,IAAI,QAAQ,EAAE,CAAC;QACb,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACjD,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC3B,CAAC;IACH,CAAC;IAED,uCAAuC;IACvC,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;QACjC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,eAAe,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;IAC9C,CAAC;IAED,OAAO,OAAO,CAAA;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,OAAO,GAAG,CACd,IAAc,EACd,YAAwB,EACxB,YAAgC,EACxB,EAAE;IACV,MAAM,OAAO,GACX,YAAY,CAAC,GAAG,CACd,IAAI,CAAC,EAAE,CACR,CAAC,6CAA6C,IAAI,EAAE,CAAA;IACvD,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;QAC9B,OAAO,OAAO,CAAA;IAChB,CAAC;IACD,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACzB,OAAO,GAAG,OAAO,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,CAAA;AAChE,CAAC,CAAA;AAED,SAAS,SAAS,CAChB,SAAqB,EACrB,YAAwB,EACxB,aAAgD,EAChD,YAAgC,EAChC,IAAc,EACd,UAAU,GAAG,KAAK;IAElB,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QACvD,OAAO,EAAE,CAAA;IACX,CAAC;IACD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACtB,2FAA2F;IAC3F,gHAAgH;IAChH,MAAM,SAAS,GACb,UAAU,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,YAAY,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;IAC7D,0DAA0D;IAC1D,MAAM,QAAQ,GAAG;QACf,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;QACzB,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;KACrC,CAAA;IACD,MAAM,KAAK,GAAW,QAAQ;SAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,CACP,SAAS,CACP,SAAS,EACT,YAAY,EACZ,aAAa,EACb,YAAY,EACZ,CAAC,CACF,CACF;SACA,MAAM,CAAC,OAAO,CAAC;SACf,IAAI,CAAC,IAAI,CAAC,CAAA;IACb,kFAAkF;IAClF,IAAI,UAAU,EAAE,CAAC;QACf,oBAAoB;QACpB,OAAO,GAAG,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,CAAA;IAC1D,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,SAAS,SAAS,CAChB,SAAqB,EACrB,YAAwB,EACxB,aAAgD,EAChD,YAAgC,EAChC,IAAc;IAEd,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7B,OAAO,EAAE,CAAA;IACX,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,GAAG,CAAA;IAC9D,MAAM,UAAU,GACd,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,EAAE,YAAY,CAAC;QAC9C,SAAS,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,QAAQ,KAAK,CAAA;IAEpE,MAAM,YAAY,GAChB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,SAAS,CAAA;IAChE,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;QACb,OAAO,UAAU,GAAG,WAAW,YAAY,EAAE,IAAI,YAAY,GAAG,CAAA;IAClE,CAAC;IAED,mFAAmF;IACnF,wEAAwE;IACxE,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,YAAY,EAAE,YAAY,CAAC,CAAA;IAC1D,MAAM,UAAU,GAAG,SAAS,CAC1B,SAAS,EACT,YAAY,EACZ,aAAa,EACb,YAAY,EACZ,IAAI,CAAC,EAAE,CACR,CAAA;IACD,OAAO,UAAU,GAAG,KAAK,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;AACnE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,EAC5B,KAAK,EACL,SAAS,EACT,KAAK,GACc;IACnB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAuB,CAAA;IAC3C,MAAM,aAAa,GAAG,IAAI,GAAG,EAAgC,CAAA;IAC7D,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC,CAC1D,CAAA;IAED,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAQ;QACjC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAEnB,IAAI,IAAI,CAAC,IAAI,YAAY,IAAI,EAAE,CAAC;YAC9B,gFAAgF;YAChF,qEAAqE;YACrE,IACE,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;gBACzB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,WAAW,EACnC,CAAC;gBACD,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;YACpC,CAAC;YACD,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;gBACjB,QAAQ,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;YACzD,CAAC;QACH,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,YAAY,IAAI,EAAE,CAAC;YAC9B,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9B,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;YACpC,CAAC;YACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC/C,QAAQ,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;YACjD,CAAC;YACD,8DAA8D;YAC9D,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;gBACzB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;oBACjD,QAAQ,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;gBACjD,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3C,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChD,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;QACtC,CAAC;IACH,CAAC;IAED,2CAA2C;IAC3C,MAAM,YAAY,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAA;IAElD,8EAA8E;IAC9E,MAAM,YAAY,GAAG,IAAI,GAAG,EAAS,CAAA;IAErC,yFAAyF;IACzF,MAAM,SAAS,GAAG,IAAI,GAAG,EAAS,CAAA;IAElC,OAAO,CACL,gBAAgB;QAChB,CAAC,GAAG,SAAS,CAAC;aACX,GAAG,CAAC,CAAC,CAAC,EAAE,CACP,SAAS,CACP,SAAS,EACT,YAAY,EACZ,aAAa,EACb,YAAY,EACZ,CAAC,EACD,IAAI,CACL,CACF;aACA,MAAM,CAAC,OAAO,CAAC;aACf,IAAI,CAAC,IAAI,CAAC,CACd,CAAA;AACH,CAAC","sourcesContent":["import type { DepID } from '@vltpkg/dep-id'\nimport { Edge } from '../edge.ts'\nimport { Node } from '../node.ts'\nimport type { EdgeLike, NodeLike } from '@vltpkg/types'\n\nexport type MermaidOutputGraph = {\n  edges: EdgeLike[]\n  importers: Set<NodeLike>\n  nodes: NodeLike[]\n}\n\ntype TraverseItem = {\n  self: EdgeLike | NodeLike\n  parent: EdgeLike | NodeLike | undefined\n}\n\nlet missingCount = 0\n\n/**\n * Generates a short identifier for a given index following the pattern:\n * 0 -> a, 1 -> b, ..., 25 -> z, 26 -> A, ..., 51 -> Z, 52 -> aa, 53 -> ab, etc.\n * This implements a bijective base-52 numbering system where a-z = 0-25, A-Z = 26-51\n */\nexport function generateShortId(index: number): string {\n  const base = 52\n\n  // Helper function to convert a digit (0-51) to character\n  const digitToChar = (digit: number): string => {\n    if (digit < 26) {\n      // a-z (0-25)\n      return String.fromCharCode(97 + digit)\n    } else {\n      // A-Z (26-51)\n      return String.fromCharCode(65 + (digit - 26))\n    }\n  }\n\n  // Bijective base-52 conversion\n  let result = ''\n  let num = index + 1 // Convert to 1-based for bijective base\n\n  while (num > 0) {\n    num-- // Adjust for 0-based indexing in each position\n    const remainder = num % base\n    result = digitToChar(remainder) + result\n    num = Math.floor(num / base)\n  }\n\n  return result\n}\n\n/**\n * Creates a mapping from DepID to short identifier\n */\nfunction createDepIdMapping(\n  importers: Set<NodeLike>,\n): Map<DepID, string> {\n  const mapping = new Map<DepID, string>()\n  const uniqueDepIds = new Set<DepID>()\n\n  // Collect all unique DepIDs from nodes & importers\n  const [importer] = importers\n  if (importer) {\n    for (const node of importer.graph.nodes.values()) {\n      uniqueDepIds.add(node.id)\n    }\n  }\n\n  // Create mapping for each unique DepID\n  let index = 0\n  for (const depId of uniqueDepIds) {\n    mapping.set(depId, generateShortId(index++))\n  }\n\n  return mapping\n}\n\n/**\n * Returns a node reference: on the first occurrence of a node, returns the full label;\n * on subsequent occurrences, returns just the shortId.\n *\n * Note: Mutates the `labeledNodes` set as a side effect to track which nodes have already\n * been labeled. This tracking is shared across multiple importers to prevent duplicate\n * labels in the output.\n */\nconst nodeRef = (\n  node: NodeLike,\n  labeledNodes: Set<DepID>,\n  depIdMapping: Map<DepID, string>,\n): string => {\n  const shortId =\n    depIdMapping.get(\n      node.id,\n    ) /* c8 ignore next - should not be possible */ ?? ''\n  if (labeledNodes.has(node.id)) {\n    return shortId\n  }\n  labeledNodes.add(node.id)\n  return `${shortId}(\"${String(node).replaceAll('@', '#64;')}\")`\n}\n\nfunction parseNode(\n  seenNodes: Set<DepID>,\n  labeledNodes: Set<DepID>,\n  includedItems: Map<EdgeLike | NodeLike, boolean>,\n  depIdMapping: Map<DepID, string>,\n  node: NodeLike,\n  isImporter = false,\n) {\n  if (seenNodes.has(node.id) || !includedItems.get(node)) {\n    return ''\n  }\n  seenNodes.add(node.id)\n  // For importers, render the node label first as a standalone line before processing edges,\n  // since they appear at the top of the graph. Non-importer nodes are labeled inline as part of edge definitions.\n  const nodeLabel =\n    isImporter ? nodeRef(node, labeledNodes, depIdMapping) : ''\n  // Include both regular edges and workspace edges (if any)\n  const allEdges = [\n    ...node.edgesOut.values(),\n    ...(node.workspaces?.values() ?? []),\n  ]\n  const edges: string = allEdges\n    .map(e =>\n      parseEdge(\n        seenNodes,\n        labeledNodes,\n        includedItems,\n        depIdMapping,\n        e,\n      ),\n    )\n    .filter(Boolean)\n    .join('\\n')\n  // Only render node standalone for importers, others are rendered as part of edges\n  if (isImporter) {\n    /* c8 ignore next */\n    return `${nodeLabel}${edges.length ? '\\n' : ''}${edges}`\n  }\n  return edges\n}\n\nfunction parseEdge(\n  seenNodes: Set<DepID>,\n  labeledNodes: Set<DepID>,\n  includedItems: Map<EdgeLike | NodeLike, boolean>,\n  depIdMapping: Map<DepID, string>,\n  edge: EdgeLike,\n) {\n  if (!includedItems.get(edge)) {\n    return ''\n  }\n\n  const edgeType = edge.type === 'prod' ? '' : ` (${edge.type})`\n  const edgeResult =\n    nodeRef(edge.from, labeledNodes, depIdMapping) +\n    ` -->|\"${String(edge.spec).replaceAll('@', '#64;')}${edgeType}\"| `\n\n  const missingLabel =\n    edge.type.endsWith('ptional') ? 'Missing Optional' : 'Missing'\n  if (!edge.to) {\n    return edgeResult + `missing-${missingCount++}(${missingLabel})`\n  }\n\n  // Label the target node first so that if it's referenced again later in the graph,\n  // it will use the short identifier instead of repeating the full label.\n  const toRef = nodeRef(edge.to, labeledNodes, depIdMapping)\n  const childEdges = parseNode(\n    seenNodes,\n    labeledNodes,\n    includedItems,\n    depIdMapping,\n    edge.to,\n  )\n  return edgeResult + toRef + (childEdges ? '\\n' + childEdges : '')\n}\n\n/**\n * Returns a mermaid string representation of the graph.\n */\nexport function mermaidOutput({\n  edges,\n  importers,\n  nodes,\n}: MermaidOutputGraph) {\n  const seen = new Set<EdgeLike | NodeLike>()\n  const includedItems = new Map<EdgeLike | NodeLike, boolean>()\n  const traverse = new Set<TraverseItem>(\n    [...importers].map(i => ({ self: i, parent: undefined })),\n  )\n\n  for (const item of traverse) {\n    if (seen.has(item.self)) continue\n    seen.add(item.self)\n\n    if (item.self instanceof Edge) {\n      // Workspace edges are stored in mainImporter.workspaces and not in graph.edges,\n      // so we need to check for workspace spec type to always include them\n      if (\n        edges.includes(item.self) ||\n        item.self.spec.type === 'workspace'\n      ) {\n        includedItems.set(item.self, true)\n      }\n      if (item.self.to) {\n        traverse.add({ self: item.self.to, parent: item.self })\n      }\n    }\n\n    if (item.self instanceof Node) {\n      if (nodes.includes(item.self)) {\n        includedItems.set(item.self, true)\n      }\n      for (const edge of item.self.edgesOut.values()) {\n        traverse.add({ self: edge, parent: item.self })\n      }\n      // Also traverse workspace edges (only mainImporter has these)\n      if (item.self.workspaces) {\n        for (const edge of item.self.workspaces.values()) {\n          traverse.add({ self: edge, parent: item.self })\n        }\n      }\n    }\n  }\n\n  for (const item of [...traverse].reverse()) {\n    if (includedItems.has(item.self) && item.parent) {\n      includedItems.set(item.parent, true)\n    }\n  }\n\n  // Create DepID to short identifier mapping\n  const depIdMapping = createDepIdMapping(importers)\n\n  // Track nodes that have had their label printed (shared across all importers)\n  const labeledNodes = new Set<DepID>()\n\n  // Track nodes that have been processed (shared across all importers to avoid duplicates)\n  const seenNodes = new Set<DepID>()\n\n  return (\n    'flowchart TD\\n' +\n    [...importers]\n      .map(i =>\n        parseNode(\n          seenNodes,\n          labeledNodes,\n          includedItems,\n          depIdMapping,\n          i,\n          true, // isImporter\n        ),\n      )\n      .filter(Boolean)\n      .join('\\n')\n  )\n}\n"]}
+{"version":3,"file":"mermaid-output.js","sourceRoot":"","sources":["../../src/visualization/mermaid-output.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AACjC,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAejC,IAAI,YAAY,GAAG,CAAC,CAAA;AAEpB,MAAM,UAAU,GAAG,CACjB,OAA2B,EAC3B,IAAe,EACf,IAAe,EACf,EAAE,CACF,CAAC,CAAC,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACvC,oBAAoB,CAAC,CAAC,CAAC,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAA;AAE9D;;;;GAIG;AACH,MAAM,UAAU,eAAe,CAAC,KAAa;IAC3C,MAAM,IAAI,GAAG,EAAE,CAAA;IAEf,yDAAyD;IACzD,MAAM,WAAW,GAAG,CAAC,KAAa,EAAU,EAAE;QAC5C,IAAI,KAAK,GAAG,EAAE,EAAE,CAAC;YACf,aAAa;YACb,OAAO,MAAM,CAAC,YAAY,CAAC,EAAE,GAAG,KAAK,CAAC,CAAA;QACxC,CAAC;aAAM,CAAC;YACN,cAAc;YACd,OAAO,MAAM,CAAC,YAAY,CAAC,EAAE,GAAG,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAA;QAC/C,CAAC;IACH,CAAC,CAAA;IAED,+BAA+B;IAC/B,IAAI,MAAM,GAAG,EAAE,CAAA;IACf,IAAI,GAAG,GAAG,KAAK,GAAG,CAAC,CAAA,CAAC,wCAAwC;IAE5D,OAAO,GAAG,GAAG,CAAC,EAAE,CAAC;QACf,GAAG,EAAE,CAAA,CAAC,+CAA+C;QACrD,MAAM,SAAS,GAAG,GAAG,GAAG,IAAI,CAAA;QAC5B,MAAM,GAAG,WAAW,CAAC,SAAS,CAAC,GAAG,MAAM,CAAA;QACxC,GAAG,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,IAAI,CAAC,CAAA;IAC9B,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CACzB,SAAwB;IAExB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAiB,CAAA;IACxC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAS,CAAA;IAErC,mDAAmD;IACnD,MAAM,CAAC,QAAQ,CAAC,GAAG,SAAS,CAAA;IAC5B,IAAI,QAAQ,EAAE,CAAC;QACb,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACjD,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC3B,CAAC;IACH,CAAC;IAED,uCAAuC;IACvC,IAAI,KAAK,GAAG,CAAC,CAAA;IACb,KAAK,MAAM,KAAK,IAAI,YAAY,EAAE,CAAC;QACjC,OAAO,CAAC,GAAG,CAAC,KAAK,EAAE,eAAe,CAAC,KAAK,EAAE,CAAC,CAAC,CAAA;IAC9C,CAAC;IAED,OAAO,OAAO,CAAA;AAChB,CAAC;AAED;;;;;;;GAOG;AACH,MAAM,OAAO,GAAG,CACd,IAAc,EACd,YAAwB,EACxB,YAAgC,EAChC,OAA2B,EACnB,EAAE;IACV,MAAM,OAAO,GACX,YAAY,CAAC,GAAG,CACd,IAAI,CAAC,EAAE,CACR,CAAC,6CAA6C,IAAI,EAAE,CAAA;IACvD,MAAM,aAAa,GACjB,CACE,OAAO,CAAC,kBAAkB;QAC1B,UAAU,CAAC,OAAO,EAAE,SAAS,EAAE,IAAI,CAAC,CACrC,CAAC,CAAC;QACD,aAAa;QACf,CAAC,CAAC,EAAE,CAAA;IACN,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;QAC9B,OAAO,OAAO,GAAG,aAAa,CAAA;IAChC,CAAC;IACD,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACzB,OAAO,GAAG,OAAO,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,KAAK,aAAa,EAAE,CAAA;AAChF,CAAC,CAAA;AAED,SAAS,SAAS,CAChB,SAAqB,EACrB,YAAwB,EACxB,aAAgD,EAChD,YAAgC,EAChC,OAA2B,EAC3B,IAAc,EACd,UAAU,GAAG,KAAK;IAElB,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QACvD,OAAO,EAAE,CAAA;IACX,CAAC;IACD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IACtB,2FAA2F;IAC3F,gHAAgH;IAChH,MAAM,SAAS,GACb,UAAU,CAAC,CAAC;QACV,OAAO,CAAC,IAAI,EAAE,YAAY,EAAE,YAAY,EAAE,OAAO,CAAC;QACpD,CAAC,CAAC,EAAE,CAAA;IACN,0DAA0D;IAC1D,MAAM,QAAQ,GAAG;QACf,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE;QACzB,GAAG,CAAC,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;KACrC,CAAA;IACD,MAAM,KAAK,GAAW,QAAQ;SAC3B,GAAG,CAAC,CAAC,CAAC,EAAE,CACP,SAAS,CACP,SAAS,EACT,YAAY,EACZ,aAAa,EACb,YAAY,EACZ,OAAO,EACP,CAAC,CACF,CACF;SACA,MAAM,CAAC,OAAO,CAAC;SACf,IAAI,CAAC,IAAI,CAAC,CAAA;IACb,kFAAkF;IAClF,IAAI,UAAU,EAAE,CAAC;QACf,oBAAoB;QACpB,OAAO,GAAG,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,KAAK,EAAE,CAAA;IAC1D,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC;AAED,SAAS,SAAS,CAChB,SAAqB,EACrB,YAAwB,EACxB,aAAgD,EAChD,YAAgC,EAChC,OAA2B,EAC3B,IAAc;IAEd,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QAC7B,OAAO,EAAE,CAAA;IACX,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,GAAG,CAAA;IAC9D,MAAM,UAAU,GACd,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,YAAY,EAAE,YAAY,EAAE,OAAO,CAAC;QACvD,SAAS,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,UAAU,CAAC,GAAG,EAAE,MAAM,CAAC,GAAG,QAAQ,KAAK,CAAA;IAEpE,MAAM,YAAY,GAChB,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,kBAAkB,CAAC,CAAC,CAAC,SAAS,CAAA;IAChE,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;QACb,OAAO,UAAU,GAAG,WAAW,YAAY,EAAE,IAAI,YAAY,GAAG,CAAA;IAClE,CAAC;IAED,mFAAmF;IACnF,wEAAwE;IACxE,MAAM,KAAK,GAAG,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,YAAY,EAAE,YAAY,EAAE,OAAO,CAAC,CAAA;IACnE,MAAM,UAAU,GAAG,SAAS,CAC1B,SAAS,EACT,YAAY,EACZ,aAAa,EACb,YAAY,EACZ,OAAO,EACP,IAAI,CAAC,EAAE,CACR,CAAA;IACD,OAAO,UAAU,GAAG,KAAK,GAAG,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,GAAG,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC,CAAA;AACnE,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,OAA2B;IACvD,MAAM,EAAE,KAAK,EAAE,SAAS,EAAE,KAAK,EAAE,kBAAkB,EAAE,GAAG,OAAO,CAAA;IAC/D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAuB,CAAA;IAC3C,MAAM,aAAa,GAAG,IAAI,GAAG,EAAgC,CAAA;IAC7D,MAAM,QAAQ,GAAG,IAAI,GAAG,CACtB,CAAC,GAAG,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,MAAM,EAAE,SAAS,EAAE,CAAC,CAAC,CAC1D,CAAA;IAED,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;YAAE,SAAQ;QACjC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAEnB,IAAI,IAAI,CAAC,IAAI,YAAY,IAAI,EAAE,CAAC;YAC9B,gFAAgF;YAChF,qEAAqE;YACrE,IACE,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC;gBACzB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,WAAW,EACnC,CAAC;gBACD,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;YACpC,CAAC;YACD,IAAI,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC;gBACjB,QAAQ,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;YACzD,CAAC;QACH,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,YAAY,IAAI,EAAE,CAAC;YAC9B,IAAI,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC9B,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;YACpC,CAAC;YACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC/C,QAAQ,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;YACjD,CAAC;YACD,8DAA8D;YAC9D,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,CAAC;gBACzB,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,EAAE,CAAC;oBACjD,QAAQ,CAAC,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAA;gBACjD,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3C,IAAI,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChD,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;QACtC,CAAC;IACH,CAAC;IAED,2CAA2C;IAC3C,MAAM,YAAY,GAAG,kBAAkB,CAAC,SAAS,CAAC,CAAA;IAElD,8EAA8E;IAC9E,MAAM,YAAY,GAAG,IAAI,GAAG,EAAS,CAAA;IAErC,yFAAyF;IACzF,MAAM,SAAS,GAAG,IAAI,GAAG,EAAS,CAAA;IAElC,MAAM,WAAW,GAAG,CAAC,GAAG,SAAS,CAAC;SAC/B,GAAG,CAAC,CAAC,CAAC,EAAE,CACP,SAAS,CACP,SAAS,EACT,YAAY,EACZ,aAAa,EACb,YAAY,EACZ,OAAO,EACP,CAAC,EACD,IAAI,CACL,CACF;SACA,MAAM,CAAC,OAAO,CAAC;SACf,IAAI,CAAC,IAAI,CAAC,CAAA;IAEb,MAAM,eAAe,GACnB,kBAAkB,CAAC,CAAC;QAClB,6CAA6C;QAC/C,CAAC,CAAC,EAAE,CAAA;IAEN,OAAO,gBAAgB,GAAG,WAAW,GAAG,eAAe,CAAA;AACzD,CAAC","sourcesContent":["import type { DepID } from '@vltpkg/dep-id'\nimport { Edge } from '../edge.ts'\nimport { Node } from '../node.ts'\nimport type { EdgeLike, NodeLike } from '@vltpkg/types'\n\nexport type MermaidOutputGraph = {\n  edges: EdgeLike[]\n  importers: Set<NodeLike>\n  nodes: NodeLike[]\n  highlightSelection?: boolean\n}\n\ntype TraverseItem = {\n  self: EdgeLike | NodeLike\n  parent: EdgeLike | NodeLike | undefined\n}\n\nlet missingCount = 0\n\nconst isSelected = (\n  options: MermaidOutputGraph,\n  edge?: EdgeLike,\n  node?: NodeLike,\n) =>\n  (!node || options.nodes.includes(node)) &&\n  /* c8 ignore next */ (!edge || options.edges.includes(edge))\n\n/**\n * Generates a short identifier for a given index following the pattern:\n * 0 -> a, 1 -> b, ..., 25 -> z, 26 -> A, ..., 51 -> Z, 52 -> aa, 53 -> ab, etc.\n * This implements a bijective base-52 numbering system where a-z = 0-25, A-Z = 26-51\n */\nexport function generateShortId(index: number): string {\n  const base = 52\n\n  // Helper function to convert a digit (0-51) to character\n  const digitToChar = (digit: number): string => {\n    if (digit < 26) {\n      // a-z (0-25)\n      return String.fromCharCode(97 + digit)\n    } else {\n      // A-Z (26-51)\n      return String.fromCharCode(65 + (digit - 26))\n    }\n  }\n\n  // Bijective base-52 conversion\n  let result = ''\n  let num = index + 1 // Convert to 1-based for bijective base\n\n  while (num > 0) {\n    num-- // Adjust for 0-based indexing in each position\n    const remainder = num % base\n    result = digitToChar(remainder) + result\n    num = Math.floor(num / base)\n  }\n\n  return result\n}\n\n/**\n * Creates a mapping from DepID to short identifier\n */\nfunction createDepIdMapping(\n  importers: Set<NodeLike>,\n): Map<DepID, string> {\n  const mapping = new Map<DepID, string>()\n  const uniqueDepIds = new Set<DepID>()\n\n  // Collect all unique DepIDs from nodes & importers\n  const [importer] = importers\n  if (importer) {\n    for (const node of importer.graph.nodes.values()) {\n      uniqueDepIds.add(node.id)\n    }\n  }\n\n  // Create mapping for each unique DepID\n  let index = 0\n  for (const depId of uniqueDepIds) {\n    mapping.set(depId, generateShortId(index++))\n  }\n\n  return mapping\n}\n\n/**\n * Returns a node reference: on the first occurrence of a node, returns the full label;\n * on subsequent occurrences, returns just the shortId.\n *\n * Note: Mutates the `labeledNodes` set as a side effect to track which nodes have already\n * been labeled. This tracking is shared across multiple importers to prevent duplicate\n * labels in the output.\n */\nconst nodeRef = (\n  node: NodeLike,\n  labeledNodes: Set<DepID>,\n  depIdMapping: Map<DepID, string>,\n  options: MermaidOutputGraph,\n): string => {\n  const shortId =\n    depIdMapping.get(\n      node.id,\n    ) /* c8 ignore next - should not be possible */ ?? ''\n  const selectedClass =\n    (\n      options.highlightSelection &&\n      isSelected(options, undefined, node)\n    ) ?\n      ':::selected'\n    : ''\n  if (labeledNodes.has(node.id)) {\n    return shortId + selectedClass\n  }\n  labeledNodes.add(node.id)\n  return `${shortId}(\"${String(node).replaceAll('@', '#64;')}\")${selectedClass}`\n}\n\nfunction parseNode(\n  seenNodes: Set<DepID>,\n  labeledNodes: Set<DepID>,\n  includedItems: Map<EdgeLike | NodeLike, boolean>,\n  depIdMapping: Map<DepID, string>,\n  options: MermaidOutputGraph,\n  node: NodeLike,\n  isImporter = false,\n) {\n  if (seenNodes.has(node.id) || !includedItems.get(node)) {\n    return ''\n  }\n  seenNodes.add(node.id)\n  // For importers, render the node label first as a standalone line before processing edges,\n  // since they appear at the top of the graph. Non-importer nodes are labeled inline as part of edge definitions.\n  const nodeLabel =\n    isImporter ?\n      nodeRef(node, labeledNodes, depIdMapping, options)\n    : ''\n  // Include both regular edges and workspace edges (if any)\n  const allEdges = [\n    ...node.edgesOut.values(),\n    ...(node.workspaces?.values() ?? []),\n  ]\n  const edges: string = allEdges\n    .map(e =>\n      parseEdge(\n        seenNodes,\n        labeledNodes,\n        includedItems,\n        depIdMapping,\n        options,\n        e,\n      ),\n    )\n    .filter(Boolean)\n    .join('\\n')\n  // Only render node standalone for importers, others are rendered as part of edges\n  if (isImporter) {\n    /* c8 ignore next */\n    return `${nodeLabel}${edges.length ? '\\n' : ''}${edges}`\n  }\n  return edges\n}\n\nfunction parseEdge(\n  seenNodes: Set<DepID>,\n  labeledNodes: Set<DepID>,\n  includedItems: Map<EdgeLike | NodeLike, boolean>,\n  depIdMapping: Map<DepID, string>,\n  options: MermaidOutputGraph,\n  edge: EdgeLike,\n) {\n  if (!includedItems.get(edge)) {\n    return ''\n  }\n\n  const edgeType = edge.type === 'prod' ? '' : ` (${edge.type})`\n  const edgeResult =\n    nodeRef(edge.from, labeledNodes, depIdMapping, options) +\n    ` -->|\"${String(edge.spec).replaceAll('@', '#64;')}${edgeType}\"| `\n\n  const missingLabel =\n    edge.type.endsWith('ptional') ? 'Missing Optional' : 'Missing'\n  if (!edge.to) {\n    return edgeResult + `missing-${missingCount++}(${missingLabel})`\n  }\n\n  // Label the target node first so that if it's referenced again later in the graph,\n  // it will use the short identifier instead of repeating the full label.\n  const toRef = nodeRef(edge.to, labeledNodes, depIdMapping, options)\n  const childEdges = parseNode(\n    seenNodes,\n    labeledNodes,\n    includedItems,\n    depIdMapping,\n    options,\n    edge.to,\n  )\n  return edgeResult + toRef + (childEdges ? '\\n' + childEdges : '')\n}\n\n/**\n * Returns a mermaid string representation of the graph.\n */\nexport function mermaidOutput(options: MermaidOutputGraph) {\n  const { edges, importers, nodes, highlightSelection } = options\n  const seen = new Set<EdgeLike | NodeLike>()\n  const includedItems = new Map<EdgeLike | NodeLike, boolean>()\n  const traverse = new Set<TraverseItem>(\n    [...importers].map(i => ({ self: i, parent: undefined })),\n  )\n\n  for (const item of traverse) {\n    if (seen.has(item.self)) continue\n    seen.add(item.self)\n\n    if (item.self instanceof Edge) {\n      // Workspace edges are stored in mainImporter.workspaces and not in graph.edges,\n      // so we need to check for workspace spec type to always include them\n      if (\n        edges.includes(item.self) ||\n        item.self.spec.type === 'workspace'\n      ) {\n        includedItems.set(item.self, true)\n      }\n      if (item.self.to) {\n        traverse.add({ self: item.self.to, parent: item.self })\n      }\n    }\n\n    if (item.self instanceof Node) {\n      if (nodes.includes(item.self)) {\n        includedItems.set(item.self, true)\n      }\n      for (const edge of item.self.edgesOut.values()) {\n        traverse.add({ self: edge, parent: item.self })\n      }\n      // Also traverse workspace edges (only mainImporter has these)\n      if (item.self.workspaces) {\n        for (const edge of item.self.workspaces.values()) {\n          traverse.add({ self: edge, parent: item.self })\n        }\n      }\n    }\n  }\n\n  for (const item of [...traverse].reverse()) {\n    if (includedItems.has(item.self) && item.parent) {\n      includedItems.set(item.parent, true)\n    }\n  }\n\n  // Create DepID to short identifier mapping\n  const depIdMapping = createDepIdMapping(importers)\n\n  // Track nodes that have had their label printed (shared across all importers)\n  const labeledNodes = new Set<DepID>()\n\n  // Track nodes that have been processed (shared across all importers to avoid duplicates)\n  const seenNodes = new Set<DepID>()\n\n  const graphOutput = [...importers]\n    .map(i =>\n      parseNode(\n        seenNodes,\n        labeledNodes,\n        includedItems,\n        depIdMapping,\n        options,\n        i,\n        true, // isImporter\n      ),\n    )\n    .filter(Boolean)\n    .join('\\n')\n\n  const styleDefinition =\n    highlightSelection ?\n      '\\nclassDef selected fill:gold,color:#242424'\n    : ''\n\n  return 'flowchart TD\\n' + graphOutput + styleDefinition\n}\n"]}