@across-protocol/sdk 4.3.110 → 4.3.111-alpha.1

package/dist/esm/arch/evm/BlockUtils.js

@@ -1,5 +1,3 @@
-var _a;
-import { __awaiter, __extends, __generator } from "tslib";
 import assert from "assert";
 import { clamp, sortedIndexBy } from "lodash";
 import { chainIsOPStack, getNetworkName } from "../../utils/NetworkUtils";
@@ -9,242 +7,166 @@ import { getCurrentTime } from "../../utils/TimeUtils";
 import { CHAIN_IDs } from "../../constants";
 // Archive requests typically commence at 128 blocks past the head of the chain.
 // Round down to 120 blocks to avoid slipping into archive territory.
-var defaultBlockRange = 120;
+const defaultBlockRange = 120;
 // Default offset to the high block number. This is subtracted from the block number of the high block
 // when it is queried from the network, rather than having been specified by the caller. This is useful
 // since the supplied Provider instance may be backed by multiple RPC providers, which can lead to some
 // providers running slower than others and taking time to synchronise on the latest block.
-var defaultHighBlockOffset = 10;
+const defaultHighBlockOffset = 10;
 // Retain computations for 15 minutes.
-var cacheTTL = 60 * 15;
-var now = getCurrentTime(); // Seed the cache with initial values.
-var blockTimes = (_a = {},
-    _a[CHAIN_IDs.INK] = { average: 1, timestamp: now, blockRange: 1 },
-    _a[CHAIN_IDs.LINEA] = { average: 3, timestamp: now, blockRange: 1 },
-    _a[CHAIN_IDs.MAINNET] = { average: 12.5, timestamp: now, blockRange: 1 },
-    _a[CHAIN_IDs.OPTIMISM] = { average: 2, timestamp: now, blockRange: 1 },
-    _a[CHAIN_IDs.UNICHAIN] = { average: 1, timestamp: now, blockRange: 1 },
-    _a);
+const cacheTTL = 60 * 15;
+const now = getCurrentTime(); // Seed the cache with initial values.
+const blockTimes = {
+    [CHAIN_IDs.INK]: { average: 1, timestamp: now, blockRange: 1 },
+    [CHAIN_IDs.LINEA]: { average: 3, timestamp: now, blockRange: 1 },
+    [CHAIN_IDs.MAINNET]: { average: 12.5, timestamp: now, blockRange: 1 },
+    [CHAIN_IDs.OPTIMISM]: { average: 2, timestamp: now, blockRange: 1 },
+    [CHAIN_IDs.UNICHAIN]: { average: 1, timestamp: now, blockRange: 1 },
+};
 /**
  * @description Compute the average block time over a block range.
  * @returns Average number of seconds per block.
  */
