@seed-ship/mcp-ui-solid 5.7.0 → 6.1.0

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/lodash.js

@@ -0,0 +1,76 @@
+import { commonjsRequire } from "../../../_virtual/_commonjs-dynamic-modules.js";
+import { __require as requireCloneDeep } from "../../lodash/cloneDeep.js";
+import { __require as requireConstant } from "../../lodash/constant.js";
+import { __require as requireDefaults } from "../../lodash/defaults.js";
+import { __require as requireEach } from "../../lodash/each.js";
+import { __require as requireFilter } from "../../lodash/filter.js";
+import { __require as requireFind } from "../../lodash/find.js";
+import { __require as requireFlatten } from "../../lodash/flatten.js";
+import { __require as requireForEach } from "../../lodash/forEach.js";
+import { __require as requireForIn } from "../../lodash/forIn.js";
+import { __require as requireHas } from "../../lodash/has.js";
+import { __require as requireIsUndefined } from "../../lodash/isUndefined.js";
+import { __require as requireLast } from "../../lodash/last.js";
+import { __require as requireMap } from "../../lodash/map.js";
+import { __require as requireMapValues } from "../../lodash/mapValues.js";
+import { __require as requireMax } from "../../lodash/max.js";
+import { __require as requireMerge } from "../../lodash/merge.js";
+import { __require as requireMin } from "../../lodash/min.js";
+import { __require as requireMinBy } from "../../lodash/minBy.js";
+import { __require as requireNow } from "../../lodash/now.js";
+import { __require as requirePick } from "../../lodash/pick.js";
+import { __require as requireRange } from "../../lodash/range.js";
+import { __require as requireReduce } from "../../lodash/reduce.js";
+import { __require as requireSortBy } from "../../lodash/sortBy.js";
+import { __require as requireUniqueId } from "../../lodash/uniqueId.js";
+import { __require as requireValues } from "../../lodash/values.js";
+import { __require as requireZipObject } from "../../lodash/zipObject.js";
+var lodash_1;
+var hasRequiredLodash;
+function requireLodash() {
+  if (hasRequiredLodash) return lodash_1;
+  hasRequiredLodash = 1;
+  var lodash;
+  if (typeof commonjsRequire === "function") {
+    try {
+      lodash = {
+        cloneDeep: requireCloneDeep(),
+        constant: requireConstant(),
+        defaults: requireDefaults(),
+        each: requireEach(),
+        filter: requireFilter(),
+        find: requireFind(),
+        flatten: requireFlatten(),
+        forEach: requireForEach(),
+        forIn: requireForIn(),
+        has: requireHas(),
+        isUndefined: requireIsUndefined(),
+        last: requireLast(),
+        map: requireMap(),
+        mapValues: requireMapValues(),
+        max: requireMax(),
+        merge: requireMerge(),
+        min: requireMin(),
+        minBy: requireMinBy(),
+        now: requireNow(),
+        pick: requirePick(),
+        range: requireRange(),
+        reduce: requireReduce(),
+        sortBy: requireSortBy(),
+        uniqueId: requireUniqueId(),
+        values: requireValues(),
+        zipObject: requireZipObject()
+      };
+    } catch (e) {
+    }
+  }
+  if (!lodash) {
+    lodash = window._;
+  }
+  lodash_1 = lodash;
+  return lodash_1;
+}
+export {
+  requireLodash as __require
+};
+//# sourceMappingURL=lodash.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/lodash.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lodash.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/lodash.js"],"sourcesContent":["import { commonjsRequire } from '../../../_virtual/_commonjs-dynamic-modules.js';\nimport { __require as requireCloneDeep } from '../../lodash/cloneDeep.js';\nimport { __require as requireConstant } from '../../lodash/constant.js';\nimport { __require as requireDefaults } from '../../lodash/defaults.js';\nimport { __require as requireEach } from '../../lodash/each.js';\nimport { __require as requireFilter } from '../../lodash/filter.js';\nimport { __require as requireFind } from '../../lodash/find.js';\nimport { __require as requireFlatten } from '../../lodash/flatten.js';\nimport { __require as requireForEach } from '../../lodash/forEach.js';\nimport { __require as requireForIn } from '../../lodash/forIn.js';\nimport { __require as requireHas } from '../../lodash/has.js';\nimport { __require as requireIsUndefined } from '../../lodash/isUndefined.js';\nimport { __require as requireLast } from '../../lodash/last.js';\nimport { __require as requireMap } from '../../lodash/map.js';\nimport { __require as requireMapValues } from '../../lodash/mapValues.js';\nimport { __require as requireMax } from '../../lodash/max.js';\nimport { __require as requireMerge } from '../../lodash/merge.js';\nimport { __require as requireMin } from '../../lodash/min.js';\nimport { __require as requireMinBy } from '../../lodash/minBy.js';\nimport { __require as requireNow } from '../../lodash/now.js';\nimport { __require as requirePick } from '../../lodash/pick.js';\nimport { __require as requireRange } from '../../lodash/range.js';\nimport { __require as requireReduce } from '../../lodash/reduce.js';\nimport { __require as requireSortBy } from '../../lodash/sortBy.js';\nimport { __require as requireUniqueId } from '../../lodash/uniqueId.js';\nimport { __require as requireValues } from '../../lodash/values.js';\nimport { __require as requireZipObject } from '../../lodash/zipObject.js';\n\n/* global window */\n\nvar lodash_1;\nvar hasRequiredLodash;\n\nfunction requireLodash () {\n\tif (hasRequiredLodash) return lodash_1;\n\thasRequiredLodash = 1;\n\tvar lodash;\n\n\tif (typeof commonjsRequire === \"function\") {\n\t  try {\n\t    lodash = {\n\t      cloneDeep: requireCloneDeep(),\n\t      constant: requireConstant(),\n\t      defaults: requireDefaults(),\n\t      each: requireEach(),\n\t      filter: requireFilter(),\n\t      find: requireFind(),\n\t      flatten: requireFlatten(),\n\t      forEach: requireForEach(),\n\t      forIn: requireForIn(),\n\t      has:  requireHas(),\n\t      isUndefined: requireIsUndefined(),\n\t      last: requireLast(),\n\t      map: requireMap(),\n\t      mapValues: requireMapValues(),\n\t      max: requireMax(),\n\t      merge: requireMerge(),\n\t      min: requireMin(),\n\t      minBy: requireMinBy(),\n\t      now: requireNow(),\n\t      pick: requirePick(),\n\t      range: requireRange(),\n\t      reduce: requireReduce(),\n\t      sortBy: requireSortBy(),\n\t      uniqueId: requireUniqueId(),\n\t      values: requireValues(),\n\t      zipObject: requireZipObject(),\n\t    };\n\t  } catch (e) {\n\t    // continue regardless of error\n\t  }\n\t}\n\n\tif (!lodash) {\n\t  lodash = window._;\n\t}\n\n\tlodash_1 = lodash;\n\treturn lodash_1;\n}\n\nexport { requireLodash as __require };\n//# sourceMappingURL=lodash.js.map\n"],"names":[],"mappings":";;;;;;;;;;;;;;;;;;;;;;;;;;;AA8BA,IAAI;AACJ,IAAI;AAEJ,SAAS,gBAAiB;AACzB,MAAI,kBAAmB,QAAO;AAC9B,sBAAoB;AACpB,MAAI;AAEJ,MAAI,OAAO,oBAAoB,YAAY;AACzC,QAAI;AACF,eAAS;AAAA,QACP,WAAW,iBAAgB;AAAA,QAC3B,UAAU,gBAAe;AAAA,QACzB,UAAU,gBAAe;AAAA,QACzB,MAAM,YAAW;AAAA,QACjB,QAAQ,cAAa;AAAA,QACrB,MAAM,YAAW;AAAA,QACjB,SAAS,eAAc;AAAA,QACvB,SAAS,eAAc;AAAA,QACvB,OAAO,aAAY;AAAA,QACnB,KAAM,WAAU;AAAA,QAChB,aAAa,mBAAkB;AAAA,QAC/B,MAAM,YAAW;AAAA,QACjB,KAAK,WAAU;AAAA,QACf,WAAW,iBAAgB;AAAA,QAC3B,KAAK,WAAU;AAAA,QACf,OAAO,aAAY;AAAA,QACnB,KAAK,WAAU;AAAA,QACf,OAAO,aAAY;AAAA,QACnB,KAAK,WAAU;AAAA,QACf,MAAM,YAAW;AAAA,QACjB,OAAO,aAAY;AAAA,QACnB,QAAQ,cAAa;AAAA,QACrB,QAAQ,cAAa;AAAA,QACrB,UAAU,gBAAe;AAAA,QACzB,QAAQ,cAAa;AAAA,QACrB,WAAW,iBAAgB;AAAA,MAClC;AAAA,IACG,SAAS,GAAG;AAAA,IAEZ;AAAA,EACF;AAEA,MAAI,CAAC,QAAQ;AACX,aAAS,OAAO;AAAA,EAClB;AAEA,aAAW;AACX,SAAO;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/nesting-graph.cjs

