@procedures/collections 0.47.1 → 0.48.0

package/dist/impl/summary-tree.js

@@ -1,524 +0,0 @@
-/**
- * SummaryTree: a persistent sequence of leaves with a summary of each part.
- *
- * The tree is a balanced binary tree (AVL) with one leaf in each node. Each node keeps the summary of its subtree.
- * A summary is a value of a monoid: the caller gives the monoid as data, with `empty` and `combine`. The order of the
- * leaves is kept, so `combine` must be associative, but it can be non-commutative.
- *
- * Each operation returns a new tree and keeps the old tree. The two trees share the nodes that did not change.
- * Concatenation, a split at an index or at a summary search, an edit and a lookup are O(log n).
- *
- * The algorithms are the "join" algorithms of Blelloch, Ferizovic and Sun, "Just Join for Parallel Ordered Sets"
- * (SPAA 2016).
- *
- * @example
- * // The number of leaves and the total length of the strings
- * const spec = {
- *   monoid: { empty: { count: 0, length: 0 }, combine: (a, b) => ({ count: a.count + b.count, length: a.length + b.length }) },
- *   measure: (leaf: string) => ({ count: 1, length: leaf.length }),
- * };
- * const tree = summaryTree(spec, ["ab", "cde", "f"]);
- * tree.summary; // { count: 3, length: 6 }
- * const [left, right] = tree.split((prefix) => prefix.length > 2); // left: ["ab"], right: ["cde", "f"]
- */
-function heightOf(tree) {
-    return tree === null ? 0 : tree.height;
-}
-function sizeOf(tree) {
-    return tree === null ? 0 : tree.size;
-}
-/** The functions that make and join nodes for one monoid. */
-class Builder {
-    spec;
-    constructor(spec) {
-        this.spec = spec;
-    }
-    summaryOf(tree) {
-        return tree === null ? this.spec.monoid.empty : tree.summary;
-    }
-    /** This function makes a node. Give `inner` only when it is the summary of `left` and `own`, to save one `combine`. */
-    node(left, leaf, own, right, inner) {
-        if (inner === undefined)
-            inner = left === null ? own : this.spec.monoid.combine(left.summary, own);
-        return {
-            left,
-            leaf,
-            own,
-            inner,
-            right,
-            height: 1 + Math.max(heightOf(left), heightOf(right)),
-            size: sizeOf(left) + 1 + sizeOf(right),
-            summary: right === null ? inner : this.spec.monoid.combine(inner, right.summary),
-        };
-    }
-    /** This function copies a node with a new right subtree. It keeps the summary `inner`, so it calls `combine` once at most. */
-    withRight(n, right) {
-        return this.node(n.left, n.leaf, n.own, right, n.inner);
-    }
-    rotateLeft(n) {
-        const r = n.right;
-        return this.node(this.withRight(n, r.left), r.leaf, r.own, r.right);
-    }
-    rotateRight(n) {
-        const l = n.left;
-        return this.withRight(l, this.node(l.right, n.leaf, n.own, n.right));
-    }
-    /** This function joins a tree that is higher by more than 1 with a leaf and a lower tree on its right. */
-    joinRight(left, leaf, own, right) {
-        const c = left.right;
-        if (heightOf(c) <= heightOf(right) + 1) {
-            const t = this.node(c, leaf, own, right);
-            if (t.height <= heightOf(left.left) + 1)
-                return this.withRight(left, t);
-            return this.rotateLeft(this.withRight(left, this.rotateRight(t)));
-        }
-        const t = this.joinRight(c, leaf, own, right);
-        const joined = this.withRight(left, t);
-        return t.height <= heightOf(left.left) + 1 ? joined : this.rotateLeft(joined);
-    }
-    /** This function joins a lower tree on the left with a leaf and a tree that is higher by more than 1. */
-    joinLeft(left, leaf, own, right, inner) {
-        const c = right.left;
-        if (heightOf(c) <= heightOf(left) + 1) {
-            const t = this.node(left, leaf, own, c, inner);
-            if (t.height <= heightOf(right.right) + 1)
-                return this.node(t, right.leaf, right.own, right.right);
-            return this.rotateRight(this.node(this.rotateLeft(t), right.leaf, right.own, right.right));
-        }
-        const t = this.joinLeft(left, leaf, own, c, inner);
-        const joined = this.node(t, right.leaf, right.own, right.right);
-        return t.height <= heightOf(right.right) + 1 ? joined : this.rotateRight(joined);
-    }
-    /**
-     * This function gives the tree of the leaves of `left`, then `leaf`, then the leaves of `right`. Give `inner` only
-     * when it is the summary of `left` and `own`.
-     */
-    join(left, leaf, own, right, inner) {
-        if (heightOf(left) > heightOf(right) + 1)
-            return this.joinRight(left, leaf, own, right);
-        if (heightOf(right) > heightOf(left) + 1)
-            return this.joinLeft(left, leaf, own, right, inner);
-        return this.node(left, leaf, own, right, inner);
-    }
-    /** This function removes the last leaf of a tree, and gives the rest and the node of that leaf. */
-    splitLast(tree) {
-        if (tree.right === null)
-            return [tree.left, tree];
-        const [rest, last] = this.splitLast(tree.right);
-        return [this.join(tree.left, tree.leaf, tree.own, rest, tree.inner), last];
-    }
-    concat(left, right) {
-        if (left === null)
-            return right;
-        if (right === null)
-            return left;
-        const [rest, last] = this.splitLast(left);
-        return this.join(rest, last.leaf, last.own, right);
-    }
-    /** This function splits a tree into its first `index` leaves and the other leaves. */
-    splitAt(tree, index) {
-        if (tree === null)
-            return [null, null];
-        const before = sizeOf(tree.left);
-        if (index <= before) {
-            const [a, b] = this.splitAt(tree.left, index);
-            return [a, this.join(b, tree.leaf, tree.own, tree.right)];
-        }
-        const [a, b] = this.splitAt(tree.right, index - before - 1);
-        return [this.join(tree.left, tree.leaf, tree.own, a, tree.inner), b];
-    }
-    /** This function splits a tree before the first leaf whose prefix summary, after `acc`, satisfies the predicate. */
-    splitBy(tree, predicate, acc) {
-        if (tree === null)
-            return [null, null];
-        const { combine } = this.spec.monoid;
-        const throughLeft = tree.left === null ? acc : combine(acc, tree.left.summary);
-        if (tree.left !== null && predicate(throughLeft)) {
-            const [a, b] = this.splitBy(tree.left, predicate, acc);
-            return [a, this.join(b, tree.leaf, tree.own, tree.right)];
-        }
-        const throughLeaf = combine(throughLeft, tree.own);
-        if (predicate(throughLeaf))
-            return [tree.left, this.join(null, tree.leaf, tree.own, tree.right)];
-        const [a, b] = this.splitBy(tree.right, predicate, throughLeaf);
-        return [this.join(tree.left, tree.leaf, tree.own, a, tree.inner), b];
-    }
-    /** This function replaces the leaf at an index in the tree. It copies only the path to the leaf. */
-    replaceAt(tree, index, leaf, own) {
-        const before = sizeOf(tree.left);
-        if (index === before)
-            return this.node(tree.left, leaf, own, tree.right);
-        if (index < before)
-            return this.node(this.replaceAt(tree.left, index, leaf, own), tree.leaf, tree.own, tree.right);
-        return this.withRight(tree, this.replaceAt(tree.right, index - before - 1, leaf, own));
-    }
-    /** This function puts one leaf before the leaf at an index. It copies only the path, and `join` keeps the balance. */
-    insertAt(tree, index, leaf, own) {
-        if (tree === null)
-            return this.node(null, leaf, own, null);
-        const before = sizeOf(tree.left);
-        if (index <= before)
-            return this.join(this.insertAt(tree.left, index, leaf, own), tree.leaf, tree.own, tree.right);
-        return this.join(tree.left, tree.leaf, tree.own, this.insertAt(tree.right, index - before - 1, leaf, own), tree.inner);
-    }
-    /**
-     * This function replaces the leaf at an index with one or more leaves. It descends once: at the node of the leaf, it
-     * puts the first new leaf in the node and the other new leaves at the start of its right subtree.
-     */
-    replaceSpan(tree, index, leaves) {
-        const before = sizeOf(tree.left);
-        if (index < before)
-            return this.join(this.replaceSpan(tree.left, index, leaves), tree.leaf, tree.own, tree.right);
-        if (index > before)
-            return this.join(tree.left, tree.leaf, tree.own, this.replaceSpan(tree.right, index - before - 1, leaves), tree.inner);
-        let right = tree.right;
-        for (let i = 1; i < leaves.length; i++)
-            right = this.insertAt(right, i - 1, leaves[i], this.spec.measure(leaves[i]));
-        return this.join(tree.left, leaves[0], this.spec.measure(leaves[0]), right);
-    }
-    /** This function removes the leaf at an index. It copies only the path, and `join` keeps the balance. */
-    removeAt(tree, index) {
-        const before = sizeOf(tree.left);
-        if (index === before)
-            return this.concat(tree.left, tree.right);
-        if (index < before)
-            return this.join(this.removeAt(tree.left, index), tree.leaf, tree.own, tree.right);
-        return this.join(tree.left, tree.leaf, tree.own, this.removeAt(tree.right, index - before - 1), tree.inner);
-    }
-    /** This function gives the leaf at an index of the tree. The index must be in the tree. */
-    leafAt(tree, index) {
-        let node = tree;
-        for (;;) {
-            const before = sizeOf(node.left);
-            if (index === before)
-                return node.leaf;
-            if (index < before)
-                node = node.left;
-            else {
-                index -= before + 1;
-                node = node.right;
-            }
-        }
-    }
-    /** This function joins the leaves at `index` and `index + 1` when `spec.merge` gives one leaf for them. */
-    seam(tree, index) {
-        const { merge } = this.spec;
-        if (merge === undefined || tree === null || index < 0 || index + 1 >= tree.size)
-            return tree;
-        const merged = merge(this.leafAt(tree, index), this.leafAt(tree, index + 1));
-        if (merged === undefined)
-            return tree;
-        return this.removeAt(this.replaceAt(tree, index, merged, this.spec.measure(merged)), index + 1);
-    }
-    /** This function makes a balanced tree of the leaves `items[lo]` to `items[hi - 1]`. */
-    build(items, lo, hi) {
-        if (lo >= hi)
-            return null;
-        const mid = (lo + hi) >>> 1;
-        const leaf = items[mid];
-        return this.node(this.build(items, lo, mid), leaf, this.spec.measure(leaf), this.build(items, mid + 1, hi));
-    }
-}
-/** The largest number of removed and inserted leaves for which `splice` copies paths instead of splitting the tree. */
-const SMALL_EDIT = 8;
-/** The builders of each spec. Each spec has one builder, so that two trees of the same spec can be joined. */
-const builders = new WeakMap();
-function builderOf(spec) {
-    let builder = builders.get(spec);
-    if (builder === undefined) {
-        builder = new Builder(spec);
-        builders.set(spec, builder);
-    }
-    return builder;
-}
-function* walk(tree) {
-    // An explicit stack: the depth of the tree is O(log n), so the stack stays small
-    const stack = [];
-    let node = tree;
-    while (node !== null || stack.length > 0) {
-        while (node !== null) {
-            stack.push(node);
-            node = node.left;
-        }
-        const top = stack.pop();
-        yield top.leaf;
-        node = top.right;
-    }
-}
-/** This function gives the index of a leaf, with a negative index counted from the end, or -1 when it is not in the tree. */
-function indexOf(index, size) {
-    if (!Number.isInteger(index))
-        return -1;
-    const at = index < 0 ? size + index : index;
-    return at >= 0 && at < size ? at : -1;
-}
-function clamp(value, size) {
-    if (Number.isNaN(value))
-        return 0;
-    const whole = Math.trunc(value);
-    return whole < 0 ? Math.max(0, size + whole) : Math.min(whole, size);
-}
-/**
- * A persistent sequence of leaves with a summary of each part. Make one with `summaryTree`. Each method that changes
- * the sequence returns a new tree.
- */
-export class SummaryTree {
-    builder;
-    root;
-    constructor(builder, root) {
-        this.builder = builder;
-        this.root = root;
-    }
-    /** This function makes a tree of a spec from leaves, as `summaryTree` does. */
-    static of(spec, leaves = []) {
-        const builder = builderOf(spec);
-        const items = [...leaves];
-        return new SummaryTree(builder, builder.build(items, 0, items.length));
-    }
-    wrap(root) {
-        return root === this.root ? this : new SummaryTree(this.builder, root);
-    }
-    treeOf(leaves) {
-        if (leaves instanceof SummaryTree) {
-            if (leaves.builder !== this.builder)
-                throw new TypeError("SummaryTree: the two trees have different specs");
-            return leaves.root;
-        }
-        const items = [...leaves];
-        return this.builder.build(items, 0, items.length);
-    }
-    /** The spec of the tree: its monoid and its measure. */
-    get spec() {
-        return this.builder.spec;
-    }
-    /** The number of leaves. */
-    get size() {
-        return sizeOf(this.root);
-    }
-    get isEmpty() {
-        return this.root === null;
-    }
-    /** The summary of all the leaves, in their order. An empty tree has the summary `monoid.empty`. */
-    get summary() {
-        return this.builder.summaryOf(this.root);
-    }
-    /** The height of the tree: 0 for an empty tree. The height is at most 1.45 log2(size + 2). */
-    get height() {
-        return heightOf(this.root);
-    }
-    /**
-     * This function gives the leaf at an index, or `undefined` when the index is not in the tree. A negative index counts
-     * from the end, as `Array.prototype.at` does.
-     */
-    at(index) {
-        index = indexOf(index, this.size);
-        return index === -1 ? undefined : this.builder.leafAt(this.root, index);
-    }
-    /** This function gives the summary of the leaves from `start` to `end`, with `end` not included. */
-    summaryOf(start = 0, end = this.size) {
-        return this.slice(start, end).summary;
-    }
-    /** This function gives the tree of the leaves of this tree, then the leaves of `other`. The two trees must have the same spec. */
-    concat(other) {
-        const joined = this.builder.concat(this.root, this.treeOf(other));
-        return this.wrap(this.builder.seam(joined, this.size - 1));
-    }
-    /** This function splits the tree into its first `index` leaves and the other leaves. */
-    splitAt(index) {
-        const [left, right] = this.builder.splitAt(this.root, clamp(index, this.size));
-        return [this.wrap(left), this.wrap(right)];
-    }
-    /**
-     * This function splits the tree before the first leaf whose prefix summary satisfies the predicate. The prefix of a
-     * leaf includes the leaf. The predicate must be monotone: after it is true for a prefix, it is true for each longer
-     * prefix. When no prefix satisfies it, the right tree is empty.
-     */
-    split(predicate) {
-        const [left, right] = this.builder.splitBy(this.root, predicate, this.builder.spec.monoid.empty);
-        return [this.wrap(left), this.wrap(right)];
-    }
-    /**
-     * This function finds the first leaf whose prefix summary satisfies a monotone predicate, as `split` does. It changes
-     * nothing. It gives `undefined` when no prefix satisfies the predicate.
-     */
-    search(predicate) {
-        const { combine } = this.builder.spec.monoid;
-        let node = this.root;
-        let acc = this.builder.spec.monoid.empty;
-        let index = 0;
-        while (node !== null) {
-            const throughLeft = node.left === null ? acc : combine(acc, node.left.summary);
-            if (node.left !== null && predicate(throughLeft)) {
-                node = node.left;
-                continue;
-            }
-            const through = combine(throughLeft, node.own);
-            if (predicate(through))
-                return { index: index + sizeOf(node.left), leaf: node.leaf, before: throughLeft, through };
-            index += sizeOf(node.left) + 1;
-            acc = through;
-            node = node.right;
-        }
-        return undefined;
-    }
-    /**
-     * This function finds the leaf that holds a position of an additive key, and it calls no `combine`. The key must be
-     * additive and not negative: `key(combine(a, b))` is `key(a) + key(b)`. The function descends by the key of each left
-     * subtree and of each leaf, and subtracts it from the target. It gives the first leaf whose prefix key is more than
-     * the target, or `undefined` when the target is not in `[0, key(summary))`.
-     *
-     * @example
-     * // The leaf and the offset in it of the code unit at position 1000 of a rope
-     * const at = rope.locate((s) => s.length, 1000);
-     */
-    locate(key, target) {
-        if (!(target >= 0))
-            return undefined;
-        let node = this.root;
-        let index = 0;
-        let rest = target;
-        while (node !== null) {
-            if (node.left !== null) {
-                const left = key(node.left.summary);
-                if (rest < left) {
-                    node = node.left;
-                    continue;
-                }
-                rest -= left;
-                index += node.left.size;
-            }
-            const own = key(node.own);
-            if (rest < own)
-                return { index, leaf: node.leaf, offset: rest };
-            rest -= own;
-            index += 1;
-            node = node.right;
-        }
-        return undefined;
-    }
-    /** This function gives the tree of the leaves from `start` to `end`, with `end` not included. A negative index counts from the end. */
-    slice(start = 0, end = this.size) {
-        const from = clamp(start, this.size);
-        const to = clamp(end, this.size);
-        if (to <= from)
-            return this.wrap(null);
-        const [, rest] = this.builder.splitAt(this.root, from);
-        const [middle] = this.builder.splitAt(rest, to - from);
-        return this.wrap(middle);
-    }
-    /**
-     * This function removes `deleteCount` leaves at `start` and puts the leaves of `inserted` there, as
-     * `Array.prototype.splice` does. It returns the new tree, not the removed leaves.
-     */
-    splice(start, deleteCount = this.size, inserted = []) {
-        const from = clamp(start, this.size);
-        const count = Math.max(0, Math.min(Number.isNaN(deleteCount) ? 0 : Math.trunc(deleteCount), this.size - from));
-        const builder = this.builder;
-        const leaves = inserted instanceof SummaryTree ? undefined : [...inserted];
-        const added = leaves === undefined ? inserted.size : leaves.length;
-        if (count === 0 && added === 0)
-            return this;
-        let root = this.root;
-        if (leaves !== undefined && count + added <= SMALL_EDIT) {
-            // A small edit copies only the paths to its leaves: 1 or 2 combines for each level of each path
-            const replaced = Math.min(count, added);
-            if (count > 0 && added > count) {
-                // The last removed leaf takes all the extra leaves in one descent
-                for (let i = 0; i < count - 1; i++)
-                    root = builder.replaceAt(root, from + i, leaves[i], builder.spec.measure(leaves[i]));
-                root = builder.replaceSpan(root, from + count - 1, leaves.slice(count - 1));
-            }
-            else
-                for (let i = 0; i < added; i++) {
-                    const leaf = leaves[i];
-                    const own = builder.spec.measure(leaf);
-                    root = i < replaced ? builder.replaceAt(root, from + i, leaf, own) : builder.insertAt(root, from + i, leaf, own);
-                }
-            for (let i = replaced; i < count; i++)
-                root = builder.removeAt(root, from + added);
-        }
-        else {
-            const middle = leaves === undefined ? this.treeOf(inserted) : builder.build(leaves, 0, leaves.length);
-            const [left, rest] = builder.splitAt(root, from);
-            const [, right] = builder.splitAt(rest, count);
-            root = builder.concat(builder.concat(left, middle), right);
-        }
-        // The right seam first, so that a merge there does not move the index of the left seam
-        if (added > 0)
-            root = builder.seam(root, from + added - 1);
-        return this.wrap(builder.seam(root, from - 1));
-    }
-    /** This function puts the leaves of `inserted` before the leaf at `index`. */
-    insert(index, inserted) {
-        return this.splice(index, 0, inserted);
-    }
-    /** This function removes the leaves from `start` to `end`, with `end` not included. */
-    remove(start, end = this.size) {
-        const from = clamp(start, this.size);
-        return this.splice(from, Math.max(0, clamp(end, this.size) - from));
-    }
-    /**
-     * This function replaces the leaf at an index. A negative index counts from the end, as `Array.prototype.with` does.
-     * An index that is not in the tree changes nothing. It copies only the path to the leaf, and it does not call
-     * `spec.merge`.
-     */
-    set(index, leaf) {
-        const at = indexOf(index, this.size);
-        return at === -1 ? this : this.wrap(this.builder.replaceAt(this.root, at, leaf, this.builder.spec.measure(leaf)));
-    }
-    /** This function adds leaves after the last leaf. */
-    append(...leaves) {
-        return this.concat(leaves);
-    }
-    /** This function adds leaves before the first leaf. */
-    prepend(...leaves) {
-        const joined = this.builder.concat(this.treeOf(leaves), this.root);
-        return this.wrap(this.builder.seam(joined, leaves.length - 1));
-    }
-    /** This function gives the leaves in their order. */
-    [Symbol.iterator]() {
-        return walk(this.root);
-    }
-    /** This function gives the leaves in an array. */
-    toArray() {
-        return [...walk(this.root)];
-    }
-}
-/**
- * This function makes a persistent tree of leaves with a summary of each part. Use the same `spec` object for each
- * tree that `concat` or `splice` joins.
- */
-export function summaryTree(spec, leaves = []) {
-    return SummaryTree.of(spec, leaves);
-}
-/**
- * @internal This function examines the invariants of a tree: the AVL balance, the heights, the sizes and the
- * summaries. It gives a list of the faults, empty when there is no fault. The tests use it.
- */
-export function summaryTreeFaults(tree, equal) {
-    const builder = tree["builder"];
-    const faults = [];
-    const visit = (node, path) => {
-        if (node === null)
-            return;
-        visit(node.left, `${path}L`);
-        visit(node.right, `${path}R`);
-        const hl = heightOf(node.left);
-        const hr = heightOf(node.right);
-        if (Math.abs(hl - hr) > 1)
-            faults.push(`${path}: balance ${hl - hr}`);
-        if (node.height !== 1 + Math.max(hl, hr))
-            faults.push(`${path}: height ${node.height}`);
-        if (node.size !== sizeOf(node.left) + 1 + sizeOf(node.right))
-            faults.push(`${path}: size ${node.size}`);
-        const { combine } = builder.spec.monoid;
-        const inner = combine(builder.summaryOf(node.left), builder.spec.measure(node.leaf));
-        if (!equal(node.inner, inner))
-            faults.push(`${path}: inner`);
-        if (!equal(node.summary, combine(inner, builder.summaryOf(node.right))))
-            faults.push(`${path}: summary`);
-    };
-    visit(tree["root"], "^");
-    return faults;
-}
-//# sourceMappingURL=summary-tree.js.map

