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

package/dist/node_modules/.pnpm/@antv_graphlib@2.0.4/node_modules/@antv/graphlib/esm/graphView.js

@@ -0,0 +1,263 @@
+var __defProp = Object.defineProperty;
+var __defNormalProp = (obj, key, value) => key in obj ? __defProp(obj, key, { enumerable: true, configurable: true, writable: true, value }) : obj[key] = value;
+var __publicField = (obj, key, value) => __defNormalProp(obj, typeof key !== "symbol" ? key + "" : key, value);
+import { doBFS, doDFS } from "./utils/traverse.js";
+const defaultFilter = () => true;
+class GraphView {
+  constructor(options) {
+    __publicField(this, "graph");
+    __publicField(this, "nodeFilter");
+    __publicField(this, "edgeFilter");
+    // caches
+    __publicField(this, "cacheEnabled");
+    __publicField(this, "inEdgesMap", /* @__PURE__ */ new Map());
+    __publicField(this, "outEdgesMap", /* @__PURE__ */ new Map());
+    __publicField(this, "bothEdgesMap", /* @__PURE__ */ new Map());
+    __publicField(this, "allNodesMap", /* @__PURE__ */ new Map());
+    __publicField(this, "allEdgesMap", /* @__PURE__ */ new Map());
+    /**
+     * Clear all cache data. Therefore `getAllNodes()` will return `[]`.
+     * If you want to disable caching, use `graphView.cacheEnabled = false` instead.
+     */
+    __publicField(this, "clearCache", () => {
+      this.inEdgesMap.clear();
+      this.outEdgesMap.clear();
+      this.bothEdgesMap.clear();
+      this.allNodesMap.clear();
+      this.allEdgesMap.clear();
+    });
+    /**
+     * Fully refresh all cache data to the current graph state.
+     */
+    __publicField(this, "refreshCache", () => {
+      this.clearCache();
+      this.updateCache(this.graph.getAllNodes().map((node) => node.id));
+    });
+    /**
+     * Instead of a fully refreshment, this method partially update the cache data by specifying
+     * involved(added, removed, updated) nodes. It's more efficient when handling small changes
+     * on a large graph.
+     */
+    __publicField(this, "updateCache", (involvedNodeIds) => {
+      const involvedEdgeIds = /* @__PURE__ */ new Set();
+      involvedNodeIds.forEach((id) => {
+        const oldEdgesSet = this.bothEdgesMap.get(id);
+        if (oldEdgesSet) {
+          oldEdgesSet.forEach((edge) => involvedEdgeIds.add(edge.id));
+        }
+        if (!this.hasNode(id)) {
+          this.inEdgesMap.delete(id);
+          this.outEdgesMap.delete(id);
+          this.bothEdgesMap.delete(id);
+          this.allNodesMap.delete(id);
+        } else {
+          const inEdges = this.graph.getRelatedEdges(id, "in").filter(this.edgeFilter);
+          const outEdges = this.graph.getRelatedEdges(id, "out").filter(this.edgeFilter);
+          const bothEdges = Array.from(/* @__PURE__ */ new Set([...inEdges, ...outEdges]));
+          bothEdges.forEach((edge) => involvedEdgeIds.add(edge.id));
+          this.inEdgesMap.set(id, inEdges);
+          this.outEdgesMap.set(id, outEdges);
+          this.bothEdgesMap.set(id, bothEdges);
+          this.allNodesMap.set(id, this.graph.getNode(id));
+        }
+      });
+      involvedEdgeIds.forEach((id) => {
+        if (this.hasEdge(id)) {
+          this.allEdgesMap.set(id, this.graph.getEdge(id));
+        } else {
+          this.allEdgesMap.delete(id);
+        }
+      });
+    });
+    __publicField(this, "handleGraphChanged", (event) => {
+      const involvedNodeIds = /* @__PURE__ */ new Set();
+      event.changes.forEach((change) => {
+        switch (change.type) {
+          case "NodeAdded":
+            involvedNodeIds.add(change.value.id);
+            break;
+          case "NodeDataUpdated":
+            involvedNodeIds.add(change.id);
+            break;
+          case "EdgeAdded":
+            involvedNodeIds.add(change.value.source);
+            involvedNodeIds.add(change.value.target);
+            break;
+          case "EdgeUpdated":
+            if (change.propertyName === "source" || change.propertyName === "target") {
+              involvedNodeIds.add(change.oldValue);
+              involvedNodeIds.add(change.newValue);
+            }
+            break;
+          case "EdgeDataUpdated":
+            if (event.graph.hasEdge(change.id)) {
+              const edge = event.graph.getEdge(change.id);
+              involvedNodeIds.add(edge.source);
+              involvedNodeIds.add(edge.target);
+            }
+            break;
+          case "EdgeRemoved":
+            involvedNodeIds.add(change.value.source);
+            involvedNodeIds.add(change.value.target);
+            break;
+          case "NodeRemoved":
+            involvedNodeIds.add(change.value.id);
+            break;
+        }
+      });
+      this.updateCache(involvedNodeIds);
+    });
+    this.graph = options.graph;
+    const nodeFilter = options.nodeFilter || defaultFilter;
+    const edgeFilter = options.edgeFilter || defaultFilter;
+    this.nodeFilter = nodeFilter;
+    this.edgeFilter = (edge) => {
+      const { source, target } = this.graph.getEdgeDetail(edge.id);
+      if (!nodeFilter(source) || !nodeFilter(target)) {
+        return false;
+      }
+      return edgeFilter(edge, source, target);
+    };
+    if (options.cache === "auto") {
+      this.cacheEnabled = true;
+      this.startAutoCache();
+    } else if (options.cache === "manual") {
+      this.cacheEnabled = true;
+    } else {
+      this.cacheEnabled = false;
+    }
+  }
+  startAutoCache() {
+    this.refreshCache();
+    this.graph.on("changed", this.handleGraphChanged);
+  }
+  stopAutoCache() {
+    this.graph.off("changed", this.handleGraphChanged);
+  }
+  // ================= Node =================
+  checkNodeExistence(id) {
+    this.getNode(id);
+  }
+  hasNode(id) {
+    if (!this.graph.hasNode(id))
+      return false;
+    const node = this.graph.getNode(id);
+    return this.nodeFilter(node);
+  }
+  areNeighbors(firstNodeId, secondNodeId) {
+    this.checkNodeExistence(firstNodeId);
+    return this.getNeighbors(secondNodeId).some((neighbor) => neighbor.id === firstNodeId);
+  }
+  getNode(id) {
+    const node = this.graph.getNode(id);
+    if (!this.nodeFilter(node)) {
+      throw new Error("Node not found for id: " + id);
+    }
+    return node;
+  }
+  getRelatedEdges(id, direction) {
+    this.checkNodeExistence(id);
+    if (this.cacheEnabled) {
+      if (direction === "in") {
+        return this.inEdgesMap.get(id);
+      } else if (direction === "out") {
+        return this.outEdgesMap.get(id);
+      } else {
+        return this.bothEdgesMap.get(id);
+      }
+    }
+    const edges = this.graph.getRelatedEdges(id, direction);
+    return edges.filter(this.edgeFilter);
+  }
+  getDegree(id, direction) {
+    return this.getRelatedEdges(id, direction).length;
+  }
+  getSuccessors(id) {
+    const outEdges = this.getRelatedEdges(id, "out");
+    const targets = outEdges.map((edge) => this.getNode(edge.target));
+    return Array.from(new Set(targets));
+  }
+  getPredecessors(id) {
+    const inEdges = this.getRelatedEdges(id, "in");
+    const sources = inEdges.map((edge) => this.getNode(edge.source));
+    return Array.from(new Set(sources));
+  }
+  getNeighbors(id) {
+    const predecessors = this.getPredecessors(id);
+    const successors = this.getSuccessors(id);
+    return Array.from(/* @__PURE__ */ new Set([...predecessors, ...successors]));
+  }
+  // ================= Edge =================
+  hasEdge(id) {
+    if (!this.graph.hasEdge(id))
+      return false;
+    const edge = this.graph.getEdge(id);
+    return this.edgeFilter(edge);
+  }
+  getEdge(id) {
+    const edge = this.graph.getEdge(id);
+    if (!this.edgeFilter(edge)) {
+      throw new Error("Edge not found for id: " + id);
+    }
+    return edge;
+  }
+  getEdgeDetail(id) {
+    const edge = this.getEdge(id);
+    return {
+      edge,
+      source: this.getNode(edge.source),
+      target: this.getNode(edge.target)
+    };
+  }
+  // ================= Tree =================
+  hasTreeStructure(treeKey) {
+    return this.graph.hasTreeStructure(treeKey);
+  }
+  getRoots(treeKey) {
+    return this.graph.getRoots(treeKey).filter(this.nodeFilter);
+  }
+  getChildren(id, treeKey) {
+    this.checkNodeExistence(id);
+    return this.graph.getChildren(id, treeKey).filter(this.nodeFilter);
+  }
+  getParent(id, treeKey) {
+    this.checkNodeExistence(id);
+    const parent = this.graph.getParent(id, treeKey);
+    if (!parent || !this.nodeFilter(parent))
+      return null;
+    return parent;
+  }
+  // ================= Graph =================
+  getAllNodes() {
+    if (this.cacheEnabled) {
+      return Array.from(this.allNodesMap.values());
+    }
+    return this.graph.getAllNodes().filter(this.nodeFilter);
+  }
+  getAllEdges() {
+    if (this.cacheEnabled) {
+      return Array.from(this.allEdgesMap.values());
+    }
+    return this.graph.getAllEdges().filter(this.edgeFilter);
+  }
+  bfs(id, fn, direction = "out") {
+    const navigator = {
+      in: this.getPredecessors.bind(this),
+      out: this.getSuccessors.bind(this),
+      both: this.getNeighbors.bind(this)
+    }[direction];
+    doBFS([this.getNode(id)], /* @__PURE__ */ new Set(), fn, navigator);
+  }
+  dfs(id, fn, direction = "out") {
+    const navigator = {
+      in: this.getPredecessors.bind(this),
+      out: this.getSuccessors.bind(this),
+      both: this.getNeighbors.bind(this)
+    }[direction];
+    doDFS(this.getNode(id), /* @__PURE__ */ new Set(), fn, navigator);
+  }
+}
+export {
+  GraphView
+};
+//# sourceMappingURL=graphView.js.map

