@across-protocol/sdk 4.1.63-beta.1 → 4.1.63-beta.3

package/src/relayFeeCalculator/relayFeeCalculator.ts

@@ -1,5 +1,9 @@
 import assert from "assert";
-import { DEFAULT_SIMULATED_RELAYER_ADDRESS, TOKEN_SYMBOLS_MAP } from "../constants";
+import {
+  DEFAULT_SIMULATED_RELAYER_ADDRESS,
+  DEFAULT_SIMULATED_RELAYER_ADDRESS_SVM,
+  TOKEN_SYMBOLS_MAP,
+} from "../constants";
 import { Deposit } from "../interfaces";
 import {
   BigNumber,
@@ -18,6 +22,7 @@ import {
   toBNWei,
   isZeroAddress,
   compareAddressesSimple,
+  chainIsSvm,
 } from "../utils";
 import { Transport } from "viem";
 
@@ -36,6 +41,7 @@ export interface QueryInterface {
     }>
   ) => Promise<TransactionCostEstimate>;
   getTokenPrice: (tokenSymbol: string) => Promise<number>;
+  getNativeGasCost: (deposit: Omit<Deposit, "messageHash">, relayer: string) => Promise<BigNumber>;
 }
 
 export const expectedCapitalCostsKeys = ["lowerBound", "upperBound", "cutoff", "decimals"];
@@ -105,6 +111,12 @@ export const DEFAULT_LOGGER: Logger = {
   error: (...args) => console.error(args),
 };
 
+export function getDefaultSimulatedRelayerAddress(chainId?: number) {
+  return isDefined(chainId) && chainIsSvm(chainId)
+    ? DEFAULT_SIMULATED_RELAYER_ADDRESS_SVM
+    : DEFAULT_SIMULATED_RELAYER_ADDRESS;
+}
+
 // Small amount to simulate filling with. Should be low enough to guarantee a successful fill.
 const safeOutputAmount = toBN(100);
 
