@contraagent/elements 0.0.0-stage → 0.1.0

package/dist/define/json-tree.js

@@ -0,0 +1,7 @@
+// Registers <cae-json-tree>.
+import { defineElement } from '../core/define.js';
+import { CaeJsonTree } from '../json/json-tree.js';
+defineElement('cae-json-tree', CaeJsonTree);
+// The classes, and the events' types (`HTMLElementEventMap`), for a page that imports only this entry.
+export { CaeJsonTree };
+//# sourceMappingURL=json-tree.js.map

package/dist/define/json-tree.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"json-tree.js","sourceRoot":"","sources":["../../src/define/json-tree.ts"],"names":[],"mappings":"AAAA,6BAA6B;AAC7B,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,WAAW,EAAE,MAAM,sBAAsB,CAAC;AAEnD,aAAa,CAAC,eAAe,EAAE,WAAW,CAAC,CAAC;AAE5C,uGAAuG;AACvG,OAAO,EAAE,WAAW,EAAE,CAAC"}

package/dist/define/lanes.d.ts

@@ -0,0 +1,4 @@
+import { CaeLanes } from '../lanes/lanes.js';
+export { CaeLanes };
+export type { CaeEventMap } from '../core/events.js';
+//# sourceMappingURL=lanes.d.ts.map

package/dist/define/lanes.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"lanes.d.ts","sourceRoot":"","sources":["../../src/define/lanes.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAK7C,OAAO,EAAE,QAAQ,EAAE,CAAC;AACpB,YAAY,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/define/lanes.js

@@ -0,0 +1,7 @@
+// Registers <cae-lanes>.
+import { defineElement } from '../core/define.js';
+import { CaeLanes } from '../lanes/lanes.js';
+defineElement('cae-lanes', CaeLanes);
+// The classes, and the events' types (`HTMLElementEventMap`), for a page that imports only this entry.
+export { CaeLanes };
+//# sourceMappingURL=lanes.js.map

package/dist/define/lanes.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"lanes.js","sourceRoot":"","sources":["../../src/define/lanes.ts"],"names":[],"mappings":"AAAA,yBAAyB;AACzB,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAE7C,aAAa,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;AAErC,uGAAuG;AACvG,OAAO,EAAE,QAAQ,EAAE,CAAC"}

package/dist/define/markdown.d.ts

@@ -0,0 +1,4 @@
+import { CaeMarkdown } from '../markdown/cae-markdown.js';
+export { CaeMarkdown };
+export type { CaeEventMap } from '../core/events.js';
+//# sourceMappingURL=markdown.d.ts.map

package/dist/define/markdown.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"markdown.d.ts","sourceRoot":"","sources":["../../src/define/markdown.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAK1D,OAAO,EAAE,WAAW,EAAE,CAAC;AACvB,YAAY,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/define/markdown.js

@@ -0,0 +1,7 @@
+// Registers <cae-markdown>.
+import { defineElement } from '../core/define.js';
+import { CaeMarkdown } from '../markdown/cae-markdown.js';
+defineElement('cae-markdown', CaeMarkdown);
+// The classes, and the events' types (`HTMLElementEventMap`), for a page that imports only this entry.
+export { CaeMarkdown };
+//# sourceMappingURL=markdown.js.map

package/dist/define/markdown.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"markdown.js","sourceRoot":"","sources":["../../src/define/markdown.ts"],"names":[],"mappings":"AAAA,4BAA4B;AAC5B,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,WAAW,EAAE,MAAM,6BAA6B,CAAC;AAE1D,aAAa,CAAC,cAAc,EAAE,WAAW,CAAC,CAAC;AAE3C,uGAAuG;AACvG,OAAO,EAAE,WAAW,EAAE,CAAC"}

package/dist/define/matrix.d.ts

@@ -0,0 +1,4 @@
+import { CaeMarkMatrix } from '../matrix/mark-matrix.js';
+export { CaeMarkMatrix };
+export type { CaeEventMap } from '../core/events.js';
+//# sourceMappingURL=matrix.d.ts.map

package/dist/define/matrix.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"matrix.d.ts","sourceRoot":"","sources":["../../src/define/matrix.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAKzD,OAAO,EAAE,aAAa,EAAE,CAAC;AACzB,YAAY,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/define/matrix.js

@@ -0,0 +1,7 @@
+// Registers <cae-mark-matrix>.
+import { defineElement } from '../core/define.js';
+import { CaeMarkMatrix } from '../matrix/mark-matrix.js';
+defineElement('cae-mark-matrix', CaeMarkMatrix);
+// The classes, and the events' types (`HTMLElementEventMap`), for a page that imports only this entry.
+export { CaeMarkMatrix };
+//# sourceMappingURL=matrix.js.map

package/dist/define/matrix.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"matrix.js","sourceRoot":"","sources":["../../src/define/matrix.ts"],"names":[],"mappings":"AAAA,+BAA+B;AAC/B,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,MAAM,0BAA0B,CAAC;AAEzD,aAAa,CAAC,iBAAiB,EAAE,aAAa,CAAC,CAAC;AAEhD,uGAAuG;AACvG,OAAO,EAAE,aAAa,EAAE,CAAC"}

package/dist/define/segmented.d.ts

@@ -0,0 +1,4 @@
+import { CaeSegmented } from '../primitives/segmented.js';
+export { CaeSegmented };
+export type { CaeEventMap } from '../core/events.js';
+//# sourceMappingURL=segmented.d.ts.map

package/dist/define/segmented.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"segmented.d.ts","sourceRoot":"","sources":["../../src/define/segmented.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAK1D,OAAO,EAAE,YAAY,EAAE,CAAC;AACxB,YAAY,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/define/segmented.js

@@ -0,0 +1,7 @@
+// Registers <cae-segmented>.
+import { defineElement } from '../core/define.js';
+import { CaeSegmented } from '../primitives/segmented.js';
+defineElement('cae-segmented', CaeSegmented);
+// The classes, and the events' types (`HTMLElementEventMap`), for a page that imports only this entry.
+export { CaeSegmented };
+//# sourceMappingURL=segmented.js.map

package/dist/define/segmented.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"segmented.js","sourceRoot":"","sources":["../../src/define/segmented.ts"],"names":[],"mappings":"AAAA,6BAA6B;AAC7B,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,YAAY,EAAE,MAAM,4BAA4B,CAAC;AAE1D,aAAa,CAAC,eAAe,EAAE,YAAY,CAAC,CAAC;AAE7C,uGAAuG;AACvG,OAAO,EAAE,YAAY,EAAE,CAAC"}

