@aztec/merkle-tree 0.6.7 → 0.7.2

package/dest/tree_base.js

@@ -1,257 +0,0 @@
-import { toBigIntLE, toBufferLE } from '@aztec/foundation/bigint-buffer';
-import { SiblingPath } from '@aztec/types';
-const MAX_DEPTH = 254;
-const indexToKeyHash = (name, level, index) => `${name}:${level}:${index}`;
-const encodeMeta = (root, depth, size) => {
-    const data = Buffer.alloc(36);
-    root.copy(data);
-    data.writeUInt32LE(depth, 32);
-    return Buffer.concat([data, toBufferLE(size, 32)]);
-};
-export const decodeMeta = (meta) => {
-    const root = meta.subarray(0, 32);
-    const depth = meta.readUInt32LE(32);
-    const size = toBigIntLE(meta.subarray(36));
-    return {
-        root,
-        depth,
-        size,
-    };
-};
-export const INITIAL_LEAF = Buffer.from('0000000000000000000000000000000000000000000000000000000000000000', 'hex');
-/**
- * A Merkle tree implementation that uses a LevelDB database to store the tree.
- */
-export class TreeBase {
-    constructor(db, hasher, name, depth, size = 0n, root) {
-        this.db = db;
-        this.hasher = hasher;
-        this.name = name;
-        this.depth = depth;
-        this.size = size;
-        this.zeroHashes = [];
-        this.cache = {};
-        if (!(depth >= 1 && depth <= MAX_DEPTH)) {
-            throw Error('Invalid depth');
-        }
-        // Compute the zero values at each layer.
-        let current = INITIAL_LEAF;
-        for (let i = depth - 1; i >= 0; --i) {
-            this.zeroHashes[i] = current;
-            current = hasher.compress(current, current);
-        }
-        this.root = root ? root : current;
-        this.maxIndex = 2n ** BigInt(depth) - 1n;
-    }
-    /**
-     * Returns the root of the tree.
-     * @param includeUncommitted - If true, root incorporating uncommitted changes is returned.
-     * @returns The root of the tree.
-     */
-    getRoot(includeUncommitted) {
-        return !includeUncommitted ? this.root : this.cache[indexToKeyHash(this.name, 0, 0n)] ?? this.root;
-    }
-    /**
-     * Returns the number of leaves in the tree.
-     * @param includeUncommitted - If true, the returned number of leaves includes uncommitted changes.
-     * @returns The number of leaves in the tree.
-     */
-    getNumLeaves(includeUncommitted) {
-        return !includeUncommitted ? this.size : this.cachedSize ?? this.size;
-    }
-    /**
-     * Returns the name of the tree.
-     * @returns The name of the tree.
-     */
-    getName() {
-        return this.name;
-    }
-    /**
-     * Returns the depth of the tree.
-     * @returns The depth of the tree.
-     */
-    getDepth() {
-        return this.depth;
-    }
-    /**
-     * Returns a sibling path for the element at the given index.
-     * @param index - The index of the element.
-     * @param includeUncommitted - Indicates whether to get a sibling path incorporating uncommitted changes.
-     * @returns A sibling path for the element at the given index.
-     * Note: The sibling path is an array of sibling hashes, with the lowest hash (leaf hash) first, and the highest hash last.
-     */
-    async getSiblingPath(index, includeUncommitted) {
-        const path = [];
-        let level = this.depth;
-        while (level > 0) {
-            const isRight = index & 0x01n;
-            const sibling = await this.getLatestValueAtIndex(level, isRight ? index - 1n : index + 1n, includeUncommitted);
-            path.push(sibling);
-            level -= 1;
-            index >>= 1n;
-        }
-        return new SiblingPath(this.depth, path);
-    }
-    /**
-     * Commits the changes to the database.
-     * @returns Empty promise.
-     */
-    async commit() {
-        const batch = this.db.batch();
-        const keys = Object.getOwnPropertyNames(this.cache);
-        for (const key of keys) {
-            batch.put(key, this.cache[key]);
-        }
-        this.size = this.getNumLeaves(true);
-        this.root = this.getRoot(true);
-        await this.writeMeta(batch);
-        await batch.write();
-        this.clearCache();
-    }
-    /**
-     * Rolls back the not-yet-committed changes.
-     * @returns Empty promise.
-     */
-    rollback() {
-        this.clearCache();
-        return Promise.resolve();
-    }
-    /**
-     * Gets the value at the given index.
-     * @param index - The index of the leaf.
-     * @param includeUncommitted - Indicates whether to include uncommitted changes.
-     * @returns Leaf value at the given index or undefined.
-     */
-    getLeafValue(index, includeUncommitted) {
-        return this.getLatestValueAtIndex(this.depth, index, includeUncommitted);
-    }
-    /**
-     * Clears the cache.
-     */
-    clearCache() {
-        this.cache = {};
-        this.cachedSize = undefined;
-    }
-    /**
-     * Adds a leaf and all the hashes above it to the cache.
-     * @param leaf - Leaf to add to cache.
-     * @param index - Index of the leaf (used to derive the cache key).
-     */
-    async addLeafToCacheAndHashToRoot(leaf, index) {
-        const key = indexToKeyHash(this.name, this.depth, index);
-        let current = leaf;
-        this.cache[key] = current;
-        let level = this.depth;
-        while (level > 0) {
-            const isRight = index & 0x01n;
-            const sibling = await this.getLatestValueAtIndex(level, isRight ? index - 1n : index + 1n, true);
-            const lhs = isRight ? sibling : current;
-            const rhs = isRight ? current : sibling;
-            current = this.hasher.compress(lhs, rhs);
-            level -= 1;
-            index >>= 1n;
-            const cacheKey = indexToKeyHash(this.name, level, index);
-            this.cache[cacheKey] = current;
-        }
-    }
-    /**
-     * Returns the latest value at the given index.
-     * @param level - The level of the tree.
-     * @param index - The index of the element.
-     * @param includeUncommitted - Indicates, whether to get include uncommitted changes.
-     * @returns The latest value at the given index.
-     * Note: If the value is not in the cache, it will be fetched from the database.
-     */
-    async getLatestValueAtIndex(level, index, includeUncommitted) {
-        const key = indexToKeyHash(this.name, level, index);
-        if (includeUncommitted && this.cache[key] !== undefined) {
-            return this.cache[key];
-        }
-        const committed = await this.dbGet(key);
-        if (committed !== undefined) {
-            return committed;
-        }
-        return this.zeroHashes[level - 1];
-    }
-    /**
-     * Gets a value from db by key.
-     * @param key - The key to by which to get the value.
-     * @returns A value from the db based on the key.
-     */
-    async dbGet(key) {
-        return await this.db.get(key).catch(() => { });
-    }
-    /**
-     * Initializes the tree.
-     * @param prefilledSize - A number of leaves that are prefilled with values.
-     * @returns Empty promise.
-     */
-    // eslint-disable-next-line @typescript-eslint/no-unused-vars
-    async init(prefilledSize) {
-        // prefilledSize is used only by Indexed Tree.
-        await this.writeMeta();
-    }
-    /**
-     * Initializes the tree from the database.
-     */
-    async initFromDb() {
-        // Implemented only by Indexed Tree to populate the leaf cache.
-    }
-    /**
-     * Writes meta data to the provided batch.
-     * @param batch - The batch to which to write the meta data.
-     */
-    async writeMeta(batch) {
-        const data = encodeMeta(this.getRoot(true), this.depth, this.getNumLeaves(true));
-        if (batch) {
-            batch.put(this.name, data);
-        }
-        else {
-            await this.db.put(this.name, data);
-        }
-    }
-    /**
-     * Appends the given leaves to the tree.
-     * @param leaves - The leaves to append.
-     * @returns Empty promise.
-     *
-     * @remarks The batch insertion algorithm works as follows:
-     *          1. Insert all the leaves,
-     *          2. start iterating over levels from the bottom up,
-     *          3. on each level iterate over all the affected nodes (i.e. nodes whose preimages have changed),
-     *          4. fetch the preimage, hash it and insert the updated value.
-     * @remarks This algorithm is optimal when it comes to the number of hashing operations. It might not be optimal when
-     *          it comes to the number of database reads, but that should be irrelevant given that most of the time
-     *          `getLatestValueAtIndex` will return a value from cache (because at least one of the 2 children was
-     *          touched in previous iteration).
-     */
-    async appendLeaves(leaves) {
-        const numLeaves = this.getNumLeaves(true);
-        if (numLeaves + BigInt(leaves.length) - 1n > this.maxIndex) {
-            throw Error(`Can't append beyond max index. Max index: ${this.maxIndex}`);
-        }
-        // 1. Insert all the leaves
-        let firstIndex = numLeaves;
-        let level = this.depth;
-        for (let i = 0; i < leaves.length; i++) {
-            const cacheKey = indexToKeyHash(this.name, level, firstIndex + BigInt(i));
-            this.cache[cacheKey] = leaves[i];
-        }
-        let lastIndex = firstIndex + BigInt(leaves.length);
-        // 2. Iterate over all the levels from the bottom up
-        while (level > 0) {
-            firstIndex >>= 1n;
-            lastIndex >>= 1n;
-            // 3.Iterate over all the affected nodes at this level and update them
-            for (let index = firstIndex; index <= lastIndex; index++) {
-                const lhs = await this.getLatestValueAtIndex(level, index * 2n, true);
-                const rhs = await this.getLatestValueAtIndex(level, index * 2n + 1n, true);
-                const cacheKey = indexToKeyHash(this.name, level - 1, index);
-                this.cache[cacheKey] = this.hasher.compress(lhs, rhs);
-            }
-            level -= 1;
-        }
-        this.cachedSize = numLeaves + BigInt(leaves.length);
-    }
-}
-//# sourceMappingURL=data:application/json;base64,{"version":3,"file":"tree_base.js","sourceRoot":"","sources":["../src/tree_base.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,UAAU,EAAE,UAAU,EAAE,MAAM,iCAAiC,CAAC;AACzE,OAAO,EAAU,WAAW,EAAE,MAAM,cAAc,CAAC;AAMnD,MAAM,SAAS,GAAG,GAAG,CAAC;AAEtB,MAAM,cAAc,GAAG,CAAC,IAAY,EAAE,KAAa,EAAE,KAAa,EAAE,EAAE,CAAC,GAAG,IAAI,IAAI,KAAK,IAAI,KAAK,EAAE,CAAC;AACnG,MAAM,UAAU,GAAG,CAAC,IAAY,EAAE,KAAa,EAAE,IAAY,EAAE,EAAE;IAC/D,MAAM,IAAI,GAAG,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;IAC9B,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAChB,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;IAC9B,OAAO,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,UAAU,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC;AACrD,CAAC,CAAC;AACF,MAAM,CAAC,MAAM,UAAU,GAAG,CAAC,IAAY,EAAE,EAAE;IACzC,MAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC;IAClC,MAAM,KAAK,GAAG,IAAI,CAAC,YAAY,CAAC,EAAE,CAAC,CAAC;IACpC,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC,CAAC;IAC3C,OAAO;QACL,IAAI;QACJ,KAAK;QACL,IAAI;KACL,CAAC;AACJ,CAAC,CAAC;AAEF,MAAM,CAAC,MAAM,YAAY,GAAG,MAAM,CAAC,IAAI,CAAC,kEAAkE,EAAE,KAAK,CAAC,CAAC;AAEnH;;GAEG;AACH,MAAM,OAAgB,QAAQ;IAO5B,YACY,EAAW,EACX,MAAc,EAChB,IAAY,EACZ,KAAa,EACX,OAAe,EAAE,EAC3B,IAAa;QALH,OAAE,GAAF,EAAE,CAAS;QACX,WAAM,GAAN,MAAM,CAAQ;QAChB,SAAI,GAAJ,IAAI,CAAQ;QACZ,UAAK,GAAL,KAAK,CAAQ;QACX,SAAI,GAAJ,IAAI,CAAa;QARrB,eAAU,GAAa,EAAE,CAAC;QAC1B,UAAK,GAA8B,EAAE,CAAC;QAU5C,IAAI,CAAC,CAAC,KAAK,IAAI,CAAC,IAAI,KAAK,IAAI,SAAS,CAAC,EAAE;YACvC,MAAM,KAAK,CAAC,eAAe,CAAC,CAAC;SAC9B;QAED,yCAAyC;QACzC,IAAI,OAAO,GAAG,YAAY,CAAC;QAC3B,KAAK,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,EAAE;YACnC,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,OAAO,CAAC;YAC7B,OAAO,GAAG,MAAM,CAAC,QAAQ,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC;SAC7C;QAED,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,OAAO,CAAC;QAClC,IAAI,CAAC,QAAQ,GAAG,EAAE,IAAI,MAAM,CAAC,KAAK,CAAC,GAAG,EAAE,CAAC;IAC3C,CAAC;IAED;;;;OAIG;IACI,OAAO,CAAC,kBAA2B;QACxC,OAAO,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,CAAC,IAAI,CAAC;IACrG,CAAC;IAED;;;;OAIG;IACI,YAAY,CAAC,kBAA2B;QAC7C,OAAO,CAAC,kBAAkB,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,UAAU,IAAI,IAAI,CAAC,IAAI,CAAC;IACxE,CAAC;IAED;;;OAGG;IACI,OAAO;QACZ,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAED;;;OAGG;IACI,QAAQ;QACb,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;;;;;OAMG;IACI,KAAK,CAAC,cAAc,CAAmB,KAAa,EAAE,kBAA2B;QACtF,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACvB,OAAO,KAAK,GAAG,CAAC,EAAE;YAChB,MAAM,OAAO,GAAG,KAAK,GAAG,KAAK,CAAC;YAC9B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,EAAE,kBAAkB,CAAC,CAAC;YAC/G,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACnB,KAAK,IAAI,CAAC,CAAC;YACX,KAAK,KAAK,EAAE,CAAC;SACd;QACD,OAAO,IAAI,WAAW,CAAI,IAAI,CAAC,KAAU,EAAE,IAAI,CAAC,CAAC;IACnD,CAAC;IAED;;;OAGG;IACI,KAAK,CAAC,MAAM;QACjB,MAAM,KAAK,GAAG,IAAI,CAAC,EAAE,CAAC,KAAK,EAAE,CAAC;QAC9B,MAAM,IAAI,GAAG,MAAM,CAAC,mBAAmB,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACpD,KAAK,MAAM,GAAG,IAAI,IAAI,EAAE;YACtB,KAAK,CAAC,GAAG,CAAC,GAAG,EAAE,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;SACjC;QACD,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QACpC,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC/B,MAAM,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;QAC5B,MAAM,KAAK,CAAC,KAAK,EAAE,CAAC;QACpB,IAAI,CAAC,UAAU,EAAE,CAAC;IACpB,CAAC;IAED;;;OAGG;IACI,QAAQ;QACb,IAAI,CAAC,UAAU,EAAE,CAAC;QAClB,OAAO,OAAO,CAAC,OAAO,EAAE,CAAC;IAC3B,CAAC;IAED;;;;;OAKG;IACI,YAAY,CAAC,KAAa,EAAE,kBAA2B;QAC5D,OAAO,IAAI,CAAC,qBAAqB,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,EAAE,kBAAkB,CAAC,CAAC;IAC3E,CAAC;IAED;;OAEG;IACK,UAAU;QAChB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,UAAU,GAAG,SAAS,CAAC;IAC9B,CAAC;IAED;;;;OAIG;IACO,KAAK,CAAC,2BAA2B,CAAC,IAAY,EAAE,KAAa;QACrE,MAAM,GAAG,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QACzD,IAAI,OAAO,GAAG,IAAI,CAAC;QACnB,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC;QAC1B,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACvB,OAAO,KAAK,GAAG,CAAC,EAAE;YAChB,MAAM,OAAO,GAAG,KAAK,GAAG,KAAK,CAAC;YAC9B,MAAM,OAAO,GAAG,MAAM,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,EAAE,EAAE,IAAI,CAAC,CAAC;YACjG,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;YACxC,MAAM,GAAG,GAAG,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CAAC;YACxC,OAAO,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;YACzC,KAAK,IAAI,CAAC,CAAC;YACX,KAAK,KAAK,EAAE,CAAC;YACb,MAAM,QAAQ,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;YACzD,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,OAAO,CAAC;SAChC;IACH,CAAC;IAED;;;;;;;OAOG;IACK,KAAK,CAAC,qBAAqB,CAAC,KAAa,EAAE,KAAa,EAAE,kBAA2B;QAC3F,MAAM,GAAG,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,KAAK,CAAC,CAAC;QACpD,IAAI,kBAAkB,IAAI,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,SAAS,EAAE;YACvD,OAAO,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;SACxB;QACD,MAAM,SAAS,GAAG,MAAM,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;QACxC,IAAI,SAAS,KAAK,SAAS,EAAE;YAC3B,OAAO,SAAS,CAAC;SAClB;QACD,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,GAAG,CAAC,CAAC,CAAC;IACpC,CAAC;IAED;;;;OAIG;IACK,KAAK,CAAC,KAAK,CAAC,GAAW;QAC7B,OAAO,MAAM,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC,KAAK,CAAC,GAAG,EAAE,GAAE,CAAC,CAAC,CAAC;IAChD,CAAC;IAED;;;;OAIG;IACH,6DAA6D;IACtD,KAAK,CAAC,IAAI,CAAC,aAAqB;QACrC,8CAA8C;QAC9C,MAAM,IAAI,CAAC,SAAS,EAAE,CAAC;IACzB,CAAC;IAED;;OAEG;IACI,KAAK,CAAC,UAAU;QACrB,+DAA+D;IACjE,CAAC;IAED;;;OAGG;IACO,KAAK,CAAC,SAAS,CAAC,KAAoC;QAC5D,MAAM,IAAI,GAAG,UAAU,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;QACjF,IAAI,KAAK,EAAE;YACT,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SAC5B;aAAM;YACL,MAAM,IAAI,CAAC,EAAE,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;SACpC;IACH,CAAC;IAED;;;;;;;;;;;;;;OAcG;IACO,KAAK,CAAC,YAAY,CAAC,MAAgB;QAC3C,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC;QAC1C,IAAI,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,GAAG,EAAE,GAAG,IAAI,CAAC,QAAQ,EAAE;YAC1D,MAAM,KAAK,CAAC,6CAA6C,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC;SAC3E;QAED,2BAA2B;QAC3B,IAAI,UAAU,GAAG,SAAS,CAAC;QAC3B,IAAI,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC;QACvB,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE;YACtC,MAAM,QAAQ,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,EAAE,UAAU,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC;YAC1E,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,MAAM,CAAC,CAAC,CAAC,CAAC;SAClC;QAED,IAAI,SAAS,GAAG,UAAU,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACnD,oDAAoD;QACpD,OAAO,KAAK,GAAG,CAAC,EAAE;YAChB,UAAU,KAAK,EAAE,CAAC;YAClB,SAAS,KAAK,EAAE,CAAC;YACjB,sEAAsE;YACtE,KAAK,IAAI,KAAK,GAAG,UAAU,EAAE,KAAK,IAAI,SAAS,EAAE,KAAK,EAAE,EAAE;gBACxD,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,GAAG,EAAE,EAAE,IAAI,CAAC,CAAC;gBACtE,MAAM,GAAG,GAAG,MAAM,IAAI,CAAC,qBAAqB,CAAC,KAAK,EAAE,KAAK,GAAG,EAAE,GAAG,EAAE,EAAE,IAAI,CAAC,CAAC;gBAC3E,MAAM,QAAQ,GAAG,cAAc,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,GAAG,CAAC,EAAE,KAAK,CAAC,CAAC;gBAC7D,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC;aACvD;YAED,KAAK,IAAI,CAAC,CAAC;SACZ;QACD,IAAI,CAAC,UAAU,GAAG,SAAS,GAAG,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;IACtD,CAAC;CACF"}