@teambit/graph 1.0.234 → 1.0.237

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.234" tests="0" failures="0" errors="0" skipped="0"/>
+  <testsuite name="teambit.component/graph@1.0.237" 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={30480:(e,t,o)=>{var r={id:"teambit.component/graph@1.0.234",homepage:"https://bit.cloud/teambit/component/graph",exported:!0};function n(){const e=i(o(41594));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},41594: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(30480);o(41594);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={80515:(e,t,o)=>{var r={id:"teambit.component/graph@1.0.237",homepage:"https://bit.cloud/teambit/component/graph",exported:!0};function n(){const e=i(o(41594));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},41594: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(80515);o(41594);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

@@ -503,7 +503,7 @@
                 "_legacy": {
                   "scope": "teambit.component",
                   "name": "graph",
-                  "version": "1.0.234"
+                  "version": "1.0.237"
                 },
                 "_scope": "teambit.component"
               }
@@ -2427,7 +2427,7 @@
             "__schema": "FunctionLikeSchema",
             "location": {
               "filePath": "component-id-graph.ts",
-              "line": 165,
+              "line": 167,
               "character": 3
             },
             "signature": "(method) ComponentIdGraph.buildFromCleargraph(graph: Graph<ComponentID, DepEdgeType>): ComponentIdGraph",
@@ -2437,7 +2437,7 @@
                 "__schema": "ParameterSchema",
                 "location": {
                   "filePath": "component-id-graph.ts",
-                  "line": 165,
+                  "line": 167,
                   "character": 23
                 },
                 "name": "graph",
@@ -2445,7 +2445,7 @@
                   "__schema": "TypeRefSchema",
                   "location": {
                     "filePath": "component-id-graph.ts",
-                    "line": 165,
+                    "line": 167,
                     "character": 30
                   },
                   "name": "Graph",
@@ -2459,7 +2459,7 @@
                       "__schema": "TypeRefSchema",
                       "location": {
                         "filePath": "component-id-graph.ts",
-                        "line": 165,
+                        "line": 167,
                         "character": 36
                       },
                       "name": "ComponentID",
@@ -2473,7 +2473,7 @@
                       "__schema": "TypeRefSchema",
                       "location": {
                         "filePath": "component-id-graph.ts",
-                        "line": 165,
+                        "line": 167,
                         "character": 49
                       },
                       "name": "DepEdgeType"
@@ -2488,7 +2488,7 @@
               "__schema": "TypeRefSchema",
               "location": {
                 "filePath": "component-id-graph.ts",
-                "line": 165,
+                "line": 167,
                 "character": 3
               },
               "name": "ComponentIdGraph"
@@ -2499,7 +2499,7 @@
             "__schema": "FunctionLikeSchema",
             "location": {
               "filePath": "component-id-graph.ts",
-              "line": 169,
+              "line": 171,
               "character": 3
             },
             "signature": "(method) ComponentIdGraph.runtimeOnly(componentIds: string[]): this",
@@ -2509,7 +2509,7 @@
                 "__schema": "ParameterSchema",
                 "location": {
                   "filePath": "component-id-graph.ts",
-                  "line": 169,
+                  "line": 171,
                   "character": 15
                 },
                 "name": "componentIds",
@@ -2517,14 +2517,14 @@
                   "__schema": "TypeArraySchema",
                   "location": {
                     "filePath": "component-id-graph.ts",
-                    "line": 169,
+                    "line": 171,
                     "character": 29
                   },
                   "type": {
                     "__schema": "KeywordTypeSchema",
                     "location": {
                       "filePath": "component-id-graph.ts",
-                      "line": 169,
+                      "line": 171,
                       "character": 29
                     },
                     "name": "string"
@@ -2538,7 +2538,7 @@
               "__schema": "TypeRefSchema",
               "location": {
                 "filePath": "component-id-graph.ts",
-                "line": 169,
+                "line": 171,
                 "character": 3
               },
               "name": "ComponentIdGraph"
@@ -2549,7 +2549,7 @@
             "__schema": "FunctionLikeSchema",
             "location": {
               "filePath": "component-id-graph.ts",
-              "line": 175,
+              "line": 177,
               "character": 3
             },
             "signature": "(method) ComponentIdGraph.getDependenciesInfo(id: ComponentID): DependenciesInfo[]",
@@ -2559,7 +2559,7 @@
                 "__schema": "ParameterSchema",
                 "location": {
                   "filePath": "component-id-graph.ts",
-                  "line": 175,
+                  "line": 177,
                   "character": 23
                 },
                 "name": "id",
@@ -2567,7 +2567,7 @@
                   "__schema": "TypeRefSchema",
                   "location": {
                     "filePath": "component-id-graph.ts",
-                    "line": 175,
+                    "line": 177,
                     "character": 27
                   },
                   "name": "ComponentID",
@@ -2585,14 +2585,14 @@
               "__schema": "TypeArraySchema",
               "location": {
                 "filePath": "component-id-graph.ts",
-                "line": 175,
+                "line": 177,
                 "character": 41
               },
               "type": {
                 "__schema": "TypeRefSchema",
                 "location": {
                   "filePath": "component-id-graph.ts",
-                  "line": 175,
+                  "line": 177,
                   "character": 41
                 },
                 "name": "DependenciesInfo",
@@ -2605,7 +2605,7 @@
             "__schema": "FunctionLikeSchema",
             "location": {
               "filePath": "component-id-graph.ts",
-              "line": 199,
+              "line": 201,
               "character": 3
             },
             "signature": "(method) ComponentIdGraph.getDependenciesAsObjectTree(idStr: string): Record<string, any>",
@@ -2615,7 +2615,7 @@
                 "__schema": "ParameterSchema",
                 "location": {
                   "filePath": "component-id-graph.ts",
-                  "line": 199,
+                  "line": 201,
                   "character": 31
                 },
                 "name": "idStr",
@@ -2623,7 +2623,7 @@
                   "__schema": "KeywordTypeSchema",
                   "location": {
                     "filePath": "component-id-graph.ts",
-                    "line": 199,
+                    "line": 201,
                     "character": 38
                   },
                   "name": "string"
@@ -2636,7 +2636,7 @@
               "__schema": "TypeRefSchema",
               "location": {
                 "filePath": "component-id-graph.ts",
-                "line": 199,
+                "line": 201,
                 "character": 47
               },
               "name": "Record",
@@ -2645,7 +2645,7 @@
                   "__schema": "KeywordTypeSchema",
                   "location": {
                     "filePath": "component-id-graph.ts",
-                    "line": 199,
+                    "line": 201,
                     "character": 54
                   },
                   "name": "string"
@@ -2654,7 +2654,7 @@
                   "__schema": "KeywordTypeSchema",
                   "location": {
                     "filePath": "component-id-graph.ts",
-                    "line": 199,
+                    "line": 201,
                     "character": 62
                   },
                   "name": "any"
@@ -2710,7 +2710,7 @@
                 "_legacy": {
                   "scope": "teambit.component",
                   "name": "graph",
-                  "version": "1.0.234"
+                  "version": "1.0.237"
                 },
                 "_scope": "teambit.component"
               }
@@ -3215,7 +3215,7 @@
                 "_legacy": {
                   "scope": "teambit.component",
                   "name": "graph",
-                  "version": "1.0.234"
+                  "version": "1.0.237"
                 },
                 "_scope": "teambit.component"
               }
@@ -3322,7 +3322,7 @@
                 "_legacy": {
                   "scope": "teambit.component",
                   "name": "graph",
-                  "version": "1.0.234"
+                  "version": "1.0.237"
                 },
                 "_scope": "teambit.component"
               }
@@ -4774,7 +4774,7 @@
                   "_legacy": {
                     "scope": "teambit.component",
                     "name": "graph",
-                    "version": "1.0.234"
+                    "version": "1.0.237"
                   },
                   "_scope": "teambit.component"
                 }
@@ -6909,7 +6909,7 @@
               "__schema": "FunctionLikeSchema",
               "location": {
                 "filePath": "component-id-graph.ts",
-                "line": 165,
+                "line": 167,
                 "character": 3
               },
               "signature": "(method) ComponentIdGraph.buildFromCleargraph(graph: Graph<ComponentID, DepEdgeType>): ComponentIdGraph",
@@ -6919,7 +6919,7 @@
                   "__schema": "ParameterSchema",
                   "location": {
                     "filePath": "component-id-graph.ts",
-                    "line": 165,
+                    "line": 167,
                     "character": 23
                   },
                   "name": "graph",
@@ -6927,7 +6927,7 @@
                     "__schema": "TypeRefSchema",
                     "location": {
                       "filePath": "component-id-graph.ts",
-                      "line": 165,
+                      "line": 167,
                       "character": 30
                     },
                     "name": "Graph",
@@ -6941,7 +6941,7 @@
                         "__schema": "TypeRefSchema",
                         "location": {
                           "filePath": "component-id-graph.ts",
-                          "line": 165,
+                          "line": 167,
                           "character": 36
                         },
                         "name": "ComponentID",
@@ -6955,7 +6955,7 @@
                         "__schema": "TypeRefSchema",
                         "location": {
                           "filePath": "component-id-graph.ts",
-                          "line": 165,
+                          "line": 167,
                           "character": 49
                         },
                         "name": "DepEdgeType"
@@ -6970,7 +6970,7 @@
                 "__schema": "TypeRefSchema",
                 "location": {
                   "filePath": "component-id-graph.ts",
-                  "line": 165,
+                  "line": 167,
                   "character": 3
                 },
                 "name": "ComponentIdGraph"
@@ -6981,7 +6981,7 @@
               "__schema": "FunctionLikeSchema",
               "location": {
                 "filePath": "component-id-graph.ts",
-                "line": 169,
+                "line": 171,
                 "character": 3
               },
               "signature": "(method) ComponentIdGraph.runtimeOnly(componentIds: string[]): this",
@@ -6991,7 +6991,7 @@
                   "__schema": "ParameterSchema",
                   "location": {
                     "filePath": "component-id-graph.ts",
-                    "line": 169,
+                    "line": 171,
                     "character": 15
                   },
                   "name": "componentIds",
@@ -6999,14 +6999,14 @@
                     "__schema": "TypeArraySchema",
                     "location": {
                       "filePath": "component-id-graph.ts",
-                      "line": 169,
+                      "line": 171,
                       "character": 29
                     },
                     "type": {
                       "__schema": "KeywordTypeSchema",
                       "location": {
                         "filePath": "component-id-graph.ts",
-                        "line": 169,
+                        "line": 171,
                         "character": 29
                       },
                       "name": "string"
@@ -7020,7 +7020,7 @@
                 "__schema": "TypeRefSchema",
                 "location": {
                   "filePath": "component-id-graph.ts",
-                  "line": 169,
+                  "line": 171,
                   "character": 3
                 },
                 "name": "ComponentIdGraph"
@@ -7031,7 +7031,7 @@
               "__schema": "FunctionLikeSchema",
               "location": {
                 "filePath": "component-id-graph.ts",
-                "line": 175,
+                "line": 177,
                 "character": 3
               },
               "signature": "(method) ComponentIdGraph.getDependenciesInfo(id: ComponentID): DependenciesInfo[]",
@@ -7041,7 +7041,7 @@
                   "__schema": "ParameterSchema",
                   "location": {
                     "filePath": "component-id-graph.ts",
-                    "line": 175,
+                    "line": 177,
                     "character": 23
                   },
                   "name": "id",
@@ -7049,7 +7049,7 @@
                     "__schema": "TypeRefSchema",
                     "location": {
                       "filePath": "component-id-graph.ts",
-                      "line": 175,
+                      "line": 177,
                       "character": 27
                     },
                     "name": "ComponentID",
@@ -7067,14 +7067,14 @@
                 "__schema": "TypeArraySchema",
                 "location": {
                   "filePath": "component-id-graph.ts",
-                  "line": 175,
+                  "line": 177,
                   "character": 41
                 },
                 "type": {
                   "__schema": "TypeRefSchema",
                   "location": {
                     "filePath": "component-id-graph.ts",
-                    "line": 175,
+                    "line": 177,
                     "character": 41
                   },
                   "name": "DependenciesInfo",
@@ -7087,7 +7087,7 @@
               "__schema": "FunctionLikeSchema",
               "location": {
                 "filePath": "component-id-graph.ts",
-                "line": 199,
+                "line": 201,
                 "character": 3
               },
               "signature": "(method) ComponentIdGraph.getDependenciesAsObjectTree(idStr: string): Record<string, any>",
@@ -7097,7 +7097,7 @@
                   "__schema": "ParameterSchema",
                   "location": {
                     "filePath": "component-id-graph.ts",
-                    "line": 199,
+                    "line": 201,
                     "character": 31
                   },
                   "name": "idStr",
@@ -7105,7 +7105,7 @@
                     "__schema": "KeywordTypeSchema",
                     "location": {
                       "filePath": "component-id-graph.ts",
-                      "line": 199,
+                      "line": 201,
                       "character": 38
                     },
                     "name": "string"
@@ -7118,7 +7118,7 @@
                 "__schema": "TypeRefSchema",
                 "location": {
                   "filePath": "component-id-graph.ts",
-                  "line": 199,
+                  "line": 201,
                   "character": 47
                 },
                 "name": "Record",
@@ -7127,7 +7127,7 @@
                     "__schema": "KeywordTypeSchema",
                     "location": {
                       "filePath": "component-id-graph.ts",
-                      "line": 199,
+                      "line": 201,
                       "character": 54
                     },
                     "name": "string"
@@ -7136,7 +7136,7 @@
                     "__schema": "KeywordTypeSchema",
                     "location": {
                       "filePath": "component-id-graph.ts",
-                      "line": 199,
+                      "line": 201,
                       "character": 62
                     },
                     "name": "any"
@@ -7192,7 +7192,7 @@
                   "_legacy": {
                     "scope": "teambit.component",
                     "name": "graph",
-                    "version": "1.0.234"
+                    "version": "1.0.237"
                   },
                   "_scope": "teambit.component"
                 }
@@ -7805,7 +7805,7 @@
                   "_legacy": {
                     "scope": "teambit.component",
                     "name": "graph",
-                    "version": "1.0.234"
+                    "version": "1.0.237"
                   },
                   "_scope": "teambit.component"
                 }
@@ -7967,7 +7967,7 @@
                   "_legacy": {
                     "scope": "teambit.component",
                     "name": "graph",
-                    "version": "1.0.234"
+                    "version": "1.0.237"
                   },
                   "_scope": "teambit.component"
                 }
