@hkyhy/marsun-components-core 0.1.134 → 0.1.136

package/dist/node_modules/@antv/layout/lib/node_modules/tslib/tslib.es6.js

@@ -1,40 +0,0 @@
-function l(e, p) {
-  var n = {};
-  for (var r in e) Object.prototype.hasOwnProperty.call(e, r) && p.indexOf(r) < 0 && (n[r] = e[r]);
-  if (e != null && typeof Object.getOwnPropertySymbols == "function")
-    for (var t = 0, r = Object.getOwnPropertySymbols(e); t < r.length; t++)
-      p.indexOf(r[t]) < 0 && Object.prototype.propertyIsEnumerable.call(e, r[t]) && (n[r[t]] = e[r[t]]);
-  return n;
-}
-function d(e, p, n, r) {
-  function t(f) {
-    return f instanceof n ? f : new n(function(c) {
-      c(f);
-    });
-  }
-  return new (n || (n = Promise))(function(f, c) {
-    function a(o) {
-      try {
-        u(r.next(o));
-      } catch (i) {
-        c(i);
-      }
-    }
-    function y(o) {
-      try {
-        u(r.throw(o));
-      } catch (i) {
-        c(i);
-      }
-    }
-    function u(o) {
-      o.done ? f(o.value) : t(o.value).then(a, y);
-    }
-    u((r = r.apply(e, [])).next());
-  });
-}
-export {
-  d as __awaiter,
-  l as __rest
-};
-//# sourceMappingURL=tslib.es6.js.map

package/dist/node_modules/@antv/layout/lib/node_modules/tslib/tslib.es6.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"tslib.es6.js","sources":["../../../../../../../node_modules/@antv/layout/lib/node_modules/tslib/tslib.es6.js"],"sourcesContent":["/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n/* global Reflect, Promise, SuppressedError, Symbol, Iterator */\r\n\r\n\r\nfunction __rest(s, e) {\r\n    var t = {};\r\n    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n        t[p] = s[p];\r\n    if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n                t[p[i]] = s[p[i]];\r\n        }\r\n    return t;\r\n}\r\n\r\nfunction __awaiter(thisArg, _arguments, P, generator) {\r\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n    return new (P || (P = Promise))(function (resolve, reject) {\r\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n    });\r\n}\r\n\r\ntypeof SuppressedError === \"function\" ? SuppressedError : function (error, suppressed, message) {\r\n    var e = new Error(message);\r\n    return e.name = \"SuppressedError\", e.error = error, e.suppressed = suppressed, e;\r\n};\n\nexport { __awaiter, __rest };\n//# sourceMappingURL=tslib.es6.js.map\n"],"names":["__rest","s","e","t","p","i","__awaiter","thisArg","_arguments","P","generator","adopt","value","resolve","reject","fulfilled","step","rejected","result"],"mappings":"AAiBA,SAASA,EAAOC,GAAGC,GAAG;AAClB,MAAIC,IAAI,CAAA;AACR,WAASC,KAAKH,EAAG,CAAI,OAAO,UAAU,eAAe,KAAKA,GAAGG,CAAC,KAAKF,EAAE,QAAQE,CAAC,IAAI,MAC9ED,EAAEC,CAAC,IAAIH,EAAEG,CAAC;AACd,MAAIH,KAAK,QAAQ,OAAO,OAAO,yBAA0B;AACrD,aAASI,IAAI,GAAGD,IAAI,OAAO,sBAAsBH,CAAC,GAAGI,IAAID,EAAE,QAAQC;AAC/D,MAAIH,EAAE,QAAQE,EAAEC,CAAC,CAAC,IAAI,KAAK,OAAO,UAAU,qBAAqB,KAAKJ,GAAGG,EAAEC,CAAC,CAAC,MACzEF,EAAEC,EAAEC,CAAC,CAAC,IAAIJ,EAAEG,EAAEC,CAAC,CAAC;AAE5B,SAAOF;AACX;AAEA,SAASG,EAAUC,GAASC,GAAYC,GAAGC,GAAW;AAClD,WAASC,EAAMC,GAAO;AAAE,WAAOA,aAAiBH,IAAIG,IAAQ,IAAIH,EAAE,SAAUI,GAAS;AAAE,MAAAA,EAAQD,CAAK;AAAA,IAAG,CAAC;AAAA,EAAG;AAC3G,SAAO,KAAKH,MAAMA,IAAI,UAAU,SAAUI,GAASC,GAAQ;AACvD,aAASC,EAAUH,GAAO;AAAE,UAAI;AAAE,QAAAI,EAAKN,EAAU,KAAKE,CAAK,CAAC;AAAA,MAAG,SAASV,GAAG;AAAE,QAAAY,EAAOZ,CAAC;AAAA,MAAG;AAAA,IAAE;AAC1F,aAASe,EAASL,GAAO;AAAE,UAAI;AAAE,QAAAI,EAAKN,EAAU,MAASE,CAAK,CAAC;AAAA,MAAG,SAASV,GAAG;AAAE,QAAAY,EAAOZ,CAAC;AAAA,MAAG;AAAA,IAAE;AAC7F,aAASc,EAAKE,GAAQ;AAAE,MAAAA,EAAO,OAAOL,EAAQK,EAAO,KAAK,IAAIP,EAAMO,EAAO,KAAK,EAAE,KAAKH,GAAWE,CAAQ;AAAA,IAAG;AAC7G,IAAAD,GAAMN,IAAYA,EAAU,MAAMH,GAAuB,CAAA,CAAE,GAAG,KAAI,CAAE;AAAA,EACxE,CAAC;AACL;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/registry.js

@@ -1,32 +0,0 @@
-import { AntVDagreLayout as r } from "./algorithm/antv-dagre/index.js";
-import { CircularLayout as o } from "./algorithm/circular/index.js";
-import { ConcentricLayout as t } from "./algorithm/concentric/index.js";
-import { D3ForceLayout as a } from "./algorithm/d3-force/index.js";
-import { D3Force3DLayout as m } from "./algorithm/d3-force-3d/index.js";
-import { DagreLayout as i } from "./algorithm/dagre/index.js";
-import { ForceLayout as c } from "./algorithm/force/index.js";
-import { ForceAtlas2Layout as e } from "./algorithm/force-atlas2/index.js";
-import { FruchtermanLayout as f } from "./algorithm/fruchterman/index.js";
-import { GridLayout as u } from "./algorithm/grid/index.js";
-import { MDSLayout as p } from "./algorithm/mds/index.js";
-import { RadialLayout as y } from "./algorithm/radial/index.js";
-import { RandomLayout as L } from "./algorithm/random/index.js";
-const G = {
-  "antv-dagre": r,
-  "d3-force-3d": m,
-  "d3-force": a,
-  "force-atlas2": e,
-  circular: o,
-  concentric: t,
-  dagre: i,
-  force: c,
-  fruchterman: f,
-  grid: u,
-  mds: p,
-  radial: y,
-  random: L
-};
-export {
-  G as registry
-};
-//# sourceMappingURL=registry.js.map

package/dist/node_modules/@antv/layout/lib/registry.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"registry.js","sources":["../../../../../node_modules/@antv/layout/lib/registry.js"],"sourcesContent":["import { AntVDagreLayout } from './algorithm/antv-dagre/index.js';\nimport { CircularLayout } from './algorithm/circular/index.js';\nimport { ConcentricLayout } from './algorithm/concentric/index.js';\nimport { D3ForceLayout } from './algorithm/d3-force/index.js';\nimport { D3Force3DLayout } from './algorithm/d3-force-3d/index.js';\nimport { DagreLayout } from './algorithm/dagre/index.js';\nimport { ForceLayout } from './algorithm/force/index.js';\nimport { ForceAtlas2Layout } from './algorithm/force-atlas2/index.js';\nimport { FruchtermanLayout } from './algorithm/fruchterman/index.js';\nimport { GridLayout } from './algorithm/grid/index.js';\nimport { MDSLayout } from './algorithm/mds/index.js';\nimport { RadialLayout } from './algorithm/radial/index.js';\nimport { RandomLayout } from './algorithm/random/index.js';\n\nconst registry = {\n    'antv-dagre': AntVDagreLayout,\n    'd3-force-3d': D3Force3DLayout,\n    'd3-force': D3ForceLayout,\n    'force-atlas2': ForceAtlas2Layout,\n    circular: CircularLayout,\n    concentric: ConcentricLayout,\n    dagre: DagreLayout,\n    force: ForceLayout,\n    fruchterman: FruchtermanLayout,\n    grid: GridLayout,\n    mds: MDSLayout,\n    radial: RadialLayout,\n    random: RandomLayout,\n};\n\nexport { registry };\n//# sourceMappingURL=registry.js.map\n"],"names":["registry","AntVDagreLayout","D3Force3DLayout","D3ForceLayout","ForceAtlas2Layout","CircularLayout","ConcentricLayout","DagreLayout","ForceLayout","FruchtermanLayout","GridLayout","MDSLayout","RadialLayout","RandomLayout"],"mappings":";;;;;;;;;;;;;AAcK,MAACA,IAAW;AAAA,EACb,cAAcC;AAAA,EACd,eAAeC;AAAA,EACf,YAAYC;AAAA,EACZ,gBAAgBC;AAAA,EAChB,UAAUC;AAAA,EACV,YAAYC;AAAA,EACZ,OAAOC;AAAA,EACP,OAAOC;AAAA,EACP,aAAaC;AAAA,EACb,MAAMC;AAAA,EACN,KAAKC;AAAA,EACL,QAAQC;AAAA,EACR,QAAQC;AACZ;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/runtime/context.js

