@rocicorp/zero 0.5.2024103100 → 0.5.2024110200

package/out/replicache/src/async-iterable-to-array.js

@@ -1,8 +0,0 @@
-export async function asyncIterableToArray(it) {
-    const arr = [];
-    for await (const v of it) {
-        arr.push(v);
-    }
-    return arr;
-}
-//# sourceMappingURL=async-iterable-to-array.js.map

package/out/replicache/src/async-iterable-to-array.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"async-iterable-to-array.js","sourceRoot":"","sources":["../../../../replicache/src/async-iterable-to-array.ts"],"names":[],"mappings":"AAAA,MAAM,CAAC,KAAK,UAAU,oBAAoB,CACxC,EAAoB;IAEpB,MAAM,GAAG,GAAQ,EAAE,CAAC;IACpB,IAAI,KAAK,EAAE,MAAM,CAAC,IAAI,EAAE,EAAE,CAAC;QACzB,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACd,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/out/replicache/src/bg-interval.js

@@ -1,38 +0,0 @@
-import { AbortError } from '../../shared/src/abort-error.js';
-import { sleep } from '../../shared/src/sleep.js';
-export function initBgIntervalProcess(processName, process, delayMs, lc, signal) {
-    void runBgIntervalProcess(processName, process, delayMs, lc, signal);
-}
-async function runBgIntervalProcess(processName, process, delayMs, lc, signal) {
-    if (signal.aborted) {
-        return;
-    }
-    lc = lc.withContext('bgIntervalProcess', processName);
-    lc.debug?.('Starting');
-    while (!signal.aborted) {
-        try {
-            await sleep(delayMs(), signal);
-        }
-        catch (e) {
-            if (!(e instanceof AbortError)) {
-                throw e;
-            }
-        }
-        if (!signal.aborted) {
-            lc.debug?.('Running');
-            try {
-                await process();
-            }
-            catch (e) {
-                if (signal.aborted) {
-                    lc.debug?.('Error running most likely due to close.', e);
-                }
-                else {
-                    lc.error?.('Error running.', e);
-                }
-            }
-        }
-    }
-    lc.debug?.('Stopping');
-}
-//# sourceMappingURL=bg-interval.js.map

package/out/replicache/src/bg-interval.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"bg-interval.js","sourceRoot":"","sources":["../../../../replicache/src/bg-interval.ts"],"names":[],"mappings":"AACA,OAAO,EAAC,UAAU,EAAC,MAAM,iCAAiC,CAAC;AAC3D,OAAO,EAAC,KAAK,EAAC,MAAM,2BAA2B,CAAC;AAEhD,MAAM,UAAU,qBAAqB,CACnC,WAAmB,EACnB,OAA+B,EAC/B,OAAqB,EACrB,EAAc,EACd,MAAmB;IAEnB,KAAK,oBAAoB,CAAC,WAAW,EAAE,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,MAAM,CAAC,CAAC;AACvE,CAAC;AAED,KAAK,UAAU,oBAAoB,CACjC,WAAmB,EACnB,OAA+B,EAC/B,OAAqB,EACrB,EAAc,EACd,MAAmB;IAEnB,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;QACnB,OAAO;IACT,CAAC;IACD,EAAE,GAAG,EAAE,CAAC,WAAW,CAAC,mBAAmB,EAAE,WAAW,CAAC,CAAC;IACtD,EAAE,CAAC,KAAK,EAAE,CAAC,UAAU,CAAC,CAAC;IACvB,OAAO,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;QACvB,IAAI,CAAC;YACH,MAAM,KAAK,CAAC,OAAO,EAAE,EAAE,MAAM,CAAC,CAAC;QACjC,CAAC;QAAC,OAAO,CAAC,EAAE,CAAC;YACX,IAAI,CAAC,CAAC,CAAC,YAAY,UAAU,CAAC,EAAE,CAAC;gBAC/B,MAAM,CAAC,CAAC;YACV,CAAC;QACH,CAAC;QACD,IAAI,CAAC,MAAM,CAAC,OAAO,EAAE,CAAC;YACpB,EAAE,CAAC,KAAK,EAAE,CAAC,SAAS,CAAC,CAAC;YACtB,IAAI,CAAC;gBACH,MAAM,OAAO,EAAE,CAAC;YAClB,CAAC;YAAC,OAAO,CAAC,EAAE,CAAC;gBACX,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC;oBACnB,EAAE,CAAC,KAAK,EAAE,CAAC,yCAAyC,EAAE,CAAC,CAAC,CAAC;gBAC3D,CAAC;qBAAM,CAAC;oBACN,EAAE,CAAC,KAAK,EAAE,CAAC,gBAAgB,EAAE,CAAC,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IACD,EAAE,CAAC,KAAK,EAAE,CAAC,UAAU,CAAC,CAAC;AACzB,CAAC"}

package/out/replicache/src/binary-search.js

@@ -1,31 +0,0 @@
-/**
- * This is a binary search that returns the index of the first element in the
- * array that is greater than or equal to the given value.
- *
- * Typical usage:
- *
- * ```
- * const haystack = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9];
- * const needle = 3;
- * const index = binarySearch(haystack.length, i => needle - haystack[i]);
- * const found = index < haystack.length && haystack[index] === needle;
- * ```
- */
-export function binarySearch(high, compare) {
-    let low = 0;
-    while (low < high) {
-        const mid = low + ((high - low) >> 1);
-        const i = compare(mid);
-        if (i === 0) {
-            return mid;
-        }
-        if (i > 0) {
-            low = mid + 1;
-        }
-        else {
-            high = mid;
-        }
-    }
-    return low;
-}
-//# sourceMappingURL=binary-search.js.map

