@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/d3-binarytree/src/cover.js

@@ -0,0 +1,29 @@
+function tree_cover$1(x) {
+  if (isNaN(x = +x)) return this;
+  var x0 = this._x0, x1 = this._x1;
+  if (isNaN(x0)) {
+    x1 = (x0 = Math.floor(x)) + 1;
+  } else {
+    var z = x1 - x0 || 1, node = this._root, parent, i;
+    while (x0 > x || x >= x1) {
+      i = +(x < x0);
+      parent = new Array(2), parent[i] = node, node = parent, z *= 2;
+      switch (i) {
+        case 0:
+          x1 = x0 + z;
+          break;
+        case 1:
+          x0 = x1 - z;
+          break;
+      }
+    }
+    if (this._root && this._root.length) this._root = node;
+  }
+  this._x0 = x0;
+  this._x1 = x1;
+  return this;
+}
+export {
+  tree_cover$1 as default
+};
+//# sourceMappingURL=cover.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/cover.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"cover.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/cover.js"],"sourcesContent":["function tree_cover$1(x) {\n  if (isNaN(x = +x)) return this; // ignore invalid points\n\n  var x0 = this._x0,\n      x1 = this._x1;\n\n  // If the binarytree has no extent, initialize them.\n  // Integer extent are necessary so that if we later double the extent,\n  // the existing half boundaries don’t change due to floating point error!\n  if (isNaN(x0)) {\n    x1 = (x0 = Math.floor(x)) + 1;\n  }\n\n  // Otherwise, double repeatedly to cover.\n  else {\n    var z = x1 - x0 || 1,\n        node = this._root,\n        parent,\n        i;\n\n    while (x0 > x || x >= x1) {\n      i = +(x < x0);\n      parent = new Array(2), parent[i] = node, node = parent, z *= 2;\n      switch (i) {\n        case 0: x1 = x0 + z; break;\n        case 1: x0 = x1 - z; break;\n      }\n    }\n\n    if (this._root && this._root.length) this._root = node;\n  }\n\n  this._x0 = x0;\n  this._x1 = x1;\n  return this;\n}\n\nexport { tree_cover$1 as default };\n//# sourceMappingURL=cover.js.map\n"],"names":[],"mappings":"AAAA,SAAS,aAAa,GAAG;AACvB,MAAI,MAAM,IAAI,CAAC,CAAC,EAAG,QAAO;AAE1B,MAAI,KAAK,KAAK,KACV,KAAK,KAAK;AAKd,MAAI,MAAM,EAAE,GAAG;AACb,UAAM,KAAK,KAAK,MAAM,CAAC,KAAK;AAAA,EAC9B,OAGK;AACH,QAAI,IAAI,KAAK,MAAM,GACf,OAAO,KAAK,OACZ,QACA;AAEJ,WAAO,KAAK,KAAK,KAAK,IAAI;AACxB,UAAI,EAAE,IAAI;AACV,eAAS,IAAI,MAAM,CAAC,GAAG,OAAO,CAAC,IAAI,MAAM,OAAO,QAAQ,KAAK;AAC7D,cAAQ,GAAC;AAAA,QACP,KAAK;AAAG,eAAK,KAAK;AAAG;AAAA,QACrB,KAAK;AAAG,eAAK,KAAK;AAAG;AAAA,MAC7B;AAAA,IACI;AAEA,QAAI,KAAK,SAAS,KAAK,MAAM,OAAQ,MAAK,QAAQ;AAAA,EACpD;AAEA,OAAK,MAAM;AACX,OAAK,MAAM;AACX,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/data.cjs

@@ -0,0 +1,12 @@
+"use strict";
+function tree_data$1() {
+  var data = [];
+  this.visit(function(node) {
+    if (!node.length) do
+      data.push(node.data);
+    while (node = node.next);
+  });
+  return data;
+}
+module.exports = tree_data$1;
+//# sourceMappingURL=data.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/data.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"data.cjs","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/data.js"],"sourcesContent":["function tree_data$1() {\n  var data = [];\n  this.visit(function(node) {\n    if (!node.length) do data.push(node.data); while (node = node.next)\n  });\n  return data;\n}\n\nexport { tree_data$1 as default };\n//# sourceMappingURL=data.js.map\n"],"names":[],"mappings":";AAAA,SAAS,cAAc;AACrB,MAAI,OAAO,CAAA;AACX,OAAK,MAAM,SAAS,MAAM;AACxB,QAAI,CAAC,KAAK,OAAQ;AAAG,WAAK,KAAK,KAAK,IAAI;AAAA,WAAU,OAAO,KAAK;AAAA,EAChE,CAAC;AACD,SAAO;AACT;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/data.js

@@ -0,0 +1,13 @@
+function tree_data$1() {
+  var data = [];
+  this.visit(function(node) {
+    if (!node.length) do
+      data.push(node.data);
+    while (node = node.next);
+  });
+  return data;
+}
+export {
+  tree_data$1 as default
+};
+//# sourceMappingURL=data.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/data.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"data.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/data.js"],"sourcesContent":["function tree_data$1() {\n  var data = [];\n  this.visit(function(node) {\n    if (!node.length) do data.push(node.data); while (node = node.next)\n  });\n  return data;\n}\n\nexport { tree_data$1 as default };\n//# sourceMappingURL=data.js.map\n"],"names":[],"mappings":"AAAA,SAAS,cAAc;AACrB,MAAI,OAAO,CAAA;AACX,OAAK,MAAM,SAAS,MAAM;AACxB,QAAI,CAAC,KAAK,OAAQ;AAAG,WAAK,KAAK,KAAK,IAAI;AAAA,WAAU,OAAO,KAAK;AAAA,EAChE,CAAC;AACD,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/extent.cjs

@@ -0,0 +1,6 @@
+"use strict";
+function tree_extent$1(_) {
+  return arguments.length ? this.cover(+_[0][0]).cover(+_[1][0]) : isNaN(this._x0) ? void 0 : [[this._x0], [this._x1]];
+}
+module.exports = tree_extent$1;
+//# sourceMappingURL=extent.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/extent.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"extent.cjs","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/extent.js"],"sourcesContent":["function tree_extent$1(_) {\n  return arguments.length\n      ? this.cover(+_[0][0]).cover(+_[1][0])\n      : isNaN(this._x0) ? undefined : [[this._x0], [this._x1]];\n}\n\nexport { tree_extent$1 as default };\n//# sourceMappingURL=extent.js.map\n"],"names":[],"mappings":";AAAA,SAAS,cAAc,GAAG;AACxB,SAAO,UAAU,SACX,KAAK,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IACnC,MAAM,KAAK,GAAG,IAAI,SAAY,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,GAAG,CAAC;AAC7D;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/extent.js

@@ -0,0 +1,7 @@
+function tree_extent$1(_) {
+  return arguments.length ? this.cover(+_[0][0]).cover(+_[1][0]) : isNaN(this._x0) ? void 0 : [[this._x0], [this._x1]];
+}
+export {
+  tree_extent$1 as default
+};
+//# sourceMappingURL=extent.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/extent.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"extent.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/extent.js"],"sourcesContent":["function tree_extent$1(_) {\n  return arguments.length\n      ? this.cover(+_[0][0]).cover(+_[1][0])\n      : isNaN(this._x0) ? undefined : [[this._x0], [this._x1]];\n}\n\nexport { tree_extent$1 as default };\n//# sourceMappingURL=extent.js.map\n"],"names":[],"mappings":"AAAA,SAAS,cAAc,GAAG;AACxB,SAAO,UAAU,SACX,KAAK,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,IACnC,MAAM,KAAK,GAAG,IAAI,SAAY,CAAC,CAAC,KAAK,GAAG,GAAG,CAAC,KAAK,GAAG,CAAC;AAC7D;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/find.cjs

