@teambit/graph 1.0.173 → 1.0.174

package/artifacts/__bit_junit.xml

@@ -1,4 +1,4 @@
 <?xml version="1.0" encoding="UTF-8"?>
 <testsuites tests="0" failures="0" errors="0" skipped="0">
-  <testsuite name="teambit.component/graph@1.0.173" tests="0" failures="0" errors="0" skipped="0"/>
+  <testsuite name="teambit.component/graph@1.0.174" tests="0" failures="0" errors="0" skipped="0"/>
 </testsuites>

package/artifacts/preview/teambit_component_graph-preview.js

@@ -1 +1 @@
-!function(e,t){"object"==typeof exports&&"object"==typeof module?module.exports=t():"function"==typeof define&&define.amd?define([],t):"object"==typeof exports?exports["teambit.component/graph-preview"]=t():e["teambit.component/graph-preview"]=t()}(self,(()=>(()=>{"use strict";var e={29579:(e,t,o)=>{var r={id:"teambit.component/graph@1.0.173",homepage:"https://bit.cloud/teambit/component/graph",exported:!0};function n(){const e=i(o(6376));return n=function(){return e},e}function i(e){return e&&e.__esModule?e:{default:e}}Object.defineProperty(t,"__esModule",{value:!0}),t.Logo=void 0,n.__bit_component=r,i.__bit_component=r;const p=()=>n().default.createElement("div",{style:{height:"100%",display:"flex",justifyContent:"center"}},n().default.createElement("img",{style:{width:70},src:"https://static.bit.dev/extensions-icons/graph.svg"}));p.__bit_component=r,t.Logo=p},6376:e=>{e.exports=React}},t={};function o(r){var n=t[r];if(void 0!==n)return n.exports;var i=t[r]={exports:{}};return e[r](i,i.exports,o),i.exports}o.d=(e,t)=>{for(var r in t)o.o(t,r)&&!o.o(e,r)&&Object.defineProperty(e,r,{enumerable:!0,get:t[r]})},o.o=(e,t)=>Object.prototype.hasOwnProperty.call(e,t),o.r=e=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})};var r={};return(()=>{o.r(r),o.d(r,{compositions:()=>u,compositions_metadata:()=>l,overview:()=>f});var e={};o.r(e),o.d(e,{default:()=>d});var t=o(29579);o(6376);const n=MdxJsReact,i=TeambitMdxUiMdxScopeContext;var p=["components"];function a(){return a=Object.assign?Object.assign.bind():function(e){for(var t=1;t<arguments.length;t++){var o=arguments[t];for(var r in o)Object.prototype.hasOwnProperty.call(o,r)&&(e[r]=o[r])}return e},a.apply(this,arguments)}var c={},s="wrapper";function d(e){var t=e.components,o=function(e,t){if(null==e)return{};var o,r,n=function(e,t){if(null==e)return{};var o,r,n={},i=Object.keys(e);for(r=0;r<i.length;r++)o=i[r],t.indexOf(o)>=0||(n[o]=e[o]);return n}(e,t);if(Object.getOwnPropertySymbols){var i=Object.getOwnPropertySymbols(e);for(r=0;r<i.length;r++)o=i[r],t.indexOf(o)>=0||Object.prototype.propertyIsEnumerable.call(e,o)&&(n[o]=e[o])}return n}(e,p);return(0,n.mdx)(s,a({},c,o,{components:t,mdxType:"MDXLayout"}),(0,n.mdx)(i.MDXScopeProvider,{components:{},mdxType:"MDXScopeProvider"}))}d.isMDXComponent=!0;const u=[t],f=[e],l={compositions:[{displayName:"Logo",identifier:"Logo"}]}})(),r})()));
+!function(e,t){"object"==typeof exports&&"object"==typeof module?module.exports=t():"function"==typeof define&&define.amd?define([],t):"object"==typeof exports?exports["teambit.component/graph-preview"]=t():e["teambit.component/graph-preview"]=t()}(self,(()=>(()=>{"use strict";var e={16231:(e,t,o)=>{var r={id:"teambit.component/graph@1.0.174",homepage:"https://bit.cloud/teambit/component/graph",exported:!0};function n(){const e=i(o(6376));return n=function(){return e},e}function i(e){return e&&e.__esModule?e:{default:e}}Object.defineProperty(t,"__esModule",{value:!0}),t.Logo=void 0,n.__bit_component=r,i.__bit_component=r;const p=()=>n().default.createElement("div",{style:{height:"100%",display:"flex",justifyContent:"center"}},n().default.createElement("img",{style:{width:70},src:"https://static.bit.dev/extensions-icons/graph.svg"}));p.__bit_component=r,t.Logo=p},6376:e=>{e.exports=React}},t={};function o(r){var n=t[r];if(void 0!==n)return n.exports;var i=t[r]={exports:{}};return e[r](i,i.exports,o),i.exports}o.d=(e,t)=>{for(var r in t)o.o(t,r)&&!o.o(e,r)&&Object.defineProperty(e,r,{enumerable:!0,get:t[r]})},o.o=(e,t)=>Object.prototype.hasOwnProperty.call(e,t),o.r=e=>{"undefined"!=typeof Symbol&&Symbol.toStringTag&&Object.defineProperty(e,Symbol.toStringTag,{value:"Module"}),Object.defineProperty(e,"__esModule",{value:!0})};var r={};return(()=>{o.r(r),o.d(r,{compositions:()=>u,compositions_metadata:()=>l,overview:()=>f});var e={};o.r(e),o.d(e,{default:()=>d});var t=o(16231);o(6376);const n=MdxJsReact,i=TeambitMdxUiMdxScopeContext;var p=["components"];function a(){return a=Object.assign?Object.assign.bind():function(e){for(var t=1;t<arguments.length;t++){var o=arguments[t];for(var r in o)Object.prototype.hasOwnProperty.call(o,r)&&(e[r]=o[r])}return e},a.apply(this,arguments)}var c={},s="wrapper";function d(e){var t=e.components,o=function(e,t){if(null==e)return{};var o,r,n=function(e,t){if(null==e)return{};var o,r,n={},i=Object.keys(e);for(r=0;r<i.length;r++)o=i[r],t.indexOf(o)>=0||(n[o]=e[o]);return n}(e,t);if(Object.getOwnPropertySymbols){var i=Object.getOwnPropertySymbols(e);for(r=0;r<i.length;r++)o=i[r],t.indexOf(o)>=0||Object.prototype.propertyIsEnumerable.call(e,o)&&(n[o]=e[o])}return n}(e,p);return(0,n.mdx)(s,a({},c,o,{components:t,mdxType:"MDXLayout"}),(0,n.mdx)(i.MDXScopeProvider,{components:{},mdxType:"MDXScopeProvider"}))}d.isMDXComponent=!0;const u=[t],f=[e],l={compositions:[{displayName:"Logo",identifier:"Logo"}]}})(),r})()));

package/artifacts/schema.json

@@ -62,8 +62,7 @@
                 "line": 4,
                 "character": 3
               },
-              "name": "DependencyType",
-              "internalFilePath": "model/dependency/dependency.ts"
+              "name": "DependencyType"
             },
             "isOptional": false
           },
@@ -134,6 +133,53 @@
         "extendsNodes": [],
         "implementNodes": []
       },
+      {
+        "__schema": "TypeSchema",
+        "location": {
+          "filePath": "model/dependency/dependency.ts",
+          "line": 1,
+          "character": 1
+        },
+        "signature": "type DependencyType = \"dev\" | \"peer\" | \"runtime\"",
+        "name": "DependencyType",
+        "type": {
+          "__schema": "TypeUnionSchema",
+          "location": {
+            "filePath": "model/dependency/dependency.ts",
+            "line": 1,
+            "character": 30
+          },
+          "types": [
+            {
+              "__schema": "LiteralTypeSchema",
+              "location": {
+                "filePath": "model/dependency/dependency.ts",
+                "line": 1,
+                "character": 30
+              },
+              "name": "'dev'"
+            },
+            {
+              "__schema": "LiteralTypeSchema",
+              "location": {
+                "filePath": "model/dependency/dependency.ts",
+                "line": 1,
+                "character": 38
+              },
+              "name": "'peer'"
+            },
+            {
+              "__schema": "LiteralTypeSchema",
+              "location": {
+                "filePath": "model/dependency/dependency.ts",
+                "line": 1,
+                "character": 47
+              },
+              "name": "'runtime'"
+            }
+          ]
+        }
+      },
       {
         "__schema": "ClassSchema",
         "location": {
@@ -450,7 +496,7 @@
                 "_legacy": {
                   "scope": "teambit.component",
                   "name": "graph",
-                  "version": "1.0.173"
+                  "version": "1.0.174"
                 },
                 "_scope": "teambit.component"
               }
@@ -1694,7 +1740,7 @@
           "line": 7,
           "character": 1
         },
-        "signature": "type DepEdgeType = \"dev\" | \"prod\" | \"ext\"",
+        "signature": "type DepEdgeType = \"dev\" | \"prod\" | \"ext\" | \"peer\"",
         "name": "DepEdgeType",
         "type": {
           "__schema": "TypeUnionSchema",
@@ -1730,6 +1776,15 @@
                 "character": 44
               },
               "name": "'ext'"
+            },
+            {
+              "__schema": "LiteralTypeSchema",
+              "location": {
+                "filePath": "component-id-graph.ts",
+                "line": 7,
+                "character": 52
+              },
+              "name": "'peer'"
             }
           ]
         }
@@ -2565,7 +2620,7 @@
                 "_legacy": {
                   "scope": "teambit.component",
                   "name": "graph",
-                  "version": "1.0.173"
+                  "version": "1.0.174"
                 },
                 "_scope": "teambit.component"
               }
@@ -3049,7 +3104,7 @@
                 "_legacy": {
                   "scope": "teambit.component",
                   "name": "graph",
-                  "version": "1.0.173"
+                  "version": "1.0.174"
                 },
                 "_scope": "teambit.component"
               }
@@ -3155,7 +3210,7 @@
                 "_legacy": {
                   "scope": "teambit.component",
                   "name": "graph",
-                  "version": "1.0.173"
+                  "version": "1.0.174"
                 },
                 "_scope": "teambit.component"
               }
@@ -4351,162 +4406,6 @@
     "internals": []
   },
   "internals": [
-    {
-      "__schema": "ModuleSchema",
-      "location": {
-        "filePath": "model/dependency/dependency.ts",
-        "line": 1,
-        "character": 1
-      },
-      "exports": [
-        {
-          "__schema": "TypeSchema",
-          "location": {
-            "filePath": "model/dependency/dependency.ts",
-            "line": 1,
-            "character": 1
-          },
-          "signature": "type DependencyType = \"dev\" | \"runtime\" | \"peer\"",
-          "name": "DependencyType",
-          "type": {
-            "__schema": "TypeUnionSchema",
-            "location": {
-              "filePath": "model/dependency/dependency.ts",
-              "line": 1,
-              "character": 30
-            },
-            "types": [
-              {
-                "__schema": "LiteralTypeSchema",
-                "location": {
-                  "filePath": "model/dependency/dependency.ts",
-                  "line": 1,
-                  "character": 30
-                },
-                "name": "'dev'"
-              },
-              {
-                "__schema": "LiteralTypeSchema",
-                "location": {
-                  "filePath": "model/dependency/dependency.ts",
-                  "line": 1,
-                  "character": 38
-                },
-                "name": "'peer'"
-              },
-              {
-                "__schema": "LiteralTypeSchema",
-                "location": {
-                  "filePath": "model/dependency/dependency.ts",
-                  "line": 1,
-                  "character": 47
-                },
-                "name": "'runtime'"
-              }
-            ]
-          }
-        },
-        {
-          "__schema": "ClassSchema",
-          "location": {
-            "filePath": "model/dependency/dependency.ts",
-            "line": 3,
-            "character": 1
-          },
-          "signature": "class Dependency",
-          "name": "Dependency",
-          "members": [
-            {
-              "__schema": "VariableLikeSchema",
-              "location": {
-                "filePath": "model/dependency/dependency.ts",
-                "line": 4,
-                "character": 3
-              },
-              "signature": "(property) Dependency.type: DependencyType",
-              "name": "type",
-              "type": {
-                "__schema": "TypeRefSchema",
-                "location": {
-                  "filePath": "model/dependency/dependency.ts",
-                  "line": 4,
-                  "character": 3
-                },
-                "name": "DependencyType",
-                "internalFilePath": "model/dependency/dependency.ts"
-              },
-              "isOptional": false
-            },
-            {
-              "__schema": "ConstructorSchema",
-              "location": {
-                "filePath": "model/dependency/dependency.ts",
-                "line": 5,
-                "character": 3
-              },
-              "signature": "constructor Dependency(type: DependencyType): Dependency",
-              "name": "constructor",
-              "params": [
-                {
-                  "__schema": "ParameterSchema",
-                  "location": {
-                    "filePath": "model/dependency/dependency.ts",
-                    "line": 5,
-                    "character": 15
-                  },
-                  "name": "type",
-                  "type": {
-                    "__schema": "TypeRefSchema",
-                    "location": {
-                      "filePath": "model/dependency/dependency.ts",
-                      "line": 5,
-                      "character": 21
-                    },
-                    "name": "DependencyType"
-                  },
-                  "isOptional": false,
-                  "isSpread": false
-                }
-              ],
-              "returnType": {
-                "__schema": "ThisTypeSchema",
-                "location": {
-                  "filePath": "model/dependency/dependency.ts",
-                  "line": 3,
-                  "character": 1
-                },
-                "name": "Dependency"
-              },
-              "modifiers": []
-            },
-            {
-              "__schema": "FunctionLikeSchema",
-              "location": {
-                "filePath": "model/dependency/dependency.ts",
-                "line": 8,
-                "character": 3
-              },
-              "signature": "(method) Dependency.stringify(): string",
-              "name": "stringify",
-              "params": [],
-              "returnType": {
-                "__schema": "KeywordTypeSchema",
-                "location": {
-                  "filePath": "model/dependency/dependency.ts",
-                  "line": 8,
-                  "character": 16
-                },
-                "name": "string"
-              },
-              "modifiers": []
-            }
-          ],
-          "extendsNodes": [],
-          "implementNodes": []
-        }
-      ],
-      "internals": []
-    },
     {
       "__schema": "ModuleSchema",
       "location": {
@@ -4694,7 +4593,7 @@
                   "_legacy": {
                     "scope": "teambit.component",
                     "name": "graph",
-                    "version": "1.0.173"
+                    "version": "1.0.174"
                   },
                   "_scope": "teambit.component"
                 }
@@ -6086,7 +5985,7 @@
             "line": 7,
             "character": 1
           },
-          "signature": "type DepEdgeType = \"dev\" | \"prod\" | \"ext\"",
+          "signature": "type DepEdgeType = \"dev\" | \"prod\" | \"ext\" | \"peer\"",
           "name": "DepEdgeType",
           "type": {
             "__schema": "TypeUnionSchema",
@@ -6122,6 +6021,15 @@
                   "character": 44
                 },
                 "name": "'ext'"
+              },
+              {
+                "__schema": "LiteralTypeSchema",
+                "location": {
+                  "filePath": "component-id-graph.ts",
+                  "line": 7,
+                  "character": 52
+                },
+                "name": "'peer'"
               }
             ]
           }