package/out/replicache/src/binary-search.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"binary-search.js","sourceRoot":"","sources":["../../../../replicache/src/binary-search.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,YAAY,CAAC,IAAY,EAAE,OAA8B;IACvE,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,OAAO,GAAG,GAAG,IAAI,EAAE,CAAC;QAClB,MAAM,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC,IAAI,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC,CAAC;QACtC,MAAM,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC;YACZ,OAAO,GAAG,CAAC;QACb,CAAC;QACD,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACV,GAAG,GAAG,GAAG,GAAG,CAAC,CAAC;QAChB,CAAC;aAAM,CAAC;YACN,IAAI,GAAG,GAAG,CAAC;QACb,CAAC;IACH,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC"}

package/out/replicache/src/broadcast-channel.js

@@ -1,29 +0,0 @@
-/* eslint-disable @typescript-eslint/no-explicit-any */
-class NoopBroadcastChannel {
-    name;
-    onmessage = null;
-    onmessageerror = null;
-    constructor(name) {
-        this.name = name;
-    }
-    addEventListener() {
-        // noop
-    }
-    removeEventListener() {
-        // noop
-    }
-    dispatchEvent() {
-        return false;
-    }
-    close() {
-        // noop
-    }
-    postMessage() {
-        // noop
-    }
-}
-const bc = typeof BroadcastChannel === 'undefined'
-    ? NoopBroadcastChannel
-    : BroadcastChannel;
-export { bc as BroadcastChannel };
-//# sourceMappingURL=broadcast-channel.js.map

package/out/replicache/src/broadcast-channel.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"broadcast-channel.js","sourceRoot":"","sources":["../../../../replicache/src/broadcast-channel.ts"],"names":[],"mappings":"AAAA,uDAAuD;AAEvD,MAAM,oBAAoB;IACf,IAAI,CAAS;IAEtB,SAAS,GACP,IAAI,CAAC;IAEP,cAAc,GAEH,IAAI,CAAC;IAEhB,YAAY,IAAY;QACtB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAED,gBAAgB;QACd,OAAO;IACT,CAAC;IACD,mBAAmB;QACjB,OAAO;IACT,CAAC;IACD,aAAa;QACX,OAAO,KAAK,CAAC;IACf,CAAC;IAED,KAAK;QACH,OAAO;IACT,CAAC;IAED,WAAW;QACT,OAAO;IACT,CAAC;CACF;AAED,MAAM,EAAE,GACN,OAAO,gBAAgB,KAAK,WAAW;IACrC,CAAC,CAAC,oBAAoB;IACtB,CAAC,CAAC,gBAAgB,CAAC;AAEvB,OAAO,EAAC,EAAE,IAAI,gBAAgB,EAAC,CAAC"}

package/out/replicache/src/btree/diff.js

@@ -1,6 +0,0 @@
-import { asyncIterableToArray } from '../async-iterable-to-array.js';
-export function diff(oldMap, newMap) {
-    // Return an array to ensure we do not compute the diff more than once.
-    return asyncIterableToArray(newMap.diff(oldMap));
-}
-//# sourceMappingURL=diff.js.map

package/out/replicache/src/btree/diff.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"diff.js","sourceRoot":"","sources":["../../../../../replicache/src/btree/diff.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,oBAAoB,EAAC,MAAM,+BAA+B,CAAC;AAInE,MAAM,UAAU,IAAI,CAClB,MAAiB,EACjB,MAAiB;IAEjB,uEAAuE;IACvE,OAAO,oBAAoB,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC;AACnD,CAAC"}

package/out/replicache/src/btree/node.js