package/dist/node_modules/.pnpm/@antv_graphlib@2.0.4/node_modules/@antv/graphlib/esm/graphView.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graphView.js","sources":["../../../../../../../../../node_modules/.pnpm/@antv+graphlib@2.0.4/node_modules/@antv/graphlib/esm/graphView.js"],"sourcesContent":["import { doBFS, doDFS } from './utils/traverse';\nconst defaultFilter = () => true;\nexport class GraphView {\n    graph;\n    nodeFilter;\n    edgeFilter;\n    // caches\n    cacheEnabled;\n    inEdgesMap = new Map();\n    outEdgesMap = new Map();\n    bothEdgesMap = new Map();\n    allNodesMap = new Map();\n    allEdgesMap = new Map();\n    constructor(options) {\n        this.graph = options.graph;\n        const nodeFilter = options.nodeFilter || defaultFilter;\n        const edgeFilter = options.edgeFilter || defaultFilter;\n        this.nodeFilter = nodeFilter;\n        this.edgeFilter = (edge) => {\n            const { source, target } = this.graph.getEdgeDetail(edge.id);\n            if (!nodeFilter(source) || !nodeFilter(target)) {\n                return false;\n            }\n            return edgeFilter(edge, source, target);\n        };\n        if (options.cache === 'auto') {\n            this.cacheEnabled = true;\n            this.startAutoCache();\n        }\n        else if (options.cache === 'manual') {\n            this.cacheEnabled = true;\n        }\n        else {\n            this.cacheEnabled = false;\n        }\n    }\n    /**\n     * Clear all cache data. Therefore `getAllNodes()` will return `[]`.\n     * If you want to disable caching, use `graphView.cacheEnabled = false` instead.\n     */\n    clearCache = () => {\n        this.inEdgesMap.clear();\n        this.outEdgesMap.clear();\n        this.bothEdgesMap.clear();\n        this.allNodesMap.clear();\n        this.allEdgesMap.clear();\n    };\n    /**\n     * Fully refresh all cache data to the current graph state.\n     */\n    refreshCache = () => {\n        this.clearCache();\n        this.updateCache(this.graph.getAllNodes().map((node) => node.id));\n    };\n    /**\n     * Instead of a fully refreshment, this method partially update the cache data by specifying\n     * involved(added, removed, updated) nodes. It's more efficient when handling small changes\n     * on a large graph.\n     */\n    updateCache = (involvedNodeIds) => {\n        const involvedEdgeIds = new Set();\n        involvedNodeIds.forEach((id) => {\n            // Collect all involved old edges.\n            const oldEdgesSet = this.bothEdgesMap.get(id);\n            if (oldEdgesSet) {\n                oldEdgesSet.forEach((edge) => involvedEdgeIds.add(edge.id));\n            }\n            if (!this.hasNode(id)) {\n                // When an involved node becomes unvisitable:\n                // 1. Delete its related edges cache.\n                this.inEdgesMap.delete(id);\n                this.outEdgesMap.delete(id);\n                this.bothEdgesMap.delete(id);\n                // 2. Delete it from the allNodesMap.\n                this.allNodesMap.delete(id);\n            }\n            else {\n                // When an involved node becomes or stays visitable:\n                // 1. Collect its new edges.\n                const inEdges = this.graph\n                    .getRelatedEdges(id, 'in')\n                    .filter(this.edgeFilter);\n                const outEdges = this.graph\n                    .getRelatedEdges(id, 'out')\n                    .filter(this.edgeFilter);\n                const bothEdges = Array.from(new Set([...inEdges, ...outEdges]));\n                bothEdges.forEach((edge) => involvedEdgeIds.add(edge.id));\n                // 2. Update its related edges cache.\n                this.inEdgesMap.set(id, inEdges);\n                this.outEdgesMap.set(id, outEdges);\n                this.bothEdgesMap.set(id, bothEdges);\n                // 3. Add to allNodesMap.\n                this.allNodesMap.set(id, this.graph.getNode(id));\n            }\n        });\n        // Update allEdgesMap.\n        involvedEdgeIds.forEach((id) => {\n            if (this.hasEdge(id)) {\n                this.allEdgesMap.set(id, this.graph.getEdge(id));\n            }\n            else {\n                this.allEdgesMap.delete(id);\n            }\n        });\n    };\n    startAutoCache() {\n        this.refreshCache();\n        this.graph.on('changed', this.handleGraphChanged);\n    }\n    stopAutoCache() {\n        this.graph.off('changed', this.handleGraphChanged);\n    }\n    handleGraphChanged = (event) => {\n        // Collect all involved nodes.\n        const involvedNodeIds = new Set();\n        event.changes.forEach((change) => {\n            switch (change.type) {\n                case 'NodeAdded':\n                    involvedNodeIds.add(change.value.id);\n                    break;\n                case 'NodeDataUpdated':\n                    involvedNodeIds.add(change.id);\n                    break;\n                case 'EdgeAdded':\n                    involvedNodeIds.add(change.value.source);\n                    involvedNodeIds.add(change.value.target);\n                    break;\n                case 'EdgeUpdated':\n                    if (change.propertyName === 'source' ||\n                        change.propertyName === 'target') {\n                        involvedNodeIds.add(change.oldValue);\n                        involvedNodeIds.add(change.newValue);\n                    }\n                    break;\n                case 'EdgeDataUpdated':\n                    if (event.graph.hasEdge(change.id)) {\n                        const edge = event.graph.getEdge(change.id);\n                        involvedNodeIds.add(edge.source);\n                        involvedNodeIds.add(edge.target);\n                    }\n                    break;\n                case 'EdgeRemoved':\n                    involvedNodeIds.add(change.value.source);\n                    involvedNodeIds.add(change.value.target);\n                    break;\n                case 'NodeRemoved':\n                    involvedNodeIds.add(change.value.id);\n                    break;\n                default:\n                    break;\n            }\n        });\n        // Update their caches.\n        this.updateCache(involvedNodeIds);\n    };\n    // ================= Node =================\n    checkNodeExistence(id) {\n        this.getNode(id);\n    }\n    hasNode(id) {\n        if (!this.graph.hasNode(id))\n            return false;\n        const node = this.graph.getNode(id);\n        return this.nodeFilter(node);\n    }\n    areNeighbors(firstNodeId, secondNodeId) {\n        this.checkNodeExistence(firstNodeId);\n        return this.getNeighbors(secondNodeId).some((neighbor) => neighbor.id === firstNodeId);\n    }\n    getNode(id) {\n        const node = this.graph.getNode(id);\n        if (!this.nodeFilter(node)) {\n            throw new Error('Node not found for id: ' + id);\n        }\n        return node;\n    }\n    getRelatedEdges(id, direction) {\n        this.checkNodeExistence(id);\n        if (this.cacheEnabled) {\n            if (direction === 'in') {\n                return this.inEdgesMap.get(id);\n            }\n            else if (direction === 'out') {\n                return this.outEdgesMap.get(id);\n            }\n            else {\n                return this.bothEdgesMap.get(id);\n            }\n        }\n        const edges = this.graph.getRelatedEdges(id, direction);\n        return edges.filter(this.edgeFilter);\n    }\n    getDegree(id, direction) {\n        return this.getRelatedEdges(id, direction).length;\n    }\n    getSuccessors(id) {\n        const outEdges = this.getRelatedEdges(id, 'out');\n        const targets = outEdges.map((edge) => this.getNode(edge.target));\n        return Array.from(new Set(targets));\n    }\n    getPredecessors(id) {\n        const inEdges = this.getRelatedEdges(id, 'in');\n        const sources = inEdges.map((edge) => this.getNode(edge.source));\n        return Array.from(new Set(sources));\n    }\n    getNeighbors(id) {\n        const predecessors = this.getPredecessors(id);\n        const successors = this.getSuccessors(id);\n        return Array.from(new Set([...predecessors, ...successors]));\n    }\n    // ================= Edge =================\n    hasEdge(id) {\n        if (!this.graph.hasEdge(id))\n            return false;\n        const edge = this.graph.getEdge(id);\n        return this.edgeFilter(edge);\n    }\n    getEdge(id) {\n        const edge = this.graph.getEdge(id);\n        if (!this.edgeFilter(edge)) {\n            throw new Error('Edge not found for id: ' + id);\n        }\n        return edge;\n    }\n    getEdgeDetail(id) {\n        const edge = this.getEdge(id);\n        return {\n            edge,\n            source: this.getNode(edge.source),\n            target: this.getNode(edge.target),\n        };\n    }\n    // ================= Tree =================\n    hasTreeStructure(treeKey) {\n        return this.graph.hasTreeStructure(treeKey);\n    }\n    getRoots(treeKey) {\n        return this.graph.getRoots(treeKey).filter(this.nodeFilter);\n    }\n    getChildren(id, treeKey) {\n        this.checkNodeExistence(id);\n        return this.graph.getChildren(id, treeKey).filter(this.nodeFilter);\n    }\n    getParent(id, treeKey) {\n        this.checkNodeExistence(id);\n        const parent = this.graph.getParent(id, treeKey);\n        if (!parent || !this.nodeFilter(parent))\n            return null;\n        return parent;\n    }\n    // ================= Graph =================\n    getAllNodes() {\n        if (this.cacheEnabled) {\n            return Array.from(this.allNodesMap.values());\n        }\n        return this.graph.getAllNodes().filter(this.nodeFilter);\n    }\n    getAllEdges() {\n        if (this.cacheEnabled) {\n            return Array.from(this.allEdgesMap.values());\n        }\n        return this.graph.getAllEdges().filter(this.edgeFilter);\n    }\n    bfs(id, fn, direction = 'out') {\n        const navigator = {\n            in: this.getPredecessors.bind(this),\n            out: this.getSuccessors.bind(this),\n            both: this.getNeighbors.bind(this),\n        }[direction];\n        doBFS([this.getNode(id)], new Set(), fn, navigator);\n    }\n    dfs(id, fn, direction = 'out') {\n        const navigator = {\n            in: this.getPredecessors.bind(this),\n            out: this.getSuccessors.bind(this),\n            both: this.getNeighbors.bind(this),\n        }[direction];\n        doDFS(this.getNode(id), new Set(), fn, navigator);\n    }\n}\n//# sourceMappingURL=graphView.js.map"],"names":[],"mappings":";;;;AACA,MAAM,gBAAgB,MAAM;AACrB,MAAM,UAAU;AAAA,EAWnB,YAAY,SAAS;AAVrB;AACA;AACA;AAEA;AAAA;AACA,sCAAa,oBAAI,IAAG;AACpB,uCAAc,oBAAI,IAAG;AACrB,wCAAe,oBAAI,IAAG;AACtB,uCAAc,oBAAI,IAAG;AACrB,uCAAc,oBAAI,IAAG;AA4BrB;AAAA;AAAA;AAAA;AAAA,sCAAa,MAAM;AACf,WAAK,WAAW,MAAK;AACrB,WAAK,YAAY,MAAK;AACtB,WAAK,aAAa,MAAK;AACvB,WAAK,YAAY,MAAK;AACtB,WAAK,YAAY,MAAK;AAAA,IAC1B;AAIA;AAAA;AAAA;AAAA,wCAAe,MAAM;AACjB,WAAK,WAAU;AACf,WAAK,YAAY,KAAK,MAAM,YAAW,EAAG,IAAI,CAAC,SAAS,KAAK,EAAE,CAAC;AAAA,IACpE;AAMA;AAAA;AAAA;AAAA;AAAA;AAAA,uCAAc,CAAC,oBAAoB;AAC/B,YAAM,kBAAkB,oBAAI,IAAG;AAC/B,sBAAgB,QAAQ,CAAC,OAAO;AAE5B,cAAM,cAAc,KAAK,aAAa,IAAI,EAAE;AAC5C,YAAI,aAAa;AACb,sBAAY,QAAQ,CAAC,SAAS,gBAAgB,IAAI,KAAK,EAAE,CAAC;AAAA,QAC9D;AACA,YAAI,CAAC,KAAK,QAAQ,EAAE,GAAG;AAGnB,eAAK,WAAW,OAAO,EAAE;AACzB,eAAK,YAAY,OAAO,EAAE;AAC1B,eAAK,aAAa,OAAO,EAAE;AAE3B,eAAK,YAAY,OAAO,EAAE;AAAA,QAC9B,OACK;AAGD,gBAAM,UAAU,KAAK,MAChB,gBAAgB,IAAI,IAAI,EACxB,OAAO,KAAK,UAAU;AAC3B,gBAAM,WAAW,KAAK,MACjB,gBAAgB,IAAI,KAAK,EACzB,OAAO,KAAK,UAAU;AAC3B,gBAAM,YAAY,MAAM,KAAK,oBAAI,IAAI,CAAC,GAAG,SAAS,GAAG,QAAQ,CAAC,CAAC;AAC/D,oBAAU,QAAQ,CAAC,SAAS,gBAAgB,IAAI,KAAK,EAAE,CAAC;AAExD,eAAK,WAAW,IAAI,IAAI,OAAO;AAC/B,eAAK,YAAY,IAAI,IAAI,QAAQ;AACjC,eAAK,aAAa,IAAI,IAAI,SAAS;AAEnC,eAAK,YAAY,IAAI,IAAI,KAAK,MAAM,QAAQ,EAAE,CAAC;AAAA,QACnD;AAAA,MACJ,CAAC;AAED,sBAAgB,QAAQ,CAAC,OAAO;AAC5B,YAAI,KAAK,QAAQ,EAAE,GAAG;AAClB,eAAK,YAAY,IAAI,IAAI,KAAK,MAAM,QAAQ,EAAE,CAAC;AAAA,QACnD,OACK;AACD,eAAK,YAAY,OAAO,EAAE;AAAA,QAC9B;AAAA,MACJ,CAAC;AAAA,IACL;AAQA,8CAAqB,CAAC,UAAU;AAE5B,YAAM,kBAAkB,oBAAI,IAAG;AAC/B,YAAM,QAAQ,QAAQ,CAAC,WAAW;AAC9B,gBAAQ,OAAO,MAAI;AAAA,UACf,KAAK;AACD,4BAAgB,IAAI,OAAO,MAAM,EAAE;AACnC;AAAA,UACJ,KAAK;AACD,4BAAgB,IAAI,OAAO,EAAE;AAC7B;AAAA,UACJ,KAAK;AACD,4BAAgB,IAAI,OAAO,MAAM,MAAM;AACvC,4BAAgB,IAAI,OAAO,MAAM,MAAM;AACvC;AAAA,UACJ,KAAK;AACD,gBAAI,OAAO,iBAAiB,YACxB,OAAO,iBAAiB,UAAU;AAClC,8BAAgB,IAAI,OAAO,QAAQ;AACnC,8BAAgB,IAAI,OAAO,QAAQ;AAAA,YACvC;AACA;AAAA,UACJ,KAAK;AACD,gBAAI,MAAM,MAAM,QAAQ,OAAO,EAAE,GAAG;AAChC,oBAAM,OAAO,MAAM,MAAM,QAAQ,OAAO,EAAE;AAC1C,8BAAgB,IAAI,KAAK,MAAM;AAC/B,8BAAgB,IAAI,KAAK,MAAM;AAAA,YACnC;AACA;AAAA,UACJ,KAAK;AACD,4BAAgB,IAAI,OAAO,MAAM,MAAM;AACvC,4BAAgB,IAAI,OAAO,MAAM,MAAM;AACvC;AAAA,UACJ,KAAK;AACD,4BAAgB,IAAI,OAAO,MAAM,EAAE;AACnC;AAAA,QAGpB;AAAA,MACQ,CAAC;AAED,WAAK,YAAY,eAAe;AAAA,IACpC;AA5II,SAAK,QAAQ,QAAQ;AACrB,UAAM,aAAa,QAAQ,cAAc;AACzC,UAAM,aAAa,QAAQ,cAAc;AACzC,SAAK,aAAa;AAClB,SAAK,aAAa,CAAC,SAAS;AACxB,YAAM,EAAE,QAAQ,WAAW,KAAK,MAAM,cAAc,KAAK,EAAE;AAC3D,UAAI,CAAC,WAAW,MAAM,KAAK,CAAC,WAAW,MAAM,GAAG;AAC5C,eAAO;AAAA,MACX;AACA,aAAO,WAAW,MAAM,QAAQ,MAAM;AAAA,IAC1C;AACA,QAAI,QAAQ,UAAU,QAAQ;AAC1B,WAAK,eAAe;AACpB,WAAK,eAAc;AAAA,IACvB,WACS,QAAQ,UAAU,UAAU;AACjC,WAAK,eAAe;AAAA,IACxB,OACK;AACD,WAAK,eAAe;AAAA,IACxB;AAAA,EACJ;AAAA,EAsEA,iBAAiB;AACb,SAAK,aAAY;AACjB,SAAK,MAAM,GAAG,WAAW,KAAK,kBAAkB;AAAA,EACpD;AAAA,EACA,gBAAgB;AACZ,SAAK,MAAM,IAAI,WAAW,KAAK,kBAAkB;AAAA,EACrD;AAAA;AAAA,EA6CA,mBAAmB,IAAI;AACnB,SAAK,QAAQ,EAAE;AAAA,EACnB;AAAA,EACA,QAAQ,IAAI;AACR,QAAI,CAAC,KAAK,MAAM,QAAQ,EAAE;AACtB,aAAO;AACX,UAAM,OAAO,KAAK,MAAM,QAAQ,EAAE;AAClC,WAAO,KAAK,WAAW,IAAI;AAAA,EAC/B;AAAA,EACA,aAAa,aAAa,cAAc;AACpC,SAAK,mBAAmB,WAAW;AACnC,WAAO,KAAK,aAAa,YAAY,EAAE,KAAK,CAAC,aAAa,SAAS,OAAO,WAAW;AAAA,EACzF;AAAA,EACA,QAAQ,IAAI;AACR,UAAM,OAAO,KAAK,MAAM,QAAQ,EAAE;AAClC,QAAI,CAAC,KAAK,WAAW,IAAI,GAAG;AACxB,YAAM,IAAI,MAAM,4BAA4B,EAAE;AAAA,IAClD;AACA,WAAO;AAAA,EACX;AAAA,EACA,gBAAgB,IAAI,WAAW;AAC3B,SAAK,mBAAmB,EAAE;AAC1B,QAAI,KAAK,cAAc;AACnB,UAAI,cAAc,MAAM;AACpB,eAAO,KAAK,WAAW,IAAI,EAAE;AAAA,MACjC,WACS,cAAc,OAAO;AAC1B,eAAO,KAAK,YAAY,IAAI,EAAE;AAAA,MAClC,OACK;AACD,eAAO,KAAK,aAAa,IAAI,EAAE;AAAA,MACnC;AAAA,IACJ;AACA,UAAM,QAAQ,KAAK,MAAM,gBAAgB,IAAI,SAAS;AACtD,WAAO,MAAM,OAAO,KAAK,UAAU;AAAA,EACvC;AAAA,EACA,UAAU,IAAI,WAAW;AACrB,WAAO,KAAK,gBAAgB,IAAI,SAAS,EAAE;AAAA,EAC/C;AAAA,EACA,cAAc,IAAI;AACd,UAAM,WAAW,KAAK,gBAAgB,IAAI,KAAK;AAC/C,UAAM,UAAU,SAAS,IAAI,CAAC,SAAS,KAAK,QAAQ,KAAK,MAAM,CAAC;AAChE,WAAO,MAAM,KAAK,IAAI,IAAI,OAAO,CAAC;AAAA,EACtC;AAAA,EACA,gBAAgB,IAAI;AAChB,UAAM,UAAU,KAAK,gBAAgB,IAAI,IAAI;AAC7C,UAAM,UAAU,QAAQ,IAAI,CAAC,SAAS,KAAK,QAAQ,KAAK,MAAM,CAAC;AAC/D,WAAO,MAAM,KAAK,IAAI,IAAI,OAAO,CAAC;AAAA,EACtC;AAAA,EACA,aAAa,IAAI;AACb,UAAM,eAAe,KAAK,gBAAgB,EAAE;AAC5C,UAAM,aAAa,KAAK,cAAc,EAAE;AACxC,WAAO,MAAM,KAAK,oBAAI,IAAI,CAAC,GAAG,cAAc,GAAG,UAAU,CAAC,CAAC;AAAA,EAC/D;AAAA;AAAA,EAEA,QAAQ,IAAI;AACR,QAAI,CAAC,KAAK,MAAM,QAAQ,EAAE;AACtB,aAAO;AACX,UAAM,OAAO,KAAK,MAAM,QAAQ,EAAE;AAClC,WAAO,KAAK,WAAW,IAAI;AAAA,EAC/B;AAAA,EACA,QAAQ,IAAI;AACR,UAAM,OAAO,KAAK,MAAM,QAAQ,EAAE;AAClC,QAAI,CAAC,KAAK,WAAW,IAAI,GAAG;AACxB,YAAM,IAAI,MAAM,4BAA4B,EAAE;AAAA,IAClD;AACA,WAAO;AAAA,EACX;AAAA,EACA,cAAc,IAAI;AACd,UAAM,OAAO,KAAK,QAAQ,EAAE;AAC5B,WAAO;AAAA,MACH;AAAA,MACA,QAAQ,KAAK,QAAQ,KAAK,MAAM;AAAA,MAChC,QAAQ,KAAK,QAAQ,KAAK,MAAM;AAAA,IAC5C;AAAA,EACI;AAAA;AAAA,EAEA,iBAAiB,SAAS;AACtB,WAAO,KAAK,MAAM,iBAAiB,OAAO;AAAA,EAC9C;AAAA,EACA,SAAS,SAAS;AACd,WAAO,KAAK,MAAM,SAAS,OAAO,EAAE,OAAO,KAAK,UAAU;AAAA,EAC9D;AAAA,EACA,YAAY,IAAI,SAAS;AACrB,SAAK,mBAAmB,EAAE;AAC1B,WAAO,KAAK,MAAM,YAAY,IAAI,OAAO,EAAE,OAAO,KAAK,UAAU;AAAA,EACrE;AAAA,EACA,UAAU,IAAI,SAAS;AACnB,SAAK,mBAAmB,EAAE;AAC1B,UAAM,SAAS,KAAK,MAAM,UAAU,IAAI,OAAO;AAC/C,QAAI,CAAC,UAAU,CAAC,KAAK,WAAW,MAAM;AAClC,aAAO;AACX,WAAO;AAAA,EACX;AAAA;AAAA,EAEA,cAAc;AACV,QAAI,KAAK,cAAc;AACnB,aAAO,MAAM,KAAK,KAAK,YAAY,OAAM,CAAE;AAAA,IAC/C;AACA,WAAO,KAAK,MAAM,YAAW,EAAG,OAAO,KAAK,UAAU;AAAA,EAC1D;AAAA,EACA,cAAc;AACV,QAAI,KAAK,cAAc;AACnB,aAAO,MAAM,KAAK,KAAK,YAAY,OAAM,CAAE;AAAA,IAC/C;AACA,WAAO,KAAK,MAAM,YAAW,EAAG,OAAO,KAAK,UAAU;AAAA,EAC1D;AAAA,EACA,IAAI,IAAI,IAAI,YAAY,OAAO;AAC3B,UAAM,YAAY;AAAA,MACd,IAAI,KAAK,gBAAgB,KAAK,IAAI;AAAA,MAClC,KAAK,KAAK,cAAc,KAAK,IAAI;AAAA,MACjC,MAAM,KAAK,aAAa,KAAK,IAAI;AAAA,IAC7C,EAAU,SAAS;AACX,UAAM,CAAC,KAAK,QAAQ,EAAE,CAAC,GAAG,oBAAI,IAAG,GAAI,IAAI,SAAS;AAAA,EACtD;AAAA,EACA,IAAI,IAAI,IAAI,YAAY,OAAO;AAC3B,UAAM,YAAY;AAAA,MACd,IAAI,KAAK,gBAAgB,KAAK,IAAI;AAAA,MAClC,KAAK,KAAK,cAAc,KAAK,IAAI;AAAA,MACjC,MAAM,KAAK,aAAa,KAAK,IAAI;AAAA,IAC7C,EAAU,SAAS;AACX,UAAM,KAAK,QAAQ,EAAE,GAAG,oBAAI,IAAG,GAAI,IAAI,SAAS;AAAA,EACpD;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_graphlib@2.0.4/node_modules/@antv/graphlib/esm/utils/traverse.cjs

@@ -0,0 +1,37 @@
+"use strict";
+Object.defineProperty(exports, Symbol.toStringTag, { value: "Module" });
+function doBFS(queue, visited, fn, navigator) {
+  while (queue.length) {
+    const node = queue.shift();
+    const abort = fn(node);
+    if (abort) {
+      return true;
+    }
+    visited.add(node.id);
+    navigator(node.id).forEach((n) => {
+      if (!visited.has(n.id)) {
+        visited.add(n.id);
+        queue.push(n);
+      }
+    });
+  }
+  return false;
+}
+function doDFS(node, visited, fn, navigator) {
+  const abort = fn(node);
+  if (abort) {
+    return true;
+  }
+  visited.add(node.id);
+  for (const n of navigator(node.id)) {
+    if (!visited.has(n.id)) {
+      if (doDFS(n, visited, fn, navigator)) {
+        return true;
+      }
+    }
+  }
+  return false;
+}
+exports.doBFS = doBFS;
+exports.doDFS = doDFS;
+//# sourceMappingURL=traverse.cjs.map

package/dist/node_modules/.pnpm/@antv_graphlib@2.0.4/node_modules/@antv/graphlib/esm/utils/traverse.cjs.map

@@ -0,0 +1 @@
+{"version":3,"file":"traverse.cjs","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+graphlib@2.0.4/node_modules/@antv/graphlib/esm/utils/traverse.js"],"sourcesContent":["export function doBFS(queue, visited, fn, navigator) {\n    while (queue.length) {\n        const node = queue.shift();\n        const abort = fn(node);\n        if (abort) {\n            return true;\n        }\n        visited.add(node.id);\n        navigator(node.id).forEach((n) => {\n            if (!visited.has(n.id)) {\n                visited.add(n.id);\n                queue.push(n);\n            }\n        });\n    }\n    return false;\n}\nexport function doDFS(node, visited, fn, navigator) {\n    const abort = fn(node);\n    if (abort) {\n        return true;\n    }\n    visited.add(node.id);\n    for (const n of navigator(node.id)) {\n        if (!visited.has(n.id)) {\n            if (doDFS(n, visited, fn, navigator)) {\n                return true;\n            }\n        }\n    }\n    return false;\n}\n//# sourceMappingURL=traverse.js.map"],"names":[],"mappings":";;AAAO,SAAS,MAAM,OAAO,SAAS,IAAI,WAAW;AACjD,SAAO,MAAM,QAAQ;AACjB,UAAM,OAAO,MAAM,MAAK;AACxB,UAAM,QAAQ,GAAG,IAAI;AACrB,QAAI,OAAO;AACP,aAAO;AAAA,IACX;AACA,YAAQ,IAAI,KAAK,EAAE;AACnB,cAAU,KAAK,EAAE,EAAE,QAAQ,CAAC,MAAM;AAC9B,UAAI,CAAC,QAAQ,IAAI,EAAE,EAAE,GAAG;AACpB,gBAAQ,IAAI,EAAE,EAAE;AAChB,cAAM,KAAK,CAAC;AAAA,MAChB;AAAA,IACJ,CAAC;AAAA,EACL;AACA,SAAO;AACX;AACO,SAAS,MAAM,MAAM,SAAS,IAAI,WAAW;AAChD,QAAM,QAAQ,GAAG,IAAI;AACrB,MAAI,OAAO;AACP,WAAO;AAAA,EACX;AACA,UAAQ,IAAI,KAAK,EAAE;AACnB,aAAW,KAAK,UAAU,KAAK,EAAE,GAAG;AAChC,QAAI,CAAC,QAAQ,IAAI,EAAE,EAAE,GAAG;AACpB,UAAI,MAAM,GAAG,SAAS,IAAI,SAAS,GAAG;AAClC,eAAO;AAAA,MACX;AAAA,IACJ;AAAA,EACJ;AACA,SAAO;AACX;;;","x_google_ignoreList":[0]}