@@ -6996,7 +6904,7 @@
                   "_legacy": {
                     "scope": "teambit.component",
                     "name": "graph",
-                    "version": "1.0.173"
+                    "version": "1.0.174"
                   },
                   "_scope": "teambit.component"
                 }
@@ -7573,7 +7481,7 @@
                   "_legacy": {
                     "scope": "teambit.component",
                     "name": "graph",
-                    "version": "1.0.173"
+                    "version": "1.0.174"
                   },
                   "_scope": "teambit.component"
                 }
@@ -7721,7 +7629,7 @@
                   "_legacy": {
                     "scope": "teambit.component",
                     "name": "graph",
-                    "version": "1.0.173"
+                    "version": "1.0.174"
                   },
                   "_scope": "teambit.component"
                 }
@@ -8499,7 +8407,7 @@
                   "character": 6
                 },
                 "name": "rest",
-                "type": "{\n    id?: string | undefined;\n    hidden?: boolean | undefined;\n    defaultChecked?: boolean | undefined;\n    defaultValue?: string | number | readonly string[] | undefined;\n    suppressContentEditableWarning?: boolean | undefined;\n    ... 303 more ...;\n    onEdgeUpdate?: OnEdgeUpdateFunc<...> | undefined;\n}",
+                "type": "{\n    id?: string | undefined;\n    color?: string | undefined;\n    defaultChecked?: boolean | undefined;\n    defaultValue?: string | number | readonly string[] | undefined;\n    suppressContentEditableWarning?: boolean | undefined;\n    ... 303 more ...;\n    onEdgeUpdate?: OnEdgeUpdateFunc<...> | undefined;\n}",
                 "isSpread": true
               }
             ],
@@ -9307,7 +9215,7 @@
   "componentId": {
     "scope": "teambit.component",
     "name": "graph",
-    "version": "1.0.173"
+    "version": "1.0.174"
   },
   "taggedModuleExports": []
 }

package/dist/component-id-graph.d.ts

@@ -2,7 +2,7 @@ import { ComponentID } from '@teambit/component-id';
 import { Graph, Node, Edge } from '@teambit/graph.cleargraph';
 import type { DependenciesInfo } from '@teambit/legacy/dist/scope/graph/scope-graph';
 import GraphLib from 'graphlib';
-export type DepEdgeType = 'prod' | 'dev' | 'ext';
+export type DepEdgeType = 'prod' | 'dev' | 'ext' | 'peer';
 type ComponentIdNode = Node<ComponentID>;
 type DependencyEdge = Edge<DepEdgeType>;
 export type CompIdGraph = Graph<ComponentID, DepEdgeType>;

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

