@vltpkg/graph 1.0.0-rc.1 → 1.0.0-rc.11

package/dist/ideal/peers.js

@@ -0,0 +1,340 @@
+// helpers for managing peer dependency resolution
+// during the ideal graph building process.
+import { intersects } from '@vltpkg/semver';
+import { satisfies } from '@vltpkg/satisfies';
+import { getDependencies } from "../dependencies.js";
+import { getOrderedDependencies } from "./get-ordered-dependencies.js";
+/**
+ * Retrieve a unique hash value for a given peer context set.
+ */
+export const retrievePeerContextHash = (peerContext) => {
+    // skips creating the initial peer context ref
+    if (!peerContext?.index)
+        return undefined;
+    return `ṗ:${peerContext.index}`;
+};
+/**
+ * Checks if a given spec is compatible with the specs already
+ * assigned to a peer context entry.
+ *
+ * Returns true if compatible, false otherwise.
+ */
+export const incompatibleSpecs = (spec, entry) => {
+    if (entry.specs.size > 0) {
+        for (const s of entry.specs) {
+            if (
+            // only able to check range intersections for registry types
+            (spec.type === 'registry' &&
+                (!spec.range ||
+                    !s.range ||
+                    !intersects(spec.range, s.range))) ||
+                // also support types other than registry in case
+                // they use the very same bareSpec value
+                (spec.type !== 'registry' && spec.bareSpec !== s.bareSpec)) {
+                return true;
+            }
+        }
+    }
+    return false;
+};
+/**
+ * Sort peer context entry inputs for deterministic processing.
+ * Orders: non-peer dependencies first, then peer dependencies, alphabetically by name.
+ */
+export const getOrderedPeerContextEntries = (entries) => [...entries].sort((a, b) => {
+    const aIsPeer = a.type === 'peer' || a.type === 'peerOptional' ? 1 : 0;
+    const bIsPeer = b.type === 'peer' || b.type === 'peerOptional' ? 1 : 0;
+    if (aIsPeer !== bIsPeer)
+        return aIsPeer - bIsPeer;
+    const aName = a.target?.name ?? a.spec.name;
+    const bName = b.target?.name ?? b.spec.name;
+    return aName.localeCompare(bName, 'en');
+});
+/*
+ * Checks if there are any conflicting versions for a given dependency
+ * to be added to a peer context set which will require forking.
+ *
+ * Returns true if forking is needed, false otherwise.
+ */
+export const checkEntriesToPeerContext = (peerContext, entries) => {
+    // check on compatibility of new entries
+    for (const { spec, target } of entries) {
+        const name = target?.name ?? spec.final.name;
+        // skip any inactive entry
+        const entry = peerContext.get(name);
+        if (!entry?.active)
+            continue;
+        // validate if the provided spec is compatible with existing specs
+        if (incompatibleSpecs(spec, entry)) {
+            return true;
+        }
+    }
+    return false;
+};
+/**
+ * Add or update dependencies in a given peer context making sure to check
+ * for compatibility with existing dependencies already resolved by a given
+ * peer context set. Extra info such as a target or dependent nodes is
+ * optional.
+ *
+ * Returns true if forking is needed, false otherwise.
+ */
+export const addEntriesToPeerContext = (peerContext, entries, fromNode, monorepo) => {
+    // pre check to see if any of the new entries to be added to the
+    // provided peer context set conflicts with existing ones
+    // if that's already the case we can skip processing them and
+    // will return that a fork is needed right away
+    if (checkEntriesToPeerContext(peerContext, entries))
+        return true;
+    // iterate on every entry to be added to the peer context set
+    for (const { dependent, spec, target, type } of entries) {
+        const name = target?.name ?? spec.final.name;
+        // if there's no existing entry, create one
+        let entry = peerContext.get(name);
+        if (!entry) {
+            entry = {
+                active: true,
+                specs: new Set([spec]),
+                target,
+                type,
+                contextDependents: new Set(),
+            };
+            peerContext.set(name, entry);
+            if (dependent)
+                entry.contextDependents.add(dependent);
+            continue;
+        }
+        // perform an extra check that confirms the new spec does not
+        // conflicts with existing specs in this entry, this handles the
+        // case of adding sibling deps that conflicts with one another
+        if (incompatibleSpecs(spec, entry))
+            return true;
+        if (target &&
+            [...entry.specs].every(s => satisfies(target.id, s, fromNode.location, fromNode.projectRoot, monorepo))) {
+            if (target.id !== entry.target?.id &&
+                target.version !== entry.target?.version) {
+                // we have a compatible entry that has a new, compatible target
+                // so we need to update all dependents to point to the new target
+                for (const dependents of entry.contextDependents) {
+                    const edge = dependents.edgesOut.get(name);
+                    if (edge?.to && edge.to !== target) {
+                        edge.to.edgesIn.delete(edge);
+                        edge.to = target;
+                        target.edgesIn.add(edge);
+                    }
+                }
+                entry.target = target;
+            }
+            // otherwise sets the value in case it was nullish
+            entry.target ??= target;
+        }
+        // update specs and dependents values
+        entry.specs.add(spec);
+        if (dependent)
+            entry.contextDependents.add(dependent);
+    }
+    return false;
+};
+/**
+ * Create and returns a forked copy of a given peer context set.
+ */
+export const forkPeerContext = (graph, peerContext, entries) => {
+    // create a new peer context set
+    const nextPeerContext = new Map();
+    nextPeerContext.index = graph.nextPeerContextIndex();
+    // register it in the graph
+    graph.peerContexts[nextPeerContext.index] = nextPeerContext;
+    // copy existing entries marking them as inactive, it's also important
+    // to note that specs and contextDependents are new objects so that changes
+    // to those in the new context do not affect the previous one
+    for (const [name, entry] of peerContext.entries()) {
+        nextPeerContext.set(name, {
+            active: false,
+            specs: new Set(entry.specs),
+            target: undefined,
+            type: entry.type,
+            contextDependents: new Set(entry.contextDependents),
+        });
+    }
+    // add the new entries to this peer context set, marking them as active
+    // these are the entries that were incompatible with the previous context set
+    for (const entry of entries) {
+        const { dependent, spec, target, type } = entry;
+        const name = target?.name /* c8 ignore next */ ?? spec.final.name;
+        const newEntry = {
+            active: true,
+            specs: new Set([spec]),
+            target,
+            type,
+            contextDependents: dependent ? new Set([dependent]) : new Set(),
+        };
+        nextPeerContext.set(name, newEntry);
+    }
+    return nextPeerContext;
+};
+/**
+ * Starts the peer dependency placement process
+ * for a given node being processed and placed.
+ */
+export const startPeerPlacement = (peerContext, manifest, fromNode, options) => {
+    // queue entries so that they can be added at the end of the placement
+    // process, use a map to ensure deduplication between read json dep
+    // values and the resolved edges in the graph
+    const queueMap = new Map();
+    let peerSetHash;
+    if (manifest.peerDependencies &&
+        Object.keys(manifest.peerDependencies).length > 0) {
+        // generates a peer context set hash for nodes that
+        // have peer dependencies to be resolved
+        peerSetHash = retrievePeerContextHash(peerContext);
+        // get any potential sibling dependency from the
+        // parent node that might have not been parsed yet
+        const siblingDeps = getDependencies(fromNode, {
+            ...options,
+            registry: fromNode.registry,
+        });
+        for (const [depName, dep] of siblingDeps) {
+            queueMap.set(depName, dep);
+        }
+        // collect the already parsed nodes and add those to the
+        // list of entries to be added to the peer context set
+        for (const edge of fromNode.edgesOut.values()) {
+            queueMap.set(edge.name, {
+                spec: edge.spec,
+                target: edge.to,
+                type: edge.type,
+            });
+        }
+    }
+    return {
+        peerSetHash,
+        // Sort queuedEntries for deterministic order
+        queuedEntries: getOrderedPeerContextEntries([
+            ...queueMap.values(),
+        ]),
+    };
+};
+/**
+ * Ends the peer dependency placement process, returning the functions that
+ * are going to be used to update the peer context set, forking when needed
+ * and resolving peer dependencies if possible.
+ */
+export const endPeerPlacement = (peerContext, nextDeps, nextPeerDeps, graph, spec, fromNode, node, type, queuedEntries) => ({
+    /**
+     * Add the new entries to the current peer context set.
+     */
+    putEntries: () => {
+        // keep track of whether we need to fork the current peer context set
+        let needsToForkPeerContext = false;
+        // add queued entries from this node parents along
+        // with a self-ref to the current peer context set
+        const prevEntries = [
+            ...queuedEntries,
+            /* ref itself */ {
+                spec,
+                target: node,
+                type,
+            },
+        ];
+        addEntriesToPeerContext(peerContext, prevEntries, fromNode, graph.monorepo);
+        // add this node's direct dependencies next
+        const nextEntries = [
+            ...nextDeps.map(dep => ({ ...dep, dependent: node })),
+            ...[...nextPeerDeps.values()].map(dep => ({
+                ...dep,
+                dependent: node,
+            })),
+        ];
+        if (nextEntries.length > 0) {
+            needsToForkPeerContext = addEntriesToPeerContext(peerContext, nextEntries, node, graph.monorepo);
+        }
+        // returns all entries that need to be added to a forked
+        // context or undefined if the current context was updated directly
+        return needsToForkPeerContext ? nextEntries : undefined;
+    },
+    /**
+     * Try to resolve peer dependencies using already seen target
+     * values from the current peer context set.
+     */
+    resolvePeerDeps: () => {
+        // iterate on the set of peer dependencies of the current node
+        // and try to resolve them from the existing peer context set,
+        // when possible, add them as edges in the graph right away, if not,
+        // then we move them back to the `nextDeps` list for processing
+        // along with the rest of the regular dependencies
+        for (const nextDep of nextPeerDeps.values()) {
+            const { spec, type } = nextDep;
+            if (type === 'peer' || type === 'peerOptional') {
+                // try to retrieve an entry for that peer dep from
+                // the current peer context set
+                const entry = peerContext.get(spec.final.name);
+                if (!node.edgesOut.has(spec.final.name) &&
+                    entry?.target &&
+                    satisfies(entry.target.id, spec, fromNode.location, fromNode.projectRoot, graph.monorepo)) {
+                    // entry satisfied, create edge in the graph
+                    graph.addEdge(type, spec, node, entry.target);
+                    entry.specs.add(spec.final);
+                }
+                else if (type === 'peerOptional') {
+                    // skip unsatisfied peerOptional dependencies,
+                    // just create a dangling edge
+                    graph.addEdge(type, spec, node);
+                }
+                else {
+                    // could not satisfy from peer context, add to next deps
+                    nextDeps.push(nextDep);
+                }
+            }
+        }
+    },
+});
+/**
+ * Given an array of processed results for the current level dependencies
+ * being placed in the currently building ideal graph, traverse its direct
+ * dependencies and track peer dependencies in their appropriate peer context
+ * sets, forking as needed and resolving peer dependencies using suitable
+ * nodes already present in the graph if possible.
+ */
+export const postPlacementPeerCheck = (graph, sortedLevelResults) => {
+    // Update peer contexts in a sorted manner after processing all nodes
+    // at a given level to ensure deterministic behavior when it comes to
+    // forking new peer contexts
+    for (const childDepsToProcess of sortedLevelResults) {
+        // Sort childDepsToProcess deterministically by node.id
+        const sortedChildDeps = [...childDepsToProcess].sort((a, b) => a.node.id.localeCompare(b.node.id, 'en'));
+        const needsForking = new Map();
+        // first iterate on all child deps, adding entries to the current
+        // context and collect the information on which ones need forking
+        for (const childDep of sortedChildDeps) {
+            const needsFork = childDep.updateContext.putEntries();
+            if (needsFork) {
+                needsForking.set(childDep, needsFork);
+            }
+        }
+        // Sort needsForking entries before iterating (Map iteration order = insertion order)
+        const sortedNeedsForkingEntries = [
+            ...needsForking.entries(),
+        ].sort(([a], [b]) => a.node.id.localeCompare(b.node.id, 'en'));
+        // then iterate again, forking contexts as needed but also try to
+        // reuse the context of the previous sibling if possible
+        let prevContext;
+        for (const [childDep, nextEntries] of sortedNeedsForkingEntries) {
+            if (prevContext &&
+                !checkEntriesToPeerContext(prevContext, nextEntries)) {
+                // the context of the previous sibling can be reused
+                addEntriesToPeerContext(prevContext, nextEntries, childDep.node, graph.monorepo);
+                childDep.peerContext = prevContext;
+                continue;
+            }
+            childDep.peerContext = forkPeerContext(graph, childDep.peerContext, nextEntries);
+            prevContext = childDep.peerContext;
+        }
+        // try to resolve peer dependencies now that
+        // the context is fully set up
+        for (const childDep of sortedChildDeps) {
+            childDep.updateContext.resolvePeerDeps();
+            childDep.deps = getOrderedDependencies(childDep.deps);
+        }
+    }
+};
+//# sourceMappingURL=peers.js.map

