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

package/dist/node_modules/.pnpm/@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/structs/linked-list.cjs

@@ -0,0 +1,170 @@
+"use strict";
+Object.defineProperties(exports, { __esModule: { value: true }, [Symbol.toStringTag]: { value: "Module" } });
+var defaultComparator = function defaultComparator2(a, b) {
+  if (a === b) {
+    return true;
+  }
+  return false;
+};
+var LinkedListNode = (
+  /** @class */
+  (function() {
+    function LinkedListNode2(value, next) {
+      if (next === void 0) {
+        next = null;
+      }
+      this.value = value;
+      this.next = next;
+    }
+    LinkedListNode2.prototype.toString = function(callback) {
+      return callback ? callback(this.value) : "".concat(this.value);
+    };
+    return LinkedListNode2;
+  })()
+);
+var LinkedList = (
+  /** @class */
+  (function() {
+    function LinkedList2(comparator) {
+      if (comparator === void 0) {
+        comparator = defaultComparator;
+      }
+      this.head = null;
+      this.tail = null;
+      this.compare = comparator;
+    }
+    LinkedList2.prototype.prepend = function(value) {
+      var newNode = new LinkedListNode(value, this.head);
+      this.head = newNode;
+      if (!this.tail) {
+        this.tail = newNode;
+      }
+      return this;
+    };
+    LinkedList2.prototype.append = function(value) {
+      var newNode = new LinkedListNode(value);
+      if (!this.head) {
+        this.head = newNode;
+        this.tail = newNode;
+        return this;
+      }
+      this.tail.next = newNode;
+      this.tail = newNode;
+      return this;
+    };
+    LinkedList2.prototype.delete = function(value) {
+      if (!this.head) {
+        return null;
+      }
+      var deleteNode = null;
+      while (this.head && this.compare(this.head.value, value)) {
+        deleteNode = this.head;
+        this.head = this.head.next;
+      }
+      var currentNode = this.head;
+      if (currentNode !== null) {
+        while (currentNode.next) {
+          if (this.compare(currentNode.next.value, value)) {
+            deleteNode = currentNode.next;
+            currentNode.next = currentNode.next.next;
+          } else {
+            currentNode = currentNode.next;
+          }
+        }
+      }
+      if (this.compare(this.tail.value, value)) {
+        this.tail = currentNode;
+      }
+      return deleteNode;
+    };
+    LinkedList2.prototype.find = function(_a) {
+      var _b = _a.value, value = _b === void 0 ? void 0 : _b, _c = _a.callback, callback = _c === void 0 ? void 0 : _c;
+      if (!this.head) {
+        return null;
+      }
+      var currentNode = this.head;
+      while (currentNode) {
+        if (callback && callback(currentNode.value)) {
+          return currentNode;
+        }
+        if (value !== void 0 && this.compare(currentNode.value, value)) {
+          return currentNode;
+        }
+        currentNode = currentNode.next;
+      }
+      return null;
+    };
+    LinkedList2.prototype.deleteTail = function() {
+      var deletedTail = this.tail;
+      if (this.head === this.tail) {
+        this.head = null;
+        this.tail = null;
+        return deletedTail;
+      }
+      var currentNode = this.head;
+      while (currentNode.next) {
+        if (!currentNode.next.next) {
+          currentNode.next = null;
+        } else {
+          currentNode = currentNode.next;
+        }
+      }
+      this.tail = currentNode;
+      return deletedTail;
+    };
+    LinkedList2.prototype.deleteHead = function() {
+      if (!this.head) {
+        return null;
+      }
+      var deletedHead = this.head;
+      if (this.head.next) {
+        this.head = this.head.next;
+      } else {
+        this.head = null;
+        this.tail = null;
+      }
+      return deletedHead;
+    };
+    LinkedList2.prototype.fromArray = function(values) {
+      var _this = this;
+      values.forEach(function(value) {
+        return _this.append(value);
+      });
+      return this;
+    };
+    LinkedList2.prototype.toArray = function() {
+      var nodes = [];
+      var currentNode = this.head;
+      while (currentNode) {
+        nodes.push(currentNode);
+        currentNode = currentNode.next;
+      }
+      return nodes;
+    };
+    LinkedList2.prototype.reverse = function() {
+      var currentNode = this.head;
+      var prevNode = null;
+      var nextNode = null;
+      while (currentNode) {
+        nextNode = currentNode.next;
+        currentNode.next = prevNode;
+        prevNode = currentNode;
+        currentNode = nextNode;
+      }
+      this.tail = this.head;
+      this.head = prevNode;
+    };
+    LinkedList2.prototype.toString = function(callback) {
+      if (callback === void 0) {
+        callback = void 0;
+      }
+      return this.toArray().map(function(node) {
+        return node.toString(callback);
+      }).toString();
+    };
+    return LinkedList2;
+  })()
+);
+exports.LinkedListNode = LinkedListNode;
+exports.default = LinkedList;
+//# sourceMappingURL=linked-list.cjs.map