package/dist/define/tiles.d.ts

@@ -0,0 +1,5 @@
+import { CaeCount } from '../count/count.js';
+import { CaeStatTiles } from '../tiles/stat-tiles.js';
+export { CaeStatTiles, CaeCount };
+export type { CaeEventMap } from '../core/events.js';
+//# sourceMappingURL=tiles.d.ts.map

package/dist/define/tiles.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"tiles.d.ts","sourceRoot":"","sources":["../../src/define/tiles.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAC7C,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAMtD,OAAO,EAAE,YAAY,EAAE,QAAQ,EAAE,CAAC;AAClC,YAAY,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/define/tiles.js

@@ -0,0 +1,9 @@
+// Registers <cae-stat-tiles> and the <cae-count> it renders.
+import { defineElement } from '../core/define.js';
+import { CaeCount } from '../count/count.js';
+import { CaeStatTiles } from '../tiles/stat-tiles.js';
+defineElement('cae-stat-tiles', CaeStatTiles);
+defineElement('cae-count', CaeCount);
+// The classes, and the events' types (`HTMLElementEventMap`), for a page that imports only this entry.
+export { CaeStatTiles, CaeCount };
+//# sourceMappingURL=tiles.js.map

package/dist/define/tiles.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"tiles.js","sourceRoot":"","sources":["../../src/define/tiles.ts"],"names":[],"mappings":"AAAA,6DAA6D;AAC7D,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,QAAQ,EAAE,MAAM,mBAAmB,CAAC;AAC7C,OAAO,EAAE,YAAY,EAAE,MAAM,wBAAwB,CAAC;AAEtD,aAAa,CAAC,gBAAgB,EAAE,YAAY,CAAC,CAAC;AAC9C,aAAa,CAAC,WAAW,EAAE,QAAQ,CAAC,CAAC;AAErC,uGAAuG;AACvG,OAAO,EAAE,YAAY,EAAE,QAAQ,EAAE,CAAC"}

package/dist/define/transcript.d.ts

@@ -0,0 +1,4 @@
+import { CaeTranscript } from '../transcript/transcript.js';
+export { CaeTranscript };
+export type { CaeEventMap } from '../core/events.js';
+//# sourceMappingURL=transcript.d.ts.map

package/dist/define/transcript.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"transcript.d.ts","sourceRoot":"","sources":["../../src/define/transcript.ts"],"names":[],"mappings":"AAEA,OAAO,EAAE,aAAa,EAAE,MAAM,6BAA6B,CAAC;AAK5D,OAAO,EAAE,aAAa,EAAE,CAAC;AACzB,YAAY,EAAE,WAAW,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/define/transcript.js

@@ -0,0 +1,7 @@
+// Registers <cae-transcript>.
+import { defineElement } from '../core/define.js';
+import { CaeTranscript } from '../transcript/transcript.js';
+defineElement('cae-transcript', CaeTranscript);
+// The classes, and the events' types (`HTMLElementEventMap`), for a page that imports only this entry.
+export { CaeTranscript };
+//# sourceMappingURL=transcript.js.map

package/dist/define/transcript.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"transcript.js","sourceRoot":"","sources":["../../src/define/transcript.ts"],"names":[],"mappings":"AAAA,8BAA8B;AAC9B,OAAO,EAAE,aAAa,EAAE,MAAM,mBAAmB,CAAC;AAClD,OAAO,EAAE,aAAa,EAAE,MAAM,6BAA6B,CAAC;AAE5D,aAAa,CAAC,gBAAgB,EAAE,aAAa,CAAC,CAAC;AAE/C,uGAAuG;AACvG,OAAO,EAAE,aAAa,EAAE,CAAC"}

package/dist/graph/arrange.d.ts

@@ -0,0 +1,43 @@
+import type { Arrangement, GraphClusterInput, GraphEdgeInput, GraphNodeInput, GraphOrder, GraphStubInput } from './types.js';
+/**
+ * Each id's layer by longest path. Edges that close a cycle (found depth first, in
+ * `ids` order) are left out; `fixed` ids keep their layer.
+ */
+export declare function rankLayers(ids: readonly string[], edges: readonly (readonly [string, string])[], fixed: ReadonlyMap<string, number>): Map<string, number>;
+/** True for a point where an edge crosses a layer. */
+export declare const isPoint: (id: string) => boolean;
+/**
+ * The order within each layer that reduces crossings: barycentre sweeps, down and
+ * up, four times, keeping the best. `links` join a slot to one in the next layer.
+ * With `keep`, those ids keep their order (a previous layout's, new ones after
+ * them) and only the other slots (the points) move between them.
+ */
+export declare function orderRows(rows: string[][], links: readonly (readonly [string, string])[], keep: boolean): string[][];
+/** What `arrange` reads of a graph: ids, where each node is, and the links. */
+export interface GraphShape {
+    nodes: readonly Pick<GraphNodeInput, 'id' | 'cluster'>[];
+    clusters: readonly (Pick<GraphClusterInput, 'id' | 'parent'> & {
+        cycle?: boolean;
+    })[];
+    edges: readonly Pick<GraphEdgeInput, 'from' | 'to' | 'style' | 'ranks'>[];
+    stubs: readonly Pick<GraphStubInput, 'id' | 'to' | 'style'>[];
+}
+/**
+ * The order of `g`'s drawing: each container's layers (the top level, then each
+ * cluster, a cluster being one item of its parent), the order within each layer,
+ * and the slots each edge passes. Pass a previous `order` of the same graph as
+ * `prev` to keep its items where they are (new ones are appended to their layer);
+ * `down` lays out the edge paths for a drawing top to bottom (a cluster's label is then on
+ * the side its edges come in). The same `g`, `prev` and `down` give the same object.
+ */
+export declare function arrange(g: GraphShape, prev?: GraphOrder, down?: boolean): Arrangement;
+/**
+ * How many layers the drawing spans along its flow, and how many items it stacks across
+ * it at most, counting a cluster as what it holds: an estimate of the drawing's shape,
+ * before it is measured (`span` items wide left to right, `stack` items high).
+ */
+export declare function extentOf(a: Pick<Arrangement, 'layers' | 'clusters'>): {
+    span: number;
+    stack: number;
+};
+//# sourceMappingURL=arrange.d.ts.map

