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

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

@@ -1,395 +0,0 @@
-/*
- * 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 const findType1Conflicts = (g, layering) => {
-    const conflicts = {};
-    const visitLayer = (prevLayer, layer) => {
-        // last visited node in the previous layer that is incident on an inner
-        // segment.
-        let k0 = 0;
-        // Tracks the last node in this layer scanned for crossings with a type-1
-        // segment.
-        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;
-            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((scanNode) => {
-                    var _a;
-                    (_a = g.getPredecessors(scanNode)) === null || _a === void 0 ? void 0 : _a.forEach((u) => {
-                        var _a;
-                        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);
-                        }
-                    });
-                });
-                scanPos = i + 1;
-                k0 = k1;
-            }
-        });
-        return layer;
-    };
-    if (layering === null || layering === void 0 ? void 0 : layering.length) {
-        layering.reduce(visitLayer);
-    }
-    return conflicts;
-};
-export const findType2Conflicts = (g, layering) => {
-    const conflicts = {};
-    function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {
-        var _a, _b;
-        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((u) => {
-                    const uNode = g.getNode(u.id);
-                    if (uNode.data.dummy &&
-                        (uNode.data.order < prevNorthBorder ||
-                            uNode.data.order > nextNorthBorder)) {
-                        addConflict(conflicts, u.id, v);
-                    }
-                });
-            }
-        }
-    }
-    function getScannedKey(params) {
-        // south数组可能很大，不适合做key
-        return JSON.stringify(params.slice(1));
-    }
-    function scanIfNeeded(params, scanCache) {
-        const cacheKey = getScannedKey(params);
-        if (scanCache.get(cacheKey))
-            return;
-        scan(...params);
-        scanCache.set(cacheKey, true);
-    }
-    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') {
-                const predecessors = g.getPredecessors(v) || [];
-                if (predecessors.length) {
-                    nextNorthPos = g.getNode(predecessors[0].id).data.order;
-                    scanIfNeeded([south, southPos, southLookahead, prevNorthPos, nextNorthPos], scanned);
-                    southPos = southLookahead;
-                    prevNorthPos = nextNorthPos;
-                }
-            }
-            scanIfNeeded([south, southPos, south.length, nextNorthPos, north.length], scanned);
-        });
-        return south;
-    };
-    if (layering === null || layering === void 0 ? void 0 : layering.length) {
-        layering.reduce(visitLayer);
-    }
-    return conflicts;
-};
-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((u) => g.getNode(u.id).data.dummy);
-    }
-};
-export const addConflict = (conflicts, v, w) => {
-    let vv = v;
-    let ww = w;
-    if (vv > ww) {
-        const tmp = vv;
-        vv = ww;
-        ww = tmp;
-    }
-    let conflictsV = conflicts[vv];
-    if (!conflictsV) {
-        conflicts[vv] = conflictsV = {};
-    }
-    conflictsV[ww] = true;
-};
-export const hasConflict = (conflicts, v, w) => {
-    let vv = v;
-    let ww = w;
-    if (vv > ww) {
-        const tmp = v;
-        vv = ww;
-        ww = tmp;
-    }
-    return !!conflicts[vv];
-};
-/*
- * Try to align nodes into vertical "blocks" where possible. This algorithm
- * attempts to align a node with one of its median neighbors. If the edge
- * connecting a neighbor is a type-1 conflict then we ignore that possibility.
- * If a previous node has already formed a block with a node after the node
- * we're trying to form a block with, we also ignore that possibility - our
- * blocks would be split in that scenario.
- */
-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((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((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((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)) {
-                        align[w] = v;
-                        align[v] = root[v] = root[w];
-                        prevIdx = pos[w];
-                    }
-                }
-            }
-        });
-    });
-    return { root, align };
-};
-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.
-    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);
-            }
-            else {
-                visited[elem.id] = true;
-                stack.push(elem);
-                stack = stack.concat(nextNodesFunc(elem.id));
-            }
-            elem = stack.pop();
-        }
-    };
-    // First pass, assign smallest coordinates
-    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
-    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);
-        const node = g.getNode(elem);
-        if (min !== Number.POSITIVE_INFINITY &&
-            node.data.borderType !== borderType) {
-            xs[elem] = Math.max(xs[elem], min);
-        }
-    };
-    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((v) => {
-        xs[v] = xs[root[v]];
-    });
-    return xs;
-};
-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,
-                    data: {},
-                });
-            }
-            if (u) {
-                const uRoot = root[u];
-                const edge = blockGraph
-                    .getRelatedEdges(uRoot, 'out')
-                    .find((edge) => edge.target === vRoot);
-                if (!edge) {
-                    blockGraph.addEdge({
-                        id: `e${Math.random()}`,
-                        source: uRoot,
-                        target: vRoot,
-                        data: {
-                            weight: Math.max(sepFn(g, v, u), 0),
-                        },
-                    });
-                }
-                else {
-                    blockGraph.updateEdgeData(edge.id, Object.assign(Object.assign({}, edge.data), { weight: Math.max(sepFn(g, v, u), edge.data.weight || 0) }));
-                }
-            }
-            u = v;
-        });
-    });
-    return blockGraph;
-};
-/*
- * Returns the alignment that has the smallest width of the given alignments.
- */
-export const findSmallestWidthAlignment = (g, xss) => {
-    return minBy(Object.values(xss), (xs) => {
-        var _a;
-        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);
-        });
-        return max - min;
-    });
-};
-/*
- * Align the coordinates of each of the layout alignments such that
- * left-biased alignments have their minimum coordinate at the same point as
- * the minimum coordinate of the smallest width alignment and right-biased
- * alignments have their maximum coordinate at the same point as the maximum
- * coordinate of the smallest width alignment.
- */
-export function alignCoordinates(xss, alignTo) {
-    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;
-            const xsVals = Object.values(xs);
-            delta =
-                horiz === 'l'
-                    ? alignToMin - Math.min(...xsVals)
-                    : alignToMax - Math.max(...xsVals);
-            if (delta) {
-                xss[alignment] = {};
-                Object.keys(xs).forEach((key) => {
-                    xss[alignment][key] = xs[key] + delta;
-                });
-            }
-        });
-    });
-}
-export const balance = (xss, align) => {
-    const result = {};
-    Object.keys(xss.ul).forEach((key) => {
-        if (align) {
-            result[key] = xss[align.toLowerCase()][key];
-        }
-        else {
-            const values = Object.values(xss).map((x) => x[key]);
-            result[key] = (values[0] + values[1]) / 2; // (ur + ul) / 2
-        }
-    });
-    return result;
-};
-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((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((key) => {
-                    xs[key] = -xs[key];
-                });
-            }
-            xss[vert + horiz] = xs;
-        });
-    });
-    const smallestWidth = findSmallestWidthAlignment(g, xss);
-    alignCoordinates(xss, smallestWidth);
-    return balance(xss, graphAlign);
-};
-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':
-                    delta = -vLabel.data.width / 2;
-                    break;
-                case 'r':
-                    delta = vLabel.data.width / 2;
-                    break;
-            }
-        }
-        if (delta) {
-            sum += reverseSep ? delta : -delta;
-        }
-        delta = 0;
-        sum += (vLabel.data.dummy ? edgeSep : nodeSep) / 2;
-        sum += (wLabel.data.dummy ? edgeSep : nodeSep) / 2;
-        sum += wLabel.data.width / 2;
-        if (wLabel.data.labelpos) {
-            switch ((wLabel.data.labelpos || '').toLowerCase()) {
-                case 'l':
-                    delta = wLabel.data.width / 2;
-                    break;
-                case 'r':
-                    delta = -wLabel.data.width / 2;
-                    break;
-            }
-        }
-        if (delta) {
-            sum += reverseSep ? delta : -delta;
-        }
-        delta = 0;
-        return sum;
-    };
-};
-export const width = (g, v) => g.getNode(v).data.width || 0;
-//# sourceMappingURL=bk.js.map

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

