@antv/layout 2.0.0-beta.2 → 2.0.1

package/esm/util/math.js

@@ -0,0 +1,272 @@
+import { isNumber } from '@antv/util';
+import { isArray } from './array.js';
+
+/**
+ * Floyd-Warshall algorithm to find shortest paths (but with no negative cycles).
+ */
+const floydWarshall = (adjMatrix) => {
+    // initialize
+    const n = adjMatrix.length;
+    const dist = Array.from({ length: n }, () => new Array(n));
+    for (let i = 0; i < n; i++) {
+        const row = adjMatrix[i];
+        const drow = dist[i];
+        for (let j = 0; j < n; j++) {
+            drow[j] = i === j ? 0 : row[j] > 0 ? row[j] : Infinity;
+        }
+    }
+    // floyd
+    for (let k = 0; k < n; k++) {
+        const dk = dist[k];
+        for (let i = 0; i < n; i++) {
+            const di = dist[i];
+            const dik = di[k];
+            if (dik === Infinity)
+                continue;
+            for (let j = 0; j < n; j++) {
+                const dkj = dk[j];
+                if (dkj === Infinity)
+                    continue;
+                const next = dik + dkj;
+                if (next < di[j]) {
+                    di[j] = next;
+                }
+            }
+        }
+    }
+    return dist;
+};
+/**
+ * Get the adjacency matrix of the graph model.
+ */
+const getAdjMatrix = (model, directed) => {
+    const n = model.nodeCount();
+    const matrix = Array.from({ length: n }, () => new Array(n));
+    // map node with index in data.nodes
+    const nodeMap = {};
+    let i = 0;
+    model.forEachNode((node) => {
+        nodeMap[node.id] = i++;
+    });
+    model.forEachEdge((e) => {
+        const sIndex = nodeMap[e.source];
+        const tIndex = nodeMap[e.target];
+        if (sIndex === undefined || tIndex === undefined)
+            return;
+        matrix[sIndex][tIndex] = 1;
+        if (!directed) {
+            matrix[tIndex][sIndex] = 1;
+        }
+    });
+    return matrix;
+};
+/**
+ * Get the adjacency list of the graph model.
+ */
+const getAdjList = (model, directed) => {
+    const n = model.nodeCount();
+    const adjList = Array.from({ length: n }, () => []);
+    // map node with index
+    const nodeMap = {};
+    let idx = 0;
+    model.forEachNode((node) => {
+        nodeMap[node.id] = idx++;
+    });
+    model.forEachEdge((e) => {
+        const s = nodeMap[e.source];
+        const t = nodeMap[e.target];
+        if (s == null || t == null)
+            return;
+        adjList[s].push(t);
+        if (!directed)
+            adjList[t].push(s);
+    });
+    return adjList;
+};
+/**
+ * scale matrix
+ * @param matrix [ [], [], [] ]
+ * @param ratio
+ */
+const scaleMatrix = (matrix, ratio) => {
+    const n = matrix.length;
+    const result = new Array(n);
+    for (let i = 0; i < n; i++) {
+        const row = matrix[i];
+        const m = row.length;
+        const newRow = new Array(m);
+        for (let j = 0; j < m; j++) {
+            newRow[j] = row[j] * ratio;
+        }
+        result[i] = newRow;
+    }
+    return result;
+};
+/**
+ * calculate the bounding box for the nodes according to their x, y, and size
+ * @param nodes nodes in the layout
+ * @returns
+ */
+const getLayoutBBox = (nodes) => {
+    let minX = Infinity;
+    let minY = Infinity;
+    let maxX = -Infinity;
+    let maxY = -Infinity;
+    nodes.forEach((node) => {
+        let size = node.data.size;
+        if (isArray(size)) {
+            if (size.length === 1)
+                size = [size[0], size[0]];
+        }
+        else if (size === undefined || isNaN(size)) {
+            size = [30, 30];
+        }
+        else if (isNumber(size)) {
+            size = [size, size];
+        }
+        const halfSize = [size[0] / 2, size[1] / 2];
+        const left = node.data.x - halfSize[0];
+        const right = node.data.x + halfSize[0];
+        const top = node.data.y - halfSize[1];
+        const bottom = node.data.y + halfSize[1];
+        if (minX > left)
+            minX = left;
+        if (minY > top)
+            minY = top;
+        if (maxX < right)
+            maxX = right;
+        if (maxY < bottom)
+            maxY = bottom;
+    });
+    return { minX, minY, maxX, maxY };
+};
+/**
+ * calculate the euclidean distance form p1 to p2
+ * @param p1
+ * @param p2
+ * @returns
+ */
+const getEuclideanDistance = (p1, p2) => Math.sqrt((p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y));
+/**
+ * Depth first search begin from nodes in graphCore data.
+ * @param graphCore graphlib data structure
+ * @param nodes begin nodes
+ * @param fn will be called while visiting each node
+ * @param mode 'TB' - visit from top to bottom; 'BT' - visit from bottom to top;
+ * @returns
+ */
+const graphTreeDfs = (graph, nodes, fn, mode = 'TB', treeKey, stopFns = {}) => {
+    if (!(nodes === null || nodes === void 0 ? void 0 : nodes.length))
+        return;
+    const { stopBranchFn, stopAllFn } = stopFns;
+    for (let i = 0; i < nodes.length; i++) {
+        const node = nodes[i];
+        if (!graph.hasNode(node.id))
+            continue;
+        if (stopBranchFn === null || stopBranchFn === void 0 ? void 0 : stopBranchFn(node))
+            continue; // Stop this branch
+        if (stopAllFn === null || stopAllFn === void 0 ? void 0 : stopAllFn(node))
+            return; // Stop all
+        if (mode === 'TB')
+            fn(node); // Traverse from top to bottom
+        graphTreeDfs(graph, graph.getChildren(node.id, treeKey), fn, mode, treeKey, stopFns);
+        if (mode !== 'TB')
+            fn(node); // Traverse from bottom to top
+    }
+};
+/**
+ * Use Johnson + Dijkstra to compute APSP for sparse graph.
+ * Fully compatible with floydWarshall(adjMatrix).
+ */
+function johnson(adjList) {
+    const n = adjList.length;
+    // Step 1: add a dummy node q connected to all nodes with weight 0
+    new Array(n).fill(0);
+    // Bellman-Ford to compute potentials h(v)
+    // 因为权重全是 1，无负边，可直接跳过 BF，h 全 0 即可
+    // Step 2: reweight edges
+    // 因为 h(u)=h(v)=0，reweight 后仍然是 1，省略 reweight 过程
+    // Step 3: run Dijkstra from each node
+    const distAll = Array.from({ length: n }, () => new Array(n).fill(Infinity));
+    for (let s = 0; s < n; s++) {
+        distAll[s] = dijkstra(adjList, s);
+    }
+    return distAll;
+}
+/**
+ * Dijkstra algorithm to find shortest paths from source to all nodes.
+ */
+function dijkstra(adjList, source) {
+    const n = adjList.length;
+    const dist = new Array(n).fill(Infinity);
+    dist[source] = 0;
+    // Minimal binary heap
+    const heap = new MinHeap();
+    heap.push([0, source]); // [distance, node]
+    while (!heap.empty()) {
+        const [d, u] = heap.pop();
+        if (d !== dist[u])
+            continue;
+        const neighbors = adjList[u];
+        for (let i = 0; i < neighbors.length; i++) {
+            const v = neighbors[i];
+            const nd = d + 1;
+            if (nd < dist[v]) {
+                dist[v] = nd;
+                heap.push([nd, v]);
+            }
+        }
+    }
+    return dist;
+}
+class MinHeap {
+    constructor() {
+        this.data = [];
+    }
+    push(item) {
+        this.data.push(item);
+        this.bubbleUp(this.data.length - 1);
+    }
+    pop() {
+        const top = this.data[0];
+        const end = this.data.pop();
+        if (this.data.length > 0) {
+            this.data[0] = end;
+            this.bubbleDown(0);
+        }
+        return top;
+    }
+    empty() {
+        return this.data.length === 0;
+    }
+    bubbleUp(pos) {
+        const data = this.data;
+        while (pos > 0) {
+            const parent = (pos - 1) >> 1;
+            if (data[parent][0] <= data[pos][0])
+                break;
+            [data[parent], data[pos]] = [data[pos], data[parent]];
+            pos = parent;
+        }
+    }
+    bubbleDown(pos) {
+        const data = this.data;
+        const length = data.length;
+        while (true) {
+            const left = pos * 2 + 1;
+            const right = pos * 2 + 2;
+            let min = pos;
+            if (left < length && data[left][0] < data[min][0])
+                min = left;
+            if (right < length && data[right][0] < data[min][0])
+                min = right;
+            if (min === pos)
+                break;
+            [data[pos], data[min]] = [data[min], data[pos]];
+            pos = min;
+        }
+    }
+}
+
+export { floydWarshall, getAdjList, getAdjMatrix, getEuclideanDistance, getLayoutBBox, graphTreeDfs, johnson, scaleMatrix };
+//# sourceMappingURL=math.js.map