package/dist/node_modules/.pnpm/@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/structs/linked-list.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"linked-list.cjs","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+algorithm@0.1.26/node_modules/@antv/algorithm/es/structs/linked-list.js"],"sourcesContent":["var defaultComparator = function defaultComparator(a, b) {\n  if (a === b) {\n    return true;\n  }\n  return false;\n};\n/**\n * 链表中单个元素节点\n */\nvar LinkedListNode = /** @class */function () {\n  function LinkedListNode(value, next) {\n    if (next === void 0) {\n      next = null;\n    }\n    this.value = value;\n    this.next = next;\n  }\n  LinkedListNode.prototype.toString = function (callback) {\n    return callback ? callback(this.value) : \"\".concat(this.value);\n  };\n  return LinkedListNode;\n}();\nexport { LinkedListNode };\nvar LinkedList = /** @class */function () {\n  function LinkedList(comparator) {\n    if (comparator === void 0) {\n      comparator = defaultComparator;\n    }\n    this.head = null;\n    this.tail = null;\n    this.compare = comparator;\n  }\n  /**\n   * 将指定元素添加到链表头部\n   * @param value\n   */\n  LinkedList.prototype.prepend = function (value) {\n    // 在头部添加一个节点\n    var newNode = new LinkedListNode(value, this.head);\n    this.head = newNode;\n    if (!this.tail) {\n      this.tail = newNode;\n    }\n    return this;\n  };\n  /**\n   * 将指定元素添加到链表中\n   * @param value\n   */\n  LinkedList.prototype.append = function (value) {\n    var newNode = new LinkedListNode(value);\n    // 如果不存在头节点，则将创建的新节点作为头节点\n    if (!this.head) {\n      this.head = newNode;\n      this.tail = newNode;\n      return this;\n    }\n    // 将新节点附加到链表末尾\n    this.tail.next = newNode;\n    this.tail = newNode;\n    return this;\n  };\n  /**\n   * 删除指定元素\n   * @param value 要删除的元素\n   */\n  LinkedList.prototype.delete = function (value) {\n    if (!this.head) {\n      return null;\n    }\n    var deleteNode = null;\n    // 如果删除的是头部元素，则将next作为头元素\n    while (this.head && this.compare(this.head.value, value)) {\n      deleteNode = this.head;\n      this.head = this.head.next;\n    }\n    var currentNode = this.head;\n    if (currentNode !== null) {\n      // 如果删除了节点以后，将next节点前移\n      while (currentNode.next) {\n        if (this.compare(currentNode.next.value, value)) {\n          deleteNode = currentNode.next;\n          currentNode.next = currentNode.next.next;\n        } else {\n          currentNode = currentNode.next;\n        }\n      }\n    }\n    // 检查尾部节点是否被删除\n    if (this.compare(this.tail.value, value)) {\n      this.tail = currentNode;\n    }\n    return deleteNode;\n  };\n  /**\n   * 查找指定的元素\n   * @param param0\n   */\n  LinkedList.prototype.find = function (_a) {\n    var _b = _a.value,\n      value = _b === void 0 ? undefined : _b,\n      _c = _a.callback,\n      callback = _c === void 0 ? undefined : _c;\n    if (!this.head) {\n      return null;\n    }\n    var currentNode = this.head;\n    while (currentNode) {\n      // 如果指定了 callback，则按指定的 callback 查找\n      if (callback && callback(currentNode.value)) {\n        return currentNode;\n      }\n      // 如果指定了 value，则按 value 查找\n      if (value !== undefined && this.compare(currentNode.value, value)) {\n        return currentNode;\n      }\n      currentNode = currentNode.next;\n    }\n    return null;\n  };\n  /**\n   * 删除尾部节点\n   */\n  LinkedList.prototype.deleteTail = function () {\n    var deletedTail = this.tail;\n    if (this.head === this.tail) {\n      // 链表中只有一个元素\n      this.head = null;\n      this.tail = null;\n      return deletedTail;\n    }\n    var currentNode = this.head;\n    while (currentNode.next) {\n      if (!currentNode.next.next) {\n        currentNode.next = null;\n      } else {\n        currentNode = currentNode.next;\n      }\n    }\n    this.tail = currentNode;\n    return deletedTail;\n  };\n  /**\n   * 删除头部节点\n   */\n  LinkedList.prototype.deleteHead = function () {\n    if (!this.head) {\n      return null;\n    }\n    var deletedHead = this.head;\n    if (this.head.next) {\n      this.head = this.head.next;\n    } else {\n      this.head = null;\n      this.tail = null;\n    }\n    return deletedHead;\n  };\n  /**\n   * 将一组元素转成链表中的节点\n   * @param values 链表中的元素\n   */\n  LinkedList.prototype.fromArray = function (values) {\n    var _this = this;\n    values.forEach(function (value) {\n      return _this.append(value);\n    });\n    return this;\n  };\n  /**\n   * 将链表中的节点转成数组元素\n   */\n  LinkedList.prototype.toArray = function () {\n    var nodes = [];\n    var currentNode = this.head;\n    while (currentNode) {\n      nodes.push(currentNode);\n      currentNode = currentNode.next;\n    }\n    return nodes;\n  };\n  /**\n   * 反转链表中的元素节点\n   */\n  LinkedList.prototype.reverse = function () {\n    var currentNode = this.head;\n    var prevNode = null;\n    var nextNode = null;\n    while (currentNode) {\n      // 存储下一个元素节点\n      nextNode = currentNode.next;\n      // 更改当前节点的下一个节点，以便将它连接到上一个节点上\n      currentNode.next = prevNode;\n      // 将 prevNode 和 currentNode 向前移动一步\n      prevNode = currentNode;\n      currentNode = nextNode;\n    }\n    this.tail = this.head;\n    this.head = prevNode;\n  };\n  LinkedList.prototype.toString = function (callback) {\n    if (callback === void 0) {\n      callback = undefined;\n    }\n    return this.toArray().map(function (node) {\n      return node.toString(callback);\n    }).toString();\n  };\n  return LinkedList;\n}();\nexport default LinkedList;"],"names":["defaultComparator","LinkedListNode","LinkedList"],"mappings":";;AAAA,IAAI,oBAAoB,SAASA,mBAAkB,GAAG,GAAG;AACvD,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAIG,IAAC;AAAA;AAAA,GAA8B,WAAY;AAC5C,aAASC,gBAAe,OAAO,MAAM;AACnC,UAAI,SAAS,QAAQ;AACnB,eAAO;AAAA,MACT;AACA,WAAK,QAAQ;AACb,WAAK,OAAO;AAAA,IACd;AACA,IAAAA,gBAAe,UAAU,WAAW,SAAU,UAAU;AACtD,aAAO,WAAW,SAAS,KAAK,KAAK,IAAI,GAAG,OAAO,KAAK,KAAK;AAAA,IAC/D;AACA,WAAOA;AAAA,EACT,GAAC;AAAA;AAEE,IAAC;AAAA;AAAA,GAA0B,WAAY;AACxC,aAASC,YAAW,YAAY;AAC9B,UAAI,eAAe,QAAQ;AACzB,qBAAa;AAAA,MACf;AACA,WAAK,OAAO;AACZ,WAAK,OAAO;AACZ,WAAK,UAAU;AAAA,IACjB;AAKA,IAAAA,YAAW,UAAU,UAAU,SAAU,OAAO;AAE9C,UAAI,UAAU,IAAI,eAAe,OAAO,KAAK,IAAI;AACjD,WAAK,OAAO;AACZ,UAAI,CAAC,KAAK,MAAM;AACd,aAAK,OAAO;AAAA,MACd;AACA,aAAO;AAAA,IACT;AAKA,IAAAA,YAAW,UAAU,SAAS,SAAU,OAAO;AAC7C,UAAI,UAAU,IAAI,eAAe,KAAK;AAEtC,UAAI,CAAC,KAAK,MAAM;AACd,aAAK,OAAO;AACZ,aAAK,OAAO;AACZ,eAAO;AAAA,MACT;AAEA,WAAK,KAAK,OAAO;AACjB,WAAK,OAAO;AACZ,aAAO;AAAA,IACT;AAKA,IAAAA,YAAW,UAAU,SAAS,SAAU,OAAO;AAC7C,UAAI,CAAC,KAAK,MAAM;AACd,eAAO;AAAA,MACT;AACA,UAAI,aAAa;AAEjB,aAAO,KAAK,QAAQ,KAAK,QAAQ,KAAK,KAAK,OAAO,KAAK,GAAG;AACxD,qBAAa,KAAK;AAClB,aAAK,OAAO,KAAK,KAAK;AAAA,MACxB;AACA,UAAI,cAAc,KAAK;AACvB,UAAI,gBAAgB,MAAM;AAExB,eAAO,YAAY,MAAM;AACvB,cAAI,KAAK,QAAQ,YAAY,KAAK,OAAO,KAAK,GAAG;AAC/C,yBAAa,YAAY;AACzB,wBAAY,OAAO,YAAY,KAAK;AAAA,UACtC,OAAO;AACL,0BAAc,YAAY;AAAA,UAC5B;AAAA,QACF;AAAA,MACF;AAEA,UAAI,KAAK,QAAQ,KAAK,KAAK,OAAO,KAAK,GAAG;AACxC,aAAK,OAAO;AAAA,MACd;AACA,aAAO;AAAA,IACT;AAKA,IAAAA,YAAW,UAAU,OAAO,SAAU,IAAI;AACxC,UAAI,KAAK,GAAG,OACV,QAAQ,OAAO,SAAS,SAAY,IACpC,KAAK,GAAG,UACR,WAAW,OAAO,SAAS,SAAY;AACzC,UAAI,CAAC,KAAK,MAAM;AACd,eAAO;AAAA,MACT;AACA,UAAI,cAAc,KAAK;AACvB,aAAO,aAAa;AAElB,YAAI,YAAY,SAAS,YAAY,KAAK,GAAG;AAC3C,iBAAO;AAAA,QACT;AAEA,YAAI,UAAU,UAAa,KAAK,QAAQ,YAAY,OAAO,KAAK,GAAG;AACjE,iBAAO;AAAA,QACT;AACA,sBAAc,YAAY;AAAA,MAC5B;AACA,aAAO;AAAA,IACT;AAIA,IAAAA,YAAW,UAAU,aAAa,WAAY;AAC5C,UAAI,cAAc,KAAK;AACvB,UAAI,KAAK,SAAS,KAAK,MAAM;AAE3B,aAAK,OAAO;AACZ,aAAK,OAAO;AACZ,eAAO;AAAA,MACT;AACA,UAAI,cAAc,KAAK;AACvB,aAAO,YAAY,MAAM;AACvB,YAAI,CAAC,YAAY,KAAK,MAAM;AAC1B,sBAAY,OAAO;AAAA,QACrB,OAAO;AACL,wBAAc,YAAY;AAAA,QAC5B;AAAA,MACF;AACA,WAAK,OAAO;AACZ,aAAO;AAAA,IACT;AAIA,IAAAA,YAAW,UAAU,aAAa,WAAY;AAC5C,UAAI,CAAC,KAAK,MAAM;AACd,eAAO;AAAA,MACT;AACA,UAAI,cAAc,KAAK;AACvB,UAAI,KAAK,KAAK,MAAM;AAClB,aAAK,OAAO,KAAK,KAAK;AAAA,MACxB,OAAO;AACL,aAAK,OAAO;AACZ,aAAK,OAAO;AAAA,MACd;AACA,aAAO;AAAA,IACT;AAKA,IAAAA,YAAW,UAAU,YAAY,SAAU,QAAQ;AACjD,UAAI,QAAQ;AACZ,aAAO,QAAQ,SAAU,OAAO;AAC9B,eAAO,MAAM,OAAO,KAAK;AAAA,MAC3B,CAAC;AACD,aAAO;AAAA,IACT;AAIA,IAAAA,YAAW,UAAU,UAAU,WAAY;AACzC,UAAI,QAAQ,CAAA;AACZ,UAAI,cAAc,KAAK;AACvB,aAAO,aAAa;AAClB,cAAM,KAAK,WAAW;AACtB,sBAAc,YAAY;AAAA,MAC5B;AACA,aAAO;AAAA,IACT;AAIA,IAAAA,YAAW,UAAU,UAAU,WAAY;AACzC,UAAI,cAAc,KAAK;AACvB,UAAI,WAAW;AACf,UAAI,WAAW;AACf,aAAO,aAAa;AAElB,mBAAW,YAAY;AAEvB,oBAAY,OAAO;AAEnB,mBAAW;AACX,sBAAc;AAAA,MAChB;AACA,WAAK,OAAO,KAAK;AACjB,WAAK,OAAO;AAAA,IACd;AACA,IAAAA,YAAW,UAAU,WAAW,SAAU,UAAU;AAClD,UAAI,aAAa,QAAQ;AACvB,mBAAW;AAAA,MACb;AACA,aAAO,KAAK,QAAO,EAAG,IAAI,SAAU,MAAM;AACxC,eAAO,KAAK,SAAS,QAAQ;AAAA,MAC/B,CAAC,EAAE,SAAQ;AAAA,IACb;AACA,WAAOA;AAAA,EACT,GAAC;AAAA;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/structs/linked-list.js