@@ -1,27 +0,0 @@
-import { GraphLib as o } from "../model/data.js";
-class s {
-  constructor(r, t = {}) {
-    this.graph = new o(r, t);
-  }
-  export() {
-    return this.graph.data();
-  }
-  replace(r) {
-    this.graph.replace(r);
-  }
-  forEachNode(r) {
-    this.graph.forEachNode(r);
-  }
-  forEachEdge(r) {
-    this.graph.forEachEdge((t, h) => {
-      t.sourceNode = this.graph.node(t.source), t.targetNode = this.graph.node(t.target), r(t, h);
-    });
-  }
-  destroy() {
-    this.graph.destroy();
-  }
-}
-export {
-  s as RuntimeContext
-};
-//# sourceMappingURL=context.js.map

package/dist/node_modules/@antv/layout/lib/runtime/context.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"context.js","sources":["../../../../../../node_modules/@antv/layout/lib/runtime/context.js"],"sourcesContent":["import { GraphLib } from '../model/data.js';\n\nclass RuntimeContext {\n    constructor(data, options = {}) {\n        this.graph = new GraphLib(data, options);\n    }\n    export() {\n        return this.graph.data();\n    }\n    replace(result) {\n        this.graph.replace(result);\n    }\n    forEachNode(callback) {\n        this.graph.forEachNode(callback);\n    }\n    forEachEdge(callback) {\n        this.graph.forEachEdge((edge, i) => {\n            edge.sourceNode = this.graph.node(edge.source);\n            edge.targetNode = this.graph.node(edge.target);\n            callback(edge, i);\n        });\n    }\n    destroy() {\n        this.graph.destroy();\n    }\n}\n\nexport { RuntimeContext };\n//# sourceMappingURL=context.js.map\n"],"names":["RuntimeContext","data","options","GraphLib","result","callback","edge","i"],"mappings":";AAEA,MAAMA,EAAe;AAAA,EACjB,YAAYC,GAAMC,IAAU,IAAI;AAC5B,SAAK,QAAQ,IAAIC,EAASF,GAAMC,CAAO;AAAA,EAC3C;AAAA,EACA,SAAS;AACL,WAAO,KAAK,MAAM,KAAI;AAAA,EAC1B;AAAA,EACA,QAAQE,GAAQ;AACZ,SAAK,MAAM,QAAQA,CAAM;AAAA,EAC7B;AAAA,EACA,YAAYC,GAAU;AAClB,SAAK,MAAM,YAAYA,CAAQ;AAAA,EACnC;AAAA,EACA,YAAYA,GAAU;AAClB,SAAK,MAAM,YAAY,CAACC,GAAMC,MAAM;AAChC,MAAAD,EAAK,aAAa,KAAK,MAAM,KAAKA,EAAK,MAAM,GAC7CA,EAAK,aAAa,KAAK,MAAM,KAAKA,EAAK,MAAM,GAC7CD,EAASC,GAAMC,CAAC;AAAA,IACpB,CAAC;AAAA,EACL;AAAA,EACA,UAAU;AACN,SAAK,MAAM,QAAO;AAAA,EACtB;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/runtime/supervisor.js

@@ -1,69 +0,0 @@
-import { __awaiter as n } from "../node_modules/tslib/tslib.es6.js";
-import { wrap as o } from "../node_modules/comlink/dist/esm/comlink.js";
-class d {
-  constructor() {
-    this.worker = null, this.workerApi = null;
-  }
-  /**
-   * Execute layout in worker
-   */
-  execute(r, e, i) {
-    return n(this, void 0, void 0, function* () {
-      if (this.worker || (yield this.initWorker()), !this.workerApi)
-        throw new Error("Worker API not initialized");
-      return yield this.workerApi.execute(r, e, i);
-    });
-  }
-  /**
-   * Destroy worker
-   */
-  destroy() {
-    this.workerApi && this.workerApi.destroy(), this.worker && (this.worker.terminate(), this.worker = null, this.workerApi = null);
-  }
-  /**
-   * Initialize worker
-   */
-  initWorker() {
-    return n(this, void 0, void 0, function* () {
-      const r = this.resolveWorkerPath(), i = r.includes("/lib/") || r.endsWith(".mjs") ? "module" : "classic";
-      this.worker = new Worker(r, { type: i }), this.workerApi = o(this.worker);
-    });
-  }
-  /**
-   * Resolve worker script path which works in both ESM and UMD environments
-   */
-  resolveWorkerPath() {
-    const r = (() => {
-      if (typeof document > "u")
-        return null;
-      const e = document.currentScript;
-      if (e != null && e.src)
-        return e.src;
-      const i = document.getElementsByTagName("script");
-      for (let t = i.length - 1; t >= 0; t--) {
-        const s = i[t].src;
-        if (s && (s.includes("index.js") || s.includes("index.min.js")))
-          return s;
-      }
-      return null;
-    })();
-    if (r) {
-      if (r.includes("index.js") || r.includes("index.min.js")) {
-        const t = r.replace(/index(\.min)?\.(m?js)(\?.*)?$/, "worker.js");
-        if (t !== r)
-          return t;
-      }
-      const e = r.replace(/\/runtime\/[^/]+\.(m?js)(\?.*)?$/, "/worker.js");
-      if (e !== r)
-        return e;
-      const i = r.replace(/\/[^/]+\.(m?js)(\?.*)?$/, "/worker.js");
-      if (i !== r)
-        return i;
-    }
-    return "./worker.js";
-  }
-}
-export {
-  d as Supervisor
-};
-//# sourceMappingURL=supervisor.js.map