@@ -1,392 +0,0 @@
-import { compareUTF8 } from 'compare-utf8';
-import { assert, assertArray, assertNumber, assertString, } from '../../../shared/src/asserts.js';
-import { joinIterables } from '../../../shared/src/iterables.js';
-import { assertJSONValue, } from '../../../shared/src/json.js';
-import { binarySearch as binarySearchWithFunc } from '../binary-search.js';
-import { skipBTreeNodeAsserts } from '../config.js';
-import * as FormatVersion from '../format-version-enum.js';
-import { assertDeepFrozen, deepFreeze, } from '../frozen-json.js';
-import { emptyHash, newRandomHash } from '../hash.js';
-export const NODE_LEVEL = 0;
-export const NODE_ENTRIES = 1;
-export function makeNodeChunkData(level, entries, formatVersion) {
-    return deepFreeze([
-        level,
-        (formatVersion >= FormatVersion.V7
-            ? entries
-            : entries.map(e => e.slice(0, 2))),
-    ]);
-}
-/**
- * Finds the leaf where a key is (if present) or where it should go if not
- * present.
- */
-export async function findLeaf(key, hash, source, expectedRootHash) {
-    const node = await source.getNode(hash);
-    // The root changed. Try again
-    if (expectedRootHash !== source.rootHash) {
-        return findLeaf(key, source.rootHash, source, source.rootHash);
-    }
-    if (isDataNodeImpl(node)) {
-        return node;
-    }
-    const { entries } = node;
-    let i = binarySearch(key, entries);
-    if (i === entries.length) {
-        i--;
-    }
-    const entry = entries[i];
-    return findLeaf(key, entry[1], source, expectedRootHash);
-}
-/**
- * Does a binary search over entries
- *
- * If the key found then the return value is the index it was found at.
- *
- * If the key was *not* found then the return value is the index where it should
- * be inserted at
- */
-export function binarySearch(key, entries) {
-    return binarySearchWithFunc(entries.length, i => compareUTF8(key, entries[i][0]));
-}
-export function binarySearchFound(i, entries, key) {
-    return i !== entries.length && entries[i][0] === key;
-}
-export function parseBTreeNode(v, formatVersion, getSizeOfEntry) {
-    if (skipBTreeNodeAsserts && formatVersion >= FormatVersion.V7) {
-        return v;
-    }
-    assertArray(v);
-    assertDeepFrozen(v);
-    // Be relaxed about what we accept.
-    assert(v.length >= 2);
-    const [level, entries] = v;
-    assertNumber(level);
-    assertArray(entries);
-    const f = level > 0 ? assertString : assertJSONValue;
-    // For V7 we do not need to change the entries. Just assert that they are correct.
-    if (formatVersion >= FormatVersion.V7) {
-        for (const e of entries) {
-            assertEntry(e, f);
-        }
-        return v;
-    }
-    const newEntries = entries.map(e => convertNonV7Entry(e, f, getSizeOfEntry));
-    return [level, newEntries];
-}
-function assertEntry(entry, f) {
-    assertArray(entry);
-    // Be relaxed about what we accept.
-    assert(entry.length >= 3);
-    assertString(entry[0]);
-    f(entry[1]);
-    assertNumber(entry[2]);
-}
-/**
- * Converts an entry that was from a format version before V7 to the format
- * wanted by V7.
- */
-function convertNonV7Entry(entry, f, getSizeOfEntry) {
-    assertArray(entry);
-    assert(entry.length >= 2);
-    assertString(entry[0]);
-    f(entry[1]);
-    const entrySize = getSizeOfEntry(entry[0], entry[1]);
-    return [entry[0], entry[1], entrySize];
-}
-export function isInternalNode(node) {
-    return node[NODE_LEVEL] > 0;
-}
-class NodeImpl {
-    entries;
-    hash;
-    isMutable;
-    #childNodeSize = -1;
-    constructor(entries, hash, isMutable) {
-        this.entries = entries;
-        this.hash = hash;
-        this.isMutable = isMutable;
-    }
-    maxKey() {
-        return this.entries[this.entries.length - 1][0];
-    }
-    getChildNodeSize(tree) {
-        if (this.#childNodeSize !== -1) {
-            return this.#childNodeSize;
-        }
-        let sum = tree.chunkHeaderSize;
-        for (const entry of this.entries) {
-            sum += entry[2];
-        }
-        return (this.#childNodeSize = sum);
-    }
-    _updateNode(tree) {
-        this.#childNodeSize = -1;
-        tree.updateNode(this);
-    }
-}
-export function toChunkData(node, formatVersion) {
-    return makeNodeChunkData(node.level, node.entries, formatVersion);
-}
-export class DataNodeImpl extends NodeImpl {
-    level = 0;
-    set(key, value, entrySize, tree) {
-        let deleteCount;
-        const i = binarySearch(key, this.entries);
-        if (!binarySearchFound(i, this.entries, key)) {
-            // Not found, insert.
-            deleteCount = 0;
-        }
-        else {
-            deleteCount = 1;
-        }
-        return Promise.resolve(this.#splice(tree, i, deleteCount, [key, value, entrySize]));
-    }
-    #splice(tree, start, deleteCount, ...items) {
-        if (this.isMutable) {
-            this.entries.splice(start, deleteCount, ...items);
-            this._updateNode(tree);
-            return this;
-        }
-        const entries = readonlySplice(this.entries, start, deleteCount, ...items);
-        return tree.newDataNodeImpl(entries);
-    }
-    del(key, tree) {
-        const i = binarySearch(key, this.entries);
-        if (!binarySearchFound(i, this.entries, key)) {
-            // Not found. Return this without changes.
-            return Promise.resolve(this);
-        }
-        // Found. Create new node or mutate existing one.
-        return Promise.resolve(this.#splice(tree, i, 1));
-    }
-    async *keys(_tree) {
-        for (const entry of this.entries) {
-            yield entry[0];
-        }
-    }
-    async *entriesIter(_tree) {
-        for (const entry of this.entries) {
-            yield entry;
-        }
-    }
-}
-function readonlySplice(array, start, deleteCount, ...items) {
-    const arr = array.slice(0, start);
-    for (let i = 0; i < items.length; i++) {
-        arr.push(items[i]);
-    }
-    for (let i = start + deleteCount; i < array.length; i++) {
-        arr.push(array[i]);
-    }
-    return arr;
-}
-export class InternalNodeImpl extends NodeImpl {
-    level;
-    constructor(entries, hash, level, isMutable) {
-        super(entries, hash, isMutable);
-        this.level = level;
-    }
-    async set(key, value, entrySize, tree) {
-        let i = binarySearch(key, this.entries);
-        if (i === this.entries.length) {
-            // We are going to insert into last (right most) leaf.
-            i--;
-        }
-        const childHash = this.entries[i][1];
-        const oldChildNode = await tree.getNode(childHash);
-        const childNode = await oldChildNode.set(key, value, entrySize, tree);
-        const childNodeSize = childNode.getChildNodeSize(tree);
-        if (childNodeSize > tree.maxSize || childNodeSize < tree.minSize) {
-            return this.#mergeAndPartition(tree, i, childNode);
-        }
-        const newEntry = createNewInternalEntryForNode(childNode, tree.getEntrySize);
-        return this.#replaceChild(tree, i, newEntry);
-    }
-    /**
-     * This merges the child node entries with previous or next sibling and then
-     * partitions the merged entries.
-     */
-    async #mergeAndPartition(tree, i, childNode) {
-        const level = this.level - 1;
-        const thisEntries = this.entries;
-        let values;
-        let startIndex;
-        let removeCount;
-        if (i > 0) {
-            const hash = thisEntries[i - 1][1];
-            const previousSibling = await tree.getNode(hash);
-            values = joinIterables(previousSibling.entries, childNode.entries);
-            startIndex = i - 1;
-            removeCount = 2;
-        }
-        else if (i < thisEntries.length - 1) {
-            const hash = thisEntries[i + 1][1];
-            const nextSibling = await tree.getNode(hash);
-            values = joinIterables(childNode.entries, nextSibling.entries);
-            startIndex = i;
-            removeCount = 2;
-        }
-        else {
-            values = childNode.entries;
-            startIndex = i;
-            removeCount = 1;
-        }
-        const partitions = partition(values, value => value[2], tree.minSize - tree.chunkHeaderSize, tree.maxSize - tree.chunkHeaderSize);
-        // TODO: There are cases where we can reuse the old nodes. Creating new ones
-        // means more memory churn but also more writes to the underlying KV store.
-        const newEntries = [];
-        for (const entries of partitions) {
-            const node = tree.newNodeImpl(entries, level);
-            const newHashEntry = createNewInternalEntryForNode(node, tree.getEntrySize);
-            newEntries.push(newHashEntry);
-        }
-        if (this.isMutable) {
-            this.entries.splice(startIndex, removeCount, ...newEntries);
-            this._updateNode(tree);
-            return this;
-        }
-        const entries = readonlySplice(thisEntries, startIndex, removeCount, ...newEntries);
-        return tree.newInternalNodeImpl(entries, this.level);
-    }
-    #replaceChild(tree, index, newEntry) {
-        if (this.isMutable) {
-            this.entries.splice(index, 1, newEntry);
-            this._updateNode(tree);
-            return this;
-        }
-        const entries = readonlySplice(this.entries, index, 1, newEntry);
-        return tree.newInternalNodeImpl(entries, this.level);
-    }
-    async del(key, tree) {
-        const i = binarySearch(key, this.entries);
-        if (i === this.entries.length) {
-            // Key is larger than maxKey of rightmost entry so it is not present.
-            return this;
-        }
-        const childHash = this.entries[i][1];
-        const oldChildNode = await tree.getNode(childHash);
-        const oldHash = oldChildNode.hash;
-        const childNode = await oldChildNode.del(key, tree);
-        if (childNode.hash === oldHash) {
-            // Not changed so not found.
-            return this;
-        }
-        if (childNode.entries.length === 0) {
-            // Subtree is now empty. Remove internal node.
-            const entries = readonlySplice(this.entries, i, 1);
-            return tree.newInternalNodeImpl(entries, this.level);
-        }
-        if (i === 0 && this.entries.length === 1) {
-            // There was only one node at this level and it was removed. We can return
-            // the modified subtree.
-            return childNode;
-        }
-        // The child node is still a good size.
-        if (childNode.getChildNodeSize(tree) > tree.minSize) {
-            // No merging needed.
-            const entry = createNewInternalEntryForNode(childNode, tree.getEntrySize);
-            return this.#replaceChild(tree, i, entry);
-        }
-        // Child node size is too small.
-        return this.#mergeAndPartition(tree, i, childNode);
-    }
-    async *keys(tree) {
-        for (const entry of this.entries) {
-            const childNode = await tree.getNode(entry[1]);
-            yield* childNode.keys(tree);
-        }
-    }
-    async *entriesIter(tree) {
-        for (const entry of this.entries) {
-            const childNode = await tree.getNode(entry[1]);
-            yield* childNode.entriesIter(tree);
-        }
-    }
-    getChildren(start, length, tree) {
-        const ps = [];
-        for (let i = start; i < length && i < this.entries.length; i++) {
-            ps.push(tree.getNode(this.entries[i][1]));
-        }
-        return Promise.all(ps);
-    }
-    async getCompositeChildren(start, length, tree) {
-        const { level } = this;
-        if (length === 0) {
-            return new InternalNodeImpl([], newRandomHash(), level - 1, true);
-        }
-        const output = await this.getChildren(start, start + length, tree);
-        if (level > 1) {
-            const entries = [];
-            for (const child of output) {
-                entries.push(...child.entries);
-            }
-            return new InternalNodeImpl(entries, newRandomHash(), level - 1, true);
-        }
-        assert(level === 1);
-        const entries = [];
-        for (const child of output) {
-            entries.push(...child.entries);
-        }
-        return new DataNodeImpl(entries, newRandomHash(), true);
-    }
-}
-export function newNodeImpl(entries, hash, level, isMutable) {
-    if (level === 0) {
-        return new DataNodeImpl(entries, hash, isMutable);
-    }
-    return new InternalNodeImpl(entries, hash, level, isMutable);
-}
-export function isDataNodeImpl(node) {
-    return node.level === 0;
-}
-export function partition(values, 
-// This is the size of each Entry
-getSizeOfEntry, min, max) {
-    const partitions = [];
-    const sizes = [];
-    let sum = 0;
-    let accum = [];
-    for (const value of values) {
-        const size = getSizeOfEntry(value);
-        if (size >= max) {
-            if (accum.length > 0) {
-                partitions.push(accum);
-                sizes.push(sum);
-            }
-            partitions.push([value]);
-            sizes.push(size);
-            sum = 0;
-            accum = [];
-        }
-        else if (sum + size >= min) {
-            accum.push(value);
-            partitions.push(accum);
-            sizes.push(sum + size);
-            sum = 0;
-            accum = [];
-        }
-        else {
-            sum += size;
-            accum.push(value);
-        }
-    }
-    if (sum > 0) {
-        if (sizes.length > 0 && sum + sizes[sizes.length - 1] <= max) {
-            partitions[partitions.length - 1].push(...accum);
-        }
-        else {
-            partitions.push(accum);
-        }
-    }
-    return partitions;
-}
-export const emptyDataNode = makeNodeChunkData(0, [], FormatVersion.Latest);
-export const emptyDataNodeImpl = new DataNodeImpl([], emptyHash, false);
-export function createNewInternalEntryForNode(node, getSizeOfEntry) {
-    const key = node.maxKey();
-    const value = node.hash;
-    const size = getSizeOfEntry(key, value);
-    return [key, value, size];
-}
-//# sourceMappingURL=node.js.map