package/dist/ideal/peers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"peers.js","sourceRoot":"","sources":["../../src/ideal/peers.ts"],"names":[],"mappings":"AAAA,kDAAkD;AAClD,2CAA2C;AAE3C,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAA;AAC3C,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AAC7C,OAAO,EAAE,eAAe,EAAE,MAAM,oBAAoB,CAAA;AACpD,OAAO,EAAE,sBAAsB,EAAE,MAAM,+BAA+B,CAAA;AAetE;;GAEG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG,CACrC,WAAoC,EAChB,EAAE;IACtB,8CAA8C;IAC9C,IAAI,CAAC,WAAW,EAAE,KAAK;QAAE,OAAO,SAAS,CAAA;IAEzC,OAAO,KAAK,WAAW,CAAC,KAAK,EAAE,CAAA;AACjC,CAAC,CAAA;AAED;;;;;GAKG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAC/B,IAAU,EACV,KAAuB,EACd,EAAE;IACX,IAAI,KAAK,CAAC,KAAK,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACzB,KAAK,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC5B;YACE,4DAA4D;YAC5D,CAAC,IAAI,CAAC,IAAI,KAAK,UAAU;gBACvB,CAAC,CAAC,IAAI,CAAC,KAAK;oBACV,CAAC,CAAC,CAAC,KAAK;oBACR,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;gBACtC,iDAAiD;gBACjD,wCAAwC;gBACxC,CAAC,IAAI,CAAC,IAAI,KAAK,UAAU,IAAI,IAAI,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ,CAAC,EAC1D,CAAC;gBACD,OAAO,IAAI,CAAA;YACb,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,4BAA4B,GAAG,CAC1C,OAAgC,EACP,EAAE,CAC3B,CAAC,GAAG,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;IACzB,MAAM,OAAO,GACX,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACxD,MAAM,OAAO,GACX,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACxD,IAAI,OAAO,KAAK,OAAO;QAAE,OAAO,OAAO,GAAG,OAAO,CAAA;IACjD,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;IAC3C,MAAM,KAAK,GAAG,CAAC,CAAC,MAAM,EAAE,IAAI,IAAI,CAAC,CAAC,IAAI,CAAC,IAAI,CAAA;IAC3C,OAAO,KAAK,CAAC,aAAa,CAAC,KAAK,EAAE,IAAI,CAAC,CAAA;AACzC,CAAC,CAAC,CAAA;AAEJ;;;;;GAKG;AACH,MAAM,CAAC,MAAM,yBAAyB,GAAG,CACvC,WAAwB,EACxB,OAAgC,EACvB,EAAE;IACX,wCAAwC;IACxC,KAAK,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,MAAM,EAAE,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAA;QAE5C,0BAA0B;QAC1B,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACnC,IAAI,CAAC,KAAK,EAAE,MAAM;YAAE,SAAQ;QAE5B,kEAAkE;QAClE,IAAI,iBAAiB,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,CAAC;YACnC,OAAO,IAAI,CAAA;QACb,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,uBAAuB,GAAG,CACrC,WAAwB,EACxB,OAAgC,EAChC,QAAc,EACd,QAAmB,EACV,EAAE;IACX,gEAAgE;IAChE,yDAAyD;IACzD,6DAA6D;IAC7D,+CAA+C;IAC/C,IAAI,yBAAyB,CAAC,WAAW,EAAE,OAAO,CAAC;QAAE,OAAO,IAAI,CAAA;IAEhE,6DAA6D;IAC7D,KAAK,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,IAAI,OAAO,EAAE,CAAC;QACxD,MAAM,IAAI,GAAG,MAAM,EAAE,IAAI,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAA;QAE5C,2CAA2C;QAC3C,IAAI,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACjC,IAAI,CAAC,KAAK,EAAE,CAAC;YACX,KAAK,GAAG;gBACN,MAAM,EAAE,IAAI;gBACZ,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;gBACtB,MAAM;gBACN,IAAI;gBACJ,iBAAiB,EAAE,IAAI,GAAG,EAAE;aAC7B,CAAA;YACD,WAAW,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAA;YAC5B,IAAI,SAAS;gBAAE,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;YACrD,SAAQ;QACV,CAAC;QAED,6DAA6D;QAC7D,gEAAgE;QAChE,8DAA8D;QAC9D,IAAI,iBAAiB,CAAC,IAAI,EAAE,KAAK,CAAC;YAAE,OAAO,IAAI,CAAA;QAE/C,IACE,MAAM;YACN,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CACzB,SAAS,CACP,MAAM,CAAC,EAAE,EACT,CAAC,EACD,QAAQ,CAAC,QAAQ,EACjB,QAAQ,CAAC,WAAW,EACpB,QAAQ,CACT,CACF,EACD,CAAC;YACD,IACE,MAAM,CAAC,EAAE,KAAK,KAAK,CAAC,MAAM,EAAE,EAAE;gBAC9B,MAAM,CAAC,OAAO,KAAK,KAAK,CAAC,MAAM,EAAE,OAAO,EACxC,CAAC;gBACD,+DAA+D;gBAC/D,iEAAiE;gBACjE,KAAK,MAAM,UAAU,IAAI,KAAK,CAAC,iBAAiB,EAAE,CAAC;oBACjD,MAAM,IAAI,GAAG,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;oBAC1C,IAAI,IAAI,EAAE,EAAE,IAAI,IAAI,CAAC,EAAE,KAAK,MAAM,EAAE,CAAC;wBACnC,IAAI,CAAC,EAAE,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;wBAC5B,IAAI,CAAC,EAAE,GAAG,MAAM,CAAA;wBAChB,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;oBAC1B,CAAC;gBACH,CAAC;gBACD,KAAK,CAAC,MAAM,GAAG,MAAM,CAAA;YACvB,CAAC;YAED,kDAAkD;YAClD,KAAK,CAAC,MAAM,KAAK,MAAM,CAAA;QACzB,CAAC;QAED,qCAAqC;QACrC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QACrB,IAAI,SAAS;YAAE,KAAK,CAAC,iBAAiB,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;IACvD,CAAC;IAED,OAAO,KAAK,CAAA;AACd,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAC7B,KAAY,EACZ,WAAwB,EACxB,OAAgC,EACnB,EAAE;IACf,gCAAgC;IAChC,MAAM,eAAe,GAAgB,IAAI,GAAG,EAAE,CAAA;IAC9C,eAAe,CAAC,KAAK,GAAG,KAAK,CAAC,oBAAoB,EAAE,CAAA;IACpD,2BAA2B;IAC3B,KAAK,CAAC,YAAY,CAAC,eAAe,CAAC,KAAK,CAAC,GAAG,eAAe,CAAA;IAE3D,sEAAsE;IACtE,2EAA2E;IAC3E,6DAA6D;IAC7D,KAAK,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,WAAW,CAAC,OAAO,EAAE,EAAE,CAAC;QAClD,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE;YACxB,MAAM,EAAE,KAAK;YACb,KAAK,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC;YAC3B,MAAM,EAAE,SAAS;YACjB,IAAI,EAAE,KAAK,CAAC,IAAI;YAChB,iBAAiB,EAAE,IAAI,GAAG,CAAC,KAAK,CAAC,iBAAiB,CAAC;SACpD,CAAC,CAAA;IACJ,CAAC;IAED,uEAAuE;IACvE,6EAA6E;IAC7E,KAAK,MAAM,KAAK,IAAI,OAAO,EAAE,CAAC;QAC5B,MAAM,EAAE,SAAS,EAAE,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,GAAG,KAAK,CAAA;QAC/C,MAAM,IAAI,GAAG,MAAM,EAAE,IAAI,CAAC,oBAAoB,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAA;QACjE,MAAM,QAAQ,GAAG;YACf,MAAM,EAAE,IAAI;YACZ,KAAK,EAAE,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC;YACtB,MAAM;YACN,IAAI;YACJ,iBAAiB,EACf,SAAS,CAAC,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,EAAQ;SACrD,CAAA;QACD,eAAe,CAAC,GAAG,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAA;IACrC,CAAC;IAED,OAAO,eAAe,CAAA;AACxB,CAAC,CAAA;AAED;;;GAGG;AACH,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAChC,WAAwB,EACxB,QAAkB,EAClB,QAAc,EACd,OAAoB,EACpB,EAAE;IACF,sEAAsE;IACtE,mEAAmE;IACnE,6CAA6C;IAC7C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAiC,CAAA;IACzD,IAAI,WAA+B,CAAA;IAEnC,IACE,QAAQ,CAAC,gBAAgB;QACzB,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,gBAAgB,CAAC,CAAC,MAAM,GAAG,CAAC,EACjD,CAAC;QACD,mDAAmD;QACnD,wCAAwC;QACxC,WAAW,GAAG,uBAAuB,CAAC,WAAW,CAAC,CAAA;QAElD,gDAAgD;QAChD,kDAAkD;QAClD,MAAM,WAAW,GAAG,eAAe,CAAC,QAAQ,EAAE;YAC5C,GAAG,OAAO;YACV,QAAQ,EAAE,QAAQ,CAAC,QAAQ;SAC5B,CAAC,CAAA;QACF,KAAK,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,WAAW,EAAE,CAAC;YACzC,QAAQ,CAAC,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAA;QAC5B,CAAC;QAED,wDAAwD;QACxD,sDAAsD;QACtD,KAAK,MAAM,IAAI,IAAI,QAAQ,CAAC,QAAQ,CAAC,MAAM,EAAE,EAAE,CAAC;YAC9C,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE;gBACtB,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,IAAI,EAAE,IAAI,CAAC,IAAI;aAChB,CAAC,CAAA;QACJ,CAAC;IACH,CAAC;IAED,OAAO;QACL,WAAW;QACX,6CAA6C;QAC7C,aAAa,EAAE,4BAA4B,CAAC;YAC1C,GAAG,QAAQ,CAAC,MAAM,EAAE;SACrB,CAAC;KACH,CAAA;AACH,CAAC,CAAA;AAED;;;;GAIG;AACH,MAAM,CAAC,MAAM,gBAAgB,GAAG,CAC9B,WAAwB,EACxB,QAAsB,EACtB,YAAuD,EACvD,KAAY,EACZ,IAAU,EACV,QAAc,EACd,IAAU,EACV,IAAwB,EACxB,aAAsC,EACtC,EAAE,CAAC,CAAC;IACJ;;OAEG;IACH,UAAU,EAAE,GAAG,EAAE;QACf,qEAAqE;QACrE,IAAI,sBAAsB,GAAG,KAAK,CAAA;QAClC,kDAAkD;QAClD,kDAAkD;QAClD,MAAM,WAAW,GAAG;YAClB,GAAG,aAAa;YAChB,gBAAgB,CAAC;gBACf,IAAI;gBACJ,MAAM,EAAE,IAAI;gBACZ,IAAI;aACL;SACF,CAAA;QACD,uBAAuB,CACrB,WAAW,EACX,WAAW,EACX,QAAQ,EACR,KAAK,CAAC,QAAQ,CACf,CAAA;QAED,2CAA2C;QAC3C,MAAM,WAAW,GAAG;YAClB,GAAG,QAAQ,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,EAAE,GAAG,GAAG,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAC;YACrD,GAAG,CAAC,GAAG,YAAY,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACxC,GAAG,GAAG;gBACN,SAAS,EAAE,IAAI;aAChB,CAAC,CAAC;SACJ,CAAA;QACD,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC3B,sBAAsB,GAAG,uBAAuB,CAC9C,WAAW,EACX,WAAW,EACX,IAAI,EACJ,KAAK,CAAC,QAAQ,CACf,CAAA;QACH,CAAC;QAED,wDAAwD;QACxD,mEAAmE;QACnE,OAAO,sBAAsB,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,SAAS,CAAA;IACzD,CAAC;IAED;;;OAGG;IACH,eAAe,EAAE,GAAG,EAAE;QACpB,8DAA8D;QAC9D,8DAA8D;QAC9D,oEAAoE;QACpE,+DAA+D;QAC/D,kDAAkD;QAClD,KAAK,MAAM,OAAO,IAAI,YAAY,CAAC,MAAM,EAAE,EAAE,CAAC;YAC5C,MAAM,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,OAAO,CAAA;YAC9B,IAAI,IAAI,KAAK,MAAM,IAAI,IAAI,KAAK,cAAc,EAAE,CAAC;gBAC/C,kDAAkD;gBAClD,+BAA+B;gBAC/B,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAA;gBAC9C,IACE,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;oBACnC,KAAK,EAAE,MAAM;oBACb,SAAS,CACP,KAAK,CAAC,MAAM,CAAC,EAAE,EACf,IAAI,EACJ,QAAQ,CAAC,QAAQ,EACjB,QAAQ,CAAC,WAAW,EACpB,KAAK,CAAC,QAAQ,CACf,EACD,CAAC;oBACD,4CAA4C;oBAC5C,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,KAAK,CAAC,MAAM,CAAC,CAAA;oBAC7C,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAA;gBAC7B,CAAC;qBAAM,IAAI,IAAI,KAAK,cAAc,EAAE,CAAC;oBACnC,8CAA8C;oBAC9C,8BAA8B;oBAC9B,KAAK,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC,CAAA;gBACjC,CAAC;qBAAM,CAAC;oBACN,wDAAwD;oBACxD,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAA;gBACxB,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;CACF,CAAC,CAAA;AAEF;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,sBAAsB,GAAG,CACpC,KAAY,EACZ,kBAA4C,EAC5C,EAAE;IACF,qEAAqE;IACrE,qEAAqE;IACrE,4BAA4B;IAC5B,KAAK,MAAM,kBAAkB,IAAI,kBAAkB,EAAE,CAAC;QACpD,uDAAuD;QACvD,MAAM,eAAe,GAAG,CAAC,GAAG,kBAAkB,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAC5D,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CACzC,CAAA;QAED,MAAM,YAAY,GAAG,IAAI,GAAG,EAOzB,CAAA;QACH,iEAAiE;QACjE,iEAAiE;QACjE,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;YACvC,MAAM,SAAS,GAAG,QAAQ,CAAC,aAAa,CAAC,UAAU,EAAE,CAAA;YACrD,IAAI,SAAS,EAAE,CAAC;gBACd,YAAY,CAAC,GAAG,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAA;YACvC,CAAC;QACH,CAAC;QAED,qFAAqF;QACrF,MAAM,yBAAyB,GAAG;YAChC,GAAG,YAAY,CAAC,OAAO,EAAE;SAC1B,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC,CAAA;QAE9D,iEAAiE;QACjE,wDAAwD;QACxD,IAAI,WAAW,CAAA;QACf,KAAK,MAAM,CAAC,QAAQ,EAAE,WAAW,CAAC,IAAI,yBAAyB,EAAE,CAAC;YAChE,IACE,WAAW;gBACX,CAAC,yBAAyB,CAAC,WAAW,EAAE,WAAW,CAAC,EACpD,CAAC;gBACD,oDAAoD;gBACpD,uBAAuB,CACrB,WAAW,EACX,WAAW,EACX,QAAQ,CAAC,IAAI,EACb,KAAK,CAAC,QAAQ,CACf,CAAA;gBACD,QAAQ,CAAC,WAAW,GAAG,WAAW,CAAA;gBAClC,SAAQ;YACV,CAAC;YACD,QAAQ,CAAC,WAAW,GAAG,eAAe,CACpC,KAAK,EACL,QAAQ,CAAC,WAAW,EACpB,WAAW,CACZ,CAAA;YACD,WAAW,GAAG,QAAQ,CAAC,WAAW,CAAA;QACpC,CAAC;QACD,4CAA4C;QAC5C,8BAA8B;QAC9B,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;YACvC,QAAQ,CAAC,aAAa,CAAC,eAAe,EAAE,CAAA;YACxC,QAAQ,CAAC,IAAI,GAAG,sBAAsB,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;QACvD,CAAC;IACH,CAAC;AACH,CAAC,CAAA","sourcesContent":["// helpers for managing peer dependency resolution\n// during the ideal graph building process.\n\nimport { intersects } from '@vltpkg/semver'\nimport { satisfies } from '@vltpkg/satisfies'\nimport { getDependencies } from '../dependencies.ts'\nimport { getOrderedDependencies } from './get-ordered-dependencies.ts'\nimport type {\n  ProcessPlacementResultEntry,\n  PeerContext,\n  PeerContextEntry,\n  PeerContextEntryInput,\n  ProcessPlacementResult,\n} from './types.ts'\nimport type { Spec, SpecOptions } from '@vltpkg/spec'\nimport type { DependencySaveType, Manifest } from '@vltpkg/types'\nimport type { Monorepo } from '@vltpkg/workspaces'\nimport type { Dependency } from '../dependencies.ts'\nimport type { Graph } from '../graph.ts'\nimport type { Node } from '../node.ts'\n\n/**\n * Retrieve a unique hash value for a given peer context set.\n */\nexport const retrievePeerContextHash = (\n  peerContext: PeerContext | undefined,\n): string | undefined => {\n  // skips creating the initial peer context ref\n  if (!peerContext?.index) return undefined\n\n  return `ṗ:${peerContext.index}`\n}\n\n/**\n * Checks if a given spec is compatible with the specs already\n * assigned to a peer context entry.\n *\n * Returns true if compatible, false otherwise.\n */\nexport const incompatibleSpecs = (\n  spec: Spec,\n  entry: PeerContextEntry,\n): boolean => {\n  if (entry.specs.size > 0) {\n    for (const s of entry.specs) {\n      if (\n        // only able to check range intersections for registry types\n        (spec.type === 'registry' &&\n          (!spec.range ||\n            !s.range ||\n            !intersects(spec.range, s.range))) ||\n        // also support types other than registry in case\n        // they use the very same bareSpec value\n        (spec.type !== 'registry' && spec.bareSpec !== s.bareSpec)\n      ) {\n        return true\n      }\n    }\n  }\n  return false\n}\n\n/**\n * Sort peer context entry inputs for deterministic processing.\n * Orders: non-peer dependencies first, then peer dependencies, alphabetically by name.\n */\nexport const getOrderedPeerContextEntries = (\n  entries: PeerContextEntryInput[],\n): PeerContextEntryInput[] =>\n  [...entries].sort((a, b) => {\n    const aIsPeer =\n      a.type === 'peer' || a.type === 'peerOptional' ? 1 : 0\n    const bIsPeer =\n      b.type === 'peer' || b.type === 'peerOptional' ? 1 : 0\n    if (aIsPeer !== bIsPeer) return aIsPeer - bIsPeer\n    const aName = a.target?.name ?? a.spec.name\n    const bName = b.target?.name ?? b.spec.name\n    return aName.localeCompare(bName, 'en')\n  })\n\n/*\n * Checks if there are any conflicting versions for a given dependency\n * to be added to a peer context set which will require forking.\n *\n * Returns true if forking is needed, false otherwise.\n */\nexport const checkEntriesToPeerContext = (\n  peerContext: PeerContext,\n  entries: PeerContextEntryInput[],\n): boolean => {\n  // check on compatibility of new entries\n  for (const { spec, target } of entries) {\n    const name = target?.name ?? spec.final.name\n\n    // skip any inactive entry\n    const entry = peerContext.get(name)\n    if (!entry?.active) continue\n\n    // validate if the provided spec is compatible with existing specs\n    if (incompatibleSpecs(spec, entry)) {\n      return true\n    }\n  }\n\n  return false\n}\n\n/**\n * Add or update dependencies in a given peer context making sure to check\n * for compatibility with existing dependencies already resolved by a given\n * peer context set. Extra info such as a target or dependent nodes is\n * optional.\n *\n * Returns true if forking is needed, false otherwise.\n */\nexport const addEntriesToPeerContext = (\n  peerContext: PeerContext,\n  entries: PeerContextEntryInput[],\n  fromNode: Node,\n  monorepo?: Monorepo,\n): boolean => {\n  // pre check to see if any of the new entries to be added to the\n  // provided peer context set conflicts with existing ones\n  // if that's already the case we can skip processing them and\n  // will return that a fork is needed right away\n  if (checkEntriesToPeerContext(peerContext, entries)) return true\n\n  // iterate on every entry to be added to the peer context set\n  for (const { dependent, spec, target, type } of entries) {\n    const name = target?.name ?? spec.final.name\n\n    // if there's no existing entry, create one\n    let entry = peerContext.get(name)\n    if (!entry) {\n      entry = {\n        active: true,\n        specs: new Set([spec]),\n        target,\n        type,\n        contextDependents: new Set(),\n      }\n      peerContext.set(name, entry)\n      if (dependent) entry.contextDependents.add(dependent)\n      continue\n    }\n\n    // perform an extra check that confirms the new spec does not\n    // conflicts with existing specs in this entry, this handles the\n    // case of adding sibling deps that conflicts with one another\n    if (incompatibleSpecs(spec, entry)) return true\n\n    if (\n      target &&\n      [...entry.specs].every(s =>\n        satisfies(\n          target.id,\n          s,\n          fromNode.location,\n          fromNode.projectRoot,\n          monorepo,\n        ),\n      )\n    ) {\n      if (\n        target.id !== entry.target?.id &&\n        target.version !== entry.target?.version\n      ) {\n        // we have a compatible entry that has a new, compatible target\n        // so we need to update all dependents to point to the new target\n        for (const dependents of entry.contextDependents) {\n          const edge = dependents.edgesOut.get(name)\n          if (edge?.to && edge.to !== target) {\n            edge.to.edgesIn.delete(edge)\n            edge.to = target\n            target.edgesIn.add(edge)\n          }\n        }\n        entry.target = target\n      }\n\n      // otherwise sets the value in case it was nullish\n      entry.target ??= target\n    }\n\n    // update specs and dependents values\n    entry.specs.add(spec)\n    if (dependent) entry.contextDependents.add(dependent)\n  }\n\n  return false\n}\n\n/**\n * Create and returns a forked copy of a given peer context set.\n */\nexport const forkPeerContext = (\n  graph: Graph,\n  peerContext: PeerContext,\n  entries: PeerContextEntryInput[],\n): PeerContext => {\n  // create a new peer context set\n  const nextPeerContext: PeerContext = new Map()\n  nextPeerContext.index = graph.nextPeerContextIndex()\n  // register it in the graph\n  graph.peerContexts[nextPeerContext.index] = nextPeerContext\n\n  // copy existing entries marking them as inactive, it's also important\n  // to note that specs and contextDependents are new objects so that changes\n  // to those in the new context do not affect the previous one\n  for (const [name, entry] of peerContext.entries()) {\n    nextPeerContext.set(name, {\n      active: false,\n      specs: new Set(entry.specs),\n      target: undefined,\n      type: entry.type,\n      contextDependents: new Set(entry.contextDependents),\n    })\n  }\n\n  // add the new entries to this peer context set, marking them as active\n  // these are the entries that were incompatible with the previous context set\n  for (const entry of entries) {\n    const { dependent, spec, target, type } = entry\n    const name = target?.name /* c8 ignore next */ ?? spec.final.name\n    const newEntry = {\n      active: true,\n      specs: new Set([spec]),\n      target,\n      type,\n      contextDependents:\n        dependent ? new Set([dependent]) : new Set<Node>(),\n    }\n    nextPeerContext.set(name, newEntry)\n  }\n\n  return nextPeerContext\n}\n\n/**\n * Starts the peer dependency placement process\n * for a given node being processed and placed.\n */\nexport const startPeerPlacement = (\n  peerContext: PeerContext,\n  manifest: Manifest,\n  fromNode: Node,\n  options: SpecOptions,\n) => {\n  // queue entries so that they can be added at the end of the placement\n  // process, use a map to ensure deduplication between read json dep\n  // values and the resolved edges in the graph\n  const queueMap = new Map<string, PeerContextEntryInput>()\n  let peerSetHash: string | undefined\n\n  if (\n    manifest.peerDependencies &&\n    Object.keys(manifest.peerDependencies).length > 0\n  ) {\n    // generates a peer context set hash for nodes that\n    // have peer dependencies to be resolved\n    peerSetHash = retrievePeerContextHash(peerContext)\n\n    // get any potential sibling dependency from the\n    // parent node that might have not been parsed yet\n    const siblingDeps = getDependencies(fromNode, {\n      ...options,\n      registry: fromNode.registry,\n    })\n    for (const [depName, dep] of siblingDeps) {\n      queueMap.set(depName, dep)\n    }\n\n    // collect the already parsed nodes and add those to the\n    // list of entries to be added to the peer context set\n    for (const edge of fromNode.edgesOut.values()) {\n      queueMap.set(edge.name, {\n        spec: edge.spec,\n        target: edge.to,\n        type: edge.type,\n      })\n    }\n  }\n\n  return {\n    peerSetHash,\n    // Sort queuedEntries for deterministic order\n    queuedEntries: getOrderedPeerContextEntries([\n      ...queueMap.values(),\n    ]),\n  }\n}\n\n/**\n * Ends the peer dependency placement process, returning the functions that\n * are going to be used to update the peer context set, forking when needed\n * and resolving peer dependencies if possible.\n */\nexport const endPeerPlacement = (\n  peerContext: PeerContext,\n  nextDeps: Dependency[],\n  nextPeerDeps: Map<string, Dependency> & { id?: number },\n  graph: Graph,\n  spec: Spec,\n  fromNode: Node,\n  node: Node,\n  type: DependencySaveType,\n  queuedEntries: PeerContextEntryInput[],\n) => ({\n  /**\n   * Add the new entries to the current peer context set.\n   */\n  putEntries: () => {\n    // keep track of whether we need to fork the current peer context set\n    let needsToForkPeerContext = false\n    // add queued entries from this node parents along\n    // with a self-ref to the current peer context set\n    const prevEntries = [\n      ...queuedEntries,\n      /* ref itself */ {\n        spec,\n        target: node,\n        type,\n      },\n    ]\n    addEntriesToPeerContext(\n      peerContext,\n      prevEntries,\n      fromNode,\n      graph.monorepo,\n    )\n\n    // add this node's direct dependencies next\n    const nextEntries = [\n      ...nextDeps.map(dep => ({ ...dep, dependent: node })),\n      ...[...nextPeerDeps.values()].map(dep => ({\n        ...dep,\n        dependent: node,\n      })),\n    ]\n    if (nextEntries.length > 0) {\n      needsToForkPeerContext = addEntriesToPeerContext(\n        peerContext,\n        nextEntries,\n        node,\n        graph.monorepo,\n      )\n    }\n\n    // returns all entries that need to be added to a forked\n    // context or undefined if the current context was updated directly\n    return needsToForkPeerContext ? nextEntries : undefined\n  },\n\n  /**\n   * Try to resolve peer dependencies using already seen target\n   * values from the current peer context set.\n   */\n  resolvePeerDeps: () => {\n    // iterate on the set of peer dependencies of the current node\n    // and try to resolve them from the existing peer context set,\n    // when possible, add them as edges in the graph right away, if not,\n    // then we move them back to the `nextDeps` list for processing\n    // along with the rest of the regular dependencies\n    for (const nextDep of nextPeerDeps.values()) {\n      const { spec, type } = nextDep\n      if (type === 'peer' || type === 'peerOptional') {\n        // try to retrieve an entry for that peer dep from\n        // the current peer context set\n        const entry = peerContext.get(spec.final.name)\n        if (\n          !node.edgesOut.has(spec.final.name) &&\n          entry?.target &&\n          satisfies(\n            entry.target.id,\n            spec,\n            fromNode.location,\n            fromNode.projectRoot,\n            graph.monorepo,\n          )\n        ) {\n          // entry satisfied, create edge in the graph\n          graph.addEdge(type, spec, node, entry.target)\n          entry.specs.add(spec.final)\n        } else if (type === 'peerOptional') {\n          // skip unsatisfied peerOptional dependencies,\n          // just create a dangling edge\n          graph.addEdge(type, spec, node)\n        } else {\n          // could not satisfy from peer context, add to next deps\n          nextDeps.push(nextDep)\n        }\n      }\n    }\n  },\n})\n\n/**\n * Given an array of processed results for the current level dependencies\n * being placed in the currently building ideal graph, traverse its direct\n * dependencies and track peer dependencies in their appropriate peer context\n * sets, forking as needed and resolving peer dependencies using suitable\n * nodes already present in the graph if possible.\n */\nexport const postPlacementPeerCheck = (\n  graph: Graph,\n  sortedLevelResults: ProcessPlacementResult[],\n) => {\n  // Update peer contexts in a sorted manner after processing all nodes\n  // at a given level to ensure deterministic behavior when it comes to\n  // forking new peer contexts\n  for (const childDepsToProcess of sortedLevelResults) {\n    // Sort childDepsToProcess deterministically by node.id\n    const sortedChildDeps = [...childDepsToProcess].sort((a, b) =>\n      a.node.id.localeCompare(b.node.id, 'en'),\n    )\n\n    const needsForking = new Map<\n      ProcessPlacementResultEntry,\n      {\n        dependent: Node\n        spec: Spec\n        type: DependencySaveType\n      }[]\n    >()\n    // first iterate on all child deps, adding entries to the current\n    // context and collect the information on which ones need forking\n    for (const childDep of sortedChildDeps) {\n      const needsFork = childDep.updateContext.putEntries()\n      if (needsFork) {\n        needsForking.set(childDep, needsFork)\n      }\n    }\n\n    // Sort needsForking entries before iterating (Map iteration order = insertion order)\n    const sortedNeedsForkingEntries = [\n      ...needsForking.entries(),\n    ].sort(([a], [b]) => a.node.id.localeCompare(b.node.id, 'en'))\n\n    // then iterate again, forking contexts as needed but also try to\n    // reuse the context of the previous sibling if possible\n    let prevContext\n    for (const [childDep, nextEntries] of sortedNeedsForkingEntries) {\n      if (\n        prevContext &&\n        !checkEntriesToPeerContext(prevContext, nextEntries)\n      ) {\n        // the context of the previous sibling can be reused\n        addEntriesToPeerContext(\n          prevContext,\n          nextEntries,\n          childDep.node,\n          graph.monorepo,\n        )\n        childDep.peerContext = prevContext\n        continue\n      }\n      childDep.peerContext = forkPeerContext(\n        graph,\n        childDep.peerContext,\n        nextEntries,\n      )\n      prevContext = childDep.peerContext\n    }\n    // try to resolve peer dependencies now that\n    // the context is fully set up\n    for (const childDep of sortedChildDeps) {\n      childDep.updateContext.resolvePeerDeps()\n      childDep.deps = getOrderedDependencies(childDep.deps)\n    }\n  }\n}\n"]}

