@hkyhy/marsun-components-core 0.1.134 → 0.1.136

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

@@ -1,131 +0,0 @@
-import { __awaiter as q } from "../../node_modules/tslib/tslib.es6.js";
-import { applySingleNodeLayout as F } from "../../util/common.js";
-import { formatNodeSizeFn as I, formatFn as P } from "../../util/format.js";
-import { orderByDegree as b, orderBySorter as k } from "../../util/order.js";
-import { normalizeViewport as C } from "../../util/viewport.js";
-import { BaseLayout as U } from "../base-layout.js";
-const h = {
-  nodeSize: 30,
-  nodeSpacing: 10,
-  preventOverlap: !1,
-  sweep: void 0,
-  equidistant: !1,
-  startAngle: 3 / 2 * Math.PI,
-  clockwise: !0,
-  maxLevelDiff: void 0,
-  sortBy: "degree"
-};
-class J extends U {
-  constructor() {
-    super(...arguments), this.id = "concentric";
-  }
-  getDefaultOptions() {
-    return h;
-  }
-  layout() {
-    return q(this, void 0, void 0, function* () {
-      const { width: z, height: y, center: m } = C(this.options), p = this.model.nodeCount();
-      if (!p || p === 1) {
-        F(this.model, m);
-        return;
-      }
-      const { sortBy: g, maxLevelDiff: w, sweep: x, clockwise: L, equidistant: N, preventOverlap: D, startAngle: T = h.startAngle, nodeSize: B, nodeSpacing: O } = this.options, a = !g || g === "degree" ? "degree" : P(g, ["node"]);
-      if (a === "degree")
-        b(this.model);
-      else {
-        const e = (o, t) => {
-          const n = a(o), r = a(t);
-          return n === r ? 0 : n > r ? -1 : 1;
-        };
-        k(this.model, e);
-      }
-      const M = this.model.nodes(), c = /* @__PURE__ */ new Map();
-      for (const e of M) {
-        const o = a === "degree" ? this.model.degree(e.id) : a(e._original);
-        c.set(e.id, o);
-      }
-      const _ = this.model.firstNode(), u = w || c.get(_.id) / 4, A = I(B, O, h.nodeSize, h.nodeSpacing), S = /* @__PURE__ */ new Map();
-      for (const e of M)
-        S.set(e.id, Math.max(...A(e._original)));
-      const s = [{ nodes: [] }];
-      let d = s[0];
-      for (let e = 0; e < p; e++) {
-        const o = M[e];
-        if (d.nodes.length > 0) {
-          const t = d.nodes[0], n = Math.abs(c.get(t.id) - c.get(o.id));
-          u && n >= u && (d = { nodes: [] }, s.push(d));
-        }
-        d.nodes.push(o);
-      }
-      for (const e of s) {
-        const o = e.nodes.map((t) => S.get(t.id));
-        e.nodeSizes = o, e.maxNodeSize = Math.max(...o);
-      }
-      if (s.forEach((e) => {
-        const o = x === void 0 ? 2 * Math.PI - 2 * Math.PI / e.nodes.length : x;
-        e.dTheta = o / Math.max(1, e.nodes.length - 1);
-      }), D) {
-        let e = 0;
-        for (let o = 0; o < s.length; o++) {
-          const t = s[o];
-          if (t.nodes.length > 1) {
-            const n = t.nodeSizes || [];
-            let r = 0;
-            for (let f = 0; f < n.length - 1; f++)
-              r = Math.max(r, (n[f] + n[f + 1]) / 2);
-            const i = Math.cos(t.dTheta) - Math.cos(0), l = Math.sin(t.dTheta) - Math.sin(0), v = Math.sqrt(i * i + l * l), E = v > 0 ? r / v : 0;
-            e = Math.max(E, e);
-          }
-          if (t.r = e, o < s.length - 1) {
-            const n = s[o + 1], r = ((t.maxNodeSize || 0) + (n.maxNodeSize || 0)) / 2;
-            e += Math.max(0, r);
-          }
-        }
-      } else {
-        let e = 0;
-        s[0].r = 0;
-        for (let n = 0; n < s.length - 1; n++) {
-          const r = s[n], i = s[n + 1], l = ((r.maxNodeSize || 0) + (i.maxNodeSize || 0)) / 2;
-          e += Math.max(0, l), i.r = e;
-        }
-        const o = Math.min(z, y) / 2;
-        let t = 1;
-        for (const n of s) {
-          const r = n.r || 0;
-          if (r <= 0)
-            continue;
-          const i = o - (n.maxNodeSize || 0);
-          if (i <= 0) {
-            t = 0;
-            break;
-          }
-          t = Math.min(t, i / r);
-        }
-        if (t = Math.max(0, Math.min(1, t)), t !== 1)
-          for (const n of s)
-            n.r = (n.r || 0) * t;
-      }
-      if (N) {
-        let e = 0, o = 0;
-        for (let t = 0; t < s.length; t++) {
-          const r = (s[t].r || 0) - o;
-          e = Math.max(e, r);
-        }
-        o = 0, s.forEach((t, n) => {
-          n === 0 && (o = t.r || 0), t.r = o, o += e;
-        });
-      }
-      s.forEach((e) => {
-        const o = e.dTheta || 0, t = e.r || 0;
-        e.nodes.forEach((n, r) => {
-          const i = T + (L ? 1 : -1) * o * r;
-          n.x = m[0] + t * Math.cos(i), n.y = m[1] + t * Math.sin(i);
-        });
-      });
-    });
-  }
-}
-export {
-  J as ConcentricLayout
-};
-//# sourceMappingURL=index.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/concentric/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, formatFn } from '../../util/format.js';\nimport { orderByDegree, orderBySorter } from '../../util/order.js';\nimport { normalizeViewport } from '../../util/viewport.js';\nimport { BaseLayout } from '../base-layout.js';\n\nconst DEFAULTS_LAYOUT_OPTIONS$7 = {\n    nodeSize: 30,\n    nodeSpacing: 10,\n    preventOverlap: false,\n    sweep: undefined,\n    equidistant: false,\n    startAngle: (3 / 2) * Math.PI,\n    clockwise: true,\n    maxLevelDiff: undefined,\n    sortBy: 'degree',\n};\n/**\n * <zh/> 同心圆布局\n *\n * <en/> Concentric layout\n */\nclass ConcentricLayout extends BaseLayout {\n    constructor() {\n        super(...arguments);\n        this.id = 'concentric';\n    }\n    getDefaultOptions() {\n        return DEFAULTS_LAYOUT_OPTIONS$7;\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 { sortBy: propsSortBy, maxLevelDiff: propsMaxLevelDiff, sweep: propsSweep, clockwise, equidistant, preventOverlap, startAngle = DEFAULTS_LAYOUT_OPTIONS$7.startAngle, nodeSize, nodeSpacing, } = this.options;\n            const sortBy = !propsSortBy || propsSortBy === 'degree'\n                ? 'degree'\n                : formatFn(propsSortBy, ['node']);\n            if (sortBy === 'degree') {\n                orderByDegree(this.model);\n            }\n            else {\n                const sorter = (nodeA, nodeB) => {\n                    const a = sortBy(nodeA);\n                    const b = sortBy(nodeB);\n                    return a === b ? 0 : a > b ? -1 : 1;\n                };\n                orderBySorter(this.model, sorter);\n            }\n            const nodes = this.model.nodes();\n            const sortKeys = new Map();\n            for (const node of nodes) {\n                const v = sortBy === 'degree'\n                    ? this.model.degree(node.id)\n                    : sortBy(node._original);\n                sortKeys.set(node.id, v);\n            }\n            const maxValueNode = this.model.firstNode();\n            const maxLevelDiff = propsMaxLevelDiff || sortKeys.get(maxValueNode.id) / 4;\n            const sizeFn = formatNodeSizeFn(nodeSize, nodeSpacing, DEFAULTS_LAYOUT_OPTIONS$7.nodeSize, DEFAULTS_LAYOUT_OPTIONS$7.nodeSpacing);\n            const nodeDistances = new Map();\n            for (const node of nodes) {\n                nodeDistances.set(node.id, Math.max(...sizeFn(node._original)));\n            }\n            // put the values into levels\n            const levels = [{ nodes: [] }];\n            let currentLevel = levels[0];\n            for (let i = 0; i < n; i++) {\n                const node = nodes[i];\n                if (currentLevel.nodes.length > 0) {\n                    const firstNode = currentLevel.nodes[0];\n                    const diff = Math.abs(sortKeys.get(firstNode.id) - sortKeys.get(node.id));\n                    if (maxLevelDiff && diff >= maxLevelDiff) {\n                        currentLevel = { nodes: [] };\n                        levels.push(currentLevel);\n                    }\n                }\n                currentLevel.nodes.push(node);\n            }\n            for (const level of levels) {\n                const nodeSizes = level.nodes.map((node) => nodeDistances.get(node.id));\n                level.nodeSizes = nodeSizes;\n                level.maxNodeSize = Math.max(...nodeSizes);\n            }\n            // find the metrics for each level\n            levels.forEach((level) => {\n                const sweep = propsSweep === undefined\n                    ? 2 * Math.PI - (2 * Math.PI) / level.nodes.length\n                    : propsSweep;\n                level.dTheta = sweep / Math.max(1, level.nodes.length - 1);\n            });\n            // calculate the radius\n            if (preventOverlap) {\n                let r = 0;\n                for (let i = 0; i < levels.length; i++) {\n                    const level = levels[i];\n                    if (level.nodes.length > 1) {\n                        const nodeSizes = level.nodeSizes || [];\n                        let requiredDist = 0;\n                        for (let j = 0; j < nodeSizes.length - 1; j++) {\n                            requiredDist = Math.max(requiredDist, (nodeSizes[j] + nodeSizes[j + 1]) / 2);\n                        }\n                        const dcos = Math.cos(level.dTheta) - Math.cos(0);\n                        const dsin = Math.sin(level.dTheta) - Math.sin(0);\n                        const denom = Math.sqrt(dcos * dcos + dsin * dsin);\n                        const rMin = denom > 0 ? requiredDist / denom : 0;\n                        r = Math.max(rMin, r);\n                    }\n                    level.r = r;\n                    if (i < levels.length - 1) {\n                        const nextLevel = levels[i + 1];\n                        const step = ((level.maxNodeSize || 0) + (nextLevel.maxNodeSize || 0)) / 2;\n                        r += Math.max(0, step);\n                    }\n                }\n            }\n            else {\n                // create radii by node sizes, then constrain to bb (without overlap guarantees)\n                let r = 0;\n                levels[0].r = 0;\n                for (let i = 0; i < levels.length - 1; i++) {\n                    const level = levels[i];\n                    const nextLevel = levels[i + 1];\n                    const step = ((level.maxNodeSize || 0) + (nextLevel.maxNodeSize || 0)) / 2;\n                    r += Math.max(0, step);\n                    nextLevel.r = r;\n                }\n                const maxHalf = Math.min(width, height) / 2;\n                let scale = 1;\n                for (const level of levels) {\n                    const rr = level.r || 0;\n                    if (rr <= 0)\n                        continue;\n                    const allowed = maxHalf - (level.maxNodeSize || 0);\n                    if (allowed <= 0) {\n                        scale = 0;\n                        break;\n                    }\n                    scale = Math.min(scale, allowed / rr);\n                }\n                scale = Math.max(0, Math.min(1, scale));\n                if (scale !== 1) {\n                    for (const level of levels) {\n                        level.r = (level.r || 0) * scale;\n                    }\n                }\n            }\n            if (equidistant) {\n                let rDeltaMax = 0;\n                let rr = 0;\n                for (let i = 0; i < levels.length; i++) {\n                    const level = levels[i];\n                    const rDelta = (level.r || 0) - rr;\n                    rDeltaMax = Math.max(rDeltaMax, rDelta);\n                }\n                rr = 0;\n                levels.forEach((level, i) => {\n                    if (i === 0) {\n                        rr = level.r || 0;\n                    }\n                    level.r = rr;\n                    rr += rDeltaMax;\n                });\n            }\n            // calculate the node positions\n            levels.forEach((level) => {\n                const dTheta = level.dTheta || 0;\n                const rr = level.r || 0;\n                level.nodes.forEach((node, j) => {\n                    const theta = startAngle + (clockwise ? 1 : -1) * dTheta * j;\n                    node.x = center[0] + rr * Math.cos(theta);\n                    node.y = center[1] + rr * Math.sin(theta);\n                });\n            });\n        });\n    }\n}\n\nexport { ConcentricLayout };\n//# sourceMappingURL=index.js.map\n"],"names":["DEFAULTS_LAYOUT_OPTIONS$7","ConcentricLayout","BaseLayout","__awaiter","width","height","center","normalizeViewport","n","applySingleNodeLayout","propsSortBy","propsMaxLevelDiff","propsSweep","clockwise","equidistant","preventOverlap","startAngle","nodeSize","nodeSpacing","sortBy","formatFn","orderByDegree","sorter","nodeA","nodeB","a","b","orderBySorter","nodes","sortKeys","node","v","maxValueNode","maxLevelDiff","sizeFn","formatNodeSizeFn","nodeDistances","levels","currentLevel","i","firstNode","diff","level","nodeSizes","sweep","r","requiredDist","j","dcos","dsin","denom","rMin","nextLevel","step","maxHalf","scale","rr","allowed","rDeltaMax","rDelta","dTheta","theta"],"mappings":";;;;;;AAQA,MAAMA,IAA4B;AAAA,EAC9B,UAAU;AAAA,EACV,aAAa;AAAA,EACb,gBAAgB;AAAA,EAChB,OAAO;AAAA,EACP,aAAa;AAAA,EACb,YAAa,IAAI,IAAK,KAAK;AAAA,EAC3B,WAAW;AAAA,EACX,cAAc;AAAA,EACd,QAAQ;AACZ;AAMA,MAAMC,UAAyBC,EAAW;AAAA,EACtC,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,QAAQI,GAAa,cAAcC,GAAmB,OAAOC,GAAY,WAAAC,GAAW,aAAAC,GAAa,gBAAAC,GAAgB,YAAAC,IAAahB,EAA0B,YAAY,UAAAiB,GAAU,aAAAC,EAAW,IAAM,KAAK,SACtMC,IAAS,CAACT,KAAeA,MAAgB,WACzC,WACAU,EAASV,GAAa,CAAC,MAAM,CAAC;AACpC,UAAIS,MAAW;AACX,QAAAE,EAAc,KAAK,KAAK;AAAA,WAEvB;AACD,cAAMC,IAAS,CAACC,GAAOC,MAAU;AAC7B,gBAAMC,IAAIN,EAAOI,CAAK,GAChBG,IAAIP,EAAOK,CAAK;AACtB,iBAAOC,MAAMC,IAAI,IAAID,IAAIC,IAAI,KAAK;AAAA,QACtC;AACA,QAAAC,EAAc,KAAK,OAAOL,CAAM;AAAA,MACpC;AACA,YAAMM,IAAQ,KAAK,MAAM,MAAK,GACxBC,IAAW,oBAAI,IAAG;AACxB,iBAAWC,KAAQF,GAAO;AACtB,cAAMG,IAAIZ,MAAW,WACf,KAAK,MAAM,OAAOW,EAAK,EAAE,IACzBX,EAAOW,EAAK,SAAS;AAC3B,QAAAD,EAAS,IAAIC,EAAK,IAAIC,CAAC;AAAA,MAC3B;AACA,YAAMC,IAAe,KAAK,MAAM,UAAS,GACnCC,IAAetB,KAAqBkB,EAAS,IAAIG,EAAa,EAAE,IAAI,GACpEE,IAASC,EAAiBlB,GAAUC,GAAalB,EAA0B,UAAUA,EAA0B,WAAW,GAC1HoC,IAAgB,oBAAI,IAAG;AAC7B,iBAAWN,KAAQF;AACf,QAAAQ,EAAc,IAAIN,EAAK,IAAI,KAAK,IAAI,GAAGI,EAAOJ,EAAK,SAAS,CAAC,CAAC;AAGlE,YAAMO,IAAS,CAAC,EAAE,OAAO,CAAA,EAAE,CAAE;AAC7B,UAAIC,IAAeD,EAAO,CAAC;AAC3B,eAASE,IAAI,GAAGA,IAAI/B,GAAG+B,KAAK;AACxB,cAAMT,IAAOF,EAAMW,CAAC;AACpB,YAAID,EAAa,MAAM,SAAS,GAAG;AAC/B,gBAAME,IAAYF,EAAa,MAAM,CAAC,GAChCG,IAAO,KAAK,IAAIZ,EAAS,IAAIW,EAAU,EAAE,IAAIX,EAAS,IAAIC,EAAK,EAAE,CAAC;AACxE,UAAIG,KAAgBQ,KAAQR,MACxBK,IAAe,EAAE,OAAO,GAAE,GAC1BD,EAAO,KAAKC,CAAY;AAAA,QAEhC;AACA,QAAAA,EAAa,MAAM,KAAKR,CAAI;AAAA,MAChC;AACA,iBAAWY,KAASL,GAAQ;AACxB,cAAMM,IAAYD,EAAM,MAAM,IAAI,CAACZ,MAASM,EAAc,IAAIN,EAAK,EAAE,CAAC;AACtE,QAAAY,EAAM,YAAYC,GAClBD,EAAM,cAAc,KAAK,IAAI,GAAGC,CAAS;AAAA,MAC7C;AASA,UAPAN,EAAO,QAAQ,CAACK,MAAU;AACtB,cAAME,IAAQhC,MAAe,SACvB,IAAI,KAAK,KAAM,IAAI,KAAK,KAAM8B,EAAM,MAAM,SAC1C9B;AACN,QAAA8B,EAAM,SAASE,IAAQ,KAAK,IAAI,GAAGF,EAAM,MAAM,SAAS,CAAC;AAAA,MAC7D,CAAC,GAEG3B,GAAgB;AAChB,YAAI8B,IAAI;AACR,iBAASN,IAAI,GAAGA,IAAIF,EAAO,QAAQE,KAAK;AACpC,gBAAMG,IAAQL,EAAOE,CAAC;AACtB,cAAIG,EAAM,MAAM,SAAS,GAAG;AACxB,kBAAMC,IAAYD,EAAM,aAAa,CAAA;AACrC,gBAAII,IAAe;AACnB,qBAASC,IAAI,GAAGA,IAAIJ,EAAU,SAAS,GAAGI;AACtC,cAAAD,IAAe,KAAK,IAAIA,IAAeH,EAAUI,CAAC,IAAIJ,EAAUI,IAAI,CAAC,KAAK,CAAC;AAE/E,kBAAMC,IAAO,KAAK,IAAIN,EAAM,MAAM,IAAI,KAAK,IAAI,CAAC,GAC1CO,IAAO,KAAK,IAAIP,EAAM,MAAM,IAAI,KAAK,IAAI,CAAC,GAC1CQ,IAAQ,KAAK,KAAKF,IAAOA,IAAOC,IAAOA,CAAI,GAC3CE,IAAOD,IAAQ,IAAIJ,IAAeI,IAAQ;AAChD,YAAAL,IAAI,KAAK,IAAIM,GAAMN,CAAC;AAAA,UACxB;AAEA,cADAH,EAAM,IAAIG,GACNN,IAAIF,EAAO,SAAS,GAAG;AACvB,kBAAMe,IAAYf,EAAOE,IAAI,CAAC,GACxBc,MAASX,EAAM,eAAe,MAAMU,EAAU,eAAe,MAAM;AACzE,YAAAP,KAAK,KAAK,IAAI,GAAGQ,CAAI;AAAA,UACzB;AAAA,QACJ;AAAA,MACJ,OACK;AAED,YAAIR,IAAI;AACR,QAAAR,EAAO,CAAC,EAAE,IAAI;AACd,iBAASE,IAAI,GAAGA,IAAIF,EAAO,SAAS,GAAGE,KAAK;AACxC,gBAAMG,IAAQL,EAAOE,CAAC,GAChBa,IAAYf,EAAOE,IAAI,CAAC,GACxBc,MAASX,EAAM,eAAe,MAAMU,EAAU,eAAe,MAAM;AACzE,UAAAP,KAAK,KAAK,IAAI,GAAGQ,CAAI,GACrBD,EAAU,IAAIP;AAAA,QAClB;AACA,cAAMS,IAAU,KAAK,IAAIlD,GAAOC,CAAM,IAAI;AAC1C,YAAIkD,IAAQ;AACZ,mBAAWb,KAASL,GAAQ;AACxB,gBAAMmB,IAAKd,EAAM,KAAK;AACtB,cAAIc,KAAM;AACN;AACJ,gBAAMC,IAAUH,KAAWZ,EAAM,eAAe;AAChD,cAAIe,KAAW,GAAG;AACd,YAAAF,IAAQ;AACR;AAAA,UACJ;AACA,UAAAA,IAAQ,KAAK,IAAIA,GAAOE,IAAUD,CAAE;AAAA,QACxC;AAEA,YADAD,IAAQ,KAAK,IAAI,GAAG,KAAK,IAAI,GAAGA,CAAK,CAAC,GAClCA,MAAU;AACV,qBAAWb,KAASL;AAChB,YAAAK,EAAM,KAAKA,EAAM,KAAK,KAAKa;AAAA,MAGvC;AACA,UAAIzC,GAAa;AACb,YAAI4C,IAAY,GACZF,IAAK;AACT,iBAASjB,IAAI,GAAGA,IAAIF,EAAO,QAAQE,KAAK;AAEpC,gBAAMoB,KADQtB,EAAOE,CAAC,EACA,KAAK,KAAKiB;AAChC,UAAAE,IAAY,KAAK,IAAIA,GAAWC,CAAM;AAAA,QAC1C;AACA,QAAAH,IAAK,GACLnB,EAAO,QAAQ,CAACK,GAAOH,MAAM;AACzB,UAAIA,MAAM,MACNiB,IAAKd,EAAM,KAAK,IAEpBA,EAAM,IAAIc,GACVA,KAAME;AAAA,QACV,CAAC;AAAA,MACL;AAEA,MAAArB,EAAO,QAAQ,CAACK,MAAU;AACtB,cAAMkB,IAASlB,EAAM,UAAU,GACzBc,IAAKd,EAAM,KAAK;AACtB,QAAAA,EAAM,MAAM,QAAQ,CAACZ,GAAMiB,MAAM;AAC7B,gBAAMc,IAAQ7C,KAAcH,IAAY,IAAI,MAAM+C,IAASb;AAC3D,UAAAjB,EAAK,IAAIxB,EAAO,CAAC,IAAIkD,IAAK,KAAK,IAAIK,CAAK,GACxC/B,EAAK,IAAIxB,EAAO,CAAC,IAAIkD,IAAK,KAAK,IAAIK,CAAK;AAAA,QAC5C,CAAC;AAAA,MACL,CAAC;AAAA,IACL,CAAC;AAAA,EACL;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/algorithm/d3-force/force-in-a-box.js