package/esm/util/math.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"math.js","sources":["../../src/util/src/util/math.ts"],"sourcesContent":[null],"names":[],"mappings":";;;AAMA;;AAEG;AACI,MAAM,aAAa,GAAG,CAAC,SAAiB,KAAY;;AAEzD,IAAA,MAAM,CAAC,GAAG,SAAS,CAAC,MAAM;IAC1B,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;IAE1D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAC1B,QAAA,MAAM,GAAG,GAAG,SAAS,CAAC,CAAC,CAAC;AACxB,QAAA,MAAM,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC;QACpB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAC1B,YAAA,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,QAAQ;AACvD,QAAA;AACF,IAAA;;IAGD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAC1B,QAAA,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;QAClB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAC1B,YAAA,MAAM,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC;AAClB,YAAA,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;YACjB,IAAI,GAAG,KAAK,QAAQ;gBAAE;YAEtB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAC1B,gBAAA,MAAM,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;gBACjB,IAAI,GAAG,KAAK,QAAQ;oBAAE;AAEtB,gBAAA,MAAM,IAAI,GAAG,GAAG,GAAG,GAAG;AACtB,gBAAA,IAAI,IAAI,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE;AAChB,oBAAA,EAAE,CAAC,CAAC,CAAC,GAAG,IAAI;AACb,gBAAA;AACF,YAAA;AACF,QAAA;AACF,IAAA;AACD,IAAA,OAAO,IAAI;AACb;AAEA;;AAEG;MACU,YAAY,GAAG,CAAC,KAAe,EAAE,QAAiB,KAAY;AACzE,IAAA,MAAM,CAAC,GAAG,KAAK,CAAC,SAAS,EAAE;IAC3B,MAAM,MAAM,GAAW,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,MAAM,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;;IAGpE,MAAM,OAAO,GAA8B,EAAE;IAE7C,IAAI,CAAC,GAAG,CAAC;AACT,IAAA,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,KAAI;QACzB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE;AACxB,IAAA,CAAC,CAAC;AAEF,IAAA,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,KAAI;QACtB,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;QAChC,MAAM,MAAM,GAAG,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;AAChC,QAAA,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS;YAAE;QAElD,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;QAC1B,IAAI,CAAC,QAAQ,EAAE;YACb,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC;AAC3B,QAAA;AACH,IAAA,CAAC,CAAC;AACF,IAAA,OAAO,MAAM;AACf;AAEA;;AAEG;MACU,UAAU,GAAG,CAAC,KAAe,EAAE,QAAiB,KAAY;AACvE,IAAA,MAAM,CAAC,GAAG,KAAK,CAAC,SAAS,EAAE;AAC3B,IAAA,MAAM,OAAO,GAAW,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,MAAM,EAAc,CAAC;;IAGvE,MAAM,OAAO,GAA2B,EAAE;IAC1C,IAAI,GAAG,GAAG,CAAC;AACX,IAAA,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,KAAI;QACzB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,GAAG,EAAE;AAC1B,IAAA,CAAC,CAAC;AAEF,IAAA,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,KAAI;QACtB,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;QAC3B,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC;AAC3B,QAAA,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,IAAI;YAAE;QAE5B,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AAClB,QAAA,IAAI,CAAC,QAAQ;YAAE,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;AACnC,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,OAAO;AAChB;AAEA;;;;AAIG;MACU,WAAW,GAAG,CAAC,MAAc,EAAE,KAAa,KAAI;AAC3D,IAAA,MAAM,CAAC,GAAG,MAAM,CAAC,MAAM;AACvB,IAAA,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC;IAE3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;AAC1B,QAAA,MAAM,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC;AACrB,QAAA,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM;AACpB,QAAA,MAAM,MAAM,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC;QAE3B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;YAC1B,MAAM,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK;AAC3B,QAAA;AACD,QAAA,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM;AACnB,IAAA;AAED,IAAA,OAAO,MAAM;AACf;AAEA;;;;AAIG;AACI,MAAM,aAAa,GAAG,CAAC,KAAiB,KAAI;IACjD,IAAI,IAAI,GAAG,QAAQ;IACnB,IAAI,IAAI,GAAG,QAAQ;AACnB,IAAA,IAAI,IAAI,GAAG,CAAC,QAAQ;AACpB,IAAA,IAAI,IAAI,GAAG,CAAC,QAAQ;AACpB,IAAA,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,KAAI;AACrB,QAAA,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI;AACzB,QAAA,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE;AACjB,YAAA,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;AAAE,gBAAA,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;AACjD,QAAA;aAAM,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,IAAW,CAAC,EAAE;AACnD,YAAA,IAAI,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC;AAChB,QAAA;AAAM,aAAA,IAAI,QAAQ,CAAC,IAAI,CAAC,EAAE;AACzB,YAAA,IAAI,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC;AACpB,QAAA;AAED,QAAA,MAAM,QAAQ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;AAC3C,QAAA,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;AACtC,QAAA,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;AACvC,QAAA,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;AACrC,QAAA,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC;QAExC,IAAI,IAAI,GAAG,IAAI;YAAE,IAAI,GAAG,IAAI;QAC5B,IAAI,IAAI,GAAG,GAAG;YAAE,IAAI,GAAG,GAAG;QAC1B,IAAI,IAAI,GAAG,KAAK;YAAE,IAAI,GAAG,KAAK;QAC9B,IAAI,IAAI,GAAG,MAAM;YAAE,IAAI,GAAG,MAAM;AAClC,IAAA,CAAC,CAAC;IACF,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE;AACnC;AAEA;;;;;AAKG;AACI,MAAM,oBAAoB,GAAG,CAAC,EAAe,EAAE,EAAe,KACnE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;AAEzE;;;;;;;AAOG;AACI,MAAM,YAAY,GAAG,CAC1B,KAAsB,EACtB,KAAiB,EACjB,EAAyB,EACzB,IAAA,GAAoB,IAAI,EACxB,OAAe,EACf,OAAA,GAGI,EAAE,KACJ;IACF,IAAI,EAAC,KAAK,KAAA,IAAA,IAAL,KAAK,KAAA,MAAA,GAAA,MAAA,GAAL,KAAK,CAAE,MAAM,CAAA;QAAE;AACpB,IAAA,MAAM,EAAE,YAAY,EAAE,SAAS,EAAE,GAAG,OAAO;AAC3C,IAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACrC,QAAA,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC;QACrB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE;AAC7B,QAAA,IAAI,YAAY,KAAA,IAAA,IAAZ,YAAY,uBAAZ,YAAY,CAAG,IAAI,CAAC;AAAE,YAAA,SAAS;AACnC,QAAA,IAAI,SAAS,KAAA,IAAA,IAAT,SAAS,uBAAT,SAAS,CAAG,IAAI,CAAC;AAAE,YAAA,OAAO;QAC9B,IAAI,IAAI,KAAK,IAAI;AAAE,YAAA,EAAE,CAAC,IAAI,CAAC,CAAC;QAC5B,YAAY,CACV,KAAK,EACL,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,EACnC,EAAE,EACF,IAAI,EACJ,OAAO,EACP,OAAO,CACR;QACD,IAAI,IAAI,KAAK,IAAI;AAAE,YAAA,EAAE,CAAC,IAAI,CAAC,CAAC;AAC7B,IAAA;AACH;AAEA;;;AAGG;AAEG,SAAU,OAAO,CAAC,OAAe,EAAA;AACrC,IAAA,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM;;AAGxB,IAAU,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;;;;;;IAS7B,MAAM,OAAO,GAAW,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE,EAAE,MAChD,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAC5B;IAED,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE;QAC1B,OAAO,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,OAAO,EAAE,CAAC,CAAC;AAClC,IAAA;AAED,IAAA,OAAO,OAAO;AAChB;AAEA;;AAEG;AACH,SAAS,QAAQ,CAAC,OAAmB,EAAE,MAAc,EAAA;AACnD,IAAA,MAAM,CAAC,GAAG,OAAO,CAAC,MAAM;AACxB,IAAA,MAAM,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC;AACxC,IAAA,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC;;AAGhB,IAAA,MAAM,IAAI,GAAG,IAAI,OAAO,EAAE;IAC1B,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC;AAEvB,IAAA,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE;QACpB,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,EAAE;AACzB,QAAA,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC;YAAE;AAEnB,QAAA,MAAM,SAAS,GAAG,OAAO,CAAC,CAAC,CAAC;AAC5B,QAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACzC,YAAA,MAAM,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC;AACtB,YAAA,MAAM,EAAE,GAAG,CAAC,GAAG,CAAC;AAChB,YAAA,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE;AAChB,gBAAA,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE;gBACZ,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;AACnB,YAAA;AACF,QAAA;AACF,IAAA;AAED,IAAA,OAAO,IAAI;AACb;AAEA,MAAM,OAAO,CAAA;AAAb,IAAA,WAAA,GAAA;QACU,IAAA,CAAA,IAAI,GAAuB,EAAE;IAgDvC;AA9CE,IAAA,IAAI,CAAC,IAAsB,EAAA;AACzB,QAAA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QACpB,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;IACrC;IAEA,GAAG,GAAA;QACD,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACxB,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAG;AAC5B,QAAA,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,EAAE;AACxB,YAAA,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,GAAG;AAClB,YAAA,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC;AACnB,QAAA;AACD,QAAA,OAAO,GAAG;IACZ;IAEA,KAAK,GAAA;AACH,QAAA,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC;IAC/B;AAEQ,IAAA,QAAQ,CAAC,GAAW,EAAA;AAC1B,QAAA,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI;QACtB,OAAO,GAAG,GAAG,CAAC,EAAE;YACd,MAAM,MAAM,GAAG,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC;AAC7B,YAAA,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAAE;YACrC,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;YACrD,GAAG,GAAG,MAAM;AACb,QAAA;IACH;AAEQ,IAAA,UAAU,CAAC,GAAW,EAAA;AAC5B,QAAA,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI;AACtB,QAAA,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM;AAE1B,QAAA,OAAO,IAAI,EAAE;AACX,YAAA,MAAM,IAAI,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC;AACxB,YAAA,MAAM,KAAK,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC;YACzB,IAAI,GAAG,GAAG,GAAG;AAEb,YAAA,IAAI,IAAI,GAAG,MAAM,IAAI,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAAE,GAAG,GAAG,IAAI;AAC7D,YAAA,IAAI,KAAK,GAAG,MAAM,IAAI,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBAAE,GAAG,GAAG,KAAK;YAChE,IAAI,GAAG,KAAK,GAAG;gBAAE;YAEjB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/C,GAAG,GAAG,GAAG;AACV,QAAA;IACH;AACD;;;;"}