package/dist/graph/arrange.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrange.d.ts","sourceRoot":"","sources":["../../src/graph/arrange.ts"],"names":[],"mappings":"AAUA,OAAO,KAAK,EAAE,WAAW,EAAa,iBAAiB,EAAE,cAAc,EAAE,cAAc,EAAE,UAAU,EAAE,cAAc,EAAgB,MAAM,YAAY,CAAC;AAUtJ;;;GAGG;AACH,wBAAgB,UAAU,CAAC,GAAG,EAAE,SAAS,MAAM,EAAE,EAAE,KAAK,EAAE,SAAS,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,WAAW,CAAC,MAAM,EAAE,MAAM,CAAC,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAgDzJ;AAqBD,sDAAsD;AACtD,eAAO,MAAM,OAAO,GAAI,IAAI,MAAM,KAAG,OAA6B,CAAC;AAEnE;;;;;GAKG;AACH,wBAAgB,SAAS,CAAC,IAAI,EAAE,MAAM,EAAE,EAAE,EAAE,KAAK,EAAE,SAAS,CAAC,SAAS,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,OAAO,GAAG,MAAM,EAAE,EAAE,CAkDpH;AAED,+EAA+E;AAC/E,MAAM,WAAW,UAAU;IACzB,KAAK,EAAE,SAAS,IAAI,CAAC,cAAc,EAAE,IAAI,GAAG,SAAS,CAAC,EAAE,CAAC;IACzD,QAAQ,EAAE,SAAS,CAAC,IAAI,CAAC,iBAAiB,EAAE,IAAI,GAAG,QAAQ,CAAC,GAAG;QAAE,KAAK,CAAC,EAAE,OAAO,CAAA;KAAE,CAAC,EAAE,CAAC;IACtF,KAAK,EAAE,SAAS,IAAI,CAAC,cAAc,EAAE,MAAM,GAAG,IAAI,GAAG,OAAO,GAAG,OAAO,CAAC,EAAE,CAAC;IAC1E,KAAK,EAAE,SAAS,IAAI,CAAC,cAAc,EAAE,IAAI,GAAG,IAAI,GAAG,OAAO,CAAC,EAAE,CAAC;CAC/D;AAID;;;;;;;GAOG;AACH,wBAAgB,OAAO,CAAC,CAAC,EAAE,UAAU,EAAE,IAAI,CAAC,EAAE,UAAU,EAAE,IAAI,UAAQ,GAAG,WAAW,CAOnF;AAiMD;;;;GAIG;AACH,wBAAgB,QAAQ,CAAC,CAAC,EAAE,IAAI,CAAC,WAAW,EAAE,QAAQ,GAAG,UAAU,CAAC,GAAG;IAAE,IAAI,EAAE,MAAM,CAAC;IAAC,KAAK,EAAE,MAAM,CAAA;CAAE,CAqBrG"}

package/dist/graph/arrange.js

