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

package/dist/esm/virtual-root.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"virtual-root.js","sourceRoot":"","sources":["../../src/virtual-root.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,IAAI,EAAE,MAAM,sBAAsB,CAAA;AAC3C,OAAO,EAAE,cAAc,EAAE,MAAM,wBAAwB,CAAA;AAIvD;;GAEG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,cAAc,CAAC;IAC5C,MAAM;IACN,kBAAkB;CACnB,CAAC,CAAA;AAEF;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAC/B,IAAI,GAAG,cAAc,EACrB,OAAoB,EACpB,aAAyB,EACH,EAAE;IACxB,MAAM,GAAG,GAAG;QACV,EAAE,EAAE,eAAe;QACnB,IAAI;QACJ,OAAO,EAAE,OAAO;QAChB,QAAQ,EAAE;YACR,IAAI;YACJ,OAAO,EAAE,OAAO;SACjB;QACD,OAAO,EAAE,IAAI,GAAG,EAAE;QAClB,QAAQ,EAAE,IAAI,GAAG,CAAmB,EAAE,CAAC;QACvC,QAAQ,EAAE,KAAK;QACf,QAAQ,EAAE,IAAI;QACd,YAAY,EAAE,IAAI;QAClB,QAAQ,EAAE,GAAG;QACb,KAAK,EAAE,EAAE,SAAS,EAAE,IAAI,GAAG,EAAE,EAAe;QAC5C,WAAW,EAAE,EAAE;QACf,GAAG,EAAE,KAAK;QACV,QAAQ,EAAE,KAAK;QACf,OAAO;QACP,mBAAmB,KAAI,CAAC;QACxB,WAAW,KAAI,CAAC;QAChB,wBAAwB,KAAI,CAAC;QAC7B,UAAU,EAAE,SAAS;QACrB,MAAM;YACJ,OAAO;gBACL,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,OAAO,EAAE,IAAI,CAAC,OAAO;gBACrB,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,WAAW,EAAE,IAAI,CAAC,WAAW;gBAC7B,SAAS,EAAE,IAAI,CAAC,SAAS;gBACzB,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,GAAG,EAAE,IAAI,CAAC,GAAG;gBACb,QAAQ,EAAE,IAAI,CAAC,QAAQ;gBACvB,QAAQ,EAAE,KAAK;aAChB,CAAA;QACH,CAAC;KACiB,CAAA;IAEpB,mBAAmB;IACnB,GAAG,CAAC,MAAM,CAAC,WAAW,CAAC,GAAG,oBAAoB,CAAA;IAE9C,6CAA6C;IAC7C,KAAK,MAAM,QAAQ,IAAI,aAAa,EAAE,CAAC;QACrC,MAAM,IAAI,GAAG,QAAQ,CAAC,IAAI,IAAI,WAAW,CAAA;QACzC,IAAI,QAAQ,CAAC,YAAY,EAAE,CAAC;YAC1B,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,QAAQ,EAAE,OAAO,CAAC,CAAA;YAChD,MAAM,IAAI,GAAG;gBACX,IAAI,EAAE,IAAI,CAAC,IAAI;gBACf,IAAI,EAAE,GAAG;gBACT,EAAE,EAAE,QAAQ;gBACZ,IAAI;gBACJ,IAAI,EAAE,MAAM;aACM,CAAA;YACpB,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAA;YAC5B,QAAQ,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;QAC5B,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAA;AACZ,CAAC,CAAA","sourcesContent":["import { Spec } from '@vltpkg/spec/browser'\nimport { joinDepIDTuple } from '@vltpkg/dep-id/browser'\nimport type { SpecOptions } from '@vltpkg/spec/browser'\nimport type { EdgeLike, NodeLike, GraphLike } from '@vltpkg/types'\n\n/**\n * An unique DepID to identify the virtual root node.\n */\nexport const VIRTUAL_ROOT_ID = joinDepIDTuple([\n  'file',\n  '__virtual%root__',\n])\n\n/**\n * A virtual root used to aggregate multiple importers into a single graph.\n *\n * This is meant to be used with visual tools that want a single root node\n * starting point to represent the graph.\n *\n * Returns undefined if a virtual root is not needed.\n */\nexport const createVirtualRoot = (\n  name = 'virtual-root',\n  options: SpecOptions,\n  mainImporters: NodeLike[],\n): NodeLike | undefined => {\n  const res = {\n    id: VIRTUAL_ROOT_ID,\n    name,\n    version: '1.0.0',\n    manifest: {\n      name,\n      version: '1.0.0',\n    },\n    edgesIn: new Set(),\n    edgesOut: new Map<string, EdgeLike>([]),\n    confused: false,\n    importer: true,\n    mainImporter: true,\n    location: '.',\n    graph: { importers: new Set() } as GraphLike,\n    projectRoot: '',\n    dev: false,\n    optional: false,\n    options,\n    setConfusedManifest() {},\n    setResolved() {},\n    maybeSetConfusedManifest() {},\n    workspaces: undefined,\n    toJSON() {\n      return {\n        id: this.id,\n        name: this.name,\n        version: this.version,\n        location: this.location,\n        importer: this.importer,\n        manifest: this.manifest,\n        projectRoot: this.projectRoot,\n        integrity: this.integrity,\n        resolved: this.resolved,\n        dev: this.dev,\n        optional: this.optional,\n        confused: false,\n      }\n    },\n  } satisfies NodeLike\n\n  // @ts-expect-error\n  res[Symbol.toStringTag] = '@vltpkg/graph.Node'\n\n  // link all mainImporters to the virtual root\n  for (const importer of mainImporters) {\n    const name = importer.name || '(unknown)'\n    if (importer.mainImporter) {\n      const spec = Spec.parse(name, 'file:.', options)\n      const edge = {\n        name: spec.name,\n        from: res,\n        to: importer,\n        spec,\n        type: 'prod',\n      } satisfies EdgeLike\n      res.edgesOut.set(name, edge)\n      importer.edgesIn.add(edge)\n    }\n  }\n  return res\n}\n"]}

