@vltpkg/graph 1.0.0-rc.2 → 1.0.0-rc.22

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

@@ -1,39 +0,0 @@
-import { error } from '@vltpkg/error-cause';
-import { appendNodes } from "./append-nodes.js";
-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, 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) {
-        const importer = graph.nodes.get(depID);
-        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()];
-        for (const dep of deps) {
-            const { spec } = dep;
-            const existingEdge = importer.edgesOut.get(spec.name);
-            dep.type = resolveSaveType(importer, spec.name, dep.type);
-            const node = existingEdge?.to;
-            if (node)
-                graph.removeNode(node);
-        }
-        // 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, 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 +0,0 @@
-{"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

@@ -1,19 +0,0 @@
-import type { DepID } from '@vltpkg/dep-id';
-import type { PackageInfoClient } from '@vltpkg/package-info';
-import type { SpecOptions } from '@vltpkg/spec';
-import type { PathScurry } from 'path-scurry';
-import type { Dependency } from '../dependencies.ts';
-import type { Graph } from '../graph.ts';
-import type { Node } from '../node.ts';
-import type { GraphModifier, ModifierActiveEntry } from '../modifiers.ts';
-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 +0,0 @@
-{"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"}

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

@@ -1,289 +0,0 @@
-import { joinDepIDTuple } from '@vltpkg/dep-id';
-import { error } from '@vltpkg/error-cause';
-import { Spec } from '@vltpkg/spec';
-import { longDependencyTypes, normalizeManifest } from '@vltpkg/types';
-import { asDependency, shorten } from "../dependencies.js";
-import { removeOptionalSubgraph } from "../remove-optional-subgraph.js";
-import { extractNode } from "../reify/extract-node.js";
-/**
- * Only install devDeps for git dependencies and importers
- * Everything else always gets installed
- */
-const shouldInstallDepType = (node, depType) => depType !== 'devDependencies' ||
-    node.importer ||
-    node.id.startsWith('git');
-/**
- * Retrieve the {@link DepID} and location for a `file:` type {@link Node}.
- */
-const getFileTypeInfo = (spec, fromNode, scurry) => {
-    const f = spec.final;
-    if (f.type !== 'file')
-        return;
-    /* c8 ignore start - should be impossible */
-    if (!f.file) {
-        throw error('no path on file specifier', { spec });
-    }
-    /* c8 ignore stop */
-    // Given that both linked folders and local tarballs (both defined with
-    // usage of the `file:` spec prefix) location needs to be relative to their
-    // parents, build the expected path and use it for both location and id
-    const target = scurry.cwd.resolve(fromNode.location).resolve(f.file);
-    const path = target.relativePosix();
-    const id = joinDepIDTuple(['file', path]);
-    return {
-        path,
-        id,
-        isDirectory: !!target.lstatSync()?.isDirectory(),
-    };
-};
-const isStringArray = (a) => Array.isArray(a) && !a.some(b => typeof b !== 'string');
-/**
- * Fetch manifests for dependencies and create placement tasks.
- */
-const fetchManifestsForDeps = async (packageInfo, graph, fromNode, deps, scurry, modifierRefs, depth = 0) => {
-    // Create fetch tasks for all dependencies at this level
-    const fetchTasks = [];
-    for (const { spec: originalSpec, type } of deps) {
-        let spec = originalSpec;
-        const fileTypeInfo = getFileTypeInfo(spec, fromNode, scurry);
-        const activeModifier = modifierRefs?.get(spec.name);
-        // here is the place we swap specs if a edge modifier was defined
-        const queryModifier = activeModifier?.modifier.query;
-        const completeModifier = activeModifier &&
-            activeModifier.interactiveBreadcrumb.current ===
-                activeModifier.modifier.breadcrumb.last;
-        if (queryModifier &&
-            completeModifier &&
-            'spec' in activeModifier.modifier) {
-            spec = activeModifier.modifier.spec;
-            if (spec.bareSpec === '-') {
-                continue;
-            }
-        }
-        const existingNode = graph.findResolution(spec, fromNode, queryModifier);
-        if (existingNode) {
-            // For peerOptional dependencies, create a dangling edge instead of linking to existing node
-            if (type === 'peerOptional') {
-                /* c8 ignore next 3 */
-                // This case happens when peerOptional dep already exists in graph
-                graph.addEdge(type, spec, fromNode);
-            }
-            else {
-                graph.addEdge(type, spec, fromNode, existingNode);
-            }
-            continue;
-        }
-        const edgeOptional = type === 'optional' || type === 'peerOptional';
-        // Start manifest fetch immediately for parallel processing
-        const manifestPromise = packageInfo
-            .manifest(spec, { from: scurry.resolve(fromNode.location) })
-            .then(manifest => manifest)
-            .catch((er) => {
-            // optional deps ignored if inaccessible
-            if (edgeOptional || fromNode.optional) {
-                return undefined;
-            }
-            throw er;
-        });
-        const fetchTask = {
-            spec,
-            type,
-            fromNode,
-            fileTypeInfo,
-            activeModifier,
-            queryModifier,
-            edgeOptional,
-            manifestPromise,
-            depth,
-        };
-        fetchTasks.push(fetchTask);
-    }
-    // Create placement tasks
-    const placementTasks = [];
-    for (const fetchTask of fetchTasks) {
-        const manifest = await fetchTask.manifestPromise;
-        placementTasks.push({
-            fetchTask,
-            manifest,
-        });
-    }
-    return placementTasks;
-};
-/**
- * Process placement tasks and collect child dependencies
- */
-const processPlacementTasks = async (add, graph, options, placementTasks, modifiers, scurry, packageInfo, extractPromises, actual, seenExtracted, remover) => {
-    const childDepsToProcess = [];
-    for (const placementTask of placementTasks) {
-        const { fetchTask, manifest } = placementTask;
-        let { spec } = fetchTask;
-        const type = fetchTask.type;
-        const fromNode = fetchTask.fromNode;
-        const fileTypeInfo = fetchTask.fileTypeInfo;
-        const activeModifier = fetchTask.activeModifier;
-        const queryModifier = fetchTask.queryModifier;
-        const edgeOptional = fetchTask.edgeOptional;
-        // Handle nameless dependencies
-        if (manifest?.name && spec.name === '(unknown)') {
-            const s = add.get(String(spec));
-            if (s) {
-                // removes the previous, placeholder entry key
-                add.delete(String(spec));
-                // replaces spec with a version with the correct name
-                spec = Spec.parse(manifest.name, spec.bareSpec, options);
-                // updates the add map with the fixed up spec
-                const n = asDependency({
-                    ...s,
-                    spec,
-                });
-                add.set(manifest.name, n);
-            }
-        }
-        // handles missing manifest resolution
-        if (!manifest) {
-            if (!edgeOptional && fromNode.isOptional()) {
-                // failed resolution of a non-optional dep of an optional node
-                // have to clean up the dependents
-                removeOptionalSubgraph(graph, fromNode);
-                continue;
-            }
-            else if (edgeOptional) {
-                // failed resolution of an optional dep, just ignore it,
-                // nothing to prune because we never added it in the first place.
-                continue;
-            }
-            else {
-                throw error('failed to resolve dependency', {
-                    spec,
-                    from: fromNode.location,
-                });
-            }
-        }
-        // Skip placing peerOptional dependencies, just create a dangling edge
-        if (type === 'peerOptional') {
-            /* c8 ignore next 3 */
-            graph.addEdge(type, spec, fromNode);
-            continue;
-        }
-        // places a new node in the graph representing a newly seen dependency
-        const node = graph.placePackage(fromNode, type, spec, normalizeManifest(manifest), fileTypeInfo?.id, queryModifier);
-        /* c8 ignore start - not possible, already ensured manifest */
-        if (!node) {
-            throw error('failed to place package', {
-                from: fromNode.location,
-                spec,
-            });
-        }
-        /* c8 ignore stop */
-        // update the node modifier tracker
-        if (activeModifier) {
-            modifiers?.updateActiveEntry(node, activeModifier);
-        }
-        // Extract the node if it doesn't exist in the actual graph and we have the necessary parameters
-        if (remover &&
-            extractPromises &&
-            actual &&
-            scurry &&
-            packageInfo &&
-            node.inVltStore() &&
-            !node.isOptional()) {
-            /* c8 ignore start */
-            if (seenExtracted?.has(node.id)) {
-                continue;
-            }
-            /* c8 ignore stop */
-            seenExtracted?.add(node.id);
-            const actualNode = actual.nodes.get(node.id);
-            if (!actualNode?.equals(node)) {
-                // Extract the node without awaiting - push the promise to the array
-                const extractPromise = extractNode(node, scurry, remover, options, packageInfo);
-                extractPromises.push(extractPromise);
-            }
-        }
-        // updates graph node information
-        if (fileTypeInfo?.path && fileTypeInfo.isDirectory) {
-            node.location = fileTypeInfo.path;
-        }
-        node.setResolved();
-        // Collect child dependencies for processing in the next level
-        const bundleDeps = manifest.bundleDependencies;
-        const bundled = new Set((node.id.startsWith('git') ||
-            node.importer ||
-            !isStringArray(bundleDeps)) ?
-            []
-            : bundleDeps);
-        // recursively process all child dependencies in the manifest
-        const nextDeps = [];
-        for (const depTypeName of longDependencyTypes) {
-            const depRecord = manifest[depTypeName];
-            if (depRecord && shouldInstallDepType(node, depTypeName)) {
-                for (const [name, bareSpec] of Object.entries(depRecord)) {
-                    if (bundled.has(name))
-                        continue;
-                    nextDeps.push({
-                        type: shorten(depTypeName, name, manifest),
-                        spec: Spec.parse(name, bareSpec, {
-                            ...options,
-                            registry: spec.registry,
-                        }),
-                    });
-                }
-            }
-        }
-        if (nextDeps.length > 0) {
-            childDepsToProcess.push({
-                node,
-                deps: nextDeps,
-                modifierRefs: modifiers?.tryDependencies(node, nextDeps),
-            });
-        }
-    }
-    return { childDepsToProcess };
-};
-/**
- * Append new nodes in the given `graph` for dependencies specified at `add`
- * and missing dependencies from the `deps` parameter.
- *
- * It also applies any modifiers that applies to a given node as it processes
- * and builds the graph.
- */
-export const appendNodes = async (add, packageInfo, graph, fromNode, deps, scurry, options, seen, modifiers, modifierRefs, extractPromises, actual, seenExtracted, remover) => {
-    /* c8 ignore next */
-    if (seen.has(fromNode.id))
-        return;
-    seen.add(fromNode.id);
-    // Use a queue for breadth-first processing
-    let currentLevelDeps = [
-        { node: fromNode, deps, modifierRefs, depth: 0 },
-    ];
-    while (currentLevelDeps.length > 0) {
-        const nextLevelDeps = [];
-        // Process all nodes at the current level in parallel
-        const levelResults = await Promise.all(currentLevelDeps.map(async ({ node, deps: nodeDeps, modifierRefs: nodeModifierRefs, depth, }) => {
-            // Mark node as seen when we start processing its dependencies
-            seen.add(node.id);
-            // Fetch manifests for this node's dependencies
-            const placementTasks = await fetchManifestsForDeps(packageInfo, graph, node, 
-            // Sort dependencies by spec.name for deterministic ordering
-            nodeDeps.sort((a, b) => a.spec.name.localeCompare(b.spec.name, 'en')), scurry, nodeModifierRefs, depth);
-            // Process the placement tasks and get child dependencies
-            return await processPlacementTasks(add, graph, options, placementTasks, modifiers, scurry, packageInfo, extractPromises, actual, seenExtracted, remover);
-        }));
-        // Collect all child dependencies for the next level
-        for (const { childDepsToProcess } of levelResults) {
-            for (const childDep of childDepsToProcess) {
-                if (!seen.has(childDep.node.id)) {
-                    /* c8 ignore next */
-                    const currentDepth = currentLevelDeps[0]?.depth ?? 0;
-                    nextLevelDeps.push({
-                        ...childDep,
-                        depth: currentDepth + 1,
-                    });
-                }
-            }
-        }
-        // Move to the next level
-        currentLevelDeps = nextLevelDeps;
-    }
-};
-//# sourceMappingURL=append-nodes.js.map

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

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

package/dist/esm/ideal/build-ideal-from-starting-graph.d.ts

@@ -1,15 +0,0 @@
-import type { Graph } from '../graph.ts';
-import type { AddNodesOptions } from './add-nodes.ts';
-import type { RemoveNodesOptions } from './remove-nodes.ts';
-export type BuildIdealFromStartingGraphOptions = AddNodesOptions & RemoveNodesOptions & {
-    projectRoot: string;
-};
-/**
- * Builds an ideal {@link Graph} representing the dependencies that
- * should be present in order to fulfill the requirements defined
- * by the `package.json` and `vlt-lock.json` files using the `graph` set
- * in options as a starting point. Also add / remove any dependencies
- * listed in the `add` and `remove` properties.
- */
-export declare const buildIdealFromStartingGraph: (options: BuildIdealFromStartingGraphOptions) => Promise<Graph>;
-//# sourceMappingURL=build-ideal-from-starting-graph.d.ts.map

package/dist/esm/ideal/build-ideal-from-starting-graph.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"build-ideal-from-starting-graph.d.ts","sourceRoot":"","sources":["../../../src/ideal/build-ideal-from-starting-graph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AAGxC,OAAO,KAAK,EAAE,eAAe,EAAE,MAAM,gBAAgB,CAAA;AAErD,OAAO,KAAK,EAAE,kBAAkB,EAAE,MAAM,mBAAmB,CAAA;AAE3D,MAAM,MAAM,kCAAkC,GAAG,eAAe,GAC9D,kBAAkB,GAAG;IACnB,WAAW,EAAE,MAAM,CAAA;CACpB,CAAA;AAEH;;;;;;GAMG;AACH,eAAO,MAAM,2BAA2B,YAC7B,kCAAkC,KAC1C,OAAO,CAAC,KAAK,CAoDf,CAAA"}

package/dist/esm/ideal/build-ideal-from-starting-graph.js

@@ -1,55 +0,0 @@
-import { getImporterSpecs } from "./get-importer-specs.js";
-import { addNodes } from "./add-nodes.js";
-import { removeNodes } from "./remove-nodes.js";
-/**
- * Builds an ideal {@link Graph} representing the dependencies that
- * should be present in order to fulfill the requirements defined
- * by the `package.json` and `vlt-lock.json` files using the `graph` set
- * in options as a starting point. Also add / remove any dependencies
- * listed in the `add` and `remove` properties.
- */
-export const buildIdealFromStartingGraph = async (options) => {
-    // Gets a map of dependencies that are keyed to its importer node ids,
-    // merging values already found in the graph with user specified values.
-    // Any dependencies that are already satisfied in the starting `graph`
-    // are going to be pruned from the resulting object.
-    const importerSpecs = getImporterSpecs(options);
-    // merge modifiedDependencies flags
-    options.add.modifiedDependencies =
-        options.add.modifiedDependencies ||
-            importerSpecs.add.modifiedDependencies;
-    options.remove.modifiedDependencies =
-        options.remove.modifiedDependencies ||
-            importerSpecs.remove.modifiedDependencies;
-    // merge values found on importer specs with
-    // user-provided values from `options.add`
-    for (const [importerId, deps] of importerSpecs.add) {
-        if (!options.add.has(importerId)) {
-            options.add.set(importerId, deps);
-            continue;
-        }
-        // merge any deps found when reading the importers manifest
-        // with the ones provided by the user in the `add` options,
-        // user-provided deps should take precedence
-        for (const [depName, dep] of deps) {
-            if (!options.add.get(importerId)?.has(depName)) {
-                options.add.get(importerId)?.set(depName, dep);
-            }
-        }
-    }
-    // hydrate the resolution cache
-    if (options.add.modifiedDependencies) {
-        options.graph.resetResolution();
-        // add nodes, fetching remote manifests for each dependency to be added
-        await addNodes(options);
-        // move things into their default locations, if possible
-        for (const node of options.graph.nodes.values()) {
-            node.setDefaultLocation();
-        }
-    }
-    // removes any dependencies that are listed in the `remove` option
-    removeNodes({ ...options, remove: importerSpecs.remove });
-    options.graph.gc();
-    return options.graph;
-};
-//# sourceMappingURL=build-ideal-from-starting-graph.js.map

package/dist/esm/ideal/build-ideal-from-starting-graph.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"build-ideal-from-starting-graph.js","sourceRoot":"","sources":["../../../src/ideal/build-ideal-from-starting-graph.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAA;AAC1D,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AAEzC,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAQ/C;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,2BAA2B,GAAG,KAAK,EAC9C,OAA2C,EAC3B,EAAE;IAClB,sEAAsE;IACtE,wEAAwE;IACxE,sEAAsE;IACtE,oDAAoD;IACpD,MAAM,aAAa,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAA;IAE/C,mCAAmC;IACnC,OAAO,CAAC,GAAG,CAAC,oBAAoB;QAC9B,OAAO,CAAC,GAAG,CAAC,oBAAoB;YAChC,aAAa,CAAC,GAAG,CAAC,oBAAoB,CAAA;IACxC,OAAO,CAAC,MAAM,CAAC,oBAAoB;QACjC,OAAO,CAAC,MAAM,CAAC,oBAAoB;YACnC,aAAa,CAAC,MAAM,CAAC,oBAAoB,CAAA;IAE3C,4CAA4C;IAC5C,0CAA0C;IAC1C,KAAK,MAAM,CAAC,UAAU,EAAE,IAAI,CAAC,IAAI,aAAa,CAAC,GAAG,EAAE,CAAC;QACnD,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,CAAC;YACjC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,EAAE,IAAI,CAAC,CAAA;YACjC,SAAQ;QACV,CAAC;QAED,2DAA2D;QAC3D,2DAA2D;QAC3D,4CAA4C;QAC5C,KAAK,MAAM,CAAC,OAAO,EAAE,GAAG,CAAC,IAAI,IAAI,EAAE,CAAC;YAClC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC/C,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,UAAU,CAAC,EAAE,GAAG,CAAC,OAAO,EAAE,GAAG,CAAC,CAAA;YAChD,CAAC;QACH,CAAC;IACH,CAAC;IAED,+BAA+B;IAC/B,IAAI,OAAO,CAAC,GAAG,CAAC,oBAAoB,EAAE,CAAC;QACrC,OAAO,CAAC,KAAK,CAAC,eAAe,EAAE,CAAA;QAE/B,uEAAuE;QACvE,MAAM,QAAQ,CAAC,OAAO,CAAC,CAAA;QAEvB,wDAAwD;QACxD,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,EAAE,CAAC;YAChD,IAAI,CAAC,kBAAkB,EAAE,CAAA;QAC3B,CAAC;IACH,CAAC;IAED,kEAAkE;IAClE,WAAW,CAAC,EAAE,GAAG,OAAO,EAAE,MAAM,EAAE,aAAa,CAAC,MAAM,EAAE,CAAC,CAAA;IAEzD,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,CAAA;IAElB,OAAO,OAAO,CAAC,KAAK,CAAA;AACtB,CAAC,CAAA","sourcesContent":["import type { Graph } from '../graph.ts'\nimport { getImporterSpecs } from './get-importer-specs.ts'\nimport { addNodes } from './add-nodes.ts'\nimport type { AddNodesOptions } from './add-nodes.ts'\nimport { removeNodes } from './remove-nodes.ts'\nimport type { RemoveNodesOptions } from './remove-nodes.ts'\n\nexport type BuildIdealFromStartingGraphOptions = AddNodesOptions &\n  RemoveNodesOptions & {\n    projectRoot: string\n  }\n\n/**\n * Builds an ideal {@link Graph} representing the dependencies that\n * should be present in order to fulfill the requirements defined\n * by the `package.json` and `vlt-lock.json` files using the `graph` set\n * in options as a starting point. Also add / remove any dependencies\n * listed in the `add` and `remove` properties.\n */\nexport const buildIdealFromStartingGraph = async (\n  options: BuildIdealFromStartingGraphOptions,\n): Promise<Graph> => {\n  // Gets a map of dependencies that are keyed to its importer node ids,\n  // merging values already found in the graph with user specified values.\n  // Any dependencies that are already satisfied in the starting `graph`\n  // are going to be pruned from the resulting object.\n  const importerSpecs = getImporterSpecs(options)\n\n  // merge modifiedDependencies flags\n  options.add.modifiedDependencies =\n    options.add.modifiedDependencies ||\n    importerSpecs.add.modifiedDependencies\n  options.remove.modifiedDependencies =\n    options.remove.modifiedDependencies ||\n    importerSpecs.remove.modifiedDependencies\n\n  // merge values found on importer specs with\n  // user-provided values from `options.add`\n  for (const [importerId, deps] of importerSpecs.add) {\n    if (!options.add.has(importerId)) {\n      options.add.set(importerId, deps)\n      continue\n    }\n\n    // merge any deps found when reading the importers manifest\n    // with the ones provided by the user in the `add` options,\n    // user-provided deps should take precedence\n    for (const [depName, dep] of deps) {\n      if (!options.add.get(importerId)?.has(depName)) {\n        options.add.get(importerId)?.set(depName, dep)\n      }\n    }\n  }\n\n  // hydrate the resolution cache\n  if (options.add.modifiedDependencies) {\n    options.graph.resetResolution()\n\n    // add nodes, fetching remote manifests for each dependency to be added\n    await addNodes(options)\n\n    // move things into their default locations, if possible\n    for (const node of options.graph.nodes.values()) {\n      node.setDefaultLocation()\n    }\n  }\n\n  // removes any dependencies that are listed in the `remove` option\n  removeNodes({ ...options, remove: importerSpecs.remove })\n\n  options.graph.gc()\n\n  return options.graph\n}\n"]}

package/dist/esm/ideal/build.d.ts

@@ -1,41 +0,0 @@
-import type { PackageInfoClient } from '@vltpkg/package-info';
-import type { LoadOptions as LoadActualOptions } from '../actual/load.ts';
-import type { AddImportersDependenciesMap, RemoveImportersDependenciesMap } from '../dependencies.ts';
-import type { Graph } from '../graph.ts';
-import type { RollbackRemove } from '@vltpkg/rollback-remove';
-export type BuildIdealOptions = LoadActualOptions & {
-    /**
-     * An actual graph
-     */
-    actual?: Graph;
-    /**
-     * A `Map` in which keys are {@link DepID} linking to another `Map` in which
-     * keys are the dependency names and values are {@link Dependency}. This
-     * structure represents dependencies that need to be added to the importer
-     * represented by {@link DepID}.
-     */
-    add?: AddImportersDependenciesMap;
-    /**
-     * A `Map` object representing nodes to be removed from the ideal graph.
-     * Each {@link DepID} key represents an importer node and the `Set` of
-     * dependency names to be removed from its dependency list.
-     */
-    remove?: RemoveImportersDependenciesMap;
-    /**
-     * A {@link RollbackRemove} instance to handle extraction rollbacks
-     */
-    remover: RollbackRemove;
-    /**
-     * A {@link PackageInfoClient} instance to read manifest info from.
-     */
-    packageInfo: PackageInfoClient;
-};
-/**
- * Builds an ideal {@link Graph} representing the dependencies that
- * should be present in order to fulfill the requirements defined
- * by the `package.json` and `vlt-lock.json` files using either the
- * virtual or actual graph as a starting point. Also add / remove any
- * dependencies listed in the `add` and `remove` properties.
- */
-export declare const build: (options: BuildIdealOptions) => Promise<Graph>;
-//# sourceMappingURL=build.d.ts.map

package/dist/esm/ideal/build.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"build.d.ts","sourceRoot":"","sources":["../../../src/ideal/build.ts"],"names":[],"mappings":"AAIA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAC7D,OAAO,KAAK,EAAE,WAAW,IAAI,iBAAiB,EAAE,MAAM,mBAAmB,CAAA;AACzE,OAAO,KAAK,EACV,2BAA2B,EAC3B,8BAA8B,EAE/B,MAAM,oBAAoB,CAAA;AAC3B,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,aAAa,CAAA;AAExC,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAA;AAK7D,MAAM,MAAM,iBAAiB,GAAG,iBAAiB,GAAG;IAClD;;OAEG;IACH,MAAM,CAAC,EAAE,KAAK,CAAA;IACd;;;;;OAKG;IACH,GAAG,CAAC,EAAE,2BAA2B,CAAA;IACjC;;;;OAIG;IACH,MAAM,CAAC,EAAE,8BAA8B,CAAA;IACvC;;OAEG;IACH,OAAO,EAAE,cAAc,CAAA;IACvB;;OAEG;IACH,WAAW,EAAE,iBAAiB,CAAA;CAC/B,CAAA;AAED;;;;;;GAMG;AACH,eAAO,MAAM,KAAK,YACP,iBAAiB,KACzB,OAAO,CAAC,KAAK,CAoCf,CAAA"}