@@ -0,0 +1,390 @@
+const push = (m, k, v) => {
+    const xs = m.get(k);
+    if (xs)
+        xs.push(v);
+    else
+        m.set(k, [v]);
+};
+const pairKey = (a, b) => `${a}\u0000${b}`;
+/**
+ * Each id's layer by longest path. Edges that close a cycle (found depth first, in
+ * `ids` order) are left out; `fixed` ids keep their layer.
+ */
+export function rankLayers(ids, edges, fixed) {
+    const known = new Set(ids);
+    const all = new Map(ids.map((id) => [id, []]));
+    for (const [a, b] of edges)
+        if (a !== b && known.has(a) && known.has(b) && !all.get(a)?.includes(b))
+            all.get(a)?.push(b);
+    const back = new Set();
+    const seen = new Map();
+    for (const root of ids) {
+        if (seen.has(root))
+            continue;
+        seen.set(root, 1);
+        const stack = [[root, 0]];
+        while (stack.length) {
+            const top = stack[stack.length - 1];
+            const ss = all.get(top[0]) ?? [];
+            if (top[1] < ss.length) {
+                const s = ss[top[1]++];
+                const st = seen.get(s);
+                if (st === 1)
+                    back.add(pairKey(top[0], s));
+                else if (!st) {
+                    seen.set(s, 1);
+                    stack.push([s, 0]);
+                }
+            }
+            else {
+                seen.set(top[0], 2);
+                stack.pop();
+            }
+        }
+    }
+    const succ = new Map(ids.map((id) => [id, []]));
+    const pred = new Map(ids.map((id) => [id, []]));
+    for (const [a, ss] of all) {
+        for (const b of ss) {
+            if (back.has(pairKey(a, b)))
+                continue;
+            succ.get(a)?.push(b);
+            pred.get(b)?.push(a);
+        }
+    }
+    // Longest path, in topological order (Kahn's).
+    const indeg = new Map(ids.map((id) => [id, pred.get(id)?.length ?? 0]));
+    const queue = ids.filter((id) => !indeg.get(id));
+    const layer = new Map();
+    for (let q = queue.shift(); q !== undefined; q = queue.shift()) {
+        layer.set(q, fixed.get(q) ?? Math.max(0, ...(pred.get(q) ?? []).map((p) => (layer.get(p) ?? 0) + 1)));
+        for (const s of succ.get(q) ?? []) {
+            indeg.set(s, (indeg.get(s) ?? 0) - 1);
+            if (!indeg.get(s))
+                queue.push(s);
+        }
+    }
+    return layer;
+}
+/** Pairs (a, b) between adjacent layers that cross, for the order `pos`. */
+function crossings(rows, links, pos, layerOf) {
+    let n = 0;
+    const by = new Map();
+    for (const [a, b] of links) {
+        const l = layerOf.get(a);
+        if (l === undefined)
+            continue;
+        push(by, l, [pos.get(a) ?? 0, pos.get(b) ?? 0]);
+    }
+    for (const ls of by.values())
+        for (let i = 0; i < ls.length; i++)
+            for (let j = i + 1; j < ls.length; j++) {
+                const [a1, b1] = ls[i];
+                const [a2, b2] = ls[j];
+                if ((a1 - a2) * (b1 - b2) < 0)
+                    n++;
+            }
+    return rows.length ? n : 0;
+}
+/** True for a point where an edge crosses a layer. */
+export const isPoint = (id) => id.startsWith('~');
+/**
+ * The order within each layer that reduces crossings: barycentre sweeps, down and
+ * up, four times, keeping the best. `links` join a slot to one in the next layer.
+ * With `keep`, those ids keep their order (a previous layout's, new ones after
+ * them) and only the other slots (the points) move between them.
+ */
+export function orderRows(rows, links, keep) {
+    const layerOf = new Map();
+    rows.forEach((row, i) => row.forEach((id) => layerOf.set(id, i)));
+    const pred = new Map();
+    const succ = new Map();
+    for (const [a, b] of links) {
+        push(succ, a, b);
+        push(pred, b, a);
+    }
+    const pos = new Map();
+    const fix = (row) => row.forEach((id, i) => pos.set(id, i));
+    const cur = rows.map((r) => [...r]);
+    cur.forEach(fix);
+    const score = () => crossings(cur, links, pos, layerOf);
+    let best = cur.map((r) => [...r]);
+    let bestN = score();
+    const sortRow = (row, near) => {
+        const bc = new Map();
+        for (const id of row) {
+            const ps = (near.get(id) ?? []).map((p) => pos.get(p)).filter((x) => x !== undefined);
+            bc.set(id, ps.length ? ps.reduce((a, b) => a + b, 0) / ps.length : (pos.get(id) ?? 0));
+        }
+        const at = (id) => bc.get(id) ?? 0;
+        if (!keep)
+            return [...row].sort((a, b) => at(a) - at(b) || (pos.get(a) ?? 0) - (pos.get(b) ?? 0));
+        // The kept ids stay in their order; each point goes before the first kept id it is left of.
+        const fixed = row.filter((id) => !isPoint(id));
+        const points = row.filter(isPoint).sort((a, b) => at(a) - at(b) || (pos.get(a) ?? 0) - (pos.get(b) ?? 0));
+        const out = [];
+        let p = 0;
+        for (const id of fixed) {
+            while (p < points.length && at(points[p]) < at(id))
+                out.push(points[p++]);
+            out.push(id);
+        }
+        return [...out, ...points.slice(p)];
+    };
+    for (let sweep = 0; sweep < 4; sweep++) {
+        const down = sweep % 2 === 0;
+        const order = down ? cur.map((_, i) => i).slice(1) : cur.map((_, i) => i).reverse().slice(1);
+        for (const i of order) {
+            const row = sortRow(cur[i], down ? pred : succ);
+            cur[i] = row;
+            fix(row);
+        }
+        const n = score();
+        if (n < bestN) {
+            bestN = n;
+            best = cur.map((r) => [...r]);
+        }
+    }
+    return score() <= bestN ? cur : best;
+}
+const arranged = new WeakMap();
+/**
+ * The order of `g`'s drawing: each container's layers (the top level, then each
+ * cluster, a cluster being one item of its parent), the order within each layer,
+ * and the slots each edge passes. Pass a previous `order` of the same graph as
+ * `prev` to keep its items where they are (new ones are appended to their layer);
+ * `down` lays out the edge paths for a drawing top to bottom (a cluster's label is then on
+ * the side its edges come in). The same `g`, `prev` and `down` give the same object.
+ */
+export function arrange(g, prev, down = false) {
+    const seen = arranged.get(g) ?? [];
+    const hit = seen.find((x) => x.prev === prev && x.down === down);
+    if (hit)
+        return hit.out;
+    const out = arrangeNew(g, prev, down);
+    arranged.set(g, [...seen.slice(-3), { prev, down, out }]);
+    return out;
+}
+function arrangeNew(g, prev, down) {
+    const clusterIds = new Set(g.clusters.map((c) => c.id));
+    const parentOf = new Map(g.clusters.map((c) => [c.id, c.parent]));
+    const boxOf = new Map(); // node id -> its innermost cluster
+    for (const n of g.nodes)
+        if (n.cluster)
+            boxOf.set(n.id, n.cluster);
+    const stubIds = [...new Set(g.stubs.map((s) => s.id))];
+    const isStub = new Set(stubIds);
+    // The clusters an id sits in, innermost first (for a cluster id, itself first).
+    const boxPath = (id) => {
+        const out = [];
+        let b = clusterIds.has(id) ? id : (boxOf.get(id) ?? null);
+        while (b) {
+            out.push(b);
+            b = parentOf.get(b) ?? null;
+        }
+        return out;
+    };
+    // The direct child of `container` (a cluster, or '' for the top level) that holds a node `id`.
+    const itemIn = (id, container) => {
+        const bp = boxPath(id);
+        if (container === '')
+            return bp[bp.length - 1] ?? id;
+        const i = bp.indexOf(container);
+        return i < 0 ? undefined : i === 0 ? id : bp[i - 1];
+    };
+    // The deepest cluster holding both ends of an edge (the top level when none).
+    const commonBox = (a, b) => {
+        const bp = boxPath(a);
+        return bp.find((x) => boxPath(b).includes(x)) ?? '';
+    };
+    // The container a slot is in: a stub's is the top level.
+    const containerOf = (id) => (isStub.has(id) ? '' : (boxOf.get(id) ?? ''));
+    // Layers, by container: the top level, then each cluster (its own nodes and the
+    // clusters nested in it). Each cluster is one item of its parent.
+    const containers = ['', ...g.clusters.map((c) => c.id)];
+    const kidsOf = new Map(containers.map((c) => [c, []]));
+    for (const { id } of g.nodes) {
+        for (const c of containers) {
+            const it = itemIn(id, c);
+            if (it !== undefined && !kidsOf.get(c)?.includes(it))
+                kidsOf.get(c)?.push(it);
+        }
+    }
+    const lay = new Map();
+    for (const c of containers) {
+        const kids = kidsOf.get(c) ?? [];
+        const prevRows = c === '' ? prev?.layers : prev?.clusters[c];
+        const fixed = new Map();
+        prevRows?.forEach((row, i) => row.forEach((id) => kids.includes(id) && fixed.set(id, i)));
+        // An edge that closes a cycle does not set the layers.
+        const es = g.edges
+            .filter((e) => e.ranks && commonBox(e.from, e.to) === c)
+            .map((e) => [itemIn(e.from, c), itemIn(e.to, c)]);
+        lay.set(c, rankLayers(kids, es, fixed));
+    }
+    // Stubs, in the top level: in the layer before the first they lead to (a new first layer when that is the first).
+    const top = lay.get('');
+    const prevTop = new Map();
+    prev?.layers.forEach((row, i) => row.forEach((id) => prevTop.set(id, i)));
+    const stubAt = new Map(stubIds.map((id) => [id, prevTop.get(id) ?? Math.min(...g.stubs.filter((s) => s.id === id).map((s) => top.get(itemIn(s.to, '')) ?? 0)) - 1]));
+    if ([...stubAt.values()].some((l) => l < 0)) {
+        for (const [id, l] of top)
+            top.set(id, l + 1);
+        for (const [id, l] of stubAt)
+            stubAt.set(id, l + 1);
+    }
+    for (const [id, l] of stubAt)
+        top.set(id, l);
+    const layerOf = (c, id) => lay.get(c)?.get(id) ?? 0;
+    const lastLayer = (c) => Math.max(0, ...(lay.get(c)?.values() ?? []));
+    // Every edge whose end is not in a later layer than its start goes back: not drawn.
+    const isBack = (from, to) => {
+        const c = commonBox(from, to);
+        return layerOf(c, itemIn(from, c)) >= layerOf(c, itemIn(to, c));
+    };
+    const back = g.edges.map((e) => isBack(e.from, e.to));
+    // Each container's rows: its items by layer, a previous order kept, new items after it.
+    const rows = new Map();
+    for (const c of containers) {
+        const prevRows = c === '' ? prev?.layers : prev?.clusters[c];
+        const kept = (prevRows ?? []).flat();
+        const ids = [...(c === '' ? [...stubIds] : []), ...(kidsOf.get(c) ?? [])];
+        ids.sort((a, b) => {
+            const ka = kept.indexOf(a);
+            const kb = kept.indexOf(b);
+            return (ka < 0 ? Infinity : ka) - (kb < 0 ? Infinity : kb);
+        });
+        const r = Array.from({ length: lastLayer(c) + 1 }, () => []);
+        for (const id of ids)
+            r[layerOf(c, id)]?.push(id);
+        rows.set(c, r);
+    }
+    // Edge paths: the drawn edges through points on the layers they cross. The points of
+    // edges from one place (of one style) are shared, so their lines run as one.
+    const edgePaths = [];
+    const points = new Set();
+    const point = (c, origin, style, l) => {
+        const id = `~${c}|${origin}|${style}|${l}`;
+        if (!points.has(id)) {
+            points.add(id);
+            rows.get(c)?.[l]?.push(id);
+        }
+        return { id, in: c };
+    };
+    // A point beside a cluster, in its layer of the container around it: an edge that leaves or
+    // enters the cluster through its side, between two of its layers, passes there.
+    const byPoint = (c, box, origin, style) => {
+        const l = layerOf(c, box);
+        const id = `~${c}|by:${box}|${origin}|${style}|${l}`;
+        if (!points.has(id)) {
+            points.add(id);
+            rows.get(c)?.[l]?.push(id);
+        }
+        return { id, in: c };
+    };
+    // An edge enters a cluster at its near side only to reach the cluster's first layer (and,
+    // top to bottom, not even then: the cluster's label is on that side); else through its
+    // side, next to the layer it goes to. It leaves at the far side only from the cluster's
+    // last layer, else through its side. So it runs inside a cluster only where it starts or ends.
+    const edgePath = (from, to, style) => {
+        const c = isStub.has(from) ? '' : commonBox(from, to);
+        let curIn = containerOf(from);
+        let cur = from;
+        const steps = [{ id: from, in: curIn }];
+        // Out of the clusters around the source, up to the common container.
+        while (curIn !== c) {
+            const up = parentOf.get(curIn) ?? '';
+            steps.push({ id: curIn, in: up });
+            if (layerOf(curIn, cur) < lastLayer(curIn))
+                steps.push(byPoint(up, curIn, cur, style));
+            cur = curIn;
+            curIn = up;
+        }
+        // Across the common container, then into the clusters around the target.
+        const target = itemIn(to, c);
+        for (let l = layerOf(c, cur) + 1; l < layerOf(c, target); l++)
+            steps.push(point(c, cur, style, l));
+        const bp = boxPath(to);
+        const inward = bp.slice(0, c === '' ? bp.length : bp.indexOf(c)).reverse();
+        const origin = `>${c}:${cur}`;
+        let k = c;
+        for (const box of inward) {
+            const n = itemIn(to, box);
+            if (layerOf(box, n) > 0 || down)
+                steps.push(byPoint(k, box, origin, style));
+            steps.push({ id: box, in: k });
+            k = box;
+        }
+        steps.push({ id: to, in: k });
+        return steps;
+    };
+    g.edges.forEach((e, i) => {
+        if (!back[i])
+            edgePaths.push({ from: e.from, to: e.to, style: e.style, steps: edgePath(e.from, e.to, e.style) });
+    });
+    for (const s of g.stubs)
+        edgePaths.push({ from: s.id, to: s.to, style: s.style, steps: edgePath(s.id, s.to, s.style) });
+    // The order within each layer.
+    const slots = {};
+    for (const c of containers) {
+        const links = [];
+        const lv = new Map((rows.get(c) ?? []).flatMap((r, i) => r.map((id) => [id, i])));
+        for (const r of edgePaths)
+            for (let i = 1; i < r.steps.length; i++) {
+                const a = r.steps[i - 1];
+                const b = r.steps[i];
+                if (a.in === c && b.in === c && lv.get(a.id) !== lv.get(b.id))
+                    links.push([a.id, b.id]);
+            }
+        const hasPrev = c === '' ? !!prev : !!prev?.clusters[c];
+        // A point beside a cluster is right after it.
+        slots[c] = orderRows(rows.get(c) ?? [], links, hasPrev).map((row) => {
+            const by = row.filter((id) => id.includes('|by:'));
+            const rest = row.filter((id) => !id.includes('|by:'));
+            return rest.flatMap((id) => [id, ...by.filter((p) => p.includes(`|by:${id}|`))]);
+        });
+    }
+    const real = (r) => r.map((row) => row.filter((id) => !isPoint(id)));
+    const clusters = g.clusters.map((c) => ({ id: c.id, parent: c.parent, cycle: !!c.cycle, layers: real(slots[c.id] ?? []).filter((r) => r.length) }));
+    const outerRows = real(slots[''] ?? []).map((row) => row.filter((id) => !isStub.has(id)));
+    const byId = new Map(clusters.map((c) => [c.id, c]));
+    // Every node id, in drawing order: expand each cluster to the nodes nested in it.
+    const expand = (ids) => ids.flatMap((id) => (clusterIds.has(id) ? expand((byId.get(id)?.layers ?? []).flat()) : [id]));
+    return {
+        drawn: expand(outerRows.flat()),
+        layers: outerRows.filter((r) => r.length),
+        clusters,
+        back,
+        slots,
+        edgePaths,
+        order: { layers: real(slots[''] ?? []), clusters: Object.fromEntries(clusters.map((c) => [c.id, real(slots[c.id] ?? [])])) },
+    };
+}
+/**
+ * How many layers the drawing spans along its flow, and how many items it stacks across
+ * it at most, counting a cluster as what it holds: an estimate of the drawing's shape,
+ * before it is measured (`span` items wide left to right, `stack` items high).
+ */
+export function extentOf(a) {
+    const byId = new Map(a.clusters.map((c) => [c.id, c]));
+    const memo = new Map();
+    const of = (layers) => {
+        let span = 0;
+        let stack = 0;
+        for (const row of layers) {
+            let deep = 0;
+            let across = 0;
+            for (const id of row) {
+                const c = byId.get(id);
+                const e = c ? (memo.get(id) ?? memo.set(id, of(c.layers)).get(id) ?? { span: 1, stack: 1 }) : { span: 1, stack: 1 };
+                deep = Math.max(deep, e.span);
+                across += e.stack;
+            }
+            span += deep;
+            stack = Math.max(stack, across);
+        }
+        return { span, stack };
+    };
+    return of(a.layers);
+}
+//# sourceMappingURL=arrange.js.map