package/dist/node_modules/@antv/layout/lib/runtime/supervisor.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"supervisor.js","sources":["../../../../../../node_modules/@antv/layout/lib/runtime/supervisor.js"],"sourcesContent":["import { __awaiter } from '../node_modules/tslib/tslib.es6.js';\nimport { wrap } from '../node_modules/comlink/dist/esm/comlink.js';\n\nclass Supervisor {\n    constructor() {\n        this.worker = null;\n        this.workerApi = null;\n    }\n    /**\n     * Execute layout in worker\n     */\n    execute(layoutId, data, options) {\n        return __awaiter(this, void 0, void 0, function* () {\n            if (!this.worker) {\n                yield this.initWorker();\n            }\n            if (!this.workerApi) {\n                throw new Error('Worker API not initialized');\n            }\n            return yield this.workerApi.execute(layoutId, data, options);\n        });\n    }\n    /**\n     * Destroy worker\n     */\n    destroy() {\n        if (this.workerApi) {\n            this.workerApi.destroy();\n        }\n        if (this.worker) {\n            this.worker.terminate();\n            this.worker = null;\n            this.workerApi = null;\n        }\n    }\n    /**\n     * Initialize worker\n     */\n    initWorker() {\n        return __awaiter(this, void 0, void 0, function* () {\n            const workerPath = this.resolveWorkerPath();\n            const isESM = workerPath.includes('/lib/') || workerPath.endsWith('.mjs');\n            const type = isESM ? 'module' : 'classic';\n            this.worker = new Worker(workerPath, { type });\n            this.workerApi = wrap(this.worker);\n        });\n    }\n    /**\n     * Resolve worker script path which works in both ESM and UMD environments\n     */\n    resolveWorkerPath() {\n        const scriptUrl = (() => {\n            if (typeof document === 'undefined')\n                return null;\n            const currentScript = document.currentScript;\n            if (currentScript === null || currentScript === void 0 ? void 0 : currentScript.src)\n                return currentScript.src;\n            const scripts = document.getElementsByTagName('script');\n            for (let i = scripts.length - 1; i >= 0; i--) {\n                const src = scripts[i].src;\n                if (!src)\n                    continue;\n                if (src.includes('index.js') || src.includes('index.min.js')) {\n                    return src;\n                }\n            }\n            return null;\n        })();\n        if (scriptUrl) {\n            if (scriptUrl.includes('index.js') || scriptUrl.includes('index.min.js')) {\n                const asIndex = scriptUrl.replace(/index(\\.min)?\\.(m?js)(\\?.*)?$/, 'worker.js');\n                if (asIndex !== scriptUrl)\n                    return asIndex;\n            }\n            // e.g. `.../lib/runtime/supervisor.js` -> `.../lib/worker.js`\n            const asRoot = scriptUrl.replace(/\\/runtime\\/[^/]+\\.(m?js)(\\?.*)?$/, '/worker.js');\n            if (asRoot !== scriptUrl)\n                return asRoot;\n            // Fallback: keep legacy behavior (same directory)\n            const asSibling = scriptUrl.replace(/\\/[^/]+\\.(m?js)(\\?.*)?$/, '/worker.js');\n            if (asSibling !== scriptUrl)\n                return asSibling;\n        }\n        return './worker.js';\n    }\n}\n\nexport { Supervisor };\n//# sourceMappingURL=supervisor.js.map\n"],"names":["Supervisor","layoutId","data","options","__awaiter","workerPath","type","wrap","scriptUrl","currentScript","scripts","i","src","asIndex","asRoot","asSibling"],"mappings":";;AAGA,MAAMA,EAAW;AAAA,EACb,cAAc;AACV,SAAK,SAAS,MACd,KAAK,YAAY;AAAA,EACrB;AAAA;AAAA;AAAA;AAAA,EAIA,QAAQC,GAAUC,GAAMC,GAAS;AAC7B,WAAOC,EAAU,MAAM,QAAQ,QAAQ,aAAa;AAIhD,UAHK,KAAK,WACN,MAAM,KAAK,WAAU,IAErB,CAAC,KAAK;AACN,cAAM,IAAI,MAAM,4BAA4B;AAEhD,aAAO,MAAM,KAAK,UAAU,QAAQH,GAAUC,GAAMC,CAAO;AAAA,IAC/D,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA,EAIA,UAAU;AACN,IAAI,KAAK,aACL,KAAK,UAAU,QAAO,GAEtB,KAAK,WACL,KAAK,OAAO,UAAS,GACrB,KAAK,SAAS,MACd,KAAK,YAAY;AAAA,EAEzB;AAAA;AAAA;AAAA;AAAA,EAIA,aAAa;AACT,WAAOC,EAAU,MAAM,QAAQ,QAAQ,aAAa;AAChD,YAAMC,IAAa,KAAK,kBAAiB,GAEnCC,IADQD,EAAW,SAAS,OAAO,KAAKA,EAAW,SAAS,MAAM,IACnD,WAAW;AAChC,WAAK,SAAS,IAAI,OAAOA,GAAY,EAAE,MAAAC,EAAI,CAAE,GAC7C,KAAK,YAAYC,EAAK,KAAK,MAAM;AAAA,IACrC,CAAC;AAAA,EACL;AAAA;AAAA;AAAA;AAAA,EAIA,oBAAoB;AAChB,UAAMC,KAAa,MAAM;AACrB,UAAI,OAAO,WAAa;AACpB,eAAO;AACX,YAAMC,IAAgB,SAAS;AAC/B,UAAIA,KAAkB,QAA4CA,EAAc;AAC5E,eAAOA,EAAc;AACzB,YAAMC,IAAU,SAAS,qBAAqB,QAAQ;AACtD,eAASC,IAAID,EAAQ,SAAS,GAAGC,KAAK,GAAGA,KAAK;AAC1C,cAAMC,IAAMF,EAAQC,CAAC,EAAE;AACvB,YAAKC,MAEDA,EAAI,SAAS,UAAU,KAAKA,EAAI,SAAS,cAAc;AACvD,iBAAOA;AAAA,MAEf;AACA,aAAO;AAAA,IACX,GAAC;AACD,QAAIJ,GAAW;AACX,UAAIA,EAAU,SAAS,UAAU,KAAKA,EAAU,SAAS,cAAc,GAAG;AACtE,cAAMK,IAAUL,EAAU,QAAQ,iCAAiC,WAAW;AAC9E,YAAIK,MAAYL;AACZ,iBAAOK;AAAA,MACf;AAEA,YAAMC,IAASN,EAAU,QAAQ,oCAAoC,YAAY;AACjF,UAAIM,MAAWN;AACX,eAAOM;AAEX,YAAMC,IAAYP,EAAU,QAAQ,2BAA2B,YAAY;AAC3E,UAAIO,MAAcP;AACd,eAAOO;AAAA,IACf;AACA,WAAO;AAAA,EACX;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/util/common.js

@@ -1,10 +0,0 @@
-function s(i, o, t = 2) {
-  if (i.nodeCount() === 1) {
-    const n = i.firstNode();
-    n.x = o[0], n.y = o[1], t === 3 && (n.z = o[2] || 0);
-  }
-}
-export {
-  s as applySingleNodeLayout
-};
-//# sourceMappingURL=common.js.map

package/dist/node_modules/@antv/layout/lib/util/common.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"common.js","sources":["../../../../../../node_modules/@antv/layout/lib/util/common.js"],"sourcesContent":["/**\n * Return the layout result for a graph with zero or one node.\n * @param graph original graph\n * @param center the layout center\n * @returns layout result\n */\nfunction applySingleNodeLayout(model, center, dimensions = 2) {\n    const n = model.nodeCount();\n    if (n === 1) {\n        const first = model.firstNode();\n        first.x = center[0];\n        first.y = center[1];\n        if (dimensions === 3) {\n            first.z = center[2] || 0;\n        }\n    }\n}\n\nexport { applySingleNodeLayout };\n//# sourceMappingURL=common.js.map\n"],"names":["applySingleNodeLayout","model","center","dimensions","first"],"mappings":"AAMA,SAASA,EAAsBC,GAAOC,GAAQC,IAAa,GAAG;AAE1D,MADUF,EAAM,UAAS,MACf,GAAG;AACT,UAAMG,IAAQH,EAAM,UAAS;AAC7B,IAAAG,EAAM,IAAIF,EAAO,CAAC,GAClBE,EAAM,IAAIF,EAAO,CAAC,GACdC,MAAe,MACfC,EAAM,IAAIF,EAAO,CAAC,KAAK;AAAA,EAE/B;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/util/expr.js

@@ -1,16 +0,0 @@
-import { compile as n, evaluate as u } from "../node_modules/@antv/expr/dist/index.esm.js";
-function f(r, t) {
-  if (typeof r != "string")
-    return;
-  const e = r.trim();
-  if (e)
-    try {
-      return n(e), u(e, t);
-    } catch {
-      return;
-    }
-}
-export {
-  f as evaluateExpression
-};
-//# sourceMappingURL=expr.js.map

package/dist/node_modules/@antv/layout/lib/util/expr.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"expr.js","sources":["../../../../../../node_modules/@antv/layout/lib/util/expr.js"],"sourcesContent":["import { compile as A, evaluate as N } from '../node_modules/@antv/expr/dist/index.esm.js';\n\n/**\n * Evaluate an expression if (and only if) it's a valid string expression.\n * - Returns `undefined` when `expression` is not a string, empty, or invalid.\n *\n * @example\n * evaluateExpression('x + y', { x: 10, y: 20 }) // 30\n */\nfunction evaluateExpression(expression, context) {\n    if (typeof expression !== 'string')\n        return undefined;\n    const source = expression.trim();\n    if (!source)\n        return undefined;\n    try {\n        A(source);\n        return N(source, context);\n    }\n    catch (_a) {\n        return undefined;\n    }\n}\n\nexport { evaluateExpression };\n//# sourceMappingURL=expr.js.map\n"],"names":["evaluateExpression","expression","context","source","A","N"],"mappings":";AASA,SAASA,EAAmBC,GAAYC,GAAS;AAC7C,MAAI,OAAOD,KAAe;AACtB;AACJ,QAAME,IAASF,EAAW,KAAI;AAC9B,MAAKE;AAEL,QAAI;AACA,aAAAC,EAAED,CAAM,GACDE,EAAEF,GAAQD,CAAO;AAAA,IAC5B,QACW;AACP;AAAA,IACJ;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/util/format.js

@@ -1,58 +0,0 @@
-import { evaluateExpression as d } from "./expr.js";
-import { parseSize as c, isSize as A } from "./size.js";
-import p from "../node_modules/@antv/util/esm/lodash/is-nil.js";
-import z from "../node_modules/@antv/util/esm/lodash/is-string.js";
-import f from "../node_modules/@antv/util/esm/lodash/is-number.js";
-import F from "../node_modules/@antv/util/esm/lodash/is-function.js";
-function u(r, n) {
-  if (typeof r == "function")
-    return r;
-  if (typeof r == "string") {
-    const o = r;
-    return (...s) => {
-      const i = {};
-      for (let t = 0; t < n.length; t++)
-        i[n[t]] = s[t];
-      return d(o, i);
-    };
-  }
-  return () => r;
-}
-function k(r, n, o = "node") {
-  if (p(r))
-    return () => n;
-  if (z(r)) {
-    const s = u(r, [o]);
-    return (i) => {
-      const t = s(i);
-      return f(t) ? t : n;
-    };
-  }
-  return F(r) ? r : f(r) ? () => r : () => n;
-}
-function m(r, n = 10, o = "node") {
-  if (p(r))
-    return () => n;
-  if (z(r)) {
-    const s = u(r, [o]);
-    return (i) => {
-      const t = s(i);
-      return A(t) ? t : n;
-    };
-  }
-  return F(r) ? r : f(r) ? () => r : Array.isArray(r) ? () => r : () => n;
-}
-const q = (r, n, o = 10, s = 0) => {
-  const i = m(n, s), t = m(r, o);
-  return (e) => {
-    const [S, g, x] = c(t(e)), [y, b, N] = c(i(e));
-    return [S + y, g + b, x + N];
-  };
-};
-export {
-  u as formatFn,
-  q as formatNodeSizeFn,
-  k as formatNumberFn,
-  m as formatSizeFn
-};
-//# sourceMappingURL=format.js.map