@@ -0,0 +1,103 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const lodash = require("./lodash.cjs");
+const util = require("./util.cjs");
+var nestingGraph;
+var hasRequiredNestingGraph;
+function requireNestingGraph() {
+  if (hasRequiredNestingGraph) return nestingGraph;
+  hasRequiredNestingGraph = 1;
+  var _ = lodash.__require();
+  var util$1 = util.__require();
+  nestingGraph = {
+    run,
+    cleanup
+  };
+  function run(g) {
+    var root = util$1.addDummyNode(g, "root", {}, "_root");
+    var depths = treeDepths(g);
+    var height = _.max(_.values(depths)) - 1;
+    var nodeSep = 2 * height + 1;
+    g.graph().nestingRoot = root;
+    _.forEach(g.edges(), function(e) {
+      g.edge(e).minlen *= nodeSep;
+    });
+    var weight = sumWeights(g) + 1;
+    _.forEach(g.children(), function(child) {
+      dfs(g, root, nodeSep, weight, height, depths, child);
+    });
+    g.graph().nodeRankFactor = nodeSep;
+  }
+  function dfs(g, root, nodeSep, weight, height, depths, v) {
+    var children = g.children(v);
+    if (!children.length) {
+      if (v !== root) {
+        g.setEdge(root, v, { weight: 0, minlen: nodeSep });
+      }
+      return;
+    }
+    var top = util$1.addBorderNode(g, "_bt");
+    var bottom = util$1.addBorderNode(g, "_bb");
+    var label = g.node(v);
+    g.setParent(top, v);
+    label.borderTop = top;
+    g.setParent(bottom, v);
+    label.borderBottom = bottom;
+    _.forEach(children, function(child) {
+      dfs(g, root, nodeSep, weight, height, depths, child);
+      var childNode = g.node(child);
+      var childTop = childNode.borderTop ? childNode.borderTop : child;
+      var childBottom = childNode.borderBottom ? childNode.borderBottom : child;
+      var thisWeight = childNode.borderTop ? weight : 2 * weight;
+      var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;
+      g.setEdge(top, childTop, {
+        weight: thisWeight,
+        minlen,
+        nestingEdge: true
+      });
+      g.setEdge(childBottom, bottom, {
+        weight: thisWeight,
+        minlen,
+        nestingEdge: true
+      });
+    });
+    if (!g.parent(v)) {
+      g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });
+    }
+  }
+  function treeDepths(g) {
+    var depths = {};
+    function dfs2(v, depth) {
+      var children = g.children(v);
+      if (children && children.length) {
+        _.forEach(children, function(child) {
+          dfs2(child, depth + 1);
+        });
+      }
+      depths[v] = depth;
+    }
+    _.forEach(g.children(), function(v) {
+      dfs2(v, 1);
+    });
+    return depths;
+  }
+  function sumWeights(g) {
+    return _.reduce(g.edges(), function(acc, e) {
+      return acc + g.edge(e).weight;
+    }, 0);
+  }
+  function cleanup(g) {
+    var graphLabel = g.graph();
+    g.removeNode(graphLabel.nestingRoot);
+    delete graphLabel.nestingRoot;
+    _.forEach(g.edges(), function(e) {
+      var edge = g.edge(e);
+      if (edge.nestingEdge) {
+        g.removeEdge(e);
+      }
+    });
+  }
+  return nestingGraph;
+}
+exports.__require = requireNestingGraph;
+//# sourceMappingURL=nesting-graph.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/nesting-graph.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"nesting-graph.cjs","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/nesting-graph.js"],"sourcesContent":["import { __require as requireLodash } from './lodash.js';\nimport { __require as requireUtil } from './util.js';\n\nvar nestingGraph;\nvar hasRequiredNestingGraph;\n\nfunction requireNestingGraph () {\n\tif (hasRequiredNestingGraph) return nestingGraph;\n\thasRequiredNestingGraph = 1;\n\tvar _ = requireLodash();\n\tvar util = requireUtil();\n\n\tnestingGraph = {\n\t  run: run,\n\t  cleanup: cleanup\n\t};\n\n\t/*\n\t * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n\t * adds appropriate edges to ensure that all cluster nodes are placed between\n\t * these boundries, and ensures that the graph is connected.\n\t *\n\t * In addition we ensure, through the use of the minlen property, that nodes\n\t * and subgraph border nodes to not end up on the same rank.\n\t *\n\t * Preconditions:\n\t *\n\t *    1. Input graph is a DAG\n\t *    2. Nodes in the input graph has a minlen attribute\n\t *\n\t * Postconditions:\n\t *\n\t *    1. Input graph is connected.\n\t *    2. Dummy nodes are added for the tops and bottoms of subgraphs.\n\t *    3. The minlen attribute for nodes is adjusted to ensure nodes do not\n\t *       get placed on the same rank as subgraph border nodes.\n\t *\n\t * The nesting graph idea comes from Sander, \"Layout of Compound Directed\n\t * Graphs.\"\n\t */\n\tfunction run(g) {\n\t  var root = util.addDummyNode(g, \"root\", {}, \"_root\");\n\t  var depths = treeDepths(g);\n\t  var height = _.max(_.values(depths)) - 1; // Note: depths is an Object not an array\n\t  var nodeSep = 2 * height + 1;\n\n\t  g.graph().nestingRoot = root;\n\n\t  // Multiply minlen by nodeSep to align nodes on non-border ranks.\n\t  _.forEach(g.edges(), function(e) { g.edge(e).minlen *= nodeSep; });\n\n\t  // Calculate a weight that is sufficient to keep subgraphs vertically compact\n\t  var weight = sumWeights(g) + 1;\n\n\t  // Create border nodes and link them up\n\t  _.forEach(g.children(), function(child) {\n\t    dfs(g, root, nodeSep, weight, height, depths, child);\n\t  });\n\n\t  // Save the multiplier for node layers for later removal of empty border\n\t  // layers.\n\t  g.graph().nodeRankFactor = nodeSep;\n\t}\n\n\tfunction dfs(g, root, nodeSep, weight, height, depths, v) {\n\t  var children = g.children(v);\n\t  if (!children.length) {\n\t    if (v !== root) {\n\t      g.setEdge(root, v, { weight: 0, minlen: nodeSep });\n\t    }\n\t    return;\n\t  }\n\n\t  var top = util.addBorderNode(g, \"_bt\");\n\t  var bottom = util.addBorderNode(g, \"_bb\");\n\t  var label = g.node(v);\n\n\t  g.setParent(top, v);\n\t  label.borderTop = top;\n\t  g.setParent(bottom, v);\n\t  label.borderBottom = bottom;\n\n\t  _.forEach(children, function(child) {\n\t    dfs(g, root, nodeSep, weight, height, depths, child);\n\n\t    var childNode = g.node(child);\n\t    var childTop = childNode.borderTop ? childNode.borderTop : child;\n\t    var childBottom = childNode.borderBottom ? childNode.borderBottom : child;\n\t    var thisWeight = childNode.borderTop ? weight : 2 * weight;\n\t    var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;\n\n\t    g.setEdge(top, childTop, {\n\t      weight: thisWeight,\n\t      minlen: minlen,\n\t      nestingEdge: true\n\t    });\n\n\t    g.setEdge(childBottom, bottom, {\n\t      weight: thisWeight,\n\t      minlen: minlen,\n\t      nestingEdge: true\n\t    });\n\t  });\n\n\t  if (!g.parent(v)) {\n\t    g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });\n\t  }\n\t}\n\n\tfunction treeDepths(g) {\n\t  var depths = {};\n\t  function dfs(v, depth) {\n\t    var children = g.children(v);\n\t    if (children && children.length) {\n\t      _.forEach(children, function(child) {\n\t        dfs(child, depth + 1);\n\t      });\n\t    }\n\t    depths[v] = depth;\n\t  }\n\t  _.forEach(g.children(), function(v) { dfs(v, 1); });\n\t  return depths;\n\t}\n\n\tfunction sumWeights(g) {\n\t  return _.reduce(g.edges(), function(acc, e) {\n\t    return acc + g.edge(e).weight;\n\t  }, 0);\n\t}\n\n\tfunction cleanup(g) {\n\t  var graphLabel = g.graph();\n\t  g.removeNode(graphLabel.nestingRoot);\n\t  delete graphLabel.nestingRoot;\n\t  _.forEach(g.edges(), function(e) {\n\t    var edge = g.edge(e);\n\t    if (edge.nestingEdge) {\n\t      g.removeEdge(e);\n\t    }\n\t  });\n\t}\n\treturn nestingGraph;\n}\n\nexport { requireNestingGraph as __require };\n//# sourceMappingURL=nesting-graph.js.map\n"],"names":["requireLodash","util","requireUtil","dfs"],"mappings":";;;;AAGA,IAAI;AACJ,IAAI;AAEJ,SAAS,sBAAuB;AAC/B,MAAI,wBAAyB,QAAO;AACpC,4BAA0B;AAC1B,MAAI,IAAIA,OAAAA,UAAa;AACrB,MAAIC,SAAOC,KAAAA,UAAW;AAEtB,iBAAe;AAAA,IACb;AAAA,IACA;AAAA,EACH;AAyBC,WAAS,IAAI,GAAG;AACd,QAAI,OAAOD,OAAK,aAAa,GAAG,QAAQ,CAAA,GAAI,OAAO;AACnD,QAAI,SAAS,WAAW,CAAC;AACzB,QAAI,SAAS,EAAE,IAAI,EAAE,OAAO,MAAM,CAAC,IAAI;AACvC,QAAI,UAAU,IAAI,SAAS;AAE3B,MAAE,QAAQ,cAAc;AAGxB,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAAE,QAAE,KAAK,CAAC,EAAE,UAAU;AAAA,IAAS,CAAC;AAGjE,QAAI,SAAS,WAAW,CAAC,IAAI;AAG7B,MAAE,QAAQ,EAAE,SAAQ,GAAI,SAAS,OAAO;AACtC,UAAI,GAAG,MAAM,SAAS,QAAQ,QAAQ,QAAQ,KAAK;AAAA,IACrD,CAAC;AAID,MAAE,QAAQ,iBAAiB;AAAA,EAC7B;AAEA,WAAS,IAAI,GAAG,MAAM,SAAS,QAAQ,QAAQ,QAAQ,GAAG;AACxD,QAAI,WAAW,EAAE,SAAS,CAAC;AAC3B,QAAI,CAAC,SAAS,QAAQ;AACpB,UAAI,MAAM,MAAM;AACd,UAAE,QAAQ,MAAM,GAAG,EAAE,QAAQ,GAAG,QAAQ,SAAS;AAAA,MACnD;AACA;AAAA,IACF;AAEA,QAAI,MAAMA,OAAK,cAAc,GAAG,KAAK;AACrC,QAAI,SAASA,OAAK,cAAc,GAAG,KAAK;AACxC,QAAI,QAAQ,EAAE,KAAK,CAAC;AAEpB,MAAE,UAAU,KAAK,CAAC;AAClB,UAAM,YAAY;AAClB,MAAE,UAAU,QAAQ,CAAC;AACrB,UAAM,eAAe;AAErB,MAAE,QAAQ,UAAU,SAAS,OAAO;AAClC,UAAI,GAAG,MAAM,SAAS,QAAQ,QAAQ,QAAQ,KAAK;AAEnD,UAAI,YAAY,EAAE,KAAK,KAAK;AAC5B,UAAI,WAAW,UAAU,YAAY,UAAU,YAAY;AAC3D,UAAI,cAAc,UAAU,eAAe,UAAU,eAAe;AACpE,UAAI,aAAa,UAAU,YAAY,SAAS,IAAI;AACpD,UAAI,SAAS,aAAa,cAAc,IAAI,SAAS,OAAO,CAAC,IAAI;AAEjE,QAAE,QAAQ,KAAK,UAAU;AAAA,QACvB,QAAQ;AAAA,QACR;AAAA,QACA,aAAa;AAAA,MACpB,CAAM;AAED,QAAE,QAAQ,aAAa,QAAQ;AAAA,QAC7B,QAAQ;AAAA,QACR;AAAA,QACA,aAAa;AAAA,MACpB,CAAM;AAAA,IACH,CAAC;AAED,QAAI,CAAC,EAAE,OAAO,CAAC,GAAG;AAChB,QAAE,QAAQ,MAAM,KAAK,EAAE,QAAQ,GAAG,QAAQ,SAAS,OAAO,CAAC,EAAC,CAAE;AAAA,IAChE;AAAA,EACF;AAEA,WAAS,WAAW,GAAG;AACrB,QAAI,SAAS,CAAA;AACb,aAASE,KAAI,GAAG,OAAO;AACrB,UAAI,WAAW,EAAE,SAAS,CAAC;AAC3B,UAAI,YAAY,SAAS,QAAQ;AAC/B,UAAE,QAAQ,UAAU,SAAS,OAAO;AAClC,UAAAA,KAAI,OAAO,QAAQ,CAAC;AAAA,QACtB,CAAC;AAAA,MACH;AACA,aAAO,CAAC,IAAI;AAAA,IACd;AACA,MAAE,QAAQ,EAAE,SAAQ,GAAI,SAAS,GAAG;AAAE,MAAAA,KAAI,GAAG,CAAC;AAAA,IAAG,CAAC;AAClD,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,GAAG;AACrB,WAAO,EAAE,OAAO,EAAE,MAAK,GAAI,SAAS,KAAK,GAAG;AAC1C,aAAO,MAAM,EAAE,KAAK,CAAC,EAAE;AAAA,IACzB,GAAG,CAAC;AAAA,EACN;AAEA,WAAS,QAAQ,GAAG;AAClB,QAAI,aAAa,EAAE,MAAK;AACxB,MAAE,WAAW,WAAW,WAAW;AACnC,WAAO,WAAW;AAClB,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,KAAK,aAAa;AACpB,UAAE,WAAW,CAAC;AAAA,MAChB;AAAA,IACF,CAAC;AAAA,EACH;AACA,SAAO;AACR;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/nesting-graph.js