@@ -0,0 +1,37 @@
+"use strict";
+const half = require("./half.cjs");
+function tree_find$1(x, radius) {
+  var data, x0 = this._x0, x1, x2, x3 = this._x1, halves = [], node = this._root, q, i;
+  if (node) halves.push(new half(node, x0, x3));
+  if (radius == null) radius = Infinity;
+  else {
+    x0 = x - radius;
+    x3 = x + radius;
+  }
+  while (q = halves.pop()) {
+    if (!(node = q.node) || (x1 = q.x0) > x3 || (x2 = q.x1) < x0) continue;
+    if (node.length) {
+      var xm = (x1 + x2) / 2;
+      halves.push(
+        new half(node[1], xm, x2),
+        new half(node[0], x1, xm)
+      );
+      if (i = +(x >= xm)) {
+        q = halves[halves.length - 1];
+        halves[halves.length - 1] = halves[halves.length - 1 - i];
+        halves[halves.length - 1 - i] = q;
+      }
+    } else {
+      var d = Math.abs(x - +this._x.call(null, node.data));
+      if (d < radius) {
+        radius = d;
+        x0 = x - d;
+        x3 = x + d;
+        data = node.data;
+      }
+    }
+  }
+  return data;
+}
+module.exports = tree_find$1;
+//# sourceMappingURL=find.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/find.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"find.cjs","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/find.js"],"sourcesContent":["import Half from './half.js';\n\nfunction tree_find$1(x, radius) {\n  var data,\n      x0 = this._x0,\n      x1,\n      x2,\n      x3 = this._x1,\n      halves = [],\n      node = this._root,\n      q,\n      i;\n\n  if (node) halves.push(new Half(node, x0, x3));\n  if (radius == null) radius = Infinity;\n  else {\n    x0 = x - radius;\n    x3 = x + radius;\n  }\n\n  while (q = halves.pop()) {\n\n    // Stop searching if this half can’t contain a closer node.\n    if (!(node = q.node)\n        || (x1 = q.x0) > x3\n        || (x2 = q.x1) < x0) continue;\n\n    // Bisect the current half.\n    if (node.length) {\n      var xm = (x1 + x2) / 2;\n\n      halves.push(\n        new Half(node[1], xm, x2),\n        new Half(node[0], x1, xm)\n      );\n\n      // Visit the closest half first.\n      if (i = +(x >= xm)) {\n        q = halves[halves.length - 1];\n        halves[halves.length - 1] = halves[halves.length - 1 - i];\n        halves[halves.length - 1 - i] = q;\n      }\n    }\n\n    // Visit this point. (Visiting coincident points isn’t necessary!)\n    else {\n      var d = Math.abs(x - +this._x.call(null, node.data));\n      if (d < radius) {\n        radius = d;\n        x0 = x - d;\n        x3 = x + d;\n        data = node.data;\n      }\n    }\n  }\n\n  return data;\n}\n\nexport { tree_find$1 as default };\n//# sourceMappingURL=find.js.map\n"],"names":["Half"],"mappings":";;AAEA,SAAS,YAAY,GAAG,QAAQ;AAC9B,MAAI,MACA,KAAK,KAAK,KACV,IACA,IACA,KAAK,KAAK,KACV,SAAS,CAAA,GACT,OAAO,KAAK,OACZ,GACA;AAEJ,MAAI,KAAM,QAAO,KAAK,IAAIA,KAAK,MAAM,IAAI,EAAE,CAAC;AAC5C,MAAI,UAAU,KAAM,UAAS;AAAA,OACxB;AACH,SAAK,IAAI;AACT,SAAK,IAAI;AAAA,EACX;AAEA,SAAO,IAAI,OAAO,OAAO;AAGvB,QAAI,EAAE,OAAO,EAAE,UACP,KAAK,EAAE,MAAM,OACb,KAAK,EAAE,MAAM,GAAI;AAGzB,QAAI,KAAK,QAAQ;AACf,UAAI,MAAM,KAAK,MAAM;AAErB,aAAO;AAAA,QACL,IAAIA,KAAK,KAAK,CAAC,GAAG,IAAI,EAAE;AAAA,QACxB,IAAIA,KAAK,KAAK,CAAC,GAAG,IAAI,EAAE;AAAA,MAChC;AAGM,UAAI,IAAI,EAAE,KAAK,KAAK;AAClB,YAAI,OAAO,OAAO,SAAS,CAAC;AAC5B,eAAO,OAAO,SAAS,CAAC,IAAI,OAAO,OAAO,SAAS,IAAI,CAAC;AACxD,eAAO,OAAO,SAAS,IAAI,CAAC,IAAI;AAAA,MAClC;AAAA,IACF,OAGK;AACH,UAAI,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,KAAK,IAAI,CAAC;AACnD,UAAI,IAAI,QAAQ;AACd,iBAAS;AACT,aAAK,IAAI;AACT,aAAK,IAAI;AACT,eAAO,KAAK;AAAA,MACd;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/find.js