@@ -0,0 +1,170 @@
+var defaultComparator = function defaultComparator2(a, b) {
+  if (a === b) {
+    return true;
+  }
+  return false;
+};
+var LinkedListNode = (
+  /** @class */
+  (function() {
+    function LinkedListNode2(value, next) {
+      if (next === void 0) {
+        next = null;
+      }
+      this.value = value;
+      this.next = next;
+    }
+    LinkedListNode2.prototype.toString = function(callback) {
+      return callback ? callback(this.value) : "".concat(this.value);
+    };
+    return LinkedListNode2;
+  })()
+);
+var LinkedList = (
+  /** @class */
+  (function() {
+    function LinkedList2(comparator) {
+      if (comparator === void 0) {
+        comparator = defaultComparator;
+      }
+      this.head = null;
+      this.tail = null;
+      this.compare = comparator;
+    }
+    LinkedList2.prototype.prepend = function(value) {
+      var newNode = new LinkedListNode(value, this.head);
+      this.head = newNode;
+      if (!this.tail) {
+        this.tail = newNode;
+      }
+      return this;
+    };
+    LinkedList2.prototype.append = function(value) {
+      var newNode = new LinkedListNode(value);
+      if (!this.head) {
+        this.head = newNode;
+        this.tail = newNode;
+        return this;
+      }
+      this.tail.next = newNode;
+      this.tail = newNode;
+      return this;
+    };
+    LinkedList2.prototype.delete = function(value) {
+      if (!this.head) {
+        return null;
+      }
+      var deleteNode = null;
+      while (this.head && this.compare(this.head.value, value)) {
+        deleteNode = this.head;
+        this.head = this.head.next;
+      }
+      var currentNode = this.head;
+      if (currentNode !== null) {
+        while (currentNode.next) {
+          if (this.compare(currentNode.next.value, value)) {
+            deleteNode = currentNode.next;
+            currentNode.next = currentNode.next.next;
+          } else {
+            currentNode = currentNode.next;
+          }
+        }
+      }
+      if (this.compare(this.tail.value, value)) {
+        this.tail = currentNode;
+      }
+      return deleteNode;
+    };
+    LinkedList2.prototype.find = function(_a) {
+      var _b = _a.value, value = _b === void 0 ? void 0 : _b, _c = _a.callback, callback = _c === void 0 ? void 0 : _c;
+      if (!this.head) {
+        return null;
+      }
+      var currentNode = this.head;
+      while (currentNode) {
+        if (callback && callback(currentNode.value)) {
+          return currentNode;
+        }
+        if (value !== void 0 && this.compare(currentNode.value, value)) {
+          return currentNode;
+        }
+        currentNode = currentNode.next;
+      }
+      return null;
+    };
+    LinkedList2.prototype.deleteTail = function() {
+      var deletedTail = this.tail;
+      if (this.head === this.tail) {
+        this.head = null;
+        this.tail = null;
+        return deletedTail;
+      }
+      var currentNode = this.head;
+      while (currentNode.next) {
+        if (!currentNode.next.next) {
+          currentNode.next = null;
+        } else {
+          currentNode = currentNode.next;
+        }
+      }
+      this.tail = currentNode;
+      return deletedTail;
+    };
+    LinkedList2.prototype.deleteHead = function() {
+      if (!this.head) {
+        return null;
+      }
+      var deletedHead = this.head;
+      if (this.head.next) {
+        this.head = this.head.next;
+      } else {
+        this.head = null;
+        this.tail = null;
+      }
+      return deletedHead;
+    };
+    LinkedList2.prototype.fromArray = function(values) {
+      var _this = this;
+      values.forEach(function(value) {
+        return _this.append(value);
+      });
+      return this;
+    };
+    LinkedList2.prototype.toArray = function() {
+      var nodes = [];
+      var currentNode = this.head;
+      while (currentNode) {
+        nodes.push(currentNode);
+        currentNode = currentNode.next;
+      }
+      return nodes;
+    };
+    LinkedList2.prototype.reverse = function() {
+      var currentNode = this.head;
+      var prevNode = null;
+      var nextNode = null;
+      while (currentNode) {
+        nextNode = currentNode.next;
+        currentNode.next = prevNode;
+        prevNode = currentNode;
+        currentNode = nextNode;
+      }
+      this.tail = this.head;
+      this.head = prevNode;
+    };
+    LinkedList2.prototype.toString = function(callback) {
+      if (callback === void 0) {
+        callback = void 0;
+      }
+      return this.toArray().map(function(node) {
+        return node.toString(callback);
+      }).toString();
+    };
+    return LinkedList2;
+  })()
+);
+export {
+  LinkedListNode,
+  LinkedList as default
+};
+//# sourceMappingURL=linked-list.js.map

