@antv/layout 1.2.13 → 1.2.14-beta.1

package/lib/{dagre → antv-dagre}/position/bk.d.ts

@@ -1,6 +1,7 @@
-import { ID, Node } from "@antv/graphlib";
-import { DagreAlign, Graph as IGraph, NodeData } from "../../types";
-declare type Conflicts = Record<ID, Record<ID, boolean>>;
+import { ID, Node } from '@antv/graphlib';
+import type { Graph as IGraph, NodeData } from '../../types';
+import type { DagreAlign } from '../types';
+type Conflicts = Record<ID, Record<ID, boolean>>;
 export declare const findType1Conflicts: (g: IGraph, layering?: ID[][]) => {};
 export declare const findType2Conflicts: (g: IGraph, layering?: ID[][]) => {};
 export declare const findOtherInnerSegmentNode: (g: IGraph, v: ID) => Node<NodeData>;
@@ -21,5 +22,5 @@ export declare const positionX: (g: IGraph, options?: Partial<{
     edgesep: number;
 }>) => Record<string, number>;
 export declare const sep: (nodeSep: number, edgeSep: number, reverseSep: boolean) => (g: IGraph, v: ID, w: ID) => number;
-export declare const width: (g: IGraph, v: ID) => number;
+export declare const width: (g: IGraph, v: ID) => any;
 export {};

package/lib/{dagre → antv-dagre}/position/bk.js

@@ -1,32 +1,31 @@
-import { __assign, __read, __spreadArray } from "tslib";
 /*
  * This module provides coordinate assignment based on Brandes and Köpf, "Fast
  * and Simple Horizontal Coordinate Assignment."
  */
