@antv/layout 1.2.13 → 1.2.14-beta.1

package/lib/antv-dagre.js

@@ -0,0 +1,538 @@
+import { __awaiter } from "tslib";
+import { Graph } from '@antv/graphlib';
+import { isNumber } from '@antv/util';
+import { layout } from './antv-dagre/layout';
+import { cloneFormatData, formatNodeSize, formatNumberFn } from './util';
+const DEFAULTS_LAYOUT_OPTIONS = {
+    rankdir: 'TB',
+    nodesep: 50,
+    ranksep: 50,
+    edgeLabelSpace: true,
+    ranker: 'tight-tree',
+    controlPoints: false,
+    radial: false,
+    focusNode: null, // radial 为 true 时生效，关注的节点
+};
+/**
+ * Layout arranging the nodes in a circle.
+ *
+ * @example
+ * // Assign layout options when initialization.
+ * const layout = new CircularLayout({ radius: 10 });
+ * const positions = await layout.execute(graph); // { nodes: [], edges: [] }
+ *
+ * // Or use different options later.
+ * const layout = new CircularLayout({ radius: 10 });
+ * const positions = await layout.execute(graph, { radius: 20 }); // { nodes: [], edges: [] }
+ *
+ * // If you want to assign the positions directly to the nodes, use assign method.
+ * await layout.assign(graph, { radius: 20 });
+ */
+export class AntVDagreLayout {
+    constructor(options = {}) {
+        this.options = options;
+        this.id = 'antv-dagre';
+        this.options = Object.assign(Object.assign({}, DEFAULTS_LAYOUT_OPTIONS), options);
+    }
+    /**
+     * Return the positions of nodes and edges(if needed).
+     */
+    execute(graph, options) {
+        return __awaiter(this, void 0, void 0, function* () {
+            return this.genericDagreLayout(false, graph, options);
+        });
+    }
+    /**
+     * To directly assign the positions to the nodes.
+     */
+    assign(graph, options) {
+        return __awaiter(this, void 0, void 0, function* () {
+            yield this.genericDagreLayout(true, graph, options);
+        });
+    }
+    genericDagreLayout(assign, graph, options) {
+        return __awaiter(this, void 0, void 0, function* () {
+            const mergedOptions = Object.assign(Object.assign({}, this.options), options);
+            const { nodeSize, align, rankdir = 'TB', ranksep, nodesep, ranksepFunc, nodesepFunc, edgeLabelSpace, ranker, nodeOrder, begin, controlPoints, radial, sortByCombo, 
+            // focusNode,
+            preset, } = mergedOptions;
+            const g = new Graph({
+                tree: [],
+            });
+            const ranksepfunc = formatNumberFn(ranksep || 50, ranksepFunc);
+            const nodesepfunc = formatNumberFn(nodesep || 50, nodesepFunc);
+            let horisep = nodesepfunc;
+            let vertisep = ranksepfunc;
+            if (rankdir === 'LR' || rankdir === 'RL') {
+                horisep = ranksepfunc;
+                vertisep = nodesepfunc;
+            }
+            const nodeSizeFunc = formatNodeSize(nodeSize, undefined);
+            // copy graph to g
+            const nodes = graph.getAllNodes();
+            const edges = graph.getAllEdges();
+            nodes.forEach((node) => {
+                const size = nodeSizeFunc(node);
+                const verti = vertisep(node);
+                const hori = horisep(node);
+                // FIXME: support 2 dimensions?
+                // const width = size[0] + 2 * hori;
+                // const height = size[1] + 2 * verti;
+                const width = size + 2 * hori;
+                const height = size + 2 * verti;
+                const layer = node.data.layer;
+                if (isNumber(layer)) {
+                    // 如果有layer属性，加入到node的label中
+                    g.addNode({
+                        id: node.id,
+                        data: { width, height, layer },
+                    });
+                }
+                else {
+                    g.addNode({
+                        id: node.id,
+                        data: { width, height },
+                    });
+                }
+            });
+            if (sortByCombo) {
+                g.attachTreeStructure('combo');
+                nodes.forEach((node) => {
+                    const { parentId } = node.data;
+                    if (parentId === undefined)
+                        return;
+                    if (g.hasNode(parentId)) {
+                        g.setParent(node.id, parentId, 'combo');
+                    }
+                });
+            }
+            edges.forEach((edge) => {
+                // dagrejs Wiki https://github.com/dagrejs/dagre/wiki#configuring-the-layout
+                g.addEdge({
+                    id: edge.id,
+                    source: edge.source,
+                    target: edge.target,
+                    data: {
+                        weight: edge.data.weight || 1,
+                    },
+                });
+            });
+            let prevGraph = undefined;
+            if (preset === null || preset === void 0 ? void 0 : preset.length) {
+                prevGraph = new Graph({
+                    nodes: preset,
+                });
+            }
+            layout(g, {
+                prevGraph,
+                edgeLabelSpace,
+                keepNodeOrder: !!nodeOrder,
+                nodeOrder: nodeOrder || [],
+                acyclicer: 'greedy',
+                ranker,
+                rankdir,
+                nodesep,
+                align,
+            });
+            const layoutTopLeft = [0, 0];
+            if (begin) {
+                let minX = Infinity;
+                let minY = Infinity;
+                g.getAllNodes().forEach((node) => {
+                    if (minX > node.data.x)
+                        minX = node.data.x;
+                    if (minY > node.data.y)
+                        minY = node.data.y;
+                });
+                g.getAllEdges().forEach((edge) => {
+                    var _a;
+                    (_a = edge.data.points) === null || _a === void 0 ? void 0 : _a.forEach((point) => {
+                        if (minX > point.x)
+                            minX = point.x;
+                        if (minY > point.y)
+                            minY = point.y;
+                    });
+                });
+                layoutTopLeft[0] = begin[0] - minX;
+                layoutTopLeft[1] = begin[1] - minY;
+            }
+            const isHorizontal = rankdir === 'LR' || rankdir === 'RL';
+            if (radial) {
+                // const focusId = (isString(focusNode) ? focusNode : focusNode?.id) as ID;
+                // const focusLayer = focusId ? g.getNode(focusId)?.data._rank as number : 0;
+                // const layers: any[] = [];
+                // const dim = isHorizontal ? "y" : "x";
+                // const sizeDim = isHorizontal ? "height" : "width";
+                // // 找到整个图作为环的坐标维度（dim）的最大、最小值，考虑节点宽度
+                // let min = Infinity;
+                // let max = -Infinity;
+                // g.getAllNodes().forEach((node) => {
+                //   const currentNodesep = nodesepfunc(node);
+                //   if (focusLayer === 0) {
+                //     if (!layers[node.data._rank!]) {
+                //       layers[node.data._rank!] = {
+                //         nodes: [],
+                //         totalWidth: 0,
+                //         maxSize: -Infinity,
+                //       };
+                //     }
+                //     layers[node.data._rank!].nodes.push(node);
+                //     layers[node.data._rank!].totalWidth += currentNodesep * 2 + node.data[sizeDim]!;
+                //     if (
+                //       layers[node.data._rank!].maxSize < Math.max(node.data.width!, node.data.height!)
+                //     ) {
+                //       layers[node.data._rank!].maxSize = Math.max(node.data.width!, node.data.height!);
+                //     }
+                //   } else {
+                //     const diffLayer = node.data._rank! - focusLayer!;
+                //     if (diffLayer === 0) {
+                //       if (!layers[diffLayer]) {
+                //         layers[diffLayer] = {
+                //           nodes: [],
+                //           totalWidth: 0,
+                //           maxSize: -Infinity,
+                //         };
+                //       }
+                //       layers[diffLayer].nodes.push(node);
+                //       layers[diffLayer].totalWidth += currentNodesep * 2 + node.data[sizeDim]!;
+                //       if (
+                //         layers[diffLayer].maxSize < Math.max(node.data.width!, node.data.height!)
+                //       ) {
+                //         layers[diffLayer].maxSize = Math.max(node.data.width!, node.data.height!);
+                //       }
+                //     } else {
+                //       const diffLayerAbs = Math.abs(diffLayer);
+                //       if (!layers[diffLayerAbs]) {
+                //         layers[diffLayerAbs] = {
+                //           left: [],
+                //           right: [],
+                //           totalWidth: 0,
+                //           maxSize: -Infinity,
+                //         };
+                //       }
+                //       layers[diffLayerAbs].totalWidth +=
+                //         currentNodesep * 2 + node.data[sizeDim]!;
+                //       if (
+                //         layers[diffLayerAbs].maxSize < Math.max(node.data.width!, node.data.height!)
+                //       ) {
+                //         layers[diffLayerAbs].maxSize = Math.max(
+                //           node.data.width!,
+                //           node.data.height!
+                //         );
+                //       }
+                //       if (diffLayer < 0) {
+                //         layers[diffLayerAbs].left.push(node);
+                //       } else {
+                //         layers[diffLayerAbs].right.push(node);
+                //       }
+                //     }
+                //   }
+                //   const leftPos = node.data[dim]! - node.data[sizeDim]! / 2 - currentNodesep;
+                //   const rightPos = node.data[dim]! + node.data[sizeDim]! / 2 + currentNodesep;
+                //   if (leftPos < min) min = leftPos;
+                //   if (rightPos > max) max = rightPos;
+                // });
+                // // const padding = (max - min) * 0.1; // TODO
+                // // 初始化为第一圈的半径，后面根据每层 ranksep 叠加
+                // let radius = ranksep || 50; // TODO;
+                // const radiusMap: any = {};
+                // // 扩大最大最小值范围，以便为环上留出接缝处的空隙
+                // const rangeLength = (max - min) / 0.9;
+                // const range = [
+                //   (min + max - rangeLength) * 0.5,
+                //   (min + max + rangeLength) * 0.5,
+                // ];
+                // // 根据半径、分布比例，计算节点在环上的位置，并返回该组节点中最大的 ranksep 值
+                // const processNodes = (
+                //   layerNodes: any,
+                //   radius: number,
+                //   propsMaxRanksep = -Infinity,
+                //   arcRange = [0, 1]
+                // ) => {
+                //   let maxRanksep = propsMaxRanksep;
+                //   layerNodes.forEach((node: any) => {
+                //     const coord = g.node(node);
+                //     radiusMap[node] = radius;
+                //     // 获取变形为 radial 后的直角坐标系坐标
+                //     const { x: newX, y: newY } = getRadialPos(
+                //       coord![dim]!,
+                //       range,
+                //       rangeLength,
+                //       radius,
+                //       arcRange
+                //     );
+                //     // 将新坐标写入源数据
+                //     const i = nodes.findIndex((it) => it.id === node);
+                //     if (!nodes[i]) return;
+                //     nodes[i].x = newX + dBegin[0];
+                //     nodes[i].y = newY + dBegin[1];
+                //     // @ts-ignore: pass layer order to data for increment layout use
+                //     nodes[i]._order = coord._order;
+                //     // 找到本层最大的一个 ranksep，作为下一层与本层的间隙，叠加到下一层的半径上
+                //     const currentNodeRanksep = ranksepfunc(nodes[i]);
+                //     if (maxRanksep < currentNodeRanksep) maxRanksep = currentNodeRanksep;
+                //   });
+                //   return maxRanksep;
+                // };
+                // let isFirstLevel = true;
+                // const lastLayerMaxNodeSize = 0;
+                // layers.forEach((layerNodes) => {
+                //   if (
+                //     !layerNodes?.nodes?.length &&
+                //     !layerNodes?.left?.length &&
+                //     !layerNodes?.right?.length
+                //   ) {
+                //     return;
+                //   }
+                //   // 第一层只有一个节点，直接放在圆心，初始半径设定为 0
+                //   if (isFirstLevel && layerNodes.nodes.length === 1) {
+                //     // 将新坐标写入源数据
+                //     const i = nodes.findIndex((it) => it.id === layerNodes.nodes[0]);
+                //     if (i <= -1) return;
+                //     nodes[i].x = dBegin[0];
+                //     nodes[i].y = dBegin[1];
+                //     radiusMap[layerNodes.nodes[0]] = 0;
+                //     radius = ranksepfunc(nodes[i]);
+                //     isFirstLevel = false;
+                //     return;
+                //   }
+                //   // 为接缝留出空隙，半径也需要扩大
+                //   radius = Math.max(radius, layerNodes.totalWidth / (2 * Math.PI)); // / 0.9;
+                //   let maxRanksep = -Infinity;
+                //   if (focusLayer === 0 || layerNodes.nodes?.length) {
+                //     maxRanksep = processNodes(
+                //       layerNodes.nodes,
+                //       radius,
+                //       maxRanksep,
+                //       [0, 1]
+                //     ); // 0.8
+                //   } else {
+                //     const leftRatio =
+                //       layerNodes.left?.length /
+                //       (layerNodes.left?.length + layerNodes.right?.length);
+                //     maxRanksep = processNodes(layerNodes.left, radius, maxRanksep, [
+                //       0,
+                //       leftRatio,
+                //     ]); // 接缝留出 0.05 的缝隙
+                //     maxRanksep = processNodes(layerNodes.right, radius, maxRanksep, [
+                //       leftRatio + 0.05,
+                //       1,
+                //     ]); // 接缝留出 0.05 的缝隙
+                //   }
+                //   radius += maxRanksep;
+                //   isFirstLevel = false;
+                //   lastLayerMaxNodeSize - layerNodes.maxSize;
+                // });
+                // g.edges().forEach((edge: any) => {
+                //   const coord = g.edge(edge);
+                //   const i = edges.findIndex((it) => {
+                //     const source = getEdgeTerminal(it, "source");
+                //     const target = getEdgeTerminal(it, "target");
+                //     return source === edge.v && target === edge.w;
+                //   });
+                //   if (i <= -1) return;
+                //   if (
+                //     self.edgeLabelSpace &&
+                //     self.controlPoints &&
+                //     edges[i].type !== "loop"
+                //   ) {
+                //     const otherDim = dim === "x" ? "y" : "x";
+                //     const controlPoints = coord?.points?.slice(
+                //       1,
+                //       coord.points.length - 1
+                //     );
+                //     const newControlPoints: Point[] = [];
+                //     const sourceOtherDimValue = g.node(edge.v)?.[otherDim]!;
+                //     const otherDimDist =
+                //       sourceOtherDimValue - g.node(edge.w)?.[otherDim]!;
+                //     const sourceRadius = radiusMap[edge.v];
+                //     const radiusDist = sourceRadius - radiusMap[edge.w];
+                //     controlPoints?.forEach((point: any) => {
+                //       // 根据该边的起点、终点半径，及起点、终点、控制点位置关系，确定该控制点的半径
+                //       const cRadius =
+                //         ((point[otherDim] - sourceOtherDimValue) / otherDimDist) *
+                //           radiusDist +
+                //         sourceRadius;
+                //       // 获取变形为 radial 后的直角坐标系坐标
+                //       const newPos = getRadialPos(
+                //         point[dim],
+                //         range,
+                //         rangeLength,
+                //         cRadius
+                //       );
+                //       newControlPoints.push({
+                //         x: newPos.x + dBegin[0],
+                //         y: newPos.y + dBegin[1],
+                //       });
+                //     });
+                //     edges[i].controlPoints = newControlPoints;
+                //   }
+                // });
+            }
+            else {
+                const layerCoords = new Set();
+                const isInvert = rankdir === 'BT' || rankdir === 'RL';
+                const layerCoordSort = isInvert
+                    ? (a, b) => b - a
+                    : (a, b) => a - b;
+                g.getAllNodes().forEach((node) => {
+                    // let ndata: any = this.nodeMap[node];
+                    // if (!ndata) {
+                    //   ndata = combos?.find((it) => it.id === node);
+                    // }
+                    // if (!ndata) return;
+                    // ndata.x = node.data.x! + dBegin[0];
+                    // ndata.y = node.data.y! + dBegin[1];
+                    // //  pass layer order to data for increment layout use
+                    // ndata._order = node.data._order;
+                    // layerCoords.add(isHorizontal ? ndata.x : ndata.y);
+                    node.data.x = node.data.x + layoutTopLeft[0];
+                    node.data.y = node.data.y + layoutTopLeft[1];
+                    layerCoords.add(isHorizontal ? node.data.x : node.data.y);
+                });
+                const layerCoordsArr = Array.from(layerCoords).sort(layerCoordSort);
+                // pre-define the isHorizontal related functions to avoid redundant calc in interations
+                const isDifferentLayer = isHorizontal
+                    ? (point1, point2) => point1.x !== point2.x
+                    : (point1, point2) => point1.y !== point2.y;
+                const filterControlPointsOutOfBoundary = isHorizontal
+                    ? (ps, point1, point2) => {
+                        const max = Math.max(point1.y, point2.y);
+                        const min = Math.min(point1.y, point2.y);
+                        return ps.filter((point) => point.y <= max && point.y >= min);
+                    }
+                    : (ps, point1, point2) => {
+                        const max = Math.max(point1.x, point2.x);
+                        const min = Math.min(point1.x, point2.x);
+                        return ps.filter((point) => point.x <= max && point.x >= min);
+                    };
+                g.getAllEdges().forEach((edge, i) => {
+                    var _a;
+                    // const i = edges.findIndex((it) => {
+                    //   return it.source === edge.source && it.target === edge.target;
+                    // });
+                    // if (i <= -1) return;
+                    if (edgeLabelSpace && controlPoints && edge.data.type !== 'loop') {
+                        edge.data.controlPoints = getControlPoints((_a = edge.data.points) === null || _a === void 0 ? void 0 : _a.map(({ x, y }) => ({
+                            x: x + layoutTopLeft[0],
+                            y: y + layoutTopLeft[1],
+                        })), g.getNode(edge.source), g.getNode(edge.target), layerCoordsArr, isHorizontal, isDifferentLayer, filterControlPointsOutOfBoundary);
+                    }
+                });
+            }
+            // calculated nodes as temporary result
+            let layoutNodes = [];
+            // layout according to the original order in the data.nodes
+            layoutNodes = g
+                .getAllNodes()
+                .map((node) => cloneFormatData(node));
+            const layoutEdges = g.getAllEdges();
+            if (assign) {
+                layoutNodes.forEach((node) => {
+                    graph.mergeNodeData(node.id, {
+                        x: node.data.x,
+                        y: node.data.y,
+                    });
+                });
+                layoutEdges.forEach((edge) => {
+                    graph.mergeEdgeData(edge.id, {
+                        controlPoints: edge.data.controlPoints,
+                    });
+                });
+            }
+            const result = {
+                nodes: layoutNodes,
+                edges: layoutEdges,
+            };
+            return result;
+        });
+    }
+}
+/**
+ * Format controlPoints to avoid polylines crossing nodes
+ * @param points
+ * @param sourceNode
+ * @param targetNode
+ * @param layerCoordsArr
+ * @param isHorizontal
+ * @returns
+ */
+const getControlPoints = (points, sourceNode, targetNode, layerCoordsArr, isHorizontal, isDifferentLayer, filterControlPointsOutOfBoundary) => {
+    let controlPoints = (points === null || points === void 0 ? void 0 : points.slice(1, points.length - 1)) || []; // 去掉头尾
+    // 酌情增加控制点，使折线不穿过跨层的节点
+    if (sourceNode && targetNode) {
+        let { x: sourceX, y: sourceY } = sourceNode.data;
+        let { x: targetX, y: targetY } = targetNode.data;
+        if (isHorizontal) {
+            sourceX = sourceNode.data.y;
+            sourceY = sourceNode.data.x;
+            targetX = targetNode.data.y;
+            targetY = targetNode.data.x;
+        }
+        // 为跨层级的边增加第一个控制点。忽略垂直的/横向的边。
+        // 新控制点 = {
+        //   x: 终点x,
+        //   y: (起点y + 下一层y) / 2,   #下一层y可能不等于终点y
+        // }
+        if (targetY !== sourceY && sourceX !== targetX) {
+            const sourceLayer = layerCoordsArr.indexOf(sourceY);
+            const sourceNextLayerCoord = layerCoordsArr[sourceLayer + 1];
+            if (sourceNextLayerCoord) {
+                const firstControlPoint = controlPoints[0];
+                const insertStartControlPoint = (isHorizontal
+                    ? {
+                        x: (sourceY + sourceNextLayerCoord) / 2,
+                        y: (firstControlPoint === null || firstControlPoint === void 0 ? void 0 : firstControlPoint.y) || targetX,
+                    }
+                    : {
+                        x: (firstControlPoint === null || firstControlPoint === void 0 ? void 0 : firstControlPoint.x) || targetX,
+                        y: (sourceY + sourceNextLayerCoord) / 2,
+                    });
+                // 当新增的控制点不存在（!=当前第一个控制点）时添加
+                if (!firstControlPoint ||
+                    isDifferentLayer(firstControlPoint, insertStartControlPoint)) {
+                    controlPoints.unshift(insertStartControlPoint);
+                }
+            }
+            const targetLayer = layerCoordsArr.indexOf(targetY);
+            const layerDiff = Math.abs(targetLayer - sourceLayer);
+            if (layerDiff === 1) {
+                controlPoints = filterControlPointsOutOfBoundary(controlPoints, sourceNode.data, targetNode.data);
+                // one controlPoint at least
+                if (!controlPoints.length) {
+                    controlPoints.push((isHorizontal
+                        ? {
+                            x: (sourceY + targetY) / 2,
+                            y: sourceX,
+                        }
+                        : {
+                            x: sourceX,
+                            y: (sourceY + targetY) / 2,
+                        }));
+                }
+            }
+            else if (layerDiff > 1) {
+                const targetLastLayerCoord = layerCoordsArr[targetLayer - 1];
+                if (targetLastLayerCoord) {
+                    const lastControlPoints = controlPoints[controlPoints.length - 1];
+                    const insertEndControlPoint = (isHorizontal
+                        ? {
+                            x: (targetY + targetLastLayerCoord) / 2,
+                            y: (lastControlPoints === null || lastControlPoints === void 0 ? void 0 : lastControlPoints.y) || targetX,
+                        }
+                        : {
+                            x: (lastControlPoints === null || lastControlPoints === void 0 ? void 0 : lastControlPoints.x) || sourceX,
+                            y: (targetY + targetLastLayerCoord) / 2,
+                        });
+                    // 当新增的控制点不存在（!=当前最后一个控制点）时添加
+                    if (!lastControlPoints ||
+                        isDifferentLayer(lastControlPoints, insertEndControlPoint)) {
+                        controlPoints.push(insertEndControlPoint);
+                    }
+                }
+            }
+        }
+    }
+    return controlPoints;
+};
+//# sourceMappingURL=antv-dagre.js.map