package/dist/esm/visualization/human-readable-output.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"human-readable-output.d.ts","sourceRoot":"","sources":["../../../src/visualization/human-readable-output.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AAkBvD,MAAM,MAAM,QAAQ,GAAG;IACrB,IAAI,CAAC,EAAE,MAAM,GAAG,IAAI,CAAA;IACpB,IAAI,EAAE,QAAQ,GAAG,SAAS,CAAA;IAC1B,IAAI,EAAE,QAAQ,GAAG,SAAS,CAAA;IAC1B,MAAM,EAAE,MAAM,CAAA;IACd,OAAO,EAAE,MAAM,CAAA;IACf,UAAU,EAAE,OAAO,CAAA;IACnB,IAAI,EAAE,OAAO,CAAA;IACb,OAAO,EAAE,OAAO,CAAA;IAChB,MAAM,EAAE,QAAQ,GAAG,SAAS,CAAA;CAC7B,CAAA;AAED,MAAM,MAAM,wBAAwB,GAAG;IACrC,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;AAED,MAAM,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,GAAG,SAAS,EAAE,QAAQ,CAAC,CAAA;AAEzD,MAAM,MAAM,OAAO,GAAG,GAAG,CAAC,QAAQ,GAAG,SAAS,EAAE,OAAO,CAAC,CAAA;AAoExD;;GAEG;AACH,wBAAgB,mBAAmB,CACjC,OAAO,EAAE,wBAAwB,EACjC,EAAE,MAAM,EAAE,EAAE;IAAE,MAAM,CAAC,EAAE,OAAO,CAAA;CAAE,UA4HjC"}