package/dist/node_modules/@antv/layout/lib/util/format.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"format.js","sources":["../../../../../../node_modules/@antv/layout/lib/util/format.js"],"sourcesContent":["import { evaluateExpression } from './expr.js';\nimport { parseSize, isSize } from './size.js';\nimport isNil from '../node_modules/@antv/util/esm/lodash/is-nil.js';\nimport isString from '../node_modules/@antv/util/esm/lodash/is-string.js';\nimport isNumber from '../node_modules/@antv/util/esm/lodash/is-number.js';\nimport isFunction from '../node_modules/@antv/util/esm/lodash/is-function.js';\n\n/**\n * Format a value into a callable function when it is a string expression.\n * - `string` => `(context) => evaluateExpression(string, context)`\n * - `function` => returned as-is\n * - other => returned as-is\n */\nfunction formatFn(value, argNames) {\n    if (typeof value === 'function')\n        return value;\n    if (typeof value === 'string') {\n        const expr = value;\n        return (...argv) => {\n            const ctx = {};\n            for (let i = 0; i < argNames.length; i++) {\n                ctx[argNames[i]] = argv[i];\n            }\n            return evaluateExpression(expr, ctx);\n        };\n    }\n    return () => value;\n}\n/**\n * Format value with multiple types into a function that returns a number\n * @param value The value to be formatted\n * @param defaultValue The default value when value is invalid\n * @returns A function that returns a number\n */\nfunction formatNumberFn(value, defaultValue, type = 'node') {\n    // If value is undefined, return default value function\n    if (isNil(value)) {\n        return () => defaultValue;\n    }\n    // If value is an expression, return a function that evaluates the expression\n    if (isString(value)) {\n        const numberFn = formatFn(value, [type]);\n        return (d) => {\n            const evaluated = numberFn(d);\n            if (isNumber(evaluated))\n                return evaluated;\n            return defaultValue;\n        };\n    }\n    // If value is a function, return it directly\n    if (isFunction(value)) {\n        return value;\n    }\n    // If value is a number, return a function that returns this number\n    if (isNumber(value)) {\n        return () => value;\n    }\n    // For other cases (undefined or invalid values), return default value function\n    return () => defaultValue;\n}\n/**\n * Format size config with multiple types into a function that returns a size\n * @param value The value to be formatted\n * @param defaultValue The default value when value is invalid\n * @param resultIsNumber Whether to return a number (max of width/height) or size array\n * @returns A function that returns a size\n */\nfunction formatSizeFn(value, defaultValue = 10, type = 'node') {\n    // If value is undefined, return default value function\n    if (isNil(value)) {\n        return () => defaultValue;\n    }\n    // If value is an expression, return a function that evaluates the expression\n    if (isString(value)) {\n        const sizeFn = formatFn(value, [type]);\n        return (d) => {\n            const evaluated = sizeFn(d);\n            if (isSize(evaluated))\n                return evaluated;\n            return defaultValue;\n        };\n    }\n    // If value is a function, return it directly\n    if (isFunction(value)) {\n        return value;\n    }\n    // If value is a number, return a function that returns this number\n    if (isNumber(value)) {\n        return () => value;\n    }\n    // If value is an array, return max or the array itself\n    if (Array.isArray(value)) {\n        return () => value;\n    }\n    return () => defaultValue;\n}\n/**\n * Format nodeSize and nodeSpacing into a function that returns the total size\n * @param nodeSize The size of the node\n * @param nodeSpacing The spacing around the node\n * @param defaultNodeSize The default node size when value is invalid\n * @param defaultNodeSpacing The default node spacing when value is invalid\n * @returns A function that returns the total size (node size + spacing)\n */\nconst formatNodeSizeFn = (nodeSize, nodeSpacing, defaultNodeSize = 10, defaultNodeSpacing = 0) => {\n    const nodeSpacingFunc = formatSizeFn(nodeSpacing, defaultNodeSpacing);\n    const nodeSizeFunc = formatSizeFn(nodeSize, defaultNodeSize);\n    return (d) => {\n        const [sizeW, sizeH, sizeD] = parseSize(nodeSizeFunc(d));\n        const [spacingW, spacingH, spacingD] = parseSize(nodeSpacingFunc(d));\n        return [sizeW + spacingW, sizeH + spacingH, sizeD + spacingD];\n    };\n};\n\nexport { formatFn, formatNodeSizeFn, formatNumberFn, formatSizeFn };\n//# sourceMappingURL=format.js.map\n"],"names":["formatFn","value","argNames","expr","argv","ctx","i","evaluateExpression","formatNumberFn","defaultValue","type","isNil","isString","numberFn","d","evaluated","isNumber","isFunction","formatSizeFn","sizeFn","isSize","formatNodeSizeFn","nodeSize","nodeSpacing","defaultNodeSize","defaultNodeSpacing","nodeSpacingFunc","nodeSizeFunc","sizeW","sizeH","sizeD","parseSize","spacingW","spacingH","spacingD"],"mappings":";;;;;;AAaA,SAASA,EAASC,GAAOC,GAAU;AAC/B,MAAI,OAAOD,KAAU;AACjB,WAAOA;AACX,MAAI,OAAOA,KAAU,UAAU;AAC3B,UAAME,IAAOF;AACb,WAAO,IAAIG,MAAS;AAChB,YAAMC,IAAM,CAAA;AACZ,eAASC,IAAI,GAAGA,IAAIJ,EAAS,QAAQI;AACjC,QAAAD,EAAIH,EAASI,CAAC,CAAC,IAAIF,EAAKE,CAAC;AAE7B,aAAOC,EAAmBJ,GAAME,CAAG;AAAA,IACvC;AAAA,EACJ;AACA,SAAO,MAAMJ;AACjB;AAOA,SAASO,EAAeP,GAAOQ,GAAcC,IAAO,QAAQ;AAExD,MAAIC,EAAMV,CAAK;AACX,WAAO,MAAMQ;AAGjB,MAAIG,EAASX,CAAK,GAAG;AACjB,UAAMY,IAAWb,EAASC,GAAO,CAACS,CAAI,CAAC;AACvC,WAAO,CAACI,MAAM;AACV,YAAMC,IAAYF,EAASC,CAAC;AAC5B,aAAIE,EAASD,CAAS,IACXA,IACJN;AAAA,IACX;AAAA,EACJ;AAEA,SAAIQ,EAAWhB,CAAK,IACTA,IAGPe,EAASf,CAAK,IACP,MAAMA,IAGV,MAAMQ;AACjB;AAQA,SAASS,EAAajB,GAAOQ,IAAe,IAAIC,IAAO,QAAQ;AAE3D,MAAIC,EAAMV,CAAK;AACX,WAAO,MAAMQ;AAGjB,MAAIG,EAASX,CAAK,GAAG;AACjB,UAAMkB,IAASnB,EAASC,GAAO,CAACS,CAAI,CAAC;AACrC,WAAO,CAACI,MAAM;AACV,YAAMC,IAAYI,EAAOL,CAAC;AAC1B,aAAIM,EAAOL,CAAS,IACTA,IACJN;AAAA,IACX;AAAA,EACJ;AAEA,SAAIQ,EAAWhB,CAAK,IACTA,IAGPe,EAASf,CAAK,IACP,MAAMA,IAGb,MAAM,QAAQA,CAAK,IACZ,MAAMA,IAEV,MAAMQ;AACjB;AASK,MAACY,IAAmB,CAACC,GAAUC,GAAaC,IAAkB,IAAIC,IAAqB,MAAM;AAC9F,QAAMC,IAAkBR,EAAaK,GAAaE,CAAkB,GAC9DE,IAAeT,EAAaI,GAAUE,CAAe;AAC3D,SAAO,CAACV,MAAM;AACV,UAAM,CAACc,GAAOC,GAAOC,CAAK,IAAIC,EAAUJ,EAAab,CAAC,CAAC,GACjD,CAACkB,GAAUC,GAAUC,CAAQ,IAAIH,EAAUL,EAAgBZ,CAAC,CAAC;AACnE,WAAO,CAACc,IAAQI,GAAUH,IAAQI,GAAUH,IAAQI,CAAQ;AAAA,EAChE;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/util/math.js

