@hkyhy/marsun-components-core 0.1.113 → 0.1.115

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

@@ -0,0 +1,122 @@
+import { DagreGraph as h } from "./graph.js";
+import f from "../../node_modules/@antv/util/esm/lodash/is-number.js";
+const m = (n, t) => Number(n) - Number(t), g = (n, t, a, e) => {
+  let d;
+  do
+    d = `${e}${Math.random()}`;
+  while (n.hasNode(d));
+  return a.dummy = t, n.addNode({
+    id: d,
+    data: a
+  }), d;
+}, E = (n) => {
+  const t = new h();
+  return n.getAllNodes().forEach((a) => {
+    t.addNode(Object.assign({}, a));
+  }), n.getAllEdges().forEach((a) => {
+    const e = t.getRelatedEdges(a.source, "out").find((d) => d.target === a.target);
+    e ? t.updateEdgeData(e == null ? void 0 : e.id, Object.assign(Object.assign({}, e.data), { weight: e.data.weight + a.data.weight || 0, minlen: Math.max(e.data.minlen, a.data.minlen || 1) })) : t.addEdge({
+      id: a.id,
+      source: a.source,
+      target: a.target,
+      data: {
+        weight: a.data.weight || 0,
+        minlen: a.data.minlen || 1
+      }
+    });
+  }), t;
+}, b = (n) => {
+  const t = new h();
+  return n.getAllNodes().forEach((a) => {
+    n.getChildren(a.id).length || t.addNode(Object.assign({}, a));
+  }), n.getAllEdges().forEach((a) => {
+    t.addEdge(a);
+  }), t;
+}, y = (n, t) => n == null ? void 0 : n.reduce((a, e, d) => (a[e] = t[d], a), {}), w = (n, t) => {
+  const a = Number(n.x), e = Number(n.y), d = Number(t.x) - a, r = Number(t.y) - e;
+  let i = Number(n.width) / 2, s = Number(n.height) / 2;
+  if (!d && !r)
+    return { x: 0, y: 0 };
+  let o, c;
+  return Math.abs(r) * i > Math.abs(d) * s ? (r < 0 && (s = -s), o = s * d / r, c = s) : (d < 0 && (i = -i), o = i, c = i * r / d), { x: a + o, y: e + c };
+}, x = (n) => {
+  const t = [], a = N(n) + 1;
+  for (let e = 0; e < a; e++)
+    t.push([]);
+  n.getAllNodes().forEach((e) => {
+    const d = e.data.rank;
+    d !== void 0 && t[d] && t[d].push(e.id);
+  });
+  for (let e = 0; e < a; e++)
+    t[e] = t[e].sort((d, r) => m(n.getNode(d).data.order, n.getNode(r).data.order));
+  return t;
+}, A = (n) => {
+  const t = n.getAllNodes().filter((e) => e.data.rank !== void 0).map((e) => e.data.rank), a = Math.min(...t);
+  n.getAllNodes().forEach((e) => {
+    e.data.hasOwnProperty("rank") && a !== 1 / 0 && (e.data.rank -= a);
+  });
+}, v = (n, t = 0) => {
+  const a = n.getAllNodes(), e = a.filter((s) => s.data.rank !== void 0).map((s) => s.data.rank), d = Math.min(...e), r = [];
+  a.forEach((s) => {
+    const o = (s.data.rank || 0) - d;
+    r[o] || (r[o] = []), r[o].push(s.id);
+  });
+  let i = 0;
+  for (let s = 0; s < r.length; s++) {
+    const o = r[s];
+    o === void 0 ? s % t !== 0 && (i -= 1) : i && (o == null || o.forEach((c) => {
+      const l = n.getNode(c);
+      l && (l.data.rank = l.data.rank || 0, l.data.rank += i);
+    }));
+  }
+}, M = (n, t, a, e) => {
+  const d = {
+    width: 0,
+    height: 0
+  };
+  return f(a) && f(e) && (d.rank = a, d.order = e), g(n, "border", d, t);
+}, N = (n) => {
+  let t;
+  return n.getAllNodes().forEach((a) => {
+    const e = a.data.rank;
+    e !== void 0 && (t === void 0 || e > t) && (t = e);
+  }), t || (t = 0), t;
+}, R = (n, t) => {
+  const a = { lhs: [], rhs: [] };
+  return n == null || n.forEach((e) => {
+    t(e) ? a.lhs.push(e) : a.rhs.push(e);
+  }), a;
+}, O = (n, t) => n.reduce((a, e) => {
+  const d = t(a), r = t(e);
+  return d > r ? e : a;
+}), u = (n, t, a, e, d, r) => {
+  if (!e.includes(t.id)) {
+    e.push(t.id), a || r.push(t.id);
+    const i = d(t.id);
+    i && i.forEach((s) => u(n, s, a, e, d, r)), a && r.push(t.id);
+  }
+}, D = (n, t, a, e) => {
+  const d = Array.isArray(t) ? t : [t], r = (o) => n.getNeighbors(o), i = [], s = [];
+  return d.forEach((o) => {
+    if (n.hasNode(o.id))
+      u(n, o, a === "post", s, r, i);
+    else
+      throw new Error(`Graph does not have node: ${o}`);
+  }), i;
+};
+export {
+  M as addBorderNode,
+  g as addDummyNode,
+  b as asNonCompoundGraph,
+  x as buildLayerMatrix,
+  D as dfs,
+  w as intersectRect,
+  N as maxRank,
+  O as minBy,
+  A as normalizeRanks,
+  R as partition,
+  v as removeEmptyRanks,
+  E as simplify,
+  y as zipObject
+};
+//# sourceMappingURL=util.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"util.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/antv-dagre/util.js"],"sourcesContent":["import { DagreGraph } from './graph.js';\nimport isNumber from '../../node_modules/@antv/util/esm/lodash/is-number.js';\n\nconst safeSort = (valueA, valueB) => {\n    return Number(valueA) - Number(valueB);\n};\n/*\n * Adds a dummy node to the graph and return v.\n */\nconst addDummyNode = (g, type, data, name) => {\n    let v;\n    do {\n        v = `${name}${Math.random()}`;\n    } while (g.hasNode(v));\n    data.dummy = type;\n    g.addNode({\n        id: v,\n        data,\n    });\n    return v;\n};\n/*\n * Returns a new graph with only simple edges. Handles aggregation of data\n * associated with multi-edges.\n */\nconst simplify = (g) => {\n    const simplified = new DagreGraph();\n    g.getAllNodes().forEach((v) => {\n        simplified.addNode(Object.assign({}, v));\n    });\n    g.getAllEdges().forEach((e) => {\n        const edge = simplified\n            .getRelatedEdges(e.source, 'out')\n            .find((edge) => edge.target === e.target);\n        if (!edge) {\n            simplified.addEdge({\n                id: e.id,\n                source: e.source,\n                target: e.target,\n                data: {\n                    weight: e.data.weight || 0,\n                    minlen: e.data.minlen || 1,\n                },\n            });\n        }\n        else {\n            simplified.updateEdgeData(edge === null || edge === void 0 ? void 0 : edge.id, Object.assign(Object.assign({}, edge.data), { weight: edge.data.weight + e.data.weight || 0, minlen: Math.max(edge.data.minlen, e.data.minlen || 1) }));\n        }\n    });\n    return simplified;\n};\nconst asNonCompoundGraph = (g) => {\n    const simplified = new DagreGraph();\n    g.getAllNodes().forEach((node) => {\n        if (!g.getChildren(node.id).length) {\n            simplified.addNode(Object.assign({}, node));\n        }\n    });\n    g.getAllEdges().forEach((edge) => {\n        simplified.addEdge(edge);\n    });\n    return simplified;\n};\nconst zipObject = (keys, values) => {\n    return keys === null || keys === void 0 ? void 0 : keys.reduce((obj, key, i) => {\n        obj[key] = values[i];\n        return obj;\n    }, {});\n};\n/*\n * Finds where a line starting at point ({x, y}) would intersect a rectangle\n * ({x, y, width, height}) if it were pointing at the rectangle's center.\n */\nconst intersectRect = (rect, point) => {\n    const x = Number(rect.x);\n    const y = Number(rect.y);\n    // Rectangle intersection algorithm from:\n    // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes\n    const dx = Number(point.x) - x;\n    const dy = Number(point.y) - y;\n    let w = Number(rect.width) / 2;\n    let h = Number(rect.height) / 2;\n    if (!dx && !dy) {\n        // completely overlapped directly, then return points its self\n        return { x: 0, y: 0 };\n    }\n    let sx;\n    let sy;\n    if (Math.abs(dy) * w > Math.abs(dx) * h) {\n        // Intersection is top or bottom of rect.\n        if (dy < 0) {\n            h = -h;\n        }\n        sx = (h * dx) / dy;\n        sy = h;\n    }\n    else {\n        // Intersection is left or right of rect.\n        if (dx < 0) {\n            w = -w;\n        }\n        sx = w;\n        sy = (w * dy) / dx;\n    }\n    return { x: x + sx, y: y + sy };\n};\n/*\n * Given a DAG with each node assigned \"rank\" and \"order\" properties, this\n * const will produce a matrix with the ids of each node.\n */\nconst buildLayerMatrix = (g) => {\n    const layeringNodes = [];\n    const rankMax = maxRank(g) + 1;\n    for (let i = 0; i < rankMax; i++) {\n        layeringNodes.push([]);\n    }\n    // const layering = _.map(_.range(maxRank(g) + 1), function() { return []; });\n    g.getAllNodes().forEach((node) => {\n        const rank = node.data.rank;\n        if (rank !== undefined && layeringNodes[rank]) {\n            layeringNodes[rank].push(node.id);\n        }\n    });\n    for (let i = 0; i < rankMax; i++) {\n        layeringNodes[i] = layeringNodes[i].sort((va, vb) => safeSort(g.getNode(va).data.order, g.getNode(vb).data.order));\n    }\n    return layeringNodes;\n};\n/*\n * Adjusts the ranks for all nodes in the graph such that all nodes v have\n * rank(v) >= 0 and at least one node w has rank(w) = 0.\n */\nconst normalizeRanks = (g) => {\n    const nodeRanks = g\n        .getAllNodes()\n        .filter((v) => v.data.rank !== undefined)\n        .map((v) => v.data.rank);\n    const min = Math.min(...nodeRanks);\n    g.getAllNodes().forEach((v) => {\n        if (v.data.hasOwnProperty('rank') && min !== Infinity) {\n            v.data.rank -= min;\n        }\n    });\n};\nconst removeEmptyRanks = (g, nodeRankFactor = 0) => {\n    // Ranks may not start at 0, so we need to offset them\n    const nodes = g.getAllNodes();\n    const nodeRanks = nodes\n        .filter((v) => v.data.rank !== undefined)\n        .map((v) => v.data.rank);\n    const offset = Math.min(...nodeRanks);\n    const layers = [];\n    nodes.forEach((v) => {\n        const rank = (v.data.rank || 0) - offset;\n        if (!layers[rank]) {\n            layers[rank] = [];\n        }\n        layers[rank].push(v.id);\n    });\n    let delta = 0;\n    for (let i = 0; i < layers.length; i++) {\n        const vs = layers[i];\n        if (vs === undefined) {\n            if (i % nodeRankFactor !== 0) {\n                delta -= 1;\n            }\n        }\n        else if (delta) {\n            vs === null || vs === void 0 ? void 0 : vs.forEach((v) => {\n                const node = g.getNode(v);\n                if (node) {\n                    node.data.rank = node.data.rank || 0;\n                    node.data.rank += delta;\n                }\n            });\n        }\n    }\n};\nconst addBorderNode$1 = (g, prefix, rank, order) => {\n    const node = {\n        width: 0,\n        height: 0,\n    };\n    if (isNumber(rank) && isNumber(order)) {\n        node.rank = rank;\n        node.order = order;\n    }\n    return addDummyNode(g, 'border', node, prefix);\n};\nconst maxRank = (g) => {\n    let maxRank;\n    g.getAllNodes().forEach((v) => {\n        const rank = v.data.rank;\n        if (rank !== undefined) {\n            if (maxRank === undefined || rank > maxRank) {\n                maxRank = rank;\n            }\n        }\n    });\n    if (!maxRank) {\n        maxRank = 0;\n    }\n    return maxRank;\n};\n/*\n * Partition a collection into two groups: `lhs` and `rhs`. If the supplied\n * const returns true for an entry it goes into `lhs`. Otherwise it goes\n * into `rhs.\n */\nconst partition = (collection, fn) => {\n    const result = { lhs: [], rhs: [] };\n    collection === null || collection === void 0 ? void 0 : collection.forEach((value) => {\n        if (fn(value)) {\n            result.lhs.push(value);\n        }\n        else {\n            result.rhs.push(value);\n        }\n    });\n    return result;\n};\nconst minBy = (array, func) => {\n    return array.reduce((a, b) => {\n        const valA = func(a);\n        const valB = func(b);\n        return valA > valB ? b : a;\n    });\n};\nconst doDFS = (graph, node, postorder, visited, navigator, result) => {\n    if (!visited.includes(node.id)) {\n        visited.push(node.id);\n        if (!postorder) {\n            result.push(node.id);\n        }\n        const neighbors = navigator(node.id);\n        if (neighbors) {\n            neighbors.forEach((n) => doDFS(graph, n, postorder, visited, navigator, result));\n        }\n        if (postorder) {\n            result.push(node.id);\n        }\n    }\n};\n/**\n * @description DFS traversal.\n * @description.zh-CN DFS 遍历。\n */\nconst dfs$1 = (graph, node, order, isDirected) => {\n    const nodes = Array.isArray(node) ? node : [node];\n    const navigator = (n) => graph.getNeighbors(n);\n    const results = [];\n    const visited = [];\n    nodes.forEach((node) => {\n        if (!graph.hasNode(node.id)) {\n            throw new Error(`Graph does not have node: ${node}`);\n        }\n        else {\n            doDFS(graph, node, order === 'post', visited, navigator, results);\n        }\n    });\n    return results;\n};\n\nexport { addBorderNode$1 as addBorderNode, addDummyNode, asNonCompoundGraph, buildLayerMatrix, dfs$1 as dfs, intersectRect, maxRank, minBy, normalizeRanks, partition, removeEmptyRanks, simplify, zipObject };\n//# sourceMappingURL=util.js.map\n"],"names":["safeSort","valueA","valueB","addDummyNode","g","type","data","name","v","simplify","simplified","DagreGraph","e","edge","asNonCompoundGraph","node","zipObject","keys","values","obj","key","i","intersectRect","rect","point","x","y","dx","dy","w","h","sx","sy","buildLayerMatrix","layeringNodes","rankMax","maxRank","rank","va","vb","normalizeRanks","nodeRanks","min","removeEmptyRanks","nodeRankFactor","nodes","offset","layers","delta","vs","addBorderNode$1","prefix","order","isNumber","partition","collection","fn","result","value","minBy","array","func","b","valA","valB","doDFS","graph","postorder","visited","navigator","neighbors","n","dfs$1","isDirected","results"],"mappings":";;AAGA,MAAMA,IAAW,CAACC,GAAQC,MACf,OAAOD,CAAM,IAAI,OAAOC,CAAM,GAKnCC,IAAe,CAACC,GAAGC,GAAMC,GAAMC,MAAS;AAC1C,MAAIC;AACJ;AACI,IAAAA,IAAI,GAAGD,CAAI,GAAG,KAAK,OAAM,CAAE;AAAA,SACtBH,EAAE,QAAQI,CAAC;AACpB,SAAAF,EAAK,QAAQD,GACbD,EAAE,QAAQ;AAAA,IACN,IAAII;AAAA,IACJ,MAAAF;AAAA,EACR,CAAK,GACME;AACX,GAKMC,IAAW,CAACL,MAAM;AACpB,QAAMM,IAAa,IAAIC,EAAU;AACjC,SAAAP,EAAE,YAAW,EAAG,QAAQ,CAACI,MAAM;AAC3B,IAAAE,EAAW,QAAQ,OAAO,OAAO,CAAA,GAAIF,CAAC,CAAC;AAAA,EAC3C,CAAC,GACDJ,EAAE,YAAW,EAAG,QAAQ,CAACQ,MAAM;AAC3B,UAAMC,IAAOH,EACR,gBAAgBE,EAAE,QAAQ,KAAK,EAC/B,KAAK,CAACC,MAASA,EAAK,WAAWD,EAAE,MAAM;AAC5C,IAAKC,IAYDH,EAAW,eAAeG,KAAS,OAA0B,SAASA,EAAK,IAAI,OAAO,OAAO,OAAO,OAAO,CAAA,GAAIA,EAAK,IAAI,GAAG,EAAE,QAAQA,EAAK,KAAK,SAASD,EAAE,KAAK,UAAU,GAAG,QAAQ,KAAK,IAAIC,EAAK,KAAK,QAAQD,EAAE,KAAK,UAAU,CAAC,EAAC,CAAE,CAAC,IAXrOF,EAAW,QAAQ;AAAA,MACf,IAAIE,EAAE;AAAA,MACN,QAAQA,EAAE;AAAA,MACV,QAAQA,EAAE;AAAA,MACV,MAAM;AAAA,QACF,QAAQA,EAAE,KAAK,UAAU;AAAA,QACzB,QAAQA,EAAE,KAAK,UAAU;AAAA,MAC7C;AAAA,IACA,CAAa;AAAA,EAKT,CAAC,GACMF;AACX,GACMI,IAAqB,CAACV,MAAM;AAC9B,QAAMM,IAAa,IAAIC,EAAU;AACjC,SAAAP,EAAE,YAAW,EAAG,QAAQ,CAACW,MAAS;AAC9B,IAAKX,EAAE,YAAYW,EAAK,EAAE,EAAE,UACxBL,EAAW,QAAQ,OAAO,OAAO,CAAA,GAAIK,CAAI,CAAC;AAAA,EAElD,CAAC,GACDX,EAAE,YAAW,EAAG,QAAQ,CAACS,MAAS;AAC9B,IAAAH,EAAW,QAAQG,CAAI;AAAA,EAC3B,CAAC,GACMH;AACX,GACMM,IAAY,CAACC,GAAMC,MACdD,KAAS,OAA0B,SAASA,EAAK,OAAO,CAACE,GAAKC,GAAKC,OACtEF,EAAIC,CAAG,IAAIF,EAAOG,CAAC,GACZF,IACR,CAAA,CAAE,GAMHG,IAAgB,CAACC,GAAMC,MAAU;AACnC,QAAMC,IAAI,OAAOF,EAAK,CAAC,GACjBG,IAAI,OAAOH,EAAK,CAAC,GAGjBI,IAAK,OAAOH,EAAM,CAAC,IAAIC,GACvBG,IAAK,OAAOJ,EAAM,CAAC,IAAIE;AAC7B,MAAIG,IAAI,OAAON,EAAK,KAAK,IAAI,GACzBO,IAAI,OAAOP,EAAK,MAAM,IAAI;AAC9B,MAAI,CAACI,KAAM,CAACC;AAER,WAAO,EAAE,GAAG,GAAG,GAAG,EAAC;AAEvB,MAAIG,GACAC;AACJ,SAAI,KAAK,IAAIJ,CAAE,IAAIC,IAAI,KAAK,IAAIF,CAAE,IAAIG,KAE9BF,IAAK,MACLE,IAAI,CAACA,IAETC,IAAMD,IAAIH,IAAMC,GAChBI,IAAKF,MAIDH,IAAK,MACLE,IAAI,CAACA,IAETE,IAAKF,GACLG,IAAMH,IAAID,IAAMD,IAEb,EAAE,GAAGF,IAAIM,GAAI,GAAGL,IAAIM,EAAE;AACjC,GAKMC,IAAmB,CAAC7B,MAAM;AAC5B,QAAM8B,IAAgB,CAAA,GAChBC,IAAUC,EAAQhC,CAAC,IAAI;AAC7B,WAASiB,IAAI,GAAGA,IAAIc,GAASd;AACzB,IAAAa,EAAc,KAAK,EAAE;AAGzB,EAAA9B,EAAE,YAAW,EAAG,QAAQ,CAACW,MAAS;AAC9B,UAAMsB,IAAOtB,EAAK,KAAK;AACvB,IAAIsB,MAAS,UAAaH,EAAcG,CAAI,KACxCH,EAAcG,CAAI,EAAE,KAAKtB,EAAK,EAAE;AAAA,EAExC,CAAC;AACD,WAASM,IAAI,GAAGA,IAAIc,GAASd;AACzB,IAAAa,EAAcb,CAAC,IAAIa,EAAcb,CAAC,EAAE,KAAK,CAACiB,GAAIC,MAAOvC,EAASI,EAAE,QAAQkC,CAAE,EAAE,KAAK,OAAOlC,EAAE,QAAQmC,CAAE,EAAE,KAAK,KAAK,CAAC;AAErH,SAAOL;AACX,GAKMM,IAAiB,CAACpC,MAAM;AAC1B,QAAMqC,IAAYrC,EACb,YAAW,EACX,OAAO,CAACI,MAAMA,EAAE,KAAK,SAAS,MAAS,EACvC,IAAI,CAACA,MAAMA,EAAE,KAAK,IAAI,GACrBkC,IAAM,KAAK,IAAI,GAAGD,CAAS;AACjC,EAAArC,EAAE,YAAW,EAAG,QAAQ,CAACI,MAAM;AAC3B,IAAIA,EAAE,KAAK,eAAe,MAAM,KAAKkC,MAAQ,UACzClC,EAAE,KAAK,QAAQkC;AAAA,EAEvB,CAAC;AACL,GACMC,IAAmB,CAACvC,GAAGwC,IAAiB,MAAM;AAEhD,QAAMC,IAAQzC,EAAE,YAAW,GACrBqC,IAAYI,EACb,OAAO,CAACrC,MAAMA,EAAE,KAAK,SAAS,MAAS,EACvC,IAAI,CAACA,MAAMA,EAAE,KAAK,IAAI,GACrBsC,IAAS,KAAK,IAAI,GAAGL,CAAS,GAC9BM,IAAS,CAAA;AACf,EAAAF,EAAM,QAAQ,CAACrC,MAAM;AACjB,UAAM6B,KAAQ7B,EAAE,KAAK,QAAQ,KAAKsC;AAClC,IAAKC,EAAOV,CAAI,MACZU,EAAOV,CAAI,IAAI,CAAA,IAEnBU,EAAOV,CAAI,EAAE,KAAK7B,EAAE,EAAE;AAAA,EAC1B,CAAC;AACD,MAAIwC,IAAQ;AACZ,WAAS3B,IAAI,GAAGA,IAAI0B,EAAO,QAAQ1B,KAAK;AACpC,UAAM4B,IAAKF,EAAO1B,CAAC;AACnB,IAAI4B,MAAO,SACH5B,IAAIuB,MAAmB,MACvBI,KAAS,KAGRA,MACLC,KAAO,QAAiCA,EAAG,QAAQ,CAACzC,MAAM;AACtD,YAAMO,IAAOX,EAAE,QAAQI,CAAC;AACxB,MAAIO,MACAA,EAAK,KAAK,OAAOA,EAAK,KAAK,QAAQ,GACnCA,EAAK,KAAK,QAAQiC;AAAA,IAE1B,CAAC;AAAA,EAET;AACJ,GACME,IAAkB,CAAC9C,GAAG+C,GAAQd,GAAMe,MAAU;AAChD,QAAMrC,IAAO;AAAA,IACT,OAAO;AAAA,IACP,QAAQ;AAAA,EAChB;AACI,SAAIsC,EAAShB,CAAI,KAAKgB,EAASD,CAAK,MAChCrC,EAAK,OAAOsB,GACZtB,EAAK,QAAQqC,IAEVjD,EAAaC,GAAG,UAAUW,GAAMoC,CAAM;AACjD,GACMf,IAAU,CAAChC,MAAM;AACnB,MAAIgC;AACJ,SAAAhC,EAAE,YAAW,EAAG,QAAQ,CAACI,MAAM;AAC3B,UAAM6B,IAAO7B,EAAE,KAAK;AACpB,IAAI6B,MAAS,WACLD,MAAY,UAAaC,IAAOD,OAChCA,IAAUC;AAAA,EAGtB,CAAC,GACID,MACDA,IAAU,IAEPA;AACX,GAMMkB,IAAY,CAACC,GAAYC,MAAO;AAClC,QAAMC,IAAS,EAAE,KAAK,CAAA,GAAI,KAAK,CAAA,EAAE;AACjC,SAAAF,KAAe,QAAyCA,EAAW,QAAQ,CAACG,MAAU;AAClF,IAAIF,EAAGE,CAAK,IACRD,EAAO,IAAI,KAAKC,CAAK,IAGrBD,EAAO,IAAI,KAAKC,CAAK;AAAA,EAE7B,CAAC,GACMD;AACX,GACME,IAAQ,CAACC,GAAOC,MACXD,EAAM,OAAO,CAAC,GAAGE,MAAM;AAC1B,QAAMC,IAAOF,EAAK,CAAC,GACbG,IAAOH,EAAKC,CAAC;AACnB,SAAOC,IAAOC,IAAOF,IAAI;AAC7B,CAAC,GAECG,IAAQ,CAACC,GAAOnD,GAAMoD,GAAWC,GAASC,GAAWZ,MAAW;AAClE,MAAI,CAACW,EAAQ,SAASrD,EAAK,EAAE,GAAG;AAC5B,IAAAqD,EAAQ,KAAKrD,EAAK,EAAE,GACfoD,KACDV,EAAO,KAAK1C,EAAK,EAAE;AAEvB,UAAMuD,IAAYD,EAAUtD,EAAK,EAAE;AACnC,IAAIuD,KACAA,EAAU,QAAQ,CAACC,MAAMN,EAAMC,GAAOK,GAAGJ,GAAWC,GAASC,GAAWZ,CAAM,CAAC,GAE/EU,KACAV,EAAO,KAAK1C,EAAK,EAAE;AAAA,EAE3B;AACJ,GAKMyD,IAAQ,CAACN,GAAOnD,GAAMqC,GAAOqB,MAAe;AAC9C,QAAM5B,IAAQ,MAAM,QAAQ9B,CAAI,IAAIA,IAAO,CAACA,CAAI,GAC1CsD,IAAY,CAACE,MAAML,EAAM,aAAaK,CAAC,GACvCG,IAAU,CAAA,GACVN,IAAU,CAAA;AAChB,SAAAvB,EAAM,QAAQ,CAAC9B,MAAS;AACpB,QAAKmD,EAAM,QAAQnD,EAAK,EAAE;AAItB,MAAAkD,EAAMC,GAAOnD,GAAMqC,MAAU,QAAQgB,GAASC,GAAWK,CAAO;AAAA;AAHhE,YAAM,IAAI,MAAM,6BAA6B3D,CAAI,EAAE;AAAA,EAK3D,CAAC,GACM2D;AACX;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,54 @@
+import { __awaiter as r } from "../node_modules/tslib/tslib.es6.js";
+import { RuntimeContext as h } from "../runtime/context.js";
+import { Supervisor as u } from "../runtime/supervisor.js";
+class l {
+  constructor(t) {
+    this.supervisor = null, this.initialOptions = this.mergeOptions(this.getDefaultOptions(), t);
+  }
+  get options() {
+    return this.runtimeOptions || this.initialOptions;
+  }
+  mergeOptions(t, i) {
+    return Object.assign({}, t, i || {});
+  }
+  execute(t, i) {
+    return r(this, void 0, void 0, function* () {
+      this.runtimeOptions = this.mergeOptions(this.initialOptions, i);
+      const { node: e, edge: o, enableWorker: n } = this.runtimeOptions;
+      this.context = new h(t, { node: e, edge: o }), this.model = this.context.graph, n && typeof Worker < "u" ? yield this.layoutInWorker(t, this.runtimeOptions) : yield this.layout(this.runtimeOptions);
+    });
+  }
+  layoutInWorker(t, i) {
+    var e;
+    return r(this, void 0, void 0, function* () {
+      try {
+        this.supervisor || (this.supervisor = new u());
+        const o = yield this.supervisor.execute(this.id, t, i);
+        (e = this.context) === null || e === void 0 || e.replace(o);
+      } catch (o) {
+        console.error("Layout in worker failed, fallback to main thread layout.", o), yield this.layout(i);
+      }
+    });
+  }
+  forEachNode(t) {
+    this.context.forEachNode(t);
+  }
+  forEachEdge(t) {
+    this.context.forEachEdge(t);
+  }
+  destroy() {
+    var t;
+    (t = this.context) === null || t === void 0 || t.destroy(), this.model = null, this.context = null, this.supervisor && (this.supervisor.destroy(), this.supervisor = null);
+  }
+}
+class f extends l {
+}
+function m(s) {
+  return !!s.tick && !!s.stop;
+}
+export {
+  l as BaseLayout,
+  f as BaseLayoutWithIterations,
+  m as isLayoutWithIterations
+};
+//# sourceMappingURL=base-layout.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"base-layout.js","sources":["../../../../../../node_modules/@antv/layout/lib/algorithm/base-layout.js"],"sourcesContent":["import { __awaiter } from '../node_modules/tslib/tslib.es6.js';\nimport { RuntimeContext } from '../runtime/context.js';\nimport { Supervisor } from '../runtime/supervisor.js';\n\n/**\n * <zh/> 布局基类\n *\n * <en/> Base class for layouts\n */\nclass BaseLayout {\n    constructor(options) {\n        this.supervisor = null;\n        this.initialOptions = this.mergeOptions(this.getDefaultOptions(), options);\n    }\n    get options() {\n        return this.runtimeOptions || this.initialOptions;\n    }\n    mergeOptions(base, patch) {\n        return Object.assign({}, base, patch || {});\n    }\n    execute(data, userOptions) {\n        return __awaiter(this, void 0, void 0, function* () {\n            this.runtimeOptions = this.mergeOptions(this.initialOptions, userOptions);\n            const { node, edge, enableWorker } = this.runtimeOptions;\n            this.context = new RuntimeContext(data, { node, edge });\n            this.model = this.context.graph;\n            const shouldUseWorker = enableWorker && typeof Worker !== 'undefined';\n            if (shouldUseWorker) {\n                yield this.layoutInWorker(data, this.runtimeOptions);\n            }\n            else {\n                yield this.layout(this.runtimeOptions);\n            }\n        });\n    }\n    layoutInWorker(data, options) {\n        var _a;\n        return __awaiter(this, void 0, void 0, function* () {\n            try {\n                if (!this.supervisor) {\n                    this.supervisor = new Supervisor();\n                }\n                const result = yield this.supervisor.execute(this.id, data, options);\n                (_a = this.context) === null || _a === void 0 ? void 0 : _a.replace(result);\n            }\n            catch (error) {\n                console.error('Layout in worker failed, fallback to main thread layout.', error);\n                // Fallback to main thread layout\n                yield this.layout(options);\n            }\n        });\n    }\n    forEachNode(callback) {\n        this.context.forEachNode(callback);\n    }\n    forEachEdge(callback) {\n        this.context.forEachEdge(callback);\n    }\n    destroy() {\n        var _a;\n        (_a = this.context) === null || _a === void 0 ? void 0 : _a.destroy();\n        // @ts-ignore\n        this.model = null;\n        // @ts-ignore\n        this.context = null;\n        if (this.supervisor) {\n            this.supervisor.destroy();\n            this.supervisor = null;\n        }\n    }\n}\n/**\n * <zh/> 迭代布局基类\n *\n * <en/> Base class for iterative layouts\n */\nclass BaseLayoutWithIterations extends BaseLayout {\n}\n/**\n * <zh/> 判断布局是否为迭代布局\n *\n * <en/> Determine whether the layout is an iterative layout\n */\nfunction isLayoutWithIterations(layout) {\n    return !!layout.tick && !!layout.stop;\n}\n\nexport { BaseLayout, BaseLayoutWithIterations, isLayoutWithIterations };\n//# sourceMappingURL=base-layout.js.map\n"],"names":["BaseLayout","options","base","patch","data","userOptions","__awaiter","node","edge","enableWorker","RuntimeContext","_a","Supervisor","result","error","callback","BaseLayoutWithIterations","isLayoutWithIterations","layout"],"mappings":";;;AASA,MAAMA,EAAW;AAAA,EACb,YAAYC,GAAS;AACjB,SAAK,aAAa,MAClB,KAAK,iBAAiB,KAAK,aAAa,KAAK,kBAAiB,GAAIA,CAAO;AAAA,EAC7E;AAAA,EACA,IAAI,UAAU;AACV,WAAO,KAAK,kBAAkB,KAAK;AAAA,EACvC;AAAA,EACA,aAAaC,GAAMC,GAAO;AACtB,WAAO,OAAO,OAAO,CAAA,GAAID,GAAMC,KAAS,CAAA,CAAE;AAAA,EAC9C;AAAA,EACA,QAAQC,GAAMC,GAAa;AACvB,WAAOC,EAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,WAAK,iBAAiB,KAAK,aAAa,KAAK,gBAAgBD,CAAW;AACxE,YAAM,EAAE,MAAAE,GAAM,MAAAC,GAAM,cAAAC,EAAY,IAAK,KAAK;AAC1C,WAAK,UAAU,IAAIC,EAAeN,GAAM,EAAE,MAAAG,GAAM,MAAAC,GAAM,GACtD,KAAK,QAAQ,KAAK,QAAQ,OACFC,KAAgB,OAAO,SAAW,MAEtD,MAAM,KAAK,eAAeL,GAAM,KAAK,cAAc,IAGnD,MAAM,KAAK,OAAO,KAAK,cAAc;AAAA,IAE7C,CAAC;AAAA,EACL;AAAA,EACA,eAAeA,GAAMH,GAAS;AAC1B,QAAIU;AACJ,WAAOL,EAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,UAAI;AACA,QAAK,KAAK,eACN,KAAK,aAAa,IAAIM,EAAU;AAEpC,cAAMC,IAAS,MAAM,KAAK,WAAW,QAAQ,KAAK,IAAIT,GAAMH,CAAO;AACnE,SAACU,IAAK,KAAK,aAAa,QAAQA,MAAO,UAAkBA,EAAG,QAAQE,CAAM;AAAA,MAC9E,SACOC,GAAO;AACV,gBAAQ,MAAM,4DAA4DA,CAAK,GAE/E,MAAM,KAAK,OAAOb,CAAO;AAAA,MAC7B;AAAA,IACJ,CAAC;AAAA,EACL;AAAA,EACA,YAAYc,GAAU;AAClB,SAAK,QAAQ,YAAYA,CAAQ;AAAA,EACrC;AAAA,EACA,YAAYA,GAAU;AAClB,SAAK,QAAQ,YAAYA,CAAQ;AAAA,EACrC;AAAA,EACA,UAAU;AACN,QAAIJ;AACJ,KAACA,IAAK,KAAK,aAAa,QAAQA,MAAO,UAAkBA,EAAG,QAAO,GAEnE,KAAK,QAAQ,MAEb,KAAK,UAAU,MACX,KAAK,eACL,KAAK,WAAW,QAAO,GACvB,KAAK,aAAa;AAAA,EAE1B;AACJ;AAMA,MAAMK,UAAiChB,EAAW;AAClD;AAMA,SAASiB,EAAuBC,GAAQ;AACpC,SAAO,CAAC,CAACA,EAAO,QAAQ,CAAC,CAACA,EAAO;AACrC;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/algorithm/base-simulation.js

