@grafloria/element 0.3.17 → 0.3.19

package/src/libs/engine/src/layout/layout-auto-select.js

@@ -0,0 +1,621 @@
+"use strict";
+// Wave 7 (Auto-layout) — Card 7b: auto-algorithm selection.
+//
+// ---------------------------------------------------------------------------
+// WHAT THIS IS FOR
+// ---------------------------------------------------------------------------
+//
+// `engine.layout()` with no name should produce a good picture. Today the caller
+// has to know that a tree wants `mrtree`, a dense mesh wants `force`, and a
+// pipeline wants `layered` — i.e. they have to know graph-drawing theory to get a
+// diagram drawn. They do not want to learn it, so they pick the default, and the
+// default is wrong for their graph.
+//
+// So: RUN the plausible candidates, MEASURE the results, and keep the best one.
+// Not a heuristic that guesses from node count — an actual bake-off, scored on the
+// metrics that were sitting unused in layout-quality-metrics.ts.
+//
+// ---------------------------------------------------------------------------
+// THE TWO RULES THAT KEEP IT FROM BEING A SUPPORT TICKET
+// ---------------------------------------------------------------------------
+//
+// 1. DETERMINISTIC. Same graph => same choice, always. Candidates run in a fixed
+//    order, every algorithm gets the same seed, and ties break by candidate name.
+//    An auto-selector that picks differently on reload is worse than no
+//    auto-selector: the diagram moves under the user for no reason they can see.
+//
+// 2. IT SHOWS ITS WORKING. `LayoutSelectionReport` carries every candidate, every
+//    score and the reason the winner won. A black-box selector that picks a layout
+//    the user dislikes leaves them with nowhere to go but a support ticket; one
+//    that says "elk scored 91, dagre 78, force 44, and elk won on port respect"
+//    lets them disagree with the SCORE, override it, and move on.
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.BAKEOFF_NODE_LIMIT = exports.AUTO_LAYOUT_NAME = void 0;
+exports.analyseGraphShape = analyseGraphShape;
+exports.estimateLayering = estimateLayering;
+exports.buildCandidates = buildCandidates;
+exports.pickEngineForScale = pickEngineForScale;
+exports.autoSelectLayout = autoSelectLayout;
+const tslib_1 = require("tslib");
+const layout_quality_metrics_1 = require("./layout-quality-metrics");
+const layout_quality_extended_1 = require("./layout-quality-extended");
+const port_label_bridge_1 = require("./port-label-bridge");
+const rng_1 = require("./rng");
+/** The registered name of the auto-selecting layout. */
+exports.AUTO_LAYOUT_NAME = 'auto';
+function analyseGraphShape(nodes, links) {
+    var _a, _b;
+    const nodeCount = nodes.length;
+    const real = links.filter((l) => l.sourceNodeId && l.targetNodeId);
+    const linkCount = real.length;
+    const adjacency = new Map();
+    const indegree = new Map();
+    for (const node of nodes) {
+        adjacency.set(node.id, []);
+        indegree.set(node.id, 0);
+    }
+    for (const link of real) {
+        (_a = adjacency.get(link.sourceNodeId)) === null || _a === void 0 ? void 0 : _a.push(link.targetNodeId);
+        indegree.set(link.targetNodeId, ((_b = indegree.get(link.targetNodeId)) !== null && _b !== void 0 ? _b : 0) + 1);
+    }
+    const maxEdges = nodeCount > 1 ? (nodeCount * (nodeCount - 1)) / 2 : 1;
+    const density = linkCount / maxEdges;
+    return {
+        nodeCount,
+        linkCount,
+        density,
+        isTree: isTree(nodes, real, indegree),
+        isDAG: isAcyclic(nodes, adjacency),
+        components: countComponents(nodes, real),
+        hasDeclaredPorts: (0, port_label_bridge_1.derivePortInfos)(nodes).length > 0,
+        hasEdgeLabels: links.some((l) => (0, port_label_bridge_1.linkLabelBox)(l) !== undefined),
+    };
+}
+function isTree(nodes, links, indegree) {
+    var _a;
+    if (nodes.length === 0)
+        return false;
+    // Every node has at most one parent, and there are exactly n-1 edges across a
+    // single component — the textbook shape.
+    for (const node of nodes)
+        if (((_a = indegree.get(node.id)) !== null && _a !== void 0 ? _a : 0) > 1)
+            return false;
+    return links.length === nodes.length - 1 && countComponents(nodes, links) === 1;
+}
+function isAcyclic(nodes, adjacency) {
+    const WHITE = 0;
+    const GREY = 1;
+    const BLACK = 2;
+    const colour = new Map();
+    for (const node of nodes)
+        colour.set(node.id, WHITE);
+    const visit = (id) => {
+        var _a;
+        colour.set(id, GREY);
+        for (const next of (_a = adjacency.get(id)) !== null && _a !== void 0 ? _a : []) {
+            const c = colour.get(next);
+            if (c === GREY)
+                return false; // back-edge => cycle
+            if (c === WHITE && !visit(next))
+                return false;
+        }
+        colour.set(id, BLACK);
+        return true;
+    };
+    for (const node of nodes) {
+        if (colour.get(node.id) === WHITE && !visit(node.id))
+            return false;
+    }
+    return true;
+}
+function estimateLayering(nodes, links) {
+    var _a, _b, _c, _d, _e;
+    const indegree = new Map();
+    const adjacency = new Map();
+    for (const node of nodes) {
+        indegree.set(node.id, 0);
+        adjacency.set(node.id, []);
+    }
+    for (const link of links) {
+        if (!link.sourceNodeId || !link.targetNodeId)
+            continue;
+        if (!indegree.has(link.sourceNodeId) || !indegree.has(link.targetNodeId))
+            continue;
+        adjacency.get(link.sourceNodeId).push(link.targetNodeId);
+        indegree.set(link.targetNodeId, indegree.get(link.targetNodeId) + 1);
+    }
+    const rank = new Map();
+    const queue = [];
+    for (const node of nodes) {
+        if (indegree.get(node.id) === 0) {
+            rank.set(node.id, 0);
+            queue.push(node.id);
+        }
+    }
+    let head = 0;
+    while (head < queue.length) {
+        const id = queue[head++];
+        const r = (_a = rank.get(id)) !== null && _a !== void 0 ? _a : 0;
+        for (const next of (_b = adjacency.get(id)) !== null && _b !== void 0 ? _b : []) {
+            rank.set(next, Math.max((_c = rank.get(next)) !== null && _c !== void 0 ? _c : 0, r + 1));
+            const remaining = indegree.get(next) - 1;
+            indegree.set(next, remaining);
+            if (remaining === 0)
+                queue.push(next);
+        }
+    }
+    const widths = new Map();
+    let depth = 0;
+    let maxWidth = 0;
+    for (const node of nodes) {
+        const r = (_d = rank.get(node.id)) !== null && _d !== void 0 ? _d : 0;
+        const width = ((_e = widths.get(r)) !== null && _e !== void 0 ? _e : 0) + 1;
+        widths.set(r, width);
+        if (width > maxWidth)
+            maxWidth = width;
+        if (r + 1 > depth)
+            depth = r + 1;
+    }
+    return { depth, maxWidth };
+}
+function countComponents(nodes, links) {
+    const parent = new Map();
+    for (const node of nodes)
+        parent.set(node.id, node.id);
+    const find = (x) => {
+        let root = x;
+        while (parent.get(root) !== root)
+            root = parent.get(root);
+        return root;
+    };
+    for (const link of links) {
+        const a = find(link.sourceNodeId);
+        const b = find(link.targetNodeId);
+        if (a !== b)
+            parent.set(a, b);
+    }
+    const roots = new Set();
+    for (const node of nodes)
+        roots.add(find(node.id));
+    return roots.size;
+}
+/**
+ * The candidate pool, in a FIXED order.
+ *
+ * Auto-tuning lives here too: a candidate is an algorithm PLUS its knobs, so
+ * `dagre TB` and `dagre LR` compete as separate candidates and the better
+ * direction simply wins on score. That is the whole of "auto-tune" — no separate
+ * tuning pass, just more candidates in the bake-off.
+ */
+function buildCandidates(shape, registry) {
+    const all = [
+        // Wave 7 Cards 1/5 — our own layered engine. In the pool like anything else: it
+        // wins on merit or it does not win. (It is, however, the only engine that can
+        // honour semantic constraints, which is why the incremental/mental-map path
+        // names it explicitly instead of going through this bake-off.)
+        { id: 'layered:TB', name: 'layered', options: { direction: 'TB' }, portAware: false },
+        { id: 'layered:LR', name: 'layered', options: { direction: 'LR' }, portAware: false },
+        { id: 'dagre:TB', name: 'dagre', options: { direction: 'TB' }, portAware: false },
+        { id: 'dagre:LR', name: 'dagre', options: { direction: 'LR' }, portAware: false },
+        {
+            id: 'elk:layered:RIGHT',
+            name: 'elk',
+            options: { direction: 'LR', algorithm: 'layered' },
+            portAware: true,
+        },
+        {
+            id: 'elk:layered:DOWN',
+            name: 'elk',
+            options: { direction: 'TB', algorithm: 'layered' },
+            portAware: true,
+        },
+        {
+            id: 'elk:mrtree',
+            name: 'elk',
+            options: { algorithm: 'mrtree' },
+            portAware: false,
+        },
+        {
+            id: 'elk:stress',
+            name: 'elk',
+            options: { algorithm: 'stress' },
+            portAware: false,
+        },
+        { id: 'force', name: 'force', options: {}, portAware: false },
+    ];
+    return all.filter((candidate) => {
+        if (!registry.has(candidate.name))
+            return false;
+        // Shape gating — which candidates are worth RUNNING. Never which one wins.
+        if (candidate.id === 'elk:mrtree' && !shape.isTree)
+            return false;
+        // A hierarchical layout on a graph with no hierarchy is a waste of a run.
+        if (candidate.name === 'dagre' && !shape.isDAG && shape.density > 0.5)
+            return false;
+        // Force on a big graph is slow and rarely wins against layered.
+        if (candidate.name === 'force' && shape.nodeCount > FORCE_NODE_LIMIT)
+            return false;
+        // Stress majorisation is O(n²) per sweep with n-proportional sweeps — measured
+        // at 33 SECONDS for a 300-node chain (perf spec). It only earns its keep on
+        // small organic graphs; above this it is the single candidate that turns the
+        // whole bake-off into a hang.
+        if (candidate.id === 'elk:stress' && shape.nodeCount > STRESS_NODE_LIMIT)
+            return false;
+        return true;
+    });
+}
+/** Above this, the force candidate is not worth its runtime. */
+const FORCE_NODE_LIMIT = 200;
+/** Above this, elk:stress costs seconds (33s at n=300, measured) and is excluded. */
+const STRESS_NODE_LIMIT = 100;
+// ---------------------------------------------------------------------------
+// Scale-aware direct pick (no bake-off above BAKEOFF_NODE_LIMIT)
+// ---------------------------------------------------------------------------
+/**
+ * Above this many nodes the bake-off itself is the pathology: it runs EVERY
+ * candidate engine on the full graph, so its runtime is the SUM of the field —
+ * including whichever engine happens to hang at that scale (measured: 16s+ at
+ * 300 nodes, unbounded at 2,000). Past this limit the graph is classified
+ * structurally and ONE engine is picked directly; the choice is still
+ * deterministic and still explained in the selection report.
+ */
+exports.BAKEOFF_NODE_LIMIT = 200;
+/**
+ * Rank-width ceiling for our layered (Sugiyama) engine. Measured: 45-wide mesh
+ * ranks are fast (~480ms at n=2025); ~1,000-wide tree ranks take 5s+ and a
+ * 2,000-node sparse DAG with wide ranks never returned.
+ */
+const LAYERED_RANK_WIDTH_LIMIT = 100;
+/**
+ * Rank-depth ceiling for dagre. Measured: ~700ms at 1,000-wide/11-deep,
+ * ~790ms at a 1,000-rank chain, unbounded at a 2,000-rank chain.
+ */
+const DAGRE_RANK_DEPTH_LIMIT = 600;
+/**
+ * Pick the engine(s) for a graph too large to bake off, from its STRUCTURE.
+ *
+ * Every branch below is backed by a measurement in layout-auto-select.perf.spec.ts
+ * (times on the dev machine, generous CI caps in the spec):
+ *
+ *   tree            → portfolio `tree`: 19ms at n=2000 (vs dagre 702ms, layered 5.3s)
+ *   DAG, narrow     → `layered`: 156ms at 900-mesh, 479ms at 2025-mesh,
+ *                     132ms at a 2,000-deep chain — width is what hurts it, and
+ *                     narrow ranks are exactly where dagre's depth pathology lives.
+ *   DAG, wide+shallow → `dagre`: 1.3s at a 2,000-node sparse DAG whose ~1,000-wide
+ *                     ranks are what kill layered.
+ *   DAG, wide+deep  → `elk` layered: the moderate-everywhere engine.
+ *   cyclic          → `force`: completes in well under a second at this scale;
+ *                     hierarchical engines would first have to break the cycles.
+ *
+ * Declared ports bump ELK (the only port-aware candidate) to the front for
+ * hierarchical graphs — at this scale we cannot afford to MEASURE port respect
+ * across a whole field, so we pick the engine built to honour it.
+ *
+ * Returns undefined when none of the preferred engines is registered; the caller
+ * then falls back to the (gated) bake-off rather than failing.
+ */
+function pickEngineForScale(shape, nodes, links, registry) {
+    const pool = {
+        tree: { id: 'tree', name: 'tree', options: {}, portAware: false },
+        'layered:TB': { id: 'layered:TB', name: 'layered', options: { direction: 'TB' }, portAware: false },
+        'dagre:TB': { id: 'dagre:TB', name: 'dagre', options: { direction: 'TB' }, portAware: false },
+        'elk:layered:DOWN': {
+            id: 'elk:layered:DOWN',
+            name: 'elk',
+            options: { direction: 'TB', algorithm: 'layered' },
+            portAware: true,
+        },
+        'elk:mrtree': {
+            id: 'elk:mrtree',
+            name: 'elk',
+            options: { algorithm: 'mrtree' },
+            portAware: false,
+        },
+        force: { id: 'force', name: 'force', options: {}, portAware: false },
+        grid: { id: 'grid', name: 'grid', options: {}, portAware: false },
+        circular: { id: 'circular', name: 'circular', options: {}, portAware: false },
+    };
+    let prefer;
+    let why;
+    if (shape.isTree) {
+        why = `the graph is a tree (${shape.nodeCount} nodes)`;
+        prefer = ['tree', 'dagre:TB', 'elk:mrtree', 'elk:layered:DOWN', 'layered:TB'];
+    }
+    else if (shape.isDAG) {
+        const { depth, maxWidth } = estimateLayering(nodes, links);
+        if (maxWidth <= LAYERED_RANK_WIDTH_LIMIT) {
+            why = `the graph is a DAG with narrow ranks (max width ${maxWidth} across ${depth} layers)`;
+            prefer = ['layered:TB', 'elk:layered:DOWN', 'dagre:TB'];
+        }
+        else if (depth <= DAGRE_RANK_DEPTH_LIMIT) {
+            why = `the graph is a DAG with wide, shallow ranks (max width ${maxWidth}, ${depth} layers)`;
+            prefer = ['dagre:TB', 'elk:layered:DOWN', 'layered:TB'];
+        }
+        else {
+            why = `the graph is a DAG with ranks both wide (${maxWidth}) and deep (${depth})`;
+            prefer = ['elk:layered:DOWN', 'dagre:TB', 'layered:TB'];
+        }
+    }
+    else {
+        why = `the graph has cycles (density ${shape.density.toFixed(3)})`;
+        prefer = ['force', 'grid', 'circular'];
+    }
+    // Ports at scale: pick the port-aware engine instead of measuring the field.
+    if (shape.hasDeclaredPorts && (shape.isTree || shape.isDAG)) {
+        why += ', and nodes declare ports (ELK is the port-aware engine)';
+        prefer = ['elk:layered:DOWN', ...prefer.filter((id) => id !== 'elk:layered:DOWN')];
+    }
+    const candidates = prefer.map((id) => pool[id]).filter((c) => registry.has(c.name));
+    if (candidates.length === 0)
+        return undefined;
+    return { candidates, why };
+}
+/**
+ * How many nodes the quality metrics see on the direct (no-bake-off) path.
+ * The classic metrics are O(n²)/O(m²) — 1.2s+ at n=2000, measured — so the
+ * report is scored on a deterministic stride sample instead of the full graph.
+ */
+const METRIC_SAMPLE_LIMIT = 300;
+function sampleForMetrics(nodes, links) {
+    if (nodes.length <= METRIC_SAMPLE_LIMIT)
+        return { nodes, links, sampled: false };
+    // Nodes are already in canonical id order, so a stride sample is deterministic.
+    const stride = Math.ceil(nodes.length / METRIC_SAMPLE_LIMIT);
+    const kept = nodes.filter((_, i) => i % stride === 0);
+    const ids = new Set(kept.map((n) => n.id));
+    return {
+        nodes: kept,
+        links: links.filter((l) => { var _a, _b; return ids.has((_a = l.sourceNodeId) !== null && _a !== void 0 ? _a : '') && ids.has((_b = l.targetNodeId) !== null && _b !== void 0 ? _b : ''); }),
+        sampled: true,
+    };
+}
+/**
+ * How much each measure counts.
+ *
+ * Port respect and label clearance are weighted HARD, and deliberately: a layout
+ * that runs an edge backwards out of its port, or drops a label on a node, is
+ * WRONG in a way that a slightly-larger bounding box is not. They are also the two
+ * things every other JS engine ignores — which is the whole point of this card.
+ */
+const WEIGHTS = {
+    quality: 0.4, // the six classic metrics, already weighted among themselves
+    portRespect: 0.3,
+    labelClearance: 0.2,
+    compactness: 0.1, // bends + area, relative to the best candidate
+};
+/**
+ * Score one laid-out candidate. `area`/`bends` are scored RELATIVE to the rest of
+ * the field (see `scoreField`), so this returns the raw measures.
+ */
+function measure(candidate, nodes, links, result) {
+    const quality = layout_quality_metrics_1.LayoutQualityMetrics.assess(nodes, links, { includeSuggestions: true });
+    return {
+        id: candidate.id,
+        name: candidate.name,
+        options: candidate.options,
+        quality,
+        portRespect: (0, layout_quality_extended_1.assessPortRespect)(nodes, links).score,
+        labelClearance: (0, layout_quality_extended_1.assessLabelClearance)(nodes, links, result).score,
+        bends: (0, layout_quality_extended_1.countBends)(result),
+        area: (0, layout_quality_extended_1.layoutArea)(result),
+    };
+}
+/**
+ * Turn raw measures into final scores. Compactness is relative — the tightest
+ * candidate in the field gets 100 and the rest are scored against it — because an
+ * absolute px² threshold means nothing without knowing the graph.
+ */
+function scoreField(raw) {
+    const areas = raw.map((r) => r.area).filter((a) => a > 0);
+    const bestArea = areas.length > 0 ? Math.min(...areas) : 0;
+    const bendCounts = raw.map((r) => r.bends).filter((b) => b !== undefined);
+    const bestBends = bendCounts.length > 0 ? Math.min(...bendCounts) : undefined;
+    return raw.map((r) => {
+        // Area: best in field = 100, twice the best = 50, and so on.
+        const areaScore = bestArea > 0 && r.area > 0 ? Math.max(0, (bestArea / r.area) * 100) : 100;
+        // Bends: best in field = 100, decaying with each extra bend. An engine that
+        // reported no routes is NOT scored on bends (it gets the field's average
+        // rather than a free 100 — silence must not beat a measured result).
+        let bendScore;
+        if (r.bends === undefined || bestBends === undefined) {
+            bendScore = 50;
+        }
+        else {
+            bendScore = Math.max(0, 100 - (r.bends - bestBends) * BEND_PENALTY);
+        }
+        const compactness = areaScore * 0.5 + bendScore * 0.5;
+        const score = r.quality.overallScore * WEIGHTS.quality +
+            r.portRespect * WEIGHTS.portRespect +
+            r.labelClearance * WEIGHTS.labelClearance +
+            compactness * WEIGHTS.compactness;
+        return Object.assign(Object.assign({}, r), { score: Math.round(score * 100) / 100 });
+    });
+}
+/** Each bend past the field's best costs this much of the bend score. */
+const BEND_PENALTY = 5;
+/**
+ * Say — in one sentence — why this candidate won. The sentence names the measure
+ * that actually decided it, not a generic "it scored highest".
+ */
+function explain(winner, field, shape) {
+    const runnerUp = field.find((c) => c.id !== winner.id);
+    if (!runnerUp) {
+        return `${winner.id} was the only candidate that ran (score ${winner.score}).`;
+    }
+    // Which measure separated them the most? That is the honest reason.
+    const gaps = [
+        ['port respect', (winner.portRespect - runnerUp.portRespect) * WEIGHTS.portRespect],
+        ['label clearance', (winner.labelClearance - runnerUp.labelClearance) * WEIGHTS.labelClearance],
+        [
+            'layout quality (crossings, overlap, symmetry)',
+            (winner.quality.overallScore - runnerUp.quality.overallScore) * WEIGHTS.quality,
+        ],
+    ];
+    gaps.sort((a, b) => b[1] - a[1]);
+    const [decisive, margin] = gaps[0];
+    const shapeNote = shape.isTree
+        ? 'the graph is a tree'
+        : shape.isDAG
+            ? 'the graph is acyclic'
+            : `the graph has cycles (density ${shape.density.toFixed(2)})`;
+    const because = margin > 0
+        ? `it beat ${runnerUp.id} on ${decisive}`
+        : `it edged out ${runnerUp.id} on the combined score`;
+    return `Chose ${winner.id} (score ${winner.score} vs ${runnerUp.score}): ${because}. Context: ${shapeNote}${shape.hasDeclaredPorts ? ', nodes declare ports' : ''}${shape.hasEdgeLabels ? ', edges carry labels' : ''}.`;
+}
+/**
+ * Run the bake-off and keep the best layout.
+ *
+ * IMPORTANT — this MUTATES node positions while it works: each candidate has to be
+ * applied to the model before its quality can be measured (crossings are a
+ * property of a drawn graph, not of a plan). The winner's positions are re-applied
+ * at the end, so the model always lands on the layout we chose, never on the last
+ * one we happened to try. `DiagramEngine.layout()` then commits them through
+ * `setPosition()` as usual.
+ */
+function autoSelectLayout(diagram_1, registry_1) {
+    return tslib_1.__awaiter(this, arguments, void 0, function* (diagram, registry, options = {}) {
+        var _a, _b, _c, _d;
+        // Canonical input order — the Card 0 invariant. Without it the candidates see
+        // different graphs on a reload and the "deterministic" selector picks differently.
+        const nodes = [...diagram.getNodes()].sort((a, b) => (a.id < b.id ? -1 : a.id > b.id ? 1 : 0));
+        const links = [...diagram.getLinks()].sort((a, b) => (a.id < b.id ? -1 : a.id > b.id ? 1 : 0));
+        const shape = analyseGraphShape(nodes, links);
+        // Above the bake-off limit, running every candidate would cost the SUM of the
+        // field's runtimes — including whichever engine hangs at this scale. Classify
+        // the structure and pick directly instead. (Below the limit, nothing changes:
+        // the full measured bake-off runs exactly as before.)
+        if (shape.nodeCount > exports.BAKEOFF_NODE_LIMIT) {
+            const plan = pickEngineForScale(shape, nodes, links, registry);
+            if (plan) {
+                return applyDirectPick(plan, shape, diagram, registry, nodes, links, options);
+            }
+        }
+        const candidates = buildCandidates(shape, registry);
+        if (candidates.length === 0) {
+            throw new Error('Auto-layout: no candidate algorithms are registered.');
+        }
+        // Remember where everything started, so a failed candidate cannot leave the
+        // model half-laid-out.
+        const original = new Map(nodes.map((n) => [n.id, { x: n.position.x, y: n.position.y }]));
+        const seed = (_a = options.seed) !== null && _a !== void 0 ? _a : rng_1.DEFAULT_LAYOUT_SEED;
+        const raw = [];
+        const results = new Map();
+        for (const candidate of candidates) {
+            const engine = registry.get(candidate.name);
+            try {
+                // Every candidate gets the SAME seed. A candidate that won because it drew a
+                // luckier random number is a candidate that will lose on the next reload.
+                const result = yield engine.apply(diagram, Object.assign(Object.assign(Object.assign({}, options), candidate.options), { seed }));
+                // Apply, then measure. Crossings and label collisions are properties of a
+                // DRAWN graph — they cannot be read off a position map alone.
+                applyPositions(nodes, result);
+                raw.push(measure(candidate, nodes, links, result));
+                results.set(candidate.id, result);
+            }
+            catch (error) {
+                raw.push({
+                    id: candidate.id,
+                    name: candidate.name,
+                    options: candidate.options,
+                    quality: layout_quality_metrics_1.LayoutQualityMetrics.assess([], []),
+                    portRespect: 0,
+                    labelClearance: 0,
+                    bends: undefined,
+                    area: 0,
+                    error: error instanceof Error ? error.message : String(error),
+                });
+            }
+            finally {
+                restorePositions(nodes, original);
+            }
+        }
+        const scored = scoreField(raw).sort(
+        // Highest score wins; a tie breaks on candidate id, so the order is total and
+        // the same graph always yields the same winner.
+        (a, b) => b.score - a.score || (a.id < b.id ? -1 : a.id > b.id ? 1 : 0));
+        const winner = scored.find((c) => !c.error);
+        if (!winner) {
+            throw new Error(`Auto-layout: every candidate failed. First error: ${(_c = (_b = scored[0]) === null || _b === void 0 ? void 0 : _b.error) !== null && _c !== void 0 ? _c : 'unknown'}`);
+        }
+        const winning = results.get(winner.id);
+        applyPositions(nodes, winning);
+        return Object.assign(Object.assign({}, winning), { metadata: Object.assign(Object.assign({}, ((_d = winning.metadata) !== null && _d !== void 0 ? _d : { algorithm: winner.name, executionTime: 0 })), { algorithm: winner.name, autoSelected: winner.id }), selection: {
+                chosen: winner.id,
+                algorithm: winner.name,
+                reason: explain(winner, scored, shape),
+                shape,
+                candidates: scored,
+            } });
+    });
+}
+/**
+ * The direct (no-bake-off) path: run the structurally-picked engine, score it on
+ * a bounded sample so the report still shows its working, and fall through the
+ * plan's alternates only if an engine actually fails.
+ *
+ * Deterministic by construction: the pick is a pure function of graph structure,
+ * and the engine runs with the same fixed seed the bake-off would have used.
+ */
+function applyDirectPick(plan, shape, diagram, registry, nodes, links, options) {
+    return tslib_1.__awaiter(this, void 0, void 0, function* () {
+        var _a, _b, _c, _d;
+        const seed = (_a = options.seed) !== null && _a !== void 0 ? _a : rng_1.DEFAULT_LAYOUT_SEED;
+        const original = new Map(nodes.map((n) => [n.id, { x: n.position.x, y: n.position.y }]));
+        const failures = [];
+        for (const candidate of plan.candidates) {
+            const engine = registry.get(candidate.name);
+            let result;
+            try {
+                result = yield engine.apply(diagram, Object.assign(Object.assign(Object.assign({}, options), candidate.options), { seed }));
+            }
+            catch (error) {
+                restorePositions(nodes, original);
+                failures.push({
+                    id: candidate.id,
+                    name: candidate.name,
+                    options: candidate.options,
+                    score: 0,
+                    quality: layout_quality_metrics_1.LayoutQualityMetrics.assess([], []),
+                    portRespect: 0,
+                    labelClearance: 0,
+                    bends: undefined,
+                    area: 0,
+                    error: error instanceof Error ? error.message : String(error),
+                });
+                continue;
+            }
+            applyPositions(nodes, result);
+            // Score on a bounded sample — the full-graph metrics are O(n²)/O(m²) and at
+            // this scale would cost more than the layout did.
+            const sample = sampleForMetrics(nodes, links);
+            const [winner] = scoreField([measure(candidate, sample.nodes, sample.links, result)]);
+            const reason = `Chose ${candidate.id} structurally, without a bake-off: ${plan.why}. ` +
+                `${shape.nodeCount} nodes is above the ${exports.BAKEOFF_NODE_LIMIT}-node bake-off limit` +
+                (sample.sampled ? `; quality scored on a ${sample.nodes.length}-node sample.` : '.');
+            return Object.assign(Object.assign({}, result), { metadata: Object.assign(Object.assign({}, ((_b = result.metadata) !== null && _b !== void 0 ? _b : { algorithm: candidate.name, executionTime: 0 })), { algorithm: candidate.name, autoSelected: candidate.id }), selection: {
+                    chosen: candidate.id,
+                    algorithm: candidate.name,
+                    reason,
+                    shape,
+                    candidates: [winner, ...failures],
+                } });
+        }
+        throw new Error(`Auto-layout: every structurally-picked engine failed. First error: ${(_d = (_c = failures[0]) === null || _c === void 0 ? void 0 : _c.error) !== null && _d !== void 0 ? _d : 'unknown'}`);
+    });
+}
+function applyPositions(nodes, result) {
+    for (const node of nodes) {
+        const position = result.nodePositions.get(node.id);
+        if (position)
+            node.setPosition(position.x, position.y);
+    }
+}
+function restorePositions(nodes, original) {
+    for (const node of nodes) {
+        const position = original.get(node.id);
+        if (position)
+            node.setPosition(position.x, position.y);
+    }
+}
+//# sourceMappingURL=layout-auto-select.js.map