package/dist/graph/arrange.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"arrange.js","sourceRoot":"","sources":["../../src/graph/arrange.ts"],"names":[],"mappings":"AAYA,MAAM,IAAI,GAAG,CAAO,CAAc,EAAE,CAAI,EAAE,CAAI,EAAQ,EAAE;IACtD,MAAM,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpB,IAAI,EAAE;QAAE,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;;QACd,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;AACrB,CAAC,CAAC;AAEF,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,CAAS,EAAE,EAAE,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;AAE3D;;;GAGG;AACH,MAAM,UAAU,UAAU,CAAC,GAAsB,EAAE,KAA6C,EAAE,KAAkC;IAClI,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,CAAC;IAC3B,MAAM,GAAG,GAAG,IAAI,GAAG,CAAmB,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACjE,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK;QAAE,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;YAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;IACzH,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAC/B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAiB,CAAC;IACtC,KAAK,MAAM,IAAI,IAAI,GAAG,EAAE,CAAC;QACvB,IAAI,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC;YAAE,SAAS;QAC7B,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAClB,MAAM,KAAK,GAAuB,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC;QAC9C,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;YACpB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAqB,CAAC;YACxD,MAAM,EAAE,GAAG,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YACjC,IAAI,GAAG,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC;gBACvB,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAW,CAAC;gBACjC,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;gBACvB,IAAI,EAAE,KAAK,CAAC;oBAAE,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;qBACtC,IAAI,CAAC,EAAE,EAAE,CAAC;oBACb,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACf,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBACrB,CAAC;YACH,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBACpB,KAAK,CAAC,GAAG,EAAE,CAAC;YACd,CAAC;QACH,CAAC;IACH,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,CAAmB,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAClE,MAAM,IAAI,GAAG,IAAI,GAAG,CAAmB,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAClE,KAAK,MAAM,CAAC,CAAC,EAAE,EAAE,CAAC,IAAI,GAAG,EAAE,CAAC;QAC1B,KAAK,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;YACnB,IAAI,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;gBAAE,SAAS;YACtC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;YACrB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IACD,+CAA+C;IAC/C,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;IACxE,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IACjD,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;IACxC,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC,KAAK,SAAS,EAAE,CAAC,GAAG,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/D,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACtG,KAAK,MAAM,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC;YAClC,KAAK,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YACtC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,4EAA4E;AAC5E,SAAS,SAAS,CAAC,IAAyB,EAAE,KAA6C,EAAE,GAAgC,EAAE,OAAoC;IACjK,IAAI,CAAC,GAAG,CAAC,CAAC;IACV,MAAM,EAAE,GAAG,IAAI,GAAG,EAA8B,CAAC;IACjD,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;QAC3B,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,KAAK,SAAS;YAAE,SAAS;QAC9B,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC;IACD,KAAK,MAAM,EAAE,IAAI,EAAE,CAAC,MAAM,EAAE;QAC1B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE;YAChC,KAAK,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACvC,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAqB,CAAC;gBAC3C,MAAM,CAAC,EAAE,EAAE,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAqB,CAAC;gBAC3C,IAAI,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC;oBAAE,CAAC,EAAE,CAAC;YACrC,CAAC;IACL,OAAO,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAC7B,CAAC;AAED,sDAAsD;AACtD,MAAM,CAAC,MAAM,OAAO,GAAG,CAAC,EAAU,EAAW,EAAE,CAAC,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;AAEnE;;;;;GAKG;AACH,MAAM,UAAU,SAAS,CAAC,IAAgB,EAAE,KAA6C,EAAE,IAAa;IACtG,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,IAAI,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAoB,CAAC;IACzC,KAAK,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;QACjB,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;IACnB,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,GAAG,EAAkB,CAAC;IACtC,MAAM,GAAG,GAAG,CAAC,GAAsB,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IAC/E,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IACpC,GAAG,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC;IACjB,MAAM,KAAK,GAAG,GAAG,EAAE,CAAC,SAAS,CAAC,GAAG,EAAE,KAAK,EAAE,GAAG,EAAE,OAAO,CAAC,CAAC;IACxD,IAAI,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;IAClC,IAAI,KAAK,GAAG,KAAK,EAAE,CAAC;IACpB,MAAM,OAAO,GAAG,CAAC,GAAa,EAAE,IAA2B,EAAY,EAAE;QACvE,MAAM,EAAE,GAAG,IAAI,GAAG,EAAkB,CAAC;QACrC,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;YACrB,MAAM,EAAE,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,KAAK,SAAS,CAAC,CAAC;YACnG,EAAE,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzF,CAAC;QACD,MAAM,EAAE,GAAG,CAAC,EAAU,EAAE,EAAE,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;QAC3C,IAAI,CAAC,IAAI;YAAE,OAAO,CAAC,GAAG,GAAG,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClG,4FAA4F;QAC5F,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1G,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,EAAE,IAAI,KAAK,EAAE,CAAC;YACvB,OAAO,CAAC,GAAG,MAAM,CAAC,MAAM,IAAI,EAAE,CAAC,MAAM,CAAC,CAAC,CAAW,CAAC,GAAG,EAAE,CAAC,EAAE,CAAC;gBAAE,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,EAAE,CAAW,CAAC,CAAC;YAC9F,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,CAAC;QACD,OAAO,CAAC,GAAG,GAAG,EAAE,GAAG,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACtC,CAAC,CAAC;IACF,KAAK,IAAI,KAAK,GAAG,CAAC,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,EAAE,EAAE,CAAC;QACvC,MAAM,IAAI,GAAG,KAAK,GAAG,CAAC,KAAK,CAAC,CAAC;QAC7B,MAAM,KAAK,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC;QAC7F,KAAK,MAAM,CAAC,IAAI,KAAK,EAAE,CAAC;YACtB,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAa,EAAE,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;YAC5D,GAAG,CAAC,CAAC,CAAC,GAAG,GAAG,CAAC;YACb,GAAG,CAAC,GAAG,CAAC,CAAC;QACX,CAAC;QACD,MAAM,CAAC,GAAG,KAAK,EAAE,CAAC;QAClB,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC;YACd,KAAK,GAAG,CAAC,CAAC;YACV,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IACD,OAAO,KAAK,EAAE,IAAI,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC;AACvC,CAAC;AAUD,MAAM,QAAQ,GAAG,IAAI,OAAO,EAAmF,CAAC;AAEhH;;;;;;;GAOG;AACH,MAAM,UAAU,OAAO,CAAC,CAAa,EAAE,IAAiB,EAAE,IAAI,GAAG,KAAK;IACpE,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACnC,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,IAAI,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC;IACjE,IAAI,GAAG;QAAE,OAAO,GAAG,CAAC,GAAG,CAAC;IACxB,MAAM,GAAG,GAAG,UAAU,CAAC,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,CAAC;IACtC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;IAC1D,OAAO,GAAG,CAAC;AACb,CAAC;AAED,SAAS,UAAU,CAAC,CAAa,EAAE,IAA4B,EAAE,IAAa;IAC5E,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxD,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;IAClE,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC,CAAC,mCAAmC;IAC5E,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK;QAAE,IAAI,CAAC,CAAC,OAAO;YAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC;IACnE,MAAM,OAAO,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACvD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,CAAC;IAEhC,gFAAgF;IAChF,MAAM,OAAO,GAAG,CAAC,EAAU,EAAY,EAAE;QACvC,MAAM,GAAG,GAAa,EAAE,CAAC;QACzB,IAAI,CAAC,GAAkB,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,CAAC;QACzE,OAAO,CAAC,EAAE,CAAC;YACT,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACZ,CAAC,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;QAC9B,CAAC;QACD,OAAO,GAAG,CAAC;IACb,CAAC,CAAC;IACF,+FAA+F;IAC/F,MAAM,MAAM,GAAG,CAAC,EAAU,EAAE,SAAiB,EAAsB,EAAE;QACnE,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACvB,IAAI,SAAS,KAAK,EAAE;YAAE,OAAO,EAAE,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,EAAE,CAAC;QACrD,MAAM,CAAC,GAAG,EAAE,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAChC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,CAAC,CAAC;IACF,8EAA8E;IAC9E,MAAM,SAAS,GAAG,CAAC,CAAS,EAAE,CAAS,EAAU,EAAE;QACjD,MAAM,EAAE,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;QACtB,OAAO,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;IACtD,CAAC,CAAC;IACF,yDAAyD;IACzD,MAAM,WAAW,GAAG,CAAC,EAAU,EAAU,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IAE1F,gFAAgF;IAChF,kEAAkE;IAClE,MAAM,UAAU,GAAG,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACxD,MAAM,MAAM,GAAG,IAAI,GAAG,CAAmB,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;IACzE,KAAK,MAAM,EAAE,EAAE,EAAE,IAAI,CAAC,CAAC,KAAK,EAAE,CAAC;QAC7B,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;YAC3B,MAAM,EAAE,GAAG,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;YACzB,IAAI,EAAE,KAAK,SAAS,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,QAAQ,CAAC,EAAE,CAAC;gBAAE,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAChF,CAAC;IACH,CAAC;IACD,MAAM,GAAG,GAAG,IAAI,GAAG,EAA+B,CAAC;IACnD,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;QACjC,MAAM,QAAQ,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,KAAK,GAAG,IAAI,GAAG,EAAkB,CAAC;QACxC,QAAQ,EAAE,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1F,uDAAuD;QACvD,MAAM,EAAE,GAAG,CAAC,CAAC,KAAK;aACf,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,IAAI,SAAS,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC;aACvD,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAW,EAAE,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAW,CAAU,CAAC,CAAC;QACjF,GAAG,CAAC,GAAG,CAAC,CAAC,EAAE,UAAU,CAAC,IAAI,EAAE,EAAE,EAAE,KAAK,CAAC,CAAC,CAAC;IAC1C,CAAC;IACD,kHAAkH;IAClH,MAAM,GAAG,GAAG,GAAG,CAAC,GAAG,CAAC,EAAE,CAAwB,CAAC;IAC/C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,IAAI,EAAE,MAAM,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC1E,MAAM,MAAM,GAAG,IAAI,GAAG,CACpB,OAAO,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,EAAE,CAAW,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CACvJ,CAAC;IACF,IAAI,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;QAC5C,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,GAAG;YAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9C,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,MAAM;YAAE,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC;IACtD,CAAC;IACD,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,MAAM;QAAE,GAAG,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC7C,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,EAAU,EAAU,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC;IAC5E,MAAM,SAAS,GAAG,CAAC,CAAS,EAAU,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC,CAAC,CAAC;IAEtF,oFAAoF;IACpF,MAAM,MAAM,GAAG,CAAC,IAAY,EAAE,EAAU,EAAW,EAAE;QACnD,MAAM,CAAC,GAAG,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAC9B,OAAO,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,IAAI,EAAE,CAAC,CAAW,CAAC,IAAI,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,EAAE,CAAC,CAAW,CAAC,CAAC;IACtF,CAAC,CAAC;IACF,MAAM,IAAI,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAEtD,wFAAwF;IACxF,MAAM,IAAI,GAAG,IAAI,GAAG,EAAsB,CAAC;IAC3C,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,QAAQ,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;QAC7D,MAAM,IAAI,GAAG,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC;QACrC,MAAM,GAAG,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QAC1E,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;YAChB,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC3B,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;YAC3B,OAAO,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;QAC7D,CAAC,CAAC,CAAC;QACH,MAAM,CAAC,GAAe,KAAK,CAAC,IAAI,CAAC,EAAE,MAAM,EAAE,SAAS,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,CAAC;QACzE,KAAK,MAAM,EAAE,IAAI,GAAG;YAAE,CAAC,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAClD,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACjB,CAAC;IAED,qFAAqF;IACrF,6EAA6E;IAC7E,MAAM,SAAS,GAA6B,EAAE,CAAC;IAC/C,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,MAAM,KAAK,GAAG,CAAC,CAAS,EAAE,MAAc,EAAE,KAAa,EAAE,CAAS,EAAgB,EAAE;QAClF,MAAM,EAAE,GAAG,IAAI,CAAC,IAAI,MAAM,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QAC3C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACf,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;IACvB,CAAC,CAAC;IACF,4FAA4F;IAC5F,gFAAgF;IAChF,MAAM,OAAO,GAAG,CAAC,CAAS,EAAE,GAAW,EAAE,MAAc,EAAE,KAAa,EAAgB,EAAE;QACtF,MAAM,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC;QAC1B,MAAM,EAAE,GAAG,IAAI,CAAC,OAAO,GAAG,IAAI,MAAM,IAAI,KAAK,IAAI,CAAC,EAAE,CAAC;QACrD,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACpB,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACf,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;QAC7B,CAAC;QACD,OAAO,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC;IACvB,CAAC,CAAC;IACF,0FAA0F;IAC1F,uFAAuF;IACvF,wFAAwF;IACxF,+FAA+F;IAC/F,MAAM,QAAQ,GAAG,CAAC,IAAY,EAAE,EAAU,EAAE,KAAgB,EAAkB,EAAE;QAC9E,MAAM,CAAC,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,SAAS,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QACtD,IAAI,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,CAAC;QAC9B,IAAI,GAAG,GAAG,IAAI,CAAC;QACf,MAAM,KAAK,GAAmB,CAAC,EAAE,EAAE,EAAE,IAAI,EAAE,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC;QACxD,qEAAqE;QACrE,OAAO,KAAK,KAAK,CAAC,EAAE,CAAC;YACnB,MAAM,EAAE,GAAG,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;YACrC,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC;YAClC,IAAI,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,GAAG,SAAS,CAAC,KAAK,CAAC;gBAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC;YACvF,GAAG,GAAG,KAAK,CAAC;YACZ,KAAK,GAAG,EAAE,CAAC;QACb,CAAC;QACD,yEAAyE;QACzE,MAAM,MAAM,GAAG,MAAM,CAAC,EAAE,EAAE,CAAC,CAAW,CAAC;QACvC,KAAK,IAAI,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,OAAO,CAAC,CAAC,EAAE,MAAM,CAAC,EAAE,CAAC,EAAE;YAAE,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,EAAE,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;QACnG,MAAM,EAAE,GAAG,OAAO,CAAC,EAAE,CAAC,CAAC;QACvB,MAAM,MAAM,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,OAAO,EAAE,CAAC;QAC3E,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,GAAG,EAAE,CAAC;QAC9B,IAAI,CAAC,GAAG,CAAC,CAAC;QACV,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;YACzB,MAAM,CAAC,GAAG,MAAM,CAAC,EAAE,EAAE,GAAG,CAAW,CAAC;YACpC,IAAI,OAAO,CAAC,GAAG,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,IAAI;gBAAE,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,GAAG,EAAE,MAAM,EAAE,KAAK,CAAC,CAAC,CAAC;YAC5E,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,GAAG,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;YAC/B,CAAC,GAAG,GAAG,CAAC;QACV,CAAC;QACD,KAAK,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,CAAC;QAC9B,OAAO,KAAK,CAAC;IACf,CAAC,CAAC;IACF,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACvB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;YAAE,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IACnH,CAAC,CAAC,CAAC;IACH,KAAK,MAAM,CAAC,IAAI,CAAC,CAAC,KAAK;QAAE,SAAS,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAExH,+BAA+B;IAC/B,MAAM,KAAK,GAA+B,EAAE,CAAC;IAC7C,KAAK,MAAM,CAAC,IAAI,UAAU,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAuB,EAAE,CAAC;QACrC,MAAM,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAU,CAAC,CAAC,CAAC,CAAC;QAC3F,KAAK,MAAM,CAAC,IAAI,SAAS;YACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBACxC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,CAAiB,CAAC;gBACzC,MAAM,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC,CAAiB,CAAC;gBACrC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;oBAAE,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;YAC1F,CAAC;QACH,MAAM,OAAO,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC,CAAC,CAAC;QACxD,8CAA8C;QAC9C,KAAK,CAAC,CAAC,CAAC,GAAG,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,EAAE,EAAE,KAAK,EAAE,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE;YAClE,MAAM,EAAE,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;YACnD,MAAM,IAAI,GAAG,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC;YACtD,OAAO,IAAI,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,GAAG,EAAE,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QACnF,CAAC,CAAC,CAAC;IACL,CAAC;IACD,MAAM,IAAI,GAAG,CAAC,CAAsB,EAAE,EAAE,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1F,MAAM,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,MAAM,EAAE,CAAC,CAAC,MAAM,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,CAAC;IACpJ,MAAM,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,EAAE,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1F,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,kFAAkF;IAClF,MAAM,MAAM,GAAG,CAAC,GAAsB,EAAY,EAAE,CAClD,GAAG,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,MAAM,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACjG,OAAO;QACL,KAAK,EAAE,MAAM,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;QAC/B,MAAM,EAAE,SAAS,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC;QACzC,QAAQ;QACR,IAAI;QACJ,KAAK;QACL,SAAS;QACT,KAAK,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,EAAE,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE;KAC7H,CAAC;AACJ,CAAC;AAED;;;;GAIG;AACH,MAAM,UAAU,QAAQ,CAAC,CAA2C;IAClE,MAAM,IAAI,GAAG,IAAI,GAAG,CAAC,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACvD,MAAM,IAAI,GAAG,IAAI,GAAG,EAA2C,CAAC;IAChE,MAAM,EAAE,GAAG,CAAC,MAA2B,EAAmC,EAAE;QAC1E,IAAI,IAAI,GAAG,CAAC,CAAC;QACb,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,KAAK,MAAM,GAAG,IAAI,MAAM,EAAE,CAAC;YACzB,IAAI,IAAI,GAAG,CAAC,CAAC;YACb,IAAI,MAAM,GAAG,CAAC,CAAC;YACf,KAAK,MAAM,EAAE,IAAI,GAAG,EAAE,CAAC;gBACrB,MAAM,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;gBACvB,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC;gBACpH,IAAI,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC;gBAC9B,MAAM,IAAI,CAAC,CAAC,KAAK,CAAC;YACpB,CAAC;YACD,IAAI,IAAI,IAAI,CAAC;YACb,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;QAClC,CAAC;QACD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IACzB,CAAC,CAAC;IACF,OAAO,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;AACtB,CAAC"}