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

package/lib/algorithm/antv-dagre/layout.js

@@ -0,0 +1,471 @@
+import { run, undo as undo$2 } from './acyclic.js';
+import { addBorderSegments } from './add-border-segments.js';
+import { adjust, undo as undo$1 } from './coordinate-system.js';
+import { DagreGraph } from './graph.js';
+import { run as run$1, cleanup } from './nesting-graph.js';
+import { run as run$2, undo } from './normalize.js';
+import { order } from './order/index.js';
+import { initDataOrder } from './order/init-data-order.js';
+import { parentDummyChains } from './parent-dummy-chains.js';
+import { position } from './position/index.js';
+import { rank } from './rank/index.js';
+import { asNonCompoundGraph, removeEmptyRanks, normalizeRanks, addDummyNode, buildLayerMatrix, intersectRect } from './util.js';
+import isNil from '../../node_modules/@antv/util/esm/lodash/is-nil.js';
+
+// const graphNumAttrs = ["nodesep", "edgesep", "ranksep", "marginx", "marginy"];
+// const graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: "tb" };
+// const graphAttrs = ["acyclicer", "ranker", "rankdir", "align"];
+const layout = (g, options) => {
+    const { edgeLabelSpace, keepNodeOrder, prevGraph, rankdir, ranksep } = options;
+    // 如果在原图基础上修改，继承原图的order结果
+    if (!keepNodeOrder && prevGraph) {
+        inheritOrder(g, prevGraph);
+    }
+    const layoutGraph = buildLayoutGraph(g);
+    // 控制是否为边的label留位置（这会影响是否在边中间添加dummy node）
+    if (!!edgeLabelSpace) {
+        options.ranksep = makeSpaceForEdgeLabels(layoutGraph, {
+            rankdir,
+            ranksep,
+        });
+    }
+    let dimension;
+    // TODO: 暂时处理层级设置不正确时的异常报错，提示设置正确的层级
+    try {
+        dimension = runLayout(layoutGraph, options);
+    }
+    catch (e) {
+        if (e.message === 'Not possible to find intersection inside of the rectangle') {
+            console.error("The following error may be caused by improper layer setting, please make sure your manual layer setting does not violate the graph's structure:\n", e);
+            return;
+        }
+        throw e;
+    }
+    updateInputGraph(g, layoutGraph);
+    return dimension;
+};
+const runLayout = (g, options) => {
+    const { ranker, rankdir = 'tb', nodeOrder, keepNodeOrder, align, nodesep = 50, edgesep = 20, ranksep = 50, } = options;
+    removeSelfEdges(g);
+    run(g);
+    const { nestingRoot, nodeRankFactor } = run$1(g);
+    rank(asNonCompoundGraph(g), ranker);
+    injectEdgeLabelProxies(g);
+    removeEmptyRanks(g, nodeRankFactor);
+    cleanup(g, nestingRoot);
+    normalizeRanks(g);
+    assignRankMinMax(g);
+    removeEdgeLabelProxies(g);
+    const dummyChains = [];
+    run$2(g, dummyChains);
+    parentDummyChains(g, dummyChains);
+    addBorderSegments(g);
+    if (keepNodeOrder) {
+        initDataOrder(g, nodeOrder);
+    }
+    order(g, keepNodeOrder);
+    insertSelfEdges(g);
+    adjust(g, rankdir);
+    position(g, {
+        align,
+        nodesep,
+        edgesep,
+        ranksep,
+    });
+    positionSelfEdges(g);
+    removeBorderNodes(g);
+    undo(g, dummyChains);
+    fixupEdgeLabelCoords(g);
+    undo$1(g, rankdir);
+    const { width, height } = translateGraph(g);
+    assignNodeIntersects(g);
+    reversePointsForReversedEdges(g);
+    undo$2(g);
+    return { width, height };
+};
+/**
+ * 继承上一个布局中的order，防止翻转
+ * TODO: 暂时没有考虑涉及层级变动的布局，只保证原来布局层级和相对顺序不变
+ */
+const inheritOrder = (currG, prevG) => {
+    currG.getAllNodes().forEach((n) => {
+        const node = currG.getNode(n.id);
+        if (prevG.hasNode(n.id)) {
+            const prevNode = prevG.getNode(n.id);
+            node.data.fixorder = prevNode.data._order;
+            delete prevNode.data._order;
+        }
+        else {
+            delete node.data.fixorder;
+        }
+    });
+};
+/*
+ * Copies final layout information from the layout graph back to the input
+ * graph. This process only copies whitelisted attributes from the layout graph
+ * to the input graph, so it serves as a good place to determine what
+ * attributes can influence layout.
+ */
+const updateInputGraph = (inputGraph, layoutGraph) => {
+    inputGraph.getAllNodes().forEach((v) => {
+        var _a;
+        const inputLabel = inputGraph.getNode(v.id);
+        if (inputLabel) {
+            const layoutLabel = layoutGraph.getNode(v.id);
+            inputLabel.data.x = layoutLabel.data.x;
+            inputLabel.data.y = layoutLabel.data.y;
+            inputLabel.data._order = layoutLabel.data.order;
+            inputLabel.data._rank = layoutLabel.data.rank;
+            if ((_a = layoutGraph.getChildren(v.id)) === null || _a === void 0 ? void 0 : _a.length) {
+                inputLabel.data.width = layoutLabel.data.width;
+                inputLabel.data.height = layoutLabel.data.height;
+            }
+        }
+    });
+    inputGraph.getAllEdges().forEach((e) => {
+        const inputLabel = inputGraph.getEdge(e.id);
+        const layoutLabel = layoutGraph.getEdge(e.id);
+        inputLabel.data.points = layoutLabel ? layoutLabel.data.points : [];
+        if (layoutLabel && layoutLabel.data.hasOwnProperty('x')) {
+            inputLabel.data.x = layoutLabel.data.x;
+            inputLabel.data.y = layoutLabel.data.y;
+        }
+    });
+    // inputGraph.graph().width = layoutGraph.graph().width;
+    // inputGraph.graph().height = layoutGraph.graph().height;
+};
+const nodeNumAttrs = ['width', 'height', 'layer', 'fixorder']; // 需要传入layer, fixOrder作为参数参考
+const nodeDefaults = { width: 0, height: 0 };
+const edgeNumAttrs = ['minlen', 'weight', 'width', 'height', 'labeloffset'];
+const edgeDefaults = {
+    minlen: 1,
+    weight: 1,
+    width: 0,
+    height: 0,
+    labeloffset: 10,
+    labelpos: 'r',
+};
+const edgeAttrs = ['labelpos'];
+/*
+ * Constructs a new graph from the input graph, which can be used for layout.
+ * This process copies only whitelisted attributes from the input graph to the
+ * layout graph. Thus this function serves as a good place to determine what
+ * attributes can influence layout.
+ */
+const buildLayoutGraph = (inputGraph) => {
+    const g = new DagreGraph({ tree: [] });
+    inputGraph.getAllNodes().forEach((v) => {
+        const node = canonicalize(inputGraph.getNode(v.id).data);
+        const defaultNode = Object.assign(Object.assign({}, nodeDefaults), node);
+        const defaultAttrs = selectNumberAttrs(defaultNode, nodeNumAttrs);
+        if (!g.hasNode(v.id)) {
+            g.addNode({
+                id: v.id,
+                data: Object.assign({}, defaultAttrs),
+            });
+        }
+        const parent = inputGraph.hasTreeStructure('combo')
+            ? inputGraph.getParent(v.id, 'combo')
+            : inputGraph.getParent(v.id);
+        if (!isNil(parent)) {
+            if (!g.hasNode(parent.id)) {
+                g.addNode(Object.assign({}, parent));
+            }
+            g.setParent(v.id, parent.id);
+        }
+    });
+    inputGraph.getAllEdges().forEach((e) => {
+        const edge = canonicalize(inputGraph.getEdge(e.id).data);
+        const pickedProperties = {};
+        edgeAttrs === null || edgeAttrs === void 0 ? void 0 : edgeAttrs.forEach((key) => {
+            if (edge[key] !== undefined)
+                pickedProperties[key] = edge[key];
+        });
+        g.addEdge({
+            id: e.id,
+            source: e.source,
+            target: e.target,
+            data: Object.assign({}, edgeDefaults, selectNumberAttrs(edge, edgeNumAttrs), pickedProperties),
+        });
+    });
+    return g;
+};
+/*
+ * This idea comes from the Gansner paper: to account for edge labels in our
+ * layout we split each rank in half by doubling minlen and halving ranksep.
+ * Then we can place labels at these mid-points between nodes.
+ *
+ * We also add some minimal padding to the width to push the label for the edge
+ * away from the edge itself a bit.
+ */
+const makeSpaceForEdgeLabels = (g, options) => {
+    const { ranksep = 0, rankdir } = options;
+    g.getAllNodes().forEach((node) => {
+        if (!isNaN(node.data.layer)) {
+            if (!node.data.layer)
+                node.data.layer = 0;
+        }
+    });
+    g.getAllEdges().forEach((edge) => {
+        var _a;
+        edge.data.minlen *= 2;
+        if (((_a = edge.data.labelpos) === null || _a === void 0 ? void 0 : _a.toLowerCase()) !== 'c') {
+            if (rankdir === 'TB' || rankdir === 'BT') {
+                edge.data.width += edge.data.labeloffset;
+            }
+            else {
+                edge.data.height += edge.data.labeloffset;
+            }
+        }
+    });
+    return ranksep / 2;
+};
+/*
+ * Creates temporary dummy nodes that capture the rank in which each edge's
+ * label is going to, if it has one of non-zero width and height. We do this
+ * so that we can safely remove empty ranks while preserving balance for the
+ * label's position.
+ */
+const injectEdgeLabelProxies = (g) => {
+    g.getAllEdges().forEach((e) => {
+        if (e.data.width && e.data.height) {
+            const v = g.getNode(e.source);
+            const w = g.getNode(e.target);
+            const label = {
+                e,
+                rank: (w.data.rank - v.data.rank) / 2 + v.data.rank,
+            };
+            addDummyNode(g, 'edge-proxy', label, '_ep');
+        }
+    });
+};
+const assignRankMinMax = (g) => {
+    let maxRank = 0;
+    g.getAllNodes().forEach((node) => {
+        var _a, _b;
+        if (node.data.borderTop) {
+            node.data.minRank = (_a = g.getNode(node.data.borderTop)) === null || _a === void 0 ? void 0 : _a.data.rank;
+            node.data.maxRank = (_b = g.getNode(node.data.borderBottom)) === null || _b === void 0 ? void 0 : _b.data.rank;
+            maxRank = Math.max(maxRank, node.data.maxRank || -Infinity);
+        }
+    });
+    return maxRank;
+};
+const removeEdgeLabelProxies = (g) => {
+    g.getAllNodes().forEach((node) => {
+        if (node.data.dummy === 'edge-proxy') {
+            g.getEdge(node.data.e.id).data.labelRank = node.data.rank;
+            g.removeNode(node.id);
+        }
+    });
+};
+const translateGraph = (g, options) => {
+    let minX;
+    let maxX = 0;
+    let minY;
+    let maxY = 0;
+    const { marginx: marginX = 0, marginy: marginY = 0 } = {};
+    const getExtremes = (attrs) => {
+        if (!attrs.data)
+            return;
+        const x = attrs.data.x;
+        const y = attrs.data.y;
+        const w = attrs.data.width;
+        const h = attrs.data.height;
+        if (!isNaN(x) && !isNaN(w)) {
+            if (minX === undefined) {
+                minX = x - w / 2;
+            }
+            minX = Math.min(minX, x - w / 2);
+            maxX = Math.max(maxX, x + w / 2);
+        }
+        if (!isNaN(y) && !isNaN(h)) {
+            if (minY === undefined) {
+                minY = y - h / 2;
+            }
+            minY = Math.min(minY, y - h / 2);
+            maxY = Math.max(maxY, y + h / 2);
+        }
+    };
+    g.getAllNodes().forEach((v) => {
+        getExtremes(v);
+    });
+    g.getAllEdges().forEach((e) => {
+        if (e === null || e === void 0 ? void 0 : e.data.hasOwnProperty('x')) {
+            getExtremes(e);
+        }
+    });
+    minX -= marginX;
+    minY -= marginY;
+    g.getAllNodes().forEach((node) => {
+        node.data.x -= minX;
+        node.data.y -= minY;
+    });
+    g.getAllEdges().forEach((edge) => {
+        var _a;
+        (_a = edge.data.points) === null || _a === void 0 ? void 0 : _a.forEach((p) => {
+            p.x -= minX;
+            p.y -= minY;
+        });
+        if (edge.data.hasOwnProperty('x')) {
+            edge.data.x -= minX;
+        }
+        if (edge.data.hasOwnProperty('y')) {
+            edge.data.y -= minY;
+        }
+    });
+    return {
+        width: maxX - minX + marginX,
+        height: maxY - minY + marginY,
+    };
+};
+const assignNodeIntersects = (g) => {
+    g.getAllEdges().forEach((e) => {
+        const nodeV = g.getNode(e.source);
+        const nodeW = g.getNode(e.target);
+        let p1;
+        let p2;
+        if (!e.data.points) {
+            e.data.points = [];
+            p1 = { x: nodeW.data.x, y: nodeW.data.y };
+            p2 = { x: nodeV.data.x, y: nodeV.data.y };
+        }
+        else {
+            p1 = e.data.points[0];
+            p2 = e.data.points[e.data.points.length - 1];
+        }
+        e.data.points.unshift(intersectRect(nodeV.data, p1));
+        e.data.points.push(intersectRect(nodeW.data, p2));
+    });
+};
+const fixupEdgeLabelCoords = (g) => {
+    g.getAllEdges().forEach((edge) => {
+        if (edge.data.hasOwnProperty('x')) {
+            if (edge.data.labelpos === 'l' || edge.data.labelpos === 'r') {
+                edge.data.width -= edge.data.labeloffset;
+            }
+            switch (edge.data.labelpos) {
+                case 'l':
+                    edge.data.x -= edge.data.width / 2 + edge.data.labeloffset;
+                    break;
+                case 'r':
+                    edge.data.x += edge.data.width / 2 + edge.data.labeloffset;
+                    break;
+            }
+        }
+    });
+};
+const reversePointsForReversedEdges = (g) => {
+    g.getAllEdges().forEach((edge) => {
+        var _a;
+        if (edge.data.reversed) {
+            (_a = edge.data.points) === null || _a === void 0 ? void 0 : _a.reverse();
+        }
+    });
+};
+const removeBorderNodes = (g) => {
+    g.getAllNodes().forEach((v) => {
+        var _a, _b, _c;
+        if ((_a = g.getChildren(v.id)) === null || _a === void 0 ? void 0 : _a.length) {
+            const node = g.getNode(v.id);
+            const t = g.getNode(node.data.borderTop);
+            const b = g.getNode(node.data.borderBottom);
+            const l = g.getNode(node.data.borderLeft[((_b = node.data.borderLeft) === null || _b === void 0 ? void 0 : _b.length) - 1]);
+            const r = g.getNode(node.data.borderRight[((_c = node.data.borderRight) === null || _c === void 0 ? void 0 : _c.length) - 1]);
+            node.data.width = Math.abs((r === null || r === void 0 ? void 0 : r.data.x) - (l === null || l === void 0 ? void 0 : l.data.x)) || 10;
+            node.data.height = Math.abs((b === null || b === void 0 ? void 0 : b.data.y) - (t === null || t === void 0 ? void 0 : t.data.y)) || 10;
+            node.data.x = ((l === null || l === void 0 ? void 0 : l.data.x) || 0) + node.data.width / 2;
+            node.data.y = ((t === null || t === void 0 ? void 0 : t.data.y) || 0) + node.data.height / 2;
+        }
+    });
+    g.getAllNodes().forEach((n) => {
+        if (n.data.dummy === 'border') {
+            g.removeNode(n.id);
+        }
+    });
+};
+const removeSelfEdges = (g) => {
+    g.getAllEdges().forEach((e) => {
+        if (e.source === e.target) {
+            const node = g.getNode(e.source);
+            if (!node.data.selfEdges) {
+                node.data.selfEdges = [];
+            }
+            node.data.selfEdges.push(e);
+            g.removeEdge(e.id);
+        }
+    });
+};
+const insertSelfEdges = (g) => {
+    const layers = buildLayerMatrix(g);
+    layers === null || layers === void 0 ? void 0 : layers.forEach((layer) => {
+        let orderShift = 0;
+        layer === null || layer === void 0 ? void 0 : layer.forEach((v, i) => {
+            var _a;
+            const node = g.getNode(v);
+            node.data.order = i + orderShift;
+            (_a = node.data.selfEdges) === null || _a === void 0 ? void 0 : _a.forEach((selfEdge) => {
+                addDummyNode(g, 'selfedge', {
+                    width: selfEdge.data.width,
+                    height: selfEdge.data.height,
+                    rank: node.data.rank,
+                    order: i + ++orderShift,
+                    e: selfEdge,
+                }, '_se');
+            });
+            delete node.data.selfEdges;
+        });
+    });
+};
+const positionSelfEdges = (g) => {
+    g.getAllNodes().forEach((v) => {
+        const node = g.getNode(v.id);
+        if (node.data.dummy === 'selfedge') {
+            const selfNode = g.getNode(node.data.e.source);
+            const x = selfNode.data.x + selfNode.data.width / 2;
+            const y = selfNode.data.y;
+            const dx = node.data.x - x;
+            const dy = selfNode.data.height / 2;
+            if (g.hasEdge(node.data.e.id)) {
+                g.updateEdgeData(node.data.e.id, node.data.e.data);
+            }
+            else {
+                g.addEdge({
+                    id: node.data.e.id,
+                    source: node.data.e.source,
+                    target: node.data.e.target,
+                    data: node.data.e.data,
+                });
+            }
+            g.removeNode(v.id);
+            node.data.e.data.points = [
+                { x: x + (2 * dx) / 3, y: y - dy },
+                { x: x + (5 * dx) / 6, y: y - dy },
+                { y, x: x + dx },
+                { x: x + (5 * dx) / 6, y: y + dy },
+                { x: x + (2 * dx) / 3, y: y + dy },
+            ];
+            node.data.e.data.x = node.data.x;
+            node.data.e.data.y = node.data.y;
+        }
+    });
+};
+const selectNumberAttrs = (obj, attrs) => {
+    const pickedProperties = {};
+    attrs === null || attrs === void 0 ? void 0 : attrs.forEach((key) => {
+        if (obj[key] === undefined)
+            return;
+        pickedProperties[key] = +obj[key];
+    });
+    return pickedProperties;
+};
+const canonicalize = (attrs = {}) => {
+    const newAttrs = {};
+    Object.keys(attrs).forEach((k) => {
+        newAttrs[k.toLowerCase()] = attrs[k];
+    });
+    return newAttrs;
+};
+
+export { layout };
+//# sourceMappingURL=layout.js.map

