@antv/layout 1.2.14-beta.9 → 2.0.0-alpha.2

package/lib/util/format.js

@@ -0,0 +1,72 @@
+import { parseSize } from './size.js';
+import isFunction from '../node_modules/@antv/util/esm/lodash/is-function.js';
+import isNumber from '../node_modules/@antv/util/esm/lodash/is-number.js';
+import isObject from '../node_modules/@antv/util/esm/lodash/is-object.js';
+
+/**
+ * Format value with multiple types into a function that returns a number
+ * @param value The value to be formatted
+ * @param defaultValue The default value when value is invalid
+ * @returns A function that returns a number
+ */
+function formatNumberFn(value, defaultValue) {
+    // If value is a function, return it directly
+    if (isFunction(value)) {
+        return value;
+    }
+    // If value is a number, return a function that returns this number
+    if (isNumber(value)) {
+        return () => value;
+    }
+    // For other cases (undefined or invalid values), return default value function
+    return () => defaultValue;
+}
+/**
+ * Format size config with multiple types into a function that returns a size
+ * @param value The value to be formatted
+ * @param defaultValue The default value when value is invalid
+ * @param resultIsNumber Whether to return a number (max of width/height) or size array
+ * @returns A function that returns a size
+ */
+function formatSizeFn(value, defaultValue = 10) {
+    // If value is undefined, return default value function
+    if (!value) {
+        return () => defaultValue;
+    }
+    // If value is a function, return it directly
+    if (isFunction(value)) {
+        return value;
+    }
+    // If value is a number, return a function that returns this number
+    if (isNumber(value)) {
+        return () => value;
+    }
+    // If value is an array, return max or the array itself
+    if (Array.isArray(value)) {
+        return () => value;
+    }
+    // If value is an object with width and height
+    if (isObject(value) && value.width && value.height) {
+        return () => [value.width, value.height];
+    }
+    return () => defaultValue;
+}
+/**
+ * Format nodeSize and nodeSpacing into a function that returns the total size
+ * @param nodeSize The size of the node
+ * @param nodeSpacing The spacing around the node
+ * @param defaultNodeSize The default node size when value is invalid
+ * @returns A function that returns the total size (node size + spacing)
+ */
+const formatNodeSizeFn = (nodeSize, nodeSpacing, defaultNodeSize = 10) => {
+    const nodeSpacingFunc = formatNumberFn(nodeSpacing, 0);
+    const nodeSizeFunc = formatSizeFn(nodeSize, defaultNodeSize);
+    return (node) => {
+        const size = nodeSizeFunc(node);
+        const spacing = nodeSpacingFunc(node);
+        return Math.max(...parseSize(size)) + spacing;
+    };
+};
+
+export { formatNodeSizeFn, formatNumberFn, formatSizeFn };
+//# sourceMappingURL=format.js.map

package/lib/util/format.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"format.js","sources":["../../src/util/src/util/format.ts"],"sourcesContent":[null],"names":[],"mappings":";;;;;AAIA;;;;;AAKG;AACG,SAAU,cAAc,CAC5B,KAA+C,EAC/C,YAAoB,EAAA;;AAGpB,IAAA,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE;AACrB,QAAA,OAAO,KAAK;AACb,IAAA;;AAGD,IAAA,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;AACnB,QAAA,OAAO,MAAM,KAAK;AACnB,IAAA;;AAGD,IAAA,OAAO,MAAM,YAAY;AAC3B;AAEA;;;;;;AAMG;SACa,YAAY,CAC1B,KAAoE,EACpE,eAAuB,EAAE,EAAA;;IAGzB,IAAI,CAAC,KAAK,EAAE;AACV,QAAA,OAAO,MAAM,YAAY;AAC1B,IAAA;;AAGD,IAAA,IAAI,UAAU,CAAC,KAAK,CAAC,EAAE;AACrB,QAAA,OAAO,KAAK;AACb,IAAA;;AAGD,IAAA,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;AACnB,QAAA,OAAO,MAAM,KAAK;AACnB,IAAA;;AAGD,IAAA,IAAI,KAAK,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;AACxB,QAAA,OAAO,MAAM,KAAK;AACnB,IAAA;;AAGD,IAAA,IAAI,QAAQ,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE;AAClD,QAAA,OAAO,MAAM,CAAC,KAAK,CAAC,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC;AACzC,IAAA;AAED,IAAA,OAAO,MAAM,YAAY;AAC3B;AAEA;;;;;;AAMG;AACI,MAAM,gBAAgB,GAAG,CAC9B,QAIa,EACb,WAA+D,EAC/D,eAAA,GAA0B,EAAE,KACK;IACjC,MAAM,eAAe,GAAG,cAAc,CAAC,WAAW,EAAE,CAAC,CAAC;IACtD,MAAM,YAAY,GAAG,YAAY,CAAC,QAAQ,EAAE,eAAe,CAAC;IAE5D,OAAO,CAAC,IAAe,KAAI;AACzB,QAAA,MAAM,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC;AAC/B,QAAA,MAAM,OAAO,GAAG,eAAe,CAAC,IAAI,CAAC;AACrC,QAAA,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC,GAAG,OAAO;AAC/C,IAAA,CAAC;AACH;;;;"}