package/dist/node_modules/.pnpm/@antv_graphlib@2.0.4/node_modules/@antv/graphlib/esm/utils/traverse.js

@@ -0,0 +1,37 @@
+function doBFS(queue, visited, fn, navigator) {
+  while (queue.length) {
+    const node = queue.shift();
+    const abort = fn(node);
+    if (abort) {
+      return true;
+    }
+    visited.add(node.id);
+    navigator(node.id).forEach((n) => {
+      if (!visited.has(n.id)) {
+        visited.add(n.id);
+        queue.push(n);
+      }
+    });
+  }
+  return false;
+}
+function doDFS(node, visited, fn, navigator) {
+  const abort = fn(node);
+  if (abort) {
+    return true;
+  }
+  visited.add(node.id);
+  for (const n of navigator(node.id)) {
+    if (!visited.has(n.id)) {
+      if (doDFS(n, visited, fn, navigator)) {
+        return true;
+      }
+    }
+  }
+  return false;
+}
+export {
+  doBFS,
+  doDFS
+};
+//# sourceMappingURL=traverse.js.map

package/dist/node_modules/.pnpm/@antv_graphlib@2.0.4/node_modules/@antv/graphlib/esm/utils/traverse.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"traverse.js","sources":["../../../../../../../../../../node_modules/.pnpm/@antv+graphlib@2.0.4/node_modules/@antv/graphlib/esm/utils/traverse.js"],"sourcesContent":["export function doBFS(queue, visited, fn, navigator) {\n    while (queue.length) {\n        const node = queue.shift();\n        const abort = fn(node);\n        if (abort) {\n            return true;\n        }\n        visited.add(node.id);\n        navigator(node.id).forEach((n) => {\n            if (!visited.has(n.id)) {\n                visited.add(n.id);\n                queue.push(n);\n            }\n        });\n    }\n    return false;\n}\nexport function doDFS(node, visited, fn, navigator) {\n    const abort = fn(node);\n    if (abort) {\n        return true;\n    }\n    visited.add(node.id);\n    for (const n of navigator(node.id)) {\n        if (!visited.has(n.id)) {\n            if (doDFS(n, visited, fn, navigator)) {\n                return true;\n            }\n        }\n    }\n    return false;\n}\n//# sourceMappingURL=traverse.js.map"],"names":[],"mappings":"AAAO,SAAS,MAAM,OAAO,SAAS,IAAI,WAAW;AACjD,SAAO,MAAM,QAAQ;AACjB,UAAM,OAAO,MAAM,MAAK;AACxB,UAAM,QAAQ,GAAG,IAAI;AACrB,QAAI,OAAO;AACP,aAAO;AAAA,IACX;AACA,YAAQ,IAAI,KAAK,EAAE;AACnB,cAAU,KAAK,EAAE,EAAE,QAAQ,CAAC,MAAM;AAC9B,UAAI,CAAC,QAAQ,IAAI,EAAE,EAAE,GAAG;AACpB,gBAAQ,IAAI,EAAE,EAAE;AAChB,cAAM,KAAK,CAAC;AAAA,MAChB;AAAA,IACJ,CAAC;AAAA,EACL;AACA,SAAO;AACX;AACO,SAAS,MAAM,MAAM,SAAS,IAAI,WAAW;AAChD,QAAM,QAAQ,GAAG,IAAI;AACrB,MAAI,OAAO;AACP,WAAO;AAAA,EACX;AACA,UAAQ,IAAI,KAAK,EAAE;AACnB,aAAW,KAAK,UAAU,KAAK,EAAE,GAAG;AAChC,QAAI,CAAC,QAAQ,IAAI,EAAE,EAAE,GAAG;AACpB,UAAI,MAAM,GAAG,SAAS,IAAI,SAAS,GAAG;AAClC,eAAO;AAAA,MACX;AAAA,IACJ;AAAA,EACJ;AACA,SAAO;AACX;","x_google_ignoreList":[0]}