@@ -1 +0,0 @@
-{"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/antv-dagre/position/index.d.ts

@@ -1,8 +0,0 @@
-import type { Graph as IGraph } from '../../types';
-import type { DagreAlign } from '../types';
-export declare const position: (g: IGraph, options?: Partial<{
-    align: DagreAlign;
-    nodesep: number;
-    edgesep: number;
-    ranksep: number;
-}>) => void;

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

@@ -1,51 +0,0 @@
-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

@@ -1 +0,0 @@
-{"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/antv-dagre/rank/feasible-tree.d.ts

@@ -1,5 +0,0 @@
-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 };

package/lib/antv-dagre/rank/feasible-tree.js

@@ -1,164 +0,0 @@
-import { Graph } from '@antv/graphlib';
-import { minBy } from '../util';
-import { slack } from './util';
-/*
- * Constructs a spanning tree with tight edges and adjusted the input node's
- * ranks to achieve this. A tight edge is one that is has a length that matches
- * its "minlen" attribute.
- *
- * The basic structure for this function is derived from Gansner, et al., "A
- * Technique for Drawing Directed Graphs."
- *
- * Pre-conditions:
- *
- *    1. Graph must be a DAG.
- *    2. Graph must be connected.
- *    3. Graph must have at least one node.
- *    5. Graph nodes must have been previously assigned a "rank" property that
- *       respects the "minlen" property of incident edges.
- *    6. Graph edges must have a "minlen" property.
- *
- * Post-conditions:
- *
- *    - Graph nodes will have their rank adjusted to ensure that all edges are
- *      tight.
- *
- * Returns a tree (undirected graph) that is constructed using only "tight"
- * edges.
- */
-const feasibleTree = (g) => {
-    const t = new Graph({
-        tree: [],
-    });
-    // Choose arbitrary node from which to start our tree
-    const start = g.getAllNodes()[0];
-    const size = g.getAllNodes().length;
-    t.addNode(start);
-    let edge;
-    let delta;
-    while (tightTree(t, g) < size) {
-        edge = findMinSlackEdge(t, g);
-        delta = t.hasNode(edge.source) ? slack(g, edge) : -slack(g, edge);
-        shiftRanks(t, g, delta);
-    }
-    return t;
-};
-/*
- * Finds a maximal tree of tight edges and returns the number of nodes in the
- * tree.
- */
-const tightTree = (t, g) => {
-    const dfs = (v) => {
-        g.getRelatedEdges(v, 'both').forEach((e) => {
-            const edgeV = e.source;
-            const w = v === edgeV ? e.target : edgeV;
-            if (!t.hasNode(w) && !slack(g, e)) {
-                t.addNode({
-                    id: w,
-                    data: {},
-                });
-                t.addEdge({
-                    id: e.id,
-                    source: v,
-                    target: w,
-                    data: {},
-                });
-                dfs(w);
-            }
-        });
-    };
-    t.getAllNodes().forEach((n) => dfs(n.id));
-    return t.getAllNodes().length;
-};
-/*
- * Constructs a spanning tree with tight edges and adjusted the input node's
- * ranks to achieve this. A tight edge is one that is has a length that matches
- * its "minlen" attribute.
- *
- * The basic structure for this function is derived from Gansner, et al., "A
- * Technique for Drawing Directed Graphs."
- *
- * Pre-conditions:
- *
- *    1. Graph must be a DAG.
- *    2. Graph must be connected.
- *    3. Graph must have at least one node.
- *    5. Graph nodes must have been previously assigned a "rank" property that
- *       respects the "minlen" property of incident edges.
- *    6. Graph edges must have a "minlen" property.
- *
- * Post-conditions:
- *
- *    - Graph nodes will have their rank adjusted to ensure that all edges are
- *      tight.
- *
- * Returns a tree (undirected graph) that is constructed using only "tight"
- * edges.
- */
-const feasibleTreeWithLayer = (g) => {
-    const t = new Graph({ tree: [] });
-    // Choose arbitrary node from which to start our tree
-    const start = g.getAllNodes()[0];
-    const size = g.getAllNodes().length;
-    t.addNode(start);
-    let edge;
-    let delta;
-    while (tightTreeWithLayer(t, g) < size) {
-        edge = findMinSlackEdge(t, g);
-        delta = t.hasNode(edge.source) ? slack(g, edge) : -slack(g, edge);
-        shiftRanks(t, g, delta);
-    }
-    return t;
-};
-/*
- * Finds a maximal tree of tight edges and returns the number of nodes in the
- * tree.
- */
-const tightTreeWithLayer = (t, g) => {
-    const dfs = (v) => {
-        var _a;
-        (_a = g.getRelatedEdges(v, 'both')) === null || _a === void 0 ? void 0 : _a.forEach((e) => {
-            const edgeV = e.source;
-            const w = v === edgeV ? e.target : edgeV;
-            // 对于指定layer的，直接加入tight-tree，不参与调整
-            if (!t.hasNode(w) &&
-                (g.getNode(w).data.layer !== undefined || !slack(g, e))) {
-                t.addNode({
-                    id: w,
-                    data: {},
-                });
-                t.addEdge({
-                    id: e.id,
-                    source: v,
-                    target: w,
-                    data: {},
-                });
-                dfs(w);
-            }
-        });
-    };
-    t.getAllNodes().forEach((n) => dfs(n.id));
-    return t.getAllNodes().length;
-};
-/*
- * Finds the edge with the smallest slack that is incident on tree and returns
- * it.
- */
-const findMinSlackEdge = (t, g) => {
-    return minBy(g.getAllEdges(), (e) => {
-        if (t.hasNode(e.source) !== t.hasNode(e.target)) {
-            return slack(g, e);
-        }
-        return Infinity;
-    });
-};
-const shiftRanks = (t, g, delta) => {
-    t.getAllNodes().forEach((tn) => {
-        const v = g.getNode(tn.id);
-        if (!v.data.rank)
-            v.data.rank = 0;
-        v.data.rank += delta;
-    });
-};
-export { feasibleTree, feasibleTreeWithLayer };
-//# sourceMappingURL=feasible-tree.js.map