package/dist/esm/visualization/human-readable-output.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"human-readable-output.js","sourceRoot":"","sources":["../../../src/visualization/human-readable-output.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,mBAAmB,EAAE,MAAM,cAAc,CAAA;AAClD,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAA;AAE3C,OAAO,EAAE,SAAS,IAAI,aAAa,EAAE,MAAM,WAAW,CAAA;AAEtD,MAAM,SAAS,GAAG,CAChB,MAA2C,EAC3C,CAAS,EACT,EAAE,CAAC,aAAa,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,cAAc,EAAE,KAAK,EAAE,CAAC,CAAA;AAExD,MAAM,KAAK,GAAG,IAAI,GAAG,CACnB,MAAM,CAAC,OAAO,CAAC;IACb,UAAU,EAAE,GAAG;IACf,IAAI,EAAE,GAAG;IACT,YAAY,EAAE,GAAG;IACjB,cAAc,EAAE,GAAG;IACnB,CAAC,EAAE,GAAG;CACP,CAAC,CACH,CAAA;AAyBD,MAAM,UAAU,GAAG,CACjB,OAAiC,EACjC,IAAe,EACf,IAAe,EACf,EAAE,CACF,CAAC,CAAC,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;IACvC,CAAC,CAAC,IAAI,IAAI,OAAO,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAA;AAEzC;;GAEG;AACH,MAAM,YAAY,GAAG,CACnB,YAA2B,EAC3B,OAAiC,EACjC,EAAE;IACF,MAAM,SAAS,GAAG,IAAI,GAAG,EAAY,CAAA;IACrC,MAAM,SAAS,GAAY,IAAI,GAAG,EAAE,CAAA;IACpC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAW,YAAY,CAAC,CAAA;IAChD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,IAAI,CAAC,IAAI,EAAE,CAAC;YACd,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC7B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAA;gBAChB,SAAQ;YACV,CAAC;YACD,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YACxB,MAAM,KAAK,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAA;YAC9C,MAAM,UAAU,GACd,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;YAChE,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,EAAE,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACvD,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CACnC,CAAA;YAED,8DAA8D;YAC9D,kEAAkE;YAClE,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAA;YACtC,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;gBAC5B,IAAI,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;oBAChC,SAAQ;gBACV,CAAC;gBACD,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAC3B,MAAM,OAAO,GACX,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,IAAK,IAAI,GAAG,EAAc,CAAA;gBAC/C,MAAM,QAAQ,GAAa;oBACzB,IAAI;oBACJ,IAAI,EAAE,IAAI,CAAC,EAAE;oBACb,UAAU,EAAE,KAAK;oBACjB,OAAO,EAAE,EAAE;oBACX,MAAM,EAAE,EAAE;oBACV,IAAI,EAAE,KAAK;oBACX,OAAO,EAAE,UAAU,CAAC,OAAO,EAAE,IAAI,EAAE,IAAI,CAAC,EAAE,CAAC;oBAC3C,MAAM,EAAE,IAAI;iBACb,CAAA;gBACD,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAA;gBAC9B,SAAS,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAA;gBAC5B,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAA;YACxB,CAAC;QACH,CAAC;IACH,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,CAAC,GAAG,QAAQ,CAAC,CAAC,OAAO,EAAE,EAAE,CAAC;QAC3C,IAAI,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,MAAM,EAAE,CAAC;YAChC,IAAI,CAAC,MAAM,CAAC,OAAO,GAAG,IAAI,CAAA;QAC5B,CAAC;IACH,CAAC;IACD,OAAO,SAAS,CAAA;AAClB,CAAC,CAAA;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CACjC,OAAiC,EACjC,EAAE,MAAM,EAAwB;IAEhC,MAAM,EAAE,SAAS,EAAE,GAAG,OAAO,CAAA;IAC7B,MAAM,eAAe,GACnB,CAAC,KAAsC,EAAE,EAAE,CAAC,CAAC,CAAS,EAAE,EAAE,CACxD,MAAM,CAAC,CAAC,CAAC,SAAS,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAA;IACpC,MAAM,GAAG,GAAG,eAAe,CAAC,KAAK,CAAC,CAAA;IAClC,MAAM,GAAG,GAAG,eAAe,CAAC,KAAK,CAAC,CAAA;IAClC,MAAM,KAAK,GAAG,eAAe,CAAC,OAAO,CAAC,CAAA;IACtC,MAAM,MAAM,GAAG,eAAe,CAAC,QAAQ,CAAC,CAAA;IACxC,MAAM,YAAY,GAAG,IAAI,GAAG,EAAY,CAAA;IACxC,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;QACjC,YAAY,CAAC,GAAG,CAAC;YACf,IAAI,EAAE,QAAQ,CAAC,IAAI;YACnB,IAAI,EAAE,SAAS;YACf,IAAI,EAAE,QAAQ;YACd,MAAM,EAAE,EAAE;YACV,OAAO,EAAE,EAAE;YACX,UAAU,EAAE,KAAK;YACjB,IAAI,EAAE,KAAK;YACX,OAAO,EAAE,UAAU,CAAC,OAAO,EAAE,SAAS,EAAE,QAAQ,CAAC;YACjD,MAAM,EAAE,SAAS;SAClB,CAAC,CAAA;IACJ,CAAC;IACD,MAAM,SAAS,GAAG,YAAY,CAAC,YAAY,EAAE,OAAO,CAAC,CAAA;IAErD,IAAI,GAAG,GAAG,EAAE,CAAA;IACZ,MAAM,QAAQ,GAAG,CAAC,IAAc,EAAE,EAAE;QAClC,IAAI,MAAM,GAAG,EAAE,CAAA;QACf,IAAI,OAAO,GAAG,EAAE,CAAA;QAEhB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAA;QACtB,MAAM,aAAa,GACjB,CACE,OAAO,CAAC,kBAAkB;YAC1B,UAAU,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC;YACzC,IAAI,CACL,CAAC,CAAC;YACD,MAAM,CAAC,IAAI,CAAC;YACd,CAAC,CAAC,IAAI,CAAA;QACR,IAAI,CAAC,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC/B,MAAM,OAAO,GACX,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC,CAAC;gBACnC,GAAG,CAAC,oBAAoB,CAAC;gBAC3B,CAAC,CAAC,GAAG,CAAC,WAAW,CAAC,CAAA;YACpB,OAAO,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,aAAa,IAAI,OAAO,IAAI,CAAA;QACrE,CAAC;QAED,MAAM,IAAI,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,MAAM,GAAG,aAAa,IAAI,CAAA;QAE3D,iDAAiD;QACjD,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACf,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAA;YAC/D,MAAM,UAAU,GACd,IAAI,CAAC,IAAI,EAAE,UAAU,CAAC,CAAC;gBACrB,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC;gBACpC,CAAC,CAAC,EAAE,CAAA;YACN,MAAM,QAAQ,GAAG,CAAC,GAAG,KAAK,EAAE,GAAG,UAAU,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CACvD,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,EAAE,IAAI,CAAC,CACnC,CAAA;YACD,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAA;YAChE,MAAM,aAAa,GAAG,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,OAAO,CAAC,CAAA;YAEvD,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,2DAA2D;gBAC3D,IAAI,CAAC,QAAQ;oBAAE,SAAQ;gBAEvB,MAAM,MAAM,GAAG,IAAI,CAAA;gBACnB,MAAM,MAAM,GACV,aAAa,CAAC,OAAO,CAAC,QAAQ,CAAC,KAAK,aAAa,CAAC,MAAM,GAAG,CAAC,CAAA;gBAE9D,gDAAgD;gBAChD,qCAAqC;gBACrC,MAAM,UAAU,GACd,QAAQ,CAAC,IAAI,EAAE,EAAE,IAAI,UAAU,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAA;gBACnD,MAAM,YAAY,GAChB,UAAU,EAAE,CAAC,CAAC,CAAC,KAAK,UAAU;oBAC9B,UAAU,CAAC,CAAC,CAAC;oBACb,UAAU,CAAC,CAAC,CAAC,KAAK,mBAAmB,CAAA;gBACvC,MAAM,QAAQ,GACZ,YAAY,CAAC,CAAC;oBACZ,GAAG,UAAU,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE;oBAC3C,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAA;gBAEvB,MAAM,MAAM,GACV,QAAQ,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;oBACtB,GAAG,QAAQ,IAAI,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE;oBACxC,CAAC,CAAC,QAAQ,CAAA;gBACZ,MAAM,QAAQ,GAAG,MAAM,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,cAAc,CAAA;gBAEvD,MAAM,cAAc,GAClB,YAAY;oBACZ,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI;wBAClB,QAAQ,CAAC,IAAI,EAAE,IAAI,KAAK,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;gBAC/C,QAAQ,CAAC,IAAI;oBACX,QAAQ,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;wBACvB,GAAG,QAAQ,CAAC,IAAI,EAAE,IAAI,IAAI,GAAG,CAAC,YAAY,CAAC,EAAE;wBAC/C,CAAC,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,UAAU,CAAC,CAAC;4BAChC,oBAAoB;4BACpB,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,IAAI,QAAQ,CAAC,IAAI,EAAE,OAAO,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,cAAc,CAAC,CAAC,CAAC,KAAK,MAAM,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,MAAM,CAAC,cAAc,CAAC,EAAE;4BACnJ,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,IAAI,KAAK,MAAM,GAAG;gCACvD,CAAC,CAAC,GAAG,QAAQ,CAAC,IAAI,EAAE,IAAI,IAAI,QAAQ,CAAC,IAAI,EAAE,OAAO,IAAI,QAAQ,CAAC,IAAI,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAA;gBACtF,QAAQ,CAAC,OAAO;oBACd,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;wBACpB,GAAG,MAAM,CAAC,OAAO,GAAG,MAAM,CAAC,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,GAAG;wBACpE,CAAC,CAAC,EAAE,CAAA;gBACN,QAAQ,CAAC,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAA;gBAC/F,QAAQ,CAAC,UAAU,GAAG,CAAC,MAAM,CAAA;gBAE7B,OAAO,IAAI,QAAQ,CAAC,QAAQ,CAAC,CAAA;YAC/B,CAAC;QACH,CAAC;QAED,MAAM,iBAAiB,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,YAAY,CAAC,GAAG,CAAA;QACvD,MAAM,gBAAgB,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAA;QAC7C,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC;YACjB,GAAG,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,iBAAiB,EAAE,gBAAgB,CAAC,CAAC,CAAC,CAAC,MAAM,GAAG,OAAO,EAAE;YACvF,CAAC,CAAC,EAAE,CAAA;IACR,CAAC,CAAA;IAED,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,GAAG,IAAI,QAAQ,CAAC,IAAI,CAAC,CAAA;IACvB,CAAC;IACD,OAAO,KAAK,CAAC,GAAG,CAAC,CAAA;AACnB,CAAC","sourcesContent":["import { defaultRegistryName } from '@vltpkg/spec'\nimport { splitDepID } from '@vltpkg/dep-id'\nimport type { EdgeLike, NodeLike } from '@vltpkg/types'\nimport { styleText as utilStyleText } from 'node:util'\n\nconst styleText = (\n  format: Parameters<typeof utilStyleText>[0],\n  s: string,\n) => utilStyleText(format, s, { validateStream: false })\n\nconst chars = new Map(\n  Object.entries({\n    connection: '─',\n    down: '│',\n    'last-child': '└',\n    'middle-child': '├',\n    t: '┬',\n  }),\n)\n\nexport type TreeItem = {\n  name?: string | null\n  edge: EdgeLike | undefined\n  node: NodeLike | undefined\n  prefix: string\n  padding: string\n  hasSibling: boolean\n  seen: boolean\n  include: boolean\n  parent: TreeItem | undefined\n}\n\nexport type HumanReadableOutputGraph = {\n  edges: EdgeLike[]\n  importers: Set<NodeLike>\n  nodes: NodeLike[]\n  highlightSelection?: boolean\n}\n\nexport type EdgeMap = Map<NodeLike | undefined, TreeItem>\n\nexport type TreeMap = Map<EdgeLike | undefined, EdgeMap>\n\nconst isSelected = (\n  options: HumanReadableOutputGraph,\n  edge?: EdgeLike,\n  node?: NodeLike,\n) =>\n  (!node || options.nodes.includes(node)) &&\n  (!edge || options.edges.includes(edge))\n\n/**\n * Returns a map of tree items to be printed.\n */\nconst getTreeItems = (\n  initialItems: Set<TreeItem>,\n  options: HumanReadableOutputGraph,\n) => {\n  const seenNodes = new Set<NodeLike>()\n  const treeItems: TreeMap = new Map()\n  const traverse = new Set<TreeItem>(initialItems)\n  for (const item of traverse) {\n    if (item.node) {\n      if (seenNodes.has(item.node)) {\n        item.seen = true\n        continue\n      }\n      seenNodes.add(item.node)\n      const edges = [...item.node.edgesOut.values()]\n      const workspaces =\n        item.node.workspaces ? [...item.node.workspaces.values()] : []\n      const allEdges = [...edges, ...workspaces].sort((a, b) =>\n        a.name.localeCompare(b.name, 'en'),\n      )\n\n      // keeps track of seen edge names to avoid duplicating printed\n      // items when a workspace is also a regular dependency of the root\n      const seenEdgeName = new Set<string>()\n      for (const edge of allEdges) {\n        if (seenEdgeName.has(edge.name)) {\n          continue\n        }\n        seenEdgeName.add(edge.name)\n        const toItems: EdgeMap =\n          treeItems.get(edge) ?? (new Map() as EdgeMap)\n        const nextItem: TreeItem = {\n          edge,\n          node: edge.to,\n          hasSibling: false,\n          padding: '',\n          prefix: '',\n          seen: false,\n          include: isSelected(options, edge, edge.to),\n          parent: item,\n        }\n        toItems.set(edge.to, nextItem)\n        treeItems.set(edge, toItems)\n        traverse.add(nextItem)\n      }\n    }\n  }\n  for (const item of [...traverse].reverse()) {\n    if (item.include && item.parent) {\n      item.parent.include = true\n    }\n  }\n  return treeItems\n}\n\n/**\n * Returns a human-readable output of the graph.\n */\nexport function humanReadableOutput(\n  options: HumanReadableOutputGraph,\n  { colors }: { colors?: boolean },\n) {\n  const { importers } = options\n  const createStyleText =\n    (style: Parameters<typeof styleText>[0]) => (s: string) =>\n      colors ? styleText(style, s) : s\n  const dim = createStyleText('dim')\n  const red = createStyleText('red')\n  const reset = createStyleText('reset')\n  const yellow = createStyleText('yellow')\n  const initialItems = new Set<TreeItem>()\n  for (const importer of importers) {\n    initialItems.add({\n      name: importer.name,\n      edge: undefined,\n      node: importer,\n      prefix: '',\n      padding: '',\n      hasSibling: false,\n      seen: false,\n      include: isSelected(options, undefined, importer),\n      parent: undefined,\n    })\n  }\n  const treeItems = getTreeItems(initialItems, options)\n\n  let res = ''\n  const traverse = (item: TreeItem) => {\n    let header = ''\n    let content = ''\n\n    const name = item.name\n    const decoratedName =\n      (\n        options.highlightSelection &&\n        isSelected(options, item.edge, item.node) &&\n        name\n      ) ?\n        yellow(name)\n      : name\n    if (!item.node && item.include) {\n      const missing =\n        item.edge?.type.endsWith('ptional') ?\n          dim('(missing optional)')\n        : red('(missing)')\n      return `${item.padding}${item.prefix}${decoratedName} ${missing}\\n`\n    }\n\n    header += `${item.padding}${item.prefix}${decoratedName}\\n`\n\n    // seen items need not to be printed or traversed\n    if (!item.seen) {\n      const edges = item.node ? [...item.node.edgesOut.values()] : []\n      const workspaces =\n        item.node?.workspaces ?\n          [...item.node.workspaces.values()]\n        : []\n      const allEdges = [...edges, ...workspaces].sort((a, b) =>\n        a.name.localeCompare(b.name, 'en'),\n      )\n      const nextItems = allEdges.map(i => treeItems.get(i)?.get(i.to))\n      const includedItems = nextItems.filter(i => i?.include)\n\n      for (const nextItem of nextItems) {\n        /* c8 ignore next -- impossible but TS doesn't know that */\n        if (!nextItem) continue\n\n        const parent = item\n        const isLast =\n          includedItems.indexOf(nextItem) === includedItems.length - 1\n\n        // prefixes the node name with the registry name\n        // if a custom registry name is found\n        const depIdTuple =\n          nextItem.node?.id && splitDepID(nextItem.node.id)\n        const hasCustomReg =\n          depIdTuple?.[0] === 'registry' &&\n          depIdTuple[1] &&\n          depIdTuple[1] !== defaultRegistryName\n        const nodeName =\n          hasCustomReg ?\n            `${depIdTuple[1]}:${nextItem.node?.name}`\n          : nextItem.node?.name\n\n        const toName =\n          nextItem.node?.version ?\n            `${nodeName}@${nextItem.node.version}`\n          : nodeName\n        const nextChar = isLast ? 'last-child' : 'middle-child'\n\n        const aliasedPackage =\n          hasCustomReg ||\n          (nextItem.node?.name &&\n            nextItem.edge?.name !== nextItem.node.name)\n        nextItem.name =\n          nextItem.node?.confused ?\n            `${nextItem.edge?.name} ${red('(confused)')}`\n          : nextItem.edge?.spec.overridden ?\n            /* c8 ignore next */\n            `${nextItem.edge.name}@${nextItem.node?.version || nextItem.edge.spec.bareSpec}${aliasedPackage ? ` (${toName})` : ''} ${yellow('(overridden)')}`\n          : aliasedPackage ? `${nextItem.edge?.name} (${toName})`\n          : `${nextItem.edge?.name}@${nextItem.node?.version || nextItem.edge?.spec.bareSpec}`\n        nextItem.padding =\n          parent.prefix.length ?\n            `${parent.padding}${parent.hasSibling ? chars.get('down') : ' '} `\n          : ''\n        nextItem.prefix = `${chars.get(nextChar)}${chars.get('connection')}${chars.get('connection')} `\n        nextItem.hasSibling = !isLast\n\n        content += traverse(nextItem)\n      }\n    }\n\n    const regularConnection = `${chars.get('connection')} `\n    const parentConnection = `${chars.get('t')} `\n    return item.include ?\n        `${content ? header.replace(regularConnection, parentConnection) : header}${content}`\n      : ''\n  }\n\n  for (const item of initialItems) {\n    res += traverse(item)\n  }\n  return reset(res)\n}\n"]}