@@ -1,156 +0,0 @@
-import Z from "../../node_modules/d3-force/src/simulation.js";
-import _ from "../../node_modules/d3-force/src/x.js";
-import ee from "../../node_modules/d3-force/src/y.js";
-import te from "../../node_modules/d3-force/src/collide.js";
-import ne from "../../node_modules/d3-force/src/manyBody.js";
-import re from "../../node_modules/d3-force/src/link.js";
-const z = (f, c) => f[c];
-function le() {
-  function f(e) {
-    return () => e;
-  }
-  let c = (e) => e.cluster, h = f(1), m = f(-1), p = f(100), k = f(0.1), y = [0, 0], l = [], C = {}, L = [], N = 100, x = 100, d = {
-    none: {
-      x: 0,
-      y: 0
-    }
-  }, v = [], E, B = "force", $ = !0, F = 0.1;
-  function t(e) {
-    if (!$)
-      return t;
-    E.tick(), b();
-    for (let n = 0, i = l.length, r, o = e * F; n < i; ++n)
-      r = l[n], r.vx || (r.vx = 0), r.vy || (r.vy = 0), r.vx += (d[c(r._original)].x - r.x) * o, r.vy += (d[c(r._original)].y - r.y) * o;
-  }
-  function a() {
-    l && I();
-  }
-  function I() {
-    if (!l || !l.length)
-      return;
-    const e = l[0];
-    if (c(e._original) === void 0)
-      throw Error("Couldnt find the grouping attribute for the nodes. Make sure to set it up with forceInABox.groupBy('clusterAttr') before calling .links()");
-    const n = D();
-    E = Z(n.nodes).force("x", _(N).strength(0.1)).force("y", ee(x).strength(0.1)).force("collide", te((i) => i.r).iterations(4)).force("charge", ne().strength(m)).force("links", re(n.nodes.length ? n.links : []).distance(p).strength(k)), v = E.nodes(), b();
-  }
-  function D() {
-    const e = [], n = [], i = {};
-    let r = [], o = {}, s = [];
-    return o = T(l), s = X(L), r = Object.keys(o), r.forEach((u, g) => {
-      const S = o[u];
-      e.push({
-        id: u,
-        size: S.count,
-        r: Math.sqrt(S.sumforceNodeSize / Math.PI)
-      }), i[u] = g;
-    }), s.forEach((u) => {
-      const g = z(u, "source"), S = z(u, "target"), M = i[g], G = i[S];
-      M !== void 0 && G !== void 0 && n.push({
-        source: M,
-        target: G,
-        count: u.count
-      });
-    }), {
-      nodes: e,
-      links: n
-    };
-  }
-  function T(e) {
-    const n = {};
-    return e.forEach((i) => {
-      const r = c(i._original);
-      n[r] || (n[r] = {
-        count: 0,
-        sumforceNodeSize: 0
-      });
-    }), e.forEach((i) => {
-      const r = c(i._original), o = h(i._original), s = n[r];
-      s.count = s.count + 1, s.sumforceNodeSize = s.sumforceNodeSize + Math.PI * (o * o) * 1.3, n[r] = s;
-    }), n;
-  }
-  function X(e) {
-    const n = {}, i = [];
-    return e.forEach((o) => {
-      const s = Y(o);
-      let u = 0;
-      n[s] !== void 0 && (u = n[s]), u += 1, n[s] = u;
-    }), Object.entries(n).forEach(([o, s]) => {
-      const u = o.split("~")[0], g = o.split("~")[1];
-      u !== void 0 && g !== void 0 && i.push({
-        source: u,
-        target: g,
-        count: s
-      });
-    }), i;
-  }
-  function b() {
-    return d = {
-      none: {
-        x: 0,
-        y: 0
-      }
-    }, v.forEach((e) => {
-      d[e.id] = {
-        x: e.x - y[0],
-        y: e.y - y[1]
-      };
-    }), d;
-  }
-  function Y(e) {
-    const n = z(e, "source"), i = z(e, "target"), r = c(C[n]._original), o = c(C[i]._original);
-    return r <= o ? `${r}~${o}` : `${o}~${r}`;
-  }
-  function A(e) {
-    C = {}, e.forEach((n) => {
-      C[n.id] = n;
-    });
-  }
-  function O(e) {
-    return arguments.length ? (B = e, a(), t) : B;
-  }
-  function j(e) {
-    return arguments.length ? typeof e == "string" ? (c = (n) => n[e], t) : (c = e, t) : c;
-  }
-  function w(e) {
-    return arguments.length ? ($ = e, t) : $;
-  }
-  function P(e) {
-    return arguments.length ? (F = e, t) : F;
-  }
-  function q(e) {
-    return arguments.length ? (N = e, t) : N;
-  }
-  function K(e) {
-    return arguments.length ? (x = e, t) : x;
-  }
-  function W(e) {
-    return arguments.length ? (A(e || []), l = e || [], t) : l;
-  }
-  function H(e) {
-    return arguments.length ? (L = e || [], a(), t) : L;
-  }
-  function J(e) {
-    return arguments.length ? (typeof e == "function" ? h = e : h = f(+e), a(), t) : h;
-  }
-  function Q(e) {
-    return arguments.length ? (typeof e == "function" ? m = e : m = f(+e), a(), t) : m;
-  }
-  function R(e) {
-    return arguments.length ? (typeof e == "function" ? p = e : p = f(+e), a(), t) : p;
-  }
-  function U(e) {
-    return arguments.length ? (typeof e == "function" ? k = e : k = f(+e), a(), t) : k;
-  }
-  function V(e) {
-    return arguments.length ? (y = e, t) : y;
-  }
-  return t.initialize = (e) => {
-    l = e, a();
-  }, t.template = O, t.groupBy = j, t.enableGrouping = w, t.strength = P, t.centerX = q, t.centerY = K, t.nodes = W, t.links = H, t.forceNodeSize = J, t.nodeSize = t.forceNodeSize, t.forceCharge = Q, t.forceLinkDistance = R, t.forceLinkStrength = U, t.offset = V, t.getFocis = b, t;
-}
-export {
-  le as default,
-  z as getEdgeTerminal
-};
-//# sourceMappingURL=force-in-a-box.js.map

