@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/order/resolve-conflicts.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolve-conflicts.cjs","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/resolve-conflicts.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\n\nvar resolveConflicts_1;\nvar hasRequiredResolveConflicts;\n\nfunction requireResolveConflicts () {\n\tif (hasRequiredResolveConflicts) return resolveConflicts_1;\n\thasRequiredResolveConflicts = 1;\n\n\tvar _ = requireLodash();\n\n\tresolveConflicts_1 = resolveConflicts;\n\n\t/*\n\t * Given a list of entries of the form {v, barycenter, weight} and a\n\t * constraint graph this function will resolve any conflicts between the\n\t * constraint graph and the barycenters for the entries. If the barycenters for\n\t * an entry would violate a constraint in the constraint graph then we coalesce\n\t * the nodes in the conflict into a new node that respects the contraint and\n\t * aggregates barycenter and weight information.\n\t *\n\t * This implementation is based on the description in Forster, \"A Fast and\n\t * Simple Hueristic for Constrained Two-Level Crossing Reduction,\" thought it\n\t * differs in some specific details.\n\t *\n\t * Pre-conditions:\n\t *\n\t *    1. Each entry has the form {v, barycenter, weight}, or if the node has\n\t *       no barycenter, then {v}.\n\t *\n\t * Returns:\n\t *\n\t *    A new list of entries of the form {vs, i, barycenter, weight}. The list\n\t *    `vs` may either be a singleton or it may be an aggregation of nodes\n\t *    ordered such that they do not violate constraints from the constraint\n\t *    graph. The property `i` is the lowest original index of any of the\n\t *    elements in `vs`.\n\t */\n\tfunction resolveConflicts(entries, cg) {\n\t  var mappedEntries = {};\n\t  _.forEach(entries, function(entry, i) {\n\t    var tmp = mappedEntries[entry.v] = {\n\t      indegree: 0,\n\t      \"in\": [],\n\t      out: [],\n\t      vs: [entry.v],\n\t      i: i\n\t    };\n\t    if (!_.isUndefined(entry.barycenter)) {\n\t      tmp.barycenter = entry.barycenter;\n\t      tmp.weight = entry.weight;\n\t    }\n\t  });\n\n\t  _.forEach(cg.edges(), function(e) {\n\t    var entryV = mappedEntries[e.v];\n\t    var entryW = mappedEntries[e.w];\n\t    if (!_.isUndefined(entryV) && !_.isUndefined(entryW)) {\n\t      entryW.indegree++;\n\t      entryV.out.push(mappedEntries[e.w]);\n\t    }\n\t  });\n\n\t  var sourceSet = _.filter(mappedEntries, function(entry) {\n\t    return !entry.indegree;\n\t  });\n\n\t  return doResolveConflicts(sourceSet);\n\t}\n\n\tfunction doResolveConflicts(sourceSet) {\n\t  var entries = [];\n\n\t  function handleIn(vEntry) {\n\t    return function(uEntry) {\n\t      if (uEntry.merged) {\n\t        return;\n\t      }\n\t      if (_.isUndefined(uEntry.barycenter) ||\n\t          _.isUndefined(vEntry.barycenter) ||\n\t          uEntry.barycenter >= vEntry.barycenter) {\n\t        mergeEntries(vEntry, uEntry);\n\t      }\n\t    };\n\t  }\n\n\t  function handleOut(vEntry) {\n\t    return function(wEntry) {\n\t      wEntry[\"in\"].push(vEntry);\n\t      if (--wEntry.indegree === 0) {\n\t        sourceSet.push(wEntry);\n\t      }\n\t    };\n\t  }\n\n\t  while (sourceSet.length) {\n\t    var entry = sourceSet.pop();\n\t    entries.push(entry);\n\t    _.forEach(entry[\"in\"].reverse(), handleIn(entry));\n\t    _.forEach(entry.out, handleOut(entry));\n\t  }\n\n\t  return _.map(_.filter(entries, function(entry) { return !entry.merged; }),\n\t    function(entry) {\n\t      return _.pick(entry, [\"vs\", \"i\", \"barycenter\", \"weight\"]);\n\t    });\n\n\t}\n\n\tfunction mergeEntries(target, source) {\n\t  var sum = 0;\n\t  var weight = 0;\n\n\t  if (target.weight) {\n\t    sum += target.barycenter * target.weight;\n\t    weight += target.weight;\n\t  }\n\n\t  if (source.weight) {\n\t    sum += source.barycenter * source.weight;\n\t    weight += source.weight;\n\t  }\n\n\t  target.vs = source.vs.concat(target.vs);\n\t  target.barycenter = sum / weight;\n\t  target.weight = weight;\n\t  target.i = Math.min(source.i, target.i);\n\t  source.merged = true;\n\t}\n\treturn resolveConflicts_1;\n}\n\nexport { requireResolveConflicts as __require };\n//# sourceMappingURL=resolve-conflicts.js.map\n"],"names":["requireLodash","entry"],"mappings":";;;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,0BAA2B;AACnC,MAAI,4BAA6B,QAAO;AACxC,gCAA8B;AAE9B,MAAI,IAAIA,OAAAA,UAAa;AAErB,uBAAqB;AA2BrB,WAAS,iBAAiB,SAAS,IAAI;AACrC,QAAI,gBAAgB,CAAA;AACpB,MAAE,QAAQ,SAAS,SAAS,OAAO,GAAG;AACpC,UAAI,MAAM,cAAc,MAAM,CAAC,IAAI;AAAA,QACjC,UAAU;AAAA,QACV,MAAM,CAAA;AAAA,QACN,KAAK,CAAA;AAAA,QACL,IAAI,CAAC,MAAM,CAAC;AAAA,QACZ;AAAA,MACP;AACK,UAAI,CAAC,EAAE,YAAY,MAAM,UAAU,GAAG;AACpC,YAAI,aAAa,MAAM;AACvB,YAAI,SAAS,MAAM;AAAA,MACrB;AAAA,IACF,CAAC;AAED,MAAE,QAAQ,GAAG,MAAK,GAAI,SAAS,GAAG;AAChC,UAAI,SAAS,cAAc,EAAE,CAAC;AAC9B,UAAI,SAAS,cAAc,EAAE,CAAC;AAC9B,UAAI,CAAC,EAAE,YAAY,MAAM,KAAK,CAAC,EAAE,YAAY,MAAM,GAAG;AACpD,eAAO;AACP,eAAO,IAAI,KAAK,cAAc,EAAE,CAAC,CAAC;AAAA,MACpC;AAAA,IACF,CAAC;AAED,QAAI,YAAY,EAAE,OAAO,eAAe,SAAS,OAAO;AACtD,aAAO,CAAC,MAAM;AAAA,IAChB,CAAC;AAED,WAAO,mBAAmB,SAAS;AAAA,EACrC;AAEA,WAAS,mBAAmB,WAAW;AACrC,QAAI,UAAU,CAAA;AAEd,aAAS,SAAS,QAAQ;AACxB,aAAO,SAAS,QAAQ;AACtB,YAAI,OAAO,QAAQ;AACjB;AAAA,QACF;AACA,YAAI,EAAE,YAAY,OAAO,UAAU,KAC/B,EAAE,YAAY,OAAO,UAAU,KAC/B,OAAO,cAAc,OAAO,YAAY;AAC1C,uBAAa,QAAQ,MAAM;AAAA,QAC7B;AAAA,MACF;AAAA,IACF;AAEA,aAAS,UAAU,QAAQ;AACzB,aAAO,SAAS,QAAQ;AACtB,eAAO,IAAI,EAAE,KAAK,MAAM;AACxB,YAAI,EAAE,OAAO,aAAa,GAAG;AAC3B,oBAAU,KAAK,MAAM;AAAA,QACvB;AAAA,MACF;AAAA,IACF;AAEA,WAAO,UAAU,QAAQ;AACvB,UAAI,QAAQ,UAAU,IAAG;AACzB,cAAQ,KAAK,KAAK;AAClB,QAAE,QAAQ,MAAM,IAAI,EAAE,WAAW,SAAS,KAAK,CAAC;AAChD,QAAE,QAAQ,MAAM,KAAK,UAAU,KAAK,CAAC;AAAA,IACvC;AAEA,WAAO,EAAE;AAAA,MAAI,EAAE,OAAO,SAAS,SAASC,QAAO;AAAE,eAAO,CAACA,OAAM;AAAA,MAAQ,CAAC;AAAA,MACtE,SAASA,QAAO;AACd,eAAO,EAAE,KAAKA,QAAO,CAAC,MAAM,KAAK,cAAc,QAAQ,CAAC;AAAA,MAC1D;AAAA,IAAC;AAAA,EAEL;AAEA,WAAS,aAAa,QAAQ,QAAQ;AACpC,QAAI,MAAM;AACV,QAAI,SAAS;AAEb,QAAI,OAAO,QAAQ;AACjB,aAAO,OAAO,aAAa,OAAO;AAClC,gBAAU,OAAO;AAAA,IACnB;AAEA,QAAI,OAAO,QAAQ;AACjB,aAAO,OAAO,aAAa,OAAO;AAClC,gBAAU,OAAO;AAAA,IACnB;AAEA,WAAO,KAAK,OAAO,GAAG,OAAO,OAAO,EAAE;AACtC,WAAO,aAAa,MAAM;AAC1B,WAAO,SAAS;AAChB,WAAO,IAAI,KAAK,IAAI,OAAO,GAAG,OAAO,CAAC;AACtC,WAAO,SAAS;AAAA,EAClB;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/resolve-conflicts.js

@@ -0,0 +1,94 @@
+import { __require as requireLodash } from "../lodash.js";
+var resolveConflicts_1;
+var hasRequiredResolveConflicts;
+function requireResolveConflicts() {
+  if (hasRequiredResolveConflicts) return resolveConflicts_1;
+  hasRequiredResolveConflicts = 1;
+  var _ = requireLodash();
+  resolveConflicts_1 = resolveConflicts;
+  function resolveConflicts(entries, cg) {
+    var mappedEntries = {};
+    _.forEach(entries, function(entry, i) {
+      var tmp = mappedEntries[entry.v] = {
+        indegree: 0,
+        "in": [],
+        out: [],
+        vs: [entry.v],
+        i
+      };
+      if (!_.isUndefined(entry.barycenter)) {
+        tmp.barycenter = entry.barycenter;
+        tmp.weight = entry.weight;
+      }
+    });
+    _.forEach(cg.edges(), function(e) {
+      var entryV = mappedEntries[e.v];
+      var entryW = mappedEntries[e.w];
+      if (!_.isUndefined(entryV) && !_.isUndefined(entryW)) {
+        entryW.indegree++;
+        entryV.out.push(mappedEntries[e.w]);
+      }
+    });
+    var sourceSet = _.filter(mappedEntries, function(entry) {
+      return !entry.indegree;
+    });
+    return doResolveConflicts(sourceSet);
+  }
+  function doResolveConflicts(sourceSet) {
+    var entries = [];
+    function handleIn(vEntry) {
+      return function(uEntry) {
+        if (uEntry.merged) {
+          return;
+        }
+        if (_.isUndefined(uEntry.barycenter) || _.isUndefined(vEntry.barycenter) || uEntry.barycenter >= vEntry.barycenter) {
+          mergeEntries(vEntry, uEntry);
+        }
+      };
+    }
+    function handleOut(vEntry) {
+      return function(wEntry) {
+        wEntry["in"].push(vEntry);
+        if (--wEntry.indegree === 0) {
+          sourceSet.push(wEntry);
+        }
+      };
+    }
+    while (sourceSet.length) {
+      var entry = sourceSet.pop();
+      entries.push(entry);
+      _.forEach(entry["in"].reverse(), handleIn(entry));
+      _.forEach(entry.out, handleOut(entry));
+    }
+    return _.map(
+      _.filter(entries, function(entry2) {
+        return !entry2.merged;
+      }),
+      function(entry2) {
+        return _.pick(entry2, ["vs", "i", "barycenter", "weight"]);
+      }
+    );
+  }
+  function mergeEntries(target, source) {
+    var sum = 0;
+    var weight = 0;
+    if (target.weight) {
+      sum += target.barycenter * target.weight;
+      weight += target.weight;
+    }
+    if (source.weight) {
+      sum += source.barycenter * source.weight;
+      weight += source.weight;
+    }
+    target.vs = source.vs.concat(target.vs);
+    target.barycenter = sum / weight;
+    target.weight = weight;
+    target.i = Math.min(source.i, target.i);
+    source.merged = true;
+  }
+  return resolveConflicts_1;
+}
+export {
+  requireResolveConflicts as __require
+};
+//# sourceMappingURL=resolve-conflicts.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/resolve-conflicts.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"resolve-conflicts.js","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/resolve-conflicts.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\n\nvar resolveConflicts_1;\nvar hasRequiredResolveConflicts;\n\nfunction requireResolveConflicts () {\n\tif (hasRequiredResolveConflicts) return resolveConflicts_1;\n\thasRequiredResolveConflicts = 1;\n\n\tvar _ = requireLodash();\n\n\tresolveConflicts_1 = resolveConflicts;\n\n\t/*\n\t * Given a list of entries of the form {v, barycenter, weight} and a\n\t * constraint graph this function will resolve any conflicts between the\n\t * constraint graph and the barycenters for the entries. If the barycenters for\n\t * an entry would violate a constraint in the constraint graph then we coalesce\n\t * the nodes in the conflict into a new node that respects the contraint and\n\t * aggregates barycenter and weight information.\n\t *\n\t * This implementation is based on the description in Forster, \"A Fast and\n\t * Simple Hueristic for Constrained Two-Level Crossing Reduction,\" thought it\n\t * differs in some specific details.\n\t *\n\t * Pre-conditions:\n\t *\n\t *    1. Each entry has the form {v, barycenter, weight}, or if the node has\n\t *       no barycenter, then {v}.\n\t *\n\t * Returns:\n\t *\n\t *    A new list of entries of the form {vs, i, barycenter, weight}. The list\n\t *    `vs` may either be a singleton or it may be an aggregation of nodes\n\t *    ordered such that they do not violate constraints from the constraint\n\t *    graph. The property `i` is the lowest original index of any of the\n\t *    elements in `vs`.\n\t */\n\tfunction resolveConflicts(entries, cg) {\n\t  var mappedEntries = {};\n\t  _.forEach(entries, function(entry, i) {\n\t    var tmp = mappedEntries[entry.v] = {\n\t      indegree: 0,\n\t      \"in\": [],\n\t      out: [],\n\t      vs: [entry.v],\n\t      i: i\n\t    };\n\t    if (!_.isUndefined(entry.barycenter)) {\n\t      tmp.barycenter = entry.barycenter;\n\t      tmp.weight = entry.weight;\n\t    }\n\t  });\n\n\t  _.forEach(cg.edges(), function(e) {\n\t    var entryV = mappedEntries[e.v];\n\t    var entryW = mappedEntries[e.w];\n\t    if (!_.isUndefined(entryV) && !_.isUndefined(entryW)) {\n\t      entryW.indegree++;\n\t      entryV.out.push(mappedEntries[e.w]);\n\t    }\n\t  });\n\n\t  var sourceSet = _.filter(mappedEntries, function(entry) {\n\t    return !entry.indegree;\n\t  });\n\n\t  return doResolveConflicts(sourceSet);\n\t}\n\n\tfunction doResolveConflicts(sourceSet) {\n\t  var entries = [];\n\n\t  function handleIn(vEntry) {\n\t    return function(uEntry) {\n\t      if (uEntry.merged) {\n\t        return;\n\t      }\n\t      if (_.isUndefined(uEntry.barycenter) ||\n\t          _.isUndefined(vEntry.barycenter) ||\n\t          uEntry.barycenter >= vEntry.barycenter) {\n\t        mergeEntries(vEntry, uEntry);\n\t      }\n\t    };\n\t  }\n\n\t  function handleOut(vEntry) {\n\t    return function(wEntry) {\n\t      wEntry[\"in\"].push(vEntry);\n\t      if (--wEntry.indegree === 0) {\n\t        sourceSet.push(wEntry);\n\t      }\n\t    };\n\t  }\n\n\t  while (sourceSet.length) {\n\t    var entry = sourceSet.pop();\n\t    entries.push(entry);\n\t    _.forEach(entry[\"in\"].reverse(), handleIn(entry));\n\t    _.forEach(entry.out, handleOut(entry));\n\t  }\n\n\t  return _.map(_.filter(entries, function(entry) { return !entry.merged; }),\n\t    function(entry) {\n\t      return _.pick(entry, [\"vs\", \"i\", \"barycenter\", \"weight\"]);\n\t    });\n\n\t}\n\n\tfunction mergeEntries(target, source) {\n\t  var sum = 0;\n\t  var weight = 0;\n\n\t  if (target.weight) {\n\t    sum += target.barycenter * target.weight;\n\t    weight += target.weight;\n\t  }\n\n\t  if (source.weight) {\n\t    sum += source.barycenter * source.weight;\n\t    weight += source.weight;\n\t  }\n\n\t  target.vs = source.vs.concat(target.vs);\n\t  target.barycenter = sum / weight;\n\t  target.weight = weight;\n\t  target.i = Math.min(source.i, target.i);\n\t  source.merged = true;\n\t}\n\treturn resolveConflicts_1;\n}\n\nexport { requireResolveConflicts as __require };\n//# sourceMappingURL=resolve-conflicts.js.map\n"],"names":["entry"],"mappings":";AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,0BAA2B;AACnC,MAAI,4BAA6B,QAAO;AACxC,gCAA8B;AAE9B,MAAI,IAAI,cAAa;AAErB,uBAAqB;AA2BrB,WAAS,iBAAiB,SAAS,IAAI;AACrC,QAAI,gBAAgB,CAAA;AACpB,MAAE,QAAQ,SAAS,SAAS,OAAO,GAAG;AACpC,UAAI,MAAM,cAAc,MAAM,CAAC,IAAI;AAAA,QACjC,UAAU;AAAA,QACV,MAAM,CAAA;AAAA,QACN,KAAK,CAAA;AAAA,QACL,IAAI,CAAC,MAAM,CAAC;AAAA,QACZ;AAAA,MACP;AACK,UAAI,CAAC,EAAE,YAAY,MAAM,UAAU,GAAG;AACpC,YAAI,aAAa,MAAM;AACvB,YAAI,SAAS,MAAM;AAAA,MACrB;AAAA,IACF,CAAC;AAED,MAAE,QAAQ,GAAG,MAAK,GAAI,SAAS,GAAG;AAChC,UAAI,SAAS,cAAc,EAAE,CAAC;AAC9B,UAAI,SAAS,cAAc,EAAE,CAAC;AAC9B,UAAI,CAAC,EAAE,YAAY,MAAM,KAAK,CAAC,EAAE,YAAY,MAAM,GAAG;AACpD,eAAO;AACP,eAAO,IAAI,KAAK,cAAc,EAAE,CAAC,CAAC;AAAA,MACpC;AAAA,IACF,CAAC;AAED,QAAI,YAAY,EAAE,OAAO,eAAe,SAAS,OAAO;AACtD,aAAO,CAAC,MAAM;AAAA,IAChB,CAAC;AAED,WAAO,mBAAmB,SAAS;AAAA,EACrC;AAEA,WAAS,mBAAmB,WAAW;AACrC,QAAI,UAAU,CAAA;AAEd,aAAS,SAAS,QAAQ;AACxB,aAAO,SAAS,QAAQ;AACtB,YAAI,OAAO,QAAQ;AACjB;AAAA,QACF;AACA,YAAI,EAAE,YAAY,OAAO,UAAU,KAC/B,EAAE,YAAY,OAAO,UAAU,KAC/B,OAAO,cAAc,OAAO,YAAY;AAC1C,uBAAa,QAAQ,MAAM;AAAA,QAC7B;AAAA,MACF;AAAA,IACF;AAEA,aAAS,UAAU,QAAQ;AACzB,aAAO,SAAS,QAAQ;AACtB,eAAO,IAAI,EAAE,KAAK,MAAM;AACxB,YAAI,EAAE,OAAO,aAAa,GAAG;AAC3B,oBAAU,KAAK,MAAM;AAAA,QACvB;AAAA,MACF;AAAA,IACF;AAEA,WAAO,UAAU,QAAQ;AACvB,UAAI,QAAQ,UAAU,IAAG;AACzB,cAAQ,KAAK,KAAK;AAClB,QAAE,QAAQ,MAAM,IAAI,EAAE,WAAW,SAAS,KAAK,CAAC;AAChD,QAAE,QAAQ,MAAM,KAAK,UAAU,KAAK,CAAC;AAAA,IACvC;AAEA,WAAO,EAAE;AAAA,MAAI,EAAE,OAAO,SAAS,SAASA,QAAO;AAAE,eAAO,CAACA,OAAM;AAAA,MAAQ,CAAC;AAAA,MACtE,SAASA,QAAO;AACd,eAAO,EAAE,KAAKA,QAAO,CAAC,MAAM,KAAK,cAAc,QAAQ,CAAC;AAAA,MAC1D;AAAA,IAAC;AAAA,EAEL;AAEA,WAAS,aAAa,QAAQ,QAAQ;AACpC,QAAI,MAAM;AACV,QAAI,SAAS;AAEb,QAAI,OAAO,QAAQ;AACjB,aAAO,OAAO,aAAa,OAAO;AAClC,gBAAU,OAAO;AAAA,IACnB;AAEA,QAAI,OAAO,QAAQ;AACjB,aAAO,OAAO,aAAa,OAAO;AAClC,gBAAU,OAAO;AAAA,IACnB;AAEA,WAAO,KAAK,OAAO,GAAG,OAAO,OAAO,EAAE;AACtC,WAAO,aAAa,MAAM;AAC1B,WAAO,SAAS;AAChB,WAAO,IAAI,KAAK,IAAI,OAAO,GAAG,OAAO,CAAC;AACtC,WAAO,SAAS;AAAA,EAClB;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/sort-subgraph.cjs

@@ -0,0 +1,77 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const lodash = require("../lodash.cjs");
+const barycenter = require("./barycenter.cjs");
+const resolveConflicts = require("./resolve-conflicts.cjs");
+const sort = require("./sort.cjs");
+var sortSubgraph_1;
+var hasRequiredSortSubgraph;
+function requireSortSubgraph() {
+  if (hasRequiredSortSubgraph) return sortSubgraph_1;
+  hasRequiredSortSubgraph = 1;
+  var _ = lodash.__require();
+  var barycenter$1 = barycenter.__require();
+  var resolveConflicts$1 = resolveConflicts.__require();
+  var sort$1 = sort.__require();
+  sortSubgraph_1 = sortSubgraph;
+  function sortSubgraph(g, v, cg, biasRight) {
+    var movable = g.children(v);
+    var node = g.node(v);
+    var bl = node ? node.borderLeft : void 0;
+    var br = node ? node.borderRight : void 0;
+    var subgraphs = {};
+    if (bl) {
+      movable = _.filter(movable, function(w) {
+        return w !== bl && w !== br;
+      });
+    }
+    var barycenters = barycenter$1(g, movable);
+    _.forEach(barycenters, function(entry) {
+      if (g.children(entry.v).length) {
+        var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);
+        subgraphs[entry.v] = subgraphResult;
+        if (_.has(subgraphResult, "barycenter")) {
+          mergeBarycenters(entry, subgraphResult);
+        }
+      }
+    });
+    var entries = resolveConflicts$1(barycenters, cg);
+    expandSubgraphs(entries, subgraphs);
+    var result = sort$1(entries, biasRight);
+    if (bl) {
+      result.vs = _.flatten([bl, result.vs, br], true);
+      if (g.predecessors(bl).length) {
+        var blPred = g.node(g.predecessors(bl)[0]), brPred = g.node(g.predecessors(br)[0]);
+        if (!_.has(result, "barycenter")) {
+          result.barycenter = 0;
+          result.weight = 0;
+        }
+        result.barycenter = (result.barycenter * result.weight + blPred.order + brPred.order) / (result.weight + 2);
+        result.weight += 2;
+      }
+    }
+    return result;
+  }
+  function expandSubgraphs(entries, subgraphs) {
+    _.forEach(entries, function(entry) {
+      entry.vs = _.flatten(entry.vs.map(function(v) {
+        if (subgraphs[v]) {
+          return subgraphs[v].vs;
+        }
+        return v;
+      }), true);
+    });
+  }
+  function mergeBarycenters(target, other) {
+    if (!_.isUndefined(target.barycenter)) {
+      target.barycenter = (target.barycenter * target.weight + other.barycenter * other.weight) / (target.weight + other.weight);
+      target.weight += other.weight;
+    } else {
+      target.barycenter = other.barycenter;
+      target.weight = other.weight;
+    }
+  }
+  return sortSubgraph_1;
+}
+exports.__require = requireSortSubgraph;
+//# sourceMappingURL=sort-subgraph.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sort-subgraph.cjs","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/sort-subgraph.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\nimport { __require as requireBarycenter } from './barycenter.js';\nimport { __require as requireResolveConflicts } from './resolve-conflicts.js';\nimport { __require as requireSort } from './sort.js';\n\nvar sortSubgraph_1;\nvar hasRequiredSortSubgraph;\n\nfunction requireSortSubgraph () {\n\tif (hasRequiredSortSubgraph) return sortSubgraph_1;\n\thasRequiredSortSubgraph = 1;\n\tvar _ = requireLodash();\n\tvar barycenter = requireBarycenter();\n\tvar resolveConflicts = requireResolveConflicts();\n\tvar sort = requireSort();\n\n\tsortSubgraph_1 = sortSubgraph;\n\n\tfunction sortSubgraph(g, v, cg, biasRight) {\n\t  var movable = g.children(v);\n\t  var node = g.node(v);\n\t  var bl = node ? node.borderLeft : undefined;\n\t  var br = node ? node.borderRight: undefined;\n\t  var subgraphs = {};\n\n\t  if (bl) {\n\t    movable = _.filter(movable, function(w) {\n\t      return w !== bl && w !== br;\n\t    });\n\t  }\n\n\t  var barycenters = barycenter(g, movable);\n\t  _.forEach(barycenters, function(entry) {\n\t    if (g.children(entry.v).length) {\n\t      var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);\n\t      subgraphs[entry.v] = subgraphResult;\n\t      if (_.has(subgraphResult, \"barycenter\")) {\n\t        mergeBarycenters(entry, subgraphResult);\n\t      }\n\t    }\n\t  });\n\n\t  var entries = resolveConflicts(barycenters, cg);\n\t  expandSubgraphs(entries, subgraphs);\n\n\t  var result = sort(entries, biasRight);\n\n\t  if (bl) {\n\t    result.vs = _.flatten([bl, result.vs, br], true);\n\t    if (g.predecessors(bl).length) {\n\t      var blPred = g.node(g.predecessors(bl)[0]),\n\t        brPred = g.node(g.predecessors(br)[0]);\n\t      if (!_.has(result, \"barycenter\")) {\n\t        result.barycenter = 0;\n\t        result.weight = 0;\n\t      }\n\t      result.barycenter = (result.barycenter * result.weight +\n\t                           blPred.order + brPred.order) / (result.weight + 2);\n\t      result.weight += 2;\n\t    }\n\t  }\n\n\t  return result;\n\t}\n\n\tfunction expandSubgraphs(entries, subgraphs) {\n\t  _.forEach(entries, function(entry) {\n\t    entry.vs = _.flatten(entry.vs.map(function(v) {\n\t      if (subgraphs[v]) {\n\t        return subgraphs[v].vs;\n\t      }\n\t      return v;\n\t    }), true);\n\t  });\n\t}\n\n\tfunction mergeBarycenters(target, other) {\n\t  if (!_.isUndefined(target.barycenter)) {\n\t    target.barycenter = (target.barycenter * target.weight +\n\t                         other.barycenter * other.weight) /\n\t                        (target.weight + other.weight);\n\t    target.weight += other.weight;\n\t  } else {\n\t    target.barycenter = other.barycenter;\n\t    target.weight = other.weight;\n\t  }\n\t}\n\treturn sortSubgraph_1;\n}\n\nexport { requireSortSubgraph as __require };\n//# sourceMappingURL=sort-subgraph.js.map\n"],"names":["requireLodash","barycenter","requireBarycenter","resolveConflicts","requireResolveConflicts","sort","requireSort"],"mappings":";;;;;;AAKA,IAAI;AACJ,IAAI;AAEJ,SAAS,sBAAuB;AAC/B,MAAI,wBAAyB,QAAO;AACpC,4BAA0B;AAC1B,MAAI,IAAIA,OAAAA,UAAa;AACrB,MAAIC,eAAaC,WAAAA,UAAiB;AAClC,MAAIC,qBAAmBC,iBAAAA,UAAuB;AAC9C,MAAIC,SAAOC,KAAAA,UAAW;AAEtB,mBAAiB;AAEjB,WAAS,aAAa,GAAG,GAAG,IAAI,WAAW;AACzC,QAAI,UAAU,EAAE,SAAS,CAAC;AAC1B,QAAI,OAAO,EAAE,KAAK,CAAC;AACnB,QAAI,KAAK,OAAO,KAAK,aAAa;AAClC,QAAI,KAAK,OAAO,KAAK,cAAa;AAClC,QAAI,YAAY,CAAA;AAEhB,QAAI,IAAI;AACN,gBAAU,EAAE,OAAO,SAAS,SAAS,GAAG;AACtC,eAAO,MAAM,MAAM,MAAM;AAAA,MAC3B,CAAC;AAAA,IACH;AAEA,QAAI,cAAcL,aAAW,GAAG,OAAO;AACvC,MAAE,QAAQ,aAAa,SAAS,OAAO;AACrC,UAAI,EAAE,SAAS,MAAM,CAAC,EAAE,QAAQ;AAC9B,YAAI,iBAAiB,aAAa,GAAG,MAAM,GAAG,IAAI,SAAS;AAC3D,kBAAU,MAAM,CAAC,IAAI;AACrB,YAAI,EAAE,IAAI,gBAAgB,YAAY,GAAG;AACvC,2BAAiB,OAAO,cAAc;AAAA,QACxC;AAAA,MACF;AAAA,IACF,CAAC;AAED,QAAI,UAAUE,mBAAiB,aAAa,EAAE;AAC9C,oBAAgB,SAAS,SAAS;AAElC,QAAI,SAASE,OAAK,SAAS,SAAS;AAEpC,QAAI,IAAI;AACN,aAAO,KAAK,EAAE,QAAQ,CAAC,IAAI,OAAO,IAAI,EAAE,GAAG,IAAI;AAC/C,UAAI,EAAE,aAAa,EAAE,EAAE,QAAQ;AAC7B,YAAI,SAAS,EAAE,KAAK,EAAE,aAAa,EAAE,EAAE,CAAC,CAAC,GACvC,SAAS,EAAE,KAAK,EAAE,aAAa,EAAE,EAAE,CAAC,CAAC;AACvC,YAAI,CAAC,EAAE,IAAI,QAAQ,YAAY,GAAG;AAChC,iBAAO,aAAa;AACpB,iBAAO,SAAS;AAAA,QAClB;AACA,eAAO,cAAc,OAAO,aAAa,OAAO,SAC3B,OAAO,QAAQ,OAAO,UAAU,OAAO,SAAS;AACrE,eAAO,UAAU;AAAA,MACnB;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAEA,WAAS,gBAAgB,SAAS,WAAW;AAC3C,MAAE,QAAQ,SAAS,SAAS,OAAO;AACjC,YAAM,KAAK,EAAE,QAAQ,MAAM,GAAG,IAAI,SAAS,GAAG;AAC5C,YAAI,UAAU,CAAC,GAAG;AAChB,iBAAO,UAAU,CAAC,EAAE;AAAA,QACtB;AACA,eAAO;AAAA,MACT,CAAC,GAAG,IAAI;AAAA,IACV,CAAC;AAAA,EACH;AAEA,WAAS,iBAAiB,QAAQ,OAAO;AACvC,QAAI,CAAC,EAAE,YAAY,OAAO,UAAU,GAAG;AACrC,aAAO,cAAc,OAAO,aAAa,OAAO,SAC3B,MAAM,aAAa,MAAM,WACzB,OAAO,SAAS,MAAM;AAC3C,aAAO,UAAU,MAAM;AAAA,IACzB,OAAO;AACL,aAAO,aAAa,MAAM;AAC1B,aAAO,SAAS,MAAM;AAAA,IACxB;AAAA,EACF;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/sort-subgraph.js

@@ -0,0 +1,77 @@
+import { __require as requireLodash } from "../lodash.js";
+import { __require as requireBarycenter } from "./barycenter.js";
+import { __require as requireResolveConflicts } from "./resolve-conflicts.js";
+import { __require as requireSort } from "./sort.js";
+var sortSubgraph_1;
+var hasRequiredSortSubgraph;
+function requireSortSubgraph() {
+  if (hasRequiredSortSubgraph) return sortSubgraph_1;
+  hasRequiredSortSubgraph = 1;
+  var _ = requireLodash();
+  var barycenter = requireBarycenter();
+  var resolveConflicts = requireResolveConflicts();
+  var sort = requireSort();
+  sortSubgraph_1 = sortSubgraph;
+  function sortSubgraph(g, v, cg, biasRight) {
+    var movable = g.children(v);
+    var node = g.node(v);
+    var bl = node ? node.borderLeft : void 0;
+    var br = node ? node.borderRight : void 0;
+    var subgraphs = {};
+    if (bl) {
+      movable = _.filter(movable, function(w) {
+        return w !== bl && w !== br;
+      });
+    }
+    var barycenters = barycenter(g, movable);
+    _.forEach(barycenters, function(entry) {
+      if (g.children(entry.v).length) {
+        var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);
+        subgraphs[entry.v] = subgraphResult;
+        if (_.has(subgraphResult, "barycenter")) {
+          mergeBarycenters(entry, subgraphResult);
+        }
+      }
+    });
+    var entries = resolveConflicts(barycenters, cg);
+    expandSubgraphs(entries, subgraphs);
+    var result = sort(entries, biasRight);
+    if (bl) {
+      result.vs = _.flatten([bl, result.vs, br], true);
+      if (g.predecessors(bl).length) {
+        var blPred = g.node(g.predecessors(bl)[0]), brPred = g.node(g.predecessors(br)[0]);
+        if (!_.has(result, "barycenter")) {
+          result.barycenter = 0;
+          result.weight = 0;
+        }
+        result.barycenter = (result.barycenter * result.weight + blPred.order + brPred.order) / (result.weight + 2);
+        result.weight += 2;
+      }
+    }
+    return result;
+  }
+  function expandSubgraphs(entries, subgraphs) {
+    _.forEach(entries, function(entry) {
+      entry.vs = _.flatten(entry.vs.map(function(v) {
+        if (subgraphs[v]) {
+          return subgraphs[v].vs;
+        }
+        return v;
+      }), true);
+    });
+  }
+  function mergeBarycenters(target, other) {
+    if (!_.isUndefined(target.barycenter)) {
+      target.barycenter = (target.barycenter * target.weight + other.barycenter * other.weight) / (target.weight + other.weight);
+      target.weight += other.weight;
+    } else {
+      target.barycenter = other.barycenter;
+      target.weight = other.weight;
+    }
+  }
+  return sortSubgraph_1;
+}
+export {
+  requireSortSubgraph as __require
+};
+//# sourceMappingURL=sort-subgraph.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sort-subgraph.js","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/sort-subgraph.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\nimport { __require as requireBarycenter } from './barycenter.js';\nimport { __require as requireResolveConflicts } from './resolve-conflicts.js';\nimport { __require as requireSort } from './sort.js';\n\nvar sortSubgraph_1;\nvar hasRequiredSortSubgraph;\n\nfunction requireSortSubgraph () {\n\tif (hasRequiredSortSubgraph) return sortSubgraph_1;\n\thasRequiredSortSubgraph = 1;\n\tvar _ = requireLodash();\n\tvar barycenter = requireBarycenter();\n\tvar resolveConflicts = requireResolveConflicts();\n\tvar sort = requireSort();\n\n\tsortSubgraph_1 = sortSubgraph;\n\n\tfunction sortSubgraph(g, v, cg, biasRight) {\n\t  var movable = g.children(v);\n\t  var node = g.node(v);\n\t  var bl = node ? node.borderLeft : undefined;\n\t  var br = node ? node.borderRight: undefined;\n\t  var subgraphs = {};\n\n\t  if (bl) {\n\t    movable = _.filter(movable, function(w) {\n\t      return w !== bl && w !== br;\n\t    });\n\t  }\n\n\t  var barycenters = barycenter(g, movable);\n\t  _.forEach(barycenters, function(entry) {\n\t    if (g.children(entry.v).length) {\n\t      var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);\n\t      subgraphs[entry.v] = subgraphResult;\n\t      if (_.has(subgraphResult, \"barycenter\")) {\n\t        mergeBarycenters(entry, subgraphResult);\n\t      }\n\t    }\n\t  });\n\n\t  var entries = resolveConflicts(barycenters, cg);\n\t  expandSubgraphs(entries, subgraphs);\n\n\t  var result = sort(entries, biasRight);\n\n\t  if (bl) {\n\t    result.vs = _.flatten([bl, result.vs, br], true);\n\t    if (g.predecessors(bl).length) {\n\t      var blPred = g.node(g.predecessors(bl)[0]),\n\t        brPred = g.node(g.predecessors(br)[0]);\n\t      if (!_.has(result, \"barycenter\")) {\n\t        result.barycenter = 0;\n\t        result.weight = 0;\n\t      }\n\t      result.barycenter = (result.barycenter * result.weight +\n\t                           blPred.order + brPred.order) / (result.weight + 2);\n\t      result.weight += 2;\n\t    }\n\t  }\n\n\t  return result;\n\t}\n\n\tfunction expandSubgraphs(entries, subgraphs) {\n\t  _.forEach(entries, function(entry) {\n\t    entry.vs = _.flatten(entry.vs.map(function(v) {\n\t      if (subgraphs[v]) {\n\t        return subgraphs[v].vs;\n\t      }\n\t      return v;\n\t    }), true);\n\t  });\n\t}\n\n\tfunction mergeBarycenters(target, other) {\n\t  if (!_.isUndefined(target.barycenter)) {\n\t    target.barycenter = (target.barycenter * target.weight +\n\t                         other.barycenter * other.weight) /\n\t                        (target.weight + other.weight);\n\t    target.weight += other.weight;\n\t  } else {\n\t    target.barycenter = other.barycenter;\n\t    target.weight = other.weight;\n\t  }\n\t}\n\treturn sortSubgraph_1;\n}\n\nexport { requireSortSubgraph as __require };\n//# sourceMappingURL=sort-subgraph.js.map\n"],"names":[],"mappings":";;;;AAKA,IAAI;AACJ,IAAI;AAEJ,SAAS,sBAAuB;AAC/B,MAAI,wBAAyB,QAAO;AACpC,4BAA0B;AAC1B,MAAI,IAAI,cAAa;AACrB,MAAI,aAAa,kBAAiB;AAClC,MAAI,mBAAmB,wBAAuB;AAC9C,MAAI,OAAO,YAAW;AAEtB,mBAAiB;AAEjB,WAAS,aAAa,GAAG,GAAG,IAAI,WAAW;AACzC,QAAI,UAAU,EAAE,SAAS,CAAC;AAC1B,QAAI,OAAO,EAAE,KAAK,CAAC;AACnB,QAAI,KAAK,OAAO,KAAK,aAAa;AAClC,QAAI,KAAK,OAAO,KAAK,cAAa;AAClC,QAAI,YAAY,CAAA;AAEhB,QAAI,IAAI;AACN,gBAAU,EAAE,OAAO,SAAS,SAAS,GAAG;AACtC,eAAO,MAAM,MAAM,MAAM;AAAA,MAC3B,CAAC;AAAA,IACH;AAEA,QAAI,cAAc,WAAW,GAAG,OAAO;AACvC,MAAE,QAAQ,aAAa,SAAS,OAAO;AACrC,UAAI,EAAE,SAAS,MAAM,CAAC,EAAE,QAAQ;AAC9B,YAAI,iBAAiB,aAAa,GAAG,MAAM,GAAG,IAAI,SAAS;AAC3D,kBAAU,MAAM,CAAC,IAAI;AACrB,YAAI,EAAE,IAAI,gBAAgB,YAAY,GAAG;AACvC,2BAAiB,OAAO,cAAc;AAAA,QACxC;AAAA,MACF;AAAA,IACF,CAAC;AAED,QAAI,UAAU,iBAAiB,aAAa,EAAE;AAC9C,oBAAgB,SAAS,SAAS;AAElC,QAAI,SAAS,KAAK,SAAS,SAAS;AAEpC,QAAI,IAAI;AACN,aAAO,KAAK,EAAE,QAAQ,CAAC,IAAI,OAAO,IAAI,EAAE,GAAG,IAAI;AAC/C,UAAI,EAAE,aAAa,EAAE,EAAE,QAAQ;AAC7B,YAAI,SAAS,EAAE,KAAK,EAAE,aAAa,EAAE,EAAE,CAAC,CAAC,GACvC,SAAS,EAAE,KAAK,EAAE,aAAa,EAAE,EAAE,CAAC,CAAC;AACvC,YAAI,CAAC,EAAE,IAAI,QAAQ,YAAY,GAAG;AAChC,iBAAO,aAAa;AACpB,iBAAO,SAAS;AAAA,QAClB;AACA,eAAO,cAAc,OAAO,aAAa,OAAO,SAC3B,OAAO,QAAQ,OAAO,UAAU,OAAO,SAAS;AACrE,eAAO,UAAU;AAAA,MACnB;AAAA,IACF;AAEA,WAAO;AAAA,EACT;AAEA,WAAS,gBAAgB,SAAS,WAAW;AAC3C,MAAE,QAAQ,SAAS,SAAS,OAAO;AACjC,YAAM,KAAK,EAAE,QAAQ,MAAM,GAAG,IAAI,SAAS,GAAG;AAC5C,YAAI,UAAU,CAAC,GAAG;AAChB,iBAAO,UAAU,CAAC,EAAE;AAAA,QACtB;AACA,eAAO;AAAA,MACT,CAAC,GAAG,IAAI;AAAA,IACV,CAAC;AAAA,EACH;AAEA,WAAS,iBAAiB,QAAQ,OAAO;AACvC,QAAI,CAAC,EAAE,YAAY,OAAO,UAAU,GAAG;AACrC,aAAO,cAAc,OAAO,aAAa,OAAO,SAC3B,MAAM,aAAa,MAAM,WACzB,OAAO,SAAS,MAAM;AAC3C,aAAO,UAAU,MAAM;AAAA,IACzB,OAAO;AACL,aAAO,aAAa,MAAM;AAC1B,aAAO,SAAS,MAAM;AAAA,IACxB;AAAA,EACF;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/sort.cjs

@@ -0,0 +1,58 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const lodash = require("../lodash.cjs");
+const util = require("../util.cjs");
+var sort_1;
+var hasRequiredSort;
+function requireSort() {
+  if (hasRequiredSort) return sort_1;
+  hasRequiredSort = 1;
+  var _ = lodash.__require();
+  var util$1 = util.__require();
+  sort_1 = sort;
+  function sort(entries, biasRight) {
+    var parts = util$1.partition(entries, function(entry) {
+      return _.has(entry, "barycenter");
+    });
+    var sortable = parts.lhs, unsortable = _.sortBy(parts.rhs, function(entry) {
+      return -entry.i;
+    }), vs = [], sum = 0, weight = 0, vsIndex = 0;
+    sortable.sort(compareWithBias(!!biasRight));
+    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
+    _.forEach(sortable, function(entry) {
+      vsIndex += entry.vs.length;
+      vs.push(entry.vs);
+      sum += entry.barycenter * entry.weight;
+      weight += entry.weight;
+      vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
+    });
+    var result = { vs: _.flatten(vs, true) };
+    if (weight) {
+      result.barycenter = sum / weight;
+      result.weight = weight;
+    }
+    return result;
+  }
+  function consumeUnsortable(vs, unsortable, index) {
+    var last;
+    while (unsortable.length && (last = _.last(unsortable)).i <= index) {
+      unsortable.pop();
+      vs.push(last.vs);
+      index++;
+    }
+    return index;
+  }
+  function compareWithBias(bias) {
+    return function(entryV, entryW) {
+      if (entryV.barycenter < entryW.barycenter) {
+        return -1;
+      } else if (entryV.barycenter > entryW.barycenter) {
+        return 1;
+      }
+      return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;
+    };
+  }
+  return sort_1;
+}
+exports.__require = requireSort;
+//# sourceMappingURL=sort.cjs.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sort.cjs","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/sort.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\nimport { __require as requireUtil } from '../util.js';\n\nvar sort_1;\nvar hasRequiredSort;\n\nfunction requireSort () {\n\tif (hasRequiredSort) return sort_1;\n\thasRequiredSort = 1;\n\tvar _ = requireLodash();\n\tvar util = requireUtil();\n\n\tsort_1 = sort;\n\n\tfunction sort(entries, biasRight) {\n\t  var parts = util.partition(entries, function(entry) {\n\t    return _.has(entry, \"barycenter\");\n\t  });\n\t  var sortable = parts.lhs,\n\t    unsortable = _.sortBy(parts.rhs, function(entry) { return -entry.i; }),\n\t    vs = [],\n\t    sum = 0,\n\t    weight = 0,\n\t    vsIndex = 0;\n\n\t  sortable.sort(compareWithBias(!!biasRight));\n\n\t  vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\n\t  _.forEach(sortable, function (entry) {\n\t    vsIndex += entry.vs.length;\n\t    vs.push(entry.vs);\n\t    sum += entry.barycenter * entry.weight;\n\t    weight += entry.weight;\n\t    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\t  });\n\n\t  var result = { vs: _.flatten(vs, true) };\n\t  if (weight) {\n\t    result.barycenter = sum / weight;\n\t    result.weight = weight;\n\t  }\n\t  return result;\n\t}\n\n\tfunction consumeUnsortable(vs, unsortable, index) {\n\t  var last;\n\t  while (unsortable.length && (last = _.last(unsortable)).i <= index) {\n\t    unsortable.pop();\n\t    vs.push(last.vs);\n\t    index++;\n\t  }\n\t  return index;\n\t}\n\n\tfunction compareWithBias(bias) {\n\t  return function(entryV, entryW) {\n\t    if (entryV.barycenter < entryW.barycenter) {\n\t      return -1;\n\t    } else if (entryV.barycenter > entryW.barycenter) {\n\t      return 1;\n\t    }\n\n\t    return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;\n\t  };\n\t}\n\treturn sort_1;\n}\n\nexport { requireSort as __require };\n//# sourceMappingURL=sort.js.map\n"],"names":["requireLodash","util","requireUtil"],"mappings":";;;;AAGA,IAAI;AACJ,IAAI;AAEJ,SAAS,cAAe;AACvB,MAAI,gBAAiB,QAAO;AAC5B,oBAAkB;AAClB,MAAI,IAAIA,OAAAA,UAAa;AACrB,MAAIC,SAAOC,KAAAA,UAAW;AAEtB,WAAS;AAET,WAAS,KAAK,SAAS,WAAW;AAChC,QAAI,QAAQD,OAAK,UAAU,SAAS,SAAS,OAAO;AAClD,aAAO,EAAE,IAAI,OAAO,YAAY;AAAA,IAClC,CAAC;AACD,QAAI,WAAW,MAAM,KACnB,aAAa,EAAE,OAAO,MAAM,KAAK,SAAS,OAAO;AAAE,aAAO,CAAC,MAAM;AAAA,IAAG,CAAC,GACrE,KAAK,CAAA,GACL,MAAM,GACN,SAAS,GACT,UAAU;AAEZ,aAAS,KAAK,gBAAgB,CAAC,CAAC,SAAS,CAAC;AAE1C,cAAU,kBAAkB,IAAI,YAAY,OAAO;AAEnD,MAAE,QAAQ,UAAU,SAAU,OAAO;AACnC,iBAAW,MAAM,GAAG;AACpB,SAAG,KAAK,MAAM,EAAE;AAChB,aAAO,MAAM,aAAa,MAAM;AAChC,gBAAU,MAAM;AAChB,gBAAU,kBAAkB,IAAI,YAAY,OAAO;AAAA,IACrD,CAAC;AAED,QAAI,SAAS,EAAE,IAAI,EAAE,QAAQ,IAAI,IAAI,EAAC;AACtC,QAAI,QAAQ;AACV,aAAO,aAAa,MAAM;AAC1B,aAAO,SAAS;AAAA,IAClB;AACA,WAAO;AAAA,EACT;AAEA,WAAS,kBAAkB,IAAI,YAAY,OAAO;AAChD,QAAI;AACJ,WAAO,WAAW,WAAW,OAAO,EAAE,KAAK,UAAU,GAAG,KAAK,OAAO;AAClE,iBAAW,IAAG;AACd,SAAG,KAAK,KAAK,EAAE;AACf;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,WAAS,gBAAgB,MAAM;AAC7B,WAAO,SAAS,QAAQ,QAAQ;AAC9B,UAAI,OAAO,aAAa,OAAO,YAAY;AACzC,eAAO;AAAA,MACT,WAAW,OAAO,aAAa,OAAO,YAAY;AAChD,eAAO;AAAA,MACT;AAEA,aAAO,CAAC,OAAO,OAAO,IAAI,OAAO,IAAI,OAAO,IAAI,OAAO;AAAA,IACzD;AAAA,EACF;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/sort.js

@@ -0,0 +1,58 @@
+import { __require as requireLodash } from "../lodash.js";
+import { __require as requireUtil$1 } from "../util.js";
+var sort_1;
+var hasRequiredSort;
+function requireSort() {
+  if (hasRequiredSort) return sort_1;
+  hasRequiredSort = 1;
+  var _ = requireLodash();
+  var util = requireUtil$1();
+  sort_1 = sort;
+  function sort(entries, biasRight) {
+    var parts = util.partition(entries, function(entry) {
+      return _.has(entry, "barycenter");
+    });
+    var sortable = parts.lhs, unsortable = _.sortBy(parts.rhs, function(entry) {
+      return -entry.i;
+    }), vs = [], sum = 0, weight = 0, vsIndex = 0;
+    sortable.sort(compareWithBias(!!biasRight));
+    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
+    _.forEach(sortable, function(entry) {
+      vsIndex += entry.vs.length;
+      vs.push(entry.vs);
+      sum += entry.barycenter * entry.weight;
+      weight += entry.weight;
+      vsIndex = consumeUnsortable(vs, unsortable, vsIndex);
+    });
+    var result = { vs: _.flatten(vs, true) };
+    if (weight) {
+      result.barycenter = sum / weight;
+      result.weight = weight;
+    }
+    return result;
+  }
+  function consumeUnsortable(vs, unsortable, index) {
+    var last;
+    while (unsortable.length && (last = _.last(unsortable)).i <= index) {
+      unsortable.pop();
+      vs.push(last.vs);
+      index++;
+    }
+    return index;
+  }
+  function compareWithBias(bias) {
+    return function(entryV, entryW) {
+      if (entryV.barycenter < entryW.barycenter) {
+        return -1;
+      } else if (entryV.barycenter > entryW.barycenter) {
+        return 1;
+      }
+      return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;
+    };
+  }
+  return sort_1;
+}
+export {
+  requireSort as __require
+};
+//# sourceMappingURL=sort.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sort.js","sources":["../../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/order/sort.js"],"sourcesContent":["import { __require as requireLodash } from '../lodash.js';\nimport { __require as requireUtil } from '../util.js';\n\nvar sort_1;\nvar hasRequiredSort;\n\nfunction requireSort () {\n\tif (hasRequiredSort) return sort_1;\n\thasRequiredSort = 1;\n\tvar _ = requireLodash();\n\tvar util = requireUtil();\n\n\tsort_1 = sort;\n\n\tfunction sort(entries, biasRight) {\n\t  var parts = util.partition(entries, function(entry) {\n\t    return _.has(entry, \"barycenter\");\n\t  });\n\t  var sortable = parts.lhs,\n\t    unsortable = _.sortBy(parts.rhs, function(entry) { return -entry.i; }),\n\t    vs = [],\n\t    sum = 0,\n\t    weight = 0,\n\t    vsIndex = 0;\n\n\t  sortable.sort(compareWithBias(!!biasRight));\n\n\t  vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\n\t  _.forEach(sortable, function (entry) {\n\t    vsIndex += entry.vs.length;\n\t    vs.push(entry.vs);\n\t    sum += entry.barycenter * entry.weight;\n\t    weight += entry.weight;\n\t    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\t  });\n\n\t  var result = { vs: _.flatten(vs, true) };\n\t  if (weight) {\n\t    result.barycenter = sum / weight;\n\t    result.weight = weight;\n\t  }\n\t  return result;\n\t}\n\n\tfunction consumeUnsortable(vs, unsortable, index) {\n\t  var last;\n\t  while (unsortable.length && (last = _.last(unsortable)).i <= index) {\n\t    unsortable.pop();\n\t    vs.push(last.vs);\n\t    index++;\n\t  }\n\t  return index;\n\t}\n\n\tfunction compareWithBias(bias) {\n\t  return function(entryV, entryW) {\n\t    if (entryV.barycenter < entryW.barycenter) {\n\t      return -1;\n\t    } else if (entryV.barycenter > entryW.barycenter) {\n\t      return 1;\n\t    }\n\n\t    return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;\n\t  };\n\t}\n\treturn sort_1;\n}\n\nexport { requireSort as __require };\n//# sourceMappingURL=sort.js.map\n"],"names":["requireUtil"],"mappings":";;AAGA,IAAI;AACJ,IAAI;AAEJ,SAAS,cAAe;AACvB,MAAI,gBAAiB,QAAO;AAC5B,oBAAkB;AAClB,MAAI,IAAI,cAAa;AACrB,MAAI,OAAOA,cAAW;AAEtB,WAAS;AAET,WAAS,KAAK,SAAS,WAAW;AAChC,QAAI,QAAQ,KAAK,UAAU,SAAS,SAAS,OAAO;AAClD,aAAO,EAAE,IAAI,OAAO,YAAY;AAAA,IAClC,CAAC;AACD,QAAI,WAAW,MAAM,KACnB,aAAa,EAAE,OAAO,MAAM,KAAK,SAAS,OAAO;AAAE,aAAO,CAAC,MAAM;AAAA,IAAG,CAAC,GACrE,KAAK,CAAA,GACL,MAAM,GACN,SAAS,GACT,UAAU;AAEZ,aAAS,KAAK,gBAAgB,CAAC,CAAC,SAAS,CAAC;AAE1C,cAAU,kBAAkB,IAAI,YAAY,OAAO;AAEnD,MAAE,QAAQ,UAAU,SAAU,OAAO;AACnC,iBAAW,MAAM,GAAG;AACpB,SAAG,KAAK,MAAM,EAAE;AAChB,aAAO,MAAM,aAAa,MAAM;AAChC,gBAAU,MAAM;AAChB,gBAAU,kBAAkB,IAAI,YAAY,OAAO;AAAA,IACrD,CAAC;AAED,QAAI,SAAS,EAAE,IAAI,EAAE,QAAQ,IAAI,IAAI,EAAC;AACtC,QAAI,QAAQ;AACV,aAAO,aAAa,MAAM;AAC1B,aAAO,SAAS;AAAA,IAClB;AACA,WAAO;AAAA,EACT;AAEA,WAAS,kBAAkB,IAAI,YAAY,OAAO;AAChD,QAAI;AACJ,WAAO,WAAW,WAAW,OAAO,EAAE,KAAK,UAAU,GAAG,KAAK,OAAO;AAClE,iBAAW,IAAG;AACd,SAAG,KAAK,KAAK,EAAE;AACf;AAAA,IACF;AACA,WAAO;AAAA,EACT;AAEA,WAAS,gBAAgB,MAAM;AAC7B,WAAO,SAAS,QAAQ,QAAQ;AAC9B,UAAI,OAAO,aAAa,OAAO,YAAY;AACzC,eAAO;AAAA,MACT,WAAW,OAAO,aAAa,OAAO,YAAY;AAChD,eAAO;AAAA,MACT;AAEA,aAAO,CAAC,OAAO,OAAO,IAAI,OAAO,IAAI,OAAO,IAAI,OAAO;AAAA,IACzD;AAAA,EACF;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/parent-dummy-chains.cjs

@@ -0,0 +1,76 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+const lodash = require("./lodash.cjs");
+var parentDummyChains_1;
+var hasRequiredParentDummyChains;
+function requireParentDummyChains() {
+  if (hasRequiredParentDummyChains) return parentDummyChains_1;
+  hasRequiredParentDummyChains = 1;
+  var _ = lodash.__require();
+  parentDummyChains_1 = parentDummyChains;
+  function parentDummyChains(g) {
+    var postorderNums = postorder(g);
+    _.forEach(g.graph().dummyChains, function(v) {
+      var node = g.node(v);
+      var edgeObj = node.edgeObj;
+      var pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);
+      var path = pathData.path;
+      var lca = pathData.lca;
+      var pathIdx = 0;
+      var pathV = path[pathIdx];
+      var ascending = true;
+      while (v !== edgeObj.w) {
+        node = g.node(v);
+        if (ascending) {
+          while ((pathV = path[pathIdx]) !== lca && g.node(pathV).maxRank < node.rank) {
+            pathIdx++;
+          }
+          if (pathV === lca) {
+            ascending = false;
+          }
+        }
+        if (!ascending) {
+          while (pathIdx < path.length - 1 && g.node(pathV = path[pathIdx + 1]).minRank <= node.rank) {
+            pathIdx++;
+          }
+          pathV = path[pathIdx];
+        }
+        g.setParent(v, pathV);
+        v = g.successors(v)[0];
+      }
+    });
+  }
+  function findPath(g, postorderNums, v, w) {
+    var vPath = [];
+    var wPath = [];
+    var low = Math.min(postorderNums[v].low, postorderNums[w].low);
+    var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);
+    var parent;
+    var lca;
+    parent = v;
+    do {
+      parent = g.parent(parent);
+      vPath.push(parent);
+    } while (parent && (postorderNums[parent].low > low || lim > postorderNums[parent].lim));
+    lca = parent;
+    parent = w;
+    while ((parent = g.parent(parent)) !== lca) {
+      wPath.push(parent);
+    }
+    return { path: vPath.concat(wPath.reverse()), lca };
+  }
+  function postorder(g) {
+    var result = {};
+    var lim = 0;
+    function dfs(v) {
+      var low = lim;
+      _.forEach(g.children(v), dfs);
+      result[v] = { low, lim: lim++ };
+    }
+    _.forEach(g.children(), dfs);
+    return result;
+  }
+  return parentDummyChains_1;
+}
+exports.__require = requireParentDummyChains;
+//# sourceMappingURL=parent-dummy-chains.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/parent-dummy-chains.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"parent-dummy-chains.cjs","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/parent-dummy-chains.js"],"sourcesContent":["import { __require as requireLodash } from './lodash.js';\n\nvar parentDummyChains_1;\nvar hasRequiredParentDummyChains;\n\nfunction requireParentDummyChains () {\n\tif (hasRequiredParentDummyChains) return parentDummyChains_1;\n\thasRequiredParentDummyChains = 1;\n\tvar _ = requireLodash();\n\n\tparentDummyChains_1 = parentDummyChains;\n\n\tfunction parentDummyChains(g) {\n\t  var postorderNums = postorder(g);\n\n\t  _.forEach(g.graph().dummyChains, function(v) {\n\t    var node = g.node(v);\n\t    var edgeObj = node.edgeObj;\n\t    var pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);\n\t    var path = pathData.path;\n\t    var lca = pathData.lca;\n\t    var pathIdx = 0;\n\t    var pathV = path[pathIdx];\n\t    var ascending = true;\n\n\t    while (v !== edgeObj.w) {\n\t      node = g.node(v);\n\n\t      if (ascending) {\n\t        while ((pathV = path[pathIdx]) !== lca &&\n\t               g.node(pathV).maxRank < node.rank) {\n\t          pathIdx++;\n\t        }\n\n\t        if (pathV === lca) {\n\t          ascending = false;\n\t        }\n\t      }\n\n\t      if (!ascending) {\n\t        while (pathIdx < path.length - 1 &&\n\t               g.node(pathV = path[pathIdx + 1]).minRank <= node.rank) {\n\t          pathIdx++;\n\t        }\n\t        pathV = path[pathIdx];\n\t      }\n\n\t      g.setParent(v, pathV);\n\t      v = g.successors(v)[0];\n\t    }\n\t  });\n\t}\n\n\t// Find a path from v to w through the lowest common ancestor (LCA). Return the\n\t// full path and the LCA.\n\tfunction findPath(g, postorderNums, v, w) {\n\t  var vPath = [];\n\t  var wPath = [];\n\t  var low = Math.min(postorderNums[v].low, postorderNums[w].low);\n\t  var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);\n\t  var parent;\n\t  var lca;\n\n\t  // Traverse up from v to find the LCA\n\t  parent = v;\n\t  do {\n\t    parent = g.parent(parent);\n\t    vPath.push(parent);\n\t  } while (parent &&\n\t           (postorderNums[parent].low > low || lim > postorderNums[parent].lim));\n\t  lca = parent;\n\n\t  // Traverse from w to LCA\n\t  parent = w;\n\t  while ((parent = g.parent(parent)) !== lca) {\n\t    wPath.push(parent);\n\t  }\n\n\t  return { path: vPath.concat(wPath.reverse()), lca: lca };\n\t}\n\n\tfunction postorder(g) {\n\t  var result = {};\n\t  var lim = 0;\n\n\t  function dfs(v) {\n\t    var low = lim;\n\t    _.forEach(g.children(v), dfs);\n\t    result[v] = { low: low, lim: lim++ };\n\t  }\n\t  _.forEach(g.children(), dfs);\n\n\t  return result;\n\t}\n\treturn parentDummyChains_1;\n}\n\nexport { requireParentDummyChains as __require };\n//# sourceMappingURL=parent-dummy-chains.js.map\n"],"names":["requireLodash"],"mappings":";;;AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,2BAA4B;AACpC,MAAI,6BAA8B,QAAO;AACzC,iCAA+B;AAC/B,MAAI,IAAIA,OAAAA,UAAa;AAErB,wBAAsB;AAEtB,WAAS,kBAAkB,GAAG;AAC5B,QAAI,gBAAgB,UAAU,CAAC;AAE/B,MAAE,QAAQ,EAAE,MAAK,EAAG,aAAa,SAAS,GAAG;AAC3C,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,UAAU,KAAK;AACnB,UAAI,WAAW,SAAS,GAAG,eAAe,QAAQ,GAAG,QAAQ,CAAC;AAC9D,UAAI,OAAO,SAAS;AACpB,UAAI,MAAM,SAAS;AACnB,UAAI,UAAU;AACd,UAAI,QAAQ,KAAK,OAAO;AACxB,UAAI,YAAY;AAEhB,aAAO,MAAM,QAAQ,GAAG;AACtB,eAAO,EAAE,KAAK,CAAC;AAEf,YAAI,WAAW;AACb,kBAAQ,QAAQ,KAAK,OAAO,OAAO,OAC5B,EAAE,KAAK,KAAK,EAAE,UAAU,KAAK,MAAM;AACxC;AAAA,UACF;AAEA,cAAI,UAAU,KAAK;AACjB,wBAAY;AAAA,UACd;AAAA,QACF;AAEA,YAAI,CAAC,WAAW;AACd,iBAAO,UAAU,KAAK,SAAS,KACxB,EAAE,KAAK,QAAQ,KAAK,UAAU,CAAC,CAAC,EAAE,WAAW,KAAK,MAAM;AAC7D;AAAA,UACF;AACA,kBAAQ,KAAK,OAAO;AAAA,QACtB;AAEA,UAAE,UAAU,GAAG,KAAK;AACpB,YAAI,EAAE,WAAW,CAAC,EAAE,CAAC;AAAA,MACvB;AAAA,IACF,CAAC;AAAA,EACH;AAIA,WAAS,SAAS,GAAG,eAAe,GAAG,GAAG;AACxC,QAAI,QAAQ,CAAA;AACZ,QAAI,QAAQ,CAAA;AACZ,QAAI,MAAM,KAAK,IAAI,cAAc,CAAC,EAAE,KAAK,cAAc,CAAC,EAAE,GAAG;AAC7D,QAAI,MAAM,KAAK,IAAI,cAAc,CAAC,EAAE,KAAK,cAAc,CAAC,EAAE,GAAG;AAC7D,QAAI;AACJ,QAAI;AAGJ,aAAS;AACT,OAAG;AACD,eAAS,EAAE,OAAO,MAAM;AACxB,YAAM,KAAK,MAAM;AAAA,IACnB,SAAS,WACC,cAAc,MAAM,EAAE,MAAM,OAAO,MAAM,cAAc,MAAM,EAAE;AACzE,UAAM;AAGN,aAAS;AACT,YAAQ,SAAS,EAAE,OAAO,MAAM,OAAO,KAAK;AAC1C,YAAM,KAAK,MAAM;AAAA,IACnB;AAEA,WAAO,EAAE,MAAM,MAAM,OAAO,MAAM,QAAO,CAAE,GAAG,IAAQ;AAAA,EACxD;AAEA,WAAS,UAAU,GAAG;AACpB,QAAI,SAAS,CAAA;AACb,QAAI,MAAM;AAEV,aAAS,IAAI,GAAG;AACd,UAAI,MAAM;AACV,QAAE,QAAQ,EAAE,SAAS,CAAC,GAAG,GAAG;AAC5B,aAAO,CAAC,IAAI,EAAE,KAAU,KAAK,MAAK;AAAA,IACpC;AACA,MAAE,QAAQ,EAAE,SAAQ,GAAI,GAAG;AAE3B,WAAO;AAAA,EACT;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/parent-dummy-chains.js