package/dist/ideal/refresh-ideal-graph.d.ts

@@ -0,0 +1,48 @@
+import type { PathScurry } from 'path-scurry';
+import type { PackageInfoClient } from '@vltpkg/package-info';
+import type { SpecOptions } from '@vltpkg/spec';
+import type { RollbackRemove } from '@vltpkg/rollback-remove';
+import type { BuildIdealAddOptions, BuildIdealFromGraphOptions, BuildIdealRemoveOptions, TransientAddMap, TransientRemoveMap } from './types.ts';
+import type { GraphModifier } from '../modifiers.ts';
+import type { Graph } from '../graph.ts';
+export type RefreshIdealGraphOptions = BuildIdealAddOptions & BuildIdealRemoveOptions & BuildIdealFromGraphOptions & SpecOptions & {
+    /**
+     * The graph modifiers helper object.
+     */
+    modifiers?: GraphModifier;
+    /**
+     * A {@link PathScurry} instance based on the `projectRoot` path
+     */
+    scurry: PathScurry;
+    /**
+     * 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;
+    /**
+     * Dependencies to be added to non-importer nodes when they are placed.
+     * Used for nested folder dependencies that are not importers.
+     */
+    transientAdd?: TransientAddMap;
+    /**
+     * Dependencies to be removed from non-importer nodes when they are placed.
+     * Used for nested folder dependencies that are not importers.
+     */
+    transientRemove?: TransientRemoveMap;
+};
+/**
+ * Rebuilds the provided ideal graph.
+ */
+export declare const refreshIdealGraph: ({ add, graph, modifiers, packageInfo, scurry, actual, remove, remover, transientAdd, transientRemove, ...specOptions }: RefreshIdealGraphOptions) => Promise<void>;
+/**
+ * Retrieve the next unique index for a peer context set.
+ */
+export declare const nextPeerContextIndex: () => number;
+//# sourceMappingURL=refresh-ideal-graph.d.ts.map

