@hkyhy/marsun-components-core 0.1.113 → 0.1.114

package/dist/node_modules/@antv/layout/lib/algorithm/antv-dagre/add-border-segments.js

@@ -0,0 +1,24 @@
+import { addDummyNode as m } from "./util.js";
+const b = (d) => {
+  const r = (e) => {
+    const o = d.getChildren(e), t = d.getNode(e);
+    if (o != null && o.length && o.forEach((a) => r(a.id)), t.data.hasOwnProperty("minRank")) {
+      t.data.borderLeft = [], t.data.borderRight = [];
+      for (let a = t.data.minRank, n = t.data.maxRank + 1; a < n; a += 1)
+        s(d, "borderLeft", "_bl", e, t, a), s(d, "borderRight", "_br", e, t, a);
+    }
+  };
+  d.getRoots().forEach((e) => r(e.id));
+}, s = (d, r, e, o, t, a) => {
+  const n = { rank: a, borderType: r, width: 0, height: 0 }, c = a - t.data.minRank, h = t.data[r][c - 1], i = m(d, "border", n, e);
+  t.data[r][c] = i, d.setParent(i, o), h && d.addEdge({
+    id: `e${Math.random()}`,
+    source: h,
+    target: i,
+    data: { weight: 1 }
+  });
+};
+export {
+  b as addBorderSegments
+};
+//# sourceMappingURL=add-border-segments.js.map

package/dist/node_modules/@antv/layout/lib/algorithm/antv-dagre/add-border-segments.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"add-border-segments.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/antv-dagre/add-border-segments.js"],"sourcesContent":["import { addDummyNode } from './util.js';\n\nconst addBorderSegments = (g) => {\n    const dfs = (v) => {\n        const children = g.getChildren(v);\n        const node = g.getNode(v);\n        if (children === null || children === void 0 ? void 0 : children.length) {\n            children.forEach((child) => dfs(child.id));\n        }\n        if (node.data.hasOwnProperty('minRank')) {\n            node.data.borderLeft = [];\n            node.data.borderRight = [];\n            for (let rank = node.data.minRank, maxRank = node.data.maxRank + 1; rank < maxRank; rank += 1) {\n                addBorderNode(g, 'borderLeft', '_bl', v, node, rank);\n                addBorderNode(g, 'borderRight', '_br', v, node, rank);\n            }\n        }\n    };\n    g.getRoots().forEach((child) => dfs(child.id));\n};\nconst addBorderNode = (g, prop, prefix, sg, sgNode, rank) => {\n    const label = { rank, borderType: prop, width: 0, height: 0 };\n    // 使用相对于 minRank 的索引\n    const index = rank - sgNode.data.minRank;\n    // @ts-ignore\n    const prev = sgNode.data[prop][index - 1];\n    const curr = addDummyNode(g, 'border', label, prefix);\n    // @ts-ignore\n    sgNode.data[prop][index] = curr;\n    g.setParent(curr, sg);\n    if (prev) {\n        g.addEdge({\n            id: `e${Math.random()}`,\n            source: prev,\n            target: curr,\n            data: { weight: 1 },\n        });\n    }\n};\n\nexport { addBorderSegments };\n//# sourceMappingURL=add-border-segments.js.map\n"],"names":["addBorderSegments","g","dfs","v","children","node","child","rank","maxRank","addBorderNode","prop","prefix","sg","sgNode","label","index","prev","curr","addDummyNode"],"mappings":";AAEK,MAACA,IAAoB,CAACC,MAAM;AAC7B,QAAMC,IAAM,CAACC,MAAM;AACf,UAAMC,IAAWH,EAAE,YAAYE,CAAC,GAC1BE,IAAOJ,EAAE,QAAQE,CAAC;AAIxB,QAHIC,KAAa,QAAuCA,EAAS,UAC7DA,EAAS,QAAQ,CAACE,MAAUJ,EAAII,EAAM,EAAE,CAAC,GAEzCD,EAAK,KAAK,eAAe,SAAS,GAAG;AACrC,MAAAA,EAAK,KAAK,aAAa,CAAA,GACvBA,EAAK,KAAK,cAAc,CAAA;AACxB,eAASE,IAAOF,EAAK,KAAK,SAASG,IAAUH,EAAK,KAAK,UAAU,GAAGE,IAAOC,GAASD,KAAQ;AACxF,QAAAE,EAAcR,GAAG,cAAc,OAAOE,GAAGE,GAAME,CAAI,GACnDE,EAAcR,GAAG,eAAe,OAAOE,GAAGE,GAAME,CAAI;AAAA,IAE5D;AAAA,EACJ;AACA,EAAAN,EAAE,SAAQ,EAAG,QAAQ,CAACK,MAAUJ,EAAII,EAAM,EAAE,CAAC;AACjD,GACMG,IAAgB,CAACR,GAAGS,GAAMC,GAAQC,GAAIC,GAAQN,MAAS;AACzD,QAAMO,IAAQ,EAAE,MAAAP,GAAM,YAAYG,GAAM,OAAO,GAAG,QAAQ,EAAC,GAErDK,IAAQR,IAAOM,EAAO,KAAK,SAE3BG,IAAOH,EAAO,KAAKH,CAAI,EAAEK,IAAQ,CAAC,GAClCE,IAAOC,EAAajB,GAAG,UAAUa,GAAOH,CAAM;AAEpD,EAAAE,EAAO,KAAKH,CAAI,EAAEK,CAAK,IAAIE,GAC3BhB,EAAE,UAAUgB,GAAML,CAAE,GAChBI,KACAf,EAAE,QAAQ;AAAA,IACN,IAAI,IAAI,KAAK,OAAM,CAAE;AAAA,IACrB,QAAQe;AAAA,IACR,QAAQC;AAAA,IACR,MAAM,EAAE,QAAQ,EAAC;AAAA,EAC7B,CAAS;AAET;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/algorithm/antv-dagre/coordinate-system.js

@@ -0,0 +1,40 @@
+const e = (t, a) => {
+  const s = a.toLowerCase();
+  (s === "lr" || s === "rl") && c(t);
+}, f = (t, a) => {
+  const s = a.toLowerCase();
+  (s === "bt" || s === "rl") && h(t), (s === "lr" || s === "rl") && (d(t), c(t));
+}, c = (t) => {
+  t.getAllNodes().forEach((a) => {
+    i(a);
+  }), t.getAllEdges().forEach((a) => {
+    i(a);
+  });
+}, i = (t) => {
+  const a = t.data.width;
+  t.data.width = t.data.height, t.data.height = a;
+}, h = (t) => {
+  t.getAllNodes().forEach((a) => {
+    r(a.data);
+  }), t.getAllEdges().forEach((a) => {
+    var s;
+    (s = a.data.points) === null || s === void 0 || s.forEach((o) => r(o)), a.data.hasOwnProperty("y") && r(a.data);
+  });
+}, r = (t) => {
+  t != null && t.y && (t.y = -t.y);
+}, d = (t) => {
+  t.getAllNodes().forEach((a) => {
+    l(a.data);
+  }), t.getAllEdges().forEach((a) => {
+    var s;
+    (s = a.data.points) === null || s === void 0 || s.forEach((o) => l(o)), a.data.hasOwnProperty("x") && l(a.data);
+  });
+}, l = (t) => {
+  const a = t.x;
+  t.x = t.y, t.y = a;
+};
+export {
+  e as adjust,
+  f as undo
+};
+//# sourceMappingURL=coordinate-system.js.map