@@ -0,0 +1,103 @@
+import { __require as requireLodash } from "./lodash.js";
+import { __require as requireUtil$1 } from "./util.js";
+var nestingGraph;
+var hasRequiredNestingGraph;
+function requireNestingGraph() {
+  if (hasRequiredNestingGraph) return nestingGraph;
+  hasRequiredNestingGraph = 1;
+  var _ = requireLodash();
+  var util = requireUtil$1();
+  nestingGraph = {
+    run,
+    cleanup
+  };
+  function run(g) {
+    var root = util.addDummyNode(g, "root", {}, "_root");
+    var depths = treeDepths(g);
+    var height = _.max(_.values(depths)) - 1;
+    var nodeSep = 2 * height + 1;
+    g.graph().nestingRoot = root;
+    _.forEach(g.edges(), function(e) {
+      g.edge(e).minlen *= nodeSep;
+    });
+    var weight = sumWeights(g) + 1;
+    _.forEach(g.children(), function(child) {
+      dfs(g, root, nodeSep, weight, height, depths, child);
+    });
+    g.graph().nodeRankFactor = nodeSep;
+  }
+  function dfs(g, root, nodeSep, weight, height, depths, v) {
+    var children = g.children(v);
+    if (!children.length) {
+      if (v !== root) {
+        g.setEdge(root, v, { weight: 0, minlen: nodeSep });
+      }
+      return;
+    }
+    var top = util.addBorderNode(g, "_bt");
+    var bottom = util.addBorderNode(g, "_bb");
+    var label = g.node(v);
+    g.setParent(top, v);
+    label.borderTop = top;
+    g.setParent(bottom, v);
+    label.borderBottom = bottom;
+    _.forEach(children, function(child) {
+      dfs(g, root, nodeSep, weight, height, depths, child);
+      var childNode = g.node(child);
+      var childTop = childNode.borderTop ? childNode.borderTop : child;
+      var childBottom = childNode.borderBottom ? childNode.borderBottom : child;
+      var thisWeight = childNode.borderTop ? weight : 2 * weight;
+      var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;
+      g.setEdge(top, childTop, {
+        weight: thisWeight,
+        minlen,
+        nestingEdge: true
+      });
+      g.setEdge(childBottom, bottom, {
+        weight: thisWeight,
+        minlen,
+        nestingEdge: true
+      });
+    });
+    if (!g.parent(v)) {
+      g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });
+    }
+  }
+  function treeDepths(g) {
+    var depths = {};
+    function dfs2(v, depth) {
+      var children = g.children(v);
+      if (children && children.length) {
+        _.forEach(children, function(child) {
+          dfs2(child, depth + 1);
+        });
+      }
+      depths[v] = depth;
+    }
+    _.forEach(g.children(), function(v) {
+      dfs2(v, 1);
+    });
+    return depths;
+  }
+  function sumWeights(g) {
+    return _.reduce(g.edges(), function(acc, e) {
+      return acc + g.edge(e).weight;
+    }, 0);
+  }
+  function cleanup(g) {
+    var graphLabel = g.graph();
+    g.removeNode(graphLabel.nestingRoot);
+    delete graphLabel.nestingRoot;
+    _.forEach(g.edges(), function(e) {
+      var edge = g.edge(e);
+      if (edge.nestingEdge) {
+        g.removeEdge(e);
+      }
+    });
+  }
+  return nestingGraph;
+}
+export {
+  requireNestingGraph as __require
+};
+//# sourceMappingURL=nesting-graph.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/nesting-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nesting-graph.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/nesting-graph.js"],"sourcesContent":["import { __require as requireLodash } from './lodash.js';\nimport { __require as requireUtil } from './util.js';\n\nvar nestingGraph;\nvar hasRequiredNestingGraph;\n\nfunction requireNestingGraph () {\n\tif (hasRequiredNestingGraph) return nestingGraph;\n\thasRequiredNestingGraph = 1;\n\tvar _ = requireLodash();\n\tvar util = requireUtil();\n\n\tnestingGraph = {\n\t  run: run,\n\t  cleanup: cleanup\n\t};\n\n\t/*\n\t * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n\t * adds appropriate edges to ensure that all cluster nodes are placed between\n\t * these boundries, and ensures that the graph is connected.\n\t *\n\t * In addition we ensure, through the use of the minlen property, that nodes\n\t * and subgraph border nodes to not end up on the same rank.\n\t *\n\t * Preconditions:\n\t *\n\t *    1. Input graph is a DAG\n\t *    2. Nodes in the input graph has a minlen attribute\n\t *\n\t * Postconditions:\n\t *\n\t *    1. Input graph is connected.\n\t *    2. Dummy nodes are added for the tops and bottoms of subgraphs.\n\t *    3. The minlen attribute for nodes is adjusted to ensure nodes do not\n\t *       get placed on the same rank as subgraph border nodes.\n\t *\n\t * The nesting graph idea comes from Sander, \"Layout of Compound Directed\n\t * Graphs.\"\n\t */\n\tfunction run(g) {\n\t  var root = util.addDummyNode(g, \"root\", {}, \"_root\");\n\t  var depths = treeDepths(g);\n\t  var height = _.max(_.values(depths)) - 1; // Note: depths is an Object not an array\n\t  var nodeSep = 2 * height + 1;\n\n\t  g.graph().nestingRoot = root;\n\n\t  // Multiply minlen by nodeSep to align nodes on non-border ranks.\n\t  _.forEach(g.edges(), function(e) { g.edge(e).minlen *= nodeSep; });\n\n\t  // Calculate a weight that is sufficient to keep subgraphs vertically compact\n\t  var weight = sumWeights(g) + 1;\n\n\t  // Create border nodes and link them up\n\t  _.forEach(g.children(), function(child) {\n\t    dfs(g, root, nodeSep, weight, height, depths, child);\n\t  });\n\n\t  // Save the multiplier for node layers for later removal of empty border\n\t  // layers.\n\t  g.graph().nodeRankFactor = nodeSep;\n\t}\n\n\tfunction dfs(g, root, nodeSep, weight, height, depths, v) {\n\t  var children = g.children(v);\n\t  if (!children.length) {\n\t    if (v !== root) {\n\t      g.setEdge(root, v, { weight: 0, minlen: nodeSep });\n\t    }\n\t    return;\n\t  }\n\n\t  var top = util.addBorderNode(g, \"_bt\");\n\t  var bottom = util.addBorderNode(g, \"_bb\");\n\t  var label = g.node(v);\n\n\t  g.setParent(top, v);\n\t  label.borderTop = top;\n\t  g.setParent(bottom, v);\n\t  label.borderBottom = bottom;\n\n\t  _.forEach(children, function(child) {\n\t    dfs(g, root, nodeSep, weight, height, depths, child);\n\n\t    var childNode = g.node(child);\n\t    var childTop = childNode.borderTop ? childNode.borderTop : child;\n\t    var childBottom = childNode.borderBottom ? childNode.borderBottom : child;\n\t    var thisWeight = childNode.borderTop ? weight : 2 * weight;\n\t    var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;\n\n\t    g.setEdge(top, childTop, {\n\t      weight: thisWeight,\n\t      minlen: minlen,\n\t      nestingEdge: true\n\t    });\n\n\t    g.setEdge(childBottom, bottom, {\n\t      weight: thisWeight,\n\t      minlen: minlen,\n\t      nestingEdge: true\n\t    });\n\t  });\n\n\t  if (!g.parent(v)) {\n\t    g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });\n\t  }\n\t}\n\n\tfunction treeDepths(g) {\n\t  var depths = {};\n\t  function dfs(v, depth) {\n\t    var children = g.children(v);\n\t    if (children && children.length) {\n\t      _.forEach(children, function(child) {\n\t        dfs(child, depth + 1);\n\t      });\n\t    }\n\t    depths[v] = depth;\n\t  }\n\t  _.forEach(g.children(), function(v) { dfs(v, 1); });\n\t  return depths;\n\t}\n\n\tfunction sumWeights(g) {\n\t  return _.reduce(g.edges(), function(acc, e) {\n\t    return acc + g.edge(e).weight;\n\t  }, 0);\n\t}\n\n\tfunction cleanup(g) {\n\t  var graphLabel = g.graph();\n\t  g.removeNode(graphLabel.nestingRoot);\n\t  delete graphLabel.nestingRoot;\n\t  _.forEach(g.edges(), function(e) {\n\t    var edge = g.edge(e);\n\t    if (edge.nestingEdge) {\n\t      g.removeEdge(e);\n\t    }\n\t  });\n\t}\n\treturn nestingGraph;\n}\n\nexport { requireNestingGraph as __require };\n//# sourceMappingURL=nesting-graph.js.map\n"],"names":["requireUtil","dfs"],"mappings":";;AAGA,IAAI;AACJ,IAAI;AAEJ,SAAS,sBAAuB;AAC/B,MAAI,wBAAyB,QAAO;AACpC,4BAA0B;AAC1B,MAAI,IAAI,cAAa;AACrB,MAAI,OAAOA,cAAW;AAEtB,iBAAe;AAAA,IACb;AAAA,IACA;AAAA,EACH;AAyBC,WAAS,IAAI,GAAG;AACd,QAAI,OAAO,KAAK,aAAa,GAAG,QAAQ,CAAA,GAAI,OAAO;AACnD,QAAI,SAAS,WAAW,CAAC;AACzB,QAAI,SAAS,EAAE,IAAI,EAAE,OAAO,MAAM,CAAC,IAAI;AACvC,QAAI,UAAU,IAAI,SAAS;AAE3B,MAAE,QAAQ,cAAc;AAGxB,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAAE,QAAE,KAAK,CAAC,EAAE,UAAU;AAAA,IAAS,CAAC;AAGjE,QAAI,SAAS,WAAW,CAAC,IAAI;AAG7B,MAAE,QAAQ,EAAE,SAAQ,GAAI,SAAS,OAAO;AACtC,UAAI,GAAG,MAAM,SAAS,QAAQ,QAAQ,QAAQ,KAAK;AAAA,IACrD,CAAC;AAID,MAAE,QAAQ,iBAAiB;AAAA,EAC7B;AAEA,WAAS,IAAI,GAAG,MAAM,SAAS,QAAQ,QAAQ,QAAQ,GAAG;AACxD,QAAI,WAAW,EAAE,SAAS,CAAC;AAC3B,QAAI,CAAC,SAAS,QAAQ;AACpB,UAAI,MAAM,MAAM;AACd,UAAE,QAAQ,MAAM,GAAG,EAAE,QAAQ,GAAG,QAAQ,SAAS;AAAA,MACnD;AACA;AAAA,IACF;AAEA,QAAI,MAAM,KAAK,cAAc,GAAG,KAAK;AACrC,QAAI,SAAS,KAAK,cAAc,GAAG,KAAK;AACxC,QAAI,QAAQ,EAAE,KAAK,CAAC;AAEpB,MAAE,UAAU,KAAK,CAAC;AAClB,UAAM,YAAY;AAClB,MAAE,UAAU,QAAQ,CAAC;AACrB,UAAM,eAAe;AAErB,MAAE,QAAQ,UAAU,SAAS,OAAO;AAClC,UAAI,GAAG,MAAM,SAAS,QAAQ,QAAQ,QAAQ,KAAK;AAEnD,UAAI,YAAY,EAAE,KAAK,KAAK;AAC5B,UAAI,WAAW,UAAU,YAAY,UAAU,YAAY;AAC3D,UAAI,cAAc,UAAU,eAAe,UAAU,eAAe;AACpE,UAAI,aAAa,UAAU,YAAY,SAAS,IAAI;AACpD,UAAI,SAAS,aAAa,cAAc,IAAI,SAAS,OAAO,CAAC,IAAI;AAEjE,QAAE,QAAQ,KAAK,UAAU;AAAA,QACvB,QAAQ;AAAA,QACR;AAAA,QACA,aAAa;AAAA,MACpB,CAAM;AAED,QAAE,QAAQ,aAAa,QAAQ;AAAA,QAC7B,QAAQ;AAAA,QACR;AAAA,QACA,aAAa;AAAA,MACpB,CAAM;AAAA,IACH,CAAC;AAED,QAAI,CAAC,EAAE,OAAO,CAAC,GAAG;AAChB,QAAE,QAAQ,MAAM,KAAK,EAAE,QAAQ,GAAG,QAAQ,SAAS,OAAO,CAAC,EAAC,CAAE;AAAA,IAChE;AAAA,EACF;AAEA,WAAS,WAAW,GAAG;AACrB,QAAI,SAAS,CAAA;AACb,aAASC,KAAI,GAAG,OAAO;AACrB,UAAI,WAAW,EAAE,SAAS,CAAC;AAC3B,UAAI,YAAY,SAAS,QAAQ;AAC/B,UAAE,QAAQ,UAAU,SAAS,OAAO;AAClC,UAAAA,KAAI,OAAO,QAAQ,CAAC;AAAA,QACtB,CAAC;AAAA,MACH;AACA,aAAO,CAAC,IAAI;AAAA,IACd;AACA,MAAE,QAAQ,EAAE,SAAQ,GAAI,SAAS,GAAG;AAAE,MAAAA,KAAI,GAAG,CAAC;AAAA,IAAG,CAAC;AAClD,WAAO;AAAA,EACT;AAEA,WAAS,WAAW,GAAG;AACrB,WAAO,EAAE,OAAO,EAAE,MAAK,GAAI,SAAS,KAAK,GAAG;AAC1C,aAAO,MAAM,EAAE,KAAK,CAAC,EAAE;AAAA,IACzB,GAAG,CAAC;AAAA,EACN;AAEA,WAAS,QAAQ,GAAG;AAClB,QAAI,aAAa,EAAE,MAAK;AACxB,MAAE,WAAW,WAAW,WAAW;AACnC,WAAO,WAAW;AAClB,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,GAAG;AAC/B,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,KAAK,aAAa;AACpB,UAAE,WAAW,CAAC;AAAA,MAChB;AAAA,IACF,CAAC;AAAA,EACH;AACA,SAAO;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/normalize.cjs