-export function averageBlockTime(provider_1) {
-    return __awaiter(this, arguments, void 0, function (provider, _a) {
-        var chainId, cache, now, earliestBlockNumber, _b, firstBlock, lastBlock, average;
-        var _c;
-        var _d = _a === void 0 ? {} : _a, highBlock = _d.highBlock, highBlockOffset = _d.highBlockOffset, blockRange = _d.blockRange;
-        return __generator(this, function (_e) {
-            switch (_e.label) {
-                case 0: return [4 /*yield*/, provider.getNetwork()];
-                case 1:
-                    chainId = (_e.sent()).chainId;
-                    cache = (_c = blockTimes[chainId]) !== null && _c !== void 0 ? _c : (chainIsOPStack(chainId) ? blockTimes[CHAIN_IDs.OPTIMISM] : undefined);
-                    now = getCurrentTime();
-                    if (isDefined(cache) && now < cache.timestamp + cacheTTL) {
-                        return [2 /*return*/, { average: cache.average, blockRange: cache.blockRange }];
-                    }
-                    if (!!isDefined(highBlock)) return [3 /*break*/, 3];
-                    return [4 /*yield*/, provider.getBlockNumber()];
-                case 2:
-                    highBlock = _e.sent();
-                    highBlock -= highBlockOffset !== null && highBlockOffset !== void 0 ? highBlockOffset : defaultHighBlockOffset;
-                    _e.label = 3;
-                case 3:
-                    blockRange !== null && blockRange !== void 0 ? blockRange : (blockRange = defaultBlockRange);
-                    earliestBlockNumber = highBlock - blockRange;
-                    return [4 /*yield*/, Promise.all([
-                            provider.getBlock(earliestBlockNumber),
-                            provider.getBlock(highBlock),
-                        ])];
-                case 4:
-                    _b = _e.sent(), firstBlock = _b[0], lastBlock = _b[1];
-                    [firstBlock, lastBlock].forEach(function (block) {
-                        if (!isDefined(block === null || block === void 0 ? void 0 : block.timestamp)) {
-                            var network = getNetworkName(chainId);
-                            var blockNumber = block === firstBlock ? earliestBlockNumber : highBlock;
-                            throw new Error("BlockFinder: Failed to fetch block ".concat(blockNumber, " on ").concat(network));
-                        }
-                    });
-                    average = (lastBlock.timestamp - firstBlock.timestamp) / blockRange;
-                    blockTimes[chainId] = { timestamp: now, average: average, blockRange: blockRange };
-                    return [2 /*return*/, { average: average, blockRange: blockRange }];
-            }
-        });
+export async function averageBlockTime(provider, { highBlock, highBlockOffset, blockRange } = {}) {
+    // Does not block for StaticJsonRpcProvider.
+    const { chainId } = await provider.getNetwork();
+    // OP stack chains inherit Optimism block times, but can be overridden.
+    const cache = blockTimes[chainId] ?? (chainIsOPStack(chainId) ? blockTimes[CHAIN_IDs.OPTIMISM] : undefined);
+    const now = getCurrentTime();
+    if (isDefined(cache) && now < cache.timestamp + cacheTTL) {
+        return { average: cache.average, blockRange: cache.blockRange };
+    }
+    // If the caller was not specific about highBlock, resolve it via the RPC provider. Subtract an offset
+    // to account for various RPC provider sync issues that might occur when querting the latest block.
+    if (!isDefined(highBlock)) {
+        highBlock = await provider.getBlockNumber();
+        highBlock -= highBlockOffset ?? defaultHighBlockOffset;
+    }
+    blockRange ??= defaultBlockRange;
+    const earliestBlockNumber = highBlock - blockRange;
+    const [firstBlock, lastBlock] = await Promise.all([
+        provider.getBlock(earliestBlockNumber),
+        provider.getBlock(highBlock),
+    ]);
+    [firstBlock, lastBlock].forEach((block) => {
+        if (!isDefined(block?.timestamp)) {
+            const network = getNetworkName(chainId);
+            const blockNumber = block === firstBlock ? earliestBlockNumber : highBlock;
+            throw new Error(`BlockFinder: Failed to fetch block ${blockNumber} on ${network}`);
+        }
     });
+    const average = (lastBlock.timestamp - firstBlock.timestamp) / blockRange;
+    blockTimes[chainId] = { timestamp: now, average, blockRange };
+    return { average, blockRange };
 }
-function estimateBlocksElapsed(seconds_1) {
-    return __awaiter(this, arguments, void 0, function (seconds, cushionPercentage, provider) {
-        var cushionMultiplier, average;
-        if (cushionPercentage === void 0) { cushionPercentage = 0.0; }
-        return __generator(this, function (_a) {
-            switch (_a.label) {
-                case 0:
-                    cushionMultiplier = cushionPercentage + 1.0;
-                    return [4 /*yield*/, averageBlockTime(provider)];
-                case 1:
-                    average = (_a.sent()).average;
-                    return [2 /*return*/, Math.floor((seconds * cushionMultiplier) / average)];
-            }
-        });
-    });
+async function estimateBlocksElapsed(seconds, cushionPercentage = 0.0, provider) {
+    const cushionMultiplier = cushionPercentage + 1.0;
+    const { average } = await averageBlockTime(provider);
+    return Math.floor((seconds * cushionMultiplier) / average);
 }
-var EVMBlockFinder = /** @class */ (function (_super) {
-    __extends(EVMBlockFinder, _super);
-    function EVMBlockFinder(provider, blocks) {
-        if (blocks === void 0) { blocks = []; }
-        var _this = _super.call(this) || this;
-        _this.provider = provider;
-        _this.blocks = blocks;
-        return _this;
+export class EVMBlockFinder extends BlockFinder {
+    provider;
+    blocks;
+    constructor(provider, blocks = []) {
+        super();
+        this.provider = provider;
+        this.blocks = blocks;
     }
     /**
      * @notice Gets the latest block whose timestamp is <= the provided timestamp.
      * @param number Timestamp timestamp to search.
      * @param hints Optional low and high block to bound the search space.
      */
-    EVMBlockFinder.prototype.getBlockForTimestamp = function (timestamp_1) {
-        return __awaiter(this, arguments, void 0, function (timestamp, hints) {
-            var block, initialBlock, cushion, incrementDistance, _a, _b, multiplier, distance, blockNumber, block, index;
-            var _this = this;
-            if (hints === void 0) { hints = {}; }
-            return __generator(this, function (_c) {
-                switch (_c.label) {
-                    case 0:
-                        timestamp = Number(timestamp);
-                        assert(timestamp !== undefined && timestamp !== null, "timestamp must be provided");
-                        if (!(this.blocks.length === 0 || this.blocks[this.blocks.length - 1].timestamp < timestamp)) return [3 /*break*/, 2];
-                        return [4 /*yield*/, this.getLatestBlock()];
-                    case 1:
-                        block = _c.sent();
-                        if (timestamp >= block.timestamp)
-                            return [2 /*return*/, block];
-                        _c.label = 2;
-                    case 2: 
-                    // Prime the BlockFinder cache with any supplied hints.
-                    // If the hint is accurate, then this will bypass the subsequent estimation.
-                    return [4 /*yield*/, Promise.all(Object.values(hints)
-                            .filter(function (blockNumber) { return isDefined(blockNumber); })
-                            .map(function (blockNumber) { return _this.getBlock(blockNumber); }))];
-                    case 3:
-                        // Prime the BlockFinder cache with any supplied hints.
-                        // If the hint is accurate, then this will bypass the subsequent estimation.
-                        _c.sent();
-                        if (!(this.blocks[0].timestamp > timestamp)) return [3 /*break*/, 8];
-                        initialBlock = this.blocks[0];
-                        cushion = 1;
-                        _b = (_a = Math).max;
-                        // Ensure the increment block distance is _at least_ a single block to prevent an infinite loop.
-                        return [4 /*yield*/, estimateBlocksElapsed(initialBlock.timestamp - timestamp, cushion, this.provider)];
-                    case 4:
-                        incrementDistance = _b.apply(_a, [
-                            // Ensure the increment block distance is _at least_ a single block to prevent an infinite loop.
-                            _c.sent(), 1]);
-                        multiplier = 1;
-                        _c.label = 5;
-                    case 5:
-                        distance = multiplier * incrementDistance;
-                        blockNumber = Math.max(0, initialBlock.number - distance);
-                        return [4 /*yield*/, this.getBlock(blockNumber)];
-                    case 6:
-                        block = _c.sent();
-                        if (block.timestamp <= timestamp)
-                            return [3 /*break*/, 8]; // Found an earlier block.
-                        assert(blockNumber > 0, "timestamp is before block 0"); // Block 0 was not earlier than this timestamp. The row.
-                        _c.label = 7;
-                    case 7:
-                        multiplier++;
-                        return [3 /*break*/, 5];
-                    case 8:
-                        index = sortedIndexBy(this.blocks, { timestamp: timestamp }, "timestamp");
-                        return [2 /*return*/, this.findBlock(this.blocks[index - 1], this.blocks[index], timestamp)];
-                }
-            });
-        });
-    };
+    async getBlockForTimestamp(timestamp, hints = {}) {
+        timestamp = Number(timestamp);
+        assert(timestamp !== undefined && timestamp !== null, "timestamp must be provided");
+        // If the last block we have stored is too early, grab the latest block.
+        if (this.blocks.length === 0 || this.blocks[this.blocks.length - 1].timestamp < timestamp) {
+            const block = await this.getLatestBlock();
+            if (timestamp >= block.timestamp)
+                return block;
+        }
+        // Prime the BlockFinder cache with any supplied hints.
+        // If the hint is accurate, then this will bypass the subsequent estimation.
+        await Promise.all(Object.values(hints)
+            .filter((blockNumber) => isDefined(blockNumber))
+            .map((blockNumber) => this.getBlock(blockNumber)));
+        // Check the first block. If it's greater than our timestamp, we need to find an earlier block.
+        if (this.blocks[0].timestamp > timestamp) {
+            const initialBlock = this.blocks[0];
+            // We use a 2x cushion to reduce the number of iterations in the following loop and increase the chance
+            // that the first block we find sets a floor for the target timestamp. The loop converges on the correct block
+            // slower than the following incremental search performed by `findBlock`, so we want to minimize the number of
+            // loop iterations in favor of searching more blocks over the `findBlock` search.
+            const cushion = 1;
+            const incrementDistance = Math.max(
+            // Ensure the increment block distance is _at least_ a single block to prevent an infinite loop.
+            await estimateBlocksElapsed(initialBlock.timestamp - timestamp, cushion, this.provider), 1);
+            // Search backwards by a constant increment until we find a block before the timestamp or hit block 0.
+            for (let multiplier = 1;; multiplier++) {
+                const distance = multiplier * incrementDistance;
+                const blockNumber = Math.max(0, initialBlock.number - distance);
+                const block = await this.getBlock(blockNumber);
+                if (block.timestamp <= timestamp)
+                    break; // Found an earlier block.
+                assert(blockNumber > 0, "timestamp is before block 0"); // Block 0 was not earlier than this timestamp. The row.
+            }
+        }
+        // Find the index where the block would be inserted and use that as the end block (since it is >= the timestamp).
+        const index = sortedIndexBy(this.blocks, { timestamp }, "timestamp");
+        return this.findBlock(this.blocks[index - 1], this.blocks[index], timestamp);
+    }
     // Grabs the most recent block and caches it.
-    EVMBlockFinder.prototype.getLatestBlock = function () {
-        return __awaiter(this, void 0, void 0, function () {
-            var block, index;
-            var _a;
-            return __generator(this, function (_b) {
-                switch (_b.label) {
-                    case 0: return [4 /*yield*/, this.provider.getBlock("latest")];
-                    case 1:
-                        block = _b.sent();
-                        index = sortedIndexBy(this.blocks, block, "number");
-                        if (((_a = this.blocks[index]) === null || _a === void 0 ? void 0 : _a.number) !== block.number)
-                            this.blocks.splice(index, 0, block);
-                        return [2 /*return*/, this.blocks[index]];
-                }
-            });
-        });
-    };
+    async getLatestBlock() {
+        const block = await this.provider.getBlock("latest");
+        const index = sortedIndexBy(this.blocks, block, "number");
+        if (this.blocks[index]?.number !== block.number)
+            this.blocks.splice(index, 0, block);
+        return this.blocks[index];
+    }
     // Grabs the block for a particular number and caches it.
-    EVMBlockFinder.prototype.getBlock = function (number) {
-        return __awaiter(this, void 0, void 0, function () {
-            var index, block;
-            var _a, _b;
-            return __generator(this, function (_c) {
-                switch (_c.label) {
-                    case 0:
-                        index = sortedIndexBy(this.blocks, { number: number }, "number");
-                        if (((_a = this.blocks[index]) === null || _a === void 0 ? void 0 : _a.number) === number)
-                            return [2 /*return*/, this.blocks[index]]; // Return early if block already exists.
-                        return [4 /*yield*/, this.provider.getBlock(number)];
-                    case 1:
-                        block = _c.sent();
-                        // Recompute the index after the async call since the state of this.blocks could have changed!
-                        index = sortedIndexBy(this.blocks, { number: number }, "number");
-                        // Rerun this check to avoid duplicate insertion.
-                        if (((_b = this.blocks[index]) === null || _b === void 0 ? void 0 : _b.number) === number)
-                            return [2 /*return*/, this.blocks[index]];
-                        this.blocks.splice(index, 0, block); // A simple insert at index.
-                        return [2 /*return*/, block];
-                }
-            });
-        });
-    };
+    async getBlock(number) {
+        let index = sortedIndexBy(this.blocks, { number }, "number");
+        if (this.blocks[index]?.number === number)
+            return this.blocks[index]; // Return early if block already exists.
+        const block = await this.provider.getBlock(number);
+        // Recompute the index after the async call since the state of this.blocks could have changed!
+        index = sortedIndexBy(this.blocks, { number }, "number");
+        // Rerun this check to avoid duplicate insertion.
+        if (this.blocks[index]?.number === number)
+            return this.blocks[index];
+        this.blocks.splice(index, 0, block); // A simple insert at index.
+        return block;
+    }
     // Return the latest block, between startBlock and endBlock, whose timestamp is <= timestamp.
     // Effectively, this is an interpolation search algorithm to minimize block requests.
     // Note: startBlock and endBlock _must_ be different blocks.
-    EVMBlockFinder.prototype.findBlock = function (_startBlock, _endBlock, timestamp) {
-        return __awaiter(this, void 0, void 0, function () {
-            var _a, startBlock, endBlock, totalTimeDifference, totalBlockDistance, blockPercentile, estimatedBlock, newBlock;
-            return __generator(this, function (_b) {
-                switch (_b.label) {
-                    case 0:
-                        _a = [_startBlock, _endBlock], startBlock = _a[0], endBlock = _a[1];
-                        // In the case of equality, the endBlock is expected to be passed as the one whose timestamp === the requested
-                        // timestamp.
-                        if (endBlock.timestamp === timestamp)
-                            return [2 /*return*/, endBlock];
-                        // If there's no equality, but the blocks are adjacent, return the startBlock, since we want the returned block's
-                        // timestamp to be <= the requested timestamp.
-                        if (endBlock.number === startBlock.number + 1)
-                            return [2 /*return*/, startBlock];
-                        assert(endBlock.number !== startBlock.number, "startBlock cannot equal endBlock");
-                        assert(timestamp < endBlock.timestamp && timestamp > startBlock.timestamp, "timestamp not in between start and end blocks");
-                        totalTimeDifference = endBlock.timestamp - startBlock.timestamp;
-                        totalBlockDistance = endBlock.number - startBlock.number;
-                        blockPercentile = (timestamp - startBlock.timestamp) / totalTimeDifference;
-                        estimatedBlock = startBlock.number + Math.round(blockPercentile * totalBlockDistance);
-                        return [4 /*yield*/, this.getBlock(clamp(estimatedBlock, startBlock.number + 1, endBlock.number - 1))];
-                    case 1:
-                        newBlock = _b.sent();
-                        // Depending on whether the new block is below or above the timestamp, narrow the search space accordingly.
-                        if (newBlock.timestamp < timestamp) {
-                            return [2 /*return*/, this.findBlock(newBlock, endBlock, timestamp)];
-                        }
-                        else {
-                            return [2 /*return*/, this.findBlock(startBlock, newBlock, timestamp)];
-                        }
-                        return [2 /*return*/];
-                }
-            });
-        });
-    };
-    return EVMBlockFinder;
-}(BlockFinder));
-export { EVMBlockFinder };
+    async findBlock(_startBlock, _endBlock, timestamp) {
+        const [startBlock, endBlock] = [_startBlock, _endBlock];
+        // In the case of equality, the endBlock is expected to be passed as the one whose timestamp === the requested
+        // timestamp.
+        if (endBlock.timestamp === timestamp)
+            return endBlock;
+        // If there's no equality, but the blocks are adjacent, return the startBlock, since we want the returned block's
+        // timestamp to be <= the requested timestamp.
+        if (endBlock.number === startBlock.number + 1)
+            return startBlock;
+        assert(endBlock.number !== startBlock.number, "startBlock cannot equal endBlock");
+        assert(timestamp < endBlock.timestamp && timestamp > startBlock.timestamp, "timestamp not in between start and end blocks");
+        // Interpolating the timestamp we're searching for to block numbers.
+        const totalTimeDifference = endBlock.timestamp - startBlock.timestamp;
+        const totalBlockDistance = endBlock.number - startBlock.number;
+        const blockPercentile = (timestamp - startBlock.timestamp) / totalTimeDifference;
+        const estimatedBlock = startBlock.number + Math.round(blockPercentile * totalBlockDistance);
+        // Clamp ensures the estimated block is strictly greater than the start block and strictly less than the end block.
+        const newBlock = await this.getBlock(clamp(estimatedBlock, startBlock.number + 1, endBlock.number - 1));
+        // Depending on whether the new block is below or above the timestamp, narrow the search space accordingly.
+        if (newBlock.timestamp < timestamp) {
+            return this.findBlock(newBlock, endBlock, timestamp);
+        }
+        else {
+            return this.findBlock(startBlock, newBlock, timestamp);
+        }
+    }
+}
 //# sourceMappingURL=BlockUtils.js.map

package/dist/esm/arch/evm/BlockUtils.js.map

@@ -1 +1 @@
-{"version":3,"file":"BlockUtils.js","sourceRoot":"","sources":["../../../../src/arch/evm/BlockUtils.ts"],"names":[],"mappings":";;AAAA,OAAO,MAAM,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,KAAK,EAAE,aAAa,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAC1E,OAAO,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AACnD,OAAO,EACL,WAAW,GAKZ,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAK5C,gFAAgF;AAChF,qEAAqE;AACrE,IAAM,iBAAiB,GAAG,GAAG,CAAC;AAE9B,sGAAsG;AACtG,uGAAuG;AACvG,uGAAuG;AACvG,2FAA2F;AAC3F,IAAM,sBAAsB,GAAG,EAAE,CAAC;AAElC,sCAAsC;AACtC,IAAM,QAAQ,GAAG,EAAE,GAAG,EAAE,CAAC;AACzB,IAAM,GAAG,GAAG,cAAc,EAAE,CAAC,CAAC,sCAAsC;AACpE,IAAM,UAAU;IACd,GAAC,SAAS,CAAC,GAAG,IAAG,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE;IAC9D,GAAC,SAAS,CAAC,KAAK,IAAG,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE;IAChE,GAAC,SAAS,CAAC,OAAO,IAAG,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE;IACrE,GAAC,SAAS,CAAC,QAAQ,IAAG,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE;IACnE,GAAC,SAAS,CAAC,QAAQ,IAAG,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE;OACpE,CAAC;AAEF;;;GAGG;AACH,MAAM,UAAgB,gBAAgB;wDACpC,QAAkB,EAClB,EAAqD;;;YAArD,qBAAmD,EAAE,KAAA,EAAnD,SAAS,eAAA,EAAE,eAAe,qBAAA,EAAE,UAAU,gBAAA;;;wBAGpB,qBAAM,QAAQ,CAAC,UAAU,EAAE,EAAA;;oBAAvC,OAAO,GAAK,CAAA,SAA2B,CAAA,QAAhC;oBAGT,KAAK,GAAG,MAAA,UAAU,CAAC,OAAO,CAAC,mCAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;oBAEtG,GAAG,GAAG,cAAc,EAAE,CAAC;oBAC7B,IAAI,SAAS,CAAC,KAAK,CAAC,IAAI,GAAG,GAAG,KAAK,CAAC,SAAS,GAAG,QAAQ,EAAE,CAAC;wBACzD,sBAAO,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,EAAC;oBAClE,CAAC;yBAIG,CAAC,SAAS,CAAC,SAAS,CAAC,EAArB,wBAAqB;oBACX,qBAAM,QAAQ,CAAC,cAAc,EAAE,EAAA;;oBAA3C,SAAS,GAAG,SAA+B,CAAC;oBAC5C,SAAS,IAAI,eAAe,aAAf,eAAe,cAAf,eAAe,GAAI,sBAAsB,CAAC;;;oBAEzD,UAAU,aAAV,UAAU,cAAV,UAAU,IAAV,UAAU,GAAK,iBAAiB,EAAC;oBAE3B,mBAAmB,GAAG,SAAS,GAAG,UAAU,CAAC;oBACnB,qBAAM,OAAO,CAAC,GAAG,CAAC;4BAChD,QAAQ,CAAC,QAAQ,CAAC,mBAAmB,CAAC;4BACtC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC;yBAC7B,CAAC,EAAA;;oBAHI,KAA0B,SAG9B,EAHK,UAAU,QAAA,EAAE,SAAS,QAAA;oBAI5B,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC,OAAO,CAAC,UAAC,KAAwB;wBACvD,IAAI,CAAC,SAAS,CAAC,KAAK,aAAL,KAAK,uBAAL,KAAK,CAAE,SAAS,CAAC,EAAE,CAAC;4BACjC,IAAM,OAAO,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;4BACxC,IAAM,WAAW,GAAG,KAAK,KAAK,UAAU,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,SAAS,CAAC;4BAC3E,MAAM,IAAI,KAAK,CAAC,6CAAsC,WAAW,iBAAO,OAAO,CAAE,CAAC,CAAC;wBACrF,CAAC;oBACH,CAAC,CAAC,CAAC;oBAEG,OAAO,GAAG,CAAC,SAAS,CAAC,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC,GAAG,UAAU,CAAC;oBAC1E,UAAU,CAAC,OAAO,CAAC,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,OAAO,SAAA,EAAE,UAAU,YAAA,EAAE,CAAC;oBAE9D,sBAAO,EAAE,OAAO,SAAA,EAAE,UAAU,YAAA,EAAE,EAAC;;;;CAChC;AAED,SAAe,qBAAqB;wDAAC,OAAe,EAAE,iBAAuB,EAAE,QAAkB;;QAA3C,kCAAA,EAAA,uBAAuB;;;;oBACrE,iBAAiB,GAAG,iBAAiB,GAAG,GAAG,CAAC;oBAC9B,qBAAM,gBAAgB,CAAC,QAAQ,CAAC,EAAA;;oBAA5C,OAAO,GAAK,CAAA,SAAgC,CAAA,QAArC;oBACf,sBAAO,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,GAAG,iBAAiB,CAAC,GAAG,OAAO,CAAC,EAAC;;;;CAC5D;AAED;IAAoC,kCAAqB;IACvD,wBACmB,QAAkB,EAClB,MAAuB;QAAvB,uBAAA,EAAA,WAAuB;QAExC,YAAA,MAAK,WAAE,SAAC;QAHS,cAAQ,GAAR,QAAQ,CAAU;QAClB,YAAM,GAAN,MAAM,CAAiB;;IAG1C,CAAC;IAED;;;;OAIG;IACU,6CAAoB,GAAjC;4DAAkC,SAA0B,EAAE,KAA4B;;;YAA5B,sBAAA,EAAA,UAA4B;;;;wBACxF,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;wBAC9B,MAAM,CAAC,SAAS,KAAK,SAAS,IAAI,SAAS,KAAK,IAAI,EAAE,4BAA4B,CAAC,CAAC;6BAEhF,CAAA,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,SAAS,GAAG,SAAS,CAAA,EAArF,wBAAqF;wBACzE,qBAAM,IAAI,CAAC,cAAc,EAAE,EAAA;;wBAAnC,KAAK,GAAG,SAA2B;wBACzC,IAAI,SAAS,IAAI,KAAK,CAAC,SAAS;4BAAE,sBAAO,KAAK,EAAC;;;oBAGjD,uDAAuD;oBACvD,4EAA4E;oBAC5E,qBAAM,OAAO,CAAC,GAAG,CACf,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;6BACjB,MAAM,CAAC,UAAC,WAAW,IAAK,OAAA,SAAS,CAAC,WAAW,CAAC,EAAtB,CAAsB,CAAC;6BAC/C,GAAG,CAAC,UAAC,WAAW,IAAK,OAAA,KAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,EAA1B,CAA0B,CAAC,CACpD,EAAA;;wBAND,uDAAuD;wBACvD,4EAA4E;wBAC5E,SAIC,CAAC;6BAGE,CAAA,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,SAAS,CAAA,EAApC,wBAAoC;wBAChC,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;wBAK9B,OAAO,GAAG,CAAC,CAAC;wBACQ,KAAA,CAAA,KAAA,IAAI,CAAA,CAAC,GAAG,CAAA;wBAChC,gGAAgG;wBAChG,qBAAM,qBAAqB,CAAC,YAAY,CAAC,SAAS,GAAG,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,EAAA;;wBAFnF,iBAAiB,GAAG;4BACxB,gGAAgG;4BAChG,SAAuF,EACvF,CAAC,EACF;wBAGQ,UAAU,GAAG,CAAC;;;wBACf,QAAQ,GAAG,UAAU,GAAG,iBAAiB,CAAC;wBAC1C,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;wBAClD,qBAAM,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,EAAA;;wBAAxC,KAAK,GAAG,SAAgC;wBAC9C,IAAI,KAAK,CAAC,SAAS,IAAI,SAAS;4BAAE,wBAAM,CAAC,0BAA0B;wBACnE,MAAM,CAAC,WAAW,GAAG,CAAC,EAAE,6BAA6B,CAAC,CAAC,CAAC,wDAAwD;;;wBALvF,UAAU,EAAE,CAAA;;;wBAUnC,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,SAAS,WAAA,EAAW,EAAE,WAAW,CAAC,CAAC;wBAC9E,sBAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC,EAAC;;;;KAC9E;IAED,6CAA6C;IAC/B,uCAAc,GAA5B;;;;;;4BACgB,qBAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAA;;wBAA9C,KAAK,GAAG,SAAsC;wBAC9C,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;wBAC1D,IAAI,CAAA,MAAA,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,0CAAE,MAAM,MAAK,KAAK,CAAC,MAAM;4BAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;wBACrF,sBAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAC;;;;KAC3B;IAED,yDAAyD;IAC3C,iCAAQ,GAAtB,UAAuB,MAAc;;;;;;;wBAC/B,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,MAAM,QAAA,EAAW,EAAE,QAAQ,CAAC,CAAC;wBACtE,IAAI,CAAA,MAAA,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,0CAAE,MAAM,MAAK,MAAM;4BAAE,sBAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAC,CAAC,wCAAwC;wBAChG,qBAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAA;;wBAA5C,KAAK,GAAG,SAAoC;wBAElD,8FAA8F;wBAC9F,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,MAAM,QAAA,EAAW,EAAE,QAAQ,CAAC,CAAC;wBAElE,iDAAiD;wBACjD,IAAI,CAAA,MAAA,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,0CAAE,MAAM,MAAK,MAAM;4BAAE,sBAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAC;wBACrE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,4BAA4B;wBACjE,sBAAO,KAAK,EAAC;;;;KACd;IAED,6FAA6F;IAC7F,qFAAqF;IACrF,4DAA4D;IAC9C,kCAAS,GAAvB,UAAwB,WAAqB,EAAE,SAAmB,EAAE,SAAiB;;;;;;wBAC7E,KAAyB,CAAC,WAAW,EAAE,SAAS,CAAC,EAAhD,UAAU,QAAA,EAAE,QAAQ,QAAA,CAA6B;wBACxD,8GAA8G;wBAC9G,aAAa;wBACb,IAAI,QAAQ,CAAC,SAAS,KAAK,SAAS;4BAAE,sBAAO,QAAQ,EAAC;wBAEtD,iHAAiH;wBACjH,8CAA8C;wBAC9C,IAAI,QAAQ,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM,GAAG,CAAC;4BAAE,sBAAO,UAAU,EAAC;wBAEjE,MAAM,CAAC,QAAQ,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM,EAAE,kCAAkC,CAAC,CAAC;wBAClF,MAAM,CACJ,SAAS,GAAG,QAAQ,CAAC,SAAS,IAAI,SAAS,GAAG,UAAU,CAAC,SAAS,EAClE,+CAA+C,CAChD,CAAC;wBAGI,mBAAmB,GAAG,QAAQ,CAAC,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC;wBAChE,kBAAkB,GAAG,QAAQ,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC;wBACzD,eAAe,GAAG,CAAC,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC,GAAG,mBAAmB,CAAC;wBAC3E,cAAc,GAAG,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,kBAAkB,CAAC,CAAC;wBAG3E,qBAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,EAAE,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,EAAA;;wBAAjG,QAAQ,GAAG,SAAsF;wBAEvG,2GAA2G;wBAC3G,IAAI,QAAQ,CAAC,SAAS,GAAG,SAAS,EAAE,CAAC;4BACnC,sBAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,EAAC;wBACvD,CAAC;6BAAM,CAAC;4BACN,sBAAO,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,QAAQ,EAAE,SAAS,CAAC,EAAC;wBACzD,CAAC;;;;;KACF;IACH,qBAAC;AAAD,CAAC,AArHD,CAAoC,WAAW,GAqH9C"}
+{"version":3,"file":"BlockUtils.js","sourceRoot":"","sources":["../../../../src/arch/evm/BlockUtils.ts"],"names":[],"mappings":"AAAA,OAAO,MAAM,MAAM,QAAQ,CAAC;AAE5B,OAAO,EAAE,KAAK,EAAE,aAAa,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,cAAc,EAAE,cAAc,EAAE,MAAM,0BAA0B,CAAC;AAC1E,OAAO,EAAE,SAAS,EAAE,MAAM,wBAAwB,CAAC;AACnD,OAAO,EACL,WAAW,GAKZ,MAAM,yBAAyB,CAAC;AACjC,OAAO,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AACvD,OAAO,EAAE,SAAS,EAAE,MAAM,iBAAiB,CAAC;AAK5C,gFAAgF;AAChF,qEAAqE;AACrE,MAAM,iBAAiB,GAAG,GAAG,CAAC;AAE9B,sGAAsG;AACtG,uGAAuG;AACvG,uGAAuG;AACvG,2FAA2F;AAC3F,MAAM,sBAAsB,GAAG,EAAE,CAAC;AAElC,sCAAsC;AACtC,MAAM,QAAQ,GAAG,EAAE,GAAG,EAAE,CAAC;AACzB,MAAM,GAAG,GAAG,cAAc,EAAE,CAAC,CAAC,sCAAsC;AACpE,MAAM,UAAU,GAA4C;IAC1D,CAAC,SAAS,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE;IAC9D,CAAC,SAAS,CAAC,KAAK,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE;IAChE,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,EAAE,OAAO,EAAE,IAAI,EAAE,SAAS,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE;IACrE,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE;IACnE,CAAC,SAAS,CAAC,QAAQ,CAAC,EAAE,EAAE,OAAO,EAAE,CAAC,EAAE,SAAS,EAAE,GAAG,EAAE,UAAU,EAAE,CAAC,EAAE;CACpE,CAAC;AAEF;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,gBAAgB,CACpC,QAAkB,EAClB,EAAE,SAAS,EAAE,eAAe,EAAE,UAAU,KAAW,EAAE;IAErD,4CAA4C;IAC5C,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,QAAQ,CAAC,UAAU,EAAE,CAAC;IAEhD,uEAAuE;IACvE,MAAM,KAAK,GAAG,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,SAAS,CAAC,QAAQ,CAAC,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAE5G,MAAM,GAAG,GAAG,cAAc,EAAE,CAAC;IAC7B,IAAI,SAAS,CAAC,KAAK,CAAC,IAAI,GAAG,GAAG,KAAK,CAAC,SAAS,GAAG,QAAQ,EAAE,CAAC;QACzD,OAAO,EAAE,OAAO,EAAE,KAAK,CAAC,OAAO,EAAE,UAAU,EAAE,KAAK,CAAC,UAAU,EAAE,CAAC;IAClE,CAAC;IAED,sGAAsG;IACtG,mGAAmG;IACnG,IAAI,CAAC,SAAS,CAAC,SAAS,CAAC,EAAE,CAAC;QAC1B,SAAS,GAAG,MAAM,QAAQ,CAAC,cAAc,EAAE,CAAC;QAC5C,SAAS,IAAI,eAAe,IAAI,sBAAsB,CAAC;IACzD,CAAC;IACD,UAAU,KAAK,iBAAiB,CAAC;IAEjC,MAAM,mBAAmB,GAAG,SAAS,GAAG,UAAU,CAAC;IACnD,MAAM,CAAC,UAAU,EAAE,SAAS,CAAC,GAAG,MAAM,OAAO,CAAC,GAAG,CAAC;QAChD,QAAQ,CAAC,QAAQ,CAAC,mBAAmB,CAAC;QACtC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC;KAC7B,CAAC,CAAC;IACH,CAAC,UAAU,EAAE,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC,KAAwB,EAAE,EAAE;QAC3D,IAAI,CAAC,SAAS,CAAC,KAAK,EAAE,SAAS,CAAC,EAAE,CAAC;YACjC,MAAM,OAAO,GAAG,cAAc,CAAC,OAAO,CAAC,CAAC;YACxC,MAAM,WAAW,GAAG,KAAK,KAAK,UAAU,CAAC,CAAC,CAAC,mBAAmB,CAAC,CAAC,CAAC,SAAS,CAAC;YAC3E,MAAM,IAAI,KAAK,CAAC,sCAAsC,WAAW,OAAO,OAAO,EAAE,CAAC,CAAC;QACrF,CAAC;IACH,CAAC,CAAC,CAAC;IAEH,MAAM,OAAO,GAAG,CAAC,SAAS,CAAC,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC,GAAG,UAAU,CAAC;IAC1E,UAAU,CAAC,OAAO,CAAC,GAAG,EAAE,SAAS,EAAE,GAAG,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;IAE9D,OAAO,EAAE,OAAO,EAAE,UAAU,EAAE,CAAC;AACjC,CAAC;AAED,KAAK,UAAU,qBAAqB,CAAC,OAAe,EAAE,iBAAiB,GAAG,GAAG,EAAE,QAAkB;IAC/F,MAAM,iBAAiB,GAAG,iBAAiB,GAAG,GAAG,CAAC;IAClD,MAAM,EAAE,OAAO,EAAE,GAAG,MAAM,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IACrD,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,OAAO,GAAG,iBAAiB,CAAC,GAAG,OAAO,CAAC,CAAC;AAC7D,CAAC;AAED,MAAM,OAAO,cAAe,SAAQ,WAAqB;IAEpC;IACA;IAFnB,YACmB,QAAkB,EAClB,SAAqB,EAAE;QAExC,KAAK,EAAE,CAAC;QAHS,aAAQ,GAAR,QAAQ,CAAU;QAClB,WAAM,GAAN,MAAM,CAAiB;IAG1C,CAAC;IAED;;;;OAIG;IACI,KAAK,CAAC,oBAAoB,CAAC,SAA0B,EAAE,QAA0B,EAAE;QACxF,SAAS,GAAG,MAAM,CAAC,SAAS,CAAC,CAAC;QAC9B,MAAM,CAAC,SAAS,KAAK,SAAS,IAAI,SAAS,KAAK,IAAI,EAAE,4BAA4B,CAAC,CAAC;QACpF,wEAAwE;QACxE,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,SAAS,GAAG,SAAS,EAAE,CAAC;YAC1F,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,cAAc,EAAE,CAAC;YAC1C,IAAI,SAAS,IAAI,KAAK,CAAC,SAAS;gBAAE,OAAO,KAAK,CAAC;QACjD,CAAC;QAED,uDAAuD;QACvD,4EAA4E;QAC5E,MAAM,OAAO,CAAC,GAAG,CACf,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC;aACjB,MAAM,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;aAC/C,GAAG,CAAC,CAAC,WAAW,EAAE,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC,CACpD,CAAC;QAEF,+FAA+F;QAC/F,IAAI,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,SAAS,GAAG,SAAS,EAAE,CAAC;YACzC,MAAM,YAAY,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;YACpC,uGAAuG;YACvG,8GAA8G;YAC9G,8GAA8G;YAC9G,iFAAiF;YACjF,MAAM,OAAO,GAAG,CAAC,CAAC;YAClB,MAAM,iBAAiB,GAAG,IAAI,CAAC,GAAG;YAChC,gGAAgG;YAChG,MAAM,qBAAqB,CAAC,YAAY,CAAC,SAAS,GAAG,SAAS,EAAE,OAAO,EAAE,IAAI,CAAC,QAAQ,CAAC,EACvF,CAAC,CACF,CAAC;YAEF,sGAAsG;YACtG,KAAK,IAAI,UAAU,GAAG,CAAC,GAAI,UAAU,EAAE,EAAE,CAAC;gBACxC,MAAM,QAAQ,GAAG,UAAU,GAAG,iBAAiB,CAAC;gBAChD,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,MAAM,GAAG,QAAQ,CAAC,CAAC;gBAChE,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,WAAW,CAAC,CAAC;gBAC/C,IAAI,KAAK,CAAC,SAAS,IAAI,SAAS;oBAAE,MAAM,CAAC,0BAA0B;gBACnE,MAAM,CAAC,WAAW,GAAG,CAAC,EAAE,6BAA6B,CAAC,CAAC,CAAC,wDAAwD;YAClH,CAAC;QACH,CAAC;QAED,iHAAiH;QACjH,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,SAAS,EAAW,EAAE,WAAW,CAAC,CAAC;QAC9E,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,KAAK,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,SAAS,CAAC,CAAC;IAC/E,CAAC;IAED,6CAA6C;IACrC,KAAK,CAAC,cAAc;QAC1B,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,CAAC;QACrD,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,EAAE,QAAQ,CAAC,CAAC;QAC1D,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,MAAM,KAAK,KAAK,CAAC,MAAM;YAAE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC;QACrF,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;IAC5B,CAAC;IAED,yDAAyD;IACjD,KAAK,CAAC,QAAQ,CAAC,MAAc;QACnC,IAAI,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,MAAM,EAAW,EAAE,QAAQ,CAAC,CAAC;QACtE,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,MAAM,KAAK,MAAM;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC,wCAAwC;QAC9G,MAAM,KAAK,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC;QAEnD,8FAA8F;QAC9F,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,MAAM,EAAE,EAAE,MAAM,EAAW,EAAE,QAAQ,CAAC,CAAC;QAElE,iDAAiD;QACjD,IAAI,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,MAAM,KAAK,MAAM;YAAE,OAAO,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QACrE,IAAI,CAAC,MAAM,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,CAAC,4BAA4B;QACjE,OAAO,KAAK,CAAC;IACf,CAAC;IAED,6FAA6F;IAC7F,qFAAqF;IACrF,4DAA4D;IACpD,KAAK,CAAC,SAAS,CAAC,WAAqB,EAAE,SAAmB,EAAE,SAAiB;QACnF,MAAM,CAAC,UAAU,EAAE,QAAQ,CAAC,GAAG,CAAC,WAAW,EAAE,SAAS,CAAC,CAAC;QACxD,8GAA8G;QAC9G,aAAa;QACb,IAAI,QAAQ,CAAC,SAAS,KAAK,SAAS;YAAE,OAAO,QAAQ,CAAC;QAEtD,iHAAiH;QACjH,8CAA8C;QAC9C,IAAI,QAAQ,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,UAAU,CAAC;QAEjE,MAAM,CAAC,QAAQ,CAAC,MAAM,KAAK,UAAU,CAAC,MAAM,EAAE,kCAAkC,CAAC,CAAC;QAClF,MAAM,CACJ,SAAS,GAAG,QAAQ,CAAC,SAAS,IAAI,SAAS,GAAG,UAAU,CAAC,SAAS,EAClE,+CAA+C,CAChD,CAAC;QAEF,oEAAoE;QACpE,MAAM,mBAAmB,GAAG,QAAQ,CAAC,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC;QACtE,MAAM,kBAAkB,GAAG,QAAQ,CAAC,MAAM,GAAG,UAAU,CAAC,MAAM,CAAC;QAC/D,MAAM,eAAe,GAAG,CAAC,SAAS,GAAG,UAAU,CAAC,SAAS,CAAC,GAAG,mBAAmB,CAAC;QACjF,MAAM,cAAc,GAAG,UAAU,CAAC,MAAM,GAAG,IAAI,CAAC,KAAK,CAAC,eAAe,GAAG,kBAAkB,CAAC,CAAC;QAE5F,mHAAmH;QACnH,MAAM,QAAQ,GAAG,MAAM,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,cAAc,EAAE,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC;QAExG,2GAA2G;QAC3G,IAAI,QAAQ,CAAC,SAAS,GAAG,SAAS,EAAE,CAAC;YACnC,OAAO,IAAI,CAAC,SAAS,CAAC,QAAQ,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;QACvD,CAAC;aAAM,CAAC;YACN,OAAO,IAAI,CAAC,SAAS,CAAC,UAAU,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;QACzD,CAAC;IACH,CAAC;CACF"}