package/lib/util/math.d.ts

@@ -1,22 +1,33 @@
 import { Graph } from '@antv/graphlib';
-import type { Matrix, Edge, Node, OutNode, Point } from '../types';
-export declare const floydWarshall: (adjMatrix: Matrix[]) => Matrix[];
-export declare const getAdjMatrix: (data: {
-    nodes: Node[];
-    edges: Edge[];
-}, directed: boolean) => Matrix[];
+import { Matrix } from '../types/common.js';
+import { NodeData } from '../types/data.js';
+import { PointObject } from '../types/point.js';
+import { GraphLib } from '../model/data.js';
+
+/**
+ * Floyd-Warshall algorithm to find shortest paths (but with no negative cycles).
+ */
+declare const floydWarshall: (adjMatrix: Matrix) => Matrix;
+/**
+ * Get the adjacency matrix of the graph model.
+ */
+declare const getAdjMatrix: (model: GraphLib, directed: boolean) => Matrix;
+/**
+ * Get the adjacency list of the graph model.
+ */
+declare const getAdjList: (model: GraphLib, directed: boolean) => Matrix;
 /**
  * scale matrix
  * @param matrix [ [], [], [] ]
  * @param ratio
  */
-export declare const scaleMatrix: (matrix: Matrix[], ratio: number) => Matrix[];
+declare const scaleMatrix: (matrix: Matrix, ratio: number) => any[];
 /**
  * calculate the bounding box for the nodes according to their x, y, and size
  * @param nodes nodes in the layout
  * @returns
  */