@@ -0,0 +1,81 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const lodash = require("./lodash.cjs");
+const util = require("./util.cjs");
+var normalize;
+var hasRequiredNormalize;
+function requireNormalize() {
+  if (hasRequiredNormalize) return normalize;
+  hasRequiredNormalize = 1;
+  var _ = lodash.__require();
+  var util$1 = util.__require();
+  normalize = {
+    run,
+    undo
+  };
+  function run(g) {
+    g.graph().dummyChains = [];
+    _.forEach(g.edges(), function(edge) {
+      normalizeEdge(g, edge);
+    });
+  }
+  function normalizeEdge(g, e) {
+    var v = e.v;
+    var vRank = g.node(v).rank;
+    var w = e.w;
+    var wRank = g.node(w).rank;
+    var name = e.name;
+    var edgeLabel = g.edge(e);
+    var labelRank = edgeLabel.labelRank;
+    if (wRank === vRank + 1) return;
+    g.removeEdge(e);
+    var dummy, attrs, i;
+    for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {
+      edgeLabel.points = [];
+      attrs = {
+        width: 0,
+        height: 0,
+        edgeLabel,
+        edgeObj: e,
+        rank: vRank
+      };
+      dummy = util$1.addDummyNode(g, "edge", attrs, "_d");
+      if (vRank === labelRank) {
+        attrs.width = edgeLabel.width;
+        attrs.height = edgeLabel.height;
+        attrs.dummy = "edge-label";
+        attrs.labelpos = edgeLabel.labelpos;
+      }
+      g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);
+      if (i === 0) {
+        g.graph().dummyChains.push(dummy);
+      }
+      v = dummy;
+    }
+    g.setEdge(v, w, { weight: edgeLabel.weight }, name);
+  }
+  function undo(g) {
+    _.forEach(g.graph().dummyChains, function(v) {
+      var node = g.node(v);
+      var origLabel = node.edgeLabel;
+      var w;
+      g.setEdge(node.edgeObj, origLabel);
+      while (node.dummy) {
+        w = g.successors(v)[0];
+        g.removeNode(v);
+        origLabel.points.push({ x: node.x, y: node.y });
+        if (node.dummy === "edge-label") {
+          origLabel.x = node.x;
+          origLabel.y = node.y;
+          origLabel.width = node.width;
+          origLabel.height = node.height;
+        }
+        v = w;
+        node = g.node(v);
+      }
+    });
+  }
+  return normalize;
+}
+exports.__require = requireNormalize;
+//# sourceMappingURL=normalize.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/normalize.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalize.cjs","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/normalize.js"],"sourcesContent":["import { __require as requireLodash } from './lodash.js';\nimport { __require as requireUtil } from './util.js';\n\nvar normalize;\nvar hasRequiredNormalize;\n\nfunction requireNormalize () {\n\tif (hasRequiredNormalize) return normalize;\n\thasRequiredNormalize = 1;\n\n\tvar _ = requireLodash();\n\tvar util = requireUtil();\n\n\tnormalize = {\n\t  run: run,\n\t  undo: undo\n\t};\n\n\t/*\n\t * Breaks any long edges in the graph into short segments that span 1 layer\n\t * each. This operation is undoable with the denormalize function.\n\t *\n\t * Pre-conditions:\n\t *\n\t *    1. The input graph is a DAG.\n\t *    2. Each node in the graph has a \"rank\" property.\n\t *\n\t * Post-condition:\n\t *\n\t *    1. All edges in the graph have a length of 1.\n\t *    2. Dummy nodes are added where edges have been split into segments.\n\t *    3. The graph is augmented with a \"dummyChains\" attribute which contains\n\t *       the first dummy in each chain of dummy nodes produced.\n\t */\n\tfunction run(g) {\n\t  g.graph().dummyChains = [];\n\t  _.forEach(g.edges(), function(edge) { normalizeEdge(g, edge); });\n\t}\n\n\tfunction normalizeEdge(g, e) {\n\t  var v = e.v;\n\t  var vRank = g.node(v).rank;\n\t  var w = e.w;\n\t  var wRank = g.node(w).rank;\n\t  var name = e.name;\n\t  var edgeLabel = g.edge(e);\n\t  var labelRank = edgeLabel.labelRank;\n\n\t  if (wRank === vRank + 1) return;\n\n\t  g.removeEdge(e);\n\n\t  var dummy, attrs, i;\n\t  for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n\t    edgeLabel.points = [];\n\t    attrs = {\n\t      width: 0, height: 0,\n\t      edgeLabel: edgeLabel, edgeObj: e,\n\t      rank: vRank\n\t    };\n\t    dummy = util.addDummyNode(g, \"edge\", attrs, \"_d\");\n\t    if (vRank === labelRank) {\n\t      attrs.width = edgeLabel.width;\n\t      attrs.height = edgeLabel.height;\n\t      attrs.dummy = \"edge-label\";\n\t      attrs.labelpos = edgeLabel.labelpos;\n\t    }\n\t    g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);\n\t    if (i === 0) {\n\t      g.graph().dummyChains.push(dummy);\n\t    }\n\t    v = dummy;\n\t  }\n\n\t  g.setEdge(v, w, { weight: edgeLabel.weight }, name);\n\t}\n\n\tfunction undo(g) {\n\t  _.forEach(g.graph().dummyChains, function(v) {\n\t    var node = g.node(v);\n\t    var origLabel = node.edgeLabel;\n\t    var w;\n\t    g.setEdge(node.edgeObj, origLabel);\n\t    while (node.dummy) {\n\t      w = g.successors(v)[0];\n\t      g.removeNode(v);\n\t      origLabel.points.push({ x: node.x, y: node.y });\n\t      if (node.dummy === \"edge-label\") {\n\t        origLabel.x = node.x;\n\t        origLabel.y = node.y;\n\t        origLabel.width = node.width;\n\t        origLabel.height = node.height;\n\t      }\n\t      v = w;\n\t      node = g.node(v);\n\t    }\n\t  });\n\t}\n\treturn normalize;\n}\n\nexport { requireNormalize as __require };\n//# sourceMappingURL=normalize.js.map\n"],"names":["requireLodash","util","requireUtil"],"mappings":";;;;AAGA,IAAI;AACJ,IAAI;AAEJ,SAAS,mBAAoB;AAC5B,MAAI,qBAAsB,QAAO;AACjC,yBAAuB;AAEvB,MAAI,IAAIA,OAAAA,UAAa;AACrB,MAAIC,SAAOC,KAAAA,UAAW;AAEtB,cAAY;AAAA,IACV;AAAA,IACA;AAAA,EACH;AAkBC,WAAS,IAAI,GAAG;AACd,MAAE,QAAQ,cAAc,CAAA;AACxB,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,MAAM;AAAE,oBAAc,GAAG,IAAI;AAAA,IAAG,CAAC;AAAA,EACjE;AAEA,WAAS,cAAc,GAAG,GAAG;AAC3B,QAAI,IAAI,EAAE;AACV,QAAI,QAAQ,EAAE,KAAK,CAAC,EAAE;AACtB,QAAI,IAAI,EAAE;AACV,QAAI,QAAQ,EAAE,KAAK,CAAC,EAAE;AACtB,QAAI,OAAO,EAAE;AACb,QAAI,YAAY,EAAE,KAAK,CAAC;AACxB,QAAI,YAAY,UAAU;AAE1B,QAAI,UAAU,QAAQ,EAAG;AAEzB,MAAE,WAAW,CAAC;AAEd,QAAI,OAAO,OAAO;AAClB,SAAK,IAAI,GAAG,EAAE,OAAO,QAAQ,OAAO,EAAE,GAAG,EAAE,OAAO;AAChD,gBAAU,SAAS,CAAA;AACnB,cAAQ;AAAA,QACN,OAAO;AAAA,QAAG,QAAQ;AAAA,QAClB;AAAA,QAAsB,SAAS;AAAA,QAC/B,MAAM;AAAA,MACb;AACK,cAAQD,OAAK,aAAa,GAAG,QAAQ,OAAO,IAAI;AAChD,UAAI,UAAU,WAAW;AACvB,cAAM,QAAQ,UAAU;AACxB,cAAM,SAAS,UAAU;AACzB,cAAM,QAAQ;AACd,cAAM,WAAW,UAAU;AAAA,MAC7B;AACA,QAAE,QAAQ,GAAG,OAAO,EAAE,QAAQ,UAAU,OAAM,GAAI,IAAI;AACtD,UAAI,MAAM,GAAG;AACX,UAAE,MAAK,EAAG,YAAY,KAAK,KAAK;AAAA,MAClC;AACA,UAAI;AAAA,IACN;AAEA,MAAE,QAAQ,GAAG,GAAG,EAAE,QAAQ,UAAU,OAAM,GAAI,IAAI;AAAA,EACpD;AAEA,WAAS,KAAK,GAAG;AACf,MAAE,QAAQ,EAAE,MAAK,EAAG,aAAa,SAAS,GAAG;AAC3C,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,YAAY,KAAK;AACrB,UAAI;AACJ,QAAE,QAAQ,KAAK,SAAS,SAAS;AACjC,aAAO,KAAK,OAAO;AACjB,YAAI,EAAE,WAAW,CAAC,EAAE,CAAC;AACrB,UAAE,WAAW,CAAC;AACd,kBAAU,OAAO,KAAK,EAAE,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG;AAC9C,YAAI,KAAK,UAAU,cAAc;AAC/B,oBAAU,IAAI,KAAK;AACnB,oBAAU,IAAI,KAAK;AACnB,oBAAU,QAAQ,KAAK;AACvB,oBAAU,SAAS,KAAK;AAAA,QAC1B;AACA,YAAI;AACJ,eAAO,EAAE,KAAK,CAAC;AAAA,MACjB;AAAA,IACF,CAAC;AAAA,EACH;AACA,SAAO;AACR;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/normalize.js