package/dist/node_modules/@antv/layout/lib/algorithm/antv-dagre/coordinate-system.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"coordinate-system.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/antv-dagre/coordinate-system.js"],"sourcesContent":["const adjust = (g, rankdir) => {\n    const rd = rankdir.toLowerCase();\n    if (rd === 'lr' || rd === 'rl') {\n        swapWidthHeight(g);\n    }\n};\nconst undo$1 = (g, rankdir) => {\n    const rd = rankdir.toLowerCase();\n    if (rd === 'bt' || rd === 'rl') {\n        reverseY(g);\n    }\n    if (rd === 'lr' || rd === 'rl') {\n        swapXY(g);\n        swapWidthHeight(g);\n    }\n};\nconst swapWidthHeight = (g) => {\n    g.getAllNodes().forEach((v) => {\n        swapWidthHeightOne(v);\n    });\n    g.getAllEdges().forEach((e) => {\n        swapWidthHeightOne(e);\n    });\n};\nconst swapWidthHeightOne = (node) => {\n    const w = node.data.width;\n    node.data.width = node.data.height;\n    node.data.height = w;\n};\nconst reverseY = (g) => {\n    g.getAllNodes().forEach((v) => {\n        reverseYOne(v.data);\n    });\n    g.getAllEdges().forEach((edge) => {\n        var _a;\n        (_a = edge.data.points) === null || _a === void 0 ? void 0 : _a.forEach((point) => reverseYOne(point));\n        if (edge.data.hasOwnProperty('y')) {\n            reverseYOne(edge.data);\n        }\n    });\n};\nconst reverseYOne = (node) => {\n    if (node === null || node === void 0 ? void 0 : node.y) {\n        node.y = -node.y;\n    }\n};\nconst swapXY = (g) => {\n    g.getAllNodes().forEach((v) => {\n        swapXYOne(v.data);\n    });\n    g.getAllEdges().forEach((edge) => {\n        var _a;\n        (_a = edge.data.points) === null || _a === void 0 ? void 0 : _a.forEach((point) => swapXYOne(point));\n        if (edge.data.hasOwnProperty('x')) {\n            swapXYOne(edge.data);\n        }\n    });\n};\nconst swapXYOne = (node) => {\n    const x = node.x;\n    node.x = node.y;\n    node.y = x;\n};\n\nexport { adjust, undo$1 as undo };\n//# sourceMappingURL=coordinate-system.js.map\n"],"names":["adjust","g","rankdir","rd","swapWidthHeight","undo$1","reverseY","swapXY","v","swapWidthHeightOne","e","node","w","reverseYOne","edge","_a","point","swapXYOne","x"],"mappings":"AAAK,MAACA,IAAS,CAACC,GAAGC,MAAY;AAC3B,QAAMC,IAAKD,EAAQ,YAAW;AAC9B,GAAIC,MAAO,QAAQA,MAAO,SACtBC,EAAgBH,CAAC;AAEzB,GACMI,IAAS,CAACJ,GAAGC,MAAY;AAC3B,QAAMC,IAAKD,EAAQ,YAAW;AAC9B,GAAIC,MAAO,QAAQA,MAAO,SACtBG,EAASL,CAAC,IAEVE,MAAO,QAAQA,MAAO,UACtBI,EAAON,CAAC,GACRG,EAAgBH,CAAC;AAEzB,GACMG,IAAkB,CAACH,MAAM;AAC3B,EAAAA,EAAE,YAAW,EAAG,QAAQ,CAACO,MAAM;AAC3B,IAAAC,EAAmBD,CAAC;AAAA,EACxB,CAAC,GACDP,EAAE,YAAW,EAAG,QAAQ,CAACS,MAAM;AAC3B,IAAAD,EAAmBC,CAAC;AAAA,EACxB,CAAC;AACL,GACMD,IAAqB,CAACE,MAAS;AACjC,QAAMC,IAAID,EAAK,KAAK;AACpB,EAAAA,EAAK,KAAK,QAAQA,EAAK,KAAK,QAC5BA,EAAK,KAAK,SAASC;AACvB,GACMN,IAAW,CAACL,MAAM;AACpB,EAAAA,EAAE,YAAW,EAAG,QAAQ,CAACO,MAAM;AAC3B,IAAAK,EAAYL,EAAE,IAAI;AAAA,EACtB,CAAC,GACDP,EAAE,YAAW,EAAG,QAAQ,CAACa,MAAS;AAC9B,QAAIC;AACJ,KAACA,IAAKD,EAAK,KAAK,YAAY,QAAQC,MAAO,UAAkBA,EAAG,QAAQ,CAACC,MAAUH,EAAYG,CAAK,CAAC,GACjGF,EAAK,KAAK,eAAe,GAAG,KAC5BD,EAAYC,EAAK,IAAI;AAAA,EAE7B,CAAC;AACL,GACMD,IAAc,CAACF,MAAS;AAC1B,EAAIA,KAAS,QAAmCA,EAAK,MACjDA,EAAK,IAAI,CAACA,EAAK;AAEvB,GACMJ,IAAS,CAACN,MAAM;AAClB,EAAAA,EAAE,YAAW,EAAG,QAAQ,CAACO,MAAM;AAC3B,IAAAS,EAAUT,EAAE,IAAI;AAAA,EACpB,CAAC,GACDP,EAAE,YAAW,EAAG,QAAQ,CAACa,MAAS;AAC9B,QAAIC;AACJ,KAACA,IAAKD,EAAK,KAAK,YAAY,QAAQC,MAAO,UAAkBA,EAAG,QAAQ,CAACC,MAAUC,EAAUD,CAAK,CAAC,GAC/FF,EAAK,KAAK,eAAe,GAAG,KAC5BG,EAAUH,EAAK,IAAI;AAAA,EAE3B,CAAC;AACL,GACMG,IAAY,CAACN,MAAS;AACxB,QAAMO,IAAIP,EAAK;AACf,EAAAA,EAAK,IAAIA,EAAK,GACdA,EAAK,IAAIO;AACb;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/algorithm/antv-dagre/data/list.js

@@ -0,0 +1,32 @@
+const o = (s, t) => {
+  if (s !== "next" && s !== "prev")
+    return t;
+}, n = (s) => {
+  s.prev.next = s.next, s.next.prev = s.prev, delete s.next, delete s.prev;
+};
+let u = class {
+  constructor() {
+    const t = {};
+    t.prev = t, t.next = t.prev, this.shortcut = t;
+  }
+  dequeue() {
+    const t = this.shortcut, e = t.prev;
+    if (e && e !== t)
+      return n(e), e;
+  }
+  enqueue(t) {
+    const e = this.shortcut;
+    t.prev && t.next && n(t), t.next = e.next, e.next.prev = t, e.next = t, t.prev = e;
+  }
+  toString() {
+    const t = [], e = this.shortcut;
+    let r = e.prev;
+    for (; r !== e; )
+      t.push(JSON.stringify(r, o)), r = r == null ? void 0 : r.prev;
+    return `[${t.join(", ")}]`;
+  }
+};
+export {
+  u as default
+};
+//# sourceMappingURL=list.js.map

package/dist/node_modules/@antv/layout/lib/algorithm/antv-dagre/data/list.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"list.js","sources":["../../../../../../../../node_modules/@antv/layout/lib/algorithm/antv-dagre/data/list.js"],"sourcesContent":["const filterOutLinks = (k, v) => {\n    if (k !== 'next' && k !== 'prev') {\n        return v;\n    }\n};\nconst unlink = (entry) => {\n    entry.prev.next = entry.next;\n    entry.next.prev = entry.prev;\n    delete entry.next;\n    delete entry.prev;\n};\nlet List$1 = class List {\n    constructor() {\n        const shortcut = {};\n        shortcut.prev = shortcut;\n        shortcut.next = shortcut.prev;\n        this.shortcut = shortcut;\n    }\n    dequeue() {\n        const shortcut = this.shortcut;\n        const entry = shortcut.prev;\n        if (entry && entry !== shortcut) {\n            unlink(entry);\n            return entry;\n        }\n    }\n    enqueue(entry) {\n        const shortcut = this.shortcut;\n        if (entry.prev && entry.next) {\n            unlink(entry);\n        }\n        entry.next = shortcut.next;\n        shortcut.next.prev = entry;\n        shortcut.next = entry;\n        entry.prev = shortcut;\n    }\n    toString() {\n        const strs = [];\n        const sentinel = this.shortcut;\n        let curr = sentinel.prev;\n        while (curr !== sentinel) {\n            strs.push(JSON.stringify(curr, filterOutLinks));\n            curr = curr === null || curr === void 0 ? void 0 : curr.prev;\n        }\n        return `[${strs.join(', ')}]`;\n    }\n};\n\nexport { List$1 as default };\n//# sourceMappingURL=list.js.map\n"],"names":["filterOutLinks","k","v","unlink","entry","List$1","shortcut","strs","sentinel","curr"],"mappings":"AAAA,MAAMA,IAAiB,CAACC,GAAGC,MAAM;AAC7B,MAAID,MAAM,UAAUA,MAAM;AACtB,WAAOC;AAEf,GACMC,IAAS,CAACC,MAAU;AACtB,EAAAA,EAAM,KAAK,OAAOA,EAAM,MACxBA,EAAM,KAAK,OAAOA,EAAM,MACxB,OAAOA,EAAM,MACb,OAAOA,EAAM;AACjB;AACG,IAACC,IAAS,MAAW;AAAA,EACpB,cAAc;AACV,UAAMC,IAAW,CAAA;AACjB,IAAAA,EAAS,OAAOA,GAChBA,EAAS,OAAOA,EAAS,MACzB,KAAK,WAAWA;AAAA,EACpB;AAAA,EACA,UAAU;AACN,UAAMA,IAAW,KAAK,UAChBF,IAAQE,EAAS;AACvB,QAAIF,KAASA,MAAUE;AACnB,aAAAH,EAAOC,CAAK,GACLA;AAAA,EAEf;AAAA,EACA,QAAQA,GAAO;AACX,UAAME,IAAW,KAAK;AACtB,IAAIF,EAAM,QAAQA,EAAM,QACpBD,EAAOC,CAAK,GAEhBA,EAAM,OAAOE,EAAS,MACtBA,EAAS,KAAK,OAAOF,GACrBE,EAAS,OAAOF,GAChBA,EAAM,OAAOE;AAAA,EACjB;AAAA,EACA,WAAW;AACP,UAAMC,IAAO,CAAA,GACPC,IAAW,KAAK;AACtB,QAAIC,IAAOD,EAAS;AACpB,WAAOC,MAASD;AACZ,MAAAD,EAAK,KAAK,KAAK,UAAUE,GAAMT,CAAc,CAAC,GAC9CS,IAAOA,KAAS,OAA0B,SAASA,EAAK;AAE5D,WAAO,IAAIF,EAAK,KAAK,IAAI,CAAC;AAAA,EAC9B;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/algorithm/antv-dagre/graph.js