@@ -0,0 +1,44 @@
+import e from "../node_modules/@antv/event-emitter/esm/index.js";
+class h extends e {
+  constructor() {
+    super(...arguments), this.iteration = 0, this.judgingDistance = 1 / 0, this.running = !1, this.tickCallback = null, this.endCallback = null, this.timer = 0;
+  }
+  initialize(i) {
+    this.options = i, this.iteration = 0, this.judgingDistance = 1 / 0;
+  }
+  on(i, t) {
+    return i === "tick" && (this.tickCallback = t), i === "end" && (this.endCallback = t), this;
+  }
+  tick(i = 1) {
+    var t;
+    for (let s = 0; s < i; s++) {
+      const n = this.runOneStep();
+      this.judgingDistance = n, this.iteration++, (t = this.tickCallback) === null || t === void 0 || t.call(this);
+    }
+    return this;
+  }
+  restart() {
+    if (this.running)
+      return this;
+    const { maxIteration: i = 500, minMovement: t = 0, animate: s = !0 } = this.options;
+    if (!s || typeof window > "u") {
+      for (; this.iteration < i && (this.judgingDistance > t || this.iteration < 1); )
+        this.tick(1);
+      return Promise.resolve().then(() => {
+        var n;
+        (n = this.endCallback) === null || n === void 0 || n.call(this);
+      }), this;
+    }
+    return this.running = !0, this.timer = window.setInterval(() => {
+      var n;
+      this.tick(1), (this.iteration >= i || this.judgingDistance < t) && (this.stop(), (n = this.endCallback) === null || n === void 0 || n.call(this));
+    }, 0), this;
+  }
+  stop() {
+    return this.running = !1, this.timer && (clearInterval(this.timer), this.timer = 0), this;
+  }
+}
+export {
+  h as BaseSimulation
+};
+//# sourceMappingURL=base-simulation.js.map