package/lib/algorithm/antv-dagre/layout.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout.js","sources":["../../../src/algorithm/antv-dagre/src/algorithm/antv-dagre/layout.ts"],"sourcesContent":[null],"names":["runAcyclic","runNestingGraph","cleanupNestingGraph","runNormalize","adjustCoordinateSystem","undoNormalize","undoCoordinateSystem","undoAcyclic"],"mappings":";;;;;;;;;;;;;;AA8BA;AACA;AACA;MAEa,MAAM,GAAG,CACpB,CAAa,EACb,OAYC,KACC;AACF,IAAA,MAAM,EAAE,cAAc,EAAE,aAAa,EAAE,SAAS,EAAE,OAAO,EAAE,OAAO,EAAE,GAClE,OAAO;;AAGT,IAAA,IAAI,CAAC,aAAa,IAAI,SAAS,EAAE;AAC/B,QAAA,YAAY,CAAC,CAAC,EAAE,SAAS,CAAC;AAC3B,IAAA;AACD,IAAA,MAAM,WAAW,GAAG,gBAAgB,CAAC,CAAC,CAAC;;IAGvC,IAAI,CAAC,CAAC,cAAc,EAAE;AACpB,QAAA,OAAO,CAAC,OAAO,GAAG,sBAAsB,CAAC,WAAW,EAAE;YACpD,OAAO;YACP,OAAO;AACR,SAAA,CAAC;AACH,IAAA;AACD,IAAA,IAAI,SAAS;;IAEb,IAAI;AACF,QAAA,SAAS,GAAG,SAAS,CAAC,WAAW,EAAE,OAAO,CAAC;AAC5C,IAAA;AAAC,IAAA,OAAO,CAAM,EAAE;AACf,QAAA,IACE,CAAC,CAAC,OAAO,KAAK,2DAA2D,EACzE;AACA,YAAA,OAAO,CAAC,KAAK,CACX,mJAAmJ,EACnJ,CAAC,CACF;YACD;AACD,QAAA;AACD,QAAA,MAAM,CAAC;AACR,IAAA;AACD,IAAA,gBAAgB,CAAC,CAAC,EAAE,WAAW,CAAC;AAChC,IAAA,OAAO,SAAS;AAClB;AAEA,MAAM,SAAS,GAAG,CAChB,CAAa,EACb,OAUC,KACC;AACF,IAAA,MAAM,EAEJ,MAAM,EACN,OAAO,GAAG,IAAI,EACd,SAAS,EACT,aAAa,EACb,KAAK,EACL,OAAO,GAAG,EAAE,EACZ,OAAO,GAAG,EAAE,EACZ,OAAO,GAAG,EAAE,GACb,GAAG,OAAO;IAEX,eAAe,CAAC,CAAC,CAAC;AAElB,IAAAA,GAAU,CAAC,CAAY,CAAC;IAExB,MAAM,EAAE,WAAW,EAAE,cAAc,EAAE,GAAGC,KAAe,CAAC,CAAC,CAAC;IAE1D,IAAI,CAAC,kBAAkB,CAAC,CAAC,CAAC,EAAE,MAAM,CAAC;IAEnC,sBAAsB,CAAC,CAAC,CAAC;AAEzB,IAAA,gBAAgB,CAAC,CAAC,EAAE,cAAc,CAAC;AAEnC,IAAAC,OAAmB,CAAC,CAAC,EAAE,WAAW,CAAC;IAEnC,cAAc,CAAC,CAAC,CAAC;IAEjB,gBAAgB,CAAC,CAAC,CAAC;IAEnB,sBAAsB,CAAC,CAAC,CAAC;IAEzB,MAAM,WAAW,GAAS,EAAE;AAC5B,IAAAC,KAAY,CAAC,CAAC,EAAE,WAAW,CAAC;AAC5B,IAAA,iBAAiB,CAAC,CAAC,EAAE,WAAW,CAAC;IAEjC,iBAAiB,CAAC,CAAC,CAAC;AAEpB,IAAA,IAAI,aAAa,EAAE;AACjB,QAAA,aAAa,CAAC,CAAC,EAAE,SAAS,CAAC;AAC5B,IAAA;AAED,IAAA,KAAK,CAAC,CAAC,EAAE,aAAa,CAAC;IAEvB,eAAe,CAAC,CAAC,CAAC;AAElB,IAAAC,MAAsB,CAAC,CAAC,EAAE,OAAO,CAAC;IAElC,QAAQ,CAAC,CAAC,EAAE;QACV,KAAK;QACL,OAAO;QACP,OAAO;QACP,OAAO;AACR,KAAA,CAAC;IAEF,iBAAiB,CAAC,CAAC,CAAC;IAEpB,iBAAiB,CAAC,CAAC,CAAC;AAEpB,IAAAC,IAAa,CAAC,CAAC,EAAE,WAAW,CAAC;IAE7B,oBAAoB,CAAC,CAAC,CAAC;AAEvB,IAAAC,MAAoB,CAAC,CAAC,EAAE,OAAO,CAAC;IAEhC,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,cAAc,CAAC,CAAC,CAAC;IAE3C,oBAAoB,CAAC,CAAC,CAAC;IAEvB,6BAA6B,CAAC,CAAC,CAAC;IAEhCC,MAAW,CAAC,CAAC,CAAC;AAEd,IAAA,OAAO,EAAE,KAAK,EAAE,MAAM,EAAE;AAC1B,CAAC;AAED;;;AAGG;AACH,MAAM,YAAY,GAAG,CAAC,KAAiB,EAAE,KAAiB,KAAI;IAC5D,KAAK,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;QAChC,MAAM,IAAI,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE;QACjC,IAAI,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;YACvB,MAAM,QAAQ,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE;YACrC,IAAI,CAAC,IAAI,CAAC,QAAQ,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAgB;AACnD,YAAA,OAAO,QAAQ,CAAC,IAAI,CAAC,MAAM;AAC5B,QAAA;AAAM,aAAA;AACL,YAAA,OAAO,IAAI,CAAC,IAAI,CAAC,QAAQ;AAC1B,QAAA;AACH,IAAA,CAAC,CAAC;AACJ,CAAC;AAED;;;;;AAKG;AACH,MAAM,gBAAgB,GAAG,CAAC,UAAsB,EAAE,WAAuB,KAAI;IAC3E,UAAU,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;;QACrC,MAAM,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC;AAE3C,QAAA,IAAI,UAAU,EAAE;YACd,MAAM,WAAW,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE;YAC9C,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;YACtC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;YACtC,UAAU,CAAC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK;YAC/C,UAAU,CAAC,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI;YAE7C,IAAI,CAAA,EAAA,GAAA,WAAW,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,MAAM,EAAE;gBACzC,UAAU,CAAC,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,KAAK;gBAC9C,UAAU,CAAC,IAAI,CAAC,MAAM,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM;AACjD,YAAA;AACF,QAAA;AACH,IAAA,CAAC,CAAC;IAEF,UAAU,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;QACrC,MAAM,UAAU,GAAG,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE;QAC5C,MAAM,WAAW,GAAG,WAAW,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE;AAE9C,QAAA,UAAU,CAAC,IAAI,CAAC,MAAM,GAAG,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC,MAAM,GAAG,EAAE;QACnE,IAAI,WAAW,IAAI,WAAW,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YACvD,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;YACtC,UAAU,CAAC,IAAI,CAAC,CAAC,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;AACvC,QAAA;AACH,IAAA,CAAC,CAAC;;;AAIJ,CAAC;AAED,MAAM,YAAY,GAAG,CAAC,OAAO,EAAE,QAAQ,EAAE,OAAO,EAAE,UAAU,CAAC,CAAC;AAC9D,MAAM,YAAY,GAAG,EAAE,KAAK,EAAE,CAAC,EAAE,MAAM,EAAE,CAAC,EAAE;AAC5C,MAAM,YAAY,GAAG,CAAC,QAAQ,EAAE,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,aAAa,CAAC;AAC3E,MAAM,YAAY,GAAG;AACnB,IAAA,MAAM,EAAE,CAAC;AACT,IAAA,MAAM,EAAE,CAAC;AACT,IAAA,KAAK,EAAE,CAAC;AACR,IAAA,MAAM,EAAE,CAAC;AACT,IAAA,WAAW,EAAE,EAAE;AACf,IAAA,QAAQ,EAAE,GAAG;CACd;AACD,MAAM,SAAS,GAAG,CAAC,UAAU,CAAC;AAE9B;;;;;AAKG;AACH,MAAM,gBAAgB,GAAG,CAAC,UAAsB,KAAI;IAClD,MAAM,CAAC,GAAG,IAAI,UAAU,CAAC,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;IACtC,UAAU,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;AACrC,QAAA,MAAM,IAAI,GAAG,YAAY,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;AACxD,QAAA,MAAM,WAAW,GAAG,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EACf,YAAY,CAAA,EACZ,IAAI,CACI;QACb,MAAM,YAAY,GAAG,iBAAiB,CAAC,WAAW,EAAE,YAAY,CAAS;QAEzE,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE;YACpB,CAAC,CAAC,OAAO,CAAC;gBACR,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,IAAI,EAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EACC,YAAY,CAChB;AACF,aAAA,CAAC;AACH,QAAA;AAED,QAAA,MAAM,MAAM,GAAG,UAAU,CAAC,gBAAgB,CAAC,OAAO;cAC9C,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,OAAO;cAClC,UAAU,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,CAAC;AAC9B,QAAA,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,EAAE;YAClB,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE;AACzB,gBAAA,CAAC,CAAC,OAAO,CAAA,MAAA,CAAA,MAAA,CAAA,EAAA,EAAM,MAAM,EAAG;AACzB,YAAA;YACD,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE,EAAE,MAAM,CAAC,EAAE,CAAC;AAC7B,QAAA;AACH,IAAA,CAAC,CAAC;IAEF,UAAU,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;AACrC,QAAA,MAAM,IAAI,GAAG,YAAY,CAAC,UAAU,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC;QAExD,MAAM,gBAAgB,GAAQ,EAAE;QAChC,SAAS,KAAA,IAAA,IAAT,SAAS,KAAA,MAAA,GAAA,MAAA,GAAT,SAAS,CAAE,OAAO,CAAC,CAAC,GAAG,KAAI;AACzB,YAAA,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,SAAS;gBAAE,gBAAgB,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC;AAChE,QAAA,CAAC,CAAC;QAEF,CAAC,CAAC,OAAO,CAAC;YACR,EAAE,EAAE,CAAC,CAAC,EAAE;YACR,MAAM,EAAE,CAAC,CAAC,MAAM;YAChB,MAAM,EAAE,CAAC,CAAC,MAAM;AAChB,YAAA,IAAI,EAAE,MAAM,CAAC,MAAM,CACjB,EAAE,EACF,YAAY,EACZ,iBAAiB,CAAC,IAAI,EAAE,YAAY,CAAC,EACrC,gBAAgB,CACjB;AACF,SAAA,CAAC;AACJ,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,CAAC;AACV,CAAC;AAED;;;;;;;AAOG;AACH,MAAM,sBAAsB,GAAG,CAC7B,CAAa,EACb,OAGC,KACC;IACF,MAAM,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,EAAE,GAAG,OAAO;IACxC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,KAAI;QAC/B,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAM,CAAC,EAAE;AAC5B,YAAA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK;AAAE,gBAAA,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC;AAC1C,QAAA;AACH,IAAA,CAAC,CAAC;IACF,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,KAAI;;AAC/B,QAAA,IAAI,CAAC,IAAI,CAAC,MAAO,IAAI,CAAC;AACtB,QAAA,IAAI,CAAA,CAAA,EAAA,GAAC,IAAI,CAAC,IAAI,CAAC,QAAmB,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,WAAW,EAAE,MAAK,GAAG,EAAE;AACzD,YAAA,IAAI,OAAO,KAAK,IAAI,IAAI,OAAO,KAAK,IAAI,EAAE;gBACxC,IAAI,CAAC,IAAI,CAAC,KAAM,IAAI,IAAI,CAAC,IAAI,CAAC,WAAY;AAC3C,YAAA;AAAM,iBAAA;gBACL,IAAI,CAAC,IAAI,CAAC,MAAO,IAAI,IAAI,CAAC,IAAI,CAAC,WAAY;AAC5C,YAAA;AACF,QAAA;AACH,IAAA,CAAC,CAAC;IAEF,OAAO,OAAO,GAAG,CAAC;AACpB,CAAC;AAED;;;;;AAKG;AACH,MAAM,sBAAsB,GAAG,CAAC,CAAa,KAAI;IAC/C,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;QAC5B,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE;YACjC,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAE;YAC9B,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAE;AAC9B,YAAA,MAAM,KAAK,GAAG;gBACZ,CAAC;gBACD,IAAI,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,IAAK,GAAG,CAAC,CAAC,IAAI,CAAC,IAAK,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,IAAK;aACvD;YACD,YAAY,CAAC,CAAC,EAAE,YAAY,EAAE,KAAK,EAAE,KAAK,CAAC;AAC5C,QAAA;AACH,IAAA,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,gBAAgB,GAAG,CAAC,CAAa,KAAY;IACjD,IAAI,OAAO,GAAG,CAAC;IACf,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,KAAI;;AAC/B,QAAA,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;YACvB,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,CAAA,EAAA,GAAA,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,SAAe,CAAC,0CAAE,IAAI,CAAC,IAAI;YACnE,IAAI,CAAC,IAAI,CAAC,OAAO,GAAG,CAAA,EAAA,GAAA,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,YAAkB,CAAC,0CAAE,IAAI,CAAC,IAAI;AACtE,YAAA,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,IAAI,CAAC,QAAQ,CAAC;AAC5D,QAAA;AACH,IAAA,CAAC,CAAC;AAEF,IAAA,OAAO,OAAO;AAChB,CAAC;AAED,MAAM,sBAAsB,GAAG,CAAC,CAAa,KAAI;IAC/C,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,KAAI;AAC/B,QAAA,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,YAAY,EAAE;YACpC,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,EAAE,CAAE,CAAC,IAAI,CAAC,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI;AAC3D,YAAA,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;AACtB,QAAA;AACH,IAAA,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,cAAc,GAAG,CACrB,CAAa,EACb,OAGC,KACC;AACF,IAAA,IAAI,IAAY;IAChB,IAAI,IAAI,GAAG,CAAC;AACZ,IAAA,IAAI,IAAY;IAChB,IAAI,IAAI,GAAG,CAAC;AAEZ,IAAA,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,CAAC,EAAE,OAAO,EAAE,OAAO,GAAG,CAAC,EAAE,GAAc,EAAE;AAEpE,IAAA,MAAM,WAAW,GAAG,CAAC,KAAU,KAAI;QACjC,IAAI,CAAC,KAAK,CAAC,IAAI;YAAE;AACjB,QAAA,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;AACtB,QAAA,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC;AACtB,QAAA,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK;AAC1B,QAAA,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM;QAC3B,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;YAC1B,IAAI,IAAI,KAAK,SAAS,EAAE;AACtB,gBAAA,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;AACjB,YAAA;AACD,YAAA,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAChC,YAAA,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACjC,QAAA;QACD,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE;YAC1B,IAAI,IAAI,KAAK,SAAS,EAAE;AACtB,gBAAA,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;AACjB,YAAA;AACD,YAAA,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AAChC,YAAA,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;AACjC,QAAA;AACH,IAAA,CAAC;IAED,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;QAC5B,WAAW,CAAC,CAAC,CAAC;AAChB,IAAA,CAAC,CAAC;IACF,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;AAC5B,QAAA,IAAI,CAAC,KAAA,IAAA,IAAD,CAAC,KAAA,MAAA,GAAA,MAAA,GAAD,CAAC,CAAE,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;YAC/B,WAAW,CAAC,CAAC,CAAC;AACf,QAAA;AACH,IAAA,CAAC,CAAC;IAEF,IAAK,IAAI,OAAO;IAChB,IAAK,IAAI,OAAO;IAEhB,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,KAAI;AAC/B,QAAA,IAAI,CAAC,IAAI,CAAC,CAAE,IAAI,IAAI;AACpB,QAAA,IAAI,CAAC,IAAI,CAAC,CAAE,IAAI,IAAI;AACtB,IAAA,CAAC,CAAC;IAEF,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,KAAI;;QAC/B,CAAA,EAAA,GAAA,IAAI,CAAC,IAAI,CAAC,MAAM,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,OAAO,CAAC,CAAC,CAAc,KAAI;AAC3C,YAAA,CAAC,CAAC,CAAC,IAAI,IAAI;AACX,YAAA,CAAC,CAAC,CAAC,IAAI,IAAI;AACb,QAAA,CAAC,CAAC;QACF,IAAI,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;AACjC,YAAA,IAAI,CAAC,IAAI,CAAC,CAAE,IAAI,IAAI;AACrB,QAAA;QACD,IAAI,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;AACjC,YAAA,IAAI,CAAC,IAAI,CAAC,CAAE,IAAI,IAAI;AACrB,QAAA;AACH,IAAA,CAAC,CAAC;IAEF,OAAO;AACL,QAAA,KAAK,EAAE,IAAI,GAAG,IAAK,GAAG,OAAO;AAC7B,QAAA,MAAM,EAAE,IAAI,GAAG,IAAK,GAAG,OAAO;KAC/B;AACH,CAAC;AAED,MAAM,oBAAoB,GAAG,CAAC,CAAa,KAAI;IAC7C,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;QAC5B,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAE;QAClC,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAE;AAClC,QAAA,IAAI,EAAe;AACnB,QAAA,IAAI,EAAe;AACnB,QAAA,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,EAAE;AAClB,YAAA,CAAC,CAAC,IAAI,CAAC,MAAM,GAAG,EAAE;AAClB,YAAA,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAE,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAE,EAAE;AAC3C,YAAA,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAE,EAAE,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAE,EAAE;AAC5C,QAAA;AAAM,aAAA;YACL,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;AACrB,YAAA,EAAE,GAAG,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;AAC7C,QAAA;AAED,QAAA,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;AACpD,QAAA,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;AACnD,IAAA,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,oBAAoB,GAAG,CAAC,CAAa,KAAI;IAC7C,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,KAAI;QAC/B,IAAI,IAAI,CAAC,IAAI,CAAC,cAAc,CAAC,GAAG,CAAC,EAAE;AACjC,YAAA,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,KAAK,GAAG,EAAE;gBAC5D,IAAI,CAAC,IAAI,CAAC,KAAM,IAAI,IAAI,CAAC,IAAI,CAAC,WAAY;AAC3C,YAAA;AACD,YAAA,QAAQ,IAAI,CAAC,IAAI,CAAC,QAAQ;AACxB,gBAAA,KAAK,GAAG;AACN,oBAAA,IAAI,CAAC,IAAI,CAAC,CAAE,IAAI,IAAI,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,WAAY;oBAC7D;AACF,gBAAA,KAAK,GAAG;AACN,oBAAA,IAAI,CAAC,IAAI,CAAC,CAAE,IAAI,IAAI,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,WAAY;oBAC7D;AACH;AACF,QAAA;AACH,IAAA,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,6BAA6B,GAAG,CAAC,CAAa,KAAI;IACtD,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,IAAI,KAAI;;AAC/B,QAAA,IAAI,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE;YACtB,CAAA,EAAA,GAAA,IAAI,CAAC,IAAI,CAAC,MAAM,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,OAAO,EAAE;AAC5B,QAAA;AACH,IAAA,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,iBAAiB,GAAG,CAAC,CAAa,KAAI;IAC1C,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;;QAC5B,IAAI,CAAA,EAAA,GAAA,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,MAAM,EAAE;YAC/B,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE;AAC7B,YAAA,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,SAAe,CAAC;AAC9C,YAAA,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,YAAkB,CAAC;YACjD,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAChB,IAAI,CAAC,IAAI,CAAC,UAAmB,CAC5B,CAAA,CAAA,EAAA,GAAC,IAAI,CAAC,IAAI,CAAC,UAAmB,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,MAAM,IAAG,CAAC,CAC3C,CACF;YACD,MAAM,CAAC,GAAG,CAAC,CAAC,OAAO,CAChB,IAAI,CAAC,IAAI,CAAC,WAAoB,CAC7B,CAAA,CAAA,EAAA,GAAC,IAAI,CAAC,IAAI,CAAC,WAAoB,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,MAAM,IAAG,CAAC,CAC5C,CACF;AAED,YAAA,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA,CAAC,KAAA,IAAA,IAAD,CAAC,uBAAD,CAAC,CAAE,IAAI,CAAC,CAAE,KAAG,CAAC,KAAA,IAAA,IAAD,CAAC,KAAA,MAAA,GAAA,MAAA,GAAD,CAAC,CAAE,IAAI,CAAC,CAAE,CAAA,CAAC,IAAI,EAAE;AACzD,YAAA,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC,GAAG,CAAC,CAAA,CAAC,KAAA,IAAA,IAAD,CAAC,uBAAD,CAAC,CAAE,IAAI,CAAC,CAAE,KAAG,CAAC,KAAA,IAAA,IAAD,CAAC,KAAA,MAAA,GAAA,MAAA,GAAD,CAAC,CAAE,IAAI,CAAC,CAAE,CAAA,CAAC,IAAI,EAAE;YAC1D,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA,CAAC,KAAA,IAAA,IAAD,CAAC,KAAA,MAAA,GAAA,MAAA,GAAD,CAAC,CAAE,IAAI,CAAC,CAAE,KAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC;YACtD,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAA,CAAC,KAAA,IAAA,IAAD,CAAC,KAAA,MAAA,GAAA,MAAA,GAAD,CAAC,CAAE,IAAI,CAAC,CAAE,KAAI,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC,MAAO,GAAG,CAAC;AACxD,QAAA;AACH,IAAA,CAAC,CAAC;IAEF,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;AAC5B,QAAA,IAAI,CAAC,CAAC,IAAI,CAAC,KAAK,KAAK,QAAQ,EAAE;AAC7B,YAAA,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;AACnB,QAAA;AACH,IAAA,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,eAAe,GAAG,CAAC,CAAa,KAAI;IACxC,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;AAC5B,QAAA,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE;YACzB,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAE;AACjC,YAAA,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,EAAE;AACxB,gBAAA,IAAI,CAAC,IAAI,CAAC,SAAS,GAAG,EAAE;AACzB,YAAA;YACD,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC;AAC3B,YAAA,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;AACnB,QAAA;AACH,IAAA,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,eAAe,GAAG,CAAC,CAAa,KAAI;AACxC,IAAA,MAAM,MAAM,GAAG,gBAAgB,CAAC,CAAC,CAAC;IAClC,MAAM,KAAA,IAAA,IAAN,MAAM,KAAA,MAAA,GAAA,MAAA,GAAN,MAAM,CAAE,OAAO,CAAC,CAAC,KAAW,KAAI;QAC9B,IAAI,UAAU,GAAG,CAAC;AAClB,QAAA,KAAK,KAAA,IAAA,IAAL,KAAK,KAAA,MAAA,GAAA,MAAA,GAAL,KAAK,CAAE,OAAO,CAAC,CAAC,CAAK,EAAE,CAAS,KAAI;;YAClC,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE;YAC1B,IAAI,CAAC,IAAI,CAAC,KAAK,GAAG,CAAC,GAAG,UAAU;YAChC,CAAA,EAAA,GAAA,IAAI,CAAC,IAAI,CAAC,SAAS,MAAA,IAAA,IAAA,EAAA,KAAA,MAAA,GAAA,MAAA,GAAA,EAAA,CAAE,OAAO,CAAC,CAAC,QAA6B,KAAI;AAC7D,gBAAA,YAAY,CACV,CAAC,EACD,UAAU,EACV;AACE,oBAAA,KAAK,EAAE,QAAQ,CAAC,IAAI,CAAC,KAAK;AAC1B,oBAAA,MAAM,EAAE,QAAQ,CAAC,IAAI,CAAC,MAAM;AAC5B,oBAAA,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI;AACpB,oBAAA,KAAK,EAAE,CAAC,GAAG,EAAE,UAAU;AACvB,oBAAA,CAAC,EAAE,QAAQ;iBACZ,EACD,KAAK,CACN;AACH,YAAA,CAAC,CAAC;AACF,YAAA,OAAO,IAAI,CAAC,IAAI,CAAC,SAAS;AAC5B,QAAA,CAAC,CAAC;AACJ,IAAA,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,iBAAiB,GAAG,CAAC,CAAa,KAAI;IAC1C,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;QAC5B,MAAM,IAAI,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAE;AAC7B,QAAA,IAAI,IAAI,CAAC,IAAI,CAAC,KAAK,KAAK,UAAU,EAAE;AAClC,YAAA,MAAM,QAAQ,GAAG,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,MAAM,CAAE;AAChD,YAAA,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAE,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAM,GAAG,CAAC;AACrD,YAAA,MAAM,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,CAAE;YAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,CAAE,GAAG,CAAC;YAC3B,MAAM,EAAE,GAAG,QAAQ,CAAC,IAAI,CAAC,MAAO,GAAG,CAAC;AAEpC,YAAA,IAAI,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,EAAE,CAAC,EAAE;AAC9B,gBAAA,CAAC,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,IAAI,CAAC;AACrD,YAAA;AAAM,iBAAA;gBACL,CAAC,CAAC,OAAO,CAAC;AACR,oBAAA,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,EAAE;AACnB,oBAAA,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,MAAM;AAC3B,oBAAA,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,MAAM;AAC3B,oBAAA,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,IAAI;AACxB,iBAAA,CAAC;AACH,YAAA;AACD,YAAA,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;YAElB,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,IAAI,CAAC,MAAM,GAAG;AACzB,gBAAA,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;AAClC,gBAAA,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;AAClC,gBAAA,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;AAChB,gBAAA,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;AAClC,gBAAA,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,GAAG,EAAE,EAAE;aACnC;AAED,YAAA,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;AACjC,YAAA,IAAI,CAAC,IAAI,CAAC,CAAE,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;AAClC,QAAA;AACH,IAAA,CAAC,CAAC;AACJ,CAAC;AAED,MAAM,iBAAiB,GAAG,CAAC,GAAwB,EAAE,KAAe,KAAI;IACtE,MAAM,gBAAgB,GAAwB,EAAE;IAChD,KAAK,KAAA,IAAA,IAAL,KAAK,KAAA,MAAA,GAAA,MAAA,GAAL,KAAK,CAAE,OAAO,CAAC,CAAC,GAAW,KAAI;AAC7B,QAAA,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,SAAS;YAAE;QAC5B,gBAAgB,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC;AACnC,IAAA,CAAC,CAAC;AACF,IAAA,OAAO,gBAAgB;AACzB,CAAC;AAED,MAAM,YAAY,GAAG,CAAC,KAAA,GAA6B,EAAE,KAAI;IACvD,MAAM,QAAQ,GAAwB,EAAE;IACxC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,CAAC,CAAS,KAAI;QACvC,QAAQ,CAAC,CAAC,CAAC,WAAW,EAAE,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC;AACtC,IAAA,CAAC,CAAC;AACF,IAAA,OAAO,QAAQ;AACjB,CAAC;;;;"}