-export declare const getLayoutBBox: (nodes: OutNode[]) => {
+declare const getLayoutBBox: (nodes: NodeData[]) => {
     minX: number;
     minY: number;
     maxX: number;
@@ -28,7 +39,7 @@ export declare const getLayoutBBox: (nodes: OutNode[]) => {
  * @param p2
  * @returns
  */
-export declare const getEuclideanDistance: (p1: Point, p2: Point) => number;
+declare const getEuclideanDistance: (p1: PointObject, p2: PointObject) => number;
 /**
  * Depth first search begin from nodes in graphCore data.
  * @param graphCore graphlib data structure
@@ -37,7 +48,14 @@ export declare const getEuclideanDistance: (p1: Point, p2: Point) => number;
  * @param mode 'TB' - visit from top to bottom; 'BT' - visit from bottom to top;
  * @returns
  */
-export declare const graphTreeDfs: (graph: Graph<any, any>, nodes: Node[], fn: (n: Node) => void, mode: 'TB' | 'BT', treeKey: string, stopFns?: {
-    stopBranchFn?: (node: Node) => boolean;
-    stopAllFn?: (node: Node) => boolean;
+declare const graphTreeDfs: (graph: Graph<any, any>, nodes: NodeData[], fn: (n: NodeData) => void, mode: "TB" | "BT" | undefined, treeKey: string, stopFns?: {
+    stopBranchFn?: ((node: NodeData) => boolean) | undefined;
+    stopAllFn?: ((node: NodeData) => boolean) | undefined;
 }) => void;
+/**
+ * Use Johnson + Dijkstra to compute APSP for sparse graph.
+ * Fully compatible with floydWarshall(adjMatrix).
+ */
+declare function johnson(adjList: Matrix): Matrix;
+
+export { floydWarshall, getAdjList, getAdjMatrix, getEuclideanDistance, getLayoutBBox, graphTreeDfs, johnson, scaleMatrix };

package/lib/util/math.js

@@ -1,54 +1,56 @@
-import { isNumber } from '@antv/util';
-import { isArray } from './array';
-export const floydWarshall = (adjMatrix) => {
+import { isArray } from './array.js';
+import isNumber from '../node_modules/@antv/util/esm/lodash/is-number.js';
+
+/**
+ * Floyd-Warshall algorithm to find shortest paths (but with no negative cycles).
+ */
+const floydWarshall = (adjMatrix) => {
     // initialize
-    const dist = [];
-    const size = adjMatrix.length;
-    for (let i = 0; i < size; i += 1) {
-        dist[i] = [];
-        for (let j = 0; j < size; j += 1) {
-            if (i === j) {
-                dist[i][j] = 0;
-            }
-            else if (adjMatrix[i][j] === 0 || !adjMatrix[i][j]) {
-                dist[i][j] = Infinity;
-            }
-            else {
-                dist[i][j] = adjMatrix[i][j];
-            }
+    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 < size; k += 1) {
-        for (let i = 0; i < size; i += 1) {
-            for (let j = 0; j < size; j += 1) {
-                if (dist[i][j] > dist[i][k] + dist[k][j]) {
-                    dist[i][j] = dist[i][k] + dist[k][j];
+    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;
 };
-export const getAdjMatrix = (data, directed) => {
-    const { nodes, edges } = data;
-    const matrix = [];
+/**
+ * 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 = {};
-    if (!nodes) {
-        throw new Error('invalid nodes data!');
-    }
-    if (nodes) {
-        nodes.forEach((node, i) => {
-            nodeMap[node.id] = i;
-            const row = [];
-            matrix.push(row);
-        });
-    }
-    edges === null || edges === void 0 ? void 0 : edges.forEach((e) => {
-        const { source, target } = e;
-        const sIndex = nodeMap[source];
-        const tIndex = nodeMap[target];
+    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;
@@ -58,20 +60,46 @@ export const getAdjMatrix = (data, directed) => {
     });
     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
  */
-export const scaleMatrix = (matrix, ratio) => {
-    const result = [];
-    matrix.forEach((row) => {
-        const newRow = [];
-        row.forEach((v) => {
-            newRow.push(v * ratio);
-        });
-        result.push(newRow);
-    });
+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;
 };
 /**
@@ -79,7 +107,7 @@ export const scaleMatrix = (matrix, ratio) => {
  * @param nodes nodes in the layout
  * @returns
  */
-export const getLayoutBBox = (nodes) => {
+const getLayoutBBox = (nodes) => {
     let minX = Infinity;
     let minY = Infinity;
     let maxX = -Infinity;
@@ -90,12 +118,12 @@ export const getLayoutBBox = (nodes) => {
             if (size.length === 1)
                 size = [size[0], size[0]];
         }
-        else if (isNumber(size)) {
-            size = [size, size];
-        }
         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];
@@ -118,7 +146,7 @@ export const getLayoutBBox = (nodes) => {
  * @param p2
  * @returns
  */
-export const getEuclideanDistance = (p1, p2) => Math.sqrt((p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y));
+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
@@ -127,7 +155,7 @@ export const getEuclideanDistance = (p1, p2) => Math.sqrt((p1.x - p2.x) * (p1.x
  * @param mode 'TB' - visit from top to bottom; 'BT' - visit from bottom to top;
  * @returns
  */
-export const graphTreeDfs = (graph, nodes, fn, mode = 'TB', treeKey, stopFns = {}) => {
+const graphTreeDfs = (graph, nodes, fn, mode = 'TB', treeKey, stopFns = {}) => {
     if (!(nodes === null || nodes === void 0 ? void 0 : nodes.length))
         return;
     const { stopBranchFn, stopAllFn } = stopFns;
@@ -146,4 +174,99 @@ export const graphTreeDfs = (graph, nodes, fn, mode = 'TB', treeKey, stopFns = {
             fn(node); // Traverse from bottom to top
     }
 };
-//# sourceMappingURL=math.js.map
+/**
+ * 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/lib/util/math.js.map

@@ -1 +1 @@
-{"version":3,"file":"math.js","sourceRoot":"","sources":["../../src/util/math.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAEtC,OAAO,EAAE,OAAO,EAAE,MAAM,SAAS,CAAC;AAElC,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,SAAmB,EAAY,EAAE;IAC7D,aAAa;IACb,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,MAAM,IAAI,GAAG,SAAS,CAAC,MAAM,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE;QAChC,IAAI,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC;QACb,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE;YAChC,IAAI,CAAC,KAAK,CAAC,EAAE;gBACX,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;aAChB;iBAAM,IAAI,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;gBACpD,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC;aACvB;iBAAM;gBACL,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;aAC9B;SACF;KACF;IACD,QAAQ;IACR,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE;QAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE;gBAChC,IAAI,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE;oBACxC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;iBACtC;aACF;SACF;KACF;IACD,OAAO,IAAI,CAAC;AACd,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,YAAY,GAAG,CAC1B,IAAsC,EACtC,QAAiB,EACP,EAAE;IACZ,MAAM,EAAE,KAAK,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC;IAC9B,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,oCAAoC;IACpC,MAAM,OAAO,GAET,EAAE,CAAC;IAEP,IAAI,CAAC,KAAK,EAAE;QACV,MAAM,IAAI,KAAK,CAAC,qBAAqB,CAAC,CAAC;KACxC;IACD,IAAI,KAAK,EAAE;QACT,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;YACxB,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;YACrB,MAAM,GAAG,GAAa,EAAE,CAAC;YACzB,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnB,CAAC,CAAC,CAAC;KACJ;IAED,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QACnB,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,GAAG,CAAC,CAAC;QAC7B,MAAM,MAAM,GAAG,OAAO,CAAC,MAAgB,CAAC,CAAC;QACzC,MAAM,MAAM,GAAG,OAAO,CAAC,MAAgB,CAAC,CAAC;QACzC,IAAI,MAAM,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO;QACzD,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC3B,IAAI,CAAC,QAAQ,EAAE;YACb,MAAM,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;SAC5B;IACH,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,MAAgB,EAAE,KAAa,EAAE,EAAE;IAC7D,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;QACrB,MAAM,MAAM,GAAa,EAAE,CAAC;QAC5B,GAAG,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YAChB,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC;QACzB,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IACtB,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,MAAM,aAAa,GAAG,CAAC,KAAgB,EAAE,EAAE;IAChD,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,IAAI,IAAI,GAAG,QAAQ,CAAC;IACpB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;IACrB,IAAI,IAAI,GAAG,CAAC,QAAQ,CAAC;IACrB,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QACrB,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;QAC1B,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE;YACjB,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC;gBAAE,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;SAClD;aAAM,IAAI,QAAQ,CAAC,IAAI,CAAC,EAAE;YACzB,IAAI,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SACrB;aAAM,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,CAAC,IAAW,CAAC,EAAE;YACnD,IAAI,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;SACjB;QAED,MAAM,QAAQ,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACvC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACxC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,CAAC;QAEzC,IAAI,IAAI,GAAG,IAAI;YAAE,IAAI,GAAG,IAAI,CAAC;QAC7B,IAAI,IAAI,GAAG,GAAG;YAAE,IAAI,GAAG,GAAG,CAAC;QAC3B,IAAI,IAAI,GAAG,KAAK;YAAE,IAAI,GAAG,KAAK,CAAC;QAC/B,IAAI,IAAI,GAAG,MAAM;YAAE,IAAI,GAAG,MAAM,CAAC;IACnC,CAAC,CAAC,CAAC;IACH,OAAO,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,IAAI,EAAE,CAAC;AACpC,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAAC,EAAS,EAAE,EAAS,EAAE,EAAE,CAC3D,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AAE3E;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,YAAY,GAAG,CAC1B,KAAsB,EACtB,KAAa,EACb,EAAqB,EACrB,OAAoB,IAAI,EACxB,OAAe,EACf,UAGI,EAAE,EACN,EAAE;IACF,IAAI,CAAC,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,MAAM,CAAA;QAAE,OAAO;IAC3B,MAAM,EAAE,YAAY,EAAE,SAAS,EAAE,GAAG,OAAO,CAAC;IAC5C,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;QACrC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAS;QACtC,IAAI,YAAY,aAAZ,YAAY,uBAAZ,YAAY,CAAG,IAAI,CAAC;YAAE,SAAS,CAAC,mBAAmB;QACvD,IAAI,SAAS,aAAT,SAAS,uBAAT,SAAS,CAAG,IAAI,CAAC;YAAE,OAAO,CAAC,WAAW;QAC1C,IAAI,IAAI,KAAK,IAAI;YAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,8BAA8B;QAC3D,YAAY,CACV,KAAK,EACL,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,EACnC,EAAE,EACF,IAAI,EACJ,OAAO,EACP,OAAO,CACR,CAAC;QACF,IAAI,IAAI,KAAK,IAAI;YAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,8BAA8B;KAC5D;AACH,CAAC,CAAC"}
+{"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/lib/util/object.d.ts

@@ -1,9 +1,24 @@
-import { Edge, Node } from '../types';
-export declare const clone: <T>(target: T) => T;
 /**
- * Clone node or edge data and format it
- * @param target node/edge to be cloned
- * @param initRange whether init the x and y in data with the range, which means [xRange, yRange]
- * @returns cloned node/edge
+ * Get nested property value
+ * For example: getNestedValue(obj, 'a.b.c') will return obj.a.b.c
  */
-export declare const cloneFormatData: <T extends Node | Edge>(target: T, initRange?: [number, number]) => T;
+declare function getNestedValue<T>(obj: T, path: keyof T | string): any;
+/**
+ * Set nested property value
+ * For example: setNestedValue(obj, 'a.b.c', value) will set obj.a.b.c = value
+ */
+declare function setNestedValue<T>(obj: T, path: keyof T | string, value: any): void;
+/**
+ * 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 }
+ */
+declare function assignDefined<T extends object>(target: T, ...sources: Partial<T>[]): T;
+declare function mergeOptions<T extends object>(base: T, patch?: Partial<T>): T;
+
+export { assignDefined, getNestedValue, mergeOptions, setNestedValue };

package/lib/util/object.js

@@ -1,42 +1,48 @@
-import { isNumber } from '@antv/util';
-export const clone = (target) => {
-    if (target === null) {
-        return target;
-    }
-    if (target instanceof Date) {
-        return new Date(target.getTime());
-    }
-    if (target instanceof Array) {
-        const cp = [];
-        target.forEach((v) => {
-            cp.push(v);
-        });
-        return cp.map((n) => clone(n));
-    }
-    if (typeof target === 'object') {
-        const cp = {};
-        Object.keys(target).forEach((k) => {
-            cp[k] = clone(target[k]);
-        });
-        return cp;
-    }
-    return target;
-};
+import get from '../node_modules/@antv/util/esm/lodash/get.js';
+import set from '../node_modules/@antv/util/esm/lodash/set.js';
+
+/**
+ * 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);
+}
 /**
- * Clone node or edge data and format it
- * @param target node/edge to be cloned
- * @param initRange whether init the x and y in data with the range, which means [xRange, yRange]
- * @returns cloned node/edge
+ * Set nested property value
+ * For example: setNestedValue(obj, 'a.b.c', value) will set obj.a.b.c = value
  */
-export const cloneFormatData = (target, initRange) => {
-    const cloned = clone(target);
-    cloned.data = cloned.data || {};
-    if (initRange) {
-        if (!isNumber(cloned.data.x))
-            cloned.data.x = Math.random() * initRange[0];
-        if (!isNumber(cloned.data.y))
-            cloned.data.y = Math.random() * initRange[1];
-    }
-    return cloned;
-};
-//# sourceMappingURL=object.js.map
+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;
+}
+function mergeOptions(base, patch) {
+    return Object.assign({}, base, patch || {});
+}
+
+export { assignDefined, getNestedValue, mergeOptions, setNestedValue };
+//# sourceMappingURL=object.js.map

package/lib/util/object.js.map

@@ -1 +1 @@
-{"version":3,"file":"object.js","sourceRoot":"","sources":["../../src/util/object.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AAGtC,MAAM,CAAC,MAAM,KAAK,GAAG,CAAI,MAAS,EAAK,EAAE;IACvC,IAAI,MAAM,KAAK,IAAI,EAAE;QACnB,OAAO,MAAM,CAAC;KACf;IACD,IAAI,MAAM,YAAY,IAAI,EAAE;QAC1B,OAAO,IAAI,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAQ,CAAC;KAC1C;IACD,IAAI,MAAM,YAAY,KAAK,EAAE;QAC3B,MAAM,EAAE,GAAG,EAAW,CAAC;QACtB,MAAgB,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YAC9B,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACb,CAAC,CAAC,CAAC;QACH,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,CAAM,EAAE,EAAE,CAAC,KAAK,CAAM,CAAC,CAAC,CAAQ,CAAC;KACjD;IACD,IAAI,OAAO,MAAM,KAAK,QAAQ,EAAE;QAC9B,MAAM,EAAE,GAAG,EAA4B,CAAC;QACxC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YAChC,EAAE,CAAC,CAAC,CAAC,GAAG,KAAK,CAAO,MAAc,CAAC,CAAC,CAAC,CAAC,CAAC;QACzC,CAAC,CAAC,CAAC;QACH,OAAO,EAAO,CAAC;KAChB;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF;;;;;GAKG;AACH,MAAM,CAAC,MAAM,eAAe,GAAG,CAC7B,MAAS,EACT,SAA4B,EACzB,EAAE;IACL,MAAM,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;IAC7B,MAAM,CAAC,IAAI,GAAG,MAAM,CAAC,IAAI,IAAI,EAAE,CAAC;IAChC,IAAI,SAAS,EAAE;QACb,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;QAC3E,IAAI,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,MAAM,EAAE,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;KAC5E;IACD,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC"}
+{"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;AAEM,SAAU,YAAY,CAAmB,IAAO,EAAE,KAAkB,EAAA;AACxE,IAAA,OAAO,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,IAAI,EAAE,KAAK,IAAI,EAAE,CAAC;AAC7C;;;;"}

package/lib/util/order.d.ts

@@ -0,0 +1,20 @@
+import { NodeData, LayoutNode } from '../types/data.js';
+import { GraphLib } from '../model/data.js';
+
+type SortComparator<N extends NodeData = NodeData> = (nodeA: LayoutNode<N>, nodeB: LayoutNode<N>, nodes: LayoutNode<N>[]) => -1 | 0 | 1;
+declare function orderByDegree<N extends NodeData = NodeData>(model: GraphLib<N>): GraphLib<N>;
+/**
+ * 按 ID 排序
+ */
+declare function orderById<N extends NodeData = NodeData>(model: GraphLib<N>): GraphLib<N>;
+/**
+ * 按自定义比较函数排序
+ */
+declare function orderBySorter<N extends NodeData = NodeData>(model: GraphLib<N>, sorter: (a: NodeData, b: NodeData) => -1 | 0 | 1): GraphLib<N>;
+/**
+ * Order nodes according to graph topology
+ */
+declare function orderByTopology<N extends NodeData = NodeData>(model: GraphLib<N>, directed?: boolean): GraphLib<N>;
+
+export { orderByDegree, orderById, orderBySorter, orderByTopology };
+export type { SortComparator };