package/esm/util/object.js

@@ -0,0 +1,44 @@
+import { get, set } from '@antv/util';
+
+/**
+ * Get nested property value
+ * For example: getNestedValue(obj, 'a.b.c') will return obj.a.b.c
+ */
+function getNestedValue(obj, path) {
+    const keys = String(path).split('.');
+    return get(obj, keys);
+}
+/**
+ * Set nested property value
+ * For example: setNestedValue(obj, 'a.b.c', value) will set obj.a.b.c = value
+ */
+function setNestedValue(obj, path, value) {
+    const keys = String(path).split('.');
+    set(obj, keys, value);
+}
+/**
+ * Merge objects, but undefined values in source objects will not override existing values
+ * @param target - The target object
+ * @param sources - Source objects to merge
+ * @returns A new merged object
+ *
+ * @example
+ * assignDefined({ a: 1, b: 2 }, { b: undefined, c: 3 })
+ * // Returns: { a: 1, b: 2, c: 3 }
+ */
+function assignDefined(target, ...sources) {
+    sources.forEach((source) => {
+        if (source) {
+            Object.keys(source).forEach((key) => {
+                const value = source[key];
+                if (value !== undefined) {
+                    target[key] = value;
+                }
+            });
+        }
+    });
+    return target;
+}
+
+export { assignDefined, getNestedValue, setNestedValue };
+//# sourceMappingURL=object.js.map