@@ -241,7 +253,7 @@ export class RelayFeeCalculator {
     deposit: Deposit,
     amountToRelay: BigNumberish,
     simulateZeroFill = false,
-    relayerAddress = DEFAULT_SIMULATED_RELAYER_ADDRESS,
+    relayerAddress = getDefaultSimulatedRelayerAddress(deposit.destinationChainId),
     _tokenPrice?: number,
     tokenMapping = TOKEN_SYMBOLS_MAP,
     gasPrice?: BigNumberish,
@@ -480,7 +492,7 @@ export class RelayFeeCalculator {
     deposit: Deposit,
     amountToRelay?: BigNumberish,
     simulateZeroFill = false,
-    relayerAddress = DEFAULT_SIMULATED_RELAYER_ADDRESS,
+    relayerAddress = getDefaultSimulatedRelayerAddress(deposit.destinationChainId),
     _tokenPrice?: number,
     gasPrice?: BigNumberish,
     gasUnits?: BigNumberish,

package/src/utils/BlockFinder.ts

@@ -0,0 +1,26 @@
+export type BlockFinderOpts = {
+  highBlock?: number;
+  highBlockOffset?: number;
+  blockRange?: number;
+};
+
+export type BlockTimeAverage = {
+  average: number;
+  blockRange: number;
+  timestamp: number;
+};
+
+export interface Block {
+  hash: string;
+  number: number;
+  timestamp: number;
+}
+
+export type BlockFinderHints = {
+  lowBlock?: number;
+  highBlock?: number;
+};
+
+export abstract class BlockFinder<TBlock extends Block> {
+  abstract getBlockForTimestamp(timestamp: number | string, hints: BlockFinderHints): Promise<TBlock>;
+}

package/src/utils/BlockUtils.ts

@@ -1,219 +1,9 @@
-import assert from "assert";
-import type { Block, Provider } from "@ethersproject/abstract-provider";
-import { clamp, sortedIndexBy } from "lodash";
-import { chainIsOPStack, getNetworkName } from "./NetworkUtils";
 import { isDefined } from "./TypeGuards";
 import { getCurrentTime } from "./TimeUtils";
 import { CachingMechanismInterface } from "../interfaces";
 import { shouldCache } from "./CachingUtils";
-import { CHAIN_IDs, DEFAULT_CACHING_SAFE_LAG } from "../constants";
-
-type Opts = {
-  highBlock?: number;
-  highBlockOffset?: number;
-  blockRange?: number;
-};
-
-type BlockTimeAverage = {
-  average: number;
-  blockRange: number;
-  timestamp: number;
-};
-
-// Archive requests typically commence at 128 blocks past the head of the chain.
-// Round down to 120 blocks to avoid slipping into archive territory.
-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.
-const defaultHighBlockOffset = 10;
-
-// Retain computations for 15 minutes.
-const cacheTTL = 60 * 15;
-const now = getCurrentTime(); // Seed the cache with initial values.
-const blockTimes: { [chainId: number]: BlockTimeAverage } = {
-  [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 async function averageBlockTime(
-  provider: Provider,
-  { highBlock, highBlockOffset, blockRange }: Opts = {}
-): Promise<Pick<BlockTimeAverage, "average" | "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: Block | undefined) => {
-    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 };
-}
-
-async function estimateBlocksElapsed(seconds: number, cushionPercentage = 0.0, provider: Provider): Promise<number> {
-  const cushionMultiplier = cushionPercentage + 1.0;
-  const { average } = await averageBlockTime(provider);
-  return Math.floor((seconds * cushionMultiplier) / average);
-}
-
-export type BlockFinderHints = {
-  lowBlock?: number;
-  highBlock?: number;
-};
-
-export class BlockFinder {
-  constructor(
-    private readonly provider: Provider,
-    private readonly blocks: Block[] = []
-  ) {}
-
-  /**
-   * @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.
-   */
-  public async getBlockForTimestamp(timestamp: number | string, hints: BlockFinderHints = {}): Promise<Block> {
-    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 } as Block, "timestamp");
-    return this.findBlock(this.blocks[index - 1], this.blocks[index], timestamp);
-  }
-
-  // Grabs the most recent block and caches it.
-  private 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.
-  private async getBlock(number: number) {
-    let index = sortedIndexBy(this.blocks, { number } as Block, "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 } as Block, "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.
-  private async findBlock(_startBlock: Block, _endBlock: Block, timestamp: number): Promise<Block> {
-    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);
-    }
-  }
-}
+import { BlockFinderHints, BlockFinder, Block } from "./BlockFinder";
+import { DEFAULT_CACHING_SAFE_LAG } from "../constants";
 
 /**
  * @notice Get the block number for a given timestamp fresh from on-chain data if not found in redis cache.
@@ -224,16 +14,16 @@ export class BlockFinder {
  * or loading from cache. This is useful for testing primarily.
  * @returns Block number for the requested timestamp.
  */