package/dist/ideal/refresh-ideal-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"refresh-ideal-graph.d.ts","sourceRoot":"","sources":["../../src/ideal/refresh-ideal-graph.ts"],"names":[],"mappings":"AAEA,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,EAC1B,uBAAuB,EACvB,eAAe,EACf,kBAAkB,EACnB,MAAM,YAAY,CAAA;AAEnB,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,iBAAiB,CAAA;AAEpD,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AAGxC,MAAM,MAAM,wBAAwB,GAAG,oBAAoB,GACzD,uBAAuB,GACvB,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;IAEvB;;;OAGG;IACH,YAAY,CAAC,EAAE,eAAe,CAAA;IAE9B;;;OAGG;IACH,eAAe,CAAC,EAAE,kBAAkB,CAAA;CACrC,CAAA;AAkCH;;GAEG;AACH,eAAO,MAAM,iBAAiB,2HAY3B,wBAAwB,kBAkE1B,CAAA;AAMD;;GAEG;AACH,eAAO,MAAM,oBAAoB,cAA2B,CAAA"}

package/dist/ideal/refresh-ideal-graph.js

@@ -0,0 +1,79 @@
+import { appendNodes } from "./append-nodes.js";
+import { getNodeOrderedDependencies } from "./get-ordered-dependencies.js";
+/**
+ * Returns an ordered list of importer nodes.
+ */
+const getOrderedImporters = (graph) => {
+    const orderedImporters = [...graph.importers].sort((a, b) => {
+        // sorts importers first by usage of peer deps
+        const aIsPeer = (a.manifest?.peerDependencies &&
+            Object.keys(a.manifest.peerDependencies).length > 0) ?
+            1
+            : 0;
+        const bIsPeer = (b.manifest?.peerDependencies &&
+            Object.keys(b.manifest.peerDependencies).length > 0) ?
+            1
+            : 0;
+        // importers with regular deps only first, with peer deps last
+        if (aIsPeer !== bIsPeer) {
+            return aIsPeer - bIsPeer;
+        }
+        // if both are in the same group, sort alphabetically by manifest name
+        return a.name.localeCompare(b.name, 'en');
+    });
+    return orderedImporters;
+};
+/**
+ * Rebuilds the provided ideal graph.
+ */
+export const refreshIdealGraph = async ({ add, graph, modifiers, packageInfo, scurry, actual, remove, remover, transientAdd, transientRemove, ...specOptions }) => {
+    const seen = new Set();
+    const extractPromises = [];
+    const seenExtracted = new Set();
+    // gets an ordered list of importers to ensure deterministic processing
+    const orderedImporters = getOrderedImporters(graph);
+    const depsPerImporter = new Map();
+    for (const importer of orderedImporters) {
+        // gets an ordered list of dependencies for this importer
+        // while also taking into account additions and removals
+        const deps = getNodeOrderedDependencies(importer, { add, remove });
+        depsPerImporter.set(importer, deps);
+    }
+    // removes all edges to start recalculating the graph
+    if (add.modifiedDependencies || remove.modifiedDependencies) {
+        graph.resetEdges();
+    }
+    // iterates on the list of dependencies per importer updating
+    // the graph using metadata fetch from the registry manifest files
+    for (const importer of orderedImporters) {
+        modifiers?.tryImporter(importer);
+        // gets a ref to the map of dependencies being added to this importer
+        const addedDeps = add.get(importer.id);
+        const deps = depsPerImporter.get(importer);
+        /* c8 ignore next */
+        if (!deps)
+            continue;
+        // gets a ref to the list of modifier functions for this set of deps
+        const modifierRefs = modifiers?.tryDependencies(importer, deps);
+        // Add new nodes for packages defined in the dependencies list fetching
+        // metadata from the registry manifests and updating the graph
+        await appendNodes(packageInfo, graph, importer, deps, scurry, specOptions, seen, addedDeps, modifiers, modifierRefs, extractPromises, actual, seenExtracted, remover, transientAdd, transientRemove);
+    }
+    // set default node locations, if possible
+    for (const node of graph.nodes.values()) {
+        node.setDefaultLocation();
+    }
+    // Wait for all extraction promises to complete
+    if (extractPromises.length > 0) {
+        await Promise.all(extractPromises);
+    }
+};
+/**
+ * Global index to assign unique ids used to track peer context sets.
+ */
+let peerContextIndex = 0;
+/**
+ * Retrieve the next unique index for a peer context set.
+ */
+export const nextPeerContextIndex = () => peerContextIndex++;
+//# sourceMappingURL=refresh-ideal-graph.js.map