@@ -0,0 +1,304 @@
+class c {
+  constructor(e = {}) {
+    this.options = e, this.nodes = /* @__PURE__ */ new Map(), this.edges = /* @__PURE__ */ new Map(), this.inEdges = /* @__PURE__ */ new Map(), this.outEdges = /* @__PURE__ */ new Map(), this.parentMap = /* @__PURE__ */ new Map(), this.childrenMap = /* @__PURE__ */ new Map(), e.tree && Array.isArray(e.tree) && e.tree.length > 0 && (typeof e.tree[0] == "string" ? e.tree.forEach((t) => {
+      this.parentMap.set(t, /* @__PURE__ */ new Map()), this.childrenMap.set(t, /* @__PURE__ */ new Map());
+    }) : (this.attachTreeStructure("default"), this.addTree(e.tree))), e.nodes && e.nodes.forEach((t) => this.addNode(t)), e.edges && e.edges.forEach((t) => this.addEdge(t));
+  }
+  /**
+   * <zh/> 添加节点
+   *
+   * <en/> Add a node
+   */
+  addNode(e) {
+    this.nodes.has(e.id) || (this.nodes.set(e.id, e), this.inEdges.set(e.id, /* @__PURE__ */ new Set()), this.outEdges.set(e.id, /* @__PURE__ */ new Set()));
+  }
+  /**
+   * <zh/> 批量添加节点
+   *
+   * <en/> Add multiple nodes
+   */
+  addNodes(e) {
+    e.forEach((t) => this.addNode(t));
+  }
+  /**
+   * <zh/> 获取节点
+   *
+   * <en/> Get a node
+   */
+  getNode(e) {
+    return this.nodes.get(e);
+  }
+  /**
+   * <zh/> 检查节点是否存在
+   *
+   * <en/> Check if a node exists
+   */
+  hasNode(e) {
+    return this.nodes.has(e);
+  }
+  /**
+   * <zh/> 删除节点
+   *
+   * <en/> Remove a node
+   */
+  removeNode(e) {
+    if (!this.nodes.has(e))
+      return;
+    const t = Array.from(this.inEdges.get(e) || []), s = Array.from(this.outEdges.get(e) || []);
+    t.forEach((r) => this.removeEdge(r)), s.forEach((r) => this.removeEdge(r)), this.nodes.delete(e), this.inEdges.delete(e), this.outEdges.delete(e), this.parentMap.forEach((r) => {
+      r.delete(e);
+    }), this.childrenMap.forEach((r) => {
+      r.delete(e);
+    });
+  }
+  /**
+   * <zh/> 获取所有节点
+   *
+   * <en/> Get all nodes
+   */
+  getAllNodes() {
+    return Array.from(this.nodes.values());
+  }
+  /**
+   * <zh/> 添加边
+   *
+   * <en/> Add an edge
+   */
+  addEdge(e) {
+    if (!this.nodes.has(e.source) || !this.nodes.has(e.target))
+      throw new Error(`Cannot add edge ${e.id}: source ${e.source} or target ${e.target} does not exist`);
+    this.edges.set(e.id, e), this.outEdges.get(e.source).add(e.id), this.inEdges.get(e.target).add(e.id);
+  }
+  /**
+   * <zh/> 批量添加边
+   *
+   * <en/> Add multiple edges
+   */
+  addEdges(e) {
+    e.forEach((t) => this.addEdge(t));
+  }
+  /**
+   * <zh/> 获取边
+   *
+   * <en/> Get an edge
+   */
+  getEdge(e) {
+    return this.edges.get(e);
+  }
+  /**
+   * <zh/> 检查边是否存在
+   *
+   * <en/> Check if an edge exists
+   */
+  hasEdge(e) {
+    return this.edges.has(e);
+  }
+  /**
+   * <zh/> 删除边
+   *
+   * <en/> Remove an edge
+   */
+  removeEdge(e) {
+    var t, s;
+    const r = this.edges.get(e);
+    r && (this.edges.delete(e), (t = this.outEdges.get(r.source)) === null || t === void 0 || t.delete(e), (s = this.inEdges.get(r.target)) === null || s === void 0 || s.delete(e));
+  }
+  /**
+   * <zh/> 获取所有边
+   *
+   * <en/> Get all edges
+   */
+  getAllEdges() {
+    return Array.from(this.edges.values());
+  }
+  /**
+   * <zh/> 更新边数据
+   *
+   * <en/> Update edge data
+   */
+  updateEdgeData(e, t) {
+    const s = this.edges.get(e);
+    s && Object.assign(s.data, t);
+  }
+  /**
+   * <zh/> 更新节点数据
+   *
+   * <en/> Update node data
+   */
+  updateNodeData(e, t) {
+    const s = this.nodes.get(e);
+    s && Object.assign(s.data, t);
+  }
+  /**
+   * <zh/> 获取相关边
+   *
+   * <en/> Get related edges
+   */
+  getRelatedEdges(e, t = "both") {
+    const s = [];
+    if (t === "in" || t === "both") {
+      const r = this.inEdges.get(e);
+      r && r.forEach((i) => {
+        const a = this.edges.get(i);
+        a && s.push(a);
+      });
+    }
+    if (t === "out" || t === "both") {
+      const r = this.outEdges.get(e);
+      r && r.forEach((i) => {
+        const a = this.edges.get(i);
+        a && s.push(a);
+      });
+    }
+    return s;
+  }
+  /**
+   * <zh/> 获取后继节点
+   *
+   * <en/> Get successor nodes
+   */
+  getSuccessors(e) {
+    const t = this.outEdges.get(e);
+    if (!t || t.size === 0)
+      return [];
+    const s = [];
+    return t.forEach((r) => {
+      const i = this.edges.get(r);
+      if (i) {
+        const a = this.nodes.get(i.target);
+        a && s.push(a);
+      }
+    }), s.length > 0 ? s : [];
+  }
+  /**
+   * <zh/> 获取前驱节点
+   *
+   * <en/> Get predecessor nodes
+   */
+  getPredecessors(e) {
+    const t = this.inEdges.get(e);
+    if (!t || t.size === 0)
+      return [];
+    const s = [];
+    return t.forEach((r) => {
+      const i = this.edges.get(r);
+      if (i) {
+        const a = this.nodes.get(i.source);
+        a && s.push(a);
+      }
+    }), s.length > 0 ? s : [];
+  }
+  /**
+   * <zh/> 获取邻居节点
+   *
+   * <en/> Get neighbor nodes
+   */
+  getNeighbors(e) {
+    const t = this.getSuccessors(e) || [], s = this.getPredecessors(e) || [], r = [...t, ...s], i = Array.from(new Map(r.map((a) => [a.id, a])).values());
+    return i.length > 0 ? i : [];
+  }
+  /**
+   * <zh/> 附加树结构
+   *
+   * <en/> Attach tree structure
+   */
+  attachTreeStructure(e) {
+    this.parentMap.has(e) || (this.parentMap.set(e, /* @__PURE__ */ new Map()), this.childrenMap.set(e, /* @__PURE__ */ new Map()));
+  }
+  /**
+   * <zh/> 添加树结构（递归添加节点及其子节点）
+   *
+   * <en/> Add tree structure (recursively add nodes and their children)
+   */
+  addTree(e, t) {
+    var s, r;
+    const i = t || ((r = (s = this.options.tree) === null || s === void 0 ? void 0 : s[0]) !== null && r !== void 0 ? r : "default");
+    this.hasTreeStructure(i) || this.attachTreeStructure(i);
+    const a = Array.isArray(e) ? e : [e], n = (d, h) => {
+      this.addNode({ id: d.id, data: d.data }), h !== void 0 && this.setParent(d.id, h, i), d.children && d.children.length > 0 && d.children.forEach((o) => {
+        n(o, d.id);
+      });
+    };
+    a.forEach((d) => n(d));
+  }
+  /**
+   * <zh/> 检查是否有树结构
+   *
+   * <en/> Check if has tree structure
+   */
+  hasTreeStructure(e) {
+    return this.parentMap.has(e);
+  }
+  /**
+   * <zh/> 设置父节点
+   *
+   * <en/> Set parent node
+   */
+  setParent(e, t, s) {
+    var r, i, a;
+    const n = s || ((i = (r = this.options.tree) === null || r === void 0 ? void 0 : r[0]) !== null && i !== void 0 ? i : "default");
+    this.parentMap.has(n) || this.attachTreeStructure(n);
+    const d = this.parentMap.get(n), h = this.childrenMap.get(n), o = d.get(e);
+    o !== void 0 && ((a = h.get(o)) === null || a === void 0 || a.delete(e)), d.set(e, t), h.has(t) || h.set(t, /* @__PURE__ */ new Set()), h.get(t).add(e);
+  }
+  /**
+   * <zh/> 获取父节点
+   *
+   * <en/> Get parent node
+   */
+  getParent(e, t) {
+    var s, r;
+    const i = t || ((r = (s = this.options.tree) === null || s === void 0 ? void 0 : s[0]) !== null && r !== void 0 ? r : "default");
+    this.parentMap.has(i) || this.attachTreeStructure(i);
+    const a = this.parentMap.get(i);
+    if (!a)
+      return;
+    const n = a.get(e);
+    return n === void 0 ? null : this.nodes.get(n);
+  }
+  /**
+   * <zh/> 获取子节点
+   *
+   * <en/> Get children nodes
+   */
+  getChildren(e, t) {
+    var s, r;
+    const i = t || ((r = (s = this.options.tree) === null || s === void 0 ? void 0 : s[0]) !== null && r !== void 0 ? r : "default"), a = this.childrenMap.get(i);
+    if (!a)
+      return [];
+    const n = a.get(e);
+    return n ? Array.from(n).map((d) => this.nodes.get(d)).filter((d) => d !== void 0) : [];
+  }
+  /**
+   * <zh/> 获取根节点（没有父节点的节点）
+   *
+   * <en/> Get root nodes (nodes without parents)
+   */
+  getRoots(e) {
+    var t, s;
+    const r = e || ((s = (t = this.options.tree) === null || t === void 0 ? void 0 : t[0]) !== null && s !== void 0 ? s : "default"), i = this.parentMap.get(r), a = [];
+    return this.nodes.forEach((n) => {
+      i && i.get(n.id) !== void 0 || a.push(n);
+    }), a;
+  }
+  dfsTree(e, t) {
+    const s = [e], r = /* @__PURE__ */ new Set();
+    for (; s.length > 0; ) {
+      const i = s.pop();
+      if (r.has(i))
+        continue;
+      const a = this.getNode(i);
+      if (a) {
+        if (r.add(i), t(a) === !0)
+          continue;
+        const d = this.getChildren(i);
+        for (let h = d.length - 1; h >= 0; h--)
+          r.has(d[h].id) || s.push(d[h].id);
+      }
+    }
+  }
+}
+export {
+  c as DagreGraph
+};
+//# sourceMappingURL=graph.js.map