package/dist/node_modules/@antv/layout/lib/algorithm/d3-force/force-in-a-box.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"force-in-a-box.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/d3-force/force-in-a-box.js"],"sourcesContent":["import forceSimulation from '../../node_modules/d3-force/src/simulation.js';\nimport forceX from '../../node_modules/d3-force/src/x.js';\nimport forceY from '../../node_modules/d3-force/src/y.js';\nimport forceCollide from '../../node_modules/d3-force/src/collide.js';\nimport forceManyBody from '../../node_modules/d3-force/src/manyBody.js';\nimport forceLink from '../../node_modules/d3-force/src/link.js';\n\nconst getEdgeTerminal = (edge, type) => {\n    const terminal = edge[type];\n    return terminal;\n};\n// https://github.com/john-guerra/forceInABox/blob/master/src/forceInABox.js\nfunction forceInABox() {\n    function constant(_) {\n        return () => _;\n    }\n    let groupBy = (d) => {\n        return d.cluster;\n        // return d.group;\n    };\n    let forceNodeSize = constant(1);\n    let forceCharge = constant(-1);\n    let forceLinkDistance = constant(100);\n    let forceLinkStrength = constant(0.1);\n    let offset = [0, 0];\n    let nodes = [];\n    let nodesMap = {};\n    let links = [];\n    let centerX = 100;\n    let centerY = 100;\n    let foci = {\n        none: {\n            x: 0,\n            y: 0,\n        },\n    };\n    let templateNodes = [];\n    let templateForce;\n    let template = 'force';\n    let enableGrouping = true;\n    let strength = 0.1;\n    function force(alpha) {\n        if (!enableGrouping) {\n            return force;\n        }\n        templateForce.tick();\n        getFocisFromTemplate();\n        for (let i = 0, n = nodes.length, node, k = alpha * strength; i < n; ++i) {\n            node = nodes[i];\n            node.vx || (node.vx = 0);\n            node.vy || (node.vy = 0);\n            node.vx += (foci[groupBy(node._original)].x - node.x) * k;\n            node.vy += (foci[groupBy(node._original)].y - node.y) * k;\n        }\n    }\n    function initialize() {\n        if (!nodes)\n            return;\n        initializeWithForce();\n    }\n    function initializeWithForce() {\n        if (!nodes || !nodes.length) {\n            return;\n        }\n        const node = nodes[0];\n        if (groupBy(node._original) === undefined) {\n            throw Error(\"Couldnt find the grouping attribute for the nodes. Make sure to set it up with forceInABox.groupBy('clusterAttr') before calling .links()\");\n        }\n        // checkLinksAsObjects();\n        const net = getGroupsGraph();\n        templateForce = forceSimulation(net.nodes)\n            .force('x', forceX(centerX).strength(0.1))\n            .force('y', forceY(centerY).strength(0.1))\n            .force('collide', forceCollide((d) => d.r).iterations(4))\n            .force('charge', forceManyBody().strength(forceCharge))\n            .force('links', forceLink(net.nodes.length ? net.links : [])\n            .distance(forceLinkDistance)\n            .strength(forceLinkStrength));\n        templateNodes = templateForce.nodes();\n        getFocisFromTemplate();\n    }\n    function getGroupsGraph() {\n        const gnodes = [];\n        const glinks = [];\n        const dNodes = {};\n        let clustersList = [];\n        let clustersCounts = {};\n        let clustersLinks = [];\n        clustersCounts = computeClustersNodeCounts(nodes);\n        clustersLinks = computeClustersLinkCounts(links);\n        clustersList = Object.keys(clustersCounts);\n        clustersList.forEach((key, index) => {\n            const val = clustersCounts[key];\n            // Uses approx meta-node size\n            gnodes.push({\n                id: key,\n                size: val.count,\n                r: Math.sqrt(val.sumforceNodeSize / Math.PI),\n            });\n            dNodes[key] = index;\n        });\n        clustersLinks.forEach((l) => {\n            const sourceTerminal = getEdgeTerminal(l, 'source');\n            const targetTerminal = getEdgeTerminal(l, 'target');\n            const source = dNodes[sourceTerminal];\n            const target = dNodes[targetTerminal];\n            if (source !== undefined && target !== undefined) {\n                glinks.push({\n                    source,\n                    target,\n                    count: l.count,\n                });\n            }\n        });\n        return {\n            nodes: gnodes,\n            links: glinks,\n        };\n    }\n    function computeClustersNodeCounts(nodes) {\n        const clustersCounts = {};\n        nodes.forEach((d) => {\n            const key = groupBy(d._original);\n            if (!clustersCounts[key]) {\n                clustersCounts[key] = {\n                    count: 0,\n                    sumforceNodeSize: 0,\n                };\n            }\n        });\n        nodes.forEach((d) => {\n            const key = groupBy(d._original);\n            const nodeSize = forceNodeSize(d._original);\n            const tmpCount = clustersCounts[key];\n            tmpCount.count = tmpCount.count + 1;\n            tmpCount.sumforceNodeSize =\n                tmpCount.sumforceNodeSize + Math.PI * (nodeSize * nodeSize) * 1.3;\n            clustersCounts[key] = tmpCount;\n        });\n        return clustersCounts;\n    }\n    function computeClustersLinkCounts(links) {\n        const dClusterLinks = {};\n        const clusterLinks = [];\n        links.forEach((l) => {\n            const key = getLinkKey(l);\n            let count = 0;\n            if (dClusterLinks[key] !== undefined) {\n                count = dClusterLinks[key];\n            }\n            count += 1;\n            dClusterLinks[key] = count;\n        });\n        // @ts-ignore\n        const entries = Object.entries(dClusterLinks);\n        entries.forEach(([key, count]) => {\n            const source = key.split('~')[0];\n            const target = key.split('~')[1];\n            if (source !== undefined && target !== undefined) {\n                clusterLinks.push({\n                    source,\n                    target,\n                    count,\n                });\n            }\n        });\n        return clusterLinks;\n    }\n    function getFocisFromTemplate() {\n        foci = {\n            none: {\n                x: 0,\n                y: 0,\n            },\n        };\n        templateNodes.forEach((d) => {\n            foci[d.id] = {\n                x: d.x - offset[0],\n                y: d.y - offset[1],\n            };\n        });\n        return foci;\n    }\n    function getLinkKey(l) {\n        const source = getEdgeTerminal(l, 'source');\n        const target = getEdgeTerminal(l, 'target');\n        const sourceID = groupBy(nodesMap[source]._original);\n        const targetID = groupBy(nodesMap[target]._original);\n        return sourceID <= targetID\n            ? `${sourceID}~${targetID}`\n            : `${targetID}~${sourceID}`;\n    }\n    function genNodesMap(nodes) {\n        nodesMap = {};\n        nodes.forEach((node) => {\n            nodesMap[node.id] = node;\n        });\n    }\n    function setTemplate(x) {\n        if (!arguments.length)\n            return template;\n        template = x;\n        initialize();\n        return force;\n    }\n    function setGroupBy(x) {\n        if (!arguments.length)\n            return groupBy;\n        if (typeof x === 'string') {\n            groupBy = (d) => {\n                return d[x];\n            };\n            return force;\n        }\n        groupBy = x;\n        return force;\n    }\n    function setEnableGrouping(x) {\n        if (!arguments.length)\n            return enableGrouping;\n        enableGrouping = x;\n        return force;\n    }\n    function setStrength(x) {\n        if (!arguments.length)\n            return strength;\n        strength = x;\n        return force;\n    }\n    function setCenterX(_) {\n        if (arguments.length) {\n            centerX = _;\n            return force;\n        }\n        return centerX;\n    }\n    function setCenterY(_) {\n        if (arguments.length) {\n            centerY = _;\n            return force;\n        }\n        return centerY;\n    }\n    function setNodes(_) {\n        if (arguments.length) {\n            genNodesMap(_ || []);\n            nodes = _ || [];\n            return force;\n        }\n        return nodes;\n    }\n    function setLinks(_) {\n        if (arguments.length) {\n            links = _ || [];\n            initialize();\n            return force;\n        }\n        return links;\n    }\n    function setForceNodeSize(_) {\n        if (arguments.length) {\n            if (typeof _ === 'function') {\n                forceNodeSize = _;\n            }\n            else {\n                forceNodeSize = constant(+_);\n            }\n            initialize();\n            return force;\n        }\n        return forceNodeSize;\n    }\n    function setForceCharge(_) {\n        if (arguments.length) {\n            if (typeof _ === 'function') {\n                forceCharge = _;\n            }\n            else {\n                forceCharge = constant(+_);\n            }\n            initialize();\n            return force;\n        }\n        return forceCharge;\n    }\n    function setForceLinkDistance(_) {\n        if (arguments.length) {\n            if (typeof _ === 'function') {\n                forceLinkDistance = _;\n            }\n            else {\n                forceLinkDistance = constant(+_);\n            }\n            initialize();\n            return force;\n        }\n        return forceLinkDistance;\n    }\n    function setForceLinkStrength(_) {\n        if (arguments.length) {\n            if (typeof _ === 'function') {\n                forceLinkStrength = _;\n            }\n            else {\n                forceLinkStrength = constant(+_);\n            }\n            initialize();\n            return force;\n        }\n        return forceLinkStrength;\n    }\n    function setOffset(_) {\n        if (arguments.length) {\n            offset = _;\n            return force;\n        }\n        return offset;\n    }\n    force.initialize = (_) => {\n        nodes = _;\n        initialize();\n    };\n    force.template = setTemplate;\n    force.groupBy = setGroupBy;\n    force.enableGrouping = setEnableGrouping;\n    force.strength = setStrength;\n    force.centerX = setCenterX;\n    force.centerY = setCenterY;\n    force.nodes = setNodes;\n    force.links = setLinks;\n    force.forceNodeSize = setForceNodeSize;\n    // Legacy support\n    force.nodeSize = force.forceNodeSize;\n    force.forceCharge = setForceCharge;\n    force.forceLinkDistance = setForceLinkDistance;\n    force.forceLinkStrength = setForceLinkStrength;\n    force.offset = setOffset;\n    force.getFocis = getFocisFromTemplate;\n    return force;\n}\n\nexport { forceInABox as default, getEdgeTerminal };\n//# sourceMappingURL=force-in-a-box.js.map\n"],"names":["getEdgeTerminal","edge","type","forceInABox","constant","_","groupBy","d","forceNodeSize","forceCharge","forceLinkDistance","forceLinkStrength","offset","nodes","nodesMap","links","centerX","centerY","foci","templateNodes","templateForce","template","enableGrouping","strength","force","alpha","getFocisFromTemplate","i","n","node","k","initialize","initializeWithForce","net","getGroupsGraph","forceSimulation","forceX","forceY","forceCollide","forceManyBody","forceLink","gnodes","glinks","dNodes","clustersList","clustersCounts","clustersLinks","computeClustersNodeCounts","computeClustersLinkCounts","key","index","val","l","sourceTerminal","targetTerminal","source","target","nodeSize","tmpCount","dClusterLinks","clusterLinks","getLinkKey","count","sourceID","targetID","genNodesMap","setTemplate","x","setGroupBy","setEnableGrouping","setStrength","setCenterX","setCenterY","setNodes","setLinks","setForceNodeSize","setForceCharge","setForceLinkDistance","setForceLinkStrength","setOffset"],"mappings":";;;;;;AAOK,MAACA,IAAkB,CAACC,GAAMC,MACVD,EAAKC,CAAI;AAI9B,SAASC,KAAc;AACnB,WAASC,EAASC,GAAG;AACjB,WAAO,MAAMA;AAAA,EACjB;AACA,MAAIC,IAAU,CAACC,MACJA,EAAE,SAGTC,IAAgBJ,EAAS,CAAC,GAC1BK,IAAcL,EAAS,EAAE,GACzBM,IAAoBN,EAAS,GAAG,GAChCO,IAAoBP,EAAS,GAAG,GAChCQ,IAAS,CAAC,GAAG,CAAC,GACdC,IAAQ,CAAA,GACRC,IAAW,CAAA,GACXC,IAAQ,CAAA,GACRC,IAAU,KACVC,IAAU,KACVC,IAAO;AAAA,IACP,MAAM;AAAA,MACF,GAAG;AAAA,MACH,GAAG;AAAA,IACf;AAAA,EACA,GACQC,IAAgB,CAAA,GAChBC,GACAC,IAAW,SACXC,IAAiB,IACjBC,IAAW;AACf,WAASC,EAAMC,GAAO;AAClB,QAAI,CAACH;AACD,aAAOE;AAEX,IAAAJ,EAAc,KAAI,GAClBM,EAAoB;AACpB,aAASC,IAAI,GAAGC,IAAIf,EAAM,QAAQgB,GAAMC,IAAIL,IAAQF,GAAUI,IAAIC,GAAG,EAAED;AACnE,MAAAE,IAAOhB,EAAMc,CAAC,GACdE,EAAK,OAAOA,EAAK,KAAK,IACtBA,EAAK,OAAOA,EAAK,KAAK,IACtBA,EAAK,OAAOX,EAAKZ,EAAQuB,EAAK,SAAS,CAAC,EAAE,IAAIA,EAAK,KAAKC,GACxDD,EAAK,OAAOX,EAAKZ,EAAQuB,EAAK,SAAS,CAAC,EAAE,IAAIA,EAAK,KAAKC;AAAA,EAEhE;AACA,WAASC,IAAa;AAClB,IAAKlB,KAELmB,EAAmB;AAAA,EACvB;AACA,WAASA,IAAsB;AAC3B,QAAI,CAACnB,KAAS,CAACA,EAAM;AACjB;AAEJ,UAAMgB,IAAOhB,EAAM,CAAC;AACpB,QAAIP,EAAQuB,EAAK,SAAS,MAAM;AAC5B,YAAM,MAAM,2IAA2I;AAG3J,UAAMI,IAAMC,EAAc;AAC1B,IAAAd,IAAgBe,EAAgBF,EAAI,KAAK,EACpC,MAAM,KAAKG,EAAOpB,CAAO,EAAE,SAAS,GAAG,CAAC,EACxC,MAAM,KAAKqB,GAAOpB,CAAO,EAAE,SAAS,GAAG,CAAC,EACxC,MAAM,WAAWqB,GAAa,CAAC/B,MAAMA,EAAE,CAAC,EAAE,WAAW,CAAC,CAAC,EACvD,MAAM,UAAUgC,KAAgB,SAAS9B,CAAW,CAAC,EACrD,MAAM,SAAS+B,GAAUP,EAAI,MAAM,SAASA,EAAI,QAAQ,CAAA,CAAE,EAC1D,SAASvB,CAAiB,EAC1B,SAASC,CAAiB,CAAC,GAChCQ,IAAgBC,EAAc,MAAK,GACnCM,EAAoB;AAAA,EACxB;AACA,WAASQ,IAAiB;AACtB,UAAMO,IAAS,CAAA,GACTC,IAAS,CAAA,GACTC,IAAS,CAAA;AACf,QAAIC,IAAe,CAAA,GACfC,IAAiB,CAAA,GACjBC,IAAgB,CAAA;AACpB,WAAAD,IAAiBE,EAA0BlC,CAAK,GAChDiC,IAAgBE,EAA0BjC,CAAK,GAC/C6B,IAAe,OAAO,KAAKC,CAAc,GACzCD,EAAa,QAAQ,CAACK,GAAKC,MAAU;AACjC,YAAMC,IAAMN,EAAeI,CAAG;AAE9B,MAAAR,EAAO,KAAK;AAAA,QACR,IAAIQ;AAAA,QACJ,MAAME,EAAI;AAAA,QACV,GAAG,KAAK,KAAKA,EAAI,mBAAmB,KAAK,EAAE;AAAA,MAC3D,CAAa,GACDR,EAAOM,CAAG,IAAIC;AAAA,IAClB,CAAC,GACDJ,EAAc,QAAQ,CAACM,MAAM;AACzB,YAAMC,IAAiBrD,EAAgBoD,GAAG,QAAQ,GAC5CE,IAAiBtD,EAAgBoD,GAAG,QAAQ,GAC5CG,IAASZ,EAAOU,CAAc,GAC9BG,IAASb,EAAOW,CAAc;AACpC,MAAIC,MAAW,UAAaC,MAAW,UACnCd,EAAO,KAAK;AAAA,QACR,QAAAa;AAAA,QACA,QAAAC;AAAA,QACA,OAAOJ,EAAE;AAAA,MAC7B,CAAiB;AAAA,IAET,CAAC,GACM;AAAA,MACH,OAAOX;AAAA,MACP,OAAOC;AAAA,IACnB;AAAA,EACI;AACA,WAASK,EAA0BlC,GAAO;AACtC,UAAMgC,IAAiB,CAAA;AACvB,WAAAhC,EAAM,QAAQ,CAACN,MAAM;AACjB,YAAM0C,IAAM3C,EAAQC,EAAE,SAAS;AAC/B,MAAKsC,EAAeI,CAAG,MACnBJ,EAAeI,CAAG,IAAI;AAAA,QAClB,OAAO;AAAA,QACP,kBAAkB;AAAA,MACtC;AAAA,IAEQ,CAAC,GACDpC,EAAM,QAAQ,CAACN,MAAM;AACjB,YAAM0C,IAAM3C,EAAQC,EAAE,SAAS,GACzBkD,IAAWjD,EAAcD,EAAE,SAAS,GACpCmD,IAAWb,EAAeI,CAAG;AACnC,MAAAS,EAAS,QAAQA,EAAS,QAAQ,GAClCA,EAAS,mBACLA,EAAS,mBAAmB,KAAK,MAAMD,IAAWA,KAAY,KAClEZ,EAAeI,CAAG,IAAIS;AAAA,IAC1B,CAAC,GACMb;AAAA,EACX;AACA,WAASG,EAA0BjC,GAAO;AACtC,UAAM4C,IAAgB,CAAA,GAChBC,IAAe,CAAA;AACrB,WAAA7C,EAAM,QAAQ,CAACqC,MAAM;AACjB,YAAMH,IAAMY,EAAWT,CAAC;AACxB,UAAIU,IAAQ;AACZ,MAAIH,EAAcV,CAAG,MAAM,WACvBa,IAAQH,EAAcV,CAAG,IAE7Ba,KAAS,GACTH,EAAcV,CAAG,IAAIa;AAAA,IACzB,CAAC,GAEe,OAAO,QAAQH,CAAa,EACpC,QAAQ,CAAC,CAACV,GAAKa,CAAK,MAAM;AAC9B,YAAMP,IAASN,EAAI,MAAM,GAAG,EAAE,CAAC,GACzBO,IAASP,EAAI,MAAM,GAAG,EAAE,CAAC;AAC/B,MAAIM,MAAW,UAAaC,MAAW,UACnCI,EAAa,KAAK;AAAA,QACd,QAAAL;AAAA,QACA,QAAAC;AAAA,QACA,OAAAM;AAAA,MACpB,CAAiB;AAAA,IAET,CAAC,GACMF;AAAA,EACX;AACA,WAASlC,IAAuB;AAC5B,WAAAR,IAAO;AAAA,MACH,MAAM;AAAA,QACF,GAAG;AAAA,QACH,GAAG;AAAA,MACnB;AAAA,IACA,GACQC,EAAc,QAAQ,CAACZ,MAAM;AACzB,MAAAW,EAAKX,EAAE,EAAE,IAAI;AAAA,QACT,GAAGA,EAAE,IAAIK,EAAO,CAAC;AAAA,QACjB,GAAGL,EAAE,IAAIK,EAAO,CAAC;AAAA,MACjC;AAAA,IACQ,CAAC,GACMM;AAAA,EACX;AACA,WAAS2C,EAAWT,GAAG;AACnB,UAAMG,IAASvD,EAAgBoD,GAAG,QAAQ,GACpCI,IAASxD,EAAgBoD,GAAG,QAAQ,GACpCW,IAAWzD,EAAQQ,EAASyC,CAAM,EAAE,SAAS,GAC7CS,IAAW1D,EAAQQ,EAAS0C,CAAM,EAAE,SAAS;AACnD,WAAOO,KAAYC,IACb,GAAGD,CAAQ,IAAIC,CAAQ,KACvB,GAAGA,CAAQ,IAAID,CAAQ;AAAA,EACjC;AACA,WAASE,EAAYpD,GAAO;AACxB,IAAAC,IAAW,CAAA,GACXD,EAAM,QAAQ,CAACgB,MAAS;AACpB,MAAAf,EAASe,EAAK,EAAE,IAAIA;AAAA,IACxB,CAAC;AAAA,EACL;AACA,WAASqC,EAAYC,GAAG;AACpB,WAAK,UAAU,UAEf9C,IAAW8C,GACXpC,EAAU,GACHP,KAHIH;AAAA,EAIf;AACA,WAAS+C,EAAWD,GAAG;AACnB,WAAK,UAAU,SAEX,OAAOA,KAAM,YACb7D,IAAU,CAACC,MACAA,EAAE4D,CAAC,GAEP3C,MAEXlB,IAAU6D,GACH3C,KARIlB;AAAA,EASf;AACA,WAAS+D,EAAkBF,GAAG;AAC1B,WAAK,UAAU,UAEf7C,IAAiB6C,GACV3C,KAFIF;AAAA,EAGf;AACA,WAASgD,EAAYH,GAAG;AACpB,WAAK,UAAU,UAEf5C,IAAW4C,GACJ3C,KAFID;AAAA,EAGf;AACA,WAASgD,EAAWlE,GAAG;AACnB,WAAI,UAAU,UACVW,IAAUX,GACHmB,KAEJR;AAAA,EACX;AACA,WAASwD,EAAWnE,GAAG;AACnB,WAAI,UAAU,UACVY,IAAUZ,GACHmB,KAEJP;AAAA,EACX;AACA,WAASwD,EAASpE,GAAG;AACjB,WAAI,UAAU,UACV4D,EAAY5D,KAAK,EAAE,GACnBQ,IAAQR,KAAK,CAAA,GACNmB,KAEJX;AAAA,EACX;AACA,WAAS6D,EAASrE,GAAG;AACjB,WAAI,UAAU,UACVU,IAAQV,KAAK,CAAA,GACb0B,EAAU,GACHP,KAEJT;AAAA,EACX;AACA,WAAS4D,EAAiBtE,GAAG;AACzB,WAAI,UAAU,UACN,OAAOA,KAAM,aACbG,IAAgBH,IAGhBG,IAAgBJ,EAAS,CAACC,CAAC,GAE/B0B,EAAU,GACHP,KAEJhB;AAAA,EACX;AACA,WAASoE,EAAevE,GAAG;AACvB,WAAI,UAAU,UACN,OAAOA,KAAM,aACbI,IAAcJ,IAGdI,IAAcL,EAAS,CAACC,CAAC,GAE7B0B,EAAU,GACHP,KAEJf;AAAA,EACX;AACA,WAASoE,EAAqBxE,GAAG;AAC7B,WAAI,UAAU,UACN,OAAOA,KAAM,aACbK,IAAoBL,IAGpBK,IAAoBN,EAAS,CAACC,CAAC,GAEnC0B,EAAU,GACHP,KAEJd;AAAA,EACX;AACA,WAASoE,EAAqBzE,GAAG;AAC7B,WAAI,UAAU,UACN,OAAOA,KAAM,aACbM,IAAoBN,IAGpBM,IAAoBP,EAAS,CAACC,CAAC,GAEnC0B,EAAU,GACHP,KAEJb;AAAA,EACX;AACA,WAASoE,EAAU1E,GAAG;AAClB,WAAI,UAAU,UACVO,IAASP,GACFmB,KAEJZ;AAAA,EACX;AACA,SAAAY,EAAM,aAAa,CAACnB,MAAM;AACtB,IAAAQ,IAAQR,GACR0B,EAAU;AAAA,EACd,GACAP,EAAM,WAAW0C,GACjB1C,EAAM,UAAU4C,GAChB5C,EAAM,iBAAiB6C,GACvB7C,EAAM,WAAW8C,GACjB9C,EAAM,UAAU+C,GAChB/C,EAAM,UAAUgD,GAChBhD,EAAM,QAAQiD,GACdjD,EAAM,QAAQkD,GACdlD,EAAM,gBAAgBmD,GAEtBnD,EAAM,WAAWA,EAAM,eACvBA,EAAM,cAAcoD,GACpBpD,EAAM,oBAAoBqD,GAC1BrD,EAAM,oBAAoBsD,GAC1BtD,EAAM,SAASuD,GACfvD,EAAM,WAAWE,GACVF;AACX;","x_google_ignoreList":[0]}