package/dist/node_modules/@antv/layout/lib/algorithm/base-simulation.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"base-simulation.js","sources":["../../../../../../node_modules/@antv/layout/lib/algorithm/base-simulation.js"],"sourcesContent":["import EventEmitter from '../node_modules/@antv/event-emitter/esm/index.js';\n\nclass BaseSimulation extends EventEmitter {\n    constructor() {\n        super(...arguments);\n        this.iteration = 0;\n        this.judgingDistance = Infinity;\n        this.running = false;\n        this.tickCallback = null;\n        this.endCallback = null;\n        this.timer = 0;\n    }\n    initialize(options) {\n        this.options = options;\n        this.iteration = 0;\n        this.judgingDistance = Infinity;\n    }\n    on(event, cb) {\n        if (event === 'tick')\n            this.tickCallback = cb;\n        if (event === 'end')\n            this.endCallback = cb;\n        return this;\n    }\n    tick(iterations = 1) {\n        var _a;\n        for (let i = 0; i < iterations; i++) {\n            const distance = this.runOneStep();\n            this.judgingDistance = distance;\n            this.iteration++;\n            (_a = this.tickCallback) === null || _a === void 0 ? void 0 : _a.call(this);\n        }\n        return this;\n    }\n    restart() {\n        if (this.running)\n            return this;\n        const { maxIteration = 500, minMovement = 0, animate = true, } = this.options;\n        /** 非动画 or 非浏览器环境 */\n        if (!animate || typeof window === 'undefined') {\n            while (this.iteration < maxIteration &&\n                (this.judgingDistance > minMovement || this.iteration < 1)) {\n                this.tick(1);\n            }\n            Promise.resolve().then(() => {\n                var _a;\n                (_a = this.endCallback) === null || _a === void 0 ? void 0 : _a.call(this);\n            });\n            return this;\n        }\n        /** 动画模式 */\n        this.running = true;\n        this.timer = window.setInterval(() => {\n            var _a;\n            this.tick(1);\n            if (this.iteration >= maxIteration ||\n                this.judgingDistance < minMovement) {\n                this.stop();\n                (_a = this.endCallback) === null || _a === void 0 ? void 0 : _a.call(this);\n            }\n        }, 0);\n        return this;\n    }\n    stop() {\n        this.running = false;\n        if (this.timer) {\n            clearInterval(this.timer);\n            this.timer = 0;\n        }\n        return this;\n    }\n}\n\nexport { BaseSimulation };\n//# sourceMappingURL=base-simulation.js.map\n"],"names":["BaseSimulation","EventEmitter","options","event","cb","iterations","_a","i","distance","maxIteration","minMovement","animate"],"mappings":";AAEA,MAAMA,UAAuBC,EAAa;AAAA,EACtC,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,YAAY,GACjB,KAAK,kBAAkB,OACvB,KAAK,UAAU,IACf,KAAK,eAAe,MACpB,KAAK,cAAc,MACnB,KAAK,QAAQ;AAAA,EACjB;AAAA,EACA,WAAWC,GAAS;AAChB,SAAK,UAAUA,GACf,KAAK,YAAY,GACjB,KAAK,kBAAkB;AAAA,EAC3B;AAAA,EACA,GAAGC,GAAOC,GAAI;AACV,WAAID,MAAU,WACV,KAAK,eAAeC,IACpBD,MAAU,UACV,KAAK,cAAcC,IAChB;AAAA,EACX;AAAA,EACA,KAAKC,IAAa,GAAG;AACjB,QAAIC;AACJ,aAASC,IAAI,GAAGA,IAAIF,GAAYE,KAAK;AACjC,YAAMC,IAAW,KAAK,WAAU;AAChC,WAAK,kBAAkBA,GACvB,KAAK,cACJF,IAAK,KAAK,kBAAkB,QAAQA,MAAO,UAAkBA,EAAG,KAAK,IAAI;AAAA,IAC9E;AACA,WAAO;AAAA,EACX;AAAA,EACA,UAAU;AACN,QAAI,KAAK;AACL,aAAO;AACX,UAAM,EAAE,cAAAG,IAAe,KAAK,aAAAC,IAAc,GAAG,SAAAC,IAAU,OAAU,KAAK;AAEtE,QAAI,CAACA,KAAW,OAAO,SAAW,KAAa;AAC3C,aAAO,KAAK,YAAYF,MACnB,KAAK,kBAAkBC,KAAe,KAAK,YAAY;AACxD,aAAK,KAAK,CAAC;AAEf,qBAAQ,UAAU,KAAK,MAAM;AACzB,YAAIJ;AACJ,SAACA,IAAK,KAAK,iBAAiB,QAAQA,MAAO,UAAkBA,EAAG,KAAK,IAAI;AAAA,MAC7E,CAAC,GACM;AAAA,IACX;AAEA,gBAAK,UAAU,IACf,KAAK,QAAQ,OAAO,YAAY,MAAM;AAClC,UAAIA;AACJ,WAAK,KAAK,CAAC,IACP,KAAK,aAAaG,KAClB,KAAK,kBAAkBC,OACvB,KAAK,KAAI,IACRJ,IAAK,KAAK,iBAAiB,QAAQA,MAAO,UAAkBA,EAAG,KAAK,IAAI;AAAA,IAEjF,GAAG,CAAC,GACG;AAAA,EACX;AAAA,EACA,OAAO;AACH,gBAAK,UAAU,IACX,KAAK,UACL,cAAc,KAAK,KAAK,GACxB,KAAK,QAAQ,IAEV;AAAA,EACX;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/algorithm/circular/index.js

