@enbox/dwn-sdk-js 0.4.0 → 0.4.2

package/dist/esm/src/smt/sparse-merkle-tree.js

@@ -1,577 +0,0 @@
-/**
- * Sparse Merkle Tree (SMT) implementation.
- *
- * A 256-level binary trie where:
- * - Keys are SHA-256 hashes of messageCids (uniformly distributed across 2^256 key space)
- * - Leaves store the messageCid value
- * - Internal nodes store H(leftChild || rightChild)
- * - Empty subtrees are represented implicitly via precomputed default hashes
- *
- * Key properties:
- * - Deterministic: the same set of key-value pairs always produces the same root hash
- * - O(log n) insert, delete, and proof operations (practically O(256) worst case)
- * - Supports inclusion and non-inclusion proofs
- * - Root hash provides a fingerprint of the entire set for O(1) comparison
- */
-import { getBit, hashChildren, hashEquals, hashKey, hashLeaf, initDefaultHashes, SMT_DEPTH } from './smt-utils.js';
-export class SparseMerkleTree {
-    store;
-    defaultHashes;
-    constructor(store) {
-        this.store = store;
-    }
-    /**
-     * Initialize the SMT. Must be called before any operations.
-     * Opens the store and precomputes default hashes.
-     */
-    async initialize() {
-        await this.store.open();
-        this.defaultHashes = await initDefaultHashes();
-    }
-    /**
-     * Close the underlying store.
-     */
-    async close() {
-        await this.store.close();
-    }
-    /**
-     * Clear all data from the tree.
-     */
-    async clear() {
-        await this.store.clear();
-    }
-    /**
-     * Get the current root hash. Returns the default empty root if no root is set.
-     */
-    async getRoot() {
-        const root = await this.store.getRoot();
-        if (root === undefined) {
-            return this.defaultHashes[0];
-        }
-        return root;
-    }
-    /**
-     * Insert a messageCid into the tree.
-     * The key is SHA-256(messageCid), the value is the messageCid string.
-     *
-     * @returns the new root hash after insertion
-     */
-    async insert(messageCid) {
-        const keyHash = await hashKey(messageCid);
-        const leafHash = await hashLeaf(keyHash, messageCid);
-        const leafNode = {
-            type: 'leaf',
-            keyHash: keyHash,
-            valueCid: messageCid,
-        };
-        // Store the leaf node
-        await this.store.putNode(leafHash, leafNode);
-        // Walk down the tree from root to leaf position, collecting the path
-        const currentRoot = await this.getRoot();
-        const newRoot = await this.insertAtNode(currentRoot, keyHash, leafHash, leafNode, 0);
-        await this.store.setRoot(newRoot);
-        return newRoot;
-    }
-    /**
-     * Delete a messageCid from the tree.
-     *
-     * @returns the new root hash after deletion
-     */
-    async delete(messageCid) {
-        const keyHash = await hashKey(messageCid);
-        const currentRoot = await this.getRoot();
-        const newRoot = await this.deleteAtNode(currentRoot, keyHash, 0);
-        await this.store.setRoot(newRoot);
-        return newRoot;
-    }
-    /**
-     * Check if a messageCid exists in the tree.
-     */
-    async has(messageCid) {
-        const keyHash = await hashKey(messageCid);
-        const currentRoot = await this.getRoot();
-        return this.existsAtNode(currentRoot, keyHash, 0);
-    }
-    /**
-     * Generate a membership proof (inclusion or non-inclusion) for a messageCid.
-     */
-    async getProof(messageCid) {
-        const keyHash = await hashKey(messageCid);
-        const currentRoot = await this.getRoot();
-        return this.generateProof(currentRoot, keyHash, 0);
-    }
-    /**
-     * Get the hash of a subtree at a given bit prefix.
-     * Used by the sync protocol for tree walking.
-     *
-     * @param prefix - array of booleans representing the path (false=left, true=right)
-     * @returns the hash of the subtree at that prefix
-     */
-    async getSubtreeHash(prefix) {
-        let currentHash = await this.getRoot();
-        for (let i = 0; i < prefix.length; i++) {
-            if (hashEquals(currentHash, this.defaultHashes[i])) {
-                // Empty subtree — return the default hash at the target depth
-                return this.defaultHashes[prefix.length];
-            }
-            const node = await this.store.getNode(currentHash);
-            if (node === undefined || node.type === 'leaf') {
-                // Leaf reached before prefix exhausted — need to compute what the
-                // subtree hash would be if this leaf were pushed down to the prefix depth.
-                // For simplicity, if we've hit a leaf, the subtree at this prefix
-                // either contains this leaf or is empty.
-                if (node?.type === 'leaf') {
-                    return this.computeSubtreeHashForLeaf(node, i, prefix);
-                }
-                return this.defaultHashes[prefix.length];
-            }
-            const internalNode = node;
-            if (prefix[i]) {
-                currentHash = internalNode.rightHash;
-            }
-            else {
-                currentHash = internalNode.leftHash;
-            }
-        }
-        return currentHash;
-    }
-    /**
-     * Get all leaf messageCids under a given prefix.
-     * Used by the sync protocol for tree walking.
-     */
-    async getLeaves(prefix) {
-        let currentHash = await this.getRoot();
-        // Navigate to the subtree at the prefix
-        for (let i = 0; i < prefix.length; i++) {
-            if (hashEquals(currentHash, this.defaultHashes[i])) {
-                return [];
-            }
-            const node = await this.store.getNode(currentHash);
-            if (node === undefined) {
-                return [];
-            }
-            if (node.type === 'leaf') {
-                // Check if this leaf's key hash matches the prefix
-                const leafMatchesPrefix = this.leafMatchesPrefix(node.keyHash, prefix);
-                if (leafMatchesPrefix) {
-                    return [node.valueCid];
-                }
-                return [];
-            }
-            const internalNode = node;
-            if (prefix[i]) {
-                currentHash = internalNode.rightHash;
-            }
-            else {
-                currentHash = internalNode.leftHash;
-            }
-        }
-        // Collect all leaves in this subtree
-        return this.collectLeaves(currentHash, prefix.length);
-    }
-    /**
-     * Compute a local diff between this tree and another tree's state,
-     * given access to the other tree instance.
-     *
-     * This is used for same-process diffing (e.g., in tests or local operations).
-     * For remote diffing, the sync protocol exchanges subtree hashes via messages.
-     */
-    async diff(other) {
-        const localRoot = await this.getRoot();
-        const remoteRoot = await other.getRoot();
-        if (hashEquals(localRoot, remoteRoot)) {
-            return { onlyLocal: [], onlyRemote: [] };
-        }
-        const onlyLocal = [];
-        const onlyRemote = [];
-        await this.diffAtNode(localRoot, remoteRoot, 0, this, other, onlyLocal, onlyRemote);
-        return { onlyLocal, onlyRemote };
-    }
-    // ─── Private methods ──────────────────────────────────────────────────────
-    /**
-     * Recursively insert a leaf into the tree, returning the new hash for the subtree at `depth`.
-     */
-    async insertAtNode(currentHash, keyHash, leafHash, leafNode, depth) {
-        // Base case: reached the maximum depth
-        if (depth >= SMT_DEPTH) {
-            return leafHash;
-        }
-        // If the current subtree is empty (default hash at this depth), just return the leaf hash.
-        // But we need to handle the case where the leaf might need to be pushed down further
-        // because we're at an intermediate depth.
-        if (hashEquals(currentHash, this.defaultHashes[depth])) {
-            // Place the leaf here — the leaf implicitly represents its position via keyHash
-            return leafHash;
-        }
-        // Load the node at currentHash
-        const node = await this.store.getNode(currentHash);
-        if (node === undefined) {
-            // Shouldn't happen for a well-formed tree, but handle gracefully
-            return leafHash;
-        }
-        if (node.type === 'leaf') {
-            // There's an existing leaf at this position
-            if (hashEquals(node.keyHash, keyHash)) {
-                // Same key — replace the value. Delete old leaf node.
-                await this.store.deleteNode(currentHash);
-                return leafHash;
-            }
-            // Different key — need to push both leaves down until their paths diverge
-            return this.splitLeaves(node, currentHash, leafNode, leafHash, depth);
-        }
-        // Internal node — recurse into the appropriate child
-        const internalNode = node;
-        const goRight = getBit(keyHash, depth);
-        let newLeftHash;
-        let newRightHash;
-        if (goRight) {
-            newLeftHash = internalNode.leftHash;
-            newRightHash = await this.insertAtNode(internalNode.rightHash, keyHash, leafHash, leafNode, depth + 1);
-        }
-        else {
-            newLeftHash = await this.insertAtNode(internalNode.leftHash, keyHash, leafHash, leafNode, depth + 1);
-            newRightHash = internalNode.rightHash;
-        }
-        // Compute the new internal node hash
-        const newHash = await hashChildren(newLeftHash, newRightHash);
-        // Store the new internal node (if it differs from the old one)
-        if (!hashEquals(newHash, currentHash)) {
-            const newNode = {
-                type: 'internal',
-                leftHash: newLeftHash,
-                rightHash: newRightHash,
-            };
-            await this.store.putNode(newHash, newNode);
-            // Clean up old internal node
-            await this.store.deleteNode(currentHash);
-        }
-        return newHash;
-    }
-    /**
-     * When two leaves collide at the same position in the tree, push them down
-     * until their key paths diverge, creating internal nodes along the way.
-     *
-     * For example, if two leaves share the first 3 bits but diverge at bit 3,
-     * and we're currently at depth 0, we need to create internal nodes at depths
-     * 0, 1, and 2 (where one child is the chain and the other is a default hash),
-     * plus the divergence node at depth 3 where the two leaves split.
-     */
-    async splitLeaves(existingLeaf, existingLeafHash, newLeaf, newLeafHash, startDepth) {
-        // Find the depth where the two keys diverge
-        let divergeDepth = startDepth;
-        while (divergeDepth < SMT_DEPTH && getBit(existingLeaf.keyHash, divergeDepth) === getBit(newLeaf.keyHash, divergeDepth)) {
-            divergeDepth++;
-        }
-        if (divergeDepth >= SMT_DEPTH) {
-            // Keys are identical (shouldn't happen with SHA-256 on different inputs)
-            return newLeafHash;
-        }
-        // At the divergence depth, the bits differ — one goes left, the other goes right
-        const existingGoesRight = getBit(existingLeaf.keyHash, divergeDepth);
-        let leftHash;
-        let rightHash;
-        if (existingGoesRight) {
-            leftHash = newLeafHash;
-            rightHash = existingLeafHash;
-        }
-        else {
-            leftHash = existingLeafHash;
-            rightHash = newLeafHash;
-        }
-        // Create the divergence node
-        let currentHash = await hashChildren(leftHash, rightHash);
-        await this.store.putNode(currentHash, {
-            type: 'internal',
-            leftHash: leftHash,
-            rightHash: rightHash,
-        });
-        // Build internal nodes back up from (divergeDepth - 1) to startDepth.
-        // At each intermediate depth, one child is the chain (currentHash) and
-        // the other is the default empty hash for that depth + 1.
-        for (let d = divergeDepth - 1; d >= startDepth; d--) {
-            const bit = getBit(existingLeaf.keyHash, d); // both keys share this bit
-            const defaultChild = this.defaultHashes[d + 1];
-            let newLeft;
-            let newRight;
-            if (bit) {
-                newLeft = defaultChild;
-                newRight = currentHash;
-            }
-            else {
-                newLeft = currentHash;
-                newRight = defaultChild;
-            }
-            currentHash = await hashChildren(newLeft, newRight);
-            await this.store.putNode(currentHash, {
-                type: 'internal',
-                leftHash: newLeft,
-                rightHash: newRight,
-            });
-        }
-        return currentHash;
-    }
-    /**
-     * Recursively delete a key from the tree, returning the new hash for the subtree at `depth`.
-     */
-    async deleteAtNode(currentHash, keyHash, depth) {
-        if (depth >= SMT_DEPTH) {
-            return this.defaultHashes[SMT_DEPTH];
-        }
-        // Empty subtree — nothing to delete
-        if (hashEquals(currentHash, this.defaultHashes[depth])) {
-            return currentHash;
-        }
-        const node = await this.store.getNode(currentHash);
-        if (node === undefined) {
-            return this.defaultHashes[depth];
-        }
-        if (node.type === 'leaf') {
-            if (hashEquals(node.keyHash, keyHash)) {
-                // Found the leaf to delete
-                await this.store.deleteNode(currentHash);
-                return this.defaultHashes[depth];
-            }
-            // Wrong leaf — key not in tree
-            return currentHash;
-        }
-        // Internal node — recurse into the appropriate child
-        const internalNode = node;
-        const goRight = getBit(keyHash, depth);
-        let newLeftHash;
-        let newRightHash;
-        if (goRight) {
-            newLeftHash = internalNode.leftHash;
-            newRightHash = await this.deleteAtNode(internalNode.rightHash, keyHash, depth + 1);
-        }
-        else {
-            newLeftHash = await this.deleteAtNode(internalNode.leftHash, keyHash, depth + 1);
-            newRightHash = internalNode.rightHash;
-        }
-        // If both children are now default (empty), this node becomes empty too
-        if (hashEquals(newLeftHash, this.defaultHashes[depth + 1]) && hashEquals(newRightHash, this.defaultHashes[depth + 1])) {
-            await this.store.deleteNode(currentHash);
-            return this.defaultHashes[depth];
-        }
-        // If one child is default and the other is a leaf, collapse upward
-        // (the internal node is unnecessary — just return the leaf hash directly)
-        const leftIsDefault = hashEquals(newLeftHash, this.defaultHashes[depth + 1]);
-        const rightIsDefault = hashEquals(newRightHash, this.defaultHashes[depth + 1]);
-        if (leftIsDefault || rightIsDefault) {
-            const survivingHash = leftIsDefault ? newRightHash : newLeftHash;
-            const survivingNode = await this.store.getNode(survivingHash);
-            if (survivingNode?.type === 'leaf') {
-                // Collapse: remove the internal node, return the leaf hash directly
-                await this.store.deleteNode(currentHash);
-                return survivingHash;
-            }
-        }
-        // Recompute internal node hash
-        const newHash = await hashChildren(newLeftHash, newRightHash);
-        if (!hashEquals(newHash, currentHash)) {
-            const newNode = {
-                type: 'internal',
-                leftHash: newLeftHash,
-                rightHash: newRightHash,
-            };
-            await this.store.putNode(newHash, newNode);
-            await this.store.deleteNode(currentHash);
-        }
-        return newHash;
-    }
-    /**
-     * Check if a key exists at the given node.
-     */
-    async existsAtNode(currentHash, keyHash, depth) {
-        if (depth >= SMT_DEPTH) {
-            return false;
-        }
-        if (hashEquals(currentHash, this.defaultHashes[depth])) {
-            return false;
-        }
-        const node = await this.store.getNode(currentHash);
-        if (node === undefined) {
-            return false;
-        }
-        if (node.type === 'leaf') {
-            return hashEquals(node.keyHash, keyHash);
-        }
-        const internalNode = node;
-        const goRight = getBit(keyHash, depth);
-        if (goRight) {
-            return this.existsAtNode(internalNode.rightHash, keyHash, depth + 1);
-        }
-        else {
-            return this.existsAtNode(internalNode.leftHash, keyHash, depth + 1);
-        }
-    }
-    /**
-     * Generate a proof for the given key at the given node.
-     */
-    async generateProof(currentHash, keyHash, depth) {
-        if (depth >= SMT_DEPTH) {
-            return { siblings: [], leafNode: undefined, depth };
-        }
-        if (hashEquals(currentHash, this.defaultHashes[depth])) {
-            return { siblings: [], leafNode: undefined, depth };
-        }
-        const node = await this.store.getNode(currentHash);
-        if (node === undefined) {
-            return { siblings: [], leafNode: undefined, depth };
-        }
-        if (node.type === 'leaf') {
-            return { siblings: [], leafNode: node, depth };
-        }
-        const internalNode = node;
-        const goRight = getBit(keyHash, depth);
-        let childHash;
-        let siblingHash;
-        if (goRight) {
-            childHash = internalNode.rightHash;
-            siblingHash = internalNode.leftHash;
-        }
-        else {
-            childHash = internalNode.leftHash;
-            siblingHash = internalNode.rightHash;
-        }
-        const childProof = await this.generateProof(childHash, keyHash, depth + 1);
-        childProof.siblings.unshift(siblingHash);
-        return childProof;
-    }
-    /**
-     * Compute the subtree hash for a leaf that exists above the target prefix depth.
-     * The leaf's effective position is determined by its keyHash bits.
-     */
-    async computeSubtreeHashForLeaf(leaf, currentDepth, prefix) {
-        // Check if the leaf's key matches the remaining prefix bits
-        for (let i = currentDepth; i < prefix.length; i++) {
-            if (getBit(leaf.keyHash, i) !== prefix[i]) {
-                // Leaf is not under this prefix
-                return this.defaultHashes[prefix.length];
-            }
-        }
-        // Leaf is under this prefix — recompute its hash
-        return await hashLeaf(leaf.keyHash, leaf.valueCid);
-    }
-    /**
-     * Check if a leaf's keyHash matches a given prefix.
-     */
-    leafMatchesPrefix(keyHash, prefix) {
-        for (let i = 0; i < prefix.length; i++) {
-            if (getBit(keyHash, i) !== prefix[i]) {
-                return false;
-            }
-        }
-        return true;
-    }
-    /**
-     * Collect all leaf messageCids in the subtree rooted at the given hash.
-     */
-    async collectLeaves(nodeHash, depth) {
-        if (depth >= SMT_DEPTH || hashEquals(nodeHash, this.defaultHashes[depth])) {
-            return [];
-        }
-        const node = await this.store.getNode(nodeHash);
-        if (node === undefined) {
-            return [];
-        }
-        if (node.type === 'leaf') {
-            return [node.valueCid];
-        }
-        const internalNode = node;
-        const leftLeaves = await this.collectLeaves(internalNode.leftHash, depth + 1);
-        const rightLeaves = await this.collectLeaves(internalNode.rightHash, depth + 1);
-        return [...leftLeaves, ...rightLeaves];
-    }
-    /**
-     * Recursively diff two subtrees, collecting leaves that exist only in one or the other.
-     */
-    async diffAtNode(localHash, remoteHash, depth, localTree, remoteTree, onlyLocal, onlyRemote) {
-        // If hashes match, subtrees are identical — skip
-        if (hashEquals(localHash, remoteHash)) {
-            return;
-        }
-        // If we've reached max depth, something is wrong — bail out
-        if (depth >= SMT_DEPTH) {
-            return;
-        }
-        const localIsDefault = hashEquals(localHash, this.defaultHashes[depth]);
-        const remoteIsDefault = hashEquals(remoteHash, this.defaultHashes[depth]);
-        // If local is empty but remote is not, all remote leaves are "onlyRemote"
-        if (localIsDefault && !remoteIsDefault) {
-            const remoteLeaves = await remoteTree.collectLeaves(remoteHash, depth);
-            onlyRemote.push(...remoteLeaves);
-            return;
-        }
-        // If remote is empty but local is not, all local leaves are "onlyLocal"
-        if (!localIsDefault && remoteIsDefault) {
-            const localLeaves = await localTree.collectLeaves(localHash, depth);
-            onlyLocal.push(...localLeaves);
-            return;
-        }
-        // Both are non-default and non-equal — load nodes and recurse
-        const localNode = await localTree.store.getNode(localHash);
-        const remoteNode = await remoteTree.store.getNode(remoteHash);
-        // Handle cases where one or both are leaves
-        if (localNode?.type === 'leaf' && remoteNode?.type === 'leaf') {
-            if (!hashEquals(localNode.keyHash, remoteNode.keyHash)) {
-                // Different keys — both are unique to their respective trees
-                onlyLocal.push(localNode.valueCid);
-                onlyRemote.push(remoteNode.valueCid);
-            }
-            else if (localNode.valueCid !== remoteNode.valueCid) {
-                // Same key, different value — treat as update
-                onlyLocal.push(localNode.valueCid);
-                onlyRemote.push(remoteNode.valueCid);
-            }
-            return;
-        }
-        // One is a leaf and the other is internal — expand the leaf side
-        if (localNode?.type === 'leaf') {
-            // Local is a single leaf; remote is a subtree
-            // All remote leaves are potentially onlyRemote; check if the local leaf exists in remote
-            const remoteLeaves = await remoteTree.collectLeaves(remoteHash, depth);
-            const localCid = localNode.valueCid;
-            const remoteSet = new Set(remoteLeaves);
-            if (!remoteSet.has(localCid)) {
-                onlyLocal.push(localCid);
-            }
-            for (const cid of remoteLeaves) {
-                if (cid !== localCid) {
-                    onlyRemote.push(cid);
-                }
-            }
-            return;
-        }
-        if (remoteNode?.type === 'leaf') {
-            // Remote is a single leaf; local is a subtree
-            const localLeaves = await localTree.collectLeaves(localHash, depth);
-            const remoteCid = remoteNode.valueCid;
-            const localSet = new Set(localLeaves);
-            if (!localSet.has(remoteCid)) {
-                onlyRemote.push(remoteCid);
-            }
-            for (const cid of localLeaves) {
-                if (cid !== remoteCid) {
-                    onlyLocal.push(cid);
-                }
-            }
-            return;
-        }
-        // Both are internal nodes — recurse into children
-        if (localNode?.type === 'internal' && remoteNode?.type === 'internal') {
-            await this.diffAtNode(localNode.leftHash, remoteNode.leftHash, depth + 1, localTree, remoteTree, onlyLocal, onlyRemote);
-            await this.diffAtNode(localNode.rightHash, remoteNode.rightHash, depth + 1, localTree, remoteTree, onlyLocal, onlyRemote);
-            return;
-        }
-        // Fallback: if a node is missing, collect all from the other side
-        if (localNode === undefined) {
-            const remoteLeaves = await remoteTree.collectLeaves(remoteHash, depth);
-            onlyRemote.push(...remoteLeaves);
-        }
-        if (remoteNode === undefined) {
-            const localLeaves = await localTree.collectLeaves(localHash, depth);
-            onlyLocal.push(...localLeaves);
-        }
-    }
-}
-//# sourceMappingURL=sparse-merkle-tree.js.map