@@ -0,0 +1,81 @@
+import { __require as requireLodash } from "./lodash.js";
+import { __require as requireUtil$1 } from "./util.js";
+var normalize;
+var hasRequiredNormalize;
+function requireNormalize() {
+  if (hasRequiredNormalize) return normalize;
+  hasRequiredNormalize = 1;
+  var _ = requireLodash();
+  var util = requireUtil$1();
+  normalize = {
+    run,
+    undo
+  };
+  function run(g) {
+    g.graph().dummyChains = [];
+    _.forEach(g.edges(), function(edge) {
+      normalizeEdge(g, edge);
+    });
+  }
+  function normalizeEdge(g, e) {
+    var v = e.v;
+    var vRank = g.node(v).rank;
+    var w = e.w;
+    var wRank = g.node(w).rank;
+    var name = e.name;
+    var edgeLabel = g.edge(e);
+    var labelRank = edgeLabel.labelRank;
+    if (wRank === vRank + 1) return;
+    g.removeEdge(e);
+    var dummy, attrs, i;
+    for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {
+      edgeLabel.points = [];
+      attrs = {
+        width: 0,
+        height: 0,
+        edgeLabel,
+        edgeObj: e,
+        rank: vRank
+      };
+      dummy = util.addDummyNode(g, "edge", attrs, "_d");
+      if (vRank === labelRank) {
+        attrs.width = edgeLabel.width;
+        attrs.height = edgeLabel.height;
+        attrs.dummy = "edge-label";
+        attrs.labelpos = edgeLabel.labelpos;
+      }
+      g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);
+      if (i === 0) {
+        g.graph().dummyChains.push(dummy);
+      }
+      v = dummy;
+    }
+    g.setEdge(v, w, { weight: edgeLabel.weight }, name);
+  }
+  function undo(g) {
+    _.forEach(g.graph().dummyChains, function(v) {
+      var node = g.node(v);
+      var origLabel = node.edgeLabel;
+      var w;
+      g.setEdge(node.edgeObj, origLabel);
+      while (node.dummy) {
+        w = g.successors(v)[0];
+        g.removeNode(v);
+        origLabel.points.push({ x: node.x, y: node.y });
+        if (node.dummy === "edge-label") {
+          origLabel.x = node.x;
+          origLabel.y = node.y;
+          origLabel.width = node.width;
+          origLabel.height = node.height;
+        }
+        v = w;
+        node = g.node(v);
+      }
+    });
+  }
+  return normalize;
+}
+export {
+  requireNormalize as __require
+};
+//# sourceMappingURL=normalize.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/normalize.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"normalize.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/normalize.js"],"sourcesContent":["import { __require as requireLodash } from './lodash.js';\nimport { __require as requireUtil } from './util.js';\n\nvar normalize;\nvar hasRequiredNormalize;\n\nfunction requireNormalize () {\n\tif (hasRequiredNormalize) return normalize;\n\thasRequiredNormalize = 1;\n\n\tvar _ = requireLodash();\n\tvar util = requireUtil();\n\n\tnormalize = {\n\t  run: run,\n\t  undo: undo\n\t};\n\n\t/*\n\t * Breaks any long edges in the graph into short segments that span 1 layer\n\t * each. This operation is undoable with the denormalize function.\n\t *\n\t * Pre-conditions:\n\t *\n\t *    1. The input graph is a DAG.\n\t *    2. Each node in the graph has a \"rank\" property.\n\t *\n\t * Post-condition:\n\t *\n\t *    1. All edges in the graph have a length of 1.\n\t *    2. Dummy nodes are added where edges have been split into segments.\n\t *    3. The graph is augmented with a \"dummyChains\" attribute which contains\n\t *       the first dummy in each chain of dummy nodes produced.\n\t */\n\tfunction run(g) {\n\t  g.graph().dummyChains = [];\n\t  _.forEach(g.edges(), function(edge) { normalizeEdge(g, edge); });\n\t}\n\n\tfunction normalizeEdge(g, e) {\n\t  var v = e.v;\n\t  var vRank = g.node(v).rank;\n\t  var w = e.w;\n\t  var wRank = g.node(w).rank;\n\t  var name = e.name;\n\t  var edgeLabel = g.edge(e);\n\t  var labelRank = edgeLabel.labelRank;\n\n\t  if (wRank === vRank + 1) return;\n\n\t  g.removeEdge(e);\n\n\t  var dummy, attrs, i;\n\t  for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n\t    edgeLabel.points = [];\n\t    attrs = {\n\t      width: 0, height: 0,\n\t      edgeLabel: edgeLabel, edgeObj: e,\n\t      rank: vRank\n\t    };\n\t    dummy = util.addDummyNode(g, \"edge\", attrs, \"_d\");\n\t    if (vRank === labelRank) {\n\t      attrs.width = edgeLabel.width;\n\t      attrs.height = edgeLabel.height;\n\t      attrs.dummy = \"edge-label\";\n\t      attrs.labelpos = edgeLabel.labelpos;\n\t    }\n\t    g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);\n\t    if (i === 0) {\n\t      g.graph().dummyChains.push(dummy);\n\t    }\n\t    v = dummy;\n\t  }\n\n\t  g.setEdge(v, w, { weight: edgeLabel.weight }, name);\n\t}\n\n\tfunction undo(g) {\n\t  _.forEach(g.graph().dummyChains, function(v) {\n\t    var node = g.node(v);\n\t    var origLabel = node.edgeLabel;\n\t    var w;\n\t    g.setEdge(node.edgeObj, origLabel);\n\t    while (node.dummy) {\n\t      w = g.successors(v)[0];\n\t      g.removeNode(v);\n\t      origLabel.points.push({ x: node.x, y: node.y });\n\t      if (node.dummy === \"edge-label\") {\n\t        origLabel.x = node.x;\n\t        origLabel.y = node.y;\n\t        origLabel.width = node.width;\n\t        origLabel.height = node.height;\n\t      }\n\t      v = w;\n\t      node = g.node(v);\n\t    }\n\t  });\n\t}\n\treturn normalize;\n}\n\nexport { requireNormalize as __require };\n//# sourceMappingURL=normalize.js.map\n"],"names":["requireUtil"],"mappings":";;AAGA,IAAI;AACJ,IAAI;AAEJ,SAAS,mBAAoB;AAC5B,MAAI,qBAAsB,QAAO;AACjC,yBAAuB;AAEvB,MAAI,IAAI,cAAa;AACrB,MAAI,OAAOA,cAAW;AAEtB,cAAY;AAAA,IACV;AAAA,IACA;AAAA,EACH;AAkBC,WAAS,IAAI,GAAG;AACd,MAAE,QAAQ,cAAc,CAAA;AACxB,MAAE,QAAQ,EAAE,MAAK,GAAI,SAAS,MAAM;AAAE,oBAAc,GAAG,IAAI;AAAA,IAAG,CAAC;AAAA,EACjE;AAEA,WAAS,cAAc,GAAG,GAAG;AAC3B,QAAI,IAAI,EAAE;AACV,QAAI,QAAQ,EAAE,KAAK,CAAC,EAAE;AACtB,QAAI,IAAI,EAAE;AACV,QAAI,QAAQ,EAAE,KAAK,CAAC,EAAE;AACtB,QAAI,OAAO,EAAE;AACb,QAAI,YAAY,EAAE,KAAK,CAAC;AACxB,QAAI,YAAY,UAAU;AAE1B,QAAI,UAAU,QAAQ,EAAG;AAEzB,MAAE,WAAW,CAAC;AAEd,QAAI,OAAO,OAAO;AAClB,SAAK,IAAI,GAAG,EAAE,OAAO,QAAQ,OAAO,EAAE,GAAG,EAAE,OAAO;AAChD,gBAAU,SAAS,CAAA;AACnB,cAAQ;AAAA,QACN,OAAO;AAAA,QAAG,QAAQ;AAAA,QAClB;AAAA,QAAsB,SAAS;AAAA,QAC/B,MAAM;AAAA,MACb;AACK,cAAQ,KAAK,aAAa,GAAG,QAAQ,OAAO,IAAI;AAChD,UAAI,UAAU,WAAW;AACvB,cAAM,QAAQ,UAAU;AACxB,cAAM,SAAS,UAAU;AACzB,cAAM,QAAQ;AACd,cAAM,WAAW,UAAU;AAAA,MAC7B;AACA,QAAE,QAAQ,GAAG,OAAO,EAAE,QAAQ,UAAU,OAAM,GAAI,IAAI;AACtD,UAAI,MAAM,GAAG;AACX,UAAE,MAAK,EAAG,YAAY,KAAK,KAAK;AAAA,MAClC;AACA,UAAI;AAAA,IACN;AAEA,MAAE,QAAQ,GAAG,GAAG,EAAE,QAAQ,UAAU,OAAM,GAAI,IAAI;AAAA,EACpD;AAEA,WAAS,KAAK,GAAG;AACf,MAAE,QAAQ,EAAE,MAAK,EAAG,aAAa,SAAS,GAAG;AAC3C,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,YAAY,KAAK;AACrB,UAAI;AACJ,QAAE,QAAQ,KAAK,SAAS,SAAS;AACjC,aAAO,KAAK,OAAO;AACjB,YAAI,EAAE,WAAW,CAAC,EAAE,CAAC;AACrB,UAAE,WAAW,CAAC;AACd,kBAAU,OAAO,KAAK,EAAE,GAAG,KAAK,GAAG,GAAG,KAAK,GAAG;AAC9C,YAAI,KAAK,UAAU,cAAc;AAC/B,oBAAU,IAAI,KAAK;AACnB,oBAAU,IAAI,KAAK;AACnB,oBAAU,QAAQ,KAAK;AACvB,oBAAU,SAAS,KAAK;AAAA,QAC1B;AACA,YAAI;AACJ,eAAO,EAAE,KAAK,CAAC;AAAA,MACjB;AAAA,IACF,CAAC;AAAA,EACH;AACA,SAAO;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/add-subgraph-constraints.cjs