@@ -0,0 +1,38 @@
+import Half from "./half.js";
+function tree_find$1(x, radius) {
+  var data, x0 = this._x0, x1, x2, x3 = this._x1, halves = [], node = this._root, q, i;
+  if (node) halves.push(new Half(node, x0, x3));
+  if (radius == null) radius = Infinity;
+  else {
+    x0 = x - radius;
+    x3 = x + radius;
+  }
+  while (q = halves.pop()) {
+    if (!(node = q.node) || (x1 = q.x0) > x3 || (x2 = q.x1) < x0) continue;
+    if (node.length) {
+      var xm = (x1 + x2) / 2;
+      halves.push(
+        new Half(node[1], xm, x2),
+        new Half(node[0], x1, xm)
+      );
+      if (i = +(x >= xm)) {
+        q = halves[halves.length - 1];
+        halves[halves.length - 1] = halves[halves.length - 1 - i];
+        halves[halves.length - 1 - i] = q;
+      }
+    } else {
+      var d = Math.abs(x - +this._x.call(null, node.data));
+      if (d < radius) {
+        radius = d;
+        x0 = x - d;
+        x3 = x + d;
+        data = node.data;
+      }
+    }
+  }
+  return data;
+}
+export {
+  tree_find$1 as default
+};
+//# sourceMappingURL=find.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/find.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"find.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/find.js"],"sourcesContent":["import Half from './half.js';\n\nfunction tree_find$1(x, radius) {\n  var data,\n      x0 = this._x0,\n      x1,\n      x2,\n      x3 = this._x1,\n      halves = [],\n      node = this._root,\n      q,\n      i;\n\n  if (node) halves.push(new Half(node, x0, x3));\n  if (radius == null) radius = Infinity;\n  else {\n    x0 = x - radius;\n    x3 = x + radius;\n  }\n\n  while (q = halves.pop()) {\n\n    // Stop searching if this half can’t contain a closer node.\n    if (!(node = q.node)\n        || (x1 = q.x0) > x3\n        || (x2 = q.x1) < x0) continue;\n\n    // Bisect the current half.\n    if (node.length) {\n      var xm = (x1 + x2) / 2;\n\n      halves.push(\n        new Half(node[1], xm, x2),\n        new Half(node[0], x1, xm)\n      );\n\n      // Visit the closest half first.\n      if (i = +(x >= xm)) {\n        q = halves[halves.length - 1];\n        halves[halves.length - 1] = halves[halves.length - 1 - i];\n        halves[halves.length - 1 - i] = q;\n      }\n    }\n\n    // Visit this point. (Visiting coincident points isn’t necessary!)\n    else {\n      var d = Math.abs(x - +this._x.call(null, node.data));\n      if (d < radius) {\n        radius = d;\n        x0 = x - d;\n        x3 = x + d;\n        data = node.data;\n      }\n    }\n  }\n\n  return data;\n}\n\nexport { tree_find$1 as default };\n//# sourceMappingURL=find.js.map\n"],"names":[],"mappings":";AAEA,SAAS,YAAY,GAAG,QAAQ;AAC9B,MAAI,MACA,KAAK,KAAK,KACV,IACA,IACA,KAAK,KAAK,KACV,SAAS,CAAA,GACT,OAAO,KAAK,OACZ,GACA;AAEJ,MAAI,KAAM,QAAO,KAAK,IAAI,KAAK,MAAM,IAAI,EAAE,CAAC;AAC5C,MAAI,UAAU,KAAM,UAAS;AAAA,OACxB;AACH,SAAK,IAAI;AACT,SAAK,IAAI;AAAA,EACX;AAEA,SAAO,IAAI,OAAO,OAAO;AAGvB,QAAI,EAAE,OAAO,EAAE,UACP,KAAK,EAAE,MAAM,OACb,KAAK,EAAE,MAAM,GAAI;AAGzB,QAAI,KAAK,QAAQ;AACf,UAAI,MAAM,KAAK,MAAM;AAErB,aAAO;AAAA,QACL,IAAI,KAAK,KAAK,CAAC,GAAG,IAAI,EAAE;AAAA,QACxB,IAAI,KAAK,KAAK,CAAC,GAAG,IAAI,EAAE;AAAA,MAChC;AAGM,UAAI,IAAI,EAAE,KAAK,KAAK;AAClB,YAAI,OAAO,OAAO,SAAS,CAAC;AAC5B,eAAO,OAAO,SAAS,CAAC,IAAI,OAAO,OAAO,SAAS,IAAI,CAAC;AACxD,eAAO,OAAO,SAAS,IAAI,CAAC,IAAI;AAAA,MAClC;AAAA,IACF,OAGK;AACH,UAAI,IAAI,KAAK,IAAI,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,KAAK,IAAI,CAAC;AACnD,UAAI,IAAI,QAAQ;AACd,iBAAS;AACT,aAAK,IAAI;AACT,aAAK,IAAI;AACT,eAAO,KAAK;AAAA,MACd;AAAA,IACF;AAAA,EACF;AAEA,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/half.cjs

@@ -0,0 +1,8 @@
+"use strict";
+function Half(node, x0, x1) {
+  this.node = node;
+  this.x0 = x0;
+  this.x1 = x1;
+}
+module.exports = Half;
+//# sourceMappingURL=half.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/half.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"half.cjs","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/half.js"],"sourcesContent":["function Half(node, x0, x1) {\n  this.node = node;\n  this.x0 = x0;\n  this.x1 = x1;\n}\n\nexport { Half as default };\n//# sourceMappingURL=half.js.map\n"],"names":[],"mappings":";AAAA,SAAS,KAAK,MAAM,IAAI,IAAI;AAC1B,OAAK,OAAO;AACZ,OAAK,KAAK;AACV,OAAK,KAAK;AACZ;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/half.js

@@ -0,0 +1,9 @@
+function Half(node, x0, x1) {
+  this.node = node;
+  this.x0 = x0;
+  this.x1 = x1;
+}
+export {
+  Half as default
+};
+//# sourceMappingURL=half.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/half.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"half.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/half.js"],"sourcesContent":["function Half(node, x0, x1) {\n  this.node = node;\n  this.x0 = x0;\n  this.x1 = x1;\n}\n\nexport { Half as default };\n//# sourceMappingURL=half.js.map\n"],"names":[],"mappings":"AAAA,SAAS,KAAK,MAAM,IAAI,IAAI;AAC1B,OAAK,OAAO;AACZ,OAAK,KAAK;AACV,OAAK,KAAK;AACZ;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/remove.cjs

@@ -0,0 +1,31 @@
+"use strict";
+Object.defineProperties(exports, { __esModule: { value: true }, [Symbol.toStringTag]: { value: "Module" } });
+function tree_remove$1(d) {
+  if (isNaN(x = +this._x.call(null, d))) return this;
+  var parent, node = this._root, retainer, previous, next, x0 = this._x0, x1 = this._x1, x, xm, right, i, j;
+  if (!node) return this;
+  if (node.length) while (true) {
+    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm;
+    else x1 = xm;
+    if (!(parent = node, node = node[i = +right])) return this;
+    if (!node.length) break;
+    if (parent[i + 1 & 1]) retainer = parent, j = i;
+  }
+  while (node.data !== d) if (!(previous = node, node = node.next)) return this;
+  if (next = node.next) delete node.next;
+  if (previous) return next ? previous.next = next : delete previous.next, this;
+  if (!parent) return this._root = next, this;
+  next ? parent[i] = next : delete parent[i];
+  if ((node = parent[0] || parent[1]) && node === (parent[1] || parent[0]) && !node.length) {
+    if (retainer) retainer[j] = node;
+    else this._root = node;
+  }
+  return this;
+}
+function removeAll$1(data) {
+  for (var i = 0, n = data.length; i < n; ++i) this.remove(data[i]);
+  return this;
+}
+exports.default = tree_remove$1;
+exports.removeAll = removeAll$1;
+//# sourceMappingURL=remove.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/remove.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"remove.cjs","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/remove.js"],"sourcesContent":["function tree_remove$1(d) {\n  if (isNaN(x = +this._x.call(null, d))) return this; // ignore invalid points\n\n  var parent,\n      node = this._root,\n      retainer,\n      previous,\n      next,\n      x0 = this._x0,\n      x1 = this._x1,\n      x,\n      xm,\n      right,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return this;\n\n  // Find the leaf node for the point.\n  // While descending, also retain the deepest parent with a non-removed sibling.\n  if (node.length) while (true) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (!(parent = node, node = node[i = +right])) return this;\n    if (!node.length) break;\n    if (parent[(i + 1) & 1]) retainer = parent, j = i;\n  }\n\n  // Find the point to remove.\n  while (node.data !== d) if (!(previous = node, node = node.next)) return this;\n  if (next = node.next) delete node.next;\n\n  // If there are multiple coincident points, remove just the point.\n  if (previous) return (next ? previous.next = next : delete previous.next), this;\n\n  // If this is the root point, remove it.\n  if (!parent) return this._root = next, this;\n\n  // Remove this leaf.\n  next ? parent[i] = next : delete parent[i];\n\n  // If the parent now contains exactly one leaf, collapse superfluous parents.\n  if ((node = parent[0] || parent[1])\n      && node === (parent[1] || parent[0])\n      && !node.length) {\n    if (retainer) retainer[j] = node;\n    else this._root = node;\n  }\n\n  return this;\n}\n\nfunction removeAll$1(data) {\n  for (var i = 0, n = data.length; i < n; ++i) this.remove(data[i]);\n  return this;\n}\n\nexport { tree_remove$1 as default, removeAll$1 as removeAll };\n//# sourceMappingURL=remove.js.map\n"],"names":[],"mappings":";;AAAA,SAAS,cAAc,GAAG;AACxB,MAAI,MAAM,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,CAAC,CAAC,EAAG,QAAO;AAE9C,MAAI,QACA,OAAO,KAAK,OACZ,UACA,UACA,MACA,KAAK,KAAK,KACV,KAAK,KAAK,KACV,GACA,IACA,OACA,GACA;AAGJ,MAAI,CAAC,KAAM,QAAO;AAIlB,MAAI,KAAK,OAAQ,QAAO,MAAM;AAC5B,QAAI,QAAQ,MAAM,MAAM,KAAK,MAAM,GAAI,MAAK;AAAA,QAAS,MAAK;AAC1D,QAAI,EAAE,SAAS,MAAM,OAAO,KAAK,IAAI,CAAC,KAAK,GAAI,QAAO;AACtD,QAAI,CAAC,KAAK,OAAQ;AAClB,QAAI,OAAQ,IAAI,IAAK,CAAC,EAAG,YAAW,QAAQ,IAAI;AAAA,EAClD;AAGA,SAAO,KAAK,SAAS,EAAG,KAAI,EAAE,WAAW,MAAM,OAAO,KAAK,MAAO,QAAO;AACzE,MAAI,OAAO,KAAK,KAAM,QAAO,KAAK;AAGlC,MAAI,SAAU,QAAQ,OAAO,SAAS,OAAO,OAAO,OAAO,SAAS,MAAO;AAG3E,MAAI,CAAC,OAAQ,QAAO,KAAK,QAAQ,MAAM;AAGvC,SAAO,OAAO,CAAC,IAAI,OAAO,OAAO,OAAO,CAAC;AAGzC,OAAK,OAAO,OAAO,CAAC,KAAK,OAAO,CAAC,MAC1B,UAAU,OAAO,CAAC,KAAK,OAAO,CAAC,MAC/B,CAAC,KAAK,QAAQ;AACnB,QAAI,SAAU,UAAS,CAAC,IAAI;AAAA,QACvB,MAAK,QAAQ;AAAA,EACpB;AAEA,SAAO;AACT;AAEA,SAAS,YAAY,MAAM;AACzB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAI,GAAG,EAAE,EAAG,MAAK,OAAO,KAAK,CAAC,CAAC;AAChE,SAAO;AACT;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/remove.js

