@vltpkg/graph 1.0.0-rc.13 → 1.0.0-rc.15

package/dist/reify/index.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/reify/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAG1C,OAAO,EAAE,oBAAoB,EAAE,MAAM,SAAS,CAAA;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAA;AAG9C,OAAO,EAAE,IAAI,IAAI,UAAU,EAAE,MAAM,mBAAmB,CAAA;AAKtD,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAGjC,OAAO,EACL,YAAY,EACZ,QAAQ,EACR,UAAU,GACX,MAAM,qBAAqB,CAAA;AAC5B,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AACzC,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AACzC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AAClC,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAC/C,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAA;AAC1D,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAA;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AACxC,OAAO,EAAE,iBAAiB,EAAE,MAAM,oCAAoC,CAAA;AACtE,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAA;AACtC,OAAO,EAAE,KAAK,EAAE,MAAM,eAAe,CAAA;AACrC,OAAO,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAA;AAE1D,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAA;AAE5C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,oBAAoB,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAA;AAEzD;;GAEG;AACH,MAAM,kBAAkB,GAAG,KAAK,EAC9B,KAAY,EACZ,iBAA0B,EACL,EAAE;IACvB,gCAAgC;IAChC,IACE,iBAAiB,KAAK,SAAS,CAAC,oBAAoB;QACpD,CAAC,iBAAiB,EAClB,CAAC;QACD,OAAO,IAAI,GAAG,EAAE,CAAA;IAClB,CAAC;IACD,iCAAiC;IACjC,IAAI,iBAAiB,KAAK,GAAG,EAAE,CAAC;QAC9B,OAAO,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAA;IACpC,CAAC;IACD,qBAAqB;IACrB,MAAM,eAAe,GACnB,KAAK,CAAC,oBAAoB,CAAC,iBAAiB,CAAC,CAAC,CAAC;QAC7C,MAAM,eAAe,CAAC,KAAK,CAAC;YAC1B,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;SACjC,CAAC;QACJ,CAAC,CAAC,SAAS,CAAA;IACb,oBAAoB;IAEpB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAA;IACzB,MAAM,KAAK,GAAG,IAAI,GAAG,CAAW,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAA;IACrD,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAA;IAEjC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC;QACtB,KAAK;QACL,KAAK;QACL,SAAS;QACT,eAAe;KAChB,CAAC,CAAA;IAEF,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,GAAG,MAAM,KAAK,CAAC,MAAM,CAC/C,iBAAiB,EACjB;QACE,MAAM,EAAE,IAAI,eAAe,EAAE,CAAC,MAAM;KACrC,CACF,CAAA;IAED,OAAO,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;AAClD,CAAC,CAAA;AA4BD;;GAEG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,KAAK,EACxB,OAAqB,EACC,EAAE;IACxB,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,CAAA;IAE/B,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAA;IAE1C,MAAM,MAAM,GACV,OAAO,CAAC,MAAM;QACd,UAAU,CAAC;YACT,GAAG,OAAO;YACV,aAAa,EAAE,IAAI;SACpB,CAAC,CAAA;IAEJ,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IACpC,MAAM,sBAAsB,GAC1B,CAAC,OAAO,CAAC,GAAG,EAAE,oBAAoB;QAClC,CAAC,OAAO,CAAC,MAAM,EAAE,oBAAoB,CAAA;IACvC,MAAM,gBAAgB,GAAG,sBAAsB,IAAI,IAAI,CAAC,YAAY,CAAA;IACpE,MAAM,GAAG,GAAgB,EAAE,IAAI,EAAE,CAAA;IACjC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,gBAAgB,EAAE,CAAC;QAC3C,yCAAyC;QACzC,IAAI,EAAE,CAAA;QACN,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,IAAI,OAAO,GAAG,KAAK,CAAA;IACnB,IAAI,CAAC;QACH,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,MAAM,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;QAC3D,OAAO,CAAC,OAAO,EAAE,CAAA;QACjB,OAAO,GAAG,IAAI,CAAA;QACd,GAAG,CAAC,UAAU,GAAG,UAAU,CAAA;IAC7B,CAAC;YAAS,CAAC;QACT,qBAAqB;QACrB,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,MAAM,QAAQ,CAAC,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAA;QACvD,CAAC;QACD,oBAAoB;IACtB,CAAC;IAED,IAAI,EAAE,CAAA;IAEN,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA;AAED,MAAM,MAAM,GAAG,KAAK,EAClB,OAAqB,EACrB,IAAU,EACV,OAAuB,EACa,EAAE;IACtC,MAAM,GAAG,GAA8B,EAAE,CAAA;IACzC,MAAM,EACJ,GAAG,EACH,MAAM,EACN,WAAW,EACX,WAAW,EACX,MAAM,EACN,YAAY,GACb,GAAG,OAAO,CAAA;IACX,MAAM,wBAAwB;IAC5B,oBAAoB;IACpB,GAAG,EAAE,oBAAoB,IAAI,MAAM,EAAE,oBAAoB,CAAC,CAAC;QACzD,iBAAiB,CAAC;YAChB,GAAG;YACH,MAAM;YACN,KAAK,EAAE,OAAO,CAAC,KAAK;YACpB,WAAW;SACZ,CAAC;QACJ,CAAC,CAAC,SAAS,CAAA;IAEb,uEAAuE;IACvE,mEAAmE;IACnE,qEAAqE;IACrE,uBAAuB;IACvB,MAAM,MAAM,GAAG,YAAY,CAAC,OAAO,CAAC,CAAA;IACpC,MAAM,OAAO,GAA+B,QAAQ,CAClD,IAAI,EACJ,MAAM,EACN,OAAO,EACP,OAAO,EACP,WAAW,CACZ,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAA;IAE5C,mDAAmD;IACnD,IAAI,OAAO,CAAC,MAAM;QAAE,MAAM,SAAS,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,CAAC,CAAA;IAEvD,6DAA6D;IAC7D,MAAM,WAAW,GAAG,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAA;IACnD,IAAI,WAAW,CAAC,MAAM;QAAE,MAAM,SAAS,CAAC,WAAW,EAAE,EAAE,KAAK,EAAE,CAAC,CAAA;IAE/D,MAAM,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;IAE9C,mDAAmD;IACnD,iCAAiC;IACjC,gBAAgB,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAA;IAE/C,wEAAwE;IACxE,MAAM,iBAAiB,GAAG,MAAM,kBAAkB,CAChD,IAAI,CAAC,EAAE,EACP,YAAY,CACb,CAAA;IAED,0CAA0C;IAC1C,MAAM,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;IAEzC,0DAA0D;IAC1D,MAAM,KAAK,CAAC,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,iBAAiB,CAAC,CAAA;IAEzD,qDAAqD;IACrD,wDAAwD;IACxD,GAAG,CAAC,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;SACjC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,KAAK,QAAQ,CAAC;SAC5C,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAEvB,sDAAsD;IACtD,yDAAyD;IACzD,gCAAgC;IAChC,qBAAqB;IACrB,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC7B,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC;YAC/C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAC3B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAC7B,CAAC;IACH,CAAC;IACD,oBAAoB;IACpB,UAAU,CAAC,OAAO,CAAC,CAAA;IAEnB,iCAAiC;IACjC,MAAM,SAAS,GAAuB,WAAW,CAC/C,IAAI,EACJ,OAAO,EACP,MAAM,CACP,CAAA;IACD,IAAI,SAAS,CAAC,MAAM;QAAE,MAAM,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;IAElD,6DAA6D;IAC7D,wBAAwB,EAAE,EAAE,CAAA;IAE5B,6CAA6C;IAC7C,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE,KAAK,CAAC,CAAA;IAExD,8DAA8D;IAC9D,IAAI,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,EAAE,CAAC;QACjC,YAAY,CACV,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAC1B,MAAM,CAAC,OAAO,CAAC,4BAA4B,CAAC,CAC7C,CAAA;IACH,CAAC;IAED,4BAA4B;IAC5B,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA","sourcesContent":["import { graphStep } from '@vltpkg/output'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport type { RollbackRemove } from '@vltpkg/rollback-remove'\nimport { availableParallelism } from 'node:os'\nimport { callLimit } from 'promise-call-limit'\nimport type { DepID } from '@vltpkg/dep-id'\nimport type { LoadOptions } from '../actual/load.ts'\nimport { load as loadActual } from '../actual/load.ts'\nimport type {\n  AddImportersDependenciesMap,\n  RemoveImportersDependenciesMap,\n} from '../dependencies.ts'\nimport { Diff } from '../diff.ts'\nimport type { Graph } from '../graph.ts'\nimport type { GraphModifier } from '../modifiers.ts'\nimport {\n  lockfileData,\n  saveData,\n  saveHidden,\n} from '../lockfile/save.ts'\nimport { addEdges } from './add-edges.ts'\nimport { addNodes } from './add-nodes.ts'\nimport { build } from './build.ts'\nimport { deleteEdges } from './delete-edges.ts'\nimport { checkNeededBuild } from './check-needed-build.ts'\nimport { deleteNodes } from './delete-nodes.ts'\nimport { internalHoist } from './internal-hoist.ts'\nimport { rollback } from './rollback.ts'\nimport { updatePackageJson } from './update-importers-package-json.ts'\nimport { copyFileSync } from 'node:fs'\nimport { Query } from '@vltpkg/query'\nimport { SecurityArchive } from '@vltpkg/security-archive'\nimport type { NodeLike } from '@vltpkg/types'\nimport { binChmodAll } from './bin-chmod.ts'\n\nconst limit = Math.max(availableParallelism() - 1, 1) * 8\n\n/**\n * Filter nodes using a DSS query string\n */\nconst filterNodesByQuery = async (\n  graph: Graph,\n  allowScriptsQuery?: string,\n): Promise<Set<DepID>> => {\n  // shortcut no packages included\n  if (\n    allowScriptsQuery === ':not(*)' /* c8 ignore next */ ||\n    !allowScriptsQuery\n  ) {\n    return new Set()\n  }\n  // shortcut all packages included\n  if (allowScriptsQuery === '*') {\n    return new Set(graph.nodes.keys())\n  }\n  /* c8 ignore start */\n  const securityArchive =\n    Query.hasSecuritySelectors(allowScriptsQuery) ?\n      await SecurityArchive.start({\n        nodes: [...graph.nodes.values()],\n      })\n    : undefined\n  /* c8 ignore stop */\n\n  const edges = graph.edges\n  const nodes = new Set<NodeLike>(graph.nodes.values())\n  const importers = graph.importers\n\n  const query = new Query({\n    edges,\n    nodes,\n    importers,\n    securityArchive,\n  })\n\n  const { nodes: resultNodes } = await query.search(\n    allowScriptsQuery,\n    {\n      signal: new AbortController().signal,\n    },\n  )\n\n  return new Set(resultNodes.map(node => node.id))\n}\n\n// - [ ] depid's with peer resolutions\n// - [ ] depid shortening\n\nexport type ReifyOptions = LoadOptions & {\n  add?: AddImportersDependenciesMap\n  allowScripts: string\n  remove?: RemoveImportersDependenciesMap\n  graph: Graph\n  actual?: Graph\n  packageInfo: PackageInfoClient\n  modifiers?: GraphModifier\n  remover: RollbackRemove\n}\n\nexport type ReifyResult = {\n  /**\n   * The diff object that was used to reify the project.\n   */\n  diff: Diff\n  /**\n   * Optional queue of DepIDs that requires building (running lifecycle scripts\n   * and binary linking) after the reification is complete.\n   */\n  buildQueue?: DepID[]\n}\n\n/**\n * Make the current project match the supplied graph.\n */\nexport const reify = async (\n  options: ReifyOptions,\n): Promise<ReifyResult> => {\n  const done = graphStep('reify')\n\n  const { graph, scurry, remover } = options\n\n  const actual =\n    options.actual ??\n    loadActual({\n      ...options,\n      loadManifests: true,\n    })\n\n  const diff = new Diff(actual, graph)\n  const noModifiedDependencies =\n    !options.add?.modifiedDependencies &&\n    !options.remove?.modifiedDependencies\n  const skipOptionalOnly = noModifiedDependencies && diff.optionalOnly\n  const res: ReifyResult = { diff }\n  if (!diff.hasChanges() || skipOptionalOnly) {\n    // nothing to do, so just return the diff\n    done()\n    return res\n  }\n\n  let success = false\n  try {\n    const { buildQueue } = await reify_(options, diff, remover)\n    remover.confirm()\n    success = true\n    res.buildQueue = buildQueue\n  } finally {\n    /* c8 ignore start */\n    if (!success) {\n      await rollback(remover, diff, scurry).catch(() => {})\n    }\n    /* c8 ignore stop */\n  }\n\n  done()\n\n  return res\n}\n\nconst reify_ = async (\n  options: ReifyOptions,\n  diff: Diff,\n  remover: RollbackRemove,\n): Promise<Omit<ReifyResult, 'diff'>> => {\n  const res: Omit<ReifyResult, 'diff'> = {}\n  const {\n    add,\n    remove,\n    packageInfo,\n    packageJson,\n    scurry,\n    allowScripts,\n  } = options\n  const saveImportersPackageJson =\n    /* c8 ignore next */\n    add?.modifiedDependencies || remove?.modifiedDependencies ?\n      updatePackageJson({\n        add,\n        remove,\n        graph: options.graph,\n        packageJson,\n      })\n    : undefined\n\n  // before anything else happens, grab the ideal tree as it was resolved\n  // so that we can store it in the lockfile. We do this here so that\n  // any failed/removed optional deps are not reflected in the lockfile\n  // data as it is saved.\n  const lfData = lockfileData(options)\n  const actions: (() => Promise<unknown>)[] = addNodes(\n    diff,\n    scurry,\n    remover,\n    options,\n    packageInfo,\n  ).concat(deleteEdges(diff, scurry, remover))\n\n  // need to wait, so that the nodes exist to link to\n  if (actions.length) await callLimit(actions, { limit })\n\n  // create all node_modules symlinks, and link bins to nm/.bin\n  const edgeActions = addEdges(diff, scurry, remover)\n  if (edgeActions.length) await callLimit(edgeActions, { limit })\n\n  await internalHoist(diff.to, options, remover)\n\n  // looks up all nodes setting buildState = 'needed'\n  // on nodes that require building\n  checkNeededBuild({ diff, scurry, packageJson })\n\n  // Filter nodes allowed to run scripts if allowScripts query is provided\n  const allowScriptsNodes = await filterNodesByQuery(\n    diff.to,\n    allowScripts,\n  )\n\n  // ensure that all added bins are chmod +x\n  await binChmodAll(diff.nodes.add, scurry)\n\n  // run install lifecycle scripts and link any binary files\n  await build(diff, packageJson, scurry, allowScriptsNodes)\n\n  // set the buildQueue on the result object containing\n  // an array with all the ids of nodes that need building\n  res.buildQueue = [...diff.nodes.add]\n    .filter(node => node.buildState === 'needed')\n    .map(node => node.id)\n\n  // if we had to change the actual graph along the way,\n  // make sure we do not leave behind any unreachable nodes\n  // TODO: add tests to cover this\n  /* c8 ignore start */\n  if (diff.hadOptionalFailures) {\n    for (const node of options.graph.gc().values()) {\n      diff.nodes.add.delete(node)\n      diff.nodes.delete.add(node)\n    }\n  }\n  /* c8 ignore stop */\n  saveHidden(options)\n\n  // delete garbage from the store.\n  const rmActions: Promise<unknown>[] = deleteNodes(\n    diff,\n    remover,\n    scurry,\n  )\n  if (rmActions.length) await Promise.all(rmActions)\n\n  // updates package.json files if anything was added / removed\n  saveImportersPackageJson?.()\n\n  // write the ideal graph data to the lockfile\n  saveData(lfData, scurry.resolve('vlt-lock.json'), false)\n\n  // update the store config reference if a config file was used\n  if (scurry.lstatSync('vlt.json')) {\n    copyFileSync(\n      scurry.resolve('vlt.json'),\n      scurry.resolve('node_modules/.vlt/vlt.json'),\n    )\n  }\n\n  // returns the result object\n  return res\n}\n"]}
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/reify/index.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAG1C,OAAO,EAAE,oBAAoB,EAAE,MAAM,SAAS,CAAA;AAC9C,OAAO,EAAE,SAAS,EAAE,MAAM,oBAAoB,CAAA;AAG9C,OAAO,EAAE,IAAI,IAAI,UAAU,EAAE,MAAM,mBAAmB,CAAA;AAKtD,OAAO,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AAGjC,OAAO,EACL,YAAY,EACZ,QAAQ,EACR,UAAU,GACX,MAAM,qBAAqB,CAAA;AAC5B,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AACzC,OAAO,EAAE,QAAQ,EAAE,MAAM,gBAAgB,CAAA;AACzC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AAClC,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAC/C,OAAO,EAAE,gBAAgB,EAAE,MAAM,yBAAyB,CAAA;AAC1D,OAAO,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAA;AAC/C,OAAO,EAAE,aAAa,EAAE,MAAM,qBAAqB,CAAA;AACnD,OAAO,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AACxC,OAAO,EAAE,iBAAiB,EAAE,MAAM,oCAAoC,CAAA;AACtE,OAAO,EAAE,YAAY,EAAE,MAAM,SAAS,CAAA;AACtC,OAAO,EAAE,KAAK,EAAE,MAAM,eAAe,CAAA;AACrC,OAAO,EAAE,eAAe,EAAE,MAAM,0BAA0B,CAAA;AAE1D,OAAO,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAA;AAE5C,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,oBAAoB,EAAE,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAA;AAEzD;;GAEG;AACH,MAAM,kBAAkB,GAAG,KAAK,EAC9B,KAAY,EACZ,iBAA0B,EACL,EAAE;IACvB,gCAAgC;IAChC,IACE,iBAAiB,KAAK,SAAS,CAAC,oBAAoB;QACpD,CAAC,iBAAiB,EAClB,CAAC;QACD,OAAO,IAAI,GAAG,EAAE,CAAA;IAClB,CAAC;IACD,iCAAiC;IACjC,IAAI,iBAAiB,KAAK,GAAG,EAAE,CAAC;QAC9B,OAAO,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAA;IACpC,CAAC;IACD,qBAAqB;IACrB,MAAM,eAAe,GACnB,KAAK,CAAC,oBAAoB,CAAC,iBAAiB,CAAC,CAAC,CAAC;QAC7C,MAAM,eAAe,CAAC,KAAK,CAAC;YAC1B,KAAK,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC;SACjC,CAAC;QACJ,CAAC,CAAC,SAAS,CAAA;IACb,oBAAoB;IAEpB,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAA;IACzB,MAAM,KAAK,GAAG,IAAI,GAAG,CAAW,KAAK,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAA;IACrD,MAAM,SAAS,GAAG,KAAK,CAAC,SAAS,CAAA;IAEjC,MAAM,KAAK,GAAG,IAAI,KAAK,CAAC;QACtB,KAAK;QACL,KAAK;QACL,SAAS;QACT,eAAe;KAChB,CAAC,CAAA;IAEF,MAAM,EAAE,KAAK,EAAE,WAAW,EAAE,GAAG,MAAM,KAAK,CAAC,MAAM,CAC/C,iBAAiB,EACjB;QACE,MAAM,EAAE,IAAI,eAAe,EAAE,CAAC,MAAM;KACrC,CACF,CAAA;IAED,OAAO,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAA;AAClD,CAAC,CAAA;AA6BD;;GAEG;AACH,MAAM,CAAC,MAAM,KAAK,GAAG,KAAK,EACxB,OAAqB,EACC,EAAE;IACxB,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,CAAA;IAE/B,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAA;IAE1C,MAAM,MAAM,GACV,OAAO,CAAC,MAAM;QACd,UAAU,CAAC;YACT,GAAG,OAAO;YACV,aAAa,EAAE,IAAI;SACpB,CAAC,CAAA;IAEJ,MAAM,IAAI,GAAG,IAAI,IAAI,CAAC,MAAM,EAAE,KAAK,CAAC,CAAA;IACpC,MAAM,sBAAsB,GAC1B,CAAC,OAAO,CAAC,GAAG,EAAE,oBAAoB;QAClC,CAAC,OAAO,CAAC,MAAM,EAAE,oBAAoB,CAAA;IACvC,MAAM,gBAAgB,GAAG,sBAAsB,IAAI,IAAI,CAAC,YAAY,CAAA;IACpE,MAAM,SAAS,GAAG,gBAAgB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAA;IACrD,MAAM,GAAG,GAAgB,EAAE,IAAI,EAAE,CAAA;IACjC,IAAI,CAAC,IAAI,CAAC,UAAU,EAAE,IAAI,SAAS,EAAE,CAAC;QACpC,yCAAyC;QACzC,IAAI,EAAE,CAAA;QACN,OAAO,GAAG,CAAA;IACZ,CAAC;IAED,IAAI,OAAO,GAAG,KAAK,CAAA;IACnB,IAAI,CAAC;QACH,MAAM,EAAE,UAAU,EAAE,GAAG,MAAM,MAAM,CAAC,OAAO,EAAE,IAAI,EAAE,OAAO,CAAC,CAAA;QAC3D,OAAO,CAAC,OAAO,EAAE,CAAA;QACjB,OAAO,GAAG,IAAI,CAAA;QACd,GAAG,CAAC,UAAU,GAAG,UAAU,CAAA;IAC7B,CAAC;YAAS,CAAC;QACT,qBAAqB;QACrB,IAAI,CAAC,OAAO,EAAE,CAAC;YACb,MAAM,QAAQ,CAAC,OAAO,EAAE,IAAI,EAAE,MAAM,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAA;QACvD,CAAC;QACD,oBAAoB;IACtB,CAAC;IAED,IAAI,EAAE,CAAA;IAEN,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA;AAED,MAAM,MAAM,GAAG,KAAK,EAClB,OAAqB,EACrB,IAAU,EACV,OAAuB,EACa,EAAE;IACtC,MAAM,GAAG,GAA8B,EAAE,CAAA;IACzC,MAAM,EACJ,GAAG,EACH,MAAM,EACN,WAAW,EACX,WAAW,EACX,MAAM,EACN,YAAY,GACb,GAAG,OAAO,CAAA;IACX,MAAM,wBAAwB;IAC5B,oBAAoB;IACpB,GAAG,EAAE,oBAAoB,IAAI,MAAM,EAAE,oBAAoB,CAAC,CAAC;QACzD,iBAAiB,CAAC;YAChB,GAAG;YACH,MAAM;YACN,KAAK,EAAE,OAAO,CAAC,KAAK;YACpB,WAAW;SACZ,CAAC;QACJ,CAAC,CAAC,SAAS,CAAA;IAEb,uEAAuE;IACvE,mEAAmE;IACnE,qEAAqE;IACrE,uBAAuB;IACvB,MAAM,MAAM,GAAG,YAAY,CAAC,OAAO,CAAC,CAAA;IACpC,MAAM,OAAO,GAA+B,QAAQ,CAClD,IAAI,EACJ,MAAM,EACN,OAAO,EACP,OAAO,EACP,WAAW,CACZ,CAAC,MAAM,CAAC,WAAW,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAC,CAAA;IAE5C,mDAAmD;IACnD,IAAI,OAAO,CAAC,MAAM;QAAE,MAAM,SAAS,CAAC,OAAO,EAAE,EAAE,KAAK,EAAE,CAAC,CAAA;IAEvD,6DAA6D;IAC7D,MAAM,WAAW,GAAG,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,OAAO,CAAC,CAAA;IACnD,IAAI,WAAW,CAAC,MAAM;QAAE,MAAM,SAAS,CAAC,WAAW,EAAE,EAAE,KAAK,EAAE,CAAC,CAAA;IAE/D,MAAM,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;IAE9C,mDAAmD;IACnD,iCAAiC;IACjC,gBAAgB,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAA;IAE/C,wEAAwE;IACxE,MAAM,iBAAiB,GAAG,MAAM,kBAAkB,CAChD,IAAI,CAAC,EAAE,EACP,YAAY,CACb,CAAA;IAED,0CAA0C;IAC1C,MAAM,WAAW,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,MAAM,CAAC,CAAA;IAEzC,0DAA0D;IAC1D,MAAM,KAAK,CAAC,IAAI,EAAE,WAAW,EAAE,MAAM,EAAE,iBAAiB,CAAC,CAAA;IAEzD,qDAAqD;IACrD,wDAAwD;IACxD,GAAG,CAAC,UAAU,GAAG,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC;SACjC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,UAAU,KAAK,QAAQ,CAAC;SAC5C,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;IAEvB,sDAAsD;IACtD,yDAAyD;IACzD,gCAAgC;IAChC,qBAAqB;IACrB,IAAI,IAAI,CAAC,mBAAmB,EAAE,CAAC;QAC7B,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,EAAE,EAAE,CAAC,MAAM,EAAE,EAAE,CAAC;YAC/C,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;YAC3B,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAC7B,CAAC;IACH,CAAC;IACD,oBAAoB;IACpB,UAAU,CAAC,OAAO,CAAC,CAAA;IAEnB,iCAAiC;IACjC,MAAM,SAAS,GAAuB,WAAW,CAC/C,IAAI,EACJ,OAAO,EACP,MAAM,CACP,CAAA;IACD,IAAI,SAAS,CAAC,MAAM;QAAE,MAAM,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAA;IAElD,6DAA6D;IAC7D,wBAAwB,EAAE,EAAE,CAAA;IAE5B,6CAA6C;IAC7C,QAAQ,CAAC,MAAM,EAAE,MAAM,CAAC,OAAO,CAAC,eAAe,CAAC,EAAE,KAAK,CAAC,CAAA;IAExD,8DAA8D;IAC9D,IAAI,MAAM,CAAC,SAAS,CAAC,UAAU,CAAC,EAAE,CAAC;QACjC,YAAY,CACV,MAAM,CAAC,OAAO,CAAC,UAAU,CAAC,EAC1B,MAAM,CAAC,OAAO,CAAC,4BAA4B,CAAC,CAC7C,CAAA;IACH,CAAC;IAED,4BAA4B;IAC5B,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA","sourcesContent":["import { graphStep } from '@vltpkg/output'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport type { RollbackRemove } from '@vltpkg/rollback-remove'\nimport { availableParallelism } from 'node:os'\nimport { callLimit } from 'promise-call-limit'\nimport type { DepID } from '@vltpkg/dep-id'\nimport type { LoadOptions } from '../actual/load.ts'\nimport { load as loadActual } from '../actual/load.ts'\nimport type {\n  AddImportersDependenciesMap,\n  RemoveImportersDependenciesMap,\n} from '../dependencies.ts'\nimport { Diff } from '../diff.ts'\nimport type { Graph } from '../graph.ts'\nimport type { GraphModifier } from '../modifiers.ts'\nimport {\n  lockfileData,\n  saveData,\n  saveHidden,\n} from '../lockfile/save.ts'\nimport { addEdges } from './add-edges.ts'\nimport { addNodes } from './add-nodes.ts'\nimport { build } from './build.ts'\nimport { deleteEdges } from './delete-edges.ts'\nimport { checkNeededBuild } from './check-needed-build.ts'\nimport { deleteNodes } from './delete-nodes.ts'\nimport { internalHoist } from './internal-hoist.ts'\nimport { rollback } from './rollback.ts'\nimport { updatePackageJson } from './update-importers-package-json.ts'\nimport { copyFileSync } from 'node:fs'\nimport { Query } from '@vltpkg/query'\nimport { SecurityArchive } from '@vltpkg/security-archive'\nimport type { NodeLike } from '@vltpkg/types'\nimport { binChmodAll } from './bin-chmod.ts'\n\nconst limit = Math.max(availableParallelism() - 1, 1) * 8\n\n/**\n * Filter nodes using a DSS query string\n */\nconst filterNodesByQuery = async (\n  graph: Graph,\n  allowScriptsQuery?: string,\n): Promise<Set<DepID>> => {\n  // shortcut no packages included\n  if (\n    allowScriptsQuery === ':not(*)' /* c8 ignore next */ ||\n    !allowScriptsQuery\n  ) {\n    return new Set()\n  }\n  // shortcut all packages included\n  if (allowScriptsQuery === '*') {\n    return new Set(graph.nodes.keys())\n  }\n  /* c8 ignore start */\n  const securityArchive =\n    Query.hasSecuritySelectors(allowScriptsQuery) ?\n      await SecurityArchive.start({\n        nodes: [...graph.nodes.values()],\n      })\n    : undefined\n  /* c8 ignore stop */\n\n  const edges = graph.edges\n  const nodes = new Set<NodeLike>(graph.nodes.values())\n  const importers = graph.importers\n\n  const query = new Query({\n    edges,\n    nodes,\n    importers,\n    securityArchive,\n  })\n\n  const { nodes: resultNodes } = await query.search(\n    allowScriptsQuery,\n    {\n      signal: new AbortController().signal,\n    },\n  )\n\n  return new Set(resultNodes.map(node => node.id))\n}\n\n// - [ ] depid's with peer resolutions\n// - [ ] depid shortening\n\nexport type ReifyOptions = LoadOptions & {\n  add?: AddImportersDependenciesMap\n  allowScripts: string\n  remove?: RemoveImportersDependenciesMap\n  graph: Graph\n  actual?: Graph\n  packageInfo: PackageInfoClient\n  modifiers?: GraphModifier\n  remover: RollbackRemove\n  update?: boolean\n}\n\nexport type ReifyResult = {\n  /**\n   * The diff object that was used to reify the project.\n   */\n  diff: Diff\n  /**\n   * Optional queue of DepIDs that requires building (running lifecycle scripts\n   * and binary linking) after the reification is complete.\n   */\n  buildQueue?: DepID[]\n}\n\n/**\n * Make the current project match the supplied graph.\n */\nexport const reify = async (\n  options: ReifyOptions,\n): Promise<ReifyResult> => {\n  const done = graphStep('reify')\n\n  const { graph, scurry, remover } = options\n\n  const actual =\n    options.actual ??\n    loadActual({\n      ...options,\n      loadManifests: true,\n    })\n\n  const diff = new Diff(actual, graph)\n  const noModifiedDependencies =\n    !options.add?.modifiedDependencies &&\n    !options.remove?.modifiedDependencies\n  const skipOptionalOnly = noModifiedDependencies && diff.optionalOnly\n  const skippable = skipOptionalOnly && !options.update\n  const res: ReifyResult = { diff }\n  if (!diff.hasChanges() || skippable) {\n    // nothing to do, so just return the diff\n    done()\n    return res\n  }\n\n  let success = false\n  try {\n    const { buildQueue } = await reify_(options, diff, remover)\n    remover.confirm()\n    success = true\n    res.buildQueue = buildQueue\n  } finally {\n    /* c8 ignore start */\n    if (!success) {\n      await rollback(remover, diff, scurry).catch(() => {})\n    }\n    /* c8 ignore stop */\n  }\n\n  done()\n\n  return res\n}\n\nconst reify_ = async (\n  options: ReifyOptions,\n  diff: Diff,\n  remover: RollbackRemove,\n): Promise<Omit<ReifyResult, 'diff'>> => {\n  const res: Omit<ReifyResult, 'diff'> = {}\n  const {\n    add,\n    remove,\n    packageInfo,\n    packageJson,\n    scurry,\n    allowScripts,\n  } = options\n  const saveImportersPackageJson =\n    /* c8 ignore next */\n    add?.modifiedDependencies || remove?.modifiedDependencies ?\n      updatePackageJson({\n        add,\n        remove,\n        graph: options.graph,\n        packageJson,\n      })\n    : undefined\n\n  // before anything else happens, grab the ideal tree as it was resolved\n  // so that we can store it in the lockfile. We do this here so that\n  // any failed/removed optional deps are not reflected in the lockfile\n  // data as it is saved.\n  const lfData = lockfileData(options)\n  const actions: (() => Promise<unknown>)[] = addNodes(\n    diff,\n    scurry,\n    remover,\n    options,\n    packageInfo,\n  ).concat(deleteEdges(diff, scurry, remover))\n\n  // need to wait, so that the nodes exist to link to\n  if (actions.length) await callLimit(actions, { limit })\n\n  // create all node_modules symlinks, and link bins to nm/.bin\n  const edgeActions = addEdges(diff, scurry, remover)\n  if (edgeActions.length) await callLimit(edgeActions, { limit })\n\n  await internalHoist(diff.to, options, remover)\n\n  // looks up all nodes setting buildState = 'needed'\n  // on nodes that require building\n  checkNeededBuild({ diff, scurry, packageJson })\n\n  // Filter nodes allowed to run scripts if allowScripts query is provided\n  const allowScriptsNodes = await filterNodesByQuery(\n    diff.to,\n    allowScripts,\n  )\n\n  // ensure that all added bins are chmod +x\n  await binChmodAll(diff.nodes.add, scurry)\n\n  // run install lifecycle scripts and link any binary files\n  await build(diff, packageJson, scurry, allowScriptsNodes)\n\n  // set the buildQueue on the result object containing\n  // an array with all the ids of nodes that need building\n  res.buildQueue = [...diff.nodes.add]\n    .filter(node => node.buildState === 'needed')\n    .map(node => node.id)\n\n  // if we had to change the actual graph along the way,\n  // make sure we do not leave behind any unreachable nodes\n  // TODO: add tests to cover this\n  /* c8 ignore start */\n  if (diff.hadOptionalFailures) {\n    for (const node of options.graph.gc().values()) {\n      diff.nodes.add.delete(node)\n      diff.nodes.delete.add(node)\n    }\n  }\n  /* c8 ignore stop */\n  saveHidden(options)\n\n  // delete garbage from the store.\n  const rmActions: Promise<unknown>[] = deleteNodes(\n    diff,\n    remover,\n    scurry,\n  )\n  if (rmActions.length) await Promise.all(rmActions)\n\n  // updates package.json files if anything was added / removed\n  saveImportersPackageJson?.()\n\n  // write the ideal graph data to the lockfile\n  saveData(lfData, scurry.resolve('vlt-lock.json'), false)\n\n  // update the store config reference if a config file was used\n  if (scurry.lstatSync('vlt.json')) {\n    copyFileSync(\n      scurry.resolve('vlt.json'),\n      scurry.resolve('node_modules/.vlt/vlt.json'),\n    )\n  }\n\n  // returns the result object\n  return res\n}\n"]}

package/dist/update.d.ts.map

@@ -1 +1 @@
-{"version":3,"file":"update.d.ts","sourceRoot":"","sources":["../src/update.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAC7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAA;AACnD,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AAMlC,MAAM,MAAM,aAAa,GAAG,WAAW,GAAG;IACxC,WAAW,EAAE,iBAAiB,CAAA;IAC9B,YAAY,EAAE,MAAM,CAAA;CACrB,CAAA;AAED,eAAO,MAAM,MAAM,YAAmB,aAAa;;;;EAgElD,CAAA"}
+{"version":3,"file":"update.d.ts","sourceRoot":"","sources":["../src/update.ts"],"names":[],"mappings":"AAOA,OAAO,KAAK,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAA;AAC7D,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,kBAAkB,CAAA;AACnD,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AAMlC,MAAM,MAAM,aAAa,GAAG,WAAW,GAAG;IACxC,WAAW,EAAE,iBAAiB,CAAA;IAC9B,YAAY,EAAE,MAAM,CAAA;CACrB,CAAA;AAED,eAAO,MAAM,MAAM,YAAmB,aAAa;;;;EAiElD,CAAA"}

package/dist/update.js

@@ -52,6 +52,7 @@ export const update = async (options) => {
             loadManifests: true,
             modifiers,
             remover,
+            update: true,
         });
         return { buildQueue, graph, diff };
         /* c8 ignore start */

package/dist/update.js.map

@@ -1 +1 @@
-{"version":3,"file":"update.js","sourceRoot":"","sources":["../src/update.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,IAAI,UAAU,EAAE,MAAM,kBAAkB,CAAA;AACrD,OAAO,EAAE,2BAA2B,EAAE,MAAM,4CAA4C,CAAA;AACxF,OAAO,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAA;AACxC,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAA;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AACnC,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAA;AAIvC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AAClC,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAC1C,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAA;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,SAAS,CAAA;AAC5C,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AAOnC,MAAM,CAAC,MAAM,MAAM,GAAG,KAAK,EAAE,OAAsB,EAAE,EAAE;IACrD,IAAI,YAAY,GAAmC,SAAS,CAAA;IAC5D,IAAI,CAAC;QACH,YAAY,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAA;IAC9D,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,OAAO,KAAK,kCAAkC,EAAE,CAAC;YAChE,MAAM,IAAI,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,WAAW,EAAE,CAAC,CAAA;YACxC,YAAY,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE;gBAC3D,MAAM,EAAE,IAAI;aACb,CAAC,CAAA;QACJ,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,CAAA;QACX,CAAC;IACH,CAAC;IAED,MAAM,SAAS,GAAG,aAAa,CAAC,SAAS,CAAC,OAAO,CAAC,CAAA;IAClD,MAAM,OAAO,GAAG,IAAI,cAAc,EAAE,CAAA;IAEpC,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,CAAA;QAC/B,MAAM,KAAK,GAAG,MAAM,2BAA2B,CAAC;YAC9C,GAAG,OAAO;YACV,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,EAAE,EAAE,EAAE,oBAAoB,EAAE,KAAK,EAAE,CAAC;YAC9D,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,EAAE,EAAE;gBAC/B,oBAAoB,EAAE,KAAK;aAC5B,CAAC;YACF,KAAK,EAAE,IAAI,KAAK,CAAC,EAAE,GAAG,OAAO,EAAE,YAAY,EAAE,CAAC;YAC9C,SAAS;YACT,OAAO;SACR,CAAC,CAAA;QACF,IAAI,EAAE,CAAA;QAEN,MAAM,GAAG,GAAG,UAAU,CAAC;YACrB,GAAG,OAAO;YACV,YAAY;YACZ,aAAa,EAAE,IAAI;SACpB,CAAC,CAAA;QAEF,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,MAAM,KAAK,CAAC;YACvC,GAAG,OAAO;YACV,MAAM,EAAE,GAAG;YACX,KAAK;YACL,aAAa,EAAE,IAAI;YACnB,SAAS;YACT,OAAO;SACR,CAAC,CAAA;QAEF,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;QAClC,qBAAqB;IACvB,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAA;QACxC,oCAAoC;QACpC,IAAI,CAAC;YACH,MAAM,cAAc,GAAG,OAAO,CAC5B,OAAO,CAAC,WAAW,EACnB,6BAA6B,CAC9B,CAAA;YACD,IAAI,UAAU,CAAC,cAAc,CAAC,EAAE,CAAC;gBAC/B,MAAM,CAAC,cAAc,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAA;YACzC,CAAC;QACH,CAAC;QAAC,MAAM,CAAC,CAAA,CAAC;QACV,MAAM,GAAG,CAAA;IACX,CAAC;IACD,oBAAoB;AACtB,CAAC,CAAA","sourcesContent":["import { load as actualLoad } from './actual/load.ts'\nimport { buildIdealFromStartingGraph } from './ideal/build-ideal-from-starting-graph.ts'\nimport { reify } from './reify/index.ts'\nimport { GraphModifier } from './modifiers.ts'\nimport { init } from '@vltpkg/init'\nimport { asError } from '@vltpkg/types'\nimport type { NormalizedManifest } from '@vltpkg/types'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport type { LoadOptions } from './actual/load.ts'\nimport { Graph } from './graph.ts'\nimport { graphStep } from '@vltpkg/output'\nimport { RollbackRemove } from '@vltpkg/rollback-remove'\nimport { existsSync, rmSync } from 'node:fs'\nimport { resolve } from 'node:path'\n\nexport type UpdateOptions = LoadOptions & {\n  packageInfo: PackageInfoClient\n  allowScripts: string\n}\n\nexport const update = async (options: UpdateOptions) => {\n  let mainManifest: NormalizedManifest | undefined = undefined\n  try {\n    mainManifest = options.packageJson.read(options.projectRoot)\n  } catch (err) {\n    if (asError(err).message === 'Could not read package.json file') {\n      await init({ cwd: options.projectRoot })\n      mainManifest = options.packageJson.read(options.projectRoot, {\n        reload: true,\n      })\n    } else {\n      throw err\n    }\n  }\n\n  const modifiers = GraphModifier.maybeLoad(options)\n  const remover = new RollbackRemove()\n\n  try {\n    const done = graphStep('build')\n    const graph = await buildIdealFromStartingGraph({\n      ...options,\n      add: Object.assign(new Map(), { modifiedDependencies: false }),\n      remove: Object.assign(new Map(), {\n        modifiedDependencies: false,\n      }),\n      graph: new Graph({ ...options, mainManifest }),\n      modifiers,\n      remover,\n    })\n    done()\n\n    const act = actualLoad({\n      ...options,\n      mainManifest,\n      loadManifests: true,\n    })\n\n    const { buildQueue, diff } = await reify({\n      ...options,\n      actual: act,\n      graph,\n      loadManifests: true,\n      modifiers,\n      remover,\n    })\n\n    return { buildQueue, graph, diff }\n    /* c8 ignore start */\n  } catch (err) {\n    await remover.rollback().catch(() => {})\n    // Remove hidden lockfile on failure\n    try {\n      const hiddenLockfile = resolve(\n        options.projectRoot,\n        'node_modules/.vlt-lock.json',\n      )\n      if (existsSync(hiddenLockfile)) {\n        rmSync(hiddenLockfile, { force: true })\n      }\n    } catch {}\n    throw err\n  }\n  /* c8 ignore stop */\n}\n"]}
+{"version":3,"file":"update.js","sourceRoot":"","sources":["../src/update.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,IAAI,UAAU,EAAE,MAAM,kBAAkB,CAAA;AACrD,OAAO,EAAE,2BAA2B,EAAE,MAAM,4CAA4C,CAAA;AACxF,OAAO,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAA;AACxC,OAAO,EAAE,aAAa,EAAE,MAAM,gBAAgB,CAAA;AAC9C,OAAO,EAAE,IAAI,EAAE,MAAM,cAAc,CAAA;AACnC,OAAO,EAAE,OAAO,EAAE,MAAM,eAAe,CAAA;AAIvC,OAAO,EAAE,KAAK,EAAE,MAAM,YAAY,CAAA;AAClC,OAAO,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAA;AAC1C,OAAO,EAAE,cAAc,EAAE,MAAM,yBAAyB,CAAA;AACxD,OAAO,EAAE,UAAU,EAAE,MAAM,EAAE,MAAM,SAAS,CAAA;AAC5C,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AAOnC,MAAM,CAAC,MAAM,MAAM,GAAG,KAAK,EAAE,OAAsB,EAAE,EAAE;IACrD,IAAI,YAAY,GAAmC,SAAS,CAAA;IAC5D,IAAI,CAAC;QACH,YAAY,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,CAAC,CAAA;IAC9D,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,OAAO,KAAK,kCAAkC,EAAE,CAAC;YAChE,MAAM,IAAI,CAAC,EAAE,GAAG,EAAE,OAAO,CAAC,WAAW,EAAE,CAAC,CAAA;YACxC,YAAY,GAAG,OAAO,CAAC,WAAW,CAAC,IAAI,CAAC,OAAO,CAAC,WAAW,EAAE;gBAC3D,MAAM,EAAE,IAAI;aACb,CAAC,CAAA;QACJ,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,CAAA;QACX,CAAC;IACH,CAAC;IAED,MAAM,SAAS,GAAG,aAAa,CAAC,SAAS,CAAC,OAAO,CAAC,CAAA;IAClD,MAAM,OAAO,GAAG,IAAI,cAAc,EAAE,CAAA;IAEpC,IAAI,CAAC;QACH,MAAM,IAAI,GAAG,SAAS,CAAC,OAAO,CAAC,CAAA;QAC/B,MAAM,KAAK,GAAG,MAAM,2BAA2B,CAAC;YAC9C,GAAG,OAAO;YACV,GAAG,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,EAAE,EAAE,EAAE,oBAAoB,EAAE,KAAK,EAAE,CAAC;YAC9D,MAAM,EAAE,MAAM,CAAC,MAAM,CAAC,IAAI,GAAG,EAAE,EAAE;gBAC/B,oBAAoB,EAAE,KAAK;aAC5B,CAAC;YACF,KAAK,EAAE,IAAI,KAAK,CAAC,EAAE,GAAG,OAAO,EAAE,YAAY,EAAE,CAAC;YAC9C,SAAS;YACT,OAAO;SACR,CAAC,CAAA;QACF,IAAI,EAAE,CAAA;QAEN,MAAM,GAAG,GAAG,UAAU,CAAC;YACrB,GAAG,OAAO;YACV,YAAY;YACZ,aAAa,EAAE,IAAI;SACpB,CAAC,CAAA;QAEF,MAAM,EAAE,UAAU,EAAE,IAAI,EAAE,GAAG,MAAM,KAAK,CAAC;YACvC,GAAG,OAAO;YACV,MAAM,EAAE,GAAG;YACX,KAAK;YACL,aAAa,EAAE,IAAI;YACnB,SAAS;YACT,OAAO;YACP,MAAM,EAAE,IAAI;SACb,CAAC,CAAA;QAEF,OAAO,EAAE,UAAU,EAAE,KAAK,EAAE,IAAI,EAAE,CAAA;QAClC,qBAAqB;IACvB,CAAC;IAAC,OAAO,GAAG,EAAE,CAAC;QACb,MAAM,OAAO,CAAC,QAAQ,EAAE,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAA;QACxC,oCAAoC;QACpC,IAAI,CAAC;YACH,MAAM,cAAc,GAAG,OAAO,CAC5B,OAAO,CAAC,WAAW,EACnB,6BAA6B,CAC9B,CAAA;YACD,IAAI,UAAU,CAAC,cAAc,CAAC,EAAE,CAAC;gBAC/B,MAAM,CAAC,cAAc,EAAE,EAAE,KAAK,EAAE,IAAI,EAAE,CAAC,CAAA;YACzC,CAAC;QACH,CAAC;QAAC,MAAM,CAAC,CAAA,CAAC;QACV,MAAM,GAAG,CAAA;IACX,CAAC;IACD,oBAAoB;AACtB,CAAC,CAAA","sourcesContent":["import { load as actualLoad } from './actual/load.ts'\nimport { buildIdealFromStartingGraph } from './ideal/build-ideal-from-starting-graph.ts'\nimport { reify } from './reify/index.ts'\nimport { GraphModifier } from './modifiers.ts'\nimport { init } from '@vltpkg/init'\nimport { asError } from '@vltpkg/types'\nimport type { NormalizedManifest } from '@vltpkg/types'\nimport type { PackageInfoClient } from '@vltpkg/package-info'\nimport type { LoadOptions } from './actual/load.ts'\nimport { Graph } from './graph.ts'\nimport { graphStep } from '@vltpkg/output'\nimport { RollbackRemove } from '@vltpkg/rollback-remove'\nimport { existsSync, rmSync } from 'node:fs'\nimport { resolve } from 'node:path'\n\nexport type UpdateOptions = LoadOptions & {\n  packageInfo: PackageInfoClient\n  allowScripts: string\n}\n\nexport const update = async (options: UpdateOptions) => {\n  let mainManifest: NormalizedManifest | undefined = undefined\n  try {\n    mainManifest = options.packageJson.read(options.projectRoot)\n  } catch (err) {\n    if (asError(err).message === 'Could not read package.json file') {\n      await init({ cwd: options.projectRoot })\n      mainManifest = options.packageJson.read(options.projectRoot, {\n        reload: true,\n      })\n    } else {\n      throw err\n    }\n  }\n\n  const modifiers = GraphModifier.maybeLoad(options)\n  const remover = new RollbackRemove()\n\n  try {\n    const done = graphStep('build')\n    const graph = await buildIdealFromStartingGraph({\n      ...options,\n      add: Object.assign(new Map(), { modifiedDependencies: false }),\n      remove: Object.assign(new Map(), {\n        modifiedDependencies: false,\n      }),\n      graph: new Graph({ ...options, mainManifest }),\n      modifiers,\n      remover,\n    })\n    done()\n\n    const act = actualLoad({\n      ...options,\n      mainManifest,\n      loadManifests: true,\n    })\n\n    const { buildQueue, diff } = await reify({\n      ...options,\n      actual: act,\n      graph,\n      loadManifests: true,\n      modifiers,\n      remover,\n      update: true,\n    })\n\n    return { buildQueue, graph, diff }\n    /* c8 ignore start */\n  } catch (err) {\n    await remover.rollback().catch(() => {})\n    // Remove hidden lockfile on failure\n    try {\n      const hiddenLockfile = resolve(\n        options.projectRoot,\n        'node_modules/.vlt-lock.json',\n      )\n      if (existsSync(hiddenLockfile)) {\n        rmSync(hiddenLockfile, { force: true })\n      }\n    } catch {}\n    throw err\n  }\n  /* c8 ignore stop */\n}\n"]}

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

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

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

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

package/dist/visualization/mermaid-output.js

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

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

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

package/package.json

@@ -1,7 +1,7 @@
 {
   "name": "@vltpkg/graph",
   "description": "A library that helps understanding & expressing what happens on an install",
-  "version": "1.0.0-rc.13",
+  "version": "1.0.0-rc.15",
   "repository": {
     "type": "git",
     "url": "git+https://github.com/vltpkg/vltpkg.git",
@@ -11,26 +11,26 @@
   "dependencies": {
     "path-scurry": "^2.0.1",
     "promise-call-limit": "^3.0.2",
-    "@vltpkg/cmd-shim": "1.0.0-rc.13",
-    "@vltpkg/dep-id": "1.0.0-rc.13",
-    "@vltpkg/error-cause": "1.0.0-rc.13",
-    "@vltpkg/fast-split": "1.0.0-rc.13",
-    "@vltpkg/dss-breadcrumb": "1.0.0-rc.13",
-    "@vltpkg/graph-run": "1.0.0-rc.13",
-    "@vltpkg/output": "1.0.0-rc.13",
-    "@vltpkg/init": "1.0.0-rc.13",
-    "@vltpkg/package-info": "1.0.0-rc.13",
-    "@vltpkg/package-json": "1.0.0-rc.13",
-    "@vltpkg/pick-manifest": "1.0.0-rc.13",
-    "@vltpkg/rollback-remove": "1.0.0-rc.13",
-    "@vltpkg/query": "1.0.0-rc.13",
-    "@vltpkg/run": "1.0.0-rc.13",
-    "@vltpkg/satisfies": "1.0.0-rc.13",
-    "@vltpkg/security-archive": "1.0.0-rc.13",
-    "@vltpkg/spec": "1.0.0-rc.13",
-    "@vltpkg/types": "1.0.0-rc.13",
-    "@vltpkg/vlt-json": "1.0.0-rc.13",
-    "@vltpkg/workspaces": "1.0.0-rc.13"
+    "@vltpkg/cmd-shim": "1.0.0-rc.15",
+    "@vltpkg/dep-id": "1.0.0-rc.15",
+    "@vltpkg/dss-breadcrumb": "1.0.0-rc.15",
+    "@vltpkg/error-cause": "1.0.0-rc.15",
+    "@vltpkg/fast-split": "1.0.0-rc.15",
+    "@vltpkg/graph-run": "1.0.0-rc.15",
+    "@vltpkg/init": "1.0.0-rc.15",
+    "@vltpkg/output": "1.0.0-rc.15",
+    "@vltpkg/package-info": "1.0.0-rc.15",
+    "@vltpkg/package-json": "1.0.0-rc.15",
+    "@vltpkg/pick-manifest": "1.0.0-rc.15",
+    "@vltpkg/query": "1.0.0-rc.15",
+    "@vltpkg/rollback-remove": "1.0.0-rc.15",
+    "@vltpkg/run": "1.0.0-rc.15",
+    "@vltpkg/satisfies": "1.0.0-rc.15",
+    "@vltpkg/security-archive": "1.0.0-rc.15",
+    "@vltpkg/spec": "1.0.0-rc.15",
+    "@vltpkg/types": "1.0.0-rc.15",
+    "@vltpkg/vlt-json": "1.0.0-rc.15",
+    "@vltpkg/workspaces": "1.0.0-rc.15"
   },
   "devDependencies": {
     "@eslint/js": "^9.39.1",
@@ -42,7 +42,7 @@
     "typedoc": "~0.27.9",
     "typescript": "5.7.3",
     "typescript-eslint": "^8.49.0",
-    "@vltpkg/vlt-json": "1.0.0-rc.13"
+    "@vltpkg/vlt-json": "1.0.0-rc.15"
   },
   "license": "BSD-2-Clause-Patent",
   "engines": {

package/dist/ideal/get-ordered-dependencies.d.ts

@@ -1,10 +0,0 @@
-import type { Node } from '../node.ts';
-import type { Dependency } from '../dependencies.ts';
-import type { BuildIdealAddOptions, BuildIdealRemoveOptions } from './types.ts';
-/**
- * Computes the ordered list of dependencies for an given node,
- * taking into account additions and removals.
- */
-export declare const getNodeOrderedDependencies: (fromNode: Node, options?: BuildIdealAddOptions & BuildIdealRemoveOptions) => Dependency[];
-export declare const getOrderedDependencies: (deps: Dependency[]) => Dependency[];
-//# sourceMappingURL=get-ordered-dependencies.d.ts.map

package/dist/ideal/get-ordered-dependencies.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"get-ordered-dependencies.d.ts","sourceRoot":"","sources":["../../src/ideal/get-ordered-dependencies.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,YAAY,CAAA;AACtC,OAAO,KAAK,EAAE,UAAU,EAAE,MAAM,oBAAoB,CAAA;AACpD,OAAO,KAAK,EACV,oBAAoB,EACpB,uBAAuB,EACxB,MAAM,YAAY,CAAA;AAEnB;;;GAGG;AACH,eAAO,MAAM,0BAA0B,aAC3B,IAAI,YACJ,oBAAoB,GAAG,uBAAuB,KACvD,UAAU,EAyBZ,CAAA;AAED,eAAO,MAAM,sBAAsB,SAC3B,UAAU,EAAE,KACjB,UAAU,EAiBZ,CAAA"}

package/dist/ideal/get-ordered-dependencies.js

@@ -1,42 +0,0 @@
-/**
- * Computes the ordered list of dependencies for an given node,
- * taking into account additions and removals.
- */
-export const getNodeOrderedDependencies = (fromNode, options) => {
-    // using a map here instead of an array helps us get simpler
-    // deduplication while iterating through all the items at hand:
-    // existing dependencies in the graph, dependencies to be added, etc.
-    const deps = new Map();
-    for (const [name, { spec, type }] of fromNode.edgesOut.entries()) {
-        deps.set(name, { spec, type });
-    }
-    // next iterate through the list of dependencies to be added
-    const addedDeps = options?.add.get(fromNode.id);
-    if (addedDeps) {
-        for (const [name, { spec, type }] of addedDeps.entries()) {
-            deps.set(name, { spec, type });
-        }
-    }
-    // finally iterate through the list of dependencies to be removed
-    const removedDeps = options?.remove.get(fromNode.id);
-    if (removedDeps) {
-        for (const name of removedDeps) {
-            deps.delete(name);
-        }
-    }
-    // now turn the map into a sorted array
-    return getOrderedDependencies([...deps.values()]);
-};
-export const getOrderedDependencies = (deps) => {
-    const orderedDeps = [...deps].sort(({ spec: aSpec, type: aType }, { spec: bSpec, type: bType }) => {
-        const aIsPeer = aType === 'peer' || aType === 'peerOptional' ? 1 : 0;
-        const bIsPeer = bType === 'peer' || bType === 'peerOptional' ? 1 : 0;
-        // regular dependencies first, peer dependencies last
-        if (aIsPeer !== bIsPeer) {
-            return aIsPeer - bIsPeer;
-        }
-        return aSpec.name.localeCompare(bSpec.name, 'en');
-    });
-    return orderedDeps;
-};
-//# sourceMappingURL=get-ordered-dependencies.js.map

package/dist/ideal/get-ordered-dependencies.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"get-ordered-dependencies.js","sourceRoot":"","sources":["../../src/ideal/get-ordered-dependencies.ts"],"names":[],"mappings":"AAOA;;;GAGG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAG,CACxC,QAAc,EACd,OAAwD,EAC1C,EAAE;IAChB,4DAA4D;IAC5D,+DAA+D;IAC/D,qEAAqE;IACrE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAsB,CAAA;IAC1C,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,QAAQ,CAAC,QAAQ,CAAC,OAAO,EAAE,EAAE,CAAC;QACjE,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAA;IAChC,CAAC;IACD,4DAA4D;IAC5D,MAAM,SAAS,GAAG,OAAO,EAAE,GAAG,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;IAC/C,IAAI,SAAS,EAAE,CAAC;QACd,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,IAAI,SAAS,CAAC,OAAO,EAAE,EAAE,CAAC;YACzD,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC,CAAA;QAChC,CAAC;IACH,CAAC;IACD,iEAAiE;IACjE,MAAM,WAAW,GAAG,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAA;IACpD,IAAI,WAAW,EAAE,CAAC;QAChB,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;YAC/B,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAA;QACnB,CAAC;IACH,CAAC;IAED,uCAAuC;IACvC,OAAO,sBAAsB,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC,CAAA;AACnD,CAAC,CAAA;AAED,MAAM,CAAC,MAAM,sBAAsB,GAAG,CACpC,IAAkB,EACJ,EAAE;IAChB,MAAM,WAAW,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC,IAAI,CAChC,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,KAAK,EAAE,EAAE,EAAE;QAC7D,MAAM,OAAO,GACX,KAAK,KAAK,MAAM,IAAI,KAAK,KAAK,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QACtD,MAAM,OAAO,GACX,KAAK,KAAK,MAAM,IAAI,KAAK,KAAK,cAAc,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;QAEtD,qDAAqD;QACrD,IAAI,OAAO,KAAK,OAAO,EAAE,CAAC;YACxB,OAAO,OAAO,GAAG,OAAO,CAAA;QAC1B,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;IACnD,CAAC,CACF,CAAA;IACD,OAAO,WAAW,CAAA;AACpB,CAAC,CAAA","sourcesContent":["import type { Node } from '../node.ts'\nimport type { Dependency } from '../dependencies.ts'\nimport type {\n  BuildIdealAddOptions,\n  BuildIdealRemoveOptions,\n} from './types.ts'\n\n/**\n * Computes the ordered list of dependencies for an given node,\n * taking into account additions and removals.\n */\nexport const getNodeOrderedDependencies = (\n  fromNode: Node,\n  options?: BuildIdealAddOptions & BuildIdealRemoveOptions,\n): Dependency[] => {\n  // using a map here instead of an array helps us get simpler\n  // deduplication while iterating through all the items at hand:\n  // existing dependencies in the graph, dependencies to be added, etc.\n  const deps = new Map<string, Dependency>()\n  for (const [name, { spec, type }] of fromNode.edgesOut.entries()) {\n    deps.set(name, { spec, type })\n  }\n  // next iterate through the list of dependencies to be added\n  const addedDeps = options?.add.get(fromNode.id)\n  if (addedDeps) {\n    for (const [name, { spec, type }] of addedDeps.entries()) {\n      deps.set(name, { spec, type })\n    }\n  }\n  // finally iterate through the list of dependencies to be removed\n  const removedDeps = options?.remove.get(fromNode.id)\n  if (removedDeps) {\n    for (const name of removedDeps) {\n      deps.delete(name)\n    }\n  }\n\n  // now turn the map into a sorted array\n  return getOrderedDependencies([...deps.values()])\n}\n\nexport const getOrderedDependencies = (\n  deps: Dependency[],\n): Dependency[] => {\n  const orderedDeps = [...deps].sort(\n    ({ spec: aSpec, type: aType }, { spec: bSpec, type: bType }) => {\n      const aIsPeer =\n        aType === 'peer' || aType === 'peerOptional' ? 1 : 0\n      const bIsPeer =\n        bType === 'peer' || bType === 'peerOptional' ? 1 : 0\n\n      // regular dependencies first, peer dependencies last\n      if (aIsPeer !== bIsPeer) {\n        return aIsPeer - bIsPeer\n      }\n\n      return aSpec.name.localeCompare(bSpec.name, 'en')\n    },\n  )\n  return orderedDeps\n}\n"]}