-import { Graph } from "@antv/graphlib";
-import { buildLayerMatrix, minBy } from "../util";
-export var findType1Conflicts = function (g, layering) {
-    var conflicts = {};
-    var visitLayer = function (prevLayer, layer) {
+import { Graph } from '@antv/graphlib';
+import { buildLayerMatrix, minBy } from '../util';
+export const findType1Conflicts = (g, layering) => {
+    const conflicts = {};
+    const visitLayer = (prevLayer, layer) => {
         // last visited node in the previous layer that is incident on an inner
         // segment.
-        var k0 = 0;
+        let k0 = 0;
         // Tracks the last node in this layer scanned for crossings with a type-1
         // segment.
-        var scanPos = 0;
-        var prevLayerLength = prevLayer.length;
-        var lastNode = layer === null || layer === void 0 ? void 0 : layer[(layer === null || layer === void 0 ? void 0 : layer.length) - 1];
-        layer === null || layer === void 0 ? void 0 : layer.forEach(function (v, i) {
+        let scanPos = 0;
+        const prevLayerLength = prevLayer.length;
+        const lastNode = layer === null || layer === void 0 ? void 0 : layer[(layer === null || layer === void 0 ? void 0 : layer.length) - 1];
+        layer === null || layer === void 0 ? void 0 : layer.forEach((v, i) => {
             var _a;
-            var w = findOtherInnerSegmentNode(g, v);
-            var k1 = w ? g.getNode(w.id).data.order : prevLayerLength;
+            const w = findOtherInnerSegmentNode(g, v);
+            const k1 = w ? g.getNode(w.id).data.order : prevLayerLength;
             if (w || v === lastNode) {
-                (_a = layer.slice(scanPos, i + 1)) === null || _a === void 0 ? void 0 : _a.forEach(function (scanNode) {
+                (_a = layer.slice(scanPos, i + 1)) === null || _a === void 0 ? void 0 : _a.forEach((scanNode) => {
                     var _a;
-                    (_a = g.getPredecessors(scanNode)) === null || _a === void 0 ? void 0 : _a.forEach(function (u) {
+                    (_a = g.getPredecessors(scanNode)) === null || _a === void 0 ? void 0 : _a.forEach((u) => {
                         var _a;
-                        var uLabel = g.getNode(u.id);
-                        var uPos = uLabel.data.order;
+                        const uLabel = g.getNode(u.id);
+                        const uPos = uLabel.data.order;
                         if ((uPos < k0 || k1 < uPos) &&
                             !(uLabel.data.dummy && ((_a = g.getNode(scanNode)) === null || _a === void 0 ? void 0 : _a.data.dummy))) {
                             addConflict(conflicts, u.id, scanNode);
@@ -44,16 +43,16 @@ export var findType1Conflicts = function (g, layering) {
     }
     return conflicts;
 };
-export var findType2Conflicts = function (g, layering) {
-    var conflicts = {};
+export const findType2Conflicts = (g, layering) => {
+    const conflicts = {};
     function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {
         var _a, _b;
-        var v;
-        for (var i = southPos; i < southEnd; i++) {
+        let v;
+        for (let i = southPos; i < southEnd; i++) {
             v = south[i];
             if ((_a = g.getNode(v)) === null || _a === void 0 ? void 0 : _a.data.dummy) {
-                (_b = g.getPredecessors(v)) === null || _b === void 0 ? void 0 : _b.forEach(function (u) {
-                    var uNode = g.getNode(u.id);
+                (_b = g.getPredecessors(v)) === null || _b === void 0 ? void 0 : _b.forEach((u) => {
+                    const uNode = g.getNode(u.id);
                     if (uNode.data.dummy &&
                         (uNode.data.order < prevNorthBorder ||
                             uNode.data.order > nextNorthBorder)) {
@@ -68,21 +67,21 @@ export var findType2Conflicts = function (g, layering) {
         return JSON.stringify(params.slice(1));
     }
     function scanIfNeeded(params, scanCache) {
-        var cacheKey = getScannedKey(params);
+        const cacheKey = getScannedKey(params);
         if (scanCache.get(cacheKey))
             return;
-        scan.apply(void 0, __spreadArray([], __read(params)));
+        scan(...params);
         scanCache.set(cacheKey, true);
     }
-    var visitLayer = function (north, south) {
-        var prevNorthPos = -1;
-        var nextNorthPos;
-        var southPos = 0;
-        var scanned = new Map();
-        south === null || south === void 0 ? void 0 : south.forEach(function (v, southLookahead) {
+    const visitLayer = (north, south) => {
+        let prevNorthPos = -1;
+        let nextNorthPos;
+        let southPos = 0;
+        const scanned = new Map();
+        south === null || south === void 0 ? void 0 : south.forEach((v, southLookahead) => {
             var _a;
-            if (((_a = g.getNode(v)) === null || _a === void 0 ? void 0 : _a.data.dummy) === "border") {
-                var predecessors = g.getPredecessors(v) || [];
+            if (((_a = g.getNode(v)) === null || _a === void 0 ? void 0 : _a.data.dummy) === 'border') {
+                const predecessors = g.getPredecessors(v) || [];
                 if (predecessors.length) {
                     nextNorthPos = g.getNode(predecessors[0].id).data.order;
                     scanIfNeeded([south, southPos, southLookahead, prevNorthPos, nextNorthPos], scanned);
@@ -99,31 +98,31 @@ export var findType2Conflicts = function (g, layering) {
     }
     return conflicts;
 };
-export var findOtherInnerSegmentNode = function (g, v) {
+export const findOtherInnerSegmentNode = (g, v) => {
     var _a, _b;
     if ((_a = g.getNode(v)) === null || _a === void 0 ? void 0 : _a.data.dummy) {
-        return (_b = g.getPredecessors(v)) === null || _b === void 0 ? void 0 : _b.find(function (u) { return g.getNode(u.id).data.dummy; });
+        return (_b = g.getPredecessors(v)) === null || _b === void 0 ? void 0 : _b.find((u) => g.getNode(u.id).data.dummy);
     }
 };
-export var addConflict = function (conflicts, v, w) {
-    var vv = v;
-    var ww = w;
+export const addConflict = (conflicts, v, w) => {
+    let vv = v;
+    let ww = w;
     if (vv > ww) {
-        var tmp = vv;
+        const tmp = vv;
         vv = ww;
         ww = tmp;
     }
-    var conflictsV = conflicts[vv];
+    let conflictsV = conflicts[vv];
     if (!conflictsV) {
         conflicts[vv] = conflictsV = {};
     }
     conflictsV[ww] = true;
 };
-export var hasConflict = function (conflicts, v, w) {
-    var vv = v;
-    var ww = w;
+export const hasConflict = (conflicts, v, w) => {
+    let vv = v;
+    let ww = w;
     if (vv > ww) {
-        var tmp = v;
+        const tmp = v;
         vv = ww;
         ww = tmp;
     }
@@ -137,29 +136,29 @@ export var hasConflict = function (conflicts, v, w) {
  * we're trying to form a block with, we also ignore that possibility - our
  * blocks would be split in that scenario.
  */
-export var verticalAlignment = function (g, layering, conflicts, neighborFn) {
-    var root = {};
-    var align = {};
-    var pos = {};
+export const verticalAlignment = (g, layering, conflicts, neighborFn) => {
+    const root = {};
+    const align = {};
+    const pos = {};
     // We cache the position here based on the layering because the graph and
     // layering may be out of sync. The layering matrix is manipulated to
     // generate different extreme alignments.
-    layering === null || layering === void 0 ? void 0 : layering.forEach(function (layer) {
-        layer === null || layer === void 0 ? void 0 : layer.forEach(function (v, order) {
+    layering === null || layering === void 0 ? void 0 : layering.forEach((layer) => {
+        layer === null || layer === void 0 ? void 0 : layer.forEach((v, order) => {
             root[v] = v;
             align[v] = v;
             pos[v] = order;
         });
     });
-    layering === null || layering === void 0 ? void 0 : layering.forEach(function (layer) {
-        var prevIdx = -1;
-        layer === null || layer === void 0 ? void 0 : layer.forEach(function (v) {
-            var ws = neighborFn(v).map(function (n) { return n.id; });
+    layering === null || layering === void 0 ? void 0 : layering.forEach((layer) => {
+        let prevIdx = -1;
+        layer === null || layer === void 0 ? void 0 : layer.forEach((v) => {
+            let ws = neighborFn(v).map((n) => n.id);
             if (ws.length) {
-                ws = ws.sort(function (a, b) { return pos[a] - pos[b]; });
-                var mp = (ws.length - 1) / 2;
-                for (var i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {
-                    var w = ws[i];
+                ws = ws.sort((a, b) => pos[a] - pos[b]);
+                const mp = (ws.length - 1) / 2;
+                for (let i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {
+                    const w = ws[i];
                     if (align[v] === v &&
                         prevIdx < pos[w] &&
                         !hasConflict(conflicts, v, w)) {
@@ -171,22 +170,22 @@ export var verticalAlignment = function (g, layering, conflicts, neighborFn) {
             }
         });
     });
-    return { root: root, align: align };
+    return { root, align };
 };
-export var horizontalCompaction = function (g, layering, root, align, nodesep, edgesep, reverseSep) {
+export const horizontalCompaction = (g, layering, root, align, nodesep, edgesep, reverseSep) => {
     var _a;
     // This portion of the algorithm differs from BK due to a number of problems.
     // Instead of their algorithm we construct a new block graph and do two
     // sweeps. The first sweep places blocks with the smallest possible
     // coordinates. The second sweep removes unused space by moving blocks to the
     // greatest coordinates without violating separation.
-    var xs = {};
-    var blockG = buildBlockGraph(g, layering, root, nodesep, edgesep, reverseSep);
-    var borderType = reverseSep ? "borderLeft" : "borderRight";
-    var iterate = function (setXsFunc, nextNodesFunc) {
-        var stack = blockG.getAllNodes();
-        var elem = stack.pop();
-        var visited = {};
+    const xs = {};
+    const blockG = buildBlockGraph(g, layering, root, nodesep, edgesep, reverseSep);
+    const borderType = reverseSep ? 'borderLeft' : 'borderRight';
+    const iterate = (setXsFunc, nextNodesFunc) => {
+        let stack = blockG.getAllNodes();
+        let elem = stack.pop();
+        const visited = {};
         while (elem) {
             if (visited[elem.id]) {
                 setXsFunc(elem.id);
@@ -200,17 +199,17 @@ export var horizontalCompaction = function (g, layering, root, align, nodesep, e
         }
     };
     // First pass, assign smallest coordinates
-    var pass1 = function (elem) {
-        xs[elem] = (blockG.getRelatedEdges(elem, "in") || []).reduce(function (acc, e) {
+    const pass1 = (elem) => {
+        xs[elem] = (blockG.getRelatedEdges(elem, 'in') || []).reduce((acc, e) => {
             return Math.max(acc, (xs[e.source] || 0) + e.data.weight);
         }, 0);
     };
     // Second pass, assign greatest coordinates
-    var pass2 = function (elem) {
-        var min = (blockG.getRelatedEdges(elem, "out") || []).reduce(function (acc, e) {
+    const pass2 = (elem) => {
+        const min = (blockG.getRelatedEdges(elem, 'out') || []).reduce((acc, e) => {
             return Math.min(acc, (xs[e.target] || 0) - e.data.weight);
         }, Number.POSITIVE_INFINITY);
-        var node = g.getNode(elem);
+        const node = g.getNode(elem);
         if (min !== Number.POSITIVE_INFINITY &&
             node.data.borderType !== borderType) {
             xs[elem] = Math.max(xs[elem], min);
@@ -219,18 +218,18 @@ export var horizontalCompaction = function (g, layering, root, align, nodesep, e
     iterate(pass1, blockG.getPredecessors.bind(blockG));
     iterate(pass2, blockG.getSuccessors.bind(blockG));
     // Assign x coordinates to all nodes
-    (_a = Object.values(align)) === null || _a === void 0 ? void 0 : _a.forEach(function (v) {
+    (_a = Object.values(align)) === null || _a === void 0 ? void 0 : _a.forEach((v) => {
         xs[v] = xs[root[v]];
     });
     return xs;
 };
-export var buildBlockGraph = function (g, layering, root, nodesep, edgesep, reverseSep) {
-    var blockGraph = new Graph();
-    var sepFn = sep(nodesep, edgesep, reverseSep);
-    layering === null || layering === void 0 ? void 0 : layering.forEach(function (layer) {
-        var u;
-        layer === null || layer === void 0 ? void 0 : layer.forEach(function (v) {
-            var vRoot = root[v];
+export const buildBlockGraph = (g, layering, root, nodesep, edgesep, reverseSep) => {
+    const blockGraph = new Graph();
+    const sepFn = sep(nodesep, edgesep, reverseSep);
+    layering === null || layering === void 0 ? void 0 : layering.forEach((layer) => {
+        let u;
+        layer === null || layer === void 0 ? void 0 : layer.forEach((v) => {
+            const vRoot = root[v];
             if (!blockGraph.hasNode(vRoot)) {
                 blockGraph.addNode({
                     id: vRoot,
@@ -238,13 +237,13 @@ export var buildBlockGraph = function (g, layering, root, nodesep, edgesep, reve
                 });
             }
             if (u) {
-                var uRoot = root[u];
-                var edge = blockGraph
-                    .getRelatedEdges(uRoot, "out")
-                    .find(function (edge) { return edge.target === vRoot; });
+                const uRoot = root[u];
+                const edge = blockGraph
+                    .getRelatedEdges(uRoot, 'out')
+                    .find((edge) => edge.target === vRoot);
                 if (!edge) {
                     blockGraph.addEdge({
-                        id: "e" + Math.random(),
+                        id: `e${Math.random()}`,
                         source: uRoot,
                         target: vRoot,
                         data: {
@@ -253,7 +252,7 @@ export var buildBlockGraph = function (g, layering, root, nodesep, edgesep, reve
                     });
                 }
                 else {
-                    blockGraph.updateEdgeData(edge.id, __assign(__assign({}, edge.data), { weight: Math.max(sepFn(g, v, u), edge.data.weight || 0) }));
+                    blockGraph.updateEdgeData(edge.id, Object.assign(Object.assign({}, edge.data), { weight: Math.max(sepFn(g, v, u), edge.data.weight || 0) }));
                 }
             }
             u = v;
@@ -264,14 +263,14 @@ export var buildBlockGraph = function (g, layering, root, nodesep, edgesep, reve
 /*
  * Returns the alignment that has the smallest width of the given alignments.
  */
-export var findSmallestWidthAlignment = function (g, xss) {
-    return minBy(Object.values(xss), function (xs) {
+export const findSmallestWidthAlignment = (g, xss) => {
+    return minBy(Object.values(xss), (xs) => {
         var _a;
-        var max = Number.NEGATIVE_INFINITY;
-        var min = Number.POSITIVE_INFINITY;
-        (_a = Object.keys(xs)) === null || _a === void 0 ? void 0 : _a.forEach(function (v) {
-            var x = xs[v];
-            var halfWidth = width(g, v) / 2;
+        let max = Number.NEGATIVE_INFINITY;
+        let min = Number.POSITIVE_INFINITY;
+        (_a = Object.keys(xs)) === null || _a === void 0 ? void 0 : _a.forEach((v) => {
+            const x = xs[v];
+            const halfWidth = width(g, v) / 2;
             max = Math.max(x + halfWidth, max);
             min = Math.min(x - halfWidth, min);
         });
@@ -286,86 +285,84 @@ export var findSmallestWidthAlignment = function (g, xss) {
  * coordinate of the smallest width alignment.
  */
 export function alignCoordinates(xss, alignTo) {
-    var alignToVals = Object.values(alignTo);
-    var alignToMin = Math.min.apply(Math, __spreadArray([], __read(alignToVals)));
-    var alignToMax = Math.max.apply(Math, __spreadArray([], __read(alignToVals)));
-    ["u", "d"].forEach(function (vert) {
-        ["l", "r"].forEach(function (horiz) {
-            var alignment = vert + horiz;
-            var xs = xss[alignment];
-            var delta;
+    const alignToVals = Object.values(alignTo);
+    const alignToMin = Math.min(...alignToVals);
+    const alignToMax = Math.max(...alignToVals);
+    ['u', 'd'].forEach((vert) => {
+        ['l', 'r'].forEach((horiz) => {
+            const alignment = vert + horiz;
+            const xs = xss[alignment];
+            let delta;
             if (xs === alignTo)
                 return;
-            var xsVals = Object.values(xs);
+            const xsVals = Object.values(xs);
             delta =
-                horiz === "l"
-                    ? alignToMin - Math.min.apply(Math, __spreadArray([], __read(xsVals)))
-                    : alignToMax - Math.max.apply(Math, __spreadArray([], __read(xsVals)));
+                horiz === 'l'
+                    ? alignToMin - Math.min(...xsVals)
+                    : alignToMax - Math.max(...xsVals);
             if (delta) {
                 xss[alignment] = {};
-                Object.keys(xs).forEach(function (key) {
+                Object.keys(xs).forEach((key) => {
                     xss[alignment][key] = xs[key] + delta;
                 });
             }
         });
     });
 }
-export var balance = function (xss, align) {
-    var result = {};
-    Object.keys(xss.ul).forEach(function (key) {
+export const balance = (xss, align) => {
+    const result = {};
+    Object.keys(xss.ul).forEach((key) => {
         if (align) {
             result[key] = xss[align.toLowerCase()][key];
         }
         else {
-            var values = Object.values(xss).map(function (x) { return x[key]; });
+            const values = Object.values(xss).map((x) => x[key]);
             result[key] = (values[0] + values[1]) / 2; // (ur + ul) / 2
         }
     });
     return result;
 };
-export var positionX = function (g, options) {
-    var _a = options || {}, graphAlign = _a.align, _b = _a.nodesep, nodesep = _b === void 0 ? 0 : _b, _c = _a.edgesep, edgesep = _c === void 0 ? 0 : _c;
-    var layering = buildLayerMatrix(g);
-    var conflicts = Object.assign(findType1Conflicts(g, layering), findType2Conflicts(g, layering));
-    var xss = {};
-    var adjustedLayering;
-    ["u", "d"].forEach(function (vert) {
+export const positionX = (g, options) => {
+    const { align: graphAlign, nodesep = 0, edgesep = 0 } = options || {};
+    const layering = buildLayerMatrix(g);
+    const conflicts = Object.assign(findType1Conflicts(g, layering), findType2Conflicts(g, layering));
+    const xss = {};
+    let adjustedLayering;
+    ['u', 'd'].forEach((vert) => {
         adjustedLayering =
-            vert === "u" ? layering : Object.values(layering).reverse();
-        ["l", "r"].forEach(function (horiz) {
-            if (horiz === "r") {
-                adjustedLayering = adjustedLayering.map(function (inner) {
-                    return Object.values(inner).reverse();
-                });
+            vert === 'u' ? layering : Object.values(layering).reverse();
+        ['l', 'r'].forEach((horiz) => {
+            if (horiz === 'r') {
+                adjustedLayering = adjustedLayering.map((inner) => Object.values(inner).reverse());
             }
-            var neighborFn = (vert === "u" ? g.getPredecessors : g.getSuccessors).bind(g);
-            var align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);
-            var xs = horizontalCompaction(g, adjustedLayering, align.root, align.align, nodesep, edgesep, horiz === "r");
-            if (horiz === "r") {
-                Object.keys(xs).forEach(function (key) {
+            const neighborFn = (vert === 'u' ? g.getPredecessors : g.getSuccessors).bind(g);
+            const align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);
+            const xs = horizontalCompaction(g, adjustedLayering, align.root, align.align, nodesep, edgesep, horiz === 'r');
+            if (horiz === 'r') {
+                Object.keys(xs).forEach((key) => {
                     xs[key] = -xs[key];
                 });
             }
             xss[vert + horiz] = xs;
         });
     });
-    var smallestWidth = findSmallestWidthAlignment(g, xss);
+    const smallestWidth = findSmallestWidthAlignment(g, xss);
     alignCoordinates(xss, smallestWidth);
     return balance(xss, graphAlign);
 };
-export var sep = function (nodeSep, edgeSep, reverseSep) {
-    return function (g, v, w) {
-        var vLabel = g.getNode(v);
-        var wLabel = g.getNode(w);
-        var sum = 0;
-        var delta = 0;
+export const sep = (nodeSep, edgeSep, reverseSep) => {
+    return (g, v, w) => {
+        const vLabel = g.getNode(v);
+        const wLabel = g.getNode(w);
+        let sum = 0;
+        let delta = 0;
         sum += vLabel.data.width / 2;
-        if (vLabel.data.hasOwnProperty("labelpos")) {
-            switch ((vLabel.data.labelpos || "").toLowerCase()) {
-                case "l":
+        if (vLabel.data.hasOwnProperty('labelpos')) {
+            switch ((vLabel.data.labelpos || '').toLowerCase()) {
+                case 'l':
                     delta = -vLabel.data.width / 2;
                     break;
-                case "r":
+                case 'r':
                     delta = vLabel.data.width / 2;
                     break;
             }
@@ -378,11 +375,11 @@ export var sep = function (nodeSep, edgeSep, reverseSep) {
         sum += (wLabel.data.dummy ? edgeSep : nodeSep) / 2;
         sum += wLabel.data.width / 2;
         if (wLabel.data.labelpos) {
-            switch ((wLabel.data.labelpos || "").toLowerCase()) {
-                case "l":
+            switch ((wLabel.data.labelpos || '').toLowerCase()) {
+                case 'l':
                     delta = wLabel.data.width / 2;
                     break;
-                case "r":
+                case 'r':
                     delta = -wLabel.data.width / 2;
                     break;
             }
@@ -394,5 +391,5 @@ export var sep = function (nodeSep, edgeSep, reverseSep) {
         return sum;
     };
 };
-export var width = function (g, v) { return g.getNode(v).data.width || 0; };
+export const width = (g, v) => g.getNode(v).data.width || 0;
 //# sourceMappingURL=bk.js.map

package/lib/antv-dagre/position/bk.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bk.js","sourceRoot":"","sources":["../../../src/antv-dagre/position/bk.ts"],"names":[],"mappings":"AAAA;;;GAGG;AACH,OAAO,EAAE,KAAK,EAAY,MAAM,gBAAgB,CAAC;AAGjD,OAAO,EAAE,gBAAgB,EAAE,KAAK,EAAE,MAAM,SAAS,CAAC;AAsBlD,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAS,EAAE,QAAiB,EAAE,EAAE;IACjE,MAAM,SAAS,GAAG,EAAE,CAAC;IAErB,MAAM,UAAU,GAAG,CAAC,SAAe,EAAE,KAAW,EAAE,EAAE;QAClD,uEAAuE;QACvE,WAAW;QACX,IAAI,EAAE,GAAG,CAAC,CAAC;QACX,yEAAyE;QACzE,WAAW;QACX,IAAI,OAAO,GAAG,CAAC,CAAC;QAChB,MAAM,eAAe,GAAG,SAAS,CAAC,MAAM,CAAC;QACzC,MAAM,QAAQ,GAAG,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAG,CAAA,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,MAAM,IAAG,CAAC,CAAC,CAAC;QAE5C,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,CAAC,CAAK,EAAE,CAAS,EAAE,EAAE;;YAClC,MAAM,CAAC,GAAG,yBAAyB,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1C,MAAM,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,KAAM,CAAC,CAAC,CAAC,eAAe,CAAC;YAE9D,IAAI,CAAC,IAAI,CAAC,KAAK,QAAQ,EAAE;gBACvB,MAAA,KAAK,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,CAAC,0CAAE,OAAO,CAAC,CAAC,QAAQ,EAAE,EAAE;;oBAChD,MAAA,CAAC,CAAC,eAAe,CAAC,QAAQ,CAAC,0CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;;wBACzC,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;wBAChC,MAAM,IAAI,GAAG,MAAM,CAAC,IAAI,CAAC,KAAM,CAAC;wBAChC,IACE,CAAC,IAAI,GAAG,EAAE,IAAI,EAAE,GAAG,IAAI,CAAC;4BACxB,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,KAAI,MAAA,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,0CAAE,IAAI,CAAC,KAAK,CAAA,CAAC,EACvD;4BACA,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;yBACxC;oBACH,CAAC,CAAC,CAAC;gBACL,CAAC,CAAC,CAAC;gBACH,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC;gBAChB,EAAE,GAAG,EAAE,CAAC;aACT;QACH,CAAC,CAAC,CAAC;QAEH,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;IAEF,IAAI,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,MAAM,EAAE;QACpB,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;KAC7B;IACD,OAAO,SAAS,CAAC;AACnB,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,kBAAkB,GAAG,CAAC,CAAS,EAAE,QAAiB,EAAE,EAAE;IACjE,MAAM,SAAS,GAAG,EAAE,CAAC;IAErB,SAAS,IAAI,CACX,KAAe,EACf,QAAgB,EAChB,QAAgB,EAChB,eAAuB,EACvB,eAAuB;;QAEvB,IAAI,CAAS,CAAC;QACd,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE;YACxC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;YACb,IAAI,MAAA,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,0CAAE,IAAI,CAAC,KAAK,EAAE;gBAC5B,MAAA,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,0CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;oBAClC,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;oBAC/B,IACE,KAAK,CAAC,IAAI,CAAC,KAAK;wBAChB,CAAC,KAAK,CAAC,IAAI,CAAC,KAAM,GAAG,eAAe;4BAClC,KAAK,CAAC,IAAI,CAAC,KAAM,GAAG,eAAe,CAAC,EACtC;wBACA,WAAW,CAAC,SAAS,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;qBACjC;gBACH,CAAC,CAAC,CAAC;aACJ;SACF;IACH,CAAC;IAED,SAAS,aAAa,CAAC,MAA+B;QACpD,sBAAsB;QACtB,OAAO,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC;IAED,SAAS,YAAY,CACnB,MAA+B,EAC/B,SAA+B;QAE/B,MAAM,QAAQ,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC;QAEvC,IAAI,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC;YAAE,OAAO;QAEpC,IAAI,CAAC,GAAG,MAAM,CAAC,CAAC;QAChB,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;IAChC,CAAC;IAED,MAAM,UAAU,GAAG,CAAC,KAAe,EAAE,KAAe,EAAE,EAAE;QACtD,IAAI,YAAY,GAAG,CAAC,CAAC,CAAC;QACtB,IAAI,YAAoB,CAAC;QACzB,IAAI,QAAQ,GAAG,CAAC,CAAC;QAEjB,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;QAE3C,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,CAAC,CAAS,EAAE,cAAsB,EAAE,EAAE;;YACnD,IAAI,CAAA,MAAA,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,0CAAE,IAAI,CAAC,KAAK,MAAK,QAAQ,EAAE;gBACzC,MAAM,YAAY,GAAG,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;gBAChD,IAAI,YAAY,CAAC,MAAM,EAAE;oBACvB,YAAY,GAAG,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,KAAM,CAAC;oBAC1D,YAAY,CACV,CAAC,KAAK,EAAE,QAAQ,EAAE,cAAc,EAAE,YAAY,EAAE,YAAY,CAAC,EAC7D,OAAO,CACR,CAAC;oBACF,QAAQ,GAAG,cAAc,CAAC;oBAC1B,YAAY,GAAG,YAAY,CAAC;iBAC7B;aACF;YACD,YAAY,CACV,CAAC,KAAK,EAAE,QAAQ,EAAE,KAAK,CAAC,MAAM,EAAE,YAAY,EAAE,KAAK,CAAC,MAAM,CAAC,EAC3D,OAAO,CACR,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;IAEF,IAAI,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,MAAM,EAAE;QACpB,QAAQ,CAAC,MAAM,CAAC,UAAU,CAAC,CAAC;KAC7B;IACD,OAAO,SAAS,CAAC;AACnB,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,yBAAyB,GAAG,CAAC,CAAS,EAAE,CAAK,EAAE,EAAE;;IAC5D,IAAI,MAAA,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,0CAAE,IAAI,CAAC,KAAK,EAAE;QAC5B,OAAO,MAAA,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,0CAAE,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;KACtE;AACH,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,SAAoB,EAAE,CAAK,EAAE,CAAK,EAAE,EAAE;IAChE,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,EAAE,EAAE;QACX,MAAM,GAAG,GAAG,EAAE,CAAC;QACf,EAAE,GAAG,EAAE,CAAC;QACR,EAAE,GAAG,GAAG,CAAC;KACV;IAED,IAAI,UAAU,GAAG,SAAS,CAAC,EAAE,CAAC,CAAC;IAC/B,IAAI,CAAC,UAAU,EAAE;QACf,SAAS,CAAC,EAAE,CAAC,GAAG,UAAU,GAAG,EAAE,CAAC;KACjC;IACD,UAAU,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;AACxB,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,WAAW,GAAG,CAAC,SAAoB,EAAE,CAAK,EAAE,CAAK,EAAE,EAAE;IAChE,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,CAAC,CAAC;IACX,IAAI,EAAE,GAAG,EAAE,EAAE;QACX,MAAM,GAAG,GAAG,CAAC,CAAC;QACd,EAAE,GAAG,EAAE,CAAC;QACR,EAAE,GAAG,GAAG,CAAC;KACV;IACD,OAAO,CAAC,CAAC,SAAS,CAAC,EAAE,CAAC,CAAC;AACzB,CAAC,CAAC;AAEF;;;;;;;GAOG;AACH,MAAM,CAAC,MAAM,iBAAiB,GAAG,CAC/B,CAAS,EACT,QAAgB,EAChB,SAAoB,EACpB,UAAuC,EACvC,EAAE;IACF,MAAM,IAAI,GAAmB,EAAE,CAAC;IAChC,MAAM,KAAK,GAAmB,EAAE,CAAC;IACjC,MAAM,GAAG,GAAuB,EAAE,CAAC;IAEnC,yEAAyE;IACzE,qEAAqE;IACrE,yCAAyC;IACzC,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QAC1B,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,KAAa,EAAE,EAAE;YAClC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACZ,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YACb,GAAG,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;QACjB,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QAC1B,IAAI,OAAO,GAAG,CAAC,CAAC,CAAC;QACjB,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YACnB,IAAI,EAAE,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YAExC,IAAI,EAAE,CAAC,MAAM,EAAE;gBACb,EAAE,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAK,EAAE,CAAK,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;gBAChD,MAAM,EAAE,GAAG,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;gBAC/B,KAAK,IAAI,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,EAAE;oBAC7D,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;oBAChB,IACE,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;wBACd,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC;wBAChB,CAAC,WAAW,CAAC,SAAS,EAAE,CAAC,EAAE,CAAC,CAAC,EAC7B;wBACA,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;wBACb,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;wBAC7B,OAAO,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;qBAClB;iBACF;aACF;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;AACzB,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,oBAAoB,GAAG,CAClC,CAAS,EACT,QAAgB,EAChB,IAAoB,EACpB,KAAqB,EACrB,OAAe,EACf,OAAe,EACf,UAAoB,EACpB,EAAE;;IACF,6EAA6E;IAC7E,uEAAuE;IACvE,mEAAmE;IACnE,6EAA6E;IAC7E,qDAAqD;IACrD,MAAM,EAAE,GAAuB,EAAE,CAAC;IAClC,MAAM,MAAM,GAAG,eAAe,CAC5B,CAAC,EACD,QAAQ,EACR,IAAI,EACJ,OAAO,EACP,OAAO,EACP,UAAU,CACX,CAAC;IACF,MAAM,UAAU,GAAG,UAAU,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,aAAa,CAAC;IAE7D,MAAM,OAAO,GAAG,CACd,SAA8B,EAC9B,aAA4C,EAC5C,EAAE;QACF,IAAI,KAAK,GAAG,MAAM,CAAC,WAAW,EAAE,CAAC;QACjC,IAAI,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QACvB,MAAM,OAAO,GAAwB,EAAE,CAAC;QACxC,OAAO,IAAI,EAAE;YACX,IAAI,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE;gBACpB,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;aACpB;iBAAM;gBACL,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC;gBACxB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACjB,KAAK,GAAG,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;aAC9C;YAED,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;SACpB;IACH,CAAC,CAAC;IAEF,0CAA0C;IAC1C,MAAM,KAAK,GAAG,CAAC,IAAQ,EAAE,EAAE;QACzB,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,eAAe,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAC1D,CAAC,GAAW,EAAE,CAAC,EAAE,EAAE;YACjB,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC,CAAC;QAC7D,CAAC,EACD,CAAC,CACF,CAAC;IACJ,CAAC,CAAC;IAEF,2CAA2C;IAC3C,MAAM,KAAK,GAAG,CAAC,IAAQ,EAAE,EAAE;QACzB,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,eAAe,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAC5D,CAAC,GAAW,EAAE,CAAC,EAAE,EAAE;YACjB,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC,CAAC;QAC7D,CAAC,EACD,MAAM,CAAC,iBAAiB,CACzB,CAAC;QAEF,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAE,CAAC;QAC9B,IACE,GAAG,KAAK,MAAM,CAAC,iBAAiB;YAChC,IAAI,CAAC,IAAI,CAAC,UAAU,KAAK,UAAU,EACnC;YACA,EAAE,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,CAAC;SACpC;IACH,CAAC,CAAC;IAEF,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,eAAe,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IACpD,OAAO,CAAC,KAAK,EAAE,MAAM,CAAC,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;IAElD,oCAAoC;IACpC,MAAA,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,0CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;QAClC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACtB,CAAC,CAAC,CAAC;IAEH,OAAO,EAAE,CAAC;AACZ,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,eAAe,GAAG,CAC7B,CAAS,EACT,QAAgB,EAChB,IAAoB,EACpB,OAAe,EACf,OAAe,EACf,UAAoB,EACZ,EAAE;IACV,MAAM,UAAU,GAAG,IAAI,KAAK,EAAsB,CAAC;IACnD,MAAM,KAAK,GAAG,GAAG,CAAC,OAAO,EAAE,OAAO,EAAE,UAAqB,CAAC,CAAC;IAE3D,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QAC1B,IAAI,CAAK,CAAC;QACV,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE;YACnB,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;YACtB,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE;gBAC9B,UAAU,CAAC,OAAO,CAAC;oBACjB,EAAE,EAAE,KAAK;oBACT,IAAI,EAAE,EAAE;iBACT,CAAC,CAAC;aACJ;YACD,IAAI,CAAC,EAAE;gBACL,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;gBAEtB,MAAM,IAAI,GAAG,UAAU;qBACpB,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC;qBAC7B,IAAI,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,MAAM,KAAK,KAAK,CAAC,CAAC;gBACzC,IAAI,CAAC,IAAI,EAAE;oBACT,UAAU,CAAC,OAAO,CAAC;wBACjB,EAAE,EAAE,IAAI,IAAI,CAAC,MAAM,EAAE,EAAE;wBACvB,MAAM,EAAE,KAAK;wBACb,MAAM,EAAE,KAAK;wBACb,IAAI,EAAE;4BACJ,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;yBACpC;qBACF,CAAC,CAAC;iBACJ;qBAAM;oBACL,UAAU,CAAC,cAAc,CAAC,IAAI,CAAC,EAAE,kCAC5B,IAAI,CAAC,IAAI,KACZ,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,MAAO,IAAI,CAAC,CAAC,IACxD,CAAC;iBACJ;aACF;YACD,CAAC,GAAG,CAAC,CAAC;QACR,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,OAAO,UAAU,CAAC;AACpB,CAAC,CAAC;AACF;;GAEG;AACH,MAAM,CAAC,MAAM,0BAA0B,GAAG,CACxC,CAAS,EACT,GAA2C,EAC3C,EAAE;IACF,OAAO,KAAK,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE;;QACtC,IAAI,GAAG,GAAG,MAAM,CAAC,iBAAiB,CAAC;QACnC,IAAI,GAAG,GAAG,MAAM,CAAC,iBAAiB,CAAC;QAEnC,MAAA,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,0CAAE,OAAO,CAAC,CAAC,CAAS,EAAE,EAAE;YACrC,MAAM,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAChB,MAAM,SAAS,GAAG,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;YAElC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE,GAAG,CAAC,CAAC;YACnC,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,GAAG,SAAS,EAAE,GAAG,CAAC,CAAC;QACrC,CAAC,CAAC,CAAC;QAEH,OAAO,GAAG,GAAG,GAAG,CAAC;IACnB,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF;;;;;;GAMG;AACH,MAAM,UAAU,gBAAgB,CAC9B,GAA2C,EAC3C,OAA+B;IAE/B,MAAM,WAAW,GAAG,MAAM,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;IAC3C,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC;IAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC;IAE5C,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QAC1B,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;YAC3B,MAAM,SAAS,GAAG,IAAI,GAAG,KAAK,CAAC;YAC/B,MAAM,EAAE,GAAG,GAAG,CAAC,SAAS,CAAC,CAAC;YAC1B,IAAI,KAAa,CAAC;YAClB,IAAI,EAAE,KAAK,OAAO;gBAAE,OAAO;YAE3B,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;YACjC,KAAK;gBACH,KAAK,KAAK,GAAG;oBACX,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC;oBAClC,CAAC,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;YAEvC,IAAI,KAAK,EAAE;gBACT,GAAG,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC;gBACpB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;oBAC9B,GAAG,CAAC,SAAS,CAAC,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC;gBACxC,CAAC,CAAC,CAAC;aACJ;QACH,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;AACL,CAAC;AAED,MAAM,CAAC,MAAM,OAAO,GAAG,CACrB,GAA2C,EAC3C,KAAkB,EAClB,EAAE;IACF,MAAM,MAAM,GAA2B,EAAE,CAAC;IAC1C,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;QAClC,IAAI,KAAK,EAAE;YACT,MAAM,CAAC,GAAG,CAAC,GAAG,GAAG,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC;SAC7C;aAAM;YACL,MAAM,MAAM,GAAG,MAAM,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACrD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,gBAAgB;SAC5D;IACH,CAAC,CAAC,CAAC;IACH,OAAO,MAAM,CAAC;AAChB,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,SAAS,GAAG,CACvB,CAAS,EACT,OAIE,EACF,EAAE;IACF,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,GAAG,OAAO,IAAI,EAAE,CAAC;IAEtE,MAAM,QAAQ,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACrC,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAC7B,kBAAkB,CAAC,CAAC,EAAE,QAAQ,CAAC,EAC/B,kBAAkB,CAAC,CAAC,EAAE,QAAQ,CAAC,CAChC,CAAC;IAEF,MAAM,GAAG,GAAuC,EAAE,CAAC;IACnD,IAAI,gBAAwB,CAAC;IAC7B,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QAC1B,gBAAgB;YACd,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC;QAC9D,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;YAC3B,IAAI,KAAK,KAAK,GAAG,EAAE;gBACjB,gBAAgB,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAChD,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAC/B,CAAC;aACH;YAED,MAAM,UAAU,GAAG,CACjB,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CACnD,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACV,MAAM,KAAK,GAAG,iBAAiB,CAC7B,CAAC,EACD,gBAAgB,EAChB,SAAS,EACT,UAAU,CACX,CAAC;YACF,MAAM,EAAE,GAAG,oBAAoB,CAC7B,CAAC,EACD,gBAAgB,EAChB,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,KAAK,EACX,OAAO,EACP,OAAO,EACP,KAAK,KAAK,GAAG,CACd,CAAC;YACF,IAAI,KAAK,KAAK,GAAG,EAAE;gBACjB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,EAAE;oBAC9B,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC;gBACrB,CAAC,CAAC,CAAC;aACJ;YACD,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QACzB,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,MAAM,aAAa,GAAG,0BAA0B,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACzD,gBAAgB,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;IACrC,OAAO,OAAO,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;AAClC,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,GAAG,GAAG,CAAC,OAAe,EAAE,OAAe,EAAE,UAAmB,EAAE,EAAE;IAC3E,OAAO,CAAC,CAAS,EAAE,CAAK,EAAE,CAAK,EAAE,EAAE;QACjC,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC;QAC7B,IAAI,GAAG,GAAG,CAAC,CAAC;QACZ,IAAI,KAAK,GAAW,CAAC,CAAC;QAEtB,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC,CAAC;QAC9B,IAAI,MAAM,CAAC,IAAI,CAAC,cAAc,CAAC,UAAU,CAAC,EAAE;YAC1C,QAAQ,CAAE,MAAM,CAAC,IAAI,CAAC,QAAmB,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,EAAE;gBAC9D,KAAK,GAAG;oBACN,KAAK,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC,CAAC;oBAChC,MAAM;gBACR,KAAK,GAAG;oBACN,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC,CAAC;oBAC/B,MAAM;aACT;SACF;QACD,IAAI,KAAK,EAAE;YACT,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;SACpC;QACD,KAAK,GAAG,CAAC,CAAC;QAEV,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QACnD,GAAG,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;QAEnD,GAAG,IAAI,MAAM,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC,CAAC;QAC9B,IAAI,MAAM,CAAC,IAAI,CAAC,QAAQ,EAAE;YACxB,QAAQ,CAAE,MAAM,CAAC,IAAI,CAAC,QAAmB,IAAI,EAAE,CAAC,CAAC,WAAW,EAAE,EAAE;gBAC9D,KAAK,GAAG;oBACN,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC,CAAC;oBAC/B,MAAM;gBACR,KAAK,GAAG;oBACN,KAAK,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC,CAAC;oBAChC,MAAM;aACT;SACF;QACD,IAAI,KAAK,EAAE;YACT,GAAG,IAAI,UAAU,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC;SACpC;QACD,KAAK,GAAG,CAAC,CAAC;QAEV,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,CAAK,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE,CAAC,IAAI,CAAC,KAAM,IAAI,CAAC,CAAC"}

package/lib/{dagre → antv-dagre}/position/index.d.ts

@@ -1,4 +1,5 @@
-import { DagreAlign, Graph as IGraph } from "../../types";
+import type { Graph as IGraph } from '../../types';
+import type { DagreAlign } from '../types';
 export declare const position: (g: IGraph, options?: Partial<{
     align: DagreAlign;
     nodesep: number;

package/lib/antv-dagre/position/index.js

@@ -0,0 +1,51 @@
+import { asNonCompoundGraph, buildLayerMatrix } from '../util';
+import { alignCoordinates, balance, findSmallestWidthAlignment, findType1Conflicts, findType2Conflicts, horizontalCompaction, verticalAlignment, } from './bk';
+const positionY = (g, options) => {
+    const { ranksep = 0 } = options || {};
+    const layering = buildLayerMatrix(g);
+    let prevY = 0;
+    layering === null || layering === void 0 ? void 0 : layering.forEach((layer) => {
+        const heights = layer.map((v) => g.getNode(v).data.height);
+        const maxHeight = Math.max(...heights, 0);
+        layer === null || layer === void 0 ? void 0 : layer.forEach((v) => {
+            g.getNode(v).data.y = prevY + maxHeight / 2;
+        });
+        prevY += maxHeight + ranksep;
+    });
+};
+const positionX = (g, options) => {
+    const { align: graphAlign, nodesep = 0, edgesep = 0 } = options || {};
+    const layering = buildLayerMatrix(g);
+    const conflicts = Object.assign(findType1Conflicts(g, layering), findType2Conflicts(g, layering));
+    const xss = {};
+    let adjustedLayering = [];
+    ['u', 'd'].forEach((vert) => {
+        adjustedLayering =
+            vert === 'u' ? layering : Object.values(layering).reverse();
+        ['l', 'r'].forEach((horiz) => {
+            if (horiz === 'r') {
+                adjustedLayering = adjustedLayering.map((inner) => Object.values(inner).reverse());
+            }
+            const neighborFn = (vert === 'u' ? g.getPredecessors : g.getSuccessors).bind(g);
+            const align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);
+            const xs = horizontalCompaction(g, adjustedLayering, align.root, align.align, nodesep, edgesep, horiz === 'r');
+            if (horiz === 'r') {
+                Object.keys(xs).forEach((xsKey) => (xs[xsKey] = -xs[xsKey]));
+            }
+            xss[vert + horiz] = xs;
+        });
+    });
+    const smallestWidth = findSmallestWidthAlignment(g, xss);
+    smallestWidth && alignCoordinates(xss, smallestWidth);
+    return balance(xss, graphAlign);
+};
+export const position = (g, options) => {
+    var _a;
+    const ng = asNonCompoundGraph(g);
+    positionY(ng, options);
+    const xs = positionX(ng, options);
+    (_a = Object.keys(xs)) === null || _a === void 0 ? void 0 : _a.forEach((key) => {
+        ng.getNode(key).data.x = xs[key];
+    });
+};
+//# sourceMappingURL=index.js.map

package/lib/antv-dagre/position/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/antv-dagre/position/index.ts"],"names":[],"mappings":"AAGA,OAAO,EAAE,kBAAkB,EAAE,gBAAgB,EAAE,MAAM,SAAS,CAAC;AAC/D,OAAO,EACL,gBAAgB,EAChB,OAAO,EACP,0BAA0B,EAC1B,kBAAkB,EAClB,kBAAkB,EAClB,oBAAoB,EACpB,iBAAiB,GAClB,MAAM,MAAM,CAAC;AAEd,MAAM,SAAS,GAAG,CAChB,CAAS,EACT,OAEE,EACF,EAAE;IACF,MAAM,EAAE,OAAO,GAAG,CAAC,EAAE,GAAG,OAAO,IAAI,EAAE,CAAC;IACtC,MAAM,QAAQ,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;IAErC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,QAAQ,aAAR,QAAQ,uBAAR,QAAQ,CAAE,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;QAC1B,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAO,CAAC,CAAC;QAC5D,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,OAAO,EAAE,CAAC,CAAC,CAAC;QAC1C,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,OAAO,CAAC,CAAC,CAAS,EAAE,EAAE;YAC3B,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,KAAK,GAAG,SAAS,GAAG,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;QACH,KAAK,IAAI,SAAS,GAAG,OAAO,CAAC;IAC/B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC;AAEF,MAAM,SAAS,GAAG,CAChB,CAAS,EACT,OAIE,EACkB,EAAE;IACtB,MAAM,EAAE,KAAK,EAAE,UAAU,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,GAAG,CAAC,EAAE,GAAG,OAAO,IAAI,EAAE,CAAC;IAEtE,MAAM,QAAQ,GAAG,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACrC,MAAM,SAAS,GAAG,MAAM,CAAC,MAAM,CAC7B,kBAAkB,CAAC,CAAC,EAAE,QAAQ,CAAC,EAC/B,kBAAkB,CAAC,CAAC,EAAE,QAAQ,CAAC,CAChC,CAAC;IAEF,MAAM,GAAG,GAA2C,EAAE,CAAC;IACvD,IAAI,gBAAgB,GAAW,EAAE,CAAC;IAClC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,IAAI,EAAE,EAAE;QAC1B,gBAAgB;YACd,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,OAAO,EAAE,CAAC;QAC9D,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE;YAC3B,IAAI,KAAK,KAAK,GAAG,EAAE;gBACjB,gBAAgB,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAChD,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,EAAE,CAC/B,CAAC;aACH;YAED,MAAM,UAAU,GAAG,CACjB,IAAI,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC,CAAC,aAAa,CACnD,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACV,MAAM,KAAK,GAAG,iBAAiB,CAC7B,CAAC,EACD,gBAAgB,EAChB,SAAS,EACT,UAAU,CACX,CAAC;YACF,MAAM,EAAE,GAAG,oBAAoB,CAC7B,CAAC,EACD,gBAAgB,EAChB,KAAK,CAAC,IAAI,EACV,KAAK,CAAC,KAAK,EACX,OAAO,EACP,OAAO,EACP,KAAK,KAAK,GAAG,CACd,CAAC;YACF,IAAI,KAAK,KAAK,GAAG,EAAE;gBACjB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;aAC9D;YACD,GAAG,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QACzB,CAAC,CAAC,CAAC;IACL,CAAC,CAAC,CAAC;IAEH,MAAM,aAAa,GAAG,0BAA0B,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;IACzD,aAAa,IAAI,gBAAgB,CAAC,GAAG,EAAE,aAAa,CAAC,CAAC;IACtD,OAAO,OAAO,CAAC,GAAG,EAAE,UAAU,CAAC,CAAC;AAClC,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,QAAQ,GAAG,CACtB,CAAS,EACT,OAKE,EACF,EAAE;;IACF,MAAM,EAAE,GAAG,kBAAkB,CAAC,CAAC,CAAC,CAAC;IAEjC,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IACvB,MAAM,EAAE,GAAG,SAAS,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;IAClC,MAAA,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,0CAAE,OAAO,CAAC,CAAC,GAAO,EAAE,EAAE;QACnC,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC"}

package/lib/{dagre → antv-dagre}/rank/feasible-tree.d.ts

@@ -1,5 +1,5 @@
-import { Graph } from "@antv/graphlib";
-import { Graph as IGraph } from "../../types";
+import { Graph } from '@antv/graphlib';
+import { Graph as IGraph } from '../../types';
 declare const feasibleTree: (g: IGraph) => Graph<import("@antv/graphlib").PlainObject, import("@antv/graphlib").PlainObject>;
 declare const feasibleTreeWithLayer: (g: IGraph) => Graph<import("@antv/graphlib").PlainObject, import("@antv/graphlib").PlainObject>;
 export { feasibleTree, feasibleTreeWithLayer };