package/lib/algorithm/antv-dagre/nesting-graph.js

@@ -0,0 +1,154 @@
+import { addDummyNode, addBorderNode } from './util.js';
+
+/*
+ * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,
+ * adds appropriate edges to ensure that all cluster nodes are placed between
+ * these boundries, and ensures that the graph is connected.
+ *
+ * In addition we ensure, through the use of the minlen property, that nodes
+ * and subgraph border nodes to not end up on the same rank.
+ *
+ * Preconditions:
+ *
+ *    1. Input graph is a DAG
+ *    2. Nodes in the input graph has a minlen attribute
+ *
+ * Postconditions:
+ *
+ *    1. Input graph is connected.
+ *    2. Dummy nodes are added for the tops and bottoms of subgraphs.
+ *    3. The minlen attribute for nodes is adjusted to ensure nodes do not
+ *       get placed on the same rank as subgraph border nodes.
+ *
+ * The nesting graph idea comes from Sander, "Layout of Compound Directed
+ * Graphs."
+ */
+const run$1 = (g) => {
+    const root = addDummyNode(g, 'root', {}, '_root');
+    const depths = treeDepths(g);
+    let maxDepth = Math.max(...Object.values(depths));
+    if (Math.abs(maxDepth) === Infinity) {
+        maxDepth = 1;
+    }
+    const height = maxDepth - 1; // Note: depths is an Object not an array
+    const nodeSep = 2 * height + 1;
+    // g.graph().nestingRoot = root;
+    // Multiply minlen by nodeSep to align nodes on non-border ranks.
+    g.getAllEdges().forEach((e) => {
+        e.data.minlen *= nodeSep;
+    });
+    // Calculate a weight that is sufficient to keep subgraphs vertically compact
+    const weight = sumWeights(g) + 1;
+    // Create border nodes and link them up
+    // g.children()?.forEach((child) => {
+    //   dfs(g, root, nodeSep, weight, height, depths, child);
+    // });
+    g.getRoots().forEach((child) => {
+        dfs(g, root, nodeSep, weight, height, depths, child.id);
+    });
+    // Save the multiplier for node layers for later removal of empty border
+    // layers.
+    // g.graph().nodeRankFactor = nodeSep;
+    return {
+        nestingRoot: root,
+        nodeRankFactor: nodeSep,
+    };
+};
+const dfs = (g, root, nodeSep, weight, height, depths, v) => {
+    const children = g.getChildren(v);
+    if (!(children === null || children === void 0 ? void 0 : children.length)) {
+        if (v !== root) {
+            // g.setEdge(root, v, { weight: 0, minlen: nodeSep });
+            g.addEdge({
+                id: `e${Math.random()}`,
+                source: root,
+                target: v,
+                data: { weight: 0, minlen: nodeSep },
+            });
+        }
+        return;
+    }
+    const top = addBorderNode(g, '_bt');
+    const bottom = addBorderNode(g, '_bb');
+    const label = g.getNode(v);
+    g.setParent(top, v);
+    label.data.borderTop = top;
+    g.setParent(bottom, v);
+    label.data.borderBottom = bottom;
+    children === null || children === void 0 ? void 0 : children.forEach((childNode) => {
+        dfs(g, root, nodeSep, weight, height, depths, childNode.id);
+        const childTop = childNode.data.borderTop
+            ? childNode.data.borderTop
+            : childNode.id;
+        const childBottom = childNode.data.borderBottom
+            ? childNode.data.borderBottom
+            : childNode.id;
+        const thisWeight = childNode.data.borderTop ? weight : 2 * weight;
+        const minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;
+        g.addEdge({
+            id: `e${Math.random()}`,
+            source: top,
+            target: childTop,
+            data: {
+                minlen,
+                weight: thisWeight,
+                nestingEdge: true,
+            },
+        });
+        g.addEdge({
+            id: `e${Math.random()}`,
+            source: childBottom,
+            target: bottom,
+            data: {
+                minlen,
+                weight: thisWeight,
+                nestingEdge: true,
+            },
+        });
+    });
+    if (!g.getParent(v)) {
+        g.addEdge({
+            id: `e${Math.random()}`,
+            source: root,
+            target: top,
+            data: {
+                weight: 0,
+                minlen: height + depths[v],
+            },
+        });
+    }
+};
+const treeDepths = (g) => {
+    const depths = {};
+    const dfs = (v, depth) => {
+        const children = g.getChildren(v);
+        children === null || children === void 0 ? void 0 : children.forEach((child) => dfs(child.id, depth + 1));
+        depths[v] = depth;
+    };
+    // g.children()?.forEach((v) => dfs(v, 1));
+    g.getRoots().forEach((v) => dfs(v.id, 1));
+    return depths;
+};
+const sumWeights = (g) => {
+    let result = 0;
+    g.getAllEdges().forEach((e) => {
+        result += e.data.weight;
+    });
+    return result;
+};
+const cleanup = (g, nestingRoot) => {
+    // const graphLabel = g.graph();
+    // graphLabel.nestingRoot && g.removeNode(graphLabel.nestingRoot);
+    // delete graphLabel.nestingRoot;
+    if (nestingRoot) {
+        g.removeNode(nestingRoot);
+    }
+    g.getAllEdges().forEach((e) => {
+        if (e.data.nestingEdge) {
+            g.removeEdge(e.id);
+        }
+    });
+};
+
+export { cleanup, run$1 as run };
+//# sourceMappingURL=nesting-graph.js.map