-export async function getCachedBlockForTimestamp(
+export async function getCachedBlockForTimestamp<TBlock extends Block>(
   chainId: number,
   timestamp: number,
-  blockFinder: BlockFinder,
+  blockFinder: BlockFinder<TBlock>,
   cache?: CachingMechanismInterface,
   hints?: BlockFinderHints
 ): Promise<number> {
   // Resolve a convenience function to directly compute what we're
   // looking for.
-  const resolver = async () => (await blockFinder.getBlockForTimestamp(timestamp, hints)).number;
+  const resolver = async () => (await blockFinder.getBlockForTimestamp(timestamp, hints || {})).number;
 
   // If no redis client, then request block from blockFinder.
   if (!isDefined(cache)) {

package/src/utils/index.ts

@@ -2,6 +2,7 @@ export * from "./common";
 export * from "./abi";
 export * from "./ArrayUtils";
 export * from "./BlockUtils";
+export * from "./BlockFinder";
 export * from "./EventUtils";
 export * from "./ObjectUtils";
 export * from "./TimeUtils";

package/dist/cjs/providers/mockProvider.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"mockProvider.js","sourceRoot":"","sources":["../../../src/providers/mockProvider.ts"],"names":[],"mappings":";;;;AAAA,iCAA8C;AAE9C,0DAAiD;AAMjD;IAAoC,0CAA+B;IAGjE,wBACW,oBAA+B,EAC/B,uBAAkC,EAClC,cAAkB;QAAlB,+BAAA,EAAA,kBAAkB;QAH7B,YAKE,kBAAM,SAAS,EAAE,cAAc,CAAC,SACjC;QALU,0BAAoB,GAApB,oBAAoB,CAAW;QAC/B,6BAAuB,GAAvB,uBAAuB,CAAW;QAClC,oBAAc,GAAd,cAAc,CAAI;QALrB,kBAAY,GAA4C,EAAE,CAAC;;IAQnE,CAAC;IAED,iCAAQ,GAAR,UAAS,oBAAoE;QAC3E,IAAM,SAAS,GAAU;YACvB,YAAY,EAAE,EAAE;YAChB,IAAI,EAAE,IAAI;YACV,UAAU,EAAE,IAAI;YAChB,MAAM,EAAE,CAAC;YACT,KAAK,EAAE,GAAG;YACV,UAAU,EAAE,CAAC;YACb,WAAW,EAAE,uBAAM;YACnB,SAAS,EAAE,CAAC;YACZ,QAAQ,EAAE,uBAAM;YAChB,OAAO,EAAE,uBAAM;YACf,aAAa,EAAE,IAAI,CAAC,oBAAoB;YACxC,KAAK,EAAE,IAAI;YACX,SAAS,EAAE,IAAI;SAChB,CAAC;QACF,OAAO,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IACpC,CAAC;IAGD,6BAAI,GAAJ,UAAK,MAAc,EAAE,OAAmB;QACtC,QAAQ,MAAM,EAAE;YACd,KAAK,0BAA0B;gBAC7B,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;YACvD;gBACE,MAAM,IAAI,KAAK,CAAC,+CAAwC,MAAM,CAAE,CAAC,CAAC;SACrE;IACH,CAAC;IAED,mCAAU,GAAV;QACE,OAAO,OAAO,CAAC,OAAO,CAAC;YACrB,iBAAiB,EAAE,IAAI,CAAC,oBAAoB;YAC5C,oBAAoB,EAAE,IAAI,CAAC,uBAAuB;YAElD,YAAY,EAAE,IAAI;YAClB,QAAQ,EAAE,IAAI;SACf,CAAC,CAAC;IACL,CAAC;IAED,uCAAc,GAAd,UAAe,IAAY;QACzB,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;IAClD,CAAC;IAED,oCAAW,GAAX;QACE,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC,CAAC;IACtF,CAAC;IAED,mCAAU,GAAV;QACE,OAAO,OAAO,CAAC,OAAO,CAAC;YACrB,IAAI,EAAE,aAAa;YACnB,OAAO,EAAE,IAAI,CAAC,cAAc;SAC7B,CAAC,CAAC;IACL,CAAC;IAED,wCAAe,GAAf,UAAgB,IAAY,EAAE,WAAgC;QAC5D,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC;IACxC,CAAC;IACH,qBAAC;AAAD,CAAC,AApED,CAAoC,kBAAS,CAAC,qBAAqB,GAoElE;AApEY,wCAAc"}

package/dist/esm/providers/mockProvider.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"mockProvider.js","sourceRoot":"","sources":["../../../src/providers/mockProvider.ts"],"names":[],"mappings":";AAAA,OAAO,EAAa,SAAS,EAAE,MAAM,QAAQ,CAAC;AAE9C,OAAO,EAAE,MAAM,EAAE,MAAM,yBAAyB,CAAC;AAEjD;;;GAGG;AACH;IAAoC,kCAA+B;IAGjE,wBACW,oBAA+B,EAC/B,uBAAkC,EAClC,cAAkB;QAAlB,+BAAA,EAAA,kBAAkB;QAH7B,YAKE,kBAAM,SAAS,EAAE,cAAc,CAAC,SACjC;QALU,0BAAoB,GAApB,oBAAoB,CAAW;QAC/B,6BAAuB,GAAvB,uBAAuB,CAAW;QAClC,oBAAc,GAAd,cAAc,CAAI;QALrB,kBAAY,GAA4C,EAAE,CAAC;;IAQnE,CAAC;IAED,iCAAQ,GAAR,UAAS,oBAAoE;QAC3E,IAAM,SAAS,GAAU;YACvB,YAAY,EAAE,EAAE;YAChB,IAAI,EAAE,IAAI;YACV,UAAU,EAAE,IAAI;YAChB,MAAM,EAAE,CAAC;YACT,KAAK,EAAE,GAAG;YACV,UAAU,EAAE,CAAC;YACb,WAAW,EAAE,MAAM;YACnB,SAAS,EAAE,CAAC;YACZ,QAAQ,EAAE,MAAM;YAChB,OAAO,EAAE,MAAM;YACf,aAAa,EAAE,IAAI,CAAC,oBAAoB;YACxC,KAAK,EAAE,IAAI;YACX,SAAS,EAAE,IAAI;SAChB,CAAC;QACF,OAAO,OAAO,CAAC,OAAO,CAAC,SAAS,CAAC,CAAC;IACpC,CAAC;IAED,8DAA8D;IAC9D,6BAAI,GAAJ,UAAK,MAAc,EAAE,OAAmB;QACtC,QAAQ,MAAM,EAAE;YACd,KAAK,0BAA0B;gBAC7B,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC;YACvD;gBACE,MAAM,IAAI,KAAK,CAAC,+CAAwC,MAAM,CAAE,CAAC,CAAC;SACrE;IACH,CAAC;IAED,mCAAU,GAAV;QACE,OAAO,OAAO,CAAC,OAAO,CAAC;YACrB,iBAAiB,EAAE,IAAI,CAAC,oBAAoB;YAC5C,oBAAoB,EAAE,IAAI,CAAC,uBAAuB;YAClD,6CAA6C;YAC7C,YAAY,EAAE,IAAI;YAClB,QAAQ,EAAE,IAAI;SACf,CAAC,CAAC;IACL,CAAC;IAED,uCAAc,GAAd,UAAe,IAAY;QACzB,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC;IAClD,CAAC;IAED,oCAAW,GAAX;QACE,OAAO,OAAO,CAAC,OAAO,CAAC,IAAI,CAAC,oBAAoB,CAAC,GAAG,CAAC,IAAI,CAAC,uBAAuB,CAAC,CAAC,CAAC;IACtF,CAAC;IAED,mCAAU,GAAV;QACE,OAAO,OAAO,CAAC,OAAO,CAAC;YACrB,IAAI,EAAE,aAAa;YACnB,OAAO,EAAE,IAAI,CAAC,cAAc;SAC7B,CAAC,CAAC;IACL,CAAC;IAED,wCAAe,GAAf,UAAgB,IAAY,EAAE,WAAgC;QAC5D,IAAI,CAAC,YAAY,CAAC,IAAI,CAAC,GAAG,WAAW,CAAC;IACxC,CAAC;IACH,qBAAC;AAAD,CAAC,AApED,CAAoC,SAAS,CAAC,qBAAqB,GAoElE"}

package/dist/types/providers/mockProvider.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"mockProvider.d.ts","sourceRoot":"","sources":["../../../src/providers/mockProvider.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,SAAS,EAAE,SAAS,EAAE,MAAM,QAAQ,CAAC;AAC9C,OAAO,EAAE,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,mBAAmB,EAAE,MAAM,kCAAkC,CAAC;AAGjG;;;GAGG;AACH,qBAAa,cAAe,SAAQ,SAAS,CAAC,qBAAqB;IAI/D,QAAQ,CAAC,oBAAoB,EAAE,SAAS;IACxC,QAAQ,CAAC,uBAAuB,EAAE,SAAS;IAC3C,QAAQ,CAAC,cAAc;IALzB,OAAO,CAAC,YAAY,CAA+C;gBAGxD,oBAAoB,EAAE,SAAS,EAC/B,uBAAuB,EAAE,SAAS,EAClC,cAAc,SAAI;IAK7B,QAAQ,CAAC,oBAAoB,EAAE,QAAQ,GAAG,MAAM,GAAG,OAAO,CAAC,QAAQ,GAAG,MAAM,CAAC,GAAG,OAAO,CAAC,KAAK,CAAC;IAoB9F,IAAI,CAAC,MAAM,EAAE,MAAM,EAAE,OAAO,EAAE,KAAK,CAAC,GAAG,CAAC,GAAG,OAAO,CAAC,GAAG,CAAC;IASvD,UAAU,IAAI,OAAO,CAAC,OAAO,CAAC;IAU9B,cAAc,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,CAAC,mBAAmB,CAAC;IAI1D,WAAW,IAAI,OAAO,CAAC,SAAS,CAAC;IAIjC,UAAU,IAAI,OAAO,CAAC;QAAE,OAAO,EAAE,MAAM,CAAC;QAAC,IAAI,EAAE,MAAM,CAAA;KAAE,CAAC;IAOxD,eAAe,CAAC,IAAI,EAAE,MAAM,EAAE,WAAW,EAAE,mBAAmB;CAG/D"}