package/esm/util/object.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"object.js","sources":["../../src/util/src/util/object.ts"],"sourcesContent":[null],"names":[],"mappings":";;AAEA;;;AAGG;AACG,SAAU,cAAc,CAAI,GAAM,EAAE,IAAsB,EAAA;IAC9D,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;AACpC,IAAA,OAAO,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC;AACvB;AAEA;;;AAGG;SACa,cAAc,CAC5B,GAAM,EACN,IAAsB,EACtB,KAAU,EAAA;IAEV,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC;AACpC,IAAA,GAAG,CAAC,GAAG,EAAE,IAAI,EAAE,KAAK,CAAC;AACvB;AAEA;;;;;;;;;AASG;SACa,aAAa,CAC3B,MAAS,EACT,GAAG,OAAqB,EAAA;AAExB,IAAA,OAAO,CAAC,OAAO,CAAC,CAAC,MAAM,KAAI;AACzB,QAAA,IAAI,MAAM,EAAE;YACV,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,KAAI;AAClC,gBAAA,MAAM,KAAK,GAAG,MAAM,CAAC,GAAc,CAAC;gBACpC,IAAI,KAAK,KAAK,SAAS,EAAE;AACvB,oBAAA,MAAM,CAAC,GAAc,CAAC,GAAG,KAAmB;AAC7C,gBAAA;AACH,YAAA,CAAC,CAAC;AACH,QAAA;AACH,IAAA,CAAC,CAAC;AACF,IAAA,OAAO,MAAM;AACf;;;;"}