package/dist/esm/ideal/build.js

@@ -1,48 +0,0 @@
-import { graphStep } from '@vltpkg/output';
-import { load as loadActual } from "../actual/load.js";
-import { load as loadVirtual } from "../lockfile/load.js";
-import { buildIdealFromStartingGraph } from "./build-ideal-from-starting-graph.js";
-const getMap = (m) => m ?? new Map();
-/**
- * Builds an ideal {@link Graph} representing the dependencies that
- * should be present in order to fulfill the requirements defined
- * by the `package.json` and `vlt-lock.json` files using either the
- * virtual or actual graph as a starting point. Also add / remove any
- * dependencies listed in the `add` and `remove` properties.
- */
-export const build = async (options) => {
-    const done = graphStep('build');
-    // Creates the shared instances that are going to be used
-    // in both the loader methods and the build graph
-    const { packageInfo, packageJson, scurry, monorepo } = options;
-    const mainManifest = options.mainManifest ?? packageJson.read(options.projectRoot);
-    let graph;
-    try {
-        graph = loadVirtual({
-            ...options,
-            mainManifest,
-            monorepo,
-            skipLoadingNodesOnModifiersChange: true,
-        });
-    }
-    catch {
-        graph = loadActual({
-            ...options,
-            mainManifest,
-            monorepo,
-            skipLoadingNodesOnModifiersChange: true,
-        });
-    }
-    const res = await buildIdealFromStartingGraph({
-        ...options,
-        scurry,
-        add: getMap(options.add),
-        graph,
-        packageInfo,
-        remove: getMap(options.remove),
-        actual: options.actual,
-    });
-    done();
-    return res;
-};
-//# sourceMappingURL=build.js.map