package/out/replicache/src/btree/node.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"node.js","sourceRoot":"","sources":["../../../../../replicache/src/btree/node.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,WAAW,EAAC,MAAM,cAAc,CAAC;AACzC,OAAO,EACL,MAAM,EACN,WAAW,EACX,YAAY,EACZ,YAAY,GACb,MAAM,gCAAgC,CAAC;AACxC,OAAO,EAAC,aAAa,EAAC,MAAM,kCAAkC,CAAC;AAC/D,OAAO,EAGL,eAAe,GAChB,MAAM,6BAA6B,CAAC;AACrC,OAAO,EAAC,YAAY,IAAI,oBAAoB,EAAC,MAAM,qBAAqB,CAAC;AACzE,OAAO,EAAC,oBAAoB,EAAC,MAAM,cAAc,CAAC;AAElD,OAAO,KAAK,aAAa,MAAM,2BAA2B,CAAC;AAC3D,OAAO,EAGL,gBAAgB,EAChB,UAAU,GACX,MAAM,mBAAmB,CAAC;AAC3B,OAAO,EAAY,SAAS,EAAE,aAAa,EAAC,MAAM,YAAY,CAAC;AAM/D,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,CAAC;AAC5B,MAAM,CAAC,MAAM,YAAY,GAAG,CAAC,CAAC;AAY9B,MAAM,UAAU,iBAAiB,CAC/B,KAAa,EACb,OAAgC,EAChC,aAAiC;IAEjC,OAAO,UAAU,CAAC;QAChB,KAAK;QACL,CAAC,aAAa,IAAI,aAAa,CAAC,EAAE;YAChC,CAAC,CAAC,OAAO;YACT,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAiC;KACrE,CAAgB,CAAC;AACpB,CAAC;AAkED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,QAAQ,CAC5B,GAAW,EACX,IAAU,EACV,MAAiB,EACjB,gBAAsB;IAEtB,MAAM,IAAI,GAAG,MAAM,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;IACxC,8BAA8B;IAC9B,IAAI,gBAAgB,KAAK,MAAM,CAAC,QAAQ,EAAE,CAAC;QACzC,OAAO,QAAQ,CAAC,GAAG,EAAE,MAAM,CAAC,QAAQ,EAAE,MAAM,EAAE,MAAM,CAAC,QAAQ,CAAC,CAAC;IACjE,CAAC;IACD,IAAI,cAAc,CAAC,IAAI,CAAC,EAAE,CAAC;QACzB,OAAO,IAAI,CAAC;IACd,CAAC;IACD,MAAM,EAAC,OAAO,EAAC,GAAG,IAAI,CAAC;IACvB,IAAI,CAAC,GAAG,YAAY,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC;IACnC,IAAI,CAAC,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;QACzB,CAAC,EAAE,CAAC;IACN,CAAC;IACD,MAAM,KAAK,GAAG,OAAO,CAAC,CAAC,CAAC,CAAC;IACzB,OAAO,QAAQ,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,MAAM,EAAE,gBAAgB,CAAC,CAAC;AAC3D,CAAC;AAID;;;;;;;GAOG;AACH,MAAM,UAAU,YAAY,CAC1B,GAAW,EACX,OAA4B;IAE5B,OAAO,oBAAoB,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,EAAE,CAC9C,WAAW,CAAC,GAAG,EAAE,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAChC,CAAC;AACJ,CAAC;AAED,MAAM,UAAU,iBAAiB,CAC/B,CAAS,EACT,OAA4B,EAC5B,GAAW;IAEX,OAAO,CAAC,KAAK,OAAO,CAAC,MAAM,IAAI,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC;AACvD,CAAC;AAED,MAAM,UAAU,cAAc,CAC5B,CAAU,EACV,aAAiC,EACjC,cAAkD;IAElD,IAAI,oBAAoB,IAAI,aAAa,IAAI,aAAa,CAAC,EAAE,EAAE,CAAC;QAC9D,OAAO,CAA4B,CAAC;IACtC,CAAC;IAED,WAAW,CAAC,CAAC,CAAC,CAAC;IACf,gBAAgB,CAAC,CAAC,CAAC,CAAC;IACpB,mCAAmC;IACnC,MAAM,CAAC,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;IACtB,MAAM,CAAC,KAAK,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC;IAC3B,YAAY,CAAC,KAAK,CAAC,CAAC;IACpB,WAAW,CAAC,OAAO,CAAC,CAAC;IAErB,MAAM,CAAC,GAAG,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,eAAe,CAAC;IAErD,kFAAkF;IAClF,IAAI,aAAa,IAAI,aAAa,CAAC,EAAE,EAAE,CAAC;QACtC,KAAK,MAAM,CAAC,IAAI,OAAO,EAAE,CAAC;YACxB,WAAW,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QACpB,CAAC;QACD,OAAO,CAAuC,CAAC;IACjD,CAAC;IAED,MAAM,UAAU,GAAG,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,iBAAiB,CAAC,CAAC,EAAE,CAAC,EAAE,cAAc,CAAC,CAAC,CAAC;IAC7E,OAAO,CAAC,KAAK,EAAE,UAAU,CAAuC,CAAC;AACnE,CAAC;AAED,SAAS,WAAW,CAClB,KAAc,EACd,CAE4C;IAE5C,WAAW,CAAC,KAAK,CAAC,CAAC;IACnB,mCAAmC;IACnC,MAAM,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;IAC1B,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACZ,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;AACzB,CAAC;AAED;;;GAGG;AACH,SAAS,iBAAiB,CACxB,KAAc,EACd,CAE4C,EAC5C,cAAkD;IAElD,WAAW,CAAC,KAAK,CAAC,CAAC;IACnB,MAAM,CAAC,KAAK,CAAC,MAAM,IAAI,CAAC,CAAC,CAAC;IAC1B,YAAY,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACvB,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACZ,MAAM,SAAS,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,EAAE,SAAS,CAA4B,CAAC;AACpE,CAAC;AAED,MAAM,UAAU,cAAc,CAAC,IAAU;IACvC,OAAO,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;AAC9B,CAAC;AAED,MAAe,QAAQ;IACrB,OAAO,CAAsB;IAC7B,IAAI,CAAO;IAEF,SAAS,CAAU;IAE5B,cAAc,GAAG,CAAC,CAAC,CAAC;IAEpB,YAAY,OAA4B,EAAE,IAAU,EAAE,SAAkB;QACtE,IAAI,CAAC,OAAO,GAAG,OAAO,CAAC;QACvB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;QACjB,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;IAC7B,CAAC;IAcD,MAAM;QACJ,OAAO,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClD,CAAC;IAED,gBAAgB,CAAC,IAAe;QAC9B,IAAI,IAAI,CAAC,cAAc,KAAK,CAAC,CAAC,EAAE,CAAC;YAC/B,OAAO,IAAI,CAAC,cAAc,CAAC;QAC7B,CAAC;QAED,IAAI,GAAG,GAAG,IAAI,CAAC,eAAe,CAAC;QAC/B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,GAAG,IAAI,KAAK,CAAC,CAAC,CAAC,CAAC;QAClB,CAAC;QACD,OAAO,CAAC,IAAI,CAAC,cAAc,GAAG,GAAG,CAAC,CAAC;IACrC,CAAC;IAES,WAAW,CAAC,IAAgB;QACpC,IAAI,CAAC,cAAc,GAAG,CAAC,CAAC,CAAC;QACzB,IAAI,CAAC,UAAU,CACb,IAA4D,CAC7D,CAAC;IACJ,CAAC;CACF;AAED,MAAM,UAAU,WAAW,CACzB,IAAiB,EACjB,aAAiC;IAEjC,OAAO,iBAAiB,CAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,OAAO,EAAE,aAAa,CAAC,CAAC;AACpE,CAAC;AAED,MAAM,OAAO,YAAa,SAAQ,QAAyB;IAChD,KAAK,GAAG,CAAC,CAAC;IAEnB,GAAG,CACD,GAAW,EACX,KAAsB,EACtB,SAAiB,EACjB,IAAgB;QAEhB,IAAI,WAAmB,CAAC;QACxB,MAAM,CAAC,GAAG,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAC1C,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,CAAC;YAC7C,qBAAqB;YACrB,WAAW,GAAG,CAAC,CAAC;QAClB,CAAC;aAAM,CAAC;YACN,WAAW,GAAG,CAAC,CAAC;QAClB,CAAC;QAED,OAAO,OAAO,CAAC,OAAO,CACpB,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,WAAW,EAAE,CAAC,GAAG,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC,CAC5D,CAAC;IACJ,CAAC;IAED,OAAO,CACL,IAAgB,EAChB,KAAa,EACb,WAAmB,EACnB,GAAG,KAA+B;QAElC,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,WAAW,EAAE,GAAG,KAAK,CAAC,CAAC;YAClD,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACvB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,WAAW,EAAE,GAAG,KAAK,CAAC,CAAC;QAC3E,OAAO,IAAI,CAAC,eAAe,CAAC,OAAO,CAAC,CAAC;IACvC,CAAC;IAED,GAAG,CAAC,GAAW,EAAE,IAAgB;QAC/B,MAAM,CAAC,GAAG,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAC1C,IAAI,CAAC,iBAAiB,CAAC,CAAC,EAAE,IAAI,CAAC,OAAO,EAAE,GAAG,CAAC,EAAE,CAAC;YAC7C,0CAA0C;YAC1C,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC/B,CAAC;QAED,iDAAiD;QACjD,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IACnD,CAAC;IAED,KAAK,CAAC,CAAC,IAAI,CAAC,KAAgB;QAC1B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,MAAM,KAAK,CAAC,CAAC,CAAC,CAAC;QACjB,CAAC;IACH,CAAC;IAED,KAAK,CAAC,CAAC,WAAW,CAChB,KAAgB;QAEhB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,MAAM,KAAK,CAAC;QACd,CAAC;IACH,CAAC;CACF;AAED,SAAS,cAAc,CACrB,KAAuB,EACvB,KAAa,EACb,WAAmB,EACnB,GAAG,KAAU;IAEb,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;IAClC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,WAAW,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACxD,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;IACrB,CAAC;IACD,OAAO,GAAG,CAAC;AACb,CAAC;AAED,MAAM,OAAO,gBAAiB,SAAQ,QAAc;IACzC,KAAK,CAAS;IAEvB,YACE,OAA2B,EAC3B,IAAU,EACV,KAAa,EACb,SAAkB;QAElB,KAAK,CAAC,OAAO,EAAE,IAAI,EAAE,SAAS,CAAC,CAAC;QAChC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED,KAAK,CAAC,GAAG,CACP,GAAW,EACX,KAAsB,EACtB,SAAiB,EACjB,IAAgB;QAEhB,IAAI,CAAC,GAAG,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QACxC,IAAI,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YAC9B,sDAAsD;YACtD,CAAC,EAAE,CAAC;QACN,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAEnD,MAAM,SAAS,GAAG,MAAM,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,EAAE,SAAS,EAAE,IAAI,CAAC,CAAC;QAEtE,MAAM,aAAa,GAAG,SAAS,CAAC,gBAAgB,CAAC,IAAI,CAAC,CAAC;QACvD,IAAI,aAAa,GAAG,IAAI,CAAC,OAAO,IAAI,aAAa,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;YACjE,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;QACrD,CAAC;QAED,MAAM,QAAQ,GAAG,6BAA6B,CAC5C,SAAS,EACT,IAAI,CAAC,YAAY,CAClB,CAAC;QACF,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;IAC/C,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,kBAAkB,CACtB,IAAgB,EAChB,CAAS,EACT,SAA0C;QAE1C,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,GAAG,CAAC,CAAC;QAC7B,MAAM,WAAW,GAAG,IAAI,CAAC,OAAO,CAAC;QAIjC,IAAI,MAA2B,CAAC;QAChC,IAAI,UAAkB,CAAC;QACvB,IAAI,WAAmB,CAAC;QACxB,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC;YACV,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,eAAe,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YACjD,MAAM,GAAG,aAAa,CACpB,eAAe,CAAC,OAA8B,EAC9C,SAAS,CAAC,OAA8B,CACzC,CAAC;YACF,UAAU,GAAG,CAAC,GAAG,CAAC,CAAC;YACnB,WAAW,GAAG,CAAC,CAAC;QAClB,CAAC;aAAM,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACtC,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC7C,MAAM,GAAG,aAAa,CACpB,SAAS,CAAC,OAA8B,EACxC,WAAW,CAAC,OAA8B,CAC3C,CAAC;YACF,UAAU,GAAG,CAAC,CAAC;YACf,WAAW,GAAG,CAAC,CAAC;QAClB,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,SAAS,CAAC,OAA8B,CAAC;YAClD,UAAU,GAAG,CAAC,CAAC;YACf,WAAW,GAAG,CAAC,CAAC;QAClB,CAAC;QAED,MAAM,UAAU,GAAG,SAAS,CAC1B,MAAM,EACN,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,CAAC,CAAC,EACjB,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,eAAe,EACnC,IAAI,CAAC,OAAO,GAAG,IAAI,CAAC,eAAe,CACpC,CAAC;QAEF,4EAA4E;QAC5E,2EAA2E;QAC3E,MAAM,UAAU,GAAkB,EAAE,CAAC;QACrC,KAAK,MAAM,OAAO,IAAI,UAAU,EAAE,CAAC;YACjC,MAAM,IAAI,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;YAC9C,MAAM,YAAY,GAAG,6BAA6B,CAChD,IAAI,EACJ,IAAI,CAAC,YAAY,CAClB,CAAC;YACF,UAAU,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC;QAChC,CAAC;QAED,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,UAAU,EAAE,WAAW,EAAE,GAAG,UAAU,CAAC,CAAC;YAC5D,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACvB,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,OAAO,GAAG,cAAc,CAC5B,WAAW,EACX,UAAU,EACV,WAAW,EACX,GAAG,UAAU,CACd,CAAC;QAEF,OAAO,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACvD,CAAC;IAED,aAAa,CACX,IAAgB,EAChB,KAAa,EACb,QAAqB;QAErB,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnB,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;YACxC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;YACvB,OAAO,IAAI,CAAC;QACd,CAAC;QACD,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,CAAC,OAAO,EAAE,KAAK,EAAE,CAAC,EAAE,QAAQ,CAAC,CAAC;QACjE,OAAO,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;IACvD,CAAC;IAED,KAAK,CAAC,GAAG,CACP,GAAW,EACX,IAAgB;QAEhB,MAAM,CAAC,GAAG,YAAY,CAAC,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,CAAC;QAC1C,IAAI,CAAC,KAAK,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC;YAC9B,qEAAqE;YACrE,OAAO,IAAI,CAAC;QACd,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,YAAY,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QACnD,MAAM,OAAO,GAAG,YAAY,CAAC,IAAI,CAAC;QAElC,MAAM,SAAS,GAAG,MAAM,YAAY,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,CAAC;QACpD,IAAI,SAAS,CAAC,IAAI,KAAK,OAAO,EAAE,CAAC;YAC/B,4BAA4B;YAC5B,OAAO,IAAI,CAAC;QACd,CAAC;QAED,IAAI,SAAS,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACnC,8CAA8C;YAC9C,MAAM,OAAO,GAAG,cAAc,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;YACnD,OAAO,IAAI,CAAC,mBAAmB,CAAC,OAAO,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;QACvD,CAAC;QAED,IAAI,CAAC,KAAK,CAAC,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzC,0EAA0E;YAC1E,wBAAwB;YACxB,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,uCAAuC;QACvC,IAAI,SAAS,CAAC,gBAAgB,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,EAAE,CAAC;YACpD,qBAAqB;YACrB,MAAM,KAAK,GAAG,6BAA6B,CAAC,SAAS,EAAE,IAAI,CAAC,YAAY,CAAC,CAAC;YAC1E,OAAO,IAAI,CAAC,aAAa,CAAC,IAAI,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QAC5C,CAAC;QAED,gCAAgC;QAChC,OAAO,IAAI,CAAC,kBAAkB,CAAC,IAAI,EAAE,CAAC,EAAE,SAAS,CAAC,CAAC;IACrD,CAAC;IAED,KAAK,CAAC,CAAC,IAAI,CAAC,IAAe;QACzB,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/C,KAAK,CAAC,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,KAAK,CAAC,CAAC,WAAW,CAChB,IAAe;QAEf,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAC/C,KAAK,CAAC,CAAC,SAAS,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;QACrC,CAAC;IACH,CAAC;IAED,WAAW,CACT,KAAa,EACb,MAAc,EACd,IAAe;QAEf,MAAM,EAAE,GAA+C,EAAE,CAAC;QAC1D,KAAK,IAAI,CAAC,GAAG,KAAK,EAAE,CAAC,GAAG,MAAM,IAAI,CAAC,GAAG,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAC/D,EAAE,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAC5C,CAAC;QACD,OAAO,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IACzB,CAAC;IAED,KAAK,CAAC,oBAAoB,CACxB,KAAa,EACb,MAAc,EACd,IAAe;QAEf,MAAM,EAAC,KAAK,EAAC,GAAG,IAAI,CAAC;QAErB,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;YACjB,OAAO,IAAI,gBAAgB,CAAC,EAAE,EAAE,aAAa,EAAE,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QACpE,CAAC;QAED,MAAM,MAAM,GAAG,MAAM,IAAI,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,EAAE,IAAI,CAAC,CAAC;QAEnE,IAAI,KAAK,GAAG,CAAC,EAAE,CAAC;YACd,MAAM,OAAO,GAAkB,EAAE,CAAC;YAClC,KAAK,MAAM,KAAK,IAAI,MAA4B,EAAE,CAAC;gBACjD,OAAO,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;YACjC,CAAC;YACD,OAAO,IAAI,gBAAgB,CAAC,OAAO,EAAE,aAAa,EAAE,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QACzE,CAAC;QAED,MAAM,CAAC,KAAK,KAAK,CAAC,CAAC,CAAC;QACpB,MAAM,OAAO,GAA6B,EAAE,CAAC;QAC7C,KAAK,MAAM,KAAK,IAAI,MAAwB,EAAE,CAAC;YAC7C,OAAO,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,OAAO,CAAC,CAAC;QACjC,CAAC;QACD,OAAO,IAAI,YAAY,CAAC,OAAO,EAAE,aAAa,EAAE,EAAE,IAAI,CAAC,CAAC;IAC1D,CAAC;CACF;AAoBD,MAAM,UAAU,WAAW,CACzB,OAA2D,EAC3D,IAAU,EACV,KAAa,EACb,SAAkB;IAElB,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;QAChB,OAAO,IAAI,YAAY,CACrB,OAAmC,EACnC,IAAI,EACJ,SAAS,CACV,CAAC;IACJ,CAAC;IACD,OAAO,IAAI,gBAAgB,CAAC,OAAwB,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;AAChF,CAAC;AAED,MAAM,UAAU,cAAc,CAC5B,IAAqC;IAErC,OAAO,IAAI,CAAC,KAAK,KAAK,CAAC,CAAC;AAC1B,CAAC;AAED,MAAM,UAAU,SAAS,CACvB,MAAmB;AACnB,iCAAiC;AACjC,cAAgC,EAChC,GAAW,EACX,GAAW;IAEX,MAAM,UAAU,GAAU,EAAE,CAAC;IAC7B,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,IAAI,KAAK,GAAQ,EAAE,CAAC;IACpB,KAAK,MAAM,KAAK,IAAI,MAAM,EAAE,CAAC;QAC3B,MAAM,IAAI,GAAG,cAAc,CAAC,KAAK,CAAC,CAAC;QACnC,IAAI,IAAI,IAAI,GAAG,EAAE,CAAC;YAChB,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACrB,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBACvB,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;YAClB,CAAC;YACD,UAAU,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjB,GAAG,GAAG,CAAC,CAAC;YACR,KAAK,GAAG,EAAE,CAAC;QACb,CAAC;aAAM,IAAI,GAAG,GAAG,IAAI,IAAI,GAAG,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAClB,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACvB,KAAK,CAAC,IAAI,CAAC,GAAG,GAAG,IAAI,CAAC,CAAC;YACvB,GAAG,GAAG,CAAC,CAAC;YACR,KAAK,GAAG,EAAE,CAAC;QACb,CAAC;aAAM,CAAC;YACN,GAAG,IAAI,IAAI,CAAC;YACZ,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpB,CAAC;IACH,CAAC;IAED,IAAI,GAAG,GAAG,CAAC,EAAE,CAAC;QACZ,IAAI,KAAK,CAAC,MAAM,GAAG,CAAC,IAAI,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,IAAI,GAAG,EAAE,CAAC;YAC7D,UAAU,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,GAAG,KAAK,CAAC,CAAC;QACnD,CAAC;aAAM,CAAC;YACN,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED,MAAM,CAAC,MAAM,aAAa,GAAG,iBAAiB,CAC5C,CAAC,EACD,EAAE,EACF,aAAa,CAAC,MAAM,CACrB,CAAC;AACF,MAAM,CAAC,MAAM,iBAAiB,GAAG,IAAI,YAAY,CAAC,EAAE,EAAE,SAAS,EAAE,KAAK,CAAC,CAAC;AAExE,MAAM,UAAU,6BAA6B,CAC3C,IAAuB,EACvB,cAA4C;IAE5C,MAAM,GAAG,GAAG,IAAI,CAAC,MAAM,EAAE,CAAC;IAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC;IACxB,MAAM,IAAI,GAAG,cAAc,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACxC,OAAO,CAAC,GAAG,EAAE,KAAK,EAAE,IAAI,CAAC,CAAC;AAC5B,CAAC"}