@@ -1,83 +0,0 @@
-const f = (i, t) => {
-  const n = i.nodeCount(), e = Array.from({ length: n }, () => []), s = {};
-  let a = 0;
-  return i.forEachNode((r) => {
-    s[r.id] = a++;
-  }), i.forEachEdge((r) => {
-    const c = s[r.source], o = s[r.target];
-    c == null || o == null || (e[c].push(o), e[o].push(c));
-  }), e;
-}, g = (i, t) => {
-  const n = i.length, e = new Array(n);
-  for (let s = 0; s < n; s++) {
-    const a = i[s], r = a.length, c = new Array(r);
-    for (let o = 0; o < r; o++)
-      c[o] = a[o] * t;
-    e[s] = c;
-  }
-  return e;
-};
-function b(i) {
-  const t = i.length;
-  new Array(t).fill(0);
-  const n = Array.from({ length: t }, () => new Array(t).fill(1 / 0));
-  for (let e = 0; e < t; e++)
-    n[e] = u(i, e);
-  return n;
-}
-function u(i, t) {
-  const n = i.length, e = new Array(n).fill(1 / 0);
-  e[t] = 0;
-  const s = new d();
-  for (s.push([0, t]); !s.empty(); ) {
-    const [a, r] = s.pop();
-    if (a !== e[r])
-      continue;
-    const c = i[r];
-    for (let o = 0; o < c.length; o++) {
-      const h = c[o], l = a + 1;
-      l < e[h] && (e[h] = l, s.push([l, h]));
-    }
-  }
-  return e;
-}
-class d {
-  constructor() {
-    this.data = [];
-  }
-  push(t) {
-    this.data.push(t), this.bubbleUp(this.data.length - 1);
-  }
-  pop() {
-    const t = this.data[0], n = this.data.pop();
-    return this.data.length > 0 && (this.data[0] = n, this.bubbleDown(0)), t;
-  }
-  empty() {
-    return this.data.length === 0;
-  }
-  bubbleUp(t) {
-    const n = this.data;
-    for (; t > 0; ) {
-      const e = t - 1 >> 1;
-      if (n[e][0] <= n[t][0])
-        break;
-      [n[e], n[t]] = [n[t], n[e]], t = e;
-    }
-  }
-  bubbleDown(t) {
-    const n = this.data, e = n.length;
-    for (; ; ) {
-      const s = t * 2 + 1, a = t * 2 + 2;
-      let r = t;
-      if (s < e && n[s][0] < n[r][0] && (r = s), a < e && n[a][0] < n[r][0] && (r = a), r === t)
-        break;
-      [n[t], n[r]] = [n[r], n[t]], t = r;
-    }
-  }
-}
-export {
-  f as getAdjList,
-  b as johnson,
-  g as scaleMatrix
-};
-//# sourceMappingURL=math.js.map