package/dist/esm/visualization/json-output.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"json-output.d.ts","sourceRoot":"","sources":["../../../src/visualization/json-output.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,gBAAgB,CAAA;AAC3C,OAAO,KAAK,EAAE,QAAQ,EAAE,QAAQ,EAAE,MAAM,eAAe,CAAA;AAEvD;;;GAGG;AACH,MAAM,MAAM,cAAc,GAAG;IAC3B;;OAEG;IACH,IAAI,EAAE,MAAM,CAAA;IACZ;;OAEG;IACH,MAAM,CAAC,EAAE,KAAK,CAAA;IACd;;OAEG;IACH,IAAI,CAAC,EAAE,MAAM,CAAA;IACb;;OAEG;IACH,IAAI,CAAC,EAAE,QAAQ,CAAC,MAAM,CAAC,CAAA;IACvB;;OAEG;IACH,EAAE,CAAC,EAAE,QAAQ,CAAA;IACb;;OAEG;IACH,UAAU,EAAE,OAAO,CAAA;CACpB,CAAA;AAED,MAAM,MAAM,eAAe,GAAG;IAC5B,KAAK,EAAE,QAAQ,EAAE,CAAA;IACjB,KAAK,EAAE,QAAQ,EAAE,CAAA;IACjB,SAAS,EAAE,GAAG,CAAC,QAAQ,CAAC,CAAA;CACzB,CAAA;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,EACzB,KAAK,EACL,KAAK,EACL,SAAS,GACV,EAAE,eAAe,oBA2CjB"}

