@teambit/graph 0.0.880 → 0.0.882

package/dist/component-graph/component-graph.js

@@ -1,73 +1,54 @@
 "use strict";
 
 var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-
 require("core-js/modules/es.array.flat.js");
-
 require("core-js/modules/es.array.iterator.js");
-
 require("core-js/modules/es.array.unscopables.flat.js");
-
 require("core-js/modules/es.regexp.exec.js");
-
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.DEPENDENCIES_TYPES = exports.ComponentGraph = void 0;
-
 function _defineProperty2() {
   const data = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
-
   _defineProperty2 = function () {
     return data;
   };
-
   return data;
 }
-
 function _graph() {
   const data = require("@teambit/graph.cleargraph");
-
   _graph = function () {
     return data;
   };
-
   return data;
 }
-
 function _lodash() {
   const data = require("lodash");
-
   _lodash = function () {
     return data;
   };
-
   return data;
 }
-
 function _duplicateDependency() {
   const data = require("../duplicate-dependency");
-
   _duplicateDependency = function () {
     return data;
   };
-
   return data;
 }
-
 const DEPENDENCIES_TYPES = ['dependencies', 'devDependencies'];
 exports.DEPENDENCIES_TYPES = DEPENDENCIES_TYPES;
-
 class ComponentGraph extends _graph().Graph {
   // component IDs that started the graph. (if from workspace, the .bitmap ids normally)
   constructor(nodes = [], edges = []) {
     super(nodes, edges);
     (0, _defineProperty2().default)(this, "seederIds", []);
   }
-
   create(nodes = [], edges = []) {
     return new ComponentGraph(nodes, edges);
   }
+
   /**
    * check all the routes from the sources to targets and return the components found during this traversal.
    * e.g.
@@ -76,11 +57,8 @@ class ComponentGraph extends _graph().Graph {
    * B -> F -> G.
    * given source: A, targets: N. The results will be: B, C, E
    */
-
-
   findIdsFromSourcesToTargets(sources, targets) {
     const removeVerFromIdStr = idStr => idStr.split('@')[0];
-
     const sourcesStr = sources.map(s => s.toStringWithoutVersion());
     const targetsStr = targets.map(t => t.toStringWithoutVersion());
     const allFlattened = sources.map(source => this.successors(source.toString())).flat();
@@ -96,30 +74,25 @@ class ComponentGraph extends _graph().Graph {
     const components = this.getNodes(results).map(n => n.attr);
     return components.map(c => c.id);
   }
+
   /**
    * overrides the super class to eliminate non-seeders components
    */
-
-
   findCycles(graph) {
     const cycles = super.findCycles(graph);
-
     if (!this.shouldLimitToSeedersOnly()) {
       return cycles;
     }
-
     const seederIdsStr = this.seederIds.map(id => id.toString());
     const cyclesWithSeeders = cycles.filter(cycle => {
       return cycle.some(cycleIdStr => seederIdsStr.includes(cycleIdStr));
     });
     return cyclesWithSeeders;
   }
-
   findDuplicateDependencies() {
     const versionMap = this.calculateVersionMap();
     const seederIdsNoVersions = this.seederIds.map(id => id.toStringWithoutVersion());
     const duplicateDependencies = new Map();
-
     for (const [compFullName, versions] of versionMap) {
       if (versions.allVersionNodes.length > 1) {
         const versionSubgraphs = [];
@@ -138,40 +111,31 @@ class ComponentGraph extends _graph().Graph {
         });
         const isSeeder = seederIdsNoVersions.includes(compFullName);
         const shouldDisplayDueToBeingSeeder = !this.shouldLimitToSeedersOnly() || isSeeder;
-
         if (shouldDisplayDueToBeingSeeder && versionSubgraphs.length > 0) {
           const duplicateDep = new (_duplicateDependency().DuplicateDependency)(versions.latestVersionNode, versionSubgraphs);
           duplicateDependencies.set(compFullName, duplicateDep);
         }
       }
     }
-
     return duplicateDependencies;
   }
-
   buildFromCleargraph(graph) {
     return this.create(graph.nodes, graph.edges);
   }
-
   runtimeOnly(componentIds) {
     return this.successorsSubgraph(componentIds, {
       edgeFilter: edge => edge.attr.type === 'runtime'
     });
   }
-
   shouldLimitToSeedersOnly() {
     return this.seederIds.length;
   }
-
   calculateVersionMap() {
     const versionMap = new Map();
-
     for (const node of this.nodes) {
       const comp = node.attr;
       const compKey = node.id;
-
       const compFullName = comp.id._legacy.toStringWithoutVersion();
-
       if (!versionMap.has(compFullName)) {
         versionMap.set(compFullName, {
           allVersionNodes: [compKey],
@@ -179,33 +143,27 @@ class ComponentGraph extends _graph().Graph {
         });
       } else {
         const value = versionMap.get(compFullName);
-
         if (value) {
           var _this$node;
-
           if (Object.prototype.hasOwnProperty.call(value, 'allVersionNodes')) {
             value.allVersionNodes.push(compKey);
           }
-
           const currentComp = comp;
-          const latestComp = (_this$node = this.node(value.latestVersionNode)) === null || _this$node === void 0 ? void 0 : _this$node.attr; // @todo: this check won't work when the component doesn't have head.
+          const latestComp = (_this$node = this.node(value.latestVersionNode)) === null || _this$node === void 0 ? void 0 : _this$node.attr;
+          // @todo: this check won't work when the component doesn't have head.
           // it happens when a dependency is needed in an old version (not head). which Bit doesn't fetch the head
           // Version object, and as a result, the `Component.head` is empty.
           // for now it's probably good enough because it's used only for `findDuplicateDependencies`, which only
           // checks the components on the workspace.
-
           if (currentComp.head && latestComp !== null && latestComp !== void 0 && latestComp.head && new Date(currentComp.head.timestamp) > new Date(latestComp.head.timestamp)) {
             value.latestVersionNode = compKey;
           }
         }
       }
     }
-
     return versionMap;
   }
-
 }
-
 exports.ComponentGraph = ComponentGraph;
 
 //# sourceMappingURL=component-graph.js.map

package/dist/component-graph/component-graph.js.map

@@ -1 +1 @@
-{"version":3,"names":["DEPENDENCIES_TYPES","ComponentGraph","Graph","constructor","nodes","edges","create","findIdsFromSourcesToTargets","sources","targets","removeVerFromIdStr","idStr","split","sourcesStr","map","s","toStringWithoutVersion","targetsStr","t","allFlattened","source","successors","toString","flat","allFlattenedIds","uniq","f","id","results","forEach","idWithNoVer","includes","allSuccessors","allSuccessorsWithNoVersion","find","push","components","getNodes","n","attr","c","findCycles","graph","cycles","shouldLimitToSeedersOnly","seederIdsStr","seederIds","cyclesWithSeeders","filter","cycle","some","cycleIdStr","findDuplicateDependencies","versionMap","calculateVersionMap","seederIdsNoVersions","duplicateDependencies","Map","compFullName","versions","allVersionNodes","length","versionSubgraphs","notLatestVersions","version","latestVersionNode","predecessors","predecessorsSubgraph","immediatePredecessors","predecessor","subGraph","buildFromCleargraph","versionSubgraph","versionId","immediateDependents","isSeeder","shouldDisplayDueToBeingSeeder","duplicateDep","DuplicateDependency","set","runtimeOnly","componentIds","successorsSubgraph","edgeFilter","edge","type","node","comp","compKey","_legacy","has","value","get","Object","prototype","hasOwnProperty","call","currentComp","latestComp","head","Date","timestamp"],"sources":["component-graph.ts"],"sourcesContent":["import { Component, ComponentID } from '@teambit/component';\nimport { Graph, Node, Edge } from '@teambit/graph.cleargraph';\nimport { uniq } from 'lodash';\n\nimport { Dependency } from '../model/dependency';\nimport { DuplicateDependency, VersionSubgraph } from '../duplicate-dependency';\n\nexport const DEPENDENCIES_TYPES = ['dependencies', 'devDependencies'];\n\ntype ComponentNode = Node<Component>;\ntype DependencyEdge = Edge<Dependency>;\n\nexport class ComponentGraph extends Graph<Component, Dependency> {\n  seederIds: ComponentID[] = []; // component IDs that started the graph. (if from workspace, the .bitmap ids normally)\n  constructor(nodes: ComponentNode[] = [], edges: DependencyEdge[] = []) {\n    super(nodes, edges);\n  }\n\n  protected create(nodes: ComponentNode[] = [], edges: DependencyEdge[] = []): this {\n    return new ComponentGraph(nodes, edges) as this;\n  }\n\n  /**\n   * check all the routes from the sources to targets and return the components found during this traversal.\n   * e.g.\n   * A -> B -> C -> N.\n   * A -> E -> N.\n   * B -> F -> G.\n   * given source: A, targets: N. The results will be: B, C, E\n   */\n  findIdsFromSourcesToTargets(sources: ComponentID[], targets: ComponentID[]): ComponentID[] {\n    const removeVerFromIdStr = (idStr: string) => idStr.split('@')[0];\n    const sourcesStr = sources.map((s) => s.toStringWithoutVersion());\n    const targetsStr = targets.map((t) => t.toStringWithoutVersion());\n    const allFlattened = sources.map((source) => this.successors(source.toString())).flat();\n    const allFlattenedIds = uniq(allFlattened.map((f) => f.id));\n    const results: string[] = [];\n    allFlattenedIds.forEach((id) => {\n      const idWithNoVer = removeVerFromIdStr(id);\n      if (sourcesStr.includes(idWithNoVer) || targetsStr.includes(idWithNoVer)) return;\n      const allSuccessors = this.successors(id);\n      const allSuccessorsWithNoVersion = allSuccessors.map((s) => removeVerFromIdStr(s.id));\n      if (allSuccessorsWithNoVersion.find((s) => targetsStr.includes(s))) results.push(id);\n    });\n    const components = this.getNodes(results).map((n) => n.attr);\n\n    return components.map((c) => c.id);\n  }\n\n  /**\n   * overrides the super class to eliminate non-seeders components\n   */\n  findCycles(graph?: this): string[][] {\n    const cycles = super.findCycles(graph);\n    if (!this.shouldLimitToSeedersOnly()) {\n      return cycles;\n    }\n    const seederIdsStr = this.seederIds.map((id) => id.toString());\n    const cyclesWithSeeders = cycles.filter((cycle) => {\n      return cycle.some((cycleIdStr) => seederIdsStr.includes(cycleIdStr));\n    });\n    return cyclesWithSeeders;\n  }\n\n  findDuplicateDependencies(): Map<string, DuplicateDependency> {\n    const versionMap = this.calculateVersionMap();\n    const seederIdsNoVersions = this.seederIds.map((id) => id.toStringWithoutVersion());\n    const duplicateDependencies: Map<string, DuplicateDependency> = new Map();\n    for (const [compFullName, versions] of versionMap) {\n      if (versions.allVersionNodes.length > 1) {\n        const versionSubgraphs: VersionSubgraph[] = [];\n        const notLatestVersions = versions.allVersionNodes.filter((version) => version !== versions.latestVersionNode);\n        notLatestVersions.forEach((version) => {\n          const predecessors = this.predecessorsSubgraph(version);\n          const immediatePredecessors = this.predecessors(version).map((predecessor) => predecessor.id);\n          const subGraph = this.buildFromCleargraph(predecessors);\n          const versionSubgraph: VersionSubgraph = {\n            versionId: version,\n            subGraph,\n            // TODO: validate that this is working correctly\n            immediateDependents: immediatePredecessors,\n          };\n          versionSubgraphs.push(versionSubgraph);\n        });\n        const isSeeder = seederIdsNoVersions.includes(compFullName);\n        const shouldDisplayDueToBeingSeeder = !this.shouldLimitToSeedersOnly() || isSeeder;\n        if (shouldDisplayDueToBeingSeeder && versionSubgraphs.length > 0) {\n          const duplicateDep = new DuplicateDependency(versions.latestVersionNode, versionSubgraphs);\n          duplicateDependencies.set(compFullName, duplicateDep);\n        }\n      }\n    }\n    return duplicateDependencies;\n  }\n\n  buildFromCleargraph(graph: Graph<Component, Dependency>): ComponentGraph {\n    return this.create(graph.nodes, graph.edges);\n  }\n\n  runtimeOnly(componentIds: string[]) {\n    return this.successorsSubgraph(componentIds, {\n      edgeFilter: (edge: DependencyEdge) => edge.attr.type === 'runtime',\n    });\n  }\n\n  private shouldLimitToSeedersOnly() {\n    return this.seederIds.length;\n  }\n\n  private calculateVersionMap(): Map<string, { allVersionNodes: string[]; latestVersionNode: string }> {\n    const versionMap: Map<string, { allVersionNodes: string[]; latestVersionNode: string }> = new Map();\n    for (const node of this.nodes) {\n      const comp = node.attr;\n      const compKey = node.id;\n      const compFullName = comp.id._legacy.toStringWithoutVersion();\n      if (!versionMap.has(compFullName)) {\n        versionMap.set(compFullName, {\n          allVersionNodes: [compKey],\n          latestVersionNode: compKey,\n        });\n      } else {\n        const value = versionMap.get(compFullName);\n        if (value) {\n          if (Object.prototype.hasOwnProperty.call(value, 'allVersionNodes')) {\n            value.allVersionNodes.push(compKey);\n          }\n          const currentComp = comp;\n          const latestComp = this.node(value.latestVersionNode)?.attr;\n          // @todo: this check won't work when the component doesn't have head.\n          // it happens when a dependency is needed in an old version (not head). which Bit doesn't fetch the head\n          // Version object, and as a result, the `Component.head` is empty.\n          // for now it's probably good enough because it's used only for `findDuplicateDependencies`, which only\n          // checks the components on the workspace.\n          if (\n            currentComp.head &&\n            latestComp?.head &&\n            new Date(currentComp.head.timestamp) > new Date(latestComp.head.timestamp)\n          ) {\n            value.latestVersionNode = compKey;\n          }\n        }\n      }\n    }\n    return versionMap;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AACA;EAAA;;EAAA;IAAA;EAAA;;EAAA;AAAA;;AACA;EAAA;;EAAA;IAAA;EAAA;;EAAA;AAAA;;AAGA;EAAA;;EAAA;IAAA;EAAA;;EAAA;AAAA;;AAEO,MAAMA,kBAAkB,GAAG,CAAC,cAAD,EAAiB,iBAAjB,CAA3B;;;AAKA,MAAMC,cAAN,SAA6BC,cAA7B,CAA0D;EAChC;EAC/BC,WAAW,CAACC,KAAsB,GAAG,EAA1B,EAA8BC,KAAuB,GAAG,EAAxD,EAA4D;IACrE,MAAMD,KAAN,EAAaC,KAAb;IADqE,mDAD5C,EAC4C;EAEtE;;EAESC,MAAM,CAACF,KAAsB,GAAG,EAA1B,EAA8BC,KAAuB,GAAG,EAAxD,EAAkE;IAChF,OAAO,IAAIJ,cAAJ,CAAmBG,KAAnB,EAA0BC,KAA1B,CAAP;EACD;EAED;AACF;AACA;AACA;AACA;AACA;AACA;AACA;;;EACEE,2BAA2B,CAACC,OAAD,EAAyBC,OAAzB,EAAgE;IACzF,MAAMC,kBAAkB,GAAIC,KAAD,IAAmBA,KAAK,CAACC,KAAN,CAAY,GAAZ,EAAiB,CAAjB,CAA9C;;IACA,MAAMC,UAAU,GAAGL,OAAO,CAACM,GAAR,CAAaC,CAAD,IAAOA,CAAC,CAACC,sBAAF,EAAnB,CAAnB;IACA,MAAMC,UAAU,GAAGR,OAAO,CAACK,GAAR,CAAaI,CAAD,IAAOA,CAAC,CAACF,sBAAF,EAAnB,CAAnB;IACA,MAAMG,YAAY,GAAGX,OAAO,CAACM,GAAR,CAAaM,MAAD,IAAY,KAAKC,UAAL,CAAgBD,MAAM,CAACE,QAAP,EAAhB,CAAxB,EAA4DC,IAA5D,EAArB;IACA,MAAMC,eAAe,GAAG,IAAAC,cAAA,EAAKN,YAAY,CAACL,GAAb,CAAkBY,CAAD,IAAOA,CAAC,CAACC,EAA1B,CAAL,CAAxB;IACA,MAAMC,OAAiB,GAAG,EAA1B;IACAJ,eAAe,CAACK,OAAhB,CAAyBF,EAAD,IAAQ;MAC9B,MAAMG,WAAW,GAAGpB,kBAAkB,CAACiB,EAAD,CAAtC;MACA,IAAId,UAAU,CAACkB,QAAX,CAAoBD,WAApB,KAAoCb,UAAU,CAACc,QAAX,CAAoBD,WAApB,CAAxC,EAA0E;MAC1E,MAAME,aAAa,GAAG,KAAKX,UAAL,CAAgBM,EAAhB,CAAtB;MACA,MAAMM,0BAA0B,GAAGD,aAAa,CAAClB,GAAd,CAAmBC,CAAD,IAAOL,kBAAkB,CAACK,CAAC,CAACY,EAAH,CAA3C,CAAnC;MACA,IAAIM,0BAA0B,CAACC,IAA3B,CAAiCnB,CAAD,IAAOE,UAAU,CAACc,QAAX,CAAoBhB,CAApB,CAAvC,CAAJ,EAAoEa,OAAO,CAACO,IAAR,CAAaR,EAAb;IACrE,CAND;IAOA,MAAMS,UAAU,GAAG,KAAKC,QAAL,CAAcT,OAAd,EAAuBd,GAAvB,CAA4BwB,CAAD,IAAOA,CAAC,CAACC,IAApC,CAAnB;IAEA,OAAOH,UAAU,CAACtB,GAAX,CAAgB0B,CAAD,IAAOA,CAAC,CAACb,EAAxB,CAAP;EACD;EAED;AACF;AACA;;;EACEc,UAAU,CAACC,KAAD,EAA2B;IACnC,MAAMC,MAAM,GAAG,MAAMF,UAAN,CAAiBC,KAAjB,CAAf;;IACA,IAAI,CAAC,KAAKE,wBAAL,EAAL,EAAsC;MACpC,OAAOD,MAAP;IACD;;IACD,MAAME,YAAY,GAAG,KAAKC,SAAL,CAAehC,GAAf,CAAoBa,EAAD,IAAQA,EAAE,CAACL,QAAH,EAA3B,CAArB;IACA,MAAMyB,iBAAiB,GAAGJ,MAAM,CAACK,MAAP,CAAeC,KAAD,IAAW;MACjD,OAAOA,KAAK,CAACC,IAAN,CAAYC,UAAD,IAAgBN,YAAY,CAACd,QAAb,CAAsBoB,UAAtB,CAA3B,CAAP;IACD,CAFyB,CAA1B;IAGA,OAAOJ,iBAAP;EACD;;EAEDK,yBAAyB,GAAqC;IAC5D,MAAMC,UAAU,GAAG,KAAKC,mBAAL,EAAnB;IACA,MAAMC,mBAAmB,GAAG,KAAKT,SAAL,CAAehC,GAAf,CAAoBa,EAAD,IAAQA,EAAE,CAACX,sBAAH,EAA3B,CAA5B;IACA,MAAMwC,qBAAuD,GAAG,IAAIC,GAAJ,EAAhE;;IACA,KAAK,MAAM,CAACC,YAAD,EAAeC,QAAf,CAAX,IAAuCN,UAAvC,EAAmD;MACjD,IAAIM,QAAQ,CAACC,eAAT,CAAyBC,MAAzB,GAAkC,CAAtC,EAAyC;QACvC,MAAMC,gBAAmC,GAAG,EAA5C;QACA,MAAMC,iBAAiB,GAAGJ,QAAQ,CAACC,eAAT,CAAyBZ,MAAzB,CAAiCgB,OAAD,IAAaA,OAAO,KAAKL,QAAQ,CAACM,iBAAlE,CAA1B;QACAF,iBAAiB,CAAClC,OAAlB,CAA2BmC,OAAD,IAAa;UACrC,MAAME,YAAY,GAAG,KAAKC,oBAAL,CAA0BH,OAA1B,CAArB;UACA,MAAMI,qBAAqB,GAAG,KAAKF,YAAL,CAAkBF,OAAlB,EAA2BlD,GAA3B,CAAgCuD,WAAD,IAAiBA,WAAW,CAAC1C,EAA5D,CAA9B;UACA,MAAM2C,QAAQ,GAAG,KAAKC,mBAAL,CAAyBL,YAAzB,CAAjB;UACA,MAAMM,eAAgC,GAAG;YACvCC,SAAS,EAAET,OAD4B;YAEvCM,QAFuC;YAGvC;YACAI,mBAAmB,EAAEN;UAJkB,CAAzC;UAMAN,gBAAgB,CAAC3B,IAAjB,CAAsBqC,eAAtB;QACD,CAXD;QAYA,MAAMG,QAAQ,GAAGpB,mBAAmB,CAACxB,QAApB,CAA6B2B,YAA7B,CAAjB;QACA,MAAMkB,6BAA6B,GAAG,CAAC,KAAKhC,wBAAL,EAAD,IAAoC+B,QAA1E;;QACA,IAAIC,6BAA6B,IAAId,gBAAgB,CAACD,MAAjB,GAA0B,CAA/D,EAAkE;UAChE,MAAMgB,YAAY,GAAG,KAAIC,0CAAJ,EAAwBnB,QAAQ,CAACM,iBAAjC,EAAoDH,gBAApD,CAArB;UACAN,qBAAqB,CAACuB,GAAtB,CAA0BrB,YAA1B,EAAwCmB,YAAxC;QACD;MACF;IACF;;IACD,OAAOrB,qBAAP;EACD;;EAEDe,mBAAmB,CAAC7B,KAAD,EAAsD;IACvE,OAAO,KAAKpC,MAAL,CAAYoC,KAAK,CAACtC,KAAlB,EAAyBsC,KAAK,CAACrC,KAA/B,CAAP;EACD;;EAED2E,WAAW,CAACC,YAAD,EAAyB;IAClC,OAAO,KAAKC,kBAAL,CAAwBD,YAAxB,EAAsC;MAC3CE,UAAU,EAAGC,IAAD,IAA0BA,IAAI,CAAC7C,IAAL,CAAU8C,IAAV,KAAmB;IADd,CAAtC,CAAP;EAGD;;EAEOzC,wBAAwB,GAAG;IACjC,OAAO,KAAKE,SAAL,CAAee,MAAtB;EACD;;EAEOP,mBAAmB,GAA0E;IACnG,MAAMD,UAAiF,GAAG,IAAII,GAAJ,EAA1F;;IACA,KAAK,MAAM6B,IAAX,IAAmB,KAAKlF,KAAxB,EAA+B;MAC7B,MAAMmF,IAAI,GAAGD,IAAI,CAAC/C,IAAlB;MACA,MAAMiD,OAAO,GAAGF,IAAI,CAAC3D,EAArB;;MACA,MAAM+B,YAAY,GAAG6B,IAAI,CAAC5D,EAAL,CAAQ8D,OAAR,CAAgBzE,sBAAhB,EAArB;;MACA,IAAI,CAACqC,UAAU,CAACqC,GAAX,CAAehC,YAAf,CAAL,EAAmC;QACjCL,UAAU,CAAC0B,GAAX,CAAerB,YAAf,EAA6B;UAC3BE,eAAe,EAAE,CAAC4B,OAAD,CADU;UAE3BvB,iBAAiB,EAAEuB;QAFQ,CAA7B;MAID,CALD,MAKO;QACL,MAAMG,KAAK,GAAGtC,UAAU,CAACuC,GAAX,CAAelC,YAAf,CAAd;;QACA,IAAIiC,KAAJ,EAAW;UAAA;;UACT,IAAIE,MAAM,CAACC,SAAP,CAAiBC,cAAjB,CAAgCC,IAAhC,CAAqCL,KAArC,EAA4C,iBAA5C,CAAJ,EAAoE;YAClEA,KAAK,CAAC/B,eAAN,CAAsBzB,IAAtB,CAA2BqD,OAA3B;UACD;;UACD,MAAMS,WAAW,GAAGV,IAApB;UACA,MAAMW,UAAU,iBAAG,KAAKZ,IAAL,CAAUK,KAAK,CAAC1B,iBAAhB,CAAH,+CAAG,WAAoC1B,IAAvD,CALS,CAMT;UACA;UACA;UACA;UACA;;UACA,IACE0D,WAAW,CAACE,IAAZ,IACAD,UADA,aACAA,UADA,eACAA,UAAU,CAAEC,IADZ,IAEA,IAAIC,IAAJ,CAASH,WAAW,CAACE,IAAZ,CAAiBE,SAA1B,IAAuC,IAAID,IAAJ,CAASF,UAAU,CAACC,IAAX,CAAgBE,SAAzB,CAHzC,EAIE;YACAV,KAAK,CAAC1B,iBAAN,GAA0BuB,OAA1B;UACD;QACF;MACF;IACF;;IACD,OAAOnC,UAAP;EACD;;AApI8D"}
+{"version":3,"names":["DEPENDENCIES_TYPES","ComponentGraph","Graph","constructor","nodes","edges","create","findIdsFromSourcesToTargets","sources","targets","removeVerFromIdStr","idStr","split","sourcesStr","map","s","toStringWithoutVersion","targetsStr","t","allFlattened","source","successors","toString","flat","allFlattenedIds","uniq","f","id","results","forEach","idWithNoVer","includes","allSuccessors","allSuccessorsWithNoVersion","find","push","components","getNodes","n","attr","c","findCycles","graph","cycles","shouldLimitToSeedersOnly","seederIdsStr","seederIds","cyclesWithSeeders","filter","cycle","some","cycleIdStr","findDuplicateDependencies","versionMap","calculateVersionMap","seederIdsNoVersions","duplicateDependencies","Map","compFullName","versions","allVersionNodes","length","versionSubgraphs","notLatestVersions","version","latestVersionNode","predecessors","predecessorsSubgraph","immediatePredecessors","predecessor","subGraph","buildFromCleargraph","versionSubgraph","versionId","immediateDependents","isSeeder","shouldDisplayDueToBeingSeeder","duplicateDep","DuplicateDependency","set","runtimeOnly","componentIds","successorsSubgraph","edgeFilter","edge","type","node","comp","compKey","_legacy","has","value","get","Object","prototype","hasOwnProperty","call","currentComp","latestComp","head","Date","timestamp"],"sources":["component-graph.ts"],"sourcesContent":["import { Component, ComponentID } from '@teambit/component';\nimport { Graph, Node, Edge } from '@teambit/graph.cleargraph';\nimport { uniq } from 'lodash';\n\nimport { Dependency } from '../model/dependency';\nimport { DuplicateDependency, VersionSubgraph } from '../duplicate-dependency';\n\nexport const DEPENDENCIES_TYPES = ['dependencies', 'devDependencies'];\n\ntype ComponentNode = Node<Component>;\ntype DependencyEdge = Edge<Dependency>;\n\nexport class ComponentGraph extends Graph<Component, Dependency> {\n  seederIds: ComponentID[] = []; // component IDs that started the graph. (if from workspace, the .bitmap ids normally)\n  constructor(nodes: ComponentNode[] = [], edges: DependencyEdge[] = []) {\n    super(nodes, edges);\n  }\n\n  protected create(nodes: ComponentNode[] = [], edges: DependencyEdge[] = []): this {\n    return new ComponentGraph(nodes, edges) as this;\n  }\n\n  /**\n   * check all the routes from the sources to targets and return the components found during this traversal.\n   * e.g.\n   * A -> B -> C -> N.\n   * A -> E -> N.\n   * B -> F -> G.\n   * given source: A, targets: N. The results will be: B, C, E\n   */\n  findIdsFromSourcesToTargets(sources: ComponentID[], targets: ComponentID[]): ComponentID[] {\n    const removeVerFromIdStr = (idStr: string) => idStr.split('@')[0];\n    const sourcesStr = sources.map((s) => s.toStringWithoutVersion());\n    const targetsStr = targets.map((t) => t.toStringWithoutVersion());\n    const allFlattened = sources.map((source) => this.successors(source.toString())).flat();\n    const allFlattenedIds = uniq(allFlattened.map((f) => f.id));\n    const results: string[] = [];\n    allFlattenedIds.forEach((id) => {\n      const idWithNoVer = removeVerFromIdStr(id);\n      if (sourcesStr.includes(idWithNoVer) || targetsStr.includes(idWithNoVer)) return;\n      const allSuccessors = this.successors(id);\n      const allSuccessorsWithNoVersion = allSuccessors.map((s) => removeVerFromIdStr(s.id));\n      if (allSuccessorsWithNoVersion.find((s) => targetsStr.includes(s))) results.push(id);\n    });\n    const components = this.getNodes(results).map((n) => n.attr);\n\n    return components.map((c) => c.id);\n  }\n\n  /**\n   * overrides the super class to eliminate non-seeders components\n   */\n  findCycles(graph?: this): string[][] {\n    const cycles = super.findCycles(graph);\n    if (!this.shouldLimitToSeedersOnly()) {\n      return cycles;\n    }\n    const seederIdsStr = this.seederIds.map((id) => id.toString());\n    const cyclesWithSeeders = cycles.filter((cycle) => {\n      return cycle.some((cycleIdStr) => seederIdsStr.includes(cycleIdStr));\n    });\n    return cyclesWithSeeders;\n  }\n\n  findDuplicateDependencies(): Map<string, DuplicateDependency> {\n    const versionMap = this.calculateVersionMap();\n    const seederIdsNoVersions = this.seederIds.map((id) => id.toStringWithoutVersion());\n    const duplicateDependencies: Map<string, DuplicateDependency> = new Map();\n    for (const [compFullName, versions] of versionMap) {\n      if (versions.allVersionNodes.length > 1) {\n        const versionSubgraphs: VersionSubgraph[] = [];\n        const notLatestVersions = versions.allVersionNodes.filter((version) => version !== versions.latestVersionNode);\n        notLatestVersions.forEach((version) => {\n          const predecessors = this.predecessorsSubgraph(version);\n          const immediatePredecessors = this.predecessors(version).map((predecessor) => predecessor.id);\n          const subGraph = this.buildFromCleargraph(predecessors);\n          const versionSubgraph: VersionSubgraph = {\n            versionId: version,\n            subGraph,\n            // TODO: validate that this is working correctly\n            immediateDependents: immediatePredecessors,\n          };\n          versionSubgraphs.push(versionSubgraph);\n        });\n        const isSeeder = seederIdsNoVersions.includes(compFullName);\n        const shouldDisplayDueToBeingSeeder = !this.shouldLimitToSeedersOnly() || isSeeder;\n        if (shouldDisplayDueToBeingSeeder && versionSubgraphs.length > 0) {\n          const duplicateDep = new DuplicateDependency(versions.latestVersionNode, versionSubgraphs);\n          duplicateDependencies.set(compFullName, duplicateDep);\n        }\n      }\n    }\n    return duplicateDependencies;\n  }\n\n  buildFromCleargraph(graph: Graph<Component, Dependency>): ComponentGraph {\n    return this.create(graph.nodes, graph.edges);\n  }\n\n  runtimeOnly(componentIds: string[]) {\n    return this.successorsSubgraph(componentIds, {\n      edgeFilter: (edge: DependencyEdge) => edge.attr.type === 'runtime',\n    });\n  }\n\n  private shouldLimitToSeedersOnly() {\n    return this.seederIds.length;\n  }\n\n  private calculateVersionMap(): Map<string, { allVersionNodes: string[]; latestVersionNode: string }> {\n    const versionMap: Map<string, { allVersionNodes: string[]; latestVersionNode: string }> = new Map();\n    for (const node of this.nodes) {\n      const comp = node.attr;\n      const compKey = node.id;\n      const compFullName = comp.id._legacy.toStringWithoutVersion();\n      if (!versionMap.has(compFullName)) {\n        versionMap.set(compFullName, {\n          allVersionNodes: [compKey],\n          latestVersionNode: compKey,\n        });\n      } else {\n        const value = versionMap.get(compFullName);\n        if (value) {\n          if (Object.prototype.hasOwnProperty.call(value, 'allVersionNodes')) {\n            value.allVersionNodes.push(compKey);\n          }\n          const currentComp = comp;\n          const latestComp = this.node(value.latestVersionNode)?.attr;\n          // @todo: this check won't work when the component doesn't have head.\n          // it happens when a dependency is needed in an old version (not head). which Bit doesn't fetch the head\n          // Version object, and as a result, the `Component.head` is empty.\n          // for now it's probably good enough because it's used only for `findDuplicateDependencies`, which only\n          // checks the components on the workspace.\n          if (\n            currentComp.head &&\n            latestComp?.head &&\n            new Date(currentComp.head.timestamp) > new Date(latestComp.head.timestamp)\n          ) {\n            value.latestVersionNode = compKey;\n          }\n        }\n      }\n    }\n    return versionMap;\n  }\n}\n"],"mappings":";;;;;;;;;;;;;;;;;;AACA;EAAA;EAAA;IAAA;EAAA;EAAA;AAAA;AACA;EAAA;EAAA;IAAA;EAAA;EAAA;AAAA;AAGA;EAAA;EAAA;IAAA;EAAA;EAAA;AAAA;AAEO,MAAMA,kBAAkB,GAAG,CAAC,cAAc,EAAE,iBAAiB,CAAC;AAAC;AAK/D,MAAMC,cAAc,SAASC,cAAK,CAAwB;EAChC;EAC/BC,WAAW,CAACC,KAAsB,GAAG,EAAE,EAAEC,KAAuB,GAAG,EAAE,EAAE;IACrE,KAAK,CAACD,KAAK,EAAEC,KAAK,CAAC;IAAC,mDAFK,EAAE;EAG7B;EAEUC,MAAM,CAACF,KAAsB,GAAG,EAAE,EAAEC,KAAuB,GAAG,EAAE,EAAQ;IAChF,OAAO,IAAIJ,cAAc,CAACG,KAAK,EAAEC,KAAK,CAAC;EACzC;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;EACEE,2BAA2B,CAACC,OAAsB,EAAEC,OAAsB,EAAiB;IACzF,MAAMC,kBAAkB,GAAIC,KAAa,IAAKA,KAAK,CAACC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjE,MAAMC,UAAU,GAAGL,OAAO,CAACM,GAAG,CAAEC,CAAC,IAAKA,CAAC,CAACC,sBAAsB,EAAE,CAAC;IACjE,MAAMC,UAAU,GAAGR,OAAO,CAACK,GAAG,CAAEI,CAAC,IAAKA,CAAC,CAACF,sBAAsB,EAAE,CAAC;IACjE,MAAMG,YAAY,GAAGX,OAAO,CAACM,GAAG,CAAEM,MAAM,IAAK,IAAI,CAACC,UAAU,CAACD,MAAM,CAACE,QAAQ,EAAE,CAAC,CAAC,CAACC,IAAI,EAAE;IACvF,MAAMC,eAAe,GAAG,IAAAC,cAAI,EAACN,YAAY,CAACL,GAAG,CAAEY,CAAC,IAAKA,CAAC,CAACC,EAAE,CAAC,CAAC;IAC3D,MAAMC,OAAiB,GAAG,EAAE;IAC5BJ,eAAe,CAACK,OAAO,CAAEF,EAAE,IAAK;MAC9B,MAAMG,WAAW,GAAGpB,kBAAkB,CAACiB,EAAE,CAAC;MAC1C,IAAId,UAAU,CAACkB,QAAQ,CAACD,WAAW,CAAC,IAAIb,UAAU,CAACc,QAAQ,CAACD,WAAW,CAAC,EAAE;MAC1E,MAAME,aAAa,GAAG,IAAI,CAACX,UAAU,CAACM,EAAE,CAAC;MACzC,MAAMM,0BAA0B,GAAGD,aAAa,CAAClB,GAAG,CAAEC,CAAC,IAAKL,kBAAkB,CAACK,CAAC,CAACY,EAAE,CAAC,CAAC;MACrF,IAAIM,0BAA0B,CAACC,IAAI,CAAEnB,CAAC,IAAKE,UAAU,CAACc,QAAQ,CAAChB,CAAC,CAAC,CAAC,EAAEa,OAAO,CAACO,IAAI,CAACR,EAAE,CAAC;IACtF,CAAC,CAAC;IACF,MAAMS,UAAU,GAAG,IAAI,CAACC,QAAQ,CAACT,OAAO,CAAC,CAACd,GAAG,CAAEwB,CAAC,IAAKA,CAAC,CAACC,IAAI,CAAC;IAE5D,OAAOH,UAAU,CAACtB,GAAG,CAAE0B,CAAC,IAAKA,CAAC,CAACb,EAAE,CAAC;EACpC;;EAEA;AACF;AACA;EACEc,UAAU,CAACC,KAAY,EAAc;IACnC,MAAMC,MAAM,GAAG,KAAK,CAACF,UAAU,CAACC,KAAK,CAAC;IACtC,IAAI,CAAC,IAAI,CAACE,wBAAwB,EAAE,EAAE;MACpC,OAAOD,MAAM;IACf;IACA,MAAME,YAAY,GAAG,IAAI,CAACC,SAAS,CAAChC,GAAG,CAAEa,EAAE,IAAKA,EAAE,CAACL,QAAQ,EAAE,CAAC;IAC9D,MAAMyB,iBAAiB,GAAGJ,MAAM,CAACK,MAAM,CAAEC,KAAK,IAAK;MACjD,OAAOA,KAAK,CAACC,IAAI,CAAEC,UAAU,IAAKN,YAAY,CAACd,QAAQ,CAACoB,UAAU,CAAC,CAAC;IACtE,CAAC,CAAC;IACF,OAAOJ,iBAAiB;EAC1B;EAEAK,yBAAyB,GAAqC;IAC5D,MAAMC,UAAU,GAAG,IAAI,CAACC,mBAAmB,EAAE;IAC7C,MAAMC,mBAAmB,GAAG,IAAI,CAACT,SAAS,CAAChC,GAAG,CAAEa,EAAE,IAAKA,EAAE,CAACX,sBAAsB,EAAE,CAAC;IACnF,MAAMwC,qBAAuD,GAAG,IAAIC,GAAG,EAAE;IACzE,KAAK,MAAM,CAACC,YAAY,EAAEC,QAAQ,CAAC,IAAIN,UAAU,EAAE;MACjD,IAAIM,QAAQ,CAACC,eAAe,CAACC,MAAM,GAAG,CAAC,EAAE;QACvC,MAAMC,gBAAmC,GAAG,EAAE;QAC9C,MAAMC,iBAAiB,GAAGJ,QAAQ,CAACC,eAAe,CAACZ,MAAM,CAAEgB,OAAO,IAAKA,OAAO,KAAKL,QAAQ,CAACM,iBAAiB,CAAC;QAC9GF,iBAAiB,CAAClC,OAAO,CAAEmC,OAAO,IAAK;UACrC,MAAME,YAAY,GAAG,IAAI,CAACC,oBAAoB,CAACH,OAAO,CAAC;UACvD,MAAMI,qBAAqB,GAAG,IAAI,CAACF,YAAY,CAACF,OAAO,CAAC,CAAClD,GAAG,CAAEuD,WAAW,IAAKA,WAAW,CAAC1C,EAAE,CAAC;UAC7F,MAAM2C,QAAQ,GAAG,IAAI,CAACC,mBAAmB,CAACL,YAAY,CAAC;UACvD,MAAMM,eAAgC,GAAG;YACvCC,SAAS,EAAET,OAAO;YAClBM,QAAQ;YACR;YACAI,mBAAmB,EAAEN;UACvB,CAAC;UACDN,gBAAgB,CAAC3B,IAAI,CAACqC,eAAe,CAAC;QACxC,CAAC,CAAC;QACF,MAAMG,QAAQ,GAAGpB,mBAAmB,CAACxB,QAAQ,CAAC2B,YAAY,CAAC;QAC3D,MAAMkB,6BAA6B,GAAG,CAAC,IAAI,CAAChC,wBAAwB,EAAE,IAAI+B,QAAQ;QAClF,IAAIC,6BAA6B,IAAId,gBAAgB,CAACD,MAAM,GAAG,CAAC,EAAE;UAChE,MAAMgB,YAAY,GAAG,KAAIC,0CAAmB,EAACnB,QAAQ,CAACM,iBAAiB,EAAEH,gBAAgB,CAAC;UAC1FN,qBAAqB,CAACuB,GAAG,CAACrB,YAAY,EAAEmB,YAAY,CAAC;QACvD;MACF;IACF;IACA,OAAOrB,qBAAqB;EAC9B;EAEAe,mBAAmB,CAAC7B,KAAmC,EAAkB;IACvE,OAAO,IAAI,CAACpC,MAAM,CAACoC,KAAK,CAACtC,KAAK,EAAEsC,KAAK,CAACrC,KAAK,CAAC;EAC9C;EAEA2E,WAAW,CAACC,YAAsB,EAAE;IAClC,OAAO,IAAI,CAACC,kBAAkB,CAACD,YAAY,EAAE;MAC3CE,UAAU,EAAGC,IAAoB,IAAKA,IAAI,CAAC7C,IAAI,CAAC8C,IAAI,KAAK;IAC3D,CAAC,CAAC;EACJ;EAEQzC,wBAAwB,GAAG;IACjC,OAAO,IAAI,CAACE,SAAS,CAACe,MAAM;EAC9B;EAEQP,mBAAmB,GAA0E;IACnG,MAAMD,UAAiF,GAAG,IAAII,GAAG,EAAE;IACnG,KAAK,MAAM6B,IAAI,IAAI,IAAI,CAAClF,KAAK,EAAE;MAC7B,MAAMmF,IAAI,GAAGD,IAAI,CAAC/C,IAAI;MACtB,MAAMiD,OAAO,GAAGF,IAAI,CAAC3D,EAAE;MACvB,MAAM+B,YAAY,GAAG6B,IAAI,CAAC5D,EAAE,CAAC8D,OAAO,CAACzE,sBAAsB,EAAE;MAC7D,IAAI,CAACqC,UAAU,CAACqC,GAAG,CAAChC,YAAY,CAAC,EAAE;QACjCL,UAAU,CAAC0B,GAAG,CAACrB,YAAY,EAAE;UAC3BE,eAAe,EAAE,CAAC4B,OAAO,CAAC;UAC1BvB,iBAAiB,EAAEuB;QACrB,CAAC,CAAC;MACJ,CAAC,MAAM;QACL,MAAMG,KAAK,GAAGtC,UAAU,CAACuC,GAAG,CAAClC,YAAY,CAAC;QAC1C,IAAIiC,KAAK,EAAE;UAAA;UACT,IAAIE,MAAM,CAACC,SAAS,CAACC,cAAc,CAACC,IAAI,CAACL,KAAK,EAAE,iBAAiB,CAAC,EAAE;YAClEA,KAAK,CAAC/B,eAAe,CAACzB,IAAI,CAACqD,OAAO,CAAC;UACrC;UACA,MAAMS,WAAW,GAAGV,IAAI;UACxB,MAAMW,UAAU,iBAAG,IAAI,CAACZ,IAAI,CAACK,KAAK,CAAC1B,iBAAiB,CAAC,+CAAlC,WAAoC1B,IAAI;UAC3D;UACA;UACA;UACA;UACA;UACA,IACE0D,WAAW,CAACE,IAAI,IAChBD,UAAU,aAAVA,UAAU,eAAVA,UAAU,CAAEC,IAAI,IAChB,IAAIC,IAAI,CAACH,WAAW,CAACE,IAAI,CAACE,SAAS,CAAC,GAAG,IAAID,IAAI,CAACF,UAAU,CAACC,IAAI,CAACE,SAAS,CAAC,EAC1E;YACAV,KAAK,CAAC1B,iBAAiB,GAAGuB,OAAO;UACnC;QACF;MACF;IACF;IACA,OAAOnC,UAAU;EACnB;AACF;AAAC"}

package/dist/component-graph/index.js

@@ -9,14 +9,11 @@ Object.defineProperty(exports, "ComponentGraph", {
     return _componentGraph().ComponentGraph;
   }
 });
-
 function _componentGraph() {
   const data = require("./component-graph");
-
   _componentGraph = function () {
     return data;
   };
-
   return data;
 }
 

package/dist/component-graph/index.js.map

@@ -1 +1 @@
-{"version":3,"names":[],"sources":["index.ts"],"sourcesContent":["// eslint-disable-next-line import/no-cycle\nexport { ComponentGraph } from './component-graph';\n"],"mappings":";;;;;;;;;;;;AACA;EAAA;;EAAA;IAAA;EAAA;;EAAA;AAAA"}
+{"version":3,"names":[],"sources":["index.ts"],"sourcesContent":["// eslint-disable-next-line import/no-cycle\nexport { ComponentGraph } from './component-graph';\n"],"mappings":";;;;;;;;;;;AACA;EAAA;EAAA;IAAA;EAAA;EAAA;AAAA"}

package/dist/duplicate-dependency.js

@@ -1,23 +1,19 @@
 "use strict";
 
 var _interopRequireDefault = require("@babel/runtime/helpers/interopRequireDefault");
-
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.DuplicateDependency = void 0;
-
 function _defineProperty2() {
   const data = _interopRequireDefault(require("@babel/runtime/helpers/defineProperty"));
-
   _defineProperty2 = function () {
     return data;
   };
-
   return data;
 }
-
 // eslint-disable-next-line import/no-cycle
+
 class DuplicateDependency {
   constructor(latestVersionId, priorVersions) {
     (0, _defineProperty2().default)(this, "latestVersionId", void 0);
@@ -25,9 +21,7 @@ class DuplicateDependency {
     this.latestVersionId = latestVersionId;
     this.priorVersions = priorVersions;
   }
-
 }
-
 exports.DuplicateDependency = DuplicateDependency;
 
 //# sourceMappingURL=duplicate-dependency.js.map

package/dist/duplicate-dependency.js.map

@@ -1 +1 @@
-{"version":3,"names":["DuplicateDependency","constructor","latestVersionId","priorVersions"],"sources":["duplicate-dependency.ts"],"sourcesContent":["// eslint-disable-next-line import/no-cycle\nimport type { ComponentGraph } from './component-graph';\n\nexport class DuplicateDependency {\n  latestVersionId: string;\n  priorVersions: VersionSubgraph[];\n\n  constructor(latestVersionId: string, priorVersions: VersionSubgraph[]) {\n    this.latestVersionId = latestVersionId;\n    this.priorVersions = priorVersions;\n  }\n}\n\nexport type VersionSubgraph = {\n  versionId: string;\n  subGraph: ComponentGraph;\n  immediateDependents: string[];\n};\n"],"mappings":";;;;;;;;;;;;;;;;;;;AAAA;AAGO,MAAMA,mBAAN,CAA0B;EAI/BC,WAAW,CAACC,eAAD,EAA0BC,aAA1B,EAA4D;IAAA;IAAA;IACrE,KAAKD,eAAL,GAAuBA,eAAvB;IACA,KAAKC,aAAL,GAAqBA,aAArB;EACD;;AAP8B"}
+{"version":3,"names":["DuplicateDependency","constructor","latestVersionId","priorVersions"],"sources":["duplicate-dependency.ts"],"sourcesContent":["// eslint-disable-next-line import/no-cycle\nimport type { ComponentGraph } from './component-graph';\n\nexport class DuplicateDependency {\n  latestVersionId: string;\n  priorVersions: VersionSubgraph[];\n\n  constructor(latestVersionId: string, priorVersions: VersionSubgraph[]) {\n    this.latestVersionId = latestVersionId;\n    this.priorVersions = priorVersions;\n  }\n}\n\nexport type VersionSubgraph = {\n  versionId: string;\n  subGraph: ComponentGraph;\n  immediateDependents: string[];\n};\n"],"mappings":";;;;;;;;;;;;;;AAAA;;AAGO,MAAMA,mBAAmB,CAAC;EAI/BC,WAAW,CAACC,eAAuB,EAAEC,aAAgC,EAAE;IAAA;IAAA;IACrE,IAAI,CAACD,eAAe,GAAGA,eAAe;IACtC,IAAI,CAACC,aAAa,GAAGA,aAAa;EACpC;AACF;AAAC"}

package/dist/edge-type.js

@@ -6,7 +6,6 @@ Object.defineProperty(exports, "__esModule", {
 exports.EdgeType = void 0;
 let EdgeType;
 exports.EdgeType = EdgeType;
-
 (function (EdgeType) {
   EdgeType["dev"] = "DEV";
   EdgeType["runtime"] = "RUNTIME";

package/dist/edge-type.js.map

@@ -1 +1 @@
-{"version":3,"names":["EdgeType"],"sources":["edge-type.ts"],"sourcesContent":["export enum EdgeType {\n  dev = 'DEV',\n  runtime = 'RUNTIME',\n  peer = 'PEER',\n}\n"],"mappings":";;;;;;IAAYA,Q;;;WAAAA,Q;EAAAA,Q;EAAAA,Q;EAAAA,Q;GAAAA,Q,wBAAAA,Q"}
+{"version":3,"names":["EdgeType"],"sources":["edge-type.ts"],"sourcesContent":["export enum EdgeType {\n  dev = 'DEV',\n  runtime = 'RUNTIME',\n  peer = 'PEER',\n}\n"],"mappings":";;;;;;IAAYA,QAAQ;AAAA;AAAA,WAARA,QAAQ;EAARA,QAAQ;EAARA,QAAQ;EAARA,QAAQ;AAAA,GAARA,QAAQ,wBAARA,QAAQ"}

package/dist/graph-builder.js

@@ -1,49 +1,36 @@
 "use strict";
 
 require("core-js/modules/es.array.iterator.js");
-
 require("core-js/modules/es.promise.js");
-
 Object.defineProperty(exports, "__esModule", {
   value: true
 });
 exports.GraphBuilder = void 0;
-
 function _graph() {
   const data = require("@teambit/graph.cleargraph");
-
   _graph = function () {
     return data;
   };
-
   return data;
 }
-
 function _componentGraph() {
   const data = require("./component-graph");
-
   _componentGraph = function () {
     return data;
   };
-
   return data;
 }
-
 function _dependency() {
   const data = require("./model/dependency");
-
   _dependency = function () {
     return data;
   };
-
   return data;
 }
-
 class GraphBuilder {
   constructor(componentAspect) {
     this.componentAspect = componentAspect;
   }
-
   async getGraph(ids, opts = {}) {
     const componentHost = opts.host || this.componentAspect.getHost();
     const legacyGraph = await componentHost.getLegacyGraph(ids, false);
@@ -53,14 +40,12 @@ class GraphBuilder {
     graph.seederIds = ids || (await componentHost.listIds());
     return graph;
   }
-
   async buildFromLegacy(legacyGraph, opts = {}) {
     const newGraph = new (_componentGraph().ComponentGraph)();
     const componentHost = opts.host || this.componentAspect.getHost();
     const setNodeP = legacyGraph.nodes().map(async nodeId => {
       const componentId = await componentHost.resolveComponentId(nodeId);
       const component = await componentHost.get(componentId);
-
       if (component) {
         newGraph.setNode(new (_graph().Node)(componentId.toString(), component));
       }
@@ -75,9 +60,7 @@ class GraphBuilder {
     await Promise.all(setEdgePromise);
     return newGraph;
   }
-
 }
-
 exports.GraphBuilder = GraphBuilder;
 
 //# sourceMappingURL=graph-builder.js.map

package/dist/graph-builder.js.map

@@ -1 +1 @@
-{"version":3,"names":["GraphBuilder","constructor","componentAspect","getGraph","ids","opts","componentHost","host","getHost","legacyGraph","getLegacyGraph","graph","buildFromLegacy","seederIds","listIds","newGraph","ComponentGraph","setNodeP","nodes","map","nodeId","componentId","resolveComponentId","component","get","setNode","Node","toString","Promise","all","setEdgePromise","edges","edgeId","source","v","target","w","edgeObj","edge","Dependency","setEdge","Edge"],"sources":["graph-builder.ts"],"sourcesContent":["import { ComponentFactory, ComponentID, ComponentMain } from '@teambit/component';\nimport { Node, Edge } from '@teambit/graph.cleargraph';\nimport type LegacyGraph from '@teambit/legacy/dist/scope/graph/graph';\nimport { ComponentGraph } from './component-graph';\nimport { Dependency } from './model/dependency';\n\nexport type GetGraphOpts = {\n  host?: ComponentFactory;\n};\n\ntype BuildFromLegacyGraphOpts = {\n  host?: ComponentFactory;\n};\n\nexport class GraphBuilder {\n  constructor(private componentAspect: ComponentMain) {}\n\n  async getGraph(ids?: ComponentID[], opts: GetGraphOpts = {}): Promise<ComponentGraph> {\n    const componentHost = opts.host || this.componentAspect.getHost();\n\n    const legacyGraph = await componentHost.getLegacyGraph(ids, false);\n    const graph = await this.buildFromLegacy(legacyGraph, { host: opts.host });\n    graph.seederIds = ids || (await componentHost.listIds());\n    return graph;\n  }\n\n  private async buildFromLegacy(\n    legacyGraph: LegacyGraph,\n    opts: BuildFromLegacyGraphOpts = {}\n  ): Promise<ComponentGraph> {\n    const newGraph = new ComponentGraph();\n    const componentHost = opts.host || this.componentAspect.getHost();\n\n    const setNodeP = legacyGraph.nodes().map(async (nodeId) => {\n      const componentId = await componentHost.resolveComponentId(nodeId);\n      const component = await componentHost.get(componentId);\n      if (component) {\n        newGraph.setNode(new Node(componentId.toString(), component));\n      }\n    });\n    await Promise.all(setNodeP);\n\n    const setEdgePromise = legacyGraph.edges().map(async (edgeId) => {\n      const source = await componentHost.resolveComponentId(edgeId.v);\n      const target = await componentHost.resolveComponentId(edgeId.w);\n      const edgeObj =\n        legacyGraph.edge(edgeId.v, edgeId.w) === 'dependencies' ? new Dependency('runtime') : new Dependency('dev');\n      newGraph.setEdge(new Edge(source.toString(), target.toString(), edgeObj));\n    });\n    await Promise.all(setEdgePromise);\n\n    return newGraph;\n  }\n}\n"],"mappings":";;;;;;;;;;;AACA;EAAA;;EAAA;IAAA;EAAA;;EAAA;AAAA;;AAEA;EAAA;;EAAA;IAAA;EAAA;;EAAA;AAAA;;AACA;EAAA;;EAAA;IAAA;EAAA;;EAAA;AAAA;;AAUO,MAAMA,YAAN,CAAmB;EACxBC,WAAW,CAASC,eAAT,EAAyC;IAAA,KAAhCA,eAAgC,GAAhCA,eAAgC;EAAE;;EAExC,MAARC,QAAQ,CAACC,GAAD,EAAsBC,IAAkB,GAAG,EAA3C,EAAwE;IACpF,MAAMC,aAAa,GAAGD,IAAI,CAACE,IAAL,IAAa,KAAKL,eAAL,CAAqBM,OAArB,EAAnC;IAEA,MAAMC,WAAW,GAAG,MAAMH,aAAa,CAACI,cAAd,CAA6BN,GAA7B,EAAkC,KAAlC,CAA1B;IACA,MAAMO,KAAK,GAAG,MAAM,KAAKC,eAAL,CAAqBH,WAArB,EAAkC;MAAEF,IAAI,EAAEF,IAAI,CAACE;IAAb,CAAlC,CAApB;IACAI,KAAK,CAACE,SAAN,GAAkBT,GAAG,KAAK,MAAME,aAAa,CAACQ,OAAd,EAAX,CAArB;IACA,OAAOH,KAAP;EACD;;EAE4B,MAAfC,eAAe,CAC3BH,WAD2B,EAE3BJ,IAA8B,GAAG,EAFN,EAGF;IACzB,MAAMU,QAAQ,GAAG,KAAIC,gCAAJ,GAAjB;IACA,MAAMV,aAAa,GAAGD,IAAI,CAACE,IAAL,IAAa,KAAKL,eAAL,CAAqBM,OAArB,EAAnC;IAEA,MAAMS,QAAQ,GAAGR,WAAW,CAACS,KAAZ,GAAoBC,GAApB,CAAwB,MAAOC,MAAP,IAAkB;MACzD,MAAMC,WAAW,GAAG,MAAMf,aAAa,CAACgB,kBAAd,CAAiCF,MAAjC,CAA1B;MACA,MAAMG,SAAS,GAAG,MAAMjB,aAAa,CAACkB,GAAd,CAAkBH,WAAlB,CAAxB;;MACA,IAAIE,SAAJ,EAAe;QACbR,QAAQ,CAACU,OAAT,CAAiB,KAAIC,aAAJ,EAASL,WAAW,CAACM,QAAZ,EAAT,EAAiCJ,SAAjC,CAAjB;MACD;IACF,CANgB,CAAjB;IAOA,MAAMK,OAAO,CAACC,GAAR,CAAYZ,QAAZ,CAAN;IAEA,MAAMa,cAAc,GAAGrB,WAAW,CAACsB,KAAZ,GAAoBZ,GAApB,CAAwB,MAAOa,MAAP,IAAkB;MAC/D,MAAMC,MAAM,GAAG,MAAM3B,aAAa,CAACgB,kBAAd,CAAiCU,MAAM,CAACE,CAAxC,CAArB;MACA,MAAMC,MAAM,GAAG,MAAM7B,aAAa,CAACgB,kBAAd,CAAiCU,MAAM,CAACI,CAAxC,CAArB;MACA,MAAMC,OAAO,GACX5B,WAAW,CAAC6B,IAAZ,CAAiBN,MAAM,CAACE,CAAxB,EAA2BF,MAAM,CAACI,CAAlC,MAAyC,cAAzC,GAA0D,KAAIG,wBAAJ,EAAe,SAAf,CAA1D,GAAsF,KAAIA,wBAAJ,EAAe,KAAf,CADxF;MAEAxB,QAAQ,CAACyB,OAAT,CAAiB,KAAIC,aAAJ,EAASR,MAAM,CAACN,QAAP,EAAT,EAA4BQ,MAAM,CAACR,QAAP,EAA5B,EAA+CU,OAA/C,CAAjB;IACD,CANsB,CAAvB;IAOA,MAAMT,OAAO,CAACC,GAAR,CAAYC,cAAZ,CAAN;IAEA,OAAOf,QAAP;EACD;;AAtCuB"}
+{"version":3,"names":["GraphBuilder","constructor","componentAspect","getGraph","ids","opts","componentHost","host","getHost","legacyGraph","getLegacyGraph","graph","buildFromLegacy","seederIds","listIds","newGraph","ComponentGraph","setNodeP","nodes","map","nodeId","componentId","resolveComponentId","component","get","setNode","Node","toString","Promise","all","setEdgePromise","edges","edgeId","source","v","target","w","edgeObj","edge","Dependency","setEdge","Edge"],"sources":["graph-builder.ts"],"sourcesContent":["import { ComponentFactory, ComponentID, ComponentMain } from '@teambit/component';\nimport { Node, Edge } from '@teambit/graph.cleargraph';\nimport type LegacyGraph from '@teambit/legacy/dist/scope/graph/graph';\nimport { ComponentGraph } from './component-graph';\nimport { Dependency } from './model/dependency';\n\nexport type GetGraphOpts = {\n  host?: ComponentFactory;\n};\n\ntype BuildFromLegacyGraphOpts = {\n  host?: ComponentFactory;\n};\n\nexport class GraphBuilder {\n  constructor(private componentAspect: ComponentMain) {}\n\n  async getGraph(ids?: ComponentID[], opts: GetGraphOpts = {}): Promise<ComponentGraph> {\n    const componentHost = opts.host || this.componentAspect.getHost();\n\n    const legacyGraph = await componentHost.getLegacyGraph(ids, false);\n    const graph = await this.buildFromLegacy(legacyGraph, { host: opts.host });\n    graph.seederIds = ids || (await componentHost.listIds());\n    return graph;\n  }\n\n  private async buildFromLegacy(\n    legacyGraph: LegacyGraph,\n    opts: BuildFromLegacyGraphOpts = {}\n  ): Promise<ComponentGraph> {\n    const newGraph = new ComponentGraph();\n    const componentHost = opts.host || this.componentAspect.getHost();\n\n    const setNodeP = legacyGraph.nodes().map(async (nodeId) => {\n      const componentId = await componentHost.resolveComponentId(nodeId);\n      const component = await componentHost.get(componentId);\n      if (component) {\n        newGraph.setNode(new Node(componentId.toString(), component));\n      }\n    });\n    await Promise.all(setNodeP);\n\n    const setEdgePromise = legacyGraph.edges().map(async (edgeId) => {\n      const source = await componentHost.resolveComponentId(edgeId.v);\n      const target = await componentHost.resolveComponentId(edgeId.w);\n      const edgeObj =\n        legacyGraph.edge(edgeId.v, edgeId.w) === 'dependencies' ? new Dependency('runtime') : new Dependency('dev');\n      newGraph.setEdge(new Edge(source.toString(), target.toString(), edgeObj));\n    });\n    await Promise.all(setEdgePromise);\n\n    return newGraph;\n  }\n}\n"],"mappings":";;;;;;;;AACA;EAAA;EAAA;IAAA;EAAA;EAAA;AAAA;AAEA;EAAA;EAAA;IAAA;EAAA;EAAA;AAAA;AACA;EAAA;EAAA;IAAA;EAAA;EAAA;AAAA;AAUO,MAAMA,YAAY,CAAC;EACxBC,WAAW,CAASC,eAA8B,EAAE;IAAA,KAAhCA,eAA8B,GAA9BA,eAA8B;EAAG;EAErD,MAAMC,QAAQ,CAACC,GAAmB,EAAEC,IAAkB,GAAG,CAAC,CAAC,EAA2B;IACpF,MAAMC,aAAa,GAAGD,IAAI,CAACE,IAAI,IAAI,IAAI,CAACL,eAAe,CAACM,OAAO,EAAE;IAEjE,MAAMC,WAAW,GAAG,MAAMH,aAAa,CAACI,cAAc,CAACN,GAAG,EAAE,KAAK,CAAC;IAClE,MAAMO,KAAK,GAAG,MAAM,IAAI,CAACC,eAAe,CAACH,WAAW,EAAE;MAAEF,IAAI,EAAEF,IAAI,CAACE;IAAK,CAAC,CAAC;IAC1EI,KAAK,CAACE,SAAS,GAAGT,GAAG,KAAK,MAAME,aAAa,CAACQ,OAAO,EAAE,CAAC;IACxD,OAAOH,KAAK;EACd;EAEA,MAAcC,eAAe,CAC3BH,WAAwB,EACxBJ,IAA8B,GAAG,CAAC,CAAC,EACV;IACzB,MAAMU,QAAQ,GAAG,KAAIC,gCAAc,GAAE;IACrC,MAAMV,aAAa,GAAGD,IAAI,CAACE,IAAI,IAAI,IAAI,CAACL,eAAe,CAACM,OAAO,EAAE;IAEjE,MAAMS,QAAQ,GAAGR,WAAW,CAACS,KAAK,EAAE,CAACC,GAAG,CAAC,MAAOC,MAAM,IAAK;MACzD,MAAMC,WAAW,GAAG,MAAMf,aAAa,CAACgB,kBAAkB,CAACF,MAAM,CAAC;MAClE,MAAMG,SAAS,GAAG,MAAMjB,aAAa,CAACkB,GAAG,CAACH,WAAW,CAAC;MACtD,IAAIE,SAAS,EAAE;QACbR,QAAQ,CAACU,OAAO,CAAC,KAAIC,aAAI,EAACL,WAAW,CAACM,QAAQ,EAAE,EAAEJ,SAAS,CAAC,CAAC;MAC/D;IACF,CAAC,CAAC;IACF,MAAMK,OAAO,CAACC,GAAG,CAACZ,QAAQ,CAAC;IAE3B,MAAMa,cAAc,GAAGrB,WAAW,CAACsB,KAAK,EAAE,CAACZ,GAAG,CAAC,MAAOa,MAAM,IAAK;MAC/D,MAAMC,MAAM,GAAG,MAAM3B,aAAa,CAACgB,kBAAkB,CAACU,MAAM,CAACE,CAAC,CAAC;MAC/D,MAAMC,MAAM,GAAG,MAAM7B,aAAa,CAACgB,kBAAkB,CAACU,MAAM,CAACI,CAAC,CAAC;MAC/D,MAAMC,OAAO,GACX5B,WAAW,CAAC6B,IAAI,CAACN,MAAM,CAACE,CAAC,EAAEF,MAAM,CAACI,CAAC,CAAC,KAAK,cAAc,GAAG,KAAIG,wBAAU,EAAC,SAAS,CAAC,GAAG,KAAIA,wBAAU,EAAC,KAAK,CAAC;MAC7GxB,QAAQ,CAACyB,OAAO,CAAC,KAAIC,aAAI,EAACR,MAAM,CAACN,QAAQ,EAAE,EAAEQ,MAAM,CAACR,QAAQ,EAAE,EAAEU,OAAO,CAAC,CAAC;IAC3E,CAAC,CAAC;IACF,MAAMT,OAAO,CAACC,GAAG,CAACC,cAAc,CAAC;IAEjC,OAAOf,QAAQ;EACjB;AACF;AAAC"}