@@ -9624,7 +9624,7 @@
   "componentId": {
     "scope": "teambit.component",
     "name": "graph",
-    "version": "1.0.234"
+    "version": "1.0.237"
   },
   "taggedModuleExports": []
 }

package/dist/component-id-graph.js

@@ -173,6 +173,8 @@ class ComponentIdGraph extends _graph().Graph {
    */
   findCycles(graph, includeDeps = false) {
     const cycles = super.findCycles(graph);
+    // reverse the order to show a more intuitive cycle order. from the dependent to the dependency.
+    cycles.forEach(cycle => cycle.reverse());
     if (!this.shouldLimitToSeedersOnly() || includeDeps) {
       return cycles;
     }

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","r","e","Symbol","toPrimitive","call","TypeError","String","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","findAllPathsBFS","start","end","paths","visited","Set","queue","path","shift","add","outEdges","successor","has","allPaths","filter","pathWithVer","pathWithoutVer","p","filtered","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\n    const findAllPathsBFS = (start: string[], end: string[]): string[][] => {\n      const paths: string[][] = [];\n      const visited = new Set<string>();\n      const queue: { node: string; path: string[] }[] = [];\n      start.forEach((s) => queue.push({ node: s, path: [s] }));\n      while (queue.length) {\n        const { node, path } = queue.shift()!;\n        if (end.includes(removeVerFromIdStr(node))) {\n          paths.push([...path]);\n        } else {\n          visited.add(node);\n          const successors = this.outEdges(node).map((e) => e.targetId);\n          for (const successor of successors) {\n            if (!visited.has(successor)) {\n              queue.push({ node: successor, path: [...path, successor] });\n            }\n          }\n        }\n      }\n      return paths;\n    };\n\n    const targetsStr = targets.map((t) => t.toStringWithoutVersion());\n    const sourcesStr = sources.map((s) => s.toString());\n\n    let allPaths = findAllPathsBFS(sourcesStr, targetsStr);\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 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,GAAAA,CAAA;AAAA,SAAAC,aAAAF,CAAA,EAAAG,CAAA,2BAAAH,CAAA,KAAAA,CAAA,SAAAA,CAAA,MAAAI,CAAA,GAAAJ,CAAA,CAAAK,MAAA,CAAAC,WAAA,kBAAAF,CAAA,QAAAH,CAAA,GAAAG,CAAA,CAAAG,IAAA,CAAAP,CAAA,EAAAG,CAAA,uCAAAF,CAAA,SAAAA,CAAA,YAAAO,SAAA,yEAAAL,CAAA,GAAAM,MAAA,GAAAC,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;IAEjE,MAAM+B,eAAe,GAAGA,CAACC,KAAe,EAAEC,GAAa,KAAiB;MACtE,MAAMC,KAAiB,GAAG,EAAE;MAC5B,MAAMC,OAAO,GAAG,IAAIC,GAAG,CAAS,CAAC;MACjC,MAAMC,KAAyC,GAAG,EAAE;MACpDL,KAAK,CAACjD,OAAO,CAAEoB,CAAC,IAAKkC,KAAK,CAAClB,IAAI,CAAC;QAAEnC,IAAI,EAAEmB,CAAC;QAAEmC,IAAI,EAAE,CAACnC,CAAC;MAAE,CAAC,CAAC,CAAC;MACxD,OAAOkC,KAAK,CAACd,MAAM,EAAE;QACnB,MAAM;UAAEvC,IAAI;UAAEsD;QAAK,CAAC,GAAGD,KAAK,CAACE,KAAK,CAAC,CAAE;QACrC,IAAIN,GAAG,CAAClB,QAAQ,CAACjB,kBAAkB,CAACd,IAAI,CAAC,CAAC,EAAE;UAC1CkD,KAAK,CAACf,IAAI,CAAC,CAAC,GAAGmB,IAAI,CAAC,CAAC;QACvB,CAAC,MAAM;UACLH,OAAO,CAACK,GAAG,CAACxD,IAAI,CAAC;UACjB,MAAMwB,UAAU,GAAG,IAAI,CAACiC,QAAQ,CAACzD,IAAI,CAAC,CAACkB,GAAG,CAAElC,CAAC,IAAKA,CAAC,CAACuB,QAAQ,CAAC;UAC7D,KAAK,MAAMmD,SAAS,IAAIlC,UAAU,EAAE;YAClC,IAAI,CAAC2B,OAAO,CAACQ,GAAG,CAACD,SAAS,CAAC,EAAE;cAC3BL,KAAK,CAAClB,IAAI,CAAC;gBAAEnC,IAAI,EAAE0D,SAAS;gBAAEJ,IAAI,EAAE,CAAC,GAAGA,IAAI,EAAEI,SAAS;cAAE,CAAC,CAAC;YAC7D;UACF;QACF;MACF;MACA,OAAOR,KAAK;IACd,CAAC;IAED,MAAM7B,UAAU,GAAGT,OAAO,CAACM,GAAG,CAAEtC,CAAC,IAAKA,CAAC,CAACwC,sBAAsB,CAAC,CAAC,CAAC;IACjE,MAAMH,UAAU,GAAGN,OAAO,CAACO,GAAG,CAAEC,CAAC,IAAKA,CAAC,CAAChB,QAAQ,CAAC,CAAC,CAAC;IAEnD,IAAIyD,QAAQ,GAAGb,eAAe,CAAC9B,UAAU,EAAEI,UAAU,CAAC;IAEtD,IAAIR,OAAO,EAAE0B,MAAM,EAAE;MACnBqB,QAAQ,GAAGA,QAAQ,CAACC,MAAM,CAAEC,WAAW,IAAK;QAC1C,MAAMC,cAAc,GAAGD,WAAW,CAAC5C,GAAG,CAAE8C,CAAC,IAAKlD,kBAAkB,CAACkD,CAAC,CAAC,CAAC;QACpE,OAAOnD,OAAO,CAACgC,KAAK,CAAEjE,CAAC,IAAKmF,cAAc,CAAChC,QAAQ,CAACnD,CAAC,CAACwC,sBAAsB,CAAC,CAAC,CAAC,CAAC;MAClF,CAAC,CAAC;IACJ;IAEA,MAAM6C,QAAQ,GAAGL,QAAQ,CAACC,MAAM,CAAEP,IAAI,IAAK;MACzC,IAAIA,IAAI,CAACf,MAAM,GAAG,CAAC,EAAE;QACnB;QACA;QACA,OAAO,KAAK;MACd;MACA,MAAM,GAAG2B,QAAQ,CAAC,GAAGZ,IAAI;MACzB,IAAIrC,UAAU,CAACc,QAAQ,CAACmC,QAAQ,CAAC,EAAE;QACjC;QACA;QACA,OAAO,IAAI;MACb;MACA,OAAO,IAAI;IACb,CAAC,CAAC;IAEF,OAAOD,QAAQ,CAACE,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAAC7B,MAAM,GAAG8B,CAAC,CAAC9B,MAAM,CAAC;EACrD;;EAEA;AACF;AACA;EACE+B,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,CAAC1D,GAAG,CAAEhB,EAAE,IAAKA,EAAE,CAACC,QAAQ,CAAC,CAAC,CAAC;IAC9D,MAAM0E,iBAAiB,GAAGJ,MAAM,CAACZ,MAAM,CAAEiB,KAAK,IAAK;MACjD,OAAOA,KAAK,CAACC,IAAI,CAAEC,UAAU,IAAKL,YAAY,CAAC5C,QAAQ,CAACiD,UAAU,CAAC,CAAC;IACtE,CAAC,CAAC;IACF,OAAOH,iBAAiB;EAC1B;EAEAI,mBAAmBA,CAACV,KAAsC,EAAoB;IAC5E,OAAO,IAAI,CAAC9D,MAAM,CAAC8D,KAAK,CAAC7E,KAAK,EAAE6E,KAAK,CAAC5E,KAAK,CAAC;EAC9C;EAEAuF,WAAWA,CAAC9C,YAAsB,EAAE;IAClC,OAAO,IAAI,CAAC+C,kBAAkB,CAAC/C,YAAY,EAAE;MAC3CgD,UAAU,EAAGhF,IAAoB,IAAKA,IAAI,CAACI,IAAI,KAAK;IACtD,CAAC,CAAC;EACJ;EAEA6E,mBAAmBA,CAACnF,EAAe,EAAsB;IACvD,MAAMoF,eAAe,GAAGxF,mBAAQ,CAACyF,GAAG,CAACC,QAAQ,CAAC,IAAI,CAAC5F,QAAQ,EAAEM,EAAE,CAACC,QAAQ,CAAC,CAAC,CAAC;IAC3E,MAAMsF,YAAgC,GAAG,EAAE;IAC3ClH,MAAM,CAACmH,IAAI,CAACJ,eAAe,CAAC,CAACvF,OAAO,CAAEgB,KAAK,IAAK;MAC9C,MAAM4E,QAAQ,GAAGL,eAAe,CAACvE,KAAK,CAAC,CAAC4E,QAAQ;MAChD,IAAIA,QAAQ,KAAKC,QAAQ,IAAID,QAAQ,KAAK,CAAC,EAAE;QAC3C;QACA;MACF;MACA,MAAME,WAAW,GAAGP,eAAe,CAACvE,KAAK,CAAC,CAAC8E,WAAW;MACtD,MAAMC,cAAc,GAAG,IAAI,CAAC1F,IAAI,CAACyF,WAAW,EAAE9E,KAAK,CAAC;MACpD0E,YAAY,CAACtD,IAAI,CAAC;QAChB;QACAjC,EAAE,EAAE,IAAI,CAACF,IAAI,CAACe,KAAK,CAAC,CAAEP,IAAI;QAC1BuF,KAAK,EAAEJ,QAAQ;QACfK,MAAM,EAAEH,WAAW;QACnB;QACAC,cAAc,EAAEA,cAAc,CAAEtF;MAClC,CAAC,CAAC;IACJ,CAAC,CAAC;IACFiF,YAAY,CAACtB,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAAC2B,KAAK,GAAG1B,CAAC,CAAC0B,KAAK,CAAC;IAC9C,OAAON,YAAY;EACrB;EAEAQ,2BAA2BA,CAAClF,KAAa,EAAuB;IAC9D,MAAMmF,QAAQ,GAAG,IAAI,CAACb,mBAAmB,CAACc,0BAAW,CAACC,UAAU,CAACrF,KAAK,CAAC,CAAC;IACxE,MAAMsF,iBAAiB,GAAGA,CAACnG,EAAU,EAAEoG,SAAuE,KAAK;MACjH,MAAMC,QAAQ,GAAGL,QAAQ,CAACrC,MAAM,CAAE2C,OAAO,IAAKA,OAAO,CAACR,MAAM,KAAK9F,EAAE,CAAC;MACpE,IAAI,CAACqG,QAAQ,IAAIA,QAAQ,CAAChE,MAAM,KAAK,CAAC,EAAE;QACtC;MACF;MACAgE,QAAQ,CAACxG,OAAO,CAAE0G,KAAK,IAAK;QAC1B,MAAM;UAAEvG,EAAE,EAAEwG;QAAO,CAAC,GAAGD,KAAK;QAC5B,MAAME,KAAK,GAAGD,MAAM,CAACvG,QAAQ,CAAC,CAAC;QAC/B,MAAMyG,YAAY,GAAG,EAAE;QACvBN,SAAS,CAACnE,IAAI,CAAC;UAAEwE,KAAK;UAAEjH,KAAK,EAAEkH;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,EAAE5F,KAAK;MAAErB,KAAK,EAAEkH;IAAa,CAAC;IAClDP,iBAAiB,CAACtF,KAAK,EAAE6F,YAAY,CAAC;IACtC,OAAOC,IAAI;EACb;EAEQnC,wBAAwBA,CAAA,EAAG;IACjC,OAAO,IAAI,CAACE,SAAS,CAACrC,MAAM;EAC9B;AACF;AAACuE,OAAA,CAAAvH,gBAAA,GAAAA,gBAAA","ignoreList":[]}
+{"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","r","e","Symbol","toPrimitive","call","TypeError","String","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","findAllPathsBFS","start","end","paths","visited","Set","queue","path","shift","add","outEdges","successor","has","allPaths","filter","pathWithVer","pathWithoutVer","p","filtered","firstDep","sort","a","b","findCycles","graph","includeDeps","cycles","cycle","reverse","shouldLimitToSeedersOnly","seederIdsStr","seederIds","cyclesWithSeeders","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\n    const findAllPathsBFS = (start: string[], end: string[]): string[][] => {\n      const paths: string[][] = [];\n      const visited = new Set<string>();\n      const queue: { node: string; path: string[] }[] = [];\n      start.forEach((s) => queue.push({ node: s, path: [s] }));\n      while (queue.length) {\n        const { node, path } = queue.shift()!;\n        if (end.includes(removeVerFromIdStr(node))) {\n          paths.push([...path]);\n        } else {\n          visited.add(node);\n          const successors = this.outEdges(node).map((e) => e.targetId);\n          for (const successor of successors) {\n            if (!visited.has(successor)) {\n              queue.push({ node: successor, path: [...path, successor] });\n            }\n          }\n        }\n      }\n      return paths;\n    };\n\n    const targetsStr = targets.map((t) => t.toStringWithoutVersion());\n    const sourcesStr = sources.map((s) => s.toString());\n\n    let allPaths = findAllPathsBFS(sourcesStr, targetsStr);\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 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    // reverse the order to show a more intuitive cycle order. from the dependent to the dependency.\n    cycles.forEach((cycle) => cycle.reverse());\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,GAAAA,CAAA;AAAA,SAAAC,aAAAF,CAAA,EAAAG,CAAA,2BAAAH,CAAA,KAAAA,CAAA,SAAAA,CAAA,MAAAI,CAAA,GAAAJ,CAAA,CAAAK,MAAA,CAAAC,WAAA,kBAAAF,CAAA,QAAAH,CAAA,GAAAG,CAAA,CAAAG,IAAA,CAAAP,CAAA,EAAAG,CAAA,uCAAAF,CAAA,SAAAA,CAAA,YAAAO,SAAA,yEAAAL,CAAA,GAAAM,MAAA,GAAAC,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;IAEjE,MAAM+B,eAAe,GAAGA,CAACC,KAAe,EAAEC,GAAa,KAAiB;MACtE,MAAMC,KAAiB,GAAG,EAAE;MAC5B,MAAMC,OAAO,GAAG,IAAIC,GAAG,CAAS,CAAC;MACjC,MAAMC,KAAyC,GAAG,EAAE;MACpDL,KAAK,CAACjD,OAAO,CAAEoB,CAAC,IAAKkC,KAAK,CAAClB,IAAI,CAAC;QAAEnC,IAAI,EAAEmB,CAAC;QAAEmC,IAAI,EAAE,CAACnC,CAAC;MAAE,CAAC,CAAC,CAAC;MACxD,OAAOkC,KAAK,CAACd,MAAM,EAAE;QACnB,MAAM;UAAEvC,IAAI;UAAEsD;QAAK,CAAC,GAAGD,KAAK,CAACE,KAAK,CAAC,CAAE;QACrC,IAAIN,GAAG,CAAClB,QAAQ,CAACjB,kBAAkB,CAACd,IAAI,CAAC,CAAC,EAAE;UAC1CkD,KAAK,CAACf,IAAI,CAAC,CAAC,GAAGmB,IAAI,CAAC,CAAC;QACvB,CAAC,MAAM;UACLH,OAAO,CAACK,GAAG,CAACxD,IAAI,CAAC;UACjB,MAAMwB,UAAU,GAAG,IAAI,CAACiC,QAAQ,CAACzD,IAAI,CAAC,CAACkB,GAAG,CAAElC,CAAC,IAAKA,CAAC,CAACuB,QAAQ,CAAC;UAC7D,KAAK,MAAMmD,SAAS,IAAIlC,UAAU,EAAE;YAClC,IAAI,CAAC2B,OAAO,CAACQ,GAAG,CAACD,SAAS,CAAC,EAAE;cAC3BL,KAAK,CAAClB,IAAI,CAAC;gBAAEnC,IAAI,EAAE0D,SAAS;gBAAEJ,IAAI,EAAE,CAAC,GAAGA,IAAI,EAAEI,SAAS;cAAE,CAAC,CAAC;YAC7D;UACF;QACF;MACF;MACA,OAAOR,KAAK;IACd,CAAC;IAED,MAAM7B,UAAU,GAAGT,OAAO,CAACM,GAAG,CAAEtC,CAAC,IAAKA,CAAC,CAACwC,sBAAsB,CAAC,CAAC,CAAC;IACjE,MAAMH,UAAU,GAAGN,OAAO,CAACO,GAAG,CAAEC,CAAC,IAAKA,CAAC,CAAChB,QAAQ,CAAC,CAAC,CAAC;IAEnD,IAAIyD,QAAQ,GAAGb,eAAe,CAAC9B,UAAU,EAAEI,UAAU,CAAC;IAEtD,IAAIR,OAAO,EAAE0B,MAAM,EAAE;MACnBqB,QAAQ,GAAGA,QAAQ,CAACC,MAAM,CAAEC,WAAW,IAAK;QAC1C,MAAMC,cAAc,GAAGD,WAAW,CAAC5C,GAAG,CAAE8C,CAAC,IAAKlD,kBAAkB,CAACkD,CAAC,CAAC,CAAC;QACpE,OAAOnD,OAAO,CAACgC,KAAK,CAAEjE,CAAC,IAAKmF,cAAc,CAAChC,QAAQ,CAACnD,CAAC,CAACwC,sBAAsB,CAAC,CAAC,CAAC,CAAC;MAClF,CAAC,CAAC;IACJ;IAEA,MAAM6C,QAAQ,GAAGL,QAAQ,CAACC,MAAM,CAAEP,IAAI,IAAK;MACzC,IAAIA,IAAI,CAACf,MAAM,GAAG,CAAC,EAAE;QACnB;QACA;QACA,OAAO,KAAK;MACd;MACA,MAAM,GAAG2B,QAAQ,CAAC,GAAGZ,IAAI;MACzB,IAAIrC,UAAU,CAACc,QAAQ,CAACmC,QAAQ,CAAC,EAAE;QACjC;QACA;QACA,OAAO,IAAI;MACb;MACA,OAAO,IAAI;IACb,CAAC,CAAC;IAEF,OAAOD,QAAQ,CAACE,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAAC7B,MAAM,GAAG8B,CAAC,CAAC9B,MAAM,CAAC;EACrD;;EAEA;AACF;AACA;EACE+B,UAAUA,CAACC,KAAY,EAAEC,WAAW,GAAG,KAAK,EAAc;IACxD,MAAMC,MAAM,GAAG,KAAK,CAACH,UAAU,CAACC,KAAK,CAAC;IACtC;IACAE,MAAM,CAAC1E,OAAO,CAAE2E,KAAK,IAAKA,KAAK,CAACC,OAAO,CAAC,CAAC,CAAC;IAC1C,IAAI,CAAC,IAAI,CAACC,wBAAwB,CAAC,CAAC,IAAIJ,WAAW,EAAE;MACnD,OAAOC,MAAM;IACf;IACA,MAAMI,YAAY,GAAG,IAAI,CAACC,SAAS,CAAC5D,GAAG,CAAEhB,EAAE,IAAKA,EAAE,CAACC,QAAQ,CAAC,CAAC,CAAC;IAC9D,MAAM4E,iBAAiB,GAAGN,MAAM,CAACZ,MAAM,CAAEa,KAAK,IAAK;MACjD,OAAOA,KAAK,CAACM,IAAI,CAAEC,UAAU,IAAKJ,YAAY,CAAC9C,QAAQ,CAACkD,UAAU,CAAC,CAAC;IACtE,CAAC,CAAC;IACF,OAAOF,iBAAiB;EAC1B;EAEAG,mBAAmBA,CAACX,KAAsC,EAAoB;IAC5E,OAAO,IAAI,CAAC9D,MAAM,CAAC8D,KAAK,CAAC7E,KAAK,EAAE6E,KAAK,CAAC5E,KAAK,CAAC;EAC9C;EAEAwF,WAAWA,CAAC/C,YAAsB,EAAE;IAClC,OAAO,IAAI,CAACgD,kBAAkB,CAAChD,YAAY,EAAE;MAC3CiD,UAAU,EAAGjF,IAAoB,IAAKA,IAAI,CAACI,IAAI,KAAK;IACtD,CAAC,CAAC;EACJ;EAEA8E,mBAAmBA,CAACpF,EAAe,EAAsB;IACvD,MAAMqF,eAAe,GAAGzF,mBAAQ,CAAC0F,GAAG,CAACC,QAAQ,CAAC,IAAI,CAAC7F,QAAQ,EAAEM,EAAE,CAACC,QAAQ,CAAC,CAAC,CAAC;IAC3E,MAAMuF,YAAgC,GAAG,EAAE;IAC3CnH,MAAM,CAACoH,IAAI,CAACJ,eAAe,CAAC,CAACxF,OAAO,CAAEgB,KAAK,IAAK;MAC9C,MAAM6E,QAAQ,GAAGL,eAAe,CAACxE,KAAK,CAAC,CAAC6E,QAAQ;MAChD,IAAIA,QAAQ,KAAKC,QAAQ,IAAID,QAAQ,KAAK,CAAC,EAAE;QAC3C;QACA;MACF;MACA,MAAME,WAAW,GAAGP,eAAe,CAACxE,KAAK,CAAC,CAAC+E,WAAW;MACtD,MAAMC,cAAc,GAAG,IAAI,CAAC3F,IAAI,CAAC0F,WAAW,EAAE/E,KAAK,CAAC;MACpD2E,YAAY,CAACvD,IAAI,CAAC;QAChB;QACAjC,EAAE,EAAE,IAAI,CAACF,IAAI,CAACe,KAAK,CAAC,CAAEP,IAAI;QAC1BwF,KAAK,EAAEJ,QAAQ;QACfK,MAAM,EAAEH,WAAW;QACnB;QACAC,cAAc,EAAEA,cAAc,CAAEvF;MAClC,CAAC,CAAC;IACJ,CAAC,CAAC;IACFkF,YAAY,CAACvB,IAAI,CAAC,CAACC,CAAC,EAAEC,CAAC,KAAKD,CAAC,CAAC4B,KAAK,GAAG3B,CAAC,CAAC2B,KAAK,CAAC;IAC9C,OAAON,YAAY;EACrB;EAEAQ,2BAA2BA,CAACnF,KAAa,EAAuB;IAC9D,MAAMoF,QAAQ,GAAG,IAAI,CAACb,mBAAmB,CAACc,0BAAW,CAACC,UAAU,CAACtF,KAAK,CAAC,CAAC;IACxE,MAAMuF,iBAAiB,GAAGA,CAACpG,EAAU,EAAEqG,SAAuE,KAAK;MACjH,MAAMC,QAAQ,GAAGL,QAAQ,CAACtC,MAAM,CAAE4C,OAAO,IAAKA,OAAO,CAACR,MAAM,KAAK/F,EAAE,CAAC;MACpE,IAAI,CAACsG,QAAQ,IAAIA,QAAQ,CAACjE,MAAM,KAAK,CAAC,EAAE;QACtC;MACF;MACAiE,QAAQ,CAACzG,OAAO,CAAE2G,KAAK,IAAK;QAC1B,MAAM;UAAExG,EAAE,EAAEyG;QAAO,CAAC,GAAGD,KAAK;QAC5B,MAAME,KAAK,GAAGD,MAAM,CAACxG,QAAQ,CAAC,CAAC;QAC/B,MAAM0G,YAAY,GAAG,EAAE;QACvBN,SAAS,CAACpE,IAAI,CAAC;UAAEyE,KAAK;UAAElH,KAAK,EAAEmH;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,EAAE7F,KAAK;MAAErB,KAAK,EAAEmH;IAAa,CAAC;IAClDP,iBAAiB,CAACvF,KAAK,EAAE8F,YAAY,CAAC;IACtC,OAAOC,IAAI;EACb;EAEQlC,wBAAwBA,CAAA,EAAG;IACjC,OAAO,IAAI,CAACE,SAAS,CAACvC,MAAM;EAC9B;AACF;AAACwE,OAAA,CAAAxH,gBAAA,GAAAA,gBAAA","ignoreList":[]}

package/dist/{preview-1713151252756.js → preview-1713191433000.js}

@@ -1,5 +1,5 @@
-import * as compositions_0 from '/home/circleci/Library/Caches/Bit/capsules/8891be5ad3d35bfc38b9cd90c0e05b598a5a55af/teambit.component_graph@1.0.234/dist/graph.composition.js';
-import * as overview_0 from '/home/circleci/Library/Caches/Bit/capsules/8891be5ad3d35bfc38b9cd90c0e05b598a5a55af/teambit.component_graph@1.0.234/dist/graph.docs.md';
+import * as compositions_0 from '/home/circleci/Library/Caches/Bit/capsules/8891be5ad3d35bfc38b9cd90c0e05b598a5a55af/teambit.component_graph@1.0.237/dist/graph.composition.js';
+import * as overview_0 from '/home/circleci/Library/Caches/Bit/capsules/8891be5ad3d35bfc38b9cd90c0e05b598a5a55af/teambit.component_graph@1.0.237/dist/graph.docs.md';
 
 export const compositions = [compositions_0];
 export const overview = [overview_0];

package/package.json

@@ -1,12 +1,12 @@
 {
   "name": "@teambit/graph",
-  "version": "1.0.234",
+  "version": "1.0.237",
   "homepage": "https://bit.cloud/teambit/component/graph",
   "main": "dist/index.js",
   "componentId": {
     "scope": "teambit.component",
     "name": "graph",
-    "version": "1.0.234"
+    "version": "1.0.237"
   },
   "dependencies": {
     "graphlib": "2.1.8",
@@ -35,14 +35,14 @@
     "@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.234",
+    "@teambit/component": "1.0.237",
     "@teambit/cli": "0.0.862",
     "@teambit/toolbox.string.random": "0.0.1",
     "@teambit/component.ui.component-compare.models.component-compare-props": "0.0.105",
-    "@teambit/graphql": "1.0.234",
+    "@teambit/graphql": "1.0.237",
     "@teambit/logger": "0.0.955",
-    "@teambit/component-compare": "1.0.234",
-    "@teambit/ui": "1.0.234",
+    "@teambit/component-compare": "1.0.237",
+    "@teambit/ui": "1.0.237",
     "@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"