package/dist/esm/ideal/build.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"build.js","sourceRoot":"","sources":["../../../src/ideal/build.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAC1C,OAAO,EAAE,IAAI,IAAI,UAAU,EAAE,MAAM,mBAAmB,CAAA;AACtD,OAAO,EAAE,IAAI,IAAI,WAAW,EAAE,MAAM,qBAAqB,CAAA;AACzD,OAAO,EAAE,2BAA2B,EAAE,MAAM,sCAAsC,CAAA;AAYlF,MAAM,MAAM,GAAG,CAA0B,CAAK,EAAE,EAAE,CAChD,CAAC,IAAK,IAAI,GAAG,EAAQ,CAAA;AA8BvB;;;;;;GAMG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,KAAK,EACxB,OAA0B,EACV,EAAE;IAClB,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,CAAA;IAE/B,yDAAyD;IACzD,iDAAiD;IACjD,MAAM,EAAE,WAAW,EAAE,WAAW,EAAE,MAAM,EAAE,QAAQ,EAAE,GAAG,OAAO,CAAA;IAC9D,MAAM,YAAY,GAChB,OAAO,CAAC,YAAY,IAAI,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAA;IAC/D,IAAI,KAAK,CAAA;IACT,IAAI,CAAC;QACH,KAAK,GAAG,WAAW,CAAC;YAClB,GAAG,OAAO;YACV,YAAY;YACZ,QAAQ;YACR,iCAAiC,EAAE,IAAI;SACxC,CAAC,CAAA;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,KAAK,GAAG,UAAU,CAAC;YACjB,GAAG,OAAO;YACV,YAAY;YACZ,QAAQ;YACR,iCAAiC,EAAE,IAAI;SACxC,CAAC,CAAA;IACJ,CAAC;IAED,MAAM,GAAG,GAAG,MAAM,2BAA2B,CAAC;QAC5C,GAAG,OAAO;QACV,MAAM;QACN,GAAG,EAAE,MAAM,CAAC,OAAO,CAAC,GAAG,CAAC;QACxB,KAAK;QACL,WAAW;QACX,MAAM,EAAE,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC;QAC9B,MAAM,EAAE,OAAO,CAAC,MAAM;KACvB,CAAC,CAAA;IACF,IAAI,EAAE,CAAA;IACN,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA","sourcesContent":["import { graphStep } from '@vltpkg/output'\nimport { load as loadActual } from '../actual/load.ts'\nimport { load as loadVirtual } from '../lockfile/load.ts'\nimport { buildIdealFromStartingGraph } from './build-ideal-from-starting-graph.ts'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport type { LoadOptions as LoadActualOptions } from '../actual/load.ts'\nimport type {\n  AddImportersDependenciesMap,\n  RemoveImportersDependenciesMap,\n  Dependency,\n} from '../dependencies.ts'\nimport type { Graph } from '../graph.ts'\nimport type { DepID } from '@vltpkg/dep-id'\nimport type { RollbackRemove } from '@vltpkg/rollback-remove'\n\nconst getMap = <T extends Map<any, any>>(m?: T) =>\n  m ?? (new Map() as T)\n\nexport type BuildIdealOptions = LoadActualOptions & {\n  /**\n   * An actual graph\n   */\n  actual?: Graph\n  /**\n   * A `Map` in which keys are {@link DepID} linking to another `Map` in which\n   * keys are the dependency names and values are {@link Dependency}. This\n   * structure represents dependencies that need to be added to the importer\n   * represented by {@link DepID}.\n   */\n  add?: AddImportersDependenciesMap\n  /**\n   * A `Map` object representing nodes to be removed from the ideal graph.\n   * Each {@link DepID} key represents an importer node and the `Set` of\n   * dependency names to be removed from its dependency list.\n   */\n  remove?: RemoveImportersDependenciesMap\n  /**\n   * A {@link RollbackRemove} instance to handle extraction rollbacks\n   */\n  remover: RollbackRemove\n  /**\n   * A {@link PackageInfoClient} instance to read manifest info from.\n   */\n  packageInfo: PackageInfoClient\n}\n\n/**\n * Builds an ideal {@link Graph} representing the dependencies that\n * should be present in order to fulfill the requirements defined\n * by the `package.json` and `vlt-lock.json` files using either the\n * virtual or actual graph as a starting point. Also add / remove any\n * dependencies listed in the `add` and `remove` properties.\n */\nexport const build = async (\n  options: BuildIdealOptions,\n): Promise<Graph> => {\n  const done = graphStep('build')\n\n  // Creates the shared instances that are going to be used\n  // in both the loader methods and the build graph\n  const { packageInfo, packageJson, scurry, monorepo } = options\n  const mainManifest =\n    options.mainManifest ?? packageJson.read(options.projectRoot)\n  let graph\n  try {\n    graph = loadVirtual({\n      ...options,\n      mainManifest,\n      monorepo,\n      skipLoadingNodesOnModifiersChange: true,\n    })\n  } catch {\n    graph = loadActual({\n      ...options,\n      mainManifest,\n      monorepo,\n      skipLoadingNodesOnModifiersChange: true,\n    })\n  }\n\n  const res = await buildIdealFromStartingGraph({\n    ...options,\n    scurry,\n    add: getMap(options.add),\n    graph,\n    packageInfo,\n    remove: getMap(options.remove),\n    actual: options.actual,\n  })\n  done()\n  return res\n}\n"]}