package/dist/node_modules/@antv/layout/lib/util/math.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"math.js","sources":["../../../../../../node_modules/@antv/layout/lib/util/math.js"],"sourcesContent":["import { isArray } from './array.js';\nimport isNumber from '../node_modules/@antv/util/esm/lodash/is-number.js';\n\n/**\n * Floyd-Warshall algorithm to find shortest paths (but with no negative cycles).\n */\nconst floydWarshall = (adjMatrix) => {\n    // initialize\n    const n = adjMatrix.length;\n    const dist = Array.from({ length: n }, () => new Array(n));\n    for (let i = 0; i < n; i++) {\n        const row = adjMatrix[i];\n        const drow = dist[i];\n        for (let j = 0; j < n; j++) {\n            drow[j] = i === j ? 0 : row[j] > 0 ? row[j] : Infinity;\n        }\n    }\n    // floyd\n    for (let k = 0; k < n; k++) {\n        const dk = dist[k];\n        for (let i = 0; i < n; i++) {\n            const di = dist[i];\n            const dik = di[k];\n            if (dik === Infinity)\n                continue;\n            for (let j = 0; j < n; j++) {\n                const dkj = dk[j];\n                if (dkj === Infinity)\n                    continue;\n                const next = dik + dkj;\n                if (next < di[j]) {\n                    di[j] = next;\n                }\n            }\n        }\n    }\n    return dist;\n};\n/**\n * Get the adjacency matrix of the graph model.\n */\nconst getAdjMatrix = (model, directed) => {\n    const n = model.nodeCount();\n    const matrix = Array.from({ length: n }, () => new Array(n));\n    // map node with index in data.nodes\n    const nodeMap = {};\n    let i = 0;\n    model.forEachNode((node) => {\n        nodeMap[node.id] = i++;\n    });\n    model.forEachEdge((e) => {\n        const sIndex = nodeMap[e.source];\n        const tIndex = nodeMap[e.target];\n        if (sIndex === undefined || tIndex === undefined)\n            return;\n        matrix[sIndex][tIndex] = 1;\n        if (!directed) {\n            matrix[tIndex][sIndex] = 1;\n        }\n    });\n    return matrix;\n};\n/**\n * Get the adjacency list of the graph model.\n */\nconst getAdjList = (model, directed) => {\n    const n = model.nodeCount();\n    const adjList = Array.from({ length: n }, () => []);\n    // map node with index\n    const nodeMap = {};\n    let idx = 0;\n    model.forEachNode((node) => {\n        nodeMap[node.id] = idx++;\n    });\n    model.forEachEdge((e) => {\n        const s = nodeMap[e.source];\n        const t = nodeMap[e.target];\n        if (s == null || t == null)\n            return;\n        adjList[s].push(t);\n        if (!directed)\n            adjList[t].push(s);\n    });\n    return adjList;\n};\n/**\n * scale matrix\n * @param matrix [ [], [], [] ]\n * @param ratio\n */\nconst scaleMatrix = (matrix, ratio) => {\n    const n = matrix.length;\n    const result = new Array(n);\n    for (let i = 0; i < n; i++) {\n        const row = matrix[i];\n        const m = row.length;\n        const newRow = new Array(m);\n        for (let j = 0; j < m; j++) {\n            newRow[j] = row[j] * ratio;\n        }\n        result[i] = newRow;\n    }\n    return result;\n};\n/**\n * calculate the bounding box for the nodes according to their x, y, and size\n * @param nodes nodes in the layout\n * @returns\n */\nconst getLayoutBBox = (nodes) => {\n    let minX = Infinity;\n    let minY = Infinity;\n    let maxX = -Infinity;\n    let maxY = -Infinity;\n    nodes.forEach((node) => {\n        let size = node.data.size;\n        if (isArray(size)) {\n            if (size.length === 1)\n                size = [size[0], size[0]];\n        }\n        else if (size === undefined || isNaN(size)) {\n            size = [30, 30];\n        }\n        else if (isNumber(size)) {\n            size = [size, size];\n        }\n        const halfSize = [size[0] / 2, size[1] / 2];\n        const left = node.data.x - halfSize[0];\n        const right = node.data.x + halfSize[0];\n        const top = node.data.y - halfSize[1];\n        const bottom = node.data.y + halfSize[1];\n        if (minX > left)\n            minX = left;\n        if (minY > top)\n            minY = top;\n        if (maxX < right)\n            maxX = right;\n        if (maxY < bottom)\n            maxY = bottom;\n    });\n    return { minX, minY, maxX, maxY };\n};\n/**\n * calculate the euclidean distance form p1 to p2\n * @param p1\n * @param p2\n * @returns\n */\nconst getEuclideanDistance = (p1, p2) => Math.sqrt((p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y));\n/**\n * Depth first search begin from nodes in graphCore data.\n * @param graphCore graphlib data structure\n * @param nodes begin nodes\n * @param fn will be called while visiting each node\n * @param mode 'TB' - visit from top to bottom; 'BT' - visit from bottom to top;\n * @returns\n */\nconst graphTreeDfs = (graph, nodes, fn, mode = 'TB', treeKey, stopFns = {}) => {\n    if (!(nodes === null || nodes === void 0 ? void 0 : nodes.length))\n        return;\n    const { stopBranchFn, stopAllFn } = stopFns;\n    for (let i = 0; i < nodes.length; i++) {\n        const node = nodes[i];\n        if (!graph.hasNode(node.id))\n            continue;\n        if (stopBranchFn === null || stopBranchFn === void 0 ? void 0 : stopBranchFn(node))\n            continue; // Stop this branch\n        if (stopAllFn === null || stopAllFn === void 0 ? void 0 : stopAllFn(node))\n            return; // Stop all\n        if (mode === 'TB')\n            fn(node); // Traverse from top to bottom\n        graphTreeDfs(graph, graph.getChildren(node.id, treeKey), fn, mode, treeKey, stopFns);\n        if (mode !== 'TB')\n            fn(node); // Traverse from bottom to top\n    }\n};\n/**\n * Use Johnson + Dijkstra to compute APSP for sparse graph.\n * Fully compatible with floydWarshall(adjMatrix).\n */\nfunction johnson(adjList) {\n    const n = adjList.length;\n    // Step 1: add a dummy node q connected to all nodes with weight 0\n    new Array(n).fill(0);\n    // Bellman-Ford to compute potentials h(v)\n    // 因为权重全是 1，无负边，可直接跳过 BF，h 全 0 即可\n    // Step 2: reweight edges\n    // 因为 h(u)=h(v)=0，reweight 后仍然是 1，省略 reweight 过程\n    // Step 3: run Dijkstra from each node\n    const distAll = Array.from({ length: n }, () => new Array(n).fill(Infinity));\n    for (let s = 0; s < n; s++) {\n        distAll[s] = dijkstra(adjList, s);\n    }\n    return distAll;\n}\n/**\n * Dijkstra algorithm to find shortest paths from source to all nodes.\n */\nfunction dijkstra(adjList, source) {\n    const n = adjList.length;\n    const dist = new Array(n).fill(Infinity);\n    dist[source] = 0;\n    // Minimal binary heap\n    const heap = new MinHeap();\n    heap.push([0, source]); // [distance, node]\n    while (!heap.empty()) {\n        const [d, u] = heap.pop();\n        if (d !== dist[u])\n            continue;\n        const neighbors = adjList[u];\n        for (let i = 0; i < neighbors.length; i++) {\n            const v = neighbors[i];\n            const nd = d + 1;\n            if (nd < dist[v]) {\n                dist[v] = nd;\n                heap.push([nd, v]);\n            }\n        }\n    }\n    return dist;\n}\nclass MinHeap {\n    constructor() {\n        this.data = [];\n    }\n    push(item) {\n        this.data.push(item);\n        this.bubbleUp(this.data.length - 1);\n    }\n    pop() {\n        const top = this.data[0];\n        const end = this.data.pop();\n        if (this.data.length > 0) {\n            this.data[0] = end;\n            this.bubbleDown(0);\n        }\n        return top;\n    }\n    empty() {\n        return this.data.length === 0;\n    }\n    bubbleUp(pos) {\n        const data = this.data;\n        while (pos > 0) {\n            const parent = (pos - 1) >> 1;\n            if (data[parent][0] <= data[pos][0])\n                break;\n            [data[parent], data[pos]] = [data[pos], data[parent]];\n            pos = parent;\n        }\n    }\n    bubbleDown(pos) {\n        const data = this.data;\n        const length = data.length;\n        while (true) {\n            const left = pos * 2 + 1;\n            const right = pos * 2 + 2;\n            let min = pos;\n            if (left < length && data[left][0] < data[min][0])\n                min = left;\n            if (right < length && data[right][0] < data[min][0])\n                min = right;\n            if (min === pos)\n                break;\n            [data[pos], data[min]] = [data[min], data[pos]];\n            pos = min;\n        }\n    }\n}\n\nexport { floydWarshall, getAdjList, getAdjMatrix, getEuclideanDistance, getLayoutBBox, graphTreeDfs, johnson, scaleMatrix };\n//# sourceMappingURL=math.js.map\n"],"names":["getAdjList","model","directed","adjList","nodeMap","idx","node","e","s","t","scaleMatrix","matrix","ratio","result","i","row","m","newRow","j","johnson","n","distAll","dijkstra","source","dist","heap","MinHeap","d","u","neighbors","v","nd","item","top","end","pos","data","parent","length","left","right","min"],"mappings":"AAiEK,MAACA,IAAa,CAACC,GAAOC,MAAa;AACpC,QAAM,IAAID,EAAM,UAAS,GACnBE,IAAU,MAAM,KAAK,EAAE,QAAQ,EAAC,GAAI,MAAM,EAAE,GAE5CC,IAAU,CAAA;AAChB,MAAIC,IAAM;AACV,SAAAJ,EAAM,YAAY,CAACK,MAAS;AACxB,IAAAF,EAAQE,EAAK,EAAE,IAAID;AAAA,EACvB,CAAC,GACDJ,EAAM,YAAY,CAACM,MAAM;AACrB,UAAMC,IAAIJ,EAAQG,EAAE,MAAM,GACpBE,IAAIL,EAAQG,EAAE,MAAM;AAC1B,IAAIC,KAAK,QAAQC,KAAK,SAEtBN,EAAQK,CAAC,EAAE,KAAKC,CAAC,GAEbN,EAAQM,CAAC,EAAE,KAAKD,CAAC;AAAA,EACzB,CAAC,GACML;AACX,GAMMO,IAAc,CAACC,GAAQC,MAAU;AACnC,QAAM,IAAID,EAAO,QACXE,IAAS,IAAI,MAAM,CAAC;AAC1B,WAASC,IAAI,GAAGA,IAAI,GAAGA,KAAK;AACxB,UAAMC,IAAMJ,EAAOG,CAAC,GACdE,IAAID,EAAI,QACRE,IAAS,IAAI,MAAMD,CAAC;AAC1B,aAASE,IAAI,GAAGA,IAAIF,GAAGE;AACnB,MAAAD,EAAOC,CAAC,IAAIH,EAAIG,CAAC,IAAIN;AAEzB,IAAAC,EAAOC,CAAC,IAAIG;AAAA,EAChB;AACA,SAAOJ;AACX;AA6EA,SAASM,EAAQhB,GAAS;AACtB,QAAMiB,IAAIjB,EAAQ;AAElB,MAAI,MAAMiB,CAAC,EAAE,KAAK,CAAC;AAMnB,QAAMC,IAAU,MAAM,KAAK,EAAE,QAAQD,EAAC,GAAI,MAAM,IAAI,MAAMA,CAAC,EAAE,KAAK,KAAQ,CAAC;AAC3E,WAASZ,IAAI,GAAGA,IAAIY,GAAGZ;AACnB,IAAAa,EAAQb,CAAC,IAAIc,EAASnB,GAASK,CAAC;AAEpC,SAAOa;AACX;AAIA,SAASC,EAASnB,GAASoB,GAAQ;AAC/B,QAAM,IAAIpB,EAAQ,QACZqB,IAAO,IAAI,MAAM,CAAC,EAAE,KAAK,KAAQ;AACvC,EAAAA,EAAKD,CAAM,IAAI;AAEf,QAAME,IAAO,IAAIC,EAAO;AAExB,OADAD,EAAK,KAAK,CAAC,GAAGF,CAAM,CAAC,GACd,CAACE,EAAK,WAAS;AAClB,UAAM,CAACE,GAAGC,CAAC,IAAIH,EAAK,IAAG;AACvB,QAAIE,MAAMH,EAAKI,CAAC;AACZ;AACJ,UAAMC,IAAY1B,EAAQyB,CAAC;AAC3B,aAASd,IAAI,GAAGA,IAAIe,EAAU,QAAQf,KAAK;AACvC,YAAMgB,IAAID,EAAUf,CAAC,GACfiB,IAAKJ,IAAI;AACf,MAAII,IAAKP,EAAKM,CAAC,MACXN,EAAKM,CAAC,IAAIC,GACVN,EAAK,KAAK,CAACM,GAAID,CAAC,CAAC;AAAA,IAEzB;AAAA,EACJ;AACA,SAAON;AACX;AACA,MAAME,EAAQ;AAAA,EACV,cAAc;AACV,SAAK,OAAO,CAAA;AAAA,EAChB;AAAA,EACA,KAAKM,GAAM;AACP,SAAK,KAAK,KAAKA,CAAI,GACnB,KAAK,SAAS,KAAK,KAAK,SAAS,CAAC;AAAA,EACtC;AAAA,EACA,MAAM;AACF,UAAMC,IAAM,KAAK,KAAK,CAAC,GACjBC,IAAM,KAAK,KAAK,IAAG;AACzB,WAAI,KAAK,KAAK,SAAS,MACnB,KAAK,KAAK,CAAC,IAAIA,GACf,KAAK,WAAW,CAAC,IAEdD;AAAA,EACX;AAAA,EACA,QAAQ;AACJ,WAAO,KAAK,KAAK,WAAW;AAAA,EAChC;AAAA,EACA,SAASE,GAAK;AACV,UAAMC,IAAO,KAAK;AAClB,WAAOD,IAAM,KAAG;AACZ,YAAME,IAAUF,IAAM,KAAM;AAC5B,UAAIC,EAAKC,CAAM,EAAE,CAAC,KAAKD,EAAKD,CAAG,EAAE,CAAC;AAC9B;AACJ,OAACC,EAAKC,CAAM,GAAGD,EAAKD,CAAG,CAAC,IAAI,CAACC,EAAKD,CAAG,GAAGC,EAAKC,CAAM,CAAC,GACpDF,IAAME;AAAA,IACV;AAAA,EACJ;AAAA,EACA,WAAWF,GAAK;AACZ,UAAMC,IAAO,KAAK,MACZE,IAASF,EAAK;AACpB,eAAa;AACT,YAAMG,IAAOJ,IAAM,IAAI,GACjBK,IAAQL,IAAM,IAAI;AACxB,UAAIM,IAAMN;AAKV,UAJII,IAAOD,KAAUF,EAAKG,CAAI,EAAE,CAAC,IAAIH,EAAKK,CAAG,EAAE,CAAC,MAC5CA,IAAMF,IACNC,IAAQF,KAAUF,EAAKI,CAAK,EAAE,CAAC,IAAIJ,EAAKK,CAAG,EAAE,CAAC,MAC9CA,IAAMD,IACNC,MAAQN;AACR;AACJ,OAACC,EAAKD,CAAG,GAAGC,EAAKK,CAAG,CAAC,IAAI,CAACL,EAAKK,CAAG,GAAGL,EAAKD,CAAG,CAAC,GAC9CA,IAAMM;AAAA,IACV;AAAA,EACJ;AACJ;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/util/object.js

@@ -1,12 +0,0 @@
-function c(f, ...a) {
-  return a.forEach((n) => {
-    n && Object.keys(n).forEach((i) => {
-      const e = n[i];
-      e !== void 0 && (f[i] = e);
-    });
-  }), f;
-}
-export {
-  c as assignDefined
-};
-//# sourceMappingURL=object.js.map