@@ -0,0 +1,35 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const lodash = require("../lodash.cjs");
+var addSubgraphConstraints_1;
+var hasRequiredAddSubgraphConstraints;
+function requireAddSubgraphConstraints() {
+  if (hasRequiredAddSubgraphConstraints) return addSubgraphConstraints_1;
+  hasRequiredAddSubgraphConstraints = 1;
+  var _ = lodash.__require();
+  addSubgraphConstraints_1 = addSubgraphConstraints;
+  function addSubgraphConstraints(g, cg, vs) {
+    var prev = {}, rootPrev;
+    _.forEach(vs, function(v) {
+      var child = g.parent(v), parent, prevChild;
+      while (child) {
+        parent = g.parent(child);
+        if (parent) {
+          prevChild = prev[parent];
+          prev[parent] = child;
+        } else {
+          prevChild = rootPrev;
+          rootPrev = child;
+        }
+        if (prevChild && prevChild !== child) {
+          cg.setEdge(prevChild, child);
+          return;
+        }
+        child = parent;
+      }
+    });
+  }
+  return addSubgraphConstraints_1;
+}
+exports.__require = requireAddSubgraphConstraints;
+//# sourceMappingURL=add-subgraph-constraints.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/add-subgraph-constraints.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-subgraph-constraints.cjs","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/add-subgraph-constraints.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\n\nvar addSubgraphConstraints_1;\nvar hasRequiredAddSubgraphConstraints;\n\nfunction requireAddSubgraphConstraints () {\n\tif (hasRequiredAddSubgraphConstraints) return addSubgraphConstraints_1;\n\thasRequiredAddSubgraphConstraints = 1;\n\tvar _ = requireLodash();\n\n\taddSubgraphConstraints_1 = addSubgraphConstraints;\n\n\tfunction addSubgraphConstraints(g, cg, vs) {\n\t  var prev = {},\n\t    rootPrev;\n\n\t  _.forEach(vs, function(v) {\n\t    var child = g.parent(v),\n\t      parent,\n\t      prevChild;\n\t    while (child) {\n\t      parent = g.parent(child);\n\t      if (parent) {\n\t        prevChild = prev[parent];\n\t        prev[parent] = child;\n\t      } else {\n\t        prevChild = rootPrev;\n\t        rootPrev = child;\n\t      }\n\t      if (prevChild && prevChild !== child) {\n\t        cg.setEdge(prevChild, child);\n\t        return;\n\t      }\n\t      child = parent;\n\t    }\n\t  });\n\n\t  /*\n\t  function dfs(v) {\n\t    var children = v ? g.children(v) : g.children();\n\t    if (children.length) {\n\t      var min = Number.POSITIVE_INFINITY,\n\t          subgraphs = [];\n\t      _.each(children, function(child) {\n\t        var childMin = dfs(child);\n\t        if (g.children(child).length) {\n\t          subgraphs.push({ v: child, order: childMin });\n\t        }\n\t        min = Math.min(min, childMin);\n\t      });\n\t      _.reduce(_.sortBy(subgraphs, \"order\"), function(prev, curr) {\n\t        cg.setEdge(prev.v, curr.v);\n\t        return curr;\n\t      });\n\t      return min;\n\t    }\n\t    return g.node(v).order;\n\t  }\n\t  dfs(undefined);\n\t  */\n\t}\n\treturn addSubgraphConstraints_1;\n}\n\nexport { requireAddSubgraphConstraints as __require };\n//# sourceMappingURL=add-subgraph-constraints.js.map\n"],"names":["requireLodash"],"mappings":";;;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,gCAAiC;AACzC,MAAI,kCAAmC,QAAO;AAC9C,sCAAoC;AACpC,MAAI,IAAIA,OAAAA,UAAa;AAErB,6BAA2B;AAE3B,WAAS,uBAAuB,GAAG,IAAI,IAAI;AACzC,QAAI,OAAO,CAAA,GACT;AAEF,MAAE,QAAQ,IAAI,SAAS,GAAG;AACxB,UAAI,QAAQ,EAAE,OAAO,CAAC,GACpB,QACA;AACF,aAAO,OAAO;AACZ,iBAAS,EAAE,OAAO,KAAK;AACvB,YAAI,QAAQ;AACV,sBAAY,KAAK,MAAM;AACvB,eAAK,MAAM,IAAI;AAAA,QACjB,OAAO;AACL,sBAAY;AACZ,qBAAW;AAAA,QACb;AACA,YAAI,aAAa,cAAc,OAAO;AACpC,aAAG,QAAQ,WAAW,KAAK;AAC3B;AAAA,QACF;AACA,gBAAQ;AAAA,MACV;AAAA,IACF,CAAC;AAAA,EAyBH;AACA,SAAO;AACR;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/add-subgraph-constraints.js