@@ -0,0 +1,76 @@
+import { __require as requireLodash } from "./lodash.js";
+var parentDummyChains_1;
+var hasRequiredParentDummyChains;
+function requireParentDummyChains() {
+  if (hasRequiredParentDummyChains) return parentDummyChains_1;
+  hasRequiredParentDummyChains = 1;
+  var _ = requireLodash();
+  parentDummyChains_1 = parentDummyChains;
+  function parentDummyChains(g) {
+    var postorderNums = postorder(g);
+    _.forEach(g.graph().dummyChains, function(v) {
+      var node = g.node(v);
+      var edgeObj = node.edgeObj;
+      var pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);
+      var path = pathData.path;
+      var lca = pathData.lca;
+      var pathIdx = 0;
+      var pathV = path[pathIdx];
+      var ascending = true;
+      while (v !== edgeObj.w) {
+        node = g.node(v);
+        if (ascending) {
+          while ((pathV = path[pathIdx]) !== lca && g.node(pathV).maxRank < node.rank) {
+            pathIdx++;
+          }
+          if (pathV === lca) {
+            ascending = false;
+          }
+        }
+        if (!ascending) {
+          while (pathIdx < path.length - 1 && g.node(pathV = path[pathIdx + 1]).minRank <= node.rank) {
+            pathIdx++;
+          }
+          pathV = path[pathIdx];
+        }
+        g.setParent(v, pathV);
+        v = g.successors(v)[0];
+      }
+    });
+  }
+  function findPath(g, postorderNums, v, w) {
+    var vPath = [];
+    var wPath = [];
+    var low = Math.min(postorderNums[v].low, postorderNums[w].low);
+    var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);
+    var parent;
+    var lca;
+    parent = v;
+    do {
+      parent = g.parent(parent);
+      vPath.push(parent);
+    } while (parent && (postorderNums[parent].low > low || lim > postorderNums[parent].lim));
+    lca = parent;
+    parent = w;
+    while ((parent = g.parent(parent)) !== lca) {
+      wPath.push(parent);
+    }
+    return { path: vPath.concat(wPath.reverse()), lca };
+  }
+  function postorder(g) {
+    var result = {};
+    var lim = 0;
+    function dfs(v) {
+      var low = lim;
+      _.forEach(g.children(v), dfs);
+      result[v] = { low, lim: lim++ };
+    }
+    _.forEach(g.children(), dfs);
+    return result;
+  }
+  return parentDummyChains_1;
+}
+export {
+  requireParentDummyChains as __require
+};
+//# sourceMappingURL=parent-dummy-chains.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/parent-dummy-chains.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"parent-dummy-chains.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/dagre/lib/parent-dummy-chains.js"],"sourcesContent":["import { __require as requireLodash } from './lodash.js';\n\nvar parentDummyChains_1;\nvar hasRequiredParentDummyChains;\n\nfunction requireParentDummyChains () {\n\tif (hasRequiredParentDummyChains) return parentDummyChains_1;\n\thasRequiredParentDummyChains = 1;\n\tvar _ = requireLodash();\n\n\tparentDummyChains_1 = parentDummyChains;\n\n\tfunction parentDummyChains(g) {\n\t  var postorderNums = postorder(g);\n\n\t  _.forEach(g.graph().dummyChains, function(v) {\n\t    var node = g.node(v);\n\t    var edgeObj = node.edgeObj;\n\t    var pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);\n\t    var path = pathData.path;\n\t    var lca = pathData.lca;\n\t    var pathIdx = 0;\n\t    var pathV = path[pathIdx];\n\t    var ascending = true;\n\n\t    while (v !== edgeObj.w) {\n\t      node = g.node(v);\n\n\t      if (ascending) {\n\t        while ((pathV = path[pathIdx]) !== lca &&\n\t               g.node(pathV).maxRank < node.rank) {\n\t          pathIdx++;\n\t        }\n\n\t        if (pathV === lca) {\n\t          ascending = false;\n\t        }\n\t      }\n\n\t      if (!ascending) {\n\t        while (pathIdx < path.length - 1 &&\n\t               g.node(pathV = path[pathIdx + 1]).minRank <= node.rank) {\n\t          pathIdx++;\n\t        }\n\t        pathV = path[pathIdx];\n\t      }\n\n\t      g.setParent(v, pathV);\n\t      v = g.successors(v)[0];\n\t    }\n\t  });\n\t}\n\n\t// Find a path from v to w through the lowest common ancestor (LCA). Return the\n\t// full path and the LCA.\n\tfunction findPath(g, postorderNums, v, w) {\n\t  var vPath = [];\n\t  var wPath = [];\n\t  var low = Math.min(postorderNums[v].low, postorderNums[w].low);\n\t  var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);\n\t  var parent;\n\t  var lca;\n\n\t  // Traverse up from v to find the LCA\n\t  parent = v;\n\t  do {\n\t    parent = g.parent(parent);\n\t    vPath.push(parent);\n\t  } while (parent &&\n\t           (postorderNums[parent].low > low || lim > postorderNums[parent].lim));\n\t  lca = parent;\n\n\t  // Traverse from w to LCA\n\t  parent = w;\n\t  while ((parent = g.parent(parent)) !== lca) {\n\t    wPath.push(parent);\n\t  }\n\n\t  return { path: vPath.concat(wPath.reverse()), lca: lca };\n\t}\n\n\tfunction postorder(g) {\n\t  var result = {};\n\t  var lim = 0;\n\n\t  function dfs(v) {\n\t    var low = lim;\n\t    _.forEach(g.children(v), dfs);\n\t    result[v] = { low: low, lim: lim++ };\n\t  }\n\t  _.forEach(g.children(), dfs);\n\n\t  return result;\n\t}\n\treturn parentDummyChains_1;\n}\n\nexport { requireParentDummyChains as __require };\n//# sourceMappingURL=parent-dummy-chains.js.map\n"],"names":[],"mappings":";AAEA,IAAI;AACJ,IAAI;AAEJ,SAAS,2BAA4B;AACpC,MAAI,6BAA8B,QAAO;AACzC,iCAA+B;AAC/B,MAAI,IAAI,cAAa;AAErB,wBAAsB;AAEtB,WAAS,kBAAkB,GAAG;AAC5B,QAAI,gBAAgB,UAAU,CAAC;AAE/B,MAAE,QAAQ,EAAE,MAAK,EAAG,aAAa,SAAS,GAAG;AAC3C,UAAI,OAAO,EAAE,KAAK,CAAC;AACnB,UAAI,UAAU,KAAK;AACnB,UAAI,WAAW,SAAS,GAAG,eAAe,QAAQ,GAAG,QAAQ,CAAC;AAC9D,UAAI,OAAO,SAAS;AACpB,UAAI,MAAM,SAAS;AACnB,UAAI,UAAU;AACd,UAAI,QAAQ,KAAK,OAAO;AACxB,UAAI,YAAY;AAEhB,aAAO,MAAM,QAAQ,GAAG;AACtB,eAAO,EAAE,KAAK,CAAC;AAEf,YAAI,WAAW;AACb,kBAAQ,QAAQ,KAAK,OAAO,OAAO,OAC5B,EAAE,KAAK,KAAK,EAAE,UAAU,KAAK,MAAM;AACxC;AAAA,UACF;AAEA,cAAI,UAAU,KAAK;AACjB,wBAAY;AAAA,UACd;AAAA,QACF;AAEA,YAAI,CAAC,WAAW;AACd,iBAAO,UAAU,KAAK,SAAS,KACxB,EAAE,KAAK,QAAQ,KAAK,UAAU,CAAC,CAAC,EAAE,WAAW,KAAK,MAAM;AAC7D;AAAA,UACF;AACA,kBAAQ,KAAK,OAAO;AAAA,QACtB;AAEA,UAAE,UAAU,GAAG,KAAK;AACpB,YAAI,EAAE,WAAW,CAAC,EAAE,CAAC;AAAA,MACvB;AAAA,IACF,CAAC;AAAA,EACH;AAIA,WAAS,SAAS,GAAG,eAAe,GAAG,GAAG;AACxC,QAAI,QAAQ,CAAA;AACZ,QAAI,QAAQ,CAAA;AACZ,QAAI,MAAM,KAAK,IAAI,cAAc,CAAC,EAAE,KAAK,cAAc,CAAC,EAAE,GAAG;AAC7D,QAAI,MAAM,KAAK,IAAI,cAAc,CAAC,EAAE,KAAK,cAAc,CAAC,EAAE,GAAG;AAC7D,QAAI;AACJ,QAAI;AAGJ,aAAS;AACT,OAAG;AACD,eAAS,EAAE,OAAO,MAAM;AACxB,YAAM,KAAK,MAAM;AAAA,IACnB,SAAS,WACC,cAAc,MAAM,EAAE,MAAM,OAAO,MAAM,cAAc,MAAM,EAAE;AACzE,UAAM;AAGN,aAAS;AACT,YAAQ,SAAS,EAAE,OAAO,MAAM,OAAO,KAAK;AAC1C,YAAM,KAAK,MAAM;AAAA,IACnB;AAEA,WAAO,EAAE,MAAM,MAAM,OAAO,MAAM,QAAO,CAAE,GAAG,IAAQ;AAAA,EACxD;AAEA,WAAS,UAAU,GAAG;AACpB,QAAI,SAAS,CAAA;AACb,QAAI,MAAM;AAEV,aAAS,IAAI,GAAG;AACd,UAAI,MAAM;AACV,QAAE,QAAQ,EAAE,SAAS,CAAC,GAAG,GAAG;AAC5B,aAAO,CAAC,IAAI,EAAE,KAAU,KAAK,MAAK;AAAA,IACpC;AACA,MAAE,QAAQ,EAAE,SAAQ,GAAI,GAAG;AAE3B,WAAO;AAAA,EACT;AACA,SAAO;AACR;","x_google_ignoreList":[0]}