@hkyhy/marsun-components-core 0.1.113 → 0.1.115

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

@@ -0,0 +1,125 @@
+import { __awaiter as C } from "../../node_modules/tslib/tslib.es6.js";
+import { applySingleNodeLayout as L } from "../../util/common.js";
+import { formatFn as N, formatNodeSizeFn as D } from "../../util/format.js";
+import { orderByDegree as F, orderById as T, orderBySorter as $ } from "../../util/order.js";
+import { normalizeViewport as v } from "../../util/viewport.js";
+import { BaseLayout as A } from "../base-layout.js";
+const M = {
+  begin: [0, 0],
+  preventOverlap: !0,
+  condense: !1,
+  rows: void 0,
+  cols: void 0,
+  position: void 0,
+  sortBy: "degree",
+  nodeSize: 30,
+  nodeSpacing: 10,
+  width: 300,
+  height: 300
+};
+class G extends A {
+  constructor() {
+    super(...arguments), this.id = "grid";
+  }
+  getDefaultOptions() {
+    return M;
+  }
+  parseOptions(o = {}, t) {
+    const { rows: s, cols: i, position: w, sortBy: l } = o, { width: h, height: m, center: g } = v(o);
+    let r = o.rows, a = o.cols;
+    const c = t.nodeCount();
+    if (s != null && i != null)
+      r = s, a = i;
+    else if (s != null && i == null)
+      r = s, a = Math.ceil(c / r);
+    else if (s == null && i != null)
+      a = i, r = Math.ceil(c / a);
+    else {
+      const f = Math.sqrt(c * m / h);
+      r = Math.round(f), a = Math.round(h / m * f);
+    }
+    r = Math.max(r, 1), a = Math.max(a, 1);
+    const n = { rows: r, cols: a };
+    if (n.cols * n.rows > c) {
+      const f = B(n), u = S(n);
+      (f - 1) * u >= c ? B(n, f - 1) : (u - 1) * f >= c && S(n, u - 1);
+    } else
+      for (; n.cols * n.rows < c; ) {
+        const f = B(n), u = S(n);
+        (u + 1) * f >= c ? S(n, u + 1) : B(n, f + 1);
+      }
+    const y = l ? l === "degree" || l === "id" ? l : N(l, ["nodeA", "nodeB"]) : M.sortBy;
+    return Object.assign(Object.assign({}, o), {
+      sortBy: y,
+      rcs: n,
+      center: g,
+      width: h,
+      height: m,
+      position: N(w, ["node"])
+    });
+  }
+  layout() {
+    return C(this, void 0, void 0, function* () {
+      const { begin: o, rcs: t, sortBy: s, width: i, height: w, condense: l, preventOverlap: h, nodeSpacing: m, nodeSize: g, position: r } = this.parseOptions(this.options, this.model), a = this.model.nodeCount();
+      if (!a || a === 1) {
+        L(this.model, o);
+        return;
+      }
+      s === "degree" ? F(this.model) : s === "id" ? T(this.model) : $(this.model, s);
+      let c = l ? 0 : i / t.cols, n = l ? 0 : w / t.rows;
+      if (h) {
+        const x = D(g, m, M.nodeSize, M.nodeSpacing);
+        this.model.forEachNode((O) => {
+          const [p, d] = x(O._original);
+          c = Math.max(c, p), n = Math.max(n, d);
+        });
+      }
+      const y = {}, f = { row: 0, col: 0 }, u = {};
+      this.model.forEachNode((x) => {
+        const O = x._original;
+        let p;
+        if (r && (p = r(O)), p && (p.row !== void 0 || p.col !== void 0)) {
+          const d = {
+            row: p.row,
+            col: p.col
+          };
+          if (d.col === void 0)
+            for (d.col = 0; z(y, d); )
+              d.col++;
+          else if (d.row === void 0)
+            for (d.row = 0; z(y, d); )
+              d.row++;
+          u[x.id] = d, _(y, d);
+        }
+        E(x, o, c, n, u, t, f, y);
+      });
+    });
+  }
+}
+const B = (e, o) => {
+  let t;
+  const s = e.rows || 5, i = e.cols || 5;
+  return o == null ? t = Math.min(s, i) : Math.min(s, i) === e.rows ? e.rows = o : e.cols = o, t;
+}, S = (e, o) => {
+  let t;
+  const s = e.rows || 5, i = e.cols || 5;
+  return o == null ? t = Math.max(s, i) : Math.max(s, i) === e.rows ? e.rows = o : e.cols = o, t;
+}, z = (e, o) => e[`c-${o.row}-${o.col}`] || !1, _ = (e, o) => e[`c-${o.row}-${o.col}`] = !0, P = (e, o) => {
+  const t = e.cols || 5;
+  o.col++, o.col >= t && (o.col = 0, o.row++);
+}, E = (e, o, t, s, i, w, l, h) => {
+  let m, g;
+  const r = i[e.id];
+  if (r)
+    m = r.col * t + t / 2 + o[0], g = r.row * s + s / 2 + o[1];
+  else {
+    for (; z(h, l); )
+      P(w, l);
+    m = l.col * t + t / 2 + o[0], g = l.row * s + s / 2 + o[1], _(h, l), P(w, l);
+  }
+  e.x = m, e.y = g;
+};
+export {
+  G as GridLayout
+};
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/grid/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 { formatFn, formatNodeSizeFn } from '../../util/format.js';\nimport { orderByDegree, orderById, orderBySorter } from '../../util/order.js';\nimport { normalizeViewport } from '../../util/viewport.js';\nimport { BaseLayout } from '../base-layout.js';\n\nconst DEFAULT_LAYOUT_OPTIONS = {\n    begin: [0, 0],\n    preventOverlap: true,\n    condense: false,\n    rows: undefined,\n    cols: undefined,\n    position: undefined,\n    sortBy: 'degree',\n    nodeSize: 30,\n    nodeSpacing: 10,\n    width: 300,\n    height: 300,\n};\n/**\n * <zh/> 网格布局\n *\n * <en/> Grid layout\n */\nclass GridLayout extends BaseLayout {\n    constructor() {\n        super(...arguments);\n        this.id = 'grid';\n    }\n    getDefaultOptions() {\n        return DEFAULT_LAYOUT_OPTIONS;\n    }\n    parseOptions(options = {}, model) {\n        const { rows: propRows, cols: propCols, position: propPosition, sortBy: propSortBy, } = options;\n        const { width, height, center } = normalizeViewport(options);\n        let rows = options.rows;\n        let cols = options.cols;\n        const cells = model.nodeCount();\n        // if rows or columns were set in self, use those values\n        if (propRows != null && propCols != null) {\n            rows = propRows;\n            cols = propCols;\n        }\n        else if (propRows != null && propCols == null) {\n            rows = propRows;\n            cols = Math.ceil(cells / rows);\n        }\n        else if (propRows == null && propCols != null) {\n            cols = propCols;\n            rows = Math.ceil(cells / cols);\n        }\n        else {\n            // otherwise use the automatic values and adjust accordingly\t      // otherwise use the automatic values and adjust accordingly\n            // width/height * splits^2 = cells where splits is number of times to split width\n            const splits = Math.sqrt((cells * height) / width);\n            rows = Math.round(splits);\n            cols = Math.round((width / height) * splits);\n        }\n        rows = Math.max(rows, 1);\n        cols = Math.max(cols, 1);\n        const rcs = { rows, cols };\n        if (rcs.cols * rcs.rows > cells) {\n            // otherwise use the automatic values and adjust accordingly\n            // if rounding was up, see if we can reduce rows or columns\n            const sm = small(rcs);\n            const lg = large(rcs);\n            // reducing the small side takes away the most cells, so try it first\n            if ((sm - 1) * lg >= cells) {\n                small(rcs, sm - 1);\n            }\n            else if ((lg - 1) * sm >= cells) {\n                large(rcs, lg - 1);\n            }\n        }\n        else {\n            // if rounding was too low, add rows or columns\n            while (rcs.cols * rcs.rows < cells) {\n                const sm = small(rcs);\n                const lg = large(rcs);\n                // try to add to larger side first (adds less in multiplication)\n                if ((lg + 1) * sm >= cells) {\n                    large(rcs, lg + 1);\n                }\n                else {\n                    small(rcs, sm + 1);\n                }\n            }\n        }\n        const sortBy = !propSortBy\n            ? DEFAULT_LAYOUT_OPTIONS.sortBy\n            : propSortBy === 'degree' || propSortBy === 'id'\n                ? propSortBy\n                : formatFn(propSortBy, ['nodeA', 'nodeB']);\n        return Object.assign(Object.assign({}, options), { sortBy,\n            rcs,\n            center,\n            width,\n            height, position: formatFn(propPosition, ['node']) });\n    }\n    layout() {\n        return __awaiter(this, void 0, void 0, function* () {\n            const { begin, rcs, sortBy, width, height, condense, preventOverlap, nodeSpacing, nodeSize, position, } = this.parseOptions(this.options, this.model);\n            const n = this.model.nodeCount();\n            if (!n || n === 1) {\n                applySingleNodeLayout(this.model, begin);\n                return;\n            }\n            if (sortBy === 'degree') {\n                orderByDegree(this.model);\n            }\n            else if (sortBy === 'id') {\n                orderById(this.model);\n            }\n            else {\n                orderBySorter(this.model, sortBy);\n            }\n            let cellWidth = condense ? 0 : width / rcs.cols;\n            let cellHeight = condense ? 0 : height / rcs.rows;\n            if (preventOverlap) {\n                const sizeFn = formatNodeSizeFn(nodeSize, nodeSpacing, DEFAULT_LAYOUT_OPTIONS.nodeSize, DEFAULT_LAYOUT_OPTIONS.nodeSpacing);\n                this.model.forEachNode((node) => {\n                    const [w, h] = sizeFn(node._original);\n                    cellWidth = Math.max(cellWidth, w);\n                    cellHeight = Math.max(cellHeight, h);\n                });\n            }\n            const cellUsed = {}; // e.g. 'c-0-2' => true\n            // to keep track of current cell position\n            const rc = { row: 0, col: 0 };\n            // get a cache of all the manual positions\n            const id2manPos = {};\n            this.model.forEachNode((node) => {\n                const nodeData = node._original;\n                let rcPos;\n                if (position) {\n                    rcPos = position(nodeData);\n                }\n                if (rcPos && (rcPos.row !== undefined || rcPos.col !== undefined)) {\n                    // must have at least row or col def'd\n                    const pos = {\n                        row: rcPos.row,\n                        col: rcPos.col,\n                    };\n                    if (pos.col === undefined) {\n                        // find unused col\n                        pos.col = 0;\n                        while (used(cellUsed, pos)) {\n                            pos.col++;\n                        }\n                    }\n                    else if (pos.row === undefined) {\n                        // find unused row\n                        pos.row = 0;\n                        while (used(cellUsed, pos)) {\n                            pos.row++;\n                        }\n                    }\n                    id2manPos[node.id] = pos;\n                    use(cellUsed, pos);\n                }\n                getPos(node, begin, cellWidth, cellHeight, id2manPos, rcs, rc, cellUsed);\n            });\n        });\n    }\n}\nconst small = (rcs, val) => {\n    let res;\n    const rows = rcs.rows || 5;\n    const cols = rcs.cols || 5;\n    if (val == null) {\n        res = Math.min(rows, cols);\n    }\n    else {\n        const min = Math.min(rows, cols);\n        if (min === rcs.rows) {\n            rcs.rows = val;\n        }\n        else {\n            rcs.cols = val;\n        }\n    }\n    return res;\n};\nconst large = (rcs, val) => {\n    let result;\n    const usedRows = rcs.rows || 5;\n    const usedCols = rcs.cols || 5;\n    if (val == null) {\n        result = Math.max(usedRows, usedCols);\n    }\n    else {\n        const max = Math.max(usedRows, usedCols);\n        if (max === rcs.rows) {\n            rcs.rows = val;\n        }\n        else {\n            rcs.cols = val;\n        }\n    }\n    return result;\n};\nconst used = (cellUsed, rc) => cellUsed[`c-${rc.row}-${rc.col}`] || false;\nconst use = (cellUsed, rc) => (cellUsed[`c-${rc.row}-${rc.col}`] = true);\nconst moveToNextCell = (rcs, rc) => {\n    const cols = rcs.cols || 5;\n    rc.col++;\n    if (rc.col >= cols) {\n        rc.col = 0;\n        rc.row++;\n    }\n};\nconst getPos = (node, begin, cellWidth, cellHeight, id2manPos, rcs, rc, cellUsed) => {\n    let x;\n    let y;\n    // see if we have a manual position set\n    const rcPos = id2manPos[node.id];\n    if (rcPos) {\n        x = rcPos.col * cellWidth + cellWidth / 2 + begin[0];\n        y = rcPos.row * cellHeight + cellHeight / 2 + begin[1];\n    }\n    else {\n        // otherwise set automatically\n        while (used(cellUsed, rc)) {\n            moveToNextCell(rcs, rc);\n        }\n        x = rc.col * cellWidth + cellWidth / 2 + begin[0];\n        y = rc.row * cellHeight + cellHeight / 2 + begin[1];\n        use(cellUsed, rc);\n        moveToNextCell(rcs, rc);\n    }\n    node.x = x;\n    node.y = y;\n};\n\nexport { GridLayout };\n//# sourceMappingURL=index.js.map\n"],"names":["DEFAULT_LAYOUT_OPTIONS","GridLayout","BaseLayout","options","model","propRows","propCols","propPosition","propSortBy","width","height","center","normalizeViewport","rows","cols","cells","splits","rcs","sm","small","lg","large","sortBy","formatFn","__awaiter","begin","condense","preventOverlap","nodeSpacing","nodeSize","position","n","applySingleNodeLayout","orderByDegree","orderById","orderBySorter","cellWidth","cellHeight","sizeFn","formatNodeSizeFn","node","w","h","cellUsed","rc","id2manPos","nodeData","rcPos","pos","used","use","getPos","val","res","result","usedRows","usedCols","moveToNextCell","x","y"],"mappings":";;;;;;AAQA,MAAMA,IAAyB;AAAA,EAC3B,OAAO,CAAC,GAAG,CAAC;AAAA,EACZ,gBAAgB;AAAA,EAChB,UAAU;AAAA,EACV,MAAM;AAAA,EACN,MAAM;AAAA,EACN,UAAU;AAAA,EACV,QAAQ;AAAA,EACR,UAAU;AAAA,EACV,aAAa;AAAA,EACb,OAAO;AAAA,EACP,QAAQ;AACZ;AAMA,MAAMC,UAAmBC,EAAW;AAAA,EAChC,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,KAAK;AAAA,EACd;AAAA,EACA,oBAAoB;AAChB,WAAOF;AAAA,EACX;AAAA,EACA,aAAaG,IAAU,CAAA,GAAIC,GAAO;AAC9B,UAAM,EAAE,MAAMC,GAAU,MAAMC,GAAU,UAAUC,GAAc,QAAQC,EAAU,IAAML,GAClF,EAAE,OAAAM,GAAO,QAAAC,GAAQ,QAAAC,EAAM,IAAKC,EAAkBT,CAAO;AAC3D,QAAIU,IAAOV,EAAQ,MACfW,IAAOX,EAAQ;AACnB,UAAMY,IAAQX,EAAM,UAAS;AAE7B,QAAIC,KAAY,QAAQC,KAAY;AAChC,MAAAO,IAAOR,GACPS,IAAOR;AAAA,aAEFD,KAAY,QAAQC,KAAY;AACrC,MAAAO,IAAOR,GACPS,IAAO,KAAK,KAAKC,IAAQF,CAAI;AAAA,aAExBR,KAAY,QAAQC,KAAY;AACrC,MAAAQ,IAAOR,GACPO,IAAO,KAAK,KAAKE,IAAQD,CAAI;AAAA,SAE5B;AAGD,YAAME,IAAS,KAAK,KAAMD,IAAQL,IAAUD,CAAK;AACjD,MAAAI,IAAO,KAAK,MAAMG,CAAM,GACxBF,IAAO,KAAK,MAAOL,IAAQC,IAAUM,CAAM;AAAA,IAC/C;AACA,IAAAH,IAAO,KAAK,IAAIA,GAAM,CAAC,GACvBC,IAAO,KAAK,IAAIA,GAAM,CAAC;AACvB,UAAMG,IAAM,EAAE,MAAAJ,GAAM,MAAAC,EAAI;AACxB,QAAIG,EAAI,OAAOA,EAAI,OAAOF,GAAO;AAG7B,YAAMG,IAAKC,EAAMF,CAAG,GACdG,IAAKC,EAAMJ,CAAG;AAEpB,OAAKC,IAAK,KAAKE,KAAML,IACjBI,EAAMF,GAAKC,IAAK,CAAC,KAEXE,IAAK,KAAKF,KAAMH,KACtBM,EAAMJ,GAAKG,IAAK,CAAC;AAAA,IAEzB;AAGI,aAAOH,EAAI,OAAOA,EAAI,OAAOF,KAAO;AAChC,cAAMG,IAAKC,EAAMF,CAAG,GACdG,IAAKC,EAAMJ,CAAG;AAEpB,SAAKG,IAAK,KAAKF,KAAMH,IACjBM,EAAMJ,GAAKG,IAAK,CAAC,IAGjBD,EAAMF,GAAKC,IAAK,CAAC;AAAA,MAEzB;AAEJ,UAAMI,IAAUd,IAEVA,MAAe,YAAYA,MAAe,OACtCA,IACAe,EAASf,GAAY,CAAC,SAAS,OAAO,CAAC,IAH3CR,EAAuB;AAI7B,WAAO,OAAO,OAAO,OAAO,OAAO,IAAIG,CAAO,GAAG;AAAA,MAAE,QAAAmB;AAAA,MAC/C,KAAAL;AAAA,MACA,QAAAN;AAAA,MACA,OAAAF;AAAA,MACA,QAAAC;AAAA,MAAQ,UAAUa,EAAShB,GAAc,CAAC,MAAM,CAAC;AAAA,KAAG;AAAA,EAC5D;AAAA,EACA,SAAS;AACL,WAAOiB,EAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAM,EAAE,OAAAC,GAAO,KAAAR,GAAK,QAAAK,GAAQ,OAAAb,GAAO,QAAAC,GAAQ,UAAAgB,GAAU,gBAAAC,GAAgB,aAAAC,GAAa,UAAAC,GAAU,UAAAC,EAAQ,IAAM,KAAK,aAAa,KAAK,SAAS,KAAK,KAAK,GAC9IC,IAAI,KAAK,MAAM,UAAS;AAC9B,UAAI,CAACA,KAAKA,MAAM,GAAG;AACf,QAAAC,EAAsB,KAAK,OAAOP,CAAK;AACvC;AAAA,MACJ;AACA,MAAIH,MAAW,WACXW,EAAc,KAAK,KAAK,IAEnBX,MAAW,OAChBY,EAAU,KAAK,KAAK,IAGpBC,EAAc,KAAK,OAAOb,CAAM;AAEpC,UAAIc,IAAYV,IAAW,IAAIjB,IAAQQ,EAAI,MACvCoB,IAAaX,IAAW,IAAIhB,IAASO,EAAI;AAC7C,UAAIU,GAAgB;AAChB,cAAMW,IAASC,EAAiBV,GAAUD,GAAa5B,EAAuB,UAAUA,EAAuB,WAAW;AAC1H,aAAK,MAAM,YAAY,CAACwC,MAAS;AAC7B,gBAAM,CAACC,GAAGC,CAAC,IAAIJ,EAAOE,EAAK,SAAS;AACpC,UAAAJ,IAAY,KAAK,IAAIA,GAAWK,CAAC,GACjCJ,IAAa,KAAK,IAAIA,GAAYK,CAAC;AAAA,QACvC,CAAC;AAAA,MACL;AACA,YAAMC,IAAW,CAAA,GAEXC,IAAK,EAAE,KAAK,GAAG,KAAK,EAAC,GAErBC,IAAY,CAAA;AAClB,WAAK,MAAM,YAAY,CAACL,MAAS;AAC7B,cAAMM,IAAWN,EAAK;AACtB,YAAIO;AAIJ,YAHIjB,MACAiB,IAAQjB,EAASgB,CAAQ,IAEzBC,MAAUA,EAAM,QAAQ,UAAaA,EAAM,QAAQ,SAAY;AAE/D,gBAAMC,IAAM;AAAA,YACR,KAAKD,EAAM;AAAA,YACX,KAAKA,EAAM;AAAA,UACnC;AACoB,cAAIC,EAAI,QAAQ;AAGZ,iBADAA,EAAI,MAAM,GACHC,EAAKN,GAAUK,CAAG;AACrB,cAAAA,EAAI;AAAA,mBAGHA,EAAI,QAAQ;AAGjB,iBADAA,EAAI,MAAM,GACHC,EAAKN,GAAUK,CAAG;AACrB,cAAAA,EAAI;AAGZ,UAAAH,EAAUL,EAAK,EAAE,IAAIQ,GACrBE,EAAIP,GAAUK,CAAG;AAAA,QACrB;AACA,QAAAG,EAAOX,GAAMf,GAAOW,GAAWC,GAAYQ,GAAW5B,GAAK2B,GAAID,CAAQ;AAAA,MAC3E,CAAC;AAAA,IACL,CAAC;AAAA,EACL;AACJ;AACA,MAAMxB,IAAQ,CAACF,GAAKmC,MAAQ;AACxB,MAAIC;AACJ,QAAMxC,IAAOI,EAAI,QAAQ,GACnBH,IAAOG,EAAI,QAAQ;AACzB,SAAImC,KAAO,OACPC,IAAM,KAAK,IAAIxC,GAAMC,CAAI,IAGb,KAAK,IAAID,GAAMC,CAAI,MACnBG,EAAI,OACZA,EAAI,OAAOmC,IAGXnC,EAAI,OAAOmC,GAGZC;AACX,GACMhC,IAAQ,CAACJ,GAAKmC,MAAQ;AACxB,MAAIE;AACJ,QAAMC,IAAWtC,EAAI,QAAQ,GACvBuC,IAAWvC,EAAI,QAAQ;AAC7B,SAAImC,KAAO,OACPE,IAAS,KAAK,IAAIC,GAAUC,CAAQ,IAGxB,KAAK,IAAID,GAAUC,CAAQ,MAC3BvC,EAAI,OACZA,EAAI,OAAOmC,IAGXnC,EAAI,OAAOmC,GAGZE;AACX,GACML,IAAO,CAACN,GAAUC,MAAOD,EAAS,KAAKC,EAAG,GAAG,IAAIA,EAAG,GAAG,EAAE,KAAK,IAC9DM,IAAM,CAACP,GAAUC,MAAQD,EAAS,KAAKC,EAAG,GAAG,IAAIA,EAAG,GAAG,EAAE,IAAI,IAC7Da,IAAiB,CAACxC,GAAK2B,MAAO;AAChC,QAAM9B,IAAOG,EAAI,QAAQ;AACzB,EAAA2B,EAAG,OACCA,EAAG,OAAO9B,MACV8B,EAAG,MAAM,GACTA,EAAG;AAEX,GACMO,IAAS,CAACX,GAAMf,GAAOW,GAAWC,GAAYQ,GAAW5B,GAAK2B,GAAID,MAAa;AACjF,MAAIe,GACAC;AAEJ,QAAMZ,IAAQF,EAAUL,EAAK,EAAE;AAC/B,MAAIO;AACA,IAAAW,IAAIX,EAAM,MAAMX,IAAYA,IAAY,IAAIX,EAAM,CAAC,GACnDkC,IAAIZ,EAAM,MAAMV,IAAaA,IAAa,IAAIZ,EAAM,CAAC;AAAA,OAEpD;AAED,WAAOwB,EAAKN,GAAUC,CAAE;AACpB,MAAAa,EAAexC,GAAK2B,CAAE;AAE1B,IAAAc,IAAId,EAAG,MAAMR,IAAYA,IAAY,IAAIX,EAAM,CAAC,GAChDkC,IAAIf,EAAG,MAAMP,IAAaA,IAAa,IAAIZ,EAAM,CAAC,GAClDyB,EAAIP,GAAUC,CAAE,GAChBa,EAAexC,GAAK2B,CAAE;AAAA,EAC1B;AACA,EAAAJ,EAAK,IAAIkB,GACTlB,EAAK,IAAImB;AACb;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,81 @@
+import { __awaiter as y } from "../../node_modules/tslib/tslib.es6.js";
+import { Matrix as g, SingularValueDecomposition as D } from "../../node_modules/ml-matrix/matrix.js";
+import { BaseLayout as w } from "../base-layout.js";
+import { applySingleNodeLayout as x } from "../../util/common.js";
+import { getAdjList as L, johnson as N, scaleMatrix as I } from "../../util/math.js";
+import { normalizeViewport as S } from "../../util/viewport.js";
+const p = {
+  center: [0, 0],
+  linkDistance: 50
+};
+class b extends w {
+  constructor() {
+    super(...arguments), this.id = "mds";
+  }
+  getDefaultOptions() {
+    return p;
+  }
+  layout() {
+    return y(this, void 0, void 0, function* () {
+      const { linkDistance: a = p.linkDistance } = this.options, { center: n } = S(this.options), s = this.model.nodeCount();
+      if (s === 0 || s === 1) {
+        x(this.model, n);
+        return;
+      }
+      const t = L(this.model), o = N(t);
+      V(o);
+      const r = I(o, a), e = j(r);
+      let c = 0;
+      this.model.forEachNode((h) => {
+        const f = e[c++];
+        h.x = f[0] + n[0], h.y = f[1] + n[1];
+      });
+    });
+  }
+}
+const V = (i) => {
+  let a = Number.NEGATIVE_INFINITY;
+  const n = [], s = i.length;
+  for (let t = 0; t < s; t++) {
+    const o = i[t], r = o.length;
+    for (let e = 0; e < r; e++) {
+      const c = o[e];
+      c === 1 / 0 ? n.push([t, e]) : a < c && (a = c);
+    }
+  }
+  for (let t = 0; t < n.length; t++) {
+    const [o, r] = n[t];
+    i[o][r] = a;
+  }
+}, j = (i, a = 2, n = p.linkDistance) => {
+  try {
+    const s = i.length, t = new g(s, s);
+    for (let l = 0; l < s; l++)
+      for (let u = 0; u < s; u++) {
+        const m = i[l][u];
+        t.set(l, u, -0.5 * m * m);
+      }
+    const o = t.mean("row"), r = t.mean("column"), e = t.mean();
+    t.add(e).subRowVector(o).subColumnVector(r);
+    const c = new D(t), h = g.sqrt(c.diagonalMatrix).diagonal(), f = c.leftSingularVectors, M = h, d = [];
+    for (let l = 0; l < f.rows; l++) {
+      const u = [];
+      for (let m = 0; m < a; m++)
+        u.push(f.get(l, m) * M[m]);
+      d.push(u);
+    }
+    return d;
+  } catch {
+    const t = [];
+    for (let o = 0; o < i.length; o++) {
+      const r = Math.random() * n, e = Math.random() * n;
+      t.push([r, e]);
+    }
+    return t;
+  }
+};
+export {
+  b as MDSLayout,
+  j as runMDS
+};
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/mds/index.js"],"sourcesContent":["import { __awaiter } from '../../node_modules/tslib/tslib.es6.js';\nimport { Matrix, SingularValueDecomposition } from '../../node_modules/ml-matrix/matrix.js';\nimport { BaseLayout } from '../base-layout.js';\nimport { applySingleNodeLayout } from '../../util/common.js';\nimport '../../node_modules/@antv/expr/dist/index.esm.js';\nimport { getAdjList, johnson, scaleMatrix } from '../../util/math.js';\nimport { normalizeViewport } from '../../util/viewport.js';\n\nconst DEFAULTS_LAYOUT_OPTIONS$2 = {\n    center: [0, 0],\n    linkDistance: 50,\n};\n/**\n * <zh/> 多维缩放算法布局\n *\n * <en/> Multidimensional scaling layout\n */\nclass MDSLayout extends BaseLayout {\n    constructor() {\n        super(...arguments);\n        this.id = 'mds';\n    }\n    getDefaultOptions() {\n        return DEFAULTS_LAYOUT_OPTIONS$2;\n    }\n    layout() {\n        return __awaiter(this, void 0, void 0, function* () {\n            const { linkDistance = DEFAULTS_LAYOUT_OPTIONS$2.linkDistance } = this.options;\n            const { center } = normalizeViewport(this.options);\n            const n = this.model.nodeCount();\n            if (n === 0 || n === 1) {\n                applySingleNodeLayout(this.model, center);\n                return;\n            }\n            // the graph-theoretic distance (shortest path distance) matrix\n            const adjList = getAdjList(this.model, false);\n            const distances = johnson(adjList);\n            handleInfinity$1(distances);\n            // scale the ideal edge length acoording to linkDistance\n            const scaledD = scaleMatrix(distances, linkDistance);\n            // get positions by MDS\n            const positions = runMDS(scaledD);\n            let i = 0;\n            this.model.forEachNode((node) => {\n                const p = positions[i++];\n                node.x = p[0] + center[0];\n                node.y = p[1] + center[1];\n            });\n        });\n    }\n}\n/**\n * Handle Infinity values in the distance matrix by replacing them with the maximum finite distance.\n */\nconst handleInfinity$1 = (distances) => {\n    let maxDistance = Number.NEGATIVE_INFINITY;\n    const infList = [];\n    const n = distances.length;\n    for (let i = 0; i < n; i++) {\n        const row = distances[i];\n        const m = row.length;\n        for (let j = 0; j < m; j++) {\n            const value = row[j];\n            if (value === Infinity) {\n                infList.push([i, j]);\n            }\n            else if (maxDistance < value) {\n                maxDistance = value;\n            }\n        }\n    }\n    for (let k = 0; k < infList.length; k++) {\n        const [i, j] = infList[k];\n        distances[i][j] = maxDistance;\n    }\n};\n/**\n * Mds Algorithm\n * @param {array} distances Adjacency matrix of distances\n * @param {number} dimension Dimension of layout, default 2\n * @param {number} linkDistance Ideal length of edges\n * @returns {array} positions Positions of nodes\n */\nconst runMDS = (distances, dimension = 2, linkDistance = DEFAULTS_LAYOUT_OPTIONS$2.linkDistance) => {\n    try {\n        // square distances\n        const N = distances.length;\n        const M = new Matrix(N, N);\n        for (let i = 0; i < N; i++) {\n            for (let j = 0; j < N; j++) {\n                const d = distances[i][j];\n                M.set(i, j, -0.5 * d * d);\n            }\n        }\n        // double centre the rows/columns\n        const rowMeans = M.mean('row');\n        const colMeans = M.mean('column');\n        const totalMean = M.mean();\n        M.add(totalMean).subRowVector(rowMeans).subColumnVector(colMeans);\n        // take the SVD of the double centred matrix, and return the\n        // points from it\n        const ret = new SingularValueDecomposition(M);\n        const eigenValues = Matrix.sqrt(ret.diagonalMatrix).diagonal();\n        const U = ret.leftSingularVectors;\n        const λ = eigenValues;\n        const results = [];\n        for (let i = 0; i < U.rows; i++) {\n            const pt = [];\n            for (let k = 0; k < dimension; k++) {\n                pt.push(U.get(i, k) * λ[k]);\n            }\n            results.push(pt);\n        }\n        return results;\n    }\n    catch (_a) {\n        const results = [];\n        for (let i = 0; i < distances.length; i++) {\n            const x = Math.random() * linkDistance;\n            const y = Math.random() * linkDistance;\n            results.push([x, y]);\n        }\n        return results;\n    }\n};\n\nexport { MDSLayout, runMDS };\n//# sourceMappingURL=index.js.map\n"],"names":["DEFAULTS_LAYOUT_OPTIONS$2","MDSLayout","BaseLayout","__awaiter","linkDistance","center","normalizeViewport","n","applySingleNodeLayout","adjList","getAdjList","distances","johnson","handleInfinity$1","scaledD","scaleMatrix","positions","runMDS","i","node","p","maxDistance","infList","row","m","j","value","k","dimension","N","M","Matrix","d","rowMeans","colMeans","totalMean","ret","SingularValueDecomposition","eigenValues","U","λ","results","pt","x","y"],"mappings":";;;;;;AAQA,MAAMA,IAA4B;AAAA,EAC9B,QAAQ,CAAC,GAAG,CAAC;AAAA,EACb,cAAc;AAClB;AAMA,MAAMC,UAAkBC,EAAW;AAAA,EAC/B,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,cAAAC,IAAeJ,EAA0B,aAAY,IAAK,KAAK,SACjE,EAAE,QAAAK,EAAM,IAAKC,EAAkB,KAAK,OAAO,GAC3CC,IAAI,KAAK,MAAM,UAAS;AAC9B,UAAIA,MAAM,KAAKA,MAAM,GAAG;AACpB,QAAAC,EAAsB,KAAK,OAAOH,CAAM;AACxC;AAAA,MACJ;AAEA,YAAMI,IAAUC,EAAW,KAAK,KAAY,GACtCC,IAAYC,EAAQH,CAAO;AACjC,MAAAI,EAAiBF,CAAS;AAE1B,YAAMG,IAAUC,EAAYJ,GAAWP,CAAY,GAE7CY,IAAYC,EAAOH,CAAO;AAChC,UAAII,IAAI;AACR,WAAK,MAAM,YAAY,CAACC,MAAS;AAC7B,cAAMC,IAAIJ,EAAUE,GAAG;AACvB,QAAAC,EAAK,IAAIC,EAAE,CAAC,IAAIf,EAAO,CAAC,GACxBc,EAAK,IAAIC,EAAE,CAAC,IAAIf,EAAO,CAAC;AAAA,MAC5B,CAAC;AAAA,IACL,CAAC;AAAA,EACL;AACJ;AAIA,MAAMQ,IAAmB,CAACF,MAAc;AACpC,MAAIU,IAAc,OAAO;AACzB,QAAMC,IAAU,CAAA,GACVf,IAAII,EAAU;AACpB,WAASO,IAAI,GAAGA,IAAIX,GAAGW,KAAK;AACxB,UAAMK,IAAMZ,EAAUO,CAAC,GACjBM,IAAID,EAAI;AACd,aAASE,IAAI,GAAGA,IAAID,GAAGC,KAAK;AACxB,YAAMC,IAAQH,EAAIE,CAAC;AACnB,MAAIC,MAAU,QACVJ,EAAQ,KAAK,CAACJ,GAAGO,CAAC,CAAC,IAEdJ,IAAcK,MACnBL,IAAcK;AAAA,IAEtB;AAAA,EACJ;AACA,WAASC,IAAI,GAAGA,IAAIL,EAAQ,QAAQK,KAAK;AACrC,UAAM,CAACT,GAAGO,CAAC,IAAIH,EAAQK,CAAC;AACxB,IAAAhB,EAAUO,CAAC,EAAEO,CAAC,IAAIJ;AAAA,EACtB;AACJ,GAQMJ,IAAS,CAACN,GAAWiB,IAAY,GAAGxB,IAAeJ,EAA0B,iBAAiB;AAChG,MAAI;AAEA,UAAM6B,IAAIlB,EAAU,QACdmB,IAAI,IAAIC,EAAOF,GAAGA,CAAC;AACzB,aAASX,IAAI,GAAGA,IAAIW,GAAGX;AACnB,eAASO,IAAI,GAAGA,IAAII,GAAGJ,KAAK;AACxB,cAAMO,IAAIrB,EAAUO,CAAC,EAAEO,CAAC;AACxB,QAAAK,EAAE,IAAIZ,GAAGO,GAAG,OAAOO,IAAIA,CAAC;AAAA,MAC5B;AAGJ,UAAMC,IAAWH,EAAE,KAAK,KAAK,GACvBI,IAAWJ,EAAE,KAAK,QAAQ,GAC1BK,IAAYL,EAAE,KAAI;AACxB,IAAAA,EAAE,IAAIK,CAAS,EAAE,aAAaF,CAAQ,EAAE,gBAAgBC,CAAQ;AAGhE,UAAME,IAAM,IAAIC,EAA2BP,CAAC,GACtCQ,IAAcP,EAAO,KAAKK,EAAI,cAAc,EAAE,SAAQ,GACtDG,IAAIH,EAAI,qBACRI,IAAIF,GACJG,IAAU,CAAA;AAChB,aAASvB,IAAI,GAAGA,IAAIqB,EAAE,MAAMrB,KAAK;AAC7B,YAAMwB,IAAK,CAAA;AACX,eAASf,IAAI,GAAGA,IAAIC,GAAWD;AAC3B,QAAAe,EAAG,KAAKH,EAAE,IAAIrB,GAAGS,CAAC,IAAIa,EAAEb,CAAC,CAAC;AAE9B,MAAAc,EAAQ,KAAKC,CAAE;AAAA,IACnB;AACA,WAAOD;AAAA,EACX,QACW;AACP,UAAMA,IAAU,CAAA;AAChB,aAASvB,IAAI,GAAGA,IAAIP,EAAU,QAAQO,KAAK;AACvC,YAAMyB,IAAI,KAAK,OAAM,IAAKvC,GACpBwC,IAAI,KAAK,OAAM,IAAKxC;AAC1B,MAAAqC,EAAQ,KAAK,CAACE,GAAGC,CAAC,CAAC;AAAA,IACvB;AACA,WAAOH;AAAA,EACX;AACJ;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,157 @@
+import { __awaiter as P } from "../../node_modules/tslib/tslib.es6.js";
+import { applySingleNodeLayout as k } from "../../util/common.js";
+import { formatNodeSizeFn as T, formatFn as U } from "../../util/format.js";
+import { getAdjList as q, johnson as W } from "../../util/math.js";
+import { normalizeViewport as H } from "../../util/viewport.js";
+import { BaseLayout as J } from "../base-layout.js";
+import { runMDS as V } from "../mds/index.js";
+import { radialNonoverlapForce as Y } from "./radial-nonoverlap-force.js";
+const R = {
+  focusNode: null,
+  linkDistance: 50,
+  maxIteration: 1e3,
+  maxPreventOverlapIteration: 200,
+  preventOverlap: !1,
+  sortStrength: 10,
+  strictRadial: !0,
+  unitRadius: null,
+  nodeSize: 10,
+  nodeSpacing: 0
+};
+class it extends J {
+  constructor() {
+    super(...arguments), this.id = "radial";
+  }
+  getDefaultOptions() {
+    return R;
+  }
+  layout() {
+    return P(this, void 0, void 0, function* () {
+      const { width: s, height: a, center: o } = H(this.options), t = this.model.nodeCount();
+      if (!t || t === 1)
+        return k(this.model, o);
+      const { focusNode: n, linkDistance: r = R.linkDistance, maxIteration: m = R.maxIteration, maxPreventOverlapIteration: N = R.maxPreventOverlapIteration, nodeSize: A, nodeSpacing: f, preventOverlap: v, sortBy: F, sortStrength: c = R.sortStrength, strictRadial: i, unitRadius: p } = this.options, g = n && this.model.node(n) || this.model.firstNode(), y = this.model.nodeIndexOf(g.id), l = q(this.model), u = W(l), w = Q(u, y);
+      K(u, y, w + 1);
+      const S = u[y], d = (s - o[0] > o[0] ? o[0] : s - o[0]) || s / 2, M = (a - o[1] > o[1] ? o[1] : a - o[1]) || a / 2, h = Math.min(d, M), L = Math.max(...S), j = [], I = /* @__PURE__ */ new Map(), z = p ?? h / L;
+      S.forEach((O, D) => {
+        const E = O * z;
+        j.push(E), I.set(this.model.nodeAt(D).id, E);
+      });
+      const b = B(this.model, u, r, j, z, F, c), x = V(b, 2, r), _ = x[y];
+      let C = 0;
+      if (this.model.forEachNode((O) => {
+        const D = x[C];
+        O.x = D[0] - _[0], O.y = D[1] - _[1], C++;
+      }), this.run(m, b, j, y), this.model.forEachNode((O) => {
+        O.x += o[0], O.y += o[1];
+      }), v) {
+        const D = {
+          nodeSizeFunc: T(A, f, R.nodeSize, R.nodeSpacing),
+          radiiMap: I,
+          width: s,
+          strictRadial: !!i,
+          focusNode: g,
+          maxIteration: N,
+          k: t / 4.5
+        };
+        Y(this.model, D);
+      }
+    });
+  }
+  run(s, a, o, t) {
+    const n = G(a), r = this.model.nodeCount(), m = this.model.nodes(), N = new Float64Array(r), A = new Float64Array(r);
+    for (let f = 0; f < r; f++)
+      N[f] = m[f].x, A[f] = m[f].y;
+    for (let f = 0; f <= s; f++) {
+      const v = f / s, F = 1 - v;
+      for (let c = 0; c < r; c++) {
+        if (c === t)
+          continue;
+        const i = N[c], p = A[c], g = Math.sqrt(i * i + p * p), y = g === 0 ? 0 : 1 / g;
+        let l = 0, u = 0, w = 0;
+        for (let d = 0; d < r; d++) {
+          if (c === d)
+            continue;
+          const M = N[d], h = A[d], L = Math.sqrt((i - M) * (i - M) + (p - h) * (p - h)), j = L === 0 ? 0 : 1 / L, I = a[d][c];
+          w += n[c][d], l += n[c][d] * (M + I * (i - M) * j), u += n[c][d] * (h + I * (p - h) * j);
+        }
+        const S = o[c] === 0 ? 0 : 1 / o[c];
+        w *= F, w += v * S * S, l *= F, l += v * S * i * y, u *= F, u += v * S * p * y, N[c] = l / w, A[c] = u / w, m[c].x = N[c], m[c].y = A[c];
+      }
+    }
+  }
+}
+const B = (e, s, a, o, t, n, r) => {
+  const m = s.length, N = new Array(m), A = new Array(m);
+  for (let i = 0; i < m; i++)
+    A[i] = o[i] / t;
+  const f = (a + t) / 2, v = /* @__PURE__ */ new Map(), F = !n || n === "data" ? null : U(n, ["node"]), c = n === "data";
+  for (let i = 0; i < m; i++) {
+    const p = s[i], g = new Array(m);
+    N[i] = g;
+    const y = A[i] || 1;
+    for (let l = 0; l < m; l++) {
+      if (i === l) {
+        g[l] = 0;
+        continue;
+      }
+      const u = p[l];
+      if (o[i] === o[l])
+        if (c)
+          g[l] = u * Math.abs(i - l) * r / y;
+        else if (F) {
+          const w = e.nodeAt(i), S = e.nodeAt(l);
+          let d = v.get(w.id);
+          if (d === void 0) {
+            const h = F(w._original) || 0;
+            d = typeof h == "string" ? h.charCodeAt(0) : Number(h || 0), v.set(w.id, d);
+          }
+          let M = v.get(S.id);
+          if (M === void 0) {
+            const h = F(S._original) || 0;
+            M = typeof h == "string" ? h.charCodeAt(0) : Number(h || 0), v.set(S.id, M);
+          }
+          g[l] = u * Math.abs(d - M) * r / y;
+        } else
+          g[l] = u * a / y;
+      else
+        g[l] = u * f;
+    }
+  }
+  return N;
+}, G = (e) => {
+  const s = e.length, a = e[0].length, o = [];
+  for (let t = 0; t < s; t++) {
+    const n = [];
+    for (let r = 0; r < a; r++)
+      e[t][r] !== 0 ? n.push(1 / (e[t][r] * e[t][r])) : n.push(0);
+    o.push(n);
+  }
+  return o;
+}, K = (e, s, a) => {
+  const o = e.length;
+  for (let t = 0; t < o; t++)
+    if (e[s][t] === 1 / 0) {
+      e[s][t] = a, e[t][s] = a;
+      for (let n = 0; n < o; n++)
+        e[t][n] !== 1 / 0 && e[s][n] === 1 / 0 && (e[s][n] = a + e[t][n], e[n][s] = a + e[t][n]);
+    }
+  for (let t = 0; t < o; t++)
+    if (t !== s) {
+      for (let n = 0; n < o; n++)
+        if (e[t][n] === 1 / 0) {
+          let r = Math.abs(e[s][t] - e[s][n]);
+          r = r === 0 ? 1 : r, e[t][n] = r;
+        }
+    }
+}, Q = (e, s) => {
+  const a = e[s];
+  let o = 0;
+  for (let t = 0; t < a.length; t++)
+    a[t] !== 1 / 0 && (o = Math.max(o, a[t]));
+  return o;
+};
+export {
+  it as RadialLayout
+};
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/radial/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 { getAdjList, johnson } from '../../util/math.js';\nimport { normalizeViewport } from '../../util/viewport.js';\nimport { BaseLayout } from '../base-layout.js';\nimport { runMDS } from '../mds/index.js';\nimport { radialNonoverlapForce } from './radial-nonoverlap-force.js';\n\nconst DEFAULTS_LAYOUT_OPTIONS = {\n    focusNode: null,\n    linkDistance: 50,\n    maxIteration: 1000,\n    maxPreventOverlapIteration: 200,\n    preventOverlap: false,\n    sortStrength: 10,\n    strictRadial: true,\n    unitRadius: null,\n    nodeSize: 10,\n    nodeSpacing: 0,\n};\n/**\n * <zh/> 径向布局\n *\n * <en/> Radial layout\n */\nclass RadialLayout extends BaseLayout {\n    constructor() {\n        super(...arguments);\n        this.id = 'radial';\n    }\n    getDefaultOptions() {\n        return DEFAULTS_LAYOUT_OPTIONS;\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                return applySingleNodeLayout(this.model, center);\n            }\n            const { focusNode: propsFocusNode, linkDistance = DEFAULTS_LAYOUT_OPTIONS.linkDistance, maxIteration = DEFAULTS_LAYOUT_OPTIONS.maxIteration, maxPreventOverlapIteration = DEFAULTS_LAYOUT_OPTIONS.maxPreventOverlapIteration, nodeSize, nodeSpacing, preventOverlap, sortBy, sortStrength = DEFAULTS_LAYOUT_OPTIONS.sortStrength, strictRadial, unitRadius: propsUnitRadius, } = this.options;\n            const focusNode = (propsFocusNode && this.model.node(propsFocusNode)) ||\n                this.model.firstNode();\n            // the index of the focusNode in data\n            const focusIndex = this.model.nodeIndexOf(focusNode.id);\n            // the graph-theoretic distance (shortest path distance) matrix\n            const adjList = getAdjList(this.model, false);\n            const distances = johnson(adjList);\n            const maxDistance = maxToFocus(distances, focusIndex);\n            // replace first node in unconnected component to the circle at (maxDistance + 1)\n            handleInfinity(distances, focusIndex, maxDistance + 1);\n            // the shortest path distance from each node to focusNode\n            const focusNodeD = distances[focusIndex];\n            const semiWidth = (width - center[0] > center[0] ? center[0] : width - center[0]) ||\n                width / 2;\n            const semiHeight = (height - center[1] > center[1] ? center[1] : height - center[1]) ||\n                height / 2;\n            // the maxRadius of the graph\n            const maxRadius = Math.min(semiWidth, semiHeight);\n            const maxD = Math.max(...focusNodeD);\n            // the radius for each nodes away from focusNode\n            const radii = [];\n            const radiiMap = new Map();\n            const unitRadius = propsUnitRadius !== null && propsUnitRadius !== void 0 ? propsUnitRadius : maxRadius / maxD;\n            focusNodeD.forEach((value, i) => {\n                const v = value * unitRadius;\n                radii.push(v);\n                radiiMap.set(this.model.nodeAt(i).id, v);\n            });\n            const idealDistances = eIdealDisMatrix(this.model, distances, linkDistance, radii, unitRadius, sortBy, sortStrength);\n            // the initial positions from mds, move the graph to origin, centered at focusNode\n            const mdsResult = runMDS(idealDistances, 2, linkDistance);\n            const mdsFocus = mdsResult[focusIndex];\n            let i = 0;\n            this.model.forEachNode((node) => {\n                const p = mdsResult[i];\n                node.x = p[0] - mdsFocus[0];\n                node.y = p[1] - mdsFocus[1];\n                i++;\n            });\n            this.run(maxIteration, idealDistances, radii, focusIndex);\n            this.model.forEachNode((node) => {\n                node.x += center[0];\n                node.y += center[1];\n            });\n            // stagger the overlapped nodes\n            if (preventOverlap) {\n                const nodeSizeFunc = formatNodeSizeFn(nodeSize, nodeSpacing, DEFAULTS_LAYOUT_OPTIONS.nodeSize, DEFAULTS_LAYOUT_OPTIONS.nodeSpacing);\n                const nonoverlapForceParams = {\n                    nodeSizeFunc,\n                    radiiMap,\n                    width,\n                    strictRadial: Boolean(strictRadial),\n                    focusNode,\n                    maxIteration: maxPreventOverlapIteration,\n                    k: n / 4.5,\n                };\n                radialNonoverlapForce(this.model, nonoverlapForceParams);\n            }\n        });\n    }\n    run(maxIteration, idealDistances, radii, focusIndex) {\n        const weights = getWeightMatrix(idealDistances);\n        const n = this.model.nodeCount();\n        const nodes = this.model.nodes();\n        const xs = new Float64Array(n);\n        const ys = new Float64Array(n);\n        for (let i = 0; i < n; i++) {\n            xs[i] = nodes[i].x;\n            ys[i] = nodes[i].y;\n        }\n        for (let i = 0; i <= maxIteration; i++) {\n            const param = i / maxIteration;\n            const vparam = 1 - param;\n            for (let i = 0; i < n; i++) {\n                if (i === focusIndex)\n                    continue;\n                const vx = xs[i];\n                const vy = ys[i];\n                const originDis = Math.sqrt(vx * vx + vy * vy);\n                const reciODis = originDis === 0 ? 0 : 1 / originDis;\n                let xMolecule = 0;\n                let yMolecule = 0;\n                let denominator = 0;\n                for (let j = 0; j < n; j++) {\n                    // u\n                    if (i === j)\n                        continue;\n                    const ux = xs[j];\n                    const uy = ys[j];\n                    // the euclidean distance between v and u\n                    const edis = Math.sqrt((vx - ux) * (vx - ux) + (vy - uy) * (vy - uy));\n                    const reciEdis = edis === 0 ? 0 : 1 / edis;\n                    const idealDis = idealDistances[j][i];\n                    // same for x and y\n                    denominator += weights[i][j];\n                    // x\n                    xMolecule += weights[i][j] * (ux + idealDis * (vx - ux) * reciEdis);\n                    // y\n                    yMolecule += weights[i][j] * (uy + idealDis * (vy - uy) * reciEdis);\n                }\n                const reciR = radii[i] === 0 ? 0 : 1 / radii[i];\n                denominator *= vparam;\n                denominator += param * reciR * reciR;\n                // x\n                xMolecule *= vparam;\n                xMolecule += param * reciR * vx * reciODis;\n                // y\n                yMolecule *= vparam;\n                yMolecule += param * reciR * vy * reciODis;\n                xs[i] = xMolecule / denominator;\n                ys[i] = yMolecule / denominator;\n                nodes[i].x = xs[i];\n                nodes[i].y = ys[i];\n            }\n        }\n    }\n}\nconst eIdealDisMatrix = (model, distances, linkDistance, radii, unitRadius, sortBy, sortStrength) => {\n    const n = distances.length;\n    const result = new Array(n);\n    const radiusScale = new Array(n);\n    for (let i = 0; i < n; i++)\n        radiusScale[i] = radii[i] / unitRadius;\n    const baseLink = (linkDistance + unitRadius) / 2;\n    const sortCache = new Map();\n    const sortFn = !sortBy || sortBy === 'data' ? null : formatFn(sortBy, ['node']);\n    const isDataSort = sortBy === 'data';\n    for (let i = 0; i < n; i++) {\n        const row = distances[i];\n        const newRow = new Array(n);\n        result[i] = newRow;\n        const riScale = radiusScale[i] || 1;\n        for (let j = 0; j < n; j++) {\n            if (i === j) {\n                newRow[j] = 0;\n                continue;\n            }\n            const v = row[j];\n            if (radii[i] === radii[j]) {\n                if (isDataSort) {\n                    newRow[j] = (v * Math.abs(i - j) * sortStrength) / riScale;\n                }\n                else if (sortFn) {\n                    // cache node attribute values\n                    const nodeI = model.nodeAt(i);\n                    const nodeJ = model.nodeAt(j);\n                    let iv = sortCache.get(nodeI.id);\n                    if (iv === undefined) {\n                        const raw = sortFn(nodeI._original) || 0;\n                        iv = typeof raw === 'string' ? raw.charCodeAt(0) : Number(raw || 0);\n                        sortCache.set(nodeI.id, iv);\n                    }\n                    let jv = sortCache.get(nodeJ.id);\n                    if (jv === undefined) {\n                        const raw = sortFn(nodeJ._original) || 0;\n                        jv = typeof raw === 'string' ? raw.charCodeAt(0) : Number(raw || 0);\n                        sortCache.set(nodeJ.id, jv);\n                    }\n                    newRow[j] = (v * Math.abs(iv - jv) * sortStrength) / riScale;\n                }\n                else {\n                    newRow[j] = (v * linkDistance) / riScale;\n                }\n            }\n            else {\n                newRow[j] = v * baseLink;\n            }\n        }\n    }\n    return result;\n};\nconst getWeightMatrix = (idealDistances) => {\n    const rows = idealDistances.length;\n    const cols = idealDistances[0].length;\n    const result = [];\n    for (let i = 0; i < rows; i++) {\n        const row = [];\n        for (let j = 0; j < cols; j++) {\n            if (idealDistances[i][j] !== 0) {\n                row.push(1 / (idealDistances[i][j] * idealDistances[i][j]));\n            }\n            else {\n                row.push(0);\n            }\n        }\n        result.push(row);\n    }\n    return result;\n};\nconst handleInfinity = (matrix, focusIndex, step) => {\n    const n = matrix.length;\n    for (let i = 0; i < n; i++) {\n        // matrix 关注点对应行的 Inf 项\n        if (matrix[focusIndex][i] === Infinity) {\n            matrix[focusIndex][i] = step;\n            matrix[i][focusIndex] = step;\n            // 遍历 matrix 中的 i 行，i 行中非 Inf 项若在 focus 行为 Inf，则替换 focus 行的那个 Inf\n            for (let j = 0; j < n; j++) {\n                if (matrix[i][j] !== Infinity && matrix[focusIndex][j] === Infinity) {\n                    matrix[focusIndex][j] = step + matrix[i][j];\n                    matrix[j][focusIndex] = step + matrix[i][j];\n                }\n            }\n        }\n    }\n    // 处理其他行的 Inf。根据该行对应点与 focus 距离以及 Inf 项点 与 focus 距离，决定替换值\n    for (let i = 0; i < n; i++) {\n        if (i === focusIndex) {\n            continue;\n        }\n        for (let j = 0; j < n; j++) {\n            if (matrix[i][j] === Infinity) {\n                let minus = Math.abs(matrix[focusIndex][i] - matrix[focusIndex][j]);\n                minus = minus === 0 ? 1 : minus;\n                matrix[i][j] = minus;\n            }\n        }\n    }\n};\n/**\n * Get the maximum finite distance from the focus node to other nodes\n */\nconst maxToFocus = (matrix, focusIndex) => {\n    const row = matrix[focusIndex];\n    let max = 0;\n    for (let i = 0; i < row.length; i++) {\n        if (row[i] === Infinity)\n            continue;\n        max = Math.max(max, row[i]);\n    }\n    return max;\n};\n\nexport { RadialLayout };\n//# sourceMappingURL=index.js.map\n"],"names":["DEFAULTS_LAYOUT_OPTIONS","RadialLayout","BaseLayout","__awaiter","width","height","center","normalizeViewport","n","applySingleNodeLayout","propsFocusNode","linkDistance","maxIteration","maxPreventOverlapIteration","nodeSize","nodeSpacing","preventOverlap","sortBy","sortStrength","strictRadial","propsUnitRadius","focusNode","focusIndex","adjList","getAdjList","distances","johnson","maxDistance","maxToFocus","handleInfinity","focusNodeD","semiWidth","semiHeight","maxRadius","maxD","radii","radiiMap","unitRadius","value","i","v","idealDistances","eIdealDisMatrix","mdsResult","runMDS","mdsFocus","node","p","nonoverlapForceParams","formatNodeSizeFn","radialNonoverlapForce","weights","getWeightMatrix","nodes","xs","ys","param","vparam","vx","vy","originDis","reciODis","xMolecule","yMolecule","denominator","j","ux","uy","edis","reciEdis","idealDis","reciR","model","result","radiusScale","baseLink","sortCache","sortFn","formatFn","isDataSort","row","newRow","riScale","nodeI","nodeJ","iv","raw","jv","rows","cols","matrix","step","minus","max"],"mappings":";;;;;;;;AAUA,MAAMA,IAA0B;AAAA,EAC5B,WAAW;AAAA,EACX,cAAc;AAAA,EACd,cAAc;AAAA,EACd,4BAA4B;AAAA,EAC5B,gBAAgB;AAAA,EAChB,cAAc;AAAA,EACd,cAAc;AAAA,EACd,YAAY;AAAA,EACZ,UAAU;AAAA,EACV,aAAa;AACjB;AAMA,MAAMC,WAAqBC,EAAW;AAAA,EAClC,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;AACZ,eAAOC,EAAsB,KAAK,OAAOH,CAAM;AAEnD,YAAM,EAAE,WAAWI,GAAgB,cAAAC,IAAeX,EAAwB,cAAc,cAAAY,IAAeZ,EAAwB,cAAc,4BAAAa,IAA6Bb,EAAwB,4BAA4B,UAAAc,GAAU,aAAAC,GAAa,gBAAAC,GAAgB,QAAAC,GAAQ,cAAAC,IAAelB,EAAwB,cAAc,cAAAmB,GAAc,YAAYC,EAAe,IAAM,KAAK,SAChXC,IAAaX,KAAkB,KAAK,MAAM,KAAKA,CAAc,KAC/D,KAAK,MAAM,UAAS,GAElBY,IAAa,KAAK,MAAM,YAAYD,EAAU,EAAE,GAEhDE,IAAUC,EAAW,KAAK,KAAY,GACtCC,IAAYC,EAAQH,CAAO,GAC3BI,IAAcC,EAAWH,GAAWH,CAAU;AAEpD,MAAAO,EAAeJ,GAAWH,GAAYK,IAAc,CAAC;AAErD,YAAMG,IAAaL,EAAUH,CAAU,GACjCS,KAAa3B,IAAQE,EAAO,CAAC,IAAIA,EAAO,CAAC,IAAIA,EAAO,CAAC,IAAIF,IAAQE,EAAO,CAAC,MAC3EF,IAAQ,GACN4B,KAAc3B,IAASC,EAAO,CAAC,IAAIA,EAAO,CAAC,IAAIA,EAAO,CAAC,IAAID,IAASC,EAAO,CAAC,MAC9ED,IAAS,GAEP4B,IAAY,KAAK,IAAIF,GAAWC,CAAU,GAC1CE,IAAO,KAAK,IAAI,GAAGJ,CAAU,GAE7BK,IAAQ,CAAA,GACRC,IAAW,oBAAI,IAAG,GAClBC,IAAajB,KAA2Ea,IAAYC;AAC1G,MAAAJ,EAAW,QAAQ,CAACQ,GAAOC,MAAM;AAC7B,cAAMC,IAAIF,IAAQD;AAClB,QAAAF,EAAM,KAAKK,CAAC,GACZJ,EAAS,IAAI,KAAK,MAAM,OAAOG,CAAC,EAAE,IAAIC,CAAC;AAAA,MAC3C,CAAC;AACD,YAAMC,IAAiBC,EAAgB,KAAK,OAAOjB,GAAWd,GAAcwB,GAAOE,GAAYpB,GAAQC,CAAY,GAE7GyB,IAAYC,EAAOH,GAAgB,GAAG9B,CAAY,GAClDkC,IAAWF,EAAUrB,CAAU;AACrC,UAAIiB,IAAI;AAaR,UAZA,KAAK,MAAM,YAAY,CAACO,MAAS;AAC7B,cAAMC,IAAIJ,EAAUJ,CAAC;AACrB,QAAAO,EAAK,IAAIC,EAAE,CAAC,IAAIF,EAAS,CAAC,GAC1BC,EAAK,IAAIC,EAAE,CAAC,IAAIF,EAAS,CAAC,GAC1BN;AAAA,MACJ,CAAC,GACD,KAAK,IAAI3B,GAAc6B,GAAgBN,GAAOb,CAAU,GACxD,KAAK,MAAM,YAAY,CAACwB,MAAS;AAC7B,QAAAA,EAAK,KAAKxC,EAAO,CAAC,GAClBwC,EAAK,KAAKxC,EAAO,CAAC;AAAA,MACtB,CAAC,GAEGU,GAAgB;AAEhB,cAAMgC,IAAwB;AAAA,UAC1B,cAFiBC,EAAiBnC,GAAUC,GAAaf,EAAwB,UAAUA,EAAwB,WAAW;AAAA,UAG9H,UAAAoC;AAAA,UACA,OAAAhC;AAAA,UACA,cAAc,EAAQe;AAAA,UACtB,WAAAE;AAAA,UACA,cAAcR;AAAA,UACd,GAAGL,IAAI;AAAA,QAC3B;AACgB,QAAA0C,EAAsB,KAAK,OAAOF,CAAqB;AAAA,MAC3D;AAAA,IACJ,CAAC;AAAA,EACL;AAAA,EACA,IAAIpC,GAAc6B,GAAgBN,GAAOb,GAAY;AACjD,UAAM6B,IAAUC,EAAgBX,CAAc,GACxCjC,IAAI,KAAK,MAAM,UAAS,GACxB6C,IAAQ,KAAK,MAAM,MAAK,GACxBC,IAAK,IAAI,aAAa9C,CAAC,GACvB+C,IAAK,IAAI,aAAa/C,CAAC;AAC7B,aAAS+B,IAAI,GAAGA,IAAI/B,GAAG+B;AACnB,MAAAe,EAAGf,CAAC,IAAIc,EAAMd,CAAC,EAAE,GACjBgB,EAAGhB,CAAC,IAAIc,EAAMd,CAAC,EAAE;AAErB,aAASA,IAAI,GAAGA,KAAK3B,GAAc2B,KAAK;AACpC,YAAMiB,IAAQjB,IAAI3B,GACZ6C,IAAS,IAAID;AACnB,eAASjB,IAAI,GAAGA,IAAI/B,GAAG+B,KAAK;AACxB,YAAIA,MAAMjB;AACN;AACJ,cAAMoC,IAAKJ,EAAGf,CAAC,GACToB,IAAKJ,EAAGhB,CAAC,GACTqB,IAAY,KAAK,KAAKF,IAAKA,IAAKC,IAAKA,CAAE,GACvCE,IAAWD,MAAc,IAAI,IAAI,IAAIA;AAC3C,YAAIE,IAAY,GACZC,IAAY,GACZC,IAAc;AAClB,iBAASC,IAAI,GAAGA,IAAIzD,GAAGyD,KAAK;AAExB,cAAI1B,MAAM0B;AACN;AACJ,gBAAMC,IAAKZ,EAAGW,CAAC,GACTE,IAAKZ,EAAGU,CAAC,GAETG,IAAO,KAAK,MAAMV,IAAKQ,MAAOR,IAAKQ,MAAOP,IAAKQ,MAAOR,IAAKQ,EAAG,GAC9DE,IAAWD,MAAS,IAAI,IAAI,IAAIA,GAChCE,IAAW7B,EAAewB,CAAC,EAAE1B,CAAC;AAEpC,UAAAyB,KAAeb,EAAQZ,CAAC,EAAE0B,CAAC,GAE3BH,KAAaX,EAAQZ,CAAC,EAAE0B,CAAC,KAAKC,IAAKI,KAAYZ,IAAKQ,KAAMG,IAE1DN,KAAaZ,EAAQZ,CAAC,EAAE0B,CAAC,KAAKE,IAAKG,KAAYX,IAAKQ,KAAME;AAAA,QAC9D;AACA,cAAME,IAAQpC,EAAMI,CAAC,MAAM,IAAI,IAAI,IAAIJ,EAAMI,CAAC;AAC9C,QAAAyB,KAAeP,GACfO,KAAeR,IAAQe,IAAQA,GAE/BT,KAAaL,GACbK,KAAaN,IAAQe,IAAQb,IAAKG,GAElCE,KAAaN,GACbM,KAAaP,IAAQe,IAAQZ,IAAKE,GAClCP,EAAGf,CAAC,IAAIuB,IAAYE,GACpBT,EAAGhB,CAAC,IAAIwB,IAAYC,GACpBX,EAAMd,CAAC,EAAE,IAAIe,EAAGf,CAAC,GACjBc,EAAMd,CAAC,EAAE,IAAIgB,EAAGhB,CAAC;AAAA,MACrB;AAAA,IACJ;AAAA,EACJ;AACJ;AACA,MAAMG,IAAkB,CAAC8B,GAAO/C,GAAWd,GAAcwB,GAAOE,GAAYpB,GAAQC,MAAiB;AACjG,QAAMV,IAAIiB,EAAU,QACdgD,IAAS,IAAI,MAAMjE,CAAC,GACpBkE,IAAc,IAAI,MAAMlE,CAAC;AAC/B,WAAS,IAAI,GAAG,IAAIA,GAAG;AACnB,IAAAkE,EAAY,CAAC,IAAIvC,EAAM,CAAC,IAAIE;AAChC,QAAMsC,KAAYhE,IAAe0B,KAAc,GACzCuC,IAAY,oBAAI,IAAG,GACnBC,IAAS,CAAC5D,KAAUA,MAAW,SAAS,OAAO6D,EAAS7D,GAAQ,CAAC,MAAM,CAAC,GACxE8D,IAAa9D,MAAW;AAC9B,WAAS,IAAI,GAAG,IAAIT,GAAG,KAAK;AACxB,UAAMwE,IAAMvD,EAAU,CAAC,GACjBwD,IAAS,IAAI,MAAMzE,CAAC;AAC1B,IAAAiE,EAAO,CAAC,IAAIQ;AACZ,UAAMC,IAAUR,EAAY,CAAC,KAAK;AAClC,aAAST,IAAI,GAAGA,IAAIzD,GAAGyD,KAAK;AACxB,UAAI,MAAMA,GAAG;AACT,QAAAgB,EAAOhB,CAAC,IAAI;AACZ;AAAA,MACJ;AACA,YAAMzB,IAAIwC,EAAIf,CAAC;AACf,UAAI9B,EAAM,CAAC,MAAMA,EAAM8B,CAAC;AACpB,YAAIc;AACA,UAAAE,EAAOhB,CAAC,IAAKzB,IAAI,KAAK,IAAI,IAAIyB,CAAC,IAAI/C,IAAgBgE;AAAA,iBAE9CL,GAAQ;AAEb,gBAAMM,IAAQX,EAAM,OAAO,CAAC,GACtBY,IAAQZ,EAAM,OAAOP,CAAC;AAC5B,cAAIoB,IAAKT,EAAU,IAAIO,EAAM,EAAE;AAC/B,cAAIE,MAAO,QAAW;AAClB,kBAAMC,IAAMT,EAAOM,EAAM,SAAS,KAAK;AACvC,YAAAE,IAAK,OAAOC,KAAQ,WAAWA,EAAI,WAAW,CAAC,IAAI,OAAOA,KAAO,CAAC,GAClEV,EAAU,IAAIO,EAAM,IAAIE,CAAE;AAAA,UAC9B;AACA,cAAIE,IAAKX,EAAU,IAAIQ,EAAM,EAAE;AAC/B,cAAIG,MAAO,QAAW;AAClB,kBAAMD,IAAMT,EAAOO,EAAM,SAAS,KAAK;AACvC,YAAAG,IAAK,OAAOD,KAAQ,WAAWA,EAAI,WAAW,CAAC,IAAI,OAAOA,KAAO,CAAC,GAClEV,EAAU,IAAIQ,EAAM,IAAIG,CAAE;AAAA,UAC9B;AACA,UAAAN,EAAOhB,CAAC,IAAKzB,IAAI,KAAK,IAAI6C,IAAKE,CAAE,IAAIrE,IAAgBgE;AAAA,QACzD;AAEI,UAAAD,EAAOhB,CAAC,IAAKzB,IAAI7B,IAAgBuE;AAAA;AAIrC,QAAAD,EAAOhB,CAAC,IAAIzB,IAAImC;AAAA,IAExB;AAAA,EACJ;AACA,SAAOF;AACX,GACMrB,IAAkB,CAACX,MAAmB;AACxC,QAAM+C,IAAO/C,EAAe,QACtBgD,IAAOhD,EAAe,CAAC,EAAE,QACzBgC,IAAS,CAAA;AACf,WAASlC,IAAI,GAAGA,IAAIiD,GAAMjD,KAAK;AAC3B,UAAMyC,IAAM,CAAA;AACZ,aAASf,IAAI,GAAGA,IAAIwB,GAAMxB;AACtB,MAAIxB,EAAeF,CAAC,EAAE0B,CAAC,MAAM,IACzBe,EAAI,KAAK,KAAKvC,EAAeF,CAAC,EAAE0B,CAAC,IAAIxB,EAAeF,CAAC,EAAE0B,CAAC,EAAE,IAG1De,EAAI,KAAK,CAAC;AAGlB,IAAAP,EAAO,KAAKO,CAAG;AAAA,EACnB;AACA,SAAOP;AACX,GACM5C,IAAiB,CAAC6D,GAAQpE,GAAYqE,MAAS;AACjD,QAAMnF,IAAIkF,EAAO;AACjB,WAASnD,IAAI,GAAGA,IAAI/B,GAAG+B;AAEnB,QAAImD,EAAOpE,CAAU,EAAEiB,CAAC,MAAM,OAAU;AACpC,MAAAmD,EAAOpE,CAAU,EAAEiB,CAAC,IAAIoD,GACxBD,EAAOnD,CAAC,EAAEjB,CAAU,IAAIqE;AAExB,eAAS1B,IAAI,GAAGA,IAAIzD,GAAGyD;AACnB,QAAIyB,EAAOnD,CAAC,EAAE0B,CAAC,MAAM,SAAYyB,EAAOpE,CAAU,EAAE2C,CAAC,MAAM,UACvDyB,EAAOpE,CAAU,EAAE2C,CAAC,IAAI0B,IAAOD,EAAOnD,CAAC,EAAE0B,CAAC,GAC1CyB,EAAOzB,CAAC,EAAE3C,CAAU,IAAIqE,IAAOD,EAAOnD,CAAC,EAAE0B,CAAC;AAAA,IAGtD;AAGJ,WAAS1B,IAAI,GAAGA,IAAI/B,GAAG+B;AACnB,QAAIA,MAAMjB;AAGV,eAAS2C,IAAI,GAAGA,IAAIzD,GAAGyD;AACnB,YAAIyB,EAAOnD,CAAC,EAAE0B,CAAC,MAAM,OAAU;AAC3B,cAAI2B,IAAQ,KAAK,IAAIF,EAAOpE,CAAU,EAAEiB,CAAC,IAAImD,EAAOpE,CAAU,EAAE2C,CAAC,CAAC;AAClE,UAAA2B,IAAQA,MAAU,IAAI,IAAIA,GAC1BF,EAAOnD,CAAC,EAAE0B,CAAC,IAAI2B;AAAA,QACnB;AAAA;AAGZ,GAIMhE,IAAa,CAAC8D,GAAQpE,MAAe;AACvC,QAAM0D,IAAMU,EAAOpE,CAAU;AAC7B,MAAIuE,IAAM;AACV,WAAStD,IAAI,GAAGA,IAAIyC,EAAI,QAAQzC;AAC5B,IAAIyC,EAAIzC,CAAC,MAAM,UAEfsD,IAAM,KAAK,IAAIA,GAAKb,EAAIzC,CAAC,CAAC;AAE9B,SAAOsD;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/algorithm/radial/radial-nonoverlap-force.js

@@ -0,0 +1,76 @@
+const E = {
+  maxIteration: 10,
+  width: 10,
+  speed: 100,
+  gravity: 10,
+  k: 5
+}, O = (o, y) => {
+  const f = Object.assign(Object.assign({}, E), y), { maxIteration: p, width: r, k: l, speed: x = E.speed, strictRadial: g, focusNode: e, radiiMap: t, nodeSizeFunc: s } = f, a = l * 2e-3, h = /* @__PURE__ */ new Map(), c = r / 10;
+  for (let i = 0; i < p && (o.forEachNode((v) => {
+    h.set(v.id, { x: 0, y: 0 });
+  }), I(o, h, l, t, s), !(S(o, h, x, g, e, c, t) < a)); i++)
+    ;
+}, I = (o, y, f, p, r) => {
+  let l = 0;
+  o.forEachNode((x) => {
+    let g = 0;
+    o.forEachNode((e) => {
+      if (g <= l) {
+        g++;
+        return;
+      }
+      if (x.id === e.id || p.get(x.id) !== p.get(e.id))
+        return;
+      let t = x.x - e.x, s = x.y - e.y, a = Math.sqrt(t * t + s * s);
+      if (a === 0) {
+        a = 1;
+        const i = l > g ? 1 : -1;
+        t = 0.01 * i, s = 0.01 * i;
+      }
+      const h = Math.max(...r(x._original)), c = Math.max(...r(e._original));
+      if (a < c / 2 + h / 2) {
+        const i = f * f / a, n = y.get(x.id), v = y.get(e.id), M = t / a * i, D = s / a * i;
+        y.set(x.id, {
+          x: n.x + M,
+          y: n.y + D
+        }), y.set(e.id, {
+          x: v.x - M,
+          y: v.y - D
+        });
+      }
+      g++;
+    }), l++;
+  });
+}, S = (o, y, f, p, r, l, x) => {
+  p && o.forEachNode((t) => {
+    const s = t.x - r.x, a = t.y - r.y, h = Math.sqrt(s * s + a * a);
+    let c = a / h, i = -s / h;
+    const n = y.get(t.id), v = Math.sqrt(n.x * n.x + n.y * n.y);
+    let M = Math.acos((c * n.x + i * n.y) / v);
+    M > Math.PI / 2 && (M -= Math.PI / 2, c *= -1, i *= -1);
+    const D = Math.cos(M) * v;
+    y.set(t.id, {
+      x: c * D,
+      y: i * D
+    });
+  });
+  let g = 0, e = 0;
+  return o.forEachNode((t) => {
+    if (t.id === r.id)
+      return;
+    const s = y.get(t.id), a = Math.sqrt(s.x * s.x + s.y * s.y);
+    if (a > 0) {
+      const h = Math.min(l * (f / 800), a);
+      if (t.x += s.x / a * h, t.y += s.y / a * h, p) {
+        let c = t.x - r.x, i = t.y - r.y;
+        const n = Math.sqrt(c * c + i * i);
+        c = c / n * x.get(t.id), i = i / n * x.get(t.id), t.x = r.x + c, t.y = r.y + i;
+      }
+      g += h, e++;
+    }
+  }), e > 0 ? g / e : 0;
+};
+export {
+  O as radialNonoverlapForce
+};
+//# sourceMappingURL=radial-nonoverlap-force.js.map

package/dist/node_modules/@antv/layout/lib/algorithm/radial/radial-nonoverlap-force.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"radial-nonoverlap-force.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/radial/radial-nonoverlap-force.js"],"sourcesContent":["const SPEED_DIVISOR = 800;\nconst DEFAULTS_LAYOUT_OPTIONS$1 = {\n    maxIteration: 10,\n    width: 10,\n    speed: 100,\n    gravity: 10,\n    k: 5,\n};\nconst radialNonoverlapForce = (model, options) => {\n    const mergedOptions = Object.assign(Object.assign({}, DEFAULTS_LAYOUT_OPTIONS$1), options);\n    const { maxIteration, width, k, speed = DEFAULTS_LAYOUT_OPTIONS$1.speed, strictRadial, focusNode, radiiMap, nodeSizeFunc, } = mergedOptions;\n    const earlyStopThreshold = k * 0.002;\n    const displacements = new Map();\n    const maxDisplacement = width / 10;\n    for (let i = 0; i < maxIteration; i++) {\n        model.forEachNode((node) => {\n            displacements.set(node.id, { x: 0, y: 0 });\n        });\n        // 给重叠的节点增加斥力\n        getRepulsion(model, displacements, k, radiiMap, nodeSizeFunc);\n        const avgDisplacement = updatePositions(model, displacements, speed, strictRadial, focusNode, maxDisplacement, radiiMap);\n        if (avgDisplacement < earlyStopThreshold) {\n            break;\n        }\n    }\n};\nconst getRepulsion = (model, displacements, k, radiiMap, nodeSizeFunc) => {\n    let i = 0;\n    model.forEachNode((nodeU) => {\n        let j = 0;\n        model.forEachNode((nodeV) => {\n            if (j <= i) {\n                j++;\n                return;\n            }\n            if (nodeU.id === nodeV.id)\n                return;\n            // nodeU and nodeV are not on the same circle, return\n            if (radiiMap.get(nodeU.id) !== radiiMap.get(nodeV.id))\n                return;\n            let vecx = nodeU.x - nodeV.x;\n            let vecy = nodeU.y - nodeV.y;\n            let vecLength = Math.sqrt(vecx * vecx + vecy * vecy);\n            // If the two nodes are exactly at the same position, we set a small distance between them\n            if (vecLength === 0) {\n                vecLength = 1;\n                const sign = i > j ? 1 : -1;\n                vecx = 0.01 * sign;\n                vecy = 0.01 * sign;\n            }\n            const nodeSizeU = Math.max(...nodeSizeFunc(nodeU._original));\n            const nodeSizeV = Math.max(...nodeSizeFunc(nodeV._original));\n            // these two nodes overlap\n            if (vecLength < nodeSizeV / 2 + nodeSizeU / 2) {\n                const common = (k * k) / vecLength;\n                const dispU = displacements.get(nodeU.id);\n                const dispV = displacements.get(nodeV.id);\n                const deltaX = (vecx / vecLength) * common;\n                const deltaY = (vecy / vecLength) * common;\n                displacements.set(nodeU.id, {\n                    x: dispU.x + deltaX,\n                    y: dispU.y + deltaY,\n                });\n                displacements.set(nodeV.id, {\n                    x: dispV.x - deltaX,\n                    y: dispV.y - deltaY,\n                });\n            }\n            j++;\n        });\n        i++;\n    });\n};\nconst updatePositions = (model, displacements, speed, strictRadial, focusNode, maxDisplacement, radiiMap) => {\n    if (strictRadial) {\n        model.forEachNode((node) => {\n            const vx = node.x - focusNode.x;\n            const vy = node.y - focusNode.y;\n            const vLength = Math.sqrt(vx * vx + vy * vy);\n            let vpx = vy / vLength;\n            let vpy = -vx / vLength;\n            const disp = displacements.get(node.id);\n            const diLength = Math.sqrt(disp.x * disp.x + disp.y * disp.y);\n            let alpha = Math.acos((vpx * disp.x + vpy * disp.y) / diLength);\n            if (alpha > Math.PI / 2) {\n                alpha -= Math.PI / 2;\n                vpx *= -1;\n                vpy *= -1;\n            }\n            const tdispLength = Math.cos(alpha) * diLength;\n            displacements.set(node.id, {\n                x: vpx * tdispLength,\n                y: vpy * tdispLength,\n            });\n        });\n    }\n    // move\n    let totalDisplacement = 0;\n    let nodeCount = 0;\n    model.forEachNode((node) => {\n        if (node.id === focusNode.id) {\n            return;\n        }\n        const disp = displacements.get(node.id);\n        const distLength = Math.sqrt(disp.x * disp.x + disp.y * disp.y);\n        if (distLength > 0) {\n            const limitedDist = Math.min(maxDisplacement * (speed / SPEED_DIVISOR), distLength);\n            node.x += (disp.x / distLength) * limitedDist;\n            node.y += (disp.y / distLength) * limitedDist;\n            if (strictRadial) {\n                let vx = node.x - focusNode.x;\n                let vy = node.y - focusNode.y;\n                const nfDis = Math.sqrt(vx * vx + vy * vy);\n                vx = (vx / nfDis) * radiiMap.get(node.id);\n                vy = (vy / nfDis) * radiiMap.get(node.id);\n                node.x = focusNode.x + vx;\n                node.y = focusNode.y + vy;\n            }\n            totalDisplacement += limitedDist;\n            nodeCount++;\n        }\n    });\n    return nodeCount > 0 ? totalDisplacement / nodeCount : 0;\n};\n\nexport { radialNonoverlapForce };\n//# sourceMappingURL=radial-nonoverlap-force.js.map\n"],"names":["DEFAULTS_LAYOUT_OPTIONS$1","radialNonoverlapForce","model","options","mergedOptions","maxIteration","width","k","speed","strictRadial","focusNode","radiiMap","nodeSizeFunc","earlyStopThreshold","displacements","maxDisplacement","node","getRepulsion","updatePositions","i","nodeU","j","nodeV","vecx","vecy","vecLength","sign","nodeSizeU","nodeSizeV","common","dispU","dispV","deltaX","deltaY","vx","vy","vLength","vpx","vpy","disp","diLength","alpha","tdispLength","totalDisplacement","nodeCount","distLength","limitedDist","nfDis"],"mappings":"AACA,MAAMA,IAA4B;AAAA,EAC9B,cAAc;AAAA,EACd,OAAO;AAAA,EACP,OAAO;AAAA,EACP,SAAS;AAAA,EACT,GAAG;AACP,GACMC,IAAwB,CAACC,GAAOC,MAAY;AAC9C,QAAMC,IAAgB,OAAO,OAAO,OAAO,OAAO,CAAA,GAAIJ,CAAyB,GAAGG,CAAO,GACnF,EAAE,cAAAE,GAAc,OAAAC,GAAO,GAAAC,GAAG,OAAAC,IAAQR,EAA0B,OAAO,cAAAS,GAAc,WAAAC,GAAW,UAAAC,GAAU,cAAAC,EAAY,IAAMR,GACxHS,IAAqBN,IAAI,MACzBO,IAAgB,oBAAI,IAAG,GACvBC,IAAkBT,IAAQ;AAChC,WAAS,IAAI,GAAG,IAAID,MAChBH,EAAM,YAAY,CAACc,MAAS;AACxB,IAAAF,EAAc,IAAIE,EAAK,IAAI,EAAE,GAAG,GAAG,GAAG,GAAG;AAAA,EAC7C,CAAC,GAEDC,EAAaf,GAAOY,GAAeP,GAAGI,GAAUC,CAAY,GAExD,EADoBM,EAAgBhB,GAAOY,GAAeN,GAAOC,GAAcC,GAAWK,GAAiBJ,CAAQ,IACjGE,KAPQ;AAO9B;AAIR,GACMI,IAAe,CAACf,GAAOY,GAAeP,GAAGI,GAAUC,MAAiB;AACtE,MAAIO,IAAI;AACR,EAAAjB,EAAM,YAAY,CAACkB,MAAU;AACzB,QAAIC,IAAI;AACR,IAAAnB,EAAM,YAAY,CAACoB,MAAU;AACzB,UAAID,KAAKF,GAAG;AACR,QAAAE;AACA;AAAA,MACJ;AAIA,UAHID,EAAM,OAAOE,EAAM,MAGnBX,EAAS,IAAIS,EAAM,EAAE,MAAMT,EAAS,IAAIW,EAAM,EAAE;AAChD;AACJ,UAAIC,IAAOH,EAAM,IAAIE,EAAM,GACvBE,IAAOJ,EAAM,IAAIE,EAAM,GACvBG,IAAY,KAAK,KAAKF,IAAOA,IAAOC,IAAOA,CAAI;AAEnD,UAAIC,MAAc,GAAG;AACjB,QAAAA,IAAY;AACZ,cAAMC,IAAOP,IAAIE,IAAI,IAAI;AACzB,QAAAE,IAAO,OAAOG,GACdF,IAAO,OAAOE;AAAA,MAClB;AACA,YAAMC,IAAY,KAAK,IAAI,GAAGf,EAAaQ,EAAM,SAAS,CAAC,GACrDQ,IAAY,KAAK,IAAI,GAAGhB,EAAaU,EAAM,SAAS,CAAC;AAE3D,UAAIG,IAAYG,IAAY,IAAID,IAAY,GAAG;AAC3C,cAAME,IAAUtB,IAAIA,IAAKkB,GACnBK,IAAQhB,EAAc,IAAIM,EAAM,EAAE,GAClCW,IAAQjB,EAAc,IAAIQ,EAAM,EAAE,GAClCU,IAAUT,IAAOE,IAAaI,GAC9BI,IAAUT,IAAOC,IAAaI;AACpC,QAAAf,EAAc,IAAIM,EAAM,IAAI;AAAA,UACxB,GAAGU,EAAM,IAAIE;AAAA,UACb,GAAGF,EAAM,IAAIG;AAAA,QACjC,CAAiB,GACDnB,EAAc,IAAIQ,EAAM,IAAI;AAAA,UACxB,GAAGS,EAAM,IAAIC;AAAA,UACb,GAAGD,EAAM,IAAIE;AAAA,QACjC,CAAiB;AAAA,MACL;AACA,MAAAZ;AAAA,IACJ,CAAC,GACDF;AAAA,EACJ,CAAC;AACL,GACMD,IAAkB,CAAChB,GAAOY,GAAeN,GAAOC,GAAcC,GAAWK,GAAiBJ,MAAa;AACzG,EAAIF,KACAP,EAAM,YAAY,CAACc,MAAS;AACxB,UAAMkB,IAAKlB,EAAK,IAAIN,EAAU,GACxByB,IAAKnB,EAAK,IAAIN,EAAU,GACxB0B,IAAU,KAAK,KAAKF,IAAKA,IAAKC,IAAKA,CAAE;AAC3C,QAAIE,IAAMF,IAAKC,GACXE,IAAM,CAACJ,IAAKE;AAChB,UAAMG,IAAOzB,EAAc,IAAIE,EAAK,EAAE,GAChCwB,IAAW,KAAK,KAAKD,EAAK,IAAIA,EAAK,IAAIA,EAAK,IAAIA,EAAK,CAAC;AAC5D,QAAIE,IAAQ,KAAK,MAAMJ,IAAME,EAAK,IAAID,IAAMC,EAAK,KAAKC,CAAQ;AAC9D,IAAIC,IAAQ,KAAK,KAAK,MAClBA,KAAS,KAAK,KAAK,GACnBJ,KAAO,IACPC,KAAO;AAEX,UAAMI,IAAc,KAAK,IAAID,CAAK,IAAID;AACtC,IAAA1B,EAAc,IAAIE,EAAK,IAAI;AAAA,MACvB,GAAGqB,IAAMK;AAAA,MACT,GAAGJ,IAAMI;AAAA,IACzB,CAAa;AAAA,EACL,CAAC;AAGL,MAAIC,IAAoB,GACpBC,IAAY;AAChB,SAAA1C,EAAM,YAAY,CAACc,MAAS;AACxB,QAAIA,EAAK,OAAON,EAAU;AACtB;AAEJ,UAAM6B,IAAOzB,EAAc,IAAIE,EAAK,EAAE,GAChC6B,IAAa,KAAK,KAAKN,EAAK,IAAIA,EAAK,IAAIA,EAAK,IAAIA,EAAK,CAAC;AAC9D,QAAIM,IAAa,GAAG;AAChB,YAAMC,IAAc,KAAK,IAAI/B,KAAmBP,IAAQ,MAAgBqC,CAAU;AAGlF,UAFA7B,EAAK,KAAMuB,EAAK,IAAIM,IAAcC,GAClC9B,EAAK,KAAMuB,EAAK,IAAIM,IAAcC,GAC9BrC,GAAc;AACd,YAAIyB,IAAKlB,EAAK,IAAIN,EAAU,GACxByB,IAAKnB,EAAK,IAAIN,EAAU;AAC5B,cAAMqC,IAAQ,KAAK,KAAKb,IAAKA,IAAKC,IAAKA,CAAE;AACzC,QAAAD,IAAMA,IAAKa,IAASpC,EAAS,IAAIK,EAAK,EAAE,GACxCmB,IAAMA,IAAKY,IAASpC,EAAS,IAAIK,EAAK,EAAE,GACxCA,EAAK,IAAIN,EAAU,IAAIwB,GACvBlB,EAAK,IAAIN,EAAU,IAAIyB;AAAA,MAC3B;AACA,MAAAQ,KAAqBG,GACrBF;AAAA,IACJ;AAAA,EACJ,CAAC,GACMA,IAAY,IAAID,IAAoBC,IAAY;AAC3D;","x_google_ignoreList":[0]}

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

@@ -0,0 +1,28 @@
+import { __awaiter as n } from "../../node_modules/tslib/tslib.es6.js";
+import { normalizeViewport as s } from "../../util/viewport.js";
+import { BaseLayout as m } from "../base-layout.js";
+class p extends m {
+  constructor() {
+    super(...arguments), this.id = "random";
+  }
+  getDefaultOptions() {
+    return {
+      center: [0, 0],
+      width: 300,
+      height: 300
+    };
+  }
+  layout() {
+    return n(this, void 0, void 0, function* () {
+      const { width: i, height: a, center: o } = s(this.options);
+      this.model.forEachNode((r) => {
+        r.x = e(i) + o[0], r.y = e(a) + o[1];
+      });
+    });
+  }
+}
+const d = 0.9, e = (t) => (Math.random() - 0.5) * d * t;
+export {
+  p as RandomLayout
+};
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sources":["../../../../../../../node_modules/@antv/layout/lib/algorithm/random/index.js"],"sourcesContent":["import { __awaiter } from '../../node_modules/tslib/tslib.es6.js';\nimport '../../node_modules/@antv/expr/dist/index.esm.js';\nimport { normalizeViewport } from '../../util/viewport.js';\nimport { BaseLayout } from '../base-layout.js';\n\n/**\n * <zh/> 随机布局\n *\n * <en/> Random layout\n */\nclass RandomLayout extends BaseLayout {\n    constructor() {\n        super(...arguments);\n        this.id = 'random';\n    }\n    getDefaultOptions() {\n        return {\n            center: [0, 0],\n            width: 300,\n            height: 300,\n        };\n    }\n    layout() {\n        return __awaiter(this, void 0, void 0, function* () {\n            const { width, height, center } = normalizeViewport(this.options);\n            this.model.forEachNode((node) => {\n                node.x = randomCoord(width) + center[0];\n                node.y = randomCoord(height) + center[1];\n            });\n        });\n    }\n}\nconst layoutScale = 0.9;\n/**\n * <zh/> 生成随机坐标\n *\n * <en/> Generate random coordinates\n */\nconst randomCoord = (size) => (Math.random() - 0.5) * layoutScale * size;\n\nexport { RandomLayout };\n//# sourceMappingURL=index.js.map\n"],"names":["RandomLayout","BaseLayout","__awaiter","width","height","center","normalizeViewport","node","randomCoord","layoutScale","size"],"mappings":";;;AAUA,MAAMA,UAAqBC,EAAW;AAAA,EAClC,cAAc;AACV,UAAM,GAAG,SAAS,GAClB,KAAK,KAAK;AAAA,EACd;AAAA,EACA,oBAAoB;AAChB,WAAO;AAAA,MACH,QAAQ,CAAC,GAAG,CAAC;AAAA,MACb,OAAO;AAAA,MACP,QAAQ;AAAA,IACpB;AAAA,EACI;AAAA,EACA,SAAS;AACL,WAAOC,EAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAM,EAAE,OAAAC,GAAO,QAAAC,GAAQ,QAAAC,EAAM,IAAKC,EAAkB,KAAK,OAAO;AAChE,WAAK,MAAM,YAAY,CAACC,MAAS;AAC7B,QAAAA,EAAK,IAAIC,EAAYL,CAAK,IAAIE,EAAO,CAAC,GACtCE,EAAK,IAAIC,EAAYJ,CAAM,IAAIC,EAAO,CAAC;AAAA,MAC3C,CAAC;AAAA,IACL,CAAC;AAAA,EACL;AACJ;AACA,MAAMI,IAAc,KAMdD,IAAc,CAACE,OAAU,KAAK,WAAW,OAAOD,IAAcC;","x_google_ignoreList":[0]}