@@ -0,0 +1,35 @@
+import { __require as requireLodash } from "../lodash.js";
+var addSubgraphConstraints_1;
+var hasRequiredAddSubgraphConstraints;
+function requireAddSubgraphConstraints() {
+  if (hasRequiredAddSubgraphConstraints) return addSubgraphConstraints_1;
+  hasRequiredAddSubgraphConstraints = 1;
+  var _ = requireLodash();
+  addSubgraphConstraints_1 = addSubgraphConstraints;
+  function addSubgraphConstraints(g, cg, vs) {
+    var prev = {}, rootPrev;
+    _.forEach(vs, function(v) {
+      var child = g.parent(v), parent, prevChild;
+      while (child) {
+        parent = g.parent(child);
+        if (parent) {
+          prevChild = prev[parent];
+          prev[parent] = child;
+        } else {
+          prevChild = rootPrev;
+          rootPrev = child;
+        }
+        if (prevChild && prevChild !== child) {
+          cg.setEdge(prevChild, child);
+          return;
+        }
+        child = parent;
+      }
+    });
+  }
+  return addSubgraphConstraints_1;
+}
+export {
+  requireAddSubgraphConstraints as __require
+};
+//# sourceMappingURL=add-subgraph-constraints.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/add-subgraph-constraints.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-subgraph-constraints.js","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/add-subgraph-constraints.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\n\nvar addSubgraphConstraints_1;\nvar hasRequiredAddSubgraphConstraints;\n\nfunction requireAddSubgraphConstraints () {\n\tif (hasRequiredAddSubgraphConstraints) return addSubgraphConstraints_1;\n\thasRequiredAddSubgraphConstraints = 1;\n\tvar _ = requireLodash();\n\n\taddSubgraphConstraints_1 = addSubgraphConstraints;\n\n\tfunction addSubgraphConstraints(g, cg, vs) {\n\t  var prev = {},\n\t    rootPrev;\n\n\t  _.forEach(vs, function(v) {\n\t    var child = g.parent(v),\n\t      parent,\n\t      prevChild;\n\t    while (child) {\n\t      parent = g.parent(child);\n\t      if (parent) {\n\t        prevChild = prev[parent];\n\t        prev[parent] = child;\n\t      } else {\n\t        prevChild = rootPrev;\n\t        rootPrev = child;\n\t      }\n\t      if (prevChild && prevChild !== child) {\n\t        cg.setEdge(prevChild, child);\n\t        return;\n\t      }\n\t      child = parent;\n\t    }\n\t  });\n\n\t  /*\n\t  function dfs(v) {\n\t    var children = v ? g.children(v) : g.children();\n\t    if (children.length) {\n\t      var min = Number.POSITIVE_INFINITY,\n\t          subgraphs = [];\n\t      _.each(children, function(child) {\n\t        var childMin = dfs(child);\n\t        if (g.children(child).length) {\n\t          subgraphs.push({ v: child, order: childMin });\n\t        }\n\t        min = Math.min(min, childMin);\n\t      });\n\t      _.reduce(_.sortBy(subgraphs, \"order\"), function(prev, curr) {\n\t        cg.setEdge(prev.v, curr.v);\n\t        return curr;\n\t      });\n\t      return min;\n\t    }\n\t    return g.node(v).order;\n\t  }\n\t  dfs(undefined);\n\t  */\n\t}\n\treturn addSubgraphConstraints_1;\n}\n\nexport { requireAddSubgraphConstraints as __require };\n//# sourceMappingURL=add-subgraph-constraints.js.map\n"],"names":[],"mappings":";AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,gCAAiC;AACzC,MAAI,kCAAmC,QAAO;AAC9C,sCAAoC;AACpC,MAAI,IAAI,cAAa;AAErB,6BAA2B;AAE3B,WAAS,uBAAuB,GAAG,IAAI,IAAI;AACzC,QAAI,OAAO,CAAA,GACT;AAEF,MAAE,QAAQ,IAAI,SAAS,GAAG;AACxB,UAAI,QAAQ,EAAE,OAAO,CAAC,GACpB,QACA;AACF,aAAO,OAAO;AACZ,iBAAS,EAAE,OAAO,KAAK;AACvB,YAAI,QAAQ;AACV,sBAAY,KAAK,MAAM;AACvB,eAAK,MAAM,IAAI;AAAA,QACjB,OAAO;AACL,sBAAY;AACZ,qBAAW;AAAA,QACb;AACA,YAAI,aAAa,cAAc,OAAO;AACpC,aAAG,QAAQ,WAAW,KAAK;AAC3B;AAAA,QACF;AACA,gBAAQ;AAAA,MACV;AAAA,IACF,CAAC;AAAA,EAyBH;AACA,SAAO;AACR;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/barycenter.cjs