package/dist/ideal/refresh-ideal-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"refresh-ideal-graph.js","sourceRoot":"","sources":["../../src/ideal/refresh-ideal-graph.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAC/C,OAAO,EAAE,0BAA0B,EAAE,MAAM,+BAA+B,CAAA;AA4D1E;;GAEG;AACH,MAAM,mBAAmB,GAAG,CAAC,KAAY,EAAU,EAAE;IACnD,MAAM,gBAAgB,GAAG,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1D,8CAA8C;QAC9C,MAAM,OAAO,GACX,CACE,CAAC,CAAC,QAAQ,EAAE,gBAAgB;YAC5B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,gBAAgB,CAAC,CAAC,MAAM,GAAG,CAAC,CACpD,CAAC,CAAC;YACD,CAAC;YACH,CAAC,CAAC,CAAC,CAAA;QACL,MAAM,OAAO,GACX,CACE,CAAC,CAAC,QAAQ,EAAE,gBAAgB;YAC5B,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,QAAQ,CAAC,gBAAgB,CAAC,CAAC,MAAM,GAAG,CAAC,CACpD,CAAC,CAAC;YACD,CAAC;YACH,CAAC,CAAC,CAAC,CAAA;QAEL,8DAA8D;QAC9D,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;YACxB,OAAO,OAAO,GAAG,OAAO,CAAA;QAC1B,CAAC;QAED,sEAAsE;QACtE,OAAO,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IAC3C,CAAC,CAAC,CAAA;IACF,OAAO,gBAAgB,CAAA;AACzB,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,KAAK,EAAE,EACtC,GAAG,EACH,KAAK,EACL,SAAS,EACT,WAAW,EACX,MAAM,EACN,MAAM,EACN,MAAM,EACN,OAAO,EACP,YAAY,EACZ,eAAe,EACf,GAAG,WAAW,EACW,EAAE,EAAE;IAC7B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAS,CAAA;IAC7B,MAAM,eAAe,GAA6B,EAAE,CAAA;IACpD,MAAM,aAAa,GAAG,IAAI,GAAG,EAAS,CAAA;IAEtC,uEAAuE;IACvE,MAAM,gBAAgB,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAA;IACnD,MAAM,eAAe,GAAG,IAAI,GAAG,EAAsB,CAAA;IACrD,KAAK,MAAM,QAAQ,IAAI,gBAAgB,EAAE,CAAC;QACxC,yDAAyD;QACzD,wDAAwD;QACxD,MAAM,IAAI,GAAG,0BAA0B,CAAC,QAAQ,EAAE,EAAE,GAAG,EAAE,MAAM,EAAE,CAAC,CAAA;QAClE,eAAe,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;IACrC,CAAC;IAED,qDAAqD;IACrD,IAAI,GAAG,CAAC,oBAAoB,IAAI,MAAM,CAAC,oBAAoB,EAAE,CAAC;QAC5D,KAAK,CAAC,UAAU,EAAE,CAAA;IACpB,CAAC;IAED,6DAA6D;IAC7D,kEAAkE;IAClE,KAAK,MAAM,QAAQ,IAAI,gBAAgB,EAAE,CAAC;QACxC,SAAS,EAAE,WAAW,CAAC,QAAQ,CAAC,CAAA;QAEhC,qEAAqE;QACrE,MAAM,SAAS,GAAG,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;QAEtC,MAAM,IAAI,GAAG,eAAe,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;QAC1C,oBAAoB;QACpB,IAAI,CAAC,IAAI;YAAE,SAAQ;QAEnB,oEAAoE;QACpE,MAAM,YAAY,GAAG,SAAS,EAAE,eAAe,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAA;QAE/D,uEAAuE;QACvE,8DAA8D;QAC9D,MAAM,WAAW,CACf,WAAW,EACX,KAAK,EACL,QAAQ,EACR,IAAI,EACJ,MAAM,EACN,WAAW,EACX,IAAI,EACJ,SAAS,EACT,SAAS,EACT,YAAY,EACZ,eAAe,EACf,MAAM,EACN,aAAa,EACb,OAAO,EACP,YAAY,EACZ,eAAe,CAChB,CAAA;IACH,CAAC;IAED,0CAA0C;IAC1C,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;QACxC,IAAI,CAAC,kBAAkB,EAAE,CAAA;IAC3B,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;AAED;;GAEG;AACH,IAAI,gBAAgB,GAAG,CAAC,CAAA;AACxB;;GAEG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,GAAG,EAAE,CAAC,gBAAgB,EAAE,CAAA","sourcesContent":["import { appendNodes } from './append-nodes.ts'\nimport { getNodeOrderedDependencies } from './get-ordered-dependencies.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  BuildIdealRemoveOptions,\n  TransientAddMap,\n  TransientRemoveMap,\n} from './types.ts'\nimport type { Dependency } from '../dependencies.ts'\nimport type { GraphModifier } from '../modifiers.ts'\nimport type { ExtractResult } from '../reify/extract-node.ts'\nimport type { Graph } from '../graph.ts'\nimport type { Node } from '../node.ts'\n\nexport type RefreshIdealGraphOptions = BuildIdealAddOptions &\n  BuildIdealRemoveOptions &\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     * Dependencies to be added to non-importer nodes when they are placed.\n     * Used for nested folder dependencies that are not importers.\n     */\n    transientAdd?: TransientAddMap\n\n    /**\n     * Dependencies to be removed from non-importer nodes when they are placed.\n     * Used for nested folder dependencies that are not importers.\n     */\n    transientRemove?: TransientRemoveMap\n  }\n\n/**\n * Returns an ordered list of importer nodes.\n */\nconst getOrderedImporters = (graph: Graph): Node[] => {\n  const orderedImporters = [...graph.importers].sort((a, b) => {\n    // sorts importers first by usage of peer deps\n    const aIsPeer =\n      (\n        a.manifest?.peerDependencies &&\n        Object.keys(a.manifest.peerDependencies).length > 0\n      ) ?\n        1\n      : 0\n    const bIsPeer =\n      (\n        b.manifest?.peerDependencies &&\n        Object.keys(b.manifest.peerDependencies).length > 0\n      ) ?\n        1\n      : 0\n\n    // importers with regular deps only first, with peer deps last\n    if (aIsPeer !== bIsPeer) {\n      return aIsPeer - bIsPeer\n    }\n\n    // if both are in the same group, sort alphabetically by manifest name\n    return a.name.localeCompare(b.name, 'en')\n  })\n  return orderedImporters\n}\n\n/**\n * Rebuilds the provided ideal graph.\n */\nexport const refreshIdealGraph = async ({\n  add,\n  graph,\n  modifiers,\n  packageInfo,\n  scurry,\n  actual,\n  remove,\n  remover,\n  transientAdd,\n  transientRemove,\n  ...specOptions\n}: RefreshIdealGraphOptions) => {\n  const seen = new Set<DepID>()\n  const extractPromises: Promise<ExtractResult>[] = []\n  const seenExtracted = new Set<DepID>()\n\n  // gets an ordered list of importers to ensure deterministic processing\n  const orderedImporters = getOrderedImporters(graph)\n  const depsPerImporter = new Map<Node, Dependency[]>()\n  for (const importer of orderedImporters) {\n    // gets an ordered list of dependencies for this importer\n    // while also taking into account additions and removals\n    const deps = getNodeOrderedDependencies(importer, { add, remove })\n    depsPerImporter.set(importer, deps)\n  }\n\n  // removes all edges to start recalculating the graph\n  if (add.modifiedDependencies || remove.modifiedDependencies) {\n    graph.resetEdges()\n  }\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 importer of orderedImporters) {\n    modifiers?.tryImporter(importer)\n\n    // gets a ref to the map of dependencies being added to this importer\n    const addedDeps = add.get(importer.id)\n\n    const deps = depsPerImporter.get(importer)\n    /* c8 ignore next */\n    if (!deps) continue\n\n    // gets a ref to the list of modifier functions for this set of deps\n    const modifierRefs = modifiers?.tryDependencies(importer, deps)\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      packageInfo,\n      graph,\n      importer,\n      deps,\n      scurry,\n      specOptions,\n      seen,\n      addedDeps,\n      modifiers,\n      modifierRefs,\n      extractPromises,\n      actual,\n      seenExtracted,\n      remover,\n      transientAdd,\n      transientRemove,\n    )\n  }\n\n  // set default node locations, if possible\n  for (const node of graph.nodes.values()) {\n    node.setDefaultLocation()\n  }\n\n  // Wait for all extraction promises to complete\n  if (extractPromises.length > 0) {\n    await Promise.all(extractPromises)\n  }\n}\n\n/**\n * Global index to assign unique ids used to track peer context sets.\n */\nlet peerContextIndex = 0\n/**\n * Retrieve the next unique index for a peer context set.\n */\nexport const nextPeerContextIndex = () => peerContextIndex++\n"]}