@@ -0,0 +1,31 @@
+function tree_remove$1(d) {
+  if (isNaN(x = +this._x.call(null, d))) return this;
+  var parent, node = this._root, retainer, previous, next, x0 = this._x0, x1 = this._x1, x, xm, right, i, j;
+  if (!node) return this;
+  if (node.length) while (true) {
+    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm;
+    else x1 = xm;
+    if (!(parent = node, node = node[i = +right])) return this;
+    if (!node.length) break;
+    if (parent[i + 1 & 1]) retainer = parent, j = i;
+  }
+  while (node.data !== d) if (!(previous = node, node = node.next)) return this;
+  if (next = node.next) delete node.next;
+  if (previous) return next ? previous.next = next : delete previous.next, this;
+  if (!parent) return this._root = next, this;
+  next ? parent[i] = next : delete parent[i];
+  if ((node = parent[0] || parent[1]) && node === (parent[1] || parent[0]) && !node.length) {
+    if (retainer) retainer[j] = node;
+    else this._root = node;
+  }
+  return this;
+}
+function removeAll$1(data) {
+  for (var i = 0, n = data.length; i < n; ++i) this.remove(data[i]);
+  return this;
+}
+export {
+  tree_remove$1 as default,
+  removeAll$1 as removeAll
+};
+//# sourceMappingURL=remove.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/remove.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"remove.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/remove.js"],"sourcesContent":["function tree_remove$1(d) {\n  if (isNaN(x = +this._x.call(null, d))) return this; // ignore invalid points\n\n  var parent,\n      node = this._root,\n      retainer,\n      previous,\n      next,\n      x0 = this._x0,\n      x1 = this._x1,\n      x,\n      xm,\n      right,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return this;\n\n  // Find the leaf node for the point.\n  // While descending, also retain the deepest parent with a non-removed sibling.\n  if (node.length) while (true) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (!(parent = node, node = node[i = +right])) return this;\n    if (!node.length) break;\n    if (parent[(i + 1) & 1]) retainer = parent, j = i;\n  }\n\n  // Find the point to remove.\n  while (node.data !== d) if (!(previous = node, node = node.next)) return this;\n  if (next = node.next) delete node.next;\n\n  // If there are multiple coincident points, remove just the point.\n  if (previous) return (next ? previous.next = next : delete previous.next), this;\n\n  // If this is the root point, remove it.\n  if (!parent) return this._root = next, this;\n\n  // Remove this leaf.\n  next ? parent[i] = next : delete parent[i];\n\n  // If the parent now contains exactly one leaf, collapse superfluous parents.\n  if ((node = parent[0] || parent[1])\n      && node === (parent[1] || parent[0])\n      && !node.length) {\n    if (retainer) retainer[j] = node;\n    else this._root = node;\n  }\n\n  return this;\n}\n\nfunction removeAll$1(data) {\n  for (var i = 0, n = data.length; i < n; ++i) this.remove(data[i]);\n  return this;\n}\n\nexport { tree_remove$1 as default, removeAll$1 as removeAll };\n//# sourceMappingURL=remove.js.map\n"],"names":[],"mappings":"AAAA,SAAS,cAAc,GAAG;AACxB,MAAI,MAAM,IAAI,CAAC,KAAK,GAAG,KAAK,MAAM,CAAC,CAAC,EAAG,QAAO;AAE9C,MAAI,QACA,OAAO,KAAK,OACZ,UACA,UACA,MACA,KAAK,KAAK,KACV,KAAK,KAAK,KACV,GACA,IACA,OACA,GACA;AAGJ,MAAI,CAAC,KAAM,QAAO;AAIlB,MAAI,KAAK,OAAQ,QAAO,MAAM;AAC5B,QAAI,QAAQ,MAAM,MAAM,KAAK,MAAM,GAAI,MAAK;AAAA,QAAS,MAAK;AAC1D,QAAI,EAAE,SAAS,MAAM,OAAO,KAAK,IAAI,CAAC,KAAK,GAAI,QAAO;AACtD,QAAI,CAAC,KAAK,OAAQ;AAClB,QAAI,OAAQ,IAAI,IAAK,CAAC,EAAG,YAAW,QAAQ,IAAI;AAAA,EAClD;AAGA,SAAO,KAAK,SAAS,EAAG,KAAI,EAAE,WAAW,MAAM,OAAO,KAAK,MAAO,QAAO;AACzE,MAAI,OAAO,KAAK,KAAM,QAAO,KAAK;AAGlC,MAAI,SAAU,QAAQ,OAAO,SAAS,OAAO,OAAO,OAAO,SAAS,MAAO;AAG3E,MAAI,CAAC,OAAQ,QAAO,KAAK,QAAQ,MAAM;AAGvC,SAAO,OAAO,CAAC,IAAI,OAAO,OAAO,OAAO,CAAC;AAGzC,OAAK,OAAO,OAAO,CAAC,KAAK,OAAO,CAAC,MAC1B,UAAU,OAAO,CAAC,KAAK,OAAO,CAAC,MAC/B,CAAC,KAAK,QAAQ;AACnB,QAAI,SAAU,UAAS,CAAC,IAAI;AAAA,QACvB,MAAK,QAAQ;AAAA,EACpB;AAEA,SAAO;AACT;AAEA,SAAS,YAAY,MAAM;AACzB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAI,GAAG,EAAE,EAAG,MAAK,OAAO,KAAK,CAAC,CAAC;AAChE,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/root.cjs