package/lib/antv-dagre.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"antv-dagre.js","sourceRoot":"","sources":["../src/antv-dagre.ts"],"names":[],"mappings":";AAAA,OAAO,EAAE,KAAK,EAAM,MAAM,gBAAgB,CAAC;AAC3C,OAAO,EAAE,QAAQ,EAAE,MAAM,YAAY,CAAC;AACtC,OAAO,EAAE,MAAM,EAAE,MAAM,qBAAqB,CAAC;AAc7C,OAAO,EAAE,eAAe,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,QAAQ,CAAC;AAqBzE,MAAM,uBAAuB,GAAoC;IAC/D,OAAO,EAAE,IAAI;IACb,OAAO,EAAE,EAAE;IACX,OAAO,EAAE,EAAE;IACX,cAAc,EAAE,IAAI;IACpB,MAAM,EAAE,YAAY;IACpB,aAAa,EAAE,KAAK;IACpB,MAAM,EAAE,KAAK;IACb,SAAS,EAAE,IAAI,EAAE,0BAA0B;CAC5C,CAAC;AAEF;;;;;;;;;;;;;;GAcG;AACH,MAAM,OAAO,eAAe;IAG1B,YAAmB,UAAkC,EAA4B;QAA9D,YAAO,GAAP,OAAO,CAAuD;QAFjF,OAAE,GAAG,YAAY,CAAC;QAGhB,IAAI,CAAC,OAAO,mCACP,uBAAuB,GACvB,OAAO,CACX,CAAC;IACJ,CAAC;IAED;;OAEG;IACG,OAAO,CAAC,KAAa,EAAE,OAAgC;;YAC3D,OAAO,IAAI,CAAC,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QACxD,CAAC;KAAA;IAED;;OAEG;IACG,MAAM,CAAC,KAAa,EAAE,OAAgC;;YAC1D,MAAM,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;QACtD,CAAC;KAAA;IAYa,kBAAkB,CAC9B,MAAe,EACf,KAAa,EACb,OAAgC;;YAEhC,MAAM,aAAa,mCAAQ,IAAI,CAAC,OAAO,GAAK,OAAO,CAAE,CAAC;YACtD,MAAM,EACJ,QAAQ,EACR,KAAK,EACL,OAAO,GAAG,IAAI,EACd,OAAO,EACP,OAAO,EACP,WAAW,EACX,WAAW,EACX,cAAc,EACd,MAAM,EACN,SAAS,EACT,KAAK,EACL,aAAa,EACb,MAAM,EACN,WAAW;YACX,aAAa;YACb,MAAM,GACP,GAAG,aAAa,CAAC;YAElB,MAAM,CAAC,GAAG,IAAI,KAAK,CAAqB;gBACtC,IAAI,EAAE,EAAE;aACT,CAAC,CAAC;YAEH,MAAM,WAAW,GAAG,cAAc,CAAC,OAAO,IAAI,EAAE,EAAE,WAAW,CAAC,CAAC;YAC/D,MAAM,WAAW,GAAG,cAAc,CAAC,OAAO,IAAI,EAAE,EAAE,WAAW,CAAC,CAAC;YAC/D,IAAI,OAAO,GAAqC,WAAW,CAAC;YAC5D,IAAI,QAAQ,GAAqC,WAAW,CAAC;YAC7D,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,EAAE;gBACxC,OAAO,GAAG,WAAW,CAAC;gBACtB,QAAQ,GAAG,WAAW,CAAC;aACxB;YACD,MAAM,YAAY,GAAG,cAAc,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;YAEzD,kBAAkB;YAClB,MAAM,KAAK,GAAW,KAAK,CAAC,WAAW,EAAE,CAAC;YAC1C,MAAM,KAAK,GAAW,KAAK,CAAC,WAAW,EAAE,CAAC;YAE1C,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;gBACrB,MAAM,IAAI,GAAG,YAAY,CAAC,IAAI,CAAC,CAAC;gBAChC,MAAM,KAAK,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC7B,MAAM,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,CAAC;gBAC3B,+BAA+B;gBAC/B,oCAAoC;gBACpC,sCAAsC;gBACtC,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,IAAI,CAAC;gBAC9B,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,GAAG,KAAK,CAAC;gBAChC,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC;gBAC9B,IAAI,QAAQ,CAAC,KAAK,CAAC,EAAE;oBACnB,4BAA4B;oBAC5B,CAAC,CAAC,OAAO,CAAC;wBACR,EAAE,EAAE,IAAI,CAAC,EAAE;wBACX,IAAI,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,KAAK,EAAE;qBAC/B,CAAC,CAAC;iBACJ;qBAAM;oBACL,CAAC,CAAC,OAAO,CAAC;wBACR,EAAE,EAAE,IAAI,CAAC,EAAE;wBACX,IAAI,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE;qBACxB,CAAC,CAAC;iBACJ;YACH,CAAC,CAAC,CAAC;YACH,IAAI,WAAW,EAAE;gBACf,CAAC,CAAC,mBAAmB,CAAC,OAAO,CAAC,CAAC;gBAC/B,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;oBACrB,MAAM,EAAE,QAAQ,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC;oBAC/B,IAAI,QAAQ,KAAK,SAAS;wBAAE,OAAO;oBACnC,IAAI,CAAC,CAAC,OAAO,CAAC,QAAc,CAAC,EAAE;wBAC7B,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,EAAE,QAAc,EAAE,OAAO,CAAC,CAAC;qBAC/C;gBACH,CAAC,CAAC,CAAC;aACJ;YAED,KAAK,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;gBACrB,4EAA4E;gBAC5E,CAAC,CAAC,OAAO,CAAC;oBACR,EAAE,EAAE,IAAI,CAAC,EAAE;oBACX,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,MAAM,EAAE,IAAI,CAAC,MAAM;oBACnB,IAAI,EAAE;wBACJ,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,CAAC;qBAC9B;iBACF,CAAC,CAAC;YACL,CAAC,CAAC,CAAC;YAEH,IAAI,SAAS,GAAuB,SAAS,CAAC;YAC9C,IAAI,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,MAAM,EAAE;gBAClB,SAAS,GAAG,IAAI,KAAK,CAAC;oBACpB,KAAK,EAAE,MAAM;iBACd,CAAC,CAAC;aACJ;YAED,MAAM,CAAC,CAAC,EAAE;gBACR,SAAS;gBACT,cAAc;gBACd,aAAa,EAAE,CAAC,CAAC,SAAS;gBAC1B,SAAS,EAAE,SAAS,IAAI,EAAE;gBAC1B,SAAS,EAAE,QAAQ;gBACnB,MAAM;gBACN,OAAO;gBACP,OAAO;gBACP,KAAK;aACN,CAAC,CAAC;YAEH,MAAM,aAAa,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC7B,IAAI,KAAK,EAAE;gBACT,IAAI,IAAI,GAAG,QAAQ,CAAC;gBACpB,IAAI,IAAI,GAAG,QAAQ,CAAC;gBACpB,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;oBAC/B,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAE;wBAAE,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC;oBAC7C,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAE;wBAAE,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC;gBAC/C,CAAC,CAAC,CAAC;gBACH,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;;oBAC/B,MAAA,IAAI,CAAC,IAAI,CAAC,MAAM,0CAAE,OAAO,CAAC,CAAC,KAAY,EAAE,EAAE;wBACzC,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC;4BAAE,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC;wBACnC,IAAI,IAAI,GAAG,KAAK,CAAC,CAAC;4BAAE,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC;oBACrC,CAAC,CAAC,CAAC;gBACL,CAAC,CAAC,CAAC;gBACH,aAAa,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;gBACnC,aAAa,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;aACpC;YAED,MAAM,YAAY,GAAG,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,CAAC;YAC1D,IAAI,MAAM,EAAE;gBACV,2EAA2E;gBAC3E,6EAA6E;gBAC7E,4BAA4B;gBAC5B,wCAAwC;gBACxC,qDAAqD;gBACrD,sCAAsC;gBACtC,sBAAsB;gBACtB,uBAAuB;gBACvB,sCAAsC;gBACtC,8CAA8C;gBAC9C,4BAA4B;gBAC5B,uCAAuC;gBACvC,qCAAqC;gBACrC,qBAAqB;gBACrB,yBAAyB;gBACzB,8BAA8B;gBAC9B,WAAW;gBACX,QAAQ;gBACR,iDAAiD;gBACjD,uFAAuF;gBACvF,WAAW;gBACX,yFAAyF;gBACzF,UAAU;gBACV,0FAA0F;gBAC1F,QAAQ;gBACR,aAAa;gBACb,wDAAwD;gBACxD,6BAA6B;gBAC7B,kCAAkC;gBAClC,gCAAgC;gBAChC,uBAAuB;gBACvB,2BAA2B;gBAC3B,gCAAgC;gBAChC,aAAa;gBACb,UAAU;gBACV,4CAA4C;gBAC5C,kFAAkF;gBAClF,aAAa;gBACb,oFAAoF;gBACpF,YAAY;gBACZ,qFAAqF;gBACrF,UAAU;gBACV,eAAe;gBACf,kDAAkD;gBAClD,qCAAqC;gBACrC,mCAAmC;gBACnC,sBAAsB;gBACtB,uBAAuB;gBACvB,2BAA2B;gBAC3B,gCAAgC;gBAChC,aAAa;gBACb,UAAU;gBACV,2CAA2C;gBAC3C,oDAAoD;gBACpD,aAAa;gBACb,uFAAuF;gBACvF,YAAY;gBACZ,mDAAmD;gBACnD,8BAA8B;gBAC9B,8BAA8B;gBAC9B,aAAa;gBACb,UAAU;gBACV,6BAA6B;gBAC7B,gDAAgD;gBAChD,iBAAiB;gBACjB,iDAAiD;gBACjD,UAAU;gBACV,QAAQ;gBACR,MAAM;gBACN,gFAAgF;gBAChF,iFAAiF;gBACjF,sCAAsC;gBACtC,wCAAwC;gBACxC,MAAM;gBACN,gDAAgD;gBAChD,kCAAkC;gBAClC,uCAAuC;gBACvC,6BAA6B;gBAC7B,6BAA6B;gBAC7B,yCAAyC;gBACzC,kBAAkB;gBAClB,qCAAqC;gBACrC,qCAAqC;gBACrC,KAAK;gBACL,gDAAgD;gBAChD,yBAAyB;gBACzB,qBAAqB;gBACrB,oBAAoB;gBACpB,iCAAiC;gBACjC,sBAAsB;gBACtB,SAAS;gBACT,sCAAsC;gBACtC,wCAAwC;gBACxC,kCAAkC;gBAClC,gCAAgC;gBAChC,gCAAgC;gBAChC,iDAAiD;gBACjD,sBAAsB;gBACtB,eAAe;gBACf,qBAAqB;gBACrB,gBAAgB;gBAChB,iBAAiB;gBACjB,SAAS;gBACT,mBAAmB;gBACnB,yDAAyD;gBACzD,6BAA6B;gBAC7B,qCAAqC;gBACrC,qCAAqC;gBACrC,uEAAuE;gBACvE,sCAAsC;gBACtC,kDAAkD;gBAClD,wDAAwD;gBACxD,4EAA4E;gBAC5E,QAAQ;gBACR,uBAAuB;gBACvB,KAAK;gBACL,2BAA2B;gBAC3B,kCAAkC;gBAClC,mCAAmC;gBACnC,SAAS;gBACT,oCAAoC;gBACpC,mCAAmC;gBACnC,iCAAiC;gBACjC,QAAQ;gBACR,cAAc;gBACd,MAAM;gBACN,kCAAkC;gBAClC,yDAAyD;gBACzD,mBAAmB;gBACnB,wEAAwE;gBACxE,2BAA2B;gBAC3B,8BAA8B;gBAC9B,8BAA8B;gBAC9B,0CAA0C;gBAC1C,sCAAsC;gBACtC,4BAA4B;gBAC5B,cAAc;gBACd,MAAM;gBACN,uBAAuB;gBACvB,gFAAgF;gBAChF,gCAAgC;gBAChC,wDAAwD;gBACxD,iCAAiC;gBACjC,0BAA0B;gBAC1B,gBAAgB;gBAChB,oBAAoB;gBACpB,eAAe;gBACf,gBAAgB;gBAChB,aAAa;gBACb,wBAAwB;gBACxB,kCAAkC;gBAClC,8DAA8D;gBAC9D,uEAAuE;gBACvE,WAAW;gBACX,mBAAmB;gBACnB,2BAA2B;gBAC3B,wEAAwE;gBACxE,0BAA0B;gBAC1B,WAAW;gBACX,2BAA2B;gBAC3B,MAAM;gBACN,0BAA0B;gBAC1B,0BAA0B;gBAC1B,+CAA+C;gBAC/C,MAAM;gBACN,qCAAqC;gBACrC,gCAAgC;gBAChC,wCAAwC;gBACxC,oDAAoD;gBACpD,oDAAoD;gBACpD,qDAAqD;gBACrD,QAAQ;gBACR,yBAAyB;gBACzB,SAAS;gBACT,6BAA6B;gBAC7B,4BAA4B;gBAC5B,+BAA+B;gBAC/B,QAAQ;gBACR,gDAAgD;gBAChD,kDAAkD;gBAClD,WAAW;gBACX,gCAAgC;gBAChC,SAAS;gBACT,4CAA4C;gBAC5C,+DAA+D;gBAC/D,2BAA2B;gBAC3B,2DAA2D;gBAC3D,8CAA8C;gBAC9C,2DAA2D;gBAC3D,+CAA+C;gBAC/C,iDAAiD;gBACjD,wBAAwB;gBACxB,qEAAqE;gBACrE,yBAAyB;gBACzB,wBAAwB;gBACxB,kCAAkC;gBAClC,qCAAqC;gBACrC,sBAAsB;gBACtB,iBAAiB;gBACjB,uBAAuB;gBACvB,kBAAkB;gBAClB,WAAW;gBACX,gCAAgC;gBAChC,mCAAmC;gBACnC,mCAAmC;gBACnC,YAAY;gBACZ,UAAU;gBACV,iDAAiD;gBACjD,MAAM;gBACN,MAAM;aACP;iBAAM;gBACL,MAAM,WAAW,GAAgB,IAAI,GAAG,EAAE,CAAC;gBAC3C,MAAM,QAAQ,GAAG,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,CAAC;gBACtD,MAAM,cAAc,GAAG,QAAQ;oBAC7B,CAAC,CAAC,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC;oBACjC,CAAC,CAAC,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;gBACpC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;oBAC/B,uCAAuC;oBACvC,gBAAgB;oBAChB,kDAAkD;oBAClD,IAAI;oBACJ,sBAAsB;oBACtB,sCAAsC;oBACtC,sCAAsC;oBACtC,wDAAwD;oBACxD,mCAAmC;oBACnC,qDAAqD;oBAErD,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAE,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;oBAC9C,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAE,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;oBAC9C,WAAW,CAAC,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;gBAC5D,CAAC,CAAC,CAAC;gBACH,MAAM,cAAc,GAAG,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC;gBAEpE,uFAAuF;gBACvF,MAAM,gBAAgB,GAAG,YAAY;oBACnC,CAAC,CAAC,CAAC,MAAa,EAAE,MAAa,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC;oBACzD,CAAC,CAAC,CAAC,MAAa,EAAE,MAAa,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC;gBAC5D,MAAM,gCAAgC,GAAG,YAAY;oBACnD,CAAC,CAAC,CAAC,EAAW,EAAE,MAAa,EAAE,MAAa,EAAE,EAAE;wBAC5C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;wBACzC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;wBACzC,OAAO,EAAE,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;oBAChE,CAAC;oBACH,CAAC,CAAC,CAAC,EAAW,EAAE,MAAa,EAAE,MAAa,EAAE,EAAE;wBAC5C,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;wBACzC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;wBACzC,OAAO,EAAE,CAAC,MAAM,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,IAAI,KAAK,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC;oBAChE,CAAC,CAAC;gBAEN,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE;;oBAClC,sCAAsC;oBACtC,mEAAmE;oBACnE,MAAM;oBACN,uBAAuB;oBACvB,IAAI,cAAc,IAAI,aAAa,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE;wBAChE,IAAI,CAAC,IAAI,CAAC,aAAa,GAAG,gBAAgB,CACxC,MAAA,IAAI,CAAC,IAAI,CAAC,MAAM,0CAAE,GAAG,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAS,EAAE,EAAE,CAAC,CAAC;4BAC1C,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC;4BACvB,CAAC,EAAE,CAAC,GAAG,aAAa,CAAC,CAAC,CAAC;yBACxB,CAAC,CAAC,EACH,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EACtB,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,EACtB,cAAc,EACd,YAAY,EACZ,gBAAgB,EAChB,gCAAgC,CACjC,CAAC;qBACH;gBACH,CAAC,CAAC,CAAC;aACJ;YAED,uCAAuC;YACvC,IAAI,WAAW,GAAc,EAAE,CAAC;YAChC,2DAA2D;YAC3D,WAAW,GAAG,CAAC;iBACZ,WAAW,EAAE;iBACb,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,eAAe,CAAC,IAAI,CAAY,CAAC,CAAC;YACnD,MAAM,WAAW,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC;YAEpC,IAAI,MAAM,EAAE;gBACV,WAAW,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;oBAC3B,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE;wBAC3B,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;wBACd,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;qBACf,CAAC,CAAC;gBACL,CAAC,CAAC,CAAC;gBACH,WAAW,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;oBAC3B,KAAK,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,EAAE;wBAC3B,aAAa,EAAE,IAAI,CAAC,IAAI,CAAC,aAAa;qBACvC,CAAC,CAAC;gBACL,CAAC,CAAC,CAAC;aACJ;YAED,MAAM,MAAM,GAAG;gBACb,KAAK,EAAE,WAAW;gBAClB,KAAK,EAAE,WAAW;aACnB,CAAC;YAEF,OAAO,MAAM,CAAC;QAChB,CAAC;KAAA;CACF;AAED;;;;;;;;GAQG;AACH,MAAM,gBAAgB,GAAG,CACvB,MAA2B,EAC3B,UAAgB,EAChB,UAAgB,EAChB,cAAwB,EACxB,YAAqB,EACrB,gBAA2D,EAC3D,gCAIY,EACZ,EAAE;IACF,IAAI,aAAa,GAAG,CAAA,MAAM,aAAN,MAAM,uBAAN,MAAM,CAAE,KAAK,CAAC,CAAC,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,KAAI,EAAE,CAAC,CAAC,OAAO;IACtE,sBAAsB;IACtB,IAAI,UAAU,IAAI,UAAU,EAAE;QAC5B,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC;QACjD,IAAI,EAAE,CAAC,EAAE,OAAO,EAAE,CAAC,EAAE,OAAO,EAAE,GAAG,UAAU,CAAC,IAAI,CAAC;QACjD,IAAI,YAAY,EAAE;YAChB,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;YAC5B,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;YAC5B,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;YAC5B,OAAO,GAAG,UAAU,CAAC,IAAI,CAAC,CAAC,CAAC;SAC7B;QACD,6BAA6B;QAC7B,WAAW;QACX,YAAY;QACZ,yCAAyC;QACzC,IAAI;QACJ,IAAI,OAAO,KAAK,OAAO,IAAI,OAAO,KAAK,OAAO,EAAE;YAC9C,MAAM,WAAW,GAAG,cAAc,CAAC,OAAO,CAAC,OAAQ,CAAC,CAAC;YACrD,MAAM,oBAAoB,GAAG,cAAc,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;YAC7D,IAAI,oBAAoB,EAAE;gBACxB,MAAM,iBAAiB,GAAG,aAAa,CAAC,CAAC,CAAC,CAAC;gBAC3C,MAAM,uBAAuB,GAAG,CAC9B,YAAY;oBACV,CAAC,CAAC;wBACE,CAAC,EAAE,CAAC,OAAQ,GAAG,oBAAoB,CAAC,GAAG,CAAC;wBACxC,CAAC,EAAE,CAAA,iBAAiB,aAAjB,iBAAiB,uBAAjB,iBAAiB,CAAE,CAAC,KAAI,OAAO;qBACnC;oBACH,CAAC,CAAC;wBACE,CAAC,EAAE,CAAA,iBAAiB,aAAjB,iBAAiB,uBAAjB,iBAAiB,CAAE,CAAC,KAAI,OAAO;wBAClC,CAAC,EAAE,CAAC,OAAQ,GAAG,oBAAoB,CAAC,GAAG,CAAC;qBACzC,CACG,CAAC;gBACX,4BAA4B;gBAC5B,IACE,CAAC,iBAAiB;oBAClB,gBAAgB,CAAC,iBAAiB,EAAE,uBAAuB,CAAC,EAC5D;oBACA,aAAa,CAAC,OAAO,CAAC,uBAAuB,CAAC,CAAC;iBAChD;aACF;YAED,MAAM,WAAW,GAAG,cAAc,CAAC,OAAO,CAAC,OAAQ,CAAC,CAAC;YACrD,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,WAAW,GAAG,WAAW,CAAC,CAAC;YACtD,IAAI,SAAS,KAAK,CAAC,EAAE;gBACnB,aAAa,GAAG,gCAAgC,CAC9C,aAAa,EACb,UAAU,CAAC,IAAa,EACxB,UAAU,CAAC,IAAa,CACzB,CAAC;gBACF,4BAA4B;gBAC5B,IAAI,CAAC,aAAa,CAAC,MAAM,EAAE;oBACzB,aAAa,CAAC,IAAI,CAChB,CAAC,YAAY;wBACX,CAAC,CAAC;4BACE,CAAC,EAAE,CAAC,OAAQ,GAAG,OAAQ,CAAC,GAAG,CAAC;4BAC5B,CAAC,EAAE,OAAO;yBACX;wBACH,CAAC,CAAC;4BACE,CAAC,EAAE,OAAO;4BACV,CAAC,EAAE,CAAC,OAAQ,GAAG,OAAQ,CAAC,GAAG,CAAC;yBAC7B,CAAU,CAChB,CAAC;iBACH;aACF;iBAAM,IAAI,SAAS,GAAG,CAAC,EAAE;gBACxB,MAAM,oBAAoB,GAAG,cAAc,CAAC,WAAW,GAAG,CAAC,CAAC,CAAC;gBAC7D,IAAI,oBAAoB,EAAE;oBACxB,MAAM,iBAAiB,GAAG,aAAa,CAAC,aAAa,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;oBAClE,MAAM,qBAAqB,GAAG,CAC5B,YAAY;wBACV,CAAC,CAAC;4BACE,CAAC,EAAE,CAAC,OAAQ,GAAG,oBAAoB,CAAC,GAAG,CAAC;4BACxC,CAAC,EAAE,CAAA,iBAAiB,aAAjB,iBAAiB,uBAAjB,iBAAiB,CAAE,CAAC,KAAI,OAAO;yBACnC;wBACH,CAAC,CAAC;4BACE,CAAC,EAAE,CAAA,iBAAiB,aAAjB,iBAAiB,uBAAjB,iBAAiB,CAAE,CAAC,KAAI,OAAO;4BAClC,CAAC,EAAE,CAAC,OAAQ,GAAG,oBAAoB,CAAC,GAAG,CAAC;yBACzC,CACG,CAAC;oBACX,6BAA6B;oBAC7B,IACE,CAAC,iBAAiB;wBAClB,gBAAgB,CAAC,iBAAiB,EAAE,qBAAqB,CAAC,EAC1D;wBACA,aAAa,CAAC,IAAI,CAAC,qBAAqB,CAAC,CAAC;qBAC3C;iBACF;aACF;SACF;KACF;IACD,OAAO,aAAa,CAAC;AACvB,CAAC,CAAC"}