package/esm/util/order.js

@@ -0,0 +1,109 @@
+/**
+ * 通用排序核心函数
+ */
+function sort(model, compareFn) {
+    const nodes = model.nodes();
+    nodes.sort(compareFn);
+    model.setNodeOrder(nodes);
+    return model;
+}
+function orderByDegree(model, order = 'desc') {
+    return sort(model, (nodeA, nodeB) => {
+        const degreeA = model.degree(nodeA.id);
+        const degreeB = model.degree(nodeB.id);
+        if (order === 'asc') {
+            return degreeA - degreeB; // ascending order
+        }
+        return degreeB - degreeA; // descending order
+    });
+}
+/**
+ * 按 ID 排序
+ */
+function orderById(model) {
+    return sort(model, (nodeA, nodeB) => {
+        const idA = nodeA.id;
+        const idB = nodeB.id;
+        if (typeof idA === 'number' && typeof idB === 'number') {
+            return idA - idB;
+        }
+        return String(idA).localeCompare(String(idB));
+    });
+}
+/**
+ * 按自定义比较函数排序
+ */
+function orderBySorter(model, sorter) {
+    return sort(model, (nodeA, nodeB) => {
+        const a = model.originalNode(nodeA.id);
+        const b = model.originalNode(nodeB.id);
+        return sorter(a, b);
+    });
+}
+/**
+ * Order nodes according to graph topology
+ */
+function orderByTopology(model, directed = false) {
+    const n = model.nodeCount();
+    if (n === 0)
+        return model;
+    const nodes = model.nodes();
+    const orderedNodes = [nodes[0]];
+    const pickFlags = {};
+    pickFlags[nodes[0].id] = true;
+    let k = 0;
+    let i = 0;
+    model.forEachNode((node) => {
+        if (i !== 0) {
+            const currentDegree = model.degree(node.id, 'both');
+            const nextDegree = i < n - 1 ? model.degree(nodes[i + 1].id, 'both') : 0;
+            const currentNodeId = orderedNodes[k].id;
+            const isNeighbor = model
+                .neighbors(currentNodeId, 'both')
+                .includes(node.id);
+            if ((i === n - 1 || currentDegree !== nextDegree || isNeighbor) &&
+                !pickFlags[node.id]) {
+                orderedNodes.push(node);
+                pickFlags[node.id] = true;
+                k++;
+            }
+            else {
+                const children = directed
+                    ? model.successors(currentNodeId)
+                    : model.neighbors(currentNodeId);
+                let foundChild = false;
+                for (let j = 0; j < children.length; j++) {
+                    const childId = children[j];
+                    const child = model.node(childId);
+                    if (child &&
+                        model.degree(childId) === model.degree(node.id) &&
+                        !pickFlags[childId]) {
+                        orderedNodes.push(child);
+                        pickFlags[childId] = true;
+                        foundChild = true;
+                        break;
+                    }
+                }
+                let ii = 0;
+                while (!foundChild) {
+                    if (!pickFlags[nodes[ii].id]) {
+                        orderedNodes.push(nodes[ii]);
+                        pickFlags[nodes[ii].id] = true;
+                        foundChild = true;
+                    }
+                    ii++;
+                    if (ii === n) {
+                        break;
+                    }
+                }
+            }
+        }
+        i++;
+    });
+    // Update model with ordered nodes
+    model.setNodeOrder(orderedNodes);
+    return model;
+}
+
+export { orderByDegree, orderById, orderBySorter, orderByTopology };
+//# sourceMappingURL=order.js.map