@@ -0,0 +1,35 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const lodash = require("../lodash.cjs");
+var barycenter_1;
+var hasRequiredBarycenter;
+function requireBarycenter() {
+  if (hasRequiredBarycenter) return barycenter_1;
+  hasRequiredBarycenter = 1;
+  var _ = lodash.__require();
+  barycenter_1 = barycenter;
+  function barycenter(g, movable) {
+    return _.map(movable, function(v) {
+      var inV = g.inEdges(v);
+      if (!inV.length) {
+        return { v };
+      } else {
+        var result = _.reduce(inV, function(acc, e) {
+          var edge = g.edge(e), nodeU = g.node(e.v);
+          return {
+            sum: acc.sum + edge.weight * nodeU.order,
+            weight: acc.weight + edge.weight
+          };
+        }, { sum: 0, weight: 0 });
+        return {
+          v,
+          barycenter: result.sum / result.weight,
+          weight: result.weight
+        };
+      }
+    });
+  }
+  return barycenter_1;
+}
+exports.__require = requireBarycenter;
+//# sourceMappingURL=barycenter.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/barycenter.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"barycenter.cjs","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/barycenter.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\n\nvar barycenter_1;\nvar hasRequiredBarycenter;\n\nfunction requireBarycenter () {\n\tif (hasRequiredBarycenter) return barycenter_1;\n\thasRequiredBarycenter = 1;\n\tvar _ = requireLodash();\n\n\tbarycenter_1 = barycenter;\n\n\tfunction barycenter(g, movable) {\n\t  return _.map(movable, function(v) {\n\t    var inV = g.inEdges(v);\n\t    if (!inV.length) {\n\t      return { v: v };\n\t    } else {\n\t      var result = _.reduce(inV, function(acc, e) {\n\t        var edge = g.edge(e),\n\t          nodeU = g.node(e.v);\n\t        return {\n\t          sum: acc.sum + (edge.weight * nodeU.order),\n\t          weight: acc.weight + edge.weight\n\t        };\n\t      }, { sum: 0, weight: 0 });\n\n\t      return {\n\t        v: v,\n\t        barycenter: result.sum / result.weight,\n\t        weight: result.weight\n\t      };\n\t    }\n\t  });\n\t}\n\treturn barycenter_1;\n}\n\nexport { requireBarycenter as __require };\n//# sourceMappingURL=barycenter.js.map\n"],"names":["requireLodash"],"mappings":";;;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,oBAAqB;AAC7B,MAAI,sBAAuB,QAAO;AAClC,0BAAwB;AACxB,MAAI,IAAIA,OAAAA,UAAa;AAErB,iBAAe;AAEf,WAAS,WAAW,GAAG,SAAS;AAC9B,WAAO,EAAE,IAAI,SAAS,SAAS,GAAG;AAChC,UAAI,MAAM,EAAE,QAAQ,CAAC;AACrB,UAAI,CAAC,IAAI,QAAQ;AACf,eAAO,EAAE,EAAI;AAAA,MACf,OAAO;AACL,YAAI,SAAS,EAAE,OAAO,KAAK,SAAS,KAAK,GAAG;AAC1C,cAAI,OAAO,EAAE,KAAK,CAAC,GACjB,QAAQ,EAAE,KAAK,EAAE,CAAC;AACpB,iBAAO;AAAA,YACL,KAAK,IAAI,MAAO,KAAK,SAAS,MAAM;AAAA,YACpC,QAAQ,IAAI,SAAS,KAAK;AAAA,UACrC;AAAA,QACO,GAAG,EAAE,KAAK,GAAG,QAAQ,EAAC,CAAE;AAExB,eAAO;AAAA,UACL;AAAA,UACA,YAAY,OAAO,MAAM,OAAO;AAAA,UAChC,QAAQ,OAAO;AAAA,QACxB;AAAA,MACK;AAAA,IACF,CAAC;AAAA,EACH;AACA,SAAO;AACR;;","x_google_ignoreList":[0]}