@@ -0,0 +1,59 @@
+import { __awaiter as w } from "../../node_modules/tslib/tslib.es6.js";
+import { applySingleNodeLayout as L } from "../../util/common.js";
+import { formatNodeSizeFn as _ } from "../../util/format.js";
+import { orderByTopology as y, orderByDegree as O } from "../../util/order.js";
+import { normalizeViewport as T } from "../../util/viewport.js";
+import { BaseLayout as B } from "../base-layout.js";
+const c = {
+  radius: null,
+  startRadius: null,
+  endRadius: null,
+  startAngle: 0,
+  endAngle: 2 * Math.PI,
+  clockwise: !0,
+  divisions: 1,
+  ordering: null,
+  angleRatio: 1,
+  nodeSize: 10,
+  nodeSpacing: 0
+};
+class $ extends B {
+  constructor() {
+    super(...arguments), this.id = "circular";
+  }
+  getDefaultOptions() {
+    return c;
+  }
+  layout() {
+    return w(this, void 0, void 0, function* () {
+      const { width: M, height: v, center: l } = T(this.options), t = this.model.nodeCount();
+      if (!t || t === 1) {
+        L(this.model, l);
+        return;
+      }
+      const { ordering: a, nodeSpacing: u, nodeSize: I, endAngle: f = 2 * Math.PI, startAngle: g = 0, divisions: h, angleRatio: x, clockwise: A } = this.options;
+      a === "topology" ? y(this.model, !1) : a === "topology-directed" ? y(this.model, !0) : a === "degree" && O(this.model, "asc");
+      let { radius: s, startRadius: o, endRadius: i } = this.options;
+      const p = this.model.nodes(), z = _(I, u, c.nodeSize, c.nodeSpacing);
+      if (u) {
+        let e = 0;
+        for (const r of p)
+          e += Math.max(...z(r._original));
+        s = e / (2 * Math.PI);
+      } else !s && !o && !i ? s = Math.min(v, M) / 2 : !o && i ? o = i : o && !i && (i = o);
+      const D = (f - g) / t * x, m = Math.ceil(t / h), P = 2 * Math.PI / h;
+      for (let e = 0; e < t; ) {
+        const r = p[e];
+        let n = s;
+        !n && o !== null && i !== null && (n = o + e * (i - o) / (t - 1)), n || (n = 10 + e * 100 / (t - 1));
+        const R = Math.floor(e / m), S = e % m * D + P * R;
+        let d = g + S;
+        A || (d = f - S), r.x = l[0] + Math.cos(d) * n, r.y = l[1] + Math.sin(d) * n, e++;
+      }
+    });
+  }
+}
+export {
+  $ as CircularLayout
+};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/@antv/layout/lib/algorithm/circular/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/circular/index.js"],"sourcesContent":["import { __awaiter } from '../../node_modules/tslib/tslib.es6.js';\nimport { applySingleNodeLayout } from '../../util/common.js';\nimport '../../node_modules/@antv/expr/dist/index.esm.js';\nimport { formatNodeSizeFn } from '../../util/format.js';\nimport { orderByTopology, orderByDegree } from '../../util/order.js';\nimport { normalizeViewport } from '../../util/viewport.js';\nimport { BaseLayout } from '../base-layout.js';\n\nconst DEFAULT_LAYOUT_OPTIONS$1 = {\n    radius: null,\n    startRadius: null,\n    endRadius: null,\n    startAngle: 0,\n    endAngle: 2 * Math.PI,\n    clockwise: true,\n    divisions: 1,\n    ordering: null,\n    angleRatio: 1,\n    nodeSize: 10,\n    nodeSpacing: 0,\n};\n/**\n * <zh/> 环形布局\n *\n * <en/> Circular layout\n */\nclass CircularLayout extends BaseLayout {\n    constructor() {\n        super(...arguments);\n        this.id = 'circular';\n    }\n    getDefaultOptions() {\n        return DEFAULT_LAYOUT_OPTIONS$1;\n    }\n    layout() {\n        return __awaiter(this, void 0, void 0, function* () {\n            const { width, height, center } = normalizeViewport(this.options);\n            const n = this.model.nodeCount();\n            if (!n || n === 1) {\n                applySingleNodeLayout(this.model, center);\n                return;\n            }\n            const { ordering, nodeSpacing, nodeSize, endAngle = 2 * Math.PI, startAngle = 0, divisions, angleRatio, clockwise, } = this.options;\n            // Order nodes based on strategy\n            if (ordering === 'topology') {\n                // layout according to the graph topology ignoring edge directions\n                orderByTopology(this.model, false);\n            }\n            else if (ordering === 'topology-directed') {\n                // layout according to the graph topology considering edge directions\n                orderByTopology(this.model, true);\n            }\n            else if (ordering === 'degree') {\n                // layout according to the descent order of degrees\n                orderByDegree(this.model, 'asc');\n            }\n            let { radius, startRadius, endRadius } = this.options;\n            const nodes = this.model.nodes();\n            const sizeFn = formatNodeSizeFn(nodeSize, nodeSpacing, DEFAULT_LAYOUT_OPTIONS$1.nodeSize, DEFAULT_LAYOUT_OPTIONS$1.nodeSpacing);\n            if (nodeSpacing) {\n                let perimeter = 0;\n                for (const node of nodes) {\n                    perimeter += Math.max(...sizeFn(node._original));\n                }\n                radius = perimeter / (2 * Math.PI);\n            }\n            else if (!radius && !startRadius && !endRadius) {\n                radius = Math.min(height, width) / 2;\n            }\n            else if (!startRadius && endRadius) {\n                startRadius = endRadius;\n            }\n            else if (startRadius && !endRadius) {\n                endRadius = startRadius;\n            }\n            // Calculate node positions\n            const angleStep = (endAngle - startAngle) / n;\n            const adjustedStep = angleStep * angleRatio;\n            const nodesPerDivision = Math.ceil(n / divisions);\n            const divAngle = (2 * Math.PI) / divisions;\n            for (let i = 0; i < n;) {\n                const node = nodes[i];\n                // Calculate radius for this node\n                let r = radius;\n                if (!r && startRadius !== null && endRadius !== null) {\n                    r = startRadius + (i * (endRadius - startRadius)) / (n - 1);\n                }\n                if (!r) {\n                    r = 10 + (i * 100) / (n - 1);\n                }\n                // Calculate angle for this node\n                const divisionIndex = Math.floor(i / nodesPerDivision);\n                const indexInDivision = i % nodesPerDivision;\n                const theta = indexInDivision * adjustedStep + divAngle * divisionIndex;\n                let angle = startAngle + theta;\n                if (!clockwise) {\n                    angle = endAngle - theta;\n                }\n                // Set position\n                node.x = center[0] + Math.cos(angle) * r;\n                node.y = center[1] + Math.sin(angle) * r;\n                i++;\n            }\n        });\n    }\n}\n\nexport { CircularLayout };\n//# sourceMappingURL=index.js.map\n"],"names":["DEFAULT_LAYOUT_OPTIONS$1","CircularLayout","BaseLayout","__awaiter","width","height","center","normalizeViewport","n","applySingleNodeLayout","ordering","nodeSpacing","nodeSize","endAngle","startAngle","divisions","angleRatio","clockwise","orderByTopology","orderByDegree","radius","startRadius","endRadius","nodes","sizeFn","formatNodeSizeFn","perimeter","node","adjustedStep","nodesPerDivision","divAngle","i","r","divisionIndex","theta","angle"],"mappings":";;;;;;AAQA,MAAMA,IAA2B;AAAA,EAC7B,QAAQ;AAAA,EACR,aAAa;AAAA,EACb,WAAW;AAAA,EACX,YAAY;AAAA,EACZ,UAAU,IAAI,KAAK;AAAA,EACnB,WAAW;AAAA,EACX,WAAW;AAAA,EACX,UAAU;AAAA,EACV,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,aAAa;AACjB;AAMA,MAAMC,UAAuBC,EAAW;AAAA,EACpC,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,KAAK;AAAA,EACd;AAAA,EACA,oBAAoB;AAChB,WAAOF;AAAA,EACX;AAAA,EACA,SAAS;AACL,WAAOG,EAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAM,EAAE,OAAAC,GAAO,QAAAC,GAAQ,QAAAC,EAAM,IAAKC,EAAkB,KAAK,OAAO,GAC1DC,IAAI,KAAK,MAAM,UAAS;AAC9B,UAAI,CAACA,KAAKA,MAAM,GAAG;AACf,QAAAC,EAAsB,KAAK,OAAOH,CAAM;AACxC;AAAA,MACJ;AACA,YAAM,EAAE,UAAAI,GAAU,aAAAC,GAAa,UAAAC,GAAU,UAAAC,IAAW,IAAI,KAAK,IAAI,YAAAC,IAAa,GAAG,WAAAC,GAAW,YAAAC,GAAY,WAAAC,EAAS,IAAM,KAAK;AAE5H,MAAIP,MAAa,aAEbQ,EAAgB,KAAK,OAAO,EAAK,IAE5BR,MAAa,sBAElBQ,EAAgB,KAAK,OAAO,EAAI,IAE3BR,MAAa,YAElBS,EAAc,KAAK,OAAO,KAAK;AAEnC,UAAI,EAAE,QAAAC,GAAQ,aAAAC,GAAa,WAAAC,EAAS,IAAK,KAAK;AAC9C,YAAMC,IAAQ,KAAK,MAAM,MAAK,GACxBC,IAASC,EAAiBb,GAAUD,GAAaX,EAAyB,UAAUA,EAAyB,WAAW;AAC9H,UAAIW,GAAa;AACb,YAAIe,IAAY;AAChB,mBAAWC,KAAQJ;AACf,UAAAG,KAAa,KAAK,IAAI,GAAGF,EAAOG,EAAK,SAAS,CAAC;AAEnD,QAAAP,IAASM,KAAa,IAAI,KAAK;AAAA,MACnC,MACK,CAAI,CAACN,KAAU,CAACC,KAAe,CAACC,IACjCF,IAAS,KAAK,IAAIf,GAAQD,CAAK,IAAI,IAE9B,CAACiB,KAAeC,IACrBD,IAAcC,IAETD,KAAe,CAACC,MACrBA,IAAYD;AAIhB,YAAMO,KADaf,IAAWC,KAAcN,IACXQ,GAC3Ba,IAAmB,KAAK,KAAKrB,IAAIO,CAAS,GAC1Ce,IAAY,IAAI,KAAK,KAAMf;AACjC,eAASgB,IAAI,GAAGA,IAAIvB,KAAI;AACpB,cAAMmB,IAAOJ,EAAMQ,CAAC;AAEpB,YAAIC,IAAIZ;AACR,QAAI,CAACY,KAAKX,MAAgB,QAAQC,MAAc,SAC5CU,IAAIX,IAAeU,KAAKT,IAAYD,MAAiBb,IAAI,KAExDwB,MACDA,IAAI,KAAMD,IAAI,OAAQvB,IAAI;AAG9B,cAAMyB,IAAgB,KAAK,MAAMF,IAAIF,CAAgB,GAE/CK,IADkBH,IAAIF,IACID,IAAeE,IAAWG;AAC1D,YAAIE,IAAQrB,IAAaoB;AACzB,QAAKjB,MACDkB,IAAQtB,IAAWqB,IAGvBP,EAAK,IAAIrB,EAAO,CAAC,IAAI,KAAK,IAAI6B,CAAK,IAAIH,GACvCL,EAAK,IAAIrB,EAAO,CAAC,IAAI,KAAK,IAAI6B,CAAK,IAAIH,GACvCD;AAAA,MACJ;AAAA,IACJ,CAAC;AAAA,EACL;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/algorithm/combo-combined/index.js

@@ -0,0 +1,197 @@
+import { __awaiter as m, __rest as C } from "../../node_modules/tslib/tslib.es6.js";
+import { registry as b } from "../../registry.js";
+import { formatFn as I, formatNumberFn as S, formatNodeSizeFn as x } from "../../util/format.js";
+import { normalizeViewport as z } from "../../util/viewport.js";
+import { BaseLayout as P, isLayoutWithIterations as N } from "../base-layout.js";
+const O = {
+  layout: (h) => h ? { type: "concentric", preventOverlap: !0 } : { type: "force", preventOverlap: !0 },
+  nodeSize: 20,
+  nodeSpacing: 0,
+  comboPadding: 10,
+  comboSpacing: 0
+}, y = "root";
+class T extends P {
+  constructor() {
+    super(...arguments), this.id = "combo-combined", this.relativePositions = /* @__PURE__ */ new Map(), this.getParentId = (t) => t.parentId || y;
+  }
+  getDefaultOptions() {
+    return O;
+  }
+  layout() {
+    return m(this, void 0, void 0, function* () {
+      const { center: t } = z(this.options);
+      this.resetLayoutState();
+      const i = this.buildHierarchyTree();
+      yield this.layoutHierarchy(i), this.convertToGlobalPositions(i, t), this.applyPositionsToModel(i);
+    });
+  }
+  isCombo(t) {
+    return !!t.isCombo;
+  }
+  resetLayoutState() {
+    this.relativePositions.clear();
+  }
+  layoutHierarchy(t) {
+    return m(this, void 0, void 0, function* () {
+      for (const g of t.children || [])
+        this.isCombo(g) && (yield this.layoutHierarchy(g));
+      const i = t.children || [];
+      if (i.length === 0) {
+        t.size = [0, 0, 0], t.parentId = t.id === y ? null : t.parentId;
+        return;
+      }
+      const e = this.getLayoutConfig(t), { type: n } = e, o = C(e, ["type"]), r = this.getLayoutClass(n), s = new r(o), a = this.createTemporaryGraphData(i);
+      yield L(s, a, {});
+      const l = s.model.nodes();
+      this.recordRelativePositions(l, t);
+      const { center: c, width: d, height: u } = this.calculateComboBounds(t);
+      t.size = [d, u, 0], (t.children || []).forEach((g) => {
+        const p = this.relativePositions.get(g.id);
+        if (!p)
+          return;
+        const f = Object.assign(Object.assign({}, p), { x: p.x - c[0], y: p.y - c[1] });
+        this.relativePositions.set(g.id, f);
+      });
+    });
+  }
+  recordRelativePositions(t, i) {
+    const e = this.calculateComboCenter(t);
+    t.forEach((n) => {
+      this.relativePositions.set(n.id, {
+        x: n.x - e[0],
+        y: n.y - e[1],
+        relativeTo: String(i.id)
+      });
+    });
+  }
+  buildHierarchyTree() {
+    const t = {
+      id: y,
+      isCombo: !0,
+      children: [],
+      parentId: null
+    }, i = /* @__PURE__ */ new Map();
+    return i.set(y, t), this.model.forEachNode((e) => {
+      if (this.isCombo(e)) {
+        const n = Object.assign(Object.assign({}, e), { children: [], parentId: this.getParentId(e) });
+        i.set(String(e.id), n);
+      }
+    }), this.model.forEachNode((e) => {
+      const n = i.get(this.getParentId(e));
+      if (this.isCombo(e)) {
+        const o = i.get(String(e.id));
+        n && o && (n.children.push(o), o.parentId = n.id);
+      } else
+        n && n.children.push(Object.assign(Object.assign({}, e), { children: [], parentId: this.getParentId(e) }));
+    }), t;
+  }
+  convertToGlobalPositions(t, i) {
+    var e, n;
+    const o = t.id === y ? null : this.relativePositions.get(t.id), r = i[0] + ((e = o == null ? void 0 : o.x) !== null && e !== void 0 ? e : 0), s = i[1] + ((n = o == null ? void 0 : o.y) !== null && n !== void 0 ? n : 0);
+    t.x = r, t.y = s, (t.children || []).forEach((a) => {
+      var l, c;
+      const d = this.relativePositions.get(a.id);
+      a.x = r + ((l = d == null ? void 0 : d.x) !== null && l !== void 0 ? l : 0), a.y = s + ((c = d == null ? void 0 : d.y) !== null && c !== void 0 ? c : 0), a.size = this.getNodeLikeSize(a, !1), this.isCombo(a) && this.convertToGlobalPositions(a, [r, s]);
+    });
+  }
+  getLayoutConfig(t) {
+    const i = typeof this.options.layout == "object" ? this.options.layout : I(this.options.layout, ["comboId"]);
+    if (typeof i == "function") {
+      const e = t.id === y ? null : t.id;
+      return this.normalizeLayoutConfig(i(e));
+    }
+    return this.normalizeLayoutConfig(i);
+  }
+  normalizeLayoutConfig(t) {
+    const i = Object.assign(Object.assign({ type: "concentric" }, z(this.options)), { nodeSize: "node.size", nodeSpacing: 0 });
+    return t ? typeof t == "string" ? Object.assign(Object.assign({}, i), { type: t }) : Object.assign(Object.assign({}, i), t) : i;
+  }
+  getLayoutClass(t) {
+    return b[t] || b.concentric;
+  }
+  createTemporaryGraphData(t) {
+    const i = t.map((r) => Object.assign(Object.assign({}, r), { size: this.getNodeLikeSize(r) })), e = new Set(t.map((r) => String(r.id))), n = [], o = (r) => {
+      let s = String(r);
+      const a = /* @__PURE__ */ new Set();
+      for (; s && !a.has(s); ) {
+        if (e.has(s))
+          return s;
+        a.add(s);
+        const l = this.model.node(s), c = l == null ? void 0 : l.parentId;
+        s = c == null ? null : String(c);
+      }
+      return null;
+    };
+    return this.model.forEachEdge((r) => {
+      const s = o(String(r.source)), a = o(String(r.target));
+      !s || !a || s !== a && n.push({ source: s, target: a });
+    }), {
+      nodes: i,
+      edges: n
+    };
+  }
+  calculateComboCenter(t) {
+    if (t.length === 0)
+      return [0, 0];
+    const i = /* @__PURE__ */ new Map();
+    t.forEach((s) => {
+      const a = this.getNodeLikeSize(s);
+      i.set(s.id, a);
+    });
+    let e = 1 / 0, n = 1 / 0, o = -1 / 0, r = -1 / 0;
+    return t.forEach((s) => {
+      const [a = 0, l = 0] = i.get(s.id);
+      e = Math.min(e, s.x - a / 2), n = Math.min(n, s.y - l / 2), o = Math.max(o, s.x + a / 2), r = Math.max(r, s.y + l / 2);
+    }), !Number.isFinite(e) || !Number.isFinite(n) ? [0, 0] : [(e + o) / 2, (n + r) / 2];
+  }
+  calculateComboBounds(t) {
+    const i = t.children || [];
+    if (i.length === 0)
+      return { center: [0, 0], width: 0, height: 0 };
+    let e = 1 / 0, n = 1 / 0, o = -1 / 0, r = -1 / 0;
+    if (i.forEach((l) => {
+      var c, d;
+      const u = this.relativePositions.get(l.id), g = (c = u == null ? void 0 : u.x) !== null && c !== void 0 ? c : 0, p = (d = u == null ? void 0 : u.y) !== null && d !== void 0 ? d : 0, [f, v] = this.getNodeLikeSize(l);
+      e = Math.min(e, g - f / 2), n = Math.min(n, p - v / 2), o = Math.max(o, g + f / 2), r = Math.max(r, p + v / 2);
+    }), !Number.isFinite(e) || !Number.isFinite(n))
+      return { center: [0, 0], width: 0, height: 0 };
+    const a = S(this.options.comboPadding, 20, "combo")(t._original);
+    return {
+      center: [(e + o) / 2, (n + r) / 2],
+      width: o - e + a * 2,
+      height: r - n + a * 2
+    };
+  }
+  getNodeLikeSize(t, i = !0) {
+    return this.isCombo(t) ? this.getComboSize(t, i) : this.getNodeSize(t, i);
+  }
+  getNodeSize(t, i = !0) {
+    const { nodeSize: e, nodeSpacing: n } = this.options;
+    return x(e, i ? n : 0)(t._original);
+  }
+  getComboSize(t, i = !0) {
+    const e = S(this.options.comboSpacing, 0, "combo"), n = i ? e(t._original) : 0, [o, r] = t.size;
+    return [o + n / 2, r + n / 2, 0];
+  }
+  applyPositionsToModel(t) {
+    const i = (n) => {
+      const o = this.model.node(n.id);
+      o && (o.x = n.x, o.y = n.y, n.size && (o.size = n.size));
+    }, e = (n) => {
+      n.id !== y && i(n), (n.children || []).forEach((o) => {
+        this.isCombo(o) ? e(o) : i(o);
+      });
+    };
+    e(t);
+  }
+}
+function L(h, t, i = {}) {
+  var e;
+  return m(this, void 0, void 0, function* () {
+    return N(h) ? (h.execute(t, i), h.stop(), h.tick((e = i.iterations) !== null && e !== void 0 ? e : 300)) : yield h.execute(t, i);
+  });
+}
+export {
+  T as ComboCombinedLayout
+};
+//# sourceMappingURL=index.js.map

package/dist/node_modules/@antv/layout/lib/algorithm/combo-combined/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/combo-combined/index.js"],"sourcesContent":["import { __awaiter, __rest } from '../../node_modules/tslib/tslib.es6.js';\nimport { registry } from '../../registry.js';\nimport '../../node_modules/@antv/expr/dist/index.esm.js';\nimport { formatFn, formatNumberFn, formatNodeSizeFn } from '../../util/format.js';\nimport { normalizeViewport } from '../../util/viewport.js';\nimport { BaseLayout, isLayoutWithIterations } from '../base-layout.js';\n\nconst DEFAULT_OPTIONS = {\n    layout: (comboId) => !comboId\n        ? { type: 'force', preventOverlap: true }\n        : { type: 'concentric', preventOverlap: true },\n    nodeSize: 20,\n    nodeSpacing: 0,\n    comboPadding: 10,\n    comboSpacing: 0,\n};\nconst ROOT_ID = 'root';\n/**\n * <zh/> 组合布局\n *\n * <en/> Combo Combined Layout\n */\nclass ComboCombinedLayout extends BaseLayout {\n    constructor() {\n        super(...arguments);\n        this.id = 'combo-combined';\n        this.relativePositions = new Map();\n        this.getParentId = (node) => {\n            return node.parentId || ROOT_ID;\n        };\n    }\n    getDefaultOptions() {\n        return DEFAULT_OPTIONS;\n    }\n    layout() {\n        return __awaiter(this, void 0, void 0, function* () {\n            const { center } = normalizeViewport(this.options);\n            this.resetLayoutState();\n            /** 1. 构建分组层级结构 */\n            const rootHierarchy = this.buildHierarchyTree();\n            /** 2. 从内到外递归布局 */\n            yield this.layoutHierarchy(rootHierarchy);\n            /** 3. 计算全局位置 */\n            this.convertToGlobalPositions(rootHierarchy, center);\n            /** 4. 应用位置到节点 */\n            this.applyPositionsToModel(rootHierarchy);\n        });\n    }\n    isCombo(node) {\n        return Boolean(node.isCombo);\n    }\n    resetLayoutState() {\n        this.relativePositions.clear();\n    }\n    layoutHierarchy(combo) {\n        return __awaiter(this, void 0, void 0, function* () {\n            for (const child of combo.children || []) {\n                if (this.isCombo(child))\n                    yield this.layoutHierarchy(child);\n            }\n            const childElements = combo.children || [];\n            if (childElements.length === 0) {\n                combo.size = [0, 0, 0];\n                combo.parentId = combo.id === ROOT_ID ? null : combo.parentId;\n                return;\n            }\n            const _a = this.getLayoutConfig(combo), { type } = _a, options = __rest(_a, [\"type\"]);\n            const LayoutClass = this.getLayoutClass(type);\n            const layoutInstance = new LayoutClass(options);\n            const tmpGraphData = this.createTemporaryGraphData(childElements);\n            yield executeLayout(layoutInstance, tmpGraphData, {});\n            const partialNodes = layoutInstance.model.nodes();\n            this.recordRelativePositions(partialNodes, combo);\n            const { center, width, height } = this.calculateComboBounds(combo);\n            combo.size = [width, height, 0];\n            (combo.children || []).forEach((child) => {\n                const rel = this.relativePositions.get(child.id);\n                if (!rel)\n                    return;\n                const pos = Object.assign(Object.assign({}, rel), { x: rel.x - center[0], y: rel.y - center[1] });\n                this.relativePositions.set(child.id, pos);\n            });\n        });\n    }\n    recordRelativePositions(nodes, related) {\n        const comboCenter = this.calculateComboCenter(nodes);\n        nodes.forEach((node) => {\n            this.relativePositions.set(node.id, {\n                x: node.x - comboCenter[0],\n                y: node.y - comboCenter[1],\n                relativeTo: String(related.id),\n            });\n        });\n    }\n    buildHierarchyTree() {\n        const rootNode = {\n            id: ROOT_ID,\n            isCombo: true,\n            children: [],\n            parentId: null,\n        };\n        const comboNodeMap = new Map();\n        comboNodeMap.set(ROOT_ID, rootNode);\n        this.model.forEachNode((node) => {\n            if (this.isCombo(node)) {\n                const combo = Object.assign(Object.assign({}, node), { children: [], parentId: this.getParentId(node) });\n                comboNodeMap.set(String(node.id), combo);\n            }\n        });\n        this.model.forEachNode((node) => {\n            const parentNode = comboNodeMap.get(this.getParentId(node));\n            if (this.isCombo(node)) {\n                const combo = comboNodeMap.get(String(node.id));\n                if (parentNode && combo) {\n                    parentNode.children.push(combo);\n                    combo.parentId = parentNode.id;\n                }\n            }\n            else {\n                if (parentNode) {\n                    parentNode.children.push(Object.assign(Object.assign({}, node), { children: [], parentId: this.getParentId(node) }));\n                }\n            }\n        });\n        return rootNode;\n    }\n    convertToGlobalPositions(combo, parent) {\n        var _a, _b;\n        const relativePos = combo.id === ROOT_ID ? null : this.relativePositions.get(combo.id);\n        const globalX = parent[0] + ((_a = relativePos === null || relativePos === void 0 ? void 0 : relativePos.x) !== null && _a !== void 0 ? _a : 0);\n        const globalY = parent[1] + ((_b = relativePos === null || relativePos === void 0 ? void 0 : relativePos.y) !== null && _b !== void 0 ? _b : 0);\n        combo.x = globalX;\n        combo.y = globalY;\n        (combo.children || []).forEach((child) => {\n            var _a, _b;\n            const childRelativePos = this.relativePositions.get(child.id);\n            child.x = globalX + ((_a = childRelativePos === null || childRelativePos === void 0 ? void 0 : childRelativePos.x) !== null && _a !== void 0 ? _a : 0);\n            child.y = globalY + ((_b = childRelativePos === null || childRelativePos === void 0 ? void 0 : childRelativePos.y) !== null && _b !== void 0 ? _b : 0);\n            child.size = this.getNodeLikeSize(child, false);\n            if (this.isCombo(child)) {\n                this.convertToGlobalPositions(child, [globalX, globalY]);\n            }\n        });\n    }\n    getLayoutConfig(combo) {\n        const layout = typeof this.options.layout === 'object'\n            ? this.options.layout\n            : formatFn(this.options.layout, ['comboId']);\n        if (typeof layout === 'function') {\n            const comboId = combo.id === ROOT_ID ? null : combo.id;\n            return this.normalizeLayoutConfig(layout(comboId));\n        }\n        return this.normalizeLayoutConfig(layout);\n    }\n    normalizeLayoutConfig(config) {\n        const base = Object.assign(Object.assign({ type: 'concentric' }, normalizeViewport(this.options)), { nodeSize: 'node.size', nodeSpacing: 0 });\n        if (!config)\n            return base;\n        if (typeof config === 'string')\n            return Object.assign(Object.assign({}, base), { type: config });\n        return Object.assign(Object.assign({}, base), config);\n    }\n    getLayoutClass(layoutType) {\n        return registry[layoutType] || registry.concentric;\n    }\n    createTemporaryGraphData(nodes) {\n        const tmpNodes = nodes.map((node) => (Object.assign(Object.assign({}, node), { size: this.getNodeLikeSize(node) })));\n        const nodeIds = new Set(nodes.map((e) => String(e.id)));\n        const tmpEdges = [];\n        const resolveToClosestAncestorInSet = (id) => {\n            let current = String(id);\n            const visited = new Set();\n            while (current && !visited.has(current)) {\n                if (nodeIds.has(current))\n                    return current;\n                visited.add(current);\n                const node = this.model.node(current);\n                const parentId = node === null || node === void 0 ? void 0 : node.parentId;\n                current = parentId == null ? null : String(parentId);\n            }\n            return null;\n        };\n        this.model.forEachEdge((edge) => {\n            const source = resolveToClosestAncestorInSet(String(edge.source));\n            const target = resolveToClosestAncestorInSet(String(edge.target));\n            if (!source || !target)\n                return;\n            if (source === target)\n                return;\n            tmpEdges.push({ source, target });\n        });\n        return {\n            nodes: tmpNodes,\n            edges: tmpEdges,\n        };\n    }\n    calculateComboCenter(nodes) {\n        if (nodes.length === 0)\n            return [0, 0];\n        const sizeMap = new Map();\n        nodes.forEach((child) => {\n            const size = this.getNodeLikeSize(child);\n            sizeMap.set(child.id, size);\n        });\n        let minX = Infinity;\n        let minY = Infinity;\n        let maxX = -Infinity;\n        let maxY = -Infinity;\n        nodes.forEach((node) => {\n            const [w = 0, h = 0] = sizeMap.get(node.id);\n            minX = Math.min(minX, node.x - w / 2);\n            minY = Math.min(minY, node.y - h / 2);\n            maxX = Math.max(maxX, node.x + w / 2);\n            maxY = Math.max(maxY, node.y + h / 2);\n        });\n        if (!Number.isFinite(minX) || !Number.isFinite(minY))\n            return [0, 0];\n        return [(minX + maxX) / 2, (minY + maxY) / 2];\n    }\n    calculateComboBounds(combo) {\n        const children = combo.children || [];\n        if (children.length === 0) {\n            return { center: [0, 0], width: 0, height: 0 };\n        }\n        let minX = Infinity;\n        let minY = Infinity;\n        let maxX = -Infinity;\n        let maxY = -Infinity;\n        children.forEach((child) => {\n            var _a, _b;\n            const relativePos = this.relativePositions.get(child.id);\n            const x = (_a = relativePos === null || relativePos === void 0 ? void 0 : relativePos.x) !== null && _a !== void 0 ? _a : 0;\n            const y = (_b = relativePos === null || relativePos === void 0 ? void 0 : relativePos.y) !== null && _b !== void 0 ? _b : 0;\n            const [width, height] = this.getNodeLikeSize(child);\n            minX = Math.min(minX, x - width / 2);\n            minY = Math.min(minY, y - height / 2);\n            maxX = Math.max(maxX, x + width / 2);\n            maxY = Math.max(maxY, y + height / 2);\n        });\n        if (!Number.isFinite(minX) || !Number.isFinite(minY)) {\n            return { center: [0, 0], width: 0, height: 0 };\n        }\n        const comboPaddingFn = formatNumberFn(this.options.comboPadding, 20, 'combo');\n        const padding = comboPaddingFn(combo._original);\n        return {\n            center: [(minX + maxX) / 2, (minY + maxY) / 2],\n            width: maxX - minX + padding * 2,\n            height: maxY - minY + padding * 2,\n        };\n    }\n    getNodeLikeSize(node, includeSpacing = true) {\n        if (this.isCombo(node))\n            return this.getComboSize(node, includeSpacing);\n        return this.getNodeSize(node, includeSpacing);\n    }\n    getNodeSize(node, includeSpacing = true) {\n        const { nodeSize, nodeSpacing } = this.options;\n        const sizeFn = formatNodeSizeFn(nodeSize, includeSpacing ? nodeSpacing : 0);\n        return sizeFn(node._original);\n    }\n    getComboSize(combo, includeSpacing = true) {\n        const comboSpacingFn = formatNumberFn(this.options.comboSpacing, 0, 'combo');\n        const spacing = includeSpacing ? comboSpacingFn(combo._original) : 0;\n        const [width, height] = combo.size;\n        return [width + spacing / 2, height + spacing / 2, 0];\n    }\n    applyPositionsToModel(rootHierarchy) {\n        const apply = (datum) => {\n            const node = this.model.node(datum.id);\n            if (!node)\n                return;\n            node.x = datum.x;\n            node.y = datum.y;\n            if (datum.size)\n                node.size = datum.size;\n        };\n        const traverseAndApply = (combo) => {\n            if (combo.id !== ROOT_ID)\n                apply(combo);\n            (combo.children || []).forEach((child) => {\n                if (this.isCombo(child)) {\n                    traverseAndApply(child);\n                }\n                else {\n                    apply(child);\n                }\n            });\n        };\n        traverseAndApply(rootHierarchy);\n    }\n}\nfunction executeLayout(layout, graphData, options = {}) {\n    var _a;\n    return __awaiter(this, void 0, void 0, function* () {\n        if (isLayoutWithIterations(layout)) {\n            layout.execute(graphData, options);\n            layout.stop();\n            return layout.tick((_a = options.iterations) !== null && _a !== void 0 ? _a : 300);\n        }\n        return yield layout.execute(graphData, options);\n    });\n}\n\nexport { ComboCombinedLayout };\n//# sourceMappingURL=index.js.map\n"],"names":["DEFAULT_OPTIONS","comboId","ROOT_ID","ComboCombinedLayout","BaseLayout","node","__awaiter","center","normalizeViewport","rootHierarchy","combo","child","childElements","_a","type","options","__rest","LayoutClass","layoutInstance","tmpGraphData","executeLayout","partialNodes","width","height","rel","pos","nodes","related","comboCenter","rootNode","comboNodeMap","parentNode","parent","_b","relativePos","globalX","globalY","childRelativePos","layout","formatFn","config","base","layoutType","registry","tmpNodes","nodeIds","e","tmpEdges","resolveToClosestAncestorInSet","id","current","visited","parentId","edge","source","target","sizeMap","size","minX","minY","maxX","maxY","w","h","children","x","y","padding","formatNumberFn","includeSpacing","nodeSize","nodeSpacing","formatNodeSizeFn","comboSpacingFn","spacing","apply","datum","traverseAndApply","graphData","isLayoutWithIterations"],"mappings":";;;;;AAOA,MAAMA,IAAkB;AAAA,EACpB,QAAQ,CAACC,MAAaA,IAEhB,EAAE,MAAM,cAAc,gBAAgB,GAAI,IAD1C,EAAE,MAAM,SAAS,gBAAgB,GAAI;AAAA,EAE3C,UAAU;AAAA,EACV,aAAa;AAAA,EACb,cAAc;AAAA,EACd,cAAc;AAClB,GACMC,IAAU;AAMhB,MAAMC,UAA4BC,EAAW;AAAA,EACzC,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,KAAK,kBACV,KAAK,oBAAoB,oBAAI,IAAG,GAChC,KAAK,cAAc,CAACC,MACTA,EAAK,YAAYH;AAAA,EAEhC;AAAA,EACA,oBAAoB;AAChB,WAAOF;AAAA,EACX;AAAA,EACA,SAAS;AACL,WAAOM,EAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAM,EAAE,QAAAC,EAAM,IAAKC,EAAkB,KAAK,OAAO;AACjD,WAAK,iBAAgB;AAErB,YAAMC,IAAgB,KAAK,mBAAkB;AAE7C,YAAM,KAAK,gBAAgBA,CAAa,GAExC,KAAK,yBAAyBA,GAAeF,CAAM,GAEnD,KAAK,sBAAsBE,CAAa;AAAA,IAC5C,CAAC;AAAA,EACL;AAAA,EACA,QAAQJ,GAAM;AACV,WAAO,EAAQA,EAAK;AAAA,EACxB;AAAA,EACA,mBAAmB;AACf,SAAK,kBAAkB,MAAK;AAAA,EAChC;AAAA,EACA,gBAAgBK,GAAO;AACnB,WAAOJ,EAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,iBAAWK,KAASD,EAAM,YAAY,CAAA;AAClC,QAAI,KAAK,QAAQC,CAAK,MAClB,MAAM,KAAK,gBAAgBA,CAAK;AAExC,YAAMC,IAAgBF,EAAM,YAAY,CAAA;AACxC,UAAIE,EAAc,WAAW,GAAG;AAC5B,QAAAF,EAAM,OAAO,CAAC,GAAG,GAAG,CAAC,GACrBA,EAAM,WAAWA,EAAM,OAAOR,IAAU,OAAOQ,EAAM;AACrD;AAAA,MACJ;AACA,YAAMG,IAAK,KAAK,gBAAgBH,CAAK,GAAG,EAAE,MAAAI,MAASD,GAAIE,IAAUC,EAAOH,GAAI,CAAC,MAAM,CAAC,GAC9EI,IAAc,KAAK,eAAeH,CAAI,GACtCI,IAAiB,IAAID,EAAYF,CAAO,GACxCI,IAAe,KAAK,yBAAyBP,CAAa;AAChE,YAAMQ,EAAcF,GAAgBC,GAAc,EAAE;AACpD,YAAME,IAAeH,EAAe,MAAM,MAAK;AAC/C,WAAK,wBAAwBG,GAAcX,CAAK;AAChD,YAAM,EAAE,QAAAH,GAAQ,OAAAe,GAAO,QAAAC,EAAM,IAAK,KAAK,qBAAqBb,CAAK;AACjE,MAAAA,EAAM,OAAO,CAACY,GAAOC,GAAQ,CAAC,IAC7Bb,EAAM,YAAY,CAAA,GAAI,QAAQ,CAACC,MAAU;AACtC,cAAMa,IAAM,KAAK,kBAAkB,IAAIb,EAAM,EAAE;AAC/C,YAAI,CAACa;AACD;AACJ,cAAMC,IAAM,OAAO,OAAO,OAAO,OAAO,CAAA,GAAID,CAAG,GAAG,EAAE,GAAGA,EAAI,IAAIjB,EAAO,CAAC,GAAG,GAAGiB,EAAI,IAAIjB,EAAO,CAAC,GAAG;AAChG,aAAK,kBAAkB,IAAII,EAAM,IAAIc,CAAG;AAAA,MAC5C,CAAC;AAAA,IACL,CAAC;AAAA,EACL;AAAA,EACA,wBAAwBC,GAAOC,GAAS;AACpC,UAAMC,IAAc,KAAK,qBAAqBF,CAAK;AACnD,IAAAA,EAAM,QAAQ,CAACrB,MAAS;AACpB,WAAK,kBAAkB,IAAIA,EAAK,IAAI;AAAA,QAChC,GAAGA,EAAK,IAAIuB,EAAY,CAAC;AAAA,QACzB,GAAGvB,EAAK,IAAIuB,EAAY,CAAC;AAAA,QACzB,YAAY,OAAOD,EAAQ,EAAE;AAAA,MAC7C,CAAa;AAAA,IACL,CAAC;AAAA,EACL;AAAA,EACA,qBAAqB;AACjB,UAAME,IAAW;AAAA,MACb,IAAI3B;AAAA,MACJ,SAAS;AAAA,MACT,UAAU,CAAA;AAAA,MACV,UAAU;AAAA,IACtB,GACc4B,IAAe,oBAAI,IAAG;AAC5B,WAAAA,EAAa,IAAI5B,GAAS2B,CAAQ,GAClC,KAAK,MAAM,YAAY,CAACxB,MAAS;AAC7B,UAAI,KAAK,QAAQA,CAAI,GAAG;AACpB,cAAMK,IAAQ,OAAO,OAAO,OAAO,OAAO,CAAA,GAAIL,CAAI,GAAG,EAAE,UAAU,CAAA,GAAI,UAAU,KAAK,YAAYA,CAAI,GAAG;AACvG,QAAAyB,EAAa,IAAI,OAAOzB,EAAK,EAAE,GAAGK,CAAK;AAAA,MAC3C;AAAA,IACJ,CAAC,GACD,KAAK,MAAM,YAAY,CAACL,MAAS;AAC7B,YAAM0B,IAAaD,EAAa,IAAI,KAAK,YAAYzB,CAAI,CAAC;AAC1D,UAAI,KAAK,QAAQA,CAAI,GAAG;AACpB,cAAMK,IAAQoB,EAAa,IAAI,OAAOzB,EAAK,EAAE,CAAC;AAC9C,QAAI0B,KAAcrB,MACdqB,EAAW,SAAS,KAAKrB,CAAK,GAC9BA,EAAM,WAAWqB,EAAW;AAAA,MAEpC;AAEI,QAAIA,KACAA,EAAW,SAAS,KAAK,OAAO,OAAO,OAAO,OAAO,IAAI1B,CAAI,GAAG,EAAE,UAAU,CAAA,GAAI,UAAU,KAAK,YAAYA,CAAI,EAAC,CAAE,CAAC;AAAA,IAG/H,CAAC,GACMwB;AAAA,EACX;AAAA,EACA,yBAAyBnB,GAAOsB,GAAQ;AACpC,QAAInB,GAAIoB;AACR,UAAMC,IAAcxB,EAAM,OAAOR,IAAU,OAAO,KAAK,kBAAkB,IAAIQ,EAAM,EAAE,GAC/EyB,IAAUH,EAAO,CAAC,MAAMnB,IAAKqB,KAAgB,OAAiC,SAASA,EAAY,OAAO,QAAQrB,MAAO,SAASA,IAAK,IACvIuB,IAAUJ,EAAO,CAAC,MAAMC,IAAKC,KAAgB,OAAiC,SAASA,EAAY,OAAO,QAAQD,MAAO,SAASA,IAAK;AAC7I,IAAAvB,EAAM,IAAIyB,GACVzB,EAAM,IAAI0B,IACT1B,EAAM,YAAY,CAAA,GAAI,QAAQ,CAACC,MAAU;AACtC,UAAIE,GAAIoB;AACR,YAAMI,IAAmB,KAAK,kBAAkB,IAAI1B,EAAM,EAAE;AAC5D,MAAAA,EAAM,IAAIwB,MAAYtB,IAAKwB,KAAqB,OAAsC,SAASA,EAAiB,OAAO,QAAQxB,MAAO,SAASA,IAAK,IACpJF,EAAM,IAAIyB,MAAYH,IAAKI,KAAqB,OAAsC,SAASA,EAAiB,OAAO,QAAQJ,MAAO,SAASA,IAAK,IACpJtB,EAAM,OAAO,KAAK,gBAAgBA,GAAO,EAAK,GAC1C,KAAK,QAAQA,CAAK,KAClB,KAAK,yBAAyBA,GAAO,CAACwB,GAASC,CAAO,CAAC;AAAA,IAE/D,CAAC;AAAA,EACL;AAAA,EACA,gBAAgB1B,GAAO;AACnB,UAAM4B,IAAS,OAAO,KAAK,QAAQ,UAAW,WACxC,KAAK,QAAQ,SACbC,EAAS,KAAK,QAAQ,QAAQ,CAAC,SAAS,CAAC;AAC/C,QAAI,OAAOD,KAAW,YAAY;AAC9B,YAAMrC,IAAUS,EAAM,OAAOR,IAAU,OAAOQ,EAAM;AACpD,aAAO,KAAK,sBAAsB4B,EAAOrC,CAAO,CAAC;AAAA,IACrD;AACA,WAAO,KAAK,sBAAsBqC,CAAM;AAAA,EAC5C;AAAA,EACA,sBAAsBE,GAAQ;AAC1B,UAAMC,IAAO,OAAO,OAAO,OAAO,OAAO,EAAE,MAAM,aAAY,GAAIjC,EAAkB,KAAK,OAAO,CAAC,GAAG,EAAE,UAAU,aAAa,aAAa,GAAG;AAC5I,WAAKgC,IAED,OAAOA,KAAW,WACX,OAAO,OAAO,OAAO,OAAO,IAAIC,CAAI,GAAG,EAAE,MAAMD,GAAQ,IAC3D,OAAO,OAAO,OAAO,OAAO,IAAIC,CAAI,GAAGD,CAAM,IAHzCC;AAAA,EAIf;AAAA,EACA,eAAeC,GAAY;AACvB,WAAOC,EAASD,CAAU,KAAKC,EAAS;AAAA,EAC5C;AAAA,EACA,yBAAyBjB,GAAO;AAC5B,UAAMkB,IAAWlB,EAAM,IAAI,CAACrB,MAAU,OAAO,OAAO,OAAO,OAAO,CAAA,GAAIA,CAAI,GAAG,EAAE,MAAM,KAAK,gBAAgBA,CAAI,EAAC,CAAE,CAAE,GAC7GwC,IAAU,IAAI,IAAInB,EAAM,IAAI,CAACoB,MAAM,OAAOA,EAAE,EAAE,CAAC,CAAC,GAChDC,IAAW,CAAA,GACXC,IAAgC,CAACC,MAAO;AAC1C,UAAIC,IAAU,OAAOD,CAAE;AACvB,YAAME,IAAU,oBAAI,IAAG;AACvB,aAAOD,KAAW,CAACC,EAAQ,IAAID,CAAO,KAAG;AACrC,YAAIL,EAAQ,IAAIK,CAAO;AACnB,iBAAOA;AACX,QAAAC,EAAQ,IAAID,CAAO;AACnB,cAAM7C,IAAO,KAAK,MAAM,KAAK6C,CAAO,GAC9BE,IAAW/C,KAAS,OAA0B,SAASA,EAAK;AAClE,QAAA6C,IAAUE,KAAY,OAAO,OAAO,OAAOA,CAAQ;AAAA,MACvD;AACA,aAAO;AAAA,IACX;AACA,gBAAK,MAAM,YAAY,CAACC,MAAS;AAC7B,YAAMC,IAASN,EAA8B,OAAOK,EAAK,MAAM,CAAC,GAC1DE,IAASP,EAA8B,OAAOK,EAAK,MAAM,CAAC;AAChE,MAAI,CAACC,KAAU,CAACC,KAEZD,MAAWC,KAEfR,EAAS,KAAK,EAAE,QAAAO,GAAQ,QAAAC,EAAM,CAAE;AAAA,IACpC,CAAC,GACM;AAAA,MACH,OAAOX;AAAA,MACP,OAAOG;AAAA,IACnB;AAAA,EACI;AAAA,EACA,qBAAqBrB,GAAO;AACxB,QAAIA,EAAM,WAAW;AACjB,aAAO,CAAC,GAAG,CAAC;AAChB,UAAM8B,IAAU,oBAAI,IAAG;AACvB,IAAA9B,EAAM,QAAQ,CAACf,MAAU;AACrB,YAAM8C,IAAO,KAAK,gBAAgB9C,CAAK;AACvC,MAAA6C,EAAQ,IAAI7C,EAAM,IAAI8C,CAAI;AAAA,IAC9B,CAAC;AACD,QAAIC,IAAO,OACPC,IAAO,OACPC,IAAO,QACPC,IAAO;AAQX,WAPAnC,EAAM,QAAQ,CAACrB,MAAS;AACpB,YAAM,CAACyD,IAAI,GAAGC,IAAI,CAAC,IAAIP,EAAQ,IAAInD,EAAK,EAAE;AAC1C,MAAAqD,IAAO,KAAK,IAAIA,GAAMrD,EAAK,IAAIyD,IAAI,CAAC,GACpCH,IAAO,KAAK,IAAIA,GAAMtD,EAAK,IAAI0D,IAAI,CAAC,GACpCH,IAAO,KAAK,IAAIA,GAAMvD,EAAK,IAAIyD,IAAI,CAAC,GACpCD,IAAO,KAAK,IAAIA,GAAMxD,EAAK,IAAI0D,IAAI,CAAC;AAAA,IACxC,CAAC,GACG,CAAC,OAAO,SAASL,CAAI,KAAK,CAAC,OAAO,SAASC,CAAI,IACxC,CAAC,GAAG,CAAC,IACT,EAAED,IAAOE,KAAQ,IAAID,IAAOE,KAAQ,CAAC;AAAA,EAChD;AAAA,EACA,qBAAqBnD,GAAO;AACxB,UAAMsD,IAAWtD,EAAM,YAAY,CAAA;AACnC,QAAIsD,EAAS,WAAW;AACpB,aAAO,EAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,OAAO,GAAG,QAAQ,EAAC;AAEhD,QAAIN,IAAO,OACPC,IAAO,OACPC,IAAO,QACPC,IAAO;AAYX,QAXAG,EAAS,QAAQ,CAACrD,MAAU;AACxB,UAAIE,GAAIoB;AACR,YAAMC,IAAc,KAAK,kBAAkB,IAAIvB,EAAM,EAAE,GACjDsD,KAAKpD,IAAKqB,KAAgB,OAAiC,SAASA,EAAY,OAAO,QAAQrB,MAAO,SAASA,IAAK,GACpHqD,KAAKjC,IAAKC,KAAgB,OAAiC,SAASA,EAAY,OAAO,QAAQD,MAAO,SAASA,IAAK,GACpH,CAACX,GAAOC,CAAM,IAAI,KAAK,gBAAgBZ,CAAK;AAClD,MAAA+C,IAAO,KAAK,IAAIA,GAAMO,IAAI3C,IAAQ,CAAC,GACnCqC,IAAO,KAAK,IAAIA,GAAMO,IAAI3C,IAAS,CAAC,GACpCqC,IAAO,KAAK,IAAIA,GAAMK,IAAI3C,IAAQ,CAAC,GACnCuC,IAAO,KAAK,IAAIA,GAAMK,IAAI3C,IAAS,CAAC;AAAA,IACxC,CAAC,GACG,CAAC,OAAO,SAASmC,CAAI,KAAK,CAAC,OAAO,SAASC,CAAI;AAC/C,aAAO,EAAE,QAAQ,CAAC,GAAG,CAAC,GAAG,OAAO,GAAG,QAAQ,EAAC;AAGhD,UAAMQ,IADiBC,EAAe,KAAK,QAAQ,cAAc,IAAI,OAAO,EAC7C1D,EAAM,SAAS;AAC9C,WAAO;AAAA,MACH,QAAQ,EAAEgD,IAAOE,KAAQ,IAAID,IAAOE,KAAQ,CAAC;AAAA,MAC7C,OAAOD,IAAOF,IAAOS,IAAU;AAAA,MAC/B,QAAQN,IAAOF,IAAOQ,IAAU;AAAA,IAC5C;AAAA,EACI;AAAA,EACA,gBAAgB9D,GAAMgE,IAAiB,IAAM;AACzC,WAAI,KAAK,QAAQhE,CAAI,IACV,KAAK,aAAaA,GAAMgE,CAAc,IAC1C,KAAK,YAAYhE,GAAMgE,CAAc;AAAA,EAChD;AAAA,EACA,YAAYhE,GAAMgE,IAAiB,IAAM;AACrC,UAAM,EAAE,UAAAC,GAAU,aAAAC,EAAW,IAAK,KAAK;AAEvC,WADeC,EAAiBF,GAAUD,IAAiBE,IAAc,CAAC,EAC5DlE,EAAK,SAAS;AAAA,EAChC;AAAA,EACA,aAAaK,GAAO2D,IAAiB,IAAM;AACvC,UAAMI,IAAiBL,EAAe,KAAK,QAAQ,cAAc,GAAG,OAAO,GACrEM,IAAUL,IAAiBI,EAAe/D,EAAM,SAAS,IAAI,GAC7D,CAACY,GAAOC,CAAM,IAAIb,EAAM;AAC9B,WAAO,CAACY,IAAQoD,IAAU,GAAGnD,IAASmD,IAAU,GAAG,CAAC;AAAA,EACxD;AAAA,EACA,sBAAsBjE,GAAe;AACjC,UAAMkE,IAAQ,CAACC,MAAU;AACrB,YAAMvE,IAAO,KAAK,MAAM,KAAKuE,EAAM,EAAE;AACrC,MAAKvE,MAELA,EAAK,IAAIuE,EAAM,GACfvE,EAAK,IAAIuE,EAAM,GACXA,EAAM,SACNvE,EAAK,OAAOuE,EAAM;AAAA,IAC1B,GACMC,IAAmB,CAACnE,MAAU;AAChC,MAAIA,EAAM,OAAOR,KACbyE,EAAMjE,CAAK,IACdA,EAAM,YAAY,CAAA,GAAI,QAAQ,CAACC,MAAU;AACtC,QAAI,KAAK,QAAQA,CAAK,IAClBkE,EAAiBlE,CAAK,IAGtBgE,EAAMhE,CAAK;AAAA,MAEnB,CAAC;AAAA,IACL;AACA,IAAAkE,EAAiBpE,CAAa;AAAA,EAClC;AACJ;AACA,SAASW,EAAckB,GAAQwC,GAAW/D,IAAU,CAAA,GAAI;AACpD,MAAIF;AACJ,SAAOP,EAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,WAAIyE,EAAuBzC,CAAM,KAC7BA,EAAO,QAAQwC,GAAW/D,CAAO,GACjCuB,EAAO,KAAI,GACJA,EAAO,MAAMzB,IAAKE,EAAQ,gBAAgB,QAAQF,MAAO,SAASA,IAAK,GAAG,KAE9E,MAAMyB,EAAO,QAAQwC,GAAW/D,CAAO;AAAA,EAClD,CAAC;AACL;","x_google_ignoreList":[0]}