package/dist/esm/src/smt/sparse-merkle-tree.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"sparse-merkle-tree.js","sourceRoot":"","sources":["../../../../src/smt/sparse-merkle-tree.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;;;;;GAcG;AAIH,OAAO,EAAE,MAAM,EAAE,YAAY,EAAE,UAAU,EAAE,OAAO,EAAE,QAAQ,EAAE,iBAAiB,EAAE,SAAS,EAAE,MAAM,gBAAgB,CAAC;AAEnH,MAAM,OAAO,gBAAgB;IACV,KAAK,CAAe;IAC7B,aAAa,CAAU;IAE/B,YAAY,KAAmB;QAC7B,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,UAAU;QACd,MAAM,IAAI,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC;QACxB,IAAI,CAAC,aAAa,GAAG,MAAM,iBAAiB,EAAE,CAAC;IACjD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,KAAK;QACT,MAAM,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC;IAC3B,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,OAAO;QACX,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;QACxC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC;QAC/B,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;;;;OAKG;IACH,KAAK,CAAC,MAAM,CAAC,UAAkB;QAC7B,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,UAAU,CAAC,CAAC;QAC1C,MAAM,QAAQ,GAAG,MAAM,QAAQ,CAAC,OAAO,EAAE,UAAU,CAAC,CAAC;QAErD,MAAM,QAAQ,GAAgB;YAC5B,IAAI,EAAO,MAAM;YACjB,OAAO,EAAI,OAAO;YAClB,QAAQ,EAAG,UAAU;SACtB,CAAC;QAEF,sBAAsB;QACtB,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;QAE7C,qEAAqE;QACrE,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,WAAW,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC,CAAC,CAAC;QAErF,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAClC,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;OAIG;IACH,KAAK,CAAC,MAAM,CAAC,UAAkB;QAC7B,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,UAAU,CAAC,CAAC;QAE1C,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;QACzC,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,WAAW,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;QAEjE,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAClC,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,GAAG,CAAC,UAAkB;QAC1B,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,UAAU,CAAC,CAAC;QAC1C,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;QACzC,OAAO,IAAI,CAAC,YAAY,CAAC,WAAW,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;IACpD,CAAC;IAED;;OAEG;IACH,KAAK,CAAC,QAAQ,CAAC,UAAkB;QAC/B,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,UAAU,CAAC,CAAC;QAC1C,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;QACzC,OAAO,IAAI,CAAC,aAAa,CAAC,WAAW,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;IACrD,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,cAAc,CAAC,MAAiB;QACpC,IAAI,WAAW,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;QAEvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnD,8DAA8D;gBAC9D,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC3C,CAAC;YAED,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YACnD,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBAC/C,kEAAkE;gBAClE,2EAA2E;gBAC3E,kEAAkE;gBAClE,yCAAyC;gBACzC,IAAI,IAAI,EAAE,IAAI,KAAK,MAAM,EAAE,CAAC;oBAC1B,OAAO,IAAI,CAAC,yBAAyB,CAAC,IAAI,EAAE,CAAC,EAAE,MAAM,CAAC,CAAC;gBACzD,CAAC;gBACD,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC3C,CAAC;YAED,MAAM,YAAY,GAAG,IAAI,CAAC;YAC1B,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;gBACd,WAAW,GAAG,YAAY,CAAC,SAAS,CAAC;YACvC,CAAC;iBAAM,CAAC;gBACN,WAAW,GAAG,YAAY,CAAC,QAAQ,CAAC;YACtC,CAAC;QACH,CAAC;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,SAAS,CAAC,MAAiB;QAC/B,IAAI,WAAW,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;QAEvC,wCAAwC;QACxC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;gBACnD,OAAO,EAAE,CAAC;YACZ,CAAC;YAED,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;YACnD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACvB,OAAO,EAAE,CAAC;YACZ,CAAC;YAED,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;gBACzB,mDAAmD;gBACnD,MAAM,iBAAiB,GAAG,IAAI,CAAC,iBAAiB,CAAC,IAAI,CAAC,OAAO,EAAE,MAAM,CAAC,CAAC;gBACvE,IAAI,iBAAiB,EAAE,CAAC;oBACtB,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBACzB,CAAC;gBACD,OAAO,EAAE,CAAC;YACZ,CAAC;YAED,MAAM,YAAY,GAAG,IAAI,CAAC;YAC1B,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;gBACd,WAAW,GAAG,YAAY,CAAC,SAAS,CAAC;YACvC,CAAC;iBAAM,CAAC;gBACN,WAAW,GAAG,YAAY,CAAC,QAAQ,CAAC;YACtC,CAAC;QACH,CAAC;QAED,qCAAqC;QACrC,OAAO,IAAI,CAAC,aAAa,CAAC,WAAW,EAAE,MAAM,CAAC,MAAM,CAAC,CAAC;IACxD,CAAC;IAED;;;;;;OAMG;IACH,KAAK,CAAC,IAAI,CAAC,KAAuB;QAChC,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,OAAO,EAAE,CAAC;QACvC,MAAM,UAAU,GAAG,MAAM,KAAK,CAAC,OAAO,EAAE,CAAC;QAEzC,IAAI,UAAU,CAAC,SAAS,EAAE,UAAU,CAAC,EAAE,CAAC;YACtC,OAAO,EAAE,SAAS,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC;QAC3C,CAAC;QAED,MAAM,SAAS,GAAa,EAAE,CAAC;QAC/B,MAAM,UAAU,GAAa,EAAE,CAAC;QAEhC,MAAM,IAAI,CAAC,UAAU,CAAC,SAAS,EAAE,UAAU,EAAE,CAAC,EAAE,IAAI,EAAE,KAAK,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;QAEpF,OAAO,EAAE,SAAS,EAAE,UAAU,EAAE,CAAC;IACnC,CAAC;IAED,6EAA6E;IAE7E;;OAEG;IACK,KAAK,CAAC,YAAY,CACxB,WAAiB,EACjB,OAAa,EACb,QAAc,EACd,QAAqB,EACrB,KAAa;QAEb,uCAAuC;QACvC,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;YACvB,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,2FAA2F;QAC3F,qFAAqF;QACrF,0CAA0C;QAC1C,IAAI,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACvD,gFAAgF;YAChF,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,+BAA+B;QAC/B,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACnD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,iEAAiE;YACjE,OAAO,QAAQ,CAAC;QAClB,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YACzB,4CAA4C;YAC5C,IAAI,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC;gBACtC,sDAAsD;gBACtD,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;gBACzC,OAAO,QAAQ,CAAC;YAClB,CAAC;YAED,0EAA0E;YAC1E,OAAO,IAAI,CAAC,WAAW,CAAC,IAAI,EAAE,WAAW,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,CAAC,CAAC;QACxE,CAAC;QAED,qDAAqD;QACrD,MAAM,YAAY,GAAG,IAAI,CAAC;QAC1B,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAEvC,IAAI,WAAiB,CAAC;QACtB,IAAI,YAAkB,CAAC;QAEvB,IAAI,OAAO,EAAE,CAAC;YACZ,WAAW,GAAG,YAAY,CAAC,QAAQ,CAAC;YACpC,YAAY,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,SAAS,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACzG,CAAC;aAAM,CAAC;YACN,WAAW,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,EAAE,QAAQ,EAAE,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YACrG,YAAY,GAAG,YAAY,CAAC,SAAS,CAAC;QACxC,CAAC;QAED,qCAAqC;QACrC,MAAM,OAAO,GAAG,MAAM,YAAY,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;QAE9D,+DAA+D;QAC/D,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,WAAW,CAAC,EAAE,CAAC;YACtC,MAAM,OAAO,GAAoB;gBAC/B,IAAI,EAAQ,UAAU;gBACtB,QAAQ,EAAI,WAAW;gBACvB,SAAS,EAAG,YAAY;aACzB,CAAC;YACF,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAE3C,6BAA6B;YAC7B,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QAC3C,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;;;OAQG;IACK,KAAK,CAAC,WAAW,CACvB,YAAyB,EACzB,gBAAsB,EACtB,OAAoB,EACpB,WAAiB,EACjB,UAAkB;QAElB,4CAA4C;QAC5C,IAAI,YAAY,GAAG,UAAU,CAAC;QAC9B,OAAO,YAAY,GAAG,SAAS,IAAI,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,YAAY,CAAC,KAAK,MAAM,CAAC,OAAO,CAAC,OAAO,EAAE,YAAY,CAAC,EAAE,CAAC;YACxH,YAAY,EAAE,CAAC;QACjB,CAAC;QAED,IAAI,YAAY,IAAI,SAAS,EAAE,CAAC;YAC9B,yEAAyE;YACzE,OAAO,WAAW,CAAC;QACrB,CAAC;QAED,iFAAiF;QACjF,MAAM,iBAAiB,GAAG,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC;QAErE,IAAI,QAAc,CAAC;QACnB,IAAI,SAAe,CAAC;QAEpB,IAAI,iBAAiB,EAAE,CAAC;YACtB,QAAQ,GAAG,WAAW,CAAC;YACvB,SAAS,GAAG,gBAAgB,CAAC;QAC/B,CAAC;aAAM,CAAC;YACN,QAAQ,GAAG,gBAAgB,CAAC;YAC5B,SAAS,GAAG,WAAW,CAAC;QAC1B,CAAC;QAED,6BAA6B;QAC7B,IAAI,WAAW,GAAG,MAAM,YAAY,CAAC,QAAQ,EAAE,SAAS,CAAC,CAAC;QAC1D,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE;YACpC,IAAI,EAAQ,UAAU;YACtB,QAAQ,EAAI,QAAQ;YACpB,SAAS,EAAG,SAAS;SACtB,CAAC,CAAC;QAEH,sEAAsE;QACtE,uEAAuE;QACvE,0DAA0D;QAC1D,KAAK,IAAI,CAAC,GAAG,YAAY,GAAG,CAAC,EAAE,CAAC,IAAI,UAAU,EAAE,CAAC,EAAE,EAAE,CAAC;YACpD,MAAM,GAAG,GAAG,MAAM,CAAC,YAAY,CAAC,OAAO,EAAE,CAAC,CAAC,CAAC,CAAC,2BAA2B;YACxE,MAAM,YAAY,GAAG,IAAI,CAAC,aAAa,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;YAE/C,IAAI,OAAa,CAAC;YAClB,IAAI,QAAc,CAAC;YACnB,IAAI,GAAG,EAAE,CAAC;gBACR,OAAO,GAAG,YAAY,CAAC;gBACvB,QAAQ,GAAG,WAAW,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACN,OAAO,GAAG,WAAW,CAAC;gBACtB,QAAQ,GAAG,YAAY,CAAC;YAC1B,CAAC;YAED,WAAW,GAAG,MAAM,YAAY,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;YACpD,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE;gBACpC,IAAI,EAAQ,UAAU;gBACtB,QAAQ,EAAI,OAAO;gBACnB,SAAS,EAAG,QAAQ;aACrB,CAAC,CAAC;QACL,CAAC;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,YAAY,CAAC,WAAiB,EAAE,OAAa,EAAE,KAAa;QACxE,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC,aAAa,CAAC,SAAS,CAAC,CAAC;QACvC,CAAC;QAED,oCAAoC;QACpC,IAAI,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACvD,OAAO,WAAW,CAAC;QACrB,CAAC;QAED,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACnD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QACnC,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YACzB,IAAI,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC;gBACtC,2BAA2B;gBAC3B,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;gBACzC,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;YACnC,CAAC;YACD,+BAA+B;YAC/B,OAAO,WAAW,CAAC;QACrB,CAAC;QAED,qDAAqD;QACrD,MAAM,YAAY,GAAG,IAAI,CAAC;QAC1B,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAEvC,IAAI,WAAiB,CAAC;QACtB,IAAI,YAAkB,CAAC;QAEvB,IAAI,OAAO,EAAE,CAAC;YACZ,WAAW,GAAG,YAAY,CAAC,QAAQ,CAAC;YACpC,YAAY,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,SAAS,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACrF,CAAC;aAAM,CAAC;YACN,WAAW,GAAG,MAAM,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;YACjF,YAAY,GAAG,YAAY,CAAC,SAAS,CAAC;QACxC,CAAC;QAED,wEAAwE;QACxE,IAAI,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,IAAI,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC;YACtH,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;YACzC,OAAO,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC;QACnC,CAAC;QAED,mEAAmE;QACnE,0EAA0E;QAC1E,MAAM,aAAa,GAAG,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QAC7E,MAAM,cAAc,GAAG,UAAU,CAAC,YAAY,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC;QAE/E,IAAI,aAAa,IAAI,cAAc,EAAE,CAAC;YACpC,MAAM,aAAa,GAAG,aAAa,CAAC,CAAC,CAAC,YAAY,CAAC,CAAC,CAAC,WAAW,CAAC;YACjE,MAAM,aAAa,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;YAC9D,IAAI,aAAa,EAAE,IAAI,KAAK,MAAM,EAAE,CAAC;gBACnC,oEAAoE;gBACpE,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;gBACzC,OAAO,aAAa,CAAC;YACvB,CAAC;QACH,CAAC;QAED,+BAA+B;QAC/B,MAAM,OAAO,GAAG,MAAM,YAAY,CAAC,WAAW,EAAE,YAAY,CAAC,CAAC;QAE9D,IAAI,CAAC,UAAU,CAAC,OAAO,EAAE,WAAW,CAAC,EAAE,CAAC;YACtC,MAAM,OAAO,GAAoB;gBAC/B,IAAI,EAAQ,UAAU;gBACtB,QAAQ,EAAI,WAAW;gBACvB,SAAS,EAAG,YAAY;aACzB,CAAC;YACF,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;YAC3C,MAAM,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QAC3C,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,YAAY,CAAC,WAAiB,EAAE,OAAa,EAAE,KAAa;QACxE,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;YACvB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACvD,OAAO,KAAK,CAAC;QACf,CAAC;QAED,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACnD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,OAAO,KAAK,CAAC;QACf,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YACzB,OAAO,UAAU,CAAC,IAAI,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;QAC3C,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,CAAC;QAC1B,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAEvC,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,SAAS,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACvE,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC,YAAY,CAAC,YAAY,CAAC,QAAQ,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QACtE,CAAC;IACH,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,aAAa,CAAC,WAAiB,EAAE,OAAa,EAAE,KAAa;QACzE,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;YACvB,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;QACtD,CAAC;QAED,IAAI,UAAU,CAAC,WAAW,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YACvD,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;QACtD,CAAC;QAED,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QACnD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC;QACtD,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YACzB,OAAO,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;QACjD,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,CAAC;QAC1B,MAAM,OAAO,GAAG,MAAM,CAAC,OAAO,EAAE,KAAK,CAAC,CAAC;QAEvC,IAAI,SAAe,CAAC;QACpB,IAAI,WAAiB,CAAC;QAEtB,IAAI,OAAO,EAAE,CAAC;YACZ,SAAS,GAAG,YAAY,CAAC,SAAS,CAAC;YACnC,WAAW,GAAG,YAAY,CAAC,QAAQ,CAAC;QACtC,CAAC;aAAM,CAAC;YACN,SAAS,GAAG,YAAY,CAAC,QAAQ,CAAC;YAClC,WAAW,GAAG,YAAY,CAAC,SAAS,CAAC;QACvC,CAAC;QAED,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,SAAS,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAC3E,UAAU,CAAC,QAAQ,CAAC,OAAO,CAAC,WAAW,CAAC,CAAC;QAEzC,OAAO,UAAU,CAAC;IACpB,CAAC;IAED;;;OAGG;IACK,KAAK,CAAC,yBAAyB,CACrC,IAAiB,EACjB,YAAoB,EACpB,MAAiB;QAEjB,4DAA4D;QAC5D,KAAK,IAAI,CAAC,GAAG,YAAY,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YAClD,IAAI,MAAM,CAAC,IAAI,CAAC,OAAO,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC1C,gCAAgC;gBAChC,OAAO,IAAI,CAAC,aAAa,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAC3C,CAAC;QACH,CAAC;QAED,iDAAiD;QACjD,OAAO,MAAM,QAAQ,CAAC,IAAI,CAAC,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,CAAC;IACrD,CAAC;IAED;;OAEG;IACK,iBAAiB,CAAC,OAAa,EAAE,MAAiB;QACxD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;YACvC,IAAI,MAAM,CAAC,OAAO,EAAE,CAAC,CAAC,KAAK,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;gBACrC,OAAO,KAAK,CAAC;YACf,CAAC;QACH,CAAC;QACD,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,aAAa,CAAC,QAAc,EAAE,KAAa;QACvD,IAAI,KAAK,IAAI,SAAS,IAAI,UAAU,CAAC,QAAQ,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC;YAC1E,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,MAAM,IAAI,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAChD,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACvB,OAAO,EAAE,CAAC;QACZ,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,KAAK,MAAM,EAAE,CAAC;YACzB,OAAO,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QACzB,CAAC;QAED,MAAM,YAAY,GAAG,IAAI,CAAC;QAC1B,MAAM,UAAU,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAC9E,MAAM,WAAW,GAAG,MAAM,IAAI,CAAC,aAAa,CAAC,YAAY,CAAC,SAAS,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAEhF,OAAO,CAAC,GAAG,UAAU,EAAE,GAAG,WAAW,CAAC,CAAC;IACzC,CAAC;IAED;;OAEG;IACK,KAAK,CAAC,UAAU,CACtB,SAAe,EACf,UAAgB,EAChB,KAAa,EACb,SAA2B,EAC3B,UAA4B,EAC5B,SAAmB,EACnB,UAAoB;QAEpB,iDAAiD;QACjD,IAAI,UAAU,CAAC,SAAS,EAAE,UAAU,CAAC,EAAE,CAAC;YACtC,OAAO;QACT,CAAC;QAED,4DAA4D;QAC5D,IAAI,KAAK,IAAI,SAAS,EAAE,CAAC;YACvB,OAAO;QACT,CAAC;QAED,MAAM,cAAc,GAAG,UAAU,CAAC,SAAS,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;QACxE,MAAM,eAAe,GAAG,UAAU,CAAC,UAAU,EAAE,IAAI,CAAC,aAAa,CAAC,KAAK,CAAC,CAAC,CAAC;QAE1E,0EAA0E;QAC1E,IAAI,cAAc,IAAI,CAAC,eAAe,EAAE,CAAC;YACvC,MAAM,YAAY,GAAG,MAAM,UAAU,CAAC,aAAa,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YACvE,UAAU,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;YACjC,OAAO;QACT,CAAC;QAED,wEAAwE;QACxE,IAAI,CAAC,cAAc,IAAI,eAAe,EAAE,CAAC;YACvC,MAAM,WAAW,GAAG,MAAM,SAAS,CAAC,aAAa,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YACpE,SAAS,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;YAC/B,OAAO;QACT,CAAC;QAED,8DAA8D;QAC9D,MAAM,SAAS,GAAG,MAAM,SAAS,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;QAC3D,MAAM,UAAU,GAAG,MAAM,UAAU,CAAC,KAAK,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QAE9D,4CAA4C;QAC5C,IAAI,SAAS,EAAE,IAAI,KAAK,MAAM,IAAI,UAAU,EAAE,IAAI,KAAK,MAAM,EAAE,CAAC;YAC9D,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,OAAO,EAAE,UAAU,CAAC,OAAO,CAAC,EAAE,CAAC;gBACvD,6DAA6D;gBAC7D,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;gBACnC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YACvC,CAAC;iBAAM,IAAI,SAAS,CAAC,QAAQ,KAAK,UAAU,CAAC,QAAQ,EAAE,CAAC;gBACtD,8CAA8C;gBAC9C,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC;gBACnC,UAAU,CAAC,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YACvC,CAAC;YACD,OAAO;QACT,CAAC;QAED,iEAAiE;QACjE,IAAI,SAAS,EAAE,IAAI,KAAK,MAAM,EAAE,CAAC;YAC/B,8CAA8C;YAC9C,yFAAyF;YACzF,MAAM,YAAY,GAAG,MAAM,UAAU,CAAC,aAAa,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YACvE,MAAM,QAAQ,GAAG,SAAS,CAAC,QAAQ,CAAC;YACpC,MAAM,SAAS,GAAG,IAAI,GAAG,CAAC,YAAY,CAAC,CAAC;YAExC,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC7B,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YAC3B,CAAC;YACD,KAAK,MAAM,GAAG,IAAI,YAAY,EAAE,CAAC;gBAC/B,IAAI,GAAG,KAAK,QAAQ,EAAE,CAAC;oBACrB,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACvB,CAAC;YACH,CAAC;YACD,OAAO;QACT,CAAC;QAED,IAAI,UAAU,EAAE,IAAI,KAAK,MAAM,EAAE,CAAC;YAChC,8CAA8C;YAC9C,MAAM,WAAW,GAAG,MAAM,SAAS,CAAC,aAAa,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YACpE,MAAM,SAAS,GAAG,UAAU,CAAC,QAAQ,CAAC;YACtC,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC;YAEtC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBAC7B,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC7B,CAAC;YACD,KAAK,MAAM,GAAG,IAAI,WAAW,EAAE,CAAC;gBAC9B,IAAI,GAAG,KAAK,SAAS,EAAE,CAAC;oBACtB,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;gBACtB,CAAC;YACH,CAAC;YACD,OAAO;QACT,CAAC;QAED,kDAAkD;QAClD,IAAI,SAAS,EAAE,IAAI,KAAK,UAAU,IAAI,UAAU,EAAE,IAAI,KAAK,UAAU,EAAE,CAAC;YACtE,MAAM,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,EAAE,UAAU,CAAC,QAAQ,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;YACxH,MAAM,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,SAAS,EAAE,UAAU,CAAC,SAAS,EAAE,KAAK,GAAG,CAAC,EAAE,SAAS,EAAE,UAAU,EAAE,SAAS,EAAE,UAAU,CAAC,CAAC;YAC1H,OAAO;QACT,CAAC;QAED,kEAAkE;QAClE,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YAC5B,MAAM,YAAY,GAAG,MAAM,UAAU,CAAC,aAAa,CAAC,UAAU,EAAE,KAAK,CAAC,CAAC;YACvE,UAAU,CAAC,IAAI,CAAC,GAAG,YAAY,CAAC,CAAC;QACnC,CAAC;QACD,IAAI,UAAU,KAAK,SAAS,EAAE,CAAC;YAC7B,MAAM,WAAW,GAAG,MAAM,SAAS,CAAC,aAAa,CAAC,SAAS,EAAE,KAAK,CAAC,CAAC;YACpE,SAAS,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;CACF"}