package/dist/node_modules/.pnpm/@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/structs/linked-list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"linked-list.js","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+algorithm@0.1.26/node_modules/@antv/algorithm/es/structs/linked-list.js"],"sourcesContent":["var defaultComparator = function defaultComparator(a, b) {\n  if (a === b) {\n    return true;\n  }\n  return false;\n};\n/**\n * 链表中单个元素节点\n */\nvar LinkedListNode = /** @class */function () {\n  function LinkedListNode(value, next) {\n    if (next === void 0) {\n      next = null;\n    }\n    this.value = value;\n    this.next = next;\n  }\n  LinkedListNode.prototype.toString = function (callback) {\n    return callback ? callback(this.value) : \"\".concat(this.value);\n  };\n  return LinkedListNode;\n}();\nexport { LinkedListNode };\nvar LinkedList = /** @class */function () {\n  function LinkedList(comparator) {\n    if (comparator === void 0) {\n      comparator = defaultComparator;\n    }\n    this.head = null;\n    this.tail = null;\n    this.compare = comparator;\n  }\n  /**\n   * 将指定元素添加到链表头部\n   * @param value\n   */\n  LinkedList.prototype.prepend = function (value) {\n    // 在头部添加一个节点\n    var newNode = new LinkedListNode(value, this.head);\n    this.head = newNode;\n    if (!this.tail) {\n      this.tail = newNode;\n    }\n    return this;\n  };\n  /**\n   * 将指定元素添加到链表中\n   * @param value\n   */\n  LinkedList.prototype.append = function (value) {\n    var newNode = new LinkedListNode(value);\n    // 如果不存在头节点，则将创建的新节点作为头节点\n    if (!this.head) {\n      this.head = newNode;\n      this.tail = newNode;\n      return this;\n    }\n    // 将新节点附加到链表末尾\n    this.tail.next = newNode;\n    this.tail = newNode;\n    return this;\n  };\n  /**\n   * 删除指定元素\n   * @param value 要删除的元素\n   */\n  LinkedList.prototype.delete = function (value) {\n    if (!this.head) {\n      return null;\n    }\n    var deleteNode = null;\n    // 如果删除的是头部元素，则将next作为头元素\n    while (this.head && this.compare(this.head.value, value)) {\n      deleteNode = this.head;\n      this.head = this.head.next;\n    }\n    var currentNode = this.head;\n    if (currentNode !== null) {\n      // 如果删除了节点以后，将next节点前移\n      while (currentNode.next) {\n        if (this.compare(currentNode.next.value, value)) {\n          deleteNode = currentNode.next;\n          currentNode.next = currentNode.next.next;\n        } else {\n          currentNode = currentNode.next;\n        }\n      }\n    }\n    // 检查尾部节点是否被删除\n    if (this.compare(this.tail.value, value)) {\n      this.tail = currentNode;\n    }\n    return deleteNode;\n  };\n  /**\n   * 查找指定的元素\n   * @param param0\n   */\n  LinkedList.prototype.find = function (_a) {\n    var _b = _a.value,\n      value = _b === void 0 ? undefined : _b,\n      _c = _a.callback,\n      callback = _c === void 0 ? undefined : _c;\n    if (!this.head) {\n      return null;\n    }\n    var currentNode = this.head;\n    while (currentNode) {\n      // 如果指定了 callback，则按指定的 callback 查找\n      if (callback && callback(currentNode.value)) {\n        return currentNode;\n      }\n      // 如果指定了 value，则按 value 查找\n      if (value !== undefined && this.compare(currentNode.value, value)) {\n        return currentNode;\n      }\n      currentNode = currentNode.next;\n    }\n    return null;\n  };\n  /**\n   * 删除尾部节点\n   */\n  LinkedList.prototype.deleteTail = function () {\n    var deletedTail = this.tail;\n    if (this.head === this.tail) {\n      // 链表中只有一个元素\n      this.head = null;\n      this.tail = null;\n      return deletedTail;\n    }\n    var currentNode = this.head;\n    while (currentNode.next) {\n      if (!currentNode.next.next) {\n        currentNode.next = null;\n      } else {\n        currentNode = currentNode.next;\n      }\n    }\n    this.tail = currentNode;\n    return deletedTail;\n  };\n  /**\n   * 删除头部节点\n   */\n  LinkedList.prototype.deleteHead = function () {\n    if (!this.head) {\n      return null;\n    }\n    var deletedHead = this.head;\n    if (this.head.next) {\n      this.head = this.head.next;\n    } else {\n      this.head = null;\n      this.tail = null;\n    }\n    return deletedHead;\n  };\n  /**\n   * 将一组元素转成链表中的节点\n   * @param values 链表中的元素\n   */\n  LinkedList.prototype.fromArray = function (values) {\n    var _this = this;\n    values.forEach(function (value) {\n      return _this.append(value);\n    });\n    return this;\n  };\n  /**\n   * 将链表中的节点转成数组元素\n   */\n  LinkedList.prototype.toArray = function () {\n    var nodes = [];\n    var currentNode = this.head;\n    while (currentNode) {\n      nodes.push(currentNode);\n      currentNode = currentNode.next;\n    }\n    return nodes;\n  };\n  /**\n   * 反转链表中的元素节点\n   */\n  LinkedList.prototype.reverse = function () {\n    var currentNode = this.head;\n    var prevNode = null;\n    var nextNode = null;\n    while (currentNode) {\n      // 存储下一个元素节点\n      nextNode = currentNode.next;\n      // 更改当前节点的下一个节点，以便将它连接到上一个节点上\n      currentNode.next = prevNode;\n      // 将 prevNode 和 currentNode 向前移动一步\n      prevNode = currentNode;\n      currentNode = nextNode;\n    }\n    this.tail = this.head;\n    this.head = prevNode;\n  };\n  LinkedList.prototype.toString = function (callback) {\n    if (callback === void 0) {\n      callback = undefined;\n    }\n    return this.toArray().map(function (node) {\n      return node.toString(callback);\n    }).toString();\n  };\n  return LinkedList;\n}();\nexport default LinkedList;"],"names":["defaultComparator","LinkedListNode","LinkedList"],"mappings":"AAAA,IAAI,oBAAoB,SAASA,mBAAkB,GAAG,GAAG;AACvD,MAAI,MAAM,GAAG;AACX,WAAO;AAAA,EACT;AACA,SAAO;AACT;AAIG,IAAC;AAAA;AAAA,GAA8B,WAAY;AAC5C,aAASC,gBAAe,OAAO,MAAM;AACnC,UAAI,SAAS,QAAQ;AACnB,eAAO;AAAA,MACT;AACA,WAAK,QAAQ;AACb,WAAK,OAAO;AAAA,IACd;AACA,IAAAA,gBAAe,UAAU,WAAW,SAAU,UAAU;AACtD,aAAO,WAAW,SAAS,KAAK,KAAK,IAAI,GAAG,OAAO,KAAK,KAAK;AAAA,IAC/D;AACA,WAAOA;AAAA,EACT,GAAC;AAAA;AAEE,IAAC;AAAA;AAAA,GAA0B,WAAY;AACxC,aAASC,YAAW,YAAY;AAC9B,UAAI,eAAe,QAAQ;AACzB,qBAAa;AAAA,MACf;AACA,WAAK,OAAO;AACZ,WAAK,OAAO;AACZ,WAAK,UAAU;AAAA,IACjB;AAKA,IAAAA,YAAW,UAAU,UAAU,SAAU,OAAO;AAE9C,UAAI,UAAU,IAAI,eAAe,OAAO,KAAK,IAAI;AACjD,WAAK,OAAO;AACZ,UAAI,CAAC,KAAK,MAAM;AACd,aAAK,OAAO;AAAA,MACd;AACA,aAAO;AAAA,IACT;AAKA,IAAAA,YAAW,UAAU,SAAS,SAAU,OAAO;AAC7C,UAAI,UAAU,IAAI,eAAe,KAAK;AAEtC,UAAI,CAAC,KAAK,MAAM;AACd,aAAK,OAAO;AACZ,aAAK,OAAO;AACZ,eAAO;AAAA,MACT;AAEA,WAAK,KAAK,OAAO;AACjB,WAAK,OAAO;AACZ,aAAO;AAAA,IACT;AAKA,IAAAA,YAAW,UAAU,SAAS,SAAU,OAAO;AAC7C,UAAI,CAAC,KAAK,MAAM;AACd,eAAO;AAAA,MACT;AACA,UAAI,aAAa;AAEjB,aAAO,KAAK,QAAQ,KAAK,QAAQ,KAAK,KAAK,OAAO,KAAK,GAAG;AACxD,qBAAa,KAAK;AAClB,aAAK,OAAO,KAAK,KAAK;AAAA,MACxB;AACA,UAAI,cAAc,KAAK;AACvB,UAAI,gBAAgB,MAAM;AAExB,eAAO,YAAY,MAAM;AACvB,cAAI,KAAK,QAAQ,YAAY,KAAK,OAAO,KAAK,GAAG;AAC/C,yBAAa,YAAY;AACzB,wBAAY,OAAO,YAAY,KAAK;AAAA,UACtC,OAAO;AACL,0BAAc,YAAY;AAAA,UAC5B;AAAA,QACF;AAAA,MACF;AAEA,UAAI,KAAK,QAAQ,KAAK,KAAK,OAAO,KAAK,GAAG;AACxC,aAAK,OAAO;AAAA,MACd;AACA,aAAO;AAAA,IACT;AAKA,IAAAA,YAAW,UAAU,OAAO,SAAU,IAAI;AACxC,UAAI,KAAK,GAAG,OACV,QAAQ,OAAO,SAAS,SAAY,IACpC,KAAK,GAAG,UACR,WAAW,OAAO,SAAS,SAAY;AACzC,UAAI,CAAC,KAAK,MAAM;AACd,eAAO;AAAA,MACT;AACA,UAAI,cAAc,KAAK;AACvB,aAAO,aAAa;AAElB,YAAI,YAAY,SAAS,YAAY,KAAK,GAAG;AAC3C,iBAAO;AAAA,QACT;AAEA,YAAI,UAAU,UAAa,KAAK,QAAQ,YAAY,OAAO,KAAK,GAAG;AACjE,iBAAO;AAAA,QACT;AACA,sBAAc,YAAY;AAAA,MAC5B;AACA,aAAO;AAAA,IACT;AAIA,IAAAA,YAAW,UAAU,aAAa,WAAY;AAC5C,UAAI,cAAc,KAAK;AACvB,UAAI,KAAK,SAAS,KAAK,MAAM;AAE3B,aAAK,OAAO;AACZ,aAAK,OAAO;AACZ,eAAO;AAAA,MACT;AACA,UAAI,cAAc,KAAK;AACvB,aAAO,YAAY,MAAM;AACvB,YAAI,CAAC,YAAY,KAAK,MAAM;AAC1B,sBAAY,OAAO;AAAA,QACrB,OAAO;AACL,wBAAc,YAAY;AAAA,QAC5B;AAAA,MACF;AACA,WAAK,OAAO;AACZ,aAAO;AAAA,IACT;AAIA,IAAAA,YAAW,UAAU,aAAa,WAAY;AAC5C,UAAI,CAAC,KAAK,MAAM;AACd,eAAO;AAAA,MACT;AACA,UAAI,cAAc,KAAK;AACvB,UAAI,KAAK,KAAK,MAAM;AAClB,aAAK,OAAO,KAAK,KAAK;AAAA,MACxB,OAAO;AACL,aAAK,OAAO;AACZ,aAAK,OAAO;AAAA,MACd;AACA,aAAO;AAAA,IACT;AAKA,IAAAA,YAAW,UAAU,YAAY,SAAU,QAAQ;AACjD,UAAI,QAAQ;AACZ,aAAO,QAAQ,SAAU,OAAO;AAC9B,eAAO,MAAM,OAAO,KAAK;AAAA,MAC3B,CAAC;AACD,aAAO;AAAA,IACT;AAIA,IAAAA,YAAW,UAAU,UAAU,WAAY;AACzC,UAAI,QAAQ,CAAA;AACZ,UAAI,cAAc,KAAK;AACvB,aAAO,aAAa;AAClB,cAAM,KAAK,WAAW;AACtB,sBAAc,YAAY;AAAA,MAC5B;AACA,aAAO;AAAA,IACT;AAIA,IAAAA,YAAW,UAAU,UAAU,WAAY;AACzC,UAAI,cAAc,KAAK;AACvB,UAAI,WAAW;AACf,UAAI,WAAW;AACf,aAAO,aAAa;AAElB,mBAAW,YAAY;AAEvB,oBAAY,OAAO;AAEnB,mBAAW;AACX,sBAAc;AAAA,MAChB;AACA,WAAK,OAAO,KAAK;AACjB,WAAK,OAAO;AAAA,IACd;AACA,IAAAA,YAAW,UAAU,WAAW,SAAU,UAAU;AAClD,UAAI,aAAa,QAAQ;AACvB,mBAAW;AAAA,MACb;AACA,aAAO,KAAK,QAAO,EAAG,IAAI,SAAU,MAAM;AACxC,eAAO,KAAK,SAAS,QAAQ;AAAA,MAC/B,CAAC,EAAE,SAAQ;AAAA,IACb;AACA,WAAOA;AAAA,EACT,GAAC;AAAA;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/structs/stack.cjs