package/dist/esm/visualization/json-output.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"json-output.js","sourceRoot":"","sources":["../../../src/visualization/json-output.ts"],"names":[],"mappings":"AAwCA;;GAEG;AACH,MAAM,UAAU,UAAU,CAAC,EACzB,KAAK,EACL,KAAK,EACL,SAAS,GACO;IAChB,MAAM,GAAG,GAAqB,EAAE,CAAA;IAChC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAS,CAAA;IAEhC,yDAAyD;IACzD,MAAM,YAAY,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QAC5C,MAAM,YAAY,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,WAAW,CAAA;QAChD,MAAM,YAAY,GAAG,CAAC,CAAC,IAAI,CAAC,IAAI,KAAK,WAAW,CAAA;QAChD,IAAI,YAAY,IAAI,CAAC,YAAY;YAAE,OAAO,CAAC,CAAC,CAAA;QAC5C,oBAAoB;QACpB,IAAI,CAAC,YAAY,IAAI,YAAY;YAAE,OAAO,CAAC,CAAA;QAC3C,OAAO,CAAC,CAAA,CAAC,oCAAoC;IAC/C,CAAC,CAAC,CAAA;IACF,KAAK,MAAM,IAAI,IAAI,YAAY,EAAE,CAAC;QAChC,IAAI,IAAI,CAAC,EAAE;YAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,CAAA;QACpC,GAAG,CAAC,IAAI,CAAC;YACP,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE;YACpB,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC;YACvB,IAAI,EAAE,IAAI,CAAC,IAAI;YACf,EAAE,EAAE,IAAI,CAAC,EAAE;YACX,UAAU,EAAE,IAAI,CAAC,IAAI,CAAC,UAAU;SACjC,CAAC,CAAA;IACJ,CAAC;IAED,qDAAqD;IACrD,sBAAsB;IACtB,MAAM,gBAAgB,GAAG,CAAC,GAAG,SAAS,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACpD,IAAI,CAAC,CAAC,CAAC,IAAI;YAAE,OAAO,CAAC,CAAA;QACrB,IAAI,CAAC,CAAC,CAAC,IAAI;YAAE,OAAO,CAAC,CAAC,CAAA;QACtB,OAAO,CAAC,CAAC,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,IAAI,CAAC,CAAA;IACrC,CAAC,CAAC,CAAA;IACF,KAAK,MAAM,IAAI,IAAI,gBAAgB,EAAE,CAAC;QACpC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAQ;QAC3D,GAAG,CAAC,OAAO,CAAC;YACV,8DAA8D;YAC9D,IAAI,EAAE,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,EAAE;YAC1B,EAAE,EAAE,IAAI;YACR,UAAU,EAAE,KAAK;SAClB,CAAC,CAAA;IACJ,CAAC;IAED,OAAO,GAAG,CAAA;AACZ,CAAC","sourcesContent":["import type { DepID } from '@vltpkg/dep-id'\nimport type { EdgeLike, NodeLike } from '@vltpkg/types'\n\n/**\n * A JSON output item describes a package that is present in the install\n * graph. It represents an edge plus it's linking Node.\n */\nexport type JSONOutputItem = {\n  /**\n   * The name of the package.\n   */\n  name: string\n  /**\n   * A reference to the id of the Node that this package is linked from.\n   */\n  fromID?: DepID\n  /**\n   * The dependency spec definition for this package.\n   */\n  spec?: string\n  /**\n   * The package type.\n   */\n  type?: EdgeLike['type']\n  /**\n   * A representation of the package object that fulfills this dependency.\n   */\n  to?: NodeLike\n  /**\n   * Whether this edge was overridden by a graph modifier.\n   */\n  overridden: boolean\n}\n\nexport type JSONOutputGraph = {\n  edges: EdgeLike[]\n  nodes: NodeLike[]\n  importers: Set<NodeLike>\n}\n\n/**\n * Returns a JSON string representation of the graph.\n */\nexport function jsonOutput({\n  edges,\n  nodes,\n  importers,\n}: JSONOutputGraph) {\n  const res: JSONOutputItem[] = []\n  const seenIds = new Set<DepID>()\n\n  // Collects edge & it's linked nodes as json output items\n  const orderedEdges = [...edges].sort((a, b) => {\n    const aIsWorkspace = a.spec.type === 'workspace'\n    const bIsWorkspace = b.spec.type === 'workspace'\n    if (aIsWorkspace && !bIsWorkspace) return -1\n    /* c8 ignore next */\n    if (!aIsWorkspace && bIsWorkspace) return 1\n    return 0 // preserve original order otherwise\n  })\n  for (const edge of orderedEdges) {\n    if (edge.to) seenIds.add(edge.to.id)\n    res.push({\n      name: edge.name,\n      fromID: edge.from.id,\n      spec: String(edge.spec),\n      type: edge.type,\n      to: edge.to,\n      overridden: edge.spec.overridden,\n    })\n  }\n\n  // Collects included importer nodes json output items\n  /* c8 ignore next 3 */\n  const orderedImporters = [...importers].sort((a, b) => {\n    if (!a.name) return 1\n    if (!b.name) return -1\n    return a.name.localeCompare(b.name)\n  })\n  for (const node of orderedImporters) {\n    if (!nodes.includes(node) || seenIds.has(node.id)) continue\n    res.unshift({\n      /* c8 ignore next - name can't be missing but ts won't know */\n      name: node.name || node.id,\n      to: node,\n      overridden: false,\n    })\n  }\n\n  return res\n}\n"]}

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