package/dist/impl/summary-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"summary-tree.js","sourceRoot":"","sources":["../../src/impl/summary-tree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;;;;;;;;;GAsBG;AA4DH,SAAS,QAAQ,CAAO,IAAgB;IACtC,OAAO,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC;AACzC,CAAC;AAED,SAAS,MAAM,CAAO,IAAgB;IACpC,OAAO,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC;AACvC,CAAC;AAED,6DAA6D;AAC7D,MAAM,OAAO;IACU,IAAI;IAAzB,YAAqB,IAAuB;oBAAvB,IAAI;IAAsB,CAAC;IAEhD,SAAS,CAAC,IAAgB;QACxB,OAAO,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC;IAC/D,CAAC;IAED,uHAAuH;IACvH,IAAI,CAAC,IAAgB,EAAE,IAAO,EAAE,GAAM,EAAE,KAAiB,EAAE,KAAS;QAClE,IAAI,KAAK,KAAK,SAAS;YAAE,KAAK,GAAG,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,CAAC;QACnG,OAAO;YACL,IAAI;YACJ,IAAI;YACJ,GAAG;YACH,KAAK;YACL,KAAK;YACL,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,QAAQ,CAAC,KAAK,CAAC,CAAC;YACrD,IAAI,EAAE,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,KAAK,CAAC;YACtC,OAAO,EAAE,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,OAAO,CAAC;SACjF,CAAC;IACJ,CAAC;IAED,8HAA8H;IAC9H,SAAS,CAAC,CAAa,EAAE,KAAiB;QACxC,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IAC1D,CAAC;IAED,UAAU,CAAC,CAAa;QACtB,MAAM,CAAC,GAAG,CAAC,CAAC,KAAM,CAAC;QACnB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC;IACtE,CAAC;IAED,WAAW,CAAC,CAAa;QACvB,MAAM,CAAC,GAAG,CAAC,CAAC,IAAK,CAAC;QAClB,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;IACvE,CAAC;IAED,0GAA0G;IAC1G,SAAS,CAAC,IAAgB,EAAE,IAAO,EAAE,GAAM,EAAE,KAAiB;QAC5D,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC;QACrB,IAAI,QAAQ,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC;YACvC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;YACzC,IAAI,CAAC,CAAC,MAAM,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC;gBAAE,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;YACxE,OAAO,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACpE,CAAC;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,CAAE,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QAC/C,MAAM,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;QACvC,OAAO,CAAC,CAAC,MAAM,IAAI,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAChF,CAAC;IAED,yGAAyG;IACzG,QAAQ,CAAC,IAAgB,EAAE,IAAO,EAAE,GAAM,EAAE,KAAiB,EAAE,KAAS;QACtE,MAAM,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC;QACrB,IAAI,QAAQ,CAAC,CAAC,CAAC,IAAI,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACtC,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;YAC/C,IAAI,CAAC,CAAC,MAAM,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC;gBAAE,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;YACnG,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC;QAC7F,CAAC;QACD,MAAM,CAAC,GAAG,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,CAAE,EAAE,KAAK,CAAC,CAAC;QACpD,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,KAAK,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,KAAK,CAAC,CAAC;QAChE,OAAO,CAAC,CAAC,MAAM,IAAI,QAAQ,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC;IACnF,CAAC;IAED;;;OAGG;IACH,IAAI,CAAC,IAAgB,EAAE,IAAO,EAAE,GAAM,EAAE,KAAiB,EAAE,KAAS;QAClE,IAAI,QAAQ,CAAC,IAAI,CAAC,GAAG,QAAQ,CAAC,KAAK,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC,SAAS,CAAC,IAAK,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;QACzF,IAAI,QAAQ,CAAC,KAAK,CAAC,GAAG,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC;YAAE,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,KAAM,EAAE,KAAK,CAAC,CAAC;QAC/F,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;IAClD,CAAC;IAED,mGAAmG;IACnG,SAAS,CAAC,IAAgB;QACxB,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI;YAAE,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAClD,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChD,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,CAAC,CAAC;IAC7E,CAAC;IAED,MAAM,CAAC,IAAgB,EAAE,KAAiB;QACxC,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,KAAK,CAAC;QAChC,IAAI,KAAK,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC;QAChC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,CAAC;QAC1C,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACrD,CAAC;IAED,sFAAsF;IACtF,OAAO,CAAC,IAAgB,EAAE,KAAa;QACrC,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACvC,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,KAAK,IAAI,MAAM,EAAE,CAAC;YACpB,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAC9C,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5D,CAAC;QACD,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC,CAAC;QAC5D,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACvE,CAAC;IAED,oHAAoH;IACpH,OAAO,CAAC,IAAgB,EAAE,SAAiC,EAAE,GAAM;QACjE,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACvC,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;QACrC,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;QAC/E,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,SAAS,CAAC,WAAW,CAAC,EAAE,CAAC;YACjD,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,GAAG,CAAC,CAAC;YACvD,OAAO,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QAC5D,CAAC;QACD,MAAM,WAAW,GAAG,OAAO,CAAC,WAAW,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;QACnD,IAAI,SAAS,CAAC,WAAW,CAAC;YAAE,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;QACjG,MAAM,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,KAAK,EAAE,SAAS,EAAE,WAAW,CAAC,CAAC;QAChE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACvE,CAAC;IAED,oGAAoG;IACpG,SAAS,CAAC,IAAgB,EAAE,KAAa,EAAE,IAAO,EAAE,GAAM;QACxD,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,KAAK,KAAK,MAAM;YAAE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACzE,IAAI,KAAK,GAAG,MAAM;YAAE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAK,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACpH,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,KAAM,EAAE,KAAK,GAAG,MAAM,GAAG,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;IAC1F,CAAC;IAED,sHAAsH;IACtH,QAAQ,CAAC,IAAgB,EAAE,KAAa,EAAE,IAAO,EAAE,GAAM;QACvD,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,EAAE,GAAG,EAAE,IAAI,CAAC,CAAC;QAC3D,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,KAAK,IAAI,MAAM;YAAE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACnH,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,GAAG,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACzH,CAAC;IAED;;;OAGG;IACH,WAAW,CAAC,IAAgB,EAAE,KAAa,EAAE,MAAoB;QAC/D,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,KAAK,GAAG,MAAM;YAAE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,IAAK,EAAE,KAAK,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACnH,IAAI,KAAK,GAAG,MAAM;YAAE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,KAAM,EAAE,KAAK,GAAG,MAAM,GAAG,CAAC,EAAE,MAAM,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAC5I,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE;YAAE,KAAK,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,EAAE,CAAC,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;QACvH,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC,CAAE,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,EAAE,KAAK,CAAC,CAAC;IAChF,CAAC;IAED,yGAAyG;IACzG,QAAQ,CAAC,IAAgB,EAAE,KAAa;QACtC,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,KAAK,KAAK,MAAM;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QAChE,IAAI,KAAK,GAAG,MAAM;YAAE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAK,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACxG,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAM,EAAE,KAAK,GAAG,MAAM,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IAC/G,CAAC;IAED,2FAA2F;IAC3F,MAAM,CAAC,IAAgB,EAAE,KAAa;QACpC,IAAI,IAAI,GAAG,IAAI,CAAC;QAChB,SAAS,CAAC;YACR,MAAM,MAAM,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,IAAI,KAAK,KAAK,MAAM;gBAAE,OAAO,IAAI,CAAC,IAAI,CAAC;YACvC,IAAI,KAAK,GAAG,MAAM;gBAAE,IAAI,GAAG,IAAI,CAAC,IAAK,CAAC;iBACjC,CAAC;gBACJ,KAAK,IAAI,MAAM,GAAG,CAAC,CAAC;gBACpB,IAAI,GAAG,IAAI,CAAC,KAAM,CAAC;YACrB,CAAC;QACH,CAAC;IACH,CAAC;IAED,2GAA2G;IAC3G,IAAI,CAAC,IAAgB,EAAE,KAAa;QAClC,MAAM,EAAE,KAAK,EAAE,GAAG,IAAI,CAAC,IAAI,CAAC;QAC5B,IAAI,KAAK,KAAK,SAAS,IAAI,IAAI,KAAK,IAAI,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,CAAC,IAAI,IAAI,CAAC,IAAI;YAAE,OAAO,IAAI,CAAC;QAC7F,MAAM,MAAM,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7E,IAAI,MAAM,KAAK,SAAS;YAAE,OAAO,IAAI,CAAC;QACtC,OAAO,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,EAAE,KAAK,EAAE,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAClG,CAAC;IAED,wFAAwF;IACxF,KAAK,CAAC,KAAmB,EAAE,EAAU,EAAE,EAAU;QAC/C,IAAI,EAAE,IAAI,EAAE;YAAE,OAAO,IAAI,CAAC;QAC1B,MAAM,GAAG,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAE,CAAC;QACzB,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,EAAE,EAAE,GAAG,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC9G,CAAC;CACF;AAED,uHAAuH;AACvH,MAAM,UAAU,GAAG,CAAC,CAAC;AAErB,8GAA8G;AAC9G,MAAM,QAAQ,GAAG,IAAI,OAAO,EAAqC,CAAC;AAElE,SAAS,SAAS,CAAO,IAAuB;IAC9C,IAAI,OAAO,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAA8B,CAAC;IAC9D,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;QAC1B,OAAO,GAAG,IAAI,OAAO,CAAC,IAAI,CAAC,CAAC;QAC5B,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,OAAoC,CAAC,CAAC;IAC3D,CAAC;IACD,OAAO,OAAO,CAAC;AACjB,CAAC;AAED,QAAQ,CAAC,CAAC,IAAI,CAAO,IAAgB;IACnC,iFAAiF;IACjF,MAAM,KAAK,GAAiB,EAAE,CAAC;IAC/B,IAAI,IAAI,GAAG,IAAI,CAAC;IAChB,OAAO,IAAI,KAAK,IAAI,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzC,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACnB,CAAC;QACD,MAAM,GAAG,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QACzB,MAAM,GAAG,CAAC,IAAI,CAAC;QACf,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC;IACnB,CAAC;AACH,CAAC;AAED,6HAA6H;AAC7H,SAAS,OAAO,CAAC,KAAa,EAAE,IAAY;IAC1C,IAAI,CAAC,MAAM,CAAC,SAAS,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC,CAAC;IACxC,MAAM,EAAE,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC;IAC5C,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AACxC,CAAC;AAED,SAAS,KAAK,CAAC,KAAa,EAAE,IAAY;IACxC,IAAI,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC;QAAE,OAAO,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC;IAChC,OAAO,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC;AACvE,CAAC;AAED;;;GAGG;AACH,MAAM,OAAO,WAAW;IAEH,OAAO;IACP,IAAI;IAFvB,YACmB,OAA+B,EAC/B,IAAyB;uBADzB,OAAO;oBACP,IAAI;IACpB,CAAC;IAEJ,+EAA+E;IAC/E,MAAM,CAAC,EAAE,CAAgB,IAAgC,EAAE,MAAM,GAAmB,EAAE;QACpF,MAAM,OAAO,GAAG,SAAS,CAAC,IAAI,CAAC,CAAC;QAChC,MAAM,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;QAC1B,OAAO,IAAI,WAAW,CAAC,OAAO,EAAE,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC;IACzE,CAAC;IAEO,IAAI,CAAC,IAAyB;QACpC,OAAO,IAAI,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,CAAC;IACzE,CAAC;IAEO,MAAM,CAAC,MAAmD;QAChE,IAAI,MAAM,YAAY,WAAW,EAAE,CAAC;YAClC,IAAI,MAAM,CAAC,OAAO,KAAK,IAAI,CAAC,OAAO;gBAAE,MAAM,IAAI,SAAS,CAAC,iDAAiD,CAAC,CAAC;YAC5G,OAAO,MAAM,CAAC,IAAI,CAAC;QACrB,CAAC;QACD,MAAM,KAAK,GAAG,CAAC,GAAG,MAAM,CAAC,CAAC;QAC1B,OAAO,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,MAAM,CAAC,CAAC;IACpD,CAAC;IAED,wDAAwD;IACxD,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC;IAC3B,CAAC;IAED,4BAA4B;IAC5B,IAAI,IAAI;QACN,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3B,CAAC;IAED,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC;IAC5B,CAAC;IAED,mGAAmG;IACnG,IAAI,OAAO;QACT,OAAO,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC3C,CAAC;IAED,8FAA8F;IAC9F,IAAI,MAAM;QACR,OAAO,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC7B,CAAC;IAED;;;OAGG;IACH,EAAE,CAAC,KAAa;QACd,KAAK,GAAG,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAClC,OAAO,KAAK,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,IAAK,EAAE,KAAK,CAAC,CAAC;IAC3E,CAAC;IAED,oGAAoG;IACpG,SAAS,CAAC,KAAK,GAAG,CAAC,EAAE,GAAG,GAAW,IAAI,CAAC,IAAI;QAC1C,OAAO,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC,OAAO,CAAC;IACxC,CAAC;IAED,kIAAkI;IAClI,MAAM,CAAC,KAAkD;QACvD,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;QAClE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IAC7D,CAAC;IAED,wFAAwF;IACxF,OAAO,CAAC,KAAa;QACnB,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QAC/E,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,SAAuC;QAC3C,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,SAAS,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACjG,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;IAC7C,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,SAAuC;QAC5C,MAAM,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;QAC7C,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,IAAI,GAAG,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC;QACzC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,MAAM,WAAW,GAAG,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YAC/E,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,IAAI,SAAS,CAAC,WAAW,CAAC,EAAE,CAAC;gBACjD,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;gBACjB,SAAS;YACX,CAAC;YACD,MAAM,OAAO,GAAG,OAAO,CAAC,WAAW,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/C,IAAI,SAAS,CAAC,OAAO,CAAC;gBAAE,OAAO,EAAE,KAAK,EAAE,KAAK,GAAG,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,WAAW,EAAE,OAAO,EAAE,CAAC;YACnH,KAAK,IAAI,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC/B,GAAG,GAAG,OAAO,CAAC;YACd,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;;OASG;IACH,MAAM,CAAC,GAAiC,EAAE,MAAc;QACtD,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC;YAAE,OAAO,SAAS,CAAC;QACrC,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,IAAI,GAAG,MAAM,CAAC;QAClB,OAAO,IAAI,KAAK,IAAI,EAAE,CAAC;YACrB,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;gBACvB,MAAM,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;gBACpC,IAAI,IAAI,GAAG,IAAI,EAAE,CAAC;oBAChB,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;oBACjB,SAAS;gBACX,CAAC;gBACD,IAAI,IAAI,IAAI,CAAC;gBACb,KAAK,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;YAC1B,CAAC;YACD,MAAM,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAC1B,IAAI,IAAI,GAAG,GAAG;gBAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;YAChE,IAAI,IAAI,GAAG,CAAC;YACZ,KAAK,IAAI,CAAC,CAAC;YACX,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC;QACpB,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED,uIAAuI;IACvI,KAAK,CAAC,KAAK,GAAG,CAAC,EAAE,GAAG,GAAW,IAAI,CAAC,IAAI;QACtC,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACjC,IAAI,EAAE,IAAI,IAAI;YAAE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,CAAC,EAAE,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QACvD,MAAM,CAAC,MAAM,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,GAAG,IAAI,CAAC,CAAC;QACvD,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAC3B,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,KAAa,EAAE,WAAW,GAAW,IAAI,CAAC,IAAI,EAAE,QAAQ,GAAgD,EAAE;QAC/G,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,MAAM,KAAK,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC,EAAE,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC;QAC/G,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC;QAC7B,MAAM,MAAM,GAAG,QAAQ,YAAY,WAAW,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,GAAG,QAAQ,CAAC,CAAC;QAC3E,MAAM,KAAK,GAAG,MAAM,KAAK,SAAS,CAAC,CAAC,CAAE,QAAuC,CAAC,IAAI,CAAC,CAAC,CAAC,MAAM,CAAC,MAAM,CAAC;QACnG,IAAI,KAAK,KAAK,CAAC,IAAI,KAAK,KAAK,CAAC;YAAE,OAAO,IAAI,CAAC;QAC5C,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC;QACrB,IAAI,MAAM,KAAK,SAAS,IAAI,KAAK,GAAG,KAAK,IAAI,UAAU,EAAE,CAAC;YACxD,gGAAgG;YAChG,MAAM,QAAQ,GAAG,IAAI,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;YACxC,IAAI,KAAK,GAAG,CAAC,IAAI,KAAK,GAAG,KAAK,EAAE,CAAC;gBAC/B,kEAAkE;gBAClE,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,EAAE;oBAAE,IAAI,GAAG,OAAO,CAAC,SAAS,CAAC,IAAK,EAAE,IAAI,GAAG,CAAC,EAAE,MAAM,CAAC,CAAC,CAAE,EAAE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC,CAAC;gBAC5H,IAAI,GAAG,OAAO,CAAC,WAAW,CAAC,IAAK,EAAE,IAAI,GAAG,KAAK,GAAG,CAAC,EAAE,MAAM,CAAC,KAAK,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;YAC/E,CAAC;;gBAAM,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;oBACtC,MAAM,IAAI,GAAG,MAAM,CAAC,CAAC,CAAE,CAAC;oBACxB,MAAM,GAAG,GAAG,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;oBACvC,IAAI,GAAG,CAAC,GAAG,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,SAAS,CAAC,IAAK,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC;gBACpH,CAAC;YACD,KAAK,IAAI,CAAC,GAAG,QAAQ,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE;gBAAE,IAAI,GAAG,OAAO,CAAC,QAAQ,CAAC,IAAK,EAAE,IAAI,GAAG,KAAK,CAAC,CAAC;QACtF,CAAC;aAAM,CAAC;YACN,MAAM,MAAM,GAAG,MAAM,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;YACtG,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;YACjD,MAAM,CAAC,EAAE,KAAK,CAAC,GAAG,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAC/C,IAAI,GAAG,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,MAAM,CAAC,EAAE,KAAK,CAAC,CAAC;QAC7D,CAAC;QACD,uFAAuF;QACvF,IAAI,KAAK,GAAG,CAAC;YAAE,IAAI,GAAG,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC;QAC3D,OAAO,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC;IACjD,CAAC;IAED,8EAA8E;IAC9E,MAAM,CAAC,KAAa,EAAE,QAAqD;QACzE,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;IACzC,CAAC;IAED,uFAAuF;IACvF,MAAM,CAAC,KAAa,EAAE,GAAG,GAAW,IAAI,CAAC,IAAI;QAC3C,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,OAAO,IAAI,CAAC,MAAM,CAAC,IAAI,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,KAAK,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IACtE,CAAC;IAED;;;;OAIG;IACH,GAAG,CAAC,KAAa,EAAE,IAAU;QAC3B,MAAM,EAAE,GAAG,OAAO,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACrC,OAAO,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,IAAK,EAAE,EAAE,EAAE,IAAI,EAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACrH,CAAC;IAED,qDAAqD;IACrD,MAAM,CAAC,GAAG,MAAc;QACtB,OAAO,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IAC7B,CAAC;IAED,uDAAuD;IACvD,OAAO,CAAC,GAAG,MAAc;QACvB,MAAM,MAAM,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QACnE,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;IACjE,CAAC;IAED,qDAAqD;IACrD,CAAC,MAAM,CAAC,QAAQ,CAAC;QACf,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACzB,CAAC;IAED,kDAAkD;IAClD,OAAO;QACL,OAAO,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;IAC9B,CAAC;CACF;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAgB,IAAgC,EAAE,MAAM,GAAmB,EAAE;IACtG,OAAO,WAAW,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;AACtC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,iBAAiB,CAAgB,IAAgC,EAAE,KAA0C;IAC3H,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,CAAC,CAAC;IAChC,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,KAAK,GAAG,CAAC,IAAyB,EAAE,IAAY,EAAQ,EAAE;QAC9D,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO;QAC1B,KAAK,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,GAAG,IAAI,GAAG,CAAC,CAAC;QAC9B,MAAM,EAAE,GAAG,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC/B,MAAM,EAAE,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAChC,IAAI,IAAI,CAAC,GAAG,CAAC,EAAE,GAAG,EAAE,CAAC,GAAG,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,aAAa,EAAE,GAAG,EAAE,EAAE,CAAC,CAAC;QACtE,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,EAAE,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,YAAY,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACxF,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,UAAU,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC;QACxG,MAAM,EAAE,OAAO,EAAE,GAAG,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC;QACxC,MAAM,KAAK,GAAG,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC;QACrF,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,SAAS,CAAC,CAAC;QAC7D,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,SAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC;YAAE,MAAM,CAAC,IAAI,CAAC,GAAG,IAAI,WAAW,CAAC,CAAC;IAC3G,CAAC,CAAC;IACF,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,EAAE,GAAG,CAAC,CAAC;IACzB,OAAO,MAAM,CAAC;AAChB,CAAC"}