@@ -0,0 +1,52 @@
+"use strict";
+const linkedList = require("./linked-list.cjs");
+(function() {
+  function Stack(maxStep) {
+    if (maxStep === void 0) {
+      maxStep = 10;
+    }
+    this.linkedList = new linkedList.default();
+    this.maxStep = maxStep;
+  }
+  Object.defineProperty(Stack.prototype, "length", {
+    get: function get() {
+      return this.linkedList.toArray().length;
+    },
+    enumerable: false,
+    configurable: true
+  });
+  Stack.prototype.isEmpty = function() {
+    return !this.linkedList.head;
+  };
+  Stack.prototype.isMaxStack = function() {
+    return this.toArray().length >= this.maxStep;
+  };
+  Stack.prototype.peek = function() {
+    if (this.isEmpty()) {
+      return null;
+    }
+    return this.linkedList.head.value;
+  };
+  Stack.prototype.push = function(value) {
+    this.linkedList.prepend(value);
+    if (this.length > this.maxStep) {
+      this.linkedList.deleteTail();
+    }
+  };
+  Stack.prototype.pop = function() {
+    var removeHead = this.linkedList.deleteHead();
+    return removeHead ? removeHead.value : null;
+  };
+  Stack.prototype.toArray = function() {
+    return this.linkedList.toArray().map(function(node) {
+      return node.value;
+    });
+  };
+  Stack.prototype.clear = function() {
+    while (!this.isEmpty()) {
+      this.pop();
+    }
+  };
+  return Stack;
+})();
+//# sourceMappingURL=stack.cjs.map

package/dist/node_modules/.pnpm/@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/structs/stack.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"stack.cjs","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+algorithm@0.1.26/node_modules/@antv/algorithm/es/structs/stack.js"],"sourcesContent":["import LinkedList from './linked-list';\nvar Stack = /** @class */function () {\n  function Stack(maxStep) {\n    if (maxStep === void 0) {\n      maxStep = 10;\n    }\n    this.linkedList = new LinkedList();\n    this.maxStep = maxStep;\n  }\n  Object.defineProperty(Stack.prototype, \"length\", {\n    get: function get() {\n      return this.linkedList.toArray().length;\n    },\n    enumerable: false,\n    configurable: true\n  });\n  /**\n   * 判断栈是否为空，如果链表中没有头部元素，则栈为空\n   */\n  Stack.prototype.isEmpty = function () {\n    return !this.linkedList.head;\n  };\n  /**\n   * 是否到定义的栈的最大长度，如果达到最大长度后，不再允许入栈\n   */\n  Stack.prototype.isMaxStack = function () {\n    return this.toArray().length >= this.maxStep;\n  };\n  /**\n   * 访问顶端元素\n   */\n  Stack.prototype.peek = function () {\n    if (this.isEmpty()) {\n      return null;\n    }\n    // 返回头部元素，不删除元素\n    return this.linkedList.head.value;\n  };\n  Stack.prototype.push = function (value) {\n    this.linkedList.prepend(value);\n    if (this.length > this.maxStep) {\n      this.linkedList.deleteTail();\n    }\n  };\n  Stack.prototype.pop = function () {\n    var removeHead = this.linkedList.deleteHead();\n    return removeHead ? removeHead.value : null;\n  };\n  Stack.prototype.toArray = function () {\n    return this.linkedList.toArray().map(function (node) {\n      return node.value;\n    });\n  };\n  Stack.prototype.clear = function () {\n    while (!this.isEmpty()) {\n      this.pop();\n    }\n  };\n  return Stack;\n}();\nexport default Stack;"],"names":["LinkedList"],"mappings":";;CACyB,WAAY;AACnC,WAAS,MAAM,SAAS;AACtB,QAAI,YAAY,QAAQ;AACtB,gBAAU;AAAA,IACZ;AACA,SAAK,aAAa,IAAIA,mBAAU;AAChC,SAAK,UAAU;AAAA,EACjB;AACA,SAAO,eAAe,MAAM,WAAW,UAAU;AAAA,IAC/C,KAAK,SAAS,MAAM;AAClB,aAAO,KAAK,WAAW,QAAO,EAAG;AAAA,IACnC;AAAA,IACA,YAAY;AAAA,IACZ,cAAc;AAAA,EAClB,CAAG;AAID,QAAM,UAAU,UAAU,WAAY;AACpC,WAAO,CAAC,KAAK,WAAW;AAAA,EAC1B;AAIA,QAAM,UAAU,aAAa,WAAY;AACvC,WAAO,KAAK,QAAO,EAAG,UAAU,KAAK;AAAA,EACvC;AAIA,QAAM,UAAU,OAAO,WAAY;AACjC,QAAI,KAAK,WAAW;AAClB,aAAO;AAAA,IACT;AAEA,WAAO,KAAK,WAAW,KAAK;AAAA,EAC9B;AACA,QAAM,UAAU,OAAO,SAAU,OAAO;AACtC,SAAK,WAAW,QAAQ,KAAK;AAC7B,QAAI,KAAK,SAAS,KAAK,SAAS;AAC9B,WAAK,WAAW,WAAU;AAAA,IAC5B;AAAA,EACF;AACA,QAAM,UAAU,MAAM,WAAY;AAChC,QAAI,aAAa,KAAK,WAAW,WAAU;AAC3C,WAAO,aAAa,WAAW,QAAQ;AAAA,EACzC;AACA,QAAM,UAAU,UAAU,WAAY;AACpC,WAAO,KAAK,WAAW,QAAO,EAAG,IAAI,SAAU,MAAM;AACnD,aAAO,KAAK;AAAA,IACd,CAAC;AAAA,EACH;AACA,QAAM,UAAU,QAAQ,WAAY;AAClC,WAAO,CAAC,KAAK,WAAW;AACtB,WAAK,IAAG;AAAA,IACV;AAAA,EACF;AACA,SAAO;AACT,GAAC;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/structs/stack.js