@@ -1 +1 @@
-{"version":3,"names":["_componentId","data","require","_graph","_graphlib","_interopRequireDefault","_lodash","obj","__esModule","default","_defineProperty","key","value","_toPropertyKey","Object","defineProperty","enumerable","configurable","writable","t","i","_toPrimitive","String","r","e","Symbol","toPrimitive","call","TypeError","Number","ComponentIdGraph","Graph","constructor","nodes","edges","graphLib","_graphLib","GraphLib","forEach","node","setNode","id","toString","edge","setEdge","sourceId","targetId","attr","create","findIdsFromSourcesToTargets","sources","targets","through","removeVerFromIdStr","idStr","split","sourcesStr","map","s","toStringWithoutVersion","targetsStr","allFlattened","source","successors","flat","allFlattenedIds","uniq","f","results","idWithNoVer","includes","allSuccessors","allSuccessorsWithNoVersion","find","push","componentIds","getNodes","n","length","resultsWithThrough","throughStr","allGraph","subgraph","allGraphWithNoVersion","every","findAllPathsFromSourcesToTargets","traverseDFS","visitedInPath","visitedInGraph","allPaths","Array","from","successorMap","values","filter","pathWithVer","pathWithoutVer","p","filtered","path","firstDep","sort","a","b","findCycles","graph","includeDeps","cycles","shouldLimitToSeedersOnly","seederIdsStr","seederIds","cyclesWithSeeders","cycle","some","cycleIdStr","buildFromCleargraph","runtimeOnly","successorsSubgraph","edgeFilter","getDependenciesInfo","dijkstraResults","alg","dijkstra","dependencies","keys","distance","Infinity","predecessor","dependencyType","depth","parent","getDependenciesAsObjectTree","depsInfo","ComponentID","fromString","populateTreeItems","treeItems","children","depInfo","child","compId","label","currentNodes","tree","exports"],"sources":["component-id-graph.ts"],"sourcesContent":["import { ComponentID } from '@teambit/component-id';\nimport { Graph, Node, Edge } from '@teambit/graph.cleargraph';\nimport type { DependenciesInfo } from '@teambit/legacy/dist/scope/graph/scope-graph';\nimport GraphLib from 'graphlib';\nimport { uniq } from 'lodash';\n\nexport type DepEdgeType = 'prod' | 'dev' | 'ext';\n\ntype ComponentIdNode = Node<ComponentID>;\ntype DependencyEdge = Edge<DepEdgeType>;\nexport type CompIdGraph = Graph<ComponentID, DepEdgeType>;\n\nexport class ComponentIdGraph extends Graph<ComponentID, DepEdgeType> {\n  private _graphLib: GraphLib.Graph;\n  seederIds: ComponentID[] = []; // component IDs that started the graph. (if from workspace, the .bitmap ids normally)\n  constructor(nodes: ComponentIdNode[] = [], edges: DependencyEdge[] = []) {\n    super(nodes, edges);\n  }\n\n  get graphLib() {\n    if (!this._graphLib) {\n      // convert clearGraph to graphLib\n      this._graphLib = new GraphLib.Graph();\n      this.nodes.forEach((node) => {\n        this._graphLib.setNode(node.id.toString());\n      });\n      this.edges.forEach((edge) => {\n        this._graphLib.setEdge(edge.sourceId.toString(), edge.targetId.toString(), edge.attr);\n      });\n    }\n    return this._graphLib;\n  }\n\n  protected create(nodes: ComponentIdNode[] = [], edges: DependencyEdge[] = []): this {\n    return new ComponentIdGraph(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   * if through is provided, it will only return the components that are connected to the through components.\n   * with the example above, if through is B, the results will be: [B, C].\n   */\n  findIdsFromSourcesToTargets(sources: ComponentID[], targets: ComponentID[], through?: 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 componentIds = this.getNodes(results).map((n) => n.attr);\n\n    if (!through?.length) {\n      return componentIds;\n    }\n\n    const resultsWithThrough: ComponentID[] = [];\n    const throughStr = through.map((t) => t.toStringWithoutVersion());\n    componentIds.forEach((id) => {\n      const allGraph = this.subgraph(id.toString()).nodes.map((n) => n.id); // successors and predecessors\n      const allGraphWithNoVersion = allGraph.map((s) => removeVerFromIdStr(s));\n      if (throughStr.every((t) => allGraphWithNoVersion.includes(t))) resultsWithThrough.push(id);\n    });\n\n    return resultsWithThrough;\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   * if through is provided, it will only return the components that are connected to the through components.\n   * with the example above, if through is B, the results will be: [B, C].\n   */\n  findAllPathsFromSourcesToTargets(\n    sources: ComponentID[],\n    targets: ComponentID[],\n    through?: ComponentID[]\n  ): string[][] {\n    const removeVerFromIdStr = (idStr: string) => idStr.split('@')[0];\n    const targetsStr = targets.map((t) => t.toStringWithoutVersion());\n\n    const traverseDFS = (\n      node: string,\n      visitedInPath: string[],\n      visitedInGraph: string[] = [],\n      allPaths: string[][]\n    ) => {\n      if (visitedInPath.includes(node)) return;\n      visitedInPath.push(node);\n      if (targetsStr.includes(removeVerFromIdStr(node))) {\n        allPaths.push(visitedInPath);\n        return;\n      }\n      if (visitedInGraph.includes(node)) return;\n      visitedInGraph.push(node);\n      const successors = Array.from(this.successorMap(node).values());\n      successors.forEach((s) => {\n        traverseDFS(s.id, [...visitedInPath], visitedInGraph, allPaths);\n      });\n    };\n\n    let allPaths: string[][] = [];\n    sources.forEach((source) => {\n      traverseDFS(source.toString(), [], [], allPaths);\n    });\n\n    if (through?.length) {\n      allPaths = allPaths.filter((pathWithVer) => {\n        const pathWithoutVer = pathWithVer.map((p) => removeVerFromIdStr(p));\n        return through.every((t) => pathWithoutVer.includes(t.toStringWithoutVersion()));\n      });\n    }\n\n    const sourcesStr = sources.map((s) => s.toString());\n    const filtered = allPaths.filter((path) => {\n      if (path.length < 3) {\n        // if length is 1, the source and target are the same.\n        // if length is 2, the target is a direct dependency of the source. we don't care about it.\n        return false;\n      }\n      const [, firstDep] = path;\n      if (sourcesStr.includes(firstDep)) {\n        // the first item is the source. the second item \"firstDep\" can be a direct dependency of one of the sources.\n        // if this is the case, we have already an exact path without this firstDep.\n        return true;\n      }\n      return true;\n    });\n\n    return filtered.sort((a, b) => a.length - b.length);\n  }\n\n  /**\n   * overrides the super class to eliminate non-seeders components\n   */\n  findCycles(graph?: this, includeDeps = false): string[][] {\n    const cycles = super.findCycles(graph);\n    if (!this.shouldLimitToSeedersOnly() || includeDeps) {\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  buildFromCleargraph(graph: Graph<ComponentID, DepEdgeType>): ComponentIdGraph {\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 === 'prod',\n    });\n  }\n\n  getDependenciesInfo(id: ComponentID): DependenciesInfo[] {\n    const dijkstraResults = GraphLib.alg.dijkstra(this.graphLib, id.toString());\n    const dependencies: DependenciesInfo[] = [];\n    Object.keys(dijkstraResults).forEach((idStr) => {\n      const distance = dijkstraResults[idStr].distance;\n      if (distance === Infinity || distance === 0) {\n        // there is no dependency or it's the same component (distance zero)\n        return;\n      }\n      const predecessor = dijkstraResults[idStr].predecessor;\n      const dependencyType = this.edge(predecessor, idStr);\n      dependencies.push({\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        id: this.node(idStr)!.attr,\n        depth: distance,\n        parent: predecessor,\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        dependencyType: dependencyType!.attr,\n      });\n    });\n    dependencies.sort((a, b) => a.depth - b.depth);\n    return dependencies;\n  }\n\n  getDependenciesAsObjectTree(idStr: string): Record<string, any> {\n    const depsInfo = this.getDependenciesInfo(ComponentID.fromString(idStr));\n    const populateTreeItems = (id: string, treeItems: Array<{ label: string; nodes?: Array<Record<string, any>> }>) => {\n      const children = depsInfo.filter((depInfo) => depInfo.parent === id);\n      if (!children || children.length === 0) {\n        return;\n      }\n      children.forEach((child) => {\n        const { id: compId } = child;\n        const label = compId.toString();\n        const currentNodes = [];\n        treeItems.push({ label, nodes: currentNodes });\n        populateTreeItems(label, currentNodes);\n      });\n    };\n\n    const currentNodes = [];\n    const tree = { label: idStr, nodes: currentNodes };\n    populateTreeItems(idStr, currentNodes);\n    return tree;\n  }\n\n  private shouldLimitToSeedersOnly() {\n    return this.seederIds.length;\n  }\n}\n"],"mappings":";;;;;;AAAA,SAAAA,aAAA;EAAA,MAAAC,IAAA,GAAAC,OAAA;EAAAF,YAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAE,OAAA;EAAA,MAAAF,IAAA,GAAAC,OAAA;EAAAC,MAAA,YAAAA,CAAA;IAAA,OAAAF,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAEA,SAAAG,UAAA;EAAA,MAAAH,IAAA,GAAAI,sBAAA,CAAAH,OAAA;EAAAE,SAAA,YAAAA,CAAA;IAAA,OAAAH,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAK,QAAA;EAAA,MAAAL,IAAA,GAAAC,OAAA;EAAAI,OAAA,YAAAA,CAAA;IAAA,OAAAL,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAA8B,SAAAI,uBAAAE,GAAA,WAAAA,GAAA,IAAAA,GAAA,CAAAC,UAAA,GAAAD,GAAA,KAAAE,OAAA,EAAAF,GAAA;AAAA,SAAAG,gBAAAH,GAAA,EAAAI,GAAA,EAAAC,KAAA,IAAAD,GAAA,GAAAE,cAAA,CAAAF,GAAA,OAAAA,GAAA,IAAAJ,GAAA,IAAAO,MAAA,CAAAC,cAAA,CAAAR,GAAA,EAAAI,GAAA,IAAAC,KAAA,EAAAA,KAAA,EAAAI,UAAA,QAAAC,YAAA,QAAAC,QAAA,oBAAAX,GAAA,CAAAI,GAAA,IAAAC,KAAA,WAAAL,GAAA;AAAA,SAAAM,eAAAM,CAAA,QAAAC,CAAA,GAAAC,YAAA,CAAAF,CAAA,uCAAAC,CAAA,GAAAA,CAAA,GAAAE,MAAA,CAAAF,CAAA;AAAA,SAAAC,aAAAF,CAAA,EAAAI,CAAA,2BAAAJ,CAAA,KAAAA,CAAA,SAAAA,CAAA,MAAAK,CAAA,GAAAL,CAAA,CAAAM,MAAA,CAAAC,WAAA,kBAAAF,CAAA,QAAAJ,CAAA,GAAAI,CAAA,CAAAG,IAAA,CAAAR,CAAA,EAAAI,CAAA,uCAAAH,CAAA,SAAAA,CAAA,YAAAQ,SAAA,yEAAAL,CAAA,GAAAD,MAAA,GAAAO,MAAA,EAAAV,CAAA;AAQvB,MAAMW,gBAAgB,SAASC,cAAK,CAA2B;EAErC;EAC/BC,WAAWA,CAACC,KAAwB,GAAG,EAAE,EAAEC,KAAuB,GAAG,EAAE,EAAE;IACvE,KAAK,CAACD,KAAK,EAAEC,KAAK,CAAC;IAACxB,eAAA;IAAAA,eAAA,oBAFK,EAAE;EAG7B;EAEA,IAAIyB,QAAQA,CAAA,EAAG;IACb,IAAI,CAAC,IAAI,CAACC,SAAS,EAAE;MACnB;MACA,IAAI,CAACA,SAAS,GAAG,KAAIC,mBAAQ,CAACN,KAAK,EAAC,CAAC;MACrC,IAAI,CAACE,KAAK,CAACK,OAAO,CAAEC,IAAI,IAAK;QAC3B,IAAI,CAACH,SAAS,CAACI,OAAO,CAACD,IAAI,CAACE,EAAE,CAACC,QAAQ,CAAC,CAAC,CAAC;MAC5C,CAAC,CAAC;MACF,IAAI,CAACR,KAAK,CAACI,OAAO,CAAEK,IAAI,IAAK;QAC3B,IAAI,CAACP,SAAS,CAACQ,OAAO,CAACD,IAAI,CAACE,QAAQ,CAACH,QAAQ,CAAC,CAAC,EAAEC,IAAI,CAACG,QAAQ,CAACJ,QAAQ,CAAC,CAAC,EAAEC,IAAI,CAACI,IAAI,CAAC;MACvF,CAAC,CAAC;IACJ;IACA,OAAO,IAAI,CAACX,SAAS;EACvB;EAEUY,MAAMA,CAACf,KAAwB,GAAG,EAAE,EAAEC,KAAuB,GAAG,EAAE,EAAQ;IAClF,OAAO,IAAIJ,gBAAgB,CAACG,KAAK,EAAEC,KAAK,CAAC;EAC3C;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEe,2BAA2BA,CAACC,OAAsB,EAAEC,OAAsB,EAAEC,OAAuB,EAAiB;IAClH,MAAMC,kBAAkB,GAAIC,KAAa,IAAKA,KAAK,CAACC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjE,MAAMC,UAAU,GAAGN,OAAO,CAACO,GAAG,CAAEC,CAAC,IAAKA,CAAC,CAACC,sBAAsB,CAAC,CAAC,CAAC;IACjE,MAAMC,UAAU,GAAGT,OAAO,CAACM,GAAG,CAAEtC,CAAC,IAAKA,CAAC,CAACwC,sBAAsB,CAAC,CAAC,CAAC;IACjE,MAAME,YAAY,GAAGX,OAAO,CAACO,GAAG,CAAEK,MAAM,IAAK,IAAI,CAACC,UAAU,CAACD,MAAM,CAACpB,QAAQ,CAAC,CAAC,CAAC,CAAC,CAACsB,IAAI,CAAC,CAAC;IACvF,MAAMC,eAAe,GAAG,IAAAC,cAAI,EAACL,YAAY,CAACJ,GAAG,CAAEU,CAAC,IAAKA,CAAC,CAAC1B,EAAE,CAAC,CAAC;IAC3D,MAAM2B,OAAiB,GAAG,EAAE;IAC5BH,eAAe,CAAC3B,OAAO,CAAEG,EAAE,IAAK;MAC9B,MAAM4B,WAAW,GAAGhB,kBAAkB,CAACZ,EAAE,CAAC;MAC1C,IAAIe,UAAU,CAACc,QAAQ,CAACD,WAAW,CAAC,IAAIT,UAAU,CAACU,QAAQ,CAACD,WAAW,CAAC,EAAE;MAC1E,MAAME,aAAa,GAAG,IAAI,CAACR,UAAU,CAACtB,EAAE,CAAC;MACzC,MAAM+B,0BAA0B,GAAGD,aAAa,CAACd,GAAG,CAAEC,CAAC,IAAKL,kBAAkB,CAACK,CAAC,CAACjB,EAAE,CAAC,CAAC;MACrF,IAAI+B,0BAA0B,CAACC,IAAI,CAAEf,CAAC,IAAKE,UAAU,CAACU,QAAQ,CAACZ,CAAC,CAAC,CAAC,EAAEU,OAAO,CAACM,IAAI,CAACjC,EAAE,CAAC;IACtF,CAAC,CAAC;IACF,MAAMkC,YAAY,GAAG,IAAI,CAACC,QAAQ,CAACR,OAAO,CAAC,CAACX,GAAG,CAAEoB,CAAC,IAAKA,CAAC,CAAC9B,IAAI,CAAC;IAE9D,IAAI,CAACK,OAAO,EAAE0B,MAAM,EAAE;MACpB,OAAOH,YAAY;IACrB;IAEA,MAAMI,kBAAiC,GAAG,EAAE;IAC5C,MAAMC,UAAU,GAAG5B,OAAO,CAACK,GAAG,CAAEtC,CAAC,IAAKA,CAAC,CAACwC,sBAAsB,CAAC,CAAC,CAAC;IACjEgB,YAAY,CAACrC,OAAO,CAAEG,EAAE,IAAK;MAC3B,MAAMwC,QAAQ,GAAG,IAAI,CAACC,QAAQ,CAACzC,EAAE,CAACC,QAAQ,CAAC,CAAC,CAAC,CAACT,KAAK,CAACwB,GAAG,CAAEoB,CAAC,IAAKA,CAAC,CAACpC,EAAE,CAAC,CAAC,CAAC;MACtE,MAAM0C,qBAAqB,GAAGF,QAAQ,CAACxB,GAAG,CAAEC,CAAC,IAAKL,kBAAkB,CAACK,CAAC,CAAC,CAAC;MACxE,IAAIsB,UAAU,CAACI,KAAK,CAAEjE,CAAC,IAAKgE,qBAAqB,CAACb,QAAQ,CAACnD,CAAC,CAAC,CAAC,EAAE4D,kBAAkB,CAACL,IAAI,CAACjC,EAAE,CAAC;IAC7F,CAAC,CAAC;IAEF,OAAOsC,kBAAkB;EAC3B;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEM,gCAAgCA,CAC9BnC,OAAsB,EACtBC,OAAsB,EACtBC,OAAuB,EACX;IACZ,MAAMC,kBAAkB,GAAIC,KAAa,IAAKA,KAAK,CAACC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjE,MAAMK,UAAU,GAAGT,OAAO,CAACM,GAAG,CAAEtC,CAAC,IAAKA,CAAC,CAACwC,sBAAsB,CAAC,CAAC,CAAC;IAEjE,MAAM2B,WAAW,GAAGA,CAClB/C,IAAY,EACZgD,aAAuB,EACvBC,cAAwB,GAAG,EAAE,EAC7BC,QAAoB,KACjB;MACH,IAAIF,aAAa,CAACjB,QAAQ,CAAC/B,IAAI,CAAC,EAAE;MAClCgD,aAAa,CAACb,IAAI,CAACnC,IAAI,CAAC;MACxB,IAAIqB,UAAU,CAACU,QAAQ,CAACjB,kBAAkB,CAACd,IAAI,CAAC,CAAC,EAAE;QACjDkD,QAAQ,CAACf,IAAI,CAACa,aAAa,CAAC;QAC5B;MACF;MACA,IAAIC,cAAc,CAAClB,QAAQ,CAAC/B,IAAI,CAAC,EAAE;MACnCiD,cAAc,CAACd,IAAI,CAACnC,IAAI,CAAC;MACzB,MAAMwB,UAAU,GAAG2B,KAAK,CAACC,IAAI,CAAC,IAAI,CAACC,YAAY,CAACrD,IAAI,CAAC,CAACsD,MAAM,CAAC,CAAC,CAAC;MAC/D9B,UAAU,CAACzB,OAAO,CAAEoB,CAAC,IAAK;QACxB4B,WAAW,CAAC5B,CAAC,CAACjB,EAAE,EAAE,CAAC,GAAG8C,aAAa,CAAC,EAAEC,cAAc,EAAEC,QAAQ,CAAC;MACjE,CAAC,CAAC;IACJ,CAAC;IAED,IAAIA,QAAoB,GAAG,EAAE;IAC7BvC,OAAO,CAACZ,OAAO,CAAEwB,MAAM,IAAK;MAC1BwB,WAAW,CAACxB,MAAM,CAACpB,QAAQ,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE+C,QAAQ,CAAC;IAClD,CAAC,CAAC;IAEF,IAAIrC,OAAO,EAAE0B,MAAM,EAAE;MACnBW,QAAQ,GAAGA,QAAQ,CAACK,MAAM,CAAEC,WAAW,IAAK;QAC1C,MAAMC,cAAc,GAAGD,WAAW,CAACtC,GAAG,CAAEwC,CAAC,IAAK5C,kBAAkB,CAAC4C,CAAC,CAAC,CAAC;QACpE,OAAO7C,OAAO,CAACgC,KAAK,CAAEjE,CAAC,IAAK6E,cAAc,CAAC1B,QAAQ,CAACnD,CAAC,CAACwC,sBAAsB,CAAC,CAAC,CAAC,CAAC;MAClF,CAAC,CAAC;IACJ;IAEA,MAAMH,UAAU,GAAGN,OAAO,CAACO,GAAG,CAAEC,CAAC,IAAKA,CAAC,CAAChB,QAAQ,CAAC,CAAC,CAAC;IACnD,MAAMwD,QAAQ,GAAGT,QAAQ,CAACK,MAAM,CAAEK,IAAI,IAAK;MACzC,IAAIA,IAAI,CAACrB,MAAM,GAAG,CAAC,EAAE;QACnB;QACA;QACA,OAAO,KAAK;MACd;MACA,MAAM,GAAGsB,QAAQ,CAAC,GAAGD,IAAI;MACzB,IAAI3C,UAAU,CAACc,QAAQ,CAAC8B,QAAQ,CAAC,EAAE;QACjC;QACA;QACA,OAAO,IAAI;MACb;MACA,OAAO,IAAI;IACb,CAAC,CAAC;IAEF,OAAOF,QAAQ,CAACG,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAACxB,MAAM,GAAGyB,CAAC,CAACzB,MAAM,CAAC;EACrD;;EAEA;AACF;AACA;EACE0B,UAAUA,CAACC,KAAY,EAAEC,WAAW,GAAG,KAAK,EAAc;IACxD,MAAMC,MAAM,GAAG,KAAK,CAACH,UAAU,CAACC,KAAK,CAAC;IACtC,IAAI,CAAC,IAAI,CAACG,wBAAwB,CAAC,CAAC,IAAIF,WAAW,EAAE;MACnD,OAAOC,MAAM;IACf;IACA,MAAME,YAAY,GAAG,IAAI,CAACC,SAAS,CAACrD,GAAG,CAAEhB,EAAE,IAAKA,EAAE,CAACC,QAAQ,CAAC,CAAC,CAAC;IAC9D,MAAMqE,iBAAiB,GAAGJ,MAAM,CAACb,MAAM,CAAEkB,KAAK,IAAK;MACjD,OAAOA,KAAK,CAACC,IAAI,CAAEC,UAAU,IAAKL,YAAY,CAACvC,QAAQ,CAAC4C,UAAU,CAAC,CAAC;IACtE,CAAC,CAAC;IACF,OAAOH,iBAAiB;EAC1B;EAEAI,mBAAmBA,CAACV,KAAsC,EAAoB;IAC5E,OAAO,IAAI,CAACzD,MAAM,CAACyD,KAAK,CAACxE,KAAK,EAAEwE,KAAK,CAACvE,KAAK,CAAC;EAC9C;EAEAkF,WAAWA,CAACzC,YAAsB,EAAE;IAClC,OAAO,IAAI,CAAC0C,kBAAkB,CAAC1C,YAAY,EAAE;MAC3C2C,UAAU,EAAG3E,IAAoB,IAAKA,IAAI,CAACI,IAAI,KAAK;IACtD,CAAC,CAAC;EACJ;EAEAwE,mBAAmBA,CAAC9E,EAAe,EAAsB;IACvD,MAAM+E,eAAe,GAAGnF,mBAAQ,CAACoF,GAAG,CAACC,QAAQ,CAAC,IAAI,CAACvF,QAAQ,EAAEM,EAAE,CAACC,QAAQ,CAAC,CAAC,CAAC;IAC3E,MAAMiF,YAAgC,GAAG,EAAE;IAC3C7G,MAAM,CAAC8G,IAAI,CAACJ,eAAe,CAAC,CAAClF,OAAO,CAAEgB,KAAK,IAAK;MAC9C,MAAMuE,QAAQ,GAAGL,eAAe,CAAClE,KAAK,CAAC,CAACuE,QAAQ;MAChD,IAAIA,QAAQ,KAAKC,QAAQ,IAAID,QAAQ,KAAK,CAAC,EAAE;QAC3C;QACA;MACF;MACA,MAAME,WAAW,GAAGP,eAAe,CAAClE,KAAK,CAAC,CAACyE,WAAW;MACtD,MAAMC,cAAc,GAAG,IAAI,CAACrF,IAAI,CAACoF,WAAW,EAAEzE,KAAK,CAAC;MACpDqE,YAAY,CAACjD,IAAI,CAAC;QAChB;QACAjC,EAAE,EAAE,IAAI,CAACF,IAAI,CAACe,KAAK,CAAC,CAAEP,IAAI;QAC1BkF,KAAK,EAAEJ,QAAQ;QACfK,MAAM,EAAEH,WAAW;QACnB;QACAC,cAAc,EAAEA,cAAc,CAAEjF;MAClC,CAAC,CAAC;IACJ,CAAC,CAAC;IACF4E,YAAY,CAACtB,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAAC2B,KAAK,GAAG1B,CAAC,CAAC0B,KAAK,CAAC;IAC9C,OAAON,YAAY;EACrB;EAEAQ,2BAA2BA,CAAC7E,KAAa,EAAuB;IAC9D,MAAM8E,QAAQ,GAAG,IAAI,CAACb,mBAAmB,CAACc,0BAAW,CAACC,UAAU,CAAChF,KAAK,CAAC,CAAC;IACxE,MAAMiF,iBAAiB,GAAGA,CAAC9F,EAAU,EAAE+F,SAAuE,KAAK;MACjH,MAAMC,QAAQ,GAAGL,QAAQ,CAACtC,MAAM,CAAE4C,OAAO,IAAKA,OAAO,CAACR,MAAM,KAAKzF,EAAE,CAAC;MACpE,IAAI,CAACgG,QAAQ,IAAIA,QAAQ,CAAC3D,MAAM,KAAK,CAAC,EAAE;QACtC;MACF;MACA2D,QAAQ,CAACnG,OAAO,CAAEqG,KAAK,IAAK;QAC1B,MAAM;UAAElG,EAAE,EAAEmG;QAAO,CAAC,GAAGD,KAAK;QAC5B,MAAME,KAAK,GAAGD,MAAM,CAAClG,QAAQ,CAAC,CAAC;QAC/B,MAAMoG,YAAY,GAAG,EAAE;QACvBN,SAAS,CAAC9D,IAAI,CAAC;UAAEmE,KAAK;UAAE5G,KAAK,EAAE6G;QAAa,CAAC,CAAC;QAC9CP,iBAAiB,CAACM,KAAK,EAAEC,YAAY,CAAC;MACxC,CAAC,CAAC;IACJ,CAAC;IAED,MAAMA,YAAY,GAAG,EAAE;IACvB,MAAMC,IAAI,GAAG;MAAEF,KAAK,EAAEvF,KAAK;MAAErB,KAAK,EAAE6G;IAAa,CAAC;IAClDP,iBAAiB,CAACjF,KAAK,EAAEwF,YAAY,CAAC;IACtC,OAAOC,IAAI;EACb;EAEQnC,wBAAwBA,CAAA,EAAG;IACjC,OAAO,IAAI,CAACE,SAAS,CAAChC,MAAM;EAC9B;AACF;AAACkE,OAAA,CAAAlH,gBAAA,GAAAA,gBAAA"}
+{"version":3,"names":["_componentId","data","require","_graph","_graphlib","_interopRequireDefault","_lodash","obj","__esModule","default","_defineProperty","key","value","_toPropertyKey","Object","defineProperty","enumerable","configurable","writable","t","i","_toPrimitive","String","r","e","Symbol","toPrimitive","call","TypeError","Number","ComponentIdGraph","Graph","constructor","nodes","edges","graphLib","_graphLib","GraphLib","forEach","node","setNode","id","toString","edge","setEdge","sourceId","targetId","attr","create","findIdsFromSourcesToTargets","sources","targets","through","removeVerFromIdStr","idStr","split","sourcesStr","map","s","toStringWithoutVersion","targetsStr","allFlattened","source","successors","flat","allFlattenedIds","uniq","f","results","idWithNoVer","includes","allSuccessors","allSuccessorsWithNoVersion","find","push","componentIds","getNodes","n","length","resultsWithThrough","throughStr","allGraph","subgraph","allGraphWithNoVersion","every","findAllPathsFromSourcesToTargets","traverseDFS","visitedInPath","visitedInGraph","allPaths","Array","from","successorMap","values","filter","pathWithVer","pathWithoutVer","p","filtered","path","firstDep","sort","a","b","findCycles","graph","includeDeps","cycles","shouldLimitToSeedersOnly","seederIdsStr","seederIds","cyclesWithSeeders","cycle","some","cycleIdStr","buildFromCleargraph","runtimeOnly","successorsSubgraph","edgeFilter","getDependenciesInfo","dijkstraResults","alg","dijkstra","dependencies","keys","distance","Infinity","predecessor","dependencyType","depth","parent","getDependenciesAsObjectTree","depsInfo","ComponentID","fromString","populateTreeItems","treeItems","children","depInfo","child","compId","label","currentNodes","tree","exports"],"sources":["component-id-graph.ts"],"sourcesContent":["import { ComponentID } from '@teambit/component-id';\nimport { Graph, Node, Edge } from '@teambit/graph.cleargraph';\nimport type { DependenciesInfo } from '@teambit/legacy/dist/scope/graph/scope-graph';\nimport GraphLib from 'graphlib';\nimport { uniq } from 'lodash';\n\nexport type DepEdgeType = 'prod' | 'dev' | 'ext' | 'peer';\n\ntype ComponentIdNode = Node<ComponentID>;\ntype DependencyEdge = Edge<DepEdgeType>;\nexport type CompIdGraph = Graph<ComponentID, DepEdgeType>;\n\nexport class ComponentIdGraph extends Graph<ComponentID, DepEdgeType> {\n  private _graphLib: GraphLib.Graph;\n  seederIds: ComponentID[] = []; // component IDs that started the graph. (if from workspace, the .bitmap ids normally)\n  constructor(nodes: ComponentIdNode[] = [], edges: DependencyEdge[] = []) {\n    super(nodes, edges);\n  }\n\n  get graphLib() {\n    if (!this._graphLib) {\n      // convert clearGraph to graphLib\n      this._graphLib = new GraphLib.Graph();\n      this.nodes.forEach((node) => {\n        this._graphLib.setNode(node.id.toString());\n      });\n      this.edges.forEach((edge) => {\n        this._graphLib.setEdge(edge.sourceId.toString(), edge.targetId.toString(), edge.attr);\n      });\n    }\n    return this._graphLib;\n  }\n\n  protected create(nodes: ComponentIdNode[] = [], edges: DependencyEdge[] = []): this {\n    return new ComponentIdGraph(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   * if through is provided, it will only return the components that are connected to the through components.\n   * with the example above, if through is B, the results will be: [B, C].\n   */\n  findIdsFromSourcesToTargets(sources: ComponentID[], targets: ComponentID[], through?: 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 componentIds = this.getNodes(results).map((n) => n.attr);\n\n    if (!through?.length) {\n      return componentIds;\n    }\n\n    const resultsWithThrough: ComponentID[] = [];\n    const throughStr = through.map((t) => t.toStringWithoutVersion());\n    componentIds.forEach((id) => {\n      const allGraph = this.subgraph(id.toString()).nodes.map((n) => n.id); // successors and predecessors\n      const allGraphWithNoVersion = allGraph.map((s) => removeVerFromIdStr(s));\n      if (throughStr.every((t) => allGraphWithNoVersion.includes(t))) resultsWithThrough.push(id);\n    });\n\n    return resultsWithThrough;\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   * if through is provided, it will only return the components that are connected to the through components.\n   * with the example above, if through is B, the results will be: [B, C].\n   */\n  findAllPathsFromSourcesToTargets(\n    sources: ComponentID[],\n    targets: ComponentID[],\n    through?: ComponentID[]\n  ): string[][] {\n    const removeVerFromIdStr = (idStr: string) => idStr.split('@')[0];\n    const targetsStr = targets.map((t) => t.toStringWithoutVersion());\n\n    const traverseDFS = (\n      node: string,\n      visitedInPath: string[],\n      visitedInGraph: string[] = [],\n      allPaths: string[][]\n    ) => {\n      if (visitedInPath.includes(node)) return;\n      visitedInPath.push(node);\n      if (targetsStr.includes(removeVerFromIdStr(node))) {\n        allPaths.push(visitedInPath);\n        return;\n      }\n      if (visitedInGraph.includes(node)) return;\n      visitedInGraph.push(node);\n      const successors = Array.from(this.successorMap(node).values());\n      successors.forEach((s) => {\n        traverseDFS(s.id, [...visitedInPath], visitedInGraph, allPaths);\n      });\n    };\n\n    let allPaths: string[][] = [];\n    sources.forEach((source) => {\n      traverseDFS(source.toString(), [], [], allPaths);\n    });\n\n    if (through?.length) {\n      allPaths = allPaths.filter((pathWithVer) => {\n        const pathWithoutVer = pathWithVer.map((p) => removeVerFromIdStr(p));\n        return through.every((t) => pathWithoutVer.includes(t.toStringWithoutVersion()));\n      });\n    }\n\n    const sourcesStr = sources.map((s) => s.toString());\n    const filtered = allPaths.filter((path) => {\n      if (path.length < 3) {\n        // if length is 1, the source and target are the same.\n        // if length is 2, the target is a direct dependency of the source. we don't care about it.\n        return false;\n      }\n      const [, firstDep] = path;\n      if (sourcesStr.includes(firstDep)) {\n        // the first item is the source. the second item \"firstDep\" can be a direct dependency of one of the sources.\n        // if this is the case, we have already an exact path without this firstDep.\n        return true;\n      }\n      return true;\n    });\n\n    return filtered.sort((a, b) => a.length - b.length);\n  }\n\n  /**\n   * overrides the super class to eliminate non-seeders components\n   */\n  findCycles(graph?: this, includeDeps = false): string[][] {\n    const cycles = super.findCycles(graph);\n    if (!this.shouldLimitToSeedersOnly() || includeDeps) {\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  buildFromCleargraph(graph: Graph<ComponentID, DepEdgeType>): ComponentIdGraph {\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 === 'prod',\n    });\n  }\n\n  getDependenciesInfo(id: ComponentID): DependenciesInfo[] {\n    const dijkstraResults = GraphLib.alg.dijkstra(this.graphLib, id.toString());\n    const dependencies: DependenciesInfo[] = [];\n    Object.keys(dijkstraResults).forEach((idStr) => {\n      const distance = dijkstraResults[idStr].distance;\n      if (distance === Infinity || distance === 0) {\n        // there is no dependency or it's the same component (distance zero)\n        return;\n      }\n      const predecessor = dijkstraResults[idStr].predecessor;\n      const dependencyType = this.edge(predecessor, idStr);\n      dependencies.push({\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        id: this.node(idStr)!.attr,\n        depth: distance,\n        parent: predecessor,\n        // eslint-disable-next-line @typescript-eslint/no-non-null-assertion\n        dependencyType: dependencyType!.attr,\n      });\n    });\n    dependencies.sort((a, b) => a.depth - b.depth);\n    return dependencies;\n  }\n\n  getDependenciesAsObjectTree(idStr: string): Record<string, any> {\n    const depsInfo = this.getDependenciesInfo(ComponentID.fromString(idStr));\n    const populateTreeItems = (id: string, treeItems: Array<{ label: string; nodes?: Array<Record<string, any>> }>) => {\n      const children = depsInfo.filter((depInfo) => depInfo.parent === id);\n      if (!children || children.length === 0) {\n        return;\n      }\n      children.forEach((child) => {\n        const { id: compId } = child;\n        const label = compId.toString();\n        const currentNodes = [];\n        treeItems.push({ label, nodes: currentNodes });\n        populateTreeItems(label, currentNodes);\n      });\n    };\n\n    const currentNodes = [];\n    const tree = { label: idStr, nodes: currentNodes };\n    populateTreeItems(idStr, currentNodes);\n    return tree;\n  }\n\n  private shouldLimitToSeedersOnly() {\n    return this.seederIds.length;\n  }\n}\n"],"mappings":";;;;;;AAAA,SAAAA,aAAA;EAAA,MAAAC,IAAA,GAAAC,OAAA;EAAAF,YAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAE,OAAA;EAAA,MAAAF,IAAA,GAAAC,OAAA;EAAAC,MAAA,YAAAA,CAAA;IAAA,OAAAF,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAEA,SAAAG,UAAA;EAAA,MAAAH,IAAA,GAAAI,sBAAA,CAAAH,OAAA;EAAAE,SAAA,YAAAA,CAAA;IAAA,OAAAH,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAK,QAAA;EAAA,MAAAL,IAAA,GAAAC,OAAA;EAAAI,OAAA,YAAAA,CAAA;IAAA,OAAAL,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAA8B,SAAAI,uBAAAE,GAAA,WAAAA,GAAA,IAAAA,GAAA,CAAAC,UAAA,GAAAD,GAAA,KAAAE,OAAA,EAAAF,GAAA;AAAA,SAAAG,gBAAAH,GAAA,EAAAI,GAAA,EAAAC,KAAA,IAAAD,GAAA,GAAAE,cAAA,CAAAF,GAAA,OAAAA,GAAA,IAAAJ,GAAA,IAAAO,MAAA,CAAAC,cAAA,CAAAR,GAAA,EAAAI,GAAA,IAAAC,KAAA,EAAAA,KAAA,EAAAI,UAAA,QAAAC,YAAA,QAAAC,QAAA,oBAAAX,GAAA,CAAAI,GAAA,IAAAC,KAAA,WAAAL,GAAA;AAAA,SAAAM,eAAAM,CAAA,QAAAC,CAAA,GAAAC,YAAA,CAAAF,CAAA,uCAAAC,CAAA,GAAAA,CAAA,GAAAE,MAAA,CAAAF,CAAA;AAAA,SAAAC,aAAAF,CAAA,EAAAI,CAAA,2BAAAJ,CAAA,KAAAA,CAAA,SAAAA,CAAA,MAAAK,CAAA,GAAAL,CAAA,CAAAM,MAAA,CAAAC,WAAA,kBAAAF,CAAA,QAAAJ,CAAA,GAAAI,CAAA,CAAAG,IAAA,CAAAR,CAAA,EAAAI,CAAA,uCAAAH,CAAA,SAAAA,CAAA,YAAAQ,SAAA,yEAAAL,CAAA,GAAAD,MAAA,GAAAO,MAAA,EAAAV,CAAA;AAQvB,MAAMW,gBAAgB,SAASC,cAAK,CAA2B;EAErC;EAC/BC,WAAWA,CAACC,KAAwB,GAAG,EAAE,EAAEC,KAAuB,GAAG,EAAE,EAAE;IACvE,KAAK,CAACD,KAAK,EAAEC,KAAK,CAAC;IAACxB,eAAA;IAAAA,eAAA,oBAFK,EAAE;EAG7B;EAEA,IAAIyB,QAAQA,CAAA,EAAG;IACb,IAAI,CAAC,IAAI,CAACC,SAAS,EAAE;MACnB;MACA,IAAI,CAACA,SAAS,GAAG,KAAIC,mBAAQ,CAACN,KAAK,EAAC,CAAC;MACrC,IAAI,CAACE,KAAK,CAACK,OAAO,CAAEC,IAAI,IAAK;QAC3B,IAAI,CAACH,SAAS,CAACI,OAAO,CAACD,IAAI,CAACE,EAAE,CAACC,QAAQ,CAAC,CAAC,CAAC;MAC5C,CAAC,CAAC;MACF,IAAI,CAACR,KAAK,CAACI,OAAO,CAAEK,IAAI,IAAK;QAC3B,IAAI,CAACP,SAAS,CAACQ,OAAO,CAACD,IAAI,CAACE,QAAQ,CAACH,QAAQ,CAAC,CAAC,EAAEC,IAAI,CAACG,QAAQ,CAACJ,QAAQ,CAAC,CAAC,EAAEC,IAAI,CAACI,IAAI,CAAC;MACvF,CAAC,CAAC;IACJ;IACA,OAAO,IAAI,CAACX,SAAS;EACvB;EAEUY,MAAMA,CAACf,KAAwB,GAAG,EAAE,EAAEC,KAAuB,GAAG,EAAE,EAAQ;IAClF,OAAO,IAAIJ,gBAAgB,CAACG,KAAK,EAAEC,KAAK,CAAC;EAC3C;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEe,2BAA2BA,CAACC,OAAsB,EAAEC,OAAsB,EAAEC,OAAuB,EAAiB;IAClH,MAAMC,kBAAkB,GAAIC,KAAa,IAAKA,KAAK,CAACC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjE,MAAMC,UAAU,GAAGN,OAAO,CAACO,GAAG,CAAEC,CAAC,IAAKA,CAAC,CAACC,sBAAsB,CAAC,CAAC,CAAC;IACjE,MAAMC,UAAU,GAAGT,OAAO,CAACM,GAAG,CAAEtC,CAAC,IAAKA,CAAC,CAACwC,sBAAsB,CAAC,CAAC,CAAC;IACjE,MAAME,YAAY,GAAGX,OAAO,CAACO,GAAG,CAAEK,MAAM,IAAK,IAAI,CAACC,UAAU,CAACD,MAAM,CAACpB,QAAQ,CAAC,CAAC,CAAC,CAAC,CAACsB,IAAI,CAAC,CAAC;IACvF,MAAMC,eAAe,GAAG,IAAAC,cAAI,EAACL,YAAY,CAACJ,GAAG,CAAEU,CAAC,IAAKA,CAAC,CAAC1B,EAAE,CAAC,CAAC;IAC3D,MAAM2B,OAAiB,GAAG,EAAE;IAC5BH,eAAe,CAAC3B,OAAO,CAAEG,EAAE,IAAK;MAC9B,MAAM4B,WAAW,GAAGhB,kBAAkB,CAACZ,EAAE,CAAC;MAC1C,IAAIe,UAAU,CAACc,QAAQ,CAACD,WAAW,CAAC,IAAIT,UAAU,CAACU,QAAQ,CAACD,WAAW,CAAC,EAAE;MAC1E,MAAME,aAAa,GAAG,IAAI,CAACR,UAAU,CAACtB,EAAE,CAAC;MACzC,MAAM+B,0BAA0B,GAAGD,aAAa,CAACd,GAAG,CAAEC,CAAC,IAAKL,kBAAkB,CAACK,CAAC,CAACjB,EAAE,CAAC,CAAC;MACrF,IAAI+B,0BAA0B,CAACC,IAAI,CAAEf,CAAC,IAAKE,UAAU,CAACU,QAAQ,CAACZ,CAAC,CAAC,CAAC,EAAEU,OAAO,CAACM,IAAI,CAACjC,EAAE,CAAC;IACtF,CAAC,CAAC;IACF,MAAMkC,YAAY,GAAG,IAAI,CAACC,QAAQ,CAACR,OAAO,CAAC,CAACX,GAAG,CAAEoB,CAAC,IAAKA,CAAC,CAAC9B,IAAI,CAAC;IAE9D,IAAI,CAACK,OAAO,EAAE0B,MAAM,EAAE;MACpB,OAAOH,YAAY;IACrB;IAEA,MAAMI,kBAAiC,GAAG,EAAE;IAC5C,MAAMC,UAAU,GAAG5B,OAAO,CAACK,GAAG,CAAEtC,CAAC,IAAKA,CAAC,CAACwC,sBAAsB,CAAC,CAAC,CAAC;IACjEgB,YAAY,CAACrC,OAAO,CAAEG,EAAE,IAAK;MAC3B,MAAMwC,QAAQ,GAAG,IAAI,CAACC,QAAQ,CAACzC,EAAE,CAACC,QAAQ,CAAC,CAAC,CAAC,CAACT,KAAK,CAACwB,GAAG,CAAEoB,CAAC,IAAKA,CAAC,CAACpC,EAAE,CAAC,CAAC,CAAC;MACtE,MAAM0C,qBAAqB,GAAGF,QAAQ,CAACxB,GAAG,CAAEC,CAAC,IAAKL,kBAAkB,CAACK,CAAC,CAAC,CAAC;MACxE,IAAIsB,UAAU,CAACI,KAAK,CAAEjE,CAAC,IAAKgE,qBAAqB,CAACb,QAAQ,CAACnD,CAAC,CAAC,CAAC,EAAE4D,kBAAkB,CAACL,IAAI,CAACjC,EAAE,CAAC;IAC7F,CAAC,CAAC;IAEF,OAAOsC,kBAAkB;EAC3B;;EAEA;AACF;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;AACA;EACEM,gCAAgCA,CAC9BnC,OAAsB,EACtBC,OAAsB,EACtBC,OAAuB,EACX;IACZ,MAAMC,kBAAkB,GAAIC,KAAa,IAAKA,KAAK,CAACC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACjE,MAAMK,UAAU,GAAGT,OAAO,CAACM,GAAG,CAAEtC,CAAC,IAAKA,CAAC,CAACwC,sBAAsB,CAAC,CAAC,CAAC;IAEjE,MAAM2B,WAAW,GAAGA,CAClB/C,IAAY,EACZgD,aAAuB,EACvBC,cAAwB,GAAG,EAAE,EAC7BC,QAAoB,KACjB;MACH,IAAIF,aAAa,CAACjB,QAAQ,CAAC/B,IAAI,CAAC,EAAE;MAClCgD,aAAa,CAACb,IAAI,CAACnC,IAAI,CAAC;MACxB,IAAIqB,UAAU,CAACU,QAAQ,CAACjB,kBAAkB,CAACd,IAAI,CAAC,CAAC,EAAE;QACjDkD,QAAQ,CAACf,IAAI,CAACa,aAAa,CAAC;QAC5B;MACF;MACA,IAAIC,cAAc,CAAClB,QAAQ,CAAC/B,IAAI,CAAC,EAAE;MACnCiD,cAAc,CAACd,IAAI,CAACnC,IAAI,CAAC;MACzB,MAAMwB,UAAU,GAAG2B,KAAK,CAACC,IAAI,CAAC,IAAI,CAACC,YAAY,CAACrD,IAAI,CAAC,CAACsD,MAAM,CAAC,CAAC,CAAC;MAC/D9B,UAAU,CAACzB,OAAO,CAAEoB,CAAC,IAAK;QACxB4B,WAAW,CAAC5B,CAAC,CAACjB,EAAE,EAAE,CAAC,GAAG8C,aAAa,CAAC,EAAEC,cAAc,EAAEC,QAAQ,CAAC;MACjE,CAAC,CAAC;IACJ,CAAC;IAED,IAAIA,QAAoB,GAAG,EAAE;IAC7BvC,OAAO,CAACZ,OAAO,CAAEwB,MAAM,IAAK;MAC1BwB,WAAW,CAACxB,MAAM,CAACpB,QAAQ,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE+C,QAAQ,CAAC;IAClD,CAAC,CAAC;IAEF,IAAIrC,OAAO,EAAE0B,MAAM,EAAE;MACnBW,QAAQ,GAAGA,QAAQ,CAACK,MAAM,CAAEC,WAAW,IAAK;QAC1C,MAAMC,cAAc,GAAGD,WAAW,CAACtC,GAAG,CAAEwC,CAAC,IAAK5C,kBAAkB,CAAC4C,CAAC,CAAC,CAAC;QACpE,OAAO7C,OAAO,CAACgC,KAAK,CAAEjE,CAAC,IAAK6E,cAAc,CAAC1B,QAAQ,CAACnD,CAAC,CAACwC,sBAAsB,CAAC,CAAC,CAAC,CAAC;MAClF,CAAC,CAAC;IACJ;IAEA,MAAMH,UAAU,GAAGN,OAAO,CAACO,GAAG,CAAEC,CAAC,IAAKA,CAAC,CAAChB,QAAQ,CAAC,CAAC,CAAC;IACnD,MAAMwD,QAAQ,GAAGT,QAAQ,CAACK,MAAM,CAAEK,IAAI,IAAK;MACzC,IAAIA,IAAI,CAACrB,MAAM,GAAG,CAAC,EAAE;QACnB;QACA;QACA,OAAO,KAAK;MACd;MACA,MAAM,GAAGsB,QAAQ,CAAC,GAAGD,IAAI;MACzB,IAAI3C,UAAU,CAACc,QAAQ,CAAC8B,QAAQ,CAAC,EAAE;QACjC;QACA;QACA,OAAO,IAAI;MACb;MACA,OAAO,IAAI;IACb,CAAC,CAAC;IAEF,OAAOF,QAAQ,CAACG,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAACxB,MAAM,GAAGyB,CAAC,CAACzB,MAAM,CAAC;EACrD;;EAEA;AACF;AACA;EACE0B,UAAUA,CAACC,KAAY,EAAEC,WAAW,GAAG,KAAK,EAAc;IACxD,MAAMC,MAAM,GAAG,KAAK,CAACH,UAAU,CAACC,KAAK,CAAC;IACtC,IAAI,CAAC,IAAI,CAACG,wBAAwB,CAAC,CAAC,IAAIF,WAAW,EAAE;MACnD,OAAOC,MAAM;IACf;IACA,MAAME,YAAY,GAAG,IAAI,CAACC,SAAS,CAACrD,GAAG,CAAEhB,EAAE,IAAKA,EAAE,CAACC,QAAQ,CAAC,CAAC,CAAC;IAC9D,MAAMqE,iBAAiB,GAAGJ,MAAM,CAACb,MAAM,CAAEkB,KAAK,IAAK;MACjD,OAAOA,KAAK,CAACC,IAAI,CAAEC,UAAU,IAAKL,YAAY,CAACvC,QAAQ,CAAC4C,UAAU,CAAC,CAAC;IACtE,CAAC,CAAC;IACF,OAAOH,iBAAiB;EAC1B;EAEAI,mBAAmBA,CAACV,KAAsC,EAAoB;IAC5E,OAAO,IAAI,CAACzD,MAAM,CAACyD,KAAK,CAACxE,KAAK,EAAEwE,KAAK,CAACvE,KAAK,CAAC;EAC9C;EAEAkF,WAAWA,CAACzC,YAAsB,EAAE;IAClC,OAAO,IAAI,CAAC0C,kBAAkB,CAAC1C,YAAY,EAAE;MAC3C2C,UAAU,EAAG3E,IAAoB,IAAKA,IAAI,CAACI,IAAI,KAAK;IACtD,CAAC,CAAC;EACJ;EAEAwE,mBAAmBA,CAAC9E,EAAe,EAAsB;IACvD,MAAM+E,eAAe,GAAGnF,mBAAQ,CAACoF,GAAG,CAACC,QAAQ,CAAC,IAAI,CAACvF,QAAQ,EAAEM,EAAE,CAACC,QAAQ,CAAC,CAAC,CAAC;IAC3E,MAAMiF,YAAgC,GAAG,EAAE;IAC3C7G,MAAM,CAAC8G,IAAI,CAACJ,eAAe,CAAC,CAAClF,OAAO,CAAEgB,KAAK,IAAK;MAC9C,MAAMuE,QAAQ,GAAGL,eAAe,CAAClE,KAAK,CAAC,CAACuE,QAAQ;MAChD,IAAIA,QAAQ,KAAKC,QAAQ,IAAID,QAAQ,KAAK,CAAC,EAAE;QAC3C;QACA;MACF;MACA,MAAME,WAAW,GAAGP,eAAe,CAAClE,KAAK,CAAC,CAACyE,WAAW;MACtD,MAAMC,cAAc,GAAG,IAAI,CAACrF,IAAI,CAACoF,WAAW,EAAEzE,KAAK,CAAC;MACpDqE,YAAY,CAACjD,IAAI,CAAC;QAChB;QACAjC,EAAE,EAAE,IAAI,CAACF,IAAI,CAACe,KAAK,CAAC,CAAEP,IAAI;QAC1BkF,KAAK,EAAEJ,QAAQ;QACfK,MAAM,EAAEH,WAAW;QACnB;QACAC,cAAc,EAAEA,cAAc,CAAEjF;MAClC,CAAC,CAAC;IACJ,CAAC,CAAC;IACF4E,YAAY,CAACtB,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAAC2B,KAAK,GAAG1B,CAAC,CAAC0B,KAAK,CAAC;IAC9C,OAAON,YAAY;EACrB;EAEAQ,2BAA2BA,CAAC7E,KAAa,EAAuB;IAC9D,MAAM8E,QAAQ,GAAG,IAAI,CAACb,mBAAmB,CAACc,0BAAW,CAACC,UAAU,CAAChF,KAAK,CAAC,CAAC;IACxE,MAAMiF,iBAAiB,GAAGA,CAAC9F,EAAU,EAAE+F,SAAuE,KAAK;MACjH,MAAMC,QAAQ,GAAGL,QAAQ,CAACtC,MAAM,CAAE4C,OAAO,IAAKA,OAAO,CAACR,MAAM,KAAKzF,EAAE,CAAC;MACpE,IAAI,CAACgG,QAAQ,IAAIA,QAAQ,CAAC3D,MAAM,KAAK,CAAC,EAAE;QACtC;MACF;MACA2D,QAAQ,CAACnG,OAAO,CAAEqG,KAAK,IAAK;QAC1B,MAAM;UAAElG,EAAE,EAAEmG;QAAO,CAAC,GAAGD,KAAK;QAC5B,MAAME,KAAK,GAAGD,MAAM,CAAClG,QAAQ,CAAC,CAAC;QAC/B,MAAMoG,YAAY,GAAG,EAAE;QACvBN,SAAS,CAAC9D,IAAI,CAAC;UAAEmE,KAAK;UAAE5G,KAAK,EAAE6G;QAAa,CAAC,CAAC;QAC9CP,iBAAiB,CAACM,KAAK,EAAEC,YAAY,CAAC;MACxC,CAAC,CAAC;IACJ,CAAC;IAED,MAAMA,YAAY,GAAG,EAAE;IACvB,MAAMC,IAAI,GAAG;MAAEF,KAAK,EAAEvF,KAAK;MAAErB,KAAK,EAAE6G;IAAa,CAAC;IAClDP,iBAAiB,CAACjF,KAAK,EAAEwF,YAAY,CAAC;IACtC,OAAOC,IAAI;EACb;EAEQnC,wBAAwBA,CAAA,EAAG;IACjC,OAAO,IAAI,CAACE,SAAS,CAAChC,MAAM;EAC9B;AACF;AAACkE,OAAA,CAAAlH,gBAAA,GAAAA,gBAAA"}