package/dist/ideal/remove-satisfied-specs.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"remove-satisfied-specs.d.ts","sourceRoot":"","sources":["../../src/ideal/remove-satisfied-specs.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EACV,oBAAoB,EACpB,0BAA0B,EAC3B,MAAM,YAAY,CAAA;AAEnB,MAAM,MAAM,2BAA2B,GAAG,oBAAoB,GAC5D,0BAA0B,CAAA;AAE5B;;;GAGG;AACH,eAAO,MAAM,oBAAoB,oBAG9B,2BAA2B,SAqC7B,CAAA"}

package/dist/ideal/remove-satisfied-specs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"remove-satisfied-specs.js","sourceRoot":"","sources":["../../src/ideal/remove-satisfied-specs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,KAAK,EAAE,MAAM,qBAAqB,CAAA;AAC3C,OAAO,EAAE,SAAS,EAAE,MAAM,mBAAmB,CAAA;AAS7C;;;GAGG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,EACnC,GAAG,EACH,KAAK,GACuB,EAAE,EAAE;IAChC,KAAK,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC,IAAI,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC;QAClD,MAAM,QAAQ,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,CAAA;QACvC,IAAI,CAAC,QAAQ,EAAE,CAAC;YACd,MAAM,KAAK,CAAC,8CAA8C,EAAE;gBAC1D,KAAK,EAAE,KAAK;aACb,CAAC,CAAA;QACJ,CAAC;QACD,KAAK,MAAM,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,YAAY,EAAE,CAAC;YAC9C,MAAM,IAAI,GAAG,QAAQ,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;YACxC,IAAI,CAAC,IAAI,EAAE,CAAC;gBACV,6BAA6B;gBAC7B,SAAQ;YACV,CAAC;YAED,kEAAkE;YAClE,kEAAkE;YAClE,IACE,SAAS,CACP,IAAI,CAAC,EAAE,EAAE,EAAE,EACX,UAAU,CAAC,IAAI,EACf,IAAI,CAAC,IAAI,CAAC,QAAQ,EAClB,KAAK,CAAC,WAAW,EACjB,KAAK,CAAC,QAAQ,CACf,EACD,CAAC;gBACD,YAAY,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAC3B,CAAC;QACH,CAAC;IACH,CAAC;IAED,iEAAiE;IACjE,KAAK,MAAM,CAAC,KAAK,EAAE,YAAY,CAAC,IAAI,GAAG,CAAC,OAAO,EAAE,EAAE,CAAC;QAClD,IAAI,YAAY,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC;YAC5B,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAA;QACnB,CAAC;IACH,CAAC;AACH,CAAC,CAAA","sourcesContent":["import { error } from '@vltpkg/error-cause'\nimport { satisfies } from '@vltpkg/satisfies'\nimport type {\n  BuildIdealAddOptions,\n  BuildIdealFromGraphOptions,\n} from './types.ts'\n\nexport type RemoveSatisfiedSpecsOptions = BuildIdealAddOptions &\n  BuildIdealFromGraphOptions\n\n/**\n * Traverse the objects defined in `add` and removes any references to specs\n * that are already satisfied by the contents of the actual `graph`.\n */\nexport const removeSatisfiedSpecs = ({\n  add,\n  graph,\n}: RemoveSatisfiedSpecsOptions) => {\n  for (const [depID, dependencies] of add.entries()) {\n    const importer = graph.nodes.get(depID)\n    if (!importer) {\n      throw error('Referred importer node id could not be found', {\n        found: depID,\n      })\n    }\n    for (const [name, dependency] of dependencies) {\n      const edge = importer.edgesOut.get(name)\n      if (!edge) {\n        // brand new edge being added\n        continue\n      }\n\n      // If the current graph edge is already valid, then we remove that\n      // dependency item from the list of items to be added to the graph\n      if (\n        satisfies(\n          edge.to?.id,\n          dependency.spec,\n          edge.from.location,\n          graph.projectRoot,\n          graph.monorepo,\n        )\n      ) {\n        dependencies.delete(name)\n      }\n    }\n  }\n\n  // Removes any references to an importer that no longer has specs\n  for (const [depID, dependencies] of add.entries()) {\n    if (dependencies.size === 0) {\n      add.delete(depID)\n    }\n  }\n}\n"]}