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

package/dist/esm/graph.d.ts

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

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

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

package/dist/esm/graph.js

@@ -4,13 +4,34 @@ import { satisfies } from '@vltpkg/satisfies';
 import { Spec } from '@vltpkg/spec';
 import { inspect } from 'node:util';
 import { lockfileData } from "./lockfile/save.js";
+import { Edge } from "./edge.js";
 import { Node } from "./node.js";
 import { resolveSaveType } from "./resolve-save-type.js";
 const kCustomInspect = Symbol.for('nodejs.util.inspect.custom');
+const cacheKeySeparator = '│';
 // this is always the same, but we don't hard code it as a string,
 // in case the DepID module needs to change its delimiter again ever.
 const mainDepID = joinDepIDTuple(['file', '.']);
 const getMap = (m) => m ?? new Map();
+/**
+ * Get a cache key for a resolution based on the
+ * spec, location and query modifier.
+ */
+const getResolutionCacheKey = (spec, location, queryModifier) => {
+    const f = spec.final;
+    // if it's a file: dep, then the fromNode location matters
+    const fromPrefix = f.type === 'file' ? location + ' : ' : '';
+    // the unique key should also precise what is the type of the spec,
+    // and in the case of a registry, what registry it is from.
+    const typePrecisionKey = f.registry ?
+        `${cacheKeySeparator}registry` +
+            `${cacheKeySeparator}${f.registry}`
+        : f.gitRemote ?
+            `${cacheKeySeparator}git` + `${cacheKeySeparator}${f.gitRemote}`
+            : `${cacheKeySeparator}${f.type}`;
+    const modifierSuffix = `${cacheKeySeparator}${queryModifier}`;
+    return fromPrefix + String(f) + typePrecisionKey + modifierSuffix;
+};
 export class Graph {
     get [Symbol.toStringTag]() {
         return '@vltpkg/graph.Graph';
@@ -77,6 +98,7 @@ export class Graph {
         mainImporter.setImporterLocation(mainImporterLocation);
         mainImporter.mainImporter = true;
         this.mainImporter = mainImporter;
+        this.mainImporter.workspaces = new Map();
         this.importers.add(mainImporter);
         this.manifests.set(mainImporter.id, mainManifest);
         // uses the monorepo instance in order to retrieve info on
@@ -90,11 +112,14 @@ export class Graph {
                     this.manifests.set(wsNode.id, wsNode.manifest);
                 }
                 this.importers.add(wsNode);
+                // creates a virtual edge to connect the workspaces to the root node
+                const edge = new Edge('prod', Spec.parse(wsNode.name, 'workspace:*', this.#options), this.mainImporter, wsNode);
+                this.mainImporter.workspaces.set(wsNode.name, edge);
             }
         }
     }
     /**
-     * Delete all nodes that are unreachable from the importers.
+     * Delete all nodes and edges that are unreachable from the importers.
      * The collection of deleted nodes is returned.
      *
      * NOTE: This can be extremely slow for large graphs, and is almost always
@@ -104,13 +129,16 @@ export class Graph {
      */
     gc() {
         const { nodes } = this;
+        this.edges.clear();
         this.nodes = new Map();
         const marked = new Set(this.importers);
         for (const imp of marked) {
             // don't delete the importer!
             nodes.delete(imp.id);
             this.nodes.set(imp.id, imp);
-            for (const { to } of imp.edgesOut.values()) {
+            for (const edge of imp.edgesOut.values()) {
+                this.edges.add(edge);
+                const { to } = edge;
                 if (!to || marked.has(to))
                     continue;
                 marked.add(to);
@@ -145,6 +173,9 @@ export class Graph {
             if (edge.type === type &&
                 edge.spec.bareSpec === spec.bareSpec) {
                 if (to && to !== edge.to) {
+                    // removes this edge from its destination edgesIn ref
+                    edge.to?.edgesIn.delete(edge);
+                    // now swap the destination to the new one
                     edge.to = to;
                     edge.to.edgesIn.add(edge);
                 }
@@ -160,11 +191,9 @@ export class Graph {
     /**
      * Find an existing node to satisfy a dependency
      */
-    findResolution(spec, fromNode) {
+    findResolution(spec, fromNode, queryModifier = '') {
         const f = spec.final;
-        // if it's a file: dep, then the fromNode location matters
-        const fromPref = f.type === 'file' ? fromNode.location + ' : ' : '';
-        const sf = fromPref + String(f);
+        const sf = getResolutionCacheKey(f, fromNode.location, queryModifier);
         const cached = this.resolutions.get(sf);
         if (cached)
             return cached;
@@ -189,17 +218,6 @@ export class Graph {
         const nbn = this.nodesByName.get(node.name) ?? new Set();
         nbn.add(node);
         this.nodesByName.set(node.name, nbn);
-        if (spec) {
-            const f = String(spec.final);
-            // if it's a file: type, then that is fromNode-specific,
-            // so we can't shortcut add it here.
-            if (spec.final.type !== 'file') {
-                this.resolutions.set(f, node);
-                const rrev = this.resolutionsReverse.get(node) ?? new Set();
-                rrev.add(f);
-                this.resolutionsReverse.set(node, rrev);
-            }
-        }
         if (manifest) {
             this.manifests.set(node.id, manifest);
         }
@@ -213,7 +231,7 @@ export class Graph {
      * For different uses that are not a direct top-down traversal of the graph
      * consider using `addNode()` and `addEdge()` instead.
      */
-    placePackage(fromNode, depType, spec, manifest, id) {
+    placePackage(fromNode, depType, spec, manifest, id, extra) {
         // if no manifest is available, then create an edge that has no
         // reference to any other node, representing a missing dependency
         if (!manifest && !id) {
@@ -227,7 +245,7 @@ export class Graph {
                 depType === 'optional' ||
                 depType === 'peerOptional',
         };
-        const depId = id || (manifest && getId(spec, manifest));
+        const depId = id || (manifest && getId(spec, manifest, extra));
         /* c8 ignore start - should not be possible */
         if (!depId) {
             throw error('Could not find dep id when placing package', {
@@ -248,21 +266,51 @@ export class Graph {
             return toFoundNode;
         }
         // creates a new node and edges to its parent
-        const toNode = this.addNode(depId, manifest);
+        const toNode = this.addNode(depId, manifest, spec);
         toNode.registry = spec.registry;
         toNode.dev = flags.dev;
         toNode.optional = flags.optional;
+        toNode.modifier = extra;
+        // add extra manifest info if available
+        if (manifest) {
+            const { bin, engines, os, cpu } = manifest;
+            // add platform info if available
+            if (engines || os || cpu) {
+                const platform = {};
+                if (engines)
+                    platform.engines = engines;
+                if (os)
+                    platform.os = os;
+                if (cpu)
+                    platform.cpu = cpu;
+                toNode.platform = platform;
+            }
+            // add bin info if available
+            if (bin) {
+                toNode.bins = bin;
+            }
+        }
+        toNode.maybeSetConfusedManifest(spec, manifest);
         this.addEdge(depType, spec, fromNode, toNode);
+        // populate resolution cache if applicable
+        const f = getResolutionCacheKey(spec.final, fromNode.location, extra || '');
+        this.resolutions.set(f, toNode);
+        const rrev = this.resolutionsReverse.get(toNode) ?? new Set();
+        rrev.add(f);
+        this.resolutionsReverse.set(toNode, rrev);
         return toNode;
     }
     /**
      * Removes a node and its relevant edges from the graph.
      *
+     * Use the `keepEdges` option to keep the edges that were pointing to
+     * this node and only removes their `to` property value.
+     *
      * If a replacement is provided, then any edges that were previously
      * pointing to the removed node will be directed to the replacement,
      * if it is valid to do so.
      */
-    removeNode(node, replacement) {
+    removeNode(node, replacement, keepEdges) {
         this.nodes.delete(node.id);
         const nbn = this.nodesByName.get(node.name);
         // if it's the last one, just remove the set
@@ -283,12 +331,67 @@ export class Graph {
                 satisfies(replacement.id, edge.spec, edge.from.location, this.projectRoot, this.monorepo)) {
                 edge.to = replacement;
             }
+            else if (keepEdges) {
+                edge.to = undefined;
+            }
             else {
                 edge.from.edgesOut.delete(edge.spec.name);
                 this.edges.delete(edge);
             }
         }
     }
+    /**
+     * Removes the resolved node of a given edge.
+     */
+    removeEdgeResolution(edge, queryModifier = '') {
+        const node = edge.to;
+        const resolutionKey = getResolutionCacheKey(edge.spec, edge.from.location, queryModifier);
+        if (node) {
+            edge.to = undefined;
+            this.resolutions.delete(resolutionKey);
+            this.resolutionsReverse.get(node)?.delete(resolutionKey);
+            this.nodesByName.delete(node.name);
+            node.edgesIn.delete(edge);
+            if (node.edgesIn.size === 0) {
+                this.nodes.delete(node.id);
+            }
+        }
+    }
+    /**
+     * Reset resolution cache data.
+     */
+    resetResolution() {
+        // Clear all cache structures
+        this.resolutions.clear();
+        this.resolutionsReverse.clear();
+        this.nodesByName.clear();
+        // Rebuild nodesByName from all nodes
+        for (const node of this.nodes.values()) {
+            const nbn = this.nodesByName.get(node.name) ?? new Set();
+            nbn.add(node);
+            this.nodesByName.set(node.name, nbn);
+        }
+        // Rebuild resolution caches from all edges that have resolved targets
+        const seenNodes = new Set();
+        for (const edge of this.edges) {
+            const { to: node } = edge;
+            if (!node)
+                continue; // Skip unresolved edges
+            // Only process each node once to avoid duplicate cache entries
+            if (seenNodes.has(node))
+                continue;
+            seenNodes.add(node);
+            // Initialize resolutionsReverse entry for this node if it doesn't exist
+            if (!this.resolutionsReverse.has(node)) {
+                this.resolutionsReverse.set(node, new Set());
+            }
+            // Get the modifier if the node has one associated to it
+            const queryModifier = node.modifier || '';
+            const resolutionKey = getResolutionCacheKey(edge.spec.final, edge.from.location, queryModifier);
+            this.resolutions.set(resolutionKey, node);
+            this.resolutionsReverse.get(node)?.add(resolutionKey);
+        }
+    }
     toJSON() {
         return lockfileData({
             ...this.#options,

package/dist/esm/graph.js.map

@@ -1 +1 @@
-{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../src/graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAA;AAEtD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAC3C,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AAC7C,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AAInC,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AAGnC,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAA;AACjD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAGhC,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAA;AAExD,MAAM,cAAc,GAAG,MAAM,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAA;AAE/D,kEAAkE;AAClE,qEAAqE;AACrE,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAA;AAI/C,MAAM,MAAM,GAAG,CAA0B,CAAK,EAAE,EAAE,CAChD,CAAC,IAAK,IAAI,GAAG,EAAQ,CAAA;AAqBvB,MAAM,OAAO,KAAK;IAChB,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,qBAAqB,CAAA;IAC9B,CAAC;IAED,QAAQ,CAAc;IAEtB,YAAY,CAAa;IAEzB;;OAEG;IACH,QAAQ,CAAW;IAEnB;;OAEG;IACH,SAAS,CAAmB;IAE5B;;OAEG;IACH,KAAK,GAAG,IAAI,GAAG,EAAQ,CAAA;IAEvB;;OAEG;IACH,KAAK,GAAG,IAAI,GAAG,EAAe,CAAA;IAE9B;;OAEG;IACH,WAAW,GAAG,IAAI,GAAG,EAAqB,CAAA;IAE1C;;OAEG;IACH,WAAW,GAAG,IAAI,GAAG,EAAgB,CAAA;IAErC;;OAEG;IACH,kBAAkB,GAAG,IAAI,GAAG,EAAqB,CAAA;IAEjD;;OAEG;IACH,SAAS,GAAG,IAAI,GAAG,EAAQ,CAAA;IAE3B;;OAEG;IACH,YAAY,CAAM;IAElB;;OAEG;IACH,sBAAsB,GAAG,IAAI,GAAG,EAAQ,CAAA;IAExC;;OAEG;IACH,WAAW,CAAQ;IAEnB,YAAY,OAAqB;QAC/B,MAAM,EAAE,YAAY,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAA;QAC1C,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAA;QACvB,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAA;QAC1C,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAA;QACtC,IAAI,CAAC,YAAY,GAAG;YAClB,GAAG,IAAI,CAAC,QAAQ;YAChB,KAAK,EAAE,IAAI;SACZ,CAAA;QAED,4BAA4B;QAC5B,MAAM,oBAAoB,GAAG,GAAG,CAAA;QAChC,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CACjC,YAAY,CAAC,IAAI,IAAI,QAAQ,EAC7B,oBAAoB,CACrB,CAAA;QACD,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,CAC/B,SAAS,EACT,YAAY,EACZ,gBAAgB,CACjB,CAAA;QACD,YAAY,CAAC,mBAAmB,CAAC,oBAAoB,CAAC,CAAA;QACtD,YAAY,CAAC,YAAY,GAAG,IAAI,CAAA;QAChC,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;QAChC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,CAAA;QAChC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,EAAE,YAAY,CAAC,CAAA;QAEjD,0DAA0D;QAC1D,wDAAwD;QACxD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QACxB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CACzB,EAAE,CAAC,EAAE,EACL,EAAE,CAAC,QAAQ,EACX,SAAS,EACT,EAAE,CAAC,IAAI,CACR,CAAA;gBACD,MAAM,CAAC,mBAAmB,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,CAAA;gBAC1C,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;oBACpB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAA;gBAChD,CAAC;gBACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;YAC5B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;;;OAQG;IACH,EAAE;QACA,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAA;QACtB,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,EAAE,CAAA;QACtB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QACtC,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;YACzB,6BAA6B;YAC7B,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YACpB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;YAC3B,KAAK,MAAM,EAAE,EAAE,EAAE,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBAC3C,IAAI,CAAC,EAAE,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,SAAQ;gBACnC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;gBACd,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAA;gBACnB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;YAC3B,CAAC;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAClC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;QACvB,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED;;;;OAIG;IACH,OAAO,CACL,IAAwB,EACxB,IAAU,EACV,IAAc,EACd,EAAa;QAEb,wBAAwB;QACxB,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAC9B,IAAI,EAAE,EAAE,CAAC;gBACP,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,oBAAoB,IAAI,WAAW,CAAA;gBACvD,IAAI,CAAC,IAAI,GAAG,GAAG,EAAE,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAA;YAC3C,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,CACT,oDAAoD,EACpD,EAAE,IAAI,EAAE,CACT,CAAA;YACH,CAAC;QACH,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC7C,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,IAAI,GAAG,QAAgB,CAAA;YAC7B,IACE,IAAI,CAAC,IAAI,KAAK,IAAI;gBAClB,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,EACpC,CAAC;gBACD,IAAI,EAAE,IAAI,EAAE,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;oBACzB,IAAI,CAAC,EAAE,GAAG,EAAU,CAAA;oBACpB,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBAC3B,CAAC;gBACD,OAAO,IAAI,CAAA;YACb,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACzB,CAAC;QACD,MAAM,CAAC,GAAG,IAAY,CAAA;QACtB,MAAM,OAAO,GAAG,CAAC,CAAC,UAAU,CAC1B,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EACtC,IAAI,EACJ,EAAsB,CACvB,CAAA;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QACvB,OAAO,OAAO,CAAA;IAChB,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,IAAU,EAAE,QAAc;QACvC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAA;QACpB,0DAA0D;QAC1D,MAAM,QAAQ,GACZ,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAA;QACpD,MAAM,EAAE,GAAG,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,CAAA;QAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACvC,IAAI,MAAM;YAAE,OAAO,MAAM,CAAA;QACzB,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QACxC,IAAI,CAAC,GAAG;YAAE,OAAO,SAAS,CAAA;QAC1B,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,IACE,SAAS,CACP,IAAI,CAAC,EAAE,EACP,CAAC,EACD,QAAQ,CAAC,QAAQ,EACjB,IAAI,CAAC,WAAW,EAChB,IAAI,CAAC,QAAQ,CACd,EACD,CAAC;gBACD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;gBAC9B,8DAA8D;gBAC9D,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAA;gBAC1C,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,OAAO,CACL,EAAU,EACV,QAAmB,EACnB,IAAW,EACX,IAAa,EACb,OAAgB;QAEhB,MAAM,IAAI,GAAG,IAAI,IAAI,CACnB,IAAI,CAAC,YAAY,EACjB,EAAE,EACF,QAAQ,EACR,IAAI,EACJ,IAAI,EACJ,OAAO,CACR,CAAA;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,CAAA;QACxD,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACb,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QACpC,IAAI,IAAI,EAAE,CAAC;YACT,MAAM,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;YAC5B,wDAAwD;YACxD,oCAAoC;YACpC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBAC/B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAA;gBAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,CAAA;gBAC3D,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;gBACX,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;YACzC,CAAC;QACH,CAAC;QACD,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAA;QACvC,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;;;;;;OAOG;IACH,YAAY,CACV,QAAc,EACd,OAA2B,EAC3B,IAAU,EACV,QAAmB,EACnB,EAAU;QAEV,+DAA+D;QAC/D,iEAAiE;QACjE,IAAI,CAAC,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;YACrB,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAA;YACrC,OAAM;QACR,CAAC;QAED,uDAAuD;QACvD,MAAM,KAAK,GAAG;YACZ,GAAG,EAAE,QAAQ,CAAC,GAAG,IAAI,OAAO,KAAK,KAAK;YACtC,QAAQ,EACN,QAAQ,CAAC,QAAQ;gBACjB,OAAO,KAAK,UAAU;gBACtB,OAAO,KAAK,cAAc;SAC7B,CAAA;QAED,MAAM,KAAK,GAAG,EAAE,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAA;QAEvD,8CAA8C;QAC9C,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,MAAM,KAAK,CAAC,4CAA4C,EAAE;gBACxD,IAAI;gBACJ,QAAQ;aACT,CAAC,CAAA;QACJ,CAAC;QACD,oBAAoB;QAEpB,8DAA8D;QAC9D,0DAA0D;QAC1D,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QACzC,IAAI,WAAW,EAAE,CAAC;YAChB,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAA;YAClD,oEAAoE;YACpE,yDAAyD;YACzD,WAAW,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,CAAA;YAC7B,WAAW,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ,CAAA;YACvC,OAAO,WAAW,CAAA;QACpB,CAAC;QAED,6CAA6C;QAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAA;QAC5C,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC/B,MAAM,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAA;QACtB,MAAM,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAA;QAChC,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAA;QAC7C,OAAO,MAAM,CAAA;IACf,CAAC;IAED;;;;;;OAMG;IACH,UAAU,CAAC,IAAU,EAAE,WAAkB;QACvC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC3C,4CAA4C;QAC5C,IAAI,GAAG,EAAE,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;;YAClD,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,CAAA;QACtB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,EAAE,CAAC;YAC/D,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QAC5B,CAAC;QACD,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACpC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC9B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACzB,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAChC,IACE,WAAW;gBACX,SAAS,CACP,WAAW,CAAC,EAAE,EACd,IAAI,CAAC,IAAI,EACT,IAAI,CAAC,IAAI,CAAC,QAAQ,EAClB,IAAI,CAAC,WAAW,EAChB,IAAI,CAAC,QAAQ,CACd,EACD,CAAC;gBACD,IAAI,CAAC,EAAE,GAAG,WAAW,CAAA;YACvB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACzC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM;QACJ,OAAO,YAAY,CAAC;YAClB,GAAG,IAAI,CAAC,QAAQ;YAChB,KAAK,EAAE,IAAI;YACX,aAAa,EAAE,IAAI;SACpB,CAAC,CAAA;IACJ,CAAC;IAED,CAAC,cAAc,CAAC,CAAC,CAAS,EAAE,OAAuB;QACjD,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAA;QAC1B,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAA;IAChE,CAAC;CACF","sourcesContent":["import { getId, joinDepIDTuple } from '@vltpkg/dep-id'\nimport type { DepID } from '@vltpkg/dep-id'\nimport { error } from '@vltpkg/error-cause'\nimport { satisfies } from '@vltpkg/satisfies'\nimport { Spec } from '@vltpkg/spec'\nimport type { SpecOptions } from '@vltpkg/spec'\nimport type { Manifest, DependencySaveType } from '@vltpkg/types'\nimport type { Monorepo } from '@vltpkg/workspaces'\nimport { inspect } from 'node:util'\nimport type { InspectOptions } from 'node:util'\nimport type { Edge } from './edge.ts'\nimport { lockfileData } from './lockfile/save.ts'\nimport { Node } from './node.ts'\nimport type { NodeOptions } from './node.ts'\nimport type { GraphLike, NodeLike } from './types.ts'\nimport { resolveSaveType } from './resolve-save-type.ts'\n\nconst kCustomInspect = Symbol.for('nodejs.util.inspect.custom')\n\n// this is always the same, but we don't hard code it as a string,\n// in case the DepID module needs to change its delimiter again ever.\nconst mainDepID = joinDepIDTuple(['file', '.'])\n\nexport type ManifestInventory = Map<DepID, Manifest>\n\nconst getMap = <T extends Map<any, any>>(m?: T) =>\n  m ?? (new Map() as T)\n\nexport type GraphOptions = SpecOptions & {\n  /**\n   * The main importer manifest info.\n   */\n  mainManifest: Manifest\n  /**\n   * An inventory of seen manifests.\n   */\n  manifests?: ManifestInventory\n  /**\n   * A {@link Monorepo} object, for managing workspaces\n   */\n  monorepo?: Monorepo\n  /**\n   * Root of the project this graph represents\n   */\n  projectRoot: string\n}\n\nexport class Graph implements GraphLike {\n  get [Symbol.toStringTag]() {\n    return '@vltpkg/graph.Graph'\n  }\n\n  #options: GraphOptions\n\n  #nodeOptions: NodeOptions\n\n  /**\n   * A {@link Monorepo} instance, used for managing workspaces.\n   */\n  monorepo?: Monorepo\n\n  /**\n   * An inventory with all manifests related to an install.\n   */\n  manifests: ManifestInventory\n\n  /**\n   * A set of all edges in this graph.\n   */\n  edges = new Set<Edge>()\n\n  /**\n   * Map registered dep ids to the node that represent them in the graph.\n   */\n  nodes = new Map<DepID, Node>()\n\n  /**\n   * Map of nodes by their name\n   */\n  nodesByName = new Map<string, Set<Node>>()\n\n  /**\n   * Cached resolutions for spec lookups\n   */\n  resolutions = new Map<string, Node>()\n\n  /**\n   * Reverse map of resolutions\n   */\n  resolutionsReverse = new Map<Node, Set<string>>()\n\n  /**\n   * A set of importer nodes in this graph.\n   */\n  importers = new Set<Node>()\n\n  /**\n   * The {@link Node} that represents the project root `package.json`.\n   */\n  mainImporter: Node\n\n  /**\n   * A set of extraneous dependencies found when building the graph.\n   */\n  extraneousDependencies = new Set<Edge>()\n\n  /**\n   * The root of the project this graph represents\n   */\n  projectRoot: string\n\n  constructor(options: GraphOptions) {\n    const { mainManifest, monorepo } = options\n    this.#options = options\n    this.manifests = getMap(options.manifests)\n    this.projectRoot = options.projectRoot\n    this.#nodeOptions = {\n      ...this.#options,\n      graph: this,\n    }\n\n    // add the project root node\n    const mainImporterLocation = '.'\n    const mainImporterSpec = Spec.parse(\n      mainManifest.name || '(root)',\n      mainImporterLocation,\n    )\n    const mainImporter = this.addNode(\n      mainDepID,\n      mainManifest,\n      mainImporterSpec,\n    )\n    mainImporter.setImporterLocation(mainImporterLocation)\n    mainImporter.mainImporter = true\n    this.mainImporter = mainImporter\n    this.importers.add(mainImporter)\n    this.manifests.set(mainImporter.id, mainManifest)\n\n    // uses the monorepo instance in order to retrieve info on\n    // workspaces and create importer nodes for each of them\n    this.monorepo = monorepo\n    if (this.monorepo) {\n      for (const ws of this.monorepo) {\n        const wsNode = this.addNode(\n          ws.id,\n          ws.manifest,\n          undefined,\n          ws.name,\n        )\n        wsNode.setImporterLocation(`./${ws.path}`)\n        if (wsNode.manifest) {\n          this.manifests.set(wsNode.id, wsNode.manifest)\n        }\n        this.importers.add(wsNode)\n      }\n    }\n  }\n\n  /**\n   * Delete all nodes that are unreachable from the importers.\n   * The collection of deleted nodes is returned.\n   *\n   * NOTE: This can be extremely slow for large graphs, and is almost always\n   * unnecessary! Only call when it is known that some unreachable nodes may\n   * have been created, for example when deleting the unneeded subgraph when an\n   * optional node fails to resolve/install.\n   */\n  gc() {\n    const { nodes } = this\n    this.nodes = new Map()\n    const marked = new Set(this.importers)\n    for (const imp of marked) {\n      // don't delete the importer!\n      nodes.delete(imp.id)\n      this.nodes.set(imp.id, imp)\n      for (const { to } of imp.edgesOut.values()) {\n        if (!to || marked.has(to)) continue\n        marked.add(to)\n        nodes.delete(to.id)\n        this.nodes.set(to.id, to)\n      }\n    }\n    for (const node of nodes.values()) {\n      this.removeNode(node)\n    }\n    return nodes\n  }\n\n  /**\n   * Create a new edge between two nodes of the graph in case both exist,\n   * in case the destination node does not exists, then a dangling edge,\n   * pointing to nothing will be created to represent that missing dependency.\n   */\n  addEdge(\n    type: DependencySaveType,\n    spec: Spec,\n    from: NodeLike,\n    to?: NodeLike,\n  ) {\n    // fix any nameless spec\n    if (spec.name === '(unknown)') {\n      if (to) {\n        spec.name = to.name /* c8 ignore next */ || '(unknown)'\n        spec.spec = `${to.name}@${spec.bareSpec}`\n      } else {\n        throw error(\n          'Impossible to place a missing, nameless dependency',\n          { spec },\n        )\n      }\n    }\n    const existing = from.edgesOut.get(spec.name)\n    if (existing) {\n      const edge = existing as Edge\n      if (\n        edge.type === type &&\n        edge.spec.bareSpec === spec.bareSpec\n      ) {\n        if (to && to !== edge.to) {\n          edge.to = to as Node\n          edge.to.edgesIn.add(edge)\n        }\n        return edge\n      }\n      this.edges.delete(edge)\n    }\n    const f = from as Node\n    const edgeOut = f.addEdgesTo(\n      resolveSaveType(from, spec.name, type),\n      spec,\n      to as Node | undefined,\n    )\n    this.edges.add(edgeOut)\n    return edgeOut\n  }\n\n  /**\n   * Find an existing node to satisfy a dependency\n   */\n  findResolution(spec: Spec, fromNode: Node) {\n    const f = spec.final\n    // if it's a file: dep, then the fromNode location matters\n    const fromPref =\n      f.type === 'file' ? fromNode.location + ' : ' : ''\n    const sf = fromPref + String(f)\n    const cached = this.resolutions.get(sf)\n    if (cached) return cached\n    const nbn = this.nodesByName.get(f.name)\n    if (!nbn) return undefined\n    for (const node of nbn) {\n      if (\n        satisfies(\n          node.id,\n          f,\n          fromNode.location,\n          this.projectRoot,\n          this.monorepo,\n        )\n      ) {\n        this.resolutions.set(sf, node)\n        // always set by now, because the node was added at some point\n        this.resolutionsReverse.get(node)?.add(sf)\n        return node\n      }\n    }\n  }\n\n  /**\n   * Create a new node in the graph.\n   */\n  addNode(\n    id?: DepID,\n    manifest?: Manifest,\n    spec?: Spec,\n    name?: string,\n    version?: string,\n  ) {\n    const node = new Node(\n      this.#nodeOptions,\n      id,\n      manifest,\n      spec,\n      name,\n      version,\n    )\n    this.nodes.set(node.id, node)\n    const nbn = this.nodesByName.get(node.name) ?? new Set()\n    nbn.add(node)\n    this.nodesByName.set(node.name, nbn)\n    if (spec) {\n      const f = String(spec.final)\n      // if it's a file: type, then that is fromNode-specific,\n      // so we can't shortcut add it here.\n      if (spec.final.type !== 'file') {\n        this.resolutions.set(f, node)\n        const rrev = this.resolutionsReverse.get(node) ?? new Set()\n        rrev.add(f)\n        this.resolutionsReverse.set(node, rrev)\n      }\n    }\n    if (manifest) {\n      this.manifests.set(node.id, manifest)\n    }\n    return node\n  }\n\n  /**\n   * Place a new package into the graph representation, creating the new\n   * edges and possibly new nodes that are to be expected when traversing\n   * the graph in a top-down direction, e.g: from importers to leafs.\n   *\n   * For different uses that are not a direct top-down traversal of the graph\n   * consider using `addNode()` and `addEdge()` instead.\n   */\n  placePackage(\n    fromNode: Node,\n    depType: DependencySaveType,\n    spec: Spec,\n    manifest?: Manifest,\n    id?: DepID,\n  ) {\n    // if no manifest is available, then create an edge that has no\n    // reference to any other node, representing a missing dependency\n    if (!manifest && !id) {\n      this.addEdge(depType, spec, fromNode)\n      return\n    }\n\n    // flags set on the node we're about to create or find.\n    const flags = {\n      dev: fromNode.dev || depType === 'dev',\n      optional:\n        fromNode.optional ||\n        depType === 'optional' ||\n        depType === 'peerOptional',\n    }\n\n    const depId = id || (manifest && getId(spec, manifest))\n\n    /* c8 ignore start - should not be possible */\n    if (!depId) {\n      throw error('Could not find dep id when placing package', {\n        spec,\n        manifest,\n      })\n    }\n    /* c8 ignore stop */\n\n    // if a node for this package is already represented by a node\n    // in the graph, then just creates a new edge to that node\n    const toFoundNode = this.nodes.get(depId)\n    if (toFoundNode) {\n      this.addEdge(depType, spec, fromNode, toFoundNode)\n      // the current only stays dev/optional if this dep lets it remain so\n      // if it's not already, we don't make it dev or optional.\n      toFoundNode.dev &&= flags.dev\n      toFoundNode.optional &&= flags.optional\n      return toFoundNode\n    }\n\n    // creates a new node and edges to its parent\n    const toNode = this.addNode(depId, manifest)\n    toNode.registry = spec.registry\n    toNode.dev = flags.dev\n    toNode.optional = flags.optional\n    this.addEdge(depType, spec, fromNode, toNode)\n    return toNode\n  }\n\n  /**\n   * Removes a node and its relevant edges from the graph.\n   *\n   * If a replacement is provided, then any edges that were previously\n   * pointing to the removed node will be directed to the replacement,\n   * if it is valid to do so.\n   */\n  removeNode(node: Node, replacement?: Node) {\n    this.nodes.delete(node.id)\n    const nbn = this.nodesByName.get(node.name)\n    // if it's the last one, just remove the set\n    if (nbn?.size === 1) this.nodesByName.delete(node.name)\n    else nbn?.delete(node)\n    for (const r of this.resolutionsReverse.get(node) ?? new Set()) {\n      this.resolutions.delete(r)\n    }\n    this.resolutionsReverse.delete(node)\n    this.manifests.delete(node.id)\n    for (const edge of node.edgesOut.values()) {\n      this.edges.delete(edge)\n    }\n    for (const edge of node.edgesIn) {\n      if (\n        replacement &&\n        satisfies(\n          replacement.id,\n          edge.spec,\n          edge.from.location,\n          this.projectRoot,\n          this.monorepo,\n        )\n      ) {\n        edge.to = replacement\n      } else {\n        edge.from.edgesOut.delete(edge.spec.name)\n        this.edges.delete(edge)\n      }\n    }\n  }\n\n  toJSON() {\n    return lockfileData({\n      ...this.#options,\n      graph: this,\n      saveManifests: true,\n    })\n  }\n\n  [kCustomInspect](_: number, options: InspectOptions) {\n    const data = this.toJSON()\n    return `${this[Symbol.toStringTag]} ${inspect(data, options)}`\n  }\n}\n"]}
+{"version":3,"file":"graph.js","sourceRoot":"","sources":["../../src/graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,cAAc,EAAE,MAAM,gBAAgB,CAAA;AAEtD,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAC3C,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AAC7C,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AASnC,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AAEnC,OAAO,EAAE,YAAY,EAAE,MAAM,oBAAoB,CAAA;AACjD,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAChC,OAAO,EAAE,IAAI,EAAE,MAAM,WAAW,CAAA;AAEhC,OAAO,EAAE,eAAe,EAAE,MAAM,wBAAwB,CAAA;AAExD,MAAM,cAAc,GAAG,MAAM,CAAC,GAAG,CAAC,4BAA4B,CAAC,CAAA;AAE/D,MAAM,iBAAiB,GAAG,GAAG,CAAA;AAE7B,kEAAkE;AAClE,qEAAqE;AACrE,MAAM,SAAS,GAAG,cAAc,CAAC,CAAC,MAAM,EAAE,GAAG,CAAC,CAAC,CAAA;AAI/C,MAAM,MAAM,GAAG,CAA0B,CAAK,EAAE,EAAE,CAChD,CAAC,IAAK,IAAI,GAAG,EAAQ,CAAA;AAEvB;;;GAGG;AACH,MAAM,qBAAqB,GAAG,CAC5B,IAAU,EACV,QAAgB,EAChB,aAAqB,EACb,EAAE;IACV,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAA;IACpB,0DAA0D;IAC1D,MAAM,UAAU,GAAG,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,QAAQ,GAAG,KAAK,CAAC,CAAC,CAAC,EAAE,CAAA;IAC5D,mEAAmE;IACnE,2DAA2D;IAC3D,MAAM,gBAAgB,GACpB,CAAC,CAAC,QAAQ,CAAC,CAAC;QACV,GAAG,iBAAiB,UAAU;YAC9B,GAAG,iBAAiB,GAAG,CAAC,CAAC,QAAQ,EAAE;QACrC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;YACb,GAAG,iBAAiB,KAAK,GAAG,GAAG,iBAAiB,GAAG,CAAC,CAAC,SAAS,EAAE;YAClE,CAAC,CAAC,GAAG,iBAAiB,GAAG,CAAC,CAAC,IAAI,EAAE,CAAA;IACnC,MAAM,cAAc,GAAG,GAAG,iBAAiB,GAAG,aAAa,EAAE,CAAA;IAC7D,OAAO,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,gBAAgB,GAAG,cAAc,CAAA;AACnE,CAAC,CAAA;AAqBD,MAAM,OAAO,KAAK;IAChB,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC;QACtB,OAAO,qBAAqB,CAAA;IAC9B,CAAC;IAED,QAAQ,CAAc;IAEtB,YAAY,CAAa;IAEzB;;OAEG;IACH,QAAQ,CAAW;IAEnB;;OAEG;IACH,SAAS,CAAmB;IAE5B;;OAEG;IACH,KAAK,GAAG,IAAI,GAAG,EAAQ,CAAA;IAEvB;;OAEG;IACH,KAAK,GAAG,IAAI,GAAG,EAAe,CAAA;IAE9B;;OAEG;IACH,WAAW,GAAG,IAAI,GAAG,EAAqB,CAAA;IAE1C;;OAEG;IACH,WAAW,GAAG,IAAI,GAAG,EAAgB,CAAA;IAErC;;OAEG;IACH,kBAAkB,GAAG,IAAI,GAAG,EAAqB,CAAA;IAEjD;;OAEG;IACH,SAAS,GAAG,IAAI,GAAG,EAAQ,CAAA;IAE3B;;OAEG;IACH,YAAY,CAAM;IAElB;;OAEG;IACH,sBAAsB,GAAG,IAAI,GAAG,EAAQ,CAAA;IAExC;;OAEG;IACH,WAAW,CAAQ;IAEnB,YAAY,OAAqB;QAC/B,MAAM,EAAE,YAAY,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAA;QAC1C,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAA;QACvB,IAAI,CAAC,SAAS,GAAG,MAAM,CAAC,OAAO,CAAC,SAAS,CAAC,CAAA;QAC1C,IAAI,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAA;QACtC,IAAI,CAAC,YAAY,GAAG;YAClB,GAAG,IAAI,CAAC,QAAQ;YAChB,KAAK,EAAE,IAAI;SACZ,CAAA;QAED,4BAA4B;QAC5B,MAAM,oBAAoB,GAAG,GAAG,CAAA;QAChC,MAAM,gBAAgB,GAAG,IAAI,CAAC,KAAK,CACjC,YAAY,CAAC,IAAI,IAAI,QAAQ,EAC7B,oBAAoB,CACrB,CAAA;QACD,MAAM,YAAY,GAAG,IAAI,CAAC,OAAO,CAC/B,SAAS,EACT,YAAY,EACZ,gBAAgB,CACjB,CAAA;QACD,YAAY,CAAC,mBAAmB,CAAC,oBAAoB,CAAC,CAAA;QACtD,YAAY,CAAC,YAAY,GAAG,IAAI,CAAA;QAChC,IAAI,CAAC,YAAY,GAAG,YAAY,CAAA;QAChC,IAAI,CAAC,YAAY,CAAC,UAAU,GAAG,IAAI,GAAG,EAAE,CAAA;QACxC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,CAAA;QAChC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,YAAY,CAAC,EAAE,EAAE,YAAY,CAAC,CAAA;QAEjD,0DAA0D;QAC1D,wDAAwD;QACxD,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAA;QACxB,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;YAClB,KAAK,MAAM,EAAE,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAC;gBAC/B,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CACzB,EAAE,CAAC,EAAE,EACL,EAAE,CAAC,QAAQ,EACX,SAAS,EACT,EAAE,CAAC,IAAI,CACR,CAAA;gBACD,MAAM,CAAC,mBAAmB,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,CAAA;gBAC1C,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;oBACpB,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAA;gBAChD,CAAC;gBACD,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAA;gBAC1B,oEAAoE;gBACpE,MAAM,IAAI,GAAG,IAAI,IAAI,CACnB,MAAM,EACN,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,EAAE,aAAa,EAAE,IAAI,CAAC,QAAQ,CAAC,EACrD,IAAI,CAAC,YAAY,EACjB,MAAM,CACP,CAAA;gBACD,IAAI,CAAC,YAAY,CAAC,UAAU,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;YACrD,CAAC;QACH,CAAC;IACH,CAAC;IAED;;;;;;;;OAQG;IACH,EAAE;QACA,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAA;QACtB,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAA;QAClB,IAAI,CAAC,KAAK,GAAG,IAAI,GAAG,EAAE,CAAA;QACtB,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAA;QACtC,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;YACzB,6BAA6B;YAC7B,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;YACpB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAA;YAC3B,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;gBACzC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBACpB,MAAM,EAAE,EAAE,EAAE,GAAG,IAAI,CAAA;gBACnB,IAAI,CAAC,EAAE,IAAI,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;oBAAE,SAAQ;gBACnC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;gBACd,KAAK,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAA;gBACnB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC,CAAA;YAC3B,CAAC;QACH,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAClC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;QACvB,CAAC;QACD,OAAO,KAAK,CAAA;IACd,CAAC;IAED;;;;OAIG;IACH,OAAO,CACL,IAAwB,EACxB,IAAU,EACV,IAAc,EACd,EAAa;QAEb,wBAAwB;QACxB,IAAI,IAAI,CAAC,IAAI,KAAK,WAAW,EAAE,CAAC;YAC9B,IAAI,EAAE,EAAE,CAAC;gBACP,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC,IAAI,CAAC,oBAAoB,IAAI,WAAW,CAAA;gBACvD,IAAI,CAAC,IAAI,GAAG,GAAG,EAAE,CAAC,IAAI,IAAI,IAAI,CAAC,QAAQ,EAAE,CAAA;YAC3C,CAAC;iBAAM,CAAC;gBACN,MAAM,KAAK,CACT,oDAAoD,EACpD,EAAE,IAAI,EAAE,CACT,CAAA;YACH,CAAC;QACH,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC7C,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,IAAI,GAAG,QAAgB,CAAA;YAC7B,IACE,IAAI,CAAC,IAAI,KAAK,IAAI;gBAClB,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,IAAI,CAAC,QAAQ,EACpC,CAAC;gBACD,IAAI,EAAE,IAAI,EAAE,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC;oBACzB,qDAAqD;oBACrD,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;oBAC7B,0CAA0C;oBAC1C,IAAI,CAAC,EAAE,GAAG,EAAU,CAAA;oBACpB,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gBAC3B,CAAC;gBACD,OAAO,IAAI,CAAA;YACb,CAAC;YACD,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACzB,CAAC;QACD,MAAM,CAAC,GAAG,IAAY,CAAA;QACtB,MAAM,OAAO,GAAG,CAAC,CAAC,UAAU,CAC1B,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,EACtC,IAAI,EACJ,EAAsB,CACvB,CAAA;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,OAAO,CAAC,CAAA;QACvB,OAAO,OAAO,CAAA;IAChB,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,IAAU,EAAE,QAAc,EAAE,aAAa,GAAG,EAAE;QAC3D,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAA;QACpB,MAAM,EAAE,GAAG,qBAAqB,CAC9B,CAAC,EACD,QAAQ,CAAC,QAAQ,EACjB,aAAa,CACd,CAAA;QACD,MAAM,MAAM,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,CAAC,CAAA;QACvC,IAAI,MAAM;YAAE,OAAO,MAAM,CAAA;QACzB,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;QACxC,IAAI,CAAC,GAAG;YAAE,OAAO,SAAS,CAAA;QAC1B,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;YACvB,IACE,SAAS,CACP,IAAI,CAAC,EAAE,EACP,CAAC,EACD,QAAQ,CAAC,QAAQ,EACjB,IAAI,CAAC,WAAW,EAChB,IAAI,CAAC,QAAQ,CACd,EACD,CAAC;gBACD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;gBAC9B,8DAA8D;gBAC9D,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,CAAA;gBAC1C,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,OAAO,CACL,EAAU,EACV,QAA6B,EAC7B,IAAW,EACX,IAAa,EACb,OAAgB;QAEhB,MAAM,IAAI,GAAG,IAAI,IAAI,CACnB,IAAI,CAAC,YAAY,EACjB,EAAE,EACF,QAAQ,EACR,IAAI,EACJ,IAAI,EACJ,OAAO,CACR,CAAA;QACD,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAA;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,CAAA;QACxD,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACb,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QACpC,IAAI,QAAQ,EAAE,CAAC;YACb,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAA;QACvC,CAAC;QACD,OAAO,IAAI,CAAA;IACb,CAAC;IAED;;;;;;;OAOG;IACH,YAAY,CACV,QAAc,EACd,OAA2B,EAC3B,IAAU,EACV,QAA6B,EAC7B,EAAU,EACV,KAAc;QAEd,+DAA+D;QAC/D,iEAAiE;QACjE,IAAI,CAAC,QAAQ,IAAI,CAAC,EAAE,EAAE,CAAC;YACrB,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,CAAC,CAAA;YACrC,OAAM;QACR,CAAC;QAED,uDAAuD;QACvD,MAAM,KAAK,GAAG;YACZ,GAAG,EAAE,QAAQ,CAAC,GAAG,IAAI,OAAO,KAAK,KAAK;YACtC,QAAQ,EACN,QAAQ,CAAC,QAAQ;gBACjB,OAAO,KAAK,UAAU;gBACtB,OAAO,KAAK,cAAc;SAC7B,CAAA;QAED,MAAM,KAAK,GAAG,EAAE,IAAI,CAAC,QAAQ,IAAI,KAAK,CAAC,IAAI,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC,CAAA;QAE9D,8CAA8C;QAC9C,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,MAAM,KAAK,CAAC,4CAA4C,EAAE;gBACxD,IAAI;gBACJ,QAAQ;aACT,CAAC,CAAA;QACJ,CAAC;QACD,oBAAoB;QAEpB,8DAA8D;QAC9D,0DAA0D;QAC1D,MAAM,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QACzC,IAAI,WAAW,EAAE,CAAC;YAChB,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,WAAW,CAAC,CAAA;YAClD,oEAAoE;YACpE,yDAAyD;YACzD,WAAW,CAAC,GAAG,KAAK,KAAK,CAAC,GAAG,CAAA;YAC7B,WAAW,CAAC,QAAQ,KAAK,KAAK,CAAC,QAAQ,CAAA;YACvC,OAAO,WAAW,CAAA;QACpB,CAAC;QAED,6CAA6C;QAC7C,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,QAAQ,EAAE,IAAI,CAAC,CAAA;QAClD,MAAM,CAAC,QAAQ,GAAG,IAAI,CAAC,QAAQ,CAAA;QAC/B,MAAM,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAA;QACtB,MAAM,CAAC,QAAQ,GAAG,KAAK,CAAC,QAAQ,CAAA;QAChC,MAAM,CAAC,QAAQ,GAAG,KAAK,CAAA;QAEvB,uCAAuC;QACvC,IAAI,QAAQ,EAAE,CAAC;YACb,MAAM,EAAE,GAAG,EAAE,OAAO,EAAE,EAAE,EAAE,GAAG,EAAE,GAAG,QAAQ,CAAA;YAC1C,iCAAiC;YACjC,IAAI,OAAO,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC;gBACzB,MAAM,QAAQ,GAAyB,EAAE,CAAA;gBACzC,IAAI,OAAO;oBAAE,QAAQ,CAAC,OAAO,GAAG,OAAO,CAAA;gBACvC,IAAI,EAAE;oBAAE,QAAQ,CAAC,EAAE,GAAG,EAAE,CAAA;gBACxB,IAAI,GAAG;oBAAE,QAAQ,CAAC,GAAG,GAAG,GAAG,CAAA;gBAC3B,MAAM,CAAC,QAAQ,GAAG,QAAQ,CAAA;YAC5B,CAAC;YACD,4BAA4B;YAC5B,IAAI,GAAG,EAAE,CAAC;gBACR,MAAM,CAAC,IAAI,GAAG,GAAG,CAAA;YACnB,CAAC;QACH,CAAC;QACD,MAAM,CAAC,wBAAwB,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;QAE/C,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,IAAI,EAAE,QAAQ,EAAE,MAAM,CAAC,CAAA;QAE7C,0CAA0C;QAC1C,MAAM,CAAC,GAAG,qBAAqB,CAC7B,IAAI,CAAC,KAAK,EACV,QAAQ,CAAC,QAAQ,EACjB,KAAK,IAAI,EAAE,CACZ,CAAA;QACD,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,EAAE,MAAM,CAAC,CAAA;QAC/B,MAAM,IAAI,GAAG,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,IAAI,GAAG,EAAE,CAAA;QAC7D,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAA;QACX,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAA;QAEzC,OAAO,MAAM,CAAA;IACf,CAAC;IAED;;;;;;;;;OASG;IACH,UAAU,CAAC,IAAU,EAAE,WAAkB,EAAE,SAAmB;QAC5D,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC1B,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC3C,4CAA4C;QAC5C,IAAI,GAAG,EAAE,IAAI,KAAK,CAAC;YAAE,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;;YAClD,GAAG,EAAE,MAAM,CAAC,IAAI,CAAC,CAAA;QACtB,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,EAAE,CAAC;YAC/D,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,CAAA;QAC5B,CAAC;QACD,IAAI,CAAC,kBAAkB,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACpC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;QAC9B,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC1C,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACzB,CAAC;QACD,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAChC,IACE,WAAW;gBACX,SAAS,CACP,WAAW,CAAC,EAAE,EACd,IAAI,CAAC,IAAI,EACT,IAAI,CAAC,IAAI,CAAC,QAAQ,EAClB,IAAI,CAAC,WAAW,EAChB,IAAI,CAAC,QAAQ,CACd,EACD,CAAC;gBACD,IAAI,CAAC,EAAE,GAAG,WAAW,CAAA;YACvB,CAAC;iBAAM,IAAI,SAAS,EAAE,CAAC;gBACrB,IAAI,CAAC,EAAE,GAAG,SAAS,CAAA;YACrB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBACzC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YACzB,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,oBAAoB,CAAC,IAAU,EAAE,aAAa,GAAG,EAAE;QACjD,MAAM,IAAI,GAAG,IAAI,CAAC,EAAE,CAAA;QACpB,MAAM,aAAa,GAAG,qBAAqB,CACzC,IAAI,CAAC,IAAI,EACT,IAAI,CAAC,IAAI,CAAC,QAAQ,EAClB,aAAa,CACd,CAAA;QACD,IAAI,IAAI,EAAE,CAAC;YACT,IAAI,CAAC,EAAE,GAAG,SAAS,CAAA;YACnB,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,aAAa,CAAC,CAAA;YACtC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,aAAa,CAAC,CAAA;YACxD,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAClC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YACzB,IAAI,IAAI,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;gBAC5B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;YAC5B,CAAC;QACH,CAAC;IACH,CAAC;IAED;;OAEG;IACH,eAAe;QACb,6BAA6B;QAC7B,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAA;QACxB,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,CAAA;QAC/B,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,CAAA;QAExB,qCAAqC;QACrC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YACvC,MAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,GAAG,EAAE,CAAA;YACxD,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YACb,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAA;QACtC,CAAC;QAED,sEAAsE;QACtE,MAAM,SAAS,GAAG,IAAI,GAAG,EAAQ,CAAA;QACjC,KAAK,MAAM,IAAI,IAAI,IAAI,CAAC,KAAK,EAAE,CAAC;YAC9B,MAAM,EAAE,EAAE,EAAE,IAAI,EAAE,GAAG,IAAI,CAAA;YACzB,IAAI,CAAC,IAAI;gBAAE,SAAQ,CAAC,wBAAwB;YAE5C,+DAA+D;YAC/D,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC;gBAAE,SAAQ;YACjC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YAEnB,wEAAwE;YACxE,IAAI,CAAC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACvC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,GAAG,EAAE,CAAC,CAAA;YAC9C,CAAC;YAED,wDAAwD;YACxD,MAAM,aAAa,GAAG,IAAI,CAAC,QAAQ,IAAI,EAAE,CAAA;YACzC,MAAM,aAAa,GAAG,qBAAqB,CACzC,IAAI,CAAC,IAAI,CAAC,KAAK,EACf,IAAI,CAAC,IAAI,CAAC,QAAQ,EAClB,aAAa,CACd,CAAA;YAED,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,aAAa,EAAE,IAAI,CAAC,CAAA;YACzC,IAAI,CAAC,kBAAkB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,aAAa,CAAC,CAAA;QACvD,CAAC;IACH,CAAC;IAED,MAAM;QACJ,OAAO,YAAY,CAAC;YAClB,GAAG,IAAI,CAAC,QAAQ;YAChB,KAAK,EAAE,IAAI;YACX,aAAa,EAAE,IAAI;SACpB,CAAC,CAAA;IACJ,CAAC;IAED,CAAC,cAAc,CAAC,CAAC,CAAS,EAAE,OAAuB;QACjD,MAAM,IAAI,GAAG,IAAI,CAAC,MAAM,EAAE,CAAA;QAC1B,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,CAAA;IAChE,CAAC;CACF","sourcesContent":["import { getId, joinDepIDTuple } from '@vltpkg/dep-id'\nimport type { DepID } from '@vltpkg/dep-id'\nimport { error } from '@vltpkg/error-cause'\nimport { satisfies } from '@vltpkg/satisfies'\nimport { Spec } from '@vltpkg/spec'\nimport type { SpecOptions } from '@vltpkg/spec'\nimport type {\n  GraphLike,\n  NodeLike,\n  NormalizedManifest,\n  DependencySaveType,\n} from '@vltpkg/types'\nimport type { Monorepo } from '@vltpkg/workspaces'\nimport { inspect } from 'node:util'\nimport type { InspectOptions } from 'node:util'\nimport { lockfileData } from './lockfile/save.ts'\nimport { Edge } from './edge.ts'\nimport { Node } from './node.ts'\nimport type { NodeOptions } from './node.ts'\nimport { resolveSaveType } from './resolve-save-type.ts'\n\nconst kCustomInspect = Symbol.for('nodejs.util.inspect.custom')\n\nconst cacheKeySeparator = '│'\n\n// this is always the same, but we don't hard code it as a string,\n// in case the DepID module needs to change its delimiter again ever.\nconst mainDepID = joinDepIDTuple(['file', '.'])\n\nexport type ManifestInventory = Map<DepID, NormalizedManifest>\n\nconst getMap = <T extends Map<any, any>>(m?: T) =>\n  m ?? (new Map() as T)\n\n/**\n * Get a cache key for a resolution based on the\n * spec, location and query modifier.\n */\nconst getResolutionCacheKey = (\n  spec: Spec,\n  location: string,\n  queryModifier: string,\n): string => {\n  const f = spec.final\n  // if it's a file: dep, then the fromNode location matters\n  const fromPrefix = f.type === 'file' ? location + ' : ' : ''\n  // the unique key should also precise what is the type of the spec,\n  // and in the case of a registry, what registry it is from.\n  const typePrecisionKey =\n    f.registry ?\n      `${cacheKeySeparator}registry` +\n      `${cacheKeySeparator}${f.registry}`\n    : f.gitRemote ?\n      `${cacheKeySeparator}git` + `${cacheKeySeparator}${f.gitRemote}`\n    : `${cacheKeySeparator}${f.type}`\n  const modifierSuffix = `${cacheKeySeparator}${queryModifier}`\n  return fromPrefix + String(f) + typePrecisionKey + modifierSuffix\n}\n\nexport type GraphOptions = SpecOptions & {\n  /**\n   * The main importer manifest info.\n   */\n  mainManifest: NormalizedManifest\n  /**\n   * An inventory of seen manifests.\n   */\n  manifests?: ManifestInventory\n  /**\n   * A {@link Monorepo} object, for managing workspaces\n   */\n  monorepo?: Monorepo\n  /**\n   * Root of the project this graph represents\n   */\n  projectRoot: string\n}\n\nexport class Graph implements GraphLike {\n  get [Symbol.toStringTag]() {\n    return '@vltpkg/graph.Graph'\n  }\n\n  #options: GraphOptions\n\n  #nodeOptions: NodeOptions\n\n  /**\n   * A {@link Monorepo} instance, used for managing workspaces.\n   */\n  monorepo?: Monorepo\n\n  /**\n   * An inventory with all manifests related to an install.\n   */\n  manifests: ManifestInventory\n\n  /**\n   * A set of all edges in this graph.\n   */\n  edges = new Set<Edge>()\n\n  /**\n   * Map registered dep ids to the node that represent them in the graph.\n   */\n  nodes = new Map<DepID, Node>()\n\n  /**\n   * Map of nodes by their name\n   */\n  nodesByName = new Map<string, Set<Node>>()\n\n  /**\n   * Cached resolutions for spec lookups\n   */\n  resolutions = new Map<string, Node>()\n\n  /**\n   * Reverse map of resolutions\n   */\n  resolutionsReverse = new Map<Node, Set<string>>()\n\n  /**\n   * A set of importer nodes in this graph.\n   */\n  importers = new Set<Node>()\n\n  /**\n   * The {@link Node} that represents the project root `package.json`.\n   */\n  mainImporter: Node\n\n  /**\n   * A set of extraneous dependencies found when building the graph.\n   */\n  extraneousDependencies = new Set<Edge>()\n\n  /**\n   * The root of the project this graph represents\n   */\n  projectRoot: string\n\n  constructor(options: GraphOptions) {\n    const { mainManifest, monorepo } = options\n    this.#options = options\n    this.manifests = getMap(options.manifests)\n    this.projectRoot = options.projectRoot\n    this.#nodeOptions = {\n      ...this.#options,\n      graph: this,\n    }\n\n    // add the project root node\n    const mainImporterLocation = '.'\n    const mainImporterSpec = Spec.parse(\n      mainManifest.name || '(root)',\n      mainImporterLocation,\n    )\n    const mainImporter = this.addNode(\n      mainDepID,\n      mainManifest,\n      mainImporterSpec,\n    )\n    mainImporter.setImporterLocation(mainImporterLocation)\n    mainImporter.mainImporter = true\n    this.mainImporter = mainImporter\n    this.mainImporter.workspaces = new Map()\n    this.importers.add(mainImporter)\n    this.manifests.set(mainImporter.id, mainManifest)\n\n    // uses the monorepo instance in order to retrieve info on\n    // workspaces and create importer nodes for each of them\n    this.monorepo = monorepo\n    if (this.monorepo) {\n      for (const ws of this.monorepo) {\n        const wsNode = this.addNode(\n          ws.id,\n          ws.manifest,\n          undefined,\n          ws.name,\n        )\n        wsNode.setImporterLocation(`./${ws.path}`)\n        if (wsNode.manifest) {\n          this.manifests.set(wsNode.id, wsNode.manifest)\n        }\n        this.importers.add(wsNode)\n        // creates a virtual edge to connect the workspaces to the root node\n        const edge = new Edge(\n          'prod',\n          Spec.parse(wsNode.name, 'workspace:*', this.#options),\n          this.mainImporter,\n          wsNode,\n        )\n        this.mainImporter.workspaces.set(wsNode.name, edge)\n      }\n    }\n  }\n\n  /**\n   * Delete all nodes and edges that are unreachable from the importers.\n   * The collection of deleted nodes is returned.\n   *\n   * NOTE: This can be extremely slow for large graphs, and is almost always\n   * unnecessary! Only call when it is known that some unreachable nodes may\n   * have been created, for example when deleting the unneeded subgraph when an\n   * optional node fails to resolve/install.\n   */\n  gc() {\n    const { nodes } = this\n    this.edges.clear()\n    this.nodes = new Map()\n    const marked = new Set(this.importers)\n    for (const imp of marked) {\n      // don't delete the importer!\n      nodes.delete(imp.id)\n      this.nodes.set(imp.id, imp)\n      for (const edge of imp.edgesOut.values()) {\n        this.edges.add(edge)\n        const { to } = edge\n        if (!to || marked.has(to)) continue\n        marked.add(to)\n        nodes.delete(to.id)\n        this.nodes.set(to.id, to)\n      }\n    }\n    for (const node of nodes.values()) {\n      this.removeNode(node)\n    }\n    return nodes\n  }\n\n  /**\n   * Create a new edge between two nodes of the graph in case both exist,\n   * in case the destination node does not exists, then a dangling edge,\n   * pointing to nothing will be created to represent that missing dependency.\n   */\n  addEdge(\n    type: DependencySaveType,\n    spec: Spec,\n    from: NodeLike,\n    to?: NodeLike,\n  ) {\n    // fix any nameless spec\n    if (spec.name === '(unknown)') {\n      if (to) {\n        spec.name = to.name /* c8 ignore next */ || '(unknown)'\n        spec.spec = `${to.name}@${spec.bareSpec}`\n      } else {\n        throw error(\n          'Impossible to place a missing, nameless dependency',\n          { spec },\n        )\n      }\n    }\n    const existing = from.edgesOut.get(spec.name)\n    if (existing) {\n      const edge = existing as Edge\n      if (\n        edge.type === type &&\n        edge.spec.bareSpec === spec.bareSpec\n      ) {\n        if (to && to !== edge.to) {\n          // removes this edge from its destination edgesIn ref\n          edge.to?.edgesIn.delete(edge)\n          // now swap the destination to the new one\n          edge.to = to as Node\n          edge.to.edgesIn.add(edge)\n        }\n        return edge\n      }\n      this.edges.delete(edge)\n    }\n    const f = from as Node\n    const edgeOut = f.addEdgesTo(\n      resolveSaveType(from, spec.name, type),\n      spec,\n      to as Node | undefined,\n    )\n    this.edges.add(edgeOut)\n    return edgeOut\n  }\n\n  /**\n   * Find an existing node to satisfy a dependency\n   */\n  findResolution(spec: Spec, fromNode: Node, queryModifier = '') {\n    const f = spec.final\n    const sf = getResolutionCacheKey(\n      f,\n      fromNode.location,\n      queryModifier,\n    )\n    const cached = this.resolutions.get(sf)\n    if (cached) return cached\n    const nbn = this.nodesByName.get(f.name)\n    if (!nbn) return undefined\n    for (const node of nbn) {\n      if (\n        satisfies(\n          node.id,\n          f,\n          fromNode.location,\n          this.projectRoot,\n          this.monorepo,\n        )\n      ) {\n        this.resolutions.set(sf, node)\n        // always set by now, because the node was added at some point\n        this.resolutionsReverse.get(node)?.add(sf)\n        return node\n      }\n    }\n  }\n\n  /**\n   * Create a new node in the graph.\n   */\n  addNode(\n    id?: DepID,\n    manifest?: NormalizedManifest,\n    spec?: Spec,\n    name?: string,\n    version?: string,\n  ) {\n    const node = new Node(\n      this.#nodeOptions,\n      id,\n      manifest,\n      spec,\n      name,\n      version,\n    )\n    this.nodes.set(node.id, node)\n    const nbn = this.nodesByName.get(node.name) ?? new Set()\n    nbn.add(node)\n    this.nodesByName.set(node.name, nbn)\n    if (manifest) {\n      this.manifests.set(node.id, manifest)\n    }\n    return node\n  }\n\n  /**\n   * Place a new package into the graph representation, creating the new\n   * edges and possibly new nodes that are to be expected when traversing\n   * the graph in a top-down direction, e.g: from importers to leafs.\n   *\n   * For different uses that are not a direct top-down traversal of the graph\n   * consider using `addNode()` and `addEdge()` instead.\n   */\n  placePackage(\n    fromNode: Node,\n    depType: DependencySaveType,\n    spec: Spec,\n    manifest?: NormalizedManifest,\n    id?: DepID,\n    extra?: string,\n  ): Node | undefined {\n    // if no manifest is available, then create an edge that has no\n    // reference to any other node, representing a missing dependency\n    if (!manifest && !id) {\n      this.addEdge(depType, spec, fromNode)\n      return\n    }\n\n    // flags set on the node we're about to create or find.\n    const flags = {\n      dev: fromNode.dev || depType === 'dev',\n      optional:\n        fromNode.optional ||\n        depType === 'optional' ||\n        depType === 'peerOptional',\n    }\n\n    const depId = id || (manifest && getId(spec, manifest, extra))\n\n    /* c8 ignore start - should not be possible */\n    if (!depId) {\n      throw error('Could not find dep id when placing package', {\n        spec,\n        manifest,\n      })\n    }\n    /* c8 ignore stop */\n\n    // if a node for this package is already represented by a node\n    // in the graph, then just creates a new edge to that node\n    const toFoundNode = this.nodes.get(depId)\n    if (toFoundNode) {\n      this.addEdge(depType, spec, fromNode, toFoundNode)\n      // the current only stays dev/optional if this dep lets it remain so\n      // if it's not already, we don't make it dev or optional.\n      toFoundNode.dev &&= flags.dev\n      toFoundNode.optional &&= flags.optional\n      return toFoundNode\n    }\n\n    // creates a new node and edges to its parent\n    const toNode = this.addNode(depId, manifest, spec)\n    toNode.registry = spec.registry\n    toNode.dev = flags.dev\n    toNode.optional = flags.optional\n    toNode.modifier = extra\n\n    // add extra manifest info if available\n    if (manifest) {\n      const { bin, engines, os, cpu } = manifest\n      // add platform info if available\n      if (engines || os || cpu) {\n        const platform: NodeLike['platform'] = {}\n        if (engines) platform.engines = engines\n        if (os) platform.os = os\n        if (cpu) platform.cpu = cpu\n        toNode.platform = platform\n      }\n      // add bin info if available\n      if (bin) {\n        toNode.bins = bin\n      }\n    }\n    toNode.maybeSetConfusedManifest(spec, manifest)\n\n    this.addEdge(depType, spec, fromNode, toNode)\n\n    // populate resolution cache if applicable\n    const f = getResolutionCacheKey(\n      spec.final,\n      fromNode.location,\n      extra || '',\n    )\n    this.resolutions.set(f, toNode)\n    const rrev = this.resolutionsReverse.get(toNode) ?? new Set()\n    rrev.add(f)\n    this.resolutionsReverse.set(toNode, rrev)\n\n    return toNode\n  }\n\n  /**\n   * Removes a node and its relevant edges from the graph.\n   *\n   * Use the `keepEdges` option to keep the edges that were pointing to\n   * this node and only removes their `to` property value.\n   *\n   * If a replacement is provided, then any edges that were previously\n   * pointing to the removed node will be directed to the replacement,\n   * if it is valid to do so.\n   */\n  removeNode(node: Node, replacement?: Node, keepEdges?: boolean) {\n    this.nodes.delete(node.id)\n    const nbn = this.nodesByName.get(node.name)\n    // if it's the last one, just remove the set\n    if (nbn?.size === 1) this.nodesByName.delete(node.name)\n    else nbn?.delete(node)\n    for (const r of this.resolutionsReverse.get(node) ?? new Set()) {\n      this.resolutions.delete(r)\n    }\n    this.resolutionsReverse.delete(node)\n    this.manifests.delete(node.id)\n    for (const edge of node.edgesOut.values()) {\n      this.edges.delete(edge)\n    }\n    for (const edge of node.edgesIn) {\n      if (\n        replacement &&\n        satisfies(\n          replacement.id,\n          edge.spec,\n          edge.from.location,\n          this.projectRoot,\n          this.monorepo,\n        )\n      ) {\n        edge.to = replacement\n      } else if (keepEdges) {\n        edge.to = undefined\n      } else {\n        edge.from.edgesOut.delete(edge.spec.name)\n        this.edges.delete(edge)\n      }\n    }\n  }\n\n  /**\n   * Removes the resolved node of a given edge.\n   */\n  removeEdgeResolution(edge: Edge, queryModifier = '') {\n    const node = edge.to\n    const resolutionKey = getResolutionCacheKey(\n      edge.spec,\n      edge.from.location,\n      queryModifier,\n    )\n    if (node) {\n      edge.to = undefined\n      this.resolutions.delete(resolutionKey)\n      this.resolutionsReverse.get(node)?.delete(resolutionKey)\n      this.nodesByName.delete(node.name)\n      node.edgesIn.delete(edge)\n      if (node.edgesIn.size === 0) {\n        this.nodes.delete(node.id)\n      }\n    }\n  }\n\n  /**\n   * Reset resolution cache data.\n   */\n  resetResolution() {\n    // Clear all cache structures\n    this.resolutions.clear()\n    this.resolutionsReverse.clear()\n    this.nodesByName.clear()\n\n    // Rebuild nodesByName from all nodes\n    for (const node of this.nodes.values()) {\n      const nbn = this.nodesByName.get(node.name) ?? new Set()\n      nbn.add(node)\n      this.nodesByName.set(node.name, nbn)\n    }\n\n    // Rebuild resolution caches from all edges that have resolved targets\n    const seenNodes = new Set<Node>()\n    for (const edge of this.edges) {\n      const { to: node } = edge\n      if (!node) continue // Skip unresolved edges\n\n      // Only process each node once to avoid duplicate cache entries\n      if (seenNodes.has(node)) continue\n      seenNodes.add(node)\n\n      // Initialize resolutionsReverse entry for this node if it doesn't exist\n      if (!this.resolutionsReverse.has(node)) {\n        this.resolutionsReverse.set(node, new Set())\n      }\n\n      // Get the modifier if the node has one associated to it\n      const queryModifier = node.modifier || ''\n      const resolutionKey = getResolutionCacheKey(\n        edge.spec.final,\n        edge.from.location,\n        queryModifier,\n      )\n\n      this.resolutions.set(resolutionKey, node)\n      this.resolutionsReverse.get(node)?.add(resolutionKey)\n    }\n  }\n\n  toJSON() {\n    return lockfileData({\n      ...this.#options,\n      graph: this,\n      saveManifests: true,\n    })\n  }\n\n  [kCustomInspect](_: number, options: InspectOptions) {\n    const data = this.toJSON()\n    return `${this[Symbol.toStringTag]} ${inspect(data, options)}`\n  }\n}\n"]}

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

@@ -1,8 +1,15 @@
+import type { PathScurry } from 'path-scurry';
 import type { PackageInfoClient } from '@vltpkg/package-info';
 import type { SpecOptions } from '@vltpkg/spec';
-import type { PathScurry } from 'path-scurry';
+import type { RollbackRemove } from '@vltpkg/rollback-remove';
 import type { BuildIdealAddOptions, BuildIdealFromGraphOptions } from './types.ts';
+import type { GraphModifier } from '../modifiers.ts';
+import type { Graph } from '../graph.ts';
 export type AddNodesOptions = BuildIdealAddOptions & BuildIdealFromGraphOptions & SpecOptions & {
+    /**
+     * The graph modifiers helper object.
+     */
+    modifiers?: GraphModifier;
     /**
      * A {@link PathScurry} instance based on the `projectRoot` path
      */
@@ -11,9 +18,17 @@ export type AddNodesOptions = BuildIdealAddOptions & BuildIdealFromGraphOptions
      * A {@link PackageInfoClient} instance to read manifest info from.
      */
     packageInfo: PackageInfoClient;
+    /**
+     * The actual graph to compare against for early extraction
+     */
+    actual?: Graph;
+    /**
+     * A {@link RollbackRemove} instance to handle extraction rollbacks
+     */
+    remover: RollbackRemove;
 };
 /**
  * Add new nodes in the given `graph` for dependencies specified at `add`.
  */
-export declare const addNodes: ({ add, graph, packageInfo, scurry, ...specOptions }: AddNodesOptions) => Promise<void>;
+export declare const addNodes: ({ add, graph, modifiers, packageInfo, scurry, actual, remover, ...specOptions }: AddNodesOptions) => Promise<void>;
 //# sourceMappingURL=add-nodes.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"add-nodes.d.ts","sourceRoot":"","sources":["../../../src/ideal/add-nodes.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAC7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAC/C,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAE7C,OAAO,KAAK,EACV,oBAAoB,EACpB,0BAA0B,EAC3B,MAAM,YAAY,CAAA;AAGnB,MAAM,MAAM,eAAe,GAAG,oBAAoB,GAChD,0BAA0B,GAC1B,WAAW,GAAG;IACZ;;OAEG;IACH,MAAM,EAAE,UAAU,CAAA;IAElB;;OAEG;IACH,WAAW,EAAE,iBAAiB,CAAA;CAC/B,CAAA;AAEH;;GAEG;AACH,eAAO,MAAM,QAAQ,wDAMlB,eAAe,kBAkCjB,CAAA"}
+{"version":3,"file":"add-nodes.d.ts","sourceRoot":"","sources":["../../../src/ideal/add-nodes.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,aAAa,CAAA;AAE7C,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAC7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAC/C,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAA;AAC7D,OAAO,KAAK,EACV,oBAAoB,EACpB,0BAA0B,EAC3B,MAAM,YAAY,CAAA;AACnB,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAA;AAEpD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AAExC,MAAM,MAAM,eAAe,GAAG,oBAAoB,GAChD,0BAA0B,GAC1B,WAAW,GAAG;IACZ;;OAEG;IACH,SAAS,CAAC,EAAE,aAAa,CAAA;IACzB;;OAEG;IACH,MAAM,EAAE,UAAU,CAAA;IAElB;;OAEG;IACH,WAAW,EAAE,iBAAiB,CAAA;IAE9B;;OAEG;IACH,MAAM,CAAC,EAAE,KAAK,CAAA;IAEd;;OAEG;IACH,OAAO,EAAE,cAAc,CAAA;CACxB,CAAA;AAEH;;GAEG;AACH,eAAO,MAAM,QAAQ,oFASlB,eAAe,kBAiDjB,CAAA"}

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

@@ -4,8 +4,10 @@ import { resolveSaveType } from "../resolve-save-type.js";
 /**
  * Add new nodes in the given `graph` for dependencies specified at `add`.
  */
-export const addNodes = async ({ add, graph, packageInfo, scurry, ...specOptions }) => {
+export const addNodes = async ({ add, graph, modifiers, packageInfo, scurry, actual, remover, ...specOptions }) => {
     const seen = new Set();
+    const extractPromises = [];
+    const seenExtracted = new Set();
     // iterates on the list of dependencies per importer updating
     // the graph using metadata fetch from the registry manifest files
     for (const [depID, dependencies] of add) {
@@ -13,6 +15,7 @@ export const addNodes = async ({ add, graph, packageInfo, scurry, ...specOptions
         if (!importer) {
             throw error('Could not find importer', { found: depID });
         }
+        modifiers?.tryImporter(importer);
         // Removes any edges and nodes that are currently part of the
         // graph but are also in the list of dependencies to be installed
         const deps = [...dependencies.values()];
@@ -26,7 +29,11 @@ export const addNodes = async ({ add, graph, packageInfo, scurry, ...specOptions
         }
         // Add new nodes for packages defined in the dependencies list fetching
         // metadata from the registry manifests and updating the graph
-        await appendNodes(dependencies, packageInfo, graph, importer, deps, scurry, specOptions, seen);
+        await appendNodes(dependencies, packageInfo, graph, importer, deps, scurry, specOptions, seen, modifiers, modifiers?.tryDependencies(importer, deps), extractPromises, actual, seenExtracted, remover);
+    }
+    // Wait for all extraction promises to complete
+    if (extractPromises.length > 0) {
+        await Promise.all(extractPromises);
     }
 };
 //# sourceMappingURL=add-nodes.js.map

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

@@ -1 +1 @@
-{"version":3,"file":"add-nodes.js","sourceRoot":"","sources":["../../../src/ideal/add-nodes.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAI3C,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAK/C,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAA;AAgBzD;;GAEG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,KAAK,EAAE,EAC7B,GAAG,EACH,KAAK,EACL,WAAW,EACX,MAAM,EACN,GAAG,WAAW,EACE,EAAE,EAAE;IACpB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAS,CAAA;IAC7B,6DAA6D;IAC7D,kEAAkE;IAClE,KAAK,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC,IAAI,GAAG,EAAE,CAAC;QACxC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QACvC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,MAAM,KAAK,CAAC,yBAAyB,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAA;QAC1D,CAAC;QAED,6DAA6D;QAC7D,iEAAiE;QACjE,MAAM,IAAI,GAAG,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,CAAA;QACvC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,EAAE,IAAI,EAAE,GAAG,GAAG,CAAA;YACpB,MAAM,YAAY,GAAG,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACrD,GAAG,CAAC,IAAI,GAAG,eAAe,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAA;YACzD,MAAM,IAAI,GAAG,YAAY,EAAE,EAAE,CAAA;YAC7B,IAAI,IAAI;gBAAE,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;QAClC,CAAC;QAED,uEAAuE;QACvE,8DAA8D;QAC9D,MAAM,WAAW,CACf,YAAY,EACZ,WAAW,EACX,KAAK,EACL,QAAQ,EACR,IAAI,EACJ,MAAM,EACN,WAAW,EACX,IAAI,CACL,CAAA;IACH,CAAC;AACH,CAAC,CAAA","sourcesContent":["import type { DepID } from '@vltpkg/dep-id'\nimport { error } from '@vltpkg/error-cause'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport type { SpecOptions } from '@vltpkg/spec'\nimport type { PathScurry } from 'path-scurry'\nimport { appendNodes } from './append-nodes.ts'\nimport type {\n  BuildIdealAddOptions,\n  BuildIdealFromGraphOptions,\n} from './types.ts'\nimport { resolveSaveType } from '../resolve-save-type.ts'\n\nexport type AddNodesOptions = BuildIdealAddOptions &\n  BuildIdealFromGraphOptions &\n  SpecOptions & {\n    /**\n     * A {@link PathScurry} instance based on the `projectRoot` path\n     */\n    scurry: PathScurry\n\n    /**\n     * A {@link PackageInfoClient} instance to read manifest info from.\n     */\n    packageInfo: PackageInfoClient\n  }\n\n/**\n * Add new nodes in the given `graph` for dependencies specified at `add`.\n */\nexport const addNodes = async ({\n  add,\n  graph,\n  packageInfo,\n  scurry,\n  ...specOptions\n}: AddNodesOptions) => {\n  const seen = new Set<DepID>()\n  // iterates on the list of dependencies per importer updating\n  // the graph using metadata fetch from the registry manifest files\n  for (const [depID, dependencies] of add) {\n    const importer = graph.nodes.get(depID)\n    if (!importer) {\n      throw error('Could not find importer', { found: depID })\n    }\n\n    // Removes any edges and nodes that are currently part of the\n    // graph but are also in the list of dependencies to be installed\n    const deps = [...dependencies.values()]\n    for (const dep of deps) {\n      const { spec } = dep\n      const existingEdge = importer.edgesOut.get(spec.name)\n      dep.type = resolveSaveType(importer, spec.name, dep.type)\n      const node = existingEdge?.to\n      if (node) graph.removeNode(node)\n    }\n\n    // Add new nodes for packages defined in the dependencies list fetching\n    // metadata from the registry manifests and updating the graph\n    await appendNodes(\n      dependencies,\n      packageInfo,\n      graph,\n      importer,\n      deps,\n      scurry,\n      specOptions,\n      seen,\n    )\n  }\n}\n"]}
+{"version":3,"file":"add-nodes.js","sourceRoot":"","sources":["../../../src/ideal/add-nodes.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAC3C,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAC/C,OAAO,EAAE,eAAe,EAAE,MAAM,yBAAyB,CAAA;AA0CzD;;GAEG;AACH,MAAM,CAAC,MAAM,QAAQ,GAAG,KAAK,EAAE,EAC7B,GAAG,EACH,KAAK,EACL,SAAS,EACT,WAAW,EACX,MAAM,EACN,MAAM,EACN,OAAO,EACP,GAAG,WAAW,EACE,EAAE,EAAE;IACpB,MAAM,IAAI,GAAG,IAAI,GAAG,EAAS,CAAA;IAC7B,MAAM,eAAe,GAA6B,EAAE,CAAA;IACpD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAS,CAAA;IAEtC,6DAA6D;IAC7D,kEAAkE;IAClE,KAAK,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC,IAAI,GAAG,EAAE,CAAC;QACxC,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QACvC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,MAAM,KAAK,CAAC,yBAAyB,EAAE,EAAE,KAAK,EAAE,KAAK,EAAE,CAAC,CAAA;QAC1D,CAAC;QACD,SAAS,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAA;QAEhC,6DAA6D;QAC7D,iEAAiE;QACjE,MAAM,IAAI,GAAG,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,CAAA;QACvC,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE,CAAC;YACvB,MAAM,EAAE,IAAI,EAAE,GAAG,GAAG,CAAA;YACpB,MAAM,YAAY,GAAG,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACrD,GAAG,CAAC,IAAI,GAAG,eAAe,CAAC,QAAQ,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,IAAI,CAAC,CAAA;YACzD,MAAM,IAAI,GAAG,YAAY,EAAE,EAAE,CAAA;YAC7B,IAAI,IAAI;gBAAE,KAAK,CAAC,UAAU,CAAC,IAAI,CAAC,CAAA;QAClC,CAAC;QAED,uEAAuE;QACvE,8DAA8D;QAC9D,MAAM,WAAW,CACf,YAAY,EACZ,WAAW,EACX,KAAK,EACL,QAAQ,EACR,IAAI,EACJ,MAAM,EACN,WAAW,EACX,IAAI,EACJ,SAAS,EACT,SAAS,EAAE,eAAe,CAAC,QAAQ,EAAE,IAAI,CAAC,EAC1C,eAAe,EACf,MAAM,EACN,aAAa,EACb,OAAO,CACR,CAAA;IACH,CAAC;IAED,+CAA+C;IAC/C,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC/B,MAAM,OAAO,CAAC,GAAG,CAAC,eAAe,CAAC,CAAA;IACpC,CAAC;AACH,CAAC,CAAA","sourcesContent":["import { error } from '@vltpkg/error-cause'\nimport { appendNodes } from './append-nodes.ts'\nimport { resolveSaveType } from '../resolve-save-type.ts'\nimport type { PathScurry } from 'path-scurry'\nimport type { DepID } from '@vltpkg/dep-id'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport type { SpecOptions } from '@vltpkg/spec'\nimport type { RollbackRemove } from '@vltpkg/rollback-remove'\nimport type {\n  BuildIdealAddOptions,\n  BuildIdealFromGraphOptions,\n} from './types.ts'\nimport type { GraphModifier } from '../modifiers.ts'\nimport type { ExtractResult } from '../reify/extract-node.ts'\nimport type { Graph } from '../graph.ts'\n\nexport type AddNodesOptions = BuildIdealAddOptions &\n  BuildIdealFromGraphOptions &\n  SpecOptions & {\n    /**\n     * The graph modifiers helper object.\n     */\n    modifiers?: GraphModifier\n    /**\n     * A {@link PathScurry} instance based on the `projectRoot` path\n     */\n    scurry: PathScurry\n\n    /**\n     * A {@link PackageInfoClient} instance to read manifest info from.\n     */\n    packageInfo: PackageInfoClient\n\n    /**\n     * The actual graph to compare against for early extraction\n     */\n    actual?: Graph\n\n    /**\n     * A {@link RollbackRemove} instance to handle extraction rollbacks\n     */\n    remover: RollbackRemove\n  }\n\n/**\n * Add new nodes in the given `graph` for dependencies specified at `add`.\n */\nexport const addNodes = async ({\n  add,\n  graph,\n  modifiers,\n  packageInfo,\n  scurry,\n  actual,\n  remover,\n  ...specOptions\n}: AddNodesOptions) => {\n  const seen = new Set<DepID>()\n  const extractPromises: Promise<ExtractResult>[] = []\n  const seenExtracted = new Set<DepID>()\n\n  // iterates on the list of dependencies per importer updating\n  // the graph using metadata fetch from the registry manifest files\n  for (const [depID, dependencies] of add) {\n    const importer = graph.nodes.get(depID)\n    if (!importer) {\n      throw error('Could not find importer', { found: depID })\n    }\n    modifiers?.tryImporter(importer)\n\n    // Removes any edges and nodes that are currently part of the\n    // graph but are also in the list of dependencies to be installed\n    const deps = [...dependencies.values()]\n    for (const dep of deps) {\n      const { spec } = dep\n      const existingEdge = importer.edgesOut.get(spec.name)\n      dep.type = resolveSaveType(importer, spec.name, dep.type)\n      const node = existingEdge?.to\n      if (node) graph.removeNode(node)\n    }\n\n    // Add new nodes for packages defined in the dependencies list fetching\n    // metadata from the registry manifests and updating the graph\n    await appendNodes(\n      dependencies,\n      packageInfo,\n      graph,\n      importer,\n      deps,\n      scurry,\n      specOptions,\n      seen,\n      modifiers,\n      modifiers?.tryDependencies(importer, deps),\n      extractPromises,\n      actual,\n      seenExtracted,\n      remover,\n    )\n  }\n\n  // Wait for all extraction promises to complete\n  if (extractPromises.length > 0) {\n    await Promise.all(extractPromises)\n  }\n}\n"]}

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

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

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

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