package/dist/esm/ideal/get-importer-specs.d.ts

@@ -1,14 +0,0 @@
-import type { AddImportersDependenciesMap, RemoveImportersDependenciesMap } from '../dependencies.ts';
-import type { BuildIdealAddOptions, BuildIdealFromGraphOptions, BuildIdealRemoveOptions } from './types.ts';
-import type { SpecOptions } from '@vltpkg/spec';
-export type GetImporterSpecsOptions = BuildIdealAddOptions & BuildIdealFromGraphOptions & BuildIdealRemoveOptions & SpecOptions;
-/**
- * Given a {@link Graph} and a list of {@link Dependency}, merges the
- * dependencies info found in the graph importers and returns the add & remove
- * results as a Map in which keys are {@link DepID} of each importer node.
- */
-export declare const getImporterSpecs: (options: GetImporterSpecsOptions) => {
-    add: AddImportersDependenciesMap;
-    remove: RemoveImportersDependenciesMap;
-};
-//# sourceMappingURL=get-importer-specs.d.ts.map

package/dist/esm/ideal/get-importer-specs.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"get-importer-specs.d.ts","sourceRoot":"","sources":["../../../src/ideal/get-importer-specs.ts"],"names":[],"mappings":"AAGA,OAAO,KAAK,EACV,2BAA2B,EAE3B,8BAA8B,EAC/B,MAAM,oBAAoB,CAAA;AAE3B,OAAO,KAAK,EACV,oBAAoB,EACpB,0BAA0B,EAC1B,uBAAuB,EACxB,MAAM,YAAY,CAAA;AAMnB,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,cAAc,CAAA;AAE/C,MAAM,MAAM,uBAAuB,GAAG,oBAAoB,GACxD,0BAA0B,GAC1B,uBAAuB,GACvB,WAAW,CAAA;AAyBb;;;;GAIG;AACH,eAAO,MAAM,gBAAgB,YAClB,uBAAuB;;;CA4FjC,CAAA"}