@@ -0,0 +1,6 @@
+"use strict";
+function tree_root$1() {
+  return this._root;
+}
+module.exports = tree_root$1;
+//# sourceMappingURL=root.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/root.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"root.cjs","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/root.js"],"sourcesContent":["function tree_root$1() {\n  return this._root;\n}\n\nexport { tree_root$1 as default };\n//# sourceMappingURL=root.js.map\n"],"names":[],"mappings":";AAAA,SAAS,cAAc;AACrB,SAAO,KAAK;AACd;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/root.js

@@ -0,0 +1,7 @@
+function tree_root$1() {
+  return this._root;
+}
+export {
+  tree_root$1 as default
+};
+//# sourceMappingURL=root.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/root.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"root.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/root.js"],"sourcesContent":["function tree_root$1() {\n  return this._root;\n}\n\nexport { tree_root$1 as default };\n//# sourceMappingURL=root.js.map\n"],"names":[],"mappings":"AAAA,SAAS,cAAc;AACrB,SAAO,KAAK;AACd;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/size.cjs

@@ -0,0 +1,12 @@
+"use strict";
+function tree_size$1() {
+  var size = 0;
+  this.visit(function(node) {
+    if (!node.length) do
+      ++size;
+    while (node = node.next);
+  });
+  return size;
+}
+module.exports = tree_size$1;
+//# sourceMappingURL=size.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/size.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"size.cjs","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/size.js"],"sourcesContent":["function tree_size$1() {\n  var size = 0;\n  this.visit(function(node) {\n    if (!node.length) do ++size; while (node = node.next)\n  });\n  return size;\n}\n\nexport { tree_size$1 as default };\n//# sourceMappingURL=size.js.map\n"],"names":[],"mappings":";AAAA,SAAS,cAAc;AACrB,MAAI,OAAO;AACX,OAAK,MAAM,SAAS,MAAM;AACxB,QAAI,CAAC,KAAK,OAAQ;AAAG,QAAE;AAAA,WAAa,OAAO,KAAK;AAAA,EAClD,CAAC;AACD,SAAO;AACT;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/size.js

@@ -0,0 +1,13 @@
+function tree_size$1() {
+  var size = 0;
+  this.visit(function(node) {
+    if (!node.length) do
+      ++size;
+    while (node = node.next);
+  });
+  return size;
+}
+export {
+  tree_size$1 as default
+};
+//# sourceMappingURL=size.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/size.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"size.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/size.js"],"sourcesContent":["function tree_size$1() {\n  var size = 0;\n  this.visit(function(node) {\n    if (!node.length) do ++size; while (node = node.next)\n  });\n  return size;\n}\n\nexport { tree_size$1 as default };\n//# sourceMappingURL=size.js.map\n"],"names":[],"mappings":"AAAA,SAAS,cAAc;AACrB,MAAI,OAAO;AACX,OAAK,MAAM,SAAS,MAAM;AACxB,QAAI,CAAC,KAAK,OAAQ;AAAG,QAAE;AAAA,WAAa,OAAO,KAAK;AAAA,EAClD,CAAC;AACD,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/visit.cjs

@@ -0,0 +1,16 @@
+"use strict";
+const half = require("./half.cjs");
+function tree_visit$1(callback) {
+  var halves = [], q, node = this._root, child, x0, x1;
+  if (node) halves.push(new half(node, this._x0, this._x1));
+  while (q = halves.pop()) {
+    if (!callback(node = q.node, x0 = q.x0, x1 = q.x1) && node.length) {
+      var xm = (x0 + x1) / 2;
+      if (child = node[1]) halves.push(new half(child, xm, x1));
+      if (child = node[0]) halves.push(new half(child, x0, xm));
+    }
+  }
+  return this;
+}
+module.exports = tree_visit$1;
+//# sourceMappingURL=visit.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/visit.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"visit.cjs","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/visit.js"],"sourcesContent":["import Half from './half.js';\n\nfunction tree_visit$1(callback) {\n  var halves = [], q, node = this._root, child, x0, x1;\n  if (node) halves.push(new Half(node, this._x0, this._x1));\n  while (q = halves.pop()) {\n    if (!callback(node = q.node, x0 = q.x0, x1 = q.x1) && node.length) {\n      var xm = (x0 + x1) / 2;\n      if (child = node[1]) halves.push(new Half(child, xm, x1));\n      if (child = node[0]) halves.push(new Half(child, x0, xm));\n    }\n  }\n  return this;\n}\n\nexport { tree_visit$1 as default };\n//# sourceMappingURL=visit.js.map\n"],"names":["Half"],"mappings":";;AAEA,SAAS,aAAa,UAAU;AAC9B,MAAI,SAAS,CAAA,GAAI,GAAG,OAAO,KAAK,OAAO,OAAO,IAAI;AAClD,MAAI,KAAM,QAAO,KAAK,IAAIA,KAAK,MAAM,KAAK,KAAK,KAAK,GAAG,CAAC;AACxD,SAAO,IAAI,OAAO,OAAO;AACvB,QAAI,CAAC,SAAS,OAAO,EAAE,MAAM,KAAK,EAAE,IAAI,KAAK,EAAE,EAAE,KAAK,KAAK,QAAQ;AACjE,UAAI,MAAM,KAAK,MAAM;AACrB,UAAI,QAAQ,KAAK,CAAC,EAAG,QAAO,KAAK,IAAIA,KAAK,OAAO,IAAI,EAAE,CAAC;AACxD,UAAI,QAAQ,KAAK,CAAC,EAAG,QAAO,KAAK,IAAIA,KAAK,OAAO,IAAI,EAAE,CAAC;AAAA,IAC1D;AAAA,EACF;AACA,SAAO;AACT;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/visit.js