@@ -1 +0,0 @@
-{"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"}

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

@@ -1 +0,0 @@
-{"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"]}

package/dist/esm/visualization/object-like-output.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"object-like-output.d.ts","sourceRoot":"","sources":["../../../src/visualization/object-like-output.ts"],"names":[],"mappings":"AACA,OAAO,KAAK,EAAY,SAAS,EAAY,MAAM,eAAe,CAAA;AA8DlE,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,SAAS,UAOhD"}

package/dist/esm/visualization/object-like-output.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"object-like-output.js","sourceRoot":"","sources":["../../../src/visualization/object-like-output.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AAGnC,MAAM,UAAU,GAAG,CAAC,CAAU,EAAE,EAAgB,EAAE,EAAE,CAClD,CAAE,CAAoD,CACpD,OAAO,CAAC,MAAM,CACf,GAAG,EAAE,CAAC,CAAA;AAET,SAAS,SAAS,CAChB,SAAwB,EACxB,KAAgB,EAChB,IAAc;IAEd,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE;QACpB,MAAM,GAAG,GACP,OAAO;YACP,OAAO,CACL,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;gBACnB,EAAE,GAAG,EAAE,IAAI,CAAC,EAAE,EAAE;gBAClB,CAAC,CAAC;oBACE,EAAE,EAAE,IAAI,CAAC,EAAE;oBACX,QAAQ,EAAE,IAAI,CAAC,QAAQ;oBACvB,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;oBAC9C,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;oBACpC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;oBAC9C,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,QAAQ,EAAE,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;oBACvD,GAAG,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;wBAClB,EAAE,SAAS,EAAE,IAAI,CAAC,SAAS,EAAE;wBAC/B,CAAC,CAAC,IAAI,CAAC;oBACP,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;wBACtB;4BACE,QAAQ,EAAE,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE;gCAC5C,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,CAAA;gCACnB,OAAO,SAAS,CAAC,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC,CAAA;4BACvC,CAAC,CAAC;yBACH;wBACH,CAAC,CAAC,CAAC,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC;iBAC/B,EACH,EAAE,KAAK,EAAE,QAAQ,EAAE,CACpB,CAAA;QACH,OAAO,GAAG,CAAA;IACZ,CAAC,CAAC,CAAA;IACF,OAAO,IAAI,CAAA;AACb,CAAC;AAED,SAAS,SAAS,CAChB,SAAwB,EACxB,KAAgB,EAChB,IAAc;IAEd,UAAU,CAAC,IAAI,EAAE,GAAG,EAAE;QACpB,MAAM,WAAW,GAAG,uBAAuB,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,CAAA;QAC7E,MAAM,OAAO,GACX,IAAI,CAAC,EAAE,CAAC,CAAC;YACP,OAAO,CAAC,SAAS,CAAC,SAAS,EAAE,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE;gBAC5C,KAAK,EAAE,QAAQ;aAChB,CAAC;YACJ,CAAC,CAAC,WAAW,CAAA;QACf,OAAO,aAAa,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC,IAAI,UAAU,OAAO,EAAE,CAAA;IACzE,CAAC,CAAC,CAAA;IACF,OAAO,IAAI,CAAA;AACb,CAAC;AAED,MAAM,UAAU,gBAAgB,CAAC,KAAgB;IAC/C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAY,CAAA;IACrC,MAAM,SAAS,GAAG,CAAC,GAAG,KAAK,CAAC,SAAS,CAAC,CAAA;IACtC,OAAO,OAAO,CACZ,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,SAAS,CAAC,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,EAClD,EAAE,KAAK,EAAE,QAAQ,EAAE,CACpB,CAAA;AACH,CAAC","sourcesContent":["import { inspect } from 'node:util'\nimport type { EdgeLike, GraphLike, NodeLike } from '@vltpkg/types'\n\nconst addInspect = (o: unknown, fn: () => string) =>\n  ((o as { [K in typeof inspect.custom]: () => string })[\n    inspect.custom\n  ] = fn)\n\nfunction parseNode(\n  seenNodes: Set<NodeLike>,\n  graph: GraphLike,\n  node: NodeLike,\n) {\n  addInspect(node, () => {\n    const res =\n      'Node ' +\n      inspect(\n        seenNodes.has(node) ?\n          { ref: node.id }\n        : {\n            id: node.id,\n            location: node.location,\n            ...(node.importer ? { importer: true } : null),\n            ...(node.dev ? { dev: true } : null),\n            ...(node.optional ? { optional: true } : null),\n            ...(node.resolved ? { resolved: node.resolved } : null),\n            ...(node.integrity ?\n              { integrity: node.integrity }\n            : null),\n            ...(node.edgesOut.size ?\n              {\n                edgesOut: [...node.edgesOut.values()].map(i => {\n                  seenNodes.add(node)\n                  return parseEdge(seenNodes, graph, i)\n                }),\n              }\n            : (seenNodes.add(node), null)),\n          },\n        { depth: Infinity },\n      )\n    return res\n  })\n  return node\n}\n\nfunction parseEdge(\n  seenNodes: Set<NodeLike>,\n  graph: GraphLike,\n  edge: EdgeLike,\n) {\n  addInspect(edge, () => {\n    const missingNode = `[missing package]: <${edge.name}@${edge.spec.bareSpec}>`\n    const toLabel: string =\n      edge.to ?\n        inspect(parseNode(seenNodes, graph, edge.to), {\n          depth: Infinity,\n        })\n      : missingNode\n    return `Edge spec(${String(edge.spec)}) -${edge.type}-> to: ${toLabel}`\n  })\n  return edge\n}\n\nexport function objectLikeOutput(graph: GraphLike) {\n  const seenNodes = new Set<NodeLike>()\n  const importers = [...graph.importers]\n  return inspect(\n    importers.map(i => parseNode(seenNodes, graph, i)),\n    { depth: Infinity },\n  )\n}\n"]}