package/src/libs/engine/src/layout/layout-auto-select.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"layout-auto-select.js","sourceRoot":"","sources":["../../../../../../engine/src/layout/layout-auto-select.ts"],"names":[],"mappings":";AAAA,4DAA4D;AAC5D,EAAE;AACF,8EAA8E;AAC9E,mBAAmB;AACnB,8EAA8E;AAC9E,EAAE;AACF,iFAAiF;AACjF,4EAA4E;AAC5E,kFAAkF;AAClF,iFAAiF;AACjF,oCAAoC;AACpC,EAAE;AACF,gFAAgF;AAChF,mFAAmF;AACnF,iEAAiE;AACjE,EAAE;AACF,8EAA8E;AAC9E,yDAAyD;AACzD,8EAA8E;AAC9E,EAAE;AACF,iFAAiF;AACjF,kFAAkF;AAClF,wEAAwE;AACxE,iFAAiF;AACjF,EAAE;AACF,kFAAkF;AAClF,mFAAmF;AACnF,gFAAgF;AAChF,gFAAgF;AAChF,kEAAkE;;;AA8ClE,8CA6BC;AAsDD,4CA6CC;AA8CD,0CAyDC;AAkED,gDA2DC;AAgND,4CAkGC;;AA7rBD,qEAAqF;AACrF,uEAKmC;AACnC,2DAAoE;AACpE,+BAA4C;AAE5C,wDAAwD;AAC3C,QAAA,gBAAgB,GAAG,MAAM,CAAC;AA4BvC,SAAgB,iBAAiB,CAAC,KAAkB,EAAE,KAAkB;;IACtE,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC;IAC/B,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,IAAI,CAAC,CAAC,YAAY,CAAC,CAAC;IACnE,MAAM,SAAS,GAAG,IAAI,CAAC,MAAM,CAAC;IAE9B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAC3B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC3B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,IAAI,EAAE,CAAC;QACxB,MAAA,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,YAAa,CAAC,0CAAE,IAAI,CAAC,IAAI,CAAC,YAAa,CAAC,CAAC;QAC5D,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAa,EAAE,CAAC,MAAA,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAa,CAAC,mCAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAChF,CAAC;IAED,MAAM,QAAQ,GAAG,SAAS,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,CAAC,SAAS,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACvE,MAAM,OAAO,GAAG,SAAS,GAAG,QAAQ,CAAC;IAErC,OAAO;QACL,SAAS;QACT,SAAS;QACT,OAAO;QACP,MAAM,EAAE,MAAM,CAAC,KAAK,EAAE,IAAI,EAAE,QAAQ,CAAC;QACrC,KAAK,EAAE,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC;QAClC,UAAU,EAAE,eAAe,CAAC,KAAK,EAAE,IAAI,CAAC;QACxC,gBAAgB,EAAE,IAAA,mCAAe,EAAC,KAAK,CAAC,CAAC,MAAM,GAAG,CAAC;QACnD,aAAa,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,IAAA,gCAAY,EAAC,CAAC,CAAC,KAAK,SAAS,CAAC;KAChE,CAAC;AACJ,CAAC;AAED,SAAS,MAAM,CAAC,KAAkB,EAAE,KAAkB,EAAE,QAA6B;;IACnF,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,KAAK,CAAC;IACrC,8EAA8E;IAC9E,yCAAyC;IACzC,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,IAAI,CAAC,MAAA,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,mCAAI,CAAC,CAAC,GAAG,CAAC;YAAE,OAAO,KAAK,CAAC;IAC7E,OAAO,KAAK,CAAC,MAAM,KAAK,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,eAAe,CAAC,KAAK,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;AAClF,CAAC;AAED,SAAS,SAAS,CAAC,KAAkB,EAAE,SAAgC;IACrE,MAAM,KAAK,GAAG,CAAC,CAAC;IAChB,MAAM,IAAI,GAAG,CAAC,CAAC;IACf,MAAM,KAAK,GAAG,CAAC,CAAC;IAChB,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;IAErD,MAAM,KAAK,GAAG,CAAC,EAAU,EAAW,EAAE;;QACpC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACrB,KAAK,MAAM,IAAI,IAAI,MAAA,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,mCAAI,EAAE,EAAE,CAAC;YAC3C,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC3B,IAAI,CAAC,KAAK,IAAI;gBAAE,OAAO,KAAK,CAAC,CAAC,qBAAqB;YACnD,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC;gBAAE,OAAO,KAAK,CAAC;QAChD,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACtB,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,KAAK,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,OAAO,KAAK,CAAC;IACrE,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAsBD,SAAgB,gBAAgB,CAAC,KAAkB,EAAE,KAAkB;;IACrE,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,SAAS,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC9C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;IAC7B,CAAC;IACD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,YAAY,IAAI,CAAC,IAAI,CAAC,YAAY;YAAE,SAAS;QACvD,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC;YAAE,SAAS;QACnF,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAE,CAAC,IAAI,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAC1D,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAE,GAAG,CAAC,CAAC,CAAC;IACxE,CAAC;IAED,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;YAChC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACrB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IACD,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,OAAO,IAAI,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC;QAC3B,MAAM,EAAE,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;QACzB,MAAM,CAAC,GAAG,MAAA,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,mCAAI,CAAC,CAAC;QAC5B,KAAK,MAAM,IAAI,IAAI,MAAA,SAAS,CAAC,GAAG,CAAC,EAAE,CAAC,mCAAI,EAAE,EAAE,CAAC;YAC3C,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,MAAA,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,mCAAI,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACrD,MAAM,SAAS,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,GAAG,CAAC,CAAC;YAC1C,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAC9B,IAAI,SAAS,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxC,CAAC;IACH,CAAC;IAED,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,IAAI,QAAQ,GAAG,CAAC,CAAC;IACjB,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,MAAA,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,mCAAI,CAAC,CAAC;QACjC,MAAM,KAAK,GAAG,CAAC,MAAA,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,mCAAI,CAAC,CAAC,GAAG,CAAC,CAAC;QACvC,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;QACrB,IAAI,KAAK,GAAG,QAAQ;YAAE,QAAQ,GAAG,KAAK,CAAC;QACvC,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK;YAAE,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC;IACnC,CAAC;IACD,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,CAAC;AAC7B,CAAC;AAED,SAAS,eAAe,CAAC,KAAkB,EAAE,KAAkB;IAC7D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;IAEvD,MAAM,IAAI,GAAG,CAAC,CAAS,EAAU,EAAE;QACjC,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,OAAO,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,IAAI;YAAE,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC;QAC3D,OAAO,IAAI,CAAC;IACd,CAAC,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,YAAa,CAAC,CAAC;QACnC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,YAAa,CAAC,CAAC;QACnC,IAAI,CAAC,KAAK,CAAC;YAAE,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAChC,CAAC;IAED,MAAM,KAAK,GAAG,IAAI,GAAG,EAAU,CAAC;IAChC,KAAK,MAAM,IAAI,IAAI,KAAK;QAAE,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,OAAO,KAAK,CAAC,IAAI,CAAC;AACpB,CAAC;AAiBD;;;;;;;GAOG;AACH,SAAgB,eAAe,CAAC,KAAiB,EAAE,QAAwB;IACzE,MAAM,GAAG,GAAsB;QAC7B,gFAAgF;QAChF,8EAA8E;QAC9E,4EAA4E;QAC5E,+DAA+D;QAC/D,EAAE,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE;QACrF,EAAE,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE;QACrF,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE;QACjF,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE;QACjF;YACE,EAAE,EAAE,mBAAmB;YACvB,IAAI,EAAE,KAAK;YACX,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAA0B;YAC1E,SAAS,EAAE,IAAI;SAChB;QACD;YACE,EAAE,EAAE,kBAAkB;YACtB,IAAI,EAAE,KAAK;YACX,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAA0B;YAC1E,SAAS,EAAE,IAAI;SAChB;QACD;YACE,EAAE,EAAE,YAAY;YAChB,IAAI,EAAE,KAAK;YACX,OAAO,EAAE,EAAE,SAAS,EAAE,QAAQ,EAA0B;YACxD,SAAS,EAAE,KAAK;SACjB;QACD;YACE,EAAE,EAAE,YAAY;YAChB,IAAI,EAAE,KAAK;YACX,OAAO,EAAE,EAAE,SAAS,EAAE,QAAQ,EAA0B;YACxD,SAAS,EAAE,KAAK;SACjB;QACD,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE;KAC9D,CAAC;IAEF,OAAO,GAAG,CAAC,MAAM,CAAC,CAAC,SAAS,EAAE,EAAE;QAC9B,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAC;YAAE,OAAO,KAAK,CAAC;QAEhD,2EAA2E;QAC3E,IAAI,SAAS,CAAC,EAAE,KAAK,YAAY,IAAI,CAAC,KAAK,CAAC,MAAM;YAAE,OAAO,KAAK,CAAC;QAEjE,0EAA0E;QAC1E,IAAI,SAAS,CAAC,IAAI,KAAK,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,IAAI,KAAK,CAAC,OAAO,GAAG,GAAG;YAAE,OAAO,KAAK,CAAC;QAEpF,gEAAgE;QAChE,IAAI,SAAS,CAAC,IAAI,KAAK,OAAO,IAAI,KAAK,CAAC,SAAS,GAAG,gBAAgB;YAAE,OAAO,KAAK,CAAC;QAEnF,+EAA+E;QAC/E,4EAA4E;QAC5E,6EAA6E;QAC7E,8BAA8B;QAC9B,IAAI,SAAS,CAAC,EAAE,KAAK,YAAY,IAAI,KAAK,CAAC,SAAS,GAAG,iBAAiB;YAAE,OAAO,KAAK,CAAC;QAEvF,OAAO,IAAI,CAAC;IACd,CAAC,CAAC,CAAC;AACL,CAAC;AAED,gEAAgE;AAChE,MAAM,gBAAgB,GAAG,GAAG,CAAC;AAE7B,qFAAqF;AACrF,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAE9B,8EAA8E;AAC9E,iEAAiE;AACjE,8EAA8E;AAE9E;;;;;;;GAOG;AACU,QAAA,kBAAkB,GAAG,GAAG,CAAC;AAEtC;;;;GAIG;AACH,MAAM,wBAAwB,GAAG,GAAG,CAAC;AAErC;;;GAGG;AACH,MAAM,sBAAsB,GAAG,GAAG,CAAC;AAUnC;;;;;;;;;;;;;;;;;;;;;;GAsBG;AACH,SAAgB,kBAAkB,CAChC,KAAiB,EACjB,KAAkB,EAClB,KAAkB,EAClB,QAAwB;IAExB,MAAM,IAAI,GAAoC;QAC5C,IAAI,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE;QACjE,YAAY,EAAE,EAAE,EAAE,EAAE,YAAY,EAAE,IAAI,EAAE,SAAS,EAAE,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE;QACnG,UAAU,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE;QAC7F,kBAAkB,EAAE;YAClB,EAAE,EAAE,kBAAkB;YACtB,IAAI,EAAE,KAAK;YACX,OAAO,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,SAAS,EAAE,SAAS,EAA0B;YAC1E,SAAS,EAAE,IAAI;SAChB;QACD,YAAY,EAAE;YACZ,EAAE,EAAE,YAAY;YAChB,IAAI,EAAE,KAAK;YACX,OAAO,EAAE,EAAE,SAAS,EAAE,QAAQ,EAA0B;YACxD,SAAS,EAAE,KAAK;SACjB;QACD,KAAK,EAAE,EAAE,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE;QACpE,IAAI,EAAE,EAAE,EAAE,EAAE,MAAM,EAAE,IAAI,EAAE,MAAM,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE;QACjE,QAAQ,EAAE,EAAE,EAAE,EAAE,UAAU,EAAE,IAAI,EAAE,UAAU,EAAE,OAAO,EAAE,EAAE,EAAE,SAAS,EAAE,KAAK,EAAE;KAC9E,CAAC;IAEF,IAAI,MAAgB,CAAC;IACrB,IAAI,GAAW,CAAC;IAEhB,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QACjB,GAAG,GAAG,wBAAwB,KAAK,CAAC,SAAS,SAAS,CAAC;QACvD,MAAM,GAAG,CAAC,MAAM,EAAE,UAAU,EAAE,YAAY,EAAE,kBAAkB,EAAE,YAAY,CAAC,CAAC;IAChF,CAAC;SAAM,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QACvB,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,GAAG,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAC3D,IAAI,QAAQ,IAAI,wBAAwB,EAAE,CAAC;YACzC,GAAG,GAAG,mDAAmD,QAAQ,WAAW,KAAK,UAAU,CAAC;YAC5F,MAAM,GAAG,CAAC,YAAY,EAAE,kBAAkB,EAAE,UAAU,CAAC,CAAC;QAC1D,CAAC;aAAM,IAAI,KAAK,IAAI,sBAAsB,EAAE,CAAC;YAC3C,GAAG,GAAG,0DAA0D,QAAQ,KAAK,KAAK,UAAU,CAAC;YAC7F,MAAM,GAAG,CAAC,UAAU,EAAE,kBAAkB,EAAE,YAAY,CAAC,CAAC;QAC1D,CAAC;aAAM,CAAC;YACN,GAAG,GAAG,4CAA4C,QAAQ,eAAe,KAAK,GAAG,CAAC;YAClF,MAAM,GAAG,CAAC,kBAAkB,EAAE,UAAU,EAAE,YAAY,CAAC,CAAC;QAC1D,CAAC;IACH,CAAC;SAAM,CAAC;QACN,GAAG,GAAG,iCAAiC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;QACnE,MAAM,GAAG,CAAC,OAAO,EAAE,MAAM,EAAE,UAAU,CAAC,CAAC;IACzC,CAAC;IAED,6EAA6E;IAC7E,IAAI,KAAK,CAAC,gBAAgB,IAAI,CAAC,KAAK,CAAC,MAAM,IAAI,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC;QAC5D,GAAG,IAAI,0DAA0D,CAAC;QAClE,MAAM,GAAG,CAAC,kBAAkB,EAAE,GAAG,MAAM,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,KAAK,kBAAkB,CAAC,CAAC,CAAC;IACrF,CAAC;IAED,MAAM,UAAU,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACpF,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,SAAS,CAAC;IAC9C,OAAO,EAAE,UAAU,EAAE,GAAG,EAAE,CAAC;AAC7B,CAAC;AAED;;;;GAIG;AACH,MAAM,mBAAmB,GAAG,GAAG,CAAC;AAEhC,SAAS,gBAAgB,CACvB,KAAkB,EAClB,KAAkB;IAElB,IAAI,KAAK,CAAC,MAAM,IAAI,mBAAmB;QAAE,OAAO,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,CAAC;IACjF,gFAAgF;IAChF,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,mBAAmB,CAAC,CAAC;IAC7D,MAAM,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,MAAM,KAAK,CAAC,CAAC,CAAC;IACtD,MAAM,GAAG,GAAG,IAAI,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3C,OAAO;QACL,KAAK,EAAE,IAAI;QACX,KAAK,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,eAAC,OAAA,GAAG,CAAC,GAAG,CAAC,MAAA,CAAC,CAAC,YAAY,mCAAI,EAAE,CAAC,IAAI,GAAG,CAAC,GAAG,CAAC,MAAA,CAAC,CAAC,YAAY,mCAAI,EAAE,CAAC,CAAA,EAAA,CAAC;QAC1F,OAAO,EAAE,IAAI;KACd,CAAC;AACJ,CAAC;AA2BD;;;;;;;GAOG;AACH,MAAM,OAAO,GAAG;IACd,OAAO,EAAE,GAAG,EAAE,6DAA6D;IAC3E,WAAW,EAAE,GAAG;IAChB,cAAc,EAAE,GAAG;IACnB,WAAW,EAAE,GAAG,EAAE,+CAA+C;CAClE,CAAC;AAEF;;;GAGG;AACH,SAAS,OAAO,CACd,SAA0B,EAC1B,KAAkB,EAClB,KAAkB,EAClB,MAAoB;IAEpB,MAAM,OAAO,GAAG,6CAAoB,CAAC,MAAM,CAAC,KAAK,EAAE,KAAK,EAAE,EAAE,kBAAkB,EAAE,IAAI,EAAE,CAAC,CAAC;IAExF,OAAO;QACL,EAAE,EAAE,SAAS,CAAC,EAAE;QAChB,IAAI,EAAE,SAAS,CAAC,IAAI;QACpB,OAAO,EAAE,SAAS,CAAC,OAAO;QAC1B,OAAO;QACP,WAAW,EAAE,IAAA,2CAAiB,EAAC,KAAK,EAAE,KAAK,CAAC,CAAC,KAAK;QAClD,cAAc,EAAE,IAAA,8CAAoB,EAAC,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,KAAK;QAChE,KAAK,EAAE,IAAA,oCAAU,EAAC,MAAM,CAAC;QACzB,IAAI,EAAE,IAAA,oCAAU,EAAC,MAAM,CAAC;KACzB,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,SAAS,UAAU,CAAC,GAAyC;IAC3D,MAAM,KAAK,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IAC1D,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAE3D,MAAM,UAAU,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;IACvF,MAAM,SAAS,GAAG,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC;IAE9E,OAAO,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;QACnB,6DAA6D;QAC7D,MAAM,SAAS,GAAG,QAAQ,GAAG,CAAC,IAAI,CAAC,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,QAAQ,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC;QAE5F,4EAA4E;QAC5E,yEAAyE;QACzE,qEAAqE;QACrE,IAAI,SAAiB,CAAC;QACtB,IAAI,CAAC,CAAC,KAAK,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YACrD,SAAS,GAAG,EAAE,CAAC;QACjB,CAAC;aAAM,CAAC;YACN,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,SAAS,CAAC,GAAG,YAAY,CAAC,CAAC;QACtE,CAAC;QAED,MAAM,WAAW,GAAG,SAAS,GAAG,GAAG,GAAG,SAAS,GAAG,GAAG,CAAC;QAEtD,MAAM,KAAK,GACT,CAAC,CAAC,OAAO,CAAC,YAAY,GAAG,OAAO,CAAC,OAAO;YACxC,CAAC,CAAC,WAAW,GAAG,OAAO,CAAC,WAAW;YACnC,CAAC,CAAC,cAAc,GAAG,OAAO,CAAC,cAAc;YACzC,WAAW,GAAG,OAAO,CAAC,WAAW,CAAC;QAEpC,uCAAY,CAAC,KAAE,KAAK,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,GAAG,IAAG;IACxD,CAAC,CAAC,CAAC;AACL,CAAC;AAED,yEAAyE;AACzE,MAAM,YAAY,GAAG,CAAC,CAAC;AAuBvB;;;GAGG;AACH,SAAS,OAAO,CAAC,MAAsB,EAAE,KAAuB,EAAE,KAAiB;IACjF,MAAM,QAAQ,GAAG,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,MAAM,CAAC,EAAE,CAAC,CAAC;IACvD,IAAI,CAAC,QAAQ,EAAE,CAAC;QACd,OAAO,GAAG,MAAM,CAAC,EAAE,2CAA2C,MAAM,CAAC,KAAK,IAAI,CAAC;IACjF,CAAC;IAED,oEAAoE;IACpE,MAAM,IAAI,GAA4B;QACpC,CAAC,cAAc,EAAE,CAAC,MAAM,CAAC,WAAW,GAAG,QAAQ,CAAC,WAAW,CAAC,GAAG,OAAO,CAAC,WAAW,CAAC;QACnF,CAAC,iBAAiB,EAAE,CAAC,MAAM,CAAC,cAAc,GAAG,QAAQ,CAAC,cAAc,CAAC,GAAG,OAAO,CAAC,cAAc,CAAC;QAC/F;YACE,+CAA+C;YAC/C,CAAC,MAAM,CAAC,OAAO,CAAC,YAAY,GAAG,QAAQ,CAAC,OAAO,CAAC,YAAY,CAAC,GAAG,OAAO,CAAC,OAAO;SAChF;KACF,CAAC;IACF,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACjC,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,CAAC;IAEnC,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM;QAC5B,CAAC,CAAC,qBAAqB;QACvB,CAAC,CAAC,KAAK,CAAC,KAAK;YACX,CAAC,CAAC,sBAAsB;YACxB,CAAC,CAAC,iCAAiC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC,CAAC,GAAG,CAAC;IAEnE,MAAM,OAAO,GACX,MAAM,GAAG,CAAC;QACR,CAAC,CAAC,WAAW,QAAQ,CAAC,EAAE,OAAO,QAAQ,EAAE;QACzC,CAAC,CAAC,gBAAgB,QAAQ,CAAC,EAAE,wBAAwB,CAAC;IAE1D,OAAO,SAAS,MAAM,CAAC,EAAE,WAAW,MAAM,CAAC,KAAK,OAAO,QAAQ,CAAC,KAAK,MAAM,OAAO,cAAc,SAAS,GACvG,KAAK,CAAC,gBAAgB,CAAC,CAAC,CAAC,uBAAuB,CAAC,CAAC,CAAC,EACrD,GAAG,KAAK,CAAC,aAAa,CAAC,CAAC,CAAC,sBAAsB,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC;AAC1D,CAAC;AAWD;;;;;;;;;GASG;AACH,SAAsB,gBAAgB;iEACpC,OAAqB,EACrB,QAAwB,EACxB,UAAgC,EAAE;;QAElC,8EAA8E;QAC9E,mFAAmF;QACnF,MAAM,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC/F,MAAM,KAAK,GAAG,CAAC,GAAG,OAAO,CAAC,QAAQ,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/F,MAAM,KAAK,GAAG,iBAAiB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAE9C,8EAA8E;QAC9E,8EAA8E;QAC9E,8EAA8E;QAC9E,sDAAsD;QACtD,IAAI,KAAK,CAAC,SAAS,GAAG,0BAAkB,EAAE,CAAC;YACzC,MAAM,IAAI,GAAG,kBAAkB,CAAC,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;YAC/D,IAAI,IAAI,EAAE,CAAC;gBACT,OAAO,eAAe,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,EAAE,QAAQ,EAAE,KAAK,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC;YAChF,CAAC;QACH,CAAC;QAED,MAAM,UAAU,GAAG,eAAe,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;QAEpD,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YAC5B,MAAM,IAAI,KAAK,CAAC,sDAAsD,CAAC,CAAC;QAC1E,CAAC;QAED,4EAA4E;QAC5E,uBAAuB;QACvB,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACzF,MAAM,IAAI,GAAG,MAAA,OAAO,CAAC,IAAI,mCAAI,yBAAmB,CAAC;QAEjD,MAAM,GAAG,GAAyC,EAAE,CAAC;QACrD,MAAM,OAAO,GAAG,IAAI,GAAG,EAAwB,CAAC;QAEhD,KAAK,MAAM,SAAS,IAAI,UAAU,EAAE,CAAC;YACnC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAqB,CAAC;YAEhE,IAAI,CAAC;gBACH,6EAA6E;gBAC7E,0EAA0E;gBAC1E,MAAM,MAAM,GAAG,MAAM,MAAM,CAAC,KAAK,CAAC,OAAO,gDAAO,OAAO,GAAK,SAAS,CAAC,OAAO,KAAE,IAAI,IAAG,CAAC;gBAEvF,0EAA0E;gBAC1E,8DAA8D;gBAC9D,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;gBAC9B,GAAG,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC;gBACnD,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,EAAE,MAAM,CAAC,CAAC;YACpC,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,GAAG,CAAC,IAAI,CAAC;oBACP,EAAE,EAAE,SAAS,CAAC,EAAE;oBAChB,IAAI,EAAE,SAAS,CAAC,IAAI;oBACpB,OAAO,EAAE,SAAS,CAAC,OAAO;oBAC1B,OAAO,EAAE,6CAAoB,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC;oBAC5C,WAAW,EAAE,CAAC;oBACd,cAAc,EAAE,CAAC;oBACjB,KAAK,EAAE,SAAS;oBAChB,IAAI,EAAE,CAAC;oBACP,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;iBAC9D,CAAC,CAAC;YACL,CAAC;oBAAS,CAAC;gBACT,gBAAgB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;YACpC,CAAC;QACH,CAAC;QAED,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI;QACjC,8EAA8E;QAC9E,gDAAgD;QAChD,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CACxE,CAAC;QAEF,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC;QAC5C,IAAI,CAAC,MAAM,EAAE,CAAC;YACZ,MAAM,IAAI,KAAK,CACb,qDAAqD,MAAA,MAAA,MAAM,CAAC,CAAC,CAAC,0CAAE,KAAK,mCAAI,SAAS,EAAE,CACrF,CAAC;QACJ,CAAC;QAED,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAE,CAAC;QACxC,cAAc,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;QAE/B,uCACK,OAAO,KACV,QAAQ,kCACH,CAAC,MAAA,OAAO,CAAC,QAAQ,mCAAI,EAAE,SAAS,EAAE,MAAM,CAAC,IAAI,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,KACrE,SAAS,EAAE,MAAM,CAAC,IAAI,EACtB,YAAY,EAAE,MAAM,CAAC,EAAE,KAEzB,SAAS,EAAE;gBACT,MAAM,EAAE,MAAM,CAAC,EAAE;gBACjB,SAAS,EAAE,MAAM,CAAC,IAAI;gBACtB,MAAM,EAAE,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,CAAC;gBACtC,KAAK;gBACL,UAAU,EAAE,MAAM;aACnB,IACD;IACJ,CAAC;CAAA;AAED;;;;;;;GAOG;AACH,SAAe,eAAe,CAC5B,IAAe,EACf,KAAiB,EACjB,OAAqB,EACrB,QAAwB,EACxB,KAAkB,EAClB,KAAkB,EAClB,OAA6B;;;QAE7B,MAAM,IAAI,GAAG,MAAA,OAAO,CAAC,IAAI,mCAAI,yBAAmB,CAAC;QACjD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;QACzF,MAAM,QAAQ,GAAqB,EAAE,CAAC;QAEtC,KAAK,MAAM,SAAS,IAAI,IAAI,CAAC,UAAU,EAAE,CAAC;YACxC,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,CAAqB,CAAC;YAChE,IAAI,MAAoB,CAAC;YACzB,IAAI,CAAC;gBACH,MAAM,GAAG,MAAM,MAAM,CAAC,KAAK,CAAC,OAAO,gDAAO,OAAO,GAAK,SAAS,CAAC,OAAO,KAAE,IAAI,IAAG,CAAC;YACnF,CAAC;YAAC,OAAO,KAAK,EAAE,CAAC;gBACf,gBAAgB,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAClC,QAAQ,CAAC,IAAI,CAAC;oBACZ,EAAE,EAAE,SAAS,CAAC,EAAE;oBAChB,IAAI,EAAE,SAAS,CAAC,IAAI;oBACpB,OAAO,EAAE,SAAS,CAAC,OAAO;oBAC1B,KAAK,EAAE,CAAC;oBACR,OAAO,EAAE,6CAAoB,CAAC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC;oBAC5C,WAAW,EAAE,CAAC;oBACd,cAAc,EAAE,CAAC;oBACjB,KAAK,EAAE,SAAS;oBAChB,IAAI,EAAE,CAAC;oBACP,KAAK,EAAE,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;iBAC9D,CAAC,CAAC;gBACH,SAAS;YACX,CAAC;YAED,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;YAE9B,4EAA4E;YAC5E,kDAAkD;YAClD,MAAM,MAAM,GAAG,gBAAgB,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YAC9C,MAAM,CAAC,MAAM,CAAC,GAAG,UAAU,CAAC,CAAC,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC,CAAC,CAAC;YAEtF,MAAM,MAAM,GACV,SAAS,SAAS,CAAC,EAAE,sCAAsC,IAAI,CAAC,GAAG,IAAI;gBACvE,GAAG,KAAK,CAAC,SAAS,uBAAuB,0BAAkB,sBAAsB;gBACjF,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,CAAC,yBAAyB,MAAM,CAAC,KAAK,CAAC,MAAM,eAAe,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;YAEvF,uCACK,MAAM,KACT,QAAQ,kCACH,CAAC,MAAA,MAAM,CAAC,QAAQ,mCAAI,EAAE,SAAS,EAAE,SAAS,CAAC,IAAI,EAAE,aAAa,EAAE,CAAC,EAAE,CAAC,KACvE,SAAS,EAAE,SAAS,CAAC,IAAI,EACzB,YAAY,EAAE,SAAS,CAAC,EAAE,KAE5B,SAAS,EAAE;oBACT,MAAM,EAAE,SAAS,CAAC,EAAE;oBACpB,SAAS,EAAE,SAAS,CAAC,IAAI;oBACzB,MAAM;oBACN,KAAK;oBACL,UAAU,EAAE,CAAC,MAAM,EAAE,GAAG,QAAQ,CAAC;iBAClC,IACD;QACJ,CAAC;QAED,MAAM,IAAI,KAAK,CACb,sEACE,MAAA,MAAA,QAAQ,CAAC,CAAC,CAAC,0CAAE,KAAK,mCAAI,SACxB,EAAE,CACH,CAAC;IACJ,CAAC;CAAA;AAED,SAAS,cAAc,CAAC,KAAkB,EAAE,MAAoB;IAC9D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,MAAM,CAAC,aAAa,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACnD,IAAI,QAAQ;YAAE,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;AACH,CAAC;AAED,SAAS,gBAAgB,CACvB,KAAkB,EAClB,QAA+C;IAE/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,QAAQ,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACvC,IAAI,QAAQ;YAAE,IAAI,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;AACH,CAAC"}