package/dist/node_modules/@antv/layout/lib/algorithm/antv-dagre/graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/antv-dagre/graph.js"],"sourcesContent":["/**\n * <zh/> 内部图数据结构，用于 antv-dagre 布局算法\n *\n * <en/> Internal graph data structure for antv-dagre layout algorithm\n */\nclass DagreGraph {\n    constructor(options = {}) {\n        this.options = options;\n        this.nodes = new Map();\n        this.edges = new Map();\n        this.inEdges = new Map();\n        this.outEdges = new Map();\n        this.parentMap = new Map(); // tree structure name -> node -> parent\n        this.childrenMap = new Map(); // tree structure name -> node -> children\n        // Initialize tree structures\n        if (options.tree) {\n            if (Array.isArray(options.tree) && options.tree.length > 0) {\n                // Check if it's a tree name array or tree data array\n                if (typeof options.tree[0] === 'string') {\n                    // It's a tree name array\n                    options.tree.forEach((treeName) => {\n                        this.parentMap.set(treeName, new Map());\n                        this.childrenMap.set(treeName, new Map());\n                    });\n                }\n                else {\n                    // It's tree data, add it\n                    this.attachTreeStructure('default');\n                    this.addTree(options.tree);\n                }\n            }\n        }\n        // Add initial nodes and edges if provided\n        if (options.nodes) {\n            options.nodes.forEach((node) => this.addNode(node));\n        }\n        if (options.edges) {\n            options.edges.forEach((edge) => this.addEdge(edge));\n        }\n    }\n    /**\n     * <zh/> 添加节点\n     *\n     * <en/> Add a node\n     */\n    addNode(node) {\n        if (!this.nodes.has(node.id)) {\n            this.nodes.set(node.id, node);\n            this.inEdges.set(node.id, new Set());\n            this.outEdges.set(node.id, new Set());\n        }\n    }\n    /**\n     * <zh/> 批量添加节点\n     *\n     * <en/> Add multiple nodes\n     */\n    addNodes(nodes) {\n        nodes.forEach((node) => this.addNode(node));\n    }\n    /**\n     * <zh/> 获取节点\n     *\n     * <en/> Get a node\n     */\n    getNode(id) {\n        return this.nodes.get(id);\n    }\n    /**\n     * <zh/> 检查节点是否存在\n     *\n     * <en/> Check if a node exists\n     */\n    hasNode(id) {\n        return this.nodes.has(id);\n    }\n    /**\n     * <zh/> 删除节点\n     *\n     * <en/> Remove a node\n     */\n    removeNode(id) {\n        if (!this.nodes.has(id))\n            return;\n        // Remove all edges connected to this node\n        const inEdgeIds = Array.from(this.inEdges.get(id) || []);\n        const outEdgeIds = Array.from(this.outEdges.get(id) || []);\n        inEdgeIds.forEach((edgeId) => this.removeEdge(edgeId));\n        outEdgeIds.forEach((edgeId) => this.removeEdge(edgeId));\n        this.nodes.delete(id);\n        this.inEdges.delete(id);\n        this.outEdges.delete(id);\n        // Remove from tree structures\n        this.parentMap.forEach((treeParentMap) => {\n            treeParentMap.delete(id);\n        });\n        this.childrenMap.forEach((treeChildrenMap) => {\n            treeChildrenMap.delete(id);\n        });\n    }\n    /**\n     * <zh/> 获取所有节点\n     *\n     * <en/> Get all nodes\n     */\n    getAllNodes() {\n        return Array.from(this.nodes.values());\n    }\n    /**\n     * <zh/> 添加边\n     *\n     * <en/> Add an edge\n     */\n    addEdge(edge) {\n        if (!this.nodes.has(edge.source) || !this.nodes.has(edge.target)) {\n            throw new Error(`Cannot add edge ${edge.id}: source ${edge.source} or target ${edge.target} does not exist`);\n        }\n        this.edges.set(edge.id, edge);\n        this.outEdges.get(edge.source).add(edge.id);\n        this.inEdges.get(edge.target).add(edge.id);\n    }\n    /**\n     * <zh/> 批量添加边\n     *\n     * <en/> Add multiple edges\n     */\n    addEdges(edges) {\n        edges.forEach((edge) => this.addEdge(edge));\n    }\n    /**\n     * <zh/> 获取边\n     *\n     * <en/> Get an edge\n     */\n    getEdge(id) {\n        return this.edges.get(id);\n    }\n    /**\n     * <zh/> 检查边是否存在\n     *\n     * <en/> Check if an edge exists\n     */\n    hasEdge(id) {\n        return this.edges.has(id);\n    }\n    /**\n     * <zh/> 删除边\n     *\n     * <en/> Remove an edge\n     */\n    removeEdge(id) {\n        var _a, _b;\n        const edge = this.edges.get(id);\n        if (!edge)\n            return;\n        this.edges.delete(id);\n        (_a = this.outEdges.get(edge.source)) === null || _a === void 0 ? void 0 : _a.delete(id);\n        (_b = this.inEdges.get(edge.target)) === null || _b === void 0 ? void 0 : _b.delete(id);\n    }\n    /**\n     * <zh/> 获取所有边\n     *\n     * <en/> Get all edges\n     */\n    getAllEdges() {\n        return Array.from(this.edges.values());\n    }\n    /**\n     * <zh/> 更新边数据\n     *\n     * <en/> Update edge data\n     */\n    updateEdgeData(id, data) {\n        const edge = this.edges.get(id);\n        if (edge) {\n            Object.assign(edge.data, data);\n        }\n    }\n    /**\n     * <zh/> 更新节点数据\n     *\n     * <en/> Update node data\n     */\n    updateNodeData(id, data) {\n        const node = this.nodes.get(id);\n        if (node) {\n            Object.assign(node.data, data);\n        }\n    }\n    /**\n     * <zh/> 获取相关边\n     *\n     * <en/> Get related edges\n     */\n    getRelatedEdges(nodeId, direction = 'both') {\n        const result = [];\n        if (direction === 'in' || direction === 'both') {\n            const inEdgeIds = this.inEdges.get(nodeId);\n            if (inEdgeIds) {\n                inEdgeIds.forEach((edgeId) => {\n                    const edge = this.edges.get(edgeId);\n                    if (edge)\n                        result.push(edge);\n                });\n            }\n        }\n        if (direction === 'out' || direction === 'both') {\n            const outEdgeIds = this.outEdges.get(nodeId);\n            if (outEdgeIds) {\n                outEdgeIds.forEach((edgeId) => {\n                    const edge = this.edges.get(edgeId);\n                    if (edge)\n                        result.push(edge);\n                });\n            }\n        }\n        return result;\n    }\n    /**\n     * <zh/> 获取后继节点\n     *\n     * <en/> Get successor nodes\n     */\n    getSuccessors(nodeId) {\n        const outEdgeIds = this.outEdges.get(nodeId);\n        if (!outEdgeIds || outEdgeIds.size === 0)\n            return [];\n        const successors = [];\n        outEdgeIds.forEach((edgeId) => {\n            const edge = this.edges.get(edgeId);\n            if (edge) {\n                const targetNode = this.nodes.get(edge.target);\n                if (targetNode)\n                    successors.push(targetNode);\n            }\n        });\n        return successors.length > 0 ? successors : [];\n    }\n    /**\n     * <zh/> 获取前驱节点\n     *\n     * <en/> Get predecessor nodes\n     */\n    getPredecessors(nodeId) {\n        const inEdgeIds = this.inEdges.get(nodeId);\n        if (!inEdgeIds || inEdgeIds.size === 0)\n            return [];\n        const predecessors = [];\n        inEdgeIds.forEach((edgeId) => {\n            const edge = this.edges.get(edgeId);\n            if (edge) {\n                const sourceNode = this.nodes.get(edge.source);\n                if (sourceNode)\n                    predecessors.push(sourceNode);\n            }\n        });\n        return predecessors.length > 0 ? predecessors : [];\n    }\n    /**\n     * <zh/> 获取邻居节点\n     *\n     * <en/> Get neighbor nodes\n     */\n    getNeighbors(nodeId) {\n        const successors = this.getSuccessors(nodeId) || [];\n        const predecessors = this.getPredecessors(nodeId) || [];\n        const neighbors = [...successors, ...predecessors];\n        // Remove duplicates\n        const uniqueNeighbors = Array.from(new Map(neighbors.map((n) => [n.id, n])).values());\n        return uniqueNeighbors.length > 0 ? uniqueNeighbors : [];\n    }\n    /**\n     * <zh/> 附加树结构\n     *\n     * <en/> Attach tree structure\n     */\n    attachTreeStructure(treeName) {\n        if (!this.parentMap.has(treeName)) {\n            this.parentMap.set(treeName, new Map());\n            this.childrenMap.set(treeName, new Map());\n        }\n    }\n    /**\n     * <zh/> 添加树结构（递归添加节点及其子节点）\n     *\n     * <en/> Add tree structure (recursively add nodes and their children)\n     */\n    addTree(tree, treeName) {\n        var _a, _b;\n        const actualTreeName = treeName || ((_b = (_a = this.options.tree) === null || _a === void 0 ? void 0 : _a[0]) !== null && _b !== void 0 ? _b : 'default');\n        if (!this.hasTreeStructure(actualTreeName)) {\n            this.attachTreeStructure(actualTreeName);\n        }\n        const trees = Array.isArray(tree) ? tree : [tree];\n        const addTreeNode = (node, parentId) => {\n            // Add the node itself\n            this.addNode({ id: node.id, data: node.data });\n            // Set parent relationship if parent exists\n            if (parentId !== undefined) {\n                this.setParent(node.id, parentId, actualTreeName);\n            }\n            // Recursively add children\n            if (node.children && node.children.length > 0) {\n                node.children.forEach((child) => {\n                    addTreeNode(child, node.id);\n                });\n            }\n        };\n        trees.forEach((t) => addTreeNode(t));\n    }\n    /**\n     * <zh/> 检查是否有树结构\n     *\n     * <en/> Check if has tree structure\n     */\n    hasTreeStructure(treeName) {\n        return this.parentMap.has(treeName);\n    }\n    /**\n     * <zh/> 设置父节点\n     *\n     * <en/> Set parent node\n     */\n    setParent(childId, parentId, treeName) {\n        var _a, _b, _c;\n        const actualTreeName = treeName || ((_b = (_a = this.options.tree) === null || _a === void 0 ? void 0 : _a[0]) !== null && _b !== void 0 ? _b : 'default');\n        if (!this.parentMap.has(actualTreeName)) {\n            this.attachTreeStructure(actualTreeName);\n        }\n        const treeParentMap = this.parentMap.get(actualTreeName);\n        const treeChildrenMap = this.childrenMap.get(actualTreeName);\n        // Remove from old parent\n        const oldParent = treeParentMap.get(childId);\n        if (oldParent !== undefined) {\n            (_c = treeChildrenMap.get(oldParent)) === null || _c === void 0 ? void 0 : _c.delete(childId);\n        }\n        // Set new parent\n        treeParentMap.set(childId, parentId);\n        // Add to new parent's children\n        if (!treeChildrenMap.has(parentId)) {\n            treeChildrenMap.set(parentId, new Set());\n        }\n        treeChildrenMap.get(parentId).add(childId);\n    }\n    /**\n     * <zh/> 获取父节点\n     *\n     * <en/> Get parent node\n     */\n    getParent(nodeId, treeName) {\n        var _a, _b;\n        const actualTreeName = treeName || ((_b = (_a = this.options.tree) === null || _a === void 0 ? void 0 : _a[0]) !== null && _b !== void 0 ? _b : 'default');\n        // Ensure tree structure exists\n        if (!this.parentMap.has(actualTreeName)) {\n            this.attachTreeStructure(actualTreeName);\n        }\n        const treeParentMap = this.parentMap.get(actualTreeName);\n        if (!treeParentMap)\n            return undefined;\n        const parentId = treeParentMap.get(nodeId);\n        if (parentId === undefined) {\n            // Node has no parent set\n            return null;\n        }\n        return this.nodes.get(parentId);\n    }\n    /**\n     * <zh/> 获取子节点\n     *\n     * <en/> Get children nodes\n     */\n    getChildren(nodeId, treeName) {\n        var _a, _b;\n        const actualTreeName = treeName || ((_b = (_a = this.options.tree) === null || _a === void 0 ? void 0 : _a[0]) !== null && _b !== void 0 ? _b : 'default');\n        const treeChildrenMap = this.childrenMap.get(actualTreeName);\n        if (!treeChildrenMap)\n            return [];\n        const childIds = treeChildrenMap.get(nodeId);\n        if (!childIds)\n            return [];\n        return Array.from(childIds)\n            .map((id) => this.nodes.get(id))\n            .filter((node) => node !== undefined);\n    }\n    /**\n     * <zh/> 获取根节点（没有父节点的节点）\n     *\n     * <en/> Get root nodes (nodes without parents)\n     */\n    getRoots(treeName) {\n        var _a, _b;\n        const actualTreeName = treeName || ((_b = (_a = this.options.tree) === null || _a === void 0 ? void 0 : _a[0]) !== null && _b !== void 0 ? _b : 'default');\n        const treeParentMap = this.parentMap.get(actualTreeName);\n        const roots = [];\n        this.nodes.forEach((node) => {\n            const hasParent = treeParentMap && treeParentMap.get(node.id) !== undefined;\n            if (!hasParent) {\n                roots.push(node);\n            }\n        });\n        return roots;\n    }\n    dfsTree(startId, visit) {\n        const stack = [startId];\n        const visited = new Set();\n        while (stack.length > 0) {\n            const nodeId = stack.pop();\n            if (visited.has(nodeId))\n                continue;\n            const node = this.getNode(nodeId);\n            if (node) {\n                visited.add(nodeId);\n                const shouldSkipChildren = visit(node);\n                if (shouldSkipChildren === true)\n                    continue;\n                const children = this.getChildren(nodeId);\n                // Push children in reverse order so they are processed in the correct order\n                for (let i = children.length - 1; i >= 0; i--) {\n                    if (!visited.has(children[i].id)) {\n                        stack.push(children[i].id);\n                    }\n                }\n            }\n        }\n    }\n}\n\nexport { DagreGraph };\n//# sourceMappingURL=graph.js.map\n"],"names":["DagreGraph","options","treeName","node","edge","nodes","id","inEdgeIds","outEdgeIds","edgeId","treeParentMap","treeChildrenMap","edges","_a","_b","data","nodeId","direction","result","successors","targetNode","predecessors","sourceNode","neighbors","uniqueNeighbors","n","tree","actualTreeName","trees","addTreeNode","parentId","child","t","childId","_c","oldParent","childIds","roots","startId","visit","stack","visited","children","i"],"mappings":"AAKA,MAAMA,EAAW;AAAA,EACb,YAAYC,IAAU,IAAI;AACtB,SAAK,UAAUA,GACf,KAAK,QAAQ,oBAAI,IAAG,GACpB,KAAK,QAAQ,oBAAI,IAAG,GACpB,KAAK,UAAU,oBAAI,IAAG,GACtB,KAAK,WAAW,oBAAI,IAAG,GACvB,KAAK,YAAY,oBAAI,OACrB,KAAK,cAAc,oBAAI,OAEnBA,EAAQ,QACJ,MAAM,QAAQA,EAAQ,IAAI,KAAKA,EAAQ,KAAK,SAAS,MAEjD,OAAOA,EAAQ,KAAK,CAAC,KAAM,WAE3BA,EAAQ,KAAK,QAAQ,CAACC,MAAa;AAC/B,WAAK,UAAU,IAAIA,GAAU,oBAAI,IAAG,CAAE,GACtC,KAAK,YAAY,IAAIA,GAAU,oBAAI,IAAG,CAAE;AAAA,IAC5C,CAAC,KAID,KAAK,oBAAoB,SAAS,GAClC,KAAK,QAAQD,EAAQ,IAAI,KAKjCA,EAAQ,SACRA,EAAQ,MAAM,QAAQ,CAACE,MAAS,KAAK,QAAQA,CAAI,CAAC,GAElDF,EAAQ,SACRA,EAAQ,MAAM,QAAQ,CAACG,MAAS,KAAK,QAAQA,CAAI,CAAC;AAAA,EAE1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQD,GAAM;AACV,IAAK,KAAK,MAAM,IAAIA,EAAK,EAAE,MACvB,KAAK,MAAM,IAAIA,EAAK,IAAIA,CAAI,GAC5B,KAAK,QAAQ,IAAIA,EAAK,IAAI,oBAAI,KAAK,GACnC,KAAK,SAAS,IAAIA,EAAK,IAAI,oBAAI,KAAK;AAAA,EAE5C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAASE,GAAO;AACZ,IAAAA,EAAM,QAAQ,CAACF,MAAS,KAAK,QAAQA,CAAI,CAAC;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQG,GAAI;AACR,WAAO,KAAK,MAAM,IAAIA,CAAE;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQA,GAAI;AACR,WAAO,KAAK,MAAM,IAAIA,CAAE;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAWA,GAAI;AACX,QAAI,CAAC,KAAK,MAAM,IAAIA,CAAE;AAClB;AAEJ,UAAMC,IAAY,MAAM,KAAK,KAAK,QAAQ,IAAID,CAAE,KAAK,EAAE,GACjDE,IAAa,MAAM,KAAK,KAAK,SAAS,IAAIF,CAAE,KAAK,EAAE;AACzD,IAAAC,EAAU,QAAQ,CAACE,MAAW,KAAK,WAAWA,CAAM,CAAC,GACrDD,EAAW,QAAQ,CAACC,MAAW,KAAK,WAAWA,CAAM,CAAC,GACtD,KAAK,MAAM,OAAOH,CAAE,GACpB,KAAK,QAAQ,OAAOA,CAAE,GACtB,KAAK,SAAS,OAAOA,CAAE,GAEvB,KAAK,UAAU,QAAQ,CAACI,MAAkB;AACtC,MAAAA,EAAc,OAAOJ,CAAE;AAAA,IAC3B,CAAC,GACD,KAAK,YAAY,QAAQ,CAACK,MAAoB;AAC1C,MAAAA,EAAgB,OAAOL,CAAE;AAAA,IAC7B,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAc;AACV,WAAO,MAAM,KAAK,KAAK,MAAM,OAAM,CAAE;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQF,GAAM;AACV,QAAI,CAAC,KAAK,MAAM,IAAIA,EAAK,MAAM,KAAK,CAAC,KAAK,MAAM,IAAIA,EAAK,MAAM;AAC3D,YAAM,IAAI,MAAM,mBAAmBA,EAAK,EAAE,YAAYA,EAAK,MAAM,cAAcA,EAAK,MAAM,iBAAiB;AAE/G,SAAK,MAAM,IAAIA,EAAK,IAAIA,CAAI,GAC5B,KAAK,SAAS,IAAIA,EAAK,MAAM,EAAE,IAAIA,EAAK,EAAE,GAC1C,KAAK,QAAQ,IAAIA,EAAK,MAAM,EAAE,IAAIA,EAAK,EAAE;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAASQ,GAAO;AACZ,IAAAA,EAAM,QAAQ,CAACR,MAAS,KAAK,QAAQA,CAAI,CAAC;AAAA,EAC9C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQE,GAAI;AACR,WAAO,KAAK,MAAM,IAAIA,CAAE;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQA,GAAI;AACR,WAAO,KAAK,MAAM,IAAIA,CAAE;AAAA,EAC5B;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,WAAWA,GAAI;AACX,QAAIO,GAAIC;AACR,UAAMV,IAAO,KAAK,MAAM,IAAIE,CAAE;AAC9B,IAAKF,MAEL,KAAK,MAAM,OAAOE,CAAE,IACnBO,IAAK,KAAK,SAAS,IAAIT,EAAK,MAAM,OAAO,QAAQS,MAAO,UAAkBA,EAAG,OAAOP,CAAE,IACtFQ,IAAK,KAAK,QAAQ,IAAIV,EAAK,MAAM,OAAO,QAAQU,MAAO,UAAkBA,EAAG,OAAOR,CAAE;AAAA,EAC1F;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAc;AACV,WAAO,MAAM,KAAK,KAAK,MAAM,OAAM,CAAE;AAAA,EACzC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,eAAeA,GAAIS,GAAM;AACrB,UAAMX,IAAO,KAAK,MAAM,IAAIE,CAAE;AAC9B,IAAIF,KACA,OAAO,OAAOA,EAAK,MAAMW,CAAI;AAAA,EAErC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,eAAeT,GAAIS,GAAM;AACrB,UAAMZ,IAAO,KAAK,MAAM,IAAIG,CAAE;AAC9B,IAAIH,KACA,OAAO,OAAOA,EAAK,MAAMY,CAAI;AAAA,EAErC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAAgBC,GAAQC,IAAY,QAAQ;AACxC,UAAMC,IAAS,CAAA;AACf,QAAID,MAAc,QAAQA,MAAc,QAAQ;AAC5C,YAAMV,IAAY,KAAK,QAAQ,IAAIS,CAAM;AACzC,MAAIT,KACAA,EAAU,QAAQ,CAACE,MAAW;AAC1B,cAAML,IAAO,KAAK,MAAM,IAAIK,CAAM;AAClC,QAAIL,KACAc,EAAO,KAAKd,CAAI;AAAA,MACxB,CAAC;AAAA,IAET;AACA,QAAIa,MAAc,SAASA,MAAc,QAAQ;AAC7C,YAAMT,IAAa,KAAK,SAAS,IAAIQ,CAAM;AAC3C,MAAIR,KACAA,EAAW,QAAQ,CAACC,MAAW;AAC3B,cAAML,IAAO,KAAK,MAAM,IAAIK,CAAM;AAClC,QAAIL,KACAc,EAAO,KAAKd,CAAI;AAAA,MACxB,CAAC;AAAA,IAET;AACA,WAAOc;AAAA,EACX;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,cAAcF,GAAQ;AAClB,UAAMR,IAAa,KAAK,SAAS,IAAIQ,CAAM;AAC3C,QAAI,CAACR,KAAcA,EAAW,SAAS;AACnC,aAAO,CAAA;AACX,UAAMW,IAAa,CAAA;AACnB,WAAAX,EAAW,QAAQ,CAACC,MAAW;AAC3B,YAAML,IAAO,KAAK,MAAM,IAAIK,CAAM;AAClC,UAAIL,GAAM;AACN,cAAMgB,IAAa,KAAK,MAAM,IAAIhB,EAAK,MAAM;AAC7C,QAAIgB,KACAD,EAAW,KAAKC,CAAU;AAAA,MAClC;AAAA,IACJ,CAAC,GACMD,EAAW,SAAS,IAAIA,IAAa,CAAA;AAAA,EAChD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,gBAAgBH,GAAQ;AACpB,UAAMT,IAAY,KAAK,QAAQ,IAAIS,CAAM;AACzC,QAAI,CAACT,KAAaA,EAAU,SAAS;AACjC,aAAO,CAAA;AACX,UAAMc,IAAe,CAAA;AACrB,WAAAd,EAAU,QAAQ,CAACE,MAAW;AAC1B,YAAML,IAAO,KAAK,MAAM,IAAIK,CAAM;AAClC,UAAIL,GAAM;AACN,cAAMkB,IAAa,KAAK,MAAM,IAAIlB,EAAK,MAAM;AAC7C,QAAIkB,KACAD,EAAa,KAAKC,CAAU;AAAA,MACpC;AAAA,IACJ,CAAC,GACMD,EAAa,SAAS,IAAIA,IAAe,CAAA;AAAA,EACpD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,aAAaL,GAAQ;AACjB,UAAMG,IAAa,KAAK,cAAcH,CAAM,KAAK,CAAA,GAC3CK,IAAe,KAAK,gBAAgBL,CAAM,KAAK,CAAA,GAC/CO,IAAY,CAAC,GAAGJ,GAAY,GAAGE,CAAY,GAE3CG,IAAkB,MAAM,KAAK,IAAI,IAAID,EAAU,IAAI,CAACE,MAAM,CAACA,EAAE,IAAIA,CAAC,CAAC,CAAC,EAAE,QAAQ;AACpF,WAAOD,EAAgB,SAAS,IAAIA,IAAkB,CAAA;AAAA,EAC1D;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,oBAAoBtB,GAAU;AAC1B,IAAK,KAAK,UAAU,IAAIA,CAAQ,MAC5B,KAAK,UAAU,IAAIA,GAAU,oBAAI,IAAG,CAAE,GACtC,KAAK,YAAY,IAAIA,GAAU,oBAAI,IAAG,CAAE;AAAA,EAEhD;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,QAAQwB,GAAMxB,GAAU;AACpB,QAAIW,GAAIC;AACR,UAAMa,IAAiBzB,OAAcY,KAAMD,IAAK,KAAK,QAAQ,UAAU,QAAQA,MAAO,SAAS,SAASA,EAAG,CAAC,OAAO,QAAQC,MAAO,SAASA,IAAK;AAChJ,IAAK,KAAK,iBAAiBa,CAAc,KACrC,KAAK,oBAAoBA,CAAc;AAE3C,UAAMC,IAAQ,MAAM,QAAQF,CAAI,IAAIA,IAAO,CAACA,CAAI,GAC1CG,IAAc,CAAC1B,GAAM2B,MAAa;AAEpC,WAAK,QAAQ,EAAE,IAAI3B,EAAK,IAAI,MAAMA,EAAK,MAAM,GAEzC2B,MAAa,UACb,KAAK,UAAU3B,EAAK,IAAI2B,GAAUH,CAAc,GAGhDxB,EAAK,YAAYA,EAAK,SAAS,SAAS,KACxCA,EAAK,SAAS,QAAQ,CAAC4B,MAAU;AAC7B,QAAAF,EAAYE,GAAO5B,EAAK,EAAE;AAAA,MAC9B,CAAC;AAAA,IAET;AACA,IAAAyB,EAAM,QAAQ,CAACI,MAAMH,EAAYG,CAAC,CAAC;AAAA,EACvC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,iBAAiB9B,GAAU;AACvB,WAAO,KAAK,UAAU,IAAIA,CAAQ;AAAA,EACtC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAU+B,GAASH,GAAU5B,GAAU;AACnC,QAAIW,GAAIC,GAAIoB;AACZ,UAAMP,IAAiBzB,OAAcY,KAAMD,IAAK,KAAK,QAAQ,UAAU,QAAQA,MAAO,SAAS,SAASA,EAAG,CAAC,OAAO,QAAQC,MAAO,SAASA,IAAK;AAChJ,IAAK,KAAK,UAAU,IAAIa,CAAc,KAClC,KAAK,oBAAoBA,CAAc;AAE3C,UAAMjB,IAAgB,KAAK,UAAU,IAAIiB,CAAc,GACjDhB,IAAkB,KAAK,YAAY,IAAIgB,CAAc,GAErDQ,IAAYzB,EAAc,IAAIuB,CAAO;AAC3C,IAAIE,MAAc,YACbD,IAAKvB,EAAgB,IAAIwB,CAAS,OAAO,QAAQD,MAAO,UAAkBA,EAAG,OAAOD,CAAO,IAGhGvB,EAAc,IAAIuB,GAASH,CAAQ,GAE9BnB,EAAgB,IAAImB,CAAQ,KAC7BnB,EAAgB,IAAImB,GAAU,oBAAI,IAAG,CAAE,GAE3CnB,EAAgB,IAAImB,CAAQ,EAAE,IAAIG,CAAO;AAAA,EAC7C;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,UAAUjB,GAAQd,GAAU;AACxB,QAAIW,GAAIC;AACR,UAAMa,IAAiBzB,OAAcY,KAAMD,IAAK,KAAK,QAAQ,UAAU,QAAQA,MAAO,SAAS,SAASA,EAAG,CAAC,OAAO,QAAQC,MAAO,SAASA,IAAK;AAEhJ,IAAK,KAAK,UAAU,IAAIa,CAAc,KAClC,KAAK,oBAAoBA,CAAc;AAE3C,UAAMjB,IAAgB,KAAK,UAAU,IAAIiB,CAAc;AACvD,QAAI,CAACjB;AACD;AACJ,UAAMoB,IAAWpB,EAAc,IAAIM,CAAM;AACzC,WAAIc,MAAa,SAEN,OAEJ,KAAK,MAAM,IAAIA,CAAQ;AAAA,EAClC;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,YAAYd,GAAQd,GAAU;AAC1B,QAAIW,GAAIC;AACR,UAAMa,IAAiBzB,OAAcY,KAAMD,IAAK,KAAK,QAAQ,UAAU,QAAQA,MAAO,SAAS,SAASA,EAAG,CAAC,OAAO,QAAQC,MAAO,SAASA,IAAK,YAC1IH,IAAkB,KAAK,YAAY,IAAIgB,CAAc;AAC3D,QAAI,CAAChB;AACD,aAAO,CAAA;AACX,UAAMyB,IAAWzB,EAAgB,IAAIK,CAAM;AAC3C,WAAKoB,IAEE,MAAM,KAAKA,CAAQ,EACrB,IAAI,CAAC9B,MAAO,KAAK,MAAM,IAAIA,CAAE,CAAC,EAC9B,OAAO,CAACH,MAASA,MAAS,MAAS,IAH7B,CAAA;AAAA,EAIf;AAAA;AAAA;AAAA;AAAA;AAAA;AAAA,EAMA,SAASD,GAAU;AACf,QAAIW,GAAIC;AACR,UAAMa,IAAiBzB,OAAcY,KAAMD,IAAK,KAAK,QAAQ,UAAU,QAAQA,MAAO,SAAS,SAASA,EAAG,CAAC,OAAO,QAAQC,MAAO,SAASA,IAAK,YAC1IJ,IAAgB,KAAK,UAAU,IAAIiB,CAAc,GACjDU,IAAQ,CAAA;AACd,gBAAK,MAAM,QAAQ,CAAClC,MAAS;AAEzB,MADkBO,KAAiBA,EAAc,IAAIP,EAAK,EAAE,MAAM,UAE9DkC,EAAM,KAAKlC,CAAI;AAAA,IAEvB,CAAC,GACMkC;AAAA,EACX;AAAA,EACA,QAAQC,GAASC,GAAO;AACpB,UAAMC,IAAQ,CAACF,CAAO,GAChBG,IAAU,oBAAI,IAAG;AACvB,WAAOD,EAAM,SAAS,KAAG;AACrB,YAAMxB,IAASwB,EAAM,IAAG;AACxB,UAAIC,EAAQ,IAAIzB,CAAM;AAClB;AACJ,YAAMb,IAAO,KAAK,QAAQa,CAAM;AAChC,UAAIb,GAAM;AAGN,YAFAsC,EAAQ,IAAIzB,CAAM,GACSuB,EAAMpC,CAAI,MACV;AACvB;AACJ,cAAMuC,IAAW,KAAK,YAAY1B,CAAM;AAExC,iBAAS2B,IAAID,EAAS,SAAS,GAAGC,KAAK,GAAGA;AACtC,UAAKF,EAAQ,IAAIC,EAASC,CAAC,EAAE,EAAE,KAC3BH,EAAM,KAAKE,EAASC,CAAC,EAAE,EAAE;AAAA,MAGrC;AAAA,IACJ;AAAA,EACJ;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/algorithm/antv-dagre/greedy-fas.js

@@ -0,0 +1,71 @@
+import f from "./data/list.js";
+import { DagreGraph as v } from "./graph.js";
+class E extends f {
+}
+const N = () => 1, q = (e, d) => {
+  var t;
+  if (e.getAllNodes().length <= 1)
+    return [];
+  const o = m(e, d || N);
+  return (t = w(o.graph, o.buckets, o.zeroIdx).map((s) => e.getRelatedEdges(s.v, "out").filter(({ target: i }) => i === s.w))) === null || t === void 0 ? void 0 : t.flat();
+}, w = (e, d, t) => {
+  let o = [];
+  const r = d[d.length - 1], s = d[0];
+  let i;
+  for (; e.getAllNodes().length; ) {
+    for (; i = s.dequeue(); )
+      c(e, d, t, i);
+    for (; i = r.dequeue(); )
+      c(e, d, t, i);
+    if (e.getAllNodes().length) {
+      for (let u = d.length - 2; u > 0; --u)
+        if (i = d[u].dequeue(), i) {
+          o = o.concat(c(e, d, t, i, !0));
+          break;
+        }
+    }
+  }
+  return o;
+}, c = (e, d, t, o, r) => {
+  var s, i;
+  const u = [];
+  return e.hasNode(o.v) && ((s = e.getRelatedEdges(o.v, "in")) === null || s === void 0 || s.forEach((a) => {
+    const l = a.data.weight, n = e.getNode(a.source);
+    r && u.push({ v: a.source, w: a.target, in: 0, out: 0 }), n.data.out === void 0 && (n.data.out = 0), n.data.out -= l, h(d, t, Object.assign({ v: n.id }, n.data));
+  }), (i = e.getRelatedEdges(o.v, "out")) === null || i === void 0 || i.forEach((a) => {
+    const l = a.data.weight, n = a.target, g = e.getNode(n);
+    g.data.in === void 0 && (g.data.in = 0), g.data.in -= l, h(d, t, Object.assign({ v: g.id }, g.data));
+  }), e.removeNode(o.v)), r ? u : void 0;
+}, m = (e, d) => {
+  const t = new v();
+  let o = 0, r = 0;
+  e.getAllNodes().forEach((a) => {
+    t.addNode({
+      id: a.id,
+      data: { v: a.id, in: 0, out: 0 }
+    });
+  }), e.getAllEdges().forEach((a) => {
+    const l = t.getRelatedEdges(a.source, "out").find((g) => g.target === a.target), n = (d == null ? void 0 : d(a)) || 1;
+    l ? t.updateEdgeData(l == null ? void 0 : l.id, Object.assign(Object.assign({}, l.data), { weight: l.data.weight + n })) : t.addEdge({
+      id: a.id,
+      source: a.source,
+      target: a.target,
+      data: {
+        weight: n
+      }
+    }), r = Math.max(r, t.getNode(a.source).data.out += n), o = Math.max(o, t.getNode(a.target).data.in += n);
+  });
+  const s = [], i = r + o + 3;
+  for (let a = 0; a < i; a++)
+    s.push(new E());
+  const u = o + 1;
+  return t.getAllNodes().forEach((a) => {
+    h(s, u, Object.assign({ v: a.id }, t.getNode(a.id).data));
+  }), { buckets: s, zeroIdx: u, graph: t };
+}, h = (e, d, t) => {
+  t.out ? t.in ? e[t.out - t.in + d].enqueue(t) : e[e.length - 1].enqueue(t) : e[0].enqueue(t);
+};
+export {
+  q as greedyFAS
+};
+//# sourceMappingURL=greedy-fas.js.map

package/dist/node_modules/@antv/layout/lib/algorithm/antv-dagre/greedy-fas.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"greedy-fas.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/antv-dagre/greedy-fas.js"],"sourcesContent":["import List$1 from './data/list.js';\nimport { DagreGraph } from './graph.js';\n\n/*\n * A greedy heuristic for finding a feedback arc set for a graph. A feedback\n * arc set is a set of edges that can be removed to make a graph acyclic.\n * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, \"A fast and\n * effective heuristic for the feedback arc set problem.\" This implementation\n * adjusts that from the paper to allow for weighted edges.\n *\n * @see https://github.com/dagrejs/dagre/blob/master/lib/greedy-fas.js\n */\nclass List extends List$1 {\n}\nconst DEFAULT_WEIGHT_FN = () => 1;\nconst greedyFAS = (g, weightFn) => {\n    var _a;\n    if (g.getAllNodes().length <= 1)\n        return [];\n    const state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);\n    const results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n    return (_a = results\n        .map((e) => g.getRelatedEdges(e.v, 'out').filter(({ target }) => target === e.w))) === null || _a === void 0 ? void 0 : _a.flat();\n};\nconst doGreedyFAS = (g, buckets, zeroIdx) => {\n    let results = [];\n    const sources = buckets[buckets.length - 1];\n    const sinks = buckets[0];\n    let entry;\n    while (g.getAllNodes().length) {\n        while ((entry = sinks.dequeue())) {\n            removeNode(g, buckets, zeroIdx, entry);\n        }\n        while ((entry = sources.dequeue())) {\n            removeNode(g, buckets, zeroIdx, entry);\n        }\n        if (g.getAllNodes().length) {\n            for (let i = buckets.length - 2; i > 0; --i) {\n                entry = buckets[i].dequeue();\n                if (entry) {\n                    results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));\n                    break;\n                }\n            }\n        }\n    }\n    return results;\n};\nconst removeNode = (g, buckets, zeroIdx, entry, collectPredecessors) => {\n    var _a, _b;\n    const results = [];\n    if (g.hasNode(entry.v)) {\n        (_a = g.getRelatedEdges(entry.v, 'in')) === null || _a === void 0 ? void 0 : _a.forEach((edge) => {\n            const weight = edge.data.weight;\n            const uEntry = g.getNode(edge.source);\n            if (collectPredecessors) {\n                // this result not really care about in or out\n                results.push({ v: edge.source, w: edge.target, in: 0, out: 0 });\n            }\n            if (uEntry.data.out === undefined)\n                uEntry.data.out = 0;\n            // @ts-ignore\n            uEntry.data.out -= weight;\n            assignBucket(buckets, zeroIdx, Object.assign({ v: uEntry.id }, uEntry.data));\n        });\n        (_b = g.getRelatedEdges(entry.v, 'out')) === null || _b === void 0 ? void 0 : _b.forEach((edge) => {\n            const weight = edge.data.weight;\n            const w = edge.target;\n            const wEntry = g.getNode(w);\n            if (wEntry.data.in === undefined)\n                wEntry.data.in = 0;\n            // @ts-ignore\n            wEntry.data.in -= weight;\n            assignBucket(buckets, zeroIdx, Object.assign({ v: wEntry.id }, wEntry.data));\n        });\n        g.removeNode(entry.v);\n    }\n    return collectPredecessors ? results : undefined;\n};\nconst buildState = (g, weightFn) => {\n    const fasGraph = new DagreGraph();\n    let maxIn = 0;\n    let maxOut = 0;\n    g.getAllNodes().forEach((v) => {\n        fasGraph.addNode({\n            id: v.id,\n            data: { v: v.id, in: 0, out: 0 },\n        });\n    });\n    // Aggregate weights on nodes, but also sum the weights across multi-edges\n    // into a single edge for the fasGraph.\n    g.getAllEdges().forEach((e) => {\n        const edge = fasGraph\n            .getRelatedEdges(e.source, 'out')\n            .find((edge) => edge.target === e.target);\n        const weight = (weightFn === null || weightFn === void 0 ? void 0 : weightFn(e)) || 1;\n        if (!edge) {\n            fasGraph.addEdge({\n                id: e.id,\n                source: e.source,\n                target: e.target,\n                data: {\n                    weight,\n                },\n            });\n        }\n        else {\n            fasGraph.updateEdgeData(edge === null || edge === void 0 ? void 0 : edge.id, Object.assign(Object.assign({}, edge.data), { weight: edge.data.weight + weight }));\n        }\n        // @ts-ignore\n        maxOut = Math.max(maxOut, (fasGraph.getNode(e.source).data.out += weight));\n        // @ts-ignore\n        maxIn = Math.max(maxIn, (fasGraph.getNode(e.target).data.in += weight));\n    });\n    const buckets = [];\n    const rangeMax = maxOut + maxIn + 3;\n    for (let i = 0; i < rangeMax; i++) {\n        buckets.push(new List());\n    }\n    const zeroIdx = maxIn + 1;\n    fasGraph.getAllNodes().forEach((v) => {\n        assignBucket(buckets, zeroIdx, Object.assign({ v: v.id }, fasGraph.getNode(v.id).data));\n    });\n    return { buckets, zeroIdx, graph: fasGraph };\n};\nconst assignBucket = (buckets, zeroIdx, entry) => {\n    if (!entry.out) {\n        buckets[0].enqueue(entry);\n    }\n    else if (!entry['in']) {\n        buckets[buckets.length - 1].enqueue(entry);\n    }\n    else {\n        buckets[entry.out - entry['in'] + zeroIdx].enqueue(entry);\n    }\n};\n\nexport { greedyFAS };\n//# sourceMappingURL=greedy-fas.js.map\n"],"names":["List","List$1","DEFAULT_WEIGHT_FN","greedyFAS","g","weightFn","_a","state","buildState","doGreedyFAS","e","target","buckets","zeroIdx","results","sources","sinks","entry","removeNode","i","collectPredecessors","_b","edge","weight","uEntry","assignBucket","w","wEntry","fasGraph","DagreGraph","maxIn","maxOut","v","rangeMax"],"mappings":";;AAYA,MAAMA,UAAaC,EAAO;AAC1B;AACA,MAAMC,IAAoB,MAAM,GAC1BC,IAAY,CAACC,GAAGC,MAAa;AAC/B,MAAIC;AACJ,MAAIF,EAAE,cAAc,UAAU;AAC1B,WAAO,CAAA;AACX,QAAMG,IAAQC,EAAWJ,GAAGC,KAAYH,CAAiB;AAEzD,UAAQI,IADQG,EAAYF,EAAM,OAAOA,EAAM,SAASA,EAAM,OAAO,EAEhE,IAAI,CAACG,MAAMN,EAAE,gBAAgBM,EAAE,GAAG,KAAK,EAAE,OAAO,CAAC,EAAE,QAAAC,EAAM,MAAOA,MAAWD,EAAE,CAAC,CAAC,OAAO,QAAQJ,MAAO,SAAS,SAASA,EAAG,KAAI;AACvI,GACMG,IAAc,CAACL,GAAGQ,GAASC,MAAY;AACzC,MAAIC,IAAU,CAAA;AACd,QAAMC,IAAUH,EAAQA,EAAQ,SAAS,CAAC,GACpCI,IAAQJ,EAAQ,CAAC;AACvB,MAAIK;AACJ,SAAOb,EAAE,YAAW,EAAG,UAAQ;AAC3B,WAAQa,IAAQD,EAAM;AAClB,MAAAE,EAAWd,GAAGQ,GAASC,GAASI,CAAK;AAEzC,WAAQA,IAAQF,EAAQ;AACpB,MAAAG,EAAWd,GAAGQ,GAASC,GAASI,CAAK;AAEzC,QAAIb,EAAE,YAAW,EAAG;AAChB,eAASe,IAAIP,EAAQ,SAAS,GAAGO,IAAI,GAAG,EAAEA;AAEtC,YADAF,IAAQL,EAAQO,CAAC,EAAE,QAAO,GACtBF,GAAO;AACP,UAAAH,IAAUA,EAAQ,OAAOI,EAAWd,GAAGQ,GAASC,GAASI,GAAO,EAAI,CAAC;AACrE;AAAA,QACJ;AAAA;AAAA,EAGZ;AACA,SAAOH;AACX,GACMI,IAAa,CAACd,GAAGQ,GAASC,GAASI,GAAOG,MAAwB;AACpE,MAAId,GAAIe;AACR,QAAMP,IAAU,CAAA;AAChB,SAAIV,EAAE,QAAQa,EAAM,CAAC,OAChBX,IAAKF,EAAE,gBAAgBa,EAAM,GAAG,IAAI,OAAO,QAAQX,MAAO,UAAkBA,EAAG,QAAQ,CAACgB,MAAS;AAC9F,UAAMC,IAASD,EAAK,KAAK,QACnBE,IAASpB,EAAE,QAAQkB,EAAK,MAAM;AACpC,IAAIF,KAEAN,EAAQ,KAAK,EAAE,GAAGQ,EAAK,QAAQ,GAAGA,EAAK,QAAQ,IAAI,GAAG,KAAK,EAAC,CAAE,GAE9DE,EAAO,KAAK,QAAQ,WACpBA,EAAO,KAAK,MAAM,IAEtBA,EAAO,KAAK,OAAOD,GACnBE,EAAab,GAASC,GAAS,OAAO,OAAO,EAAE,GAAGW,EAAO,GAAE,GAAIA,EAAO,IAAI,CAAC;AAAA,EAC/E,CAAC,IACAH,IAAKjB,EAAE,gBAAgBa,EAAM,GAAG,KAAK,OAAO,QAAQI,MAAO,UAAkBA,EAAG,QAAQ,CAACC,MAAS;AAC/F,UAAMC,IAASD,EAAK,KAAK,QACnBI,IAAIJ,EAAK,QACTK,IAASvB,EAAE,QAAQsB,CAAC;AAC1B,IAAIC,EAAO,KAAK,OAAO,WACnBA,EAAO,KAAK,KAAK,IAErBA,EAAO,KAAK,MAAMJ,GAClBE,EAAab,GAASC,GAAS,OAAO,OAAO,EAAE,GAAGc,EAAO,GAAE,GAAIA,EAAO,IAAI,CAAC;AAAA,EAC/E,CAAC,GACDvB,EAAE,WAAWa,EAAM,CAAC,IAEjBG,IAAsBN,IAAU;AAC3C,GACMN,IAAa,CAACJ,GAAGC,MAAa;AAChC,QAAMuB,IAAW,IAAIC,EAAU;AAC/B,MAAIC,IAAQ,GACRC,IAAS;AACb,EAAA3B,EAAE,YAAW,EAAG,QAAQ,CAAC4B,MAAM;AAC3B,IAAAJ,EAAS,QAAQ;AAAA,MACb,IAAII,EAAE;AAAA,MACN,MAAM,EAAE,GAAGA,EAAE,IAAI,IAAI,GAAG,KAAK,EAAC;AAAA,IAC1C,CAAS;AAAA,EACL,CAAC,GAGD5B,EAAE,YAAW,EAAG,QAAQ,CAACM,MAAM;AAC3B,UAAMY,IAAOM,EACR,gBAAgBlB,EAAE,QAAQ,KAAK,EAC/B,KAAK,CAACY,MAASA,EAAK,WAAWZ,EAAE,MAAM,GACtCa,KAAUlB,KAAa,OAA8B,SAASA,EAASK,CAAC,MAAM;AACpF,IAAKY,IAWDM,EAAS,eAAeN,KAAS,OAA0B,SAASA,EAAK,IAAI,OAAO,OAAO,OAAO,OAAO,CAAA,GAAIA,EAAK,IAAI,GAAG,EAAE,QAAQA,EAAK,KAAK,SAASC,EAAM,CAAE,CAAC,IAV/JK,EAAS,QAAQ;AAAA,MACb,IAAIlB,EAAE;AAAA,MACN,QAAQA,EAAE;AAAA,MACV,QAAQA,EAAE;AAAA,MACV,MAAM;AAAA,QACF,QAAAa;AAAA,MACpB;AAAA,IACA,CAAa,GAMLQ,IAAS,KAAK,IAAIA,GAASH,EAAS,QAAQlB,EAAE,MAAM,EAAE,KAAK,OAAOa,CAAM,GAExEO,IAAQ,KAAK,IAAIA,GAAQF,EAAS,QAAQlB,EAAE,MAAM,EAAE,KAAK,MAAMa,CAAM;AAAA,EACzE,CAAC;AACD,QAAMX,IAAU,CAAA,GACVqB,IAAWF,IAASD,IAAQ;AAClC,WAASX,IAAI,GAAGA,IAAIc,GAAUd;AAC1B,IAAAP,EAAQ,KAAK,IAAIZ,GAAM;AAE3B,QAAMa,IAAUiB,IAAQ;AACxB,SAAAF,EAAS,YAAW,EAAG,QAAQ,CAACI,MAAM;AAClC,IAAAP,EAAab,GAASC,GAAS,OAAO,OAAO,EAAE,GAAGmB,EAAE,GAAE,GAAIJ,EAAS,QAAQI,EAAE,EAAE,EAAE,IAAI,CAAC;AAAA,EAC1F,CAAC,GACM,EAAE,SAAApB,GAAS,SAAAC,GAAS,OAAOe,EAAQ;AAC9C,GACMH,IAAe,CAACb,GAASC,GAASI,MAAU;AAC9C,EAAKA,EAAM,MAGDA,EAAM,KAIZL,EAAQK,EAAM,MAAMA,EAAM,KAAQJ,CAAO,EAAE,QAAQI,CAAK,IAHxDL,EAAQA,EAAQ,SAAS,CAAC,EAAE,QAAQK,CAAK,IAHzCL,EAAQ,CAAC,EAAE,QAAQK,CAAK;AAQhC;","x_google_ignoreList":[0]}