package/esm/util/order.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"order.js","sources":["../../src/util/src/util/order.ts"],"sourcesContent":[null],"names":[],"mappings":"AAGA;;AAEG;AACH,SAAS,IAAI,CACX,KAAkB,EAClB,SAAyD,EAAA;AAEzD,IAAA,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE;AAE3B,IAAA,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC;AACrB,IAAA,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC;AAEzB,IAAA,OAAO,KAAK;AACd;SAEgB,aAAa,CAC3B,KAAkB,EAClB,QAAwB,MAAM,EAAA;IAE9B,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,KAAI;QAClC,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;QACtC,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC;QACtC,IAAI,KAAK,KAAK,KAAK,EAAE;AACnB,YAAA,OAAO,OAAO,GAAG,OAAO,CAAC;AAC1B,QAAA;AACD,QAAA,OAAO,OAAO,GAAG,OAAO,CAAC;AAC3B,IAAA,CAAC,CAAC;AACJ;AAEA;;AAEG;AACG,SAAU,SAAS,CACvB,KAAkB,EAAA;IAElB,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,KAAI;AAClC,QAAA,MAAM,GAAG,GAAG,KAAK,CAAC,EAAE;AACpB,QAAA,MAAM,GAAG,GAAG,KAAK,CAAC,EAAE;QAEpB,IAAI,OAAO,GAAG,KAAK,QAAQ,IAAI,OAAO,GAAG,KAAK,QAAQ,EAAE;YACtD,OAAO,GAAG,GAAG,GAAG;AACjB,QAAA;AAED,QAAA,OAAO,MAAM,CAAC,GAAG,CAAC,CAAC,aAAa,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;AAC/C,IAAA,CAAC,CAAC;AACJ;AAEA;;AAEG;AACG,SAAU,aAAa,CAC3B,KAAkB,EAClB,MAAiB,EAAA;IAEjB,OAAO,IAAI,CAAC,KAAK,EAAE,CAAC,KAAK,EAAE,KAAK,KAAI;QAClC,MAAM,CAAC,GAAG,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC;QACtC,MAAM,CAAC,GAAG,KAAK,CAAC,YAAY,CAAC,KAAK,CAAC,EAAE,CAAC;AACtC,QAAA,OAAO,MAAM,CAAC,CAAE,EAAE,CAAE,CAAC;AACvB,IAAA,CAAC,CAAC;AACJ;AAEA;;AAEG;SACa,eAAe,CAC7B,KAAkB,EAClB,WAAoB,KAAK,EAAA;AAEzB,IAAA,MAAM,CAAC,GAAG,KAAK,CAAC,SAAS,EAAE;IAE3B,IAAI,CAAC,KAAK,CAAC;AAAE,QAAA,OAAO,KAAK;AAEzB,IAAA,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,EAAE;IAC3B,MAAM,YAAY,GAAoB,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;IAChD,MAAM,SAAS,GAA8B,EAAE;IAC/C,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI;IAE7B,IAAI,CAAC,GAAG,CAAC;IACT,IAAI,CAAC,GAAG,CAAC;AACT,IAAA,KAAK,CAAC,WAAW,CAAC,CAAC,IAAI,KAAI;QACzB,IAAI,CAAC,KAAK,CAAC,EAAE;AACX,YAAA,MAAM,aAAa,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,EAAE,MAAM,CAAC;AACnD,YAAA,MAAM,UAAU,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,MAAM,CAAC,GAAG,CAAC;YACxE,MAAM,aAAa,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE;YACxC,MAAM,UAAU,GAAG;AAChB,iBAAA,SAAS,CAAC,aAAa,EAAE,MAAM;AAC/B,iBAAA,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC;AAEpB,YAAA,IACE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,aAAa,KAAK,UAAU,IAAI,UAAU;AAC1D,gBAAA,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,EACnB;AACA,gBAAA,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC;AACvB,gBAAA,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI;AACzB,gBAAA,CAAC,EAAE;AACJ,YAAA;AAAM,iBAAA;gBACL,MAAM,QAAQ,GAAG;AACf,sBAAE,KAAK,CAAC,UAAU,CAAC,aAAa;AAChC,sBAAE,KAAK,CAAC,SAAS,CAAC,aAAa,CAAC;gBAClC,IAAI,UAAU,GAAG,KAAK;AAEtB,gBAAA,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;AACxC,oBAAA,MAAM,OAAO,GAAG,QAAQ,CAAC,CAAC,CAAC;oBAC3B,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC;AACjC,oBAAA,IACE,KAAK;AACL,wBAAA,KAAK,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC;AAC/C,wBAAA,CAAC,SAAS,CAAC,OAAO,CAAC,EACnB;AACA,wBAAA,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC;AACxB,wBAAA,SAAS,CAAC,OAAO,CAAC,GAAG,IAAI;wBACzB,UAAU,GAAG,IAAI;wBACjB;AACD,oBAAA;AACF,gBAAA;gBAED,IAAI,EAAE,GAAG,CAAC;gBACV,OAAO,CAAC,UAAU,EAAE;oBAClB,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE;wBAC5B,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;wBAC5B,SAAS,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI;wBAC9B,UAAU,GAAG,IAAI;AAClB,oBAAA;AACD,oBAAA,EAAE,EAAE;oBACJ,IAAI,EAAE,KAAK,CAAC,EAAE;wBACZ;AACD,oBAAA;AACF,gBAAA;AACF,YAAA;AACF,QAAA;AACD,QAAA,CAAC,EAAE;AACL,IAAA,CAAC,CAAC;;AAGF,IAAA,KAAK,CAAC,YAAY,CAAC,YAAY,CAAC;AAEhC,IAAA,OAAO,KAAK;AACd;;;;"}