package/lib/bundle-entry.d.ts

@@ -1,18 +1,2 @@
-/**
- * Use as entry for webpack bundle
- */
-export * from "./circular";
-export * from "./bundle-supervisor";
-export * from "./registry";
-export * from "./grid";
-export * from "./random";
-export * from "./mds";
-export * from "./concentric";
-export * from "./radial";
-export * from "./fruchterman";
-export * from "./d3Force";
-export * from "./force";
-export * from "./forceAtlas2";
-export * from "./dagre";
-export * from "./types";
-export * from "./util";
+export * from './bundle-supervisor';
+export * from './exports';

package/lib/bundle-entry.js

@@ -1,19 +1,3 @@
-/**
- * Use as entry for webpack bundle
- */
-export * from "./circular";
-export * from "./bundle-supervisor";
-export * from "./registry";
-export * from "./grid";
-export * from "./random";
-export * from "./mds";
-export * from "./concentric";
-export * from "./radial";
-export * from "./fruchterman";
-export * from "./d3Force";
-export * from "./force";
-export * from "./forceAtlas2";
-export * from "./dagre";
-export * from "./types";
-export * from "./util";
+export * from './bundle-supervisor';
+export * from './exports';
 //# sourceMappingURL=bundle-entry.js.map

package/lib/bundle-entry.js.map