package/dist/node_modules/@antv/layout/lib/util/object.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"object.js","sources":["../../../../../../node_modules/@antv/layout/lib/util/object.js"],"sourcesContent":["import get from '../node_modules/@antv/util/esm/lodash/get.js';\nimport set from '../node_modules/@antv/util/esm/lodash/set.js';\n\n/**\n * Get nested property value\n * For example: getNestedValue(obj, 'a.b.c') will return obj.a.b.c\n */\nfunction getNestedValue(obj, path) {\n    const keys = String(path).split('.');\n    return get(obj, keys);\n}\n/**\n * Set nested property value\n * For example: setNestedValue(obj, 'a.b.c', value) will set obj.a.b.c = value\n */\nfunction setNestedValue(obj, path, value) {\n    const keys = String(path).split('.');\n    set(obj, keys, value);\n}\n/**\n * Merge objects, but undefined values in source objects will not override existing values\n * @param target - The target object\n * @param sources - Source objects to merge\n * @returns A new merged object\n *\n * @example\n * assignDefined({ a: 1, b: 2 }, { b: undefined, c: 3 })\n * // Returns: { a: 1, b: 2, c: 3 }\n */\nfunction assignDefined(target, ...sources) {\n    sources.forEach((source) => {\n        if (source) {\n            Object.keys(source).forEach((key) => {\n                const value = source[key];\n                if (value !== undefined) {\n                    target[key] = value;\n                }\n            });\n        }\n    });\n    return target;\n}\n\nexport { assignDefined, getNestedValue, setNestedValue };\n//# sourceMappingURL=object.js.map\n"],"names":["assignDefined","target","sources","source","key","value"],"mappings":"AA6BA,SAASA,EAAcC,MAAWC,GAAS;AACvC,SAAAA,EAAQ,QAAQ,CAACC,MAAW;AACxB,IAAIA,KACA,OAAO,KAAKA,CAAM,EAAE,QAAQ,CAACC,MAAQ;AACjC,YAAMC,IAAQF,EAAOC,CAAG;AACxB,MAAIC,MAAU,WACVJ,EAAOG,CAAG,IAAIC;AAAA,IAEtB,CAAC;AAAA,EAET,CAAC,GACMJ;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/util/order.js

@@ -1,59 +0,0 @@
-function a(e, s) {
-  const n = e.nodes();
-  return n.sort(s), e.setNodeOrder(n), e;
-}
-function C(e, s = "desc") {
-  return a(e, (n, r) => {
-    const t = e.degree(n.id), i = e.degree(r.id);
-    return s === "asc" ? t - i : i - t;
-  });
-}
-function D(e) {
-  return a(e, (s, n) => {
-    const r = s.id, t = n.id;
-    return typeof r == "number" && typeof t == "number" ? r - t : String(r).localeCompare(String(t));
-  });
-}
-function I(e, s) {
-  return a(e, (n, r) => {
-    const t = e.originalNode(n.id), i = e.originalNode(r.id);
-    return s(t, i);
-  });
-}
-function S(e, s = !1) {
-  const n = e.nodeCount();
-  if (n === 0)
-    return e;
-  const r = e.nodes(), t = [r[0]], i = {};
-  i[r[0].id] = !0;
-  let b = 0, c = 0;
-  return e.forEachNode((o) => {
-    if (c !== 0) {
-      const y = e.degree(o.id, "both"), B = c < n - 1 ? e.degree(r[c + 1].id, "both") : 0, g = t[b].id, k = e.neighbors(g, "both").includes(o.id);
-      if ((c === n - 1 || y !== B || k) && !i[o.id])
-        t.push(o), i[o.id] = !0, b++;
-      else {
-        const p = s ? e.successors(g) : e.neighbors(g);
-        let f = !1;
-        for (let h = 0; h < p.length; h++) {
-          const u = p[h], N = e.node(u);
-          if (N && e.degree(u) === e.degree(o.id) && !i[u]) {
-            t.push(N), i[u] = !0, f = !0;
-            break;
-          }
-        }
-        let d = 0;
-        for (; !f && (i[r[d].id] || (t.push(r[d]), i[r[d].id] = !0, f = !0), d++, d !== n); )
-          ;
-      }
-    }
-    c++;
-  }), e.setNodeOrder(t), e;
-}
-export {
-  C as orderByDegree,
-  D as orderById,
-  I as orderBySorter,
-  S as orderByTopology
-};
-//# sourceMappingURL=order.js.map

package/dist/node_modules/@antv/layout/lib/util/order.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"order.js","sources":["../../../../../../node_modules/@antv/layout/lib/util/order.js"],"sourcesContent":["/**\n * 通用排序核心函数\n */\nfunction sort$1(model, compareFn) {\n    const nodes = model.nodes();\n    nodes.sort(compareFn);\n    model.setNodeOrder(nodes);\n    return model;\n}\nfunction orderByDegree(model, order = 'desc') {\n    return sort$1(model, (nodeA, nodeB) => {\n        const degreeA = model.degree(nodeA.id);\n        const degreeB = model.degree(nodeB.id);\n        if (order === 'asc') {\n            return degreeA - degreeB; // ascending order\n        }\n        return degreeB - degreeA; // descending order\n    });\n}\n/**\n * 按 ID 排序\n */\nfunction orderById(model) {\n    return sort$1(model, (nodeA, nodeB) => {\n        const idA = nodeA.id;\n        const idB = nodeB.id;\n        if (typeof idA === 'number' && typeof idB === 'number') {\n            return idA - idB;\n        }\n        return String(idA).localeCompare(String(idB));\n    });\n}\n/**\n * 按自定义比较函数排序\n */\nfunction orderBySorter(model, sorter) {\n    return sort$1(model, (nodeA, nodeB) => {\n        const a = model.originalNode(nodeA.id);\n        const b = model.originalNode(nodeB.id);\n        return sorter(a, b);\n    });\n}\n/**\n * Order nodes according to graph topology\n */\nfunction orderByTopology(model, directed = false) {\n    const n = model.nodeCount();\n    if (n === 0)\n        return model;\n    const nodes = model.nodes();\n    const orderedNodes = [nodes[0]];\n    const pickFlags = {};\n    pickFlags[nodes[0].id] = true;\n    let k = 0;\n    let i = 0;\n    model.forEachNode((node) => {\n        if (i !== 0) {\n            const currentDegree = model.degree(node.id, 'both');\n            const nextDegree = i < n - 1 ? model.degree(nodes[i + 1].id, 'both') : 0;\n            const currentNodeId = orderedNodes[k].id;\n            const isNeighbor = model\n                .neighbors(currentNodeId, 'both')\n                .includes(node.id);\n            if ((i === n - 1 || currentDegree !== nextDegree || isNeighbor) &&\n                !pickFlags[node.id]) {\n                orderedNodes.push(node);\n                pickFlags[node.id] = true;\n                k++;\n            }\n            else {\n                const children = directed\n                    ? model.successors(currentNodeId)\n                    : model.neighbors(currentNodeId);\n                let foundChild = false;\n                for (let j = 0; j < children.length; j++) {\n                    const childId = children[j];\n                    const child = model.node(childId);\n                    if (child &&\n                        model.degree(childId) === model.degree(node.id) &&\n                        !pickFlags[childId]) {\n                        orderedNodes.push(child);\n                        pickFlags[childId] = true;\n                        foundChild = true;\n                        break;\n                    }\n                }\n                let ii = 0;\n                while (!foundChild) {\n                    if (!pickFlags[nodes[ii].id]) {\n                        orderedNodes.push(nodes[ii]);\n                        pickFlags[nodes[ii].id] = true;\n                        foundChild = true;\n                    }\n                    ii++;\n                    if (ii === n) {\n                        break;\n                    }\n                }\n            }\n        }\n        i++;\n    });\n    // Update model with ordered nodes\n    model.setNodeOrder(orderedNodes);\n    return model;\n}\n\nexport { orderByDegree, orderById, orderBySorter, orderByTopology };\n//# sourceMappingURL=order.js.map\n"],"names":["sort$1","model","compareFn","nodes","orderByDegree","order","nodeA","nodeB","degreeA","degreeB","orderById","idA","idB","orderBySorter","sorter","a","b","orderByTopology","directed","orderedNodes","pickFlags","k","i","node","currentDegree","nextDegree","currentNodeId","isNeighbor","children","foundChild","j","childId","child","ii"],"mappings":"AAGA,SAASA,EAAOC,GAAOC,GAAW;AAC9B,QAAMC,IAAQF,EAAM,MAAK;AACzB,SAAAE,EAAM,KAAKD,CAAS,GACpBD,EAAM,aAAaE,CAAK,GACjBF;AACX;AACA,SAASG,EAAcH,GAAOI,IAAQ,QAAQ;AAC1C,SAAOL,EAAOC,GAAO,CAACK,GAAOC,MAAU;AACnC,UAAMC,IAAUP,EAAM,OAAOK,EAAM,EAAE,GAC/BG,IAAUR,EAAM,OAAOM,EAAM,EAAE;AACrC,WAAIF,MAAU,QACHG,IAAUC,IAEdA,IAAUD;AAAA,EACrB,CAAC;AACL;AAIA,SAASE,EAAUT,GAAO;AACtB,SAAOD,EAAOC,GAAO,CAACK,GAAOC,MAAU;AACnC,UAAMI,IAAML,EAAM,IACZM,IAAML,EAAM;AAClB,WAAI,OAAOI,KAAQ,YAAY,OAAOC,KAAQ,WACnCD,IAAMC,IAEV,OAAOD,CAAG,EAAE,cAAc,OAAOC,CAAG,CAAC;AAAA,EAChD,CAAC;AACL;AAIA,SAASC,EAAcZ,GAAOa,GAAQ;AAClC,SAAOd,EAAOC,GAAO,CAACK,GAAOC,MAAU;AACnC,UAAMQ,IAAId,EAAM,aAAaK,EAAM,EAAE,GAC/BU,IAAIf,EAAM,aAAaM,EAAM,EAAE;AACrC,WAAOO,EAAOC,GAAGC,CAAC;AAAA,EACtB,CAAC;AACL;AAIA,SAASC,EAAgBhB,GAAOiB,IAAW,IAAO;AAC9C,QAAM,IAAIjB,EAAM,UAAS;AACzB,MAAI,MAAM;AACN,WAAOA;AACX,QAAME,IAAQF,EAAM,MAAK,GACnBkB,IAAe,CAAChB,EAAM,CAAC,CAAC,GACxBiB,IAAY,CAAA;AAClB,EAAAA,EAAUjB,EAAM,CAAC,EAAE,EAAE,IAAI;AACzB,MAAIkB,IAAI,GACJC,IAAI;AACR,SAAArB,EAAM,YAAY,CAACsB,MAAS;AACxB,QAAID,MAAM,GAAG;AACT,YAAME,IAAgBvB,EAAM,OAAOsB,EAAK,IAAI,MAAM,GAC5CE,IAAaH,IAAI,IAAI,IAAIrB,EAAM,OAAOE,EAAMmB,IAAI,CAAC,EAAE,IAAI,MAAM,IAAI,GACjEI,IAAgBP,EAAaE,CAAC,EAAE,IAChCM,IAAa1B,EACd,UAAUyB,GAAe,MAAM,EAC/B,SAASH,EAAK,EAAE;AACrB,WAAKD,MAAM,IAAI,KAAKE,MAAkBC,KAAcE,MAChD,CAACP,EAAUG,EAAK,EAAE;AAClB,QAAAJ,EAAa,KAAKI,CAAI,GACtBH,EAAUG,EAAK,EAAE,IAAI,IACrBF;AAAA,WAEC;AACD,cAAMO,IAAWV,IACXjB,EAAM,WAAWyB,CAAa,IAC9BzB,EAAM,UAAUyB,CAAa;AACnC,YAAIG,IAAa;AACjB,iBAASC,IAAI,GAAGA,IAAIF,EAAS,QAAQE,KAAK;AACtC,gBAAMC,IAAUH,EAASE,CAAC,GACpBE,IAAQ/B,EAAM,KAAK8B,CAAO;AAChC,cAAIC,KACA/B,EAAM,OAAO8B,CAAO,MAAM9B,EAAM,OAAOsB,EAAK,EAAE,KAC9C,CAACH,EAAUW,CAAO,GAAG;AACrB,YAAAZ,EAAa,KAAKa,CAAK,GACvBZ,EAAUW,CAAO,IAAI,IACrBF,IAAa;AACb;AAAA,UACJ;AAAA,QACJ;AACA,YAAII,IAAK;AACT,eAAO,CAACJ,MACCT,EAAUjB,EAAM8B,CAAE,EAAE,EAAE,MACvBd,EAAa,KAAKhB,EAAM8B,CAAE,CAAC,GAC3Bb,EAAUjB,EAAM8B,CAAE,EAAE,EAAE,IAAI,IAC1BJ,IAAa,KAEjBI,KACIA,MAAO;AAAX;AAAA,MAIR;AAAA,IACJ;AACA,IAAAX;AAAA,EACJ,CAAC,GAEDrB,EAAM,aAAakB,CAAY,GACxBlB;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/util/point.js