@@ -0,0 +1,17 @@
+import Half from "./half.js";
+function tree_visit$1(callback) {
+  var halves = [], q, node = this._root, child, x0, x1;
+  if (node) halves.push(new Half(node, this._x0, this._x1));
+  while (q = halves.pop()) {
+    if (!callback(node = q.node, x0 = q.x0, x1 = q.x1) && node.length) {
+      var xm = (x0 + x1) / 2;
+      if (child = node[1]) halves.push(new Half(child, xm, x1));
+      if (child = node[0]) halves.push(new Half(child, x0, xm));
+    }
+  }
+  return this;
+}
+export {
+  tree_visit$1 as default
+};
+//# sourceMappingURL=visit.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/visit.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"visit.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/visit.js"],"sourcesContent":["import Half from './half.js';\n\nfunction tree_visit$1(callback) {\n  var halves = [], q, node = this._root, child, x0, x1;\n  if (node) halves.push(new Half(node, this._x0, this._x1));\n  while (q = halves.pop()) {\n    if (!callback(node = q.node, x0 = q.x0, x1 = q.x1) && node.length) {\n      var xm = (x0 + x1) / 2;\n      if (child = node[1]) halves.push(new Half(child, xm, x1));\n      if (child = node[0]) halves.push(new Half(child, x0, xm));\n    }\n  }\n  return this;\n}\n\nexport { tree_visit$1 as default };\n//# sourceMappingURL=visit.js.map\n"],"names":[],"mappings":";AAEA,SAAS,aAAa,UAAU;AAC9B,MAAI,SAAS,CAAA,GAAI,GAAG,OAAO,KAAK,OAAO,OAAO,IAAI;AAClD,MAAI,KAAM,QAAO,KAAK,IAAI,KAAK,MAAM,KAAK,KAAK,KAAK,GAAG,CAAC;AACxD,SAAO,IAAI,OAAO,OAAO;AACvB,QAAI,CAAC,SAAS,OAAO,EAAE,MAAM,KAAK,EAAE,IAAI,KAAK,EAAE,EAAE,KAAK,KAAK,QAAQ;AACjE,UAAI,MAAM,KAAK,MAAM;AACrB,UAAI,QAAQ,KAAK,CAAC,EAAG,QAAO,KAAK,IAAI,KAAK,OAAO,IAAI,EAAE,CAAC;AACxD,UAAI,QAAQ,KAAK,CAAC,EAAG,QAAO,KAAK,IAAI,KAAK,OAAO,IAAI,EAAE,CAAC;AAAA,IAC1D;AAAA,EACF;AACA,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/visitAfter.cjs

@@ -0,0 +1,21 @@
+"use strict";
+const half = require("./half.cjs");
+function tree_visitAfter$1(callback) {
+  var halves = [], next = [], q;
+  if (this._root) halves.push(new half(this._root, this._x0, this._x1));
+  while (q = halves.pop()) {
+    var node = q.node;
+    if (node.length) {
+      var child, x0 = q.x0, x1 = q.x1, xm = (x0 + x1) / 2;
+      if (child = node[0]) halves.push(new half(child, x0, xm));
+      if (child = node[1]) halves.push(new half(child, xm, x1));
+    }
+    next.push(q);
+  }
+  while (q = next.pop()) {
+    callback(q.node, q.x0, q.x1);
+  }
+  return this;
+}
+module.exports = tree_visitAfter$1;
+//# sourceMappingURL=visitAfter.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/visitAfter.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"visitAfter.cjs","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/visitAfter.js"],"sourcesContent":["import Half from './half.js';\n\nfunction tree_visitAfter$1(callback) {\n  var halves = [], next = [], q;\n  if (this._root) halves.push(new Half(this._root, this._x0, this._x1));\n  while (q = halves.pop()) {\n    var node = q.node;\n    if (node.length) {\n      var child, x0 = q.x0, x1 = q.x1, xm = (x0 + x1) / 2;\n      if (child = node[0]) halves.push(new Half(child, x0, xm));\n      if (child = node[1]) halves.push(new Half(child, xm, x1));\n    }\n    next.push(q);\n  }\n  while (q = next.pop()) {\n    callback(q.node, q.x0, q.x1);\n  }\n  return this;\n}\n\nexport { tree_visitAfter$1 as default };\n//# sourceMappingURL=visitAfter.js.map\n"],"names":["Half"],"mappings":";;AAEA,SAAS,kBAAkB,UAAU;AACnC,MAAI,SAAS,CAAA,GAAI,OAAO,CAAA,GAAI;AAC5B,MAAI,KAAK,MAAO,QAAO,KAAK,IAAIA,KAAK,KAAK,OAAO,KAAK,KAAK,KAAK,GAAG,CAAC;AACpE,SAAO,IAAI,OAAO,OAAO;AACvB,QAAI,OAAO,EAAE;AACb,QAAI,KAAK,QAAQ;AACf,UAAI,OAAO,KAAK,EAAE,IAAI,KAAK,EAAE,IAAI,MAAM,KAAK,MAAM;AAClD,UAAI,QAAQ,KAAK,CAAC,EAAG,QAAO,KAAK,IAAIA,KAAK,OAAO,IAAI,EAAE,CAAC;AACxD,UAAI,QAAQ,KAAK,CAAC,EAAG,QAAO,KAAK,IAAIA,KAAK,OAAO,IAAI,EAAE,CAAC;AAAA,IAC1D;AACA,SAAK,KAAK,CAAC;AAAA,EACb;AACA,SAAO,IAAI,KAAK,OAAO;AACrB,aAAS,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE;AAAA,EAC7B;AACA,SAAO;AACT;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/visitAfter.js

@@ -0,0 +1,22 @@
+import Half from "./half.js";
+function tree_visitAfter$1(callback) {
+  var halves = [], next = [], q;
+  if (this._root) halves.push(new Half(this._root, this._x0, this._x1));
+  while (q = halves.pop()) {
+    var node = q.node;
+    if (node.length) {
+      var child, x0 = q.x0, x1 = q.x1, xm = (x0 + x1) / 2;
+      if (child = node[0]) halves.push(new Half(child, x0, xm));
+      if (child = node[1]) halves.push(new Half(child, xm, x1));
+    }
+    next.push(q);
+  }
+  while (q = next.pop()) {
+    callback(q.node, q.x0, q.x1);
+  }
+  return this;
+}
+export {
+  tree_visitAfter$1 as default
+};
+//# sourceMappingURL=visitAfter.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/visitAfter.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"visitAfter.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/visitAfter.js"],"sourcesContent":["import Half from './half.js';\n\nfunction tree_visitAfter$1(callback) {\n  var halves = [], next = [], q;\n  if (this._root) halves.push(new Half(this._root, this._x0, this._x1));\n  while (q = halves.pop()) {\n    var node = q.node;\n    if (node.length) {\n      var child, x0 = q.x0, x1 = q.x1, xm = (x0 + x1) / 2;\n      if (child = node[0]) halves.push(new Half(child, x0, xm));\n      if (child = node[1]) halves.push(new Half(child, xm, x1));\n    }\n    next.push(q);\n  }\n  while (q = next.pop()) {\n    callback(q.node, q.x0, q.x1);\n  }\n  return this;\n}\n\nexport { tree_visitAfter$1 as default };\n//# sourceMappingURL=visitAfter.js.map\n"],"names":[],"mappings":";AAEA,SAAS,kBAAkB,UAAU;AACnC,MAAI,SAAS,CAAA,GAAI,OAAO,CAAA,GAAI;AAC5B,MAAI,KAAK,MAAO,QAAO,KAAK,IAAI,KAAK,KAAK,OAAO,KAAK,KAAK,KAAK,GAAG,CAAC;AACpE,SAAO,IAAI,OAAO,OAAO;AACvB,QAAI,OAAO,EAAE;AACb,QAAI,KAAK,QAAQ;AACf,UAAI,OAAO,KAAK,EAAE,IAAI,KAAK,EAAE,IAAI,MAAM,KAAK,MAAM;AAClD,UAAI,QAAQ,KAAK,CAAC,EAAG,QAAO,KAAK,IAAI,KAAK,OAAO,IAAI,EAAE,CAAC;AACxD,UAAI,QAAQ,KAAK,CAAC,EAAG,QAAO,KAAK,IAAI,KAAK,OAAO,IAAI,EAAE,CAAC;AAAA,IAC1D;AACA,SAAK,KAAK,CAAC;AAAA,EACb;AACA,SAAO,IAAI,KAAK,OAAO;AACrB,aAAS,EAAE,MAAM,EAAE,IAAI,EAAE,EAAE;AAAA,EAC7B;AACA,SAAO;AACT;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/x.cjs