package/lib/algorithm/antv-dagre/nesting-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"nesting-graph.js","sources":["../../../src/algorithm/antv-dagre/src/algorithm/antv-dagre/nesting-graph.ts"],"sourcesContent":[null],"names":["run"],"mappings":";;AAIA;;;;;;;;;;;;;;;;;;;;;;AAsBG;AACH,MAAMA,KAAG,GAAG,CAAC,CAAa,KAAI;AAC5B,IAAA,MAAM,IAAI,GAAG,YAAY,CAAC,CAAC,EAAE,MAAM,EAAE,EAAE,EAAE,OAAO,CAAC;AACjD,IAAA,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC;AAC5B,IAAA,IAAI,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAEjD,IAAI,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,KAAK,QAAQ,EAAE;QACnC,QAAQ,GAAG,CAAC;AACb,IAAA;AAED,IAAA,MAAM,MAAM,GAAG,QAAQ,GAAG,CAAC,CAAC;AAC5B,IAAA,MAAM,OAAO,GAAG,CAAC,GAAG,MAAM,GAAG,CAAC;;;IAK9B,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;AAC5B,QAAA,CAAC,CAAC,IAAI,CAAC,MAAO,IAAI,OAAO;AAC3B,IAAA,CAAC,CAAC;;IAGF,MAAM,MAAM,GAAG,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC;;;;;IAMhC,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,KAAK,KAAI;AAC7B,QAAA,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC,EAAE,CAAC;AACzD,IAAA,CAAC,CAAC;;;;IAMF,OAAO;AACL,QAAA,WAAW,EAAE,IAAI;AACjB,QAAA,cAAc,EAAE,OAAO;KACxB;AACH;AAEA,MAAM,GAAG,GAAG,CACV,CAAa,EACb,IAAQ,EACR,OAAe,EACf,MAAc,EACd,MAAc,EACd,MAA8B,EAC9B,CAAK,KACH;IACF,MAAM,QAAQ,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;IACjC,IAAI,EAAC,QAAQ,KAAA,IAAA,IAAR,QAAQ,uBAAR,QAAQ,CAAE,MAAM,CAAA,EAAE;QACrB,IAAI,CAAC,KAAK,IAAI,EAAE;;YAEd,CAAC,CAAC,OAAO,CAAC;AACR,gBAAA,EAAE,EAAE,CAAA,CAAA,EAAI,IAAI,CAAC,MAAM,EAAE,CAAA,CAAE;AACvB,gBAAA,MAAM,EAAE,IAAI;AACZ,gBAAA,MAAM,EAAE,CAAC;gBACT,IAAI,EAAE,EAAE,MAAM,EAAE,CAAC,EAAE,MAAM,EAAE,OAAO,EAAE;AACrC,aAAA,CAAC;AACH,QAAA;QACD;AACD,IAAA;IAED,MAAM,GAAG,GAAG,aAAa,CAAC,CAAC,EAAE,KAAK,CAAC;IACnC,MAAM,MAAM,GAAG,aAAa,CAAC,CAAC,EAAE,KAAK,CAAC;IACtC,MAAM,KAAK,GAAG,CAAC,CAAC,OAAO,CAAC,CAAC,CAAE;AAE3B,IAAA,CAAC,CAAC,SAAS,CAAC,GAAG,EAAE,CAAC,CAAC;AACnB,IAAA,KAAK,CAAC,IAAI,CAAC,SAAS,GAAG,GAAG;AAC1B,IAAA,CAAC,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;AACtB,IAAA,KAAK,CAAC,IAAI,CAAC,YAAY,GAAG,MAAM;IAEhC,QAAQ,KAAA,IAAA,IAAR,QAAQ,KAAA,MAAA,GAAA,MAAA,GAAR,QAAQ,CAAE,OAAO,CAAC,CAAC,SAAS,KAAI;AAC9B,QAAA,GAAG,CAAC,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,SAAS,CAAC,EAAE,CAAC;AAE3D,QAAA,MAAM,QAAQ,GAAG,SAAS,CAAC,IAAI,CAAC;AAC9B,cAAG,SAAS,CAAC,IAAI,CAAC;AAClB,cAAE,SAAS,CAAC,EAAE;AAChB,QAAA,MAAM,WAAW,GAAG,SAAS,CAAC,IAAI,CAAC;AACjC,cAAG,SAAS,CAAC,IAAI,CAAC;AAClB,cAAE,SAAS,CAAC,EAAE;AAChB,QAAA,MAAM,UAAU,GAAG,SAAS,CAAC,IAAI,CAAC,SAAS,GAAG,MAAM,GAAG,CAAC,GAAG,MAAM;QACjE,MAAM,MAAM,GAAG,QAAQ,KAAK,WAAW,GAAG,CAAC,GAAG,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC;QAEpE,CAAC,CAAC,OAAO,CAAC;AACR,YAAA,EAAE,EAAE,CAAA,CAAA,EAAI,IAAI,CAAC,MAAM,EAAE,CAAA,CAAE;AACvB,YAAA,MAAM,EAAE,GAAG;AACX,YAAA,MAAM,EAAE,QAAQ;AAChB,YAAA,IAAI,EAAE;gBACJ,MAAM;AACN,gBAAA,MAAM,EAAE,UAAU;AAClB,gBAAA,WAAW,EAAE,IAAI;AAClB,aAAA;AACF,SAAA,CAAC;QAEF,CAAC,CAAC,OAAO,CAAC;AACR,YAAA,EAAE,EAAE,CAAA,CAAA,EAAI,IAAI,CAAC,MAAM,EAAE,CAAA,CAAE;AACvB,YAAA,MAAM,EAAE,WAAW;AACnB,YAAA,MAAM,EAAE,MAAM;AACd,YAAA,IAAI,EAAE;gBACJ,MAAM;AACN,gBAAA,MAAM,EAAE,UAAU;AAClB,gBAAA,WAAW,EAAE,IAAI;AAClB,aAAA;AACF,SAAA,CAAC;AACJ,IAAA,CAAC,CAAC;AAEF,IAAA,IAAI,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,EAAE;QACnB,CAAC,CAAC,OAAO,CAAC;AACR,YAAA,EAAE,EAAE,CAAA,CAAA,EAAI,IAAI,CAAC,MAAM,EAAE,CAAA,CAAE;AACvB,YAAA,MAAM,EAAE,IAAI;AACZ,YAAA,MAAM,EAAE,GAAG;AACX,YAAA,IAAI,EAAE;AACJ,gBAAA,MAAM,EAAE,CAAC;AACT,gBAAA,MAAM,EAAE,MAAM,GAAG,MAAM,CAAC,CAAC,CAAC;AAC3B,aAAA;AACF,SAAA,CAAC;AACH,IAAA;AACH,CAAC;AAED,MAAM,UAAU,GAAG,CAAC,CAAa,KAAI;IACnC,MAAM,MAAM,GAAuB,EAAE;AACrC,IAAA,MAAM,GAAG,GAAG,CAAC,CAAK,EAAE,KAAa,KAAI;QACnC,MAAM,QAAQ,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;QACjC,QAAQ,KAAA,IAAA,IAAR,QAAQ,KAAA,MAAA,GAAA,MAAA,GAAR,QAAQ,CAAE,OAAO,CAAC,CAAC,KAAK,KAAK,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;AACtD,QAAA,MAAM,CAAC,CAAC,CAAC,GAAG,KAAK;AACnB,IAAA,CAAC;;IAGD,CAAC,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;AACzC,IAAA,OAAO,MAAM;AACf,CAAC;AAED,MAAM,UAAU,GAAG,CAAC,CAAa,KAAI;IACnC,IAAI,MAAM,GAAG,CAAC;IACd,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;AAC5B,QAAA,MAAM,IAAI,CAAC,CAAC,IAAI,CAAC,MAAO;AAC1B,IAAA,CAAC,CAAC;AACF,IAAA,OAAO,MAAM;AACf,CAAC;AAED,MAAM,OAAO,GAAG,CAAC,CAAa,EAAE,WAAgB,KAAI;;;;AAIlD,IAAA,IAAI,WAAW,EAAE;AACf,QAAA,CAAC,CAAC,UAAU,CAAC,WAAW,CAAC;AAC1B,IAAA;IAED,CAAC,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,KAAI;AAC5B,QAAA,IAAI,CAAC,CAAC,IAAI,CAAC,WAAW,EAAE;AACtB,YAAA,CAAC,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,CAAC;AACnB,QAAA;AACH,IAAA,CAAC,CAAC;AACJ;;;;"}