package/dist/index.d.ts

@@ -1,5 +1,5 @@
 export { DependenciesCompare } from './ui/dependencies-compare';
-export { Dependency } from './model/dependency';
+export { Dependency, DependencyType } from './model/dependency';
 export { DuplicateDependency } from './duplicate-dependency';
 export { GraphAspect as default, GraphAspect } from './graph.aspect';
 export { IdGraph, objectListToGraph, bitObjectListToGraph } from './object-list-to-graph';

package/dist/index.js

@@ -15,6 +15,12 @@ Object.defineProperty(exports, "Dependency", {
     return _dependency().Dependency;
   }
 });
+Object.defineProperty(exports, "DependencyType", {
+  enumerable: true,
+  get: function () {
+    return _dependency().DependencyType;
+  }
+});
 Object.defineProperty(exports, "DuplicateDependency", {
   enumerable: true,
   get: function () {

package/dist/index.js.map

@@ -1 +1 @@
-{"version":3,"names":["_dependenciesCompare","data","require","_dependency","_duplicateDependency","_graph","_objectListToGraph","_dependenciesGraph","_graphPage","_query","_componentNode","_edgeType"],"sources":["index.ts"],"sourcesContent":["export { DependenciesCompare } from './ui/dependencies-compare';\nexport { Dependency } from './model/dependency';\nexport { DuplicateDependency } from './duplicate-dependency';\nexport { GraphAspect as default, GraphAspect } from './graph.aspect';\nexport { IdGraph, objectListToGraph, bitObjectListToGraph } from './object-list-to-graph';\nexport {\n  calcElements,\n  calcLayout,\n  calcMinimapColors,\n  depTypeToClass,\n  depTypeToLabel,\n  styles as dependenciesGraphStyles,\n} from './ui/dependencies-graph';\nexport { GraphFilters, styles as graphPageStyles } from './ui/graph-page';\nexport { EdgeModel, GraphModel, NodeModel, useGraph, useGraphQuery } from './ui/query';\nexport { styles as componentNodeStyles, root, defaultNode, external } from './ui/component-node';\nexport type { RawGraph } from './ui/query';\nexport type { CompIdGraph, DepEdgeType, ComponentIdGraph } from './component-id-graph';\nexport type { ComponentGraph } from './component-graph';\nexport type { ComponentWidget, ComponentWidgetProps, ComponentWidgetSlot, GraphUI } from './graph.ui.runtime';\nexport { EdgeType } from './edge-type';\nexport type { GraphBuilder } from './graph-builder';\nexport type { GraphFilter } from './model/graph-filters';\nexport type { GraphMain } from './graph.main.runtime';\nexport type { VersionSubgraph } from './duplicate-dependency';\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,SAAAA,qBAAA;EAAA,MAAAC,IAAA,GAAAC,OAAA;EAAAF,oBAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAE,YAAA;EAAA,MAAAF,IAAA,GAAAC,OAAA;EAAAC,WAAA,YAAAA,CAAA;IAAA,OAAAF,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAG,qBAAA;EAAA,MAAAH,IAAA,GAAAC,OAAA;EAAAE,oBAAA,YAAAA,CAAA;IAAA,OAAAH,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAI,OAAA;EAAA,MAAAJ,IAAA,GAAAC,OAAA;EAAAG,MAAA,YAAAA,CAAA;IAAA,OAAAJ,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAK,mBAAA;EAAA,MAAAL,IAAA,GAAAC,OAAA;EAAAI,kBAAA,YAAAA,CAAA;IAAA,OAAAL,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAM,mBAAA;EAAA,MAAAN,IAAA,GAAAC,OAAA;EAAAK,kBAAA,YAAAA,CAAA;IAAA,OAAAN,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAQA,SAAAO,WAAA;EAAA,MAAAP,IAAA,GAAAC,OAAA;EAAAM,UAAA,YAAAA,CAAA;IAAA,OAAAP,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAQ,OAAA;EAAA,MAAAR,IAAA,GAAAC,OAAA;EAAAO,MAAA,YAAAA,CAAA;IAAA,OAAAR,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAS,eAAA;EAAA,MAAAT,IAAA,GAAAC,OAAA;EAAAQ,cAAA,YAAAA,CAAA;IAAA,OAAAT,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAKA,SAAAU,UAAA;EAAA,MAAAV,IAAA,GAAAC,OAAA;EAAAS,SAAA,YAAAA,CAAA;IAAA,OAAAV,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA"}
+{"version":3,"names":["_dependenciesCompare","data","require","_dependency","_duplicateDependency","_graph","_objectListToGraph","_dependenciesGraph","_graphPage","_query","_componentNode","_edgeType"],"sources":["index.ts"],"sourcesContent":["export { DependenciesCompare } from './ui/dependencies-compare';\nexport { Dependency, DependencyType } from './model/dependency';\nexport { DuplicateDependency } from './duplicate-dependency';\nexport { GraphAspect as default, GraphAspect } from './graph.aspect';\nexport { IdGraph, objectListToGraph, bitObjectListToGraph } from './object-list-to-graph';\nexport {\n  calcElements,\n  calcLayout,\n  calcMinimapColors,\n  depTypeToClass,\n  depTypeToLabel,\n  styles as dependenciesGraphStyles,\n} from './ui/dependencies-graph';\nexport { GraphFilters, styles as graphPageStyles } from './ui/graph-page';\nexport { EdgeModel, GraphModel, NodeModel, useGraph, useGraphQuery } from './ui/query';\nexport { styles as componentNodeStyles, root, defaultNode, external } from './ui/component-node';\nexport type { RawGraph } from './ui/query';\nexport type { CompIdGraph, DepEdgeType, ComponentIdGraph } from './component-id-graph';\nexport type { ComponentGraph } from './component-graph';\nexport type { ComponentWidget, ComponentWidgetProps, ComponentWidgetSlot, GraphUI } from './graph.ui.runtime';\nexport { EdgeType } from './edge-type';\nexport type { GraphBuilder } from './graph-builder';\nexport type { GraphFilter } from './model/graph-filters';\nexport type { GraphMain } from './graph.main.runtime';\nexport type { VersionSubgraph } from './duplicate-dependency';\n"],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;AAAA,SAAAA,qBAAA;EAAA,MAAAC,IAAA,GAAAC,OAAA;EAAAF,oBAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAE,YAAA;EAAA,MAAAF,IAAA,GAAAC,OAAA;EAAAC,WAAA,YAAAA,CAAA;IAAA,OAAAF,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAG,qBAAA;EAAA,MAAAH,IAAA,GAAAC,OAAA;EAAAE,oBAAA,YAAAA,CAAA;IAAA,OAAAH,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAI,OAAA;EAAA,MAAAJ,IAAA,GAAAC,OAAA;EAAAG,MAAA,YAAAA,CAAA;IAAA,OAAAJ,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAK,mBAAA;EAAA,MAAAL,IAAA,GAAAC,OAAA;EAAAI,kBAAA,YAAAA,CAAA;IAAA,OAAAL,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAM,mBAAA;EAAA,MAAAN,IAAA,GAAAC,OAAA;EAAAK,kBAAA,YAAAA,CAAA;IAAA,OAAAN,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAQA,SAAAO,WAAA;EAAA,MAAAP,IAAA,GAAAC,OAAA;EAAAM,UAAA,YAAAA,CAAA;IAAA,OAAAP,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAQ,OAAA;EAAA,MAAAR,IAAA,GAAAC,OAAA;EAAAO,MAAA,YAAAA,CAAA;IAAA,OAAAR,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAS,eAAA;EAAA,MAAAT,IAAA,GAAAC,OAAA;EAAAQ,cAAA,YAAAA,CAAA;IAAA,OAAAT,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAKA,SAAAU,UAAA;EAAA,MAAAV,IAAA,GAAAC,OAAA;EAAAS,SAAA,YAAAA,CAAA;IAAA,OAAAV,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA"}

package/dist/object-list-to-graph.js

@@ -69,6 +69,7 @@ async function bitObjectListToGraph(bitObjectsList) {
       const {
         dependencies,
         devDependencies,
+        peerDependencies,
         extensionDependencies
       } = versionInfo.version.depsIdsGroupedByType;
       const addDep = (depId, edge) => {
@@ -78,8 +79,10 @@ async function bitObjectListToGraph(bitObjectsList) {
       };
       const runTime = new (_dependency().Dependency)('runtime');
       const dev = new (_dependency().Dependency)('dev');
+      const peer = new (_dependency().Dependency)('peer');
       dependencies.forEach(depId => addDep(depId, runTime));
       [...devDependencies, ...extensionDependencies].forEach(depId => addDep(depId, dev));
+      peerDependencies.forEach(depId => addDep(depId, peer));
     });
   }));
   const uniqNodes = (0, _lodash().uniqBy)(nodes, 'id');

package/dist/object-list-to-graph.js.map

@@ -1 +1 @@
-{"version":3,"names":["_graph","data","require","_lodash","_traverseVersions","_dependency","IdGraph","Graph","constructor","nodes","edges","exports","objectListToGraph","objectList","bitObjectsList","toBitObjects","bitObjectListToGraph","exportMetadata","getExportMetadata","components","getComponents","versions","getVersions","Promise","all","map","component","compFromMetadata","exportVersions","find","c","id","isEqualWithoutVersion","toComponentId","startFrom","head","versionsInfo","getAllVersionsInfo","modelComponent","versionObjects","throws","forEach","versionInfo","changeVersion","tag","ref","toString","idStr","push","Node","version","dependencies","devDependencies","extensionDependencies","depsIdsGroupedByType","addDep","depId","edge","depIdStr","Edge","runTime","Dependency","dev","uniqNodes","uniqBy","idGraph"],"sources":["object-list-to-graph.ts"],"sourcesContent":["import { Graph, Node, Edge } from '@teambit/graph.cleargraph';\nimport { uniqBy } from 'lodash';\nimport { ComponentID } from '@teambit/component-id';\nimport type { ObjectList } from '@teambit/legacy/dist/scope/objects/object-list';\nimport { BitObjectList } from '@teambit/legacy/dist/scope/objects/bit-object-list';\nimport { getAllVersionsInfo } from '@teambit/legacy/dist/scope/component-ops/traverse-versions';\nimport { Dependency } from './model/dependency';\n\ntype BitIdNode = Node<ComponentID>;\ntype DependencyEdge = Edge<Dependency>;\n\nexport class IdGraph extends Graph<ComponentID, Dependency> {\n  constructor(nodes: BitIdNode[] = [], edges: DependencyEdge[] = []) {\n    super(nodes, edges);\n  }\n}\n\nexport async function objectListToGraph(objectList: ObjectList): Promise<IdGraph> {\n  const bitObjectsList = await objectList.toBitObjects();\n\n  return bitObjectListToGraph(bitObjectsList);\n}\n\nexport async function bitObjectListToGraph(bitObjectsList: BitObjectList): Promise<IdGraph> {\n  const exportMetadata = bitObjectsList.getExportMetadata();\n  const components = bitObjectsList.getComponents();\n  const versions = bitObjectsList.getVersions();\n  const nodes: BitIdNode[] = [];\n  const edges: DependencyEdge[] = [];\n  await Promise.all(\n    components.map(async (component) => {\n      const compFromMetadata = exportMetadata?.exportVersions.find((c) =>\n        c.id.isEqualWithoutVersion(component.toComponentId())\n      );\n      const startFrom = compFromMetadata?.head;\n      const versionsInfo = await getAllVersionsInfo({\n        modelComponent: component,\n        versionObjects: versions,\n        startFrom,\n        throws: false,\n      });\n      versionsInfo.forEach((versionInfo) => {\n        const id = component.toComponentId().changeVersion(versionInfo.tag || versionInfo.ref.toString());\n        const idStr = id.toString();\n        nodes.push(new Node(idStr, id));\n        if (!versionInfo.version) {\n          return;\n        }\n        const { dependencies, devDependencies, extensionDependencies } = versionInfo.version.depsIdsGroupedByType;\n        const addDep = (depId: ComponentID, edge: Dependency) => {\n          const depIdStr = depId.toString();\n          nodes.push(new Node(depIdStr, depId));\n          edges.push(new Edge(idStr, depIdStr, edge));\n        };\n        const runTime = new Dependency('runtime');\n        const dev = new Dependency('dev');\n        dependencies.forEach((depId) => addDep(depId, runTime));\n        [...devDependencies, ...extensionDependencies].forEach((depId) => addDep(depId, dev));\n      });\n    })\n  );\n  const uniqNodes = uniqBy(nodes, 'id');\n  const idGraph = new IdGraph(uniqNodes, edges);\n\n  return idGraph;\n}\n"],"mappings":";;;;;;;;AAAA,SAAAA,OAAA;EAAA,MAAAC,IAAA,GAAAC,OAAA;EAAAF,MAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAE,QAAA;EAAA,MAAAF,IAAA,GAAAC,OAAA;EAAAC,OAAA,YAAAA,CAAA;IAAA,OAAAF,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAIA,SAAAG,kBAAA;EAAA,MAAAH,IAAA,GAAAC,OAAA;EAAAE,iBAAA,YAAAA,CAAA;IAAA,OAAAH,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAI,YAAA;EAAA,MAAAJ,IAAA,GAAAC,OAAA;EAAAG,WAAA,YAAAA,CAAA;IAAA,OAAAJ,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAKO,MAAMK,OAAO,SAASC,cAAK,CAA0B;EAC1DC,WAAWA,CAACC,KAAkB,GAAG,EAAE,EAAEC,KAAuB,GAAG,EAAE,EAAE;IACjE,KAAK,CAACD,KAAK,EAAEC,KAAK,CAAC;EACrB;AACF;AAACC,OAAA,CAAAL,OAAA,GAAAA,OAAA;AAEM,eAAeM,iBAAiBA,CAACC,UAAsB,EAAoB;EAChF,MAAMC,cAAc,GAAG,MAAMD,UAAU,CAACE,YAAY,CAAC,CAAC;EAEtD,OAAOC,oBAAoB,CAACF,cAAc,CAAC;AAC7C;AAEO,eAAeE,oBAAoBA,CAACF,cAA6B,EAAoB;EAC1F,MAAMG,cAAc,GAAGH,cAAc,CAACI,iBAAiB,CAAC,CAAC;EACzD,MAAMC,UAAU,GAAGL,cAAc,CAACM,aAAa,CAAC,CAAC;EACjD,MAAMC,QAAQ,GAAGP,cAAc,CAACQ,WAAW,CAAC,CAAC;EAC7C,MAAMb,KAAkB,GAAG,EAAE;EAC7B,MAAMC,KAAuB,GAAG,EAAE;EAClC,MAAMa,OAAO,CAACC,GAAG,CACfL,UAAU,CAACM,GAAG,CAAC,MAAOC,SAAS,IAAK;IAClC,MAAMC,gBAAgB,GAAGV,cAAc,EAAEW,cAAc,CAACC,IAAI,CAAEC,CAAC,IAC7DA,CAAC,CAACC,EAAE,CAACC,qBAAqB,CAACN,SAAS,CAACO,aAAa,CAAC,CAAC,CACtD,CAAC;IACD,MAAMC,SAAS,GAAGP,gBAAgB,EAAEQ,IAAI;IACxC,MAAMC,YAAY,GAAG,MAAM,IAAAC,sCAAkB,EAAC;MAC5CC,cAAc,EAAEZ,SAAS;MACzBa,cAAc,EAAElB,QAAQ;MACxBa,SAAS;MACTM,MAAM,EAAE;IACV,CAAC,CAAC;IACFJ,YAAY,CAACK,OAAO,CAAEC,WAAW,IAAK;MACpC,MAAMX,EAAE,GAAGL,SAAS,CAACO,aAAa,CAAC,CAAC,CAACU,aAAa,CAACD,WAAW,CAACE,GAAG,IAAIF,WAAW,CAACG,GAAG,CAACC,QAAQ,CAAC,CAAC,CAAC;MACjG,MAAMC,KAAK,GAAGhB,EAAE,CAACe,QAAQ,CAAC,CAAC;MAC3BrC,KAAK,CAACuC,IAAI,CAAC,KAAIC,aAAI,EAACF,KAAK,EAAEhB,EAAE,CAAC,CAAC;MAC/B,IAAI,CAACW,WAAW,CAACQ,OAAO,EAAE;QACxB;MACF;MACA,MAAM;QAAEC,YAAY;QAAEC,eAAe;QAAEC;MAAsB,CAAC,GAAGX,WAAW,CAACQ,OAAO,CAACI,oBAAoB;MACzG,MAAMC,MAAM,GAAGA,CAACC,KAAkB,EAAEC,IAAgB,KAAK;QACvD,MAAMC,QAAQ,GAAGF,KAAK,CAACV,QAAQ,CAAC,CAAC;QACjCrC,KAAK,CAACuC,IAAI,CAAC,KAAIC,aAAI,EAACS,QAAQ,EAAEF,KAAK,CAAC,CAAC;QACrC9C,KAAK,CAACsC,IAAI,CAAC,KAAIW,aAAI,EAACZ,KAAK,EAAEW,QAAQ,EAAED,IAAI,CAAC,CAAC;MAC7C,CAAC;MACD,MAAMG,OAAO,GAAG,KAAIC,wBAAU,EAAC,SAAS,CAAC;MACzC,MAAMC,GAAG,GAAG,KAAID,wBAAU,EAAC,KAAK,CAAC;MACjCV,YAAY,CAACV,OAAO,CAAEe,KAAK,IAAKD,MAAM,CAACC,KAAK,EAAEI,OAAO,CAAC,CAAC;MACvD,CAAC,GAAGR,eAAe,EAAE,GAAGC,qBAAqB,CAAC,CAACZ,OAAO,CAAEe,KAAK,IAAKD,MAAM,CAACC,KAAK,EAAEM,GAAG,CAAC,CAAC;IACvF,CAAC,CAAC;EACJ,CAAC,CACH,CAAC;EACD,MAAMC,SAAS,GAAG,IAAAC,gBAAM,EAACvD,KAAK,EAAE,IAAI,CAAC;EACrC,MAAMwD,OAAO,GAAG,IAAI3D,OAAO,CAACyD,SAAS,EAAErD,KAAK,CAAC;EAE7C,OAAOuD,OAAO;AAChB"}
+{"version":3,"names":["_graph","data","require","_lodash","_traverseVersions","_dependency","IdGraph","Graph","constructor","nodes","edges","exports","objectListToGraph","objectList","bitObjectsList","toBitObjects","bitObjectListToGraph","exportMetadata","getExportMetadata","components","getComponents","versions","getVersions","Promise","all","map","component","compFromMetadata","exportVersions","find","c","id","isEqualWithoutVersion","toComponentId","startFrom","head","versionsInfo","getAllVersionsInfo","modelComponent","versionObjects","throws","forEach","versionInfo","changeVersion","tag","ref","toString","idStr","push","Node","version","dependencies","devDependencies","peerDependencies","extensionDependencies","depsIdsGroupedByType","addDep","depId","edge","depIdStr","Edge","runTime","Dependency","dev","peer","uniqNodes","uniqBy","idGraph"],"sources":["object-list-to-graph.ts"],"sourcesContent":["import { Graph, Node, Edge } from '@teambit/graph.cleargraph';\nimport { uniqBy } from 'lodash';\nimport { ComponentID } from '@teambit/component-id';\nimport type { ObjectList } from '@teambit/legacy/dist/scope/objects/object-list';\nimport { BitObjectList } from '@teambit/legacy/dist/scope/objects/bit-object-list';\nimport { getAllVersionsInfo } from '@teambit/legacy/dist/scope/component-ops/traverse-versions';\nimport { Dependency } from './model/dependency';\n\ntype BitIdNode = Node<ComponentID>;\ntype DependencyEdge = Edge<Dependency>;\n\nexport class IdGraph extends Graph<ComponentID, Dependency> {\n  constructor(nodes: BitIdNode[] = [], edges: DependencyEdge[] = []) {\n    super(nodes, edges);\n  }\n}\n\nexport async function objectListToGraph(objectList: ObjectList): Promise<IdGraph> {\n  const bitObjectsList = await objectList.toBitObjects();\n\n  return bitObjectListToGraph(bitObjectsList);\n}\n\nexport async function bitObjectListToGraph(bitObjectsList: BitObjectList): Promise<IdGraph> {\n  const exportMetadata = bitObjectsList.getExportMetadata();\n  const components = bitObjectsList.getComponents();\n  const versions = bitObjectsList.getVersions();\n  const nodes: BitIdNode[] = [];\n  const edges: DependencyEdge[] = [];\n  await Promise.all(\n    components.map(async (component) => {\n      const compFromMetadata = exportMetadata?.exportVersions.find((c) =>\n        c.id.isEqualWithoutVersion(component.toComponentId())\n      );\n      const startFrom = compFromMetadata?.head;\n      const versionsInfo = await getAllVersionsInfo({\n        modelComponent: component,\n        versionObjects: versions,\n        startFrom,\n        throws: false,\n      });\n      versionsInfo.forEach((versionInfo) => {\n        const id = component.toComponentId().changeVersion(versionInfo.tag || versionInfo.ref.toString());\n        const idStr = id.toString();\n        nodes.push(new Node(idStr, id));\n        if (!versionInfo.version) {\n          return;\n        }\n        const { dependencies, devDependencies, peerDependencies, extensionDependencies } =\n          versionInfo.version.depsIdsGroupedByType;\n        const addDep = (depId: ComponentID, edge: Dependency) => {\n          const depIdStr = depId.toString();\n          nodes.push(new Node(depIdStr, depId));\n          edges.push(new Edge(idStr, depIdStr, edge));\n        };\n        const runTime = new Dependency('runtime');\n        const dev = new Dependency('dev');\n        const peer = new Dependency('peer');\n        dependencies.forEach((depId) => addDep(depId, runTime));\n        [...devDependencies, ...extensionDependencies].forEach((depId) => addDep(depId, dev));\n        peerDependencies.forEach((depId) => addDep(depId, peer));\n      });\n    })\n  );\n  const uniqNodes = uniqBy(nodes, 'id');\n  const idGraph = new IdGraph(uniqNodes, edges);\n\n  return idGraph;\n}\n"],"mappings":";;;;;;;;AAAA,SAAAA,OAAA;EAAA,MAAAC,IAAA,GAAAC,OAAA;EAAAF,MAAA,YAAAA,CAAA;IAAA,OAAAC,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAE,QAAA;EAAA,MAAAF,IAAA,GAAAC,OAAA;EAAAC,OAAA,YAAAA,CAAA;IAAA,OAAAF,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAIA,SAAAG,kBAAA;EAAA,MAAAH,IAAA,GAAAC,OAAA;EAAAE,iBAAA,YAAAA,CAAA;IAAA,OAAAH,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AACA,SAAAI,YAAA;EAAA,MAAAJ,IAAA,GAAAC,OAAA;EAAAG,WAAA,YAAAA,CAAA;IAAA,OAAAJ,IAAA;EAAA;EAAA,OAAAA,IAAA;AAAA;AAKO,MAAMK,OAAO,SAASC,cAAK,CAA0B;EAC1DC,WAAWA,CAACC,KAAkB,GAAG,EAAE,EAAEC,KAAuB,GAAG,EAAE,EAAE;IACjE,KAAK,CAACD,KAAK,EAAEC,KAAK,CAAC;EACrB;AACF;AAACC,OAAA,CAAAL,OAAA,GAAAA,OAAA;AAEM,eAAeM,iBAAiBA,CAACC,UAAsB,EAAoB;EAChF,MAAMC,cAAc,GAAG,MAAMD,UAAU,CAACE,YAAY,CAAC,CAAC;EAEtD,OAAOC,oBAAoB,CAACF,cAAc,CAAC;AAC7C;AAEO,eAAeE,oBAAoBA,CAACF,cAA6B,EAAoB;EAC1F,MAAMG,cAAc,GAAGH,cAAc,CAACI,iBAAiB,CAAC,CAAC;EACzD,MAAMC,UAAU,GAAGL,cAAc,CAACM,aAAa,CAAC,CAAC;EACjD,MAAMC,QAAQ,GAAGP,cAAc,CAACQ,WAAW,CAAC,CAAC;EAC7C,MAAMb,KAAkB,GAAG,EAAE;EAC7B,MAAMC,KAAuB,GAAG,EAAE;EAClC,MAAMa,OAAO,CAACC,GAAG,CACfL,UAAU,CAACM,GAAG,CAAC,MAAOC,SAAS,IAAK;IAClC,MAAMC,gBAAgB,GAAGV,cAAc,EAAEW,cAAc,CAACC,IAAI,CAAEC,CAAC,IAC7DA,CAAC,CAACC,EAAE,CAACC,qBAAqB,CAACN,SAAS,CAACO,aAAa,CAAC,CAAC,CACtD,CAAC;IACD,MAAMC,SAAS,GAAGP,gBAAgB,EAAEQ,IAAI;IACxC,MAAMC,YAAY,GAAG,MAAM,IAAAC,sCAAkB,EAAC;MAC5CC,cAAc,EAAEZ,SAAS;MACzBa,cAAc,EAAElB,QAAQ;MACxBa,SAAS;MACTM,MAAM,EAAE;IACV,CAAC,CAAC;IACFJ,YAAY,CAACK,OAAO,CAAEC,WAAW,IAAK;MACpC,MAAMX,EAAE,GAAGL,SAAS,CAACO,aAAa,CAAC,CAAC,CAACU,aAAa,CAACD,WAAW,CAACE,GAAG,IAAIF,WAAW,CAACG,GAAG,CAACC,QAAQ,CAAC,CAAC,CAAC;MACjG,MAAMC,KAAK,GAAGhB,EAAE,CAACe,QAAQ,CAAC,CAAC;MAC3BrC,KAAK,CAACuC,IAAI,CAAC,KAAIC,aAAI,EAACF,KAAK,EAAEhB,EAAE,CAAC,CAAC;MAC/B,IAAI,CAACW,WAAW,CAACQ,OAAO,EAAE;QACxB;MACF;MACA,MAAM;QAAEC,YAAY;QAAEC,eAAe;QAAEC,gBAAgB;QAAEC;MAAsB,CAAC,GAC9EZ,WAAW,CAACQ,OAAO,CAACK,oBAAoB;MAC1C,MAAMC,MAAM,GAAGA,CAACC,KAAkB,EAAEC,IAAgB,KAAK;QACvD,MAAMC,QAAQ,GAAGF,KAAK,CAACX,QAAQ,CAAC,CAAC;QACjCrC,KAAK,CAACuC,IAAI,CAAC,KAAIC,aAAI,EAACU,QAAQ,EAAEF,KAAK,CAAC,CAAC;QACrC/C,KAAK,CAACsC,IAAI,CAAC,KAAIY,aAAI,EAACb,KAAK,EAAEY,QAAQ,EAAED,IAAI,CAAC,CAAC;MAC7C,CAAC;MACD,MAAMG,OAAO,GAAG,KAAIC,wBAAU,EAAC,SAAS,CAAC;MACzC,MAAMC,GAAG,GAAG,KAAID,wBAAU,EAAC,KAAK,CAAC;MACjC,MAAME,IAAI,GAAG,KAAIF,wBAAU,EAAC,MAAM,CAAC;MACnCX,YAAY,CAACV,OAAO,CAAEgB,KAAK,IAAKD,MAAM,CAACC,KAAK,EAAEI,OAAO,CAAC,CAAC;MACvD,CAAC,GAAGT,eAAe,EAAE,GAAGE,qBAAqB,CAAC,CAACb,OAAO,CAAEgB,KAAK,IAAKD,MAAM,CAACC,KAAK,EAAEM,GAAG,CAAC,CAAC;MACrFV,gBAAgB,CAACZ,OAAO,CAAEgB,KAAK,IAAKD,MAAM,CAACC,KAAK,EAAEO,IAAI,CAAC,CAAC;IAC1D,CAAC,CAAC;EACJ,CAAC,CACH,CAAC;EACD,MAAMC,SAAS,GAAG,IAAAC,gBAAM,EAACzD,KAAK,EAAE,IAAI,CAAC;EACrC,MAAM0D,OAAO,GAAG,IAAI7D,OAAO,CAAC2D,SAAS,EAAEvD,KAAK,CAAC;EAE7C,OAAOyD,OAAO;AAChB"}

package/dist/preview-1708958940676.js

@@ -0,0 +1,7 @@
+import * as compositions_0 from '/Users/giladshoham/Library/Caches/Bit/capsules/root/95c2f3515392701f327019ce43202e7563a02128/teambit.component_graph@1.0.174/dist/graph.composition.js';
+import * as overview_0 from '/Users/giladshoham/Library/Caches/Bit/capsules/root/95c2f3515392701f327019ce43202e7563a02128/teambit.component_graph@1.0.174/dist/graph.docs.md';
+
+export const compositions = [compositions_0];
+export const overview = [overview_0];
+
+export const compositions_metadata = {"compositions":[{"displayName":"Logo","identifier":"Logo"}]};

package/package.json

@@ -1,12 +1,12 @@
 {
   "name": "@teambit/graph",
-  "version": "1.0.173",
+  "version": "1.0.174",
   "homepage": "https://bit.cloud/teambit/component/graph",
   "main": "dist/index.js",
   "componentId": {
     "scope": "teambit.component",
     "name": "graph",
-    "version": "1.0.173"
+    "version": "1.0.174"
   },
   "dependencies": {
     "graphlib": "2.1.8",
@@ -21,27 +21,27 @@
     "@teambit/graph.cleargraph": "0.0.8",
     "@teambit/harmony": "0.4.6",
     "@teambit/component.ui.component-compare.models.component-compare-change-type": "0.0.7",
-    "@teambit/base-ui.surfaces.card": "1.0.1",
-    "@teambit/evangelist.input.checkbox.label": "1.0.3",
-    "@teambit/design.ui.pages.not-found": "0.0.366",
-    "@teambit/design.ui.pages.server-error": "0.0.366",
-    "@teambit/documenter.ui.heading": "4.1.1",
-    "@teambit/ui-foundation.ui.full-loader": "0.0.500",
     "@teambit/base-ui.routing.nav-link": "1.0.0",
+    "@teambit/base-ui.surfaces.card": "1.0.1",
     "@teambit/base-ui.text.muted-text": "1.0.1",
     "@teambit/component.ui.deprecation-icon": "0.0.509",
     "@teambit/design.ui.styles.ellipsis": "0.0.357",
     "@teambit/design.ui.round-loader": "0.0.355",
     "@teambit/component.ui.component-compare.status-resolver": "0.0.9",
+    "@teambit/evangelist.input.checkbox.label": "1.0.3",
+    "@teambit/design.ui.pages.not-found": "0.0.366",
+    "@teambit/design.ui.pages.server-error": "0.0.366",
+    "@teambit/documenter.ui.heading": "4.1.1",
+    "@teambit/ui-foundation.ui.full-loader": "0.0.500",
     "@teambit/ui-foundation.ui.hooks.use-data-query": "0.0.505",
     "@teambit/ui-foundation.ui.react-router.use-query": "0.0.501",
-    "@teambit/component": "1.0.173",
+    "@teambit/component": "1.0.174",
     "@teambit/cli": "0.0.851",
     "@teambit/component.ui.component-compare.models.component-compare-props": "0.0.103",
-    "@teambit/graphql": "1.0.173",
+    "@teambit/graphql": "1.0.174",
     "@teambit/logger": "0.0.944",
-    "@teambit/component-compare": "1.0.173",
-    "@teambit/ui": "1.0.173",
+    "@teambit/component-compare": "1.0.174",
+    "@teambit/ui": "1.0.174",
     "@teambit/component.modules.component-url": "0.0.167",
     "@teambit/envs.ui.env-icon": "0.0.505",
     "@teambit/component.ui.component-compare.context": "0.0.118"

package/dist/preview-1708466611462.js

@@ -1,7 +0,0 @@
-import * as compositions_0 from '/home/circleci/Library/Caches/Bit/capsules/8891be5ad3d35bfc38b9cd90c0e05b598a5a55af/teambit.component_graph@1.0.173/dist/graph.composition.js';
-import * as overview_0 from '/home/circleci/Library/Caches/Bit/capsules/8891be5ad3d35bfc38b9cd90c0e05b598a5a55af/teambit.component_graph@1.0.173/dist/graph.docs.md';
-
-export const compositions = [compositions_0];
-export const overview = [overview_0];
-
-export const compositions_metadata = {"compositions":[{"displayName":"Logo","identifier":"Logo"}]};