@@ -0,0 +1,11 @@
+"use strict";
+Object.defineProperties(exports, { __esModule: { value: true }, [Symbol.toStringTag]: { value: "Module" } });
+function defaultX$1(d) {
+  return d[0];
+}
+function tree_x$1(_) {
+  return arguments.length ? (this._x = _, this) : this._x;
+}
+exports.default = tree_x$1;
+exports.defaultX = defaultX$1;
+//# sourceMappingURL=x.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/x.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"x.cjs","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/x.js"],"sourcesContent":["function defaultX$1(d) {\n  return d[0];\n}\n\nfunction tree_x$1(_) {\n  return arguments.length ? (this._x = _, this) : this._x;\n}\n\nexport { tree_x$1 as default, defaultX$1 as defaultX };\n//# sourceMappingURL=x.js.map\n"],"names":[],"mappings":";;AAAA,SAAS,WAAW,GAAG;AACrB,SAAO,EAAE,CAAC;AACZ;AAEA,SAAS,SAAS,GAAG;AACnB,SAAO,UAAU,UAAU,KAAK,KAAK,GAAG,QAAQ,KAAK;AACvD;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/x.js

@@ -0,0 +1,11 @@
+function defaultX$1(d) {
+  return d[0];
+}
+function tree_x$1(_) {
+  return arguments.length ? (this._x = _, this) : this._x;
+}
+export {
+  tree_x$1 as default,
+  defaultX$1 as defaultX
+};
+//# sourceMappingURL=x.js.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/x.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"x.js","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-binarytree/src/x.js"],"sourcesContent":["function defaultX$1(d) {\n  return d[0];\n}\n\nfunction tree_x$1(_) {\n  return arguments.length ? (this._x = _, this) : this._x;\n}\n\nexport { tree_x$1 as default, defaultX$1 as defaultX };\n//# sourceMappingURL=x.js.map\n"],"names":[],"mappings":"AAAA,SAAS,WAAW,GAAG;AACrB,SAAO,EAAE,CAAC;AACZ;AAEA,SAAS,SAAS,GAAG;AACnB,SAAO,UAAU,UAAU,KAAK,KAAK,GAAG,QAAQ,KAAK;AACvD;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-dispatch/src/dispatch.cjs

@@ -0,0 +1,70 @@
+"use strict";
+var noop = { value: () => {
+} };
+function dispatch() {
+  for (var i = 0, n = arguments.length, _ = {}, t; i < n; ++i) {
+    if (!(t = arguments[i] + "") || t in _ || /[\s.]/.test(t)) throw new Error("illegal type: " + t);
+    _[t] = [];
+  }
+  return new Dispatch(_);
+}
+function Dispatch(_) {
+  this._ = _;
+}
+function parseTypenames(typenames, types) {
+  return typenames.trim().split(/^|\s+/).map(function(t) {
+    var name = "", i = t.indexOf(".");
+    if (i >= 0) name = t.slice(i + 1), t = t.slice(0, i);
+    if (t && !types.hasOwnProperty(t)) throw new Error("unknown type: " + t);
+    return { type: t, name };
+  });
+}
+Dispatch.prototype = dispatch.prototype = {
+  constructor: Dispatch,
+  on: function(typename, callback) {
+    var _ = this._, T = parseTypenames(typename + "", _), t, i = -1, n = T.length;
+    if (arguments.length < 2) {
+      while (++i < n) if ((t = (typename = T[i]).type) && (t = get(_[t], typename.name))) return t;
+      return;
+    }
+    if (callback != null && typeof callback !== "function") throw new Error("invalid callback: " + callback);
+    while (++i < n) {
+      if (t = (typename = T[i]).type) _[t] = set(_[t], typename.name, callback);
+      else if (callback == null) for (t in _) _[t] = set(_[t], typename.name, null);
+    }
+    return this;
+  },
+  copy: function() {
+    var copy = {}, _ = this._;
+    for (var t in _) copy[t] = _[t].slice();
+    return new Dispatch(copy);
+  },
+  call: function(type, that) {
+    if ((n = arguments.length - 2) > 0) for (var args = new Array(n), i = 0, n, t; i < n; ++i) args[i] = arguments[i + 2];
+    if (!this._.hasOwnProperty(type)) throw new Error("unknown type: " + type);
+    for (t = this._[type], i = 0, n = t.length; i < n; ++i) t[i].value.apply(that, args);
+  },
+  apply: function(type, that, args) {
+    if (!this._.hasOwnProperty(type)) throw new Error("unknown type: " + type);
+    for (var t = this._[type], i = 0, n = t.length; i < n; ++i) t[i].value.apply(that, args);
+  }
+};
+function get(type, name) {
+  for (var i = 0, n = type.length, c; i < n; ++i) {
+    if ((c = type[i]).name === name) {
+      return c.value;
+    }
+  }
+}
+function set(type, name, callback) {
+  for (var i = 0, n = type.length; i < n; ++i) {
+    if (type[i].name === name) {
+      type[i] = noop, type = type.slice(0, i).concat(type.slice(i + 1));
+      break;
+    }
+  }
+  if (callback != null) type.push({ name, value: callback });
+  return type;
+}
+module.exports = dispatch;
+//# sourceMappingURL=dispatch.cjs.map