@@ -0,0 +1,51 @@
+import LinkedList from "./linked-list.js";
+(function() {
+  function Stack(maxStep) {
+    if (maxStep === void 0) {
+      maxStep = 10;
+    }
+    this.linkedList = new LinkedList();
+    this.maxStep = maxStep;
+  }
+  Object.defineProperty(Stack.prototype, "length", {
+    get: function get() {
+      return this.linkedList.toArray().length;
+    },
+    enumerable: false,
+    configurable: true
+  });
+  Stack.prototype.isEmpty = function() {
+    return !this.linkedList.head;
+  };
+  Stack.prototype.isMaxStack = function() {
+    return this.toArray().length >= this.maxStep;
+  };
+  Stack.prototype.peek = function() {
+    if (this.isEmpty()) {
+      return null;
+    }
+    return this.linkedList.head.value;
+  };
+  Stack.prototype.push = function(value) {
+    this.linkedList.prepend(value);
+    if (this.length > this.maxStep) {
+      this.linkedList.deleteTail();
+    }
+  };
+  Stack.prototype.pop = function() {
+    var removeHead = this.linkedList.deleteHead();
+    return removeHead ? removeHead.value : null;
+  };
+  Stack.prototype.toArray = function() {
+    return this.linkedList.toArray().map(function(node) {
+      return node.value;
+    });
+  };
+  Stack.prototype.clear = function() {
+    while (!this.isEmpty()) {
+      this.pop();
+    }
+  };
+  return Stack;
+})();
+//# sourceMappingURL=stack.js.map

package/dist/node_modules/.pnpm/@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/structs/stack.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"stack.js","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+algorithm@0.1.26/node_modules/@antv/algorithm/es/structs/stack.js"],"sourcesContent":["import LinkedList from './linked-list';\nvar Stack = /** @class */function () {\n  function Stack(maxStep) {\n    if (maxStep === void 0) {\n      maxStep = 10;\n    }\n    this.linkedList = new LinkedList();\n    this.maxStep = maxStep;\n  }\n  Object.defineProperty(Stack.prototype, \"length\", {\n    get: function get() {\n      return this.linkedList.toArray().length;\n    },\n    enumerable: false,\n    configurable: true\n  });\n  /**\n   * 判断栈是否为空，如果链表中没有头部元素，则栈为空\n   */\n  Stack.prototype.isEmpty = function () {\n    return !this.linkedList.head;\n  };\n  /**\n   * 是否到定义的栈的最大长度，如果达到最大长度后，不再允许入栈\n   */\n  Stack.prototype.isMaxStack = function () {\n    return this.toArray().length >= this.maxStep;\n  };\n  /**\n   * 访问顶端元素\n   */\n  Stack.prototype.peek = function () {\n    if (this.isEmpty()) {\n      return null;\n    }\n    // 返回头部元素，不删除元素\n    return this.linkedList.head.value;\n  };\n  Stack.prototype.push = function (value) {\n    this.linkedList.prepend(value);\n    if (this.length > this.maxStep) {\n      this.linkedList.deleteTail();\n    }\n  };\n  Stack.prototype.pop = function () {\n    var removeHead = this.linkedList.deleteHead();\n    return removeHead ? removeHead.value : null;\n  };\n  Stack.prototype.toArray = function () {\n    return this.linkedList.toArray().map(function (node) {\n      return node.value;\n    });\n  };\n  Stack.prototype.clear = function () {\n    while (!this.isEmpty()) {\n      this.pop();\n    }\n  };\n  return Stack;\n}();\nexport default Stack;"],"names":[],"mappings":";CACyB,WAAY;AACnC,WAAS,MAAM,SAAS;AACtB,QAAI,YAAY,QAAQ;AACtB,gBAAU;AAAA,IACZ;AACA,SAAK,aAAa,IAAI,WAAU;AAChC,SAAK,UAAU;AAAA,EACjB;AACA,SAAO,eAAe,MAAM,WAAW,UAAU;AAAA,IAC/C,KAAK,SAAS,MAAM;AAClB,aAAO,KAAK,WAAW,QAAO,EAAG;AAAA,IACnC;AAAA,IACA,YAAY;AAAA,IACZ,cAAc;AAAA,EAClB,CAAG;AAID,QAAM,UAAU,UAAU,WAAY;AACpC,WAAO,CAAC,KAAK,WAAW;AAAA,EAC1B;AAIA,QAAM,UAAU,aAAa,WAAY;AACvC,WAAO,KAAK,QAAO,EAAG,UAAU,KAAK;AAAA,EACvC;AAIA,QAAM,UAAU,OAAO,WAAY;AACjC,QAAI,KAAK,WAAW;AAClB,aAAO;AAAA,IACT;AAEA,WAAO,KAAK,WAAW,KAAK;AAAA,EAC9B;AACA,QAAM,UAAU,OAAO,SAAU,OAAO;AACtC,SAAK,WAAW,QAAQ,KAAK;AAC7B,QAAI,KAAK,SAAS,KAAK,SAAS;AAC9B,WAAK,WAAW,WAAU;AAAA,IAC5B;AAAA,EACF;AACA,QAAM,UAAU,MAAM,WAAY;AAChC,QAAI,aAAa,KAAK,WAAW,WAAU;AAC3C,WAAO,aAAa,WAAW,QAAQ;AAAA,EACzC;AACA,QAAM,UAAU,UAAU,WAAY;AACpC,WAAO,KAAK,WAAW,QAAO,EAAG,IAAI,SAAU,MAAM;AACnD,aAAO,KAAK;AAAA,IACd,CAAC;AAAA,EACH;AACA,QAAM,UAAU,QAAQ,WAAY;AAClC,WAAO,CAAC,KAAK,WAAW;AACtB,WAAK,IAAG;AAAA,IACV;AAAA,EACF;AACA,SAAO;AACT,GAAC;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/types.cjs

@@ -0,0 +1,7 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+exports.DistanceType = void 0;
+(function(DistanceType) {
+  DistanceType["EuclideanDistance"] = "euclideanDistance";
+})(exports.DistanceType || (exports.DistanceType = {}));
+//# sourceMappingURL=types.cjs.map