@@ -1,8 +0,0 @@
-function e(r) {
-  var a;
-  return [r.x, r.y, (a = r.z) !== null && a !== void 0 ? a : 0];
-}
-export {
-  e as parsePoint
-};
-//# sourceMappingURL=point.js.map

package/dist/node_modules/@antv/layout/lib/util/point.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"point.js","sources":["../../../../../../node_modules/@antv/layout/lib/util/point.js"],"sourcesContent":["function parsePoint(point) {\n    var _a;\n    return [point.x, point.y, (_a = point.z) !== null && _a !== void 0 ? _a : 0];\n}\nfunction toPointObject(point) {\n    var _a;\n    return { x: point[0], y: point[1], z: (_a = point[2]) !== null && _a !== void 0 ? _a : 0 };\n}\n\nexport { parsePoint, toPointObject };\n//# sourceMappingURL=point.js.map\n"],"names":["parsePoint","point","_a"],"mappings":"AAAA,SAASA,EAAWC,GAAO;AACvB,MAAIC;AACJ,SAAO,CAACD,EAAM,GAAGA,EAAM,IAAIC,IAAKD,EAAM,OAAO,QAAQC,MAAO,SAASA,IAAK,CAAC;AAC/E;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/util/size.js

@@ -1,19 +0,0 @@
-import n from "../node_modules/@antv/util/esm/lodash/is-number.js";
-function i(r) {
-  if (!r)
-    return [0, 0, 0];
-  if (n(r))
-    return [r, r, r];
-  if (Array.isArray(r) && r.length === 0)
-    return [0, 0, 0];
-  const [t, e = t, f = t] = r;
-  return [t, e, f];
-}
-function o(r) {
-  return n(r) ? !0 : Array.isArray(r) ? r.every((t) => n(t)) : !1;
-}
-export {
-  o as isSize,
-  i as parseSize
-};
-//# sourceMappingURL=size.js.map

package/dist/node_modules/@antv/layout/lib/util/size.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"size.js","sources":["../../../../../../node_modules/@antv/layout/lib/util/size.js"],"sourcesContent":["import isNumber from '../node_modules/@antv/util/esm/lodash/is-number.js';\n\nfunction parseSize(size) {\n    if (!size)\n        return [0, 0, 0];\n    if (isNumber(size))\n        return [size, size, size];\n    else if (Array.isArray(size) && size.length === 0)\n        return [0, 0, 0];\n    const [x, y = x, z = x] = size;\n    return [x, y, z];\n}\nfunction isSize(value) {\n    if (isNumber(value))\n        return true;\n    if (Array.isArray(value)) {\n        return value.every((item) => isNumber(item));\n    }\n    return false;\n}\n\nexport { isSize, parseSize };\n//# sourceMappingURL=size.js.map\n"],"names":["parseSize","size","isNumber","x","y","z","isSize","value","item"],"mappings":";AAEA,SAASA,EAAUC,GAAM;AACrB,MAAI,CAACA;AACD,WAAO,CAAC,GAAG,GAAG,CAAC;AACnB,MAAIC,EAASD,CAAI;AACb,WAAO,CAACA,GAAMA,GAAMA,CAAI;AACvB,MAAI,MAAM,QAAQA,CAAI,KAAKA,EAAK,WAAW;AAC5C,WAAO,CAAC,GAAG,GAAG,CAAC;AACnB,QAAM,CAACE,GAAGC,IAAID,GAAGE,IAAIF,CAAC,IAAIF;AAC1B,SAAO,CAACE,GAAGC,GAAGC,CAAC;AACnB;AACA,SAASC,EAAOC,GAAO;AACnB,SAAIL,EAASK,CAAK,IACP,KACP,MAAM,QAAQA,CAAK,IACZA,EAAM,MAAM,CAACC,MAASN,EAASM,CAAI,CAAC,IAExC;AACX;","x_google_ignoreList":[0]}

package/dist/node_modules/@antv/layout/lib/util/viewport.js

@@ -1,12 +0,0 @@
-const w = (d) => {
-  const { width: n, height: e, center: i } = d, t = n ?? (typeof window < "u" ? window.innerWidth : 0), o = e ?? (typeof window < "u" ? window.innerHeight : 0), r = i ?? [t / 2, o / 2];
-  return {
-    width: t,
-    height: o,
-    center: r
-  };
-};
-export {
-  w as normalizeViewport
-};
-//# sourceMappingURL=viewport.js.map

package/dist/node_modules/@antv/layout/lib/util/viewport.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"viewport.js","sources":["../../../../../../node_modules/@antv/layout/lib/util/viewport.js"],"sourcesContent":["/**\n * Viewport configuration such as width, height and center point.\n */\nconst normalizeViewport = (options) => {\n    const { width, height, center } = options;\n    const normalizedWidth = width !== null && width !== void 0 ? width : (typeof window !== 'undefined' ? window.innerWidth : 0);\n    const normalizedHeight = height !== null && height !== void 0 ? height : (typeof window !== 'undefined' ? window.innerHeight : 0);\n    const centerPoint = center !== null && center !== void 0 ? center : [normalizedWidth / 2, normalizedHeight / 2];\n    return {\n        width: normalizedWidth,\n        height: normalizedHeight,\n        center: centerPoint,\n    };\n};\n\nexport { normalizeViewport };\n//# sourceMappingURL=viewport.js.map\n"],"names":["normalizeViewport","options","width","height","center","normalizedWidth","normalizedHeight","centerPoint"],"mappings":"AAGK,MAACA,IAAoB,CAACC,MAAY;AACnC,QAAM,EAAE,OAAAC,GAAO,QAAAC,GAAQ,QAAAC,EAAM,IAAKH,GAC5BI,IAAkBH,MAA8C,OAAO,SAAW,MAAc,OAAO,aAAa,IACpHI,IAAmBH,MAAiD,OAAO,SAAW,MAAc,OAAO,cAAc,IACzHI,IAAcH,KAAgD,CAACC,IAAkB,GAAGC,IAAmB,CAAC;AAC9G,SAAO;AAAA,IACH,OAAOD;AAAA,IACP,QAAQC;AAAA,IACR,QAAQC;AAAA,EAChB;AACA;","x_google_ignoreList":[0]}