@@ -1 +1 @@
-{"version":3,"file":"bundle-entry.js","sourceRoot":"","sources":["../src/bundle-entry.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,cAAc,YAAY,CAAC;AAC3B,cAAc,qBAAqB,CAAC;AACpC,cAAc,YAAY,CAAC;AAC3B,cAAc,QAAQ,CAAC;AACvB,cAAc,UAAU,CAAC;AACzB,cAAc,OAAO,CAAC;AACtB,cAAc,cAAc,CAAC;AAC7B,cAAc,UAAU,CAAC;AACzB,cAAc,eAAe,CAAC;AAC9B,cAAc,WAAW,CAAC;AAC1B,cAAc,SAAS,CAAC;AACxB,cAAc,eAAe,CAAC;AAC9B,cAAc,SAAS,CAAC;AACxB,cAAc,SAAS,CAAC;AACxB,cAAc,QAAQ,CAAC"}
+{"version":3,"file":"bundle-entry.js","sourceRoot":"","sources":["../src/bundle-entry.ts"],"names":[],"mappings":"AAAA,cAAc,qBAAqB,CAAC;AACpC,cAAc,WAAW,CAAC"}

package/lib/bundle-supervisor.d.ts

@@ -1,24 +1,7 @@
-import EventEmitter from "@antv/event-emitter";
-import { Graph, Node, Edge } from "@antv/graphlib";
-import type { Layout, LayoutSupervisor } from "./types";
-/**
- * The payload transferred from main thread to the worker.
- */
-export interface Payload {
-    layout: {
-        id: string;
-        options: any;
-        iterations: number;
-    };
-    nodes: Node<any>[];
-    edges: Edge<any>[];
-}
-interface SupervisorOptions {
-    /**
-     * Iterations run in algorithm such as d3force, will be passed in `tick()` later.
-     */
-    iterations: number;
-}
+import EventEmitter from '@antv/event-emitter';
+import { Graph } from '@antv/graphlib';
+import type { Layout, LayoutSupervisor } from './types';
+import type { SupervisorOptions } from './supervisor';
 /**
  * @example
  * const graph = new Graph();
@@ -48,4 +31,3 @@ export declare class Supervisor extends EventEmitter implements LayoutSupervisor
     kill(): void;
     isRunning(): boolean;
 }
-export {};