package/dist/node_modules/.pnpm/@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/types.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.cjs","sources":["../../../../../../../../../node_modules/.pnpm/@antv+algorithm@0.1.26/node_modules/@antv/algorithm/es/types.js"],"sourcesContent":["export var DistanceType;\n(function (DistanceType) {\n  DistanceType[\"EuclideanDistance\"] = \"euclideanDistance\";\n})(DistanceType || (DistanceType = {}));"],"names":["DistanceType"],"mappings":";;AAAWA,QAAAA,eAAAA;AAAAA,CACV,SAAU,cAAc;AACvB,eAAa,mBAAmB,IAAI;AACtC,GAAGA,QAAAA,iBAAiBA,uBAAe,CAAA,EAAG;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/types.js

@@ -0,0 +1,8 @@
+var DistanceType;
+(function(DistanceType2) {
+  DistanceType2["EuclideanDistance"] = "euclideanDistance";
+})(DistanceType || (DistanceType = {}));
+export {
+  DistanceType
+};
+//# sourceMappingURL=types.js.map

package/dist/node_modules/.pnpm/@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/types.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"types.js","sources":["../../../../../../../../../node_modules/.pnpm/@antv+algorithm@0.1.26/node_modules/@antv/algorithm/es/types.js"],"sourcesContent":["export var DistanceType;\n(function (DistanceType) {\n  DistanceType[\"EuclideanDistance\"] = \"euclideanDistance\";\n})(DistanceType || (DistanceType = {}));"],"names":["DistanceType"],"mappings":"AAAU,IAAC;AAAA,CACV,SAAUA,eAAc;AACvB,EAAAA,cAAa,mBAAmB,IAAI;AACtC,GAAG,iBAAiB,eAAe,CAAA,EAAG;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/util.cjs

@@ -0,0 +1,44 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+var getNeighbors = function getNeighbors2(nodeId, edges, type) {
+  if (edges === void 0) {
+    edges = [];
+  }
+  var currentEdges = edges.filter(function(edge) {
+    return edge.source === nodeId || edge.target === nodeId;
+  });
+  if (type === "target") {
+    var neighhborsConverter_1 = function neighhborsConverter_12(edge) {
+      return edge.source === nodeId;
+    };
+    return currentEdges.filter(neighhborsConverter_1).map(function(edge) {
+      return edge.target;
+    });
+  }
+  if (type === "source") {
+    var neighhborsConverter_2 = function neighhborsConverter_22(edge) {
+      return edge.target === nodeId;
+    };
+    return currentEdges.filter(neighhborsConverter_2).map(function(edge) {
+      return edge.source;
+    });
+  }
+  var neighhborsConverter = function neighhborsConverter2(edge) {
+    return edge.source === nodeId ? edge.target : edge.source;
+  };
+  return currentEdges.map(neighhborsConverter);
+};
+var getOutEdgesNodeId = function getOutEdgesNodeId2(nodeId, edges) {
+  return edges.filter(function(edge) {
+    return edge.source === nodeId;
+  });
+};
+var getEdgesByNodeId = function getEdgesByNodeId2(nodeId, edges) {
+  return edges.filter(function(edge) {
+    return edge.source === nodeId || edge.target === nodeId;
+  });
+};
+exports.getEdgesByNodeId = getEdgesByNodeId;
+exports.getNeighbors = getNeighbors;
+exports.getOutEdgesNodeId = getOutEdgesNodeId;
+//# sourceMappingURL=util.cjs.map

package/dist/node_modules/.pnpm/@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/util.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"util.cjs","sources":["../../../../../../../../../node_modules/.pnpm/@antv+algorithm@0.1.26/node_modules/@antv/algorithm/es/util.js"],"sourcesContent":["/**\n * 获取指定节点的所有邻居\n * @param nodeId 节点 ID\n * @param edges 图中的所有边数据\n * @param type 邻居类型\n */\nexport var getNeighbors = function getNeighbors(nodeId, edges, type) {\n  if (edges === void 0) {\n    edges = [];\n  }\n  var currentEdges = edges.filter(function (edge) {\n    return edge.source === nodeId || edge.target === nodeId;\n  });\n  if (type === 'target') {\n    // 当前节点为 source，它所指向的目标节点\n    var neighhborsConverter_1 = function neighhborsConverter_1(edge) {\n      return edge.source === nodeId;\n    };\n    return currentEdges.filter(neighhborsConverter_1).map(function (edge) {\n      return edge.target;\n    });\n  }\n  if (type === 'source') {\n    // 当前节点为 target，它所指向的源节点\n    var neighhborsConverter_2 = function neighhborsConverter_2(edge) {\n      return edge.target === nodeId;\n    };\n    return currentEdges.filter(neighhborsConverter_2).map(function (edge) {\n      return edge.source;\n    });\n  }\n  // 若未指定 type ，则返回所有邻居\n  var neighhborsConverter = function neighhborsConverter(edge) {\n    return edge.source === nodeId ? edge.target : edge.source;\n  };\n  return currentEdges.map(neighhborsConverter);\n};\n/**\n * 获取指定节点的出边\n * @param nodeId 节点 ID\n * @param edges 图中的所有边数据\n */\nexport var getOutEdgesNodeId = function getOutEdgesNodeId(nodeId, edges) {\n  return edges.filter(function (edge) {\n    return edge.source === nodeId;\n  });\n};\n/**\n * 获取指定节点的边，包括出边和入边\n * @param nodeId 节点 ID\n * @param edges 图中的所有边数据\n */\nexport var getEdgesByNodeId = function getEdgesByNodeId(nodeId, edges) {\n  return edges.filter(function (edge) {\n    return edge.source === nodeId || edge.target === nodeId;\n  });\n};\n/**\n * 生成唯一的 ID，规则是序号 + 时间戳\n * @param index 序号\n */\nexport var uniqueId = function uniqueId(index) {\n  if (index === void 0) {\n    index = 0;\n  }\n  var random1 = \"\".concat(Math.random()).split('.')[1].substr(0, 5);\n  var random2 = \"\".concat(Math.random()).split('.')[1].substr(0, 5);\n  return \"\".concat(index, \"-\").concat(random1).concat(random2);\n};"],"names":["getNeighbors","neighhborsConverter_1","neighhborsConverter_2","neighhborsConverter","getOutEdgesNodeId","getEdgesByNodeId"],"mappings":";;AAMU,IAAC,eAAe,SAASA,cAAa,QAAQ,OAAO,MAAM;AACnE,MAAI,UAAU,QAAQ;AACpB,YAAQ,CAAA;AAAA,EACV;AACA,MAAI,eAAe,MAAM,OAAO,SAAU,MAAM;AAC9C,WAAO,KAAK,WAAW,UAAU,KAAK,WAAW;AAAA,EACnD,CAAC;AACD,MAAI,SAAS,UAAU;AAErB,QAAI,wBAAwB,SAASC,uBAAsB,MAAM;AAC/D,aAAO,KAAK,WAAW;AAAA,IACzB;AACA,WAAO,aAAa,OAAO,qBAAqB,EAAE,IAAI,SAAU,MAAM;AACpE,aAAO,KAAK;AAAA,IACd,CAAC;AAAA,EACH;AACA,MAAI,SAAS,UAAU;AAErB,QAAI,wBAAwB,SAASC,uBAAsB,MAAM;AAC/D,aAAO,KAAK,WAAW;AAAA,IACzB;AACA,WAAO,aAAa,OAAO,qBAAqB,EAAE,IAAI,SAAU,MAAM;AACpE,aAAO,KAAK;AAAA,IACd,CAAC;AAAA,EACH;AAEA,MAAI,sBAAsB,SAASC,qBAAoB,MAAM;AAC3D,WAAO,KAAK,WAAW,SAAS,KAAK,SAAS,KAAK;AAAA,EACrD;AACA,SAAO,aAAa,IAAI,mBAAmB;AAC7C;AAMU,IAAC,oBAAoB,SAASC,mBAAkB,QAAQ,OAAO;AACvE,SAAO,MAAM,OAAO,SAAU,MAAM;AAClC,WAAO,KAAK,WAAW;AAAA,EACzB,CAAC;AACH;AAMU,IAAC,mBAAmB,SAASC,kBAAiB,QAAQ,OAAO;AACrE,SAAO,MAAM,OAAO,SAAU,MAAM;AAClC,WAAO,KAAK,WAAW,UAAU,KAAK,WAAW;AAAA,EACnD,CAAC;AACH;;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/util.js

@@ -0,0 +1,44 @@
+var getNeighbors = function getNeighbors2(nodeId, edges, type) {
+  if (edges === void 0) {
+    edges = [];
+  }
+  var currentEdges = edges.filter(function(edge) {
+    return edge.source === nodeId || edge.target === nodeId;
+  });
+  if (type === "target") {
+    var neighhborsConverter_1 = function neighhborsConverter_12(edge) {
+      return edge.source === nodeId;
+    };
+    return currentEdges.filter(neighhborsConverter_1).map(function(edge) {
+      return edge.target;
+    });
+  }
+  if (type === "source") {
+    var neighhborsConverter_2 = function neighhborsConverter_22(edge) {
+      return edge.target === nodeId;
+    };
+    return currentEdges.filter(neighhborsConverter_2).map(function(edge) {
+      return edge.source;
+    });
+  }
+  var neighhborsConverter = function neighhborsConverter2(edge) {
+    return edge.source === nodeId ? edge.target : edge.source;
+  };
+  return currentEdges.map(neighhborsConverter);
+};
+var getOutEdgesNodeId = function getOutEdgesNodeId2(nodeId, edges) {
+  return edges.filter(function(edge) {
+    return edge.source === nodeId;
+  });
+};
+var getEdgesByNodeId = function getEdgesByNodeId2(nodeId, edges) {
+  return edges.filter(function(edge) {
+    return edge.source === nodeId || edge.target === nodeId;
+  });
+};
+export {
+  getEdgesByNodeId,
+  getNeighbors,
+  getOutEdgesNodeId
+};
+//# sourceMappingURL=util.js.map

package/dist/node_modules/.pnpm/@antv_algorithm@0.1.26/node_modules/@antv/algorithm/es/util.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"util.js","sources":["../../../../../../../../../node_modules/.pnpm/@antv+algorithm@0.1.26/node_modules/@antv/algorithm/es/util.js"],"sourcesContent":["/**\n * 获取指定节点的所有邻居\n * @param nodeId 节点 ID\n * @param edges 图中的所有边数据\n * @param type 邻居类型\n */\nexport var getNeighbors = function getNeighbors(nodeId, edges, type) {\n  if (edges === void 0) {\n    edges = [];\n  }\n  var currentEdges = edges.filter(function (edge) {\n    return edge.source === nodeId || edge.target === nodeId;\n  });\n  if (type === 'target') {\n    // 当前节点为 source，它所指向的目标节点\n    var neighhborsConverter_1 = function neighhborsConverter_1(edge) {\n      return edge.source === nodeId;\n    };\n    return currentEdges.filter(neighhborsConverter_1).map(function (edge) {\n      return edge.target;\n    });\n  }\n  if (type === 'source') {\n    // 当前节点为 target，它所指向的源节点\n    var neighhborsConverter_2 = function neighhborsConverter_2(edge) {\n      return edge.target === nodeId;\n    };\n    return currentEdges.filter(neighhborsConverter_2).map(function (edge) {\n      return edge.source;\n    });\n  }\n  // 若未指定 type ，则返回所有邻居\n  var neighhborsConverter = function neighhborsConverter(edge) {\n    return edge.source === nodeId ? edge.target : edge.source;\n  };\n  return currentEdges.map(neighhborsConverter);\n};\n/**\n * 获取指定节点的出边\n * @param nodeId 节点 ID\n * @param edges 图中的所有边数据\n */\nexport var getOutEdgesNodeId = function getOutEdgesNodeId(nodeId, edges) {\n  return edges.filter(function (edge) {\n    return edge.source === nodeId;\n  });\n};\n/**\n * 获取指定节点的边，包括出边和入边\n * @param nodeId 节点 ID\n * @param edges 图中的所有边数据\n */\nexport var getEdgesByNodeId = function getEdgesByNodeId(nodeId, edges) {\n  return edges.filter(function (edge) {\n    return edge.source === nodeId || edge.target === nodeId;\n  });\n};\n/**\n * 生成唯一的 ID，规则是序号 + 时间戳\n * @param index 序号\n */\nexport var uniqueId = function uniqueId(index) {\n  if (index === void 0) {\n    index = 0;\n  }\n  var random1 = \"\".concat(Math.random()).split('.')[1].substr(0, 5);\n  var random2 = \"\".concat(Math.random()).split('.')[1].substr(0, 5);\n  return \"\".concat(index, \"-\").concat(random1).concat(random2);\n};"],"names":["getNeighbors","neighhborsConverter_1","neighhborsConverter_2","neighhborsConverter","getOutEdgesNodeId","getEdgesByNodeId"],"mappings":"AAMU,IAAC,eAAe,SAASA,cAAa,QAAQ,OAAO,MAAM;AACnE,MAAI,UAAU,QAAQ;AACpB,YAAQ,CAAA;AAAA,EACV;AACA,MAAI,eAAe,MAAM,OAAO,SAAU,MAAM;AAC9C,WAAO,KAAK,WAAW,UAAU,KAAK,WAAW;AAAA,EACnD,CAAC;AACD,MAAI,SAAS,UAAU;AAErB,QAAI,wBAAwB,SAASC,uBAAsB,MAAM;AAC/D,aAAO,KAAK,WAAW;AAAA,IACzB;AACA,WAAO,aAAa,OAAO,qBAAqB,EAAE,IAAI,SAAU,MAAM;AACpE,aAAO,KAAK;AAAA,IACd,CAAC;AAAA,EACH;AACA,MAAI,SAAS,UAAU;AAErB,QAAI,wBAAwB,SAASC,uBAAsB,MAAM;AAC/D,aAAO,KAAK,WAAW;AAAA,IACzB;AACA,WAAO,aAAa,OAAO,qBAAqB,EAAE,IAAI,SAAU,MAAM;AACpE,aAAO,KAAK;AAAA,IACd,CAAC;AAAA,EACH;AAEA,MAAI,sBAAsB,SAASC,qBAAoB,MAAM;AAC3D,WAAO,KAAK,WAAW,SAAS,KAAK,SAAS,KAAK;AAAA,EACrD;AACA,SAAO,aAAa,IAAI,mBAAmB;AAC7C;AAMU,IAAC,oBAAoB,SAASC,mBAAkB,QAAQ,OAAO;AACvE,SAAO,MAAM,OAAO,SAAU,MAAM;AAClC,WAAO,KAAK,WAAW;AAAA,EACzB,CAAC;AACH;AAMU,IAAC,mBAAmB,SAASC,kBAAiB,QAAQ,OAAO;AACrE,SAAO,MAAM,OAAO,SAAU,MAAM;AAClC,WAAO,KAAK,WAAW,UAAU,KAAK,WAAW;AAAA,EACnD,CAAC;AACH;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_component@2.1.11/node_modules/@antv/component/esm/animation/fadeOut.cjs

@@ -0,0 +1,9 @@
+"use strict";
+const utils = require("./utils.cjs");
+function fadeOut(element, options) {
+  if (!element.style.opacity)
+    element.style.opacity = 1;
+  return utils.transition(element, { opacity: 0 }, options);
+}
+module.exports = fadeOut;
+//# sourceMappingURL=fadeOut.cjs.map

package/dist/node_modules/.pnpm/@antv_component@2.1.11/node_modules/@antv/component/esm/animation/fadeOut.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"fadeOut.cjs","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+component@2.1.11/node_modules/@antv/component/esm/animation/fadeOut.js"],"sourcesContent":["import { transition } from './utils';\nexport default function (element, options) {\n    if (!element.style.opacity)\n        element.style.opacity = 1;\n    return transition(element, { opacity: 0 }, options);\n}\n//# sourceMappingURL=fadeOut.js.map"],"names":["transition"],"mappings":";;AACe,SAAA,QAAU,SAAS,SAAS;AACvC,MAAI,CAAC,QAAQ,MAAM;AACf,YAAQ,MAAM,UAAU;AAC5B,SAAOA,MAAAA,WAAW,SAAS,EAAE,SAAS,EAAC,GAAI,OAAO;AACtD;;","x_google_ignoreList":[0]}