package/esm/util/point.js

@@ -0,0 +1,11 @@
+function parsePoint(point) {
+    var _a;
+    return [point.x, point.y, (_a = point.z) !== null && _a !== void 0 ? _a : 0];
+}
+function toPointObject(point) {
+    var _a;
+    return { x: point[0], y: point[1], z: (_a = point[2]) !== null && _a !== void 0 ? _a : 0 };
+}
+
+export { parsePoint, toPointObject };
+//# sourceMappingURL=point.js.map

package/esm/util/point.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"point.js","sources":["../../src/util/src/util/point.ts"],"sourcesContent":[null],"names":[],"mappings":"AAEM,SAAU,UAAU,CAAC,KAAkB,EAAA;;AAC3C,IAAA,OAAO,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAA,EAAA,GAAA,KAAK,CAAC,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,EAAA,GAAI,CAAC,CAAC;AACzC;AAEM,SAAU,aAAa,CAAC,KAAY,EAAA;;IACxC,OAAO,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,CAAA,EAAA,GAAA,KAAK,CAAC,CAAC,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,EAAA,GAAI,CAAC,EAAE;AACvD;;;;"}

package/esm/util/size.js

@@ -0,0 +1,23 @@
+import { isNumber } from '@antv/util';
+
+function parseSize(size) {
+    if (!size)
+        return [0, 0, 0];
+    if (isNumber(size))
+        return [size, size, size];
+    else if (Array.isArray(size) && size.length === 0)
+        return [0, 0, 0];
+    const [x, y = x, z = x] = size;
+    return [x, y, z];
+}
+function isSize(value) {
+    if (isNumber(value))
+        return true;
+    if (Array.isArray(value)) {
+        return value.every((item) => isNumber(item));
+    }
+    return false;
+}
+
+export { isSize, parseSize };
+//# sourceMappingURL=size.js.map