package/dist/node_modules/.pnpm/@antv_layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-dispatch/src/dispatch.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"dispatch.cjs","sources":["../../../../../../../../../../../../node_modules/.pnpm/@antv+layout@2.0.0/node_modules/@antv/layout/lib/node_modules/d3-dispatch/src/dispatch.js"],"sourcesContent":["var noop = {value: () => {}};\n\nfunction dispatch() {\n  for (var i = 0, n = arguments.length, _ = {}, t; i < n; ++i) {\n    if (!(t = arguments[i] + \"\") || (t in _) || /[\\s.]/.test(t)) throw new Error(\"illegal type: \" + t);\n    _[t] = [];\n  }\n  return new Dispatch(_);\n}\n\nfunction Dispatch(_) {\n  this._ = _;\n}\n\nfunction parseTypenames(typenames, types) {\n  return typenames.trim().split(/^|\\s+/).map(function(t) {\n    var name = \"\", i = t.indexOf(\".\");\n    if (i >= 0) name = t.slice(i + 1), t = t.slice(0, i);\n    if (t && !types.hasOwnProperty(t)) throw new Error(\"unknown type: \" + t);\n    return {type: t, name: name};\n  });\n}\n\nDispatch.prototype = dispatch.prototype = {\n  constructor: Dispatch,\n  on: function(typename, callback) {\n    var _ = this._,\n        T = parseTypenames(typename + \"\", _),\n        t,\n        i = -1,\n        n = T.length;\n\n    // If no callback was specified, return the callback of the given type and name.\n    if (arguments.length < 2) {\n      while (++i < n) if ((t = (typename = T[i]).type) && (t = get(_[t], typename.name))) return t;\n      return;\n    }\n\n    // If a type was specified, set the callback for the given type and name.\n    // Otherwise, if a null callback was specified, remove callbacks of the given name.\n    if (callback != null && typeof callback !== \"function\") throw new Error(\"invalid callback: \" + callback);\n    while (++i < n) {\n      if (t = (typename = T[i]).type) _[t] = set(_[t], typename.name, callback);\n      else if (callback == null) for (t in _) _[t] = set(_[t], typename.name, null);\n    }\n\n    return this;\n  },\n  copy: function() {\n    var copy = {}, _ = this._;\n    for (var t in _) copy[t] = _[t].slice();\n    return new Dispatch(copy);\n  },\n  call: function(type, that) {\n    if ((n = arguments.length - 2) > 0) for (var args = new Array(n), i = 0, n, t; i < n; ++i) args[i] = arguments[i + 2];\n    if (!this._.hasOwnProperty(type)) throw new Error(\"unknown type: \" + type);\n    for (t = this._[type], i = 0, n = t.length; i < n; ++i) t[i].value.apply(that, args);\n  },\n  apply: function(type, that, args) {\n    if (!this._.hasOwnProperty(type)) throw new Error(\"unknown type: \" + type);\n    for (var t = this._[type], i = 0, n = t.length; i < n; ++i) t[i].value.apply(that, args);\n  }\n};\n\nfunction get(type, name) {\n  for (var i = 0, n = type.length, c; i < n; ++i) {\n    if ((c = type[i]).name === name) {\n      return c.value;\n    }\n  }\n}\n\nfunction set(type, name, callback) {\n  for (var i = 0, n = type.length; i < n; ++i) {\n    if (type[i].name === name) {\n      type[i] = noop, type = type.slice(0, i).concat(type.slice(i + 1));\n      break;\n    }\n  }\n  if (callback != null) type.push({name: name, value: callback});\n  return type;\n}\n\nexport { dispatch as default };\n//# sourceMappingURL=dispatch.js.map\n"],"names":[],"mappings":";AAAA,IAAI,OAAO,EAAC,OAAO,MAAM;AAAC,EAAC;AAE3B,SAAS,WAAW;AAClB,WAAS,IAAI,GAAG,IAAI,UAAU,QAAQ,IAAI,CAAA,GAAI,GAAG,IAAI,GAAG,EAAE,GAAG;AAC3D,QAAI,EAAE,IAAI,UAAU,CAAC,IAAI,OAAQ,KAAK,KAAM,QAAQ,KAAK,CAAC,EAAG,OAAM,IAAI,MAAM,mBAAmB,CAAC;AACjG,MAAE,CAAC,IAAI,CAAA;AAAA,EACT;AACA,SAAO,IAAI,SAAS,CAAC;AACvB;AAEA,SAAS,SAAS,GAAG;AACnB,OAAK,IAAI;AACX;AAEA,SAAS,eAAe,WAAW,OAAO;AACxC,SAAO,UAAU,OAAO,MAAM,OAAO,EAAE,IAAI,SAAS,GAAG;AACrD,QAAI,OAAO,IAAI,IAAI,EAAE,QAAQ,GAAG;AAChC,QAAI,KAAK,EAAG,QAAO,EAAE,MAAM,IAAI,CAAC,GAAG,IAAI,EAAE,MAAM,GAAG,CAAC;AACnD,QAAI,KAAK,CAAC,MAAM,eAAe,CAAC,EAAG,OAAM,IAAI,MAAM,mBAAmB,CAAC;AACvE,WAAO,EAAC,MAAM,GAAG,KAAU;AAAA,EAC7B,CAAC;AACH;AAEA,SAAS,YAAY,SAAS,YAAY;AAAA,EACxC,aAAa;AAAA,EACb,IAAI,SAAS,UAAU,UAAU;AAC/B,QAAI,IAAI,KAAK,GACT,IAAI,eAAe,WAAW,IAAI,CAAC,GACnC,GACA,IAAI,IACJ,IAAI,EAAE;AAGV,QAAI,UAAU,SAAS,GAAG;AACxB,aAAO,EAAE,IAAI,EAAG,MAAK,KAAK,WAAW,EAAE,CAAC,GAAG,UAAU,IAAI,IAAI,EAAE,CAAC,GAAG,SAAS,IAAI,GAAI,QAAO;AAC3F;AAAA,IACF;AAIA,QAAI,YAAY,QAAQ,OAAO,aAAa,WAAY,OAAM,IAAI,MAAM,uBAAuB,QAAQ;AACvG,WAAO,EAAE,IAAI,GAAG;AACd,UAAI,KAAK,WAAW,EAAE,CAAC,GAAG,KAAM,GAAE,CAAC,IAAI,IAAI,EAAE,CAAC,GAAG,SAAS,MAAM,QAAQ;AAAA,eAC/D,YAAY,KAAM,MAAK,KAAK,EAAG,GAAE,CAAC,IAAI,IAAI,EAAE,CAAC,GAAG,SAAS,MAAM,IAAI;AAAA,IAC9E;AAEA,WAAO;AAAA,EACT;AAAA,EACA,MAAM,WAAW;AACf,QAAI,OAAO,CAAA,GAAI,IAAI,KAAK;AACxB,aAAS,KAAK,EAAG,MAAK,CAAC,IAAI,EAAE,CAAC,EAAE,MAAK;AACrC,WAAO,IAAI,SAAS,IAAI;AAAA,EAC1B;AAAA,EACA,MAAM,SAAS,MAAM,MAAM;AACzB,SAAK,IAAI,UAAU,SAAS,KAAK,EAAG,UAAS,OAAO,IAAI,MAAM,CAAC,GAAG,IAAI,GAAG,GAAG,GAAG,IAAI,GAAG,EAAE,EAAG,MAAK,CAAC,IAAI,UAAU,IAAI,CAAC;AACpH,QAAI,CAAC,KAAK,EAAE,eAAe,IAAI,EAAG,OAAM,IAAI,MAAM,mBAAmB,IAAI;AACzE,SAAK,IAAI,KAAK,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAI,GAAG,EAAE,EAAG,GAAE,CAAC,EAAE,MAAM,MAAM,MAAM,IAAI;AAAA,EACrF;AAAA,EACA,OAAO,SAAS,MAAM,MAAM,MAAM;AAChC,QAAI,CAAC,KAAK,EAAE,eAAe,IAAI,EAAG,OAAM,IAAI,MAAM,mBAAmB,IAAI;AACzE,aAAS,IAAI,KAAK,EAAE,IAAI,GAAG,IAAI,GAAG,IAAI,EAAE,QAAQ,IAAI,GAAG,EAAE,EAAG,GAAE,CAAC,EAAE,MAAM,MAAM,MAAM,IAAI;AAAA,EACzF;AACF;AAEA,SAAS,IAAI,MAAM,MAAM;AACvB,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,GAAG,IAAI,GAAG,EAAE,GAAG;AAC9C,SAAK,IAAI,KAAK,CAAC,GAAG,SAAS,MAAM;AAC/B,aAAO,EAAE;AAAA,IACX;AAAA,EACF;AACF;AAEA,SAAS,IAAI,MAAM,MAAM,UAAU;AACjC,WAAS,IAAI,GAAG,IAAI,KAAK,QAAQ,IAAI,GAAG,EAAE,GAAG;AAC3C,QAAI,KAAK,CAAC,EAAE,SAAS,MAAM;AACzB,WAAK,CAAC,IAAI,MAAM,OAAO,KAAK,MAAM,GAAG,CAAC,EAAE,OAAO,KAAK,MAAM,IAAI,CAAC,CAAC;AAChE;AAAA,IACF;AAAA,EACF;AACA,MAAI,YAAY,KAAM,MAAK,KAAK,EAAC,MAAY,OAAO,SAAQ,CAAC;AAC7D,SAAO;AACT;;","x_google_ignoreList":[0]}