package/esm/util/size.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"size.js","sources":["../../src/util/src/util/size.ts"],"sourcesContent":[null],"names":[],"mappings":";;AAGM,SAAU,SAAS,CAAC,IAAW,EAAA;AACnC,IAAA,IAAI,CAAC,IAAI;AAAE,QAAA,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;IAC3B,IAAI,QAAQ,CAAC,IAAI,CAAC;AAAE,QAAA,OAAO,CAAC,IAAI,EAAE,IAAI,EAAE,IAAI,CAAC;SACxC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;AAAE,QAAA,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AACnE,IAAA,MAAM,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,IAAI;AAC9B,IAAA,OAAO,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC;AAClB;AAEM,SAAU,MAAM,CAAC,KAAc,EAAA;IACnC,IAAI,QAAQ,CAAC,KAAK,CAAC;AAAE,QAAA,OAAO,IAAI;AAChC,IAAA,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;AACxB,QAAA,OAAO,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,KAAK,QAAQ,CAAC,IAAI,CAAC,CAAC;AAC7C,IAAA;AACD,IAAA,OAAO,KAAK;AACd;;;;"}

package/esm/util/viewport.js

@@ -0,0 +1,17 @@
+/**
+ * Viewport configuration such as width, height and center point.
+ */
+const normalizeViewport = (options) => {
+    const { width, height, center } = options;
+    const normalizedWidth = width !== null && width !== void 0 ? width : (typeof window !== 'undefined' ? window.innerWidth : 0);
+    const normalizedHeight = height !== null && height !== void 0 ? height : (typeof window !== 'undefined' ? window.innerHeight : 0);
+    const centerPoint = center !== null && center !== void 0 ? center : [normalizedWidth / 2, normalizedHeight / 2];
+    return {
+        width: normalizedWidth,
+        height: normalizedHeight,
+        center: centerPoint,
+    };
+};
+
+export { normalizeViewport };
+//# sourceMappingURL=viewport.js.map

package/esm/util/viewport.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"viewport.js","sources":["../../src/util/src/util/viewport.ts"],"sourcesContent":[null],"names":[],"mappings":"AAEA;;AAEG;AACI,MAAM,iBAAiB,GAAG,CAAC,OAIjC,KAIG;IACF,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,OAAO;IACzC,MAAM,eAAe,GACnB,KAAK,KAAA,IAAA,IAAL,KAAK,cAAL,KAAK,IAAK,OAAO,MAAM,KAAK,WAAW,GAAG,MAAM,CAAC,UAAU,GAAG,CAAC,CAAC;IAClE,MAAM,gBAAgB,GACpB,MAAM,KAAA,IAAA,IAAN,MAAM,cAAN,MAAM,IAAK,OAAO,MAAM,KAAK,WAAW,GAAG,MAAM,CAAC,WAAW,GAAG,CAAC,CAAC;AACpE,IAAA,MAAM,WAAW,GAAG,MAAM,KAAA,IAAA,IAAN,MAAM,cAAN,MAAM,GAAI,CAAC,eAAe,GAAG,CAAC,EAAE,gBAAgB,GAAG,CAAC,CAAC;IAEzE,OAAO;AACL,QAAA,KAAK,EAAE,eAAe;AACtB,QAAA,MAAM,EAAE,gBAAgB;AACxB,QAAA,MAAM,EAAE,WAAW;KACpB;AACH;;;;"}