@lightprotocol/compressed-token 0.22.0 → 0.22.1-alpha.0

This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
Files changed (7) hide show
  1. package/README.md +5 -5
  2. package/dist/cjs/browser/index.cjs +1 -1
  3. package/dist/cjs/browser/index.cjs.map +1 -1
  4. package/dist/cjs/node/index.cjs +1 -1
  5. package/dist/cjs/node/index.cjs.map +1 -1
  6. package/dist/types/index.d.ts +42 -28
  7. package/package.json +2 -2
package/dist/cjs/browser/index.cjs.map CHANGED
@@ -1 +1 @@
1
- {"version":3,"file":"index.cjs","sources":["../../../../../src/constants.ts","../../../../../src/utils/get-token-pool-infos.ts","../../../../../src/utils/select-input-accounts.ts","../../../../../src/utils/pack-compressed-token-accounts.ts","../../../../../src/utils/validation.ts","../../../../../src/layout.ts","../../../../../src/program.ts","../../../../../src/idl.ts","../../../../../src/actions/create-token-pool.ts","../../../../../src/actions/approve.ts","../../../../../src/actions/approve-and-mint-to.ts","../../../../../src/actions/compress.ts","../../../../../src/actions/compress-spl-token-account.ts","../../../../../src/actions/create-mint.ts","../../../../../src/actions/create-token-program-lookup-table.ts","../../../../../src/actions/decompress.ts","../../../../../src/actions/decompress-delegated.ts","../../../../../src/types.ts","../../../../../src/actions/merge-token-accounts.ts","../../../../../src/actions/mint-to.ts","../../../../../src/actions/revoke.ts","../../../../../src/actions/transfer.ts","../../../../../src/actions/transfer-delegated.ts"],"sourcesContent":["import { Buffer } from 'buffer';\nexport const POOL_SEED = Buffer.from('pool');\n\nexport const CPI_AUTHORITY_SEED = Buffer.from('cpi_authority');\n\nexport const SPL_TOKEN_MINT_RENT_EXEMPT_BALANCE = 1461600;\n\nexport const CREATE_TOKEN_POOL_DISCRIMINATOR = Buffer.from([\n 23, 169, 27, 122, 147, 169, 209, 152,\n]);\nexport const MINT_TO_DISCRIMINATOR = Buffer.from([\n 241, 34, 48, 186, 37, 179, 123, 192,\n]);\nexport const BATCH_COMPRESS_DISCRIMINATOR = Buffer.from([\n 65, 206, 101, 37, 147, 42, 221, 144,\n]);\nexport const TRANSFER_DISCRIMINATOR = Buffer.from([\n 163, 52, 200, 231, 140, 3, 69, 186,\n]);\nexport const COMPRESS_SPL_TOKEN_ACCOUNT_DISCRIMINATOR = Buffer.from([\n 112, 230, 105, 101, 145, 202, 157, 97,\n]);\n\nexport const APPROVE_DISCRIMINATOR = Buffer.from([\n 69, 74, 217, 36, 115, 117, 97, 76,\n]);\nexport const REVOKE_DISCRIMINATOR = Buffer.from([\n 170, 23, 31, 34, 133, 173, 93, 242,\n]);\nexport const ADD_TOKEN_POOL_DISCRIMINATOR = Buffer.from([\n 114, 143, 210, 73, 96, 115, 1, 228,\n]);\n","import { Commitment, PublicKey } from '@solana/web3.js';\nimport { unpackAccount } from '@solana/spl-token';\nimport { CompressedTokenProgram } from '../program';\nimport { bn, Rpc } from '@lightprotocol/stateless.js';\nimport BN from 'bn.js';\n\n/**\n * Check if the token pool info is initialized and has a balance.\n * @param mint The mint of the token pool\n * @param tokenPoolInfo The token pool info\n * @returns True if the token pool info is initialized and has a balance\n */\nexport function checkTokenPoolInfo(\n tokenPoolInfo: TokenPoolInfo,\n mint: PublicKey,\n): boolean {\n if (!tokenPoolInfo.mint.equals(mint)) {\n throw new Error(`TokenPool mint does not match the provided mint.`);\n }\n\n if (!tokenPoolInfo.isInitialized) {\n throw new Error(\n `TokenPool is not initialized. Please create a compressed token pool for mint: ${mint.toBase58()} via createTokenPool().`,\n );\n }\n return true;\n}\n\n/**\n * Get the token pool infos for a given mint.\n * @param rpc The RPC client\n * @param mint The mint of the token pool\n * @param commitment The commitment to use\n *\n * @returns The token pool infos\n */\nexport async function getTokenPoolInfos(\n rpc: Rpc,\n mint: PublicKey,\n commitment?: Commitment,\n): Promise<TokenPoolInfo[]> {\n const addressesAndBumps = Array.from({ length: 5 }, (_, i) =>\n CompressedTokenProgram.deriveTokenPoolPdaWithIndex(mint, i),\n );\n\n const accountInfos = await rpc.getMultipleAccountsInfo(\n addressesAndBumps.map(addressAndBump => addressAndBump[0]),\n commitment,\n );\n\n if (accountInfos[0] === null) {\n throw new Error(\n `TokenPool not found. Please create a compressed token pool for mint: ${mint.toBase58()} via createTokenPool().`,\n );\n }\n\n const parsedInfos = addressesAndBumps.map((addressAndBump, i) =>\n accountInfos[i]\n ? unpackAccount(\n addressAndBump[0],\n accountInfos[i],\n accountInfos[i].owner,\n )\n : null,\n );\n\n const tokenProgram = accountInfos[0].owner;\n return parsedInfos.map((parsedInfo, i) => {\n if (!parsedInfo) {\n return {\n mint,\n tokenPoolPda: addressesAndBumps[i][0],\n tokenProgram,\n activity: undefined,\n balance: bn(0),\n isInitialized: false,\n poolIndex: i,\n bump: addressesAndBumps[i][1],\n };\n }\n\n return {\n mint,\n tokenPoolPda: parsedInfo.address,\n tokenProgram,\n activity: undefined,\n balance: bn(parsedInfo.amount.toString()),\n isInitialized: true,\n poolIndex: i,\n bump: addressesAndBumps[i][1],\n };\n });\n}\n\nexport type TokenPoolActivity = {\n signature: string;\n amount: BN;\n action: Action;\n};\n\n/**\n * Token pool pda info.\n */\nexport type TokenPoolInfo = {\n /**\n * The mint of the token pool\n */\n mint: PublicKey;\n /**\n * The token pool address\n */\n tokenPoolPda: PublicKey;\n /**\n * The token program of the token pool\n */\n tokenProgram: PublicKey;\n /**\n * count of txs and volume in the past 60 seconds.\n */\n activity?: {\n txs: number;\n amountAdded: BN;\n amountRemoved: BN;\n };\n /**\n * Whether the token pool is initialized\n */\n isInitialized: boolean;\n /**\n * The balance of the token pool\n */\n balance: BN;\n /**\n * The index of the token pool\n */\n poolIndex: number;\n /**\n * The bump used to derive the token pool pda\n */\n bump: number;\n};\n\n/**\n * @internal\n */\nexport enum Action {\n Compress = 1,\n Decompress = 2,\n Transfer = 3,\n}\n\n/**\n * @internal\n */\nconst shuffleArray = <T>(array: T[]): T[] => {\n for (let i = array.length - 1; i > 0; i--) {\n const j = Math.floor(Math.random() * (i + 1));\n [array[i], array[j]] = [array[j], array[i]];\n }\n return array;\n};\n\n/**\n * For `compress` and `mintTo` instructions only.\n * Select a random token pool info from the token pool infos.\n *\n * For `decompress`, use {@link selectTokenPoolInfosForDecompression} instead.\n *\n * @param infos The token pool infos\n *\n * @returns A random token pool info\n */\nexport function selectTokenPoolInfo(infos: TokenPoolInfo[]): TokenPoolInfo {\n const shuffledInfos = shuffleArray(infos);\n\n // filter only infos that are initialized\n const filteredInfos = shuffledInfos.filter(info => info.isInitialized);\n\n if (filteredInfos.length === 0) {\n throw new Error(\n 'Please pass at least one initialized token pool info.',\n );\n }\n\n // Return a single random token pool info\n return filteredInfos[0];\n}\n\n/**\n * Select one or multiple token pool infos from the token pool infos.\n *\n * Use this function for `decompress`.\n *\n * For `compress`, `mintTo` use {@link selectTokenPoolInfo} instead.\n *\n * @param infos The token pool infos\n * @param decompressAmount The amount of tokens to withdraw\n *\n * @returns Array with one or more token pool infos.\n */\nexport function selectTokenPoolInfosForDecompression(\n infos: TokenPoolInfo[],\n decompressAmount: number | BN,\n): TokenPoolInfo[] {\n if (infos.length === 0) {\n throw new Error('Please pass at least one token pool info.');\n }\n\n infos = shuffleArray(infos);\n // Find the first info where balance is 10x the requested amount\n const sufficientBalanceInfo = infos.find(info =>\n info.balance.gte(bn(decompressAmount).mul(bn(10))),\n );\n\n // filter only infos that are initialized\n infos = infos\n .filter(info => info.isInitialized)\n .sort((a, b) => a.poolIndex - b.poolIndex);\n\n const allBalancesZero = infos.every(info => info.balance.isZero());\n if (allBalancesZero) {\n throw new Error(\n 'All provided token pool balances are zero. Please pass recent token pool infos.',\n );\n }\n\n // If none found, return all infos\n return sufficientBalanceInfo ? [sufficientBalanceInfo] : infos;\n}\n","import { bn, ParsedTokenAccount } from '@lightprotocol/stateless.js';\n\nimport BN from 'bn.js';\n\nexport const ERROR_NO_ACCOUNTS_FOUND =\n 'Could not find accounts to select for transfer.';\n\n/**\n * Selects token accounts for approval, first trying to find an exact match, then falling back to minimum selection.\n *\n * @param {ParsedTokenAccount[]} accounts - Token accounts to choose from.\n * @param {BN} approveAmount - Amount to approve.\n * @param {number} [maxInputs=4] - Max accounts to select when falling back to minimum selection.\n * @returns {[\n * selectedAccounts: ParsedTokenAccount[],\n * total: BN,\n * totalLamports: BN | null,\n * maxPossibleAmount: BN\n * ]} - Returns:\n * - selectedAccounts: Accounts chosen for approval.\n * - total: Total amount from selected accounts.\n * - totalLamports: Total lamports from selected accounts.\n * - maxPossibleAmount: Max approvable amount given maxInputs.\n */\nexport function selectTokenAccountsForApprove(\n accounts: ParsedTokenAccount[],\n approveAmount: BN,\n maxInputs: number = 4,\n): [\n selectedAccounts: ParsedTokenAccount[],\n total: BN,\n totalLamports: BN | null,\n maxPossibleAmount: BN,\n] {\n // First try to find an exact match\n const exactMatch = accounts.find(account =>\n account.parsed.amount.eq(approveAmount),\n );\n if (exactMatch) {\n return [\n [exactMatch],\n exactMatch.parsed.amount,\n exactMatch.compressedAccount.lamports,\n exactMatch.parsed.amount,\n ];\n }\n\n // If no exact match, fall back to minimum selection\n return selectMinCompressedTokenAccountsForTransfer(\n accounts,\n approveAmount,\n maxInputs,\n );\n}\n\n/**\n * Selects the minimum number of compressed token accounts required for a\n * decompress instruction, up to a specified maximum.\n *\n * @param {ParsedTokenAccount[]} accounts Token accounts to choose from.\n * @param {BN} amount Amount to decompress.\n * @param {number} [maxInputs=4] Max accounts to select. Default\n * is 4.\n *\n * @returns Returns selected accounts and their totals.\n */\nexport function selectMinCompressedTokenAccountsForDecompression(\n accounts: ParsedTokenAccount[],\n amount: BN,\n maxInputs: number = 4,\n): {\n selectedAccounts: ParsedTokenAccount[];\n total: BN;\n totalLamports: BN | null;\n maxPossibleAmount: BN;\n} {\n const [selectedAccounts, total, totalLamports, maxPossibleAmount] =\n selectMinCompressedTokenAccountsForTransfer(\n accounts,\n amount,\n maxInputs,\n );\n return { selectedAccounts, total, totalLamports, maxPossibleAmount };\n}\n\n/**\n * Selects the minimum number of compressed token accounts required for a\n * transfer or decompression instruction, up to a specified maximum.\n *\n * @param {ParsedTokenAccount[]} accounts Token accounts to choose from.\n * @param {BN} transferAmount Amount to transfer or decompress.\n * @param {number} [maxInputs=4] Max accounts to select. Default\n * is 4.\n *\n * @returns Returns selected accounts and their totals. [\n * selectedAccounts: ParsedTokenAccount[],\n * total: BN,\n * totalLamports: BN | null,\n * maxPossibleAmount: BN\n * ]\n */\nexport function selectMinCompressedTokenAccountsForTransfer(\n accounts: ParsedTokenAccount[],\n transferAmount: BN,\n maxInputs: number = 4,\n): [\n selectedAccounts: ParsedTokenAccount[],\n total: BN,\n totalLamports: BN | null,\n maxPossibleAmount: BN,\n] {\n const [\n selectedAccounts,\n accumulatedAmount,\n accumulatedLamports,\n maxPossibleAmount,\n ] = selectMinCompressedTokenAccountsForTransferOrPartial(\n accounts,\n transferAmount,\n maxInputs,\n );\n\n if (accumulatedAmount.lt(bn(transferAmount))) {\n const totalBalance = accounts.reduce(\n (acc, account) => acc.add(account.parsed.amount),\n bn(0),\n );\n if (selectedAccounts.length >= maxInputs) {\n throw new Error(\n `Account limit exceeded: max ${maxPossibleAmount.toString()} (${maxInputs} accounts) per transaction. Total balance: ${totalBalance.toString()} (${accounts.length} accounts). Consider multiple transfers to spend full balance.`,\n );\n } else {\n throw new Error(\n `Insufficient balance for transfer. Required: ${transferAmount.toString()}, available: ${totalBalance.toString()}.`,\n );\n }\n }\n\n if (selectedAccounts.length === 0) {\n throw new Error(ERROR_NO_ACCOUNTS_FOUND);\n }\n\n return [\n selectedAccounts,\n accumulatedAmount,\n accumulatedLamports,\n maxPossibleAmount,\n ];\n}\n\n/**\n * Executes {@link selectMinCompressedTokenAccountsForTransfer} strategy,\n * returns partial amounts if insufficient accounts are found instead of\n * throwing an error.\n */\nexport function selectMinCompressedTokenAccountsForTransferOrPartial(\n accounts: ParsedTokenAccount[],\n transferAmount: BN,\n maxInputs: number = 4,\n): [\n selectedAccounts: ParsedTokenAccount[],\n total: BN,\n totalLamports: BN | null,\n maxPossibleAmount: BN,\n] {\n if (accounts.length === 0) {\n throw new Error(ERROR_NO_ACCOUNTS_FOUND);\n }\n\n let accumulatedAmount = bn(0);\n let accumulatedLamports = bn(0);\n let maxPossibleAmount = bn(0);\n\n const selectedAccounts: ParsedTokenAccount[] = [];\n\n accounts.sort((a, b) => b.parsed.amount.cmp(a.parsed.amount));\n\n for (const account of accounts) {\n if (selectedAccounts.length >= maxInputs) break;\n if (accumulatedAmount.gte(bn(transferAmount))) break;\n\n if (\n !account.parsed.amount.isZero() ||\n !account.compressedAccount.lamports.isZero()\n ) {\n accumulatedAmount = accumulatedAmount.add(account.parsed.amount);\n accumulatedLamports = accumulatedLamports.add(\n account.compressedAccount.lamports,\n );\n selectedAccounts.push(account);\n }\n }\n\n // Max, considering maxInputs\n maxPossibleAmount = accounts\n .slice(0, maxInputs)\n .reduce((total, account) => total.add(account.parsed.amount), bn(0));\n\n if (accumulatedAmount.lt(bn(transferAmount))) {\n console.log(\n `Insufficient balance for transfer. Requested: ${transferAmount.toString()}, Returns max available: ${maxPossibleAmount.toString()}.`,\n );\n }\n\n if (selectedAccounts.length === 0) {\n throw new Error(ERROR_NO_ACCOUNTS_FOUND);\n }\n\n return [\n selectedAccounts,\n accumulatedAmount,\n accumulatedLamports,\n maxPossibleAmount,\n ];\n}\n\n/**\n * Selects compressed token accounts for a transfer, ensuring one extra account\n * if possible, up to maxInputs.\n *\n * 1. Sorts accounts by amount (desc)\n * 2. Selects accounts until transfer amount is met or maxInputs is reached,\n * attempting to add one extra account if possible.\n *\n * @param {ParsedTokenAccount[]} accounts - The list of token accounts to select from.\n * @param {BN} transferAmount - The token amount to be transferred.\n * @param {number} [maxInputs=4] - The maximum number of accounts to select. Default: 4.\n * @returns {[\n * selectedAccounts: ParsedTokenAccount[],\n * total: BN,\n * totalLamports: BN | null,\n * maxPossibleAmount: BN\n * ]} - An array containing:\n * - selectedAccounts: The accounts selected for the transfer.\n * - total: The total amount accumulated from the selected accounts.\n * - totalLamports: The total lamports accumulated from the selected accounts.\n * - maxPossibleAmount: The maximum possible amount that can be transferred considering maxInputs.\n *\n * @example\n * const accounts = [\n * { parsed: { amount: new BN(100) }, compressedAccount: { lamports: new BN(10) } },\n * { parsed: { amount: new BN(50) }, compressedAccount: { lamports: new BN(5) } },\n * { parsed: { amount: new BN(25) }, compressedAccount: { lamports: new BN(2) } },\n * ];\n * const transferAmount = new BN(75);\n * const maxInputs = 2;\n *\n * const [selectedAccounts, total, totalLamports, maxPossibleAmount] =\n * selectSmartCompressedTokenAccountsForTransfer(accounts, transferAmount, maxInputs);\n *\n * console.log(selectedAccounts.length); // 2\n * console.log(total.toString()); // '150'\n * console.log(totalLamports!.toString()); // '15'\n * console.log(maxPossibleAmount.toString()); // '150'\n */\nexport function selectSmartCompressedTokenAccountsForTransfer(\n accounts: ParsedTokenAccount[],\n transferAmount: BN,\n maxInputs: number = 4,\n): [\n selectedAccounts: ParsedTokenAccount[],\n total: BN,\n totalLamports: BN | null,\n maxPossibleAmount: BN,\n] {\n const [\n selectedAccounts,\n accumulatedAmount,\n accumulatedLamports,\n maxPossibleAmount,\n ] = selectSmartCompressedTokenAccountsForTransferOrPartial(\n accounts,\n transferAmount,\n maxInputs,\n );\n\n if (accumulatedAmount.lt(bn(transferAmount))) {\n const totalBalance = accounts.reduce(\n (acc, account) => acc.add(account.parsed.amount),\n bn(0),\n );\n if (selectedAccounts.length >= maxInputs) {\n throw new Error(\n `Account limit exceeded: max ${maxPossibleAmount.toString()} (${maxInputs} accounts) per transaction. Total balance: ${totalBalance.toString()} (${accounts.length} accounts). Consider multiple transfers to spend full balance.`,\n );\n } else {\n throw new Error(\n `Insufficient balance. Required: ${transferAmount.toString()}, available: ${totalBalance.toString()}.`,\n );\n }\n }\n\n if (selectedAccounts.length === 0) {\n throw new Error(ERROR_NO_ACCOUNTS_FOUND);\n }\n\n return [\n selectedAccounts,\n accumulatedAmount,\n accumulatedLamports,\n maxPossibleAmount,\n ];\n}\n\n/**\n * Executes {@link selectMinCompressedTokenAccountsForTransfer} strategy,\n * returns partial amounts if insufficient accounts are found instead of\n * throwing an error.\n */\nexport function selectSmartCompressedTokenAccountsForTransferOrPartial(\n accounts: ParsedTokenAccount[],\n transferAmount: BN,\n maxInputs: number = 4,\n): [\n selectedAccounts: ParsedTokenAccount[],\n total: BN,\n totalLamports: BN | null,\n maxPossibleAmount: BN,\n] {\n if (accounts.length === 0) {\n throw new Error(ERROR_NO_ACCOUNTS_FOUND);\n }\n\n let accumulatedAmount = bn(0);\n let accumulatedLamports = bn(0);\n\n const selectedAccounts: ParsedTokenAccount[] = [];\n\n // we can ignore zero value accounts.\n const nonZeroAccounts = accounts.filter(\n account =>\n !account.parsed.amount.isZero() ||\n !account.compressedAccount.lamports.isZero(),\n );\n\n nonZeroAccounts.sort((a, b) => b.parsed.amount.cmp(a.parsed.amount));\n\n for (const account of nonZeroAccounts) {\n if (selectedAccounts.length >= maxInputs) break;\n accumulatedAmount = accumulatedAmount.add(account.parsed.amount);\n accumulatedLamports = accumulatedLamports.add(\n account.compressedAccount.lamports,\n );\n selectedAccounts.push(account);\n\n if (accumulatedAmount.gte(bn(transferAmount))) {\n // Select smallest additional account if maxInputs not reached\n const remainingAccounts = nonZeroAccounts.slice(\n selectedAccounts.length,\n );\n if (remainingAccounts.length > 0) {\n const smallestAccount = remainingAccounts.reduce((min, acc) =>\n acc.parsed.amount.lt(min.parsed.amount) ? acc : min,\n );\n if (selectedAccounts.length < maxInputs) {\n selectedAccounts.push(smallestAccount);\n accumulatedAmount = accumulatedAmount.add(\n smallestAccount.parsed.amount,\n );\n accumulatedLamports = accumulatedLamports.add(\n smallestAccount.compressedAccount.lamports,\n );\n }\n }\n break;\n }\n }\n\n const maxPossibleAmount = nonZeroAccounts\n .slice(0, maxInputs)\n .reduce((max, account) => max.add(account.parsed.amount), bn(0));\n\n if (selectedAccounts.length === 0) {\n throw new Error(ERROR_NO_ACCOUNTS_FOUND);\n }\n\n return [\n selectedAccounts,\n accumulatedAmount,\n accumulatedLamports,\n maxPossibleAmount,\n ];\n}\n","import {\n ParsedTokenAccount,\n InputTokenDataWithContext,\n getIndexOrAdd,\n bn,\n padOutputStateMerkleTrees,\n TreeType,\n featureFlags,\n TreeInfo,\n} from '@lightprotocol/stateless.js';\nimport { PublicKey, AccountMeta } from '@solana/web3.js';\nimport {\n PackedTokenTransferOutputData,\n TokenTransferOutputData,\n} from '../types';\n\nexport type PackCompressedTokenAccountsParams = {\n /** Input state to be consumed */\n inputCompressedTokenAccounts: ParsedTokenAccount[];\n /**\n * State trees that the output should be inserted into. Defaults to the 0th\n * state tree of the input state. Gets padded to the length of\n * outputCompressedAccounts.\n */\n outputStateTreeInfo?: TreeInfo;\n /** Optional remaining accounts to append to */\n remainingAccounts?: PublicKey[];\n /**\n * Root indices that are used on-chain to fetch the correct root\n * from the state Merkle tree account for validity proof verification.\n */\n rootIndices: number[];\n tokenTransferOutputs: TokenTransferOutputData[];\n};\n\n/**\n * Packs Compressed Token Accounts.\n */\nexport function packCompressedTokenAccounts(\n params: PackCompressedTokenAccountsParams,\n): {\n inputTokenDataWithContext: InputTokenDataWithContext[];\n remainingAccountMetas: AccountMeta[];\n packedOutputTokenData: PackedTokenTransferOutputData[];\n} {\n const {\n inputCompressedTokenAccounts,\n outputStateTreeInfo,\n remainingAccounts = [],\n rootIndices,\n tokenTransferOutputs,\n } = params;\n\n const _remainingAccounts = remainingAccounts.slice();\n let delegateIndex: number | null = null;\n\n if (\n inputCompressedTokenAccounts.length > 0 &&\n inputCompressedTokenAccounts[0].parsed.delegate\n ) {\n delegateIndex = getIndexOrAdd(\n _remainingAccounts,\n inputCompressedTokenAccounts[0].parsed.delegate,\n );\n }\n\n const packedInputTokenData: InputTokenDataWithContext[] = [];\n /// pack inputs\n inputCompressedTokenAccounts.forEach(\n (account: ParsedTokenAccount, index) => {\n const merkleTreePubkeyIndex = getIndexOrAdd(\n _remainingAccounts,\n account.compressedAccount.treeInfo.tree,\n );\n\n const queuePubkeyIndex = getIndexOrAdd(\n _remainingAccounts,\n account.compressedAccount.treeInfo.queue,\n );\n\n packedInputTokenData.push({\n amount: account.parsed.amount,\n delegateIndex,\n merkleContext: {\n merkleTreePubkeyIndex,\n queuePubkeyIndex,\n leafIndex: account.compressedAccount.leafIndex,\n proveByIndex: account.compressedAccount.proveByIndex,\n },\n rootIndex: rootIndices[index],\n lamports: account.compressedAccount.lamports.eq(bn(0))\n ? null\n : account.compressedAccount.lamports,\n tlv: null,\n });\n },\n );\n\n if (inputCompressedTokenAccounts.length > 0 && outputStateTreeInfo) {\n throw new Error(\n 'Cannot specify both input accounts and outputStateTreeInfo',\n );\n }\n\n let treeInfo: TreeInfo;\n if (inputCompressedTokenAccounts.length > 0) {\n treeInfo = inputCompressedTokenAccounts[0].compressedAccount.treeInfo;\n } else if (outputStateTreeInfo) {\n treeInfo = outputStateTreeInfo;\n } else {\n throw new Error(\n 'Neither input accounts nor outputStateTreeInfo are available',\n );\n }\n\n // Use next tree if available, otherwise fall back to current tree.\n // `nextTreeInfo` always takes precedence.\n const activeTreeInfo = treeInfo.nextTreeInfo || treeInfo;\n let activeTreeOrQueue = activeTreeInfo.tree;\n\n if (activeTreeInfo.treeType === TreeType.StateV2) {\n if (featureFlags.isV2()) {\n activeTreeOrQueue = activeTreeInfo.queue;\n } else throw new Error('V2 trees are not supported yet');\n }\n\n // Pack output state trees\n const paddedOutputStateMerkleTrees = padOutputStateMerkleTrees(\n activeTreeOrQueue,\n tokenTransferOutputs.length,\n );\n const packedOutputTokenData: PackedTokenTransferOutputData[] = [];\n paddedOutputStateMerkleTrees.forEach((account, index) => {\n const merkleTreeIndex = getIndexOrAdd(_remainingAccounts, account);\n packedOutputTokenData.push({\n owner: tokenTransferOutputs[index].owner,\n amount: tokenTransferOutputs[index].amount,\n lamports: tokenTransferOutputs[index].lamports?.eq(bn(0))\n ? null\n : tokenTransferOutputs[index].lamports,\n merkleTreeIndex,\n tlv: null,\n });\n });\n // to meta\n const remainingAccountMetas = _remainingAccounts.map(\n (account): AccountMeta => ({\n pubkey: account,\n isWritable: true,\n isSigner: false,\n }),\n );\n\n return {\n inputTokenDataWithContext: packedInputTokenData,\n remainingAccountMetas,\n packedOutputTokenData,\n };\n}\n","import { ParsedTokenAccount } from '@lightprotocol/stateless.js';\nimport { PublicKey } from '@solana/web3.js';\n\n/**\n * Check if all input accounts belong to the same mint.\n *\n * @param compressedTokenAccounts The compressed token accounts\n * @param mint The mint of the token pool\n * @returns True if all input accounts belong to the same mint\n */\nexport function checkMint(\n compressedTokenAccounts: ParsedTokenAccount[],\n mint: PublicKey,\n): boolean {\n if (\n !compressedTokenAccounts.every(account =>\n account.parsed.mint.equals(mint),\n )\n ) {\n throw new Error(`All input accounts must belong to the same mint`);\n }\n\n return true;\n}\n","import {\n struct,\n option,\n vec,\n bool,\n u64,\n u8,\n publicKey,\n array,\n u32,\n u16,\n vecU8,\n} from '@coral-xyz/borsh';\nimport { AccountMeta, PublicKey } from '@solana/web3.js';\nimport { CompressedTokenProgram } from './program';\nimport {\n BatchCompressInstructionData,\n CompressedTokenInstructionDataApprove,\n CompressedTokenInstructionDataRevoke,\n CompressedTokenInstructionDataTransfer,\n CompressSplTokenAccountInstructionData,\n MintToInstructionData,\n} from './types';\nimport {\n APPROVE_DISCRIMINATOR,\n BATCH_COMPRESS_DISCRIMINATOR,\n COMPRESS_SPL_TOKEN_ACCOUNT_DISCRIMINATOR,\n MINT_TO_DISCRIMINATOR,\n REVOKE_DISCRIMINATOR,\n TRANSFER_DISCRIMINATOR,\n} from './constants';\nimport { Buffer } from 'buffer';\nimport { ValidityProof } from '@lightprotocol/stateless.js';\n\nconst CompressedProofLayout = struct([\n array(u8(), 32, 'a'),\n array(u8(), 64, 'b'),\n array(u8(), 32, 'c'),\n]);\n\nconst PackedTokenTransferOutputDataLayout = struct([\n publicKey('owner'),\n u64('amount'),\n option(u64(), 'lamports'),\n u8('merkleTreeIndex'),\n option(vecU8(), 'tlv'),\n]);\n\nconst InputTokenDataWithContextLayout = struct([\n u64('amount'),\n option(u8(), 'delegateIndex'),\n struct(\n [\n u8('merkleTreePubkeyIndex'),\n u8('queuePubkeyIndex'),\n u32('leafIndex'),\n bool('proveByIndex'),\n ],\n 'merkleContext',\n ),\n u16('rootIndex'),\n option(u64(), 'lamports'),\n option(vecU8(), 'tlv'),\n]);\n\nexport const DelegatedTransferLayout = struct([\n publicKey('owner'),\n option(u8(), 'delegateChangeAccountIndex'),\n]);\n\nexport const CpiContextLayout = struct([\n bool('setContext'),\n bool('firstSetContext'),\n u8('cpiContextAccountIndex'),\n]);\n\nexport const CompressedTokenInstructionDataTransferLayout = struct([\n option(CompressedProofLayout, 'proof'),\n publicKey('mint'),\n option(DelegatedTransferLayout, 'delegatedTransfer'),\n vec(InputTokenDataWithContextLayout, 'inputTokenDataWithContext'),\n vec(PackedTokenTransferOutputDataLayout, 'outputCompressedAccounts'),\n bool('isCompress'),\n option(u64(), 'compressOrDecompressAmount'),\n option(CpiContextLayout, 'cpiContext'),\n option(u8(), 'lamportsChangeAccountMerkleTreeIndex'),\n]);\n\nexport const mintToLayout = struct([\n vec(publicKey(), 'recipients'),\n vec(u64(), 'amounts'),\n option(u64(), 'lamports'),\n]);\n\nexport const batchCompressLayout = struct([\n vec(publicKey(), 'pubkeys'),\n option(vec(u64(), 'amounts'), 'amounts'),\n option(u64(), 'lamports'),\n option(u64(), 'amount'),\n u8('index'),\n u8('bump'),\n]);\n\nexport const compressSplTokenAccountInstructionDataLayout = struct([\n publicKey('owner'),\n option(u64(), 'remainingAmount'),\n option(CpiContextLayout, 'cpiContext'),\n]);\n\nexport function encodeMintToInstructionData(\n data: MintToInstructionData,\n): Buffer {\n const buffer = Buffer.alloc(1000);\n const len = mintToLayout.encode(\n {\n recipients: data.recipients,\n amounts: data.amounts,\n lamports: data.lamports,\n },\n buffer,\n );\n\n return Buffer.concat([\n new Uint8Array(MINT_TO_DISCRIMINATOR),\n new Uint8Array(buffer.subarray(0, len)),\n ]);\n}\n\nexport function decodeMintToInstructionData(\n buffer: Buffer,\n): MintToInstructionData {\n return mintToLayout.decode(\n buffer.subarray(MINT_TO_DISCRIMINATOR.length),\n ) as MintToInstructionData;\n}\n\nexport function encodeBatchCompressInstructionData(\n data: BatchCompressInstructionData,\n): Buffer {\n const buffer = Buffer.alloc(1000);\n const len = batchCompressLayout.encode(data, buffer);\n\n const lengthBuffer = Buffer.alloc(4);\n lengthBuffer.writeUInt32LE(len, 0);\n\n const dataBuffer = buffer.subarray(0, len);\n return Buffer.concat([\n new Uint8Array(BATCH_COMPRESS_DISCRIMINATOR),\n new Uint8Array(lengthBuffer),\n new Uint8Array(dataBuffer),\n ]);\n}\n\nexport function decodeBatchCompressInstructionData(\n buffer: Buffer,\n): BatchCompressInstructionData {\n return batchCompressLayout.decode(\n buffer.subarray(BATCH_COMPRESS_DISCRIMINATOR.length + 4),\n ) as BatchCompressInstructionData;\n}\n\nexport function encodeCompressSplTokenAccountInstructionData(\n data: CompressSplTokenAccountInstructionData,\n): Buffer {\n const buffer = Buffer.alloc(1000);\n const len = compressSplTokenAccountInstructionDataLayout.encode(\n {\n owner: data.owner,\n remainingAmount: data.remainingAmount,\n cpiContext: data.cpiContext,\n },\n buffer,\n );\n\n return Buffer.concat([\n new Uint8Array(COMPRESS_SPL_TOKEN_ACCOUNT_DISCRIMINATOR),\n new Uint8Array(buffer.subarray(0, len)),\n ]);\n}\n\nexport function decodeCompressSplTokenAccountInstructionData(\n buffer: Buffer,\n): CompressSplTokenAccountInstructionData {\n const data = compressSplTokenAccountInstructionDataLayout.decode(\n buffer.subarray(COMPRESS_SPL_TOKEN_ACCOUNT_DISCRIMINATOR.length),\n ) as CompressSplTokenAccountInstructionData;\n return {\n owner: data.owner,\n remainingAmount: data.remainingAmount,\n cpiContext: data.cpiContext,\n };\n}\nexport function encodeTransferInstructionData(\n data: CompressedTokenInstructionDataTransfer,\n): Buffer {\n const buffer = Buffer.alloc(1000);\n\n const len = CompressedTokenInstructionDataTransferLayout.encode(\n data,\n buffer,\n );\n\n const lengthBuffer = Buffer.alloc(4);\n lengthBuffer.writeUInt32LE(len, 0);\n\n const dataBuffer = buffer.subarray(0, len);\n\n return Buffer.concat([\n new Uint8Array(TRANSFER_DISCRIMINATOR),\n new Uint8Array(lengthBuffer),\n new Uint8Array(dataBuffer),\n ]);\n}\n\nexport function decodeTransferInstructionData(\n buffer: Buffer,\n): CompressedTokenInstructionDataTransfer {\n return CompressedTokenInstructionDataTransferLayout.decode(\n buffer.slice(TRANSFER_DISCRIMINATOR.length + 4),\n ) as CompressedTokenInstructionDataTransfer;\n}\n\ninterface BaseAccountsLayoutParams {\n feePayer: PublicKey;\n authority: PublicKey;\n cpiAuthorityPda: PublicKey;\n lightSystemProgram: PublicKey;\n registeredProgramPda: PublicKey;\n noopProgram: PublicKey;\n accountCompressionAuthority: PublicKey;\n accountCompressionProgram: PublicKey;\n selfProgram: PublicKey;\n systemProgram: PublicKey;\n}\nexport type createTokenPoolAccountsLayoutParams = {\n feePayer: PublicKey;\n tokenPoolPda: PublicKey;\n systemProgram: PublicKey;\n mint: PublicKey;\n tokenProgram: PublicKey;\n cpiAuthorityPda: PublicKey;\n};\n\nexport type addTokenPoolAccountsLayoutParams =\n createTokenPoolAccountsLayoutParams & {\n existingTokenPoolPda: PublicKey;\n };\n\nexport type mintToAccountsLayoutParams = BaseAccountsLayoutParams & {\n mint: PublicKey;\n tokenPoolPda: PublicKey;\n tokenProgram: PublicKey;\n merkleTree: PublicKey;\n solPoolPda: PublicKey | null;\n};\nexport type transferAccountsLayoutParams = BaseAccountsLayoutParams & {\n tokenPoolPda?: PublicKey;\n compressOrDecompressTokenAccount?: PublicKey;\n tokenProgram?: PublicKey;\n};\nexport type approveAccountsLayoutParams = BaseAccountsLayoutParams;\nexport type revokeAccountsLayoutParams = approveAccountsLayoutParams;\nexport type freezeAccountsLayoutParams = BaseAccountsLayoutParams & {\n mint: PublicKey;\n};\nexport type thawAccountsLayoutParams = freezeAccountsLayoutParams;\n\nexport const createTokenPoolAccountsLayout = (\n accounts: createTokenPoolAccountsLayoutParams,\n): AccountMeta[] => {\n const {\n feePayer,\n tokenPoolPda,\n systemProgram,\n mint,\n tokenProgram,\n cpiAuthorityPda,\n } = accounts;\n return [\n { pubkey: feePayer, isSigner: true, isWritable: true },\n { pubkey: tokenPoolPda, isSigner: false, isWritable: true },\n { pubkey: systemProgram, isSigner: false, isWritable: false },\n { pubkey: mint, isSigner: false, isWritable: true },\n { pubkey: tokenProgram, isSigner: false, isWritable: false },\n { pubkey: cpiAuthorityPda, isSigner: false, isWritable: false },\n ];\n};\n\nexport const addTokenPoolAccountsLayout = (\n accounts: addTokenPoolAccountsLayoutParams,\n): AccountMeta[] => {\n const {\n feePayer,\n tokenPoolPda,\n systemProgram,\n mint,\n tokenProgram,\n cpiAuthorityPda,\n existingTokenPoolPda,\n } = accounts;\n return [\n { pubkey: feePayer, isSigner: true, isWritable: true },\n { pubkey: tokenPoolPda, isSigner: false, isWritable: true },\n { pubkey: existingTokenPoolPda, isSigner: false, isWritable: false },\n { pubkey: systemProgram, isSigner: false, isWritable: false },\n { pubkey: mint, isSigner: false, isWritable: true },\n { pubkey: tokenProgram, isSigner: false, isWritable: false },\n { pubkey: cpiAuthorityPda, isSigner: false, isWritable: false },\n ];\n};\n\nexport const mintToAccountsLayout = (\n accounts: mintToAccountsLayoutParams,\n): AccountMeta[] => {\n const defaultPubkey = CompressedTokenProgram.programId;\n const {\n feePayer,\n authority,\n cpiAuthorityPda,\n mint,\n tokenPoolPda,\n tokenProgram,\n lightSystemProgram,\n registeredProgramPda,\n noopProgram,\n accountCompressionAuthority,\n accountCompressionProgram,\n merkleTree,\n selfProgram,\n systemProgram,\n solPoolPda,\n } = accounts;\n\n const accountsList: AccountMeta[] = [\n { pubkey: feePayer, isSigner: true, isWritable: true },\n { pubkey: authority, isSigner: true, isWritable: false },\n { pubkey: cpiAuthorityPda, isSigner: false, isWritable: false },\n { pubkey: mint, isSigner: false, isWritable: true },\n { pubkey: tokenPoolPda, isSigner: false, isWritable: true },\n { pubkey: tokenProgram, isSigner: false, isWritable: false },\n { pubkey: lightSystemProgram, isSigner: false, isWritable: false },\n { pubkey: registeredProgramPda, isSigner: false, isWritable: false },\n { pubkey: noopProgram, isSigner: false, isWritable: false },\n {\n pubkey: accountCompressionAuthority,\n isSigner: false,\n isWritable: false,\n },\n {\n pubkey: accountCompressionProgram,\n isSigner: false,\n isWritable: false,\n },\n { pubkey: merkleTree, isSigner: false, isWritable: true },\n { pubkey: selfProgram, isSigner: false, isWritable: false },\n { pubkey: systemProgram, isSigner: false, isWritable: false },\n {\n pubkey: solPoolPda ?? defaultPubkey,\n isSigner: false,\n isWritable: true,\n },\n ];\n\n return accountsList;\n};\n\nexport const transferAccountsLayout = (\n accounts: transferAccountsLayoutParams,\n): AccountMeta[] => {\n const defaultPubkey = CompressedTokenProgram.programId;\n const {\n feePayer,\n authority,\n cpiAuthorityPda,\n lightSystemProgram,\n registeredProgramPda,\n noopProgram,\n accountCompressionAuthority,\n accountCompressionProgram,\n selfProgram,\n tokenPoolPda,\n compressOrDecompressTokenAccount,\n tokenProgram,\n systemProgram,\n } = accounts;\n\n const accountsList: AccountMeta[] = [\n { pubkey: feePayer, isSigner: true, isWritable: true },\n { pubkey: authority, isSigner: true, isWritable: false },\n { pubkey: cpiAuthorityPda, isSigner: false, isWritable: false },\n { pubkey: lightSystemProgram, isSigner: false, isWritable: false },\n { pubkey: registeredProgramPda, isSigner: false, isWritable: false },\n { pubkey: noopProgram, isSigner: false, isWritable: false },\n {\n pubkey: accountCompressionAuthority,\n isSigner: false,\n isWritable: false,\n },\n {\n pubkey: accountCompressionProgram,\n isSigner: false,\n isWritable: false,\n },\n { pubkey: selfProgram, isSigner: false, isWritable: false },\n {\n pubkey: tokenPoolPda ?? defaultPubkey,\n isSigner: false,\n isWritable: true,\n },\n {\n pubkey: compressOrDecompressTokenAccount ?? defaultPubkey,\n isSigner: false,\n isWritable: true,\n },\n {\n pubkey: tokenProgram ?? defaultPubkey,\n isSigner: false,\n isWritable: false,\n },\n { pubkey: systemProgram, isSigner: false, isWritable: false },\n ];\n\n return accountsList;\n};\n\nexport const approveAccountsLayout = (\n accounts: approveAccountsLayoutParams,\n): AccountMeta[] => {\n const {\n feePayer,\n authority,\n cpiAuthorityPda,\n lightSystemProgram,\n registeredProgramPda,\n noopProgram,\n accountCompressionAuthority,\n accountCompressionProgram,\n selfProgram,\n systemProgram,\n } = accounts;\n\n return [\n { pubkey: feePayer, isSigner: true, isWritable: true },\n { pubkey: authority, isSigner: true, isWritable: false },\n { pubkey: cpiAuthorityPda, isSigner: false, isWritable: false },\n { pubkey: lightSystemProgram, isSigner: false, isWritable: false },\n { pubkey: registeredProgramPda, isSigner: false, isWritable: false },\n { pubkey: noopProgram, isSigner: false, isWritable: false },\n {\n pubkey: accountCompressionAuthority,\n isSigner: false,\n isWritable: false,\n },\n {\n pubkey: accountCompressionProgram,\n isSigner: false,\n isWritable: false,\n },\n { pubkey: selfProgram, isSigner: false, isWritable: false },\n { pubkey: systemProgram, isSigner: false, isWritable: false },\n ];\n};\n\nexport const revokeAccountsLayout = approveAccountsLayout;\n\nexport const freezeAccountsLayout = (\n accounts: freezeAccountsLayoutParams,\n): AccountMeta[] => {\n const {\n feePayer,\n authority,\n cpiAuthorityPda,\n lightSystemProgram,\n registeredProgramPda,\n noopProgram,\n accountCompressionAuthority,\n accountCompressionProgram,\n selfProgram,\n systemProgram,\n mint,\n } = accounts;\n\n return [\n { pubkey: feePayer, isSigner: true, isWritable: true },\n { pubkey: authority, isSigner: true, isWritable: false },\n { pubkey: cpiAuthorityPda, isSigner: false, isWritable: false },\n { pubkey: lightSystemProgram, isSigner: false, isWritable: false },\n { pubkey: registeredProgramPda, isSigner: false, isWritable: false },\n { pubkey: noopProgram, isSigner: false, isWritable: false },\n {\n pubkey: accountCompressionAuthority,\n isSigner: false,\n isWritable: false,\n },\n {\n pubkey: accountCompressionProgram,\n isSigner: false,\n isWritable: false,\n },\n { pubkey: selfProgram, isSigner: false, isWritable: false },\n { pubkey: systemProgram, isSigner: false, isWritable: false },\n { pubkey: mint, isSigner: false, isWritable: false },\n ];\n};\n\nexport const thawAccountsLayout = freezeAccountsLayout;\n\nexport const CompressedTokenInstructionDataApproveLayout = struct([\n struct(\n [array(u8(), 32, 'a'), array(u8(), 64, 'b'), array(u8(), 32, 'c')],\n 'proof',\n ),\n publicKey('mint'),\n vec(InputTokenDataWithContextLayout, 'inputTokenDataWithContext'),\n option(CpiContextLayout, 'cpiContext'),\n publicKey('delegate'),\n u64('delegatedAmount'),\n u8('delegateMerkleTreeIndex'),\n u8('changeAccountMerkleTreeIndex'),\n option(u64(), 'delegateLamports'),\n]);\n\nexport const CompressedTokenInstructionDataRevokeLayout = struct([\n struct(\n [array(u8(), 32, 'a'), array(u8(), 64, 'b'), array(u8(), 32, 'c')],\n 'proof',\n ),\n publicKey('mint'),\n vec(InputTokenDataWithContextLayout, 'inputTokenDataWithContext'),\n option(CpiContextLayout, 'cpiContext'),\n u8('outputAccountMerkleTreeIndex'),\n]);\n\n// Approve and revoke instuctions do not support optional proof yet.\nconst emptyProof: ValidityProof = {\n a: new Array(32).fill(0),\n b: new Array(64).fill(0),\n c: new Array(32).fill(0),\n};\n\nfunction isEmptyProof(proof: ValidityProof): boolean {\n return (\n proof.a.every(a => a === 0) &&\n proof.b.every(b => b === 0) &&\n proof.c.every(c => c === 0)\n );\n}\n\nexport function encodeApproveInstructionData(\n data: CompressedTokenInstructionDataApprove,\n): Buffer {\n const buffer = Buffer.alloc(1000);\n\n const proofOption = data.proof ?? emptyProof;\n\n const len = CompressedTokenInstructionDataApproveLayout.encode(\n {\n ...data,\n proof: proofOption,\n },\n buffer,\n );\n\n const lengthBuffer = Buffer.alloc(4);\n lengthBuffer.writeUInt32LE(len, 0);\n\n const dataBuffer = buffer.subarray(0, len);\n\n return Buffer.concat([\n new Uint8Array(APPROVE_DISCRIMINATOR),\n new Uint8Array(lengthBuffer),\n new Uint8Array(dataBuffer),\n ]);\n}\n\nexport function decodeApproveInstructionData(\n buffer: Buffer,\n): CompressedTokenInstructionDataApprove {\n const data = CompressedTokenInstructionDataApproveLayout.decode(\n buffer.subarray(APPROVE_DISCRIMINATOR.length),\n ) as CompressedTokenInstructionDataApprove;\n return {\n ...data,\n proof: isEmptyProof(data.proof!) ? null : data.proof!,\n };\n}\n\nexport function encodeRevokeInstructionData(\n data: CompressedTokenInstructionDataRevoke,\n): Buffer {\n const buffer = Buffer.alloc(1000);\n\n const proofOption = data.proof ?? emptyProof;\n\n const len = CompressedTokenInstructionDataRevokeLayout.encode(\n {\n ...data,\n proof: proofOption,\n },\n buffer,\n );\n\n const lengthBuffer = Buffer.alloc(4);\n lengthBuffer.writeUInt32LE(len, 0);\n\n const dataBuffer = buffer.subarray(0, len);\n\n return Buffer.concat([\n new Uint8Array(REVOKE_DISCRIMINATOR),\n new Uint8Array(lengthBuffer),\n new Uint8Array(dataBuffer),\n ]);\n}\n\nexport function decodeRevokeInstructionData(\n buffer: Buffer,\n): CompressedTokenInstructionDataRevoke {\n const data = CompressedTokenInstructionDataRevokeLayout.decode(\n buffer.subarray(REVOKE_DISCRIMINATOR.length),\n ) as CompressedTokenInstructionDataRevoke;\n return {\n ...data,\n proof: isEmptyProof(data.proof!) ? null : data.proof!,\n };\n}\n","import {\n PublicKey,\n TransactionInstruction,\n SystemProgram,\n Connection,\n AddressLookupTableProgram,\n AccountMeta,\n ComputeBudgetProgram,\n} from '@solana/web3.js';\nimport BN from 'bn.js';\nimport { Buffer } from 'buffer';\nimport {\n ValidityProof,\n LightSystemProgram,\n ParsedTokenAccount,\n bn,\n defaultStaticAccountsStruct,\n sumUpLamports,\n toArray,\n validateSameOwner,\n validateSufficientBalance,\n defaultTestStateTreeAccounts,\n TreeInfo,\n CompressedProof,\n featureFlags,\n TreeType,\n} from '@lightprotocol/stateless.js';\nimport {\n MINT_SIZE,\n TOKEN_2022_PROGRAM_ID,\n TOKEN_PROGRAM_ID,\n createInitializeMint2Instruction,\n createMintToInstruction,\n} from '@solana/spl-token';\nimport {\n CPI_AUTHORITY_SEED,\n POOL_SEED,\n CREATE_TOKEN_POOL_DISCRIMINATOR,\n ADD_TOKEN_POOL_DISCRIMINATOR,\n} from './constants';\nimport { checkMint, packCompressedTokenAccounts } from './utils';\nimport {\n encodeTransferInstructionData,\n encodeCompressSplTokenAccountInstructionData,\n encodeMintToInstructionData,\n createTokenPoolAccountsLayout,\n mintToAccountsLayout,\n transferAccountsLayout,\n approveAccountsLayout,\n revokeAccountsLayout,\n encodeApproveInstructionData,\n encodeRevokeInstructionData,\n addTokenPoolAccountsLayout,\n encodeBatchCompressInstructionData,\n} from './layout';\nimport {\n BatchCompressInstructionData,\n CompressedTokenInstructionDataApprove,\n CompressedTokenInstructionDataRevoke,\n CompressedTokenInstructionDataTransfer,\n DelegatedTransfer,\n TokenTransferOutputData,\n} from './types';\nimport {\n checkTokenPoolInfo,\n TokenPoolInfo,\n} from './utils/get-token-pool-infos';\n\nexport type CompressParams = {\n /**\n * Fee payer\n */\n payer: PublicKey;\n /**\n * Owner of uncompressed token account\n */\n owner: PublicKey;\n /**\n * Source SPL Token account address\n */\n source: PublicKey;\n /**\n * Recipient address(es)\n */\n toAddress: PublicKey | PublicKey[];\n /**\n * Token amount(s) to compress\n */\n amount: number | BN | number[] | BN[];\n /**\n * SPL Token mint address\n */\n mint: PublicKey;\n /**\n * State tree to write to\n */\n outputStateTreeInfo: TreeInfo;\n /**\n * Token pool\n */\n tokenPoolInfo: TokenPoolInfo;\n};\n\nexport type CompressSplTokenAccountParams = {\n /**\n * Fee payer\n */\n feePayer: PublicKey;\n /**\n * SPL Token account owner\n */\n authority: PublicKey;\n /**\n * SPL Token account to compress\n */\n tokenAccount: PublicKey;\n /**\n * SPL Token mint address\n */\n mint: PublicKey;\n /**\n * Amount to leave in token account\n */\n remainingAmount?: BN;\n /**\n * State tree to write to\n */\n outputStateTreeInfo: TreeInfo;\n /**\n * Token pool\n */\n tokenPoolInfo: TokenPoolInfo;\n};\n\nexport type DecompressParams = {\n /**\n * Fee payer\n */\n payer: PublicKey;\n /**\n * Source compressed token accounts\n */\n inputCompressedTokenAccounts: ParsedTokenAccount[];\n /**\n * Destination uncompressed token account\n */\n toAddress: PublicKey;\n /**\n * Token amount to decompress\n */\n amount: number | BN;\n /**\n * Validity proof for input state\n */\n recentValidityProof: ValidityProof | CompressedProof | null;\n /**\n * Recent state root indices\n */\n recentInputStateRootIndices: number[];\n /**\n * Token pool(s)\n */\n tokenPoolInfos: TokenPoolInfo | TokenPoolInfo[];\n};\n\nexport type TransferParams = {\n /**\n * Fee payer\n */\n payer: PublicKey;\n /**\n * Source compressed token accounts\n */\n inputCompressedTokenAccounts: ParsedTokenAccount[];\n /**\n * Recipient address\n */\n toAddress: PublicKey;\n /**\n * Token amount to transfer\n */\n amount: BN | number;\n /**\n * Validity proof for input state\n */\n recentValidityProof: ValidityProof | CompressedProof | null;\n /**\n * Recent state root indices\n */\n recentInputStateRootIndices: number[];\n};\n\nexport type ApproveParams = {\n /**\n * Fee payer\n */\n payer: PublicKey;\n /**\n * Source compressed token accounts\n */\n inputCompressedTokenAccounts: ParsedTokenAccount[];\n /**\n * Recipient address\n */\n toAddress: PublicKey;\n /**\n * Token amount to approve\n */\n amount: BN | number;\n /**\n * Validity proof for input state\n */\n recentValidityProof: ValidityProof | CompressedProof | null;\n /**\n * Recent state root indices\n */\n recentInputStateRootIndices: number[];\n};\n\nexport type RevokeParams = {\n /**\n * Fee payer\n */\n payer: PublicKey;\n /**\n * Input compressed token accounts\n */\n inputCompressedTokenAccounts: ParsedTokenAccount[];\n /**\n * Validity proof for input state\n */\n recentValidityProof: ValidityProof | CompressedProof | null;\n /**\n * Recent state root indices\n */\n recentInputStateRootIndices: number[];\n};\n\n/**\n * Create Mint account for compressed Tokens\n */\nexport type CreateMintParams = {\n /**\n * Fee payer\n */\n feePayer: PublicKey;\n /**\n * SPL Mint address\n */\n mint: PublicKey;\n /**\n * Mint authority\n */\n authority: PublicKey;\n /**\n * Optional: freeze authority\n */\n freezeAuthority: PublicKey | null;\n /**\n * Mint decimals\n */\n decimals: number;\n /**\n * lamport amount for mint account rent exemption\n */\n rentExemptBalance: number;\n /**\n * Optional: The token program ID. Default: SPL Token Program ID\n */\n tokenProgramId?: PublicKey;\n /**\n * Optional: Mint size to use, defaults to MINT_SIZE\n */\n mintSize?: number;\n};\n\n/**\n * Parameters for merging compressed token accounts\n */\nexport type MergeTokenAccountsParams = {\n /**\n * Fee payer\n */\n payer: PublicKey;\n /**\n * Owner of the compressed token accounts to be merged\n */\n owner: PublicKey;\n /**\n * SPL Token mint address\n */\n mint: PublicKey;\n /**\n * Array of compressed token accounts to merge\n */\n inputCompressedTokenAccounts: ParsedTokenAccount[];\n /**\n * Validity proof for state inclusion\n */\n recentValidityProof: ValidityProof | CompressedProof | null;\n /**\n * State root indices of the input state\n */\n recentInputStateRootIndices: number[];\n};\n\n/**\n * Create compressed token accounts\n */\nexport type MintToParams = {\n /**\n * Fee payer\n */\n feePayer: PublicKey;\n /**\n * Token mint address\n */\n mint: PublicKey;\n /**\n * Mint authority\n */\n authority: PublicKey;\n /**\n * Recipient address(es)\n */\n toPubkey: PublicKey[] | PublicKey;\n /**\n * Token amount(s) to mint\n */\n amount: BN | BN[] | number | number[];\n /**\n * State tree for minted tokens\n */\n outputStateTreeInfo: TreeInfo;\n /**\n * Token pool\n */\n tokenPoolInfo: TokenPoolInfo;\n};\n\n/**\n * Register an existing SPL mint account to the compressed token program\n * Creates an omnibus account for the mint\n */\nexport type CreateTokenPoolParams = {\n /**\n * Fee payer\n */\n feePayer: PublicKey;\n /**\n * SPL Mint address\n */\n mint: PublicKey;\n /**\n * Optional: The token program ID. Default: SPL Token Program ID\n */\n tokenProgramId?: PublicKey;\n};\n\nexport type AddTokenPoolParams = {\n /**\n * Fee payer\n */\n feePayer: PublicKey;\n /**\n * Token mint address\n */\n mint: PublicKey;\n /**\n * Token pool index\n */\n poolIndex: number;\n /**\n * Optional: Token program ID. Default: SPL Token Program ID\n */\n tokenProgramId?: PublicKey;\n};\n\n/**\n * Mint from existing SPL mint to compressed token accounts\n */\nexport type ApproveAndMintToParams = {\n /**\n * Fee payer\n */\n feePayer: PublicKey;\n /**\n * SPL Mint address\n */\n mint: PublicKey;\n /**\n * Mint authority\n */\n authority: PublicKey;\n /**\n * Mint authority (associated) token account\n */\n authorityTokenAccount: PublicKey;\n /**\n * Recipient address\n */\n toPubkey: PublicKey;\n /**\n * Token amount to mint\n */\n amount: BN | number;\n /**\n * State tree to write to\n */\n outputStateTreeInfo: TreeInfo;\n /**\n * Token pool\n */\n tokenPoolInfo: TokenPoolInfo;\n};\n\nexport type CreateTokenProgramLookupTableParams = {\n /**\n * Fee payer\n */\n payer: PublicKey;\n /**\n * Authority of the transaction\n */\n authority: PublicKey;\n /**\n * Optional Mint addresses to store in the lookup table\n */\n mints?: PublicKey[];\n /**\n * Recently finalized Solana slot\n */\n recentSlot: number;\n /**\n * Optional additional addresses to store in the lookup table\n */\n remainingAccounts?: PublicKey[];\n};\n\n/**\n * Sum up the token amounts of the compressed token accounts\n */\nexport const sumUpTokenAmount = (accounts: ParsedTokenAccount[]): BN => {\n return accounts.reduce(\n (acc, account: ParsedTokenAccount) => acc.add(account.parsed.amount),\n bn(0),\n );\n};\n\n/**\n * Validate that all the compressed token accounts are owned by the same owner.\n */\nexport const validateSameTokenOwner = (accounts: ParsedTokenAccount[]) => {\n const owner = accounts[0].parsed.owner;\n accounts.forEach(acc => {\n if (!acc.parsed.owner.equals(owner)) {\n throw new Error('Token accounts must be owned by the same owner');\n }\n });\n};\n\n/**\n * Parse compressed token accounts to get the mint, current owner and delegate.\n */\nexport const parseTokenData = (\n compressedTokenAccounts: ParsedTokenAccount[],\n) => {\n const mint = compressedTokenAccounts[0].parsed.mint;\n const currentOwner = compressedTokenAccounts[0].parsed.owner;\n const delegate = compressedTokenAccounts[0].parsed.delegate;\n\n return { mint, currentOwner, delegate };\n};\n\nexport const parseMaybeDelegatedTransfer = (\n inputs: ParsedTokenAccount[],\n outputs: TokenTransferOutputData[],\n): { delegatedTransfer: DelegatedTransfer | null; authority: PublicKey } => {\n if (inputs.length < 1)\n throw new Error('Must supply at least one input token account.');\n\n const owner = inputs[0].parsed.owner;\n\n const delegatedAccountsIndex = inputs.findIndex(a => a.parsed.delegate);\n\n /// Fast path: no delegated account used\n if (delegatedAccountsIndex === -1)\n return { delegatedTransfer: null, authority: owner };\n\n const delegate = inputs[delegatedAccountsIndex].parsed.delegate;\n const delegateChangeAccountIndex = outputs.length <= 1 ? null : 0;\n\n return {\n delegatedTransfer: {\n owner,\n delegateChangeAccountIndex,\n },\n authority: delegate!,\n };\n};\n\n/**\n * Create the output state for a transfer transaction.\n * @param inputCompressedTokenAccounts Input state\n * @param toAddress Recipient address\n * @param amount Amount of tokens to transfer\n * @returns Output token data for the transfer\n * instruction\n */\nexport function createTransferOutputState(\n inputCompressedTokenAccounts: ParsedTokenAccount[],\n toAddress: PublicKey,\n amount: number | BN,\n): TokenTransferOutputData[] {\n amount = bn(amount);\n const inputAmount = sumUpTokenAmount(inputCompressedTokenAccounts);\n const inputLamports = sumUpLamports(\n inputCompressedTokenAccounts.map(acc => acc.compressedAccount),\n );\n\n const changeAmount = inputAmount.sub(amount);\n\n validateSufficientBalance(changeAmount);\n\n if (changeAmount.eq(bn(0)) && inputLamports.eq(bn(0))) {\n return [\n {\n owner: toAddress,\n amount,\n lamports: inputLamports,\n tlv: null,\n },\n ];\n }\n\n /// validates token program\n validateSameOwner(\n inputCompressedTokenAccounts.map(acc => acc.compressedAccount),\n );\n validateSameTokenOwner(inputCompressedTokenAccounts);\n\n const outputCompressedAccounts: TokenTransferOutputData[] = [\n {\n owner: inputCompressedTokenAccounts[0].parsed.owner,\n amount: changeAmount,\n lamports: inputLamports,\n tlv: null,\n },\n {\n owner: toAddress,\n amount,\n lamports: bn(0),\n tlv: null,\n },\n ];\n return outputCompressedAccounts;\n}\n\n/**\n * Create the output state for a compress transaction.\n * @param inputCompressedTokenAccounts Input state\n * @param amount Amount of tokens to compress\n * @returns Output token data for the compress\n * instruction\n */\nexport function createDecompressOutputState(\n inputCompressedTokenAccounts: ParsedTokenAccount[],\n amount: number | BN,\n): TokenTransferOutputData[] {\n amount = bn(amount);\n const inputLamports = sumUpLamports(\n inputCompressedTokenAccounts.map(acc => acc.compressedAccount),\n );\n const inputAmount = sumUpTokenAmount(inputCompressedTokenAccounts);\n const changeAmount = inputAmount.sub(amount);\n\n validateSufficientBalance(changeAmount);\n\n /// lamports gets decompressed\n if (changeAmount.eq(bn(0)) && inputLamports.eq(bn(0))) {\n return [];\n }\n\n validateSameOwner(\n inputCompressedTokenAccounts.map(acc => acc.compressedAccount),\n );\n validateSameTokenOwner(inputCompressedTokenAccounts);\n\n const tokenTransferOutputs: TokenTransferOutputData[] = [\n {\n owner: inputCompressedTokenAccounts[0].parsed.owner,\n amount: changeAmount,\n lamports: inputLamports,\n tlv: null,\n },\n ];\n return tokenTransferOutputs;\n}\n\nexport class CompressedTokenProgram {\n /**\n * @internal\n */\n constructor() {}\n\n /**\n * Public key that identifies the CompressedPda program\n */\n static programId: PublicKey = new PublicKey(\n 'cTokenmWW8bLPjZEBAUgYy3zKxQZW6VKi7bqNFEVv3m',\n );\n\n /**\n * Set a custom programId via PublicKey or base58 encoded string.\n * This method is not required for regular usage.\n *\n * Use this only if you know what you are doing.\n */\n static setProgramId(programId: PublicKey | string) {\n this.programId =\n typeof programId === 'string'\n ? new PublicKey(programId)\n : programId;\n }\n\n /**\n * Derive the token pool pda.\n * To derive the token pool pda with bump, use {@link deriveTokenPoolPdaWithIndex}.\n *\n * @param mint The mint of the token pool\n *\n * @returns The token pool pda\n */\n static deriveTokenPoolPda(mint: PublicKey): PublicKey {\n const seeds = [POOL_SEED, mint.toBuffer()];\n const [address, _] = PublicKey.findProgramAddressSync(\n seeds,\n this.programId,\n );\n return address;\n }\n\n /**\n * Find the index and bump for a given token pool pda and mint.\n *\n * @param poolPda The token pool pda to find the index and bump for\n * @param mint The mint of the token pool\n *\n * @returns The index and bump number.\n */\n static findTokenPoolIndexAndBump(\n poolPda: PublicKey,\n mint: PublicKey,\n ): [number, number] {\n for (let index = 0; index < 5; index++) {\n const derivedPda =\n CompressedTokenProgram.deriveTokenPoolPdaWithIndex(mint, index);\n if (derivedPda[0].equals(poolPda)) {\n return [index, derivedPda[1]];\n }\n }\n throw new Error('Token pool not found');\n }\n\n /**\n * Derive the token pool pda with index.\n *\n * @param mint The mint of the token pool\n * @param index Index. starts at 0. The Protocol supports 4 indexes aka token pools\n * per mint.\n *\n * @returns The token pool pda and bump.\n */\n static deriveTokenPoolPdaWithIndex(\n mint: PublicKey,\n index: number,\n ): [PublicKey, number] {\n let seeds: Buffer[] = [];\n if (index === 0) {\n seeds = [Buffer.from('pool'), mint.toBuffer(), Buffer.from([])]; // legacy, 1st\n } else {\n seeds = [\n Buffer.from('pool'),\n mint.toBuffer(),\n Buffer.from([index]),\n ];\n }\n const [address, bump] = PublicKey.findProgramAddressSync(\n seeds,\n this.programId,\n );\n return [address, bump];\n }\n\n /** @internal */\n static get deriveCpiAuthorityPda(): PublicKey {\n const [address, _] = PublicKey.findProgramAddressSync(\n [CPI_AUTHORITY_SEED],\n this.programId,\n );\n return address;\n }\n\n /**\n * Construct createMint instruction for compressed tokens.\n *\n * @param feePayer Fee payer.\n * @param mint SPL Mint address.\n * @param authority Mint authority.\n * @param freezeAuthority Optional: freeze authority.\n * @param decimals Decimals.\n * @param rentExemptBalance Lamport amount for mint account rent exemption.\n * @param tokenProgramId Optional: Token program ID. Default: SPL Token Program ID\n * @param mintSize Optional: mint size. Default: MINT_SIZE\n *\n * @returns [createMintAccountInstruction, initializeMintInstruction,\n * createTokenPoolInstruction]\n *\n * Note that `createTokenPoolInstruction` must be executed after\n * `initializeMintInstruction`.\n */\n static async createMint({\n feePayer,\n mint,\n authority,\n freezeAuthority,\n decimals,\n rentExemptBalance,\n tokenProgramId,\n mintSize,\n }: CreateMintParams): Promise<TransactionInstruction[]> {\n const tokenProgram = tokenProgramId ?? TOKEN_PROGRAM_ID;\n\n /// Create and initialize SPL Mint account\n const createMintAccountInstruction = SystemProgram.createAccount({\n fromPubkey: feePayer,\n lamports: rentExemptBalance,\n newAccountPubkey: mint,\n programId: tokenProgram,\n space: mintSize ?? MINT_SIZE,\n });\n\n const initializeMintInstruction = createInitializeMint2Instruction(\n mint,\n decimals,\n authority,\n freezeAuthority,\n tokenProgram,\n );\n\n const createTokenPoolInstruction = await this.createTokenPool({\n feePayer,\n mint,\n tokenProgramId: tokenProgram,\n });\n\n return [\n createMintAccountInstruction,\n initializeMintInstruction,\n createTokenPoolInstruction,\n ];\n }\n\n /**\n * Enable compression for an existing SPL mint, creating an omnibus account.\n * For new mints, use `CompressedTokenProgram.createMint`.\n *\n * @param feePayer Fee payer.\n * @param mint SPL Mint address.\n * @param tokenProgramId Optional: Token program ID. Default: SPL\n * Token Program ID\n *\n * @returns The createTokenPool instruction\n */\n static async createTokenPool({\n feePayer,\n mint,\n tokenProgramId,\n }: CreateTokenPoolParams): Promise<TransactionInstruction> {\n const tokenProgram = tokenProgramId ?? TOKEN_PROGRAM_ID;\n\n const tokenPoolPda = this.deriveTokenPoolPdaWithIndex(mint, 0);\n\n const keys = createTokenPoolAccountsLayout({\n mint,\n feePayer,\n tokenPoolPda: tokenPoolPda[0],\n tokenProgram,\n cpiAuthorityPda: this.deriveCpiAuthorityPda,\n systemProgram: SystemProgram.programId,\n });\n\n return new TransactionInstruction({\n programId: this.programId,\n keys,\n data: CREATE_TOKEN_POOL_DISCRIMINATOR,\n });\n }\n\n /**\n * Add a token pool to an existing SPL mint. For new mints, use\n * {@link createTokenPool}.\n *\n * @param feePayer Fee payer.\n * @param mint SPL Mint address.\n * @param poolIndex Pool index.\n * @param tokenProgramId Optional: Token program ID. Default: SPL\n * Token Program ID\n *\n * @returns The addTokenPool instruction\n */\n static async addTokenPool({\n feePayer,\n mint,\n poolIndex,\n tokenProgramId,\n }: AddTokenPoolParams): Promise<TransactionInstruction> {\n if (poolIndex <= 0) {\n throw new Error(\n 'Pool index must be greater than 0. For 0, use CreateTokenPool instead.',\n );\n }\n if (poolIndex > 3) {\n throw new Error(\n `Invalid poolIndex ${poolIndex}. Max 4 pools per mint.`,\n );\n }\n\n const tokenProgram = tokenProgramId ?? TOKEN_PROGRAM_ID;\n\n const existingTokenPoolPda = this.deriveTokenPoolPdaWithIndex(\n mint,\n poolIndex - 1,\n );\n const tokenPoolPda = this.deriveTokenPoolPdaWithIndex(mint, poolIndex);\n\n const keys = addTokenPoolAccountsLayout({\n mint,\n feePayer,\n tokenPoolPda: tokenPoolPda[0],\n existingTokenPoolPda: existingTokenPoolPda[0],\n tokenProgram,\n cpiAuthorityPda: this.deriveCpiAuthorityPda,\n systemProgram: SystemProgram.programId,\n });\n\n return new TransactionInstruction({\n programId: this.programId,\n keys,\n data: Buffer.concat([\n new Uint8Array(ADD_TOKEN_POOL_DISCRIMINATOR),\n new Uint8Array(Buffer.from([poolIndex])),\n ]),\n });\n }\n\n /**\n * Construct mintTo instruction for compressed tokens\n *\n * @param feePayer Fee payer.\n * @param mint SPL Mint address.\n * @param authority Mint authority.\n * @param toPubkey Recipient owner address.\n * @param amount Amount of tokens to mint.\n * @param outputStateTreeInfo State tree to write to.\n * @param tokenPoolInfo Token pool info.\n *\n * @returns The mintTo instruction\n */\n static async mintTo({\n feePayer,\n mint,\n authority,\n toPubkey,\n amount,\n outputStateTreeInfo,\n tokenPoolInfo,\n }: MintToParams): Promise<TransactionInstruction> {\n const systemKeys = defaultStaticAccountsStruct();\n const tokenProgram = tokenPoolInfo.tokenProgram;\n checkTokenPoolInfo(tokenPoolInfo, mint);\n\n const amounts = toArray<BN | number>(amount).map(amount => bn(amount));\n const toPubkeys = toArray(toPubkey);\n\n if (amounts.length !== toPubkeys.length) {\n throw new Error(\n 'Amount and toPubkey arrays must have the same length',\n );\n }\n\n const keys = mintToAccountsLayout({\n mint,\n feePayer,\n authority,\n cpiAuthorityPda: this.deriveCpiAuthorityPda,\n tokenProgram,\n tokenPoolPda: tokenPoolInfo.tokenPoolPda,\n lightSystemProgram: LightSystemProgram.programId,\n registeredProgramPda: systemKeys.registeredProgramPda,\n noopProgram: systemKeys.noopProgram,\n accountCompressionAuthority: systemKeys.accountCompressionAuthority,\n accountCompressionProgram: systemKeys.accountCompressionProgram,\n merkleTree:\n outputStateTreeInfo.treeType === TreeType.StateV2\n ? outputStateTreeInfo.queue\n : outputStateTreeInfo.tree,\n selfProgram: this.programId,\n systemProgram: SystemProgram.programId,\n solPoolPda: null,\n });\n\n const data = encodeMintToInstructionData({\n recipients: toPubkeys,\n amounts,\n lamports: null,\n });\n\n return new TransactionInstruction({\n programId: this.programId,\n keys,\n data,\n });\n }\n\n /**\n * Mint tokens from registered SPL mint account to a compressed account\n *\n * @param feePayer Fee payer.\n * @param mint SPL Mint address.\n * @param authority Mint authority.\n * @param authorityTokenAccount The mint authority's associated token\n * account (ATA).\n * @param toPubkey Recipient owner address.\n * @param amount Amount of tokens to mint.\n * @param outputStateTreeInfo State tree to write to.\n * @param tokenPoolInfo Token pool info.\n *\n * @returns The mintTo instruction\n */\n static async approveAndMintTo({\n feePayer,\n mint,\n authority,\n authorityTokenAccount,\n toPubkey,\n amount,\n outputStateTreeInfo,\n tokenPoolInfo,\n }: ApproveAndMintToParams) {\n const amountBigInt: bigint = BigInt(amount.toString());\n\n /// 1. Mint to existing ATA of mintAuthority.\n const splMintToInstruction = createMintToInstruction(\n mint,\n authorityTokenAccount,\n authority,\n amountBigInt,\n [],\n tokenPoolInfo.tokenProgram,\n );\n\n /// 2. Compress from mint authority ATA to recipient compressed account\n const compressInstruction = await this.compress({\n payer: feePayer,\n owner: authority,\n source: authorityTokenAccount,\n toAddress: toPubkey,\n mint,\n amount,\n outputStateTreeInfo,\n tokenPoolInfo,\n });\n\n return [splMintToInstruction, compressInstruction];\n }\n\n /**\n * Construct transfer instruction for compressed tokens\n *\n * @param payer Fee payer.\n * @param inputCompressedTokenAccounts Source compressed token accounts.\n * @param toAddress Recipient owner address.\n * @param amount Amount of tokens to transfer.\n * @param recentValidityProof Recent validity proof.\n * @param recentInputStateRootIndices Recent state root indices.\n *\n * @returns The transfer instruction\n */\n static async transfer({\n payer,\n inputCompressedTokenAccounts,\n toAddress,\n amount,\n recentValidityProof,\n recentInputStateRootIndices,\n }: TransferParams): Promise<TransactionInstruction> {\n const tokenTransferOutputs: TokenTransferOutputData[] =\n createTransferOutputState(\n inputCompressedTokenAccounts,\n toAddress,\n amount,\n );\n\n const {\n inputTokenDataWithContext,\n packedOutputTokenData,\n remainingAccountMetas,\n } = packCompressedTokenAccounts({\n inputCompressedTokenAccounts,\n rootIndices: recentInputStateRootIndices,\n tokenTransferOutputs,\n });\n\n const { mint } = parseTokenData(inputCompressedTokenAccounts);\n\n const { delegatedTransfer, authority } = parseMaybeDelegatedTransfer(\n inputCompressedTokenAccounts,\n tokenTransferOutputs,\n );\n\n const rawData: CompressedTokenInstructionDataTransfer = {\n proof: recentValidityProof,\n mint,\n delegatedTransfer,\n inputTokenDataWithContext,\n outputCompressedAccounts: packedOutputTokenData,\n compressOrDecompressAmount: null,\n isCompress: false,\n cpiContext: null,\n lamportsChangeAccountMerkleTreeIndex: null,\n };\n const data = encodeTransferInstructionData(rawData);\n\n const {\n accountCompressionAuthority,\n noopProgram,\n registeredProgramPda,\n accountCompressionProgram,\n } = defaultStaticAccountsStruct();\n const keys = transferAccountsLayout({\n feePayer: payer,\n authority,\n cpiAuthorityPda: this.deriveCpiAuthorityPda,\n lightSystemProgram: LightSystemProgram.programId,\n registeredProgramPda: registeredProgramPda,\n noopProgram: noopProgram,\n accountCompressionAuthority: accountCompressionAuthority,\n accountCompressionProgram: accountCompressionProgram,\n selfProgram: this.programId,\n tokenPoolPda: undefined,\n compressOrDecompressTokenAccount: undefined,\n tokenProgram: undefined,\n systemProgram: SystemProgram.programId,\n });\n\n keys.push(...remainingAccountMetas);\n\n return new TransactionInstruction({\n programId: this.programId,\n keys,\n data,\n });\n }\n\n /**\n * Create lookup table instructions for the token program's default\n * accounts.\n *\n * @param payer Fee payer.\n * @param authority Authority.\n * @param mints Mints.\n * @param recentSlot Recent slot.\n * @param remainingAccounts Remaining accounts.\n *\n * @returns [createInstruction, extendInstruction, option(extendInstruction2)]\n */\n static async createTokenProgramLookupTable({\n payer,\n authority,\n mints,\n recentSlot,\n remainingAccounts,\n }: CreateTokenProgramLookupTableParams) {\n const [createInstruction, lookupTableAddress] =\n AddressLookupTableProgram.createLookupTable({\n authority,\n payer: authority,\n recentSlot,\n });\n\n let optionalMintKeys: PublicKey[] = [];\n if (mints) {\n optionalMintKeys = [\n ...mints,\n ...mints.map(mint => this.deriveTokenPoolPda(mint)),\n ];\n }\n\n const extendInstruction = AddressLookupTableProgram.extendLookupTable({\n payer,\n authority,\n lookupTable: lookupTableAddress,\n addresses: [\n SystemProgram.programId,\n ComputeBudgetProgram.programId,\n this.deriveCpiAuthorityPda,\n LightSystemProgram.programId,\n CompressedTokenProgram.programId,\n defaultStaticAccountsStruct().registeredProgramPda,\n defaultStaticAccountsStruct().noopProgram,\n defaultStaticAccountsStruct().accountCompressionAuthority,\n defaultStaticAccountsStruct().accountCompressionProgram,\n defaultTestStateTreeAccounts().merkleTree,\n defaultTestStateTreeAccounts().nullifierQueue,\n defaultTestStateTreeAccounts().addressTree,\n defaultTestStateTreeAccounts().addressQueue,\n this.programId,\n TOKEN_PROGRAM_ID,\n TOKEN_2022_PROGRAM_ID,\n authority,\n ...optionalMintKeys,\n ],\n });\n\n const instructions = [createInstruction, extendInstruction];\n\n if (remainingAccounts && remainingAccounts.length > 0) {\n for (let i = 0; i < remainingAccounts.length; i += 25) {\n const chunk = remainingAccounts.slice(i, i + 25);\n const extendIx = AddressLookupTableProgram.extendLookupTable({\n payer,\n authority,\n lookupTable: lookupTableAddress,\n addresses: chunk,\n });\n instructions.push(extendIx);\n }\n }\n\n return {\n instructions,\n address: lookupTableAddress,\n };\n }\n\n /**\n * Create compress instruction\n *\n * @param payer Fee payer.\n * @param owner Owner of uncompressed token account.\n * @param source Source SPL Token account address.\n * @param toAddress Recipient owner address(es).\n * @param amount Amount of tokens to compress.\n * @param mint SPL Token mint address.\n * @param outputStateTreeInfo State tree to write to.\n * @param tokenPoolInfo Token pool info.\n *\n * @returns The compress instruction\n */\n static async compress({\n payer,\n owner,\n source,\n toAddress,\n amount,\n mint,\n outputStateTreeInfo,\n tokenPoolInfo,\n }: CompressParams): Promise<TransactionInstruction> {\n let tokenTransferOutputs: TokenTransferOutputData[];\n\n const amountArray = toArray<BN | number>(amount);\n const toAddressArray = toArray(toAddress);\n\n checkTokenPoolInfo(tokenPoolInfo, mint);\n\n if (amountArray.length !== toAddressArray.length) {\n throw new Error(\n 'Amount and toAddress arrays must have the same length',\n );\n }\n if (featureFlags.isV2()) {\n const [index, bump] = this.findTokenPoolIndexAndBump(\n tokenPoolInfo.tokenPoolPda,\n mint,\n );\n const rawData: BatchCompressInstructionData = {\n pubkeys: toAddressArray,\n amounts:\n amountArray.length > 1\n ? amountArray.map(amt => bn(amt))\n : null,\n lamports: null,\n amount: amountArray.length === 1 ? bn(amountArray[0]) : null,\n index,\n bump,\n };\n\n const data = encodeBatchCompressInstructionData(rawData);\n const keys = mintToAccountsLayout({\n mint,\n feePayer: payer,\n authority: owner,\n cpiAuthorityPda: this.deriveCpiAuthorityPda,\n tokenProgram: tokenPoolInfo.tokenProgram,\n tokenPoolPda: tokenPoolInfo.tokenPoolPda,\n lightSystemProgram: LightSystemProgram.programId,\n ...defaultStaticAccountsStruct(),\n merkleTree: outputStateTreeInfo.queue,\n selfProgram: this.programId,\n systemProgram: SystemProgram.programId,\n solPoolPda: null,\n });\n keys.push({\n pubkey: source,\n isWritable: true,\n isSigner: false,\n });\n\n return new TransactionInstruction({\n programId: this.programId,\n keys,\n data,\n });\n } else {\n tokenTransferOutputs = amountArray.map((amt, index) => {\n const amountBN = bn(amt);\n return {\n owner: toAddressArray[index],\n amount: amountBN,\n lamports: null,\n tlv: null,\n };\n });\n\n const {\n inputTokenDataWithContext,\n packedOutputTokenData,\n remainingAccountMetas,\n } = packCompressedTokenAccounts({\n inputCompressedTokenAccounts: [],\n outputStateTreeInfo,\n rootIndices: [],\n tokenTransferOutputs,\n });\n\n const rawData: CompressedTokenInstructionDataTransfer = {\n proof: null,\n mint,\n delegatedTransfer: null,\n inputTokenDataWithContext,\n outputCompressedAccounts: packedOutputTokenData,\n compressOrDecompressAmount: Array.isArray(amount)\n ? amount\n .map(amt => bn(amt))\n .reduce((sum, amt) => sum.add(amt), bn(0))\n : bn(amount),\n isCompress: true,\n cpiContext: null,\n lamportsChangeAccountMerkleTreeIndex: null,\n };\n const data = encodeTransferInstructionData(rawData);\n const keys = transferAccountsLayout({\n ...defaultStaticAccountsStruct(),\n feePayer: payer,\n authority: owner,\n cpiAuthorityPda: this.deriveCpiAuthorityPda,\n lightSystemProgram: LightSystemProgram.programId,\n selfProgram: this.programId,\n systemProgram: SystemProgram.programId,\n tokenPoolPda: tokenPoolInfo.tokenPoolPda,\n compressOrDecompressTokenAccount: source,\n tokenProgram: tokenPoolInfo.tokenProgram,\n });\n keys.push(...remainingAccountMetas);\n\n return new TransactionInstruction({\n programId: this.programId,\n keys,\n data,\n });\n }\n }\n\n /**\n * Construct decompress instruction\n *\n * @param payer Fee payer.\n * @param inputCompressedTokenAccounts Source compressed token accounts.\n * @param toAddress Destination **uncompressed** token\n * account address. (ATA)\n * @param amount Amount of tokens to decompress.\n * @param recentValidityProof Recent validity proof.\n * @param recentInputStateRootIndices Recent state root indices.\n * @param tokenPoolInfos Token pool info.\n *\n * @returns The decompress instruction\n */\n static async decompress({\n payer,\n inputCompressedTokenAccounts,\n toAddress,\n amount,\n recentValidityProof,\n recentInputStateRootIndices,\n tokenPoolInfos,\n }: DecompressParams): Promise<TransactionInstruction> {\n const amountBN = bn(amount);\n const tokenPoolInfosArray = toArray(tokenPoolInfos);\n\n const tokenTransferOutputs = createDecompressOutputState(\n inputCompressedTokenAccounts,\n amountBN,\n );\n\n /// Pack\n const {\n inputTokenDataWithContext,\n packedOutputTokenData,\n remainingAccountMetas,\n } = packCompressedTokenAccounts({\n inputCompressedTokenAccounts,\n rootIndices: recentInputStateRootIndices,\n tokenTransferOutputs: tokenTransferOutputs,\n remainingAccounts: tokenPoolInfosArray\n .slice(1)\n .map(info => info.tokenPoolPda),\n });\n\n const { mint } = parseTokenData(inputCompressedTokenAccounts);\n const { delegatedTransfer, authority } = parseMaybeDelegatedTransfer(\n inputCompressedTokenAccounts,\n tokenTransferOutputs,\n );\n\n const rawData: CompressedTokenInstructionDataTransfer = {\n proof: recentValidityProof,\n mint,\n delegatedTransfer,\n inputTokenDataWithContext,\n outputCompressedAccounts: packedOutputTokenData,\n compressOrDecompressAmount: amountBN,\n isCompress: false,\n cpiContext: null,\n lamportsChangeAccountMerkleTreeIndex: null,\n };\n const data = encodeTransferInstructionData(rawData);\n const tokenProgram = tokenPoolInfosArray[0].tokenProgram;\n\n const {\n accountCompressionAuthority,\n noopProgram,\n registeredProgramPda,\n accountCompressionProgram,\n } = defaultStaticAccountsStruct();\n\n const keys = transferAccountsLayout({\n feePayer: payer,\n authority: authority,\n cpiAuthorityPda: this.deriveCpiAuthorityPda,\n lightSystemProgram: LightSystemProgram.programId,\n registeredProgramPda: registeredProgramPda,\n noopProgram: noopProgram,\n accountCompressionAuthority: accountCompressionAuthority,\n accountCompressionProgram: accountCompressionProgram,\n selfProgram: this.programId,\n tokenPoolPda: tokenPoolInfosArray[0].tokenPoolPda,\n compressOrDecompressTokenAccount: toAddress,\n tokenProgram,\n systemProgram: SystemProgram.programId,\n });\n keys.push(...remainingAccountMetas);\n\n return new TransactionInstruction({\n programId: this.programId,\n keys,\n data,\n });\n }\n\n /**\n * Create `mergeTokenAccounts` instruction\n *\n * @param payer Fee payer.\n * @param owner Owner of the compressed token\n * accounts to be merged.\n * @param inputCompressedTokenAccounts Source compressed token accounts.\n * @param mint SPL Token mint address.\n * @param recentValidityProof Recent validity proof.\n * @param recentInputStateRootIndices Recent state root indices.\n *\n * @returns instruction\n */\n static async mergeTokenAccounts({\n payer,\n owner,\n inputCompressedTokenAccounts,\n mint,\n recentValidityProof,\n recentInputStateRootIndices,\n }: MergeTokenAccountsParams): Promise<TransactionInstruction[]> {\n if (inputCompressedTokenAccounts.length > 4) {\n throw new Error('Cannot merge more than 4 token accounts at once');\n }\n\n checkMint(inputCompressedTokenAccounts, mint);\n\n const ix = await this.transfer({\n payer,\n inputCompressedTokenAccounts,\n toAddress: owner,\n amount: inputCompressedTokenAccounts.reduce(\n (sum, account) => sum.add(account.parsed.amount),\n bn(0),\n ),\n recentInputStateRootIndices,\n recentValidityProof,\n });\n\n return [ix];\n }\n\n /**\n * Create `compressSplTokenAccount` instruction\n *\n * @param feePayer Fee payer.\n * @param authority SPL Token account owner.\n * @param tokenAccount SPL Token account to compress.\n * @param mint SPL Token mint address.\n * @param remainingAmount Optional: Amount to leave in token account.\n * @param outputStateTreeInfo State tree to write to.\n * @param tokenPoolInfo Token pool info.\n *\n * @returns instruction\n */\n static async compressSplTokenAccount({\n feePayer,\n authority,\n tokenAccount,\n mint,\n remainingAmount,\n outputStateTreeInfo,\n tokenPoolInfo,\n }: CompressSplTokenAccountParams): Promise<TransactionInstruction> {\n checkTokenPoolInfo(tokenPoolInfo, mint);\n const remainingAccountMetas: AccountMeta[] = [\n {\n pubkey:\n outputStateTreeInfo.treeType === TreeType.StateV2\n ? outputStateTreeInfo.queue\n : outputStateTreeInfo.tree,\n isSigner: false,\n isWritable: true,\n },\n ];\n\n const data = encodeCompressSplTokenAccountInstructionData({\n owner: authority,\n remainingAmount: remainingAmount ?? null,\n cpiContext: null,\n });\n const {\n accountCompressionAuthority,\n noopProgram,\n registeredProgramPda,\n accountCompressionProgram,\n } = defaultStaticAccountsStruct();\n\n const keys = transferAccountsLayout({\n feePayer,\n authority,\n cpiAuthorityPda: this.deriveCpiAuthorityPda,\n lightSystemProgram: LightSystemProgram.programId,\n registeredProgramPda: registeredProgramPda,\n noopProgram: noopProgram,\n accountCompressionAuthority: accountCompressionAuthority,\n accountCompressionProgram: accountCompressionProgram,\n selfProgram: this.programId,\n tokenPoolPda: tokenPoolInfo.tokenPoolPda,\n compressOrDecompressTokenAccount: tokenAccount,\n tokenProgram: tokenPoolInfo.tokenProgram,\n systemProgram: SystemProgram.programId,\n });\n\n keys.push(...remainingAccountMetas);\n\n return new TransactionInstruction({\n programId: this.programId,\n keys,\n data,\n });\n }\n\n /**\n * Get the program ID for a mint\n *\n * @param mint SPL Token mint address.\n * @param connection Connection.\n *\n * @returns program ID\n */\n static async getMintProgramId(\n mint: PublicKey,\n connection: Connection,\n ): Promise<PublicKey | undefined> {\n return (await connection.getAccountInfo(mint))?.owner;\n }\n\n /**\n * Create `approve` instruction to delegate compressed tokens.\n *\n * @param payer Fee payer.\n * @param inputCompressedTokenAccounts Source compressed token accounts.\n * @param toAddress Owner to delegate to.\n * @param amount Amount of tokens to delegate.\n * @param recentValidityProof Recent validity proof.\n * @param recentInputStateRootIndices Recent state root indices.\n *\n * @returns instruction\n */\n static async approve({\n payer,\n inputCompressedTokenAccounts,\n toAddress,\n amount,\n recentValidityProof,\n recentInputStateRootIndices,\n }: ApproveParams): Promise<TransactionInstruction> {\n const { inputTokenDataWithContext, remainingAccountMetas } =\n packCompressedTokenAccounts({\n inputCompressedTokenAccounts,\n rootIndices: recentInputStateRootIndices,\n tokenTransferOutputs: [],\n });\n\n const { mint, currentOwner } = parseTokenData(\n inputCompressedTokenAccounts,\n );\n\n const CHANGE_INDEX =\n inputCompressedTokenAccounts[0].compressedAccount.treeInfo\n .treeType === TreeType.StateV2\n ? 1\n : 0;\n\n const rawData: CompressedTokenInstructionDataApprove = {\n proof: recentValidityProof,\n mint,\n inputTokenDataWithContext,\n cpiContext: null,\n delegate: toAddress,\n delegatedAmount: bn(amount),\n delegateMerkleTreeIndex: CHANGE_INDEX,\n changeAccountMerkleTreeIndex: CHANGE_INDEX,\n delegateLamports: null,\n };\n\n const data = encodeApproveInstructionData(rawData);\n\n const {\n accountCompressionAuthority,\n noopProgram,\n registeredProgramPda,\n accountCompressionProgram,\n } = defaultStaticAccountsStruct();\n\n const keys = approveAccountsLayout({\n feePayer: payer,\n authority: currentOwner,\n cpiAuthorityPda: this.deriveCpiAuthorityPda,\n lightSystemProgram: LightSystemProgram.programId,\n registeredProgramPda: registeredProgramPda,\n noopProgram: noopProgram,\n accountCompressionAuthority: accountCompressionAuthority,\n accountCompressionProgram: accountCompressionProgram,\n selfProgram: this.programId,\n systemProgram: SystemProgram.programId,\n });\n\n keys.push(...remainingAccountMetas);\n\n return new TransactionInstruction({\n programId: this.programId,\n keys,\n data,\n });\n }\n\n /**\n * Create `revoke` instruction to revoke delegation of compressed tokens.\n *\n * @param payer Fee payer.\n * @param inputCompressedTokenAccounts Source compressed token accounts.\n * @param recentValidityProof Recent validity proof.\n * @param recentInputStateRootIndices Recent state root indices.\n *\n * @returns instruction\n */\n static async revoke({\n payer,\n inputCompressedTokenAccounts,\n recentValidityProof,\n recentInputStateRootIndices,\n }: RevokeParams): Promise<TransactionInstruction> {\n validateSameTokenOwner(inputCompressedTokenAccounts);\n\n const { inputTokenDataWithContext, remainingAccountMetas } =\n packCompressedTokenAccounts({\n inputCompressedTokenAccounts,\n rootIndices: recentInputStateRootIndices,\n tokenTransferOutputs: [],\n });\n\n const { mint, currentOwner } = parseTokenData(\n inputCompressedTokenAccounts,\n );\n\n const rawData: CompressedTokenInstructionDataRevoke = {\n proof: recentValidityProof,\n mint,\n inputTokenDataWithContext,\n cpiContext: null,\n outputAccountMerkleTreeIndex:\n inputCompressedTokenAccounts[0].compressedAccount.treeInfo\n .treeType === TreeType.StateV2\n ? 2\n : 1,\n };\n const data = encodeRevokeInstructionData(rawData);\n\n const {\n accountCompressionAuthority,\n noopProgram,\n registeredProgramPda,\n accountCompressionProgram,\n } = defaultStaticAccountsStruct();\n const keys = revokeAccountsLayout({\n feePayer: payer,\n authority: currentOwner,\n cpiAuthorityPda: this.deriveCpiAuthorityPda,\n lightSystemProgram: LightSystemProgram.programId,\n registeredProgramPda: registeredProgramPda,\n noopProgram: noopProgram,\n accountCompressionAuthority: accountCompressionAuthority,\n accountCompressionProgram: accountCompressionProgram,\n selfProgram: this.programId,\n systemProgram: SystemProgram.programId,\n });\n\n keys.push(...remainingAccountMetas);\n\n return new TransactionInstruction({\n programId: this.programId,\n keys,\n data,\n });\n }\n}\n","export type LightCompressedToken = {\n version: '1.2.0';\n name: 'light_compressed_token';\n instructions: [\n {\n name: 'createTokenPool';\n docs: [\n 'This instruction creates a token pool for a given mint. Every spl mint',\n 'can have one token pool. When a token is compressed the tokens are',\n 'transferrred to the token pool, and their compressed equivalent is',\n 'minted into a Merkle tree.',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'tokenPoolPda';\n isMut: true;\n isSigner: false;\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'mint';\n isMut: true;\n isSigner: false;\n },\n {\n name: 'tokenProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n ];\n args: [];\n },\n {\n name: 'addTokenPool';\n docs: [\n 'This instruction creates an additional token pool for a given mint.',\n 'The maximum number of token pools per mint is 5.',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'tokenPoolPda';\n isMut: true;\n isSigner: false;\n },\n {\n name: 'existingTokenPoolPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'mint';\n isMut: true;\n isSigner: false;\n },\n {\n name: 'tokenProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n ];\n args: [\n {\n name: 'tokenPoolIndex';\n type: 'u8';\n },\n ];\n },\n {\n name: 'mintTo';\n docs: [\n 'Mints tokens from an spl token mint to a list of compressed accounts.',\n 'Minted tokens are transferred to a pool account owned by the compressed',\n 'token program. The instruction creates one compressed output account for',\n 'every amount and pubkey input pair. A constant amount of lamports can be',\n 'transferred to each output account to enable. A use case to add lamports',\n 'to a compressed token account is to prevent spam. This is the only way',\n 'to add lamports to a compressed token account.',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'authority';\n isMut: false;\n isSigner: true;\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'mint';\n isMut: true;\n isSigner: false;\n },\n {\n name: 'tokenPoolPda';\n isMut: true;\n isSigner: false;\n },\n {\n name: 'tokenProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'lightSystemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'registeredProgramPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'noopProgram';\n isMut: false;\n isSigner: false;\n docs: ['programs'];\n },\n {\n name: 'accountCompressionAuthority';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'merkleTree';\n isMut: true;\n isSigner: false;\n },\n {\n name: 'selfProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'solPoolPda';\n isMut: true;\n isSigner: false;\n isOptional: true;\n },\n ];\n args: [\n {\n name: 'publicKeys';\n type: {\n vec: 'publicKey';\n };\n },\n {\n name: 'amounts';\n type: {\n vec: 'u64';\n };\n },\n {\n name: 'lamports';\n type: {\n option: 'u64';\n };\n },\n ];\n },\n {\n name: 'compressSplTokenAccount';\n docs: [\n 'Compresses the balance of an spl token account sub an optional remaining',\n 'amount. This instruction does not close the spl token account. To close',\n 'the account bundle a close spl account instruction in your transaction.',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'authority';\n isMut: false;\n isSigner: true;\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ];\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'lightSystemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'registeredProgramPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'noopProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionAuthority';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'selfProgram';\n isMut: false;\n isSigner: false;\n docs: ['this program is the signer of the cpi.'];\n },\n {\n name: 'tokenPoolPda';\n isMut: true;\n isSigner: false;\n isOptional: true;\n },\n {\n name: 'compressOrDecompressTokenAccount';\n isMut: true;\n isSigner: false;\n isOptional: true;\n },\n {\n name: 'tokenProgram';\n isMut: false;\n isSigner: false;\n isOptional: true;\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n ];\n args: [\n {\n name: 'owner';\n type: 'publicKey';\n },\n {\n name: 'remainingAmount';\n type: {\n option: 'u64';\n };\n },\n {\n name: 'cpiContext';\n type: {\n option: {\n defined: 'CompressedCpiContext';\n };\n };\n },\n ];\n },\n {\n name: 'transfer';\n docs: [\n 'Transfers compressed tokens from one account to another. All accounts',\n 'must be of the same mint. Additional spl tokens can be compressed or',\n 'decompressed. In one transaction only compression or decompression is',\n 'possible. Lamports can be transferred alongside tokens. If output token',\n 'accounts specify less lamports than inputs the remaining lamports are',\n 'transferred to an output compressed account. Signer must be owner or',\n 'delegate. If a delegated token account is transferred the delegate is',\n 'not preserved.',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'authority';\n isMut: false;\n isSigner: true;\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ];\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'lightSystemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'registeredProgramPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'noopProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionAuthority';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'selfProgram';\n isMut: false;\n isSigner: false;\n docs: ['this program is the signer of the cpi.'];\n },\n {\n name: 'tokenPoolPda';\n isMut: true;\n isSigner: false;\n isOptional: true;\n },\n {\n name: 'compressOrDecompressTokenAccount';\n isMut: true;\n isSigner: false;\n isOptional: true;\n },\n {\n name: 'tokenProgram';\n isMut: false;\n isSigner: false;\n isOptional: true;\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n ];\n args: [\n {\n name: 'inputs';\n type: 'bytes';\n },\n ];\n },\n {\n name: 'approve';\n docs: [\n 'Delegates an amount to a delegate. A compressed token account is either',\n 'completely delegated or not. Prior delegates are not preserved. Cannot',\n 'be called by a delegate.',\n 'The instruction creates two output accounts:',\n '1. one account with delegated amount',\n '2. one account with remaining(change) amount',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'authority';\n isMut: false;\n isSigner: true;\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ];\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'lightSystemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'registeredProgramPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'noopProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionAuthority';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'selfProgram';\n isMut: false;\n isSigner: false;\n docs: ['this program is the signer of the cpi.'];\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n ];\n args: [\n {\n name: 'inputs';\n type: 'bytes';\n },\n ];\n },\n {\n name: 'revoke';\n docs: [\n 'Revokes a delegation. The instruction merges all inputs into one output',\n 'account. Cannot be called by a delegate. Delegates are not preserved.',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'authority';\n isMut: false;\n isSigner: true;\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ];\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'lightSystemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'registeredProgramPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'noopProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionAuthority';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'selfProgram';\n isMut: false;\n isSigner: false;\n docs: ['this program is the signer of the cpi.'];\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n ];\n args: [\n {\n name: 'inputs';\n type: 'bytes';\n },\n ];\n },\n {\n name: 'freeze';\n docs: [\n 'Freezes compressed token accounts. Inputs must not be frozen. Creates as',\n 'many outputs as inputs. Balances and delegates are preserved.',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'authority';\n isMut: false;\n isSigner: true;\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'lightSystemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'registeredProgramPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'noopProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionAuthority';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'selfProgram';\n isMut: false;\n isSigner: false;\n docs: ['that this program is the signer of the cpi.'];\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'mint';\n isMut: false;\n isSigner: false;\n },\n ];\n args: [\n {\n name: 'inputs';\n type: 'bytes';\n },\n ];\n },\n {\n name: 'thaw';\n docs: [\n 'Thaws frozen compressed token accounts. Inputs must be frozen. Creates',\n 'as many outputs as inputs. Balances and delegates are preserved.',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'authority';\n isMut: false;\n isSigner: true;\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'lightSystemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'registeredProgramPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'noopProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionAuthority';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'selfProgram';\n isMut: false;\n isSigner: false;\n docs: ['that this program is the signer of the cpi.'];\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'mint';\n isMut: false;\n isSigner: false;\n },\n ];\n args: [\n {\n name: 'inputs';\n type: 'bytes';\n },\n ];\n },\n {\n name: 'burn';\n docs: [\n 'Burns compressed tokens and spl tokens from the pool account. Delegates',\n 'can burn tokens. The output compressed token account remains delegated.',\n 'Creates one output compressed token account.',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'authority';\n isMut: false;\n isSigner: true;\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ];\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'mint';\n isMut: true;\n isSigner: false;\n },\n {\n name: 'tokenPoolPda';\n isMut: true;\n isSigner: false;\n },\n {\n name: 'tokenProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'lightSystemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'registeredProgramPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'noopProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionAuthority';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'selfProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n ];\n args: [\n {\n name: 'inputs';\n type: 'bytes';\n },\n ];\n },\n {\n name: 'stubIdlBuild';\n docs: [\n 'This function is a stub to allow Anchor to include the input types in',\n 'the IDL. It should not be included in production builds nor be called in',\n 'practice.',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'authority';\n isMut: false;\n isSigner: true;\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ];\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'lightSystemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'registeredProgramPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'noopProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionAuthority';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'selfProgram';\n isMut: false;\n isSigner: false;\n docs: ['this program is the signer of the cpi.'];\n },\n {\n name: 'tokenPoolPda';\n isMut: true;\n isSigner: false;\n isOptional: true;\n },\n {\n name: 'compressOrDecompressTokenAccount';\n isMut: true;\n isSigner: false;\n isOptional: true;\n },\n {\n name: 'tokenProgram';\n isMut: false;\n isSigner: false;\n isOptional: true;\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n ];\n args: [\n {\n name: 'inputs1';\n type: {\n defined: 'CompressedTokenInstructionDataTransfer';\n };\n },\n {\n name: 'inputs2';\n type: {\n defined: 'TokenData';\n };\n },\n ];\n },\n ];\n types: [\n {\n name: 'AccountState';\n type: {\n kind: 'enum';\n variants: [\n {\n name: 'Initialized';\n },\n {\n name: 'Frozen';\n },\n ];\n };\n },\n {\n name: 'CompressedAccount';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'owner';\n type: 'publicKey';\n },\n {\n name: 'lamports';\n type: 'u64';\n },\n {\n name: 'address';\n type: {\n option: {\n array: ['u8', 32];\n };\n };\n },\n {\n name: 'data';\n type: {\n option: {\n defined: 'CompressedAccountData';\n };\n };\n },\n ];\n };\n },\n {\n name: 'CompressedAccountData';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'discriminator';\n type: {\n array: ['u8', 8];\n };\n },\n {\n name: 'data';\n type: 'bytes';\n },\n {\n name: 'dataHash';\n type: {\n array: ['u8', 32];\n };\n },\n ];\n };\n },\n {\n name: 'CompressedCpiContext';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'setContext';\n docs: [\n 'Is set by the program that is invoking the CPI to signal that is should',\n 'set the cpi context.',\n ];\n type: 'bool';\n },\n {\n name: 'firstSetContext';\n docs: [\n 'Is set to wipe the cpi context since someone could have set it before',\n 'with unrelated data.',\n ];\n type: 'bool';\n },\n {\n name: 'cpiContextAccountIndex';\n docs: [\n 'Index of cpi context account in remaining accounts.',\n ];\n type: 'u8';\n },\n ];\n };\n },\n {\n name: 'CompressedProof';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'a';\n type: {\n array: ['u8', 32];\n };\n },\n {\n name: 'b';\n type: {\n array: ['u8', 64];\n };\n },\n {\n name: 'c';\n type: {\n array: ['u8', 32];\n };\n },\n ];\n };\n },\n {\n name: 'CompressedTokenInstructionDataTransfer';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'proof';\n type: {\n option: {\n defined: 'CompressedProof';\n };\n };\n },\n {\n name: 'mint';\n type: 'publicKey';\n },\n {\n name: 'delegatedTransfer';\n docs: [\n 'Is required if the signer is delegate,',\n '-> delegate is authority account,',\n 'owner = Some(owner) is the owner of the token account.',\n ];\n type: {\n option: {\n defined: 'DelegatedTransfer';\n };\n };\n },\n {\n name: 'inputTokenDataWithContext';\n type: {\n vec: {\n defined: 'InputTokenDataWithContext';\n };\n };\n },\n {\n name: 'outputCompressedAccounts';\n type: {\n vec: {\n defined: 'PackedTokenTransferOutputData';\n };\n };\n },\n {\n name: 'isCompress';\n type: 'bool';\n },\n {\n name: 'compressOrDecompressAmount';\n type: {\n option: 'u64';\n };\n },\n {\n name: 'cpiContext';\n type: {\n option: {\n defined: 'CompressedCpiContext';\n };\n };\n },\n {\n name: 'lamportsChangeAccountMerkleTreeIndex';\n type: {\n option: 'u8';\n };\n },\n ];\n };\n },\n {\n name: 'CompressedTokenInstructionDataRevoke';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'proof';\n type: {\n option: {\n defined: 'CompressedProof';\n };\n };\n },\n {\n name: 'mint';\n type: 'publicKey';\n },\n {\n name: 'inputTokenDataWithContext';\n type: {\n vec: {\n defined: 'InputTokenDataWithContext';\n };\n };\n },\n {\n name: 'cpiContext';\n type: {\n option: {\n defined: 'CompressedCpiContext';\n };\n };\n },\n {\n name: 'outputAccountMerkleTreeIndex';\n type: 'u8';\n },\n ];\n };\n },\n {\n name: 'CompressedTokenInstructionDataApprove';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'proof';\n type: {\n option: {\n defined: 'CompressedProof';\n };\n };\n },\n {\n name: 'mint';\n type: 'publicKey';\n },\n {\n name: 'inputTokenDataWithContext';\n type: {\n vec: {\n defined: 'InputTokenDataWithContext';\n };\n };\n },\n {\n name: 'cpiContext';\n type: {\n option: {\n defined: 'CompressedCpiContext';\n };\n };\n },\n {\n name: 'delegate';\n type: 'publicKey';\n },\n {\n name: 'delegatedAmount';\n type: 'u64';\n },\n {\n name: 'delegateMerkleTreeIndex';\n type: 'u8';\n },\n {\n name: 'changeAccountMerkleTreeIndex';\n type: 'u8';\n },\n {\n name: 'delegateLamports';\n type: {\n option: 'u64';\n };\n },\n ];\n };\n },\n {\n name: 'DelegatedTransfer';\n docs: [\n 'Struct to provide the owner when the delegate is signer of the transaction.',\n ];\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'owner';\n type: 'publicKey';\n },\n {\n name: 'delegateChangeAccountIndex';\n docs: [\n 'Index of change compressed account in output compressed accounts. In',\n \"case that the delegate didn't spend the complete delegated compressed\",\n 'account balance the change compressed account will be delegated to her',\n 'as well.',\n ];\n type: {\n option: 'u8';\n };\n },\n ];\n };\n },\n {\n name: 'InputTokenDataWithContext';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'amount';\n type: 'u64';\n },\n {\n name: 'delegateIndex';\n type: {\n option: 'u8';\n };\n },\n {\n name: 'merkleContext';\n type: {\n defined: 'PackedMerkleContext';\n };\n },\n {\n name: 'rootIndex';\n type: 'u16';\n },\n {\n name: 'lamports';\n type: {\n option: 'u64';\n };\n },\n {\n name: 'tlv';\n docs: [\n 'Placeholder for TokenExtension tlv data (unimplemented)',\n ];\n type: {\n option: 'bytes';\n };\n },\n ];\n };\n },\n {\n name: 'InstructionDataInvoke';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'proof';\n type: {\n option: {\n defined: 'CompressedProof';\n };\n };\n },\n {\n name: 'inputCompressedAccountsWithMerkleContext';\n type: {\n vec: {\n defined: 'PackedCompressedAccountWithMerkleContext';\n };\n };\n },\n {\n name: 'outputCompressedAccounts';\n type: {\n vec: {\n defined: 'OutputCompressedAccountWithPackedContext';\n };\n };\n },\n {\n name: 'relayFee';\n type: {\n option: 'u64';\n };\n },\n {\n name: 'newAddressParams';\n type: {\n vec: {\n defined: 'NewAddressParamsPacked';\n };\n };\n },\n {\n name: 'compressOrDecompressLamports';\n type: {\n option: 'u64';\n };\n },\n {\n name: 'isCompress';\n type: 'bool';\n },\n ];\n };\n },\n {\n name: 'InstructionDataInvokeCpi';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'proof';\n type: {\n option: {\n defined: 'CompressedProof';\n };\n };\n },\n {\n name: 'newAddressParams';\n type: {\n vec: {\n defined: 'NewAddressParamsPacked';\n };\n };\n },\n {\n name: 'inputCompressedAccountsWithMerkleContext';\n type: {\n vec: {\n defined: 'PackedCompressedAccountWithMerkleContext';\n };\n };\n },\n {\n name: 'outputCompressedAccounts';\n type: {\n vec: {\n defined: 'OutputCompressedAccountWithPackedContext';\n };\n };\n },\n {\n name: 'relayFee';\n type: {\n option: 'u64';\n };\n },\n {\n name: 'compressOrDecompressLamports';\n type: {\n option: 'u64';\n };\n },\n {\n name: 'isCompress';\n type: 'bool';\n },\n {\n name: 'cpiContext';\n type: {\n option: {\n defined: 'CompressedCpiContext';\n };\n };\n },\n ];\n };\n },\n {\n name: 'MerkleTreeSequenceNumber';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'pubkey';\n type: 'publicKey';\n },\n {\n name: 'seq';\n type: 'u64';\n },\n ];\n };\n },\n {\n name: 'NewAddressParamsPacked';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'seed';\n type: {\n array: ['u8', 32];\n };\n },\n {\n name: 'addressQueueAccountIndex';\n type: 'u8';\n },\n {\n name: 'addressMerkleTreeAccountIndex';\n type: 'u8';\n },\n {\n name: 'addressMerkleTreeRootIndex';\n type: 'u16';\n },\n ];\n };\n },\n {\n name: 'OutputCompressedAccountWithPackedContext';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'compressedAccount';\n type: {\n defined: 'CompressedAccount';\n };\n },\n {\n name: 'merkleTreeIndex';\n type: 'u8';\n },\n ];\n };\n },\n {\n name: 'PackedCompressedAccountWithMerkleContext';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'compressedAccount';\n type: {\n defined: 'CompressedAccount';\n };\n },\n {\n name: 'merkleContext';\n type: {\n defined: 'PackedMerkleContext';\n };\n },\n {\n name: 'rootIndex';\n docs: [\n 'Index of root used in inclusion validity proof.',\n ];\n type: 'u16';\n },\n {\n name: 'readOnly';\n docs: [\n 'Placeholder to mark accounts read-only unimplemented set to false.',\n ];\n type: 'bool';\n },\n ];\n };\n },\n {\n name: 'PackedMerkleContext';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'merkleTreePubkeyIndex';\n type: 'u8';\n },\n {\n name: 'queuePubkeyIndex';\n type: 'u8';\n },\n {\n name: 'leafIndex';\n type: 'u32';\n },\n {\n name: 'proveByIndex';\n type: 'bool';\n },\n ];\n };\n },\n {\n name: 'PackedTokenTransferOutputData';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'owner';\n type: 'publicKey';\n },\n {\n name: 'amount';\n type: 'u64';\n },\n {\n name: 'lamports';\n type: {\n option: 'u64';\n };\n },\n {\n name: 'merkleTreeIndex';\n type: 'u8';\n },\n {\n name: 'tlv';\n docs: [\n 'Placeholder for TokenExtension tlv data (unimplemented)',\n ];\n type: {\n option: 'bytes';\n };\n },\n ];\n };\n },\n {\n name: 'PublicTransactionEvent';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'inputCompressedAccountHashes';\n type: {\n vec: {\n array: ['u8', 32];\n };\n };\n },\n {\n name: 'outputCompressedAccountHashes';\n type: {\n vec: {\n array: ['u8', 32];\n };\n };\n },\n {\n name: 'outputCompressedAccounts';\n type: {\n vec: {\n defined: 'OutputCompressedAccountWithPackedContext';\n };\n };\n },\n {\n name: 'outputLeafIndices';\n type: {\n vec: 'u32';\n };\n },\n {\n name: 'sequenceNumbers';\n type: {\n vec: {\n defined: 'MerkleTreeSequenceNumber';\n };\n };\n },\n {\n name: 'relayFee';\n type: {\n option: 'u64';\n };\n },\n {\n name: 'isCompress';\n type: 'bool';\n },\n {\n name: 'compressOrDecompressLamports';\n type: {\n option: 'u64';\n };\n },\n {\n name: 'pubkeyArray';\n type: {\n vec: 'publicKey';\n };\n },\n {\n name: 'message';\n type: {\n option: 'bytes';\n };\n },\n ];\n };\n },\n {\n name: 'QueueIndex';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'queueId';\n docs: ['Id of queue in queue account.'];\n type: 'u8';\n },\n {\n name: 'index';\n docs: ['Index of compressed account hash in queue.'];\n type: 'u16';\n },\n ];\n };\n },\n {\n name: 'TokenData';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'mint';\n docs: ['The mint associated with this account'];\n type: 'publicKey';\n },\n {\n name: 'owner';\n docs: ['The owner of this account.'];\n type: 'publicKey';\n },\n {\n name: 'amount';\n docs: ['The amount of tokens this account holds.'];\n type: 'u64';\n },\n {\n name: 'delegate';\n docs: [\n 'If `delegate` is `Some` then `delegated_amount` represents',\n 'the amount authorized by the delegate',\n ];\n type: {\n option: 'publicKey';\n };\n },\n {\n name: 'state';\n docs: [\"The account's state\"];\n type: {\n defined: 'AccountState';\n };\n },\n {\n name: 'tlv';\n docs: [\n 'Placeholder for TokenExtension tlv data (unimplemented)',\n ];\n type: {\n option: 'bytes';\n };\n },\n ];\n };\n },\n ];\n errors: [\n {\n code: 6000;\n name: 'PublicKeyAmountMissmatch';\n msg: 'public keys and amounts must be of same length';\n },\n {\n code: 6001;\n name: 'ComputeInputSumFailed';\n msg: 'ComputeInputSumFailed';\n },\n {\n code: 6002;\n name: 'ComputeOutputSumFailed';\n msg: 'ComputeOutputSumFailed';\n },\n {\n code: 6003;\n name: 'ComputeCompressSumFailed';\n msg: 'ComputeCompressSumFailed';\n },\n {\n code: 6004;\n name: 'ComputeDecompressSumFailed';\n msg: 'ComputeDecompressSumFailed';\n },\n {\n code: 6005;\n name: 'SumCheckFailed';\n msg: 'SumCheckFailed';\n },\n {\n code: 6006;\n name: 'DecompressRecipientUndefinedForDecompress';\n msg: 'DecompressRecipientUndefinedForDecompress';\n },\n {\n code: 6007;\n name: 'CompressedPdaUndefinedForDecompress';\n msg: 'CompressedPdaUndefinedForDecompress';\n },\n {\n code: 6008;\n name: 'DeCompressAmountUndefinedForDecompress';\n msg: 'DeCompressAmountUndefinedForDecompress';\n },\n {\n code: 6009;\n name: 'CompressedPdaUndefinedForCompress';\n msg: 'CompressedPdaUndefinedForCompress';\n },\n {\n code: 6010;\n name: 'DeCompressAmountUndefinedForCompress';\n msg: 'DeCompressAmountUndefinedForCompress';\n },\n {\n code: 6011;\n name: 'DelegateSignerCheckFailed';\n msg: 'DelegateSignerCheckFailed';\n },\n {\n code: 6012;\n name: 'MintTooLarge';\n msg: 'Minted amount greater than u64::MAX';\n },\n {\n code: 6013;\n name: 'SplTokenSupplyMismatch';\n msg: 'SplTokenSupplyMismatch';\n },\n {\n code: 6014;\n name: 'HeapMemoryCheckFailed';\n msg: 'HeapMemoryCheckFailed';\n },\n {\n code: 6015;\n name: 'InstructionNotCallable';\n msg: 'The instruction is not callable';\n },\n {\n code: 6016;\n name: 'ArithmeticUnderflow';\n msg: 'ArithmeticUnderflow';\n },\n {\n code: 6017;\n name: 'HashToFieldError';\n msg: 'HashToFieldError';\n },\n {\n code: 6018;\n name: 'InvalidAuthorityMint';\n msg: 'Expected the authority to be also a mint authority';\n },\n {\n code: 6019;\n name: 'InvalidFreezeAuthority';\n msg: 'Provided authority is not the freeze authority';\n },\n {\n code: 6020;\n name: 'InvalidDelegateIndex';\n },\n {\n code: 6021;\n name: 'TokenPoolPdaUndefined';\n },\n {\n code: 6022;\n name: 'IsTokenPoolPda';\n msg: 'Compress or decompress recipient is the same account as the token pool pda.';\n },\n {\n code: 6023;\n name: 'InvalidTokenPoolPda';\n },\n {\n code: 6024;\n name: 'NoInputTokenAccountsProvided';\n },\n {\n code: 6025;\n name: 'NoInputsProvided';\n },\n {\n code: 6026;\n name: 'MintHasNoFreezeAuthority';\n },\n {\n code: 6027;\n name: 'MintWithInvalidExtension';\n },\n {\n code: 6028;\n name: 'InsufficientTokenAccountBalance';\n msg: 'The token account balance is less than the remaining amount.';\n },\n {\n code: 6029;\n name: 'InvalidTokenPoolBump';\n msg: 'Max number of token pools reached.';\n },\n {\n code: 6030;\n name: 'FailedToDecompress';\n },\n {\n code: 6031;\n name: 'FailedToBurnSplTokensFromTokenPool';\n },\n {\n code: 6032;\n name: 'NoMatchingBumpFound';\n },\n ];\n};\nexport const IDL: LightCompressedToken = {\n version: '1.2.0',\n name: 'light_compressed_token',\n instructions: [\n {\n name: 'createTokenPool',\n docs: [\n 'This instruction creates a token pool for a given mint. Every spl mint',\n 'can have one token pool. When a token is compressed the tokens are',\n 'transferrred to the token pool, and their compressed equivalent is',\n 'minted into a Merkle tree.',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'tokenPoolPda',\n isMut: true,\n isSigner: false,\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'mint',\n isMut: true,\n isSigner: false,\n },\n {\n name: 'tokenProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n ],\n args: [],\n },\n {\n name: 'addTokenPool',\n docs: [\n 'This instruction creates an additional token pool for a given mint.',\n 'The maximum number of token pools per mint is 5.',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'tokenPoolPda',\n isMut: true,\n isSigner: false,\n },\n {\n name: 'existingTokenPoolPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'mint',\n isMut: true,\n isSigner: false,\n },\n {\n name: 'tokenProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n ],\n args: [\n {\n name: 'tokenPoolIndex',\n type: 'u8',\n },\n ],\n },\n {\n name: 'mintTo',\n docs: [\n 'Mints tokens from an spl token mint to a list of compressed accounts.',\n 'Minted tokens are transferred to a pool account owned by the compressed',\n 'token program. The instruction creates one compressed output account for',\n 'every amount and pubkey input pair. A constant amount of lamports can be',\n 'transferred to each output account to enable. A use case to add lamports',\n 'to a compressed token account is to prevent spam. This is the only way',\n 'to add lamports to a compressed token account.',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'authority',\n isMut: false,\n isSigner: true,\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'mint',\n isMut: true,\n isSigner: false,\n },\n {\n name: 'tokenPoolPda',\n isMut: true,\n isSigner: false,\n },\n {\n name: 'tokenProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'lightSystemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'registeredProgramPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'noopProgram',\n isMut: false,\n isSigner: false,\n docs: ['programs'],\n },\n {\n name: 'accountCompressionAuthority',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'merkleTree',\n isMut: true,\n isSigner: false,\n },\n {\n name: 'selfProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'solPoolPda',\n isMut: true,\n isSigner: false,\n isOptional: true,\n },\n ],\n args: [\n {\n name: 'publicKeys',\n type: {\n vec: 'publicKey',\n },\n },\n {\n name: 'amounts',\n type: {\n vec: 'u64',\n },\n },\n {\n name: 'lamports',\n type: {\n option: 'u64',\n },\n },\n ],\n },\n {\n name: 'compressSplTokenAccount',\n docs: [\n 'Compresses the balance of an spl token account sub an optional remaining',\n 'amount. This instruction does not close the spl token account. To close',\n 'the account bundle a close spl account instruction in your transaction.',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'authority',\n isMut: false,\n isSigner: true,\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ],\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'lightSystemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'registeredProgramPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'noopProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionAuthority',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'selfProgram',\n isMut: false,\n isSigner: false,\n docs: ['this program is the signer of the cpi.'],\n },\n {\n name: 'tokenPoolPda',\n isMut: true,\n isSigner: false,\n isOptional: true,\n },\n {\n name: 'compressOrDecompressTokenAccount',\n isMut: true,\n isSigner: false,\n isOptional: true,\n },\n {\n name: 'tokenProgram',\n isMut: false,\n isSigner: false,\n isOptional: true,\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n ],\n args: [\n {\n name: 'owner',\n type: 'publicKey',\n },\n {\n name: 'remainingAmount',\n type: {\n option: 'u64',\n },\n },\n {\n name: 'cpiContext',\n type: {\n option: {\n defined: 'CompressedCpiContext',\n },\n },\n },\n ],\n },\n {\n name: 'transfer',\n docs: [\n 'Transfers compressed tokens from one account to another. All accounts',\n 'must be of the same mint. Additional spl tokens can be compressed or',\n 'decompressed. In one transaction only compression or decompression is',\n 'possible. Lamports can be transferred alongside tokens. If output token',\n 'accounts specify less lamports than inputs the remaining lamports are',\n 'transferred to an output compressed account. Signer must be owner or',\n 'delegate. If a delegated token account is transferred the delegate is',\n 'not preserved.',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'authority',\n isMut: false,\n isSigner: true,\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ],\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'lightSystemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'registeredProgramPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'noopProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionAuthority',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'selfProgram',\n isMut: false,\n isSigner: false,\n docs: ['this program is the signer of the cpi.'],\n },\n {\n name: 'tokenPoolPda',\n isMut: true,\n isSigner: false,\n isOptional: true,\n },\n {\n name: 'compressOrDecompressTokenAccount',\n isMut: true,\n isSigner: false,\n isOptional: true,\n },\n {\n name: 'tokenProgram',\n isMut: false,\n isSigner: false,\n isOptional: true,\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n ],\n args: [\n {\n name: 'inputs',\n type: 'bytes',\n },\n ],\n },\n {\n name: 'approve',\n docs: [\n 'Delegates an amount to a delegate. A compressed token account is either',\n 'completely delegated or not. Prior delegates are not preserved. Cannot',\n 'be called by a delegate.',\n 'The instruction creates two output accounts:',\n '1. one account with delegated amount',\n '2. one account with remaining(change) amount',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'authority',\n isMut: false,\n isSigner: true,\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ],\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'lightSystemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'registeredProgramPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'noopProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionAuthority',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'selfProgram',\n isMut: false,\n isSigner: false,\n docs: ['this program is the signer of the cpi.'],\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n ],\n args: [\n {\n name: 'inputs',\n type: 'bytes',\n },\n ],\n },\n {\n name: 'revoke',\n docs: [\n 'Revokes a delegation. The instruction merges all inputs into one output',\n 'account. Cannot be called by a delegate. Delegates are not preserved.',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'authority',\n isMut: false,\n isSigner: true,\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ],\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'lightSystemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'registeredProgramPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'noopProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionAuthority',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'selfProgram',\n isMut: false,\n isSigner: false,\n docs: ['this program is the signer of the cpi.'],\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n ],\n args: [\n {\n name: 'inputs',\n type: 'bytes',\n },\n ],\n },\n {\n name: 'freeze',\n docs: [\n 'Freezes compressed token accounts. Inputs must not be frozen. Creates as',\n 'many outputs as inputs. Balances and delegates are preserved.',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'authority',\n isMut: false,\n isSigner: true,\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'lightSystemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'registeredProgramPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'noopProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionAuthority',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'selfProgram',\n isMut: false,\n isSigner: false,\n docs: ['that this program is the signer of the cpi.'],\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'mint',\n isMut: false,\n isSigner: false,\n },\n ],\n args: [\n {\n name: 'inputs',\n type: 'bytes',\n },\n ],\n },\n {\n name: 'thaw',\n docs: [\n 'Thaws frozen compressed token accounts. Inputs must be frozen. Creates',\n 'as many outputs as inputs. Balances and delegates are preserved.',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'authority',\n isMut: false,\n isSigner: true,\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'lightSystemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'registeredProgramPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'noopProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionAuthority',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'selfProgram',\n isMut: false,\n isSigner: false,\n docs: ['that this program is the signer of the cpi.'],\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'mint',\n isMut: false,\n isSigner: false,\n },\n ],\n args: [\n {\n name: 'inputs',\n type: 'bytes',\n },\n ],\n },\n {\n name: 'burn',\n docs: [\n 'Burns compressed tokens and spl tokens from the pool account. Delegates',\n 'can burn tokens. The output compressed token account remains delegated.',\n 'Creates one output compressed token account.',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'authority',\n isMut: false,\n isSigner: true,\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ],\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'mint',\n isMut: true,\n isSigner: false,\n },\n {\n name: 'tokenPoolPda',\n isMut: true,\n isSigner: false,\n },\n {\n name: 'tokenProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'lightSystemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'registeredProgramPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'noopProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionAuthority',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'selfProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n ],\n args: [\n {\n name: 'inputs',\n type: 'bytes',\n },\n ],\n },\n {\n name: 'stubIdlBuild',\n docs: [\n 'This function is a stub to allow Anchor to include the input types in',\n 'the IDL. It should not be included in production builds nor be called in',\n 'practice.',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'authority',\n isMut: false,\n isSigner: true,\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ],\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'lightSystemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'registeredProgramPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'noopProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionAuthority',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'selfProgram',\n isMut: false,\n isSigner: false,\n docs: ['this program is the signer of the cpi.'],\n },\n {\n name: 'tokenPoolPda',\n isMut: true,\n isSigner: false,\n isOptional: true,\n },\n {\n name: 'compressOrDecompressTokenAccount',\n isMut: true,\n isSigner: false,\n isOptional: true,\n },\n {\n name: 'tokenProgram',\n isMut: false,\n isSigner: false,\n isOptional: true,\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n ],\n args: [\n {\n name: 'inputs1',\n type: {\n defined: 'CompressedTokenInstructionDataTransfer',\n },\n },\n {\n name: 'inputs2',\n type: {\n defined: 'TokenData',\n },\n },\n ],\n },\n ],\n types: [\n {\n name: 'AccountState',\n type: {\n kind: 'enum',\n variants: [\n {\n name: 'Initialized',\n },\n {\n name: 'Frozen',\n },\n ],\n },\n },\n {\n name: 'CompressedAccount',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'owner',\n type: 'publicKey',\n },\n {\n name: 'lamports',\n type: 'u64',\n },\n {\n name: 'address',\n type: {\n option: {\n array: ['u8', 32],\n },\n },\n },\n {\n name: 'data',\n type: {\n option: {\n defined: 'CompressedAccountData',\n },\n },\n },\n ],\n },\n },\n {\n name: 'CompressedAccountData',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'discriminator',\n type: {\n array: ['u8', 8],\n },\n },\n {\n name: 'data',\n type: 'bytes',\n },\n {\n name: 'dataHash',\n type: {\n array: ['u8', 32],\n },\n },\n ],\n },\n },\n {\n name: 'CompressedCpiContext',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'setContext',\n docs: [\n 'Is set by the program that is invoking the CPI to signal that is should',\n 'set the cpi context.',\n ],\n type: 'bool',\n },\n {\n name: 'firstSetContext',\n docs: [\n 'Is set to wipe the cpi context since someone could have set it before',\n 'with unrelated data.',\n ],\n type: 'bool',\n },\n {\n name: 'cpiContextAccountIndex',\n docs: [\n 'Index of cpi context account in remaining accounts.',\n ],\n type: 'u8',\n },\n ],\n },\n },\n {\n name: 'CompressedProof',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'a',\n type: {\n array: ['u8', 32],\n },\n },\n {\n name: 'b',\n type: {\n array: ['u8', 64],\n },\n },\n {\n name: 'c',\n type: {\n array: ['u8', 32],\n },\n },\n ],\n },\n },\n {\n name: 'CompressedTokenInstructionDataTransfer',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'proof',\n type: {\n option: {\n defined: 'CompressedProof',\n },\n },\n },\n {\n name: 'mint',\n type: 'publicKey',\n },\n {\n name: 'delegatedTransfer',\n docs: [\n 'Is required if the signer is delegate,',\n '-> delegate is authority account,',\n 'owner = Some(owner) is the owner of the token account.',\n ],\n type: {\n option: {\n defined: 'DelegatedTransfer',\n },\n },\n },\n {\n name: 'inputTokenDataWithContext',\n type: {\n vec: {\n defined: 'InputTokenDataWithContext',\n },\n },\n },\n {\n name: 'outputCompressedAccounts',\n type: {\n vec: {\n defined: 'PackedTokenTransferOutputData',\n },\n },\n },\n {\n name: 'isCompress',\n type: 'bool',\n },\n {\n name: 'compressOrDecompressAmount',\n type: {\n option: 'u64',\n },\n },\n {\n name: 'cpiContext',\n type: {\n option: {\n defined: 'CompressedCpiContext',\n },\n },\n },\n {\n name: 'lamportsChangeAccountMerkleTreeIndex',\n type: {\n option: 'u8',\n },\n },\n ],\n },\n },\n {\n name: 'CompressedTokenInstructionDataRevoke',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'proof',\n type: {\n option: {\n defined: 'CompressedProof',\n },\n },\n },\n {\n name: 'mint',\n type: 'publicKey',\n },\n {\n name: 'inputTokenDataWithContext',\n type: {\n vec: {\n defined: 'InputTokenDataWithContext',\n },\n },\n },\n {\n name: 'cpiContext',\n type: {\n option: {\n defined: 'CompressedCpiContext',\n },\n },\n },\n {\n name: 'outputAccountMerkleTreeIndex',\n type: 'u8',\n },\n ],\n },\n },\n {\n name: 'CompressedTokenInstructionDataApprove',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'proof',\n type: {\n option: {\n defined: 'CompressedProof',\n },\n },\n },\n {\n name: 'mint',\n type: 'publicKey',\n },\n {\n name: 'inputTokenDataWithContext',\n type: {\n vec: {\n defined: 'InputTokenDataWithContext',\n },\n },\n },\n {\n name: 'cpiContext',\n type: {\n option: {\n defined: 'CompressedCpiContext',\n },\n },\n },\n {\n name: 'delegate',\n type: 'publicKey',\n },\n {\n name: 'delegatedAmount',\n type: 'u64',\n },\n {\n name: 'delegateMerkleTreeIndex',\n type: 'u8',\n },\n {\n name: 'changeAccountMerkleTreeIndex',\n type: 'u8',\n },\n {\n name: 'delegateLamports',\n type: {\n option: 'u64',\n },\n },\n ],\n },\n },\n {\n name: 'DelegatedTransfer',\n docs: [\n 'Struct to provide the owner when the delegate is signer of the transaction.',\n ],\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'owner',\n type: 'publicKey',\n },\n {\n name: 'delegateChangeAccountIndex',\n docs: [\n 'Index of change compressed account in output compressed accounts. In',\n \"case that the delegate didn't spend the complete delegated compressed\",\n 'account balance the change compressed account will be delegated to her',\n 'as well.',\n ],\n type: {\n option: 'u8',\n },\n },\n ],\n },\n },\n {\n name: 'InputTokenDataWithContext',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'amount',\n type: 'u64',\n },\n {\n name: 'delegateIndex',\n type: {\n option: 'u8',\n },\n },\n {\n name: 'merkleContext',\n type: {\n defined: 'PackedMerkleContext',\n },\n },\n {\n name: 'rootIndex',\n type: 'u16',\n },\n {\n name: 'lamports',\n type: {\n option: 'u64',\n },\n },\n {\n name: 'tlv',\n docs: [\n 'Placeholder for TokenExtension tlv data (unimplemented)',\n ],\n type: {\n option: 'bytes',\n },\n },\n ],\n },\n },\n {\n name: 'InstructionDataInvoke',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'proof',\n type: {\n option: {\n defined: 'CompressedProof',\n },\n },\n },\n {\n name: 'inputCompressedAccountsWithMerkleContext',\n type: {\n vec: {\n defined:\n 'PackedCompressedAccountWithMerkleContext',\n },\n },\n },\n {\n name: 'outputCompressedAccounts',\n type: {\n vec: {\n defined:\n 'OutputCompressedAccountWithPackedContext',\n },\n },\n },\n {\n name: 'relayFee',\n type: {\n option: 'u64',\n },\n },\n {\n name: 'newAddressParams',\n type: {\n vec: {\n defined: 'NewAddressParamsPacked',\n },\n },\n },\n {\n name: 'compressOrDecompressLamports',\n type: {\n option: 'u64',\n },\n },\n {\n name: 'isCompress',\n type: 'bool',\n },\n ],\n },\n },\n {\n name: 'InstructionDataInvokeCpi',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'proof',\n type: {\n option: {\n defined: 'CompressedProof',\n },\n },\n },\n {\n name: 'newAddressParams',\n type: {\n vec: {\n defined: 'NewAddressParamsPacked',\n },\n },\n },\n {\n name: 'inputCompressedAccountsWithMerkleContext',\n type: {\n vec: {\n defined:\n 'PackedCompressedAccountWithMerkleContext',\n },\n },\n },\n {\n name: 'outputCompressedAccounts',\n type: {\n vec: {\n defined:\n 'OutputCompressedAccountWithPackedContext',\n },\n },\n },\n {\n name: 'relayFee',\n type: {\n option: 'u64',\n },\n },\n {\n name: 'compressOrDecompressLamports',\n type: {\n option: 'u64',\n },\n },\n {\n name: 'isCompress',\n type: 'bool',\n },\n {\n name: 'cpiContext',\n type: {\n option: {\n defined: 'CompressedCpiContext',\n },\n },\n },\n ],\n },\n },\n {\n name: 'MerkleTreeSequenceNumber',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'pubkey',\n type: 'publicKey',\n },\n {\n name: 'seq',\n type: 'u64',\n },\n ],\n },\n },\n {\n name: 'NewAddressParamsPacked',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'seed',\n type: {\n array: ['u8', 32],\n },\n },\n {\n name: 'addressQueueAccountIndex',\n type: 'u8',\n },\n {\n name: 'addressMerkleTreeAccountIndex',\n type: 'u8',\n },\n {\n name: 'addressMerkleTreeRootIndex',\n type: 'u16',\n },\n ],\n },\n },\n {\n name: 'OutputCompressedAccountWithPackedContext',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'compressedAccount',\n type: {\n defined: 'CompressedAccount',\n },\n },\n {\n name: 'merkleTreeIndex',\n type: 'u8',\n },\n ],\n },\n },\n {\n name: 'PackedCompressedAccountWithMerkleContext',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'compressedAccount',\n type: {\n defined: 'CompressedAccount',\n },\n },\n {\n name: 'merkleContext',\n type: {\n defined: 'PackedMerkleContext',\n },\n },\n {\n name: 'rootIndex',\n docs: [\n 'Index of root used in inclusion validity proof.',\n ],\n type: 'u16',\n },\n {\n name: 'readOnly',\n docs: [\n 'Placeholder to mark accounts read-only unimplemented set to false.',\n ],\n type: 'bool',\n },\n ],\n },\n },\n {\n name: 'PackedMerkleContext',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'merkleTreePubkeyIndex',\n type: 'u8',\n },\n {\n name: 'queuePubkeyIndex',\n type: 'u8',\n },\n {\n name: 'leafIndex',\n type: 'u32',\n },\n {\n name: 'proveByIndex',\n type: 'bool',\n },\n ],\n },\n },\n {\n name: 'PackedTokenTransferOutputData',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'owner',\n type: 'publicKey',\n },\n {\n name: 'amount',\n type: 'u64',\n },\n {\n name: 'lamports',\n type: {\n option: 'u64',\n },\n },\n {\n name: 'merkleTreeIndex',\n type: 'u8',\n },\n {\n name: 'tlv',\n docs: [\n 'Placeholder for TokenExtension tlv data (unimplemented)',\n ],\n type: {\n option: 'bytes',\n },\n },\n ],\n },\n },\n {\n name: 'PublicTransactionEvent',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'inputCompressedAccountHashes',\n type: {\n vec: {\n array: ['u8', 32],\n },\n },\n },\n {\n name: 'outputCompressedAccountHashes',\n type: {\n vec: {\n array: ['u8', 32],\n },\n },\n },\n {\n name: 'outputCompressedAccounts',\n type: {\n vec: {\n defined:\n 'OutputCompressedAccountWithPackedContext',\n },\n },\n },\n {\n name: 'outputLeafIndices',\n type: {\n vec: 'u32',\n },\n },\n {\n name: 'sequenceNumbers',\n type: {\n vec: {\n defined: 'MerkleTreeSequenceNumber',\n },\n },\n },\n {\n name: 'relayFee',\n type: {\n option: 'u64',\n },\n },\n {\n name: 'isCompress',\n type: 'bool',\n },\n {\n name: 'compressOrDecompressLamports',\n type: {\n option: 'u64',\n },\n },\n {\n name: 'pubkeyArray',\n type: {\n vec: 'publicKey',\n },\n },\n {\n name: 'message',\n type: {\n option: 'bytes',\n },\n },\n ],\n },\n },\n {\n name: 'QueueIndex',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'queueId',\n docs: ['Id of queue in queue account.'],\n type: 'u8',\n },\n {\n name: 'index',\n docs: ['Index of compressed account hash in queue.'],\n type: 'u16',\n },\n ],\n },\n },\n {\n name: 'TokenData',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'mint',\n docs: ['The mint associated with this account'],\n type: 'publicKey',\n },\n {\n name: 'owner',\n docs: ['The owner of this account.'],\n type: 'publicKey',\n },\n {\n name: 'amount',\n docs: ['The amount of tokens this account holds.'],\n type: 'u64',\n },\n {\n name: 'delegate',\n docs: [\n 'If `delegate` is `Some` then `delegated_amount` represents',\n 'the amount authorized by the delegate',\n ],\n type: {\n option: 'publicKey',\n },\n },\n {\n name: 'state',\n docs: [\"The account's state\"],\n type: {\n defined: 'AccountState',\n },\n },\n {\n name: 'tlv',\n docs: [\n 'Placeholder for TokenExtension tlv data (unimplemented)',\n ],\n type: {\n option: 'bytes',\n },\n },\n ],\n },\n },\n ],\n errors: [\n {\n code: 6000,\n name: 'PublicKeyAmountMissmatch',\n msg: 'public keys and amounts must be of same length',\n },\n {\n code: 6001,\n name: 'ComputeInputSumFailed',\n msg: 'ComputeInputSumFailed',\n },\n {\n code: 6002,\n name: 'ComputeOutputSumFailed',\n msg: 'ComputeOutputSumFailed',\n },\n {\n code: 6003,\n name: 'ComputeCompressSumFailed',\n msg: 'ComputeCompressSumFailed',\n },\n {\n code: 6004,\n name: 'ComputeDecompressSumFailed',\n msg: 'ComputeDecompressSumFailed',\n },\n {\n code: 6005,\n name: 'SumCheckFailed',\n msg: 'SumCheckFailed',\n },\n {\n code: 6006,\n name: 'DecompressRecipientUndefinedForDecompress',\n msg: 'DecompressRecipientUndefinedForDecompress',\n },\n {\n code: 6007,\n name: 'CompressedPdaUndefinedForDecompress',\n msg: 'CompressedPdaUndefinedForDecompress',\n },\n {\n code: 6008,\n name: 'DeCompressAmountUndefinedForDecompress',\n msg: 'DeCompressAmountUndefinedForDecompress',\n },\n {\n code: 6009,\n name: 'CompressedPdaUndefinedForCompress',\n msg: 'CompressedPdaUndefinedForCompress',\n },\n {\n code: 6010,\n name: 'DeCompressAmountUndefinedForCompress',\n msg: 'DeCompressAmountUndefinedForCompress',\n },\n {\n code: 6011,\n name: 'DelegateSignerCheckFailed',\n msg: 'DelegateSignerCheckFailed',\n },\n {\n code: 6012,\n name: 'MintTooLarge',\n msg: 'Minted amount greater than u64::MAX',\n },\n {\n code: 6013,\n name: 'SplTokenSupplyMismatch',\n msg: 'SplTokenSupplyMismatch',\n },\n {\n code: 6014,\n name: 'HeapMemoryCheckFailed',\n msg: 'HeapMemoryCheckFailed',\n },\n {\n code: 6015,\n name: 'InstructionNotCallable',\n msg: 'The instruction is not callable',\n },\n {\n code: 6016,\n name: 'ArithmeticUnderflow',\n msg: 'ArithmeticUnderflow',\n },\n {\n code: 6017,\n name: 'HashToFieldError',\n msg: 'HashToFieldError',\n },\n {\n code: 6018,\n name: 'InvalidAuthorityMint',\n msg: 'Expected the authority to be also a mint authority',\n },\n {\n code: 6019,\n name: 'InvalidFreezeAuthority',\n msg: 'Provided authority is not the freeze authority',\n },\n {\n code: 6020,\n name: 'InvalidDelegateIndex',\n },\n {\n code: 6021,\n name: 'TokenPoolPdaUndefined',\n },\n {\n code: 6022,\n name: 'IsTokenPoolPda',\n msg: 'Compress or decompress recipient is the same account as the token pool pda.',\n },\n {\n code: 6023,\n name: 'InvalidTokenPoolPda',\n },\n {\n code: 6024,\n name: 'NoInputTokenAccountsProvided',\n },\n {\n code: 6025,\n name: 'NoInputsProvided',\n },\n {\n code: 6026,\n name: 'MintHasNoFreezeAuthority',\n },\n {\n code: 6027,\n name: 'MintWithInvalidExtension',\n },\n {\n code: 6028,\n name: 'InsufficientTokenAccountBalance',\n msg: 'The token account balance is less than the remaining amount.',\n },\n {\n code: 6029,\n name: 'InvalidTokenPoolBump',\n msg: 'Max number of token pools reached.',\n },\n {\n code: 6030,\n name: 'FailedToDecompress',\n },\n {\n code: 6031,\n name: 'FailedToBurnSplTokensFromTokenPool',\n },\n {\n code: 6032,\n name: 'NoMatchingBumpFound',\n },\n ],\n};\n","import {\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionInstruction,\n TransactionSignature,\n} from '@solana/web3.js';\nimport { CompressedTokenProgram } from '../program';\nimport {\n Rpc,\n buildAndSignTx,\n sendAndConfirmTx,\n} from '@lightprotocol/stateless.js';\nimport { getTokenPoolInfos } from '../utils/get-token-pool-infos';\n\n/**\n * Register an existing mint with the CompressedToken program\n *\n * @param rpc RPC connection to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param confirmOptions Options for confirming the transaction\n * @param tokenProgramId Optional: Address of the token program. Default:\n * TOKEN_PROGRAM_ID\n *\n * @return transaction signature\n */\nexport async function createTokenPool(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n confirmOptions?: ConfirmOptions,\n tokenProgramId?: PublicKey,\n): Promise<TransactionSignature> {\n tokenProgramId = tokenProgramId\n ? tokenProgramId\n : await CompressedTokenProgram.getMintProgramId(mint, rpc);\n\n const ix = await CompressedTokenProgram.createTokenPool({\n feePayer: payer.publicKey,\n mint,\n tokenProgramId,\n });\n\n const { blockhash } = await rpc.getLatestBlockhash();\n\n const tx = buildAndSignTx([ix], payer, blockhash);\n\n const txId = await sendAndConfirmTx(rpc, tx, confirmOptions);\n\n return txId;\n}\n\n/**\n * Create additional token pools for an existing mint\n *\n * @param rpc RPC connection to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param numMaxAdditionalPools Number of additional token pools to create. Max\n * 3.\n * @param confirmOptions Optional: Options for confirming the transaction\n * @param tokenProgramId Optional: Address of the token program. Default:\n * TOKEN_PROGRAM_ID\n *\n * @return transaction signature\n */\nexport async function addTokenPools(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n numMaxAdditionalPools: number,\n confirmOptions?: ConfirmOptions,\n tokenProgramId?: PublicKey,\n) {\n tokenProgramId = tokenProgramId\n ? tokenProgramId\n : await CompressedTokenProgram.getMintProgramId(mint, rpc);\n const instructions: TransactionInstruction[] = [];\n\n const infos = (await getTokenPoolInfos(rpc, mint)).slice(0, 4);\n\n // Get indices of uninitialized pools\n const uninitializedIndices = [];\n for (let i = 0; i < infos.length; i++) {\n if (!infos[i].isInitialized) {\n uninitializedIndices.push(i);\n }\n }\n\n // Create instructions for requested number of pools\n for (let i = 0; i < numMaxAdditionalPools; i++) {\n if (i >= uninitializedIndices.length) {\n break;\n }\n\n instructions.push(\n await CompressedTokenProgram.addTokenPool({\n mint,\n feePayer: payer.publicKey,\n tokenProgramId,\n poolIndex: uninitializedIndices[i],\n }),\n );\n }\n const { blockhash } = await rpc.getLatestBlockhash();\n\n const tx = buildAndSignTx(instructions, payer, blockhash);\n\n const txId = await sendAndConfirmTx(rpc, tx, confirmOptions);\n\n return txId;\n}\n","import {\n ComputeBudgetProgram,\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionSignature,\n} from '@solana/web3.js';\nimport {\n bn,\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n} from '@lightprotocol/stateless.js';\nimport BN from 'bn.js';\nimport { CompressedTokenProgram } from '../program';\nimport {\n selectMinCompressedTokenAccountsForTransfer,\n selectTokenAccountsForApprove,\n} from '../utils';\n\n/**\n * Approve a delegate to spend tokens\n *\n * @param rpc Rpc to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param amount Number of tokens to delegate\n * @param owner Owner of the SPL token account.\n * @param delegate Address of the delegate\n * @param confirmOptions Options for confirming the transaction\n *\n * @return Signature of the confirmed transaction\n */\nexport async function approve(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n amount: number | BN,\n owner: Signer,\n delegate: PublicKey,\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n amount = bn(amount);\n const compressedTokenAccounts = await rpc.getCompressedTokenAccountsByOwner(\n owner.publicKey,\n {\n mint,\n },\n );\n\n const [inputAccounts] = selectTokenAccountsForApprove(\n compressedTokenAccounts.items,\n amount,\n );\n\n const proof = await rpc.getValidityProofV0(\n inputAccounts.map(account => ({\n hash: account.compressedAccount.hash,\n tree: account.compressedAccount.treeInfo.tree,\n queue: account.compressedAccount.treeInfo.queue,\n })),\n );\n\n const ix = await CompressedTokenProgram.approve({\n payer: payer.publicKey,\n inputCompressedTokenAccounts: inputAccounts,\n toAddress: delegate,\n amount,\n recentInputStateRootIndices: proof.rootIndices,\n recentValidityProof: proof.compressedProof,\n });\n\n const { blockhash } = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [owner]);\n const signedTx = buildAndSignTx(\n [ComputeBudgetProgram.setComputeUnitLimit({ units: 350_000 }), ix],\n payer,\n blockhash,\n additionalSigners,\n );\n\n return sendAndConfirmTx(rpc, signedTx, confirmOptions);\n}\n","import {\n ComputeBudgetProgram,\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionSignature,\n} from '@solana/web3.js';\nimport BN from 'bn.js';\nimport {\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n selectStateTreeInfo,\n toArray,\n TreeInfo,\n} from '@lightprotocol/stateless.js';\nimport { CompressedTokenProgram } from '../program';\nimport { getOrCreateAssociatedTokenAccount } from '@solana/spl-token';\n\nimport {\n getTokenPoolInfos,\n selectTokenPoolInfo,\n TokenPoolInfo,\n} from '../utils/get-token-pool-infos';\n\n/**\n * Mint compressed tokens to a solana address from an external mint authority\n *\n * @param rpc Rpc to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param toPubkey Address of the account to mint to\n * @param authority Minting authority\n * @param amount Amount to mint\n * @param outputStateTreeInfo Optional: State tree account that the compressed\n * tokens should be inserted into. Defaults to a\n * shared state tree account.\n * @param tokenPoolInfo Optional: Token pool info.\n * @param confirmOptions Options for confirming the transaction\n *\n * @return Signature of the confirmed transaction\n */\nexport async function approveAndMintTo(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n toPubkey: PublicKey,\n authority: Signer,\n amount: number | BN,\n outputStateTreeInfo?: TreeInfo,\n tokenPoolInfo?: TokenPoolInfo,\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n outputStateTreeInfo =\n outputStateTreeInfo ??\n selectStateTreeInfo(await rpc.getStateTreeInfos());\n tokenPoolInfo =\n tokenPoolInfo ??\n selectTokenPoolInfo(await getTokenPoolInfos(rpc, mint));\n\n const authorityTokenAccount = await getOrCreateAssociatedTokenAccount(\n rpc,\n payer,\n mint,\n authority.publicKey,\n undefined,\n undefined,\n confirmOptions,\n tokenPoolInfo.tokenProgram,\n );\n\n const ixs = await CompressedTokenProgram.approveAndMintTo({\n feePayer: payer.publicKey,\n mint,\n authority: authority.publicKey,\n authorityTokenAccount: authorityTokenAccount.address,\n amount,\n toPubkey,\n outputStateTreeInfo,\n tokenPoolInfo,\n });\n\n const { blockhash } = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [authority]);\n\n const tx = buildAndSignTx(\n [\n ComputeBudgetProgram.setComputeUnitLimit({\n units: 150_000 + toArray(amount).length * 20_000,\n }),\n ...ixs,\n ],\n payer,\n blockhash,\n additionalSigners,\n );\n\n return await sendAndConfirmTx(rpc, tx, confirmOptions);\n}\n","import {\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionSignature,\n ComputeBudgetProgram,\n} from '@solana/web3.js';\nimport {\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n selectStateTreeInfo,\n toArray,\n TreeInfo,\n} from '@lightprotocol/stateless.js';\nimport BN from 'bn.js';\nimport { CompressedTokenProgram } from '../program';\nimport {\n getTokenPoolInfos,\n selectTokenPoolInfo,\n TokenPoolInfo,\n} from '../utils/get-token-pool-infos';\n\n/**\n * Compress SPL tokens\n *\n * @param rpc Rpc connection to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param amount Number of tokens to compress.\n * @param owner Owner of the SPL token account.\n * @param sourceTokenAccount Source SPL token account. (ATA)\n * @param toAddress Recipient owner address.\n * @param outputStateTreeInfo Optional: State tree account that the compressed\n * tokens should be inserted into. Defaults to a\n * shared state tree account.\n * @param tokenPoolInfo Optional: Token pool info.\n * @param confirmOptions Options for confirming the transaction\n *\n * @return Signature of the confirmed transaction\n */\nexport async function compress(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n amount: number | BN | number[] | BN[],\n owner: Signer,\n sourceTokenAccount: PublicKey,\n toAddress: PublicKey | Array<PublicKey>,\n outputStateTreeInfo?: TreeInfo,\n tokenPoolInfo?: TokenPoolInfo,\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n outputStateTreeInfo =\n outputStateTreeInfo ??\n selectStateTreeInfo(await rpc.getStateTreeInfos());\n tokenPoolInfo =\n tokenPoolInfo ??\n selectTokenPoolInfo(await getTokenPoolInfos(rpc, mint));\n\n const compressIx = await CompressedTokenProgram.compress({\n payer: payer.publicKey,\n owner: owner.publicKey,\n source: sourceTokenAccount,\n toAddress,\n amount,\n mint,\n outputStateTreeInfo,\n tokenPoolInfo,\n });\n\n const blockhashCtx = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [owner]);\n const signedTx = buildAndSignTx(\n [\n ComputeBudgetProgram.setComputeUnitLimit({\n units: 130_000 + toArray(amount).length * 20_000,\n }),\n compressIx,\n ],\n payer,\n blockhashCtx.blockhash,\n additionalSigners,\n );\n\n return await sendAndConfirmTx(rpc, signedTx, confirmOptions, blockhashCtx);\n}\n","import {\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionSignature,\n ComputeBudgetProgram,\n} from '@solana/web3.js';\nimport {\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n selectStateTreeInfo,\n TreeInfo,\n} from '@lightprotocol/stateless.js';\nimport BN from 'bn.js';\nimport {\n getTokenPoolInfos,\n selectTokenPoolInfo,\n TokenPoolInfo,\n} from '../utils/get-token-pool-infos';\nimport { CompressedTokenProgram } from '../program';\n\n/**\n * Compress SPL tokens into compressed token format\n *\n * @param rpc Rpc connection to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param owner Owner of the token account\n * @param tokenAccount Token account to compress\n * @param remainingAmount Optional: amount to leave in token account.\n * Default: 0\n * @param outputStateTreeInfo Optional: State tree account that the compressed\n * account into\n * @param tokenPoolInfo Optional: Token pool info.\n * @param confirmOptions Options for confirming the transaction\n\n *\n * @return Signature of the confirmed transaction\n */\nexport async function compressSplTokenAccount(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n owner: Signer,\n tokenAccount: PublicKey,\n remainingAmount?: BN,\n outputStateTreeInfo?: TreeInfo,\n tokenPoolInfo?: TokenPoolInfo,\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n outputStateTreeInfo =\n outputStateTreeInfo ??\n selectStateTreeInfo(await rpc.getStateTreeInfos());\n tokenPoolInfo =\n tokenPoolInfo ??\n selectTokenPoolInfo(await getTokenPoolInfos(rpc, mint));\n\n const compressIx = await CompressedTokenProgram.compressSplTokenAccount({\n feePayer: payer.publicKey,\n authority: owner.publicKey,\n tokenAccount,\n mint,\n remainingAmount,\n outputStateTreeInfo,\n tokenPoolInfo,\n });\n\n const blockhashCtx = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [owner]);\n\n const signedTx = buildAndSignTx(\n [\n ComputeBudgetProgram.setComputeUnitLimit({\n units: 150_000,\n }),\n compressIx,\n ],\n payer,\n blockhashCtx.blockhash,\n additionalSigners,\n );\n\n return await sendAndConfirmTx(rpc, signedTx, confirmOptions, blockhashCtx);\n}\n","import {\n ConfirmOptions,\n Keypair,\n PublicKey,\n Signer,\n TransactionSignature,\n} from '@solana/web3.js';\nimport { CompressedTokenProgram } from '../program';\nimport {\n MINT_SIZE,\n TOKEN_2022_PROGRAM_ID,\n TOKEN_PROGRAM_ID,\n} from '@solana/spl-token';\nimport {\n Rpc,\n buildAndSignTx,\n dedupeSigner,\n sendAndConfirmTx,\n} from '@lightprotocol/stateless.js';\n\n/**\n * Create and initialize a new compressed token mint\n *\n * @param rpc RPC connection to use\n * @param payer Fee payer\n * @param mintAuthority Account that will control minting\n * @param decimals Location of the decimal place\n * @param keypair Optional: Mint keypair. Defaults to a random\n * keypair.\n * @param confirmOptions Options for confirming the transaction\n * @param tokenProgramId Optional: Program ID for the token. Defaults to\n * TOKEN_PROGRAM_ID.\n * @param freezeAuthority Optional: Account that will control freeze and thaw.\n * Defaults to none.\n *\n * @return Object with mint address and transaction signature\n */\nexport async function createMint(\n rpc: Rpc,\n payer: Signer,\n mintAuthority: PublicKey | Signer,\n decimals: number,\n keypair = Keypair.generate(),\n confirmOptions?: ConfirmOptions,\n tokenProgramId?: PublicKey | boolean,\n freezeAuthority?: PublicKey | Signer,\n): Promise<{ mint: PublicKey; transactionSignature: TransactionSignature }> {\n const rentExemptBalance =\n await rpc.getMinimumBalanceForRentExemption(MINT_SIZE);\n\n // If true, uses TOKEN_2022_PROGRAM_ID.\n // If false or undefined, defaults to TOKEN_PROGRAM_ID.\n // Otherwise, uses the provided tokenProgramId.\n const resolvedTokenProgramId =\n tokenProgramId === true\n ? TOKEN_2022_PROGRAM_ID\n : tokenProgramId || TOKEN_PROGRAM_ID;\n\n const ixs = await CompressedTokenProgram.createMint({\n feePayer: payer.publicKey,\n mint: keypair.publicKey,\n decimals,\n authority:\n 'secretKey' in mintAuthority\n ? mintAuthority.publicKey\n : mintAuthority,\n freezeAuthority:\n freezeAuthority && 'secretKey' in freezeAuthority\n ? freezeAuthority.publicKey\n : (freezeAuthority ?? null),\n rentExemptBalance,\n tokenProgramId: resolvedTokenProgramId,\n });\n\n const { blockhash } = await rpc.getLatestBlockhash();\n\n const additionalSigners = dedupeSigner(\n payer,\n [mintAuthority, freezeAuthority].filter(\n (signer): signer is Signer =>\n signer != undefined && 'secretKey' in signer,\n ),\n );\n\n const tx = buildAndSignTx(ixs, payer, blockhash, [\n ...additionalSigners,\n keypair,\n ]);\n const txId = await sendAndConfirmTx(rpc, tx, confirmOptions);\n\n return { mint: keypair.publicKey, transactionSignature: txId };\n}\n","import { PublicKey, Signer, TransactionSignature } from '@solana/web3.js';\nimport {\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n} from '@lightprotocol/stateless.js';\n\nimport { CompressedTokenProgram } from '../program';\n\n/**\n * Create a lookup table for the token program's default accounts\n *\n * @param rpc Rpc connection to use\n * @param payer Fee payer\n * @param authority Authority of the lookup table\n * @param mints Optional array of mint public keys to include in\n * the lookup table\n * @param additionalAccounts Optional array of additional account public keys\n * to include in the lookup table\n *\n * @return Object with transaction signatures and the address of the created\n * lookup table\n */\nexport async function createTokenProgramLookupTable(\n rpc: Rpc,\n payer: Signer,\n authority: Signer,\n mints?: PublicKey[],\n additionalAccounts?: PublicKey[],\n): Promise<{ txIds: TransactionSignature[]; address: PublicKey }> {\n const recentSlot = await rpc.getSlot('finalized');\n const { instructions, address } =\n await CompressedTokenProgram.createTokenProgramLookupTable({\n payer: payer.publicKey,\n authority: authority.publicKey,\n mints,\n remainingAccounts: additionalAccounts,\n recentSlot,\n });\n\n const additionalSigners = dedupeSigner(payer, [authority]);\n const txIds = [];\n\n for (const instruction of instructions) {\n const blockhashCtx = await rpc.getLatestBlockhash();\n const signedTx = buildAndSignTx(\n [instruction],\n payer,\n blockhashCtx.blockhash,\n additionalSigners,\n );\n const txId = await sendAndConfirmTx(\n rpc,\n signedTx,\n { commitment: 'finalized' },\n blockhashCtx,\n );\n txIds.push(txId);\n }\n\n return { txIds, address };\n}\n","import {\n ComputeBudgetProgram,\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionSignature,\n} from '@solana/web3.js';\nimport {\n bn,\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n} from '@lightprotocol/stateless.js';\nimport BN from 'bn.js';\nimport { CompressedTokenProgram } from '../program';\nimport { selectMinCompressedTokenAccountsForTransfer } from '../utils';\nimport {\n selectTokenPoolInfosForDecompression,\n TokenPoolInfo,\n} from '../utils/get-token-pool-infos';\nimport { getTokenPoolInfos } from '../utils/get-token-pool-infos';\n\n/**\n * Decompress compressed tokens\n *\n * @param rpc Rpc connection to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param amount Number of tokens to transfer\n * @param owner Owner of the compressed tokens\n * @param toAddress Destination **uncompressed** token account\n * address. (ATA)\n * @param tokenPoolInfos Optional: Token pool infos.\n * @param confirmOptions Options for confirming the transaction\n *\n * @return confirmed transaction signature\n */\nexport async function decompress(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n amount: number | BN,\n owner: Signer,\n toAddress: PublicKey,\n tokenPoolInfos?: TokenPoolInfo[],\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n amount = bn(amount);\n\n const compressedTokenAccounts = await rpc.getCompressedTokenAccountsByOwner(\n owner.publicKey,\n {\n mint,\n },\n );\n\n const [inputAccounts] = selectMinCompressedTokenAccountsForTransfer(\n compressedTokenAccounts.items,\n amount,\n );\n\n const proof = await rpc.getValidityProofV0(\n inputAccounts.map(account => ({\n hash: account.compressedAccount.hash,\n tree: account.compressedAccount.treeInfo.tree,\n queue: account.compressedAccount.treeInfo.queue,\n })),\n );\n\n tokenPoolInfos = tokenPoolInfos ?? (await getTokenPoolInfos(rpc, mint));\n\n const selectedTokenPoolInfos = selectTokenPoolInfosForDecompression(\n tokenPoolInfos,\n amount,\n );\n\n const ix = await CompressedTokenProgram.decompress({\n payer: payer.publicKey,\n inputCompressedTokenAccounts: inputAccounts,\n toAddress,\n amount,\n tokenPoolInfos: selectedTokenPoolInfos,\n recentInputStateRootIndices: proof.rootIndices,\n recentValidityProof: proof.compressedProof,\n });\n\n const { blockhash } = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [owner]);\n const signedTx = buildAndSignTx(\n [ComputeBudgetProgram.setComputeUnitLimit({ units: 350_000 }), ix],\n payer,\n blockhash,\n additionalSigners,\n );\n return await sendAndConfirmTx(rpc, signedTx, confirmOptions);\n}\n","import {\n ComputeBudgetProgram,\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionSignature,\n} from '@solana/web3.js';\nimport {\n bn,\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n} from '@lightprotocol/stateless.js';\n\nimport BN from 'bn.js';\n\nimport { CompressedTokenProgram } from '../program';\nimport { selectMinCompressedTokenAccountsForTransfer } from '../utils';\nimport {\n selectTokenPoolInfosForDecompression,\n TokenPoolInfo,\n} from '../utils/get-token-pool-infos';\nimport { getTokenPoolInfos } from '../utils/get-token-pool-infos';\n\n/**\n * Decompress delegated compressed tokens. Remaining compressed tokens are\n * returned to the owner without delegation.\n *\n * @param rpc Rpc connection to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param amount Number of tokens to decompress\n * @param owner Owner of the compressed tokens\n * @param toAddress Destination **uncompressed** token account\n * address. (ATA)\n * @param tokenPoolInfos Optional: Token pool infos.\n * @param confirmOptions Options for confirming the transaction\n *\n * @return Signature of the confirmed transaction\n */\nexport async function decompressDelegated(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n amount: number | BN,\n owner: Signer,\n toAddress: PublicKey,\n tokenPoolInfos?: TokenPoolInfo[],\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n amount = bn(amount);\n\n const compressedTokenAccounts =\n await rpc.getCompressedTokenAccountsByDelegate(owner.publicKey, {\n mint,\n });\n\n const [inputAccounts] = selectMinCompressedTokenAccountsForTransfer(\n compressedTokenAccounts.items,\n amount,\n );\n\n const proof = await rpc.getValidityProofV0(\n inputAccounts.map(account => ({\n hash: account.compressedAccount.hash,\n tree: account.compressedAccount.treeInfo.tree,\n queue: account.compressedAccount.treeInfo.queue,\n })),\n );\n\n const tokenPoolInfosToUse =\n tokenPoolInfos ??\n selectTokenPoolInfosForDecompression(\n await getTokenPoolInfos(rpc, mint),\n amount,\n );\n\n const ix = await CompressedTokenProgram.decompress({\n payer: payer.publicKey,\n inputCompressedTokenAccounts: inputAccounts,\n toAddress,\n amount,\n recentInputStateRootIndices: proof.rootIndices,\n recentValidityProof: proof.compressedProof,\n tokenPoolInfos: tokenPoolInfosToUse,\n });\n\n const { blockhash } = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [owner]);\n const signedTx = buildAndSignTx(\n [ComputeBudgetProgram.setComputeUnitLimit({ units: 350_000 }), ix],\n payer,\n blockhash,\n additionalSigners,\n );\n\n return sendAndConfirmTx(rpc, signedTx, confirmOptions);\n}\n","import { PublicKey } from '@solana/web3.js';\nimport BN from 'bn.js';\nimport { Buffer } from 'buffer';\nimport {\n ValidityProof,\n PackedMerkleContextLegacy,\n CompressedCpiContext,\n} from '@lightprotocol/stateless.js';\nimport { TokenPoolInfo } from './utils/get-token-pool-infos';\n\nexport type TokenTransferOutputData = {\n /**\n * The owner of the output token account\n */\n owner: PublicKey;\n /**\n * The amount of tokens of the output token account\n */\n amount: BN;\n /**\n * lamports associated with the output token account\n */\n lamports: BN | null;\n /**\n * TokenExtension tlv\n */\n tlv: Buffer | null;\n};\n\nexport type PackedTokenTransferOutputData = {\n /**\n * The owner of the output token account\n */\n owner: PublicKey;\n /**\n * The amount of tokens of the output token account\n */\n amount: BN;\n /**\n * lamports associated with the output token account\n */\n lamports: BN | null;\n /**\n * Merkle tree pubkey index in remaining accounts\n */\n merkleTreeIndex: number;\n /**\n * TokenExtension tlv\n */\n tlv: Buffer | null;\n};\n\nexport type InputTokenDataWithContext = {\n amount: BN;\n delegateIndex: number | null;\n merkleContext: PackedMerkleContextLegacy;\n rootIndex: number;\n lamports: BN | null;\n tlv: Buffer | null;\n};\n\nexport type DelegatedTransfer = {\n owner: PublicKey;\n delegateChangeAccountIndex: number | null;\n};\n\nexport type BatchCompressInstructionData = {\n pubkeys: PublicKey[];\n amounts: BN[] | null;\n lamports: BN | null;\n amount: BN | null;\n index: number;\n bump: number;\n};\n\nexport type MintToInstructionData = {\n recipients: PublicKey[];\n amounts: BN[];\n lamports: BN | null;\n};\nexport type CompressSplTokenAccountInstructionData = {\n owner: PublicKey;\n remainingAmount: BN | null;\n cpiContext: CompressedCpiContext | null;\n};\n\nexport function isSingleTokenPoolInfo(\n tokenPoolInfos: TokenPoolInfo | TokenPoolInfo[],\n): tokenPoolInfos is TokenPoolInfo {\n return !Array.isArray(tokenPoolInfos);\n}\n\nexport type CompressedTokenInstructionDataTransfer = {\n /**\n * Validity proof\n */\n proof: ValidityProof | null;\n /**\n * The mint of the transfer\n */\n mint: PublicKey;\n /**\n * Whether the signer is a delegate\n */\n delegatedTransfer: DelegatedTransfer | null;\n /**\n * Input token data with packed merkle context\n */\n inputTokenDataWithContext: InputTokenDataWithContext[];\n /**\n * Data of the output token accounts\n */\n outputCompressedAccounts: PackedTokenTransferOutputData[];\n /**\n * Whether it's a compress or decompress action if compressOrDecompressAmount is non-null\n */\n isCompress: boolean;\n /**\n * If null, it's a transfer.\n * If some, the amount that is being deposited into (compress) or withdrawn from (decompress) the token escrow\n */\n compressOrDecompressAmount: BN | null;\n /**\n * CPI context if\n */\n cpiContext: CompressedCpiContext | null;\n /**\n * The index of the Merkle tree for a lamport change account.\n */\n lamportsChangeAccountMerkleTreeIndex: number | null;\n};\n\nexport type TokenData = {\n /**\n * The mint associated with this account\n */\n mint: PublicKey;\n /**\n * The owner of this account\n */\n owner: PublicKey;\n /**\n * The amount of tokens this account holds\n */\n amount: BN;\n /**\n * If `delegate` is `Some` then `delegated_amount` represents the amount\n * authorized by the delegate\n */\n delegate: PublicKey | null;\n /**\n * The account's state\n */\n state: number;\n /**\n * TokenExtension tlv\n */\n tlv: Buffer | null;\n};\n\nexport type CompressedTokenInstructionDataApprove = {\n proof: ValidityProof | null;\n mint: PublicKey;\n inputTokenDataWithContext: InputTokenDataWithContext[];\n cpiContext: CompressedCpiContext | null;\n delegate: PublicKey;\n delegatedAmount: BN;\n delegateMerkleTreeIndex: number;\n changeAccountMerkleTreeIndex: number;\n delegateLamports: BN | null;\n};\n\nexport type CompressedTokenInstructionDataRevoke = {\n proof: ValidityProof | null;\n mint: PublicKey;\n inputTokenDataWithContext: InputTokenDataWithContext[];\n cpiContext: CompressedCpiContext | null;\n outputAccountMerkleTreeIndex: number;\n};\n","import {\n ComputeBudgetProgram,\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionSignature,\n} from '@solana/web3.js';\nimport {\n Rpc,\n dedupeSigner,\n buildAndSignTx,\n sendAndConfirmTx,\n bn,\n} from '@lightprotocol/stateless.js';\nimport { CompressedTokenProgram } from '../program';\n\n/**\n * Merge multiple compressed token accounts for a given mint into a single\n * account\n *\n * @param rpc RPC connection to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param owner Owner of the token accounts to be merged\n * @param confirmOptions Options for confirming the transaction\n *\n * @return confirmed transaction signature\n */\nexport async function mergeTokenAccounts(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n owner: Signer,\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n const compressedTokenAccounts = await rpc.getCompressedTokenAccountsByOwner(\n owner.publicKey,\n { mint },\n );\n\n if (compressedTokenAccounts.items.length === 0) {\n throw new Error(\n `No compressed token accounts found for mint ${mint.toBase58()}`,\n );\n }\n\n const instructions = [\n ComputeBudgetProgram.setComputeUnitLimit({ units: 1_000_000 }),\n ];\n\n for (\n let i = 0;\n i < compressedTokenAccounts.items.slice(0, 8).length;\n i += 4\n ) {\n const batch = compressedTokenAccounts.items.slice(i, i + 4);\n\n const proof = await rpc.getValidityProof(\n batch.map(account => bn(account.compressedAccount.hash)),\n );\n\n const batchInstructions =\n await CompressedTokenProgram.mergeTokenAccounts({\n payer: payer.publicKey,\n owner: owner.publicKey,\n inputCompressedTokenAccounts: batch,\n mint,\n recentValidityProof: proof.compressedProof,\n recentInputStateRootIndices: proof.rootIndices,\n });\n\n instructions.push(...batchInstructions);\n }\n\n const { blockhash } = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [owner]);\n\n const signedTx = buildAndSignTx(\n instructions,\n payer,\n blockhash,\n additionalSigners,\n );\n\n return sendAndConfirmTx(rpc, signedTx, confirmOptions);\n}\n","import {\n ComputeBudgetProgram,\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionSignature,\n} from '@solana/web3.js';\nimport BN from 'bn.js';\nimport {\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n selectStateTreeInfo,\n TreeInfo,\n} from '@lightprotocol/stateless.js';\nimport { CompressedTokenProgram } from '../program';\nimport {\n getTokenPoolInfos,\n selectTokenPoolInfo,\n TokenPoolInfo,\n} from '../utils/get-token-pool-infos';\n\n/**\n * Mint compressed tokens to a solana address\n *\n * @param rpc Rpc connection to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param toPubkey Address of the account to mint to. Can be an\n * array of addresses if the amount is an array of\n * amounts.\n * @param authority Mint authority\n * @param amount Amount to mint. Pass an array of amounts if the\n * toPubkey is an array of addresses.\n * @param outputStateTreeInfo Optional: State tree account that the compressed\n * tokens should be part of. Defaults to the\n * default state tree account.\n * @param tokenPoolInfo Optional: Token pool information\n * @param confirmOptions Options for confirming the transaction\n *\n * @return Signature of the confirmed transaction\n */\nexport async function mintTo(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n toPubkey: PublicKey | PublicKey[],\n authority: Signer,\n amount: number | BN | number[] | BN[],\n outputStateTreeInfo?: TreeInfo,\n tokenPoolInfo?: TokenPoolInfo,\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n outputStateTreeInfo =\n outputStateTreeInfo ??\n selectStateTreeInfo(await rpc.getStateTreeInfos());\n tokenPoolInfo =\n tokenPoolInfo ??\n selectTokenPoolInfo(await getTokenPoolInfos(rpc, mint));\n\n const ix = await CompressedTokenProgram.mintTo({\n feePayer: payer.publicKey,\n mint,\n authority: authority.publicKey,\n amount,\n toPubkey,\n outputStateTreeInfo,\n tokenPoolInfo,\n });\n\n const { blockhash } = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [authority]);\n\n const tx = buildAndSignTx(\n [ComputeBudgetProgram.setComputeUnitLimit({ units: 1_000_000 }), ix],\n payer,\n blockhash,\n additionalSigners,\n );\n\n return sendAndConfirmTx(rpc, tx, confirmOptions);\n}\n","import {\n ComputeBudgetProgram,\n ConfirmOptions,\n Signer,\n TransactionSignature,\n} from '@solana/web3.js';\nimport {\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n ParsedTokenAccount,\n} from '@lightprotocol/stateless.js';\nimport { CompressedTokenProgram } from '../program';\n\n/**\n * Revoke one or more delegated token accounts\n *\n * @param rpc Rpc connection to use\n * @param payer Fee payer\n * @param accounts Delegated compressed token accounts to revoke\n * @param owner Owner of the compressed tokens\n * @param confirmOptions Options for confirming the transaction\n *\n * @return Signature of the confirmed transaction\n */\nexport async function revoke(\n rpc: Rpc,\n payer: Signer,\n accounts: ParsedTokenAccount[],\n owner: Signer,\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n const proof = await rpc.getValidityProofV0(\n accounts.map(account => ({\n hash: account.compressedAccount.hash,\n tree: account.compressedAccount.treeInfo.tree,\n queue: account.compressedAccount.treeInfo.queue,\n })),\n );\n checkOwner(owner, accounts);\n checkIsDelegated(accounts);\n\n const ix = await CompressedTokenProgram.revoke({\n payer: payer.publicKey,\n inputCompressedTokenAccounts: accounts,\n recentInputStateRootIndices: proof.rootIndices,\n recentValidityProof: proof.compressedProof,\n });\n\n const { blockhash } = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [owner]);\n const signedTx = buildAndSignTx(\n [ComputeBudgetProgram.setComputeUnitLimit({ units: 500_000 }), ix],\n payer,\n blockhash,\n additionalSigners,\n );\n\n return sendAndConfirmTx(rpc, signedTx, confirmOptions);\n}\n\nfunction checkOwner(owner: Signer, accounts: ParsedTokenAccount[]) {\n if (!owner.publicKey.equals(accounts[0].parsed.owner)) {\n throw new Error(\n `Owner ${owner.publicKey.toBase58()} does not match account ${accounts[0].parsed.owner.toBase58()}`,\n );\n }\n}\n\nfunction checkIsDelegated(accounts: ParsedTokenAccount[]) {\n if (accounts.some(account => account.parsed.delegate === null)) {\n throw new Error('Account is not delegated');\n }\n}\n","import {\n ComputeBudgetProgram,\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionSignature,\n} from '@solana/web3.js';\nimport {\n bn,\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n StateTreeInfo,\n selectStateTreeInfo,\n} from '@lightprotocol/stateless.js';\nimport BN from 'bn.js';\nimport { CompressedTokenProgram } from '../program';\nimport { selectMinCompressedTokenAccountsForTransfer } from '../utils';\n\n/**\n * Transfer compressed tokens from one owner to another\n *\n * @param rpc Rpc connection to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param amount Number of tokens to transfer\n * @param owner Owner of the compressed tokens\n * @param toAddress Destination address of the recipient\n * @param confirmOptions Options for confirming the transaction\n *\n * @return confirmed transaction signature\n */\nexport async function transfer(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n amount: number | BN,\n owner: Signer,\n toAddress: PublicKey,\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n amount = bn(amount);\n const compressedTokenAccounts = await rpc.getCompressedTokenAccountsByOwner(\n owner.publicKey,\n {\n mint,\n },\n );\n\n const [inputAccounts] = selectMinCompressedTokenAccountsForTransfer(\n compressedTokenAccounts.items,\n amount,\n );\n\n const proof = await rpc.getValidityProofV0(\n inputAccounts.map(account => ({\n hash: account.compressedAccount.hash,\n tree: account.compressedAccount.treeInfo.tree,\n queue: account.compressedAccount.treeInfo.queue,\n })),\n );\n\n const ix = await CompressedTokenProgram.transfer({\n payer: payer.publicKey,\n inputCompressedTokenAccounts: inputAccounts,\n toAddress,\n amount,\n recentInputStateRootIndices: proof.rootIndices,\n recentValidityProof: proof.compressedProof,\n });\n\n const { blockhash } = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [owner]);\n const signedTx = buildAndSignTx(\n [ComputeBudgetProgram.setComputeUnitLimit({ units: 500_000 }), ix],\n payer,\n blockhash,\n additionalSigners,\n );\n\n return sendAndConfirmTx(rpc, signedTx, confirmOptions);\n}\n","import {\n ComputeBudgetProgram,\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionSignature,\n} from '@solana/web3.js';\nimport {\n bn,\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n} from '@lightprotocol/stateless.js';\nimport BN from 'bn.js';\nimport { CompressedTokenProgram } from '../program';\nimport { selectMinCompressedTokenAccountsForTransfer } from '../utils';\n\n/**\n * Transfer delegated compressed tokens to another owner\n *\n * @param rpc Rpc connection to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param amount Number of tokens to transfer\n * @param owner Owner of the compressed tokens\n * @param toAddress Destination address of the recipient\n * @param confirmOptions Options for confirming the transaction\n *\n * @return confirmed transaction signature\n */\nexport async function transferDelegated(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n amount: number | BN,\n owner: Signer,\n toAddress: PublicKey,\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n amount = bn(amount);\n const compressedTokenAccounts =\n await rpc.getCompressedTokenAccountsByDelegate(owner.publicKey, {\n mint,\n });\n\n const [inputAccounts] = selectMinCompressedTokenAccountsForTransfer(\n compressedTokenAccounts.items,\n amount,\n );\n\n const proof = await rpc.getValidityProofV0(\n inputAccounts.map(account => ({\n hash: account.compressedAccount.hash,\n tree: account.compressedAccount.treeInfo.tree,\n queue: account.compressedAccount.treeInfo.queue,\n })),\n );\n\n const ix = await CompressedTokenProgram.transfer({\n payer: payer.publicKey,\n inputCompressedTokenAccounts: inputAccounts,\n toAddress,\n amount,\n recentInputStateRootIndices: proof.rootIndices,\n recentValidityProof: proof.compressedProof,\n });\n\n const { blockhash } = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [owner]);\n const signedTx = buildAndSignTx(\n [ComputeBudgetProgram.setComputeUnitLimit({ units: 500_000 }), ix],\n payer,\n blockhash,\n additionalSigners,\n );\n\n return sendAndConfirmTx(rpc, signedTx, confirmOptions);\n}\n"],"names":["POOL_SEED","Buffer","from","CPI_AUTHORITY_SEED","CREATE_TOKEN_POOL_DISCRIMINATOR","MINT_TO_DISCRIMINATOR","BATCH_COMPRESS_DISCRIMINATOR","TRANSFER_DISCRIMINATOR","COMPRESS_SPL_TOKEN_ACCOUNT_DISCRIMINATOR","APPROVE_DISCRIMINATOR","REVOKE_DISCRIMINATOR","ADD_TOKEN_POOL_DISCRIMINATOR","checkTokenPoolInfo","tokenPoolInfo","mint","equals","Error","isInitialized","toBase58","async","getTokenPoolInfos","rpc","commitment","addressesAndBumps","Array","length","_","i","CompressedTokenProgram","deriveTokenPoolPdaWithIndex","accountInfos","getMultipleAccountsInfo","map","addressAndBump","parsedInfos","unpackAccount","owner","tokenProgram","parsedInfo","tokenPoolPda","address","activity","undefined","balance","bn","amount","toString","poolIndex","bump","Action","shuffleArray","array","j","Math","floor","random","selectTokenPoolInfo","infos","filteredInfos","filter","info","selectTokenPoolInfosForDecompression","decompressAmount","sufficientBalanceInfo","find","gte","mul","sort","a","b","every","isZero","ERROR_NO_ACCOUNTS_FOUND","selectTokenAccountsForApprove","accounts","approveAmount","maxInputs","exactMatch","account","parsed","eq","compressedAccount","lamports","selectMinCompressedTokenAccountsForTransfer","transferAmount","selectedAccounts","accumulatedAmount","accumulatedLamports","maxPossibleAmount","selectMinCompressedTokenAccountsForTransferOrPartial","lt","totalBalance","reduce","acc","add","cmp","push","slice","total","console","log","selectSmartCompressedTokenAccountsForTransferOrPartial","nonZeroAccounts","remainingAccounts","smallestAccount","min","max","packCompressedTokenAccounts","params","inputCompressedTokenAccounts","outputStateTreeInfo","rootIndices","tokenTransferOutputs","_remainingAccounts","delegateIndex","delegate","getIndexOrAdd","packedInputTokenData","forEach","index","merkleTreePubkeyIndex","treeInfo","tree","queuePubkeyIndex","queue","merkleContext","leafIndex","proveByIndex","rootIndex","tlv","activeTreeInfo","nextTreeInfo","activeTreeOrQueue","treeType","TreeType","StateV2","featureFlags","isV2","paddedOutputStateMerkleTrees","padOutputStateMerkleTrees","packedOutputTokenData","merkleTreeIndex","_a","remainingAccountMetas","pubkey","isWritable","isSigner","inputTokenDataWithContext","checkMint","compressedTokenAccounts","CompressedProofLayout","struct","u8","PackedTokenTransferOutputDataLayout","publicKey","u64","option","vecU8","InputTokenDataWithContextLayout","u32","bool","u16","DelegatedTransferLayout","CpiContextLayout","CompressedTokenInstructionDataTransferLayout","vec","mintToLayout","batchCompressLayout","compressSplTokenAccountInstructionDataLayout","encodeMintToInstructionData","data","buffer","alloc","len","encode","recipients","amounts","concat","Uint8Array","subarray","encodeBatchCompressInstructionData","lengthBuffer","writeUInt32LE","dataBuffer","encodeCompressSplTokenAccountInstructionData","remainingAmount","cpiContext","encodeTransferInstructionData","createTokenPoolAccountsLayout","feePayer","systemProgram","cpiAuthorityPda","addTokenPoolAccountsLayout","existingTokenPoolPda","mintToAccountsLayout","defaultPubkey","programId","authority","lightSystemProgram","registeredProgramPda","noopProgram","accountCompressionAuthority","accountCompressionProgram","merkleTree","selfProgram","solPoolPda","transferAccountsLayout","compressOrDecompressTokenAccount","approveAccountsLayout","revokeAccountsLayout","freezeAccountsLayout","thawAccountsLayout","CompressedTokenInstructionDataApproveLayout","CompressedTokenInstructionDataRevokeLayout","emptyProof","fill","c","isEmptyProof","proof","encodeApproveInstructionData","proofOption","Object","assign","encodeRevokeInstructionData","sumUpTokenAmount","validateSameTokenOwner","parseTokenData","currentOwner","parseMaybeDelegatedTransfer","inputs","outputs","delegatedAccountsIndex","findIndex","delegatedTransfer","delegateChangeAccountIndex","createTransferOutputState","toAddress","inputAmount","inputLamports","sumUpLamports","changeAmount","sub","validateSufficientBalance","validateSameOwner","createDecompressOutputState","constructor","setProgramId","this","PublicKey","deriveTokenPoolPda","seeds","toBuffer","findProgramAddressSync","findTokenPoolIndexAndBump","poolPda","derivedPda","deriveCpiAuthorityPda","createMint","freezeAuthority","decimals","rentExemptBalance","tokenProgramId","mintSize","TOKEN_PROGRAM_ID","SystemProgram","createAccount","fromPubkey","newAccountPubkey","space","MINT_SIZE","createInitializeMint2Instruction","createTokenPool","keys","TransactionInstruction","addTokenPool","mintTo","toPubkey","systemKeys","defaultStaticAccountsStruct","toArray","toPubkeys","LightSystemProgram","approveAndMintTo","authorityTokenAccount","amountBigInt","BigInt","createMintToInstruction","compress","payer","source","transfer","recentValidityProof","recentInputStateRootIndices","outputCompressedAccounts","compressOrDecompressAmount","isCompress","lamportsChangeAccountMerkleTreeIndex","createTokenProgramLookupTable","mints","recentSlot","createInstruction","lookupTableAddress","AddressLookupTableProgram","createLookupTable","optionalMintKeys","instructions","extendLookupTable","lookupTable","addresses","ComputeBudgetProgram","defaultTestStateTreeAccounts","nullifierQueue","addressTree","addressQueue","TOKEN_2022_PROGRAM_ID","chunk","extendIx","amountArray","toAddressArray","pubkeys","amt","amountBN","isArray","sum","decompress","tokenPoolInfos","tokenPoolInfosArray","mergeTokenAccounts","compressSplTokenAccount","tokenAccount","getMintProgramId","connection","getAccountInfo","approve","CHANGE_INDEX","delegatedAmount","delegateMerkleTreeIndex","changeAccountMerkleTreeIndex","delegateLamports","revoke","outputAccountMerkleTreeIndex","version","name","docs","isMut","args","type","isOptional","defined","types","kind","variants","fields","errors","code","msg","numMaxAdditionalPools","confirmOptions","uninitializedIndices","blockhash","getLatestBlockhash","tx","buildAndSignTx","sendAndConfirmTx","getCompressedTokenAccountsByOwner","inputAccounts","items","getValidityProofV0","hash","ix","compressedProof","additionalSigners","dedupeSigner","signedTx","setComputeUnitLimit","units","selectStateTreeInfo","getStateTreeInfos","getOrCreateAssociatedTokenAccount","ixs","sourceTokenAccount","compressIx","blockhashCtx","mintAuthority","keypair","Keypair","generate","getMinimumBalanceForRentExemption","resolvedTokenProgramId","signer","txId","transactionSignature","additionalAccounts","getSlot","txIds","instruction","decode","selectedTokenPoolInfos","getCompressedTokenAccountsByDelegate","tokenPoolInfosToUse","batch","getValidityProof","batchInstructions","checkOwner","some","checkIsDelegated","totalLamports"],"mappings":"oqqBACa,MAAAA,GAAYC,EAAOC,KAAK,QAExBC,GAAqBF,EAAOC,KAAK,iBAIjCE,GAAkCH,EAAOC,KAAK,CACvD,GAAI,IAAK,GAAI,IAAK,IAAK,IAAK,IAAK,MAExBG,GAAwBJ,EAAOC,KAAK,CAC7C,IAAK,GAAI,GAAI,IAAK,GAAI,IAAK,IAAK,MAEvBI,GAA+BL,EAAOC,KAAK,CACpD,GAAI,IAAK,IAAK,GAAI,IAAK,GAAI,IAAK,MAEvBK,GAAyBN,EAAOC,KAAK,CAC9C,IAAK,GAAI,IAAK,IAAK,IAAK,EAAG,GAAI,MAEtBM,GAA2CP,EAAOC,KAAK,CAChE,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAG1BO,GAAwBR,EAAOC,KAAK,CAC7C,GAAI,GAAI,IAAK,GAAI,IAAK,IAAK,GAAI,KAEtBQ,GAAuBT,EAAOC,KAAK,CAC5C,IAAK,GAAI,GAAI,GAAI,IAAK,IAAK,GAAI,MAEtBS,GAA+BV,EAAOC,KAAK,CACpD,IAAK,IAAK,IAAK,GAAI,GAAI,IAAK,EAAG,MClBnB,SAAAU,GACZC,EACAC,GAEA,IAAKD,EAAcC,KAAKC,OAAOD,GAC3B,MAAM,IAAIE,MAAM,oDAGpB,IAAKH,EAAcI,cACf,MAAM,IAAID,MACN,iFAAiFF,EAAKI,qCAG9F,OAAO,CACX,CAUOC,eAAeC,GAClBC,EACAP,EACAQ,GAEA,MAAMC,EAAoBC,MAAMtB,KAAK,CAAEuB,OAAQ,IAAK,CAACC,EAAGC,IACpDC,GAAuBC,4BAA4Bf,EAAMa,KAGvDG,QAAqBT,EAAIU,wBAC3BR,EAAkBS,KAAIC,GAAkBA,EAAe,KACvDX,GAGJ,GAAwB,OAApBQ,EAAa,GACb,MAAM,IAAId,MACN,wEAAwEF,EAAKI,qCAIrF,MAAMgB,EAAcX,EAAkBS,KAAI,CAACC,EAAgBN,IACvDG,EAAaH,GACPQ,gBACIF,EAAe,GACfH,EAAaH,GACbG,EAAaH,GAAGS,OAEpB,OAGJC,EAAeP,EAAa,GAAGM,MACrC,OAAOF,EAAYF,KAAI,CAACM,EAAYX,IAC3BW,EAaE,CACHxB,OACAyB,aAAcD,EAAWE,QACzBH,eACAI,cAAUC,EACVC,QAASC,EAAAA,GAAGN,EAAWO,OAAOC,YAC9B7B,cAAe,EACf8B,UAAWpB,EACXqB,KAAMzB,EAAkBI,GAAG,IApBpB,CACHb,OACAyB,aAAchB,EAAkBI,GAAG,GACnCU,eACAI,cAAUC,EACVC,QAASC,EAAEA,GAAC,GACZ3B,cAAe,EACf8B,UAAWpB,EACXqB,KAAMzB,EAAkBI,GAAG,KAe3C,CAqDA,IAAYsB,GAAAA,QAIXA,YAAA,GAJWA,GAAAA,iBAAAA,QAAAA,OAIX,CAAA,IAHGA,GAAA,SAAA,GAAA,WACAA,GAAAA,GAAA,WAAA,GAAA,aACAA,GAAAA,GAAA,SAAA,GAAA,WAMJ,MAAMC,GAAmBC,IACrB,IAAK,IAAIxB,EAAIwB,EAAM1B,OAAS,EAAGE,EAAI,EAAGA,IAAK,CACvC,MAAMyB,EAAIC,KAAKC,MAAMD,KAAKE,UAAY5B,EAAI,KACzCwB,EAAMxB,GAAIwB,EAAMC,IAAM,CAACD,EAAMC,GAAID,EAAMxB,GAC3C,CACD,OAAOwB,CAAK,EAaV,SAAUK,GAAoBC,GAChC,MAGMC,EAHgBR,GAAaO,GAGCE,QAAOC,GAAQA,EAAK3C,gBAExD,GAA6B,IAAzByC,EAAcjC,OACd,MAAM,IAAIT,MACN,yDAKR,OAAO0C,EAAc,EACzB,CAcgB,SAAAG,GACZJ,EACAK,GAEA,GAAqB,IAAjBL,EAAMhC,OACN,MAAM,IAAIT,MAAM,6CAKpB,MAAM+C,GAFNN,EAAQP,GAAaO,IAEeO,MAAKJ,GACrCA,EAAKjB,QAAQsB,IAAIrB,EAAAA,GAAGkB,GAAkBI,IAAItB,EAAEA,GAAC,QASjD,IALAa,EAAQA,EACHE,QAAOC,GAAQA,EAAK3C,gBACpBkD,MAAK,CAACC,EAAGC,IAAMD,EAAErB,UAAYsB,EAAEtB,aAENuB,OAAMV,GAAQA,EAAKjB,QAAQ4B,WAErD,MAAM,IAAIvD,MACN,mFAKR,OAAO+C,EAAwB,CAACA,GAAyBN,CAC7D,CChOO,MAAMe,GACT,kDAmBE,SAAUC,GACZC,EACAC,EACAC,EAAoB,GAQpB,MAAMC,EAAaH,EAASV,MAAKc,GAC7BA,EAAQC,OAAOlC,OAAOmC,GAAGL,KAE7B,OAAIE,EACO,CACH,CAACA,GACDA,EAAWE,OAAOlC,OAClBgC,EAAWI,kBAAkBC,SAC7BL,EAAWE,OAAOlC,QAKnBsC,GACHT,EACAC,EACAC,EAER,CAgDM,SAAUO,GACZT,EACAU,EACAR,EAAoB,GAOpB,MACIS,EACAC,EACAC,EACAC,GACAC,GACAf,EACAU,EACAR,GAGJ,GAAIU,EAAkBI,GAAG9C,KAAGwC,IAAkB,CAC1C,MAAMO,EAAejB,EAASkB,QAC1B,CAACC,EAAKf,IAAYe,EAAIC,IAAIhB,EAAQC,OAAOlC,SACzCD,EAAAA,GAAG,IAEP,MAAIyC,EAAiB5D,QAAUmD,EACrB,IAAI5D,MACN,+BAA+BwE,EAAkB1C,eAAe8B,+CAAuDe,EAAa7C,eAAe4B,EAASjD,wEAG1J,IAAIT,MACN,gDAAgDoE,EAAetC,0BAA0B6C,EAAa7C,cAGjH,CAED,GAAgC,IAA5BuC,EAAiB5D,OACjB,MAAM,IAAIT,MAAMwD,IAGpB,MAAO,CACHa,EACAC,EACAC,EACAC,EAER,CAOM,SAAUC,GACZf,EACAU,EACAR,EAAoB,GAOpB,GAAwB,IAApBF,EAASjD,OACT,MAAM,IAAIT,MAAMwD,IAGpB,IAAIc,EAAoB1C,KAAG,GACvB2C,EAAsB3C,KAAG,GACzB4C,EAAoB5C,KAAG,GAE3B,MAAMyC,EAAyC,GAE/CX,EAASP,MAAK,CAACC,EAAGC,IAAMA,EAAEU,OAAOlC,OAAOkD,IAAI3B,EAAEW,OAAOlC,UAErD,IAAK,MAAMiC,KAAWJ,EAAU,CAC5B,GAAIW,EAAiB5D,QAAUmD,EAAW,MAC1C,GAAIU,EAAkBrB,IAAIrB,EAAEA,GAACwC,IAAkB,MAG1CN,EAAQC,OAAOlC,OAAO0B,UACtBO,EAAQG,kBAAkBC,SAASX,WAEpCe,EAAoBA,EAAkBQ,IAAIhB,EAAQC,OAAOlC,QACzD0C,EAAsBA,EAAoBO,IACtChB,EAAQG,kBAAkBC,UAE9BG,EAAiBW,KAAKlB,GAE7B,CAaD,GAVAU,EAAoBd,EACfuB,MAAM,EAAGrB,GACTgB,QAAO,CAACM,EAAOpB,IAAYoB,EAAMJ,IAAIhB,EAAQC,OAAOlC,SAASD,KAAG,IAEjE0C,EAAkBI,GAAG9C,KAAGwC,KACxBe,QAAQC,IACJ,iDAAiDhB,EAAetC,sCAAsC0C,EAAkB1C,eAIhG,IAA5BuC,EAAiB5D,OACjB,MAAM,IAAIT,MAAMwD,IAGpB,MAAO,CACHa,EACAC,EACAC,EACAC,EAER,CA+FM,SAAUa,GACZ3B,EACAU,EACAR,EAAoB,GAOpB,GAAwB,IAApBF,EAASjD,OACT,MAAM,IAAIT,MAAMwD,IAGpB,IAAIc,EAAoB1C,KAAG,GACvB2C,EAAsB3C,KAAG,GAE7B,MAAMyC,EAAyC,GAGzCiB,EAAkB5B,EAASf,QAC7BmB,IACKA,EAAQC,OAAOlC,OAAO0B,WACtBO,EAAQG,kBAAkBC,SAASX,WAG5C+B,EAAgBnC,MAAK,CAACC,EAAGC,IAAMA,EAAEU,OAAOlC,OAAOkD,IAAI3B,EAAEW,OAAOlC,UAE5D,IAAK,MAAMiC,KAAWwB,EAAiB,CACnC,GAAIjB,EAAiB5D,QAAUmD,EAAW,MAO1C,GANAU,EAAoBA,EAAkBQ,IAAIhB,EAAQC,OAAOlC,QACzD0C,EAAsBA,EAAoBO,IACtChB,EAAQG,kBAAkBC,UAE9BG,EAAiBW,KAAKlB,GAElBQ,EAAkBrB,IAAIrB,KAAGwC,IAAkB,CAE3C,MAAMmB,EAAoBD,EAAgBL,MACtCZ,EAAiB5D,QAErB,GAAI8E,EAAkB9E,OAAS,EAAG,CAC9B,MAAM+E,EAAkBD,EAAkBX,QAAO,CAACa,EAAKZ,IACnDA,EAAId,OAAOlC,OAAO6C,GAAGe,EAAI1B,OAAOlC,QAAUgD,EAAMY,IAEhDpB,EAAiB5D,OAASmD,IAC1BS,EAAiBW,KAAKQ,GACtBlB,EAAoBA,EAAkBQ,IAClCU,EAAgBzB,OAAOlC,QAE3B0C,EAAsBA,EAAoBO,IACtCU,EAAgBvB,kBAAkBC,UAG7C,CACD,KACH,CACJ,CAED,MAAMM,EAAoBc,EACrBL,MAAM,EAAGrB,GACTgB,QAAO,CAACc,EAAK5B,IAAY4B,EAAIZ,IAAIhB,EAAQC,OAAOlC,SAASD,KAAG,IAEjE,GAAgC,IAA5ByC,EAAiB5D,OACjB,MAAM,IAAIT,MAAMwD,IAGpB,MAAO,CACHa,EACAC,EACAC,EACAC,EAER,CCxVM,SAAUmB,GACZC,GAMA,MAAMC,6BACFA,EAA4BC,oBAC5BA,EAAmBP,kBACnBA,EAAoB,GAAEQ,YACtBA,EAAWC,qBACXA,GACAJ,EAEEK,EAAqBV,EAAkBN,QAC7C,IAAIiB,EAA+B,KAG/BL,EAA6BpF,OAAS,GACtCoF,EAA6B,GAAG9B,OAAOoC,WAEvCD,EAAgBE,EAAaA,cACzBH,EACAJ,EAA6B,GAAG9B,OAAOoC,WAI/C,MAAME,EAAoD,GAgC1D,GA9BAR,EAA6BS,SACzB,CAACxC,EAA6ByC,KAC1B,MAAMC,EAAwBJ,EAAAA,cAC1BH,EACAnC,EAAQG,kBAAkBwC,SAASC,MAGjCC,EAAmBP,EAAAA,cACrBH,EACAnC,EAAQG,kBAAkBwC,SAASG,OAGvCP,EAAqBrB,KAAK,CACtBnD,OAAQiC,EAAQC,OAAOlC,OACvBqE,gBACAW,cAAe,CACXL,wBACAG,mBACAG,UAAWhD,EAAQG,kBAAkB6C,UACrCC,aAAcjD,EAAQG,kBAAkB8C,cAE5CC,UAAWjB,EAAYQ,GACvBrC,SAAUJ,EAAQG,kBAAkBC,SAASF,GAAGpC,EAAAA,GAAG,IAC7C,KACAkC,EAAQG,kBAAkBC,SAChC+C,IAAK,MACP,IAINpB,EAA6BpF,OAAS,GAAKqF,EAC3C,MAAM,IAAI9F,MACN,8DAIR,IAAIyG,EACJ,GAAIZ,EAA6BpF,OAAS,EACtCgG,EAAWZ,EAA6B,GAAG5B,kBAAkBwC,aAC1D,KAAIX,EAGP,MAAM,IAAI9F,MACN,gEAHJyG,EAAWX,CAKd,CAID,MAAMoB,EAAiBT,EAASU,cAAgBV,EAChD,IAAIW,EAAoBF,EAAeR,KAEvC,GAAIQ,EAAeG,WAAaC,EAAQA,SAACC,QAAS,CAC9C,IAAIC,EAAAA,aAAaC,OAEV,MAAM,IAAIzH,MAAM,kCADnBoH,EAAoBF,EAAeN,KAE1C,CAGD,MAAMc,EAA+BC,EAAyBA,0BAC1DP,EACApB,EAAqBvF,QAEnBmH,EAAyD,GAC/DF,EAA6BpB,SAAQ,CAACxC,EAASyC,WAC3C,MAAMsB,EAAkBzB,EAAAA,cAAcH,EAAoBnC,GAC1D8D,EAAsB5C,KAAK,CACvB5D,MAAO4E,EAAqBO,GAAOnF,MACnCS,OAAQmE,EAAqBO,GAAO1E,OACpCqC,UAA8C,QAApC4D,EAAA9B,EAAqBO,GAAOrC,gBAAQ,IAAA4D,OAAA,EAAAA,EAAE9D,GAAGpC,EAAAA,GAAG,KAChD,KACAoE,EAAqBO,GAAOrC,SAClC2D,kBACAZ,IAAK,MACP,IAGN,MAAMc,EAAwB9B,EAAmBjF,KAC5C8C,IAA0B,CACvBkE,OAAQlE,EACRmE,WAAY,EACZC,SAAU,MAIlB,MAAO,CACHC,0BAA2B9B,EAC3B0B,wBACAH,wBAER,CCpJgB,SAAAQ,GACZC,EACAvI,GAEA,IACKuI,EAAwB/E,OAAMQ,GAC3BA,EAAQC,OAAOjE,KAAKC,OAAOD,KAG/B,MAAM,IAAIE,MAAM,mDAGpB,OAAO,CACX,CCWA,MAAMsI,GAAwBC,EAAAA,OAAO,CACjCpG,EAAAA,MAAMqG,EAAEA,KAAI,GAAI,KAChBrG,EAAAA,MAAMqG,EAAEA,KAAI,GAAI,KAChBrG,EAAAA,MAAMqG,EAAEA,KAAI,GAAI,OAGdC,GAAsCF,EAAAA,OAAO,CAC/CG,EAAAA,UAAU,SACVC,EAAAA,IAAI,UACJC,SAAOD,EAAAA,MAAO,YACdH,EAAAA,GAAG,mBACHI,SAAOC,EAAAA,QAAS,SAGdC,GAAkCP,EAAAA,OAAO,CAC3CI,EAAAA,IAAI,UACJC,SAAOJ,EAAAA,KAAM,iBACbD,SACI,CACIC,EAAAA,GAAG,yBACHA,EAAAA,GAAG,oBACHO,EAAAA,IAAI,aACJC,EAAAA,KAAK,iBAET,iBAEJC,EAAAA,IAAI,aACJL,SAAOD,EAAAA,MAAO,YACdC,SAAOC,EAAAA,QAAS,SAGPK,GAA0BX,EAAAA,OAAO,CAC1CG,EAAAA,UAAU,SACVE,SAAOJ,EAAAA,KAAM,gCAGJW,GAAmBZ,EAAAA,OAAO,CACnCS,EAAAA,KAAK,cACLA,EAAAA,KAAK,mBACLR,EAAAA,GAAG,4BAGMY,GAA+Cb,EAAAA,OAAO,CAC/DK,EAAMA,OAACN,GAAuB,SAC9BI,EAAAA,UAAU,QACVE,EAAMA,OAACM,GAAyB,qBAChCG,EAAGA,IAACP,GAAiC,6BACrCO,EAAGA,IAACZ,GAAqC,4BACzCO,EAAAA,KAAK,cACLJ,SAAOD,EAAAA,MAAO,8BACdC,EAAMA,OAACO,GAAkB,cACzBP,SAAOJ,EAAAA,KAAM,0CAGJc,GAAef,EAAAA,OAAO,CAC/Bc,MAAIX,EAAAA,YAAa,cACjBW,MAAIV,EAAAA,MAAO,WACXC,SAAOD,EAAAA,MAAO,cAGLY,GAAsBhB,EAAAA,OAAO,CACtCc,MAAIX,EAAAA,YAAa,WACjBE,EAAAA,OAAOS,EAAAA,IAAIV,EAAAA,MAAO,WAAY,WAC9BC,SAAOD,EAAAA,MAAO,YACdC,SAAOD,EAAAA,MAAO,UACdH,EAAAA,GAAG,SACHA,EAAAA,GAAG,UAGMgB,GAA+CjB,EAAAA,OAAO,CAC/DG,EAAAA,UAAU,SACVE,SAAOD,EAAAA,MAAO,mBACdC,EAAMA,OAACO,GAAkB,gBAGvB,SAAUM,GACZC,GAEA,MAAMC,EAAS1K,EAAO2K,MAAM,KACtBC,EAAMP,GAAaQ,OACrB,CACIC,WAAYL,EAAKK,WACjBC,QAASN,EAAKM,QACd9F,SAAUwF,EAAKxF,UAEnByF,GAGJ,OAAO1K,EAAOgL,OAAO,CACjB,IAAIC,WAAW7K,IACf,IAAI6K,WAAWP,EAAOQ,SAAS,EAAGN,KAE1C,CAUM,SAAUO,GACZV,GAEA,MAAMC,EAAS1K,EAAO2K,MAAM,KACtBC,EAAMN,GAAoBO,OAAOJ,EAAMC,GAEvCU,EAAepL,EAAO2K,MAAM,GAClCS,EAAaC,cAAcT,EAAK,GAEhC,MAAMU,EAAaZ,EAAOQ,SAAS,EAAGN,GACtC,OAAO5K,EAAOgL,OAAO,CACjB,IAAIC,WAAW5K,IACf,IAAI4K,WAAWG,GACf,IAAIH,WAAWK,IAEvB,CAUM,SAAUC,GACZd,GAEA,MAAMC,EAAS1K,EAAO2K,MAAM,KACtBC,EAAML,GAA6CM,OACrD,CACI1I,MAAOsI,EAAKtI,MACZqJ,gBAAiBf,EAAKe,gBACtBC,WAAYhB,EAAKgB,YAErBf,GAGJ,OAAO1K,EAAOgL,OAAO,CACjB,IAAIC,WAAW1K,IACf,IAAI0K,WAAWP,EAAOQ,SAAS,EAAGN,KAE1C,CAcM,SAAUc,GACZjB,GAEA,MAAMC,EAAS1K,EAAO2K,MAAM,KAEtBC,EAAMT,GAA6CU,OACrDJ,EACAC,GAGEU,EAAepL,EAAO2K,MAAM,GAClCS,EAAaC,cAAcT,EAAK,GAEhC,MAAMU,EAAaZ,EAAOQ,SAAS,EAAGN,GAEtC,OAAO5K,EAAOgL,OAAO,CACjB,IAAIC,WAAW3K,IACf,IAAI2K,WAAWG,GACf,IAAIH,WAAWK,IAEvB,CAuDa,MAAAK,GACTlH,IAEA,MAAMmH,SACFA,EAAQtJ,aACRA,EAAYuJ,cACZA,EAAahL,KACbA,EAAIuB,aACJA,EAAY0J,gBACZA,GACArH,EACJ,MAAO,CACH,CAAEsE,OAAQ6C,EAAU3C,SAAU,EAAMD,WAAY,GAChD,CAAED,OAAQzG,EAAc2G,SAAU,EAAOD,WAAY,GACrD,CAAED,OAAQ8C,EAAe5C,SAAU,EAAOD,WAAY,GACtD,CAAED,OAAQlI,EAAMoI,SAAU,EAAOD,WAAY,GAC7C,CAAED,OAAQ3G,EAAc6G,SAAU,EAAOD,WAAY,GACrD,CAAED,OAAQ+C,EAAiB7C,SAAU,EAAOD,WAAY,GAC3D,EAGQ+C,GACTtH,IAEA,MAAMmH,SACFA,EAAQtJ,aACRA,EAAYuJ,cACZA,EAAahL,KACbA,EAAIuB,aACJA,EAAY0J,gBACZA,EAAeE,qBACfA,GACAvH,EACJ,MAAO,CACH,CAAEsE,OAAQ6C,EAAU3C,SAAU,EAAMD,WAAY,GAChD,CAAED,OAAQzG,EAAc2G,SAAU,EAAOD,WAAY,GACrD,CAAED,OAAQiD,EAAsB/C,SAAU,EAAOD,WAAY,GAC7D,CAAED,OAAQ8C,EAAe5C,SAAU,EAAOD,WAAY,GACtD,CAAED,OAAQlI,EAAMoI,SAAU,EAAOD,WAAY,GAC7C,CAAED,OAAQ3G,EAAc6G,SAAU,EAAOD,WAAY,GACrD,CAAED,OAAQ+C,EAAiB7C,SAAU,EAAOD,WAAY,GAC3D,EAGQiD,GACTxH,IAEA,MAAMyH,EAAgBvK,GAAuBwK,WACvCP,SACFA,EAAQQ,UACRA,EAASN,gBACTA,EAAejL,KACfA,EAAIyB,aACJA,EAAYF,aACZA,EAAYiK,mBACZA,EAAkBC,qBAClBA,EAAoBC,YACpBA,EAAWC,4BACXA,EAA2BC,0BAC3BA,EAAyBC,WACzBA,EAAUC,YACVA,EAAWd,cACXA,EAAae,WACbA,GACAnI,EAgCJ,MA9BoC,CAChC,CAAEsE,OAAQ6C,EAAU3C,SAAU,EAAMD,WAAY,GAChD,CAAED,OAAQqD,EAAWnD,SAAU,EAAMD,WAAY,GACjD,CAAED,OAAQ+C,EAAiB7C,SAAU,EAAOD,WAAY,GACxD,CAAED,OAAQlI,EAAMoI,SAAU,EAAOD,WAAY,GAC7C,CAAED,OAAQzG,EAAc2G,SAAU,EAAOD,WAAY,GACrD,CAAED,OAAQ3G,EAAc6G,SAAU,EAAOD,WAAY,GACrD,CAAED,OAAQsD,EAAoBpD,SAAU,EAAOD,WAAY,GAC3D,CAAED,OAAQuD,EAAsBrD,SAAU,EAAOD,WAAY,GAC7D,CAAED,OAAQwD,EAAatD,SAAU,EAAOD,WAAY,GACpD,CACID,OAAQyD,EACRvD,SAAU,EACVD,WAAY,GAEhB,CACID,OAAQ0D,EACRxD,SAAU,EACVD,WAAY,GAEhB,CAAED,OAAQ2D,EAAYzD,SAAU,EAAOD,WAAY,GACnD,CAAED,OAAQ4D,EAAa1D,SAAU,EAAOD,WAAY,GACpD,CAAED,OAAQ8C,EAAe5C,SAAU,EAAOD,WAAY,GACtD,CACID,OAAQ6D,QAAAA,EAAcV,EACtBjD,SAAU,EACVD,WAAY,GAID,EAGV6D,GACTpI,IAEA,MAAMyH,EAAgBvK,GAAuBwK,WACvCP,SACFA,EAAQQ,UACRA,EAASN,gBACTA,EAAeO,mBACfA,EAAkBC,qBAClBA,EAAoBC,YACpBA,EAAWC,4BACXA,EAA2BC,0BAC3BA,EAAyBE,YACzBA,EAAWrK,aACXA,EAAYwK,iCACZA,EAAgC1K,aAChCA,EAAYyJ,cACZA,GACApH,EAsCJ,MApCoC,CAChC,CAAEsE,OAAQ6C,EAAU3C,SAAU,EAAMD,WAAY,GAChD,CAAED,OAAQqD,EAAWnD,SAAU,EAAMD,WAAY,GACjD,CAAED,OAAQ+C,EAAiB7C,SAAU,EAAOD,WAAY,GACxD,CAAED,OAAQsD,EAAoBpD,SAAU,EAAOD,WAAY,GAC3D,CAAED,OAAQuD,EAAsBrD,SAAU,EAAOD,WAAY,GAC7D,CAAED,OAAQwD,EAAatD,SAAU,EAAOD,WAAY,GACpD,CACID,OAAQyD,EACRvD,SAAU,EACVD,WAAY,GAEhB,CACID,OAAQ0D,EACRxD,SAAU,EACVD,WAAY,GAEhB,CAAED,OAAQ4D,EAAa1D,SAAU,EAAOD,WAAY,GACpD,CACID,OAAQzG,QAAAA,EAAgB4J,EACxBjD,SAAU,EACVD,WAAY,GAEhB,CACID,OAAQ+D,QAAAA,EAAoCZ,EAC5CjD,SAAU,EACVD,WAAY,GAEhB,CACID,OAAQ3G,QAAAA,EAAgB8J,EACxBjD,SAAU,EACVD,WAAY,GAEhB,CAAED,OAAQ8C,EAAe5C,SAAU,EAAOD,WAAY,GAGvC,EAGV+D,GACTtI,IAEA,MAAMmH,SACFA,EAAQQ,UACRA,EAASN,gBACTA,EAAeO,mBACfA,EAAkBC,qBAClBA,EAAoBC,YACpBA,EAAWC,4BACXA,EAA2BC,0BAC3BA,EAAyBE,YACzBA,EAAWd,cACXA,GACApH,EAEJ,MAAO,CACH,CAAEsE,OAAQ6C,EAAU3C,SAAU,EAAMD,WAAY,GAChD,CAAED,OAAQqD,EAAWnD,SAAU,EAAMD,WAAY,GACjD,CAAED,OAAQ+C,EAAiB7C,SAAU,EAAOD,WAAY,GACxD,CAAED,OAAQsD,EAAoBpD,SAAU,EAAOD,WAAY,GAC3D,CAAED,OAAQuD,EAAsBrD,SAAU,EAAOD,WAAY,GAC7D,CAAED,OAAQwD,EAAatD,SAAU,EAAOD,WAAY,GACpD,CACID,OAAQyD,EACRvD,SAAU,EACVD,WAAY,GAEhB,CACID,OAAQ0D,EACRxD,SAAU,EACVD,WAAY,GAEhB,CAAED,OAAQ4D,EAAa1D,SAAU,EAAOD,WAAY,GACpD,CAAED,OAAQ8C,EAAe5C,SAAU,EAAOD,WAAY,GACzD,EAGQgE,GAAuBD,GAEvBE,GACTxI,IAEA,MAAMmH,SACFA,EAAQQ,UACRA,EAASN,gBACTA,EAAeO,mBACfA,EAAkBC,qBAClBA,EAAoBC,YACpBA,EAAWC,4BACXA,EAA2BC,0BAC3BA,EAAyBE,YACzBA,EAAWd,cACXA,EAAahL,KACbA,GACA4D,EAEJ,MAAO,CACH,CAAEsE,OAAQ6C,EAAU3C,SAAU,EAAMD,WAAY,GAChD,CAAED,OAAQqD,EAAWnD,SAAU,EAAMD,WAAY,GACjD,CAAED,OAAQ+C,EAAiB7C,SAAU,EAAOD,WAAY,GACxD,CAAED,OAAQsD,EAAoBpD,SAAU,EAAOD,WAAY,GAC3D,CAAED,OAAQuD,EAAsBrD,SAAU,EAAOD,WAAY,GAC7D,CAAED,OAAQwD,EAAatD,SAAU,EAAOD,WAAY,GACpD,CACID,OAAQyD,EACRvD,SAAU,EACVD,WAAY,GAEhB,CACID,OAAQ0D,EACRxD,SAAU,EACVD,WAAY,GAEhB,CAAED,OAAQ4D,EAAa1D,SAAU,EAAOD,WAAY,GACpD,CAAED,OAAQ8C,EAAe5C,SAAU,EAAOD,WAAY,GACtD,CAAED,OAAQlI,EAAMoI,SAAU,EAAOD,WAAY,GAChD,EAGQkE,GAAqBD,GAErBE,GAA8C7D,EAAAA,OAAO,CAC9DA,EAAMA,OACF,CAACpG,EAAAA,MAAMqG,EAAEA,KAAI,GAAI,KAAMrG,EAAAA,MAAMqG,EAAEA,KAAI,GAAI,KAAMrG,EAAAA,MAAMqG,EAAEA,KAAI,GAAI,MAC7D,SAEJE,EAAAA,UAAU,QACVW,EAAGA,IAACP,GAAiC,6BACrCF,EAAMA,OAACO,GAAkB,cACzBT,EAAAA,UAAU,YACVC,EAAAA,IAAI,mBACJH,EAAAA,GAAG,2BACHA,EAAAA,GAAG,gCACHI,SAAOD,EAAAA,MAAO,sBAGL0D,GAA6C9D,EAAAA,OAAO,CAC7DA,EAAMA,OACF,CAACpG,EAAAA,MAAMqG,EAAEA,KAAI,GAAI,KAAMrG,EAAAA,MAAMqG,EAAEA,KAAI,GAAI,KAAMrG,EAAAA,MAAMqG,EAAEA,KAAI,GAAI,MAC7D,SAEJE,EAAAA,UAAU,QACVW,EAAGA,IAACP,GAAiC,6BACrCF,EAAMA,OAACO,GAAkB,cACzBX,EAAAA,GAAG,kCAID8D,GAA4B,CAC9BlJ,EAAG,IAAI5C,MAAM,IAAI+L,KAAK,GACtBlJ,EAAG,IAAI7C,MAAM,IAAI+L,KAAK,GACtBC,EAAG,IAAIhM,MAAM,IAAI+L,KAAK,IAG1B,SAASE,GAAaC,GAClB,OACIA,EAAMtJ,EAAEE,OAAMF,GAAW,IAANA,KACnBsJ,EAAMrJ,EAAEC,OAAMD,GAAW,IAANA,KACnBqJ,EAAMF,EAAElJ,OAAMkJ,GAAW,IAANA,GAE3B,CAEM,SAAUG,GACZjD,SAEA,MAAMC,EAAS1K,EAAO2K,MAAM,KAEtBgD,EAAwB,QAAV9E,EAAA4B,EAAKgD,aAAK,IAAA5E,EAAAA,EAAIwE,GAE5BzC,EAAMuC,GAA4CtC,OAE7C+C,OAAAC,OAAAD,OAAAC,OAAA,CAAA,EAAApD,GACH,CAAAgD,MAAOE,IAEXjD,GAGEU,EAAepL,EAAO2K,MAAM,GAClCS,EAAaC,cAAcT,EAAK,GAEhC,MAAMU,EAAaZ,EAAOQ,SAAS,EAAGN,GAEtC,OAAO5K,EAAOgL,OAAO,CACjB,IAAIC,WAAWzK,IACf,IAAIyK,WAAWG,GACf,IAAIH,WAAWK,IAEvB,CAcM,SAAUwC,GACZrD,SAEA,MAAMC,EAAS1K,EAAO2K,MAAM,KAEtBgD,EAAwB,QAAV9E,EAAA4B,EAAKgD,aAAK,IAAA5E,EAAAA,EAAIwE,GAE5BzC,EAAMwC,GAA2CvC,OAE5C+C,OAAAC,OAAAD,OAAAC,OAAA,CAAA,EAAApD,GACH,CAAAgD,MAAOE,IAEXjD,GAGEU,EAAepL,EAAO2K,MAAM,GAClCS,EAAaC,cAAcT,EAAK,GAEhC,MAAMU,EAAaZ,EAAOQ,SAAS,EAAGN,GAEtC,OAAO5K,EAAOgL,OAAO,CACjB,IAAIC,WAAWxK,IACf,IAAIwK,WAAWG,GACf,IAAIH,WAAWK,IAEvB,CC1Ka,MAAAyC,GAAoBtJ,GACtBA,EAASkB,QACZ,CAACC,EAAKf,IAAgCe,EAAIC,IAAIhB,EAAQC,OAAOlC,SAC7DD,EAAAA,GAAG,IAOEqL,GAA0BvJ,IACnC,MAAMtC,EAAQsC,EAAS,GAAGK,OAAO3C,MACjCsC,EAAS4C,SAAQzB,IACb,IAAKA,EAAId,OAAO3C,MAAMrB,OAAOqB,GACzB,MAAM,IAAIpB,MAAM,iDACnB,GACH,EAMOkN,GACT7E,IAMO,CAAEvI,KAJIuI,EAAwB,GAAGtE,OAAOjE,KAIhCqN,aAHM9E,EAAwB,GAAGtE,OAAO3C,MAG1B+E,SAFZkC,EAAwB,GAAGtE,OAAOoC,WAK1CiH,GAA8B,CACvCC,EACAC,KAEA,GAAID,EAAO5M,OAAS,EAChB,MAAM,IAAIT,MAAM,iDAEpB,MAAMoB,EAAQiM,EAAO,GAAGtJ,OAAO3C,MAEzBmM,EAAyBF,EAAOG,WAAUpK,GAAKA,EAAEW,OAAOoC,WAG9D,IAAgC,IAA5BoH,EACA,MAAO,CAAEE,kBAAmB,KAAMpC,UAAWjK,GAEjD,MAAM+E,EAAWkH,EAAOE,GAAwBxJ,OAAOoC,SAGvD,MAAO,CACHsH,kBAAmB,CACfrM,QACAsM,2BAL2BJ,EAAQ7M,QAAU,EAAI,KAAO,GAO5D4K,UAAWlF,EACd,WAWWwH,GACZ9H,EACA+H,EACA/L,GAEAA,EAASD,EAAAA,GAAGC,GACZ,MAAMgM,EAAcb,GAAiBnH,GAC/BiI,EAAgBC,EAAaA,cAC/BlI,EAA6B7E,KAAI6D,GAAOA,EAAIZ,qBAG1C+J,EAAeH,EAAYI,IAAIpM,GAIrC,OAFAqM,EAAyBA,0BAACF,GAEtBA,EAAahK,GAAGpC,EAAEA,GAAC,KAAOkM,EAAc9J,GAAGpC,EAAAA,GAAG,IACvC,CACH,CACIR,MAAOwM,EACP/L,SACAqC,SAAU4J,EACV7G,IAAK,QAMjBkH,EAAiBA,kBACbtI,EAA6B7E,KAAI6D,GAAOA,EAAIZ,qBAEhDgJ,GAAuBpH,GAEqC,CACxD,CACIzE,MAAOyE,EAA6B,GAAG9B,OAAO3C,MAC9CS,OAAQmM,EACR9J,SAAU4J,EACV7G,IAAK,MAET,CACI7F,MAAOwM,EACP/L,SACAqC,SAAUtC,EAAEA,GAAC,GACbqF,IAAK,OAIjB,CASgB,SAAAmH,GACZvI,EACAhE,GAEAA,EAASD,EAAAA,GAAGC,GACZ,MAAMiM,EAAgBC,EAAaA,cAC/BlI,EAA6B7E,KAAI6D,GAAOA,EAAIZ,qBAG1C+J,EADchB,GAAiBnH,GACJoI,IAAIpM,GAKrC,OAHAqM,EAAyBA,0BAACF,GAGtBA,EAAahK,GAAGpC,EAAEA,GAAC,KAAOkM,EAAc9J,GAAGpC,EAAAA,GAAG,IACvC,IAGXuM,EAAiBA,kBACbtI,EAA6B7E,KAAI6D,GAAOA,EAAIZ,qBAEhDgJ,GAAuBpH,GAEiC,CACpD,CACIzE,MAAOyE,EAA6B,GAAG9B,OAAO3C,MAC9CS,OAAQmM,EACR9J,SAAU4J,EACV7G,IAAK,OAIjB,OAEarG,GAIT,WAAAyN,GAAgB,CAehB,mBAAOC,CAAalD,GAChBmD,KAAKnD,UACoB,iBAAdA,EACD,IAAIoD,EAAAA,UAAUpD,GACdA,CACb,CAUD,yBAAOqD,CAAmB3O,GACtB,MAAM4O,EAAQ,CAAC1P,GAAWc,EAAK6O,aACxBnN,EAASd,GAAK8N,EAAAA,UAAUI,uBAC3BF,EACAH,KAAKnD,WAET,OAAO5J,CACV,CAUD,gCAAOqN,CACHC,EACAhP,GAEA,IAAK,IAAIyG,EAAQ,EAAGA,EAAQ,EAAGA,IAAS,CACpC,MAAMwI,EACFnO,GAAuBC,4BAA4Bf,EAAMyG,GAC7D,GAAIwI,EAAW,GAAGhP,OAAO+O,GACrB,MAAO,CAACvI,EAAOwI,EAAW,GAEjC,CACD,MAAM,IAAI/O,MAAM,uBACnB,CAWD,kCAAOa,CACHf,EACAyG,GAEA,IAAImI,EAAkB,GAElBA,EADU,IAAVnI,EACQ,CAACtH,EAAOC,KAAK,QAASY,EAAK6O,WAAY1P,EAAOC,KAAK,KAEnD,CACJD,EAAOC,KAAK,QACZY,EAAK6O,WACL1P,EAAOC,KAAK,CAACqH,KAGrB,MAAO/E,EAASQ,GAAQwM,EAAAA,UAAUI,uBAC9BF,EACAH,KAAKnD,WAET,MAAO,CAAC5J,EAASQ,EACpB,CAGD,gCAAWgN,GACP,MAAOxN,EAASd,GAAK8N,EAASA,UAACI,uBAC3B,CAACzP,IACDoP,KAAKnD,WAET,OAAO5J,CACV,CAoBD,uBAAayN,EAAWpE,SACpBA,EAAQ/K,KACRA,EAAIuL,UACJA,EAAS6D,gBACTA,EAAeC,SACfA,EAAQC,kBACRA,EAAiBC,eACjBA,EAAcC,SACdA,IAEA,MAAMjO,EAAegO,QAAAA,EAAkBE,mBAyBvC,MAAO,CAtB8BC,EAAaA,cAACC,cAAc,CAC7DC,WAAY7E,EACZ3G,SAAUkL,EACVO,iBAAkB7P,EAClBsL,UAAW/J,EACXuO,MAAON,QAAAA,EAAYO,EAASA,YAGEC,EAAAA,iCAC9BhQ,EACAqP,EACA9D,EACA6D,EACA7N,SAGqCkN,KAAKwB,gBAAgB,CAC1DlF,WACA/K,OACAuP,eAAgBhO,IAQvB,CAaD,4BAAa0O,EAAgBlF,SACzBA,EAAQ/K,KACRA,EAAIuP,eACJA,IAEA,MAAMhO,EAAegO,QAAAA,EAAkBE,mBAEjChO,EAAegN,KAAK1N,4BAA4Bf,EAAM,GAEtDkQ,EAAOpF,GAA8B,CACvC9K,OACA+K,WACAtJ,aAAcA,EAAa,GAC3BF,eACA0J,gBAAiBwD,KAAKS,sBACtBlE,cAAe0E,EAAaA,cAACpE,YAGjC,OAAO,IAAI6E,EAAAA,uBAAuB,CAC9B7E,UAAWmD,KAAKnD,UAChB4E,OACAtG,KAAMtK,IAEb,CAcD,yBAAa8Q,EAAarF,SACtBA,EAAQ/K,KACRA,EAAIiC,UACJA,EAASsN,eACTA,IAEA,GAAItN,GAAa,EACb,MAAM,IAAI/B,MACN,0EAGR,GAAI+B,EAAY,EACZ,MAAM,IAAI/B,MACN,qBAAqB+B,4BAI7B,MAAMV,EAAegO,QAAAA,EAAkBE,mBAEjCtE,EAAuBsD,KAAK1N,4BAC9Bf,EACAiC,EAAY,GAEVR,EAAegN,KAAK1N,4BAA4Bf,EAAMiC,GAEtDiO,EAAOhF,GAA2B,CACpClL,OACA+K,WACAtJ,aAAcA,EAAa,GAC3B0J,qBAAsBA,EAAqB,GAC3C5J,eACA0J,gBAAiBwD,KAAKS,sBACtBlE,cAAe0E,EAAaA,cAACpE,YAGjC,OAAO,IAAI6E,EAAAA,uBAAuB,CAC9B7E,UAAWmD,KAAKnD,UAChB4E,OACAtG,KAAMzK,EAAOgL,OAAO,CAChB,IAAIC,WAAWvK,IACf,IAAIuK,WAAWjL,EAAOC,KAAK,CAAC6C,QAGvC,CAeD,mBAAaoO,EAAOtF,SAChBA,EAAQ/K,KACRA,EAAIuL,UACJA,EAAS+E,SACTA,EAAQvO,OACRA,EAAMiE,oBACNA,EAAmBjG,cACnBA,IAEA,MAAMwQ,EAAaC,EAAAA,8BACbjP,EAAexB,EAAcwB,aACnCzB,GAAmBC,EAAeC,GAElC,MAAMkK,EAAUuG,EAAOA,QAAc1O,GAAQb,KAAIa,GAAUD,EAAAA,GAAGC,KACxD2O,EAAYD,UAAQH,GAE1B,GAAIpG,EAAQvJ,SAAW+P,EAAU/P,OAC7B,MAAM,IAAIT,MACN,wDAIR,MAAMgQ,EAAO9E,GAAqB,CAC9BpL,OACA+K,WACAQ,YACAN,gBAAiBwD,KAAKS,sBACtB3N,eACAE,aAAc1B,EAAc0B,aAC5B+J,mBAAoBmF,EAAkBA,mBAACrF,UACvCG,qBAAsB8E,EAAW9E,qBACjCC,YAAa6E,EAAW7E,YACxBC,4BAA6B4E,EAAW5E,4BACxCC,0BAA2B2E,EAAW3E,0BACtCC,WACI7F,EAAoBuB,WAAaC,EAAAA,SAASC,QACpCzB,EAAoBc,MACpBd,EAAoBY,KAC9BkF,YAAa2C,KAAKnD,UAClBN,cAAe0E,EAAaA,cAACpE,UAC7BS,WAAY,OAGVnC,EAAOD,GAA4B,CACrCM,WAAYyG,EACZxG,UACA9F,SAAU,OAGd,OAAO,IAAI+L,EAAAA,uBAAuB,CAC9B7E,UAAWmD,KAAKnD,UAChB4E,OACAtG,QAEP,CAiBD,6BAAagH,EAAiB7F,SAC1BA,EAAQ/K,KACRA,EAAIuL,UACJA,EAASsF,sBACTA,EAAqBP,SACrBA,EAAQvO,OACRA,EAAMiE,oBACNA,EAAmBjG,cACnBA,IAEA,MAAM+Q,EAAuBC,OAAOhP,EAAOC,YAwB3C,MAAO,CArBsBgP,0BACzBhR,EACA6Q,EACAtF,EACAuF,EACA,GACA/Q,EAAcwB,oBAIgBkN,KAAKwC,SAAS,CAC5CC,MAAOnG,EACPzJ,MAAOiK,EACP4F,OAAQN,EACR/C,UAAWwC,EACXtQ,OACA+B,SACAiE,sBACAjG,kBAIP,CAcD,qBAAaqR,EAASF,MAClBA,EAAKnL,6BACLA,EAA4B+H,UAC5BA,EAAS/L,OACTA,EAAMsP,oBACNA,EAAmBC,4BACnBA,IAEA,MAAMpL,EACF2H,GACI9H,EACA+H,EACA/L,IAGFsG,0BACFA,EAAyBP,sBACzBA,EAAqBG,sBACrBA,GACApC,GAA4B,CAC5BE,+BACAE,YAAaqL,EACbpL,0BAGElG,KAAEA,GAASoN,GAAerH,IAE1B4H,kBAAEA,EAAiBpC,UAAEA,GAAc+B,GACrCvH,EACAG,GAcE0D,EAAOiB,GAX2C,CACpD+B,MAAOyE,EACPrR,OACA2N,oBACAtF,4BACAkJ,yBAA0BzJ,EAC1B0J,2BAA4B,KAC5BC,WAAY,EACZ7G,WAAY,KACZ8G,qCAAsC,QAIpC/F,4BACFA,EAA2BD,YAC3BA,EAAWD,qBACXA,EAAoBG,0BACpBA,GACA4E,EAAAA,8BACEN,EAAOlE,GAAuB,CAChCjB,SAAUmG,EACV3F,YACAN,gBAAiBwD,KAAKS,sBACtB1D,mBAAoBmF,EAAkBA,mBAACrF,UACvCG,qBAAsBA,EACtBC,YAAaA,EACbC,4BAA6BA,EAC7BC,0BAA2BA,EAC3BE,YAAa2C,KAAKnD,UAClB7J,kBAAcG,EACdqK,sCAAkCrK,EAClCL,kBAAcK,EACdoJ,cAAe0E,EAAaA,cAACpE,YAKjC,OAFA4E,EAAKhL,QAAQ+C,GAEN,IAAIkI,EAAAA,uBAAuB,CAC9B7E,UAAWmD,KAAKnD,UAChB4E,OACAtG,QAEP,CAcD,0CAAa+H,EAA8BT,MACvCA,EAAK3F,UACLA,EAASqG,MACTA,EAAKC,WACLA,EAAUpM,kBACVA,IAEA,MAAOqM,EAAmBC,GACtBC,EAAAA,0BAA0BC,kBAAkB,CACxC1G,YACA2F,MAAO3F,EACPsG,eAGR,IAAIK,EAAgC,GAChCN,IACAM,EAAmB,IACZN,KACAA,EAAM1Q,KAAIlB,GAAQyO,KAAKE,mBAAmB3O,OAIrD,MA0BMmS,EAAe,CAACL,EA1BIE,EAAyBA,0BAACI,kBAAkB,CAClElB,QACA3F,YACA8G,YAAaN,EACbO,UAAW,CACP5C,EAAAA,cAAcpE,UACdiH,EAAAA,qBAAqBjH,UACrBmD,KAAKS,sBACLyB,EAAAA,mBAAmBrF,UACnBxK,GAAuBwK,UACvBkF,EAAAA,8BAA8B/E,qBAC9B+E,EAAAA,8BAA8B9E,YAC9B8E,EAAAA,8BAA8B7E,4BAC9B6E,EAAAA,8BAA8B5E,0BAC9B4G,EAAAA,+BAA+B3G,WAC/B2G,EAAAA,+BAA+BC,eAC/BD,EAAAA,+BAA+BE,YAC/BF,EAAAA,+BAA+BG,aAC/BlE,KAAKnD,UACLmE,EAAgBA,iBAChBmD,EAAqBA,sBACrBrH,KACG2G,MAMX,GAAIzM,GAAqBA,EAAkB9E,OAAS,EAChD,IAAK,IAAIE,EAAI,EAAGA,EAAI4E,EAAkB9E,OAAQE,GAAK,GAAI,CACnD,MAAMgS,EAAQpN,EAAkBN,MAAMtE,EAAGA,EAAI,IACvCiS,EAAWd,EAAyBA,0BAACI,kBAAkB,CACzDlB,QACA3F,YACA8G,YAAaN,EACbO,UAAWO,IAEfV,EAAajN,KAAK4N,EACrB,CAGL,MAAO,CACHX,eACAzQ,QAASqQ,EAEhB,CAgBD,qBAAad,EAASC,MAClBA,EAAK5P,MACLA,EAAK6P,OACLA,EAAMrD,UACNA,EAAS/L,OACTA,EAAM/B,KACNA,EAAIgG,oBACJA,EAAmBjG,cACnBA,IAEA,IAAImG,EAEJ,MAAM6M,EAActC,UAAqB1O,GACnCiR,EAAiBvC,UAAQ3C,GAI/B,GAFAhO,GAAmBC,EAAeC,GAE9B+S,EAAYpS,SAAWqS,EAAerS,OACtC,MAAM,IAAIT,MACN,yDAGR,GAAIwH,EAAAA,aAAaC,OAAQ,CACrB,MAAOlB,EAAOvE,GAAQuM,KAAKM,0BACvBhP,EAAc0B,aACdzB,GAcE4J,EAAOU,GAZiC,CAC1C2I,QAASD,EACT9I,QACI6I,EAAYpS,OAAS,EACfoS,EAAY7R,KAAIgS,GAAOpR,EAAEA,GAACoR,KAC1B,KACV9O,SAAU,KACVrC,OAA+B,IAAvBgR,EAAYpS,OAAemB,EAAEA,GAACiR,EAAY,IAAM,KACxDtM,QACAvE,SAIEgO,EAAO9E,GAAoB2B,OAAAC,OAAAD,OAAAC,OAAA,CAC7BhN,OACA+K,SAAUmG,EACV3F,UAAWjK,EACX2J,gBAAiBwD,KAAKS,sBACtB3N,aAAcxB,EAAcwB,aAC5BE,aAAc1B,EAAc0B,aAC5B+J,mBAAoBmF,EAAkBA,mBAACrF,WACpCkF,EAA2BA,+BAAE,CAChC3E,WAAY7F,EAAoBc,MAChCgF,YAAa2C,KAAKnD,UAClBN,cAAe0E,EAAAA,cAAcpE,UAC7BS,WAAY,QAQhB,OANAmE,EAAKhL,KAAK,CACNgD,OAAQiJ,EACRhJ,WAAY,EACZC,SAAU,IAGP,IAAI+H,EAAAA,uBAAuB,CAC9B7E,UAAWmD,KAAKnD,UAChB4E,OACAtG,QAEP,CAAM,CACH1D,EAAuB6M,EAAY7R,KAAI,CAACgS,EAAKzM,KACzC,MAAM0M,EAAWrR,KAAGoR,GACpB,MAAO,CACH5R,MAAO0R,EAAevM,GACtB1E,OAAQoR,EACR/O,SAAU,KACV+C,IAAK,KACR,IAGL,MAAMkB,0BACFA,EAAyBP,sBACzBA,EAAqBG,sBACrBA,GACApC,GAA4B,CAC5BE,6BAA8B,GAC9BC,sBACAC,YAAa,GACbC,yBAkBE0D,EAAOiB,GAf2C,CACpD+B,MAAO,KACP5M,OACA2N,kBAAmB,KACnBtF,4BACAkJ,yBAA0BzJ,EAC1B0J,2BAA4B9Q,MAAM0S,QAAQrR,GACpCA,EACKb,KAAIgS,GAAOpR,KAAGoR,KACdpO,QAAO,CAACuO,EAAKH,IAAQG,EAAIrO,IAAIkO,IAAMpR,KAAG,IAC3CA,EAAAA,GAAGC,GACT0P,WAAY,EACZ7G,WAAY,KACZ8G,qCAAsC,OAGpCxB,EAAOlE,GACNe,OAAAC,OAAAD,OAAAC,OAAA,GAAAwD,EAAAA,+BACH,CAAAzF,SAAUmG,EACV3F,UAAWjK,EACX2J,gBAAiBwD,KAAKS,sBACtB1D,mBAAoBmF,EAAAA,mBAAmBrF,UACvCQ,YAAa2C,KAAKnD,UAClBN,cAAe0E,EAAaA,cAACpE,UAC7B7J,aAAc1B,EAAc0B,aAC5BwK,iCAAkCkF,EAClC5P,aAAcxB,EAAcwB,gBAIhC,OAFA2O,EAAKhL,QAAQ+C,GAEN,IAAIkI,EAAAA,uBAAuB,CAC9B7E,UAAWmD,KAAKnD,UAChB4E,OACAtG,QAEP,CACJ,CAgBD,uBAAa0J,EAAWpC,MACpBA,EAAKnL,6BACLA,EAA4B+H,UAC5BA,EAAS/L,OACTA,EAAMsP,oBACNA,EAAmBC,4BACnBA,EAA2BiC,eAC3BA,IAEA,MAAMJ,EAAWrR,KAAGC,GACdyR,EAAsB/C,UAAQ8C,GAE9BrN,EAAuBoI,GACzBvI,EACAoN,IAIE9K,0BACFA,EAAyBP,sBACzBA,EAAqBG,sBACrBA,GACApC,GAA4B,CAC5BE,+BACAE,YAAaqL,EACbpL,qBAAsBA,EACtBT,kBAAmB+N,EACdrO,MAAM,GACNjE,KAAI4B,GAAQA,EAAKrB,kBAGpBzB,KAAEA,GAASoN,GAAerH,IAC1B4H,kBAAEA,EAAiBpC,UAAEA,GAAc+B,GACrCvH,EACAG,GAcE0D,EAAOiB,GAX2C,CACpD+B,MAAOyE,EACPrR,OACA2N,oBACAtF,4BACAkJ,yBAA0BzJ,EAC1B0J,2BAA4B2B,EAC5B1B,WAAY,EACZ7G,WAAY,KACZ8G,qCAAsC,OAGpCnQ,EAAeiS,EAAoB,GAAGjS,cAEtCoK,4BACFA,EAA2BD,YAC3BA,EAAWD,qBACXA,EAAoBG,0BACpBA,GACA4E,EAAAA,8BAEEN,EAAOlE,GAAuB,CAChCjB,SAAUmG,EACV3F,UAAWA,EACXN,gBAAiBwD,KAAKS,sBACtB1D,mBAAoBmF,EAAkBA,mBAACrF,UACvCG,qBAAsBA,EACtBC,YAAaA,EACbC,4BAA6BA,EAC7BC,0BAA2BA,EAC3BE,YAAa2C,KAAKnD,UAClB7J,aAAc+R,EAAoB,GAAG/R,aACrCwK,iCAAkC6B,EAClCvM,eACAyJ,cAAe0E,EAAaA,cAACpE,YAIjC,OAFA4E,EAAKhL,QAAQ+C,GAEN,IAAIkI,EAAAA,uBAAuB,CAC9B7E,UAAWmD,KAAKnD,UAChB4E,OACAtG,QAEP,CAeD,+BAAa6J,EAAmBvC,MAC5BA,EAAK5P,MACLA,EAAKyE,6BACLA,EAA4B/F,KAC5BA,EAAIqR,oBACJA,EAAmBC,4BACnBA,IAEA,GAAIvL,EAA6BpF,OAAS,EACtC,MAAM,IAAIT,MAAM,mDAiBpB,OAdAoI,GAAUvC,EAA8B/F,GAcjC,OAZUyO,KAAK2C,SAAS,CAC3BF,QACAnL,+BACA+H,UAAWxM,EACXS,OAAQgE,EAA6BjB,QACjC,CAACuO,EAAKrP,IAAYqP,EAAIrO,IAAIhB,EAAQC,OAAOlC,SACzCD,EAAEA,GAAC,IAEPwP,8BACAD,wBAIP,CAeD,oCAAaqC,EAAwB3I,SACjCA,EAAQQ,UACRA,EAASoI,aACTA,EAAY3T,KACZA,EAAI2K,gBACJA,EAAe3E,oBACfA,EAAmBjG,cACnBA,IAEAD,GAAmBC,EAAeC,GAClC,MAAMiI,EAAuC,CACzC,CACIC,OACIlC,EAAoBuB,WAAaC,EAAAA,SAASC,QACpCzB,EAAoBc,MACpBd,EAAoBY,KAC9BwB,SAAU,EACVD,WAAY,IAIdyB,EAAOc,GAA6C,CACtDpJ,MAAOiK,EACPZ,gBAAiBA,QAAAA,EAAmB,KACpCC,WAAY,QAEVe,4BACFA,EAA2BD,YAC3BA,EAAWD,qBACXA,EAAoBG,0BACpBA,GACA4E,EAAAA,8BAEEN,EAAOlE,GAAuB,CAChCjB,WACAQ,YACAN,gBAAiBwD,KAAKS,sBACtB1D,mBAAoBmF,EAAkBA,mBAACrF,UACvCG,qBAAsBA,EACtBC,YAAaA,EACbC,4BAA6BA,EAC7BC,0BAA2BA,EAC3BE,YAAa2C,KAAKnD,UAClB7J,aAAc1B,EAAc0B,aAC5BwK,iCAAkC0H,EAClCpS,aAAcxB,EAAcwB,aAC5ByJ,cAAe0E,EAAaA,cAACpE,YAKjC,OAFA4E,EAAKhL,QAAQ+C,GAEN,IAAIkI,EAAAA,uBAAuB,CAC9B7E,UAAWmD,KAAKnD,UAChB4E,OACAtG,QAEP,CAUD,6BAAagK,CACT5T,EACA6T,SAEA,OAAgD,QAAzC7L,QAAO6L,EAAWC,eAAe9T,UAAQ,IAAAgI,OAAA,EAAAA,EAAA1G,KACnD,CAcD,oBAAayS,EAAQ7C,MACjBA,EAAKnL,6BACLA,EAA4B+H,UAC5BA,EAAS/L,OACTA,EAAMsP,oBACNA,EAAmBC,4BACnBA,IAEA,MAAMjJ,0BAAEA,EAAyBJ,sBAAEA,GAC/BpC,GAA4B,CACxBE,+BACAE,YAAaqL,EACbpL,qBAAsB,MAGxBlG,KAAEA,EAAIqN,aAAEA,GAAiBD,GAC3BrH,GAGEiO,EACFjO,EAA6B,GAAG5B,kBAAkBwC,SAC7CY,WAAaC,EAAQA,SAACC,QACrB,EACA,EAcJmC,EAAOiD,GAZ0C,CACnDD,MAAOyE,EACPrR,OACAqI,4BACAuC,WAAY,KACZvE,SAAUyH,EACVmG,gBAAiBnS,EAAEA,GAACC,GACpBmS,wBAAyBF,EACzBG,6BAA8BH,EAC9BI,iBAAkB,QAKhBzI,4BACFA,EAA2BD,YAC3BA,EAAWD,qBACXA,EAAoBG,0BACpBA,GACA4E,EAAAA,8BAEEN,EAAOhE,GAAsB,CAC/BnB,SAAUmG,EACV3F,UAAW8B,EACXpC,gBAAiBwD,KAAKS,sBACtB1D,mBAAoBmF,EAAkBA,mBAACrF,UACvCG,qBAAsBA,EACtBC,YAAaA,EACbC,4BAA6BA,EAC7BC,0BAA2BA,EAC3BE,YAAa2C,KAAKnD,UAClBN,cAAe0E,EAAaA,cAACpE,YAKjC,OAFA4E,EAAKhL,QAAQ+C,GAEN,IAAIkI,EAAAA,uBAAuB,CAC9B7E,UAAWmD,KAAKnD,UAChB4E,OACAtG,QAEP,CAYD,mBAAayK,EAAOnD,MAChBA,EAAKnL,6BACLA,EAA4BsL,oBAC5BA,EAAmBC,4BACnBA,IAEAnE,GAAuBpH,GAEvB,MAAMsC,0BAAEA,EAAyBJ,sBAAEA,GAC/BpC,GAA4B,CACxBE,+BACAE,YAAaqL,EACbpL,qBAAsB,MAGxBlG,KAAEA,EAAIqN,aAAEA,GAAiBD,GAC3BrH,GAcE6D,EAAOqD,GAXyC,CAClDL,MAAOyE,EACPrR,OACAqI,4BACAuC,WAAY,KACZ0J,6BACIvO,EAA6B,GAAG5B,kBAAkBwC,SAC7CY,WAAaC,EAAQA,SAACC,QACrB,EACA,KAIRkE,4BACFA,EAA2BD,YAC3BA,EAAWD,qBACXA,EAAoBG,0BACpBA,GACA4E,EAAAA,8BACEN,EAAO/D,GAAqB,CAC9BpB,SAAUmG,EACV3F,UAAW8B,EACXpC,gBAAiBwD,KAAKS,sBACtB1D,mBAAoBmF,EAAkBA,mBAACrF,UACvCG,qBAAsBA,EACtBC,YAAaA,EACbC,4BAA6BA,EAC7BC,0BAA2BA,EAC3BE,YAAa2C,KAAKnD,UAClBN,cAAe0E,EAAaA,cAACpE,YAKjC,OAFA4E,EAAKhL,QAAQ+C,GAEN,IAAIkI,EAAAA,uBAAuB,CAC9B7E,UAAWmD,KAAKnD,UAChB4E,OACAtG,QAEP,EAzhCM9I,GAAAwK,UAAuB,IAAIoD,EAASA,UACvC,klBCusCiC,CACrC6F,QAAS,QACTC,KAAM,yBACNrC,aAAc,CACV,CACIqC,KAAM,kBACNC,KAAM,CACF,yEACA,qEACA,qEACA,8BAEJ7Q,SAAU,CACN,CACI4Q,KAAM,WACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CAAC,+BAEX,CACID,KAAM,eACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,gBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,OACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,eACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,kBACNE,MAAO,EACPtM,SAAU,IAGlBuM,KAAM,IAEV,CACIH,KAAM,eACNC,KAAM,CACF,sEACA,oDAEJ7Q,SAAU,CACN,CACI4Q,KAAM,WACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CAAC,+BAEX,CACID,KAAM,eACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,uBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,gBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,OACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,eACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,kBACNE,MAAO,EACPtM,SAAU,IAGlBuM,KAAM,CACF,CACIH,KAAM,iBACNI,KAAM,QAIlB,CACIJ,KAAM,SACNC,KAAM,CACF,wEACA,0EACA,2EACA,2EACA,2EACA,yEACA,kDAEJ7Q,SAAU,CACN,CACI4Q,KAAM,WACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CAAC,+BAEX,CACID,KAAM,YACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,kBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,OACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,eACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,eACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,qBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,uBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,cACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CAAC,aAEX,CACID,KAAM,8BACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,4BACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,aACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,cACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,gBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,aACNE,MAAO,EACPtM,SAAU,EACVyM,WAAY,IAGpBF,KAAM,CACF,CACIH,KAAM,aACNI,KAAM,CACFrL,IAAK,cAGb,CACIiL,KAAM,UACNI,KAAM,CACFrL,IAAK,QAGb,CACIiL,KAAM,WACNI,KAAM,CACF9L,OAAQ,UAKxB,CACI0L,KAAM,0BACNC,KAAM,CACF,2EACA,0EACA,2EAEJ7Q,SAAU,CACN,CACI4Q,KAAM,WACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CAAC,+BAEX,CACID,KAAM,YACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CACF,oEACA,sEACA,oBAGR,CACID,KAAM,kBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,qBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,uBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,cACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,8BACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,4BACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,cACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CAAC,2CAEX,CACID,KAAM,eACNE,MAAO,EACPtM,SAAU,EACVyM,WAAY,GAEhB,CACIL,KAAM,mCACNE,MAAO,EACPtM,SAAU,EACVyM,WAAY,GAEhB,CACIL,KAAM,eACNE,MAAO,EACPtM,SAAU,EACVyM,WAAY,GAEhB,CACIL,KAAM,gBACNE,MAAO,EACPtM,SAAU,IAGlBuM,KAAM,CACF,CACIH,KAAM,QACNI,KAAM,aAEV,CACIJ,KAAM,kBACNI,KAAM,CACF9L,OAAQ,QAGhB,CACI0L,KAAM,aACNI,KAAM,CACF9L,OAAQ,CACJgM,QAAS,4BAM7B,CACIN,KAAM,WACNC,KAAM,CACF,wEACA,uEACA,wEACA,0EACA,wEACA,uEACA,wEACA,kBAEJ7Q,SAAU,CACN,CACI4Q,KAAM,WACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CAAC,+BAEX,CACID,KAAM,YACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CACF,oEACA,sEACA,oBAGR,CACID,KAAM,kBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,qBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,uBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,cACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,8BACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,4BACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,cACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CAAC,2CAEX,CACID,KAAM,eACNE,MAAO,EACPtM,SAAU,EACVyM,WAAY,GAEhB,CACIL,KAAM,mCACNE,MAAO,EACPtM,SAAU,EACVyM,WAAY,GAEhB,CACIL,KAAM,eACNE,MAAO,EACPtM,SAAU,EACVyM,WAAY,GAEhB,CACIL,KAAM,gBACNE,MAAO,EACPtM,SAAU,IAGlBuM,KAAM,CACF,CACIH,KAAM,SACNI,KAAM,WAIlB,CACIJ,KAAM,UACNC,KAAM,CACF,0EACA,yEACA,2BACA,+CACA,uCACA,gDAEJ7Q,SAAU,CACN,CACI4Q,KAAM,WACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CAAC,+BAEX,CACID,KAAM,YACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CACF,oEACA,sEACA,oBAGR,CACID,KAAM,kBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,qBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,uBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,cACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,8BACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,4BACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,cACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CAAC,2CAEX,CACID,KAAM,gBACNE,MAAO,EACPtM,SAAU,IAGlBuM,KAAM,CACF,CACIH,KAAM,SACNI,KAAM,WAIlB,CACIJ,KAAM,SACNC,KAAM,CACF,0EACA,yEAEJ7Q,SAAU,CACN,CACI4Q,KAAM,WACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CAAC,+BAEX,CACID,KAAM,YACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CACF,oEACA,sEACA,oBAGR,CACID,KAAM,kBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,qBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,uBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,cACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,8BACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,4BACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,cACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CAAC,2CAEX,CACID,KAAM,gBACNE,MAAO,EACPtM,SAAU,IAGlBuM,KAAM,CACF,CACIH,KAAM,SACNI,KAAM,WAIlB,CACIJ,KAAM,SACNC,KAAM,CACF,2EACA,iEAEJ7Q,SAAU,CACN,CACI4Q,KAAM,WACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CAAC,+BAEX,CACID,KAAM,YACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,kBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,qBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,uBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,cACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,8BACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,4BACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,cACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CAAC,gDAEX,CACID,KAAM,gBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,OACNE,MAAO,EACPtM,SAAU,IAGlBuM,KAAM,CACF,CACIH,KAAM,SACNI,KAAM,WAIlB,CACIJ,KAAM,OACNC,KAAM,CACF,yEACA,oEAEJ7Q,SAAU,CACN,CACI4Q,KAAM,WACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CAAC,+BAEX,CACID,KAAM,YACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,kBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,qBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,uBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,cACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,8BACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,4BACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,cACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CAAC,gDAEX,CACID,KAAM,gBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,OACNE,MAAO,EACPtM,SAAU,IAGlBuM,KAAM,CACF,CACIH,KAAM,SACNI,KAAM,WAIlB,CACIJ,KAAM,OACNC,KAAM,CACF,0EACA,0EACA,gDAEJ7Q,SAAU,CACN,CACI4Q,KAAM,WACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CAAC,+BAEX,CACID,KAAM,YACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CACF,oEACA,sEACA,oBAGR,CACID,KAAM,kBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,OACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,eACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,eACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,qBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,uBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,cACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,8BACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,4BACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,cACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,gBACNE,MAAO,EACPtM,SAAU,IAGlBuM,KAAM,CACF,CACIH,KAAM,SACNI,KAAM,WAIlB,CACIJ,KAAM,eACNC,KAAM,CACF,wEACA,2EACA,aAEJ7Q,SAAU,CACN,CACI4Q,KAAM,WACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CAAC,+BAEX,CACID,KAAM,YACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CACF,oEACA,sEACA,oBAGR,CACID,KAAM,kBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,qBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,uBACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,cACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,8BACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,4BACNE,MAAO,EACPtM,SAAU,GAEd,CACIoM,KAAM,cACNE,MAAO,EACPtM,SAAU,EACVqM,KAAM,CAAC,2CAEX,CACID,KAAM,eACNE,MAAO,EACPtM,SAAU,EACVyM,WAAY,GAEhB,CACIL,KAAM,mCACNE,MAAO,EACPtM,SAAU,EACVyM,WAAY,GAEhB,CACIL,KAAM,eACNE,MAAO,EACPtM,SAAU,EACVyM,WAAY,GAEhB,CACIL,KAAM,gBACNE,MAAO,EACPtM,SAAU,IAGlBuM,KAAM,CACF,CACIH,KAAM,UACNI,KAAM,CACFE,QAAS,2CAGjB,CACIN,KAAM,UACNI,KAAM,CACFE,QAAS,iBAM7BC,MAAO,CACH,CACIP,KAAM,eACNI,KAAM,CACFI,KAAM,OACNC,SAAU,CACN,CACIT,KAAM,eAEV,CACIA,KAAM,aAKtB,CACIA,KAAM,oBACNI,KAAM,CACFI,KAAM,SACNE,OAAQ,CACJ,CACIV,KAAM,QACNI,KAAM,aAEV,CACIJ,KAAM,WACNI,KAAM,OAEV,CACIJ,KAAM,UACNI,KAAM,CACF9L,OAAQ,CACJzG,MAAO,CAAC,KAAM,OAI1B,CACImS,KAAM,OACNI,KAAM,CACF9L,OAAQ,CACJgM,QAAS,8BAOjC,CACIN,KAAM,wBACNI,KAAM,CACFI,KAAM,SACNE,OAAQ,CACJ,CACIV,KAAM,gBACNI,KAAM,CACFvS,MAAO,CAAC,KAAM,KAGtB,CACImS,KAAM,OACNI,KAAM,SAEV,CACIJ,KAAM,WACNI,KAAM,CACFvS,MAAO,CAAC,KAAM,SAMlC,CACImS,KAAM,uBACNI,KAAM,CACFI,KAAM,SACNE,OAAQ,CACJ,CACIV,KAAM,aACNC,KAAM,CACF,0EACA,wBAEJG,KAAM,QAEV,CACIJ,KAAM,kBACNC,KAAM,CACF,wEACA,wBAEJG,KAAM,QAEV,CACIJ,KAAM,yBACNC,KAAM,CACF,uDAEJG,KAAM,SAKtB,CACIJ,KAAM,kBACNI,KAAM,CACFI,KAAM,SACNE,OAAQ,CACJ,CACIV,KAAM,IACNI,KAAM,CACFvS,MAAO,CAAC,KAAM,MAGtB,CACImS,KAAM,IACNI,KAAM,CACFvS,MAAO,CAAC,KAAM,MAGtB,CACImS,KAAM,IACNI,KAAM,CACFvS,MAAO,CAAC,KAAM,SAMlC,CACImS,KAAM,yCACNI,KAAM,CACFI,KAAM,SACNE,OAAQ,CACJ,CACIV,KAAM,QACNI,KAAM,CACF9L,OAAQ,CACJgM,QAAS,qBAIrB,CACIN,KAAM,OACNI,KAAM,aAEV,CACIJ,KAAM,oBACNC,KAAM,CACF,yCACA,oCACA,0DAEJG,KAAM,CACF9L,OAAQ,CACJgM,QAAS,uBAIrB,CACIN,KAAM,4BACNI,KAAM,CACFrL,IAAK,CACDuL,QAAS,+BAIrB,CACIN,KAAM,2BACNI,KAAM,CACFrL,IAAK,CACDuL,QAAS,mCAIrB,CACIN,KAAM,aACNI,KAAM,QAEV,CACIJ,KAAM,6BACNI,KAAM,CACF9L,OAAQ,QAGhB,CACI0L,KAAM,aACNI,KAAM,CACF9L,OAAQ,CACJgM,QAAS,0BAIrB,CACIN,KAAM,uCACNI,KAAM,CACF9L,OAAQ,UAM5B,CACI0L,KAAM,uCACNI,KAAM,CACFI,KAAM,SACNE,OAAQ,CACJ,CACIV,KAAM,QACNI,KAAM,CACF9L,OAAQ,CACJgM,QAAS,qBAIrB,CACIN,KAAM,OACNI,KAAM,aAEV,CACIJ,KAAM,4BACNI,KAAM,CACFrL,IAAK,CACDuL,QAAS,+BAIrB,CACIN,KAAM,aACNI,KAAM,CACF9L,OAAQ,CACJgM,QAAS,0BAIrB,CACIN,KAAM,+BACNI,KAAM,SAKtB,CACIJ,KAAM,wCACNI,KAAM,CACFI,KAAM,SACNE,OAAQ,CACJ,CACIV,KAAM,QACNI,KAAM,CACF9L,OAAQ,CACJgM,QAAS,qBAIrB,CACIN,KAAM,OACNI,KAAM,aAEV,CACIJ,KAAM,4BACNI,KAAM,CACFrL,IAAK,CACDuL,QAAS,+BAIrB,CACIN,KAAM,aACNI,KAAM,CACF9L,OAAQ,CACJgM,QAAS,0BAIrB,CACIN,KAAM,WACNI,KAAM,aAEV,CACIJ,KAAM,kBACNI,KAAM,OAEV,CACIJ,KAAM,0BACNI,KAAM,MAEV,CACIJ,KAAM,+BACNI,KAAM,MAEV,CACIJ,KAAM,mBACNI,KAAM,CACF9L,OAAQ,WAM5B,CACI0L,KAAM,oBACNC,KAAM,CACF,+EAEJG,KAAM,CACFI,KAAM,SACNE,OAAQ,CACJ,CACIV,KAAM,QACNI,KAAM,aAEV,CACIJ,KAAM,6BACNC,KAAM,CACF,uEACA,wEACA,yEACA,YAEJG,KAAM,CACF9L,OAAQ,UAM5B,CACI0L,KAAM,4BACNI,KAAM,CACFI,KAAM,SACNE,OAAQ,CACJ,CACIV,KAAM,SACNI,KAAM,OAEV,CACIJ,KAAM,gBACNI,KAAM,CACF9L,OAAQ,OAGhB,CACI0L,KAAM,gBACNI,KAAM,CACFE,QAAS,wBAGjB,CACIN,KAAM,YACNI,KAAM,OAEV,CACIJ,KAAM,WACNI,KAAM,CACF9L,OAAQ,QAGhB,CACI0L,KAAM,MACNC,KAAM,CACF,2DAEJG,KAAM,CACF9L,OAAQ,aAM5B,CACI0L,KAAM,wBACNI,KAAM,CACFI,KAAM,SACNE,OAAQ,CACJ,CACIV,KAAM,QACNI,KAAM,CACF9L,OAAQ,CACJgM,QAAS,qBAIrB,CACIN,KAAM,2CACNI,KAAM,CACFrL,IAAK,CACDuL,QACI,8CAIhB,CACIN,KAAM,2BACNI,KAAM,CACFrL,IAAK,CACDuL,QACI,8CAIhB,CACIN,KAAM,WACNI,KAAM,CACF9L,OAAQ,QAGhB,CACI0L,KAAM,mBACNI,KAAM,CACFrL,IAAK,CACDuL,QAAS,4BAIrB,CACIN,KAAM,+BACNI,KAAM,CACF9L,OAAQ,QAGhB,CACI0L,KAAM,aACNI,KAAM,WAKtB,CACIJ,KAAM,2BACNI,KAAM,CACFI,KAAM,SACNE,OAAQ,CACJ,CACIV,KAAM,QACNI,KAAM,CACF9L,OAAQ,CACJgM,QAAS,qBAIrB,CACIN,KAAM,mBACNI,KAAM,CACFrL,IAAK,CACDuL,QAAS,4BAIrB,CACIN,KAAM,2CACNI,KAAM,CACFrL,IAAK,CACDuL,QACI,8CAIhB,CACIN,KAAM,2BACNI,KAAM,CACFrL,IAAK,CACDuL,QACI,8CAIhB,CACIN,KAAM,WACNI,KAAM,CACF9L,OAAQ,QAGhB,CACI0L,KAAM,+BACNI,KAAM,CACF9L,OAAQ,QAGhB,CACI0L,KAAM,aACNI,KAAM,QAEV,CACIJ,KAAM,aACNI,KAAM,CACF9L,OAAQ,CACJgM,QAAS,6BAOjC,CACIN,KAAM,2BACNI,KAAM,CACFI,KAAM,SACNE,OAAQ,CACJ,CACIV,KAAM,SACNI,KAAM,aAEV,CACIJ,KAAM,MACNI,KAAM,UAKtB,CACIJ,KAAM,yBACNI,KAAM,CACFI,KAAM,SACNE,OAAQ,CACJ,CACIV,KAAM,OACNI,KAAM,CACFvS,MAAO,CAAC,KAAM,MAGtB,CACImS,KAAM,2BACNI,KAAM,MAEV,CACIJ,KAAM,gCACNI,KAAM,MAEV,CACIJ,KAAM,6BACNI,KAAM,UAKtB,CACIJ,KAAM,2CACNI,KAAM,CACFI,KAAM,SACNE,OAAQ,CACJ,CACIV,KAAM,oBACNI,KAAM,CACFE,QAAS,sBAGjB,CACIN,KAAM,kBACNI,KAAM,SAKtB,CACIJ,KAAM,2CACNI,KAAM,CACFI,KAAM,SACNE,OAAQ,CACJ,CACIV,KAAM,oBACNI,KAAM,CACFE,QAAS,sBAGjB,CACIN,KAAM,gBACNI,KAAM,CACFE,QAAS,wBAGjB,CACIN,KAAM,YACNC,KAAM,CACF,mDAEJG,KAAM,OAEV,CACIJ,KAAM,WACNC,KAAM,CACF,sEAEJG,KAAM,WAKtB,CACIJ,KAAM,sBACNI,KAAM,CACFI,KAAM,SACNE,OAAQ,CACJ,CACIV,KAAM,wBACNI,KAAM,MAEV,CACIJ,KAAM,mBACNI,KAAM,MAEV,CACIJ,KAAM,YACNI,KAAM,OAEV,CACIJ,KAAM,eACNI,KAAM,WAKtB,CACIJ,KAAM,gCACNI,KAAM,CACFI,KAAM,SACNE,OAAQ,CACJ,CACIV,KAAM,QACNI,KAAM,aAEV,CACIJ,KAAM,SACNI,KAAM,OAEV,CACIJ,KAAM,WACNI,KAAM,CACF9L,OAAQ,QAGhB,CACI0L,KAAM,kBACNI,KAAM,MAEV,CACIJ,KAAM,MACNC,KAAM,CACF,2DAEJG,KAAM,CACF9L,OAAQ,aAM5B,CACI0L,KAAM,yBACNI,KAAM,CACFI,KAAM,SACNE,OAAQ,CACJ,CACIV,KAAM,+BACNI,KAAM,CACFrL,IAAK,CACDlH,MAAO,CAAC,KAAM,OAI1B,CACImS,KAAM,gCACNI,KAAM,CACFrL,IAAK,CACDlH,MAAO,CAAC,KAAM,OAI1B,CACImS,KAAM,2BACNI,KAAM,CACFrL,IAAK,CACDuL,QACI,8CAIhB,CACIN,KAAM,oBACNI,KAAM,CACFrL,IAAK,QAGb,CACIiL,KAAM,kBACNI,KAAM,CACFrL,IAAK,CACDuL,QAAS,8BAIrB,CACIN,KAAM,WACNI,KAAM,CACF9L,OAAQ,QAGhB,CACI0L,KAAM,aACNI,KAAM,QAEV,CACIJ,KAAM,+BACNI,KAAM,CACF9L,OAAQ,QAGhB,CACI0L,KAAM,cACNI,KAAM,CACFrL,IAAK,cAGb,CACIiL,KAAM,UACNI,KAAM,CACF9L,OAAQ,aAM5B,CACI0L,KAAM,aACNI,KAAM,CACFI,KAAM,SACNE,OAAQ,CACJ,CACIV,KAAM,UACNC,KAAM,CAAC,iCACPG,KAAM,MAEV,CACIJ,KAAM,QACNC,KAAM,CAAC,8CACPG,KAAM,UAKtB,CACIJ,KAAM,YACNI,KAAM,CACFI,KAAM,SACNE,OAAQ,CACJ,CACIV,KAAM,OACNC,KAAM,CAAC,yCACPG,KAAM,aAEV,CACIJ,KAAM,QACNC,KAAM,CAAC,8BACPG,KAAM,aAEV,CACIJ,KAAM,SACNC,KAAM,CAAC,4CACPG,KAAM,OAEV,CACIJ,KAAM,WACNC,KAAM,CACF,6DACA,yCAEJG,KAAM,CACF9L,OAAQ,cAGhB,CACI0L,KAAM,QACNC,KAAM,CAAC,uBACPG,KAAM,CACFE,QAAS,iBAGjB,CACIN,KAAM,MACNC,KAAM,CACF,2DAEJG,KAAM,CACF9L,OAAQ,cAOhCqM,OAAQ,CACJ,CACIC,KAAM,IACNZ,KAAM,2BACNa,IAAK,kDAET,CACID,KAAM,KACNZ,KAAM,wBACNa,IAAK,yBAET,CACID,KAAM,KACNZ,KAAM,yBACNa,IAAK,0BAET,CACID,KAAM,KACNZ,KAAM,2BACNa,IAAK,4BAET,CACID,KAAM,KACNZ,KAAM,6BACNa,IAAK,8BAET,CACID,KAAM,KACNZ,KAAM,iBACNa,IAAK,kBAET,CACID,KAAM,KACNZ,KAAM,4CACNa,IAAK,6CAET,CACID,KAAM,KACNZ,KAAM,sCACNa,IAAK,uCAET,CACID,KAAM,KACNZ,KAAM,yCACNa,IAAK,0CAET,CACID,KAAM,KACNZ,KAAM,oCACNa,IAAK,qCAET,CACID,KAAM,KACNZ,KAAM,uCACNa,IAAK,wCAET,CACID,KAAM,KACNZ,KAAM,4BACNa,IAAK,6BAET,CACID,KAAM,KACNZ,KAAM,eACNa,IAAK,uCAET,CACID,KAAM,KACNZ,KAAM,yBACNa,IAAK,0BAET,CACID,KAAM,KACNZ,KAAM,wBACNa,IAAK,yBAET,CACID,KAAM,KACNZ,KAAM,yBACNa,IAAK,mCAET,CACID,KAAM,KACNZ,KAAM,sBACNa,IAAK,uBAET,CACID,KAAM,KACNZ,KAAM,mBACNa,IAAK,oBAET,CACID,KAAM,KACNZ,KAAM,uBACNa,IAAK,sDAET,CACID,KAAM,KACNZ,KAAM,yBACNa,IAAK,kDAET,CACID,KAAM,KACNZ,KAAM,wBAEV,CACIY,KAAM,KACNZ,KAAM,yBAEV,CACIY,KAAM,KACNZ,KAAM,iBACNa,IAAK,+EAET,CACID,KAAM,KACNZ,KAAM,uBAEV,CACIY,KAAM,KACNZ,KAAM,gCAEV,CACIY,KAAM,KACNZ,KAAM,oBAEV,CACIY,KAAM,KACNZ,KAAM,4BAEV,CACIY,KAAM,KACNZ,KAAM,4BAEV,CACIY,KAAM,KACNZ,KAAM,kCACNa,IAAK,gEAET,CACID,KAAM,KACNZ,KAAM,uBACNa,IAAK,sCAET,CACID,KAAM,KACNZ,KAAM,sBAEV,CACIY,KAAM,KACNZ,KAAM,sCAEV,CACIY,KAAM,KACNZ,KAAM,0JP5kHgC,sGQ8D3CnU,eACHE,EACA2Q,EACAlR,EACAsV,EACAC,EACAhG,GAEAA,EAAiBA,SAELzO,GAAuB8S,iBAAiB5T,EAAMO,GAC1D,MAAM4R,EAAyC,GAEzCxP,SAAerC,GAAkBC,EAAKP,IAAOmF,MAAM,EAAG,GAGtDqQ,EAAuB,GAC7B,IAAK,IAAI3U,EAAI,EAAGA,EAAI8B,EAAMhC,OAAQE,IACzB8B,EAAM9B,GAAGV,eACVqV,EAAqBtQ,KAAKrE,GAKlC,IAAK,IAAIA,EAAI,EAAGA,EAAIyU,KACZzU,GAAK2U,EAAqB7U,QADSE,IAKvCsR,EAAajN,WACHpE,GAAuBsP,aAAa,CACtCpQ,OACA+K,SAAUmG,EAAMtI,UAChB2G,iBACAtN,UAAWuT,EAAqB3U,MAI5C,MAAM4U,UAAEA,SAAoBlV,EAAImV,qBAE1BC,EAAKC,EAAcA,eAACzD,EAAcjB,EAAOuE,GAI/C,aAFmBI,EAAgBA,iBAACtV,EAAKoV,EAAIJ,EAGjD,kBC9EOlV,eACHE,EACA2Q,EACAlR,EACA+B,EACAT,EACA+E,EACAkP,GAEAxT,EAASD,EAAAA,GAAGC,GACZ,MAAMwG,QAAgChI,EAAIuV,kCACtCxU,EAAMsH,UACN,CACI5I,UAID+V,GAAiBpS,GACpB4E,EAAwByN,MACxBjU,GAGE6K,QAAcrM,EAAI0V,mBACpBF,EAAc7U,KAAI8C,IAAY,CAC1BkS,KAAMlS,EAAQG,kBAAkB+R,KAChCtP,KAAM5C,EAAQG,kBAAkBwC,SAASC,KACzCE,MAAO9C,EAAQG,kBAAkBwC,SAASG,WAI5CqP,QAAWrV,GAAuBiT,QAAQ,CAC5C7C,MAAOA,EAAMtI,UACb7C,6BAA8BgQ,EAC9BjI,UAAWzH,EACXtE,SACAuP,4BAA6B1E,EAAM3G,YACnCoL,oBAAqBzE,EAAMwJ,mBAGzBX,UAAEA,SAAoBlV,EAAImV,qBAC1BW,EAAoBC,EAAYA,aAACpF,EAAO,CAAC5P,IACzCiV,EAAWX,EAAcA,eAC3B,CAACrD,EAAAA,qBAAqBiE,oBAAoB,CAAEC,MAAO,OAAYN,GAC/DjF,EACAuE,EACAY,GAGJ,OAAOR,mBAAiBtV,EAAKgW,EAAUhB,EAC3C,4DCxCOlV,eACHE,EACA2Q,EACAlR,EACAsQ,EACA/E,EACAxJ,EACAiE,EACAjG,EACAwV,GAEAvP,EACIA,QAAAA,EACA0Q,EAAAA,0BAA0BnW,EAAIoW,qBAClC5W,EACIA,QAAAA,EACA2C,SAA0BpC,GAAkBC,EAAKP,IAErD,MAAM6Q,QAA8B+F,EAAAA,kCAChCrW,EACA2Q,EACAlR,EACAuL,EAAU3C,eACVhH,OACAA,EACA2T,EACAxV,EAAcwB,cAGZsV,QAAY/V,GAAuB8P,iBAAiB,CACtD7F,SAAUmG,EAAMtI,UAChB5I,OACAuL,UAAWA,EAAU3C,UACrBiI,sBAAuBA,EAAsBnP,QAC7CK,SACAuO,WACAtK,sBACAjG,mBAGE0V,UAAEA,SAAoBlV,EAAImV,qBAC1BW,EAAoBC,EAAYA,aAACpF,EAAO,CAAC3F,IAEzCoK,EAAKC,EAAAA,eACP,CACIrD,EAAAA,qBAAqBiE,oBAAoB,CACrCC,MAAO,KAAmC,IAAzBhG,EAAAA,QAAQ1O,GAAQpB,YAElCkW,GAEP3F,EACAuE,EACAY,GAGJ,aAAaR,EAAAA,iBAAiBtV,EAAKoV,EAAIJ,EAC3C,qGCzDOlV,eACHE,EACA2Q,EACAlR,EACA+B,EACAT,EACAwV,EACAhJ,EACA9H,EACAjG,EACAwV,GAEAvP,EACIA,QAAAA,EACA0Q,EAAAA,0BAA0BnW,EAAIoW,qBAClC5W,EACIA,QAAAA,EACA2C,SAA0BpC,GAAkBC,EAAKP,IAErD,MAAM+W,QAAmBjW,GAAuBmQ,SAAS,CACrDC,MAAOA,EAAMtI,UACbtH,MAAOA,EAAMsH,UACbuI,OAAQ2F,EACRhJ,YACA/L,SACA/B,OACAgG,sBACAjG,kBAGEiX,QAAqBzW,EAAImV,qBACzBW,EAAoBC,EAAYA,aAACpF,EAAO,CAAC5P,IACzCiV,EAAWX,EAAAA,eACb,CACIrD,EAAAA,qBAAqBiE,oBAAoB,CACrCC,MAAO,KAAmC,IAAzBhG,EAAAA,QAAQ1O,GAAQpB,SAErCoW,GAEJ7F,EACA8F,EAAavB,UACbY,GAGJ,aAAaR,EAAgBA,iBAACtV,EAAKgW,EAAUhB,EAAgByB,EACjE,kCC9CO3W,eACHE,EACA2Q,EACAlR,EACAsB,EACAqS,EACAhJ,EACA3E,EACAjG,EACAwV,GAEAvP,EACIA,QAAAA,EACA0Q,EAAAA,0BAA0BnW,EAAIoW,qBAClC5W,EACIA,QAAAA,EACA2C,SAA0BpC,GAAkBC,EAAKP,IAErD,MAAM+W,QAAmBjW,GAAuB4S,wBAAwB,CACpE3I,SAAUmG,EAAMtI,UAChB2C,UAAWjK,EAAMsH,UACjB+K,eACA3T,OACA2K,kBACA3E,sBACAjG,kBAGEiX,QAAqBzW,EAAImV,qBACzBW,EAAoBC,EAAYA,aAACpF,EAAO,CAAC5P,IAEzCiV,EAAWX,EAAAA,eACb,CACIrD,EAAAA,qBAAqBiE,oBAAoB,CACrCC,MAAO,OAEXM,GAEJ7F,EACA8F,EAAavB,UACbY,GAGJ,aAAaR,EAAgBA,iBAACtV,EAAKgW,EAAUhB,EAAgByB,EACjE,oHChDO3W,eACHE,EACA2Q,EACA+F,EACA5H,EACA6H,EAAUC,EAAOA,QAACC,WAClB7B,EACAhG,EACAH,GAEA,MAAME,QACI/O,EAAI8W,kCAAkCtH,EAASA,WAKnDuH,EACiB,GAAnB/H,EACMqD,EAAqBA,sBACrBrD,GAAkBE,EAAAA,iBAEtBoH,QAAY/V,GAAuBqO,WAAW,CAChDpE,SAAUmG,EAAMtI,UAChB5I,KAAMkX,EAAQtO,UACdyG,WACA9D,UACI,cAAe0L,EACTA,EAAcrO,UACdqO,EACV7H,gBACIA,GAAmB,cAAeA,EAC5BA,EAAgBxG,UACfwG,QAAAA,EAAmB,KAC9BE,oBACAC,eAAgB+H,KAGd7B,UAAEA,SAAoBlV,EAAImV,qBAE1BW,EAAoBC,EAAYA,aAClCpF,EACA,CAAC+F,EAAe7H,GAAiBvM,QAC5B0U,GACa3V,MAAV2V,GAAuB,cAAeA,KAI5C5B,EAAKC,EAAcA,eAACiB,EAAK3F,EAAOuE,EAAW,IAC1CY,EACHa,IAEEM,QAAa3B,EAAgBA,iBAACtV,EAAKoV,EAAIJ,GAE7C,MAAO,CAAEvV,KAAMkX,EAAQtO,UAAW6O,qBAAsBD,EAC5D,0BLhEOnX,eACHE,EACA2Q,EACAlR,EACAuV,EACAhG,GAEAA,EAAiBA,SAELzO,GAAuB8S,iBAAiB5T,EAAMO,GAE1D,MAAM4V,QAAWrV,GAAuBmP,gBAAgB,CACpDlF,SAAUmG,EAAMtI,UAChB5I,OACAuP,oBAGEkG,UAAEA,SAAoBlV,EAAImV,qBAE1BC,EAAKC,EAAAA,eAAe,CAACO,GAAKjF,EAAOuE,GAIvC,aAFmBI,EAAgBA,iBAACtV,EAAKoV,EAAIJ,EAGjD,iFM3BOlV,eACHE,EACA2Q,EACA3F,EACAqG,EACA8F,GAEA,MAAM7F,QAAmBtR,EAAIoX,QAAQ,cAC/BxF,aAAEA,EAAYzQ,QAAEA,SACZZ,GAAuB6Q,8BAA8B,CACvDT,MAAOA,EAAMtI,UACb2C,UAAWA,EAAU3C,UACrBgJ,QACAnM,kBAAmBiS,EACnB7F,eAGFwE,EAAoBC,EAAYA,aAACpF,EAAO,CAAC3F,IACzCqM,EAAQ,GAEd,IAAK,MAAMC,KAAe1F,EAAc,CACpC,MAAM6E,QAAqBzW,EAAImV,qBACzBa,EAAWX,EAAcA,eAC3B,CAACiC,GACD3G,EACA8F,EAAavB,UACbY,GAEEmB,QAAa3B,EAAgBA,iBAC/BtV,EACAgW,EACA,CAAE/V,WAAY,aACdwW,GAEJY,EAAM1S,KAAKsS,EACd,CAED,MAAO,CAAEI,QAAOlW,UACpB,4ETigBM,SACFmI,GAEA,MAAMD,EAAO0C,GAA4CwL,OACrDjO,EAAOQ,SAAS1K,GAAsBgB,SAE1C,OACOoM,OAAAC,OAAAD,OAAAC,OAAA,CAAA,EAAApD,IACHgD,MAAOD,GAAa/C,EAAKgD,OAAU,KAAOhD,EAAKgD,OAEvD,6CAhbM,SACF/C,GAEA,OAAOJ,GAAoBqO,OACvBjO,EAAOQ,SAAS7K,GAA6BmB,OAAS,GAE9D,uDAqBM,SACFkJ,GAEA,MAAMD,EAAOF,GAA6CoO,OACtDjO,EAAOQ,SAAS3K,GAAyCiB,SAE7D,MAAO,CACHW,MAAOsI,EAAKtI,MACZqJ,gBAAiBf,EAAKe,gBACtBC,WAAYhB,EAAKgB,WAEzB,sCA/DM,SACFf,GAEA,OAAOL,GAAasO,OAChBjO,EAAOQ,SAAS9K,GAAsBoB,QAE9C,sCAgeM,SACFkJ,GAEA,MAAMD,EAAO2C,GAA2CuL,OACpDjO,EAAOQ,SAASzK,GAAqBe,SAEzC,OACOoM,OAAAC,OAAAD,OAAAC,OAAA,CAAA,EAAApD,IACHgD,MAAOD,GAAa/C,EAAKgD,OAAU,KAAOhD,EAAKgD,OAEvD,wCA1ZM,SACF/C,GAEA,OAAOP,GAA6CwO,OAChDjO,EAAO1E,MAAM1F,GAAuBkB,OAAS,GAErD,qBUtLON,eACHE,EACA2Q,EACAlR,EACA+B,EACAT,EACAwM,EACAyF,EACAgC,GAEAxT,EAASD,EAAAA,GAAGC,GAEZ,MAAMwG,QAAgChI,EAAIuV,kCACtCxU,EAAMsH,UACN,CACI5I,UAID+V,GAAiB1R,GACpBkE,EAAwByN,MACxBjU,GAGE6K,QAAcrM,EAAI0V,mBACpBF,EAAc7U,KAAI8C,IAAY,CAC1BkS,KAAMlS,EAAQG,kBAAkB+R,KAChCtP,KAAM5C,EAAQG,kBAAkBwC,SAASC,KACzCE,MAAO9C,EAAQG,kBAAkBwC,SAASG,WAM5CiR,EAAyBhV,GAF/BwQ,EAAiBA,QAAAA,QAAyBjT,GAAkBC,EAAKP,GAI7D+B,GAGEoU,QAAWrV,GAAuBwS,WAAW,CAC/CpC,MAAOA,EAAMtI,UACb7C,6BAA8BgQ,EAC9BjI,YACA/L,SACAwR,eAAgBwE,EAChBzG,4BAA6B1E,EAAM3G,YACnCoL,oBAAqBzE,EAAMwJ,mBAGzBX,UAAEA,SAAoBlV,EAAImV,qBAC1BW,EAAoBC,EAAYA,aAACpF,EAAO,CAAC5P,IACzCiV,EAAWX,EAAcA,eAC3B,CAACrD,EAAAA,qBAAqBiE,oBAAoB,CAAEC,MAAO,OAAYN,GAC/DjF,EACAuE,EACAY,GAEJ,aAAaR,EAAAA,iBAAiBtV,EAAKgW,EAAUhB,EACjD,8BCvDOlV,eACHE,EACA2Q,EACAlR,EACA+B,EACAT,EACAwM,EACAyF,EACAgC,GAEAxT,EAASD,EAAAA,GAAGC,GAEZ,MAAMwG,QACIhI,EAAIyX,qCAAqC1W,EAAMsH,UAAW,CAC5D5I,UAGD+V,GAAiB1R,GACpBkE,EAAwByN,MACxBjU,GAGE6K,QAAcrM,EAAI0V,mBACpBF,EAAc7U,KAAI8C,IAAY,CAC1BkS,KAAMlS,EAAQG,kBAAkB+R,KAChCtP,KAAM5C,EAAQG,kBAAkBwC,SAASC,KACzCE,MAAO9C,EAAQG,kBAAkBwC,SAASG,WAI5CmR,EACF1E,QAAAA,EACAxQ,SACUzC,GAAkBC,EAAKP,GAC7B+B,GAGFoU,QAAWrV,GAAuBwS,WAAW,CAC/CpC,MAAOA,EAAMtI,UACb7C,6BAA8BgQ,EAC9BjI,YACA/L,SACAuP,4BAA6B1E,EAAM3G,YACnCoL,oBAAqBzE,EAAMwJ,gBAC3B7C,eAAgB0E,KAGdxC,UAAEA,SAAoBlV,EAAImV,qBAC1BW,EAAoBC,EAAYA,aAACpF,EAAO,CAAC5P,IACzCiV,EAAWX,EAAcA,eAC3B,CAACrD,EAAAA,qBAAqBiE,oBAAoB,CAAEC,MAAO,OAAYN,GAC/DjF,EACAuE,EACAY,GAGJ,OAAOR,mBAAiBtV,EAAKgW,EAAUhB,EAC3C,kWCZM,SACFhC,GAEA,OAAQ7S,MAAM0S,QAAQG,EAC1B,6BC9DOlT,eACHE,EACA2Q,EACAlR,EACAsB,EACAiU,GAEA,MAAMhN,QAAgChI,EAAIuV,kCACtCxU,EAAMsH,UACN,CAAE5I,SAGN,GAA6C,IAAzCuI,EAAwByN,MAAMrV,OAC9B,MAAM,IAAIT,MACN,+CAA+CF,EAAKI,cAI5D,MAAM+R,EAAe,CACjBI,EAAAA,qBAAqBiE,oBAAoB,CAAEC,MAAO,OAGtD,IACI,IAAI5V,EAAI,EACRA,EAAI0H,EAAwByN,MAAM7Q,MAAM,EAAG,GAAGxE,OAC9CE,GAAK,EACP,CACE,MAAMqX,EAAQ3P,EAAwByN,MAAM7Q,MAAMtE,EAAGA,EAAI,GAEnD+L,QAAcrM,EAAI4X,iBACpBD,EAAMhX,KAAI8C,GAAWlC,EAAAA,GAAGkC,EAAQG,kBAAkB+R,SAGhDkC,QACItX,GAAuB2S,mBAAmB,CAC5CvC,MAAOA,EAAMtI,UACbtH,MAAOA,EAAMsH,UACb7C,6BAA8BmS,EAC9BlY,OACAqR,oBAAqBzE,EAAMwJ,gBAC3B9E,4BAA6B1E,EAAM3G,cAG3CkM,EAAajN,QAAQkT,EACxB,CAED,MAAM3C,UAAEA,SAAoBlV,EAAImV,qBAC1BW,EAAoBC,EAAYA,aAACpF,EAAO,CAAC5P,IAEzCiV,EAAWX,EAAAA,eACbzD,EACAjB,EACAuE,EACAY,GAGJ,OAAOR,mBAAiBtV,EAAKgW,EAAUhB,EAC3C,iBC1COlV,eACHE,EACA2Q,EACAlR,EACAsQ,EACA/E,EACAxJ,EACAiE,EACAjG,EACAwV,GAEAvP,EACIA,QAAAA,EACA0Q,EAAAA,0BAA0BnW,EAAIoW,qBAClC5W,EACIA,QAAAA,EACA2C,SAA0BpC,GAAkBC,EAAKP,IAErD,MAAMmW,QAAWrV,GAAuBuP,OAAO,CAC3CtF,SAAUmG,EAAMtI,UAChB5I,OACAuL,UAAWA,EAAU3C,UACrB7G,SACAuO,WACAtK,sBACAjG,mBAGE0V,UAAEA,SAAoBlV,EAAImV,qBAC1BW,EAAoBC,EAAYA,aAACpF,EAAO,CAAC3F,IAEzCoK,EAAKC,EAAcA,eACrB,CAACrD,EAAAA,qBAAqBiE,oBAAoB,CAAEC,MAAO,MAAcN,GACjEjF,EACAuE,EACAY,GAGJ,OAAOR,mBAAiBtV,EAAKoV,EAAIJ,EACrC,iLCxDOlV,eACHE,EACA2Q,EACAtN,EACAtC,EACAiU,GAEA,MAAM3I,QAAcrM,EAAI0V,mBACpBrS,EAAS1C,KAAI8C,IAAY,CACrBkS,KAAMlS,EAAQG,kBAAkB+R,KAChCtP,KAAM5C,EAAQG,kBAAkBwC,SAASC,KACzCE,MAAO9C,EAAQG,kBAAkBwC,SAASG,YAyBtD,SAAoBxF,EAAesC,GAC/B,IAAKtC,EAAMsH,UAAU3I,OAAO2D,EAAS,GAAGK,OAAO3C,OAC3C,MAAM,IAAIpB,MACN,SAASoB,EAAMsH,UAAUxI,qCAAqCwD,EAAS,GAAGK,OAAO3C,MAAMlB,aAGnG,CA5BIiY,CAAW/W,EAAOsC,GA8BtB,SAA0BA,GACtB,GAAIA,EAAS0U,MAAKtU,GAAuC,OAA5BA,EAAQC,OAAOoC,WACxC,MAAM,IAAInG,MAAM,2BAExB,CAjCIqY,CAAiB3U,GAEjB,MAAMuS,QAAWrV,GAAuBuT,OAAO,CAC3CnD,MAAOA,EAAMtI,UACb7C,6BAA8BnC,EAC9B0N,4BAA6B1E,EAAM3G,YACnCoL,oBAAqBzE,EAAMwJ,mBAGzBX,UAAEA,SAAoBlV,EAAImV,qBAC1BW,EAAoBC,EAAYA,aAACpF,EAAO,CAAC5P,IACzCiV,EAAWX,EAAcA,eAC3B,CAACrD,EAAAA,qBAAqBiE,oBAAoB,CAAEC,MAAO,MAAYN,GAC/DjF,EACAuE,EACAY,GAGJ,OAAOR,mBAAiBtV,EAAKgW,EAAUhB,EAC3C,2FlBMM,SACF3R,EACA7B,EACA+B,EAAoB,GAOpB,MAAOS,EAAkBa,EAAOoT,EAAe9T,GAC3CL,GACIT,EACA7B,EACA+B,GAER,MAAO,CAAES,mBAAkBa,QAAOoT,gBAAe9T,oBACrD,+KA4KM,SACFd,EACAU,EACAR,EAAoB,GAOpB,MACIS,EACAC,EACAC,EACAC,GACAa,GACA3B,EACAU,EACAR,GAGJ,GAAIU,EAAkBI,GAAG9C,KAAGwC,IAAkB,CAC1C,MAAMO,EAAejB,EAASkB,QAC1B,CAACC,EAAKf,IAAYe,EAAIC,IAAIhB,EAAQC,OAAOlC,SACzCD,EAAAA,GAAG,IAEP,MAAIyC,EAAiB5D,QAAUmD,EACrB,IAAI5D,MACN,+BAA+BwE,EAAkB1C,eAAe8B,+CAAuDe,EAAa7C,eAAe4B,EAASjD,wEAG1J,IAAIT,MACN,mCAAmCoE,EAAetC,0BAA0B6C,EAAa7C,cAGpG,CAED,GAAgC,IAA5BuC,EAAiB5D,OACjB,MAAM,IAAIT,MAAMwD,IAGpB,MAAO,CACHa,EACAC,EACAC,EACAC,EAER,uQmB7QOrE,eACHE,EACA2Q,EACAlR,EACA+B,EACAT,EACAwM,EACAyH,GAEAxT,EAASD,EAAAA,GAAGC,GACZ,MAAMwG,QAAgChI,EAAIuV,kCACtCxU,EAAMsH,UACN,CACI5I,UAID+V,GAAiB1R,GACpBkE,EAAwByN,MACxBjU,GAGE6K,QAAcrM,EAAI0V,mBACpBF,EAAc7U,KAAI8C,IAAY,CAC1BkS,KAAMlS,EAAQG,kBAAkB+R,KAChCtP,KAAM5C,EAAQG,kBAAkBwC,SAASC,KACzCE,MAAO9C,EAAQG,kBAAkBwC,SAASG,WAI5CqP,QAAWrV,GAAuBsQ,SAAS,CAC7CF,MAAOA,EAAMtI,UACb7C,6BAA8BgQ,EAC9BjI,YACA/L,SACAuP,4BAA6B1E,EAAM3G,YACnCoL,oBAAqBzE,EAAMwJ,mBAGzBX,UAAEA,SAAoBlV,EAAImV,qBAC1BW,EAAoBC,EAAYA,aAACpF,EAAO,CAAC5P,IACzCiV,EAAWX,EAAcA,eAC3B,CAACrD,EAAAA,qBAAqBiE,oBAAoB,CAAEC,MAAO,MAAYN,GAC/DjF,EACAuE,EACAY,GAGJ,OAAOR,mBAAiBtV,EAAKgW,EAAUhB,EAC3C,8DCnDOlV,eACHE,EACA2Q,EACAlR,EACA+B,EACAT,EACAwM,EACAyH,GAEAxT,EAASD,EAAAA,GAAGC,GACZ,MAAMwG,QACIhI,EAAIyX,qCAAqC1W,EAAMsH,UAAW,CAC5D5I,UAGD+V,GAAiB1R,GACpBkE,EAAwByN,MACxBjU,GAGE6K,QAAcrM,EAAI0V,mBACpBF,EAAc7U,KAAI8C,IAAY,CAC1BkS,KAAMlS,EAAQG,kBAAkB+R,KAChCtP,KAAM5C,EAAQG,kBAAkBwC,SAASC,KACzCE,MAAO9C,EAAQG,kBAAkBwC,SAASG,WAI5CqP,QAAWrV,GAAuBsQ,SAAS,CAC7CF,MAAOA,EAAMtI,UACb7C,6BAA8BgQ,EAC9BjI,YACA/L,SACAuP,4BAA6B1E,EAAM3G,YACnCoL,oBAAqBzE,EAAMwJ,mBAGzBX,UAAEA,SAAoBlV,EAAImV,qBAC1BW,EAAoBC,EAAYA,aAACpF,EAAO,CAAC5P,IACzCiV,EAAWX,EAAcA,eAC3B,CAACrD,EAAAA,qBAAqBiE,oBAAoB,CAAEC,MAAO,MAAYN,GAC/DjF,EACAuE,EACAY,GAGJ,OAAOR,mBAAiBtV,EAAKgW,EAAUhB,EAC3C"}
1
+ {"version":3,"file":"index.cjs","sources":["../../../../../src/constants.ts","../../../../../src/utils/get-token-pool-infos.ts","../../../../../src/utils/select-input-accounts.ts","../../../../../src/utils/pack-compressed-token-accounts.ts","../../../../../src/utils/validation.ts","../../../../../node_modules/.pnpm/buffer-layout@1.2.2/node_modules/buffer-layout/lib/Layout.js","../../../../../node_modules/.pnpm/bn.js@5.2.1/node_modules/bn.js/lib/bn.js","../../../../../node_modules/.pnpm/@coral-xyz+borsh@0.29.0_@solana+web3.js@1.98.0/node_modules/@coral-xyz/borsh/dist/index.js","../../../../../src/layout.ts","../../../../../src/program.ts","../../../../../src/compressible/derivation.ts","../../../../../src/idl.ts","../../../../../src/actions/create-token-pool.ts","../../../../../src/actions/approve.ts","../../../../../src/actions/approve-and-mint-to.ts","../../../../../src/actions/compress.ts","../../../../../src/actions/compress-spl-token-account.ts","../../../../../src/actions/create-mint.ts","../../../../../src/actions/create-token-program-lookup-table.ts","../../../../../src/actions/decompress.ts","../../../../../src/actions/decompress-delegated.ts","../../../../../src/types.ts","../../../../../src/actions/merge-token-accounts.ts","../../../../../src/actions/mint-to.ts","../../../../../src/actions/revoke.ts","../../../../../src/actions/transfer.ts","../../../../../src/actions/transfer-delegated.ts"],"sourcesContent":["import { Buffer } from 'buffer';\nexport const POOL_SEED = Buffer.from('pool');\n\nexport const CPI_AUTHORITY_SEED = Buffer.from('cpi_authority');\n\nexport const SPL_TOKEN_MINT_RENT_EXEMPT_BALANCE = 1461600;\n\nexport const CREATE_TOKEN_POOL_DISCRIMINATOR = Buffer.from([\n 23, 169, 27, 122, 147, 169, 209, 152,\n]);\nexport const MINT_TO_DISCRIMINATOR = Buffer.from([\n 241, 34, 48, 186, 37, 179, 123, 192,\n]);\nexport const BATCH_COMPRESS_DISCRIMINATOR = Buffer.from([\n 65, 206, 101, 37, 147, 42, 221, 144,\n]);\nexport const TRANSFER_DISCRIMINATOR = Buffer.from([\n 163, 52, 200, 231, 140, 3, 69, 186,\n]);\nexport const COMPRESS_SPL_TOKEN_ACCOUNT_DISCRIMINATOR = Buffer.from([\n 112, 230, 105, 101, 145, 202, 157, 97,\n]);\n\nexport const APPROVE_DISCRIMINATOR = Buffer.from([\n 69, 74, 217, 36, 115, 117, 97, 76,\n]);\nexport const REVOKE_DISCRIMINATOR = Buffer.from([\n 170, 23, 31, 34, 133, 173, 93, 242,\n]);\nexport const ADD_TOKEN_POOL_DISCRIMINATOR = Buffer.from([\n 114, 143, 210, 73, 96, 115, 1, 228,\n]);\n","import { Commitment, PublicKey } from '@solana/web3.js';\nimport { unpackAccount } from '@solana/spl-token';\nimport { CompressedTokenProgram } from '../program';\nimport { bn, Rpc } from '@lightprotocol/stateless.js';\nimport BN from 'bn.js';\n\n/**\n * Check if the token pool info is initialized and has a balance.\n * @param mint The mint of the token pool\n * @param tokenPoolInfo The token pool info\n * @returns True if the token pool info is initialized and has a balance\n */\nexport function checkTokenPoolInfo(\n tokenPoolInfo: TokenPoolInfo,\n mint: PublicKey,\n): boolean {\n if (!tokenPoolInfo.mint.equals(mint)) {\n throw new Error(`TokenPool mint does not match the provided mint.`);\n }\n\n if (!tokenPoolInfo.isInitialized) {\n throw new Error(\n `TokenPool is not initialized. Please create a compressed token pool for mint: ${mint.toBase58()} via createTokenPool().`,\n );\n }\n return true;\n}\n\n/**\n * Get the token pool infos for a given mint.\n * @param rpc The RPC client\n * @param mint The mint of the token pool\n * @param commitment The commitment to use\n *\n * @returns The token pool infos\n */\nexport async function getTokenPoolInfos(\n rpc: Rpc,\n mint: PublicKey,\n commitment?: Commitment,\n): Promise<TokenPoolInfo[]> {\n const addressesAndBumps = Array.from({ length: 5 }, (_, i) =>\n CompressedTokenProgram.deriveTokenPoolPdaWithIndex(mint, i),\n );\n\n const accountInfos = await rpc.getMultipleAccountsInfo(\n addressesAndBumps.map(addressAndBump => addressAndBump[0]),\n commitment,\n );\n\n if (accountInfos[0] === null) {\n throw new Error(\n `TokenPool not found. Please create a compressed token pool for mint: ${mint.toBase58()} via createTokenPool().`,\n );\n }\n\n const parsedInfos = addressesAndBumps.map((addressAndBump, i) =>\n accountInfos[i]\n ? unpackAccount(\n addressAndBump[0],\n accountInfos[i],\n accountInfos[i].owner,\n )\n : null,\n );\n\n const tokenProgram = accountInfos[0].owner;\n return parsedInfos.map((parsedInfo, i) => {\n if (!parsedInfo) {\n return {\n mint,\n tokenPoolPda: addressesAndBumps[i][0],\n tokenProgram,\n activity: undefined,\n balance: bn(0),\n isInitialized: false,\n poolIndex: i,\n bump: addressesAndBumps[i][1],\n };\n }\n\n return {\n mint,\n tokenPoolPda: parsedInfo.address,\n tokenProgram,\n activity: undefined,\n balance: bn(parsedInfo.amount.toString()),\n isInitialized: true,\n poolIndex: i,\n bump: addressesAndBumps[i][1],\n };\n });\n}\n\nexport type TokenPoolActivity = {\n signature: string;\n amount: BN;\n action: Action;\n};\n\n/**\n * Token pool pda info.\n */\nexport type TokenPoolInfo = {\n /**\n * The mint of the token pool\n */\n mint: PublicKey;\n /**\n * The token pool address\n */\n tokenPoolPda: PublicKey;\n /**\n * The token program of the token pool\n */\n tokenProgram: PublicKey;\n /**\n * count of txs and volume in the past 60 seconds.\n */\n activity?: {\n txs: number;\n amountAdded: BN;\n amountRemoved: BN;\n };\n /**\n * Whether the token pool is initialized\n */\n isInitialized: boolean;\n /**\n * The balance of the token pool\n */\n balance: BN;\n /**\n * The index of the token pool\n */\n poolIndex: number;\n /**\n * The bump used to derive the token pool pda\n */\n bump: number;\n};\n\n/**\n * @internal\n */\nexport enum Action {\n Compress = 1,\n Decompress = 2,\n Transfer = 3,\n}\n\n/**\n * @internal\n */\nconst shuffleArray = <T>(array: T[]): T[] => {\n for (let i = array.length - 1; i > 0; i--) {\n const j = Math.floor(Math.random() * (i + 1));\n [array[i], array[j]] = [array[j], array[i]];\n }\n return array;\n};\n\n/**\n * For `compress` and `mintTo` instructions only.\n * Select a random token pool info from the token pool infos.\n *\n * For `decompress`, use {@link selectTokenPoolInfosForDecompression} instead.\n *\n * @param infos The token pool infos\n *\n * @returns A random token pool info\n */\nexport function selectTokenPoolInfo(infos: TokenPoolInfo[]): TokenPoolInfo {\n const shuffledInfos = shuffleArray(infos);\n\n // filter only infos that are initialized\n const filteredInfos = shuffledInfos.filter(info => info.isInitialized);\n\n if (filteredInfos.length === 0) {\n throw new Error(\n 'Please pass at least one initialized token pool info.',\n );\n }\n\n // Return a single random token pool info\n return filteredInfos[0];\n}\n\n/**\n * Select one or multiple token pool infos from the token pool infos.\n *\n * Use this function for `decompress`.\n *\n * For `compress`, `mintTo` use {@link selectTokenPoolInfo} instead.\n *\n * @param infos The token pool infos\n * @param decompressAmount The amount of tokens to withdraw\n *\n * @returns Array with one or more token pool infos.\n */\nexport function selectTokenPoolInfosForDecompression(\n infos: TokenPoolInfo[],\n decompressAmount: number | BN,\n): TokenPoolInfo[] {\n if (infos.length === 0) {\n throw new Error('Please pass at least one token pool info.');\n }\n\n infos = shuffleArray(infos);\n // Find the first info where balance is 10x the requested amount\n const sufficientBalanceInfo = infos.find(info =>\n info.balance.gte(bn(decompressAmount).mul(bn(10))),\n );\n\n // filter only infos that are initialized\n infos = infos\n .filter(info => info.isInitialized)\n .sort((a, b) => a.poolIndex - b.poolIndex);\n\n const allBalancesZero = infos.every(info => info.balance.isZero());\n if (allBalancesZero) {\n throw new Error(\n 'All provided token pool balances are zero. Please pass recent token pool infos.',\n );\n }\n\n // If none found, return all infos\n return sufficientBalanceInfo ? [sufficientBalanceInfo] : infos;\n}\n","import { bn, ParsedTokenAccount } from '@lightprotocol/stateless.js';\n\nimport BN from 'bn.js';\n\nexport const ERROR_NO_ACCOUNTS_FOUND =\n 'Could not find accounts to select for transfer.';\n\n/**\n * Selects token accounts for approval, first trying to find an exact match, then falling back to minimum selection.\n *\n * @param {ParsedTokenAccount[]} accounts - Token accounts to choose from.\n * @param {BN} approveAmount - Amount to approve.\n * @param {number} [maxInputs=4] - Max accounts to select when falling back to minimum selection.\n * @returns {[\n * selectedAccounts: ParsedTokenAccount[],\n * total: BN,\n * totalLamports: BN | null,\n * maxPossibleAmount: BN\n * ]} - Returns:\n * - selectedAccounts: Accounts chosen for approval.\n * - total: Total amount from selected accounts.\n * - totalLamports: Total lamports from selected accounts.\n * - maxPossibleAmount: Max approvable amount given maxInputs.\n */\nexport function selectTokenAccountsForApprove(\n accounts: ParsedTokenAccount[],\n approveAmount: BN,\n maxInputs: number = 4,\n): [\n selectedAccounts: ParsedTokenAccount[],\n total: BN,\n totalLamports: BN | null,\n maxPossibleAmount: BN,\n] {\n // First try to find an exact match\n const exactMatch = accounts.find(account =>\n account.parsed.amount.eq(approveAmount),\n );\n if (exactMatch) {\n return [\n [exactMatch],\n exactMatch.parsed.amount,\n exactMatch.compressedAccount.lamports,\n exactMatch.parsed.amount,\n ];\n }\n\n // If no exact match, fall back to minimum selection\n return selectMinCompressedTokenAccountsForTransfer(\n accounts,\n approveAmount,\n maxInputs,\n );\n}\n\n/**\n * Selects the minimum number of compressed token accounts required for a\n * decompress instruction, up to a specified maximum.\n *\n * @param {ParsedTokenAccount[]} accounts Token accounts to choose from.\n * @param {BN} amount Amount to decompress.\n * @param {number} [maxInputs=4] Max accounts to select. Default\n * is 4.\n *\n * @returns Returns selected accounts and their totals.\n */\nexport function selectMinCompressedTokenAccountsForDecompression(\n accounts: ParsedTokenAccount[],\n amount: BN,\n maxInputs: number = 4,\n): {\n selectedAccounts: ParsedTokenAccount[];\n total: BN;\n totalLamports: BN | null;\n maxPossibleAmount: BN;\n} {\n const [selectedAccounts, total, totalLamports, maxPossibleAmount] =\n selectMinCompressedTokenAccountsForTransfer(\n accounts,\n amount,\n maxInputs,\n );\n return { selectedAccounts, total, totalLamports, maxPossibleAmount };\n}\n\n/**\n * Selects the minimum number of compressed token accounts required for a\n * transfer or decompression instruction, up to a specified maximum.\n *\n * @param {ParsedTokenAccount[]} accounts Token accounts to choose from.\n * @param {BN} transferAmount Amount to transfer or decompress.\n * @param {number} [maxInputs=4] Max accounts to select. Default\n * is 4.\n *\n * @returns Returns selected accounts and their totals. [\n * selectedAccounts: ParsedTokenAccount[],\n * total: BN,\n * totalLamports: BN | null,\n * maxPossibleAmount: BN\n * ]\n */\nexport function selectMinCompressedTokenAccountsForTransfer(\n accounts: ParsedTokenAccount[],\n transferAmount: BN,\n maxInputs: number = 4,\n): [\n selectedAccounts: ParsedTokenAccount[],\n total: BN,\n totalLamports: BN | null,\n maxPossibleAmount: BN,\n] {\n const [\n selectedAccounts,\n accumulatedAmount,\n accumulatedLamports,\n maxPossibleAmount,\n ] = selectMinCompressedTokenAccountsForTransferOrPartial(\n accounts,\n transferAmount,\n maxInputs,\n );\n\n if (accumulatedAmount.lt(bn(transferAmount))) {\n const totalBalance = accounts.reduce(\n (acc, account) => acc.add(account.parsed.amount),\n bn(0),\n );\n if (selectedAccounts.length >= maxInputs) {\n throw new Error(\n `Account limit exceeded: max ${maxPossibleAmount.toString()} (${maxInputs} accounts) per transaction. Total balance: ${totalBalance.toString()} (${accounts.length} accounts). Consider multiple transfers to spend full balance.`,\n );\n } else {\n throw new Error(\n `Insufficient balance for transfer. Required: ${transferAmount.toString()}, available: ${totalBalance.toString()}.`,\n );\n }\n }\n\n if (selectedAccounts.length === 0) {\n throw new Error(ERROR_NO_ACCOUNTS_FOUND);\n }\n\n return [\n selectedAccounts,\n accumulatedAmount,\n accumulatedLamports,\n maxPossibleAmount,\n ];\n}\n\n/**\n * Executes {@link selectMinCompressedTokenAccountsForTransfer} strategy,\n * returns partial amounts if insufficient accounts are found instead of\n * throwing an error.\n */\nexport function selectMinCompressedTokenAccountsForTransferOrPartial(\n accounts: ParsedTokenAccount[],\n transferAmount: BN,\n maxInputs: number = 4,\n): [\n selectedAccounts: ParsedTokenAccount[],\n total: BN,\n totalLamports: BN | null,\n maxPossibleAmount: BN,\n] {\n if (accounts.length === 0) {\n throw new Error(ERROR_NO_ACCOUNTS_FOUND);\n }\n\n let accumulatedAmount = bn(0);\n let accumulatedLamports = bn(0);\n let maxPossibleAmount = bn(0);\n\n const selectedAccounts: ParsedTokenAccount[] = [];\n\n accounts.sort((a, b) => b.parsed.amount.cmp(a.parsed.amount));\n\n for (const account of accounts) {\n if (selectedAccounts.length >= maxInputs) break;\n if (accumulatedAmount.gte(bn(transferAmount))) break;\n\n if (\n !account.parsed.amount.isZero() ||\n !account.compressedAccount.lamports.isZero()\n ) {\n accumulatedAmount = accumulatedAmount.add(account.parsed.amount);\n accumulatedLamports = accumulatedLamports.add(\n account.compressedAccount.lamports,\n );\n selectedAccounts.push(account);\n }\n }\n\n // Max, considering maxInputs\n maxPossibleAmount = accounts\n .slice(0, maxInputs)\n .reduce((total, account) => total.add(account.parsed.amount), bn(0));\n\n if (accumulatedAmount.lt(bn(transferAmount))) {\n console.log(\n `Insufficient balance for transfer. Requested: ${transferAmount.toString()}, Returns max available: ${maxPossibleAmount.toString()}.`,\n );\n }\n\n if (selectedAccounts.length === 0) {\n throw new Error(ERROR_NO_ACCOUNTS_FOUND);\n }\n\n return [\n selectedAccounts,\n accumulatedAmount,\n accumulatedLamports,\n maxPossibleAmount,\n ];\n}\n\n/**\n * Selects compressed token accounts for a transfer, ensuring one extra account\n * if possible, up to maxInputs.\n *\n * 1. Sorts accounts by amount (desc)\n * 2. Selects accounts until transfer amount is met or maxInputs is reached,\n * attempting to add one extra account if possible.\n *\n * @param {ParsedTokenAccount[]} accounts - The list of token accounts to select from.\n * @param {BN} transferAmount - The token amount to be transferred.\n * @param {number} [maxInputs=4] - The maximum number of accounts to select. Default: 4.\n * @returns {[\n * selectedAccounts: ParsedTokenAccount[],\n * total: BN,\n * totalLamports: BN | null,\n * maxPossibleAmount: BN\n * ]} - An array containing:\n * - selectedAccounts: The accounts selected for the transfer.\n * - total: The total amount accumulated from the selected accounts.\n * - totalLamports: The total lamports accumulated from the selected accounts.\n * - maxPossibleAmount: The maximum possible amount that can be transferred considering maxInputs.\n *\n * @example\n * const accounts = [\n * { parsed: { amount: new BN(100) }, compressedAccount: { lamports: new BN(10) } },\n * { parsed: { amount: new BN(50) }, compressedAccount: { lamports: new BN(5) } },\n * { parsed: { amount: new BN(25) }, compressedAccount: { lamports: new BN(2) } },\n * ];\n * const transferAmount = new BN(75);\n * const maxInputs = 2;\n *\n * const [selectedAccounts, total, totalLamports, maxPossibleAmount] =\n * selectSmartCompressedTokenAccountsForTransfer(accounts, transferAmount, maxInputs);\n *\n * console.log(selectedAccounts.length); // 2\n * console.log(total.toString()); // '150'\n * console.log(totalLamports!.toString()); // '15'\n * console.log(maxPossibleAmount.toString()); // '150'\n */\nexport function selectSmartCompressedTokenAccountsForTransfer(\n accounts: ParsedTokenAccount[],\n transferAmount: BN,\n maxInputs: number = 4,\n): [\n selectedAccounts: ParsedTokenAccount[],\n total: BN,\n totalLamports: BN | null,\n maxPossibleAmount: BN,\n] {\n const [\n selectedAccounts,\n accumulatedAmount,\n accumulatedLamports,\n maxPossibleAmount,\n ] = selectSmartCompressedTokenAccountsForTransferOrPartial(\n accounts,\n transferAmount,\n maxInputs,\n );\n\n if (accumulatedAmount.lt(bn(transferAmount))) {\n const totalBalance = accounts.reduce(\n (acc, account) => acc.add(account.parsed.amount),\n bn(0),\n );\n if (selectedAccounts.length >= maxInputs) {\n throw new Error(\n `Account limit exceeded: max ${maxPossibleAmount.toString()} (${maxInputs} accounts) per transaction. Total balance: ${totalBalance.toString()} (${accounts.length} accounts). Consider multiple transfers to spend full balance.`,\n );\n } else {\n throw new Error(\n `Insufficient balance. Required: ${transferAmount.toString()}, available: ${totalBalance.toString()}.`,\n );\n }\n }\n\n if (selectedAccounts.length === 0) {\n throw new Error(ERROR_NO_ACCOUNTS_FOUND);\n }\n\n return [\n selectedAccounts,\n accumulatedAmount,\n accumulatedLamports,\n maxPossibleAmount,\n ];\n}\n\n/**\n * Executes {@link selectMinCompressedTokenAccountsForTransfer} strategy,\n * returns partial amounts if insufficient accounts are found instead of\n * throwing an error.\n */\nexport function selectSmartCompressedTokenAccountsForTransferOrPartial(\n accounts: ParsedTokenAccount[],\n transferAmount: BN,\n maxInputs: number = 4,\n): [\n selectedAccounts: ParsedTokenAccount[],\n total: BN,\n totalLamports: BN | null,\n maxPossibleAmount: BN,\n] {\n if (accounts.length === 0) {\n throw new Error(ERROR_NO_ACCOUNTS_FOUND);\n }\n\n let accumulatedAmount = bn(0);\n let accumulatedLamports = bn(0);\n\n const selectedAccounts: ParsedTokenAccount[] = [];\n\n // we can ignore zero value accounts.\n const nonZeroAccounts = accounts.filter(\n account =>\n !account.parsed.amount.isZero() ||\n !account.compressedAccount.lamports.isZero(),\n );\n\n nonZeroAccounts.sort((a, b) => b.parsed.amount.cmp(a.parsed.amount));\n\n for (const account of nonZeroAccounts) {\n if (selectedAccounts.length >= maxInputs) break;\n accumulatedAmount = accumulatedAmount.add(account.parsed.amount);\n accumulatedLamports = accumulatedLamports.add(\n account.compressedAccount.lamports,\n );\n selectedAccounts.push(account);\n\n if (accumulatedAmount.gte(bn(transferAmount))) {\n // Select smallest additional account if maxInputs not reached\n const remainingAccounts = nonZeroAccounts.slice(\n selectedAccounts.length,\n );\n if (remainingAccounts.length > 0) {\n const smallestAccount = remainingAccounts.reduce((min, acc) =>\n acc.parsed.amount.lt(min.parsed.amount) ? acc : min,\n );\n if (selectedAccounts.length < maxInputs) {\n selectedAccounts.push(smallestAccount);\n accumulatedAmount = accumulatedAmount.add(\n smallestAccount.parsed.amount,\n );\n accumulatedLamports = accumulatedLamports.add(\n smallestAccount.compressedAccount.lamports,\n );\n }\n }\n break;\n }\n }\n\n const maxPossibleAmount = nonZeroAccounts\n .slice(0, maxInputs)\n .reduce((max, account) => max.add(account.parsed.amount), bn(0));\n\n if (selectedAccounts.length === 0) {\n throw new Error(ERROR_NO_ACCOUNTS_FOUND);\n }\n\n return [\n selectedAccounts,\n accumulatedAmount,\n accumulatedLamports,\n maxPossibleAmount,\n ];\n}\n","import {\n ParsedTokenAccount,\n InputTokenDataWithContext,\n getIndexOrAdd,\n bn,\n padOutputStateMerkleTrees,\n TreeType,\n featureFlags,\n TreeInfo,\n} from '@lightprotocol/stateless.js';\nimport { PublicKey, AccountMeta } from '@solana/web3.js';\nimport {\n PackedTokenTransferOutputData,\n TokenTransferOutputData,\n} from '../types';\n\nexport type PackCompressedTokenAccountsParams = {\n /** Input state to be consumed */\n inputCompressedTokenAccounts: ParsedTokenAccount[];\n /**\n * State trees that the output should be inserted into. Defaults to the 0th\n * state tree of the input state. Gets padded to the length of\n * outputCompressedAccounts.\n */\n outputStateTreeInfo?: TreeInfo;\n /** Optional remaining accounts to append to */\n remainingAccounts?: PublicKey[];\n /**\n * Root indices that are used on-chain to fetch the correct root\n * from the state Merkle tree account for validity proof verification.\n */\n rootIndices: number[];\n tokenTransferOutputs: TokenTransferOutputData[];\n};\n\n/**\n * Packs Compressed Token Accounts.\n */\nexport function packCompressedTokenAccounts(\n params: PackCompressedTokenAccountsParams,\n): {\n inputTokenDataWithContext: InputTokenDataWithContext[];\n remainingAccountMetas: AccountMeta[];\n packedOutputTokenData: PackedTokenTransferOutputData[];\n} {\n const {\n inputCompressedTokenAccounts,\n outputStateTreeInfo,\n remainingAccounts = [],\n rootIndices,\n tokenTransferOutputs,\n } = params;\n\n const _remainingAccounts = remainingAccounts.slice();\n let delegateIndex: number | null = null;\n\n if (\n inputCompressedTokenAccounts.length > 0 &&\n inputCompressedTokenAccounts[0].parsed.delegate\n ) {\n delegateIndex = getIndexOrAdd(\n _remainingAccounts,\n inputCompressedTokenAccounts[0].parsed.delegate,\n );\n }\n\n const packedInputTokenData: InputTokenDataWithContext[] = [];\n /// pack inputs\n inputCompressedTokenAccounts.forEach(\n (account: ParsedTokenAccount, index) => {\n const merkleTreePubkeyIndex = getIndexOrAdd(\n _remainingAccounts,\n account.compressedAccount.treeInfo.tree,\n );\n\n const queuePubkeyIndex = getIndexOrAdd(\n _remainingAccounts,\n account.compressedAccount.treeInfo.queue,\n );\n\n packedInputTokenData.push({\n amount: account.parsed.amount,\n delegateIndex,\n merkleContext: {\n merkleTreePubkeyIndex,\n queuePubkeyIndex,\n leafIndex: account.compressedAccount.leafIndex,\n proveByIndex: account.compressedAccount.proveByIndex,\n },\n rootIndex: rootIndices[index],\n lamports: account.compressedAccount.lamports.eq(bn(0))\n ? null\n : account.compressedAccount.lamports,\n tlv: null,\n });\n },\n );\n\n if (inputCompressedTokenAccounts.length > 0 && outputStateTreeInfo) {\n throw new Error(\n 'Cannot specify both input accounts and outputStateTreeInfo',\n );\n }\n\n let treeInfo: TreeInfo;\n if (inputCompressedTokenAccounts.length > 0) {\n treeInfo = inputCompressedTokenAccounts[0].compressedAccount.treeInfo;\n } else if (outputStateTreeInfo) {\n treeInfo = outputStateTreeInfo;\n } else {\n throw new Error(\n 'Neither input accounts nor outputStateTreeInfo are available',\n );\n }\n\n // Use next tree if available, otherwise fall back to current tree.\n // `nextTreeInfo` always takes precedence.\n const activeTreeInfo = treeInfo.nextTreeInfo || treeInfo;\n let activeTreeOrQueue = activeTreeInfo.tree;\n\n if (activeTreeInfo.treeType === TreeType.StateV2) {\n if (featureFlags.isV2()) {\n activeTreeOrQueue = activeTreeInfo.queue;\n } else throw new Error('V2 trees are not supported yet');\n }\n\n // Pack output state trees\n const paddedOutputStateMerkleTrees = padOutputStateMerkleTrees(\n activeTreeOrQueue,\n tokenTransferOutputs.length,\n );\n const packedOutputTokenData: PackedTokenTransferOutputData[] = [];\n paddedOutputStateMerkleTrees.forEach((account, index) => {\n const merkleTreeIndex = getIndexOrAdd(_remainingAccounts, account);\n packedOutputTokenData.push({\n owner: tokenTransferOutputs[index].owner,\n amount: tokenTransferOutputs[index].amount,\n lamports: tokenTransferOutputs[index].lamports?.eq(bn(0))\n ? null\n : tokenTransferOutputs[index].lamports,\n merkleTreeIndex,\n tlv: null,\n });\n });\n // to meta\n const remainingAccountMetas = _remainingAccounts.map(\n (account): AccountMeta => ({\n pubkey: account,\n isWritable: true,\n isSigner: false,\n }),\n );\n\n return {\n inputTokenDataWithContext: packedInputTokenData,\n remainingAccountMetas,\n packedOutputTokenData,\n };\n}\n","import { ParsedTokenAccount } from '@lightprotocol/stateless.js';\nimport { PublicKey } from '@solana/web3.js';\n\n/**\n * Check if all input accounts belong to the same mint.\n *\n * @param compressedTokenAccounts The compressed token accounts\n * @param mint The mint of the token pool\n * @returns True if all input accounts belong to the same mint\n */\nexport function checkMint(\n compressedTokenAccounts: ParsedTokenAccount[],\n mint: PublicKey,\n): boolean {\n if (\n !compressedTokenAccounts.every(account =>\n account.parsed.mint.equals(mint),\n )\n ) {\n throw new Error(`All input accounts must belong to the same mint`);\n }\n\n return true;\n}\n","/* The MIT License (MIT)\n *\n * Copyright 2015-2018 Peter A. Bigot\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in\n * all copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n * THE SOFTWARE.\n */\n\n/**\n * Support for translating between Buffer instances and JavaScript\n * native types.\n *\n * {@link module:Layout~Layout|Layout} is the basis of a class\n * hierarchy that associates property names with sequences of encoded\n * bytes.\n *\n * Layouts are supported for these scalar (numeric) types:\n * * {@link module:Layout~UInt|Unsigned integers in little-endian\n * format} with {@link module:Layout.u8|8-bit}, {@link\n * module:Layout.u16|16-bit}, {@link module:Layout.u24|24-bit},\n * {@link module:Layout.u32|32-bit}, {@link\n * module:Layout.u40|40-bit}, and {@link module:Layout.u48|48-bit}\n * representation ranges;\n * * {@link module:Layout~UIntBE|Unsigned integers in big-endian\n * format} with {@link module:Layout.u16be|16-bit}, {@link\n * module:Layout.u24be|24-bit}, {@link module:Layout.u32be|32-bit},\n * {@link module:Layout.u40be|40-bit}, and {@link\n * module:Layout.u48be|48-bit} representation ranges;\n * * {@link module:Layout~Int|Signed integers in little-endian\n * format} with {@link module:Layout.s8|8-bit}, {@link\n * module:Layout.s16|16-bit}, {@link module:Layout.s24|24-bit},\n * {@link module:Layout.s32|32-bit}, {@link\n * module:Layout.s40|40-bit}, and {@link module:Layout.s48|48-bit}\n * representation ranges;\n * * {@link module:Layout~IntBE|Signed integers in big-endian format}\n * with {@link module:Layout.s16be|16-bit}, {@link\n * module:Layout.s24be|24-bit}, {@link module:Layout.s32be|32-bit},\n * {@link module:Layout.s40be|40-bit}, and {@link\n * module:Layout.s48be|48-bit} representation ranges;\n * * 64-bit integral values that decode to an exact (if magnitude is\n * less than 2^53) or nearby integral Number in {@link\n * module:Layout.nu64|unsigned little-endian}, {@link\n * module:Layout.nu64be|unsigned big-endian}, {@link\n * module:Layout.ns64|signed little-endian}, and {@link\n * module:Layout.ns64be|unsigned big-endian} encodings;\n * * 32-bit floating point values with {@link\n * module:Layout.f32|little-endian} and {@link\n * module:Layout.f32be|big-endian} representations;\n * * 64-bit floating point values with {@link\n * module:Layout.f64|little-endian} and {@link\n * module:Layout.f64be|big-endian} representations;\n * * {@link module:Layout.const|Constants} that take no space in the\n * encoded expression.\n *\n * and for these aggregate types:\n * * {@link module:Layout.seq|Sequence}s of instances of a {@link\n * module:Layout~Layout|Layout}, with JavaScript representation as\n * an Array and constant or data-dependent {@link\n * module:Layout~Sequence#count|length};\n * * {@link module:Layout.struct|Structure}s that aggregate a\n * heterogeneous sequence of {@link module:Layout~Layout|Layout}\n * instances, with JavaScript representation as an Object;\n * * {@link module:Layout.union|Union}s that support multiple {@link\n * module:Layout~VariantLayout|variant layouts} over a fixed\n * (padded) or variable (not padded) span of bytes, using an\n * unsigned integer at the start of the data or a separate {@link\n * module:Layout.unionLayoutDiscriminator|layout element} to\n * determine which layout to use when interpreting the buffer\n * contents;\n * * {@link module:Layout.bits|BitStructure}s that contain a sequence\n * of individual {@link\n * module:Layout~BitStructure#addField|BitField}s packed into an 8,\n * 16, 24, or 32-bit unsigned integer starting at the least- or\n * most-significant bit;\n * * {@link module:Layout.cstr|C strings} of varying length;\n * * {@link module:Layout.blob|Blobs} of fixed- or variable-{@link\n * module:Layout~Blob#length|length} raw data.\n *\n * All {@link module:Layout~Layout|Layout} instances are immutable\n * after construction, to prevent internal state from becoming\n * inconsistent.\n *\n * @local Layout\n * @local ExternalLayout\n * @local GreedyCount\n * @local OffsetLayout\n * @local UInt\n * @local UIntBE\n * @local Int\n * @local IntBE\n * @local NearUInt64\n * @local NearUInt64BE\n * @local NearInt64\n * @local NearInt64BE\n * @local Float\n * @local FloatBE\n * @local Double\n * @local DoubleBE\n * @local Sequence\n * @local Structure\n * @local UnionDiscriminator\n * @local UnionLayoutDiscriminator\n * @local Union\n * @local VariantLayout\n * @local BitStructure\n * @local BitField\n * @local Boolean\n * @local Blob\n * @local CString\n * @local Constant\n * @local bindConstructorLayout\n * @module Layout\n * @license MIT\n * @author Peter A. Bigot\n * @see {@link https://github.com/pabigot/buffer-layout|buffer-layout on GitHub}\n */\n\n'use strict';\n\n/**\n * Base class for layout objects.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * Layout#encode|encode} or {@link Layout#decode|decode} functions.\n *\n * @param {Number} span - Initializer for {@link Layout#span|span}. The\n * parameter must be an integer; a negative value signifies that the\n * span is {@link Layout#getSpan|value-specific}.\n *\n * @param {string} [property] - Initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n */\nclass Layout {\n constructor(span, property) {\n if (!Number.isInteger(span)) {\n throw new TypeError('span must be an integer');\n }\n\n /** The span of the layout in bytes.\n *\n * Positive values are generally expected.\n *\n * Zero will only appear in {@link Constant}s and in {@link\n * Sequence}s where the {@link Sequence#count|count} is zero.\n *\n * A negative value indicates that the span is value-specific, and\n * must be obtained using {@link Layout#getSpan|getSpan}. */\n this.span = span;\n\n /** The property name used when this layout is represented in an\n * Object.\n *\n * Used only for layouts that {@link Layout#decode|decode} to Object\n * instances. If left undefined the span of the unnamed layout will\n * be treated as padding: it will not be mutated by {@link\n * Layout#encode|encode} nor represented as a property in the\n * decoded Object. */\n this.property = property;\n }\n\n /** Function to create an Object into which decoded properties will\n * be written.\n *\n * Used only for layouts that {@link Layout#decode|decode} to Object\n * instances, which means:\n * * {@link Structure}\n * * {@link Union}\n * * {@link VariantLayout}\n * * {@link BitStructure}\n *\n * If left undefined the JavaScript representation of these layouts\n * will be Object instances.\n *\n * See {@link bindConstructorLayout}.\n */\n makeDestinationObject() {\n return {};\n }\n\n /**\n * Decode from a Buffer into an JavaScript value.\n *\n * @param {Buffer} b - the buffer from which encoded data is read.\n *\n * @param {Number} [offset] - the offset at which the encoded data\n * starts. If absent a zero offset is inferred.\n *\n * @returns {(Number|Array|Object)} - the value of the decoded data.\n *\n * @abstract\n */\n decode(b, offset) {\n throw new Error('Layout is abstract');\n }\n\n /**\n * Encode a JavaScript value into a Buffer.\n *\n * @param {(Number|Array|Object)} src - the value to be encoded into\n * the buffer. The type accepted depends on the (sub-)type of {@link\n * Layout}.\n *\n * @param {Buffer} b - the buffer into which encoded data will be\n * written.\n *\n * @param {Number} [offset] - the offset at which the encoded data\n * starts. If absent a zero offset is inferred.\n *\n * @returns {Number} - the number of bytes encoded, including the\n * space skipped for internal padding, but excluding data such as\n * {@link Sequence#count|lengths} when stored {@link\n * ExternalLayout|externally}. This is the adjustment to `offset`\n * producing the offset where data for the next layout would be\n * written.\n *\n * @abstract\n */\n encode(src, b, offset) {\n throw new Error('Layout is abstract');\n }\n\n /**\n * Calculate the span of a specific instance of a layout.\n *\n * @param {Buffer} b - the buffer that contains an encoded instance.\n *\n * @param {Number} [offset] - the offset at which the encoded instance\n * starts. If absent a zero offset is inferred.\n *\n * @return {Number} - the number of bytes covered by the layout\n * instance. If this method is not overridden in a subclass the\n * definition-time constant {@link Layout#span|span} will be\n * returned.\n *\n * @throws {RangeError} - if the length of the value cannot be\n * determined.\n */\n getSpan(b, offset) {\n if (0 > this.span) {\n throw new RangeError('indeterminate span');\n }\n return this.span;\n }\n\n /**\n * Replicate the layout using a new property.\n *\n * This function must be used to get a structurally-equivalent layout\n * with a different name since all {@link Layout} instances are\n * immutable.\n *\n * **NOTE** This is a shallow copy. All fields except {@link\n * Layout#property|property} are strictly equal to the origin layout.\n *\n * @param {String} property - the value for {@link\n * Layout#property|property} in the replica.\n *\n * @returns {Layout} - the copy with {@link Layout#property|property}\n * set to `property`.\n */\n replicate(property) {\n const rv = Object.create(this.constructor.prototype);\n Object.assign(rv, this);\n rv.property = property;\n return rv;\n }\n\n /**\n * Create an object from layout properties and an array of values.\n *\n * **NOTE** This function returns `undefined` if invoked on a layout\n * that does not return its value as an Object. Objects are\n * returned for things that are a {@link Structure}, which includes\n * {@link VariantLayout|variant layouts} if they are structures, and\n * excludes {@link Union}s. If you want this feature for a union\n * you must use {@link Union.getVariant|getVariant} to select the\n * desired layout.\n *\n * @param {Array} values - an array of values that correspond to the\n * default order for properties. As with {@link Layout#decode|decode}\n * layout elements that have no property name are skipped when\n * iterating over the array values. Only the top-level properties are\n * assigned; arguments are not assigned to properties of contained\n * layouts. Any unused values are ignored.\n *\n * @return {(Object|undefined)}\n */\n fromArray(values) {\n return undefined;\n }\n}\nexports.Layout = Layout;\n\n/* Provide text that carries a name (such as for a function that will\n * be throwing an error) annotated with the property of a given layout\n * (such as one for which the value was unacceptable).\n *\n * @ignore */\nfunction nameWithProperty(name, lo) {\n if (lo.property) {\n return name + '[' + lo.property + ']';\n }\n return name;\n}\nexports.nameWithProperty = nameWithProperty;\n\n/**\n * Augment a class so that instances can be encoded/decoded using a\n * given layout.\n *\n * Calling this function couples `Class` with `layout` in several ways:\n *\n * * `Class.layout_` becomes a static member property equal to `layout`;\n * * `layout.boundConstructor_` becomes a static member property equal\n * to `Class`;\n * * The {@link Layout#makeDestinationObject|makeDestinationObject()}\n * property of `layout` is set to a function that returns a `new\n * Class()`;\n * * `Class.decode(b, offset)` becomes a static member function that\n * delegates to {@link Layout#decode|layout.decode}. The\n * synthesized function may be captured and extended.\n * * `Class.prototype.encode(b, offset)` provides an instance member\n * function that delegates to {@link Layout#encode|layout.encode}\n * with `src` set to `this`. The synthesized function may be\n * captured and extended, but when the extension is invoked `this`\n * must be explicitly bound to the instance.\n *\n * @param {class} Class - a JavaScript class with a nullary\n * constructor.\n *\n * @param {Layout} layout - the {@link Layout} instance used to encode\n * instances of `Class`.\n */\nfunction bindConstructorLayout(Class, layout) {\n if ('function' !== typeof Class) {\n throw new TypeError('Class must be constructor');\n }\n if (Class.hasOwnProperty('layout_')) {\n throw new Error('Class is already bound to a layout');\n }\n if (!(layout && (layout instanceof Layout))) {\n throw new TypeError('layout must be a Layout');\n }\n if (layout.hasOwnProperty('boundConstructor_')) {\n throw new Error('layout is already bound to a constructor');\n }\n Class.layout_ = layout;\n layout.boundConstructor_ = Class;\n layout.makeDestinationObject = (() => new Class());\n Object.defineProperty(Class.prototype, 'encode', {\n value: function(b, offset) {\n return layout.encode(this, b, offset);\n },\n writable: true,\n });\n Object.defineProperty(Class, 'decode', {\n value: function(b, offset) {\n return layout.decode(b, offset);\n },\n writable: true,\n });\n}\nexports.bindConstructorLayout = bindConstructorLayout;\n\n/**\n * An object that behaves like a layout but does not consume space\n * within its containing layout.\n *\n * This is primarily used to obtain metadata about a member, such as a\n * {@link OffsetLayout} that can provide data about a {@link\n * Layout#getSpan|value-specific span}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support {@link\n * ExternalLayout#isCount|isCount} or other {@link Layout} functions.\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @abstract\n * @augments {Layout}\n */\nclass ExternalLayout extends Layout {\n /**\n * Return `true` iff the external layout decodes to an unsigned\n * integer layout.\n *\n * In that case it can be used as the source of {@link\n * Sequence#count|Sequence counts}, {@link Blob#length|Blob lengths},\n * or as {@link UnionLayoutDiscriminator#layout|external union\n * discriminators}.\n *\n * @abstract\n */\n isCount() {\n throw new Error('ExternalLayout is abstract');\n }\n}\n\n/**\n * An {@link ExternalLayout} that determines its {@link\n * Layout#decode|value} based on offset into and length of the buffer\n * on which it is invoked.\n *\n * *Factory*: {@link module:Layout.greedy|greedy}\n *\n * @param {Number} [elementSpan] - initializer for {@link\n * GreedyCount#elementSpan|elementSpan}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {ExternalLayout}\n */\nclass GreedyCount extends ExternalLayout {\n constructor(elementSpan, property) {\n if (undefined === elementSpan) {\n elementSpan = 1;\n }\n if ((!Number.isInteger(elementSpan)) || (0 >= elementSpan)) {\n throw new TypeError('elementSpan must be a (positive) integer');\n }\n super(-1, property);\n\n /** The layout for individual elements of the sequence. The value\n * must be a positive integer. If not provided, the value will be\n * 1. */\n this.elementSpan = elementSpan;\n }\n\n /** @override */\n isCount() {\n return true;\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const rem = b.length - offset;\n return Math.floor(rem / this.elementSpan);\n }\n\n /** @override */\n encode(src, b, offset) {\n return 0;\n }\n}\n\n/**\n * An {@link ExternalLayout} that supports accessing a {@link Layout}\n * at a fixed offset from the start of another Layout. The offset may\n * be before, within, or after the base layout.\n *\n * *Factory*: {@link module:Layout.offset|offset}\n *\n * @param {Layout} layout - initializer for {@link\n * OffsetLayout#layout|layout}, modulo `property`.\n *\n * @param {Number} [offset] - Initializes {@link\n * OffsetLayout#offset|offset}. Defaults to zero.\n *\n * @param {string} [property] - Optional new property name for a\n * {@link Layout#replicate| replica} of `layout` to be used as {@link\n * OffsetLayout#layout|layout}. If not provided the `layout` is used\n * unchanged.\n *\n * @augments {Layout}\n */\nclass OffsetLayout extends ExternalLayout {\n constructor(layout, offset, property) {\n if (!(layout instanceof Layout)) {\n throw new TypeError('layout must be a Layout');\n }\n\n if (undefined === offset) {\n offset = 0;\n } else if (!Number.isInteger(offset)) {\n throw new TypeError('offset must be integer or undefined');\n }\n\n super(layout.span, property || layout.property);\n\n /** The subordinated layout. */\n this.layout = layout;\n\n /** The location of {@link OffsetLayout#layout} relative to the\n * start of another layout.\n *\n * The value may be positive or negative, but an error will thrown\n * if at the point of use it goes outside the span of the Buffer\n * being accessed. */\n this.offset = offset;\n }\n\n /** @override */\n isCount() {\n return ((this.layout instanceof UInt)\n || (this.layout instanceof UIntBE));\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return this.layout.decode(b, offset + this.offset);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return this.layout.encode(src, b, offset + this.offset);\n }\n}\n\n/**\n * Represent an unsigned integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.u8|u8}, {@link\n * module:Layout.u16|u16}, {@link module:Layout.u24|u24}, {@link\n * module:Layout.u32|u32}, {@link module:Layout.u40|u40}, {@link\n * module:Layout.u48|u48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UInt extends Layout {\n constructor(span, property) {\n super(span, property);\n if (6 < this.span) {\n throw new RangeError('span must not exceed 6 bytes');\n }\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return b.readUIntLE(offset, this.span);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n b.writeUIntLE(src, offset, this.span);\n return this.span;\n }\n}\n\n/**\n * Represent an unsigned integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.u8be|u8be}, {@link\n * module:Layout.u16be|u16be}, {@link module:Layout.u24be|u24be},\n * {@link module:Layout.u32be|u32be}, {@link\n * module:Layout.u40be|u40be}, {@link module:Layout.u48be|u48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UIntBE extends Layout {\n constructor(span, property) {\n super( span, property);\n if (6 < this.span) {\n throw new RangeError('span must not exceed 6 bytes');\n }\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return b.readUIntBE(offset, this.span);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n b.writeUIntBE(src, offset, this.span);\n return this.span;\n }\n}\n\n/**\n * Represent a signed integer in little-endian format.\n *\n * *Factory*: {@link module:Layout.s8|s8}, {@link\n * module:Layout.s16|s16}, {@link module:Layout.s24|s24}, {@link\n * module:Layout.s32|s32}, {@link module:Layout.s40|s40}, {@link\n * module:Layout.s48|s48}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Int extends Layout {\n constructor(span, property) {\n super(span, property);\n if (6 < this.span) {\n throw new RangeError('span must not exceed 6 bytes');\n }\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return b.readIntLE(offset, this.span);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n b.writeIntLE(src, offset, this.span);\n return this.span;\n }\n}\n\n/**\n * Represent a signed integer in big-endian format.\n *\n * *Factory*: {@link module:Layout.s8be|s8be}, {@link\n * module:Layout.s16be|s16be}, {@link module:Layout.s24be|s24be},\n * {@link module:Layout.s32be|s32be}, {@link\n * module:Layout.s40be|s40be}, {@link module:Layout.s48be|s48be}\n *\n * @param {Number} span - initializer for {@link Layout#span|span}.\n * The parameter can range from 1 through 6.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass IntBE extends Layout {\n constructor(span, property) {\n super(span, property);\n if (6 < this.span) {\n throw new RangeError('span must not exceed 6 bytes');\n }\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return b.readIntBE(offset, this.span);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n b.writeIntBE(src, offset, this.span);\n return this.span;\n }\n}\n\nconst V2E32 = Math.pow(2, 32);\n\n/* True modulus high and low 32-bit words, where low word is always\n * non-negative. */\nfunction divmodInt64(src) {\n const hi32 = Math.floor(src / V2E32);\n const lo32 = src - (hi32 * V2E32);\n return {hi32, lo32};\n}\n/* Reconstruct Number from quotient and non-negative remainder */\nfunction roundedInt64(hi32, lo32) {\n return hi32 * V2E32 + lo32;\n}\n\n/**\n * Represent an unsigned 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64|nu64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64 extends Layout {\n constructor(property) {\n super(8, property);\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const lo32 = b.readUInt32LE(offset);\n const hi32 = b.readUInt32LE(offset + 4);\n return roundedInt64(hi32, lo32);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const split = divmodInt64(src);\n b.writeUInt32LE(split.lo32, offset);\n b.writeUInt32LE(split.hi32, offset + 4);\n return 8;\n }\n}\n\n/**\n * Represent an unsigned 64-bit integer in big-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.nu64be|nu64be}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearUInt64BE extends Layout {\n constructor(property) {\n super(8, property);\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const hi32 = b.readUInt32BE(offset);\n const lo32 = b.readUInt32BE(offset + 4);\n return roundedInt64(hi32, lo32);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const split = divmodInt64(src);\n b.writeUInt32BE(split.hi32, offset);\n b.writeUInt32BE(split.lo32, offset + 4);\n return 8;\n }\n}\n\n/**\n * Represent a signed 64-bit integer in little-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64|ns64}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64 extends Layout {\n constructor(property) {\n super(8, property);\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const lo32 = b.readUInt32LE(offset);\n const hi32 = b.readInt32LE(offset + 4);\n return roundedInt64(hi32, lo32);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const split = divmodInt64(src);\n b.writeUInt32LE(split.lo32, offset);\n b.writeInt32LE(split.hi32, offset + 4);\n return 8;\n }\n}\n\n/**\n * Represent a signed 64-bit integer in big-endian format when\n * encoded and as a near integral JavaScript Number when decoded.\n *\n * *Factory*: {@link module:Layout.ns64be|ns64be}\n *\n * **NOTE** Values with magnitude greater than 2^52 may not decode to\n * the exact value of the encoded representation.\n *\n * @augments {Layout}\n */\nclass NearInt64BE extends Layout {\n constructor(property) {\n super(8, property);\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const hi32 = b.readInt32BE(offset);\n const lo32 = b.readUInt32BE(offset + 4);\n return roundedInt64(hi32, lo32);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const split = divmodInt64(src);\n b.writeInt32BE(split.hi32, offset);\n b.writeUInt32BE(split.lo32, offset + 4);\n return 8;\n }\n}\n\n/**\n * Represent a 32-bit floating point number in little-endian format.\n *\n * *Factory*: {@link module:Layout.f32|f32}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Float extends Layout {\n constructor(property) {\n super(4, property);\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return b.readFloatLE(offset);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n b.writeFloatLE(src, offset);\n return 4;\n }\n}\n\n/**\n * Represent a 32-bit floating point number in big-endian format.\n *\n * *Factory*: {@link module:Layout.f32be|f32be}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass FloatBE extends Layout {\n constructor(property) {\n super(4, property);\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return b.readFloatBE(offset);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n b.writeFloatBE(src, offset);\n return 4;\n }\n}\n\n/**\n * Represent a 64-bit floating point number in little-endian format.\n *\n * *Factory*: {@link module:Layout.f64|f64}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Double extends Layout {\n constructor(property) {\n super(8, property);\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return b.readDoubleLE(offset);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n b.writeDoubleLE(src, offset);\n return 8;\n }\n}\n\n/**\n * Represent a 64-bit floating point number in big-endian format.\n *\n * *Factory*: {@link module:Layout.f64be|f64be}\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass DoubleBE extends Layout {\n constructor(property) {\n super(8, property);\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n return b.readDoubleBE(offset);\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n b.writeDoubleBE(src, offset);\n return 8;\n }\n}\n\n/**\n * Represent a contiguous sequence of a specific layout as an Array.\n *\n * *Factory*: {@link module:Layout.seq|seq}\n *\n * @param {Layout} elementLayout - initializer for {@link\n * Sequence#elementLayout|elementLayout}.\n *\n * @param {(Number|ExternalLayout)} count - initializer for {@link\n * Sequence#count|count}. The parameter must be either a positive\n * integer or an instance of {@link ExternalLayout}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Sequence extends Layout {\n constructor(elementLayout, count, property) {\n if (!(elementLayout instanceof Layout)) {\n throw new TypeError('elementLayout must be a Layout');\n }\n if (!(((count instanceof ExternalLayout) && count.isCount())\n || (Number.isInteger(count) && (0 <= count)))) {\n throw new TypeError('count must be non-negative integer '\n + 'or an unsigned integer ExternalLayout');\n }\n let span = -1;\n if ((!(count instanceof ExternalLayout))\n && (0 < elementLayout.span)) {\n span = count * elementLayout.span;\n }\n\n super(span, property);\n\n /** The layout for individual elements of the sequence. */\n this.elementLayout = elementLayout;\n\n /** The number of elements in the sequence.\n *\n * This will be either a non-negative integer or an instance of\n * {@link ExternalLayout} for which {@link\n * ExternalLayout#isCount|isCount()} is `true`. */\n this.count = count;\n }\n\n /** @override */\n getSpan(b, offset) {\n if (0 <= this.span) {\n return this.span;\n }\n if (undefined === offset) {\n offset = 0;\n }\n let span = 0;\n let count = this.count;\n if (count instanceof ExternalLayout) {\n count = count.decode(b, offset);\n }\n if (0 < this.elementLayout.span) {\n span = count * this.elementLayout.span;\n } else {\n let idx = 0;\n while (idx < count) {\n span += this.elementLayout.getSpan(b, offset + span);\n ++idx;\n }\n }\n return span;\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const rv = [];\n let i = 0;\n let count = this.count;\n if (count instanceof ExternalLayout) {\n count = count.decode(b, offset);\n }\n while (i < count) {\n rv.push(this.elementLayout.decode(b, offset));\n offset += this.elementLayout.getSpan(b, offset);\n i += 1;\n }\n return rv;\n }\n\n /** Implement {@link Layout#encode|encode} for {@link Sequence}.\n *\n * **NOTE** If `src` is shorter than {@link Sequence#count|count} then\n * the unused space in the buffer is left unchanged. If `src` is\n * longer than {@link Sequence#count|count} the unneeded elements are\n * ignored.\n *\n * **NOTE** If {@link Layout#count|count} is an instance of {@link\n * ExternalLayout} then the length of `src` will be encoded as the\n * count after `src` is encoded. */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const elo = this.elementLayout;\n const span = src.reduce((span, v) => {\n return span + elo.encode(v, b, offset + span);\n }, 0);\n if (this.count instanceof ExternalLayout) {\n this.count.encode(src.length, b, offset);\n }\n return span;\n }\n}\n\n/**\n * Represent a contiguous sequence of arbitrary layout elements as an\n * Object.\n *\n * *Factory*: {@link module:Layout.struct|struct}\n *\n * **NOTE** The {@link Layout#span|span} of the structure is variable\n * if any layout in {@link Structure#fields|fields} has a variable\n * span. When {@link Layout#encode|encoding} we must have a value for\n * all variable-length fields, or we wouldn't be able to figure out\n * how much space to use for storage. We can only identify the value\n * for a field when it has a {@link Layout#property|property}. As\n * such, although a structure may contain both unnamed fields and\n * variable-length fields, it cannot contain an unnamed\n * variable-length field.\n *\n * @param {Layout[]} fields - initializer for {@link\n * Structure#fields|fields}. An error is raised if this contains a\n * variable-length field for which a {@link Layout#property|property}\n * is not defined.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @param {Boolean} [decodePrefixes] - initializer for {@link\n * Structure#decodePrefixes|property}.\n *\n * @throws {Error} - if `fields` contains an unnamed variable-length\n * layout.\n *\n * @augments {Layout}\n */\nclass Structure extends Layout {\n constructor(fields, property, decodePrefixes) {\n if (!(Array.isArray(fields)\n && fields.reduce((acc, v) => acc && (v instanceof Layout), true))) {\n throw new TypeError('fields must be array of Layout instances');\n }\n if (('boolean' === typeof property)\n && (undefined === decodePrefixes)) {\n decodePrefixes = property;\n property = undefined;\n }\n\n /* Verify absence of unnamed variable-length fields. */\n for (const fd of fields) {\n if ((0 > fd.span)\n && (undefined === fd.property)) {\n throw new Error('fields cannot contain unnamed variable-length layout');\n }\n }\n\n let span = -1;\n try {\n span = fields.reduce((span, fd) => span + fd.getSpan(), 0);\n } catch (e) {\n }\n super(span, property);\n\n /** The sequence of {@link Layout} values that comprise the\n * structure.\n *\n * The individual elements need not be the same type, and may be\n * either scalar or aggregate layouts. If a member layout leaves\n * its {@link Layout#property|property} undefined the\n * corresponding region of the buffer associated with the element\n * will not be mutated.\n *\n * @type {Layout[]} */\n this.fields = fields;\n\n /** Control behavior of {@link Layout#decode|decode()} given short\n * buffers.\n *\n * In some situations a structure many be extended with additional\n * fields over time, with older installations providing only a\n * prefix of the full structure. If this property is `true`\n * decoding will accept those buffers and leave subsequent fields\n * undefined, as long as the buffer ends at a field boundary.\n * Defaults to `false`. */\n this.decodePrefixes = !!decodePrefixes;\n }\n\n /** @override */\n getSpan(b, offset) {\n if (0 <= this.span) {\n return this.span;\n }\n if (undefined === offset) {\n offset = 0;\n }\n let span = 0;\n try {\n span = this.fields.reduce((span, fd) => {\n const fsp = fd.getSpan(b, offset);\n offset += fsp;\n return span + fsp;\n }, 0);\n } catch (e) {\n throw new RangeError('indeterminate span');\n }\n return span;\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const dest = this.makeDestinationObject();\n for (const fd of this.fields) {\n if (undefined !== fd.property) {\n dest[fd.property] = fd.decode(b, offset);\n }\n offset += fd.getSpan(b, offset);\n if (this.decodePrefixes\n && (b.length === offset)) {\n break;\n }\n }\n return dest;\n }\n\n /** Implement {@link Layout#encode|encode} for {@link Structure}.\n *\n * If `src` is missing a property for a member with a defined {@link\n * Layout#property|property} the corresponding region of the buffer is\n * left unmodified. */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const firstOffset = offset;\n let lastOffset = 0;\n let lastWrote = 0;\n for (const fd of this.fields) {\n let span = fd.span;\n lastWrote = (0 < span) ? span : 0;\n if (undefined !== fd.property) {\n const fv = src[fd.property];\n if (undefined !== fv) {\n lastWrote = fd.encode(fv, b, offset);\n if (0 > span) {\n /* Read the as-encoded span, which is not necessarily the\n * same as what we wrote. */\n span = fd.getSpan(b, offset);\n }\n }\n }\n lastOffset = offset;\n offset += span;\n }\n /* Use (lastOffset + lastWrote) instead of offset because the last\n * item may have had a dynamic length and we don't want to include\n * the padding between it and the end of the space reserved for\n * it. */\n return (lastOffset + lastWrote) - firstOffset;\n }\n\n /** @override */\n fromArray(values) {\n const dest = this.makeDestinationObject();\n for (const fd of this.fields) {\n if ((undefined !== fd.property)\n && (0 < values.length)) {\n dest[fd.property] = values.shift();\n }\n }\n return dest;\n }\n\n /**\n * Get access to the layout of a given property.\n *\n * @param {String} property - the structure member of interest.\n *\n * @return {Layout} - the layout associated with `property`, or\n * undefined if there is no such property.\n */\n layoutFor(property) {\n if ('string' !== typeof property) {\n throw new TypeError('property must be string');\n }\n for (const fd of this.fields) {\n if (fd.property === property) {\n return fd;\n }\n }\n }\n\n /**\n * Get the offset of a structure member.\n *\n * @param {String} property - the structure member of interest.\n *\n * @return {Number} - the offset in bytes to the start of `property`\n * within the structure, or undefined if `property` is not a field\n * within the structure. If the property is a member but follows a\n * variable-length structure member a negative number will be\n * returned.\n */\n offsetOf(property) {\n if ('string' !== typeof property) {\n throw new TypeError('property must be string');\n }\n let offset = 0;\n for (const fd of this.fields) {\n if (fd.property === property) {\n return offset;\n }\n if (0 > fd.span) {\n offset = -1;\n } else if (0 <= offset) {\n offset += fd.span;\n }\n }\n }\n}\n\n/**\n * An object that can provide a {@link\n * Union#discriminator|discriminator} API for {@link Union}.\n *\n * **NOTE** This is an abstract base class; you can create instances\n * if it amuses you, but they won't support the {@link\n * UnionDiscriminator#encode|encode} or {@link\n * UnionDiscriminator#decode|decode} functions.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}.\n *\n * @abstract\n */\nclass UnionDiscriminator {\n constructor(property) {\n /** The {@link Layout#property|property} to be used when the\n * discriminator is referenced in isolation (generally when {@link\n * Union#decode|Union decode} cannot delegate to a specific\n * variant). */\n this.property = property;\n }\n\n /** Analog to {@link Layout#decode|Layout decode} for union discriminators.\n *\n * The implementation of this method need not reference the buffer if\n * variant information is available through other means. */\n decode() {\n throw new Error('UnionDiscriminator is abstract');\n }\n\n /** Analog to {@link Layout#decode|Layout encode} for union discriminators.\n *\n * The implementation of this method need not store the value if\n * variant information is maintained through other means. */\n encode() {\n throw new Error('UnionDiscriminator is abstract');\n }\n}\n\n/**\n * An object that can provide a {@link\n * UnionDiscriminator|discriminator API} for {@link Union} using an\n * unsigned integral {@link Layout} instance located either inside or\n * outside the union.\n *\n * @param {ExternalLayout} layout - initializes {@link\n * UnionLayoutDiscriminator#layout|layout}. Must satisfy {@link\n * ExternalLayout#isCount|isCount()}.\n *\n * @param {string} [property] - Default for {@link\n * UnionDiscriminator#property|property}, superseding the property\n * from `layout`, but defaulting to `variant` if neither `property`\n * nor layout provide a property name.\n *\n * @augments {UnionDiscriminator}\n */\nclass UnionLayoutDiscriminator extends UnionDiscriminator {\n constructor(layout, property) {\n if (!((layout instanceof ExternalLayout)\n && layout.isCount())) {\n throw new TypeError('layout must be an unsigned integer ExternalLayout');\n }\n\n super(property || layout.property || 'variant');\n\n /** The {@link ExternalLayout} used to access the discriminator\n * value. */\n this.layout = layout;\n }\n\n /** Delegate decoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n decode(b, offset) {\n return this.layout.decode(b, offset);\n }\n\n /** Delegate encoding to {@link UnionLayoutDiscriminator#layout|layout}. */\n encode(src, b, offset) {\n return this.layout.encode(src, b, offset);\n }\n}\n\n/**\n * Represent any number of span-compatible layouts.\n *\n * *Factory*: {@link module:Layout.union|union}\n *\n * If the union has a {@link Union#defaultLayout|default layout} that\n * layout must have a non-negative {@link Layout#span|span}. The span\n * of a fixed-span union includes its {@link\n * Union#discriminator|discriminator} if the variant is a {@link\n * Union#usesPrefixDiscriminator|prefix of the union}, plus the span\n * of its {@link Union#defaultLayout|default layout}.\n *\n * If the union does not have a default layout then the encoded span\n * of the union depends on the encoded span of its variant (which may\n * be fixed or variable).\n *\n * {@link VariantLayout#layout|Variant layout}s are added through\n * {@link Union#addVariant|addVariant}. If the union has a default\n * layout, the span of the {@link VariantLayout#layout|layout\n * contained by the variant} must not exceed the span of the {@link\n * Union#defaultLayout|default layout} (minus the span of a {@link\n * Union#usesPrefixDiscriminator|prefix disriminator}, if used). The\n * span of the variant will equal the span of the union itself.\n *\n * The variant for a buffer can only be identified from the {@link\n * Union#discriminator|discriminator} {@link\n * UnionDiscriminator#property|property} (in the case of the {@link\n * Union#defaultLayout|default layout}), or by using {@link\n * Union#getVariant|getVariant} and examining the resulting {@link\n * VariantLayout} instance.\n *\n * A variant compatible with a JavaScript object can be identified\n * using {@link Union#getSourceVariant|getSourceVariant}.\n *\n * @param {(UnionDiscriminator|ExternalLayout|Layout)} discr - How to\n * identify the layout used to interpret the union contents. The\n * parameter must be an instance of {@link UnionDiscriminator}, an\n * {@link ExternalLayout} that satisfies {@link\n * ExternalLayout#isCount|isCount()}, or {@link UInt} (or {@link\n * UIntBE}). When a non-external layout element is passed the layout\n * appears at the start of the union. In all cases the (synthesized)\n * {@link UnionDiscriminator} instance is recorded as {@link\n * Union#discriminator|discriminator}.\n *\n * @param {(Layout|null)} defaultLayout - initializer for {@link\n * Union#defaultLayout|defaultLayout}. If absent defaults to `null`.\n * If `null` there is no default layout: the union has data-dependent\n * length and attempts to decode or encode unrecognized variants will\n * throw an exception. A {@link Layout} instance must have a\n * non-negative {@link Layout#span|span}, and if it lacks a {@link\n * Layout#property|property} the {@link\n * Union#defaultLayout|defaultLayout} will be a {@link\n * Layout#replicate|replica} with property `content`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Union extends Layout {\n constructor(discr, defaultLayout, property) {\n const upv = ((discr instanceof UInt)\n || (discr instanceof UIntBE));\n if (upv) {\n discr = new UnionLayoutDiscriminator(new OffsetLayout(discr));\n } else if ((discr instanceof ExternalLayout)\n && discr.isCount()) {\n discr = new UnionLayoutDiscriminator(discr);\n } else if (!(discr instanceof UnionDiscriminator)) {\n throw new TypeError('discr must be a UnionDiscriminator '\n + 'or an unsigned integer layout');\n }\n if (undefined === defaultLayout) {\n defaultLayout = null;\n }\n if (!((null === defaultLayout)\n || (defaultLayout instanceof Layout))) {\n throw new TypeError('defaultLayout must be null or a Layout');\n }\n if (null !== defaultLayout) {\n if (0 > defaultLayout.span) {\n throw new Error('defaultLayout must have constant span');\n }\n if (undefined === defaultLayout.property) {\n defaultLayout = defaultLayout.replicate('content');\n }\n }\n\n /* The union span can be estimated only if there's a default\n * layout. The union spans its default layout, plus any prefix\n * variant layout. By construction both layouts, if present, have\n * non-negative span. */\n let span = -1;\n if (defaultLayout) {\n span = defaultLayout.span;\n if ((0 <= span) && upv) {\n span += discr.layout.span;\n }\n }\n super(span, property);\n\n /** The interface for the discriminator value in isolation.\n *\n * This a {@link UnionDiscriminator} either passed to the\n * constructor or synthesized from the `discr` constructor\n * argument. {@link\n * Union#usesPrefixDiscriminator|usesPrefixDiscriminator} will be\n * `true` iff the `discr` parameter was a non-offset {@link\n * Layout} instance. */\n this.discriminator = discr;\n\n /** `true` if the {@link Union#discriminator|discriminator} is the\n * first field in the union.\n *\n * If `false` the discriminator is obtained from somewhere\n * else. */\n this.usesPrefixDiscriminator = upv;\n\n /** The layout for non-discriminator content when the value of the\n * discriminator is not recognized.\n *\n * This is the value passed to the constructor. It is\n * structurally equivalent to the second component of {@link\n * Union#layout|layout} but may have a different property\n * name. */\n this.defaultLayout = defaultLayout;\n\n /** A registry of allowed variants.\n *\n * The keys are unsigned integers which should be compatible with\n * {@link Union.discriminator|discriminator}. The property value\n * is the corresponding {@link VariantLayout} instances assigned\n * to this union by {@link Union#addVariant|addVariant}.\n *\n * **NOTE** The registry remains mutable so that variants can be\n * {@link Union#addVariant|added} at any time. Users should not\n * manipulate the content of this property. */\n this.registry = {};\n\n /* Private variable used when invoking getSourceVariant */\n let boundGetSourceVariant = this.defaultGetSourceVariant.bind(this);\n\n /** Function to infer the variant selected by a source object.\n *\n * Defaults to {@link\n * Union#defaultGetSourceVariant|defaultGetSourceVariant} but may\n * be overridden using {@link\n * Union#configGetSourceVariant|configGetSourceVariant}.\n *\n * @param {Object} src - as with {@link\n * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n *\n * @returns {(undefined|VariantLayout)} The default variant\n * (`undefined`) or first registered variant that uses a property\n * available in `src`. */\n this.getSourceVariant = function(src) {\n return boundGetSourceVariant(src);\n };\n\n /** Function to override the implementation of {@link\n * Union#getSourceVariant|getSourceVariant}.\n *\n * Use this if the desired variant cannot be identified using the\n * algorithm of {@link\n * Union#defaultGetSourceVariant|defaultGetSourceVariant}.\n *\n * **NOTE** The provided function will be invoked bound to this\n * Union instance, providing local access to {@link\n * Union#registry|registry}.\n *\n * @param {Function} gsv - a function that follows the API of\n * {@link Union#defaultGetSourceVariant|defaultGetSourceVariant}. */\n this.configGetSourceVariant = function(gsv) {\n boundGetSourceVariant = gsv.bind(this);\n };\n }\n\n /** @override */\n getSpan(b, offset) {\n if (0 <= this.span) {\n return this.span;\n }\n if (undefined === offset) {\n offset = 0;\n }\n /* Default layouts always have non-negative span, so we don't have\n * one and we have to recognize the variant which will in turn\n * determine the span. */\n const vlo = this.getVariant(b, offset);\n if (!vlo) {\n throw new Error('unable to determine span for unrecognized variant');\n }\n return vlo.getSpan(b, offset);\n }\n\n /**\n * Method to infer a registered Union variant compatible with `src`.\n *\n * The first satisified rule in the following sequence defines the\n * return value:\n * * If `src` has properties matching the Union discriminator and\n * the default layout, `undefined` is returned regardless of the\n * value of the discriminator property (this ensures the default\n * layout will be used);\n * * If `src` has a property matching the Union discriminator, the\n * value of the discriminator identifies a registered variant, and\n * either (a) the variant has no layout, or (b) `src` has the\n * variant's property, then the variant is returned (because the\n * source satisfies the constraints of the variant it identifies);\n * * If `src` does not have a property matching the Union\n * discriminator, but does have a property matching a registered\n * variant, then the variant is returned (because the source\n * matches a variant without an explicit conflict);\n * * An error is thrown (because we either can't identify a variant,\n * or we were explicitly told the variant but can't satisfy it).\n *\n * @param {Object} src - an object presumed to be compatible with\n * the content of the Union.\n *\n * @return {(undefined|VariantLayout)} - as described above.\n *\n * @throws {Error} - if `src` cannot be associated with a default or\n * registered variant.\n */\n defaultGetSourceVariant(src) {\n if (src.hasOwnProperty(this.discriminator.property)) {\n if (this.defaultLayout\n && src.hasOwnProperty(this.defaultLayout.property)) {\n return undefined;\n }\n const vlo = this.registry[src[this.discriminator.property]];\n if (vlo\n && ((!vlo.layout)\n || src.hasOwnProperty(vlo.property))) {\n return vlo;\n }\n } else {\n for (const tag in this.registry) {\n const vlo = this.registry[tag];\n if (src.hasOwnProperty(vlo.property)) {\n return vlo;\n }\n }\n }\n throw new Error('unable to infer src variant');\n }\n\n /** Implement {@link Layout#decode|decode} for {@link Union}.\n *\n * If the variant is {@link Union#addVariant|registered} the return\n * value is an instance of that variant, with no explicit\n * discriminator. Otherwise the {@link Union#defaultLayout|default\n * layout} is used to decode the content. */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n let dest;\n const dlo = this.discriminator;\n const discr = dlo.decode(b, offset);\n let clo = this.registry[discr];\n if (undefined === clo) {\n let contentOffset = 0;\n clo = this.defaultLayout;\n if (this.usesPrefixDiscriminator) {\n contentOffset = dlo.layout.span;\n }\n dest = this.makeDestinationObject();\n dest[dlo.property] = discr;\n dest[clo.property] = this.defaultLayout.decode(b, offset + contentOffset);\n } else {\n dest = clo.decode(b, offset);\n }\n return dest;\n }\n\n /** Implement {@link Layout#encode|encode} for {@link Union}.\n *\n * This API assumes the `src` object is consistent with the union's\n * {@link Union#defaultLayout|default layout}. To encode variants\n * use the appropriate variant-specific {@link VariantLayout#encode}\n * method. */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const vlo = this.getSourceVariant(src);\n if (undefined === vlo) {\n const dlo = this.discriminator;\n const clo = this.defaultLayout;\n let contentOffset = 0;\n if (this.usesPrefixDiscriminator) {\n contentOffset = dlo.layout.span;\n }\n dlo.encode(src[dlo.property], b, offset);\n return contentOffset + clo.encode(src[clo.property], b,\n offset + contentOffset);\n }\n return vlo.encode(src, b, offset);\n }\n\n /** Register a new variant structure within a union. The newly\n * created variant is returned.\n *\n * @param {Number} variant - initializer for {@link\n * VariantLayout#variant|variant}.\n *\n * @param {Layout} layout - initializer for {@link\n * VariantLayout#layout|layout}.\n *\n * @param {String} property - initializer for {@link\n * Layout#property|property}.\n *\n * @return {VariantLayout} */\n addVariant(variant, layout, property) {\n const rv = new VariantLayout(this, variant, layout, property);\n this.registry[variant] = rv;\n return rv;\n }\n\n /**\n * Get the layout associated with a registered variant.\n *\n * If `vb` does not produce a registered variant the function returns\n * `undefined`.\n *\n * @param {(Number|Buffer)} vb - either the variant number, or a\n * buffer from which the discriminator is to be read.\n *\n * @param {Number} offset - offset into `vb` for the start of the\n * union. Used only when `vb` is an instance of {Buffer}.\n *\n * @return {({VariantLayout}|undefined)}\n */\n getVariant(vb, offset) {\n let variant = vb;\n if (Buffer.isBuffer(vb)) {\n if (undefined === offset) {\n offset = 0;\n }\n variant = this.discriminator.decode(vb, offset);\n }\n return this.registry[variant];\n }\n}\n\n/**\n * Represent a specific variant within a containing union.\n *\n * **NOTE** The {@link Layout#span|span} of the variant may include\n * the span of the {@link Union#discriminator|discriminator} used to\n * identify it, but values read and written using the variant strictly\n * conform to the content of {@link VariantLayout#layout|layout}.\n *\n * **NOTE** User code should not invoke this constructor directly. Use\n * the union {@link Union#addVariant|addVariant} helper method.\n *\n * @param {Union} union - initializer for {@link\n * VariantLayout#union|union}.\n *\n * @param {Number} variant - initializer for {@link\n * VariantLayout#variant|variant}.\n *\n * @param {Layout} [layout] - initializer for {@link\n * VariantLayout#layout|layout}. If absent the variant carries no\n * data.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}. Unlike many other layouts, variant\n * layouts normally include a property name so they can be identified\n * within their containing {@link Union}. The property identifier may\n * be absent only if `layout` is is absent.\n *\n * @augments {Layout}\n */\nclass VariantLayout extends Layout {\n constructor(union, variant, layout, property) {\n if (!(union instanceof Union)) {\n throw new TypeError('union must be a Union');\n }\n if ((!Number.isInteger(variant)) || (0 > variant)) {\n throw new TypeError('variant must be a (non-negative) integer');\n }\n if (('string' === typeof layout)\n && (undefined === property)) {\n property = layout;\n layout = null;\n }\n if (layout) {\n if (!(layout instanceof Layout)) {\n throw new TypeError('layout must be a Layout');\n }\n if ((null !== union.defaultLayout)\n && (0 <= layout.span)\n && (layout.span > union.defaultLayout.span)) {\n throw new Error('variant span exceeds span of containing union');\n }\n if ('string' !== typeof property) {\n throw new TypeError('variant must have a String property');\n }\n }\n let span = union.span;\n if (0 > union.span) {\n span = layout ? layout.span : 0;\n if ((0 <= span) && union.usesPrefixDiscriminator) {\n span += union.discriminator.layout.span;\n }\n }\n super(span, property);\n\n /** The {@link Union} to which this variant belongs. */\n this.union = union;\n\n /** The unsigned integral value identifying this variant within\n * the {@link Union#discriminator|discriminator} of the containing\n * union. */\n this.variant = variant;\n\n /** The {@link Layout} to be used when reading/writing the\n * non-discriminator part of the {@link\n * VariantLayout#union|union}. If `null` the variant carries no\n * data. */\n this.layout = layout || null;\n }\n\n /** @override */\n getSpan(b, offset) {\n if (0 <= this.span) {\n /* Will be equal to the containing union span if that is not\n * variable. */\n return this.span;\n }\n if (undefined === offset) {\n offset = 0;\n }\n let contentOffset = 0;\n if (this.union.usesPrefixDiscriminator) {\n contentOffset = this.union.discriminator.layout.span;\n }\n /* Span is defined solely by the variant (and prefix discriminator) */\n return contentOffset + this.layout.getSpan(b, offset + contentOffset);\n }\n\n /** @override */\n decode(b, offset) {\n const dest = this.makeDestinationObject();\n if (undefined === offset) {\n offset = 0;\n }\n if (this !== this.union.getVariant(b, offset)) {\n throw new Error('variant mismatch');\n }\n let contentOffset = 0;\n if (this.union.usesPrefixDiscriminator) {\n contentOffset = this.union.discriminator.layout.span;\n }\n if (this.layout) {\n dest[this.property] = this.layout.decode(b, offset + contentOffset);\n } else if (this.property) {\n dest[this.property] = true;\n } else if (this.union.usesPrefixDiscriminator) {\n dest[this.union.discriminator.property] = this.variant;\n }\n return dest;\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n let contentOffset = 0;\n if (this.union.usesPrefixDiscriminator) {\n contentOffset = this.union.discriminator.layout.span;\n }\n if (this.layout\n && (!src.hasOwnProperty(this.property))) {\n throw new TypeError('variant lacks property ' + this.property);\n }\n this.union.discriminator.encode(this.variant, b, offset);\n let span = contentOffset;\n if (this.layout) {\n this.layout.encode(src[this.property], b, offset + contentOffset);\n span += this.layout.getSpan(b, offset + contentOffset);\n if ((0 <= this.union.span)\n && (span > this.union.span)) {\n throw new Error('encoded variant overruns containing union');\n }\n }\n return span;\n }\n\n /** Delegate {@link Layout#fromArray|fromArray} to {@link\n * VariantLayout#layout|layout}. */\n fromArray(values) {\n if (this.layout) {\n return this.layout.fromArray(values);\n }\n }\n}\n\n/** JavaScript chose to define bitwise operations as operating on\n * signed 32-bit values in 2's complement form, meaning any integer\n * with bit 31 set is going to look negative. For right shifts that's\n * not a problem, because `>>>` is a logical shift, but for every\n * other bitwise operator we have to compensate for possible negative\n * results. */\nfunction fixBitwiseResult(v) {\n if (0 > v) {\n v += 0x100000000;\n }\n return v;\n}\n\n/**\n * Contain a sequence of bit fields as an unsigned integer.\n *\n * *Factory*: {@link module:Layout.bits|bits}\n *\n * This is a container element; within it there are {@link BitField}\n * instances that provide the extracted properties. The container\n * simply defines the aggregate representation and its bit ordering.\n * The representation is an object containing properties with numeric\n * or {@link Boolean} values.\n *\n * {@link BitField}s are added with the {@link\n * BitStructure#addField|addField} and {@link\n * BitStructure#addBoolean|addBoolean} methods.\n\n * @param {Layout} word - initializer for {@link\n * BitStructure#word|word}. The parameter must be an instance of\n * {@link UInt} (or {@link UIntBE}) that is no more than 4 bytes wide.\n *\n * @param {bool} [msb] - `true` if the bit numbering starts at the\n * most significant bit of the containing word; `false` (default) if\n * it starts at the least significant bit of the containing word. If\n * the parameter at this position is a string and `property` is\n * `undefined` the value of this argument will instead be used as the\n * value of `property`.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass BitStructure extends Layout {\n constructor(word, msb, property) {\n if (!((word instanceof UInt)\n || (word instanceof UIntBE))) {\n throw new TypeError('word must be a UInt or UIntBE layout');\n }\n if (('string' === typeof msb)\n && (undefined === property)) {\n property = msb;\n msb = undefined;\n }\n if (4 < word.span) {\n throw new RangeError('word cannot exceed 32 bits');\n }\n super(word.span, property);\n\n /** The layout used for the packed value. {@link BitField}\n * instances are packed sequentially depending on {@link\n * BitStructure#msb|msb}. */\n this.word = word;\n\n /** Whether the bit sequences are packed starting at the most\n * significant bit growing down (`true`), or the least significant\n * bit growing up (`false`).\n *\n * **NOTE** Regardless of this value, the least significant bit of\n * any {@link BitField} value is the least significant bit of the\n * corresponding section of the packed value. */\n this.msb = !!msb;\n\n /** The sequence of {@link BitField} layouts that comprise the\n * packed structure.\n *\n * **NOTE** The array remains mutable to allow fields to be {@link\n * BitStructure#addField|added} after construction. Users should\n * not manipulate the content of this property.*/\n this.fields = [];\n\n /* Storage for the value. Capture a variable instead of using an\n * instance property because we don't want anything to change the\n * value without going through the mutator. */\n let value = 0;\n this._packedSetValue = function(v) {\n value = fixBitwiseResult(v);\n return this;\n };\n this._packedGetValue = function() {\n return value;\n };\n }\n\n /** @override */\n decode(b, offset) {\n const dest = this.makeDestinationObject();\n if (undefined === offset) {\n offset = 0;\n }\n const value = this.word.decode(b, offset);\n this._packedSetValue(value);\n for (const fd of this.fields) {\n if (undefined !== fd.property) {\n dest[fd.property] = fd.decode(value);\n }\n }\n return dest;\n }\n\n /** Implement {@link Layout#encode|encode} for {@link BitStructure}.\n *\n * If `src` is missing a property for a member with a defined {@link\n * Layout#property|property} the corresponding region of the packed\n * value is left unmodified. Unused bits are also left unmodified. */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n const value = this.word.decode(b, offset);\n this._packedSetValue(value);\n for (const fd of this.fields) {\n if (undefined !== fd.property) {\n const fv = src[fd.property];\n if (undefined !== fv) {\n fd.encode(fv);\n }\n }\n }\n return this.word.encode(this._packedGetValue(), b, offset);\n }\n\n /** Register a new bitfield with a containing bit structure. The\n * resulting bitfield is returned.\n *\n * @param {Number} bits - initializer for {@link BitField#bits|bits}.\n *\n * @param {string} property - initializer for {@link\n * Layout#property|property}.\n *\n * @return {BitField} */\n addField(bits, property) {\n const bf = new BitField(this, bits, property);\n this.fields.push(bf);\n return bf;\n }\n\n /** As with {@link BitStructure#addField|addField} for single-bit\n * fields with `boolean` value representation.\n *\n * @param {string} property - initializer for {@link\n * Layout#property|property}.\n *\n * @return {Boolean} */\n addBoolean(property) {\n // This is my Boolean, not the Javascript one.\n // eslint-disable-next-line no-new-wrappers\n const bf = new Boolean(this, property);\n this.fields.push(bf);\n return bf;\n }\n\n /**\n * Get access to the bit field for a given property.\n *\n * @param {String} property - the bit field of interest.\n *\n * @return {BitField} - the field associated with `property`, or\n * undefined if there is no such property.\n */\n fieldFor(property) {\n if ('string' !== typeof property) {\n throw new TypeError('property must be string');\n }\n for (const fd of this.fields) {\n if (fd.property === property) {\n return fd;\n }\n }\n }\n}\n\n/**\n * Represent a sequence of bits within a {@link BitStructure}.\n *\n * All bit field values are represented as unsigned integers.\n *\n * **NOTE** User code should not invoke this constructor directly.\n * Use the container {@link BitStructure#addField|addField} helper\n * method.\n *\n * **NOTE** BitField instances are not instances of {@link Layout}\n * since {@link Layout#span|span} measures 8-bit units.\n *\n * @param {BitStructure} container - initializer for {@link\n * BitField#container|container}.\n *\n * @param {Number} bits - initializer for {@link BitField#bits|bits}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n */\nclass BitField {\n constructor(container, bits, property) {\n if (!(container instanceof BitStructure)) {\n throw new TypeError('container must be a BitStructure');\n }\n if ((!Number.isInteger(bits)) || (0 >= bits)) {\n throw new TypeError('bits must be positive integer');\n }\n const totalBits = 8 * container.span;\n const usedBits = container.fields.reduce((sum, fd) => sum + fd.bits, 0);\n if ((bits + usedBits) > totalBits) {\n throw new Error('bits too long for span remainder ('\n + (totalBits - usedBits) + ' of '\n + totalBits + ' remain)');\n }\n\n /** The {@link BitStructure} instance to which this bit field\n * belongs. */\n this.container = container;\n\n /** The span of this value in bits. */\n this.bits = bits;\n\n /** A mask of {@link BitField#bits|bits} bits isolating value bits\n * that fit within the field.\n *\n * That is, it masks a value that has not yet been shifted into\n * position within its containing packed integer. */\n this.valueMask = (1 << bits) - 1;\n if (32 === bits) { // shifted value out of range\n this.valueMask = 0xFFFFFFFF;\n }\n\n /** The offset of the value within the containing packed unsigned\n * integer. The least significant bit of the packed value is at\n * offset zero, regardless of bit ordering used. */\n this.start = usedBits;\n if (this.container.msb) {\n this.start = totalBits - usedBits - bits;\n }\n\n /** A mask of {@link BitField#bits|bits} isolating the field value\n * within the containing packed unsigned integer. */\n this.wordMask = fixBitwiseResult(this.valueMask << this.start);\n\n /** The property name used when this bitfield is represented in an\n * Object.\n *\n * Intended to be functionally equivalent to {@link\n * Layout#property}.\n *\n * If left undefined the corresponding span of bits will be\n * treated as padding: it will not be mutated by {@link\n * Layout#encode|encode} nor represented as a property in the\n * decoded Object. */\n this.property = property;\n }\n\n /** Store a value into the corresponding subsequence of the containing\n * bit field. */\n decode() {\n const word = this.container._packedGetValue();\n const wordValue = fixBitwiseResult(word & this.wordMask);\n const value = wordValue >>> this.start;\n return value;\n }\n\n /** Store a value into the corresponding subsequence of the containing\n * bit field.\n *\n * **NOTE** This is not a specialization of {@link\n * Layout#encode|Layout.encode} and there is no return value. */\n encode(value) {\n if ((!Number.isInteger(value))\n || (value !== fixBitwiseResult(value & this.valueMask))) {\n throw new TypeError(nameWithProperty('BitField.encode', this)\n + ' value must be integer not exceeding ' + this.valueMask);\n }\n const word = this.container._packedGetValue();\n const wordValue = fixBitwiseResult(value << this.start);\n this.container._packedSetValue(fixBitwiseResult(word & ~this.wordMask)\n | wordValue);\n };\n}\n\n/**\n * Represent a single bit within a {@link BitStructure} as a\n * JavaScript boolean.\n *\n * **NOTE** User code should not invoke this constructor directly.\n * Use the container {@link BitStructure#addBoolean|addBoolean} helper\n * method.\n *\n * @param {BitStructure} container - initializer for {@link\n * BitField#container|container}.\n *\n * @param {string} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {BitField}\n */\n/* eslint-disable no-extend-native */\nclass Boolean extends BitField {\n constructor(container, property) {\n super(container, 1, property);\n }\n\n /** Override {@link BitField#decode|decode} for {@link Boolean|Boolean}.\n *\n * @returns {boolean} */\n decode(b, offset) {\n return !!BitField.prototype.decode.call(this, b, offset);\n }\n\n /** @override */\n encode(value) {\n if ('boolean' === typeof value) {\n // BitField requires integer values\n value = +value;\n }\n return BitField.prototype.encode.call(this, value);\n }\n}\n/* eslint-enable no-extend-native */\n\n/**\n * Contain a fixed-length block of arbitrary data, represented as a\n * Buffer.\n *\n * *Factory*: {@link module:Layout.blob|blob}\n *\n * @param {(Number|ExternalLayout)} length - initializes {@link\n * Blob#length|length}.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Blob extends Layout {\n constructor(length, property) {\n if (!(((length instanceof ExternalLayout) && length.isCount())\n || (Number.isInteger(length) && (0 <= length)))) {\n throw new TypeError('length must be positive integer '\n + 'or an unsigned integer ExternalLayout');\n }\n\n let span = -1;\n if (!(length instanceof ExternalLayout)) {\n span = length;\n }\n super(span, property);\n\n /** The number of bytes in the blob.\n *\n * This may be a non-negative integer, or an instance of {@link\n * ExternalLayout} that satisfies {@link\n * ExternalLayout#isCount|isCount()}. */\n this.length = length;\n }\n\n /** @override */\n getSpan(b, offset) {\n let span = this.span;\n if (0 > span) {\n span = this.length.decode(b, offset);\n }\n return span;\n }\n\n /** @override */\n decode(b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n let span = this.span;\n if (0 > span) {\n span = this.length.decode(b, offset);\n }\n return b.slice(offset, offset + span);\n }\n\n /** Implement {@link Layout#encode|encode} for {@link Blob}.\n *\n * **NOTE** If {@link Layout#count|count} is an instance of {@link\n * ExternalLayout} then the length of `src` will be encoded as the\n * count after `src` is encoded. */\n encode(src, b, offset) {\n let span = this.length;\n if (this.length instanceof ExternalLayout) {\n span = src.length;\n }\n if (!(Buffer.isBuffer(src)\n && (span === src.length))) {\n throw new TypeError(nameWithProperty('Blob.encode', this)\n + ' requires (length ' + span + ') Buffer as src');\n }\n if ((offset + span) > b.length) {\n throw new RangeError('encoding overruns Buffer');\n }\n b.write(src.toString('hex'), offset, span, 'hex');\n if (this.length instanceof ExternalLayout) {\n this.length.encode(span, b, offset);\n }\n return span;\n }\n}\n\n/**\n * Contain a `NUL`-terminated UTF8 string.\n *\n * *Factory*: {@link module:Layout.cstr|cstr}\n *\n * **NOTE** Any UTF8 string that incorporates a zero-valued byte will\n * not be correctly decoded by this layout.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass CString extends Layout {\n constructor(property) {\n super(-1, property);\n }\n\n /** @override */\n getSpan(b, offset) {\n if (!Buffer.isBuffer(b)) {\n throw new TypeError('b must be a Buffer');\n }\n if (undefined === offset) {\n offset = 0;\n }\n let idx = offset;\n while ((idx < b.length) && (0 !== b[idx])) {\n idx += 1;\n }\n return 1 + idx - offset;\n }\n\n /** @override */\n decode(b, offset, dest) {\n if (undefined === offset) {\n offset = 0;\n }\n let span = this.getSpan(b, offset);\n return b.slice(offset, offset + span - 1).toString('utf-8');\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n /* Must force this to a string, lest it be a number and the\n * \"utf8-encoding\" below actually allocate a buffer of length\n * src */\n if ('string' !== typeof src) {\n src = src.toString();\n }\n const srcb = new Buffer(src, 'utf8');\n const span = srcb.length;\n if ((offset + span) > b.length) {\n throw new RangeError('encoding overruns Buffer');\n }\n srcb.copy(b, offset);\n b[offset + span] = 0;\n return span + 1;\n }\n}\n\n/**\n * Contain a UTF8 string with implicit length.\n *\n * *Factory*: {@link module:Layout.utf8|utf8}\n *\n * **NOTE** Because the length is implicit in the size of the buffer\n * this layout should be used only in isolation, or in a situation\n * where the length can be expressed by operating on a slice of the\n * containing buffer.\n *\n * @param {Number} [maxSpan] - the maximum length allowed for encoded\n * string content. If not provided there is no bound on the allowed\n * content.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass UTF8 extends Layout {\n constructor(maxSpan, property) {\n if (('string' === typeof maxSpan)\n && (undefined === property)) {\n property = maxSpan;\n maxSpan = undefined;\n }\n if (undefined === maxSpan) {\n maxSpan = -1;\n } else if (!Number.isInteger(maxSpan)) {\n throw new TypeError('maxSpan must be an integer');\n }\n\n super(-1, property);\n\n /** The maximum span of the layout in bytes.\n *\n * Positive values are generally expected. Zero is abnormal.\n * Attempts to encode or decode a value that exceeds this length\n * will throw a `RangeError`.\n *\n * A negative value indicates that there is no bound on the length\n * of the content. */\n this.maxSpan = maxSpan;\n }\n\n /** @override */\n getSpan(b, offset) {\n if (!Buffer.isBuffer(b)) {\n throw new TypeError('b must be a Buffer');\n }\n if (undefined === offset) {\n offset = 0;\n }\n return b.length - offset;\n }\n\n /** @override */\n decode(b, offset, dest) {\n if (undefined === offset) {\n offset = 0;\n }\n let span = this.getSpan(b, offset);\n if ((0 <= this.maxSpan)\n && (this.maxSpan < span)) {\n throw new RangeError('text length exceeds maxSpan');\n }\n return b.slice(offset, offset + span).toString('utf-8');\n }\n\n /** @override */\n encode(src, b, offset) {\n if (undefined === offset) {\n offset = 0;\n }\n /* Must force this to a string, lest it be a number and the\n * \"utf8-encoding\" below actually allocate a buffer of length\n * src */\n if ('string' !== typeof src) {\n src = src.toString();\n }\n const srcb = new Buffer(src, 'utf8');\n const span = srcb.length;\n if ((0 <= this.maxSpan)\n && (this.maxSpan < span)) {\n throw new RangeError('text length exceeds maxSpan');\n }\n if ((offset + span) > b.length) {\n throw new RangeError('encoding overruns Buffer');\n }\n srcb.copy(b, offset);\n return span;\n }\n}\n\n/**\n * Contain a constant value.\n *\n * This layout may be used in cases where a JavaScript value can be\n * inferred without an expression in the binary encoding. An example\n * would be a {@link VariantLayout|variant layout} where the content\n * is implied by the union {@link Union#discriminator|discriminator}.\n *\n * @param {Object|Number|String} value - initializer for {@link\n * Constant#value|value}. If the value is an object (or array) and\n * the application intends the object to remain unchanged regardless\n * of what is done to values decoded by this layout, the value should\n * be frozen prior passing it to this constructor.\n *\n * @param {String} [property] - initializer for {@link\n * Layout#property|property}.\n *\n * @augments {Layout}\n */\nclass Constant extends Layout {\n constructor(value, property) {\n super(0, property);\n\n /** The value produced by this constant when the layout is {@link\n * Constant#decode|decoded}.\n *\n * Any JavaScript value including `null` and `undefined` is\n * permitted.\n *\n * **WARNING** If `value` passed in the constructor was not\n * frozen, it is possible for users of decoded values to change\n * the content of the value. */\n this.value = value;\n }\n\n /** @override */\n decode(b, offset, dest) {\n return this.value;\n }\n\n /** @override */\n encode(src, b, offset) {\n /* Constants take no space */\n return 0;\n }\n}\n\nexports.ExternalLayout = ExternalLayout;\nexports.GreedyCount = GreedyCount;\nexports.OffsetLayout = OffsetLayout;\nexports.UInt = UInt;\nexports.UIntBE = UIntBE;\nexports.Int = Int;\nexports.IntBE = IntBE;\nexports.Float = Float;\nexports.FloatBE = FloatBE;\nexports.Double = Double;\nexports.DoubleBE = DoubleBE;\nexports.Sequence = Sequence;\nexports.Structure = Structure;\nexports.UnionDiscriminator = UnionDiscriminator;\nexports.UnionLayoutDiscriminator = UnionLayoutDiscriminator;\nexports.Union = Union;\nexports.VariantLayout = VariantLayout;\nexports.BitStructure = BitStructure;\nexports.BitField = BitField;\nexports.Boolean = Boolean;\nexports.Blob = Blob;\nexports.CString = CString;\nexports.UTF8 = UTF8;\nexports.Constant = Constant;\n\n/** Factory for {@link GreedyCount}. */\nexports.greedy = ((elementSpan, property) => new GreedyCount(elementSpan, property));\n\n/** Factory for {@link OffsetLayout}. */\nexports.offset = ((layout, offset, property) => new OffsetLayout(layout, offset, property));\n\n/** Factory for {@link UInt|unsigned int layouts} spanning one\n * byte. */\nexports.u8 = (property => new UInt(1, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning two bytes. */\nexports.u16 = (property => new UInt(2, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning three bytes. */\nexports.u24 = (property => new UInt(3, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning four bytes. */\nexports.u32 = (property => new UInt(4, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning five bytes. */\nexports.u40 = (property => new UInt(5, property));\n\n/** Factory for {@link UInt|little-endian unsigned int layouts}\n * spanning six bytes. */\nexports.u48 = (property => new UInt(6, property));\n\n/** Factory for {@link NearUInt64|little-endian unsigned int\n * layouts} interpreted as Numbers. */\nexports.nu64 = (property => new NearUInt64(property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning two bytes. */\nexports.u16be = (property => new UIntBE(2, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning three bytes. */\nexports.u24be = (property => new UIntBE(3, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning four bytes. */\nexports.u32be = (property => new UIntBE(4, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning five bytes. */\nexports.u40be = (property => new UIntBE(5, property));\n\n/** Factory for {@link UInt|big-endian unsigned int layouts}\n * spanning six bytes. */\nexports.u48be = (property => new UIntBE(6, property));\n\n/** Factory for {@link NearUInt64BE|big-endian unsigned int\n * layouts} interpreted as Numbers. */\nexports.nu64be = (property => new NearUInt64BE(property));\n\n/** Factory for {@link Int|signed int layouts} spanning one\n * byte. */\nexports.s8 = (property => new Int(1, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning two bytes. */\nexports.s16 = (property => new Int(2, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning three bytes. */\nexports.s24 = (property => new Int(3, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning four bytes. */\nexports.s32 = (property => new Int(4, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning five bytes. */\nexports.s40 = (property => new Int(5, property));\n\n/** Factory for {@link Int|little-endian signed int layouts}\n * spanning six bytes. */\nexports.s48 = (property => new Int(6, property));\n\n/** Factory for {@link NearInt64|little-endian signed int layouts}\n * interpreted as Numbers. */\nexports.ns64 = (property => new NearInt64(property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning two bytes. */\nexports.s16be = (property => new IntBE(2, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning three bytes. */\nexports.s24be = (property => new IntBE(3, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning four bytes. */\nexports.s32be = (property => new IntBE(4, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning five bytes. */\nexports.s40be = (property => new IntBE(5, property));\n\n/** Factory for {@link Int|big-endian signed int layouts}\n * spanning six bytes. */\nexports.s48be = (property => new IntBE(6, property));\n\n/** Factory for {@link NearInt64BE|big-endian signed int layouts}\n * interpreted as Numbers. */\nexports.ns64be = (property => new NearInt64BE(property));\n\n/** Factory for {@link Float|little-endian 32-bit floating point} values. */\nexports.f32 = (property => new Float(property));\n\n/** Factory for {@link FloatBE|big-endian 32-bit floating point} values. */\nexports.f32be = (property => new FloatBE(property));\n\n/** Factory for {@link Double|little-endian 64-bit floating point} values. */\nexports.f64 = (property => new Double(property));\n\n/** Factory for {@link DoubleBE|big-endian 64-bit floating point} values. */\nexports.f64be = (property => new DoubleBE(property));\n\n/** Factory for {@link Structure} values. */\nexports.struct = ((fields, property, decodePrefixes) => new Structure(fields, property, decodePrefixes));\n\n/** Factory for {@link BitStructure} values. */\nexports.bits = ((word, msb, property) => new BitStructure(word, msb, property));\n\n/** Factory for {@link Sequence} values. */\nexports.seq = ((elementLayout, count, property) => new Sequence(elementLayout, count, property));\n\n/** Factory for {@link Union} values. */\nexports.union = ((discr, defaultLayout, property) => new Union(discr, defaultLayout, property));\n\n/** Factory for {@link UnionLayoutDiscriminator} values. */\nexports.unionLayoutDiscriminator = ((layout, property) => new UnionLayoutDiscriminator(layout, property));\n\n/** Factory for {@link Blob} values. */\nexports.blob = ((length, property) => new Blob(length, property));\n\n/** Factory for {@link CString} values. */\nexports.cstr = (property => new CString(property));\n\n/** Factory for {@link UTF8} values. */\nexports.utf8 = ((maxSpan, property) => new UTF8(maxSpan, property));\n\n/** Factory for {@link Constant} values. */\nexports.const = ((value, property) => new Constant(value, property));\n","(function (module, exports) {\n 'use strict';\n\n // Utils\n function assert (val, msg) {\n if (!val) throw new Error(msg || 'Assertion failed');\n }\n\n // Could use `inherits` module, but don't want to move from single file\n // architecture yet.\n function inherits (ctor, superCtor) {\n ctor.super_ = superCtor;\n var TempCtor = function () {};\n TempCtor.prototype = superCtor.prototype;\n ctor.prototype = new TempCtor();\n ctor.prototype.constructor = ctor;\n }\n\n // BN\n\n function BN (number, base, endian) {\n if (BN.isBN(number)) {\n return number;\n }\n\n this.negative = 0;\n this.words = null;\n this.length = 0;\n\n // Reduction context\n this.red = null;\n\n if (number !== null) {\n if (base === 'le' || base === 'be') {\n endian = base;\n base = 10;\n }\n\n this._init(number || 0, base || 10, endian || 'be');\n }\n }\n if (typeof module === 'object') {\n module.exports = BN;\n } else {\n exports.BN = BN;\n }\n\n BN.BN = BN;\n BN.wordSize = 26;\n\n var Buffer;\n try {\n if (typeof window !== 'undefined' && typeof window.Buffer !== 'undefined') {\n Buffer = window.Buffer;\n } else {\n Buffer = require('buffer').Buffer;\n }\n } catch (e) {\n }\n\n BN.isBN = function isBN (num) {\n if (num instanceof BN) {\n return true;\n }\n\n return num !== null && typeof num === 'object' &&\n num.constructor.wordSize === BN.wordSize && Array.isArray(num.words);\n };\n\n BN.max = function max (left, right) {\n if (left.cmp(right) > 0) return left;\n return right;\n };\n\n BN.min = function min (left, right) {\n if (left.cmp(right) < 0) return left;\n return right;\n };\n\n BN.prototype._init = function init (number, base, endian) {\n if (typeof number === 'number') {\n return this._initNumber(number, base, endian);\n }\n\n if (typeof number === 'object') {\n return this._initArray(number, base, endian);\n }\n\n if (base === 'hex') {\n base = 16;\n }\n assert(base === (base | 0) && base >= 2 && base <= 36);\n\n number = number.toString().replace(/\\s+/g, '');\n var start = 0;\n if (number[0] === '-') {\n start++;\n this.negative = 1;\n }\n\n if (start < number.length) {\n if (base === 16) {\n this._parseHex(number, start, endian);\n } else {\n\n this._parseBase(number, base, start);\n if (endian === 'le') {\n this._initArray(this.toArray(), base, endian);\n }\n }\n }\n };\n\n BN.prototype._initNumber = function _initNumber (number, base, endian) {\n if (number < 0) {\n this.negative = 1;\n number = -number;\n }\n if (number < 0x4000000) {\n this.words = [number & 0x3ffffff];\n this.length = 1;\n } else if (number < 0x10000000000000) {\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff\n ];\n this.length = 2;\n } else {\n assert(number < 0x20000000000000); // 2 ^ 53 (unsafe)\n this.words = [\n number & 0x3ffffff,\n (number / 0x4000000) & 0x3ffffff,\n 1\n ];\n this.length = 3;\n }\n\n if (endian !== 'le') return;\n\n // Reverse the bytes\n this._initArray(this.toArray(), base, endian);\n };\n\n BN.prototype._initArray = function _initArray (number, base, endian) {\n // Perhaps a Uint8Array\n assert(typeof number.length === 'number');\n if (number.length <= 0) {\n this.words = [0];\n this.length = 1;\n return this;\n }\n\n this.length = Math.ceil(number.length / 3);\n this.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n var j, w;\n var off = 0;\n if (endian === 'be') {\n for (i = number.length - 1, j = 0; i >= 0; i -= 3) {\n w = number[i] | (number[i - 1] << 8) | (number[i - 2] << 16);\n this.words[j] |= (w << off) & 0x3ffffff;\n this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n off += 24;\n if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n } else if (endian === 'le') {\n for (i = 0, j = 0; i < number.length; i += 3) {\n w = number[i] | (number[i + 1] << 8) | (number[i + 2] << 16);\n this.words[j] |= (w << off) & 0x3ffffff;\n this.words[j + 1] = (w >>> (26 - off)) & 0x3ffffff;\n off += 24;\n if (off >= 26) {\n off -= 26;\n j++;\n }\n }\n }\n return this._strip();\n };\n\n function parseHex4Bits (string, index) {\n var c = string.charCodeAt(index);\n // '0' - '9'\n if (c >= 48 && c <= 57) {\n return c - 48;\n // 'A' - 'F'\n } else if (c >= 65 && c <= 70) {\n return c - 55;\n // 'a' - 'f'\n } else if (c >= 97 && c <= 102) {\n return c - 87;\n } else {\n assert(false, 'Invalid character in ' + string);\n }\n }\n\n function parseHexByte (string, lowerBound, index) {\n var r = parseHex4Bits(string, index);\n if (index - 1 >= lowerBound) {\n r |= parseHex4Bits(string, index - 1) << 4;\n }\n return r;\n }\n\n BN.prototype._parseHex = function _parseHex (number, start, endian) {\n // Create possibly bigger array to ensure that it fits the number\n this.length = Math.ceil((number.length - start) / 6);\n this.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n this.words[i] = 0;\n }\n\n // 24-bits chunks\n var off = 0;\n var j = 0;\n\n var w;\n if (endian === 'be') {\n for (i = number.length - 1; i >= start; i -= 2) {\n w = parseHexByte(number, start, i) << off;\n this.words[j] |= w & 0x3ffffff;\n if (off >= 18) {\n off -= 18;\n j += 1;\n this.words[j] |= w >>> 26;\n } else {\n off += 8;\n }\n }\n } else {\n var parseLength = number.length - start;\n for (i = parseLength % 2 === 0 ? start + 1 : start; i < number.length; i += 2) {\n w = parseHexByte(number, start, i) << off;\n this.words[j] |= w & 0x3ffffff;\n if (off >= 18) {\n off -= 18;\n j += 1;\n this.words[j] |= w >>> 26;\n } else {\n off += 8;\n }\n }\n }\n\n this._strip();\n };\n\n function parseBase (str, start, end, mul) {\n var r = 0;\n var b = 0;\n var len = Math.min(str.length, end);\n for (var i = start; i < len; i++) {\n var c = str.charCodeAt(i) - 48;\n\n r *= mul;\n\n // 'a'\n if (c >= 49) {\n b = c - 49 + 0xa;\n\n // 'A'\n } else if (c >= 17) {\n b = c - 17 + 0xa;\n\n // '0' - '9'\n } else {\n b = c;\n }\n assert(c >= 0 && b < mul, 'Invalid character');\n r += b;\n }\n return r;\n }\n\n BN.prototype._parseBase = function _parseBase (number, base, start) {\n // Initialize as zero\n this.words = [0];\n this.length = 1;\n\n // Find length of limb in base\n for (var limbLen = 0, limbPow = 1; limbPow <= 0x3ffffff; limbPow *= base) {\n limbLen++;\n }\n limbLen--;\n limbPow = (limbPow / base) | 0;\n\n var total = number.length - start;\n var mod = total % limbLen;\n var end = Math.min(total, total - mod) + start;\n\n var word = 0;\n for (var i = start; i < end; i += limbLen) {\n word = parseBase(number, i, i + limbLen, base);\n\n this.imuln(limbPow);\n if (this.words[0] + word < 0x4000000) {\n this.words[0] += word;\n } else {\n this._iaddn(word);\n }\n }\n\n if (mod !== 0) {\n var pow = 1;\n word = parseBase(number, i, number.length, base);\n\n for (i = 0; i < mod; i++) {\n pow *= base;\n }\n\n this.imuln(pow);\n if (this.words[0] + word < 0x4000000) {\n this.words[0] += word;\n } else {\n this._iaddn(word);\n }\n }\n\n this._strip();\n };\n\n BN.prototype.copy = function copy (dest) {\n dest.words = new Array(this.length);\n for (var i = 0; i < this.length; i++) {\n dest.words[i] = this.words[i];\n }\n dest.length = this.length;\n dest.negative = this.negative;\n dest.red = this.red;\n };\n\n function move (dest, src) {\n dest.words = src.words;\n dest.length = src.length;\n dest.negative = src.negative;\n dest.red = src.red;\n }\n\n BN.prototype._move = function _move (dest) {\n move(dest, this);\n };\n\n BN.prototype.clone = function clone () {\n var r = new BN(null);\n this.copy(r);\n return r;\n };\n\n BN.prototype._expand = function _expand (size) {\n while (this.length < size) {\n this.words[this.length++] = 0;\n }\n return this;\n };\n\n // Remove leading `0` from `this`\n BN.prototype._strip = function strip () {\n while (this.length > 1 && this.words[this.length - 1] === 0) {\n this.length--;\n }\n return this._normSign();\n };\n\n BN.prototype._normSign = function _normSign () {\n // -0 = 0\n if (this.length === 1 && this.words[0] === 0) {\n this.negative = 0;\n }\n return this;\n };\n\n // Check Symbol.for because not everywhere where Symbol defined\n // See https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Symbol#Browser_compatibility\n if (typeof Symbol !== 'undefined' && typeof Symbol.for === 'function') {\n try {\n BN.prototype[Symbol.for('nodejs.util.inspect.custom')] = inspect;\n } catch (e) {\n BN.prototype.inspect = inspect;\n }\n } else {\n BN.prototype.inspect = inspect;\n }\n\n function inspect () {\n return (this.red ? '<BN-R: ' : '<BN: ') + this.toString(16) + '>';\n }\n\n /*\n\n var zeros = [];\n var groupSizes = [];\n var groupBases = [];\n\n var s = '';\n var i = -1;\n while (++i < BN.wordSize) {\n zeros[i] = s;\n s += '0';\n }\n groupSizes[0] = 0;\n groupSizes[1] = 0;\n groupBases[0] = 0;\n groupBases[1] = 0;\n var base = 2 - 1;\n while (++base < 36 + 1) {\n var groupSize = 0;\n var groupBase = 1;\n while (groupBase < (1 << BN.wordSize) / base) {\n groupBase *= base;\n groupSize += 1;\n }\n groupSizes[base] = groupSize;\n groupBases[base] = groupBase;\n }\n\n */\n\n var zeros = [\n '',\n '0',\n '00',\n '000',\n '0000',\n '00000',\n '000000',\n '0000000',\n '00000000',\n '000000000',\n '0000000000',\n '00000000000',\n '000000000000',\n '0000000000000',\n '00000000000000',\n '000000000000000',\n '0000000000000000',\n '00000000000000000',\n '000000000000000000',\n '0000000000000000000',\n '00000000000000000000',\n '000000000000000000000',\n '0000000000000000000000',\n '00000000000000000000000',\n '000000000000000000000000',\n '0000000000000000000000000'\n ];\n\n var groupSizes = [\n 0, 0,\n 25, 16, 12, 11, 10, 9, 8,\n 8, 7, 7, 7, 7, 6, 6,\n 6, 6, 6, 6, 6, 5, 5,\n 5, 5, 5, 5, 5, 5, 5,\n 5, 5, 5, 5, 5, 5, 5\n ];\n\n var groupBases = [\n 0, 0,\n 33554432, 43046721, 16777216, 48828125, 60466176, 40353607, 16777216,\n 43046721, 10000000, 19487171, 35831808, 62748517, 7529536, 11390625,\n 16777216, 24137569, 34012224, 47045881, 64000000, 4084101, 5153632,\n 6436343, 7962624, 9765625, 11881376, 14348907, 17210368, 20511149,\n 24300000, 28629151, 33554432, 39135393, 45435424, 52521875, 60466176\n ];\n\n BN.prototype.toString = function toString (base, padding) {\n base = base || 10;\n padding = padding | 0 || 1;\n\n var out;\n if (base === 16 || base === 'hex') {\n out = '';\n var off = 0;\n var carry = 0;\n for (var i = 0; i < this.length; i++) {\n var w = this.words[i];\n var word = (((w << off) | carry) & 0xffffff).toString(16);\n carry = (w >>> (24 - off)) & 0xffffff;\n off += 2;\n if (off >= 26) {\n off -= 26;\n i--;\n }\n if (carry !== 0 || i !== this.length - 1) {\n out = zeros[6 - word.length] + word + out;\n } else {\n out = word + out;\n }\n }\n if (carry !== 0) {\n out = carry.toString(16) + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\n }\n return out;\n }\n\n if (base === (base | 0) && base >= 2 && base <= 36) {\n // var groupSize = Math.floor(BN.wordSize * Math.LN2 / Math.log(base));\n var groupSize = groupSizes[base];\n // var groupBase = Math.pow(base, groupSize);\n var groupBase = groupBases[base];\n out = '';\n var c = this.clone();\n c.negative = 0;\n while (!c.isZero()) {\n var r = c.modrn(groupBase).toString(base);\n c = c.idivn(groupBase);\n\n if (!c.isZero()) {\n out = zeros[groupSize - r.length] + r + out;\n } else {\n out = r + out;\n }\n }\n if (this.isZero()) {\n out = '0' + out;\n }\n while (out.length % padding !== 0) {\n out = '0' + out;\n }\n if (this.negative !== 0) {\n out = '-' + out;\n }\n return out;\n }\n\n assert(false, 'Base should be between 2 and 36');\n };\n\n BN.prototype.toNumber = function toNumber () {\n var ret = this.words[0];\n if (this.length === 2) {\n ret += this.words[1] * 0x4000000;\n } else if (this.length === 3 && this.words[2] === 0x01) {\n // NOTE: at this stage it is known that the top bit is set\n ret += 0x10000000000000 + (this.words[1] * 0x4000000);\n } else if (this.length > 2) {\n assert(false, 'Number can only safely store up to 53 bits');\n }\n return (this.negative !== 0) ? -ret : ret;\n };\n\n BN.prototype.toJSON = function toJSON () {\n return this.toString(16, 2);\n };\n\n if (Buffer) {\n BN.prototype.toBuffer = function toBuffer (endian, length) {\n return this.toArrayLike(Buffer, endian, length);\n };\n }\n\n BN.prototype.toArray = function toArray (endian, length) {\n return this.toArrayLike(Array, endian, length);\n };\n\n var allocate = function allocate (ArrayType, size) {\n if (ArrayType.allocUnsafe) {\n return ArrayType.allocUnsafe(size);\n }\n return new ArrayType(size);\n };\n\n BN.prototype.toArrayLike = function toArrayLike (ArrayType, endian, length) {\n this._strip();\n\n var byteLength = this.byteLength();\n var reqLength = length || Math.max(1, byteLength);\n assert(byteLength <= reqLength, 'byte array longer than desired length');\n assert(reqLength > 0, 'Requested array length <= 0');\n\n var res = allocate(ArrayType, reqLength);\n var postfix = endian === 'le' ? 'LE' : 'BE';\n this['_toArrayLike' + postfix](res, byteLength);\n return res;\n };\n\n BN.prototype._toArrayLikeLE = function _toArrayLikeLE (res, byteLength) {\n var position = 0;\n var carry = 0;\n\n for (var i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n\n res[position++] = word & 0xff;\n if (position < res.length) {\n res[position++] = (word >> 8) & 0xff;\n }\n if (position < res.length) {\n res[position++] = (word >> 16) & 0xff;\n }\n\n if (shift === 6) {\n if (position < res.length) {\n res[position++] = (word >> 24) & 0xff;\n }\n carry = 0;\n shift = 0;\n } else {\n carry = word >>> 24;\n shift += 2;\n }\n }\n\n if (position < res.length) {\n res[position++] = carry;\n\n while (position < res.length) {\n res[position++] = 0;\n }\n }\n };\n\n BN.prototype._toArrayLikeBE = function _toArrayLikeBE (res, byteLength) {\n var position = res.length - 1;\n var carry = 0;\n\n for (var i = 0, shift = 0; i < this.length; i++) {\n var word = (this.words[i] << shift) | carry;\n\n res[position--] = word & 0xff;\n if (position >= 0) {\n res[position--] = (word >> 8) & 0xff;\n }\n if (position >= 0) {\n res[position--] = (word >> 16) & 0xff;\n }\n\n if (shift === 6) {\n if (position >= 0) {\n res[position--] = (word >> 24) & 0xff;\n }\n carry = 0;\n shift = 0;\n } else {\n carry = word >>> 24;\n shift += 2;\n }\n }\n\n if (position >= 0) {\n res[position--] = carry;\n\n while (position >= 0) {\n res[position--] = 0;\n }\n }\n };\n\n if (Math.clz32) {\n BN.prototype._countBits = function _countBits (w) {\n return 32 - Math.clz32(w);\n };\n } else {\n BN.prototype._countBits = function _countBits (w) {\n var t = w;\n var r = 0;\n if (t >= 0x1000) {\n r += 13;\n t >>>= 13;\n }\n if (t >= 0x40) {\n r += 7;\n t >>>= 7;\n }\n if (t >= 0x8) {\n r += 4;\n t >>>= 4;\n }\n if (t >= 0x02) {\n r += 2;\n t >>>= 2;\n }\n return r + t;\n };\n }\n\n BN.prototype._zeroBits = function _zeroBits (w) {\n // Short-cut\n if (w === 0) return 26;\n\n var t = w;\n var r = 0;\n if ((t & 0x1fff) === 0) {\n r += 13;\n t >>>= 13;\n }\n if ((t & 0x7f) === 0) {\n r += 7;\n t >>>= 7;\n }\n if ((t & 0xf) === 0) {\n r += 4;\n t >>>= 4;\n }\n if ((t & 0x3) === 0) {\n r += 2;\n t >>>= 2;\n }\n if ((t & 0x1) === 0) {\n r++;\n }\n return r;\n };\n\n // Return number of used bits in a BN\n BN.prototype.bitLength = function bitLength () {\n var w = this.words[this.length - 1];\n var hi = this._countBits(w);\n return (this.length - 1) * 26 + hi;\n };\n\n function toBitArray (num) {\n var w = new Array(num.bitLength());\n\n for (var bit = 0; bit < w.length; bit++) {\n var off = (bit / 26) | 0;\n var wbit = bit % 26;\n\n w[bit] = (num.words[off] >>> wbit) & 0x01;\n }\n\n return w;\n }\n\n // Number of trailing zero bits\n BN.prototype.zeroBits = function zeroBits () {\n if (this.isZero()) return 0;\n\n var r = 0;\n for (var i = 0; i < this.length; i++) {\n var b = this._zeroBits(this.words[i]);\n r += b;\n if (b !== 26) break;\n }\n return r;\n };\n\n BN.prototype.byteLength = function byteLength () {\n return Math.ceil(this.bitLength() / 8);\n };\n\n BN.prototype.toTwos = function toTwos (width) {\n if (this.negative !== 0) {\n return this.abs().inotn(width).iaddn(1);\n }\n return this.clone();\n };\n\n BN.prototype.fromTwos = function fromTwos (width) {\n if (this.testn(width - 1)) {\n return this.notn(width).iaddn(1).ineg();\n }\n return this.clone();\n };\n\n BN.prototype.isNeg = function isNeg () {\n return this.negative !== 0;\n };\n\n // Return negative clone of `this`\n BN.prototype.neg = function neg () {\n return this.clone().ineg();\n };\n\n BN.prototype.ineg = function ineg () {\n if (!this.isZero()) {\n this.negative ^= 1;\n }\n\n return this;\n };\n\n // Or `num` with `this` in-place\n BN.prototype.iuor = function iuor (num) {\n while (this.length < num.length) {\n this.words[this.length++] = 0;\n }\n\n for (var i = 0; i < num.length; i++) {\n this.words[i] = this.words[i] | num.words[i];\n }\n\n return this._strip();\n };\n\n BN.prototype.ior = function ior (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuor(num);\n };\n\n // Or `num` with `this`\n BN.prototype.or = function or (num) {\n if (this.length > num.length) return this.clone().ior(num);\n return num.clone().ior(this);\n };\n\n BN.prototype.uor = function uor (num) {\n if (this.length > num.length) return this.clone().iuor(num);\n return num.clone().iuor(this);\n };\n\n // And `num` with `this` in-place\n BN.prototype.iuand = function iuand (num) {\n // b = min-length(num, this)\n var b;\n if (this.length > num.length) {\n b = num;\n } else {\n b = this;\n }\n\n for (var i = 0; i < b.length; i++) {\n this.words[i] = this.words[i] & num.words[i];\n }\n\n this.length = b.length;\n\n return this._strip();\n };\n\n BN.prototype.iand = function iand (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuand(num);\n };\n\n // And `num` with `this`\n BN.prototype.and = function and (num) {\n if (this.length > num.length) return this.clone().iand(num);\n return num.clone().iand(this);\n };\n\n BN.prototype.uand = function uand (num) {\n if (this.length > num.length) return this.clone().iuand(num);\n return num.clone().iuand(this);\n };\n\n // Xor `num` with `this` in-place\n BN.prototype.iuxor = function iuxor (num) {\n // a.length > b.length\n var a;\n var b;\n if (this.length > num.length) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n for (var i = 0; i < b.length; i++) {\n this.words[i] = a.words[i] ^ b.words[i];\n }\n\n if (this !== a) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n this.length = a.length;\n\n return this._strip();\n };\n\n BN.prototype.ixor = function ixor (num) {\n assert((this.negative | num.negative) === 0);\n return this.iuxor(num);\n };\n\n // Xor `num` with `this`\n BN.prototype.xor = function xor (num) {\n if (this.length > num.length) return this.clone().ixor(num);\n return num.clone().ixor(this);\n };\n\n BN.prototype.uxor = function uxor (num) {\n if (this.length > num.length) return this.clone().iuxor(num);\n return num.clone().iuxor(this);\n };\n\n // Not ``this`` with ``width`` bitwidth\n BN.prototype.inotn = function inotn (width) {\n assert(typeof width === 'number' && width >= 0);\n\n var bytesNeeded = Math.ceil(width / 26) | 0;\n var bitsLeft = width % 26;\n\n // Extend the buffer with leading zeroes\n this._expand(bytesNeeded);\n\n if (bitsLeft > 0) {\n bytesNeeded--;\n }\n\n // Handle complete words\n for (var i = 0; i < bytesNeeded; i++) {\n this.words[i] = ~this.words[i] & 0x3ffffff;\n }\n\n // Handle the residue\n if (bitsLeft > 0) {\n this.words[i] = ~this.words[i] & (0x3ffffff >> (26 - bitsLeft));\n }\n\n // And remove leading zeroes\n return this._strip();\n };\n\n BN.prototype.notn = function notn (width) {\n return this.clone().inotn(width);\n };\n\n // Set `bit` of `this`\n BN.prototype.setn = function setn (bit, val) {\n assert(typeof bit === 'number' && bit >= 0);\n\n var off = (bit / 26) | 0;\n var wbit = bit % 26;\n\n this._expand(off + 1);\n\n if (val) {\n this.words[off] = this.words[off] | (1 << wbit);\n } else {\n this.words[off] = this.words[off] & ~(1 << wbit);\n }\n\n return this._strip();\n };\n\n // Add `num` to `this` in-place\n BN.prototype.iadd = function iadd (num) {\n var r;\n\n // negative + positive\n if (this.negative !== 0 && num.negative === 0) {\n this.negative = 0;\n r = this.isub(num);\n this.negative ^= 1;\n return this._normSign();\n\n // positive + negative\n } else if (this.negative === 0 && num.negative !== 0) {\n num.negative = 0;\n r = this.isub(num);\n num.negative = 1;\n return r._normSign();\n }\n\n // a.length > b.length\n var a, b;\n if (this.length > num.length) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n var carry = 0;\n for (var i = 0; i < b.length; i++) {\n r = (a.words[i] | 0) + (b.words[i] | 0) + carry;\n this.words[i] = r & 0x3ffffff;\n carry = r >>> 26;\n }\n for (; carry !== 0 && i < a.length; i++) {\n r = (a.words[i] | 0) + carry;\n this.words[i] = r & 0x3ffffff;\n carry = r >>> 26;\n }\n\n this.length = a.length;\n if (carry !== 0) {\n this.words[this.length] = carry;\n this.length++;\n // Copy the rest of the words\n } else if (a !== this) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n return this;\n };\n\n // Add `num` to `this`\n BN.prototype.add = function add (num) {\n var res;\n if (num.negative !== 0 && this.negative === 0) {\n num.negative = 0;\n res = this.sub(num);\n num.negative ^= 1;\n return res;\n } else if (num.negative === 0 && this.negative !== 0) {\n this.negative = 0;\n res = num.sub(this);\n this.negative = 1;\n return res;\n }\n\n if (this.length > num.length) return this.clone().iadd(num);\n\n return num.clone().iadd(this);\n };\n\n // Subtract `num` from `this` in-place\n BN.prototype.isub = function isub (num) {\n // this - (-num) = this + num\n if (num.negative !== 0) {\n num.negative = 0;\n var r = this.iadd(num);\n num.negative = 1;\n return r._normSign();\n\n // -this - num = -(this + num)\n } else if (this.negative !== 0) {\n this.negative = 0;\n this.iadd(num);\n this.negative = 1;\n return this._normSign();\n }\n\n // At this point both numbers are positive\n var cmp = this.cmp(num);\n\n // Optimization - zeroify\n if (cmp === 0) {\n this.negative = 0;\n this.length = 1;\n this.words[0] = 0;\n return this;\n }\n\n // a > b\n var a, b;\n if (cmp > 0) {\n a = this;\n b = num;\n } else {\n a = num;\n b = this;\n }\n\n var carry = 0;\n for (var i = 0; i < b.length; i++) {\n r = (a.words[i] | 0) - (b.words[i] | 0) + carry;\n carry = r >> 26;\n this.words[i] = r & 0x3ffffff;\n }\n for (; carry !== 0 && i < a.length; i++) {\n r = (a.words[i] | 0) + carry;\n carry = r >> 26;\n this.words[i] = r & 0x3ffffff;\n }\n\n // Copy rest of the words\n if (carry === 0 && i < a.length && a !== this) {\n for (; i < a.length; i++) {\n this.words[i] = a.words[i];\n }\n }\n\n this.length = Math.max(this.length, i);\n\n if (a !== this) {\n this.negative = 1;\n }\n\n return this._strip();\n };\n\n // Subtract `num` from `this`\n BN.prototype.sub = function sub (num) {\n return this.clone().isub(num);\n };\n\n function smallMulTo (self, num, out) {\n out.negative = num.negative ^ self.negative;\n var len = (self.length + num.length) | 0;\n out.length = len;\n len = (len - 1) | 0;\n\n // Peel one iteration (compiler can't do it, because of code complexity)\n var a = self.words[0] | 0;\n var b = num.words[0] | 0;\n var r = a * b;\n\n var lo = r & 0x3ffffff;\n var carry = (r / 0x4000000) | 0;\n out.words[0] = lo;\n\n for (var k = 1; k < len; k++) {\n // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n // note that ncarry could be >= 0x3ffffff\n var ncarry = carry >>> 26;\n var rword = carry & 0x3ffffff;\n var maxJ = Math.min(k, num.length - 1);\n for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n var i = (k - j) | 0;\n a = self.words[i] | 0;\n b = num.words[j] | 0;\n r = a * b + rword;\n ncarry += (r / 0x4000000) | 0;\n rword = r & 0x3ffffff;\n }\n out.words[k] = rword | 0;\n carry = ncarry | 0;\n }\n if (carry !== 0) {\n out.words[k] = carry | 0;\n } else {\n out.length--;\n }\n\n return out._strip();\n }\n\n // TODO(indutny): it may be reasonable to omit it for users who don't need\n // to work with 256-bit numbers, otherwise it gives 20% improvement for 256-bit\n // multiplication (like elliptic secp256k1).\n var comb10MulTo = function comb10MulTo (self, num, out) {\n var a = self.words;\n var b = num.words;\n var o = out.words;\n var c = 0;\n var lo;\n var mid;\n var hi;\n var a0 = a[0] | 0;\n var al0 = a0 & 0x1fff;\n var ah0 = a0 >>> 13;\n var a1 = a[1] | 0;\n var al1 = a1 & 0x1fff;\n var ah1 = a1 >>> 13;\n var a2 = a[2] | 0;\n var al2 = a2 & 0x1fff;\n var ah2 = a2 >>> 13;\n var a3 = a[3] | 0;\n var al3 = a3 & 0x1fff;\n var ah3 = a3 >>> 13;\n var a4 = a[4] | 0;\n var al4 = a4 & 0x1fff;\n var ah4 = a4 >>> 13;\n var a5 = a[5] | 0;\n var al5 = a5 & 0x1fff;\n var ah5 = a5 >>> 13;\n var a6 = a[6] | 0;\n var al6 = a6 & 0x1fff;\n var ah6 = a6 >>> 13;\n var a7 = a[7] | 0;\n var al7 = a7 & 0x1fff;\n var ah7 = a7 >>> 13;\n var a8 = a[8] | 0;\n var al8 = a8 & 0x1fff;\n var ah8 = a8 >>> 13;\n var a9 = a[9] | 0;\n var al9 = a9 & 0x1fff;\n var ah9 = a9 >>> 13;\n var b0 = b[0] | 0;\n var bl0 = b0 & 0x1fff;\n var bh0 = b0 >>> 13;\n var b1 = b[1] | 0;\n var bl1 = b1 & 0x1fff;\n var bh1 = b1 >>> 13;\n var b2 = b[2] | 0;\n var bl2 = b2 & 0x1fff;\n var bh2 = b2 >>> 13;\n var b3 = b[3] | 0;\n var bl3 = b3 & 0x1fff;\n var bh3 = b3 >>> 13;\n var b4 = b[4] | 0;\n var bl4 = b4 & 0x1fff;\n var bh4 = b4 >>> 13;\n var b5 = b[5] | 0;\n var bl5 = b5 & 0x1fff;\n var bh5 = b5 >>> 13;\n var b6 = b[6] | 0;\n var bl6 = b6 & 0x1fff;\n var bh6 = b6 >>> 13;\n var b7 = b[7] | 0;\n var bl7 = b7 & 0x1fff;\n var bh7 = b7 >>> 13;\n var b8 = b[8] | 0;\n var bl8 = b8 & 0x1fff;\n var bh8 = b8 >>> 13;\n var b9 = b[9] | 0;\n var bl9 = b9 & 0x1fff;\n var bh9 = b9 >>> 13;\n\n out.negative = self.negative ^ num.negative;\n out.length = 19;\n /* k = 0 */\n lo = Math.imul(al0, bl0);\n mid = Math.imul(al0, bh0);\n mid = (mid + Math.imul(ah0, bl0)) | 0;\n hi = Math.imul(ah0, bh0);\n var w0 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w0 >>> 26)) | 0;\n w0 &= 0x3ffffff;\n /* k = 1 */\n lo = Math.imul(al1, bl0);\n mid = Math.imul(al1, bh0);\n mid = (mid + Math.imul(ah1, bl0)) | 0;\n hi = Math.imul(ah1, bh0);\n lo = (lo + Math.imul(al0, bl1)) | 0;\n mid = (mid + Math.imul(al0, bh1)) | 0;\n mid = (mid + Math.imul(ah0, bl1)) | 0;\n hi = (hi + Math.imul(ah0, bh1)) | 0;\n var w1 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w1 >>> 26)) | 0;\n w1 &= 0x3ffffff;\n /* k = 2 */\n lo = Math.imul(al2, bl0);\n mid = Math.imul(al2, bh0);\n mid = (mid + Math.imul(ah2, bl0)) | 0;\n hi = Math.imul(ah2, bh0);\n lo = (lo + Math.imul(al1, bl1)) | 0;\n mid = (mid + Math.imul(al1, bh1)) | 0;\n mid = (mid + Math.imul(ah1, bl1)) | 0;\n hi = (hi + Math.imul(ah1, bh1)) | 0;\n lo = (lo + Math.imul(al0, bl2)) | 0;\n mid = (mid + Math.imul(al0, bh2)) | 0;\n mid = (mid + Math.imul(ah0, bl2)) | 0;\n hi = (hi + Math.imul(ah0, bh2)) | 0;\n var w2 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w2 >>> 26)) | 0;\n w2 &= 0x3ffffff;\n /* k = 3 */\n lo = Math.imul(al3, bl0);\n mid = Math.imul(al3, bh0);\n mid = (mid + Math.imul(ah3, bl0)) | 0;\n hi = Math.imul(ah3, bh0);\n lo = (lo + Math.imul(al2, bl1)) | 0;\n mid = (mid + Math.imul(al2, bh1)) | 0;\n mid = (mid + Math.imul(ah2, bl1)) | 0;\n hi = (hi + Math.imul(ah2, bh1)) | 0;\n lo = (lo + Math.imul(al1, bl2)) | 0;\n mid = (mid + Math.imul(al1, bh2)) | 0;\n mid = (mid + Math.imul(ah1, bl2)) | 0;\n hi = (hi + Math.imul(ah1, bh2)) | 0;\n lo = (lo + Math.imul(al0, bl3)) | 0;\n mid = (mid + Math.imul(al0, bh3)) | 0;\n mid = (mid + Math.imul(ah0, bl3)) | 0;\n hi = (hi + Math.imul(ah0, bh3)) | 0;\n var w3 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w3 >>> 26)) | 0;\n w3 &= 0x3ffffff;\n /* k = 4 */\n lo = Math.imul(al4, bl0);\n mid = Math.imul(al4, bh0);\n mid = (mid + Math.imul(ah4, bl0)) | 0;\n hi = Math.imul(ah4, bh0);\n lo = (lo + Math.imul(al3, bl1)) | 0;\n mid = (mid + Math.imul(al3, bh1)) | 0;\n mid = (mid + Math.imul(ah3, bl1)) | 0;\n hi = (hi + Math.imul(ah3, bh1)) | 0;\n lo = (lo + Math.imul(al2, bl2)) | 0;\n mid = (mid + Math.imul(al2, bh2)) | 0;\n mid = (mid + Math.imul(ah2, bl2)) | 0;\n hi = (hi + Math.imul(ah2, bh2)) | 0;\n lo = (lo + Math.imul(al1, bl3)) | 0;\n mid = (mid + Math.imul(al1, bh3)) | 0;\n mid = (mid + Math.imul(ah1, bl3)) | 0;\n hi = (hi + Math.imul(ah1, bh3)) | 0;\n lo = (lo + Math.imul(al0, bl4)) | 0;\n mid = (mid + Math.imul(al0, bh4)) | 0;\n mid = (mid + Math.imul(ah0, bl4)) | 0;\n hi = (hi + Math.imul(ah0, bh4)) | 0;\n var w4 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w4 >>> 26)) | 0;\n w4 &= 0x3ffffff;\n /* k = 5 */\n lo = Math.imul(al5, bl0);\n mid = Math.imul(al5, bh0);\n mid = (mid + Math.imul(ah5, bl0)) | 0;\n hi = Math.imul(ah5, bh0);\n lo = (lo + Math.imul(al4, bl1)) | 0;\n mid = (mid + Math.imul(al4, bh1)) | 0;\n mid = (mid + Math.imul(ah4, bl1)) | 0;\n hi = (hi + Math.imul(ah4, bh1)) | 0;\n lo = (lo + Math.imul(al3, bl2)) | 0;\n mid = (mid + Math.imul(al3, bh2)) | 0;\n mid = (mid + Math.imul(ah3, bl2)) | 0;\n hi = (hi + Math.imul(ah3, bh2)) | 0;\n lo = (lo + Math.imul(al2, bl3)) | 0;\n mid = (mid + Math.imul(al2, bh3)) | 0;\n mid = (mid + Math.imul(ah2, bl3)) | 0;\n hi = (hi + Math.imul(ah2, bh3)) | 0;\n lo = (lo + Math.imul(al1, bl4)) | 0;\n mid = (mid + Math.imul(al1, bh4)) | 0;\n mid = (mid + Math.imul(ah1, bl4)) | 0;\n hi = (hi + Math.imul(ah1, bh4)) | 0;\n lo = (lo + Math.imul(al0, bl5)) | 0;\n mid = (mid + Math.imul(al0, bh5)) | 0;\n mid = (mid + Math.imul(ah0, bl5)) | 0;\n hi = (hi + Math.imul(ah0, bh5)) | 0;\n var w5 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w5 >>> 26)) | 0;\n w5 &= 0x3ffffff;\n /* k = 6 */\n lo = Math.imul(al6, bl0);\n mid = Math.imul(al6, bh0);\n mid = (mid + Math.imul(ah6, bl0)) | 0;\n hi = Math.imul(ah6, bh0);\n lo = (lo + Math.imul(al5, bl1)) | 0;\n mid = (mid + Math.imul(al5, bh1)) | 0;\n mid = (mid + Math.imul(ah5, bl1)) | 0;\n hi = (hi + Math.imul(ah5, bh1)) | 0;\n lo = (lo + Math.imul(al4, bl2)) | 0;\n mid = (mid + Math.imul(al4, bh2)) | 0;\n mid = (mid + Math.imul(ah4, bl2)) | 0;\n hi = (hi + Math.imul(ah4, bh2)) | 0;\n lo = (lo + Math.imul(al3, bl3)) | 0;\n mid = (mid + Math.imul(al3, bh3)) | 0;\n mid = (mid + Math.imul(ah3, bl3)) | 0;\n hi = (hi + Math.imul(ah3, bh3)) | 0;\n lo = (lo + Math.imul(al2, bl4)) | 0;\n mid = (mid + Math.imul(al2, bh4)) | 0;\n mid = (mid + Math.imul(ah2, bl4)) | 0;\n hi = (hi + Math.imul(ah2, bh4)) | 0;\n lo = (lo + Math.imul(al1, bl5)) | 0;\n mid = (mid + Math.imul(al1, bh5)) | 0;\n mid = (mid + Math.imul(ah1, bl5)) | 0;\n hi = (hi + Math.imul(ah1, bh5)) | 0;\n lo = (lo + Math.imul(al0, bl6)) | 0;\n mid = (mid + Math.imul(al0, bh6)) | 0;\n mid = (mid + Math.imul(ah0, bl6)) | 0;\n hi = (hi + Math.imul(ah0, bh6)) | 0;\n var w6 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w6 >>> 26)) | 0;\n w6 &= 0x3ffffff;\n /* k = 7 */\n lo = Math.imul(al7, bl0);\n mid = Math.imul(al7, bh0);\n mid = (mid + Math.imul(ah7, bl0)) | 0;\n hi = Math.imul(ah7, bh0);\n lo = (lo + Math.imul(al6, bl1)) | 0;\n mid = (mid + Math.imul(al6, bh1)) | 0;\n mid = (mid + Math.imul(ah6, bl1)) | 0;\n hi = (hi + Math.imul(ah6, bh1)) | 0;\n lo = (lo + Math.imul(al5, bl2)) | 0;\n mid = (mid + Math.imul(al5, bh2)) | 0;\n mid = (mid + Math.imul(ah5, bl2)) | 0;\n hi = (hi + Math.imul(ah5, bh2)) | 0;\n lo = (lo + Math.imul(al4, bl3)) | 0;\n mid = (mid + Math.imul(al4, bh3)) | 0;\n mid = (mid + Math.imul(ah4, bl3)) | 0;\n hi = (hi + Math.imul(ah4, bh3)) | 0;\n lo = (lo + Math.imul(al3, bl4)) | 0;\n mid = (mid + Math.imul(al3, bh4)) | 0;\n mid = (mid + Math.imul(ah3, bl4)) | 0;\n hi = (hi + Math.imul(ah3, bh4)) | 0;\n lo = (lo + Math.imul(al2, bl5)) | 0;\n mid = (mid + Math.imul(al2, bh5)) | 0;\n mid = (mid + Math.imul(ah2, bl5)) | 0;\n hi = (hi + Math.imul(ah2, bh5)) | 0;\n lo = (lo + Math.imul(al1, bl6)) | 0;\n mid = (mid + Math.imul(al1, bh6)) | 0;\n mid = (mid + Math.imul(ah1, bl6)) | 0;\n hi = (hi + Math.imul(ah1, bh6)) | 0;\n lo = (lo + Math.imul(al0, bl7)) | 0;\n mid = (mid + Math.imul(al0, bh7)) | 0;\n mid = (mid + Math.imul(ah0, bl7)) | 0;\n hi = (hi + Math.imul(ah0, bh7)) | 0;\n var w7 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w7 >>> 26)) | 0;\n w7 &= 0x3ffffff;\n /* k = 8 */\n lo = Math.imul(al8, bl0);\n mid = Math.imul(al8, bh0);\n mid = (mid + Math.imul(ah8, bl0)) | 0;\n hi = Math.imul(ah8, bh0);\n lo = (lo + Math.imul(al7, bl1)) | 0;\n mid = (mid + Math.imul(al7, bh1)) | 0;\n mid = (mid + Math.imul(ah7, bl1)) | 0;\n hi = (hi + Math.imul(ah7, bh1)) | 0;\n lo = (lo + Math.imul(al6, bl2)) | 0;\n mid = (mid + Math.imul(al6, bh2)) | 0;\n mid = (mid + Math.imul(ah6, bl2)) | 0;\n hi = (hi + Math.imul(ah6, bh2)) | 0;\n lo = (lo + Math.imul(al5, bl3)) | 0;\n mid = (mid + Math.imul(al5, bh3)) | 0;\n mid = (mid + Math.imul(ah5, bl3)) | 0;\n hi = (hi + Math.imul(ah5, bh3)) | 0;\n lo = (lo + Math.imul(al4, bl4)) | 0;\n mid = (mid + Math.imul(al4, bh4)) | 0;\n mid = (mid + Math.imul(ah4, bl4)) | 0;\n hi = (hi + Math.imul(ah4, bh4)) | 0;\n lo = (lo + Math.imul(al3, bl5)) | 0;\n mid = (mid + Math.imul(al3, bh5)) | 0;\n mid = (mid + Math.imul(ah3, bl5)) | 0;\n hi = (hi + Math.imul(ah3, bh5)) | 0;\n lo = (lo + Math.imul(al2, bl6)) | 0;\n mid = (mid + Math.imul(al2, bh6)) | 0;\n mid = (mid + Math.imul(ah2, bl6)) | 0;\n hi = (hi + Math.imul(ah2, bh6)) | 0;\n lo = (lo + Math.imul(al1, bl7)) | 0;\n mid = (mid + Math.imul(al1, bh7)) | 0;\n mid = (mid + Math.imul(ah1, bl7)) | 0;\n hi = (hi + Math.imul(ah1, bh7)) | 0;\n lo = (lo + Math.imul(al0, bl8)) | 0;\n mid = (mid + Math.imul(al0, bh8)) | 0;\n mid = (mid + Math.imul(ah0, bl8)) | 0;\n hi = (hi + Math.imul(ah0, bh8)) | 0;\n var w8 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w8 >>> 26)) | 0;\n w8 &= 0x3ffffff;\n /* k = 9 */\n lo = Math.imul(al9, bl0);\n mid = Math.imul(al9, bh0);\n mid = (mid + Math.imul(ah9, bl0)) | 0;\n hi = Math.imul(ah9, bh0);\n lo = (lo + Math.imul(al8, bl1)) | 0;\n mid = (mid + Math.imul(al8, bh1)) | 0;\n mid = (mid + Math.imul(ah8, bl1)) | 0;\n hi = (hi + Math.imul(ah8, bh1)) | 0;\n lo = (lo + Math.imul(al7, bl2)) | 0;\n mid = (mid + Math.imul(al7, bh2)) | 0;\n mid = (mid + Math.imul(ah7, bl2)) | 0;\n hi = (hi + Math.imul(ah7, bh2)) | 0;\n lo = (lo + Math.imul(al6, bl3)) | 0;\n mid = (mid + Math.imul(al6, bh3)) | 0;\n mid = (mid + Math.imul(ah6, bl3)) | 0;\n hi = (hi + Math.imul(ah6, bh3)) | 0;\n lo = (lo + Math.imul(al5, bl4)) | 0;\n mid = (mid + Math.imul(al5, bh4)) | 0;\n mid = (mid + Math.imul(ah5, bl4)) | 0;\n hi = (hi + Math.imul(ah5, bh4)) | 0;\n lo = (lo + Math.imul(al4, bl5)) | 0;\n mid = (mid + Math.imul(al4, bh5)) | 0;\n mid = (mid + Math.imul(ah4, bl5)) | 0;\n hi = (hi + Math.imul(ah4, bh5)) | 0;\n lo = (lo + Math.imul(al3, bl6)) | 0;\n mid = (mid + Math.imul(al3, bh6)) | 0;\n mid = (mid + Math.imul(ah3, bl6)) | 0;\n hi = (hi + Math.imul(ah3, bh6)) | 0;\n lo = (lo + Math.imul(al2, bl7)) | 0;\n mid = (mid + Math.imul(al2, bh7)) | 0;\n mid = (mid + Math.imul(ah2, bl7)) | 0;\n hi = (hi + Math.imul(ah2, bh7)) | 0;\n lo = (lo + Math.imul(al1, bl8)) | 0;\n mid = (mid + Math.imul(al1, bh8)) | 0;\n mid = (mid + Math.imul(ah1, bl8)) | 0;\n hi = (hi + Math.imul(ah1, bh8)) | 0;\n lo = (lo + Math.imul(al0, bl9)) | 0;\n mid = (mid + Math.imul(al0, bh9)) | 0;\n mid = (mid + Math.imul(ah0, bl9)) | 0;\n hi = (hi + Math.imul(ah0, bh9)) | 0;\n var w9 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w9 >>> 26)) | 0;\n w9 &= 0x3ffffff;\n /* k = 10 */\n lo = Math.imul(al9, bl1);\n mid = Math.imul(al9, bh1);\n mid = (mid + Math.imul(ah9, bl1)) | 0;\n hi = Math.imul(ah9, bh1);\n lo = (lo + Math.imul(al8, bl2)) | 0;\n mid = (mid + Math.imul(al8, bh2)) | 0;\n mid = (mid + Math.imul(ah8, bl2)) | 0;\n hi = (hi + Math.imul(ah8, bh2)) | 0;\n lo = (lo + Math.imul(al7, bl3)) | 0;\n mid = (mid + Math.imul(al7, bh3)) | 0;\n mid = (mid + Math.imul(ah7, bl3)) | 0;\n hi = (hi + Math.imul(ah7, bh3)) | 0;\n lo = (lo + Math.imul(al6, bl4)) | 0;\n mid = (mid + Math.imul(al6, bh4)) | 0;\n mid = (mid + Math.imul(ah6, bl4)) | 0;\n hi = (hi + Math.imul(ah6, bh4)) | 0;\n lo = (lo + Math.imul(al5, bl5)) | 0;\n mid = (mid + Math.imul(al5, bh5)) | 0;\n mid = (mid + Math.imul(ah5, bl5)) | 0;\n hi = (hi + Math.imul(ah5, bh5)) | 0;\n lo = (lo + Math.imul(al4, bl6)) | 0;\n mid = (mid + Math.imul(al4, bh6)) | 0;\n mid = (mid + Math.imul(ah4, bl6)) | 0;\n hi = (hi + Math.imul(ah4, bh6)) | 0;\n lo = (lo + Math.imul(al3, bl7)) | 0;\n mid = (mid + Math.imul(al3, bh7)) | 0;\n mid = (mid + Math.imul(ah3, bl7)) | 0;\n hi = (hi + Math.imul(ah3, bh7)) | 0;\n lo = (lo + Math.imul(al2, bl8)) | 0;\n mid = (mid + Math.imul(al2, bh8)) | 0;\n mid = (mid + Math.imul(ah2, bl8)) | 0;\n hi = (hi + Math.imul(ah2, bh8)) | 0;\n lo = (lo + Math.imul(al1, bl9)) | 0;\n mid = (mid + Math.imul(al1, bh9)) | 0;\n mid = (mid + Math.imul(ah1, bl9)) | 0;\n hi = (hi + Math.imul(ah1, bh9)) | 0;\n var w10 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w10 >>> 26)) | 0;\n w10 &= 0x3ffffff;\n /* k = 11 */\n lo = Math.imul(al9, bl2);\n mid = Math.imul(al9, bh2);\n mid = (mid + Math.imul(ah9, bl2)) | 0;\n hi = Math.imul(ah9, bh2);\n lo = (lo + Math.imul(al8, bl3)) | 0;\n mid = (mid + Math.imul(al8, bh3)) | 0;\n mid = (mid + Math.imul(ah8, bl3)) | 0;\n hi = (hi + Math.imul(ah8, bh3)) | 0;\n lo = (lo + Math.imul(al7, bl4)) | 0;\n mid = (mid + Math.imul(al7, bh4)) | 0;\n mid = (mid + Math.imul(ah7, bl4)) | 0;\n hi = (hi + Math.imul(ah7, bh4)) | 0;\n lo = (lo + Math.imul(al6, bl5)) | 0;\n mid = (mid + Math.imul(al6, bh5)) | 0;\n mid = (mid + Math.imul(ah6, bl5)) | 0;\n hi = (hi + Math.imul(ah6, bh5)) | 0;\n lo = (lo + Math.imul(al5, bl6)) | 0;\n mid = (mid + Math.imul(al5, bh6)) | 0;\n mid = (mid + Math.imul(ah5, bl6)) | 0;\n hi = (hi + Math.imul(ah5, bh6)) | 0;\n lo = (lo + Math.imul(al4, bl7)) | 0;\n mid = (mid + Math.imul(al4, bh7)) | 0;\n mid = (mid + Math.imul(ah4, bl7)) | 0;\n hi = (hi + Math.imul(ah4, bh7)) | 0;\n lo = (lo + Math.imul(al3, bl8)) | 0;\n mid = (mid + Math.imul(al3, bh8)) | 0;\n mid = (mid + Math.imul(ah3, bl8)) | 0;\n hi = (hi + Math.imul(ah3, bh8)) | 0;\n lo = (lo + Math.imul(al2, bl9)) | 0;\n mid = (mid + Math.imul(al2, bh9)) | 0;\n mid = (mid + Math.imul(ah2, bl9)) | 0;\n hi = (hi + Math.imul(ah2, bh9)) | 0;\n var w11 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w11 >>> 26)) | 0;\n w11 &= 0x3ffffff;\n /* k = 12 */\n lo = Math.imul(al9, bl3);\n mid = Math.imul(al9, bh3);\n mid = (mid + Math.imul(ah9, bl3)) | 0;\n hi = Math.imul(ah9, bh3);\n lo = (lo + Math.imul(al8, bl4)) | 0;\n mid = (mid + Math.imul(al8, bh4)) | 0;\n mid = (mid + Math.imul(ah8, bl4)) | 0;\n hi = (hi + Math.imul(ah8, bh4)) | 0;\n lo = (lo + Math.imul(al7, bl5)) | 0;\n mid = (mid + Math.imul(al7, bh5)) | 0;\n mid = (mid + Math.imul(ah7, bl5)) | 0;\n hi = (hi + Math.imul(ah7, bh5)) | 0;\n lo = (lo + Math.imul(al6, bl6)) | 0;\n mid = (mid + Math.imul(al6, bh6)) | 0;\n mid = (mid + Math.imul(ah6, bl6)) | 0;\n hi = (hi + Math.imul(ah6, bh6)) | 0;\n lo = (lo + Math.imul(al5, bl7)) | 0;\n mid = (mid + Math.imul(al5, bh7)) | 0;\n mid = (mid + Math.imul(ah5, bl7)) | 0;\n hi = (hi + Math.imul(ah5, bh7)) | 0;\n lo = (lo + Math.imul(al4, bl8)) | 0;\n mid = (mid + Math.imul(al4, bh8)) | 0;\n mid = (mid + Math.imul(ah4, bl8)) | 0;\n hi = (hi + Math.imul(ah4, bh8)) | 0;\n lo = (lo + Math.imul(al3, bl9)) | 0;\n mid = (mid + Math.imul(al3, bh9)) | 0;\n mid = (mid + Math.imul(ah3, bl9)) | 0;\n hi = (hi + Math.imul(ah3, bh9)) | 0;\n var w12 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w12 >>> 26)) | 0;\n w12 &= 0x3ffffff;\n /* k = 13 */\n lo = Math.imul(al9, bl4);\n mid = Math.imul(al9, bh4);\n mid = (mid + Math.imul(ah9, bl4)) | 0;\n hi = Math.imul(ah9, bh4);\n lo = (lo + Math.imul(al8, bl5)) | 0;\n mid = (mid + Math.imul(al8, bh5)) | 0;\n mid = (mid + Math.imul(ah8, bl5)) | 0;\n hi = (hi + Math.imul(ah8, bh5)) | 0;\n lo = (lo + Math.imul(al7, bl6)) | 0;\n mid = (mid + Math.imul(al7, bh6)) | 0;\n mid = (mid + Math.imul(ah7, bl6)) | 0;\n hi = (hi + Math.imul(ah7, bh6)) | 0;\n lo = (lo + Math.imul(al6, bl7)) | 0;\n mid = (mid + Math.imul(al6, bh7)) | 0;\n mid = (mid + Math.imul(ah6, bl7)) | 0;\n hi = (hi + Math.imul(ah6, bh7)) | 0;\n lo = (lo + Math.imul(al5, bl8)) | 0;\n mid = (mid + Math.imul(al5, bh8)) | 0;\n mid = (mid + Math.imul(ah5, bl8)) | 0;\n hi = (hi + Math.imul(ah5, bh8)) | 0;\n lo = (lo + Math.imul(al4, bl9)) | 0;\n mid = (mid + Math.imul(al4, bh9)) | 0;\n mid = (mid + Math.imul(ah4, bl9)) | 0;\n hi = (hi + Math.imul(ah4, bh9)) | 0;\n var w13 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w13 >>> 26)) | 0;\n w13 &= 0x3ffffff;\n /* k = 14 */\n lo = Math.imul(al9, bl5);\n mid = Math.imul(al9, bh5);\n mid = (mid + Math.imul(ah9, bl5)) | 0;\n hi = Math.imul(ah9, bh5);\n lo = (lo + Math.imul(al8, bl6)) | 0;\n mid = (mid + Math.imul(al8, bh6)) | 0;\n mid = (mid + Math.imul(ah8, bl6)) | 0;\n hi = (hi + Math.imul(ah8, bh6)) | 0;\n lo = (lo + Math.imul(al7, bl7)) | 0;\n mid = (mid + Math.imul(al7, bh7)) | 0;\n mid = (mid + Math.imul(ah7, bl7)) | 0;\n hi = (hi + Math.imul(ah7, bh7)) | 0;\n lo = (lo + Math.imul(al6, bl8)) | 0;\n mid = (mid + Math.imul(al6, bh8)) | 0;\n mid = (mid + Math.imul(ah6, bl8)) | 0;\n hi = (hi + Math.imul(ah6, bh8)) | 0;\n lo = (lo + Math.imul(al5, bl9)) | 0;\n mid = (mid + Math.imul(al5, bh9)) | 0;\n mid = (mid + Math.imul(ah5, bl9)) | 0;\n hi = (hi + Math.imul(ah5, bh9)) | 0;\n var w14 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w14 >>> 26)) | 0;\n w14 &= 0x3ffffff;\n /* k = 15 */\n lo = Math.imul(al9, bl6);\n mid = Math.imul(al9, bh6);\n mid = (mid + Math.imul(ah9, bl6)) | 0;\n hi = Math.imul(ah9, bh6);\n lo = (lo + Math.imul(al8, bl7)) | 0;\n mid = (mid + Math.imul(al8, bh7)) | 0;\n mid = (mid + Math.imul(ah8, bl7)) | 0;\n hi = (hi + Math.imul(ah8, bh7)) | 0;\n lo = (lo + Math.imul(al7, bl8)) | 0;\n mid = (mid + Math.imul(al7, bh8)) | 0;\n mid = (mid + Math.imul(ah7, bl8)) | 0;\n hi = (hi + Math.imul(ah7, bh8)) | 0;\n lo = (lo + Math.imul(al6, bl9)) | 0;\n mid = (mid + Math.imul(al6, bh9)) | 0;\n mid = (mid + Math.imul(ah6, bl9)) | 0;\n hi = (hi + Math.imul(ah6, bh9)) | 0;\n var w15 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w15 >>> 26)) | 0;\n w15 &= 0x3ffffff;\n /* k = 16 */\n lo = Math.imul(al9, bl7);\n mid = Math.imul(al9, bh7);\n mid = (mid + Math.imul(ah9, bl7)) | 0;\n hi = Math.imul(ah9, bh7);\n lo = (lo + Math.imul(al8, bl8)) | 0;\n mid = (mid + Math.imul(al8, bh8)) | 0;\n mid = (mid + Math.imul(ah8, bl8)) | 0;\n hi = (hi + Math.imul(ah8, bh8)) | 0;\n lo = (lo + Math.imul(al7, bl9)) | 0;\n mid = (mid + Math.imul(al7, bh9)) | 0;\n mid = (mid + Math.imul(ah7, bl9)) | 0;\n hi = (hi + Math.imul(ah7, bh9)) | 0;\n var w16 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w16 >>> 26)) | 0;\n w16 &= 0x3ffffff;\n /* k = 17 */\n lo = Math.imul(al9, bl8);\n mid = Math.imul(al9, bh8);\n mid = (mid + Math.imul(ah9, bl8)) | 0;\n hi = Math.imul(ah9, bh8);\n lo = (lo + Math.imul(al8, bl9)) | 0;\n mid = (mid + Math.imul(al8, bh9)) | 0;\n mid = (mid + Math.imul(ah8, bl9)) | 0;\n hi = (hi + Math.imul(ah8, bh9)) | 0;\n var w17 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w17 >>> 26)) | 0;\n w17 &= 0x3ffffff;\n /* k = 18 */\n lo = Math.imul(al9, bl9);\n mid = Math.imul(al9, bh9);\n mid = (mid + Math.imul(ah9, bl9)) | 0;\n hi = Math.imul(ah9, bh9);\n var w18 = (((c + lo) | 0) + ((mid & 0x1fff) << 13)) | 0;\n c = (((hi + (mid >>> 13)) | 0) + (w18 >>> 26)) | 0;\n w18 &= 0x3ffffff;\n o[0] = w0;\n o[1] = w1;\n o[2] = w2;\n o[3] = w3;\n o[4] = w4;\n o[5] = w5;\n o[6] = w6;\n o[7] = w7;\n o[8] = w8;\n o[9] = w9;\n o[10] = w10;\n o[11] = w11;\n o[12] = w12;\n o[13] = w13;\n o[14] = w14;\n o[15] = w15;\n o[16] = w16;\n o[17] = w17;\n o[18] = w18;\n if (c !== 0) {\n o[19] = c;\n out.length++;\n }\n return out;\n };\n\n // Polyfill comb\n if (!Math.imul) {\n comb10MulTo = smallMulTo;\n }\n\n function bigMulTo (self, num, out) {\n out.negative = num.negative ^ self.negative;\n out.length = self.length + num.length;\n\n var carry = 0;\n var hncarry = 0;\n for (var k = 0; k < out.length - 1; k++) {\n // Sum all words with the same `i + j = k` and accumulate `ncarry`,\n // note that ncarry could be >= 0x3ffffff\n var ncarry = hncarry;\n hncarry = 0;\n var rword = carry & 0x3ffffff;\n var maxJ = Math.min(k, num.length - 1);\n for (var j = Math.max(0, k - self.length + 1); j <= maxJ; j++) {\n var i = k - j;\n var a = self.words[i] | 0;\n var b = num.words[j] | 0;\n var r = a * b;\n\n var lo = r & 0x3ffffff;\n ncarry = (ncarry + ((r / 0x4000000) | 0)) | 0;\n lo = (lo + rword) | 0;\n rword = lo & 0x3ffffff;\n ncarry = (ncarry + (lo >>> 26)) | 0;\n\n hncarry += ncarry >>> 26;\n ncarry &= 0x3ffffff;\n }\n out.words[k] = rword;\n carry = ncarry;\n ncarry = hncarry;\n }\n if (carry !== 0) {\n out.words[k] = carry;\n } else {\n out.length--;\n }\n\n return out._strip();\n }\n\n function jumboMulTo (self, num, out) {\n // Temporary disable, see https://github.com/indutny/bn.js/issues/211\n // var fftm = new FFTM();\n // return fftm.mulp(self, num, out);\n return bigMulTo(self, num, out);\n }\n\n BN.prototype.mulTo = function mulTo (num, out) {\n var res;\n var len = this.length + num.length;\n if (this.length === 10 && num.length === 10) {\n res = comb10MulTo(this, num, out);\n } else if (len < 63) {\n res = smallMulTo(this, num, out);\n } else if (len < 1024) {\n res = bigMulTo(this, num, out);\n } else {\n res = jumboMulTo(this, num, out);\n }\n\n return res;\n };\n\n // Cooley-Tukey algorithm for FFT\n // slightly revisited to rely on looping instead of recursion\n\n function FFTM (x, y) {\n this.x = x;\n this.y = y;\n }\n\n FFTM.prototype.makeRBT = function makeRBT (N) {\n var t = new Array(N);\n var l = BN.prototype._countBits(N) - 1;\n for (var i = 0; i < N; i++) {\n t[i] = this.revBin(i, l, N);\n }\n\n return t;\n };\n\n // Returns binary-reversed representation of `x`\n FFTM.prototype.revBin = function revBin (x, l, N) {\n if (x === 0 || x === N - 1) return x;\n\n var rb = 0;\n for (var i = 0; i < l; i++) {\n rb |= (x & 1) << (l - i - 1);\n x >>= 1;\n }\n\n return rb;\n };\n\n // Performs \"tweedling\" phase, therefore 'emulating'\n // behaviour of the recursive algorithm\n FFTM.prototype.permute = function permute (rbt, rws, iws, rtws, itws, N) {\n for (var i = 0; i < N; i++) {\n rtws[i] = rws[rbt[i]];\n itws[i] = iws[rbt[i]];\n }\n };\n\n FFTM.prototype.transform = function transform (rws, iws, rtws, itws, N, rbt) {\n this.permute(rbt, rws, iws, rtws, itws, N);\n\n for (var s = 1; s < N; s <<= 1) {\n var l = s << 1;\n\n var rtwdf = Math.cos(2 * Math.PI / l);\n var itwdf = Math.sin(2 * Math.PI / l);\n\n for (var p = 0; p < N; p += l) {\n var rtwdf_ = rtwdf;\n var itwdf_ = itwdf;\n\n for (var j = 0; j < s; j++) {\n var re = rtws[p + j];\n var ie = itws[p + j];\n\n var ro = rtws[p + j + s];\n var io = itws[p + j + s];\n\n var rx = rtwdf_ * ro - itwdf_ * io;\n\n io = rtwdf_ * io + itwdf_ * ro;\n ro = rx;\n\n rtws[p + j] = re + ro;\n itws[p + j] = ie + io;\n\n rtws[p + j + s] = re - ro;\n itws[p + j + s] = ie - io;\n\n /* jshint maxdepth : false */\n if (j !== l) {\n rx = rtwdf * rtwdf_ - itwdf * itwdf_;\n\n itwdf_ = rtwdf * itwdf_ + itwdf * rtwdf_;\n rtwdf_ = rx;\n }\n }\n }\n }\n };\n\n FFTM.prototype.guessLen13b = function guessLen13b (n, m) {\n var N = Math.max(m, n) | 1;\n var odd = N & 1;\n var i = 0;\n for (N = N / 2 | 0; N; N = N >>> 1) {\n i++;\n }\n\n return 1 << i + 1 + odd;\n };\n\n FFTM.prototype.conjugate = function conjugate (rws, iws, N) {\n if (N <= 1) return;\n\n for (var i = 0; i < N / 2; i++) {\n var t = rws[i];\n\n rws[i] = rws[N - i - 1];\n rws[N - i - 1] = t;\n\n t = iws[i];\n\n iws[i] = -iws[N - i - 1];\n iws[N - i - 1] = -t;\n }\n };\n\n FFTM.prototype.normalize13b = function normalize13b (ws, N) {\n var carry = 0;\n for (var i = 0; i < N / 2; i++) {\n var w = Math.round(ws[2 * i + 1] / N) * 0x2000 +\n Math.round(ws[2 * i] / N) +\n carry;\n\n ws[i] = w & 0x3ffffff;\n\n if (w < 0x4000000) {\n carry = 0;\n } else {\n carry = w / 0x4000000 | 0;\n }\n }\n\n return ws;\n };\n\n FFTM.prototype.convert13b = function convert13b (ws, len, rws, N) {\n var carry = 0;\n for (var i = 0; i < len; i++) {\n carry = carry + (ws[i] | 0);\n\n rws[2 * i] = carry & 0x1fff; carry = carry >>> 13;\n rws[2 * i + 1] = carry & 0x1fff; carry = carry >>> 13;\n }\n\n // Pad with zeroes\n for (i = 2 * len; i < N; ++i) {\n rws[i] = 0;\n }\n\n assert(carry === 0);\n assert((carry & ~0x1fff) === 0);\n };\n\n FFTM.prototype.stub = function stub (N) {\n var ph = new Array(N);\n for (var i = 0; i < N; i++) {\n ph[i] = 0;\n }\n\n return ph;\n };\n\n FFTM.prototype.mulp = function mulp (x, y, out) {\n var N = 2 * this.guessLen13b(x.length, y.length);\n\n var rbt = this.makeRBT(N);\n\n var _ = this.stub(N);\n\n var rws = new Array(N);\n var rwst = new Array(N);\n var iwst = new Array(N);\n\n var nrws = new Array(N);\n var nrwst = new Array(N);\n var niwst = new Array(N);\n\n var rmws = out.words;\n rmws.length = N;\n\n this.convert13b(x.words, x.length, rws, N);\n this.convert13b(y.words, y.length, nrws, N);\n\n this.transform(rws, _, rwst, iwst, N, rbt);\n this.transform(nrws, _, nrwst, niwst, N, rbt);\n\n for (var i = 0; i < N; i++) {\n var rx = rwst[i] * nrwst[i] - iwst[i] * niwst[i];\n iwst[i] = rwst[i] * niwst[i] + iwst[i] * nrwst[i];\n rwst[i] = rx;\n }\n\n this.conjugate(rwst, iwst, N);\n this.transform(rwst, iwst, rmws, _, N, rbt);\n this.conjugate(rmws, _, N);\n this.normalize13b(rmws, N);\n\n out.negative = x.negative ^ y.negative;\n out.length = x.length + y.length;\n return out._strip();\n };\n\n // Multiply `this` by `num`\n BN.prototype.mul = function mul (num) {\n var out = new BN(null);\n out.words = new Array(this.length + num.length);\n return this.mulTo(num, out);\n };\n\n // Multiply employing FFT\n BN.prototype.mulf = function mulf (num) {\n var out = new BN(null);\n out.words = new Array(this.length + num.length);\n return jumboMulTo(this, num, out);\n };\n\n // In-place Multiplication\n BN.prototype.imul = function imul (num) {\n return this.clone().mulTo(num, this);\n };\n\n BN.prototype.imuln = function imuln (num) {\n var isNegNum = num < 0;\n if (isNegNum) num = -num;\n\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n\n // Carry\n var carry = 0;\n for (var i = 0; i < this.length; i++) {\n var w = (this.words[i] | 0) * num;\n var lo = (w & 0x3ffffff) + (carry & 0x3ffffff);\n carry >>= 26;\n carry += (w / 0x4000000) | 0;\n // NOTE: lo is 27bit maximum\n carry += lo >>> 26;\n this.words[i] = lo & 0x3ffffff;\n }\n\n if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\n }\n\n return isNegNum ? this.ineg() : this;\n };\n\n BN.prototype.muln = function muln (num) {\n return this.clone().imuln(num);\n };\n\n // `this` * `this`\n BN.prototype.sqr = function sqr () {\n return this.mul(this);\n };\n\n // `this` * `this` in-place\n BN.prototype.isqr = function isqr () {\n return this.imul(this.clone());\n };\n\n // Math.pow(`this`, `num`)\n BN.prototype.pow = function pow (num) {\n var w = toBitArray(num);\n if (w.length === 0) return new BN(1);\n\n // Skip leading zeroes\n var res = this;\n for (var i = 0; i < w.length; i++, res = res.sqr()) {\n if (w[i] !== 0) break;\n }\n\n if (++i < w.length) {\n for (var q = res.sqr(); i < w.length; i++, q = q.sqr()) {\n if (w[i] === 0) continue;\n\n res = res.mul(q);\n }\n }\n\n return res;\n };\n\n // Shift-left in-place\n BN.prototype.iushln = function iushln (bits) {\n assert(typeof bits === 'number' && bits >= 0);\n var r = bits % 26;\n var s = (bits - r) / 26;\n var carryMask = (0x3ffffff >>> (26 - r)) << (26 - r);\n var i;\n\n if (r !== 0) {\n var carry = 0;\n\n for (i = 0; i < this.length; i++) {\n var newCarry = this.words[i] & carryMask;\n var c = ((this.words[i] | 0) - newCarry) << r;\n this.words[i] = c | carry;\n carry = newCarry >>> (26 - r);\n }\n\n if (carry) {\n this.words[i] = carry;\n this.length++;\n }\n }\n\n if (s !== 0) {\n for (i = this.length - 1; i >= 0; i--) {\n this.words[i + s] = this.words[i];\n }\n\n for (i = 0; i < s; i++) {\n this.words[i] = 0;\n }\n\n this.length += s;\n }\n\n return this._strip();\n };\n\n BN.prototype.ishln = function ishln (bits) {\n // TODO(indutny): implement me\n assert(this.negative === 0);\n return this.iushln(bits);\n };\n\n // Shift-right in-place\n // NOTE: `hint` is a lowest bit before trailing zeroes\n // NOTE: if `extended` is present - it will be filled with destroyed bits\n BN.prototype.iushrn = function iushrn (bits, hint, extended) {\n assert(typeof bits === 'number' && bits >= 0);\n var h;\n if (hint) {\n h = (hint - (hint % 26)) / 26;\n } else {\n h = 0;\n }\n\n var r = bits % 26;\n var s = Math.min((bits - r) / 26, this.length);\n var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n var maskedWords = extended;\n\n h -= s;\n h = Math.max(0, h);\n\n // Extended mode, copy masked part\n if (maskedWords) {\n for (var i = 0; i < s; i++) {\n maskedWords.words[i] = this.words[i];\n }\n maskedWords.length = s;\n }\n\n if (s === 0) {\n // No-op, we should not move anything at all\n } else if (this.length > s) {\n this.length -= s;\n for (i = 0; i < this.length; i++) {\n this.words[i] = this.words[i + s];\n }\n } else {\n this.words[0] = 0;\n this.length = 1;\n }\n\n var carry = 0;\n for (i = this.length - 1; i >= 0 && (carry !== 0 || i >= h); i--) {\n var word = this.words[i] | 0;\n this.words[i] = (carry << (26 - r)) | (word >>> r);\n carry = word & mask;\n }\n\n // Push carried bits as a mask\n if (maskedWords && carry !== 0) {\n maskedWords.words[maskedWords.length++] = carry;\n }\n\n if (this.length === 0) {\n this.words[0] = 0;\n this.length = 1;\n }\n\n return this._strip();\n };\n\n BN.prototype.ishrn = function ishrn (bits, hint, extended) {\n // TODO(indutny): implement me\n assert(this.negative === 0);\n return this.iushrn(bits, hint, extended);\n };\n\n // Shift-left\n BN.prototype.shln = function shln (bits) {\n return this.clone().ishln(bits);\n };\n\n BN.prototype.ushln = function ushln (bits) {\n return this.clone().iushln(bits);\n };\n\n // Shift-right\n BN.prototype.shrn = function shrn (bits) {\n return this.clone().ishrn(bits);\n };\n\n BN.prototype.ushrn = function ushrn (bits) {\n return this.clone().iushrn(bits);\n };\n\n // Test if n bit is set\n BN.prototype.testn = function testn (bit) {\n assert(typeof bit === 'number' && bit >= 0);\n var r = bit % 26;\n var s = (bit - r) / 26;\n var q = 1 << r;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) return false;\n\n // Check bit and return\n var w = this.words[s];\n\n return !!(w & q);\n };\n\n // Return only lowers bits of number (in-place)\n BN.prototype.imaskn = function imaskn (bits) {\n assert(typeof bits === 'number' && bits >= 0);\n var r = bits % 26;\n var s = (bits - r) / 26;\n\n assert(this.negative === 0, 'imaskn works only with positive numbers');\n\n if (this.length <= s) {\n return this;\n }\n\n if (r !== 0) {\n s++;\n }\n this.length = Math.min(s, this.length);\n\n if (r !== 0) {\n var mask = 0x3ffffff ^ ((0x3ffffff >>> r) << r);\n this.words[this.length - 1] &= mask;\n }\n\n return this._strip();\n };\n\n // Return only lowers bits of number\n BN.prototype.maskn = function maskn (bits) {\n return this.clone().imaskn(bits);\n };\n\n // Add plain number `num` to `this`\n BN.prototype.iaddn = function iaddn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.isubn(-num);\n\n // Possible sign change\n if (this.negative !== 0) {\n if (this.length === 1 && (this.words[0] | 0) <= num) {\n this.words[0] = num - (this.words[0] | 0);\n this.negative = 0;\n return this;\n }\n\n this.negative = 0;\n this.isubn(num);\n this.negative = 1;\n return this;\n }\n\n // Add without checks\n return this._iaddn(num);\n };\n\n BN.prototype._iaddn = function _iaddn (num) {\n this.words[0] += num;\n\n // Carry\n for (var i = 0; i < this.length && this.words[i] >= 0x4000000; i++) {\n this.words[i] -= 0x4000000;\n if (i === this.length - 1) {\n this.words[i + 1] = 1;\n } else {\n this.words[i + 1]++;\n }\n }\n this.length = Math.max(this.length, i + 1);\n\n return this;\n };\n\n // Subtract plain number `num` from `this`\n BN.prototype.isubn = function isubn (num) {\n assert(typeof num === 'number');\n assert(num < 0x4000000);\n if (num < 0) return this.iaddn(-num);\n\n if (this.negative !== 0) {\n this.negative = 0;\n this.iaddn(num);\n this.negative = 1;\n return this;\n }\n\n this.words[0] -= num;\n\n if (this.length === 1 && this.words[0] < 0) {\n this.words[0] = -this.words[0];\n this.negative = 1;\n } else {\n // Carry\n for (var i = 0; i < this.length && this.words[i] < 0; i++) {\n this.words[i] += 0x4000000;\n this.words[i + 1] -= 1;\n }\n }\n\n return this._strip();\n };\n\n BN.prototype.addn = function addn (num) {\n return this.clone().iaddn(num);\n };\n\n BN.prototype.subn = function subn (num) {\n return this.clone().isubn(num);\n };\n\n BN.prototype.iabs = function iabs () {\n this.negative = 0;\n\n return this;\n };\n\n BN.prototype.abs = function abs () {\n return this.clone().iabs();\n };\n\n BN.prototype._ishlnsubmul = function _ishlnsubmul (num, mul, shift) {\n var len = num.length + shift;\n var i;\n\n this._expand(len);\n\n var w;\n var carry = 0;\n for (i = 0; i < num.length; i++) {\n w = (this.words[i + shift] | 0) + carry;\n var right = (num.words[i] | 0) * mul;\n w -= right & 0x3ffffff;\n carry = (w >> 26) - ((right / 0x4000000) | 0);\n this.words[i + shift] = w & 0x3ffffff;\n }\n for (; i < this.length - shift; i++) {\n w = (this.words[i + shift] | 0) + carry;\n carry = w >> 26;\n this.words[i + shift] = w & 0x3ffffff;\n }\n\n if (carry === 0) return this._strip();\n\n // Subtraction overflow\n assert(carry === -1);\n carry = 0;\n for (i = 0; i < this.length; i++) {\n w = -(this.words[i] | 0) + carry;\n carry = w >> 26;\n this.words[i] = w & 0x3ffffff;\n }\n this.negative = 1;\n\n return this._strip();\n };\n\n BN.prototype._wordDiv = function _wordDiv (num, mode) {\n var shift = this.length - num.length;\n\n var a = this.clone();\n var b = num;\n\n // Normalize\n var bhi = b.words[b.length - 1] | 0;\n var bhiBits = this._countBits(bhi);\n shift = 26 - bhiBits;\n if (shift !== 0) {\n b = b.ushln(shift);\n a.iushln(shift);\n bhi = b.words[b.length - 1] | 0;\n }\n\n // Initialize quotient\n var m = a.length - b.length;\n var q;\n\n if (mode !== 'mod') {\n q = new BN(null);\n q.length = m + 1;\n q.words = new Array(q.length);\n for (var i = 0; i < q.length; i++) {\n q.words[i] = 0;\n }\n }\n\n var diff = a.clone()._ishlnsubmul(b, 1, m);\n if (diff.negative === 0) {\n a = diff;\n if (q) {\n q.words[m] = 1;\n }\n }\n\n for (var j = m - 1; j >= 0; j--) {\n var qj = (a.words[b.length + j] | 0) * 0x4000000 +\n (a.words[b.length + j - 1] | 0);\n\n // NOTE: (qj / bhi) is (0x3ffffff * 0x4000000 + 0x3ffffff) / 0x2000000 max\n // (0x7ffffff)\n qj = Math.min((qj / bhi) | 0, 0x3ffffff);\n\n a._ishlnsubmul(b, qj, j);\n while (a.negative !== 0) {\n qj--;\n a.negative = 0;\n a._ishlnsubmul(b, 1, j);\n if (!a.isZero()) {\n a.negative ^= 1;\n }\n }\n if (q) {\n q.words[j] = qj;\n }\n }\n if (q) {\n q._strip();\n }\n a._strip();\n\n // Denormalize\n if (mode !== 'div' && shift !== 0) {\n a.iushrn(shift);\n }\n\n return {\n div: q || null,\n mod: a\n };\n };\n\n // NOTE: 1) `mode` can be set to `mod` to request mod only,\n // to `div` to request div only, or be absent to\n // request both div & mod\n // 2) `positive` is true if unsigned mod is requested\n BN.prototype.divmod = function divmod (num, mode, positive) {\n assert(!num.isZero());\n\n if (this.isZero()) {\n return {\n div: new BN(0),\n mod: new BN(0)\n };\n }\n\n var div, mod, res;\n if (this.negative !== 0 && num.negative === 0) {\n res = this.neg().divmod(num, mode);\n\n if (mode !== 'mod') {\n div = res.div.neg();\n }\n\n if (mode !== 'div') {\n mod = res.mod.neg();\n if (positive && mod.negative !== 0) {\n mod.iadd(num);\n }\n }\n\n return {\n div: div,\n mod: mod\n };\n }\n\n if (this.negative === 0 && num.negative !== 0) {\n res = this.divmod(num.neg(), mode);\n\n if (mode !== 'mod') {\n div = res.div.neg();\n }\n\n return {\n div: div,\n mod: res.mod\n };\n }\n\n if ((this.negative & num.negative) !== 0) {\n res = this.neg().divmod(num.neg(), mode);\n\n if (mode !== 'div') {\n mod = res.mod.neg();\n if (positive && mod.negative !== 0) {\n mod.isub(num);\n }\n }\n\n return {\n div: res.div,\n mod: mod\n };\n }\n\n // Both numbers are positive at this point\n\n // Strip both numbers to approximate shift value\n if (num.length > this.length || this.cmp(num) < 0) {\n return {\n div: new BN(0),\n mod: this\n };\n }\n\n // Very short reduction\n if (num.length === 1) {\n if (mode === 'div') {\n return {\n div: this.divn(num.words[0]),\n mod: null\n };\n }\n\n if (mode === 'mod') {\n return {\n div: null,\n mod: new BN(this.modrn(num.words[0]))\n };\n }\n\n return {\n div: this.divn(num.words[0]),\n mod: new BN(this.modrn(num.words[0]))\n };\n }\n\n return this._wordDiv(num, mode);\n };\n\n // Find `this` / `num`\n BN.prototype.div = function div (num) {\n return this.divmod(num, 'div', false).div;\n };\n\n // Find `this` % `num`\n BN.prototype.mod = function mod (num) {\n return this.divmod(num, 'mod', false).mod;\n };\n\n BN.prototype.umod = function umod (num) {\n return this.divmod(num, 'mod', true).mod;\n };\n\n // Find Round(`this` / `num`)\n BN.prototype.divRound = function divRound (num) {\n var dm = this.divmod(num);\n\n // Fast case - exact division\n if (dm.mod.isZero()) return dm.div;\n\n var mod = dm.div.negative !== 0 ? dm.mod.isub(num) : dm.mod;\n\n var half = num.ushrn(1);\n var r2 = num.andln(1);\n var cmp = mod.cmp(half);\n\n // Round down\n if (cmp < 0 || (r2 === 1 && cmp === 0)) return dm.div;\n\n // Round up\n return dm.div.negative !== 0 ? dm.div.isubn(1) : dm.div.iaddn(1);\n };\n\n BN.prototype.modrn = function modrn (num) {\n var isNegNum = num < 0;\n if (isNegNum) num = -num;\n\n assert(num <= 0x3ffffff);\n var p = (1 << 26) % num;\n\n var acc = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n acc = (p * acc + (this.words[i] | 0)) % num;\n }\n\n return isNegNum ? -acc : acc;\n };\n\n // WARNING: DEPRECATED\n BN.prototype.modn = function modn (num) {\n return this.modrn(num);\n };\n\n // In-place division by number\n BN.prototype.idivn = function idivn (num) {\n var isNegNum = num < 0;\n if (isNegNum) num = -num;\n\n assert(num <= 0x3ffffff);\n\n var carry = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n var w = (this.words[i] | 0) + carry * 0x4000000;\n this.words[i] = (w / num) | 0;\n carry = w % num;\n }\n\n this._strip();\n return isNegNum ? this.ineg() : this;\n };\n\n BN.prototype.divn = function divn (num) {\n return this.clone().idivn(num);\n };\n\n BN.prototype.egcd = function egcd (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\n var x = this;\n var y = p.clone();\n\n if (x.negative !== 0) {\n x = x.umod(p);\n } else {\n x = x.clone();\n }\n\n // A * x + B * y = x\n var A = new BN(1);\n var B = new BN(0);\n\n // C * x + D * y = y\n var C = new BN(0);\n var D = new BN(1);\n\n var g = 0;\n\n while (x.isEven() && y.isEven()) {\n x.iushrn(1);\n y.iushrn(1);\n ++g;\n }\n\n var yp = y.clone();\n var xp = x.clone();\n\n while (!x.isZero()) {\n for (var i = 0, im = 1; (x.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0) {\n x.iushrn(i);\n while (i-- > 0) {\n if (A.isOdd() || B.isOdd()) {\n A.iadd(yp);\n B.isub(xp);\n }\n\n A.iushrn(1);\n B.iushrn(1);\n }\n }\n\n for (var j = 0, jm = 1; (y.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) {\n y.iushrn(j);\n while (j-- > 0) {\n if (C.isOdd() || D.isOdd()) {\n C.iadd(yp);\n D.isub(xp);\n }\n\n C.iushrn(1);\n D.iushrn(1);\n }\n }\n\n if (x.cmp(y) >= 0) {\n x.isub(y);\n A.isub(C);\n B.isub(D);\n } else {\n y.isub(x);\n C.isub(A);\n D.isub(B);\n }\n }\n\n return {\n a: C,\n b: D,\n gcd: y.iushln(g)\n };\n };\n\n // This is reduced incarnation of the binary EEA\n // above, designated to invert members of the\n // _prime_ fields F(p) at a maximal speed\n BN.prototype._invmp = function _invmp (p) {\n assert(p.negative === 0);\n assert(!p.isZero());\n\n var a = this;\n var b = p.clone();\n\n if (a.negative !== 0) {\n a = a.umod(p);\n } else {\n a = a.clone();\n }\n\n var x1 = new BN(1);\n var x2 = new BN(0);\n\n var delta = b.clone();\n\n while (a.cmpn(1) > 0 && b.cmpn(1) > 0) {\n for (var i = 0, im = 1; (a.words[0] & im) === 0 && i < 26; ++i, im <<= 1);\n if (i > 0) {\n a.iushrn(i);\n while (i-- > 0) {\n if (x1.isOdd()) {\n x1.iadd(delta);\n }\n\n x1.iushrn(1);\n }\n }\n\n for (var j = 0, jm = 1; (b.words[0] & jm) === 0 && j < 26; ++j, jm <<= 1);\n if (j > 0) {\n b.iushrn(j);\n while (j-- > 0) {\n if (x2.isOdd()) {\n x2.iadd(delta);\n }\n\n x2.iushrn(1);\n }\n }\n\n if (a.cmp(b) >= 0) {\n a.isub(b);\n x1.isub(x2);\n } else {\n b.isub(a);\n x2.isub(x1);\n }\n }\n\n var res;\n if (a.cmpn(1) === 0) {\n res = x1;\n } else {\n res = x2;\n }\n\n if (res.cmpn(0) < 0) {\n res.iadd(p);\n }\n\n return res;\n };\n\n BN.prototype.gcd = function gcd (num) {\n if (this.isZero()) return num.abs();\n if (num.isZero()) return this.abs();\n\n var a = this.clone();\n var b = num.clone();\n a.negative = 0;\n b.negative = 0;\n\n // Remove common factor of two\n for (var shift = 0; a.isEven() && b.isEven(); shift++) {\n a.iushrn(1);\n b.iushrn(1);\n }\n\n do {\n while (a.isEven()) {\n a.iushrn(1);\n }\n while (b.isEven()) {\n b.iushrn(1);\n }\n\n var r = a.cmp(b);\n if (r < 0) {\n // Swap `a` and `b` to make `a` always bigger than `b`\n var t = a;\n a = b;\n b = t;\n } else if (r === 0 || b.cmpn(1) === 0) {\n break;\n }\n\n a.isub(b);\n } while (true);\n\n return b.iushln(shift);\n };\n\n // Invert number in the field F(num)\n BN.prototype.invm = function invm (num) {\n return this.egcd(num).a.umod(num);\n };\n\n BN.prototype.isEven = function isEven () {\n return (this.words[0] & 1) === 0;\n };\n\n BN.prototype.isOdd = function isOdd () {\n return (this.words[0] & 1) === 1;\n };\n\n // And first word and num\n BN.prototype.andln = function andln (num) {\n return this.words[0] & num;\n };\n\n // Increment at the bit position in-line\n BN.prototype.bincn = function bincn (bit) {\n assert(typeof bit === 'number');\n var r = bit % 26;\n var s = (bit - r) / 26;\n var q = 1 << r;\n\n // Fast case: bit is much higher than all existing words\n if (this.length <= s) {\n this._expand(s + 1);\n this.words[s] |= q;\n return this;\n }\n\n // Add bit and propagate, if needed\n var carry = q;\n for (var i = s; carry !== 0 && i < this.length; i++) {\n var w = this.words[i] | 0;\n w += carry;\n carry = w >>> 26;\n w &= 0x3ffffff;\n this.words[i] = w;\n }\n if (carry !== 0) {\n this.words[i] = carry;\n this.length++;\n }\n return this;\n };\n\n BN.prototype.isZero = function isZero () {\n return this.length === 1 && this.words[0] === 0;\n };\n\n BN.prototype.cmpn = function cmpn (num) {\n var negative = num < 0;\n\n if (this.negative !== 0 && !negative) return -1;\n if (this.negative === 0 && negative) return 1;\n\n this._strip();\n\n var res;\n if (this.length > 1) {\n res = 1;\n } else {\n if (negative) {\n num = -num;\n }\n\n assert(num <= 0x3ffffff, 'Number is too big');\n\n var w = this.words[0] | 0;\n res = w === num ? 0 : w < num ? -1 : 1;\n }\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Compare two numbers and return:\n // 1 - if `this` > `num`\n // 0 - if `this` == `num`\n // -1 - if `this` < `num`\n BN.prototype.cmp = function cmp (num) {\n if (this.negative !== 0 && num.negative === 0) return -1;\n if (this.negative === 0 && num.negative !== 0) return 1;\n\n var res = this.ucmp(num);\n if (this.negative !== 0) return -res | 0;\n return res;\n };\n\n // Unsigned comparison\n BN.prototype.ucmp = function ucmp (num) {\n // At this point both numbers have the same sign\n if (this.length > num.length) return 1;\n if (this.length < num.length) return -1;\n\n var res = 0;\n for (var i = this.length - 1; i >= 0; i--) {\n var a = this.words[i] | 0;\n var b = num.words[i] | 0;\n\n if (a === b) continue;\n if (a < b) {\n res = -1;\n } else if (a > b) {\n res = 1;\n }\n break;\n }\n return res;\n };\n\n BN.prototype.gtn = function gtn (num) {\n return this.cmpn(num) === 1;\n };\n\n BN.prototype.gt = function gt (num) {\n return this.cmp(num) === 1;\n };\n\n BN.prototype.gten = function gten (num) {\n return this.cmpn(num) >= 0;\n };\n\n BN.prototype.gte = function gte (num) {\n return this.cmp(num) >= 0;\n };\n\n BN.prototype.ltn = function ltn (num) {\n return this.cmpn(num) === -1;\n };\n\n BN.prototype.lt = function lt (num) {\n return this.cmp(num) === -1;\n };\n\n BN.prototype.lten = function lten (num) {\n return this.cmpn(num) <= 0;\n };\n\n BN.prototype.lte = function lte (num) {\n return this.cmp(num) <= 0;\n };\n\n BN.prototype.eqn = function eqn (num) {\n return this.cmpn(num) === 0;\n };\n\n BN.prototype.eq = function eq (num) {\n return this.cmp(num) === 0;\n };\n\n //\n // A reduce context, could be using montgomery or something better, depending\n // on the `m` itself.\n //\n BN.red = function red (num) {\n return new Red(num);\n };\n\n BN.prototype.toRed = function toRed (ctx) {\n assert(!this.red, 'Already a number in reduction context');\n assert(this.negative === 0, 'red works only with positives');\n return ctx.convertTo(this)._forceRed(ctx);\n };\n\n BN.prototype.fromRed = function fromRed () {\n assert(this.red, 'fromRed works only with numbers in reduction context');\n return this.red.convertFrom(this);\n };\n\n BN.prototype._forceRed = function _forceRed (ctx) {\n this.red = ctx;\n return this;\n };\n\n BN.prototype.forceRed = function forceRed (ctx) {\n assert(!this.red, 'Already a number in reduction context');\n return this._forceRed(ctx);\n };\n\n BN.prototype.redAdd = function redAdd (num) {\n assert(this.red, 'redAdd works only with red numbers');\n return this.red.add(this, num);\n };\n\n BN.prototype.redIAdd = function redIAdd (num) {\n assert(this.red, 'redIAdd works only with red numbers');\n return this.red.iadd(this, num);\n };\n\n BN.prototype.redSub = function redSub (num) {\n assert(this.red, 'redSub works only with red numbers');\n return this.red.sub(this, num);\n };\n\n BN.prototype.redISub = function redISub (num) {\n assert(this.red, 'redISub works only with red numbers');\n return this.red.isub(this, num);\n };\n\n BN.prototype.redShl = function redShl (num) {\n assert(this.red, 'redShl works only with red numbers');\n return this.red.shl(this, num);\n };\n\n BN.prototype.redMul = function redMul (num) {\n assert(this.red, 'redMul works only with red numbers');\n this.red._verify2(this, num);\n return this.red.mul(this, num);\n };\n\n BN.prototype.redIMul = function redIMul (num) {\n assert(this.red, 'redMul works only with red numbers');\n this.red._verify2(this, num);\n return this.red.imul(this, num);\n };\n\n BN.prototype.redSqr = function redSqr () {\n assert(this.red, 'redSqr works only with red numbers');\n this.red._verify1(this);\n return this.red.sqr(this);\n };\n\n BN.prototype.redISqr = function redISqr () {\n assert(this.red, 'redISqr works only with red numbers');\n this.red._verify1(this);\n return this.red.isqr(this);\n };\n\n // Square root over p\n BN.prototype.redSqrt = function redSqrt () {\n assert(this.red, 'redSqrt works only with red numbers');\n this.red._verify1(this);\n return this.red.sqrt(this);\n };\n\n BN.prototype.redInvm = function redInvm () {\n assert(this.red, 'redInvm works only with red numbers');\n this.red._verify1(this);\n return this.red.invm(this);\n };\n\n // Return negative clone of `this` % `red modulo`\n BN.prototype.redNeg = function redNeg () {\n assert(this.red, 'redNeg works only with red numbers');\n this.red._verify1(this);\n return this.red.neg(this);\n };\n\n BN.prototype.redPow = function redPow (num) {\n assert(this.red && !num.red, 'redPow(normalNum)');\n this.red._verify1(this);\n return this.red.pow(this, num);\n };\n\n // Prime numbers with efficient reduction\n var primes = {\n k256: null,\n p224: null,\n p192: null,\n p25519: null\n };\n\n // Pseudo-Mersenne prime\n function MPrime (name, p) {\n // P = 2 ^ N - K\n this.name = name;\n this.p = new BN(p, 16);\n this.n = this.p.bitLength();\n this.k = new BN(1).iushln(this.n).isub(this.p);\n\n this.tmp = this._tmp();\n }\n\n MPrime.prototype._tmp = function _tmp () {\n var tmp = new BN(null);\n tmp.words = new Array(Math.ceil(this.n / 13));\n return tmp;\n };\n\n MPrime.prototype.ireduce = function ireduce (num) {\n // Assumes that `num` is less than `P^2`\n // num = HI * (2 ^ N - K) + HI * K + LO = HI * K + LO (mod P)\n var r = num;\n var rlen;\n\n do {\n this.split(r, this.tmp);\n r = this.imulK(r);\n r = r.iadd(this.tmp);\n rlen = r.bitLength();\n } while (rlen > this.n);\n\n var cmp = rlen < this.n ? -1 : r.ucmp(this.p);\n if (cmp === 0) {\n r.words[0] = 0;\n r.length = 1;\n } else if (cmp > 0) {\n r.isub(this.p);\n } else {\n if (r.strip !== undefined) {\n // r is a BN v4 instance\n r.strip();\n } else {\n // r is a BN v5 instance\n r._strip();\n }\n }\n\n return r;\n };\n\n MPrime.prototype.split = function split (input, out) {\n input.iushrn(this.n, 0, out);\n };\n\n MPrime.prototype.imulK = function imulK (num) {\n return num.imul(this.k);\n };\n\n function K256 () {\n MPrime.call(\n this,\n 'k256',\n 'ffffffff ffffffff ffffffff ffffffff ffffffff ffffffff fffffffe fffffc2f');\n }\n inherits(K256, MPrime);\n\n K256.prototype.split = function split (input, output) {\n // 256 = 9 * 26 + 22\n var mask = 0x3fffff;\n\n var outLen = Math.min(input.length, 9);\n for (var i = 0; i < outLen; i++) {\n output.words[i] = input.words[i];\n }\n output.length = outLen;\n\n if (input.length <= 9) {\n input.words[0] = 0;\n input.length = 1;\n return;\n }\n\n // Shift by 9 limbs\n var prev = input.words[9];\n output.words[output.length++] = prev & mask;\n\n for (i = 10; i < input.length; i++) {\n var next = input.words[i] | 0;\n input.words[i - 10] = ((next & mask) << 4) | (prev >>> 22);\n prev = next;\n }\n prev >>>= 22;\n input.words[i - 10] = prev;\n if (prev === 0 && input.length > 10) {\n input.length -= 10;\n } else {\n input.length -= 9;\n }\n };\n\n K256.prototype.imulK = function imulK (num) {\n // K = 0x1000003d1 = [ 0x40, 0x3d1 ]\n num.words[num.length] = 0;\n num.words[num.length + 1] = 0;\n num.length += 2;\n\n // bounded at: 0x40 * 0x3ffffff + 0x3d0 = 0x100000390\n var lo = 0;\n for (var i = 0; i < num.length; i++) {\n var w = num.words[i] | 0;\n lo += w * 0x3d1;\n num.words[i] = lo & 0x3ffffff;\n lo = w * 0x40 + ((lo / 0x4000000) | 0);\n }\n\n // Fast length reduction\n if (num.words[num.length - 1] === 0) {\n num.length--;\n if (num.words[num.length - 1] === 0) {\n num.length--;\n }\n }\n return num;\n };\n\n function P224 () {\n MPrime.call(\n this,\n 'p224',\n 'ffffffff ffffffff ffffffff ffffffff 00000000 00000000 00000001');\n }\n inherits(P224, MPrime);\n\n function P192 () {\n MPrime.call(\n this,\n 'p192',\n 'ffffffff ffffffff ffffffff fffffffe ffffffff ffffffff');\n }\n inherits(P192, MPrime);\n\n function P25519 () {\n // 2 ^ 255 - 19\n MPrime.call(\n this,\n '25519',\n '7fffffffffffffff ffffffffffffffff ffffffffffffffff ffffffffffffffed');\n }\n inherits(P25519, MPrime);\n\n P25519.prototype.imulK = function imulK (num) {\n // K = 0x13\n var carry = 0;\n for (var i = 0; i < num.length; i++) {\n var hi = (num.words[i] | 0) * 0x13 + carry;\n var lo = hi & 0x3ffffff;\n hi >>>= 26;\n\n num.words[i] = lo;\n carry = hi;\n }\n if (carry !== 0) {\n num.words[num.length++] = carry;\n }\n return num;\n };\n\n // Exported mostly for testing purposes, use plain name instead\n BN._prime = function prime (name) {\n // Cached version of prime\n if (primes[name]) return primes[name];\n\n var prime;\n if (name === 'k256') {\n prime = new K256();\n } else if (name === 'p224') {\n prime = new P224();\n } else if (name === 'p192') {\n prime = new P192();\n } else if (name === 'p25519') {\n prime = new P25519();\n } else {\n throw new Error('Unknown prime ' + name);\n }\n primes[name] = prime;\n\n return prime;\n };\n\n //\n // Base reduction engine\n //\n function Red (m) {\n if (typeof m === 'string') {\n var prime = BN._prime(m);\n this.m = prime.p;\n this.prime = prime;\n } else {\n assert(m.gtn(1), 'modulus must be greater than 1');\n this.m = m;\n this.prime = null;\n }\n }\n\n Red.prototype._verify1 = function _verify1 (a) {\n assert(a.negative === 0, 'red works only with positives');\n assert(a.red, 'red works only with red numbers');\n };\n\n Red.prototype._verify2 = function _verify2 (a, b) {\n assert((a.negative | b.negative) === 0, 'red works only with positives');\n assert(a.red && a.red === b.red,\n 'red works only with red numbers');\n };\n\n Red.prototype.imod = function imod (a) {\n if (this.prime) return this.prime.ireduce(a)._forceRed(this);\n\n move(a, a.umod(this.m)._forceRed(this));\n return a;\n };\n\n Red.prototype.neg = function neg (a) {\n if (a.isZero()) {\n return a.clone();\n }\n\n return this.m.sub(a)._forceRed(this);\n };\n\n Red.prototype.add = function add (a, b) {\n this._verify2(a, b);\n\n var res = a.add(b);\n if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\n }\n return res._forceRed(this);\n };\n\n Red.prototype.iadd = function iadd (a, b) {\n this._verify2(a, b);\n\n var res = a.iadd(b);\n if (res.cmp(this.m) >= 0) {\n res.isub(this.m);\n }\n return res;\n };\n\n Red.prototype.sub = function sub (a, b) {\n this._verify2(a, b);\n\n var res = a.sub(b);\n if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res._forceRed(this);\n };\n\n Red.prototype.isub = function isub (a, b) {\n this._verify2(a, b);\n\n var res = a.isub(b);\n if (res.cmpn(0) < 0) {\n res.iadd(this.m);\n }\n return res;\n };\n\n Red.prototype.shl = function shl (a, num) {\n this._verify1(a);\n return this.imod(a.ushln(num));\n };\n\n Red.prototype.imul = function imul (a, b) {\n this._verify2(a, b);\n return this.imod(a.imul(b));\n };\n\n Red.prototype.mul = function mul (a, b) {\n this._verify2(a, b);\n return this.imod(a.mul(b));\n };\n\n Red.prototype.isqr = function isqr (a) {\n return this.imul(a, a.clone());\n };\n\n Red.prototype.sqr = function sqr (a) {\n return this.mul(a, a);\n };\n\n Red.prototype.sqrt = function sqrt (a) {\n if (a.isZero()) return a.clone();\n\n var mod3 = this.m.andln(3);\n assert(mod3 % 2 === 1);\n\n // Fast case\n if (mod3 === 3) {\n var pow = this.m.add(new BN(1)).iushrn(2);\n return this.pow(a, pow);\n }\n\n // Tonelli-Shanks algorithm (Totally unoptimized and slow)\n //\n // Find Q and S, that Q * 2 ^ S = (P - 1)\n var q = this.m.subn(1);\n var s = 0;\n while (!q.isZero() && q.andln(1) === 0) {\n s++;\n q.iushrn(1);\n }\n assert(!q.isZero());\n\n var one = new BN(1).toRed(this);\n var nOne = one.redNeg();\n\n // Find quadratic non-residue\n // NOTE: Max is such because of generalized Riemann hypothesis.\n var lpow = this.m.subn(1).iushrn(1);\n var z = this.m.bitLength();\n z = new BN(2 * z * z).toRed(this);\n\n while (this.pow(z, lpow).cmp(nOne) !== 0) {\n z.redIAdd(nOne);\n }\n\n var c = this.pow(z, q);\n var r = this.pow(a, q.addn(1).iushrn(1));\n var t = this.pow(a, q);\n var m = s;\n while (t.cmp(one) !== 0) {\n var tmp = t;\n for (var i = 0; tmp.cmp(one) !== 0; i++) {\n tmp = tmp.redSqr();\n }\n assert(i < m);\n var b = this.pow(c, new BN(1).iushln(m - i - 1));\n\n r = r.redMul(b);\n c = b.redSqr();\n t = t.redMul(c);\n m = i;\n }\n\n return r;\n };\n\n Red.prototype.invm = function invm (a) {\n var inv = a._invmp(this.m);\n if (inv.negative !== 0) {\n inv.negative = 0;\n return this.imod(inv).redNeg();\n } else {\n return this.imod(inv);\n }\n };\n\n Red.prototype.pow = function pow (a, num) {\n if (num.isZero()) return new BN(1).toRed(this);\n if (num.cmpn(1) === 0) return a.clone();\n\n var windowSize = 4;\n var wnd = new Array(1 << windowSize);\n wnd[0] = new BN(1).toRed(this);\n wnd[1] = a;\n for (var i = 2; i < wnd.length; i++) {\n wnd[i] = this.mul(wnd[i - 1], a);\n }\n\n var res = wnd[0];\n var current = 0;\n var currentLen = 0;\n var start = num.bitLength() % 26;\n if (start === 0) {\n start = 26;\n }\n\n for (i = num.length - 1; i >= 0; i--) {\n var word = num.words[i];\n for (var j = start - 1; j >= 0; j--) {\n var bit = (word >> j) & 1;\n if (res !== wnd[0]) {\n res = this.sqr(res);\n }\n\n if (bit === 0 && current === 0) {\n currentLen = 0;\n continue;\n }\n\n current <<= 1;\n current |= bit;\n currentLen++;\n if (currentLen !== windowSize && (i !== 0 || j !== 0)) continue;\n\n res = this.mul(res, wnd[current]);\n currentLen = 0;\n current = 0;\n }\n start = 26;\n }\n\n return res;\n };\n\n Red.prototype.convertTo = function convertTo (num) {\n var r = num.umod(this.m);\n\n return r === num ? r.clone() : r;\n };\n\n Red.prototype.convertFrom = function convertFrom (num) {\n var res = num.clone();\n res.red = null;\n return res;\n };\n\n //\n // Montgomery method engine\n //\n\n BN.mont = function mont (num) {\n return new Mont(num);\n };\n\n function Mont (m) {\n Red.call(this, m);\n\n this.shift = this.m.bitLength();\n if (this.shift % 26 !== 0) {\n this.shift += 26 - (this.shift % 26);\n }\n\n this.r = new BN(1).iushln(this.shift);\n this.r2 = this.imod(this.r.sqr());\n this.rinv = this.r._invmp(this.m);\n\n this.minv = this.rinv.mul(this.r).isubn(1).div(this.m);\n this.minv = this.minv.umod(this.r);\n this.minv = this.r.sub(this.minv);\n }\n inherits(Mont, Red);\n\n Mont.prototype.convertTo = function convertTo (num) {\n return this.imod(num.ushln(this.shift));\n };\n\n Mont.prototype.convertFrom = function convertFrom (num) {\n var r = this.imod(num.mul(this.rinv));\n r.red = null;\n return r;\n };\n\n Mont.prototype.imul = function imul (a, b) {\n if (a.isZero() || b.isZero()) {\n a.words[0] = 0;\n a.length = 1;\n return a;\n }\n\n var t = a.imul(b);\n var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n var u = t.isub(c).iushrn(this.shift);\n var res = u;\n\n if (u.cmp(this.m) >= 0) {\n res = u.isub(this.m);\n } else if (u.cmpn(0) < 0) {\n res = u.iadd(this.m);\n }\n\n return res._forceRed(this);\n };\n\n Mont.prototype.mul = function mul (a, b) {\n if (a.isZero() || b.isZero()) return new BN(0)._forceRed(this);\n\n var t = a.mul(b);\n var c = t.maskn(this.shift).mul(this.minv).imaskn(this.shift).mul(this.m);\n var u = t.isub(c).iushrn(this.shift);\n var res = u;\n if (u.cmp(this.m) >= 0) {\n res = u.isub(this.m);\n } else if (u.cmpn(0) < 0) {\n res = u.iadd(this.m);\n }\n\n return res._forceRed(this);\n };\n\n Mont.prototype.invm = function invm (a) {\n // (AR)^-1 * R^2 = (A^-1 * R^-1) * R^2 = A^-1 * R\n var res = this.imod(a._invmp(this.m).mul(this.r2));\n return res._forceRed(this);\n };\n})(typeof module === 'undefined' || module, this);\n","\"use strict\";\nvar __importDefault = (this && this.__importDefault) || function (mod) {\n return (mod && mod.__esModule) ? mod : { \"default\": mod };\n};\nObject.defineProperty(exports, \"__esModule\", { value: true });\nexports.map = exports.array = exports.rustEnum = exports.str = exports.vecU8 = exports.tagged = exports.vec = exports.bool = exports.option = exports.publicKey = exports.i256 = exports.u256 = exports.i128 = exports.u128 = exports.i64 = exports.u64 = exports.struct = exports.f64 = exports.f32 = exports.i32 = exports.u32 = exports.i16 = exports.u16 = exports.i8 = exports.u8 = void 0;\nconst buffer_layout_1 = require(\"buffer-layout\");\nconst web3_js_1 = require(\"@solana/web3.js\");\nconst bn_js_1 = __importDefault(require(\"bn.js\"));\nvar buffer_layout_2 = require(\"buffer-layout\");\nObject.defineProperty(exports, \"u8\", { enumerable: true, get: function () { return buffer_layout_2.u8; } });\nObject.defineProperty(exports, \"i8\", { enumerable: true, get: function () { return buffer_layout_2.s8; } });\nObject.defineProperty(exports, \"u16\", { enumerable: true, get: function () { return buffer_layout_2.u16; } });\nObject.defineProperty(exports, \"i16\", { enumerable: true, get: function () { return buffer_layout_2.s16; } });\nObject.defineProperty(exports, \"u32\", { enumerable: true, get: function () { return buffer_layout_2.u32; } });\nObject.defineProperty(exports, \"i32\", { enumerable: true, get: function () { return buffer_layout_2.s32; } });\nObject.defineProperty(exports, \"f32\", { enumerable: true, get: function () { return buffer_layout_2.f32; } });\nObject.defineProperty(exports, \"f64\", { enumerable: true, get: function () { return buffer_layout_2.f64; } });\nObject.defineProperty(exports, \"struct\", { enumerable: true, get: function () { return buffer_layout_2.struct; } });\nclass BNLayout extends buffer_layout_1.Layout {\n constructor(span, signed, property) {\n super(span, property);\n this.blob = (0, buffer_layout_1.blob)(span);\n this.signed = signed;\n }\n decode(b, offset = 0) {\n const num = new bn_js_1.default(this.blob.decode(b, offset), 10, \"le\");\n if (this.signed) {\n return num.fromTwos(this.span * 8).clone();\n }\n return num;\n }\n encode(src, b, offset = 0) {\n if (this.signed) {\n src = src.toTwos(this.span * 8);\n }\n return this.blob.encode(src.toArrayLike(Buffer, \"le\", this.span), b, offset);\n }\n}\nfunction u64(property) {\n return new BNLayout(8, false, property);\n}\nexports.u64 = u64;\nfunction i64(property) {\n return new BNLayout(8, true, property);\n}\nexports.i64 = i64;\nfunction u128(property) {\n return new BNLayout(16, false, property);\n}\nexports.u128 = u128;\nfunction i128(property) {\n return new BNLayout(16, true, property);\n}\nexports.i128 = i128;\nfunction u256(property) {\n return new BNLayout(32, false, property);\n}\nexports.u256 = u256;\nfunction i256(property) {\n return new BNLayout(32, true, property);\n}\nexports.i256 = i256;\nclass WrappedLayout extends buffer_layout_1.Layout {\n constructor(layout, decoder, encoder, property) {\n super(layout.span, property);\n this.layout = layout;\n this.decoder = decoder;\n this.encoder = encoder;\n }\n decode(b, offset) {\n return this.decoder(this.layout.decode(b, offset));\n }\n encode(src, b, offset) {\n return this.layout.encode(this.encoder(src), b, offset);\n }\n getSpan(b, offset) {\n return this.layout.getSpan(b, offset);\n }\n}\nfunction publicKey(property) {\n return new WrappedLayout((0, buffer_layout_1.blob)(32), (b) => new web3_js_1.PublicKey(b), (key) => key.toBuffer(), property);\n}\nexports.publicKey = publicKey;\nclass OptionLayout extends buffer_layout_1.Layout {\n constructor(layout, property) {\n super(-1, property);\n this.layout = layout;\n this.discriminator = (0, buffer_layout_1.u8)();\n }\n encode(src, b, offset = 0) {\n if (src === null || src === undefined) {\n return this.discriminator.encode(0, b, offset);\n }\n this.discriminator.encode(1, b, offset);\n return this.layout.encode(src, b, offset + 1) + 1;\n }\n decode(b, offset = 0) {\n const discriminator = this.discriminator.decode(b, offset);\n if (discriminator === 0) {\n return null;\n }\n else if (discriminator === 1) {\n return this.layout.decode(b, offset + 1);\n }\n throw new Error(\"Invalid option \" + this.property);\n }\n getSpan(b, offset = 0) {\n const discriminator = this.discriminator.decode(b, offset);\n if (discriminator === 0) {\n return 1;\n }\n else if (discriminator === 1) {\n return this.layout.getSpan(b, offset + 1) + 1;\n }\n throw new Error(\"Invalid option \" + this.property);\n }\n}\nfunction option(layout, property) {\n return new OptionLayout(layout, property);\n}\nexports.option = option;\nfunction bool(property) {\n return new WrappedLayout((0, buffer_layout_1.u8)(), decodeBool, encodeBool, property);\n}\nexports.bool = bool;\nfunction decodeBool(value) {\n if (value === 0) {\n return false;\n }\n else if (value === 1) {\n return true;\n }\n throw new Error(\"Invalid bool: \" + value);\n}\nfunction encodeBool(value) {\n return value ? 1 : 0;\n}\nfunction vec(elementLayout, property) {\n const length = (0, buffer_layout_1.u32)(\"length\");\n const layout = (0, buffer_layout_1.struct)([\n length,\n (0, buffer_layout_1.seq)(elementLayout, (0, buffer_layout_1.offset)(length, -length.span), \"values\"),\n ]);\n return new WrappedLayout(layout, ({ values }) => values, (values) => ({ values }), property);\n}\nexports.vec = vec;\nfunction tagged(tag, layout, property) {\n const wrappedLayout = (0, buffer_layout_1.struct)([\n u64(\"tag\"),\n layout.replicate(\"data\"),\n ]);\n function decodeTag({ tag: receivedTag, data }) {\n if (!receivedTag.eq(tag)) {\n throw new Error(\"Invalid tag, expected: \" +\n tag.toString(\"hex\") +\n \", got: \" +\n receivedTag.toString(\"hex\"));\n }\n return data;\n }\n return new WrappedLayout(wrappedLayout, decodeTag, (data) => ({ tag, data }), property);\n}\nexports.tagged = tagged;\nfunction vecU8(property) {\n const length = (0, buffer_layout_1.u32)(\"length\");\n const layout = (0, buffer_layout_1.struct)([\n length,\n (0, buffer_layout_1.blob)((0, buffer_layout_1.offset)(length, -length.span), \"data\"),\n ]);\n return new WrappedLayout(layout, ({ data }) => data, (data) => ({ data }), property);\n}\nexports.vecU8 = vecU8;\nfunction str(property) {\n return new WrappedLayout(vecU8(), (data) => data.toString(\"utf-8\"), (s) => Buffer.from(s, \"utf-8\"), property);\n}\nexports.str = str;\nfunction rustEnum(variants, property, discriminant) {\n const unionLayout = (0, buffer_layout_1.union)(discriminant !== null && discriminant !== void 0 ? discriminant : (0, buffer_layout_1.u8)(), property);\n variants.forEach((variant, index) => unionLayout.addVariant(index, variant, variant.property));\n return unionLayout;\n}\nexports.rustEnum = rustEnum;\nfunction array(elementLayout, length, property) {\n const layout = (0, buffer_layout_1.struct)([\n (0, buffer_layout_1.seq)(elementLayout, length, \"values\"),\n ]);\n return new WrappedLayout(layout, ({ values }) => values, (values) => ({ values }), property);\n}\nexports.array = array;\nclass MapEntryLayout extends buffer_layout_1.Layout {\n constructor(keyLayout, valueLayout, property) {\n super(keyLayout.span + valueLayout.span, property);\n this.keyLayout = keyLayout;\n this.valueLayout = valueLayout;\n }\n decode(b, offset) {\n offset = offset || 0;\n const key = this.keyLayout.decode(b, offset);\n const value = this.valueLayout.decode(b, offset + this.keyLayout.getSpan(b, offset));\n return [key, value];\n }\n encode(src, b, offset) {\n offset = offset || 0;\n const keyBytes = this.keyLayout.encode(src[0], b, offset);\n const valueBytes = this.valueLayout.encode(src[1], b, offset + keyBytes);\n return keyBytes + valueBytes;\n }\n getSpan(b, offset) {\n return (this.keyLayout.getSpan(b, offset) + this.valueLayout.getSpan(b, offset));\n }\n}\nfunction map(keyLayout, valueLayout, property) {\n const length = (0, buffer_layout_1.u32)(\"length\");\n const layout = (0, buffer_layout_1.struct)([\n length,\n (0, buffer_layout_1.seq)(new MapEntryLayout(keyLayout, valueLayout), (0, buffer_layout_1.offset)(length, -length.span), \"values\"),\n ]);\n return new WrappedLayout(layout, ({ values }) => new Map(values), (values) => ({ values: Array.from(values.entries()) }), property);\n}\nexports.map = map;\n//# sourceMappingURL=index.js.map","import {\n struct,\n option,\n vec,\n bool,\n u64,\n u8,\n publicKey,\n array,\n u32,\n u16,\n vecU8,\n} from '@coral-xyz/borsh';\nimport { AccountMeta, PublicKey } from '@solana/web3.js';\nimport { CompressedTokenProgram } from './program';\nimport {\n BatchCompressInstructionData,\n CompressedTokenInstructionDataApprove,\n CompressedTokenInstructionDataRevoke,\n CompressedTokenInstructionDataTransfer,\n CompressSplTokenAccountInstructionData,\n MintToInstructionData,\n} from './types';\nimport {\n APPROVE_DISCRIMINATOR,\n BATCH_COMPRESS_DISCRIMINATOR,\n COMPRESS_SPL_TOKEN_ACCOUNT_DISCRIMINATOR,\n MINT_TO_DISCRIMINATOR,\n REVOKE_DISCRIMINATOR,\n TRANSFER_DISCRIMINATOR,\n} from './constants';\nimport { Buffer } from 'buffer';\nimport { ValidityProof } from '@lightprotocol/stateless.js';\n\nconst CompressedProofLayout = struct([\n array(u8(), 32, 'a'),\n array(u8(), 64, 'b'),\n array(u8(), 32, 'c'),\n]);\n\nconst PackedTokenTransferOutputDataLayout = struct([\n publicKey('owner'),\n u64('amount'),\n option(u64(), 'lamports'),\n u8('merkleTreeIndex'),\n option(vecU8(), 'tlv'),\n]);\n\nconst InputTokenDataWithContextLayout = struct([\n u64('amount'),\n option(u8(), 'delegateIndex'),\n struct(\n [\n u8('merkleTreePubkeyIndex'),\n u8('queuePubkeyIndex'),\n u32('leafIndex'),\n bool('proveByIndex'),\n ],\n 'merkleContext',\n ),\n u16('rootIndex'),\n option(u64(), 'lamports'),\n option(vecU8(), 'tlv'),\n]);\n\nexport const DelegatedTransferLayout = struct([\n publicKey('owner'),\n option(u8(), 'delegateChangeAccountIndex'),\n]);\n\nexport const CpiContextLayout = struct([\n bool('setContext'),\n bool('firstSetContext'),\n u8('cpiContextAccountIndex'),\n]);\n\nexport const CompressedTokenInstructionDataTransferLayout = struct([\n option(CompressedProofLayout, 'proof'),\n publicKey('mint'),\n option(DelegatedTransferLayout, 'delegatedTransfer'),\n vec(InputTokenDataWithContextLayout, 'inputTokenDataWithContext'),\n vec(PackedTokenTransferOutputDataLayout, 'outputCompressedAccounts'),\n bool('isCompress'),\n option(u64(), 'compressOrDecompressAmount'),\n option(CpiContextLayout, 'cpiContext'),\n option(u8(), 'lamportsChangeAccountMerkleTreeIndex'),\n]);\n\nexport const mintToLayout = struct([\n vec(publicKey(), 'recipients'),\n vec(u64(), 'amounts'),\n option(u64(), 'lamports'),\n]);\n\nexport const batchCompressLayout = struct([\n vec(publicKey(), 'pubkeys'),\n option(vec(u64(), 'amounts'), 'amounts'),\n option(u64(), 'lamports'),\n option(u64(), 'amount'),\n u8('index'),\n u8('bump'),\n]);\n\nexport const compressSplTokenAccountInstructionDataLayout = struct([\n publicKey('owner'),\n option(u64(), 'remainingAmount'),\n option(CpiContextLayout, 'cpiContext'),\n]);\n\nexport function encodeMintToInstructionData(\n data: MintToInstructionData,\n): Buffer {\n const buffer = Buffer.alloc(1000);\n const len = mintToLayout.encode(\n {\n recipients: data.recipients,\n amounts: data.amounts,\n lamports: data.lamports,\n },\n buffer,\n );\n\n return Buffer.concat([\n new Uint8Array(MINT_TO_DISCRIMINATOR),\n new Uint8Array(buffer.subarray(0, len)),\n ]);\n}\n\nexport function decodeMintToInstructionData(\n buffer: Buffer,\n): MintToInstructionData {\n return mintToLayout.decode(\n buffer.subarray(MINT_TO_DISCRIMINATOR.length),\n ) as MintToInstructionData;\n}\n\nexport function encodeBatchCompressInstructionData(\n data: BatchCompressInstructionData,\n): Buffer {\n const buffer = Buffer.alloc(1000);\n const len = batchCompressLayout.encode(data, buffer);\n\n const lengthBuffer = Buffer.alloc(4);\n lengthBuffer.writeUInt32LE(len, 0);\n\n const dataBuffer = buffer.subarray(0, len);\n return Buffer.concat([\n new Uint8Array(BATCH_COMPRESS_DISCRIMINATOR),\n new Uint8Array(lengthBuffer),\n new Uint8Array(dataBuffer),\n ]);\n}\n\nexport function decodeBatchCompressInstructionData(\n buffer: Buffer,\n): BatchCompressInstructionData {\n return batchCompressLayout.decode(\n buffer.subarray(BATCH_COMPRESS_DISCRIMINATOR.length + 4),\n ) as BatchCompressInstructionData;\n}\n\nexport function encodeCompressSplTokenAccountInstructionData(\n data: CompressSplTokenAccountInstructionData,\n): Buffer {\n const buffer = Buffer.alloc(1000);\n const len = compressSplTokenAccountInstructionDataLayout.encode(\n {\n owner: data.owner,\n remainingAmount: data.remainingAmount,\n cpiContext: data.cpiContext,\n },\n buffer,\n );\n\n return Buffer.concat([\n new Uint8Array(COMPRESS_SPL_TOKEN_ACCOUNT_DISCRIMINATOR),\n new Uint8Array(buffer.subarray(0, len)),\n ]);\n}\n\nexport function decodeCompressSplTokenAccountInstructionData(\n buffer: Buffer,\n): CompressSplTokenAccountInstructionData {\n const data = compressSplTokenAccountInstructionDataLayout.decode(\n buffer.subarray(COMPRESS_SPL_TOKEN_ACCOUNT_DISCRIMINATOR.length),\n ) as CompressSplTokenAccountInstructionData;\n return {\n owner: data.owner,\n remainingAmount: data.remainingAmount,\n cpiContext: data.cpiContext,\n };\n}\nexport function encodeTransferInstructionData(\n data: CompressedTokenInstructionDataTransfer,\n): Buffer {\n const buffer = Buffer.alloc(1000);\n\n const len = CompressedTokenInstructionDataTransferLayout.encode(\n data,\n buffer,\n );\n\n const lengthBuffer = Buffer.alloc(4);\n lengthBuffer.writeUInt32LE(len, 0);\n\n const dataBuffer = buffer.subarray(0, len);\n\n return Buffer.concat([\n new Uint8Array(TRANSFER_DISCRIMINATOR),\n new Uint8Array(lengthBuffer),\n new Uint8Array(dataBuffer),\n ]);\n}\n\nexport function decodeTransferInstructionData(\n buffer: Buffer,\n): CompressedTokenInstructionDataTransfer {\n return CompressedTokenInstructionDataTransferLayout.decode(\n buffer.slice(TRANSFER_DISCRIMINATOR.length + 4),\n ) as CompressedTokenInstructionDataTransfer;\n}\n\ninterface BaseAccountsLayoutParams {\n feePayer: PublicKey;\n authority: PublicKey;\n cpiAuthorityPda: PublicKey;\n lightSystemProgram: PublicKey;\n registeredProgramPda: PublicKey;\n noopProgram: PublicKey;\n accountCompressionAuthority: PublicKey;\n accountCompressionProgram: PublicKey;\n selfProgram: PublicKey;\n systemProgram: PublicKey;\n}\nexport type createTokenPoolAccountsLayoutParams = {\n feePayer: PublicKey;\n tokenPoolPda: PublicKey;\n systemProgram: PublicKey;\n mint: PublicKey;\n tokenProgram: PublicKey;\n cpiAuthorityPda: PublicKey;\n};\n\nexport type addTokenPoolAccountsLayoutParams =\n createTokenPoolAccountsLayoutParams & {\n existingTokenPoolPda: PublicKey;\n };\n\nexport type mintToAccountsLayoutParams = BaseAccountsLayoutParams & {\n mint: PublicKey;\n tokenPoolPda: PublicKey;\n tokenProgram: PublicKey;\n merkleTree: PublicKey;\n solPoolPda: PublicKey | null;\n};\nexport type transferAccountsLayoutParams = BaseAccountsLayoutParams & {\n tokenPoolPda?: PublicKey;\n compressOrDecompressTokenAccount?: PublicKey;\n tokenProgram?: PublicKey;\n};\nexport type approveAccountsLayoutParams = BaseAccountsLayoutParams;\nexport type revokeAccountsLayoutParams = approveAccountsLayoutParams;\nexport type freezeAccountsLayoutParams = BaseAccountsLayoutParams & {\n mint: PublicKey;\n};\nexport type thawAccountsLayoutParams = freezeAccountsLayoutParams;\n\nexport const createTokenPoolAccountsLayout = (\n accounts: createTokenPoolAccountsLayoutParams,\n): AccountMeta[] => {\n const {\n feePayer,\n tokenPoolPda,\n systemProgram,\n mint,\n tokenProgram,\n cpiAuthorityPda,\n } = accounts;\n return [\n { pubkey: feePayer, isSigner: true, isWritable: true },\n { pubkey: tokenPoolPda, isSigner: false, isWritable: true },\n { pubkey: systemProgram, isSigner: false, isWritable: false },\n { pubkey: mint, isSigner: false, isWritable: true },\n { pubkey: tokenProgram, isSigner: false, isWritable: false },\n { pubkey: cpiAuthorityPda, isSigner: false, isWritable: false },\n ];\n};\n\nexport const addTokenPoolAccountsLayout = (\n accounts: addTokenPoolAccountsLayoutParams,\n): AccountMeta[] => {\n const {\n feePayer,\n tokenPoolPda,\n systemProgram,\n mint,\n tokenProgram,\n cpiAuthorityPda,\n existingTokenPoolPda,\n } = accounts;\n return [\n { pubkey: feePayer, isSigner: true, isWritable: true },\n { pubkey: tokenPoolPda, isSigner: false, isWritable: true },\n { pubkey: existingTokenPoolPda, isSigner: false, isWritable: false },\n { pubkey: systemProgram, isSigner: false, isWritable: false },\n { pubkey: mint, isSigner: false, isWritable: true },\n { pubkey: tokenProgram, isSigner: false, isWritable: false },\n { pubkey: cpiAuthorityPda, isSigner: false, isWritable: false },\n ];\n};\n\nexport const mintToAccountsLayout = (\n accounts: mintToAccountsLayoutParams,\n): AccountMeta[] => {\n const defaultPubkey = CompressedTokenProgram.programId;\n const {\n feePayer,\n authority,\n cpiAuthorityPda,\n mint,\n tokenPoolPda,\n tokenProgram,\n lightSystemProgram,\n registeredProgramPda,\n noopProgram,\n accountCompressionAuthority,\n accountCompressionProgram,\n merkleTree,\n selfProgram,\n systemProgram,\n solPoolPda,\n } = accounts;\n\n const accountsList: AccountMeta[] = [\n { pubkey: feePayer, isSigner: true, isWritable: true },\n { pubkey: authority, isSigner: true, isWritable: false },\n { pubkey: cpiAuthorityPda, isSigner: false, isWritable: false },\n { pubkey: mint, isSigner: false, isWritable: true },\n { pubkey: tokenPoolPda, isSigner: false, isWritable: true },\n { pubkey: tokenProgram, isSigner: false, isWritable: false },\n { pubkey: lightSystemProgram, isSigner: false, isWritable: false },\n { pubkey: registeredProgramPda, isSigner: false, isWritable: false },\n { pubkey: noopProgram, isSigner: false, isWritable: false },\n {\n pubkey: accountCompressionAuthority,\n isSigner: false,\n isWritable: false,\n },\n {\n pubkey: accountCompressionProgram,\n isSigner: false,\n isWritable: false,\n },\n { pubkey: merkleTree, isSigner: false, isWritable: true },\n { pubkey: selfProgram, isSigner: false, isWritable: false },\n { pubkey: systemProgram, isSigner: false, isWritable: false },\n {\n pubkey: solPoolPda ?? defaultPubkey,\n isSigner: false,\n isWritable: true,\n },\n ];\n\n return accountsList;\n};\n\nexport const transferAccountsLayout = (\n accounts: transferAccountsLayoutParams,\n): AccountMeta[] => {\n const defaultPubkey = CompressedTokenProgram.programId;\n const {\n feePayer,\n authority,\n cpiAuthorityPda,\n lightSystemProgram,\n registeredProgramPda,\n noopProgram,\n accountCompressionAuthority,\n accountCompressionProgram,\n selfProgram,\n tokenPoolPda,\n compressOrDecompressTokenAccount,\n tokenProgram,\n systemProgram,\n } = accounts;\n\n const accountsList: AccountMeta[] = [\n { pubkey: feePayer, isSigner: true, isWritable: true },\n { pubkey: authority, isSigner: true, isWritable: false },\n { pubkey: cpiAuthorityPda, isSigner: false, isWritable: false },\n { pubkey: lightSystemProgram, isSigner: false, isWritable: false },\n { pubkey: registeredProgramPda, isSigner: false, isWritable: false },\n { pubkey: noopProgram, isSigner: false, isWritable: false },\n {\n pubkey: accountCompressionAuthority,\n isSigner: false,\n isWritable: false,\n },\n {\n pubkey: accountCompressionProgram,\n isSigner: false,\n isWritable: false,\n },\n { pubkey: selfProgram, isSigner: false, isWritable: false },\n {\n pubkey: tokenPoolPda ?? defaultPubkey,\n isSigner: false,\n isWritable: true,\n },\n {\n pubkey: compressOrDecompressTokenAccount ?? defaultPubkey,\n isSigner: false,\n isWritable: true,\n },\n {\n pubkey: tokenProgram ?? defaultPubkey,\n isSigner: false,\n isWritable: false,\n },\n { pubkey: systemProgram, isSigner: false, isWritable: false },\n ];\n\n return accountsList;\n};\n\nexport const approveAccountsLayout = (\n accounts: approveAccountsLayoutParams,\n): AccountMeta[] => {\n const {\n feePayer,\n authority,\n cpiAuthorityPda,\n lightSystemProgram,\n registeredProgramPda,\n noopProgram,\n accountCompressionAuthority,\n accountCompressionProgram,\n selfProgram,\n systemProgram,\n } = accounts;\n\n return [\n { pubkey: feePayer, isSigner: true, isWritable: true },\n { pubkey: authority, isSigner: true, isWritable: false },\n { pubkey: cpiAuthorityPda, isSigner: false, isWritable: false },\n { pubkey: lightSystemProgram, isSigner: false, isWritable: false },\n { pubkey: registeredProgramPda, isSigner: false, isWritable: false },\n { pubkey: noopProgram, isSigner: false, isWritable: false },\n {\n pubkey: accountCompressionAuthority,\n isSigner: false,\n isWritable: false,\n },\n {\n pubkey: accountCompressionProgram,\n isSigner: false,\n isWritable: false,\n },\n { pubkey: selfProgram, isSigner: false, isWritable: false },\n { pubkey: systemProgram, isSigner: false, isWritable: false },\n ];\n};\n\nexport const revokeAccountsLayout = approveAccountsLayout;\n\nexport const freezeAccountsLayout = (\n accounts: freezeAccountsLayoutParams,\n): AccountMeta[] => {\n const {\n feePayer,\n authority,\n cpiAuthorityPda,\n lightSystemProgram,\n registeredProgramPda,\n noopProgram,\n accountCompressionAuthority,\n accountCompressionProgram,\n selfProgram,\n systemProgram,\n mint,\n } = accounts;\n\n return [\n { pubkey: feePayer, isSigner: true, isWritable: true },\n { pubkey: authority, isSigner: true, isWritable: false },\n { pubkey: cpiAuthorityPda, isSigner: false, isWritable: false },\n { pubkey: lightSystemProgram, isSigner: false, isWritable: false },\n { pubkey: registeredProgramPda, isSigner: false, isWritable: false },\n { pubkey: noopProgram, isSigner: false, isWritable: false },\n {\n pubkey: accountCompressionAuthority,\n isSigner: false,\n isWritable: false,\n },\n {\n pubkey: accountCompressionProgram,\n isSigner: false,\n isWritable: false,\n },\n { pubkey: selfProgram, isSigner: false, isWritable: false },\n { pubkey: systemProgram, isSigner: false, isWritable: false },\n { pubkey: mint, isSigner: false, isWritable: false },\n ];\n};\n\nexport const thawAccountsLayout = freezeAccountsLayout;\n\nexport const CompressedTokenInstructionDataApproveLayout = struct([\n struct(\n [array(u8(), 32, 'a'), array(u8(), 64, 'b'), array(u8(), 32, 'c')],\n 'proof',\n ),\n publicKey('mint'),\n vec(InputTokenDataWithContextLayout, 'inputTokenDataWithContext'),\n option(CpiContextLayout, 'cpiContext'),\n publicKey('delegate'),\n u64('delegatedAmount'),\n u8('delegateMerkleTreeIndex'),\n u8('changeAccountMerkleTreeIndex'),\n option(u64(), 'delegateLamports'),\n]);\n\nexport const CompressedTokenInstructionDataRevokeLayout = struct([\n struct(\n [array(u8(), 32, 'a'), array(u8(), 64, 'b'), array(u8(), 32, 'c')],\n 'proof',\n ),\n publicKey('mint'),\n vec(InputTokenDataWithContextLayout, 'inputTokenDataWithContext'),\n option(CpiContextLayout, 'cpiContext'),\n u8('outputAccountMerkleTreeIndex'),\n]);\n\n// Approve and revoke instuctions do not support optional proof yet.\nconst emptyProof: ValidityProof = {\n a: new Array(32).fill(0),\n b: new Array(64).fill(0),\n c: new Array(32).fill(0),\n};\n\nfunction isEmptyProof(proof: ValidityProof): boolean {\n return (\n proof.a.every(a => a === 0) &&\n proof.b.every(b => b === 0) &&\n proof.c.every(c => c === 0)\n );\n}\n\nexport function encodeApproveInstructionData(\n data: CompressedTokenInstructionDataApprove,\n): Buffer {\n const buffer = Buffer.alloc(1000);\n\n const proofOption = data.proof ?? emptyProof;\n\n const len = CompressedTokenInstructionDataApproveLayout.encode(\n {\n ...data,\n proof: proofOption,\n },\n buffer,\n );\n\n const lengthBuffer = Buffer.alloc(4);\n lengthBuffer.writeUInt32LE(len, 0);\n\n const dataBuffer = buffer.subarray(0, len);\n\n return Buffer.concat([\n new Uint8Array(APPROVE_DISCRIMINATOR),\n new Uint8Array(lengthBuffer),\n new Uint8Array(dataBuffer),\n ]);\n}\n\nexport function decodeApproveInstructionData(\n buffer: Buffer,\n): CompressedTokenInstructionDataApprove {\n const data = CompressedTokenInstructionDataApproveLayout.decode(\n buffer.subarray(APPROVE_DISCRIMINATOR.length),\n ) as CompressedTokenInstructionDataApprove;\n return {\n ...data,\n proof: isEmptyProof(data.proof!) ? null : data.proof!,\n };\n}\n\nexport function encodeRevokeInstructionData(\n data: CompressedTokenInstructionDataRevoke,\n): Buffer {\n const buffer = Buffer.alloc(1000);\n\n const proofOption = data.proof ?? emptyProof;\n\n const len = CompressedTokenInstructionDataRevokeLayout.encode(\n {\n ...data,\n proof: proofOption,\n },\n buffer,\n );\n\n const lengthBuffer = Buffer.alloc(4);\n lengthBuffer.writeUInt32LE(len, 0);\n\n const dataBuffer = buffer.subarray(0, len);\n\n return Buffer.concat([\n new Uint8Array(REVOKE_DISCRIMINATOR),\n new Uint8Array(lengthBuffer),\n new Uint8Array(dataBuffer),\n ]);\n}\n\nexport function decodeRevokeInstructionData(\n buffer: Buffer,\n): CompressedTokenInstructionDataRevoke {\n const data = CompressedTokenInstructionDataRevokeLayout.decode(\n buffer.subarray(REVOKE_DISCRIMINATOR.length),\n ) as CompressedTokenInstructionDataRevoke;\n return {\n ...data,\n proof: isEmptyProof(data.proof!) ? null : data.proof!,\n };\n}\n","import {\n PublicKey,\n TransactionInstruction,\n SystemProgram,\n Connection,\n AddressLookupTableProgram,\n AccountMeta,\n ComputeBudgetProgram,\n} from '@solana/web3.js';\nimport BN from 'bn.js';\nimport { Buffer } from 'buffer';\nimport {\n ValidityProof,\n LightSystemProgram,\n ParsedTokenAccount,\n bn,\n defaultStaticAccountsStruct,\n sumUpLamports,\n toArray,\n validateSameOwner,\n validateSufficientBalance,\n defaultTestStateTreeAccounts,\n TreeInfo,\n CompressedProof,\n featureFlags,\n TreeType,\n} from '@lightprotocol/stateless.js';\nimport {\n MINT_SIZE,\n TOKEN_2022_PROGRAM_ID,\n TOKEN_PROGRAM_ID,\n createInitializeMint2Instruction,\n createMintToInstruction,\n} from '@solana/spl-token';\nimport {\n CPI_AUTHORITY_SEED,\n POOL_SEED,\n CREATE_TOKEN_POOL_DISCRIMINATOR,\n ADD_TOKEN_POOL_DISCRIMINATOR,\n} from './constants';\nimport { checkMint, packCompressedTokenAccounts } from './utils';\nimport {\n encodeTransferInstructionData,\n encodeCompressSplTokenAccountInstructionData,\n encodeMintToInstructionData,\n createTokenPoolAccountsLayout,\n mintToAccountsLayout,\n transferAccountsLayout,\n approveAccountsLayout,\n revokeAccountsLayout,\n encodeApproveInstructionData,\n encodeRevokeInstructionData,\n addTokenPoolAccountsLayout,\n encodeBatchCompressInstructionData,\n} from './layout';\nimport {\n BatchCompressInstructionData,\n CompressedTokenInstructionDataApprove,\n CompressedTokenInstructionDataRevoke,\n CompressedTokenInstructionDataTransfer,\n DelegatedTransfer,\n TokenTransferOutputData,\n} from './types';\nimport {\n checkTokenPoolInfo,\n TokenPoolInfo,\n} from './utils/get-token-pool-infos';\n\nexport type CompressParams = {\n /**\n * Fee payer\n */\n payer: PublicKey;\n /**\n * Owner of uncompressed token account\n */\n owner: PublicKey;\n /**\n * Source SPL Token account address\n */\n source: PublicKey;\n /**\n * Recipient address(es)\n */\n toAddress: PublicKey | PublicKey[];\n /**\n * Token amount(s) to compress\n */\n amount: number | BN | number[] | BN[];\n /**\n * SPL Token mint address\n */\n mint: PublicKey;\n /**\n * State tree to write to\n */\n outputStateTreeInfo: TreeInfo;\n /**\n * Token pool\n */\n tokenPoolInfo: TokenPoolInfo;\n};\n\nexport type CompressSplTokenAccountParams = {\n /**\n * Fee payer\n */\n feePayer: PublicKey;\n /**\n * SPL Token account owner\n */\n authority: PublicKey;\n /**\n * SPL Token account to compress\n */\n tokenAccount: PublicKey;\n /**\n * SPL Token mint address\n */\n mint: PublicKey;\n /**\n * Amount to leave in token account\n */\n remainingAmount?: BN;\n /**\n * State tree to write to\n */\n outputStateTreeInfo: TreeInfo;\n /**\n * Token pool\n */\n tokenPoolInfo: TokenPoolInfo;\n};\n\nexport type DecompressParams = {\n /**\n * Fee payer\n */\n payer: PublicKey;\n /**\n * Source compressed token accounts\n */\n inputCompressedTokenAccounts: ParsedTokenAccount[];\n /**\n * Destination uncompressed token account\n */\n toAddress: PublicKey;\n /**\n * Token amount to decompress\n */\n amount: number | BN;\n /**\n * Validity proof for input state\n */\n recentValidityProof: ValidityProof | CompressedProof | null;\n /**\n * Recent state root indices\n */\n recentInputStateRootIndices: number[];\n /**\n * Token pool(s)\n */\n tokenPoolInfos: TokenPoolInfo | TokenPoolInfo[];\n};\n\nexport type TransferParams = {\n /**\n * Fee payer\n */\n payer: PublicKey;\n /**\n * Source compressed token accounts\n */\n inputCompressedTokenAccounts: ParsedTokenAccount[];\n /**\n * Recipient address\n */\n toAddress: PublicKey;\n /**\n * Token amount to transfer\n */\n amount: BN | number;\n /**\n * Validity proof for input state\n */\n recentValidityProof: ValidityProof | CompressedProof | null;\n /**\n * Recent state root indices\n */\n recentInputStateRootIndices: number[];\n};\n\nexport type ApproveParams = {\n /**\n * Fee payer\n */\n payer: PublicKey;\n /**\n * Source compressed token accounts\n */\n inputCompressedTokenAccounts: ParsedTokenAccount[];\n /**\n * Recipient address\n */\n toAddress: PublicKey;\n /**\n * Token amount to approve\n */\n amount: BN | number;\n /**\n * Validity proof for input state\n */\n recentValidityProof: ValidityProof | CompressedProof | null;\n /**\n * Recent state root indices\n */\n recentInputStateRootIndices: number[];\n};\n\nexport type RevokeParams = {\n /**\n * Fee payer\n */\n payer: PublicKey;\n /**\n * Input compressed token accounts\n */\n inputCompressedTokenAccounts: ParsedTokenAccount[];\n /**\n * Validity proof for input state\n */\n recentValidityProof: ValidityProof | CompressedProof | null;\n /**\n * Recent state root indices\n */\n recentInputStateRootIndices: number[];\n};\n\n/**\n * Create Mint account for compressed Tokens\n */\nexport type CreateMintParams = {\n /**\n * Fee payer\n */\n feePayer: PublicKey;\n /**\n * SPL Mint address\n */\n mint: PublicKey;\n /**\n * Mint authority\n */\n authority: PublicKey;\n /**\n * Optional: freeze authority\n */\n freezeAuthority: PublicKey | null;\n /**\n * Mint decimals\n */\n decimals: number;\n /**\n * lamport amount for mint account rent exemption\n */\n rentExemptBalance: number;\n /**\n * Optional: The token program ID. Default: SPL Token Program ID\n */\n tokenProgramId?: PublicKey;\n /**\n * Optional: Mint size to use, defaults to MINT_SIZE\n */\n mintSize?: number;\n};\n\n/**\n * Parameters for merging compressed token accounts\n */\nexport type MergeTokenAccountsParams = {\n /**\n * Fee payer\n */\n payer: PublicKey;\n /**\n * Owner of the compressed token accounts to be merged\n */\n owner: PublicKey;\n /**\n * SPL Token mint address\n */\n mint: PublicKey;\n /**\n * Array of compressed token accounts to merge\n */\n inputCompressedTokenAccounts: ParsedTokenAccount[];\n /**\n * Validity proof for state inclusion\n */\n recentValidityProof: ValidityProof | CompressedProof | null;\n /**\n * State root indices of the input state\n */\n recentInputStateRootIndices: number[];\n};\n\n/**\n * Create compressed token accounts\n */\nexport type MintToParams = {\n /**\n * Fee payer\n */\n feePayer: PublicKey;\n /**\n * Token mint address\n */\n mint: PublicKey;\n /**\n * Mint authority\n */\n authority: PublicKey;\n /**\n * Recipient address(es)\n */\n toPubkey: PublicKey[] | PublicKey;\n /**\n * Token amount(s) to mint\n */\n amount: BN | BN[] | number | number[];\n /**\n * State tree for minted tokens\n */\n outputStateTreeInfo: TreeInfo;\n /**\n * Token pool\n */\n tokenPoolInfo: TokenPoolInfo;\n};\n\n/**\n * Register an existing SPL mint account to the compressed token program\n * Creates an omnibus account for the mint\n */\nexport type CreateTokenPoolParams = {\n /**\n * Fee payer\n */\n feePayer: PublicKey;\n /**\n * SPL Mint address\n */\n mint: PublicKey;\n /**\n * Optional: The token program ID. Default: SPL Token Program ID\n */\n tokenProgramId?: PublicKey;\n};\n\nexport type AddTokenPoolParams = {\n /**\n * Fee payer\n */\n feePayer: PublicKey;\n /**\n * Token mint address\n */\n mint: PublicKey;\n /**\n * Token pool index\n */\n poolIndex: number;\n /**\n * Optional: Token program ID. Default: SPL Token Program ID\n */\n tokenProgramId?: PublicKey;\n};\n\n/**\n * Mint from existing SPL mint to compressed token accounts\n */\nexport type ApproveAndMintToParams = {\n /**\n * Fee payer\n */\n feePayer: PublicKey;\n /**\n * SPL Mint address\n */\n mint: PublicKey;\n /**\n * Mint authority\n */\n authority: PublicKey;\n /**\n * Mint authority (associated) token account\n */\n authorityTokenAccount: PublicKey;\n /**\n * Recipient address\n */\n toPubkey: PublicKey;\n /**\n * Token amount to mint\n */\n amount: BN | number;\n /**\n * State tree to write to\n */\n outputStateTreeInfo: TreeInfo;\n /**\n * Token pool\n */\n tokenPoolInfo: TokenPoolInfo;\n};\n\nexport type CreateTokenProgramLookupTableParams = {\n /**\n * Fee payer\n */\n payer: PublicKey;\n /**\n * Authority of the transaction\n */\n authority: PublicKey;\n /**\n * Optional Mint addresses to store in the lookup table\n */\n mints?: PublicKey[];\n /**\n * Recently finalized Solana slot\n */\n recentSlot: number;\n /**\n * Optional additional addresses to store in the lookup table\n */\n remainingAccounts?: PublicKey[];\n};\n\n/**\n * Sum up the token amounts of the compressed token accounts\n */\nexport const sumUpTokenAmount = (accounts: ParsedTokenAccount[]): BN => {\n return accounts.reduce(\n (acc, account: ParsedTokenAccount) => acc.add(account.parsed.amount),\n bn(0),\n );\n};\n\n/**\n * Validate that all the compressed token accounts are owned by the same owner.\n */\nexport const validateSameTokenOwner = (accounts: ParsedTokenAccount[]) => {\n const owner = accounts[0].parsed.owner;\n accounts.forEach(acc => {\n if (!acc.parsed.owner.equals(owner)) {\n throw new Error('Token accounts must be owned by the same owner');\n }\n });\n};\n\n/**\n * Parse compressed token accounts to get the mint, current owner and delegate.\n */\nexport const parseTokenData = (\n compressedTokenAccounts: ParsedTokenAccount[],\n) => {\n const mint = compressedTokenAccounts[0].parsed.mint;\n const currentOwner = compressedTokenAccounts[0].parsed.owner;\n const delegate = compressedTokenAccounts[0].parsed.delegate;\n\n return { mint, currentOwner, delegate };\n};\n\nexport const parseMaybeDelegatedTransfer = (\n inputs: ParsedTokenAccount[],\n outputs: TokenTransferOutputData[],\n): { delegatedTransfer: DelegatedTransfer | null; authority: PublicKey } => {\n if (inputs.length < 1)\n throw new Error('Must supply at least one input token account.');\n\n const owner = inputs[0].parsed.owner;\n\n const delegatedAccountsIndex = inputs.findIndex(a => a.parsed.delegate);\n\n /// Fast path: no delegated account used\n if (delegatedAccountsIndex === -1)\n return { delegatedTransfer: null, authority: owner };\n\n const delegate = inputs[delegatedAccountsIndex].parsed.delegate;\n const delegateChangeAccountIndex = outputs.length <= 1 ? null : 0;\n\n return {\n delegatedTransfer: {\n owner,\n delegateChangeAccountIndex,\n },\n authority: delegate!,\n };\n};\n\n/**\n * Create the output state for a transfer transaction.\n * @param inputCompressedTokenAccounts Input state\n * @param toAddress Recipient address\n * @param amount Amount of tokens to transfer\n * @returns Output token data for the transfer\n * instruction\n */\nexport function createTransferOutputState(\n inputCompressedTokenAccounts: ParsedTokenAccount[],\n toAddress: PublicKey,\n amount: number | BN,\n): TokenTransferOutputData[] {\n amount = bn(amount);\n const inputAmount = sumUpTokenAmount(inputCompressedTokenAccounts);\n const inputLamports = sumUpLamports(\n inputCompressedTokenAccounts.map(acc => acc.compressedAccount),\n );\n\n const changeAmount = inputAmount.sub(amount);\n\n validateSufficientBalance(changeAmount);\n\n if (changeAmount.eq(bn(0)) && inputLamports.eq(bn(0))) {\n return [\n {\n owner: toAddress,\n amount,\n lamports: inputLamports,\n tlv: null,\n },\n ];\n }\n\n /// validates token program\n validateSameOwner(\n inputCompressedTokenAccounts.map(acc => acc.compressedAccount),\n );\n validateSameTokenOwner(inputCompressedTokenAccounts);\n\n const outputCompressedAccounts: TokenTransferOutputData[] = [\n {\n owner: inputCompressedTokenAccounts[0].parsed.owner,\n amount: changeAmount,\n lamports: inputLamports,\n tlv: null,\n },\n {\n owner: toAddress,\n amount,\n lamports: bn(0),\n tlv: null,\n },\n ];\n return outputCompressedAccounts;\n}\n\n/**\n * Create the output state for a compress transaction.\n * @param inputCompressedTokenAccounts Input state\n * @param amount Amount of tokens to compress\n * @returns Output token data for the compress\n * instruction\n */\nexport function createDecompressOutputState(\n inputCompressedTokenAccounts: ParsedTokenAccount[],\n amount: number | BN,\n): TokenTransferOutputData[] {\n amount = bn(amount);\n const inputLamports = sumUpLamports(\n inputCompressedTokenAccounts.map(acc => acc.compressedAccount),\n );\n const inputAmount = sumUpTokenAmount(inputCompressedTokenAccounts);\n const changeAmount = inputAmount.sub(amount);\n\n validateSufficientBalance(changeAmount);\n\n /// lamports gets decompressed\n if (changeAmount.eq(bn(0)) && inputLamports.eq(bn(0))) {\n return [];\n }\n\n validateSameOwner(\n inputCompressedTokenAccounts.map(acc => acc.compressedAccount),\n );\n validateSameTokenOwner(inputCompressedTokenAccounts);\n\n const tokenTransferOutputs: TokenTransferOutputData[] = [\n {\n owner: inputCompressedTokenAccounts[0].parsed.owner,\n amount: changeAmount,\n lamports: inputLamports,\n tlv: null,\n },\n ];\n return tokenTransferOutputs;\n}\n\nexport class CompressedTokenProgram {\n /**\n * @internal\n */\n constructor() {}\n\n /**\n * Public key that identifies the CompressedPda program\n */\n static programId: PublicKey = new PublicKey(\n 'cTokenmWW8bLPjZEBAUgYy3zKxQZW6VKi7bqNFEVv3m',\n );\n\n /**\n * Set a custom programId via PublicKey or base58 encoded string.\n * This method is not required for regular usage.\n *\n * Use this only if you know what you are doing.\n */\n static setProgramId(programId: PublicKey | string) {\n this.programId =\n typeof programId === 'string'\n ? new PublicKey(programId)\n : programId;\n }\n\n /**\n * Derive the token pool pda.\n * To derive the token pool pda with bump, use {@link deriveTokenPoolPdaWithIndex}.\n *\n * @param mint The mint of the token pool\n *\n * @returns The token pool pda\n */\n static deriveTokenPoolPda(mint: PublicKey): PublicKey {\n const seeds = [POOL_SEED, mint.toBuffer()];\n const [address, _] = PublicKey.findProgramAddressSync(\n seeds,\n this.programId,\n );\n return address;\n }\n\n /**\n * Find the index and bump for a given token pool pda and mint.\n *\n * @param poolPda The token pool pda to find the index and bump for\n * @param mint The mint of the token pool\n *\n * @returns The index and bump number.\n */\n static findTokenPoolIndexAndBump(\n poolPda: PublicKey,\n mint: PublicKey,\n ): [number, number] {\n for (let index = 0; index < 5; index++) {\n const derivedPda =\n CompressedTokenProgram.deriveTokenPoolPdaWithIndex(mint, index);\n if (derivedPda[0].equals(poolPda)) {\n return [index, derivedPda[1]];\n }\n }\n throw new Error('Token pool not found');\n }\n\n /**\n * Derive the token pool pda with index.\n *\n * @param mint The mint of the token pool\n * @param index Index. starts at 0. The Protocol supports 4 indexes aka token pools\n * per mint.\n *\n * @returns The token pool pda and bump.\n */\n static deriveTokenPoolPdaWithIndex(\n mint: PublicKey,\n index: number,\n ): [PublicKey, number] {\n let seeds: Buffer[] = [];\n if (index === 0) {\n seeds = [Buffer.from('pool'), mint.toBuffer(), Buffer.from([])]; // legacy, 1st\n } else {\n seeds = [\n Buffer.from('pool'),\n mint.toBuffer(),\n Buffer.from([index]),\n ];\n }\n const [address, bump] = PublicKey.findProgramAddressSync(\n seeds,\n this.programId,\n );\n return [address, bump];\n }\n\n /** @internal */\n static get deriveCpiAuthorityPda(): PublicKey {\n const [address, _] = PublicKey.findProgramAddressSync(\n [CPI_AUTHORITY_SEED],\n this.programId,\n );\n return address;\n }\n\n /**\n * Construct createMint instruction for compressed tokens.\n *\n * @param feePayer Fee payer.\n * @param mint SPL Mint address.\n * @param authority Mint authority.\n * @param freezeAuthority Optional: freeze authority.\n * @param decimals Decimals.\n * @param rentExemptBalance Lamport amount for mint account rent exemption.\n * @param tokenProgramId Optional: Token program ID. Default: SPL Token Program ID\n * @param mintSize Optional: mint size. Default: MINT_SIZE\n *\n * @returns [createMintAccountInstruction, initializeMintInstruction,\n * createTokenPoolInstruction]\n *\n * Note that `createTokenPoolInstruction` must be executed after\n * `initializeMintInstruction`.\n */\n static async createMint({\n feePayer,\n mint,\n authority,\n freezeAuthority,\n decimals,\n rentExemptBalance,\n tokenProgramId,\n mintSize,\n }: CreateMintParams): Promise<TransactionInstruction[]> {\n const tokenProgram = tokenProgramId ?? TOKEN_PROGRAM_ID;\n\n /// Create and initialize SPL Mint account\n const createMintAccountInstruction = SystemProgram.createAccount({\n fromPubkey: feePayer,\n lamports: rentExemptBalance,\n newAccountPubkey: mint,\n programId: tokenProgram,\n space: mintSize ?? MINT_SIZE,\n });\n\n const initializeMintInstruction = createInitializeMint2Instruction(\n mint,\n decimals,\n authority,\n freezeAuthority,\n tokenProgram,\n );\n\n const createTokenPoolInstruction = await this.createTokenPool({\n feePayer,\n mint,\n tokenProgramId: tokenProgram,\n });\n\n return [\n createMintAccountInstruction,\n initializeMintInstruction,\n createTokenPoolInstruction,\n ];\n }\n\n /**\n * Enable compression for an existing SPL mint, creating an omnibus account.\n * For new mints, use `CompressedTokenProgram.createMint`.\n *\n * @param feePayer Fee payer.\n * @param mint SPL Mint address.\n * @param tokenProgramId Optional: Token program ID. Default: SPL\n * Token Program ID\n *\n * @returns The createTokenPool instruction\n */\n static async createTokenPool({\n feePayer,\n mint,\n tokenProgramId,\n }: CreateTokenPoolParams): Promise<TransactionInstruction> {\n const tokenProgram = tokenProgramId ?? TOKEN_PROGRAM_ID;\n\n const tokenPoolPda = this.deriveTokenPoolPdaWithIndex(mint, 0);\n\n const keys = createTokenPoolAccountsLayout({\n mint,\n feePayer,\n tokenPoolPda: tokenPoolPda[0],\n tokenProgram,\n cpiAuthorityPda: this.deriveCpiAuthorityPda,\n systemProgram: SystemProgram.programId,\n });\n\n return new TransactionInstruction({\n programId: this.programId,\n keys,\n data: CREATE_TOKEN_POOL_DISCRIMINATOR,\n });\n }\n\n /**\n * Add a token pool to an existing SPL mint. For new mints, use\n * {@link createTokenPool}.\n *\n * @param feePayer Fee payer.\n * @param mint SPL Mint address.\n * @param poolIndex Pool index.\n * @param tokenProgramId Optional: Token program ID. Default: SPL\n * Token Program ID\n *\n * @returns The addTokenPool instruction\n */\n static async addTokenPool({\n feePayer,\n mint,\n poolIndex,\n tokenProgramId,\n }: AddTokenPoolParams): Promise<TransactionInstruction> {\n if (poolIndex <= 0) {\n throw new Error(\n 'Pool index must be greater than 0. For 0, use CreateTokenPool instead.',\n );\n }\n if (poolIndex > 3) {\n throw new Error(\n `Invalid poolIndex ${poolIndex}. Max 4 pools per mint.`,\n );\n }\n\n const tokenProgram = tokenProgramId ?? TOKEN_PROGRAM_ID;\n\n const existingTokenPoolPda = this.deriveTokenPoolPdaWithIndex(\n mint,\n poolIndex - 1,\n );\n const tokenPoolPda = this.deriveTokenPoolPdaWithIndex(mint, poolIndex);\n\n const keys = addTokenPoolAccountsLayout({\n mint,\n feePayer,\n tokenPoolPda: tokenPoolPda[0],\n existingTokenPoolPda: existingTokenPoolPda[0],\n tokenProgram,\n cpiAuthorityPda: this.deriveCpiAuthorityPda,\n systemProgram: SystemProgram.programId,\n });\n\n return new TransactionInstruction({\n programId: this.programId,\n keys,\n data: Buffer.concat([\n new Uint8Array(ADD_TOKEN_POOL_DISCRIMINATOR),\n new Uint8Array(Buffer.from([poolIndex])),\n ]),\n });\n }\n\n /**\n * Construct mintTo instruction for compressed tokens\n *\n * @param feePayer Fee payer.\n * @param mint SPL Mint address.\n * @param authority Mint authority.\n * @param toPubkey Recipient owner address.\n * @param amount Amount of tokens to mint.\n * @param outputStateTreeInfo State tree to write to.\n * @param tokenPoolInfo Token pool info.\n *\n * @returns The mintTo instruction\n */\n static async mintTo({\n feePayer,\n mint,\n authority,\n toPubkey,\n amount,\n outputStateTreeInfo,\n tokenPoolInfo,\n }: MintToParams): Promise<TransactionInstruction> {\n const systemKeys = defaultStaticAccountsStruct();\n const tokenProgram = tokenPoolInfo.tokenProgram;\n checkTokenPoolInfo(tokenPoolInfo, mint);\n\n const amounts = toArray<BN | number>(amount).map(amount => bn(amount));\n const toPubkeys = toArray(toPubkey);\n\n if (amounts.length !== toPubkeys.length) {\n throw new Error(\n 'Amount and toPubkey arrays must have the same length',\n );\n }\n\n const keys = mintToAccountsLayout({\n mint,\n feePayer,\n authority,\n cpiAuthorityPda: this.deriveCpiAuthorityPda,\n tokenProgram,\n tokenPoolPda: tokenPoolInfo.tokenPoolPda,\n lightSystemProgram: LightSystemProgram.programId,\n registeredProgramPda: systemKeys.registeredProgramPda,\n noopProgram: systemKeys.noopProgram,\n accountCompressionAuthority: systemKeys.accountCompressionAuthority,\n accountCompressionProgram: systemKeys.accountCompressionProgram,\n merkleTree:\n outputStateTreeInfo.treeType === TreeType.StateV2\n ? outputStateTreeInfo.queue\n : outputStateTreeInfo.tree,\n selfProgram: this.programId,\n systemProgram: SystemProgram.programId,\n solPoolPda: null,\n });\n\n const data = encodeMintToInstructionData({\n recipients: toPubkeys,\n amounts,\n lamports: null,\n });\n\n return new TransactionInstruction({\n programId: this.programId,\n keys,\n data,\n });\n }\n\n /**\n * Mint tokens from registered SPL mint account to a compressed account\n *\n * @param feePayer Fee payer.\n * @param mint SPL Mint address.\n * @param authority Mint authority.\n * @param authorityTokenAccount The mint authority's associated token\n * account (ATA).\n * @param toPubkey Recipient owner address.\n * @param amount Amount of tokens to mint.\n * @param outputStateTreeInfo State tree to write to.\n * @param tokenPoolInfo Token pool info.\n *\n * @returns The mintTo instruction\n */\n static async approveAndMintTo({\n feePayer,\n mint,\n authority,\n authorityTokenAccount,\n toPubkey,\n amount,\n outputStateTreeInfo,\n tokenPoolInfo,\n }: ApproveAndMintToParams) {\n const amountBigInt: bigint = BigInt(amount.toString());\n\n /// 1. Mint to existing ATA of mintAuthority.\n const splMintToInstruction = createMintToInstruction(\n mint,\n authorityTokenAccount,\n authority,\n amountBigInt,\n [],\n tokenPoolInfo.tokenProgram,\n );\n\n /// 2. Compress from mint authority ATA to recipient compressed account\n const compressInstruction = await this.compress({\n payer: feePayer,\n owner: authority,\n source: authorityTokenAccount,\n toAddress: toPubkey,\n mint,\n amount,\n outputStateTreeInfo,\n tokenPoolInfo,\n });\n\n return [splMintToInstruction, compressInstruction];\n }\n\n /**\n * Construct transfer instruction for compressed tokens\n *\n * @param payer Fee payer.\n * @param inputCompressedTokenAccounts Source compressed token accounts.\n * @param toAddress Recipient owner address.\n * @param amount Amount of tokens to transfer.\n * @param recentValidityProof Recent validity proof.\n * @param recentInputStateRootIndices Recent state root indices.\n *\n * @returns The transfer instruction\n */\n static async transfer({\n payer,\n inputCompressedTokenAccounts,\n toAddress,\n amount,\n recentValidityProof,\n recentInputStateRootIndices,\n }: TransferParams): Promise<TransactionInstruction> {\n const tokenTransferOutputs: TokenTransferOutputData[] =\n createTransferOutputState(\n inputCompressedTokenAccounts,\n toAddress,\n amount,\n );\n\n const {\n inputTokenDataWithContext,\n packedOutputTokenData,\n remainingAccountMetas,\n } = packCompressedTokenAccounts({\n inputCompressedTokenAccounts,\n rootIndices: recentInputStateRootIndices,\n tokenTransferOutputs,\n });\n\n const { mint } = parseTokenData(inputCompressedTokenAccounts);\n\n const { delegatedTransfer, authority } = parseMaybeDelegatedTransfer(\n inputCompressedTokenAccounts,\n tokenTransferOutputs,\n );\n\n const rawData: CompressedTokenInstructionDataTransfer = {\n proof: recentValidityProof,\n mint,\n delegatedTransfer,\n inputTokenDataWithContext,\n outputCompressedAccounts: packedOutputTokenData,\n compressOrDecompressAmount: null,\n isCompress: false,\n cpiContext: null,\n lamportsChangeAccountMerkleTreeIndex: null,\n };\n const data = encodeTransferInstructionData(rawData);\n\n const {\n accountCompressionAuthority,\n noopProgram,\n registeredProgramPda,\n accountCompressionProgram,\n } = defaultStaticAccountsStruct();\n const keys = transferAccountsLayout({\n feePayer: payer,\n authority,\n cpiAuthorityPda: this.deriveCpiAuthorityPda,\n lightSystemProgram: LightSystemProgram.programId,\n registeredProgramPda: registeredProgramPda,\n noopProgram: noopProgram,\n accountCompressionAuthority: accountCompressionAuthority,\n accountCompressionProgram: accountCompressionProgram,\n selfProgram: this.programId,\n tokenPoolPda: undefined,\n compressOrDecompressTokenAccount: undefined,\n tokenProgram: undefined,\n systemProgram: SystemProgram.programId,\n });\n\n keys.push(...remainingAccountMetas);\n\n return new TransactionInstruction({\n programId: this.programId,\n keys,\n data,\n });\n }\n\n /**\n * Create lookup table instructions for the token program's default\n * accounts.\n *\n * @param payer Fee payer.\n * @param authority Authority.\n * @param mints Mints.\n * @param recentSlot Recent slot.\n * @param remainingAccounts Remaining accounts.\n *\n * @returns [createInstruction, extendInstruction, option(extendInstruction2)]\n */\n static async createTokenProgramLookupTable({\n payer,\n authority,\n mints,\n recentSlot,\n remainingAccounts,\n }: CreateTokenProgramLookupTableParams) {\n // Gather all keys into a single deduped array before creating instructions\n let allKeys: PublicKey[] = [\n SystemProgram.programId,\n ComputeBudgetProgram.programId,\n this.deriveCpiAuthorityPda,\n LightSystemProgram.programId,\n CompressedTokenProgram.programId,\n defaultStaticAccountsStruct().registeredProgramPda,\n defaultStaticAccountsStruct().noopProgram,\n defaultStaticAccountsStruct().accountCompressionAuthority,\n defaultStaticAccountsStruct().accountCompressionProgram,\n defaultTestStateTreeAccounts().merkleTree,\n defaultTestStateTreeAccounts().nullifierQueue,\n defaultTestStateTreeAccounts().addressTree,\n defaultTestStateTreeAccounts().addressQueue,\n this.programId,\n TOKEN_PROGRAM_ID,\n TOKEN_2022_PROGRAM_ID,\n authority,\n ];\n\n if (mints) {\n allKeys.push(\n ...mints,\n ...mints.map(mint => this.deriveTokenPoolPda(mint)),\n );\n }\n\n if (remainingAccounts && remainingAccounts.length > 0) {\n allKeys.push(...remainingAccounts);\n }\n\n // Deduplicate keys\n const seen = new Set<string>();\n const dedupedKeys = allKeys.filter(key => {\n const keyStr = key.toBase58();\n if (seen.has(keyStr)) return false;\n seen.add(keyStr);\n return true;\n });\n\n const [createInstruction, lookupTableAddress] =\n AddressLookupTableProgram.createLookupTable({\n authority,\n payer: authority,\n recentSlot,\n });\n\n const instructions = [createInstruction];\n\n // Add up to 25 keys per extend instruction\n for (let i = 0; i < dedupedKeys.length; i += 25) {\n const chunk = dedupedKeys.slice(i, i + 25);\n const extendIx = AddressLookupTableProgram.extendLookupTable({\n payer,\n authority,\n lookupTable: lookupTableAddress,\n addresses: chunk,\n });\n instructions.push(extendIx);\n }\n\n return {\n instructions,\n address: lookupTableAddress,\n };\n }\n\n /**\n * Create compress instruction\n *\n * @param payer Fee payer.\n * @param owner Owner of uncompressed token account.\n * @param source Source SPL Token account address.\n * @param toAddress Recipient owner address(es).\n * @param amount Amount of tokens to compress.\n * @param mint SPL Token mint address.\n * @param outputStateTreeInfo State tree to write to.\n * @param tokenPoolInfo Token pool info.\n *\n * @returns The compress instruction\n */\n static async compress({\n payer,\n owner,\n source,\n toAddress,\n amount,\n mint,\n outputStateTreeInfo,\n tokenPoolInfo,\n }: CompressParams): Promise<TransactionInstruction> {\n let tokenTransferOutputs: TokenTransferOutputData[];\n\n const amountArray = toArray<BN | number>(amount);\n const toAddressArray = toArray(toAddress);\n\n checkTokenPoolInfo(tokenPoolInfo, mint);\n\n if (amountArray.length !== toAddressArray.length) {\n throw new Error(\n 'Amount and toAddress arrays must have the same length',\n );\n }\n if (featureFlags.isV2()) {\n const [index, bump] = this.findTokenPoolIndexAndBump(\n tokenPoolInfo.tokenPoolPda,\n mint,\n );\n const rawData: BatchCompressInstructionData = {\n pubkeys: toAddressArray,\n amounts:\n amountArray.length > 1\n ? amountArray.map(amt => bn(amt))\n : null,\n lamports: null,\n amount: amountArray.length === 1 ? bn(amountArray[0]) : null,\n index,\n bump,\n };\n\n const data = encodeBatchCompressInstructionData(rawData);\n const keys = mintToAccountsLayout({\n mint,\n feePayer: payer,\n authority: owner,\n cpiAuthorityPda: this.deriveCpiAuthorityPda,\n tokenProgram: tokenPoolInfo.tokenProgram,\n tokenPoolPda: tokenPoolInfo.tokenPoolPda,\n lightSystemProgram: LightSystemProgram.programId,\n ...defaultStaticAccountsStruct(),\n merkleTree: outputStateTreeInfo.queue,\n selfProgram: this.programId,\n systemProgram: SystemProgram.programId,\n solPoolPda: null,\n });\n keys.push({\n pubkey: source,\n isWritable: true,\n isSigner: false,\n });\n\n return new TransactionInstruction({\n programId: this.programId,\n keys,\n data,\n });\n } else {\n tokenTransferOutputs = amountArray.map((amt, index) => {\n const amountBN = bn(amt);\n return {\n owner: toAddressArray[index],\n amount: amountBN,\n lamports: null,\n tlv: null,\n };\n });\n\n const {\n inputTokenDataWithContext,\n packedOutputTokenData,\n remainingAccountMetas,\n } = packCompressedTokenAccounts({\n inputCompressedTokenAccounts: [],\n outputStateTreeInfo,\n rootIndices: [],\n tokenTransferOutputs,\n });\n\n const rawData: CompressedTokenInstructionDataTransfer = {\n proof: null,\n mint,\n delegatedTransfer: null,\n inputTokenDataWithContext,\n outputCompressedAccounts: packedOutputTokenData,\n compressOrDecompressAmount: Array.isArray(amount)\n ? amount\n .map(amt => bn(amt))\n .reduce((sum, amt) => sum.add(amt), bn(0))\n : bn(amount),\n isCompress: true,\n cpiContext: null,\n lamportsChangeAccountMerkleTreeIndex: null,\n };\n const data = encodeTransferInstructionData(rawData);\n const keys = transferAccountsLayout({\n ...defaultStaticAccountsStruct(),\n feePayer: payer,\n authority: owner,\n cpiAuthorityPda: this.deriveCpiAuthorityPda,\n lightSystemProgram: LightSystemProgram.programId,\n selfProgram: this.programId,\n systemProgram: SystemProgram.programId,\n tokenPoolPda: tokenPoolInfo.tokenPoolPda,\n compressOrDecompressTokenAccount: source,\n tokenProgram: tokenPoolInfo.tokenProgram,\n });\n keys.push(...remainingAccountMetas);\n\n return new TransactionInstruction({\n programId: this.programId,\n keys,\n data,\n });\n }\n }\n\n /**\n * Construct decompress instruction\n *\n * @param payer Fee payer.\n * @param inputCompressedTokenAccounts Source compressed token accounts.\n * @param toAddress Destination **uncompressed** token\n * account address. (ATA)\n * @param amount Amount of tokens to decompress.\n * @param recentValidityProof Recent validity proof.\n * @param recentInputStateRootIndices Recent state root indices.\n * @param tokenPoolInfos Token pool info.\n *\n * @returns The decompress instruction\n */\n static async decompress({\n payer,\n inputCompressedTokenAccounts,\n toAddress,\n amount,\n recentValidityProof,\n recentInputStateRootIndices,\n tokenPoolInfos,\n }: DecompressParams): Promise<TransactionInstruction> {\n const amountBN = bn(amount);\n const tokenPoolInfosArray = toArray(tokenPoolInfos);\n\n const tokenTransferOutputs = createDecompressOutputState(\n inputCompressedTokenAccounts,\n amountBN,\n );\n\n /// Pack\n const {\n inputTokenDataWithContext,\n packedOutputTokenData,\n remainingAccountMetas,\n } = packCompressedTokenAccounts({\n inputCompressedTokenAccounts,\n rootIndices: recentInputStateRootIndices,\n tokenTransferOutputs: tokenTransferOutputs,\n remainingAccounts: tokenPoolInfosArray\n .slice(1)\n .map(info => info.tokenPoolPda),\n });\n\n const { mint } = parseTokenData(inputCompressedTokenAccounts);\n const { delegatedTransfer, authority } = parseMaybeDelegatedTransfer(\n inputCompressedTokenAccounts,\n tokenTransferOutputs,\n );\n\n const rawData: CompressedTokenInstructionDataTransfer = {\n proof: recentValidityProof,\n mint,\n delegatedTransfer,\n inputTokenDataWithContext,\n outputCompressedAccounts: packedOutputTokenData,\n compressOrDecompressAmount: amountBN,\n isCompress: false,\n cpiContext: null,\n lamportsChangeAccountMerkleTreeIndex: null,\n };\n const data = encodeTransferInstructionData(rawData);\n const tokenProgram = tokenPoolInfosArray[0].tokenProgram;\n\n const {\n accountCompressionAuthority,\n noopProgram,\n registeredProgramPda,\n accountCompressionProgram,\n } = defaultStaticAccountsStruct();\n\n const keys = transferAccountsLayout({\n feePayer: payer,\n authority: authority,\n cpiAuthorityPda: this.deriveCpiAuthorityPda,\n lightSystemProgram: LightSystemProgram.programId,\n registeredProgramPda: registeredProgramPda,\n noopProgram: noopProgram,\n accountCompressionAuthority: accountCompressionAuthority,\n accountCompressionProgram: accountCompressionProgram,\n selfProgram: this.programId,\n tokenPoolPda: tokenPoolInfosArray[0].tokenPoolPda,\n compressOrDecompressTokenAccount: toAddress,\n tokenProgram,\n systemProgram: SystemProgram.programId,\n });\n keys.push(...remainingAccountMetas);\n\n return new TransactionInstruction({\n programId: this.programId,\n keys,\n data,\n });\n }\n\n /**\n * Create `mergeTokenAccounts` instruction\n *\n * @param payer Fee payer.\n * @param owner Owner of the compressed token\n * accounts to be merged.\n * @param inputCompressedTokenAccounts Source compressed token accounts.\n * @param mint SPL Token mint address.\n * @param recentValidityProof Recent validity proof.\n * @param recentInputStateRootIndices Recent state root indices.\n *\n * @returns instruction\n */\n static async mergeTokenAccounts({\n payer,\n owner,\n inputCompressedTokenAccounts,\n mint,\n recentValidityProof,\n recentInputStateRootIndices,\n }: MergeTokenAccountsParams): Promise<TransactionInstruction[]> {\n if (inputCompressedTokenAccounts.length > 4) {\n throw new Error('Cannot merge more than 4 token accounts at once');\n }\n\n checkMint(inputCompressedTokenAccounts, mint);\n\n const ix = await this.transfer({\n payer,\n inputCompressedTokenAccounts,\n toAddress: owner,\n amount: inputCompressedTokenAccounts.reduce(\n (sum, account) => sum.add(account.parsed.amount),\n bn(0),\n ),\n recentInputStateRootIndices,\n recentValidityProof,\n });\n\n return [ix];\n }\n\n /**\n * Create `compressSplTokenAccount` instruction\n *\n * @param feePayer Fee payer.\n * @param authority SPL Token account owner.\n * @param tokenAccount SPL Token account to compress.\n * @param mint SPL Token mint address.\n * @param remainingAmount Optional: Amount to leave in token account.\n * @param outputStateTreeInfo State tree to write to.\n * @param tokenPoolInfo Token pool info.\n *\n * @returns instruction\n */\n static async compressSplTokenAccount({\n feePayer,\n authority,\n tokenAccount,\n mint,\n remainingAmount,\n outputStateTreeInfo,\n tokenPoolInfo,\n }: CompressSplTokenAccountParams): Promise<TransactionInstruction> {\n checkTokenPoolInfo(tokenPoolInfo, mint);\n const remainingAccountMetas: AccountMeta[] = [\n {\n pubkey:\n outputStateTreeInfo.treeType === TreeType.StateV2\n ? outputStateTreeInfo.queue\n : outputStateTreeInfo.tree,\n isSigner: false,\n isWritable: true,\n },\n ];\n\n const data = encodeCompressSplTokenAccountInstructionData({\n owner: authority,\n remainingAmount: remainingAmount ?? null,\n cpiContext: null,\n });\n const {\n accountCompressionAuthority,\n noopProgram,\n registeredProgramPda,\n accountCompressionProgram,\n } = defaultStaticAccountsStruct();\n\n const keys = transferAccountsLayout({\n feePayer,\n authority,\n cpiAuthorityPda: this.deriveCpiAuthorityPda,\n lightSystemProgram: LightSystemProgram.programId,\n registeredProgramPda: registeredProgramPda,\n noopProgram: noopProgram,\n accountCompressionAuthority: accountCompressionAuthority,\n accountCompressionProgram: accountCompressionProgram,\n selfProgram: this.programId,\n tokenPoolPda: tokenPoolInfo.tokenPoolPda,\n compressOrDecompressTokenAccount: tokenAccount,\n tokenProgram: tokenPoolInfo.tokenProgram,\n systemProgram: SystemProgram.programId,\n });\n\n keys.push(...remainingAccountMetas);\n\n return new TransactionInstruction({\n programId: this.programId,\n keys,\n data,\n });\n }\n\n /**\n * Get the program ID for a mint\n *\n * @param mint SPL Token mint address.\n * @param connection Connection.\n *\n * @returns program ID\n */\n static async getMintProgramId(\n mint: PublicKey,\n connection: Connection,\n ): Promise<PublicKey | undefined> {\n return (await connection.getAccountInfo(mint))?.owner;\n }\n\n /**\n * Create `approve` instruction to delegate compressed tokens.\n *\n * @param payer Fee payer.\n * @param inputCompressedTokenAccounts Source compressed token accounts.\n * @param toAddress Owner to delegate to.\n * @param amount Amount of tokens to delegate.\n * @param recentValidityProof Recent validity proof.\n * @param recentInputStateRootIndices Recent state root indices.\n *\n * @returns instruction\n */\n static async approve({\n payer,\n inputCompressedTokenAccounts,\n toAddress,\n amount,\n recentValidityProof,\n recentInputStateRootIndices,\n }: ApproveParams): Promise<TransactionInstruction> {\n const { inputTokenDataWithContext, remainingAccountMetas } =\n packCompressedTokenAccounts({\n inputCompressedTokenAccounts,\n rootIndices: recentInputStateRootIndices,\n tokenTransferOutputs: [],\n });\n\n const { mint, currentOwner } = parseTokenData(\n inputCompressedTokenAccounts,\n );\n\n const CHANGE_INDEX =\n inputCompressedTokenAccounts[0].compressedAccount.treeInfo\n .treeType === TreeType.StateV2\n ? 1\n : 0;\n\n const rawData: CompressedTokenInstructionDataApprove = {\n proof: recentValidityProof,\n mint,\n inputTokenDataWithContext,\n cpiContext: null,\n delegate: toAddress,\n delegatedAmount: bn(amount),\n delegateMerkleTreeIndex: CHANGE_INDEX,\n changeAccountMerkleTreeIndex: CHANGE_INDEX,\n delegateLamports: null,\n };\n\n const data = encodeApproveInstructionData(rawData);\n\n const {\n accountCompressionAuthority,\n noopProgram,\n registeredProgramPda,\n accountCompressionProgram,\n } = defaultStaticAccountsStruct();\n\n const keys = approveAccountsLayout({\n feePayer: payer,\n authority: currentOwner,\n cpiAuthorityPda: this.deriveCpiAuthorityPda,\n lightSystemProgram: LightSystemProgram.programId,\n registeredProgramPda: registeredProgramPda,\n noopProgram: noopProgram,\n accountCompressionAuthority: accountCompressionAuthority,\n accountCompressionProgram: accountCompressionProgram,\n selfProgram: this.programId,\n systemProgram: SystemProgram.programId,\n });\n\n keys.push(...remainingAccountMetas);\n\n return new TransactionInstruction({\n programId: this.programId,\n keys,\n data,\n });\n }\n\n /**\n * Create `revoke` instruction to revoke delegation of compressed tokens.\n *\n * @param payer Fee payer.\n * @param inputCompressedTokenAccounts Source compressed token accounts.\n * @param recentValidityProof Recent validity proof.\n * @param recentInputStateRootIndices Recent state root indices.\n *\n * @returns instruction\n */\n static async revoke({\n payer,\n inputCompressedTokenAccounts,\n recentValidityProof,\n recentInputStateRootIndices,\n }: RevokeParams): Promise<TransactionInstruction> {\n validateSameTokenOwner(inputCompressedTokenAccounts);\n\n const { inputTokenDataWithContext, remainingAccountMetas } =\n packCompressedTokenAccounts({\n inputCompressedTokenAccounts,\n rootIndices: recentInputStateRootIndices,\n tokenTransferOutputs: [],\n });\n\n const { mint, currentOwner } = parseTokenData(\n inputCompressedTokenAccounts,\n );\n\n const rawData: CompressedTokenInstructionDataRevoke = {\n proof: recentValidityProof,\n mint,\n inputTokenDataWithContext,\n cpiContext: null,\n outputAccountMerkleTreeIndex:\n inputCompressedTokenAccounts[0].compressedAccount.treeInfo\n .treeType === TreeType.StateV2\n ? 2\n : 1,\n };\n const data = encodeRevokeInstructionData(rawData);\n\n const {\n accountCompressionAuthority,\n noopProgram,\n registeredProgramPda,\n accountCompressionProgram,\n } = defaultStaticAccountsStruct();\n const keys = revokeAccountsLayout({\n feePayer: payer,\n authority: currentOwner,\n cpiAuthorityPda: this.deriveCpiAuthorityPda,\n lightSystemProgram: LightSystemProgram.programId,\n registeredProgramPda: registeredProgramPda,\n noopProgram: noopProgram,\n accountCompressionAuthority: accountCompressionAuthority,\n accountCompressionProgram: accountCompressionProgram,\n selfProgram: this.programId,\n systemProgram: SystemProgram.programId,\n });\n\n keys.push(...remainingAccountMetas);\n\n return new TransactionInstruction({\n programId: this.programId,\n keys,\n data,\n });\n }\n}\n","import {\n COMPRESSED_TOKEN_PROGRAM_ID,\n deriveAddressV2,\n TreeInfo,\n} from '@lightprotocol/stateless.js';\nimport { PublicKey } from '@solana/web3.js';\n\n/**\n * Returns the compressed mint address as a Array (32 bytes).\n */\nexport function deriveCompressedMintAddress(\n mintSeed: PublicKey,\n addressTreeInfo: TreeInfo,\n) {\n // find_spl_mint_address returns [splMint, bump], we want splMint\n // In JS, just use the mintSeed directly as the SPL mint address\n const address = deriveAddressV2(\n findMintAddress(mintSeed)[0].toBytes(),\n addressTreeInfo.tree.toBytes(),\n COMPRESSED_TOKEN_PROGRAM_ID.toBytes(),\n );\n return Array.from(address);\n}\n\n/// b\"compressed_mint\"\nexport const COMPRESSED_MINT_SEED = Buffer.from([\n 99, 111, 109, 112, 114, 101, 115, 115, 101, 100, 95, 109, 105, 110, 116,\n]);\n\n/**\n * Finds the SPL mint PDA for a compressed mint.\n * @param mintSeed The mint seed public key.\n * @returns [PDA, bump]\n */\nexport function findMintAddress(mintSigner: PublicKey): [PublicKey, number] {\n const [address, bump] = PublicKey.findProgramAddressSync(\n [COMPRESSED_MINT_SEED, mintSigner.toBuffer()],\n COMPRESSED_TOKEN_PROGRAM_ID,\n );\n return [address, bump];\n}\n\n/// Same as \"getAssociatedTokenAddress\" but returns the bump as well.\n/// Uses compressed token program ID.\nexport function getAssociatedCTokenAddressAndBump(\n owner: PublicKey,\n mint: PublicKey,\n) {\n return PublicKey.findProgramAddressSync(\n [\n owner.toBuffer(),\n COMPRESSED_TOKEN_PROGRAM_ID.toBuffer(),\n mint.toBuffer(),\n ],\n COMPRESSED_TOKEN_PROGRAM_ID,\n );\n}\n\n/// Same as \"getAssociatedTokenAddress\" but implicitly uses compressed token program ID.\nexport function getAssociatedCTokenAddress(owner: PublicKey, mint: PublicKey) {\n return PublicKey.findProgramAddressSync(\n [\n owner.toBuffer(),\n COMPRESSED_TOKEN_PROGRAM_ID.toBuffer(),\n mint.toBuffer(),\n ],\n COMPRESSED_TOKEN_PROGRAM_ID,\n )[0];\n}\n","export type LightCompressedToken = {\n version: '1.2.0';\n name: 'light_compressed_token';\n instructions: [\n {\n name: 'createTokenPool';\n docs: [\n 'This instruction creates a token pool for a given mint. Every spl mint',\n 'can have one token pool. When a token is compressed the tokens are',\n 'transferrred to the token pool, and their compressed equivalent is',\n 'minted into a Merkle tree.',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'tokenPoolPda';\n isMut: true;\n isSigner: false;\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'mint';\n isMut: true;\n isSigner: false;\n },\n {\n name: 'tokenProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n ];\n args: [];\n },\n {\n name: 'addTokenPool';\n docs: [\n 'This instruction creates an additional token pool for a given mint.',\n 'The maximum number of token pools per mint is 5.',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'tokenPoolPda';\n isMut: true;\n isSigner: false;\n },\n {\n name: 'existingTokenPoolPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'mint';\n isMut: true;\n isSigner: false;\n },\n {\n name: 'tokenProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n ];\n args: [\n {\n name: 'tokenPoolIndex';\n type: 'u8';\n },\n ];\n },\n {\n name: 'mintTo';\n docs: [\n 'Mints tokens from an spl token mint to a list of compressed accounts.',\n 'Minted tokens are transferred to a pool account owned by the compressed',\n 'token program. The instruction creates one compressed output account for',\n 'every amount and pubkey input pair. A constant amount of lamports can be',\n 'transferred to each output account to enable. A use case to add lamports',\n 'to a compressed token account is to prevent spam. This is the only way',\n 'to add lamports to a compressed token account.',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'authority';\n isMut: false;\n isSigner: true;\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'mint';\n isMut: true;\n isSigner: false;\n },\n {\n name: 'tokenPoolPda';\n isMut: true;\n isSigner: false;\n },\n {\n name: 'tokenProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'lightSystemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'registeredProgramPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'noopProgram';\n isMut: false;\n isSigner: false;\n docs: ['programs'];\n },\n {\n name: 'accountCompressionAuthority';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'merkleTree';\n isMut: true;\n isSigner: false;\n },\n {\n name: 'selfProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'solPoolPda';\n isMut: true;\n isSigner: false;\n isOptional: true;\n },\n ];\n args: [\n {\n name: 'publicKeys';\n type: {\n vec: 'publicKey';\n };\n },\n {\n name: 'amounts';\n type: {\n vec: 'u64';\n };\n },\n {\n name: 'lamports';\n type: {\n option: 'u64';\n };\n },\n ];\n },\n {\n name: 'compressSplTokenAccount';\n docs: [\n 'Compresses the balance of an spl token account sub an optional remaining',\n 'amount. This instruction does not close the spl token account. To close',\n 'the account bundle a close spl account instruction in your transaction.',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'authority';\n isMut: false;\n isSigner: true;\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ];\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'lightSystemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'registeredProgramPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'noopProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionAuthority';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'selfProgram';\n isMut: false;\n isSigner: false;\n docs: ['this program is the signer of the cpi.'];\n },\n {\n name: 'tokenPoolPda';\n isMut: true;\n isSigner: false;\n isOptional: true;\n },\n {\n name: 'compressOrDecompressTokenAccount';\n isMut: true;\n isSigner: false;\n isOptional: true;\n },\n {\n name: 'tokenProgram';\n isMut: false;\n isSigner: false;\n isOptional: true;\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n ];\n args: [\n {\n name: 'owner';\n type: 'publicKey';\n },\n {\n name: 'remainingAmount';\n type: {\n option: 'u64';\n };\n },\n {\n name: 'cpiContext';\n type: {\n option: {\n defined: 'CompressedCpiContext';\n };\n };\n },\n ];\n },\n {\n name: 'transfer';\n docs: [\n 'Transfers compressed tokens from one account to another. All accounts',\n 'must be of the same mint. Additional spl tokens can be compressed or',\n 'decompressed. In one transaction only compression or decompression is',\n 'possible. Lamports can be transferred alongside tokens. If output token',\n 'accounts specify less lamports than inputs the remaining lamports are',\n 'transferred to an output compressed account. Signer must be owner or',\n 'delegate. If a delegated token account is transferred the delegate is',\n 'not preserved.',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'authority';\n isMut: false;\n isSigner: true;\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ];\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'lightSystemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'registeredProgramPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'noopProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionAuthority';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'selfProgram';\n isMut: false;\n isSigner: false;\n docs: ['this program is the signer of the cpi.'];\n },\n {\n name: 'tokenPoolPda';\n isMut: true;\n isSigner: false;\n isOptional: true;\n },\n {\n name: 'compressOrDecompressTokenAccount';\n isMut: true;\n isSigner: false;\n isOptional: true;\n },\n {\n name: 'tokenProgram';\n isMut: false;\n isSigner: false;\n isOptional: true;\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n ];\n args: [\n {\n name: 'inputs';\n type: 'bytes';\n },\n ];\n },\n {\n name: 'approve';\n docs: [\n 'Delegates an amount to a delegate. A compressed token account is either',\n 'completely delegated or not. Prior delegates are not preserved. Cannot',\n 'be called by a delegate.',\n 'The instruction creates two output accounts:',\n '1. one account with delegated amount',\n '2. one account with remaining(change) amount',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'authority';\n isMut: false;\n isSigner: true;\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ];\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'lightSystemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'registeredProgramPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'noopProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionAuthority';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'selfProgram';\n isMut: false;\n isSigner: false;\n docs: ['this program is the signer of the cpi.'];\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n ];\n args: [\n {\n name: 'inputs';\n type: 'bytes';\n },\n ];\n },\n {\n name: 'revoke';\n docs: [\n 'Revokes a delegation. The instruction merges all inputs into one output',\n 'account. Cannot be called by a delegate. Delegates are not preserved.',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'authority';\n isMut: false;\n isSigner: true;\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ];\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'lightSystemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'registeredProgramPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'noopProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionAuthority';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'selfProgram';\n isMut: false;\n isSigner: false;\n docs: ['this program is the signer of the cpi.'];\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n ];\n args: [\n {\n name: 'inputs';\n type: 'bytes';\n },\n ];\n },\n {\n name: 'freeze';\n docs: [\n 'Freezes compressed token accounts. Inputs must not be frozen. Creates as',\n 'many outputs as inputs. Balances and delegates are preserved.',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'authority';\n isMut: false;\n isSigner: true;\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'lightSystemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'registeredProgramPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'noopProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionAuthority';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'selfProgram';\n isMut: false;\n isSigner: false;\n docs: ['that this program is the signer of the cpi.'];\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'mint';\n isMut: false;\n isSigner: false;\n },\n ];\n args: [\n {\n name: 'inputs';\n type: 'bytes';\n },\n ];\n },\n {\n name: 'thaw';\n docs: [\n 'Thaws frozen compressed token accounts. Inputs must be frozen. Creates',\n 'as many outputs as inputs. Balances and delegates are preserved.',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'authority';\n isMut: false;\n isSigner: true;\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'lightSystemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'registeredProgramPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'noopProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionAuthority';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'selfProgram';\n isMut: false;\n isSigner: false;\n docs: ['that this program is the signer of the cpi.'];\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'mint';\n isMut: false;\n isSigner: false;\n },\n ];\n args: [\n {\n name: 'inputs';\n type: 'bytes';\n },\n ];\n },\n {\n name: 'burn';\n docs: [\n 'Burns compressed tokens and spl tokens from the pool account. Delegates',\n 'can burn tokens. The output compressed token account remains delegated.',\n 'Creates one output compressed token account.',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'authority';\n isMut: false;\n isSigner: true;\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ];\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'mint';\n isMut: true;\n isSigner: false;\n },\n {\n name: 'tokenPoolPda';\n isMut: true;\n isSigner: false;\n },\n {\n name: 'tokenProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'lightSystemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'registeredProgramPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'noopProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionAuthority';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'selfProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n ];\n args: [\n {\n name: 'inputs';\n type: 'bytes';\n },\n ];\n },\n {\n name: 'stubIdlBuild';\n docs: [\n 'This function is a stub to allow Anchor to include the input types in',\n 'the IDL. It should not be included in production builds nor be called in',\n 'practice.',\n ];\n accounts: [\n {\n name: 'feePayer';\n isMut: true;\n isSigner: true;\n docs: ['UNCHECKED: only pays fees.'];\n },\n {\n name: 'authority';\n isMut: false;\n isSigner: true;\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ];\n },\n {\n name: 'cpiAuthorityPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'lightSystemProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'registeredProgramPda';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'noopProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionAuthority';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'accountCompressionProgram';\n isMut: false;\n isSigner: false;\n },\n {\n name: 'selfProgram';\n isMut: false;\n isSigner: false;\n docs: ['this program is the signer of the cpi.'];\n },\n {\n name: 'tokenPoolPda';\n isMut: true;\n isSigner: false;\n isOptional: true;\n },\n {\n name: 'compressOrDecompressTokenAccount';\n isMut: true;\n isSigner: false;\n isOptional: true;\n },\n {\n name: 'tokenProgram';\n isMut: false;\n isSigner: false;\n isOptional: true;\n },\n {\n name: 'systemProgram';\n isMut: false;\n isSigner: false;\n },\n ];\n args: [\n {\n name: 'inputs1';\n type: {\n defined: 'CompressedTokenInstructionDataTransfer';\n };\n },\n {\n name: 'inputs2';\n type: {\n defined: 'TokenData';\n };\n },\n ];\n },\n ];\n types: [\n {\n name: 'AccountState';\n type: {\n kind: 'enum';\n variants: [\n {\n name: 'Initialized';\n },\n {\n name: 'Frozen';\n },\n ];\n };\n },\n {\n name: 'CompressedAccount';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'owner';\n type: 'publicKey';\n },\n {\n name: 'lamports';\n type: 'u64';\n },\n {\n name: 'address';\n type: {\n option: {\n array: ['u8', 32];\n };\n };\n },\n {\n name: 'data';\n type: {\n option: {\n defined: 'CompressedAccountData';\n };\n };\n },\n ];\n };\n },\n {\n name: 'CompressedAccountData';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'discriminator';\n type: {\n array: ['u8', 8];\n };\n },\n {\n name: 'data';\n type: 'bytes';\n },\n {\n name: 'dataHash';\n type: {\n array: ['u8', 32];\n };\n },\n ];\n };\n },\n {\n name: 'CompressedCpiContext';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'setContext';\n docs: [\n 'Is set by the program that is invoking the CPI to signal that is should',\n 'set the cpi context.',\n ];\n type: 'bool';\n },\n {\n name: 'firstSetContext';\n docs: [\n 'Is set to wipe the cpi context since someone could have set it before',\n 'with unrelated data.',\n ];\n type: 'bool';\n },\n {\n name: 'cpiContextAccountIndex';\n docs: [\n 'Index of cpi context account in remaining accounts.',\n ];\n type: 'u8';\n },\n ];\n };\n },\n {\n name: 'CompressedProof';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'a';\n type: {\n array: ['u8', 32];\n };\n },\n {\n name: 'b';\n type: {\n array: ['u8', 64];\n };\n },\n {\n name: 'c';\n type: {\n array: ['u8', 32];\n };\n },\n ];\n };\n },\n {\n name: 'CompressedTokenInstructionDataTransfer';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'proof';\n type: {\n option: {\n defined: 'CompressedProof';\n };\n };\n },\n {\n name: 'mint';\n type: 'publicKey';\n },\n {\n name: 'delegatedTransfer';\n docs: [\n 'Is required if the signer is delegate,',\n '-> delegate is authority account,',\n 'owner = Some(owner) is the owner of the token account.',\n ];\n type: {\n option: {\n defined: 'DelegatedTransfer';\n };\n };\n },\n {\n name: 'inputTokenDataWithContext';\n type: {\n vec: {\n defined: 'InputTokenDataWithContext';\n };\n };\n },\n {\n name: 'outputCompressedAccounts';\n type: {\n vec: {\n defined: 'PackedTokenTransferOutputData';\n };\n };\n },\n {\n name: 'isCompress';\n type: 'bool';\n },\n {\n name: 'compressOrDecompressAmount';\n type: {\n option: 'u64';\n };\n },\n {\n name: 'cpiContext';\n type: {\n option: {\n defined: 'CompressedCpiContext';\n };\n };\n },\n {\n name: 'lamportsChangeAccountMerkleTreeIndex';\n type: {\n option: 'u8';\n };\n },\n ];\n };\n },\n {\n name: 'CompressedTokenInstructionDataRevoke';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'proof';\n type: {\n option: {\n defined: 'CompressedProof';\n };\n };\n },\n {\n name: 'mint';\n type: 'publicKey';\n },\n {\n name: 'inputTokenDataWithContext';\n type: {\n vec: {\n defined: 'InputTokenDataWithContext';\n };\n };\n },\n {\n name: 'cpiContext';\n type: {\n option: {\n defined: 'CompressedCpiContext';\n };\n };\n },\n {\n name: 'outputAccountMerkleTreeIndex';\n type: 'u8';\n },\n ];\n };\n },\n {\n name: 'CompressedTokenInstructionDataApprove';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'proof';\n type: {\n option: {\n defined: 'CompressedProof';\n };\n };\n },\n {\n name: 'mint';\n type: 'publicKey';\n },\n {\n name: 'inputTokenDataWithContext';\n type: {\n vec: {\n defined: 'InputTokenDataWithContext';\n };\n };\n },\n {\n name: 'cpiContext';\n type: {\n option: {\n defined: 'CompressedCpiContext';\n };\n };\n },\n {\n name: 'delegate';\n type: 'publicKey';\n },\n {\n name: 'delegatedAmount';\n type: 'u64';\n },\n {\n name: 'delegateMerkleTreeIndex';\n type: 'u8';\n },\n {\n name: 'changeAccountMerkleTreeIndex';\n type: 'u8';\n },\n {\n name: 'delegateLamports';\n type: {\n option: 'u64';\n };\n },\n ];\n };\n },\n {\n name: 'DelegatedTransfer';\n docs: [\n 'Struct to provide the owner when the delegate is signer of the transaction.',\n ];\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'owner';\n type: 'publicKey';\n },\n {\n name: 'delegateChangeAccountIndex';\n docs: [\n 'Index of change compressed account in output compressed accounts. In',\n \"case that the delegate didn't spend the complete delegated compressed\",\n 'account balance the change compressed account will be delegated to her',\n 'as well.',\n ];\n type: {\n option: 'u8';\n };\n },\n ];\n };\n },\n {\n name: 'InputTokenDataWithContext';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'amount';\n type: 'u64';\n },\n {\n name: 'delegateIndex';\n type: {\n option: 'u8';\n };\n },\n {\n name: 'merkleContext';\n type: {\n defined: 'PackedMerkleContext';\n };\n },\n {\n name: 'rootIndex';\n type: 'u16';\n },\n {\n name: 'lamports';\n type: {\n option: 'u64';\n };\n },\n {\n name: 'tlv';\n docs: [\n 'Placeholder for TokenExtension tlv data (unimplemented)',\n ];\n type: {\n option: 'bytes';\n };\n },\n ];\n };\n },\n {\n name: 'InstructionDataInvoke';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'proof';\n type: {\n option: {\n defined: 'CompressedProof';\n };\n };\n },\n {\n name: 'inputCompressedAccountsWithMerkleContext';\n type: {\n vec: {\n defined: 'PackedCompressedAccountWithMerkleContext';\n };\n };\n },\n {\n name: 'outputCompressedAccounts';\n type: {\n vec: {\n defined: 'OutputCompressedAccountWithPackedContext';\n };\n };\n },\n {\n name: 'relayFee';\n type: {\n option: 'u64';\n };\n },\n {\n name: 'newAddressParams';\n type: {\n vec: {\n defined: 'NewAddressParamsPacked';\n };\n };\n },\n {\n name: 'compressOrDecompressLamports';\n type: {\n option: 'u64';\n };\n },\n {\n name: 'isCompress';\n type: 'bool';\n },\n ];\n };\n },\n {\n name: 'InstructionDataInvokeCpi';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'proof';\n type: {\n option: {\n defined: 'CompressedProof';\n };\n };\n },\n {\n name: 'newAddressParams';\n type: {\n vec: {\n defined: 'NewAddressParamsPacked';\n };\n };\n },\n {\n name: 'inputCompressedAccountsWithMerkleContext';\n type: {\n vec: {\n defined: 'PackedCompressedAccountWithMerkleContext';\n };\n };\n },\n {\n name: 'outputCompressedAccounts';\n type: {\n vec: {\n defined: 'OutputCompressedAccountWithPackedContext';\n };\n };\n },\n {\n name: 'relayFee';\n type: {\n option: 'u64';\n };\n },\n {\n name: 'compressOrDecompressLamports';\n type: {\n option: 'u64';\n };\n },\n {\n name: 'isCompress';\n type: 'bool';\n },\n {\n name: 'cpiContext';\n type: {\n option: {\n defined: 'CompressedCpiContext';\n };\n };\n },\n ];\n };\n },\n {\n name: 'MerkleTreeSequenceNumber';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'pubkey';\n type: 'publicKey';\n },\n {\n name: 'seq';\n type: 'u64';\n },\n ];\n };\n },\n {\n name: 'NewAddressParamsPacked';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'seed';\n type: {\n array: ['u8', 32];\n };\n },\n {\n name: 'addressQueueAccountIndex';\n type: 'u8';\n },\n {\n name: 'addressMerkleTreeAccountIndex';\n type: 'u8';\n },\n {\n name: 'addressMerkleTreeRootIndex';\n type: 'u16';\n },\n ];\n };\n },\n {\n name: 'OutputCompressedAccountWithPackedContext';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'compressedAccount';\n type: {\n defined: 'CompressedAccount';\n };\n },\n {\n name: 'merkleTreeIndex';\n type: 'u8';\n },\n ];\n };\n },\n {\n name: 'PackedCompressedAccountWithMerkleContext';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'compressedAccount';\n type: {\n defined: 'CompressedAccount';\n };\n },\n {\n name: 'merkleContext';\n type: {\n defined: 'PackedMerkleContext';\n };\n },\n {\n name: 'rootIndex';\n docs: [\n 'Index of root used in inclusion validity proof.',\n ];\n type: 'u16';\n },\n {\n name: 'readOnly';\n docs: [\n 'Placeholder to mark accounts read-only unimplemented set to false.',\n ];\n type: 'bool';\n },\n ];\n };\n },\n {\n name: 'PackedMerkleContext';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'merkleTreePubkeyIndex';\n type: 'u8';\n },\n {\n name: 'queuePubkeyIndex';\n type: 'u8';\n },\n {\n name: 'leafIndex';\n type: 'u32';\n },\n {\n name: 'proveByIndex';\n type: 'bool';\n },\n ];\n };\n },\n {\n name: 'PackedTokenTransferOutputData';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'owner';\n type: 'publicKey';\n },\n {\n name: 'amount';\n type: 'u64';\n },\n {\n name: 'lamports';\n type: {\n option: 'u64';\n };\n },\n {\n name: 'merkleTreeIndex';\n type: 'u8';\n },\n {\n name: 'tlv';\n docs: [\n 'Placeholder for TokenExtension tlv data (unimplemented)',\n ];\n type: {\n option: 'bytes';\n };\n },\n ];\n };\n },\n {\n name: 'PublicTransactionEvent';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'inputCompressedAccountHashes';\n type: {\n vec: {\n array: ['u8', 32];\n };\n };\n },\n {\n name: 'outputCompressedAccountHashes';\n type: {\n vec: {\n array: ['u8', 32];\n };\n };\n },\n {\n name: 'outputCompressedAccounts';\n type: {\n vec: {\n defined: 'OutputCompressedAccountWithPackedContext';\n };\n };\n },\n {\n name: 'outputLeafIndices';\n type: {\n vec: 'u32';\n };\n },\n {\n name: 'sequenceNumbers';\n type: {\n vec: {\n defined: 'MerkleTreeSequenceNumber';\n };\n };\n },\n {\n name: 'relayFee';\n type: {\n option: 'u64';\n };\n },\n {\n name: 'isCompress';\n type: 'bool';\n },\n {\n name: 'compressOrDecompressLamports';\n type: {\n option: 'u64';\n };\n },\n {\n name: 'pubkeyArray';\n type: {\n vec: 'publicKey';\n };\n },\n {\n name: 'message';\n type: {\n option: 'bytes';\n };\n },\n ];\n };\n },\n {\n name: 'QueueIndex';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'queueId';\n docs: ['Id of queue in queue account.'];\n type: 'u8';\n },\n {\n name: 'index';\n docs: ['Index of compressed account hash in queue.'];\n type: 'u16';\n },\n ];\n };\n },\n {\n name: 'TokenData';\n type: {\n kind: 'struct';\n fields: [\n {\n name: 'mint';\n docs: ['The mint associated with this account'];\n type: 'publicKey';\n },\n {\n name: 'owner';\n docs: ['The owner of this account.'];\n type: 'publicKey';\n },\n {\n name: 'amount';\n docs: ['The amount of tokens this account holds.'];\n type: 'u64';\n },\n {\n name: 'delegate';\n docs: [\n 'If `delegate` is `Some` then `delegated_amount` represents',\n 'the amount authorized by the delegate',\n ];\n type: {\n option: 'publicKey';\n };\n },\n {\n name: 'state';\n docs: [\"The account's state\"];\n type: {\n defined: 'AccountState';\n };\n },\n {\n name: 'tlv';\n docs: [\n 'Placeholder for TokenExtension tlv data (unimplemented)',\n ];\n type: {\n option: 'bytes';\n };\n },\n ];\n };\n },\n ];\n errors: [\n {\n code: 6000;\n name: 'PublicKeyAmountMissmatch';\n msg: 'public keys and amounts must be of same length';\n },\n {\n code: 6001;\n name: 'ComputeInputSumFailed';\n msg: 'ComputeInputSumFailed';\n },\n {\n code: 6002;\n name: 'ComputeOutputSumFailed';\n msg: 'ComputeOutputSumFailed';\n },\n {\n code: 6003;\n name: 'ComputeCompressSumFailed';\n msg: 'ComputeCompressSumFailed';\n },\n {\n code: 6004;\n name: 'ComputeDecompressSumFailed';\n msg: 'ComputeDecompressSumFailed';\n },\n {\n code: 6005;\n name: 'SumCheckFailed';\n msg: 'SumCheckFailed';\n },\n {\n code: 6006;\n name: 'DecompressRecipientUndefinedForDecompress';\n msg: 'DecompressRecipientUndefinedForDecompress';\n },\n {\n code: 6007;\n name: 'CompressedPdaUndefinedForDecompress';\n msg: 'CompressedPdaUndefinedForDecompress';\n },\n {\n code: 6008;\n name: 'DeCompressAmountUndefinedForDecompress';\n msg: 'DeCompressAmountUndefinedForDecompress';\n },\n {\n code: 6009;\n name: 'CompressedPdaUndefinedForCompress';\n msg: 'CompressedPdaUndefinedForCompress';\n },\n {\n code: 6010;\n name: 'DeCompressAmountUndefinedForCompress';\n msg: 'DeCompressAmountUndefinedForCompress';\n },\n {\n code: 6011;\n name: 'DelegateSignerCheckFailed';\n msg: 'DelegateSignerCheckFailed';\n },\n {\n code: 6012;\n name: 'MintTooLarge';\n msg: 'Minted amount greater than u64::MAX';\n },\n {\n code: 6013;\n name: 'SplTokenSupplyMismatch';\n msg: 'SplTokenSupplyMismatch';\n },\n {\n code: 6014;\n name: 'HeapMemoryCheckFailed';\n msg: 'HeapMemoryCheckFailed';\n },\n {\n code: 6015;\n name: 'InstructionNotCallable';\n msg: 'The instruction is not callable';\n },\n {\n code: 6016;\n name: 'ArithmeticUnderflow';\n msg: 'ArithmeticUnderflow';\n },\n {\n code: 6017;\n name: 'HashToFieldError';\n msg: 'HashToFieldError';\n },\n {\n code: 6018;\n name: 'InvalidAuthorityMint';\n msg: 'Expected the authority to be also a mint authority';\n },\n {\n code: 6019;\n name: 'InvalidFreezeAuthority';\n msg: 'Provided authority is not the freeze authority';\n },\n {\n code: 6020;\n name: 'InvalidDelegateIndex';\n },\n {\n code: 6021;\n name: 'TokenPoolPdaUndefined';\n },\n {\n code: 6022;\n name: 'IsTokenPoolPda';\n msg: 'Compress or decompress recipient is the same account as the token pool pda.';\n },\n {\n code: 6023;\n name: 'InvalidTokenPoolPda';\n },\n {\n code: 6024;\n name: 'NoInputTokenAccountsProvided';\n },\n {\n code: 6025;\n name: 'NoInputsProvided';\n },\n {\n code: 6026;\n name: 'MintHasNoFreezeAuthority';\n },\n {\n code: 6027;\n name: 'MintWithInvalidExtension';\n },\n {\n code: 6028;\n name: 'InsufficientTokenAccountBalance';\n msg: 'The token account balance is less than the remaining amount.';\n },\n {\n code: 6029;\n name: 'InvalidTokenPoolBump';\n msg: 'Max number of token pools reached.';\n },\n {\n code: 6030;\n name: 'FailedToDecompress';\n },\n {\n code: 6031;\n name: 'FailedToBurnSplTokensFromTokenPool';\n },\n {\n code: 6032;\n name: 'NoMatchingBumpFound';\n },\n ];\n};\nexport const IDL: LightCompressedToken = {\n version: '1.2.0',\n name: 'light_compressed_token',\n instructions: [\n {\n name: 'createTokenPool',\n docs: [\n 'This instruction creates a token pool for a given mint. Every spl mint',\n 'can have one token pool. When a token is compressed the tokens are',\n 'transferrred to the token pool, and their compressed equivalent is',\n 'minted into a Merkle tree.',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'tokenPoolPda',\n isMut: true,\n isSigner: false,\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'mint',\n isMut: true,\n isSigner: false,\n },\n {\n name: 'tokenProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n ],\n args: [],\n },\n {\n name: 'addTokenPool',\n docs: [\n 'This instruction creates an additional token pool for a given mint.',\n 'The maximum number of token pools per mint is 5.',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'tokenPoolPda',\n isMut: true,\n isSigner: false,\n },\n {\n name: 'existingTokenPoolPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'mint',\n isMut: true,\n isSigner: false,\n },\n {\n name: 'tokenProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n ],\n args: [\n {\n name: 'tokenPoolIndex',\n type: 'u8',\n },\n ],\n },\n {\n name: 'mintTo',\n docs: [\n 'Mints tokens from an spl token mint to a list of compressed accounts.',\n 'Minted tokens are transferred to a pool account owned by the compressed',\n 'token program. The instruction creates one compressed output account for',\n 'every amount and pubkey input pair. A constant amount of lamports can be',\n 'transferred to each output account to enable. A use case to add lamports',\n 'to a compressed token account is to prevent spam. This is the only way',\n 'to add lamports to a compressed token account.',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'authority',\n isMut: false,\n isSigner: true,\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'mint',\n isMut: true,\n isSigner: false,\n },\n {\n name: 'tokenPoolPda',\n isMut: true,\n isSigner: false,\n },\n {\n name: 'tokenProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'lightSystemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'registeredProgramPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'noopProgram',\n isMut: false,\n isSigner: false,\n docs: ['programs'],\n },\n {\n name: 'accountCompressionAuthority',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'merkleTree',\n isMut: true,\n isSigner: false,\n },\n {\n name: 'selfProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'solPoolPda',\n isMut: true,\n isSigner: false,\n isOptional: true,\n },\n ],\n args: [\n {\n name: 'publicKeys',\n type: {\n vec: 'publicKey',\n },\n },\n {\n name: 'amounts',\n type: {\n vec: 'u64',\n },\n },\n {\n name: 'lamports',\n type: {\n option: 'u64',\n },\n },\n ],\n },\n {\n name: 'compressSplTokenAccount',\n docs: [\n 'Compresses the balance of an spl token account sub an optional remaining',\n 'amount. This instruction does not close the spl token account. To close',\n 'the account bundle a close spl account instruction in your transaction.',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'authority',\n isMut: false,\n isSigner: true,\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ],\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'lightSystemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'registeredProgramPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'noopProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionAuthority',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'selfProgram',\n isMut: false,\n isSigner: false,\n docs: ['this program is the signer of the cpi.'],\n },\n {\n name: 'tokenPoolPda',\n isMut: true,\n isSigner: false,\n isOptional: true,\n },\n {\n name: 'compressOrDecompressTokenAccount',\n isMut: true,\n isSigner: false,\n isOptional: true,\n },\n {\n name: 'tokenProgram',\n isMut: false,\n isSigner: false,\n isOptional: true,\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n ],\n args: [\n {\n name: 'owner',\n type: 'publicKey',\n },\n {\n name: 'remainingAmount',\n type: {\n option: 'u64',\n },\n },\n {\n name: 'cpiContext',\n type: {\n option: {\n defined: 'CompressedCpiContext',\n },\n },\n },\n ],\n },\n {\n name: 'transfer',\n docs: [\n 'Transfers compressed tokens from one account to another. All accounts',\n 'must be of the same mint. Additional spl tokens can be compressed or',\n 'decompressed. In one transaction only compression or decompression is',\n 'possible. Lamports can be transferred alongside tokens. If output token',\n 'accounts specify less lamports than inputs the remaining lamports are',\n 'transferred to an output compressed account. Signer must be owner or',\n 'delegate. If a delegated token account is transferred the delegate is',\n 'not preserved.',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'authority',\n isMut: false,\n isSigner: true,\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ],\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'lightSystemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'registeredProgramPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'noopProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionAuthority',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'selfProgram',\n isMut: false,\n isSigner: false,\n docs: ['this program is the signer of the cpi.'],\n },\n {\n name: 'tokenPoolPda',\n isMut: true,\n isSigner: false,\n isOptional: true,\n },\n {\n name: 'compressOrDecompressTokenAccount',\n isMut: true,\n isSigner: false,\n isOptional: true,\n },\n {\n name: 'tokenProgram',\n isMut: false,\n isSigner: false,\n isOptional: true,\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n ],\n args: [\n {\n name: 'inputs',\n type: 'bytes',\n },\n ],\n },\n {\n name: 'approve',\n docs: [\n 'Delegates an amount to a delegate. A compressed token account is either',\n 'completely delegated or not. Prior delegates are not preserved. Cannot',\n 'be called by a delegate.',\n 'The instruction creates two output accounts:',\n '1. one account with delegated amount',\n '2. one account with remaining(change) amount',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'authority',\n isMut: false,\n isSigner: true,\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ],\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'lightSystemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'registeredProgramPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'noopProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionAuthority',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'selfProgram',\n isMut: false,\n isSigner: false,\n docs: ['this program is the signer of the cpi.'],\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n ],\n args: [\n {\n name: 'inputs',\n type: 'bytes',\n },\n ],\n },\n {\n name: 'revoke',\n docs: [\n 'Revokes a delegation. The instruction merges all inputs into one output',\n 'account. Cannot be called by a delegate. Delegates are not preserved.',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'authority',\n isMut: false,\n isSigner: true,\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ],\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'lightSystemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'registeredProgramPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'noopProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionAuthority',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'selfProgram',\n isMut: false,\n isSigner: false,\n docs: ['this program is the signer of the cpi.'],\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n ],\n args: [\n {\n name: 'inputs',\n type: 'bytes',\n },\n ],\n },\n {\n name: 'freeze',\n docs: [\n 'Freezes compressed token accounts. Inputs must not be frozen. Creates as',\n 'many outputs as inputs. Balances and delegates are preserved.',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'authority',\n isMut: false,\n isSigner: true,\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'lightSystemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'registeredProgramPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'noopProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionAuthority',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'selfProgram',\n isMut: false,\n isSigner: false,\n docs: ['that this program is the signer of the cpi.'],\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'mint',\n isMut: false,\n isSigner: false,\n },\n ],\n args: [\n {\n name: 'inputs',\n type: 'bytes',\n },\n ],\n },\n {\n name: 'thaw',\n docs: [\n 'Thaws frozen compressed token accounts. Inputs must be frozen. Creates',\n 'as many outputs as inputs. Balances and delegates are preserved.',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'authority',\n isMut: false,\n isSigner: true,\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'lightSystemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'registeredProgramPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'noopProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionAuthority',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'selfProgram',\n isMut: false,\n isSigner: false,\n docs: ['that this program is the signer of the cpi.'],\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'mint',\n isMut: false,\n isSigner: false,\n },\n ],\n args: [\n {\n name: 'inputs',\n type: 'bytes',\n },\n ],\n },\n {\n name: 'burn',\n docs: [\n 'Burns compressed tokens and spl tokens from the pool account. Delegates',\n 'can burn tokens. The output compressed token account remains delegated.',\n 'Creates one output compressed token account.',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'authority',\n isMut: false,\n isSigner: true,\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ],\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'mint',\n isMut: true,\n isSigner: false,\n },\n {\n name: 'tokenPoolPda',\n isMut: true,\n isSigner: false,\n },\n {\n name: 'tokenProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'lightSystemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'registeredProgramPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'noopProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionAuthority',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'selfProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n ],\n args: [\n {\n name: 'inputs',\n type: 'bytes',\n },\n ],\n },\n {\n name: 'stubIdlBuild',\n docs: [\n 'This function is a stub to allow Anchor to include the input types in',\n 'the IDL. It should not be included in production builds nor be called in',\n 'practice.',\n ],\n accounts: [\n {\n name: 'feePayer',\n isMut: true,\n isSigner: true,\n docs: ['UNCHECKED: only pays fees.'],\n },\n {\n name: 'authority',\n isMut: false,\n isSigner: true,\n docs: [\n 'Authority is verified through proof since both owner and delegate',\n 'are included in the token data hash, which is a public input to the',\n 'validity proof.',\n ],\n },\n {\n name: 'cpiAuthorityPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'lightSystemProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'registeredProgramPda',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'noopProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionAuthority',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'accountCompressionProgram',\n isMut: false,\n isSigner: false,\n },\n {\n name: 'selfProgram',\n isMut: false,\n isSigner: false,\n docs: ['this program is the signer of the cpi.'],\n },\n {\n name: 'tokenPoolPda',\n isMut: true,\n isSigner: false,\n isOptional: true,\n },\n {\n name: 'compressOrDecompressTokenAccount',\n isMut: true,\n isSigner: false,\n isOptional: true,\n },\n {\n name: 'tokenProgram',\n isMut: false,\n isSigner: false,\n isOptional: true,\n },\n {\n name: 'systemProgram',\n isMut: false,\n isSigner: false,\n },\n ],\n args: [\n {\n name: 'inputs1',\n type: {\n defined: 'CompressedTokenInstructionDataTransfer',\n },\n },\n {\n name: 'inputs2',\n type: {\n defined: 'TokenData',\n },\n },\n ],\n },\n ],\n types: [\n {\n name: 'AccountState',\n type: {\n kind: 'enum',\n variants: [\n {\n name: 'Initialized',\n },\n {\n name: 'Frozen',\n },\n ],\n },\n },\n {\n name: 'CompressedAccount',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'owner',\n type: 'publicKey',\n },\n {\n name: 'lamports',\n type: 'u64',\n },\n {\n name: 'address',\n type: {\n option: {\n array: ['u8', 32],\n },\n },\n },\n {\n name: 'data',\n type: {\n option: {\n defined: 'CompressedAccountData',\n },\n },\n },\n ],\n },\n },\n {\n name: 'CompressedAccountData',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'discriminator',\n type: {\n array: ['u8', 8],\n },\n },\n {\n name: 'data',\n type: 'bytes',\n },\n {\n name: 'dataHash',\n type: {\n array: ['u8', 32],\n },\n },\n ],\n },\n },\n {\n name: 'CompressedCpiContext',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'setContext',\n docs: [\n 'Is set by the program that is invoking the CPI to signal that is should',\n 'set the cpi context.',\n ],\n type: 'bool',\n },\n {\n name: 'firstSetContext',\n docs: [\n 'Is set to wipe the cpi context since someone could have set it before',\n 'with unrelated data.',\n ],\n type: 'bool',\n },\n {\n name: 'cpiContextAccountIndex',\n docs: [\n 'Index of cpi context account in remaining accounts.',\n ],\n type: 'u8',\n },\n ],\n },\n },\n {\n name: 'CompressedProof',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'a',\n type: {\n array: ['u8', 32],\n },\n },\n {\n name: 'b',\n type: {\n array: ['u8', 64],\n },\n },\n {\n name: 'c',\n type: {\n array: ['u8', 32],\n },\n },\n ],\n },\n },\n {\n name: 'CompressedTokenInstructionDataTransfer',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'proof',\n type: {\n option: {\n defined: 'CompressedProof',\n },\n },\n },\n {\n name: 'mint',\n type: 'publicKey',\n },\n {\n name: 'delegatedTransfer',\n docs: [\n 'Is required if the signer is delegate,',\n '-> delegate is authority account,',\n 'owner = Some(owner) is the owner of the token account.',\n ],\n type: {\n option: {\n defined: 'DelegatedTransfer',\n },\n },\n },\n {\n name: 'inputTokenDataWithContext',\n type: {\n vec: {\n defined: 'InputTokenDataWithContext',\n },\n },\n },\n {\n name: 'outputCompressedAccounts',\n type: {\n vec: {\n defined: 'PackedTokenTransferOutputData',\n },\n },\n },\n {\n name: 'isCompress',\n type: 'bool',\n },\n {\n name: 'compressOrDecompressAmount',\n type: {\n option: 'u64',\n },\n },\n {\n name: 'cpiContext',\n type: {\n option: {\n defined: 'CompressedCpiContext',\n },\n },\n },\n {\n name: 'lamportsChangeAccountMerkleTreeIndex',\n type: {\n option: 'u8',\n },\n },\n ],\n },\n },\n {\n name: 'CompressedTokenInstructionDataRevoke',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'proof',\n type: {\n option: {\n defined: 'CompressedProof',\n },\n },\n },\n {\n name: 'mint',\n type: 'publicKey',\n },\n {\n name: 'inputTokenDataWithContext',\n type: {\n vec: {\n defined: 'InputTokenDataWithContext',\n },\n },\n },\n {\n name: 'cpiContext',\n type: {\n option: {\n defined: 'CompressedCpiContext',\n },\n },\n },\n {\n name: 'outputAccountMerkleTreeIndex',\n type: 'u8',\n },\n ],\n },\n },\n {\n name: 'CompressedTokenInstructionDataApprove',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'proof',\n type: {\n option: {\n defined: 'CompressedProof',\n },\n },\n },\n {\n name: 'mint',\n type: 'publicKey',\n },\n {\n name: 'inputTokenDataWithContext',\n type: {\n vec: {\n defined: 'InputTokenDataWithContext',\n },\n },\n },\n {\n name: 'cpiContext',\n type: {\n option: {\n defined: 'CompressedCpiContext',\n },\n },\n },\n {\n name: 'delegate',\n type: 'publicKey',\n },\n {\n name: 'delegatedAmount',\n type: 'u64',\n },\n {\n name: 'delegateMerkleTreeIndex',\n type: 'u8',\n },\n {\n name: 'changeAccountMerkleTreeIndex',\n type: 'u8',\n },\n {\n name: 'delegateLamports',\n type: {\n option: 'u64',\n },\n },\n ],\n },\n },\n {\n name: 'DelegatedTransfer',\n docs: [\n 'Struct to provide the owner when the delegate is signer of the transaction.',\n ],\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'owner',\n type: 'publicKey',\n },\n {\n name: 'delegateChangeAccountIndex',\n docs: [\n 'Index of change compressed account in output compressed accounts. In',\n \"case that the delegate didn't spend the complete delegated compressed\",\n 'account balance the change compressed account will be delegated to her',\n 'as well.',\n ],\n type: {\n option: 'u8',\n },\n },\n ],\n },\n },\n {\n name: 'InputTokenDataWithContext',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'amount',\n type: 'u64',\n },\n {\n name: 'delegateIndex',\n type: {\n option: 'u8',\n },\n },\n {\n name: 'merkleContext',\n type: {\n defined: 'PackedMerkleContext',\n },\n },\n {\n name: 'rootIndex',\n type: 'u16',\n },\n {\n name: 'lamports',\n type: {\n option: 'u64',\n },\n },\n {\n name: 'tlv',\n docs: [\n 'Placeholder for TokenExtension tlv data (unimplemented)',\n ],\n type: {\n option: 'bytes',\n },\n },\n ],\n },\n },\n {\n name: 'InstructionDataInvoke',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'proof',\n type: {\n option: {\n defined: 'CompressedProof',\n },\n },\n },\n {\n name: 'inputCompressedAccountsWithMerkleContext',\n type: {\n vec: {\n defined:\n 'PackedCompressedAccountWithMerkleContext',\n },\n },\n },\n {\n name: 'outputCompressedAccounts',\n type: {\n vec: {\n defined:\n 'OutputCompressedAccountWithPackedContext',\n },\n },\n },\n {\n name: 'relayFee',\n type: {\n option: 'u64',\n },\n },\n {\n name: 'newAddressParams',\n type: {\n vec: {\n defined: 'NewAddressParamsPacked',\n },\n },\n },\n {\n name: 'compressOrDecompressLamports',\n type: {\n option: 'u64',\n },\n },\n {\n name: 'isCompress',\n type: 'bool',\n },\n ],\n },\n },\n {\n name: 'InstructionDataInvokeCpi',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'proof',\n type: {\n option: {\n defined: 'CompressedProof',\n },\n },\n },\n {\n name: 'newAddressParams',\n type: {\n vec: {\n defined: 'NewAddressParamsPacked',\n },\n },\n },\n {\n name: 'inputCompressedAccountsWithMerkleContext',\n type: {\n vec: {\n defined:\n 'PackedCompressedAccountWithMerkleContext',\n },\n },\n },\n {\n name: 'outputCompressedAccounts',\n type: {\n vec: {\n defined:\n 'OutputCompressedAccountWithPackedContext',\n },\n },\n },\n {\n name: 'relayFee',\n type: {\n option: 'u64',\n },\n },\n {\n name: 'compressOrDecompressLamports',\n type: {\n option: 'u64',\n },\n },\n {\n name: 'isCompress',\n type: 'bool',\n },\n {\n name: 'cpiContext',\n type: {\n option: {\n defined: 'CompressedCpiContext',\n },\n },\n },\n ],\n },\n },\n {\n name: 'MerkleTreeSequenceNumber',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'pubkey',\n type: 'publicKey',\n },\n {\n name: 'seq',\n type: 'u64',\n },\n ],\n },\n },\n {\n name: 'NewAddressParamsPacked',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'seed',\n type: {\n array: ['u8', 32],\n },\n },\n {\n name: 'addressQueueAccountIndex',\n type: 'u8',\n },\n {\n name: 'addressMerkleTreeAccountIndex',\n type: 'u8',\n },\n {\n name: 'addressMerkleTreeRootIndex',\n type: 'u16',\n },\n ],\n },\n },\n {\n name: 'OutputCompressedAccountWithPackedContext',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'compressedAccount',\n type: {\n defined: 'CompressedAccount',\n },\n },\n {\n name: 'merkleTreeIndex',\n type: 'u8',\n },\n ],\n },\n },\n {\n name: 'PackedCompressedAccountWithMerkleContext',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'compressedAccount',\n type: {\n defined: 'CompressedAccount',\n },\n },\n {\n name: 'merkleContext',\n type: {\n defined: 'PackedMerkleContext',\n },\n },\n {\n name: 'rootIndex',\n docs: [\n 'Index of root used in inclusion validity proof.',\n ],\n type: 'u16',\n },\n {\n name: 'readOnly',\n docs: [\n 'Placeholder to mark accounts read-only unimplemented set to false.',\n ],\n type: 'bool',\n },\n ],\n },\n },\n {\n name: 'PackedMerkleContext',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'merkleTreePubkeyIndex',\n type: 'u8',\n },\n {\n name: 'queuePubkeyIndex',\n type: 'u8',\n },\n {\n name: 'leafIndex',\n type: 'u32',\n },\n {\n name: 'proveByIndex',\n type: 'bool',\n },\n ],\n },\n },\n {\n name: 'PackedTokenTransferOutputData',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'owner',\n type: 'publicKey',\n },\n {\n name: 'amount',\n type: 'u64',\n },\n {\n name: 'lamports',\n type: {\n option: 'u64',\n },\n },\n {\n name: 'merkleTreeIndex',\n type: 'u8',\n },\n {\n name: 'tlv',\n docs: [\n 'Placeholder for TokenExtension tlv data (unimplemented)',\n ],\n type: {\n option: 'bytes',\n },\n },\n ],\n },\n },\n {\n name: 'PublicTransactionEvent',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'inputCompressedAccountHashes',\n type: {\n vec: {\n array: ['u8', 32],\n },\n },\n },\n {\n name: 'outputCompressedAccountHashes',\n type: {\n vec: {\n array: ['u8', 32],\n },\n },\n },\n {\n name: 'outputCompressedAccounts',\n type: {\n vec: {\n defined:\n 'OutputCompressedAccountWithPackedContext',\n },\n },\n },\n {\n name: 'outputLeafIndices',\n type: {\n vec: 'u32',\n },\n },\n {\n name: 'sequenceNumbers',\n type: {\n vec: {\n defined: 'MerkleTreeSequenceNumber',\n },\n },\n },\n {\n name: 'relayFee',\n type: {\n option: 'u64',\n },\n },\n {\n name: 'isCompress',\n type: 'bool',\n },\n {\n name: 'compressOrDecompressLamports',\n type: {\n option: 'u64',\n },\n },\n {\n name: 'pubkeyArray',\n type: {\n vec: 'publicKey',\n },\n },\n {\n name: 'message',\n type: {\n option: 'bytes',\n },\n },\n ],\n },\n },\n {\n name: 'QueueIndex',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'queueId',\n docs: ['Id of queue in queue account.'],\n type: 'u8',\n },\n {\n name: 'index',\n docs: ['Index of compressed account hash in queue.'],\n type: 'u16',\n },\n ],\n },\n },\n {\n name: 'TokenData',\n type: {\n kind: 'struct',\n fields: [\n {\n name: 'mint',\n docs: ['The mint associated with this account'],\n type: 'publicKey',\n },\n {\n name: 'owner',\n docs: ['The owner of this account.'],\n type: 'publicKey',\n },\n {\n name: 'amount',\n docs: ['The amount of tokens this account holds.'],\n type: 'u64',\n },\n {\n name: 'delegate',\n docs: [\n 'If `delegate` is `Some` then `delegated_amount` represents',\n 'the amount authorized by the delegate',\n ],\n type: {\n option: 'publicKey',\n },\n },\n {\n name: 'state',\n docs: [\"The account's state\"],\n type: {\n defined: 'AccountState',\n },\n },\n {\n name: 'tlv',\n docs: [\n 'Placeholder for TokenExtension tlv data (unimplemented)',\n ],\n type: {\n option: 'bytes',\n },\n },\n ],\n },\n },\n ],\n errors: [\n {\n code: 6000,\n name: 'PublicKeyAmountMissmatch',\n msg: 'public keys and amounts must be of same length',\n },\n {\n code: 6001,\n name: 'ComputeInputSumFailed',\n msg: 'ComputeInputSumFailed',\n },\n {\n code: 6002,\n name: 'ComputeOutputSumFailed',\n msg: 'ComputeOutputSumFailed',\n },\n {\n code: 6003,\n name: 'ComputeCompressSumFailed',\n msg: 'ComputeCompressSumFailed',\n },\n {\n code: 6004,\n name: 'ComputeDecompressSumFailed',\n msg: 'ComputeDecompressSumFailed',\n },\n {\n code: 6005,\n name: 'SumCheckFailed',\n msg: 'SumCheckFailed',\n },\n {\n code: 6006,\n name: 'DecompressRecipientUndefinedForDecompress',\n msg: 'DecompressRecipientUndefinedForDecompress',\n },\n {\n code: 6007,\n name: 'CompressedPdaUndefinedForDecompress',\n msg: 'CompressedPdaUndefinedForDecompress',\n },\n {\n code: 6008,\n name: 'DeCompressAmountUndefinedForDecompress',\n msg: 'DeCompressAmountUndefinedForDecompress',\n },\n {\n code: 6009,\n name: 'CompressedPdaUndefinedForCompress',\n msg: 'CompressedPdaUndefinedForCompress',\n },\n {\n code: 6010,\n name: 'DeCompressAmountUndefinedForCompress',\n msg: 'DeCompressAmountUndefinedForCompress',\n },\n {\n code: 6011,\n name: 'DelegateSignerCheckFailed',\n msg: 'DelegateSignerCheckFailed',\n },\n {\n code: 6012,\n name: 'MintTooLarge',\n msg: 'Minted amount greater than u64::MAX',\n },\n {\n code: 6013,\n name: 'SplTokenSupplyMismatch',\n msg: 'SplTokenSupplyMismatch',\n },\n {\n code: 6014,\n name: 'HeapMemoryCheckFailed',\n msg: 'HeapMemoryCheckFailed',\n },\n {\n code: 6015,\n name: 'InstructionNotCallable',\n msg: 'The instruction is not callable',\n },\n {\n code: 6016,\n name: 'ArithmeticUnderflow',\n msg: 'ArithmeticUnderflow',\n },\n {\n code: 6017,\n name: 'HashToFieldError',\n msg: 'HashToFieldError',\n },\n {\n code: 6018,\n name: 'InvalidAuthorityMint',\n msg: 'Expected the authority to be also a mint authority',\n },\n {\n code: 6019,\n name: 'InvalidFreezeAuthority',\n msg: 'Provided authority is not the freeze authority',\n },\n {\n code: 6020,\n name: 'InvalidDelegateIndex',\n },\n {\n code: 6021,\n name: 'TokenPoolPdaUndefined',\n },\n {\n code: 6022,\n name: 'IsTokenPoolPda',\n msg: 'Compress or decompress recipient is the same account as the token pool pda.',\n },\n {\n code: 6023,\n name: 'InvalidTokenPoolPda',\n },\n {\n code: 6024,\n name: 'NoInputTokenAccountsProvided',\n },\n {\n code: 6025,\n name: 'NoInputsProvided',\n },\n {\n code: 6026,\n name: 'MintHasNoFreezeAuthority',\n },\n {\n code: 6027,\n name: 'MintWithInvalidExtension',\n },\n {\n code: 6028,\n name: 'InsufficientTokenAccountBalance',\n msg: 'The token account balance is less than the remaining amount.',\n },\n {\n code: 6029,\n name: 'InvalidTokenPoolBump',\n msg: 'Max number of token pools reached.',\n },\n {\n code: 6030,\n name: 'FailedToDecompress',\n },\n {\n code: 6031,\n name: 'FailedToBurnSplTokensFromTokenPool',\n },\n {\n code: 6032,\n name: 'NoMatchingBumpFound',\n },\n ],\n};\n","import {\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionInstruction,\n TransactionSignature,\n} from '@solana/web3.js';\nimport { CompressedTokenProgram } from '../program';\nimport {\n Rpc,\n buildAndSignTx,\n sendAndConfirmTx,\n} from '@lightprotocol/stateless.js';\nimport { getTokenPoolInfos } from '../utils/get-token-pool-infos';\n\n/**\n * Register an existing mint with the CompressedToken program\n *\n * @param rpc RPC connection to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param confirmOptions Options for confirming the transaction\n * @param tokenProgramId Optional: Address of the token program. Default:\n * TOKEN_PROGRAM_ID\n *\n * @return transaction signature\n */\nexport async function createTokenPool(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n confirmOptions?: ConfirmOptions,\n tokenProgramId?: PublicKey,\n): Promise<TransactionSignature> {\n tokenProgramId = tokenProgramId\n ? tokenProgramId\n : await CompressedTokenProgram.getMintProgramId(mint, rpc);\n\n const ix = await CompressedTokenProgram.createTokenPool({\n feePayer: payer.publicKey,\n mint,\n tokenProgramId,\n });\n\n const { blockhash } = await rpc.getLatestBlockhash();\n\n const tx = buildAndSignTx([ix], payer, blockhash);\n\n const txId = await sendAndConfirmTx(rpc, tx, confirmOptions);\n\n return txId;\n}\n\n/**\n * Create additional token pools for an existing mint\n *\n * @param rpc RPC connection to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param numMaxAdditionalPools Number of additional token pools to create. Max\n * 3.\n * @param confirmOptions Optional: Options for confirming the transaction\n * @param tokenProgramId Optional: Address of the token program. Default:\n * TOKEN_PROGRAM_ID\n *\n * @return transaction signature\n */\nexport async function addTokenPools(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n numMaxAdditionalPools: number,\n confirmOptions?: ConfirmOptions,\n tokenProgramId?: PublicKey,\n) {\n tokenProgramId = tokenProgramId\n ? tokenProgramId\n : await CompressedTokenProgram.getMintProgramId(mint, rpc);\n const instructions: TransactionInstruction[] = [];\n\n const infos = (await getTokenPoolInfos(rpc, mint)).slice(0, 4);\n\n // Get indices of uninitialized pools\n const uninitializedIndices = [];\n for (let i = 0; i < infos.length; i++) {\n if (!infos[i].isInitialized) {\n uninitializedIndices.push(i);\n }\n }\n\n // Create instructions for requested number of pools\n for (let i = 0; i < numMaxAdditionalPools; i++) {\n if (i >= uninitializedIndices.length) {\n break;\n }\n\n instructions.push(\n await CompressedTokenProgram.addTokenPool({\n mint,\n feePayer: payer.publicKey,\n tokenProgramId,\n poolIndex: uninitializedIndices[i],\n }),\n );\n }\n const { blockhash } = await rpc.getLatestBlockhash();\n\n const tx = buildAndSignTx(instructions, payer, blockhash);\n\n const txId = await sendAndConfirmTx(rpc, tx, confirmOptions);\n\n return txId;\n}\n","import {\n ComputeBudgetProgram,\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionSignature,\n} from '@solana/web3.js';\nimport {\n bn,\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n} from '@lightprotocol/stateless.js';\nimport BN from 'bn.js';\nimport { CompressedTokenProgram } from '../program';\nimport {\n selectMinCompressedTokenAccountsForTransfer,\n selectTokenAccountsForApprove,\n} from '../utils';\n\n/**\n * Approve a delegate to spend tokens\n *\n * @param rpc Rpc to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param amount Number of tokens to delegate\n * @param owner Owner of the SPL token account.\n * @param delegate Address of the delegate\n * @param confirmOptions Options for confirming the transaction\n *\n * @return Signature of the confirmed transaction\n */\nexport async function approve(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n amount: number | BN,\n owner: Signer,\n delegate: PublicKey,\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n amount = bn(amount);\n const compressedTokenAccounts = await rpc.getCompressedTokenAccountsByOwner(\n owner.publicKey,\n {\n mint,\n },\n );\n\n const [inputAccounts] = selectTokenAccountsForApprove(\n compressedTokenAccounts.items,\n amount,\n );\n\n const proof = await rpc.getValidityProofV0(\n inputAccounts.map(account => ({\n hash: account.compressedAccount.hash,\n tree: account.compressedAccount.treeInfo.tree,\n queue: account.compressedAccount.treeInfo.queue,\n })),\n );\n\n const ix = await CompressedTokenProgram.approve({\n payer: payer.publicKey,\n inputCompressedTokenAccounts: inputAccounts,\n toAddress: delegate,\n amount,\n recentInputStateRootIndices: proof.rootIndices,\n recentValidityProof: proof.compressedProof,\n });\n\n const { blockhash } = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [owner]);\n const signedTx = buildAndSignTx(\n [ComputeBudgetProgram.setComputeUnitLimit({ units: 350_000 }), ix],\n payer,\n blockhash,\n additionalSigners,\n );\n\n return sendAndConfirmTx(rpc, signedTx, confirmOptions);\n}\n","import {\n ComputeBudgetProgram,\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionSignature,\n} from '@solana/web3.js';\nimport BN from 'bn.js';\nimport {\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n selectStateTreeInfo,\n toArray,\n TreeInfo,\n} from '@lightprotocol/stateless.js';\nimport { CompressedTokenProgram } from '../program';\nimport { getOrCreateAssociatedTokenAccount } from '@solana/spl-token';\n\nimport {\n getTokenPoolInfos,\n selectTokenPoolInfo,\n TokenPoolInfo,\n} from '../utils/get-token-pool-infos';\n\n/**\n * Mint compressed tokens to a solana address from an external mint authority\n *\n * @param rpc Rpc to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param toPubkey Address of the account to mint to\n * @param authority Minting authority\n * @param amount Amount to mint\n * @param outputStateTreeInfo Optional: State tree account that the compressed\n * tokens should be inserted into. Defaults to a\n * shared state tree account.\n * @param tokenPoolInfo Optional: Token pool info.\n * @param confirmOptions Options for confirming the transaction\n *\n * @return Signature of the confirmed transaction\n */\nexport async function approveAndMintTo(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n toPubkey: PublicKey,\n authority: Signer,\n amount: number | BN,\n outputStateTreeInfo?: TreeInfo,\n tokenPoolInfo?: TokenPoolInfo,\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n outputStateTreeInfo =\n outputStateTreeInfo ??\n selectStateTreeInfo(await rpc.getStateTreeInfos());\n tokenPoolInfo =\n tokenPoolInfo ??\n selectTokenPoolInfo(await getTokenPoolInfos(rpc, mint));\n\n const authorityTokenAccount = await getOrCreateAssociatedTokenAccount(\n rpc,\n payer,\n mint,\n authority.publicKey,\n undefined,\n undefined,\n confirmOptions,\n tokenPoolInfo.tokenProgram,\n );\n\n const ixs = await CompressedTokenProgram.approveAndMintTo({\n feePayer: payer.publicKey,\n mint,\n authority: authority.publicKey,\n authorityTokenAccount: authorityTokenAccount.address,\n amount,\n toPubkey,\n outputStateTreeInfo,\n tokenPoolInfo,\n });\n\n const { blockhash } = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [authority]);\n\n const tx = buildAndSignTx(\n [\n ComputeBudgetProgram.setComputeUnitLimit({\n units: 150_000 + toArray(amount).length * 20_000,\n }),\n ...ixs,\n ],\n payer,\n blockhash,\n additionalSigners,\n );\n\n return await sendAndConfirmTx(rpc, tx, confirmOptions);\n}\n","import {\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionSignature,\n ComputeBudgetProgram,\n} from '@solana/web3.js';\nimport {\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n selectStateTreeInfo,\n toArray,\n TreeInfo,\n} from '@lightprotocol/stateless.js';\nimport BN from 'bn.js';\nimport { CompressedTokenProgram } from '../program';\nimport {\n getTokenPoolInfos,\n selectTokenPoolInfo,\n TokenPoolInfo,\n} from '../utils/get-token-pool-infos';\n\n/**\n * Compress SPL tokens\n *\n * @param rpc Rpc connection to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param amount Number of tokens to compress.\n * @param owner Owner of the SPL token account.\n * @param sourceTokenAccount Source SPL token account. (ATA)\n * @param toAddress Recipient owner address.\n * @param outputStateTreeInfo Optional: State tree account that the compressed\n * tokens should be inserted into. Defaults to a\n * shared state tree account.\n * @param tokenPoolInfo Optional: Token pool info.\n * @param confirmOptions Options for confirming the transaction\n *\n * @return Signature of the confirmed transaction\n */\nexport async function compress(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n amount: number | BN | number[] | BN[],\n owner: Signer,\n sourceTokenAccount: PublicKey,\n toAddress: PublicKey | Array<PublicKey>,\n outputStateTreeInfo?: TreeInfo,\n tokenPoolInfo?: TokenPoolInfo,\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n outputStateTreeInfo =\n outputStateTreeInfo ??\n selectStateTreeInfo(await rpc.getStateTreeInfos());\n tokenPoolInfo =\n tokenPoolInfo ??\n selectTokenPoolInfo(await getTokenPoolInfos(rpc, mint));\n\n const compressIx = await CompressedTokenProgram.compress({\n payer: payer.publicKey,\n owner: owner.publicKey,\n source: sourceTokenAccount,\n toAddress,\n amount,\n mint,\n outputStateTreeInfo,\n tokenPoolInfo,\n });\n\n const blockhashCtx = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [owner]);\n const signedTx = buildAndSignTx(\n [\n ComputeBudgetProgram.setComputeUnitLimit({\n units: 130_000 + toArray(amount).length * 20_000,\n }),\n compressIx,\n ],\n payer,\n blockhashCtx.blockhash,\n additionalSigners,\n );\n\n return await sendAndConfirmTx(rpc, signedTx, confirmOptions, blockhashCtx);\n}\n","import {\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionSignature,\n ComputeBudgetProgram,\n} from '@solana/web3.js';\nimport {\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n selectStateTreeInfo,\n TreeInfo,\n} from '@lightprotocol/stateless.js';\nimport BN from 'bn.js';\nimport {\n getTokenPoolInfos,\n selectTokenPoolInfo,\n TokenPoolInfo,\n} from '../utils/get-token-pool-infos';\nimport { CompressedTokenProgram } from '../program';\n\n/**\n * Compress SPL tokens into compressed token format\n *\n * @param rpc Rpc connection to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param owner Owner of the token account\n * @param tokenAccount Token account to compress\n * @param remainingAmount Optional: amount to leave in token account.\n * Default: 0\n * @param outputStateTreeInfo Optional: State tree account that the compressed\n * account into\n * @param tokenPoolInfo Optional: Token pool info.\n * @param confirmOptions Options for confirming the transaction\n\n *\n * @return Signature of the confirmed transaction\n */\nexport async function compressSplTokenAccount(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n owner: Signer,\n tokenAccount: PublicKey,\n remainingAmount?: BN,\n outputStateTreeInfo?: TreeInfo,\n tokenPoolInfo?: TokenPoolInfo,\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n outputStateTreeInfo =\n outputStateTreeInfo ??\n selectStateTreeInfo(await rpc.getStateTreeInfos());\n tokenPoolInfo =\n tokenPoolInfo ??\n selectTokenPoolInfo(await getTokenPoolInfos(rpc, mint));\n\n const compressIx = await CompressedTokenProgram.compressSplTokenAccount({\n feePayer: payer.publicKey,\n authority: owner.publicKey,\n tokenAccount,\n mint,\n remainingAmount,\n outputStateTreeInfo,\n tokenPoolInfo,\n });\n\n const blockhashCtx = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [owner]);\n\n const signedTx = buildAndSignTx(\n [\n ComputeBudgetProgram.setComputeUnitLimit({\n units: 150_000,\n }),\n compressIx,\n ],\n payer,\n blockhashCtx.blockhash,\n additionalSigners,\n );\n\n return await sendAndConfirmTx(rpc, signedTx, confirmOptions, blockhashCtx);\n}\n","import {\n ConfirmOptions,\n Keypair,\n PublicKey,\n Signer,\n TransactionSignature,\n} from '@solana/web3.js';\nimport { CompressedTokenProgram } from '../program';\nimport {\n MINT_SIZE,\n TOKEN_2022_PROGRAM_ID,\n TOKEN_PROGRAM_ID,\n} from '@solana/spl-token';\nimport {\n Rpc,\n buildAndSignTx,\n dedupeSigner,\n sendAndConfirmTx,\n} from '@lightprotocol/stateless.js';\n\n/**\n * Create and initialize a new compressed token mint\n *\n * @param rpc RPC connection to use\n * @param payer Fee payer\n * @param mintAuthority Account that will control minting\n * @param decimals Location of the decimal place\n * @param keypair Optional: Mint keypair. Defaults to a random\n * keypair.\n * @param confirmOptions Options for confirming the transaction\n * @param tokenProgramId Optional: Program ID for the token. Defaults to\n * TOKEN_PROGRAM_ID.\n * @param freezeAuthority Optional: Account that will control freeze and thaw.\n * Defaults to none.\n *\n * @return Object with mint address and transaction signature\n */\nexport async function createMint(\n rpc: Rpc,\n payer: Signer,\n mintAuthority: PublicKey | Signer,\n decimals: number,\n keypair = Keypair.generate(),\n confirmOptions?: ConfirmOptions,\n tokenProgramId?: PublicKey | boolean,\n freezeAuthority?: PublicKey | Signer,\n): Promise<{ mint: PublicKey; transactionSignature: TransactionSignature }> {\n const rentExemptBalance =\n await rpc.getMinimumBalanceForRentExemption(MINT_SIZE);\n\n // If true, uses TOKEN_2022_PROGRAM_ID.\n // If false or undefined, defaults to TOKEN_PROGRAM_ID.\n // Otherwise, uses the provided tokenProgramId.\n const resolvedTokenProgramId =\n tokenProgramId === true\n ? TOKEN_2022_PROGRAM_ID\n : tokenProgramId || TOKEN_PROGRAM_ID;\n\n const ixs = await CompressedTokenProgram.createMint({\n feePayer: payer.publicKey,\n mint: keypair.publicKey,\n decimals,\n authority:\n 'secretKey' in mintAuthority\n ? mintAuthority.publicKey\n : mintAuthority,\n freezeAuthority:\n freezeAuthority && 'secretKey' in freezeAuthority\n ? freezeAuthority.publicKey\n : (freezeAuthority ?? null),\n rentExemptBalance,\n tokenProgramId: resolvedTokenProgramId,\n });\n\n const { blockhash } = await rpc.getLatestBlockhash();\n\n const additionalSigners = dedupeSigner(\n payer,\n [mintAuthority, freezeAuthority].filter(\n (signer): signer is Signer =>\n signer != undefined && 'secretKey' in signer,\n ),\n );\n\n const tx = buildAndSignTx(ixs, payer, blockhash, [\n ...additionalSigners,\n keypair,\n ]);\n const txId = await sendAndConfirmTx(rpc, tx, confirmOptions);\n\n return { mint: keypair.publicKey, transactionSignature: txId };\n}\n","import { PublicKey, Signer, TransactionSignature } from '@solana/web3.js';\nimport {\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n} from '@lightprotocol/stateless.js';\n\nimport { CompressedTokenProgram } from '../program';\n\n/**\n * Create a lookup table for the token program's default accounts\n *\n * @param rpc Rpc connection to use\n * @param payer Fee payer\n * @param authority Authority of the lookup table\n * @param mints Optional array of mint public keys to include in\n * the lookup table\n * @param additionalAccounts Optional array of additional account public keys\n * to include in the lookup table\n *\n * @return Object with transaction signatures and the address of the created\n * lookup table\n */\nexport async function createTokenProgramLookupTable(\n rpc: Rpc,\n payer: Signer,\n authority: Signer,\n mints?: PublicKey[],\n additionalAccounts?: PublicKey[],\n): Promise<{ txIds: TransactionSignature[]; address: PublicKey }> {\n const recentSlot = await rpc.getSlot('finalized');\n const { instructions, address } =\n await CompressedTokenProgram.createTokenProgramLookupTable({\n payer: payer.publicKey,\n authority: authority.publicKey,\n mints,\n remainingAccounts: additionalAccounts,\n recentSlot,\n });\n\n const additionalSigners = dedupeSigner(payer, [authority]);\n const txIds = [];\n\n for (const instruction of instructions) {\n const blockhashCtx = await rpc.getLatestBlockhash();\n const signedTx = buildAndSignTx(\n [instruction],\n payer,\n blockhashCtx.blockhash,\n additionalSigners,\n );\n const txId = await sendAndConfirmTx(\n rpc,\n signedTx,\n { commitment: 'finalized' },\n blockhashCtx,\n );\n txIds.push(txId);\n }\n\n return { txIds, address };\n}\n","import {\n ComputeBudgetProgram,\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionSignature,\n} from '@solana/web3.js';\nimport {\n bn,\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n} from '@lightprotocol/stateless.js';\nimport BN from 'bn.js';\nimport { CompressedTokenProgram } from '../program';\nimport { selectMinCompressedTokenAccountsForTransfer } from '../utils';\nimport {\n selectTokenPoolInfosForDecompression,\n TokenPoolInfo,\n} from '../utils/get-token-pool-infos';\nimport { getTokenPoolInfos } from '../utils/get-token-pool-infos';\n\n/**\n * Decompress compressed tokens\n *\n * @param rpc Rpc connection to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param amount Number of tokens to transfer\n * @param owner Owner of the compressed tokens\n * @param toAddress Destination **uncompressed** token account\n * address. (ATA)\n * @param tokenPoolInfos Optional: Token pool infos.\n * @param confirmOptions Options for confirming the transaction\n *\n * @return confirmed transaction signature\n */\nexport async function decompress(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n amount: number | BN,\n owner: Signer,\n toAddress: PublicKey,\n tokenPoolInfos?: TokenPoolInfo[],\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n amount = bn(amount);\n\n const compressedTokenAccounts = await rpc.getCompressedTokenAccountsByOwner(\n owner.publicKey,\n {\n mint,\n },\n );\n\n const [inputAccounts] = selectMinCompressedTokenAccountsForTransfer(\n compressedTokenAccounts.items,\n amount,\n );\n\n const proof = await rpc.getValidityProofV0(\n inputAccounts.map(account => ({\n hash: account.compressedAccount.hash,\n tree: account.compressedAccount.treeInfo.tree,\n queue: account.compressedAccount.treeInfo.queue,\n })),\n );\n\n tokenPoolInfos = tokenPoolInfos ?? (await getTokenPoolInfos(rpc, mint));\n\n const selectedTokenPoolInfos = selectTokenPoolInfosForDecompression(\n tokenPoolInfos,\n amount,\n );\n\n const ix = await CompressedTokenProgram.decompress({\n payer: payer.publicKey,\n inputCompressedTokenAccounts: inputAccounts,\n toAddress,\n amount,\n tokenPoolInfos: selectedTokenPoolInfos,\n recentInputStateRootIndices: proof.rootIndices,\n recentValidityProof: proof.compressedProof,\n });\n\n const { blockhash } = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [owner]);\n const signedTx = buildAndSignTx(\n [ComputeBudgetProgram.setComputeUnitLimit({ units: 350_000 }), ix],\n payer,\n blockhash,\n additionalSigners,\n );\n return await sendAndConfirmTx(rpc, signedTx, confirmOptions);\n}\n","import {\n ComputeBudgetProgram,\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionSignature,\n} from '@solana/web3.js';\nimport {\n bn,\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n} from '@lightprotocol/stateless.js';\n\nimport BN from 'bn.js';\n\nimport { CompressedTokenProgram } from '../program';\nimport { selectMinCompressedTokenAccountsForTransfer } from '../utils';\nimport {\n selectTokenPoolInfosForDecompression,\n TokenPoolInfo,\n} from '../utils/get-token-pool-infos';\nimport { getTokenPoolInfos } from '../utils/get-token-pool-infos';\n\n/**\n * Decompress delegated compressed tokens. Remaining compressed tokens are\n * returned to the owner without delegation.\n *\n * @param rpc Rpc connection to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param amount Number of tokens to decompress\n * @param owner Owner of the compressed tokens\n * @param toAddress Destination **uncompressed** token account\n * address. (ATA)\n * @param tokenPoolInfos Optional: Token pool infos.\n * @param confirmOptions Options for confirming the transaction\n *\n * @return Signature of the confirmed transaction\n */\nexport async function decompressDelegated(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n amount: number | BN,\n owner: Signer,\n toAddress: PublicKey,\n tokenPoolInfos?: TokenPoolInfo[],\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n amount = bn(amount);\n\n const compressedTokenAccounts =\n await rpc.getCompressedTokenAccountsByDelegate(owner.publicKey, {\n mint,\n });\n\n const [inputAccounts] = selectMinCompressedTokenAccountsForTransfer(\n compressedTokenAccounts.items,\n amount,\n );\n\n const proof = await rpc.getValidityProofV0(\n inputAccounts.map(account => ({\n hash: account.compressedAccount.hash,\n tree: account.compressedAccount.treeInfo.tree,\n queue: account.compressedAccount.treeInfo.queue,\n })),\n );\n\n const tokenPoolInfosToUse =\n tokenPoolInfos ??\n selectTokenPoolInfosForDecompression(\n await getTokenPoolInfos(rpc, mint),\n amount,\n );\n\n const ix = await CompressedTokenProgram.decompress({\n payer: payer.publicKey,\n inputCompressedTokenAccounts: inputAccounts,\n toAddress,\n amount,\n recentInputStateRootIndices: proof.rootIndices,\n recentValidityProof: proof.compressedProof,\n tokenPoolInfos: tokenPoolInfosToUse,\n });\n\n const { blockhash } = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [owner]);\n const signedTx = buildAndSignTx(\n [ComputeBudgetProgram.setComputeUnitLimit({ units: 350_000 }), ix],\n payer,\n blockhash,\n additionalSigners,\n );\n\n return sendAndConfirmTx(rpc, signedTx, confirmOptions);\n}\n","import { PublicKey } from '@solana/web3.js';\nimport BN from 'bn.js';\nimport { Buffer } from 'buffer';\nimport {\n ValidityProof,\n PackedMerkleContextLegacy,\n CompressedCpiContext,\n} from '@lightprotocol/stateless.js';\nimport { TokenPoolInfo } from './utils/get-token-pool-infos';\n\nexport type TokenTransferOutputData = {\n /**\n * The owner of the output token account\n */\n owner: PublicKey;\n /**\n * The amount of tokens of the output token account\n */\n amount: BN;\n /**\n * lamports associated with the output token account\n */\n lamports: BN | null;\n /**\n * TokenExtension tlv\n */\n tlv: Buffer | null;\n};\n\nexport type PackedTokenTransferOutputData = {\n /**\n * The owner of the output token account\n */\n owner: PublicKey;\n /**\n * The amount of tokens of the output token account\n */\n amount: BN;\n /**\n * lamports associated with the output token account\n */\n lamports: BN | null;\n /**\n * Merkle tree pubkey index in remaining accounts\n */\n merkleTreeIndex: number;\n /**\n * TokenExtension tlv\n */\n tlv: Buffer | null;\n};\n\nexport type InputTokenDataWithContext = {\n amount: BN;\n delegateIndex: number | null;\n merkleContext: PackedMerkleContextLegacy;\n rootIndex: number;\n lamports: BN | null;\n tlv: Buffer | null;\n};\n\nexport type DelegatedTransfer = {\n owner: PublicKey;\n delegateChangeAccountIndex: number | null;\n};\n\nexport type BatchCompressInstructionData = {\n pubkeys: PublicKey[];\n amounts: BN[] | null;\n lamports: BN | null;\n amount: BN | null;\n index: number;\n bump: number;\n};\n\nexport type MintToInstructionData = {\n recipients: PublicKey[];\n amounts: BN[];\n lamports: BN | null;\n};\nexport type CompressSplTokenAccountInstructionData = {\n owner: PublicKey;\n remainingAmount: BN | null;\n cpiContext: CompressedCpiContext | null;\n};\n\nexport function isSingleTokenPoolInfo(\n tokenPoolInfos: TokenPoolInfo | TokenPoolInfo[],\n): tokenPoolInfos is TokenPoolInfo {\n return !Array.isArray(tokenPoolInfos);\n}\n\nexport type CompressedTokenInstructionDataTransfer = {\n /**\n * Validity proof\n */\n proof: ValidityProof | null;\n /**\n * The mint of the transfer\n */\n mint: PublicKey;\n /**\n * Whether the signer is a delegate\n */\n delegatedTransfer: DelegatedTransfer | null;\n /**\n * Input token data with packed merkle context\n */\n inputTokenDataWithContext: InputTokenDataWithContext[];\n /**\n * Data of the output token accounts\n */\n outputCompressedAccounts: PackedTokenTransferOutputData[];\n /**\n * Whether it's a compress or decompress action if compressOrDecompressAmount is non-null\n */\n isCompress: boolean;\n /**\n * If null, it's a transfer.\n * If some, the amount that is being deposited into (compress) or withdrawn from (decompress) the token escrow\n */\n compressOrDecompressAmount: BN | null;\n /**\n * CPI context if\n */\n cpiContext: CompressedCpiContext | null;\n /**\n * The index of the Merkle tree for a lamport change account.\n */\n lamportsChangeAccountMerkleTreeIndex: number | null;\n};\n\nexport type TokenData = {\n /**\n * The mint associated with this account\n */\n mint: PublicKey;\n /**\n * The owner of this account\n */\n owner: PublicKey;\n /**\n * The amount of tokens this account holds\n */\n amount: BN;\n /**\n * If `delegate` is `Some` then `delegated_amount` represents the amount\n * authorized by the delegate\n */\n delegate: PublicKey | null;\n /**\n * The account's state\n */\n state: number;\n /**\n * TokenExtension tlv\n */\n tlv: Buffer | null;\n};\n\nexport type CompressedTokenInstructionDataApprove = {\n proof: ValidityProof | null;\n mint: PublicKey;\n inputTokenDataWithContext: InputTokenDataWithContext[];\n cpiContext: CompressedCpiContext | null;\n delegate: PublicKey;\n delegatedAmount: BN;\n delegateMerkleTreeIndex: number;\n changeAccountMerkleTreeIndex: number;\n delegateLamports: BN | null;\n};\n\nexport type CompressedTokenInstructionDataRevoke = {\n proof: ValidityProof | null;\n mint: PublicKey;\n inputTokenDataWithContext: InputTokenDataWithContext[];\n cpiContext: CompressedCpiContext | null;\n outputAccountMerkleTreeIndex: number;\n};\n","import {\n ComputeBudgetProgram,\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionSignature,\n} from '@solana/web3.js';\nimport {\n Rpc,\n dedupeSigner,\n buildAndSignTx,\n sendAndConfirmTx,\n bn,\n} from '@lightprotocol/stateless.js';\nimport { CompressedTokenProgram } from '../program';\n\n/**\n * Merge multiple compressed token accounts for a given mint into a single\n * account\n *\n * @param rpc RPC connection to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param owner Owner of the token accounts to be merged\n * @param confirmOptions Options for confirming the transaction\n *\n * @return confirmed transaction signature\n */\nexport async function mergeTokenAccounts(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n owner: Signer,\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n const compressedTokenAccounts = await rpc.getCompressedTokenAccountsByOwner(\n owner.publicKey,\n { mint },\n );\n\n if (compressedTokenAccounts.items.length === 0) {\n throw new Error(\n `No compressed token accounts found for mint ${mint.toBase58()}`,\n );\n }\n\n const instructions = [\n ComputeBudgetProgram.setComputeUnitLimit({ units: 1_000_000 }),\n ];\n\n for (\n let i = 0;\n i < compressedTokenAccounts.items.slice(0, 8).length;\n i += 4\n ) {\n const batch = compressedTokenAccounts.items.slice(i, i + 4);\n\n const proof = await rpc.getValidityProof(\n batch.map(account => bn(account.compressedAccount.hash)),\n );\n\n const batchInstructions =\n await CompressedTokenProgram.mergeTokenAccounts({\n payer: payer.publicKey,\n owner: owner.publicKey,\n inputCompressedTokenAccounts: batch,\n mint,\n recentValidityProof: proof.compressedProof,\n recentInputStateRootIndices: proof.rootIndices,\n });\n\n instructions.push(...batchInstructions);\n }\n\n const { blockhash } = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [owner]);\n\n const signedTx = buildAndSignTx(\n instructions,\n payer,\n blockhash,\n additionalSigners,\n );\n\n return sendAndConfirmTx(rpc, signedTx, confirmOptions);\n}\n","import {\n ComputeBudgetProgram,\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionSignature,\n} from '@solana/web3.js';\nimport BN from 'bn.js';\nimport {\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n selectStateTreeInfo,\n TreeInfo,\n} from '@lightprotocol/stateless.js';\nimport { CompressedTokenProgram } from '../program';\nimport {\n getTokenPoolInfos,\n selectTokenPoolInfo,\n TokenPoolInfo,\n} from '../utils/get-token-pool-infos';\n\n/**\n * Mint compressed tokens to a solana address\n *\n * @param rpc Rpc connection to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param toPubkey Address of the account to mint to. Can be an\n * array of addresses if the amount is an array of\n * amounts.\n * @param authority Mint authority\n * @param amount Amount to mint. Pass an array of amounts if the\n * toPubkey is an array of addresses.\n * @param outputStateTreeInfo Optional: State tree account that the compressed\n * tokens should be part of. Defaults to the\n * default state tree account.\n * @param tokenPoolInfo Optional: Token pool information\n * @param confirmOptions Options for confirming the transaction\n *\n * @return Signature of the confirmed transaction\n */\nexport async function mintTo(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n toPubkey: PublicKey | PublicKey[],\n authority: Signer,\n amount: number | BN | number[] | BN[],\n outputStateTreeInfo?: TreeInfo,\n tokenPoolInfo?: TokenPoolInfo,\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n outputStateTreeInfo =\n outputStateTreeInfo ??\n selectStateTreeInfo(await rpc.getStateTreeInfos());\n tokenPoolInfo =\n tokenPoolInfo ??\n selectTokenPoolInfo(await getTokenPoolInfos(rpc, mint));\n\n const ix = await CompressedTokenProgram.mintTo({\n feePayer: payer.publicKey,\n mint,\n authority: authority.publicKey,\n amount,\n toPubkey,\n outputStateTreeInfo,\n tokenPoolInfo,\n });\n\n const { blockhash } = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [authority]);\n\n const tx = buildAndSignTx(\n [ComputeBudgetProgram.setComputeUnitLimit({ units: 1_000_000 }), ix],\n payer,\n blockhash,\n additionalSigners,\n );\n\n return sendAndConfirmTx(rpc, tx, confirmOptions);\n}\n","import {\n ComputeBudgetProgram,\n ConfirmOptions,\n Signer,\n TransactionSignature,\n} from '@solana/web3.js';\nimport {\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n ParsedTokenAccount,\n} from '@lightprotocol/stateless.js';\nimport { CompressedTokenProgram } from '../program';\n\n/**\n * Revoke one or more delegated token accounts\n *\n * @param rpc Rpc connection to use\n * @param payer Fee payer\n * @param accounts Delegated compressed token accounts to revoke\n * @param owner Owner of the compressed tokens\n * @param confirmOptions Options for confirming the transaction\n *\n * @return Signature of the confirmed transaction\n */\nexport async function revoke(\n rpc: Rpc,\n payer: Signer,\n accounts: ParsedTokenAccount[],\n owner: Signer,\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n const proof = await rpc.getValidityProofV0(\n accounts.map(account => ({\n hash: account.compressedAccount.hash,\n tree: account.compressedAccount.treeInfo.tree,\n queue: account.compressedAccount.treeInfo.queue,\n })),\n );\n checkOwner(owner, accounts);\n checkIsDelegated(accounts);\n\n const ix = await CompressedTokenProgram.revoke({\n payer: payer.publicKey,\n inputCompressedTokenAccounts: accounts,\n recentInputStateRootIndices: proof.rootIndices,\n recentValidityProof: proof.compressedProof,\n });\n\n const { blockhash } = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [owner]);\n const signedTx = buildAndSignTx(\n [ComputeBudgetProgram.setComputeUnitLimit({ units: 500_000 }), ix],\n payer,\n blockhash,\n additionalSigners,\n );\n\n return sendAndConfirmTx(rpc, signedTx, confirmOptions);\n}\n\nfunction checkOwner(owner: Signer, accounts: ParsedTokenAccount[]) {\n if (!owner.publicKey.equals(accounts[0].parsed.owner)) {\n throw new Error(\n `Owner ${owner.publicKey.toBase58()} does not match account ${accounts[0].parsed.owner.toBase58()}`,\n );\n }\n}\n\nfunction checkIsDelegated(accounts: ParsedTokenAccount[]) {\n if (accounts.some(account => account.parsed.delegate === null)) {\n throw new Error('Account is not delegated');\n }\n}\n","import {\n ComputeBudgetProgram,\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionSignature,\n} from '@solana/web3.js';\nimport {\n bn,\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n StateTreeInfo,\n selectStateTreeInfo,\n} from '@lightprotocol/stateless.js';\nimport BN from 'bn.js';\nimport { CompressedTokenProgram } from '../program';\nimport { selectMinCompressedTokenAccountsForTransfer } from '../utils';\n\n/**\n * Transfer compressed tokens from one owner to another\n *\n * @param rpc Rpc connection to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param amount Number of tokens to transfer\n * @param owner Owner of the compressed tokens\n * @param toAddress Destination address of the recipient\n * @param confirmOptions Options for confirming the transaction\n *\n * @return confirmed transaction signature\n */\nexport async function transfer(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n amount: number | BN,\n owner: Signer,\n toAddress: PublicKey,\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n amount = bn(amount);\n const compressedTokenAccounts = await rpc.getCompressedTokenAccountsByOwner(\n owner.publicKey,\n {\n mint,\n },\n );\n\n const [inputAccounts] = selectMinCompressedTokenAccountsForTransfer(\n compressedTokenAccounts.items,\n amount,\n );\n\n const proof = await rpc.getValidityProofV0(\n inputAccounts.map(account => ({\n hash: account.compressedAccount.hash,\n tree: account.compressedAccount.treeInfo.tree,\n queue: account.compressedAccount.treeInfo.queue,\n })),\n );\n\n const ix = await CompressedTokenProgram.transfer({\n payer: payer.publicKey,\n inputCompressedTokenAccounts: inputAccounts,\n toAddress,\n amount,\n recentInputStateRootIndices: proof.rootIndices,\n recentValidityProof: proof.compressedProof,\n });\n\n const { blockhash } = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [owner]);\n const signedTx = buildAndSignTx(\n [ComputeBudgetProgram.setComputeUnitLimit({ units: 500_000 }), ix],\n payer,\n blockhash,\n additionalSigners,\n );\n\n return sendAndConfirmTx(rpc, signedTx, confirmOptions);\n}\n","import {\n ComputeBudgetProgram,\n ConfirmOptions,\n PublicKey,\n Signer,\n TransactionSignature,\n} from '@solana/web3.js';\nimport {\n bn,\n sendAndConfirmTx,\n buildAndSignTx,\n Rpc,\n dedupeSigner,\n} from '@lightprotocol/stateless.js';\nimport BN from 'bn.js';\nimport { CompressedTokenProgram } from '../program';\nimport { selectMinCompressedTokenAccountsForTransfer } from '../utils';\n\n/**\n * Transfer delegated compressed tokens to another owner\n *\n * @param rpc Rpc connection to use\n * @param payer Fee payer\n * @param mint SPL Mint address\n * @param amount Number of tokens to transfer\n * @param owner Owner of the compressed tokens\n * @param toAddress Destination address of the recipient\n * @param confirmOptions Options for confirming the transaction\n *\n * @return confirmed transaction signature\n */\nexport async function transferDelegated(\n rpc: Rpc,\n payer: Signer,\n mint: PublicKey,\n amount: number | BN,\n owner: Signer,\n toAddress: PublicKey,\n confirmOptions?: ConfirmOptions,\n): Promise<TransactionSignature> {\n amount = bn(amount);\n const compressedTokenAccounts =\n await rpc.getCompressedTokenAccountsByDelegate(owner.publicKey, {\n mint,\n });\n\n const [inputAccounts] = selectMinCompressedTokenAccountsForTransfer(\n compressedTokenAccounts.items,\n amount,\n );\n\n const proof = await rpc.getValidityProofV0(\n inputAccounts.map(account => ({\n hash: account.compressedAccount.hash,\n tree: account.compressedAccount.treeInfo.tree,\n queue: account.compressedAccount.treeInfo.queue,\n })),\n );\n\n const ix = await CompressedTokenProgram.transfer({\n payer: payer.publicKey,\n inputCompressedTokenAccounts: inputAccounts,\n toAddress,\n amount,\n recentInputStateRootIndices: proof.rootIndices,\n recentValidityProof: proof.compressedProof,\n });\n\n const { blockhash } = await rpc.getLatestBlockhash();\n const additionalSigners = dedupeSigner(payer, [owner]);\n const signedTx = buildAndSignTx(\n [ComputeBudgetProgram.setComputeUnitLimit({ units: 500_000 }), ix],\n payer,\n blockhash,\n additionalSigners,\n );\n\n return sendAndConfirmTx(rpc, signedTx, confirmOptions);\n}\n"],"names":["POOL_SEED","Buffer","from","CPI_AUTHORITY_SEED","CREATE_TOKEN_POOL_DISCRIMINATOR","MINT_TO_DISCRIMINATOR","BATCH_COMPRESS_DISCRIMINATOR","TRANSFER_DISCRIMINATOR","COMPRESS_SPL_TOKEN_ACCOUNT_DISCRIMINATOR","APPROVE_DISCRIMINATOR","REVOKE_DISCRIMINATOR","ADD_TOKEN_POOL_DISCRIMINATOR","checkTokenPoolInfo","tokenPoolInfo","mint","equals","Error","isInitialized","toBase58","async","getTokenPoolInfos","rpc","commitment","addressesAndBumps","Array","length","_","i","CompressedTokenProgram","deriveTokenPoolPdaWithIndex","accountInfos","getMultipleAccountsInfo","map","addressAndBump","parsedInfos","unpackAccount","owner","tokenProgram","parsedInfo","tokenPoolPda","address","activity","undefined","balance","bn","amount","toString","poolIndex","bump","Action","shuffleArray","array","j","Math","floor","random","selectTokenPoolInfo","infos","filteredInfos","filter","info","selectTokenPoolInfosForDecompression","decompressAmount","sufficientBalanceInfo","find","gte","mul","sort","a","b","every","isZero","ERROR_NO_ACCOUNTS_FOUND","selectTokenAccountsForApprove","accounts","approveAmount","maxInputs","exactMatch","account","parsed","eq","compressedAccount","lamports","selectMinCompressedTokenAccountsForTransfer","transferAmount","selectedAccounts","accumulatedAmount","accumulatedLamports","maxPossibleAmount","selectMinCompressedTokenAccountsForTransferOrPartial","lt","totalBalance","reduce","acc","add","cmp","push","slice","total","console","log","selectSmartCompressedTokenAccountsForTransferOrPartial","nonZeroAccounts","remainingAccounts","smallestAccount","min","max","packCompressedTokenAccounts","params","inputCompressedTokenAccounts","outputStateTreeInfo","rootIndices","tokenTransferOutputs","_remainingAccounts","delegateIndex","delegate","getIndexOrAdd","packedInputTokenData","forEach","index","merkleTreePubkeyIndex","treeInfo","tree","queuePubkeyIndex","queue","merkleContext","leafIndex","proveByIndex","rootIndex","tlv","activeTreeInfo","nextTreeInfo","activeTreeOrQueue","treeType","TreeType","StateV2","featureFlags","isV2","paddedOutputStateMerkleTrees","padOutputStateMerkleTrees","packedOutputTokenData","merkleTreeIndex","_a","remainingAccountMetas","pubkey","isWritable","isSigner","inputTokenDataWithContext","checkMint","compressedTokenAccounts","Layout","constructor","span","property","Number","isInteger","TypeError","this","makeDestinationObject","decode","offset","encode","src","getSpan","RangeError","replicate","rv","Object","create","prototype","assign","fromArray","values","nameWithProperty","name","lo","Layout_1","bindConstructorLayout","Class","layout","hasOwnProperty","layout_","boundConstructor_","defineProperty","value","writable","ExternalLayout","isCount","GreedyCount","elementSpan","super","rem","OffsetLayout","UInt","UIntBE","readUIntLE","writeUIntLE","readUIntBE","writeUIntBE","Int","readIntLE","writeIntLE","IntBE","readIntBE","writeIntBE","V2E32","pow","divmodInt64","hi32","lo32","roundedInt64","NearUInt64","readUInt32LE","split","writeUInt32LE","NearUInt64BE","readUInt32BE","writeUInt32BE","NearInt64","readInt32LE","writeInt32LE","NearInt64BE","readInt32BE","writeInt32BE","Float","readFloatLE","writeFloatLE","FloatBE","readFloatBE","writeFloatBE","Double","readDoubleLE","writeDoubleLE","DoubleBE","readDoubleBE","writeDoubleBE","Sequence","elementLayout","count","idx","elo","v","Structure","fields","decodePrefixes","isArray","fd","e","fsp","dest","firstOffset","lastOffset","lastWrote","fv","shift","layoutFor","offsetOf","UnionDiscriminator","UnionLayoutDiscriminator","Union","discr","defaultLayout","upv","discriminator","usesPrefixDiscriminator","registry","boundGetSourceVariant","defaultGetSourceVariant","bind","getSourceVariant","configGetSourceVariant","gsv","vlo","getVariant","tag","dlo","clo","contentOffset","addVariant","variant","VariantLayout","vb","isBuffer","union","fixBitwiseResult","BitStructure","word","msb","_packedSetValue","_packedGetValue","addField","bits","bf","BitField","addBoolean","Boolean","fieldFor","container","totalBits","usedBits","sum","valueMask","start","wordMask","wordValue","call","Blob","write","CString","srcb","copy","UTF8","maxSpan","Constant","greedy","u8","u16","u24","u32","u40","u48","nu64","u16be","u24be","u32be","u40be","u48be","nu64be","s8","s16","s24","s32","s40","s48","ns64","s16be","s24be","s32be","s40be","s48be","ns64be","f32","f32be","f64","f64be","struct","seq","unionLayoutDiscriminator","blob","cstr","utf8","const","module","exports","assert","val","msg","inherits","ctor","superCtor","super_","TempCtor","BN","number","base","endian","isBN","negative","words","red","_init","wordSize","window","require$$0","parseHex4Bits","string","c","charCodeAt","parseHexByte","lowerBound","r","parseBase","str","end","len","move","num","left","right","_initNumber","_initArray","replace","_parseHex","_parseBase","toArray","ceil","w","off","_strip","limbLen","limbPow","mod","imuln","_iaddn","_move","clone","_expand","size","_normSign","Symbol","for","inspect","zeros","groupSizes","groupBases","smallMulTo","self","out","carry","k","ncarry","rword","maxJ","padding","groupSize","groupBase","modrn","idivn","toNumber","ret","toJSON","toBuffer","toArrayLike","ArrayType","byteLength","reqLength","res","allocUnsafe","allocate","_toArrayLikeLE","position","_toArrayLikeBE","clz32","_countBits","t","_zeroBits","bitLength","hi","zeroBits","toTwos","width","abs","inotn","iaddn","fromTwos","testn","notn","ineg","isNeg","neg","iuor","ior","or","uor","iuand","iand","and","uand","iuxor","ixor","xor","uxor","bytesNeeded","bitsLeft","setn","bit","wbit","iadd","isub","sub","comb10MulTo","mid","o","a0","al0","ah0","a1","al1","ah1","a2","al2","ah2","a3","al3","ah3","a4","al4","ah4","a5","al5","ah5","a6","al6","ah6","a7","al7","ah7","a8","al8","ah8","a9","al9","ah9","b0","bl0","bh0","b1","bl1","bh1","b2","bl2","bh2","b3","bl3","bh3","b4","bl4","bh4","b5","bl5","bh5","b6","bl6","bh6","b7","bl7","bh7","b8","bl8","bh8","b9","bl9","bh9","w0","imul","w1","w2","w3","w4","w5","w6","w7","w8","w9","w10","w11","w12","w13","w14","w15","w16","w17","w18","bigMulTo","hncarry","jumboMulTo","mulTo","mulf","isNegNum","muln","sqr","isqr","toBitArray","q","iushln","s","carryMask","newCarry","ishln","iushrn","hint","extended","h","mask","maskedWords","ishrn","shln","ushln","shrn","ushrn","imaskn","maskn","isubn","addn","subn","iabs","_ishlnsubmul","_wordDiv","mode","bhi","m","diff","qj","div","divmod","positive","divn","umod","divRound","dm","half","r2","andln","p","modn","egcd","x","y","A","B","C","D","g","isEven","yp","xp","im","isOdd","jm","gcd","_invmp","x1","x2","delta","cmpn","invm","bincn","ucmp","gtn","gt","gten","ltn","lten","lte","eqn","Red","toRed","ctx","convertTo","_forceRed","fromRed","convertFrom","forceRed","redAdd","redIAdd","redSub","redISub","redShl","shl","redMul","_verify2","redIMul","redSqr","_verify1","redISqr","redSqrt","sqrt","redInvm","redNeg","redPow","primes","k256","p224","p192","p25519","MPrime","n","tmp","_tmp","K256","P224","P192","P25519","prime","_prime","Mont","imod","rinv","minv","ireduce","rlen","imulK","strip","input","output","outLen","prev","next","mod3","one","nOne","lpow","z","inv","wnd","current","currentLen","mont","u","__importDefault","__esModule","default","rustEnum","vecU8","tagged","vec","bool","option","publicKey","i256","u256","i128","u128","u64","i32","i16","i8","buffer_layout_1","web3_js_1","require$$1","bn_js_1","require$$2","buffer_layout_2","enumerable","get","BNLayout","signed","i64","WrappedLayout","decoder","encoder","PublicKey","key","OptionLayout","decodeBool","encodeBool","data","wrappedLayout","receivedTag","variants","discriminant","unionLayout","MapEntryLayout","keyLayout","valueLayout","keyBytes","Map","entries","CompressedProofLayout","PackedTokenTransferOutputDataLayout","InputTokenDataWithContextLayout","DelegatedTransferLayout","CpiContextLayout","CompressedTokenInstructionDataTransferLayout","mintToLayout","batchCompressLayout","compressSplTokenAccountInstructionDataLayout","encodeMintToInstructionData","buffer","alloc","recipients","amounts","concat","Uint8Array","subarray","encodeBatchCompressInstructionData","lengthBuffer","dataBuffer","encodeCompressSplTokenAccountInstructionData","remainingAmount","cpiContext","encodeTransferInstructionData","createTokenPoolAccountsLayout","feePayer","systemProgram","cpiAuthorityPda","addTokenPoolAccountsLayout","existingTokenPoolPda","mintToAccountsLayout","defaultPubkey","programId","authority","lightSystemProgram","registeredProgramPda","noopProgram","accountCompressionAuthority","accountCompressionProgram","merkleTree","selfProgram","solPoolPda","transferAccountsLayout","compressOrDecompressTokenAccount","approveAccountsLayout","revokeAccountsLayout","freezeAccountsLayout","thawAccountsLayout","CompressedTokenInstructionDataApproveLayout","CompressedTokenInstructionDataRevokeLayout","emptyProof","fill","isEmptyProof","proof","encodeApproveInstructionData","proofOption","encodeRevokeInstructionData","sumUpTokenAmount","validateSameTokenOwner","parseTokenData","currentOwner","parseMaybeDelegatedTransfer","inputs","outputs","delegatedAccountsIndex","findIndex","delegatedTransfer","delegateChangeAccountIndex","createTransferOutputState","toAddress","inputAmount","inputLamports","sumUpLamports","changeAmount","validateSufficientBalance","validateSameOwner","createDecompressOutputState","setProgramId","deriveTokenPoolPda","seeds","findProgramAddressSync","findTokenPoolIndexAndBump","poolPda","derivedPda","deriveCpiAuthorityPda","createMint","freezeAuthority","decimals","rentExemptBalance","tokenProgramId","mintSize","TOKEN_PROGRAM_ID","SystemProgram","createAccount","fromPubkey","newAccountPubkey","space","MINT_SIZE","createInitializeMint2Instruction","createTokenPool","keys","TransactionInstruction","addTokenPool","mintTo","toPubkey","systemKeys","defaultStaticAccountsStruct","toPubkeys","LightSystemProgram","approveAndMintTo","authorityTokenAccount","amountBigInt","BigInt","createMintToInstruction","compress","payer","source","transfer","recentValidityProof","recentInputStateRootIndices","outputCompressedAccounts","compressOrDecompressAmount","isCompress","lamportsChangeAccountMerkleTreeIndex","createTokenProgramLookupTable","mints","recentSlot","allKeys","ComputeBudgetProgram","defaultTestStateTreeAccounts","nullifierQueue","addressTree","addressQueue","TOKEN_2022_PROGRAM_ID","seen","Set","dedupedKeys","keyStr","has","createInstruction","lookupTableAddress","AddressLookupTableProgram","createLookupTable","instructions","chunk","extendIx","extendLookupTable","lookupTable","addresses","amountArray","toAddressArray","pubkeys","amt","amountBN","decompress","tokenPoolInfos","tokenPoolInfosArray","mergeTokenAccounts","compressSplTokenAccount","tokenAccount","getMintProgramId","connection","getAccountInfo","approve","CHANGE_INDEX","delegatedAmount","delegateMerkleTreeIndex","changeAccountMerkleTreeIndex","delegateLamports","revoke","outputAccountMerkleTreeIndex","COMPRESSED_MINT_SEED","findMintAddress","mintSigner","COMPRESSED_TOKEN_PROGRAM_ID","version","docs","isMut","args","type","isOptional","defined","types","kind","errors","code","numMaxAdditionalPools","confirmOptions","uninitializedIndices","blockhash","getLatestBlockhash","tx","buildAndSignTx","sendAndConfirmTx","getCompressedTokenAccountsByOwner","inputAccounts","items","getValidityProofV0","hash","ix","compressedProof","additionalSigners","dedupeSigner","signedTx","setComputeUnitLimit","units","selectStateTreeInfo","getStateTreeInfos","getOrCreateAssociatedTokenAccount","ixs","sourceTokenAccount","compressIx","blockhashCtx","mintAuthority","keypair","Keypair","generate","getMinimumBalanceForRentExemption","resolvedTokenProgramId","signer","txId","transactionSignature","additionalAccounts","getSlot","txIds","instruction","selectedTokenPoolInfos","getCompressedTokenAccountsByDelegate","tokenPoolInfosToUse","mintSeed","addressTreeInfo","deriveAddressV2","toBytes","batch","getValidityProof","batchInstructions","checkOwner","some","checkIsDelegated","totalLamports"],"mappings":"syqBACa,MAAAA,GAAYC,EAAOC,KAAK,QAExBC,GAAqBF,EAAOC,KAAK,iBAIjCE,GAAkCH,EAAOC,KAAK,CACvD,GAAI,IAAK,GAAI,IAAK,IAAK,IAAK,IAAK,MAExBG,GAAwBJ,EAAOC,KAAK,CAC7C,IAAK,GAAI,GAAI,IAAK,GAAI,IAAK,IAAK,MAEvBI,GAA+BL,EAAOC,KAAK,CACpD,GAAI,IAAK,IAAK,GAAI,IAAK,GAAI,IAAK,MAEvBK,GAAyBN,EAAOC,KAAK,CAC9C,IAAK,GAAI,IAAK,IAAK,IAAK,EAAG,GAAI,MAEtBM,GAA2CP,EAAOC,KAAK,CAChE,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,KAG1BO,GAAwBR,EAAOC,KAAK,CAC7C,GAAI,GAAI,IAAK,GAAI,IAAK,IAAK,GAAI,KAEtBQ,GAAuBT,EAAOC,KAAK,CAC5C,IAAK,GAAI,GAAI,GAAI,IAAK,IAAK,GAAI,MAEtBS,GAA+BV,EAAOC,KAAK,CACpD,IAAK,IAAK,IAAK,GAAI,GAAI,IAAK,EAAG,MClBnB,SAAAU,GACZC,EACAC,GAEA,IAAKD,EAAcC,KAAKC,OAAOD,GAC3B,MAAM,IAAIE,MAAM,oDAGpB,IAAKH,EAAcI,cACf,MAAM,IAAID,MACN,iFAAiFF,EAAKI,qCAG9F,OAAO,CACX,CAUOC,eAAeC,GAClBC,EACAP,EACAQ,GAEA,MAAMC,EAAoBC,MAAMtB,KAAK,CAAEuB,OAAQ,IAAK,CAACC,EAAGC,IACpDC,GAAuBC,4BAA4Bf,EAAMa,KAGvDG,QAAqBT,EAAIU,wBAC3BR,EAAkBS,KAAIC,GAAkBA,EAAe,KACvDX,GAGJ,GAAwB,OAApBQ,EAAa,GACb,MAAM,IAAId,MACN,wEAAwEF,EAAKI,qCAIrF,MAAMgB,EAAcX,EAAkBS,KAAI,CAACC,EAAgBN,IACvDG,EAAaH,GACPQ,gBACIF,EAAe,GACfH,EAAaH,GACbG,EAAaH,GAAGS,OAEpB,OAGJC,EAAeP,EAAa,GAAGM,MACrC,OAAOF,EAAYF,KAAI,CAACM,EAAYX,IAC3BW,EAaE,CACHxB,OACAyB,aAAcD,EAAWE,QACzBH,eACAI,cAAUC,EACVC,QAASC,EAAAA,GAAGN,EAAWO,OAAOC,YAC9B7B,cAAe,EACf8B,UAAWpB,EACXqB,KAAMzB,EAAkBI,GAAG,IApBpB,CACHb,OACAyB,aAAchB,EAAkBI,GAAG,GACnCU,eACAI,cAAUC,EACVC,QAASC,EAAEA,GAAC,GACZ3B,cAAe,EACf8B,UAAWpB,EACXqB,KAAMzB,EAAkBI,GAAG,KAe3C,CAqDA,IAAYsB,GAAAA,QAIXA,YAAA,GAJWA,GAAAA,iBAAAA,QAAAA,OAIX,CAAA,IAHGA,GAAA,SAAA,GAAA,WACAA,GAAAA,GAAA,WAAA,GAAA,aACAA,GAAAA,GAAA,SAAA,GAAA,WAMJ,MAAMC,GAAmBC,IACrB,IAAK,IAAIxB,EAAIwB,EAAM1B,OAAS,EAAGE,EAAI,EAAGA,IAAK,CACvC,MAAMyB,EAAIC,KAAKC,MAAMD,KAAKE,UAAY5B,EAAI,KACzCwB,EAAMxB,GAAIwB,EAAMC,IAAM,CAACD,EAAMC,GAAID,EAAMxB,GAC3C,CACD,OAAOwB,CAAK,EAaV,SAAUK,GAAoBC,GAChC,MAGMC,EAHgBR,GAAaO,GAGCE,QAAOC,GAAQA,EAAK3C,gBAExD,GAA6B,IAAzByC,EAAcjC,OACd,MAAM,IAAIT,MACN,yDAKR,OAAO0C,EAAc,EACzB,CAcgB,SAAAG,GACZJ,EACAK,GAEA,GAAqB,IAAjBL,EAAMhC,OACN,MAAM,IAAIT,MAAM,6CAKpB,MAAM+C,GAFNN,EAAQP,GAAaO,IAEeO,MAAKJ,GACrCA,EAAKjB,QAAQsB,IAAIrB,EAAAA,GAAGkB,GAAkBI,IAAItB,EAAEA,GAAC,QASjD,IALAa,EAAQA,EACHE,QAAOC,GAAQA,EAAK3C,gBACpBkD,MAAK,CAACC,EAAGC,IAAMD,EAAErB,UAAYsB,EAAEtB,aAENuB,OAAMV,GAAQA,EAAKjB,QAAQ4B,WAErD,MAAM,IAAIvD,MACN,mFAKR,OAAO+C,EAAwB,CAACA,GAAyBN,CAC7D,CChOO,MAAMe,GACT,kDAmBE,SAAUC,GACZC,EACAC,EACAC,EAAoB,GAQpB,MAAMC,EAAaH,EAASV,MAAKc,GAC7BA,EAAQC,OAAOlC,OAAOmC,GAAGL,KAE7B,OAAIE,EACO,CACH,CAACA,GACDA,EAAWE,OAAOlC,OAClBgC,EAAWI,kBAAkBC,SAC7BL,EAAWE,OAAOlC,QAKnBsC,GACHT,EACAC,EACAC,EAER,CAgDM,SAAUO,GACZT,EACAU,EACAR,EAAoB,GAOpB,MACIS,EACAC,EACAC,EACAC,GACAC,GACAf,EACAU,EACAR,GAGJ,GAAIU,EAAkBI,GAAG9C,KAAGwC,IAAkB,CAC1C,MAAMO,EAAejB,EAASkB,QAC1B,CAACC,EAAKf,IAAYe,EAAIC,IAAIhB,EAAQC,OAAOlC,SACzCD,EAAAA,GAAG,IAEP,MAAIyC,EAAiB5D,QAAUmD,EACrB,IAAI5D,MACN,+BAA+BwE,EAAkB1C,eAAe8B,+CAAuDe,EAAa7C,eAAe4B,EAASjD,wEAG1J,IAAIT,MACN,gDAAgDoE,EAAetC,0BAA0B6C,EAAa7C,cAGjH,CAED,GAAgC,IAA5BuC,EAAiB5D,OACjB,MAAM,IAAIT,MAAMwD,IAGpB,MAAO,CACHa,EACAC,EACAC,EACAC,EAER,CAOM,SAAUC,GACZf,EACAU,EACAR,EAAoB,GAOpB,GAAwB,IAApBF,EAASjD,OACT,MAAM,IAAIT,MAAMwD,IAGpB,IAAIc,EAAoB1C,KAAG,GACvB2C,EAAsB3C,KAAG,GACzB4C,EAAoB5C,KAAG,GAE3B,MAAMyC,EAAyC,GAE/CX,EAASP,MAAK,CAACC,EAAGC,IAAMA,EAAEU,OAAOlC,OAAOkD,IAAI3B,EAAEW,OAAOlC,UAErD,IAAK,MAAMiC,KAAWJ,EAAU,CAC5B,GAAIW,EAAiB5D,QAAUmD,EAAW,MAC1C,GAAIU,EAAkBrB,IAAIrB,EAAEA,GAACwC,IAAkB,MAG1CN,EAAQC,OAAOlC,OAAO0B,UACtBO,EAAQG,kBAAkBC,SAASX,WAEpCe,EAAoBA,EAAkBQ,IAAIhB,EAAQC,OAAOlC,QACzD0C,EAAsBA,EAAoBO,IACtChB,EAAQG,kBAAkBC,UAE9BG,EAAiBW,KAAKlB,GAE7B,CAaD,GAVAU,EAAoBd,EACfuB,MAAM,EAAGrB,GACTgB,QAAO,CAACM,EAAOpB,IAAYoB,EAAMJ,IAAIhB,EAAQC,OAAOlC,SAASD,KAAG,IAEjE0C,EAAkBI,GAAG9C,KAAGwC,KACxBe,QAAQC,IACJ,iDAAiDhB,EAAetC,sCAAsC0C,EAAkB1C,eAIhG,IAA5BuC,EAAiB5D,OACjB,MAAM,IAAIT,MAAMwD,IAGpB,MAAO,CACHa,EACAC,EACAC,EACAC,EAER,CA+FM,SAAUa,GACZ3B,EACAU,EACAR,EAAoB,GAOpB,GAAwB,IAApBF,EAASjD,OACT,MAAM,IAAIT,MAAMwD,IAGpB,IAAIc,EAAoB1C,KAAG,GACvB2C,EAAsB3C,KAAG,GAE7B,MAAMyC,EAAyC,GAGzCiB,EAAkB5B,EAASf,QAC7BmB,IACKA,EAAQC,OAAOlC,OAAO0B,WACtBO,EAAQG,kBAAkBC,SAASX,WAG5C+B,EAAgBnC,MAAK,CAACC,EAAGC,IAAMA,EAAEU,OAAOlC,OAAOkD,IAAI3B,EAAEW,OAAOlC,UAE5D,IAAK,MAAMiC,KAAWwB,EAAiB,CACnC,GAAIjB,EAAiB5D,QAAUmD,EAAW,MAO1C,GANAU,EAAoBA,EAAkBQ,IAAIhB,EAAQC,OAAOlC,QACzD0C,EAAsBA,EAAoBO,IACtChB,EAAQG,kBAAkBC,UAE9BG,EAAiBW,KAAKlB,GAElBQ,EAAkBrB,IAAIrB,KAAGwC,IAAkB,CAE3C,MAAMmB,EAAoBD,EAAgBL,MACtCZ,EAAiB5D,QAErB,GAAI8E,EAAkB9E,OAAS,EAAG,CAC9B,MAAM+E,EAAkBD,EAAkBX,QAAO,CAACa,EAAKZ,IACnDA,EAAId,OAAOlC,OAAO6C,GAAGe,EAAI1B,OAAOlC,QAAUgD,EAAMY,IAEhDpB,EAAiB5D,OAASmD,IAC1BS,EAAiBW,KAAKQ,GACtBlB,EAAoBA,EAAkBQ,IAClCU,EAAgBzB,OAAOlC,QAE3B0C,EAAsBA,EAAoBO,IACtCU,EAAgBvB,kBAAkBC,UAG7C,CACD,KACH,CACJ,CAED,MAAMM,EAAoBc,EACrBL,MAAM,EAAGrB,GACTgB,QAAO,CAACc,EAAK5B,IAAY4B,EAAIZ,IAAIhB,EAAQC,OAAOlC,SAASD,KAAG,IAEjE,GAAgC,IAA5ByC,EAAiB5D,OACjB,MAAM,IAAIT,MAAMwD,IAGpB,MAAO,CACHa,EACAC,EACAC,EACAC,EAER,CCxVM,SAAUmB,GACZC,GAMA,MAAMC,6BACFA,EAA4BC,oBAC5BA,EAAmBP,kBACnBA,EAAoB,GAAEQ,YACtBA,EAAWC,qBACXA,GACAJ,EAEEK,EAAqBV,EAAkBN,QAC7C,IAAIiB,EAA+B,KAG/BL,EAA6BpF,OAAS,GACtCoF,EAA6B,GAAG9B,OAAOoC,WAEvCD,EAAgBE,EAAaA,cACzBH,EACAJ,EAA6B,GAAG9B,OAAOoC,WAI/C,MAAME,EAAoD,GAgC1D,GA9BAR,EAA6BS,SACzB,CAACxC,EAA6ByC,KAC1B,MAAMC,EAAwBJ,EAAAA,cAC1BH,EACAnC,EAAQG,kBAAkBwC,SAASC,MAGjCC,EAAmBP,EAAAA,cACrBH,EACAnC,EAAQG,kBAAkBwC,SAASG,OAGvCP,EAAqBrB,KAAK,CACtBnD,OAAQiC,EAAQC,OAAOlC,OACvBqE,gBACAW,cAAe,CACXL,wBACAG,mBACAG,UAAWhD,EAAQG,kBAAkB6C,UACrCC,aAAcjD,EAAQG,kBAAkB8C,cAE5CC,UAAWjB,EAAYQ,GACvBrC,SAAUJ,EAAQG,kBAAkBC,SAASF,GAAGpC,EAAAA,GAAG,IAC7C,KACAkC,EAAQG,kBAAkBC,SAChC+C,IAAK,MACP,IAINpB,EAA6BpF,OAAS,GAAKqF,EAC3C,MAAM,IAAI9F,MACN,8DAIR,IAAIyG,EACJ,GAAIZ,EAA6BpF,OAAS,EACtCgG,EAAWZ,EAA6B,GAAG5B,kBAAkBwC,aAC1D,KAAIX,EAGP,MAAM,IAAI9F,MACN,gEAHJyG,EAAWX,CAKd,CAID,MAAMoB,EAAiBT,EAASU,cAAgBV,EAChD,IAAIW,EAAoBF,EAAeR,KAEvC,GAAIQ,EAAeG,WAAaC,EAAQA,SAACC,QAAS,CAC9C,IAAIC,EAAAA,aAAaC,OAEV,MAAM,IAAIzH,MAAM,kCADnBoH,EAAoBF,EAAeN,KAE1C,CAGD,MAAMc,EAA+BC,EAAyBA,0BAC1DP,EACApB,EAAqBvF,QAEnBmH,EAAyD,GAC/DF,EAA6BpB,SAAQ,CAACxC,EAASyC,WAC3C,MAAMsB,EAAkBzB,EAAAA,cAAcH,EAAoBnC,GAC1D8D,EAAsB5C,KAAK,CACvB5D,MAAO4E,EAAqBO,GAAOnF,MACnCS,OAAQmE,EAAqBO,GAAO1E,OACpCqC,UAA8C,QAApC4D,EAAA9B,EAAqBO,GAAOrC,gBAAQ,IAAA4D,OAAA,EAAAA,EAAE9D,GAAGpC,EAAAA,GAAG,KAChD,KACAoE,EAAqBO,GAAOrC,SAClC2D,kBACAZ,IAAK,MACP,IAGN,MAAMc,EAAwB9B,EAAmBjF,KAC5C8C,IAA0B,CACvBkE,OAAQlE,EACRmE,WAAY,EACZC,SAAU,MAIlB,MAAO,CACHC,0BAA2B9B,EAC3B0B,wBACAH,wBAER,CCpJgB,SAAAQ,GACZC,EACAvI,GAEA,IACKuI,EAAwB/E,OAAMQ,GAC3BA,EAAQC,OAAOjE,KAAKC,OAAOD,KAG/B,MAAM,IAAIE,MAAM,mDAGpB,OAAO,CACX,wmBC+HA,MAAMsI,GACJ,WAAAC,CAAYC,EAAMC,GAChB,IAAKC,OAAOC,UAAUH,GACpB,MAAM,IAAII,UAAU,2BAYtBC,KAAKL,KAAOA,EAUZK,KAAKJ,SAAWA,CACjB,CAiBD,qBAAAK,GACE,MAAO,EACR,CAcD,MAAAC,CAAO1F,EAAG2F,GACR,MAAM,IAAIhJ,MAAM,qBACjB,CAwBD,MAAAiJ,CAAOC,EAAK7F,EAAG2F,GACb,MAAM,IAAIhJ,MAAM,qBACjB,CAkBD,OAAAmJ,CAAQ9F,EAAG2F,GACT,GAAI,EAAIH,KAAKL,KACX,MAAM,IAAIY,WAAW,sBAEvB,OAAOP,KAAKL,IACb,CAkBD,SAAAa,CAAUZ,GACR,MAAMa,EAAKC,OAAOC,OAAOX,KAAKN,YAAYkB,WAG1C,OAFAF,OAAOG,OAAOJ,EAAIT,MAClBS,EAAGb,SAAWA,EACPa,CACR,CAsBD,SAAAK,CAAUC,GAET,EASH,SAASC,GAAiBC,EAAMC,GAC9B,OAAIA,EAAGtB,SACEqB,EAAO,IAAMC,EAAGtB,SAAW,IAE7BqB,CACT,CAZcE,GAAA1B,OAAGA,GAaO0B,GAAAH,iBAAGA,GA0DEG,GAAAC,sBA7B7B,SAA+BC,EAAOC,GACpC,GAAI,mBAAsBD,EACxB,MAAM,IAAItB,UAAU,6BAEtB,GAAIsB,EAAME,eAAe,WACvB,MAAM,IAAIpK,MAAM,sCAElB,KAAMmK,GAAWA,aAAkB7B,IACjC,MAAM,IAAIM,UAAU,2BAEtB,GAAIuB,EAAOC,eAAe,qBACxB,MAAM,IAAIpK,MAAM,4CAElBkK,EAAMG,QAAUF,EAChBA,EAAOG,kBAAoBJ,EAC3BC,EAAOrB,sBAAqB,IAAU,IAAIoB,EAC1CX,OAAOgB,eAAeL,EAAMT,UAAW,SAAU,CAC/Ce,MAAO,SAASnH,EAAG2F,GACjB,OAAOmB,EAAOlB,OAAOJ,KAAMxF,EAAG2F,EAC/B,EACDyB,SAAU,IAEZlB,OAAOgB,eAAeL,EAAO,SAAU,CACrCM,MAAO,SAASnH,EAAG2F,GACjB,OAAOmB,EAAOpB,OAAO1F,EAAG2F,EACzB,EACDyB,SAAU,GAEd,EAwBA,MAAMC,WAAuBpC,GAY3B,OAAAqC,GACE,MAAM,IAAI3K,MAAM,6BACjB,EAkBH,MAAM4K,WAAoBF,GACxB,WAAAnC,CAAYsC,EAAapC,GAIvB,QAHI/G,IAAcmJ,IAChBA,EAAc,IAEVnC,OAAOC,UAAUkC,IAAkB,GAAKA,EAC5C,MAAM,IAAIjC,UAAU,4CAEtBkC,OAAO,EAAGrC,GAKVI,KAAKgC,YAAcA,CACpB,CAGD,OAAAF,GACE,OAAO,CACR,CAGD,MAAA5B,CAAO1F,EAAG2F,QACJtH,IAAcsH,IAChBA,EAAS,GAEX,MAAM+B,EAAM1H,EAAE5C,OAASuI,EACvB,OAAO3G,KAAKC,MAAMyI,EAAMlC,KAAKgC,YAC9B,CAGD,MAAA5B,CAAOC,EAAK7F,EAAG2F,GACb,OAAO,CACR,EAuBH,MAAMgC,WAAqBN,GACzB,WAAAnC,CAAY4B,EAAQnB,EAAQP,GAC1B,KAAM0B,aAAkB7B,IACtB,MAAM,IAAIM,UAAU,2BAGtB,QAAIlH,IAAcsH,EAChBA,EAAS,OACJ,IAAKN,OAAOC,UAAUK,GAC3B,MAAM,IAAIJ,UAAU,uCAGtBkC,MAAMX,EAAO3B,KAAMC,GAAY0B,EAAO1B,UAGtCI,KAAKsB,OAASA,EAQdtB,KAAKG,OAASA,CACf,CAGD,OAAA2B,GACE,OAAS9B,KAAKsB,kBAAkBc,IACpBpC,KAAKsB,kBAAkBe,EACpC,CAGD,MAAAnC,CAAO1F,EAAG2F,GAIR,YAHItH,IAAcsH,IAChBA,EAAS,GAEJH,KAAKsB,OAAOpB,OAAO1F,EAAG2F,EAASH,KAAKG,OAC5C,CAGD,MAAAC,CAAOC,EAAK7F,EAAG2F,GAIb,YAHItH,IAAcsH,IAChBA,EAAS,GAEJH,KAAKsB,OAAOlB,OAAOC,EAAK7F,EAAG2F,EAASH,KAAKG,OACjD,EAmBH,MAAMiC,WAAa3C,GACjB,WAAAC,CAAYC,EAAMC,GAEhB,GADAqC,MAAMtC,EAAMC,GACR,EAAII,KAAKL,KACX,MAAM,IAAIY,WAAW,+BAExB,CAGD,MAAAL,CAAO1F,EAAG2F,GAIR,YAHItH,IAAcsH,IAChBA,EAAS,GAEJ3F,EAAE8H,WAAWnC,EAAQH,KAAKL,KAClC,CAGD,MAAAS,CAAOC,EAAK7F,EAAG2F,GAKb,YAJItH,IAAcsH,IAChBA,EAAS,GAEX3F,EAAE+H,YAAYlC,EAAKF,EAAQH,KAAKL,MACzBK,KAAKL,IACb,EAmBH,MAAM0C,WAAe5C,GACnB,WAAAC,CAAYC,EAAMC,GAEhB,GADAqC,MAAOtC,EAAMC,GACT,EAAII,KAAKL,KACX,MAAM,IAAIY,WAAW,+BAExB,CAGD,MAAAL,CAAO1F,EAAG2F,GAIR,YAHItH,IAAcsH,IAChBA,EAAS,GAEJ3F,EAAEgI,WAAWrC,EAAQH,KAAKL,KAClC,CAGD,MAAAS,CAAOC,EAAK7F,EAAG2F,GAKb,YAJItH,IAAcsH,IAChBA,EAAS,GAEX3F,EAAEiI,YAAYpC,EAAKF,EAAQH,KAAKL,MACzBK,KAAKL,IACb,EAmBH,MAAM+C,WAAYjD,GAChB,WAAAC,CAAYC,EAAMC,GAEhB,GADAqC,MAAMtC,EAAMC,GACR,EAAII,KAAKL,KACX,MAAM,IAAIY,WAAW,+BAExB,CAGD,MAAAL,CAAO1F,EAAG2F,GAIR,YAHItH,IAAcsH,IAChBA,EAAS,GAEJ3F,EAAEmI,UAAUxC,EAAQH,KAAKL,KACjC,CAGD,MAAAS,CAAOC,EAAK7F,EAAG2F,GAKb,YAJItH,IAAcsH,IAChBA,EAAS,GAEX3F,EAAEoI,WAAWvC,EAAKF,EAAQH,KAAKL,MACxBK,KAAKL,IACb,EAmBH,MAAMkD,WAAcpD,GAClB,WAAAC,CAAYC,EAAMC,GAEhB,GADAqC,MAAMtC,EAAMC,GACR,EAAII,KAAKL,KACX,MAAM,IAAIY,WAAW,+BAExB,CAGD,MAAAL,CAAO1F,EAAG2F,GAIR,YAHItH,IAAcsH,IAChBA,EAAS,GAEJ3F,EAAEsI,UAAU3C,EAAQH,KAAKL,KACjC,CAGD,MAAAS,CAAOC,EAAK7F,EAAG2F,GAKb,YAJItH,IAAcsH,IAChBA,EAAS,GAEX3F,EAAEuI,WAAW1C,EAAKF,EAAQH,KAAKL,MACxBK,KAAKL,IACb,EAGH,MAAMqD,GAAQxJ,KAAKyJ,IAAI,EAAG,IAI1B,SAASC,GAAY7C,GACnB,MAAM8C,EAAO3J,KAAKC,MAAM4G,EAAM2C,IAE9B,MAAO,CAACG,OAAMC,KADD/C,EAAO8C,EAAOH,GAE7B,CAEA,SAASK,GAAaF,EAAMC,GAC1B,OAAOD,EAAOH,GAAQI,CACxB,CAaA,MAAME,WAAmB7D,GACvB,WAAAC,CAAYE,GACVqC,MAAM,EAAGrC,EACV,CAGD,MAAAM,CAAO1F,EAAG2F,QACJtH,IAAcsH,IAChBA,EAAS,GAEX,MAAMiD,EAAO5I,EAAE+I,aAAapD,GAE5B,OAAOkD,GADM7I,EAAE+I,aAAapD,EAAS,GACXiD,EAC3B,CAGD,MAAAhD,CAAOC,EAAK7F,EAAG2F,QACTtH,IAAcsH,IAChBA,EAAS,GAEX,MAAMqD,EAAQN,GAAY7C,GAG1B,OAFA7F,EAAEiJ,cAAcD,EAAMJ,KAAMjD,GAC5B3F,EAAEiJ,cAAcD,EAAML,KAAMhD,EAAS,GAC9B,CACR,EAcH,MAAMuD,WAAqBjE,GACzB,WAAAC,CAAYE,GACVqC,MAAM,EAAGrC,EACV,CAGD,MAAAM,CAAO1F,EAAG2F,GAMR,YALItH,IAAcsH,IAChBA,EAAS,GAIJkD,GAFM7I,EAAEmJ,aAAaxD,GACf3F,EAAEmJ,aAAaxD,EAAS,GAEtC,CAGD,MAAAC,CAAOC,EAAK7F,EAAG2F,QACTtH,IAAcsH,IAChBA,EAAS,GAEX,MAAMqD,EAAQN,GAAY7C,GAG1B,OAFA7F,EAAEoJ,cAAcJ,EAAML,KAAMhD,GAC5B3F,EAAEoJ,cAAcJ,EAAMJ,KAAMjD,EAAS,GAC9B,CACR,EAcH,MAAM0D,WAAkBpE,GACtB,WAAAC,CAAYE,GACVqC,MAAM,EAAGrC,EACV,CAGD,MAAAM,CAAO1F,EAAG2F,QACJtH,IAAcsH,IAChBA,EAAS,GAEX,MAAMiD,EAAO5I,EAAE+I,aAAapD,GAE5B,OAAOkD,GADM7I,EAAEsJ,YAAY3D,EAAS,GACViD,EAC3B,CAGD,MAAAhD,CAAOC,EAAK7F,EAAG2F,QACTtH,IAAcsH,IAChBA,EAAS,GAEX,MAAMqD,EAAQN,GAAY7C,GAG1B,OAFA7F,EAAEiJ,cAAcD,EAAMJ,KAAMjD,GAC5B3F,EAAEuJ,aAAaP,EAAML,KAAMhD,EAAS,GAC7B,CACR,EAcH,MAAM6D,WAAoBvE,GACxB,WAAAC,CAAYE,GACVqC,MAAM,EAAGrC,EACV,CAGD,MAAAM,CAAO1F,EAAG2F,GAMR,YALItH,IAAcsH,IAChBA,EAAS,GAIJkD,GAFM7I,EAAEyJ,YAAY9D,GACd3F,EAAEmJ,aAAaxD,EAAS,GAEtC,CAGD,MAAAC,CAAOC,EAAK7F,EAAG2F,QACTtH,IAAcsH,IAChBA,EAAS,GAEX,MAAMqD,EAAQN,GAAY7C,GAG1B,OAFA7F,EAAE0J,aAAaV,EAAML,KAAMhD,GAC3B3F,EAAEoJ,cAAcJ,EAAMJ,KAAMjD,EAAS,GAC9B,CACR,EAaH,MAAMgE,WAAc1E,GAClB,WAAAC,CAAYE,GACVqC,MAAM,EAAGrC,EACV,CAGD,MAAAM,CAAO1F,EAAG2F,GAIR,YAHItH,IAAcsH,IAChBA,EAAS,GAEJ3F,EAAE4J,YAAYjE,EACtB,CAGD,MAAAC,CAAOC,EAAK7F,EAAG2F,GAKb,YAJItH,IAAcsH,IAChBA,EAAS,GAEX3F,EAAE6J,aAAahE,EAAKF,GACb,CACR,EAaH,MAAMmE,WAAgB7E,GACpB,WAAAC,CAAYE,GACVqC,MAAM,EAAGrC,EACV,CAGD,MAAAM,CAAO1F,EAAG2F,GAIR,YAHItH,IAAcsH,IAChBA,EAAS,GAEJ3F,EAAE+J,YAAYpE,EACtB,CAGD,MAAAC,CAAOC,EAAK7F,EAAG2F,GAKb,YAJItH,IAAcsH,IAChBA,EAAS,GAEX3F,EAAEgK,aAAanE,EAAKF,GACb,CACR,EAaH,MAAMsE,WAAehF,GACnB,WAAAC,CAAYE,GACVqC,MAAM,EAAGrC,EACV,CAGD,MAAAM,CAAO1F,EAAG2F,GAIR,YAHItH,IAAcsH,IAChBA,EAAS,GAEJ3F,EAAEkK,aAAavE,EACvB,CAGD,MAAAC,CAAOC,EAAK7F,EAAG2F,GAKb,YAJItH,IAAcsH,IAChBA,EAAS,GAEX3F,EAAEmK,cAActE,EAAKF,GACd,CACR,EAaH,MAAMyE,WAAiBnF,GACrB,WAAAC,CAAYE,GACVqC,MAAM,EAAGrC,EACV,CAGD,MAAAM,CAAO1F,EAAG2F,GAIR,YAHItH,IAAcsH,IAChBA,EAAS,GAEJ3F,EAAEqK,aAAa1E,EACvB,CAGD,MAAAC,CAAOC,EAAK7F,EAAG2F,GAKb,YAJItH,IAAcsH,IAChBA,EAAS,GAEX3F,EAAEsK,cAAczE,EAAKF,GACd,CACR,EAoBH,MAAM4E,WAAiBtF,GACrB,WAAAC,CAAYsF,EAAeC,EAAOrF,GAChC,KAAMoF,aAAyBvF,IAC7B,MAAM,IAAIM,UAAU,kCAEtB,KAAQkF,aAAiBpD,IAAmBoD,EAAMnD,WACxCjC,OAAOC,UAAUmF,IAAW,GAAKA,GACzC,MAAM,IAAIlF,UAAU,4EAGtB,IAAIJ,GAAQ,IACLsF,aAAiBpD,KAChB,EAAImD,EAAcrF,OACxBA,EAAOsF,EAAQD,EAAcrF,MAG/BsC,MAAMtC,EAAMC,GAGZI,KAAKgF,cAAgBA,EAOrBhF,KAAKiF,MAAQA,CACd,CAGD,OAAA3E,CAAQ9F,EAAG2F,GACT,GAAI,GAAKH,KAAKL,KACZ,OAAOK,KAAKL,UAEV9G,IAAcsH,IAChBA,EAAS,GAEX,IAAIR,EAAO,EACPsF,EAAQjF,KAAKiF,MAIjB,GAHIA,aAAiBpD,KACnBoD,EAAQA,EAAM/E,OAAO1F,EAAG2F,IAEtB,EAAIH,KAAKgF,cAAcrF,KACzBA,EAAOsF,EAAQjF,KAAKgF,cAAcrF,SAC7B,CACL,IAAIuF,EAAM,EACV,KAAOA,EAAMD,GACXtF,GAAQK,KAAKgF,cAAc1E,QAAQ9F,EAAG2F,EAASR,KAC7CuF,CAEL,CACD,OAAOvF,CACR,CAGD,MAAAO,CAAO1F,EAAG2F,QACJtH,IAAcsH,IAChBA,EAAS,GAEX,MAAMM,EAAK,GACX,IAAI3I,EAAI,EACJmN,EAAQjF,KAAKiF,MAIjB,IAHIA,aAAiBpD,KACnBoD,EAAQA,EAAM/E,OAAO1F,EAAG2F,IAEnBrI,EAAImN,GACTxE,EAAGtE,KAAK6D,KAAKgF,cAAc9E,OAAO1F,EAAG2F,IACrCA,GAAUH,KAAKgF,cAAc1E,QAAQ9F,EAAG2F,GACxCrI,GAAK,EAEP,OAAO2I,CACR,CAYD,MAAAL,CAAOC,EAAK7F,EAAG2F,QACTtH,IAAcsH,IAChBA,EAAS,GAEX,MAAMgF,EAAMnF,KAAKgF,cACXrF,EAAOU,EAAItE,QAAO,CAAC4D,EAAMyF,IACtBzF,EAAOwF,EAAI/E,OAAOgF,EAAG5K,EAAG2F,EAASR,IACvC,GAIH,OAHIK,KAAKiF,iBAAiBpD,IACxB7B,KAAKiF,MAAM7E,OAAOC,EAAIzI,OAAQ4C,EAAG2F,GAE5BR,CACR,EAmCH,MAAM0F,WAAkB5F,GACtB,WAAAC,CAAY4F,EAAQ1F,EAAU2F,GAC5B,IAAM5N,MAAM6N,QAAQF,KACXA,EAAOvJ,QAAO,CAACC,EAAKoJ,IAAMpJ,GAAQoJ,aAAa3F,IAAS,GAC/D,MAAM,IAAIM,UAAU,4CAEjB,kBAAqBH,QAClB/G,IAAc0M,IACpBA,EAAiB3F,EACjBA,OAAW/G,GAIb,IAAK,MAAM4M,KAAMH,EACf,GAAK,EAAIG,EAAG9F,WACJ9G,IAAc4M,EAAG7F,SACvB,MAAM,IAAIzI,MAAM,wDAIpB,IAAIwI,GAAQ,EACZ,IACEA,EAAO2F,EAAOvJ,QAAO,CAAC4D,EAAM8F,IAAO9F,EAAO8F,EAAGnF,WAAW,EACzD,CAAC,MAAOoF,GACR,CACDzD,MAAMtC,EAAMC,GAYZI,KAAKsF,OAASA,EAWdtF,KAAKuF,iBAAmBA,CACzB,CAGD,OAAAjF,CAAQ9F,EAAG2F,GACT,GAAI,GAAKH,KAAKL,KACZ,OAAOK,KAAKL,UAEV9G,IAAcsH,IAChBA,EAAS,GAEX,IAAIR,EAAO,EACX,IACEA,EAAOK,KAAKsF,OAAOvJ,QAAO,CAAC4D,EAAM8F,KAC/B,MAAME,EAAMF,EAAGnF,QAAQ9F,EAAG2F,GAE1B,OADAA,GAAUwF,EACHhG,EAAOgG,CAAG,GAChB,EACJ,CAAC,MAAOD,GACP,MAAM,IAAInF,WAAW,qBACtB,CACD,OAAOZ,CACR,CAGD,MAAAO,CAAO1F,EAAG2F,QACJtH,IAAcsH,IAChBA,EAAS,GAEX,MAAMyF,EAAO5F,KAAKC,wBAClB,IAAK,MAAMwF,KAAMzF,KAAKsF,OAKpB,QAJIzM,IAAc4M,EAAG7F,WACnBgG,EAAKH,EAAG7F,UAAY6F,EAAGvF,OAAO1F,EAAG2F,IAEnCA,GAAUsF,EAAGnF,QAAQ9F,EAAG2F,GACpBH,KAAKuF,gBACD/K,EAAE5C,SAAWuI,EACnB,MAGJ,OAAOyF,CACR,CAOD,MAAAxF,CAAOC,EAAK7F,EAAG2F,QACTtH,IAAcsH,IAChBA,EAAS,GAEX,MAAM0F,EAAc1F,EACpB,IAAI2F,EAAa,EACbC,EAAY,EAChB,IAAK,MAAMN,KAAMzF,KAAKsF,OAAQ,CAC5B,IAAI3F,EAAO8F,EAAG9F,KAEd,GADAoG,EAAa,EAAIpG,EAAQA,EAAO,OAC5B9G,IAAc4M,EAAG7F,SAAU,CAC7B,MAAMoG,EAAK3F,EAAIoF,EAAG7F,eACd/G,IAAcmN,IAChBD,EAAYN,EAAGrF,OAAO4F,EAAIxL,EAAG2F,GACzB,EAAIR,IAGNA,EAAO8F,EAAGnF,QAAQ9F,EAAG2F,IAG1B,CACD2F,EAAa3F,EACbA,GAAUR,CACX,CAKD,OAAQmG,EAAaC,EAAaF,CACnC,CAGD,SAAA/E,CAAUC,GACR,MAAM6E,EAAO5F,KAAKC,wBAClB,IAAK,MAAMwF,KAAMzF,KAAKsF,YACfzM,IAAc4M,EAAG7F,UACd,EAAImB,EAAOnJ,SACjBgO,EAAKH,EAAG7F,UAAYmB,EAAOkF,SAG/B,OAAOL,CACR,CAUD,SAAAM,CAAUtG,GACR,GAAI,iBAAoBA,EACtB,MAAM,IAAIG,UAAU,2BAEtB,IAAK,MAAM0F,KAAMzF,KAAKsF,OACpB,GAAIG,EAAG7F,WAAaA,EAClB,OAAO6F,CAGZ,CAaD,QAAAU,CAASvG,GACP,GAAI,iBAAoBA,EACtB,MAAM,IAAIG,UAAU,2BAEtB,IAAII,EAAS,EACb,IAAK,MAAMsF,KAAMzF,KAAKsF,OAAQ,CAC5B,GAAIG,EAAG7F,WAAaA,EAClB,OAAOO,EAEL,EAAIsF,EAAG9F,KACTQ,GAAU,EACD,GAAKA,IACdA,GAAUsF,EAAG9F,KAEhB,CACF,EAiBH,MAAMyG,GACJ,WAAA1G,CAAYE,GAKVI,KAAKJ,SAAWA,CACjB,CAMD,MAAAM,GACE,MAAM,IAAI/I,MAAM,iCACjB,CAMD,MAAAiJ,GACE,MAAM,IAAIjJ,MAAM,iCACjB,EAoBH,MAAMkP,WAAiCD,GACrC,WAAA1G,CAAY4B,EAAQ1B,GAClB,KAAO0B,aAAkBO,IAChBP,EAAOQ,WACd,MAAM,IAAI/B,UAAU,qDAGtBkC,MAAMrC,GAAY0B,EAAO1B,UAAY,WAIrCI,KAAKsB,OAASA,CACf,CAGD,MAAApB,CAAO1F,EAAG2F,GACR,OAAOH,KAAKsB,OAAOpB,OAAO1F,EAAG2F,EAC9B,CAGD,MAAAC,CAAOC,EAAK7F,EAAG2F,GACb,OAAOH,KAAKsB,OAAOlB,OAAOC,EAAK7F,EAAG2F,EACnC,EA8DH,MAAMmG,WAAc7G,GAClB,WAAAC,CAAY6G,EAAOC,EAAe5G,GAChC,MAAM6G,EAAQF,aAAiBnE,IAChBmE,aAAiBlE,GAChC,GAAIoE,EACFF,EAAQ,IAAIF,GAAyB,IAAIlE,GAAaoE,SACjD,GAAKA,aAAiB1E,IACf0E,EAAMzE,UAClByE,EAAQ,IAAIF,GAAyBE,QAChC,KAAMA,aAAiBH,IAC5B,MAAM,IAAIrG,UAAU,oEAMtB,QAHIlH,IAAc2N,IAChBA,EAAgB,QAEX,OAASA,GACNA,aAAyB/G,IACjC,MAAM,IAAIM,UAAU,0CAEtB,GAAI,OAASyG,EAAe,CAC1B,GAAI,EAAIA,EAAc7G,KACpB,MAAM,IAAIxI,MAAM,8CAEd0B,IAAc2N,EAAc5G,WAC9B4G,EAAgBA,EAAchG,UAAU,WAE3C,CAMD,IAAIb,GAAQ,EACR6G,IACF7G,EAAO6G,EAAc7G,KAChB,GAAKA,GAAS8G,IACjB9G,GAAQ4G,EAAMjF,OAAO3B,OAGzBsC,MAAMtC,EAAMC,GAUZI,KAAK0G,cAAgBH,EAOrBvG,KAAK2G,wBAA0BF,EAS/BzG,KAAKwG,cAAgBA,EAYrBxG,KAAK4G,SAAW,GAGhB,IAAIC,EAAwB7G,KAAK8G,wBAAwBC,KAAK/G,MAe9DA,KAAKgH,iBAAmB,SAAS3G,GAC/B,OAAOwG,EAAsBxG,EACnC,EAeIL,KAAKiH,uBAAyB,SAASC,GACrCL,EAAwBK,EAAIH,KAAK/G,KACvC,CACG,CAGD,OAAAM,CAAQ9F,EAAG2F,GACT,GAAI,GAAKH,KAAKL,KACZ,OAAOK,KAAKL,UAEV9G,IAAcsH,IAChBA,EAAS,GAKX,MAAMgH,EAAMnH,KAAKoH,WAAW5M,EAAG2F,GAC/B,IAAKgH,EACH,MAAM,IAAIhQ,MAAM,qDAElB,OAAOgQ,EAAI7G,QAAQ9F,EAAG2F,EACvB,CA+BD,uBAAA2G,CAAwBzG,GACtB,GAAIA,EAAIkB,eAAevB,KAAK0G,cAAc9G,UAAW,CACnD,GAAII,KAAKwG,eACFnG,EAAIkB,eAAevB,KAAKwG,cAAc5G,UAC3C,OAEF,MAAMuH,EAAMnH,KAAK4G,SAASvG,EAAIL,KAAK0G,cAAc9G,WACjD,GAAIuH,KACMA,EAAI7F,QACHjB,EAAIkB,eAAe4F,EAAIvH,WAChC,OAAOuH,CAEf,MACM,IAAK,MAAME,KAAOrH,KAAK4G,SAAU,CAC/B,MAAMO,EAAMnH,KAAK4G,SAASS,GAC1B,GAAIhH,EAAIkB,eAAe4F,EAAIvH,UACzB,OAAOuH,CAEV,CAEH,MAAM,IAAIhQ,MAAM,8BACjB,CAQD,MAAA+I,CAAO1F,EAAG2F,GAIR,IAAIyF,OAHA/M,IAAcsH,IAChBA,EAAS,GAGX,MAAMmH,EAAMtH,KAAK0G,cACXH,EAAQe,EAAIpH,OAAO1F,EAAG2F,GAC5B,IAAIoH,EAAMvH,KAAK4G,SAASL,GACxB,QAAI1N,IAAc0O,EAAK,CACrB,IAAIC,EAAgB,EACpBD,EAAMvH,KAAKwG,cACPxG,KAAK2G,0BACPa,EAAgBF,EAAIhG,OAAO3B,MAE7BiG,EAAO5F,KAAKC,wBACZ2F,EAAK0B,EAAI1H,UAAY2G,EACrBX,EAAK2B,EAAI3H,UAAYI,KAAKwG,cAActG,OAAO1F,EAAG2F,EAASqH,EACjE,MACM5B,EAAO2B,EAAIrH,OAAO1F,EAAG2F,GAEvB,OAAOyF,CACR,CAQD,MAAAxF,CAAOC,EAAK7F,EAAG2F,QACTtH,IAAcsH,IAChBA,EAAS,GAEX,MAAMgH,EAAMnH,KAAKgH,iBAAiB3G,GAClC,QAAIxH,IAAcsO,EAAK,CACrB,MAAMG,EAAMtH,KAAK0G,cACXa,EAAMvH,KAAKwG,cACjB,IAAIgB,EAAgB,EAKpB,OAJIxH,KAAK2G,0BACPa,EAAgBF,EAAIhG,OAAO3B,MAE7B2H,EAAIlH,OAAOC,EAAIiH,EAAI1H,UAAWpF,EAAG2F,GAC1BqH,EAAgBD,EAAInH,OAAOC,EAAIkH,EAAI3H,UAAWpF,EACnB2F,EAASqH,EAC5C,CACD,OAAOL,EAAI/G,OAAOC,EAAK7F,EAAG2F,EAC3B,CAeD,UAAAsH,CAAWC,EAASpG,EAAQ1B,GAC1B,MAAMa,EAAK,IAAIkH,GAAc3H,KAAM0H,EAASpG,EAAQ1B,GAEpD,OADAI,KAAK4G,SAASc,GAAWjH,EAClBA,CACR,CAgBD,UAAA2G,CAAWQ,EAAIzH,GACb,IAAIuH,EAAUE,EAOd,OANIxR,OAAOyR,SAASD,UACd/O,IAAcsH,IAChBA,EAAS,GAEXuH,EAAU1H,KAAK0G,cAAcxG,OAAO0H,EAAIzH,IAEnCH,KAAK4G,SAASc,EACtB,EAgCH,MAAMC,WAAsBlI,GAC1B,WAAAC,CAAYoI,EAAOJ,EAASpG,EAAQ1B,GAClC,KAAMkI,aAAiBxB,IACrB,MAAM,IAAIvG,UAAU,yBAEtB,IAAMF,OAAOC,UAAU4H,IAAc,EAAIA,EACvC,MAAM,IAAI3H,UAAU,4CAOtB,GALK,iBAAoBuB,QACjBzI,IAAc+G,IACpBA,EAAW0B,EACXA,EAAS,MAEPA,EAAQ,CACV,KAAMA,aAAkB7B,IACtB,MAAM,IAAIM,UAAU,2BAEtB,GAAK,OAAS+H,EAAMtB,eACZ,GAAKlF,EAAO3B,MACZ2B,EAAO3B,KAAOmI,EAAMtB,cAAc7G,KACxC,MAAM,IAAIxI,MAAM,iDAElB,GAAI,iBAAoByI,EACtB,MAAM,IAAIG,UAAU,sCAEvB,CACD,IAAIJ,EAAOmI,EAAMnI,KACb,EAAImI,EAAMnI,OACZA,EAAO2B,EAASA,EAAO3B,KAAO,EACzB,GAAKA,GAASmI,EAAMnB,0BACvBhH,GAAQmI,EAAMpB,cAAcpF,OAAO3B,OAGvCsC,MAAMtC,EAAMC,GAGZI,KAAK8H,MAAQA,EAKb9H,KAAK0H,QAAUA,EAMf1H,KAAKsB,OAASA,GAAU,IACzB,CAGD,OAAAhB,CAAQ9F,EAAG2F,GACT,GAAI,GAAKH,KAAKL,KAGZ,OAAOK,KAAKL,UAEV9G,IAAcsH,IAChBA,EAAS,GAEX,IAAIqH,EAAgB,EAKpB,OAJIxH,KAAK8H,MAAMnB,0BACba,EAAgBxH,KAAK8H,MAAMpB,cAAcpF,OAAO3B,MAG3C6H,EAAgBxH,KAAKsB,OAAOhB,QAAQ9F,EAAG2F,EAASqH,EACxD,CAGD,MAAAtH,CAAO1F,EAAG2F,GACR,MAAMyF,EAAO5F,KAAKC,wBAIlB,QAHIpH,IAAcsH,IAChBA,EAAS,GAEPH,OAASA,KAAK8H,MAAMV,WAAW5M,EAAG2F,GACpC,MAAM,IAAIhJ,MAAM,oBAElB,IAAIqQ,EAAgB,EAWpB,OAVIxH,KAAK8H,MAAMnB,0BACba,EAAgBxH,KAAK8H,MAAMpB,cAAcpF,OAAO3B,MAE9CK,KAAKsB,OACPsE,EAAK5F,KAAKJ,UAAYI,KAAKsB,OAAOpB,OAAO1F,EAAG2F,EAASqH,GAC5CxH,KAAKJ,SACdgG,EAAK5F,KAAKJ,UAAY,EACbI,KAAK8H,MAAMnB,0BACpBf,EAAK5F,KAAK8H,MAAMpB,cAAc9G,UAAYI,KAAK0H,SAE1C9B,CACR,CAGD,MAAAxF,CAAOC,EAAK7F,EAAG2F,QACTtH,IAAcsH,IAChBA,EAAS,GAEX,IAAIqH,EAAgB,EAIpB,GAHIxH,KAAK8H,MAAMnB,0BACba,EAAgBxH,KAAK8H,MAAMpB,cAAcpF,OAAO3B,MAE9CK,KAAKsB,SACAjB,EAAIkB,eAAevB,KAAKJ,UAC/B,MAAM,IAAIG,UAAU,0BAA4BC,KAAKJ,UAEvDI,KAAK8H,MAAMpB,cAActG,OAAOJ,KAAK0H,QAASlN,EAAG2F,GACjD,IAAIR,EAAO6H,EACX,GAAIxH,KAAKsB,SACPtB,KAAKsB,OAAOlB,OAAOC,EAAIL,KAAKJ,UAAWpF,EAAG2F,EAASqH,GACnD7H,GAAQK,KAAKsB,OAAOhB,QAAQ9F,EAAG2F,EAASqH,GACnC,GAAKxH,KAAK8H,MAAMnI,MACbA,EAAOK,KAAK8H,MAAMnI,MACxB,MAAM,IAAIxI,MAAM,6CAGpB,OAAOwI,CACR,CAID,SAAAmB,CAAUC,GACR,GAAIf,KAAKsB,OACP,OAAOtB,KAAKsB,OAAOR,UAAUC,EAEhC,EASH,SAASgH,GAAiB3C,GAIxB,OAHI,EAAIA,IACNA,GAAK,YAEAA,CACT,CAiCA,MAAM4C,WAAqBvI,GACzB,WAAAC,CAAYuI,EAAMC,EAAKtI,GACrB,KAAOqI,aAAgB7F,IACb6F,aAAgB5F,IACxB,MAAM,IAAItC,UAAU,wCAOtB,GALK,iBAAoBmI,QACjBrP,IAAc+G,IACpBA,EAAWsI,EACXA,OAAMrP,GAEJ,EAAIoP,EAAKtI,KACX,MAAM,IAAIY,WAAW,8BAEvB0B,MAAMgG,EAAKtI,KAAMC,GAKjBI,KAAKiI,KAAOA,EASZjI,KAAKkI,MAAQA,EAQblI,KAAKsF,OAAS,GAKd,IAAI3D,EAAQ,EACZ3B,KAAKmI,gBAAkB,SAAS/C,GAE9B,OADAzD,EAAQoG,GAAiB3C,GAClBpF,IACb,EACIA,KAAKoI,gBAAkB,WACrB,OAAOzG,CACb,CACG,CAGD,MAAAzB,CAAO1F,EAAG2F,GACR,MAAMyF,EAAO5F,KAAKC,6BACdpH,IAAcsH,IAChBA,EAAS,GAEX,MAAMwB,EAAQ3B,KAAKiI,KAAK/H,OAAO1F,EAAG2F,GAClCH,KAAKmI,gBAAgBxG,GACrB,IAAK,MAAM8D,KAAMzF,KAAKsF,YAChBzM,IAAc4M,EAAG7F,WACnBgG,EAAKH,EAAG7F,UAAY6F,EAAGvF,OAAOyB,IAGlC,OAAOiE,CACR,CAOD,MAAAxF,CAAOC,EAAK7F,EAAG2F,QACTtH,IAAcsH,IAChBA,EAAS,GAEX,MAAMwB,EAAQ3B,KAAKiI,KAAK/H,OAAO1F,EAAG2F,GAClCH,KAAKmI,gBAAgBxG,GACrB,IAAK,MAAM8D,KAAMzF,KAAKsF,OACpB,QAAIzM,IAAc4M,EAAG7F,SAAU,CAC7B,MAAMoG,EAAK3F,EAAIoF,EAAG7F,eACd/G,IAAcmN,GAChBP,EAAGrF,OAAO4F,EAEb,CAEH,OAAOhG,KAAKiI,KAAK7H,OAAOJ,KAAKoI,kBAAmB5N,EAAG2F,EACpD,CAWD,QAAAkI,CAASC,EAAM1I,GACb,MAAM2I,EAAK,IAAIC,GAASxI,KAAMsI,EAAM1I,GAEpC,OADAI,KAAKsF,OAAOnJ,KAAKoM,GACVA,CACR,CASD,UAAAE,CAAW7I,GAGT,MAAM2I,EAAK,IAAIG,GAAQ1I,KAAMJ,GAE7B,OADAI,KAAKsF,OAAOnJ,KAAKoM,GACVA,CACR,CAUD,QAAAI,CAAS/I,GACP,GAAI,iBAAoBA,EACtB,MAAM,IAAIG,UAAU,2BAEtB,IAAK,MAAM0F,KAAMzF,KAAKsF,OACpB,GAAIG,EAAG7F,WAAaA,EAClB,OAAO6F,CAGZ,EAuBH,MAAM+C,GACJ,WAAA9I,CAAYkJ,EAAWN,EAAM1I,GAC3B,KAAMgJ,aAAqBZ,IACzB,MAAM,IAAIjI,UAAU,oCAEtB,IAAMF,OAAOC,UAAUwI,IAAW,GAAKA,EACrC,MAAM,IAAIvI,UAAU,iCAEtB,MAAM8I,EAAY,EAAID,EAAUjJ,KAC1BmJ,EAAWF,EAAUtD,OAAOvJ,QAAO,CAACgN,EAAKtD,IAAOsD,EAAMtD,EAAG6C,MAAM,GACrE,GAAKA,EAAOQ,EAAYD,EACtB,MAAM,IAAI1R,MAAM,sCACG0R,EAAYC,GAAY,OACzBD,EAAY,YAKhC7I,KAAK4I,UAAYA,EAGjB5I,KAAKsI,KAAOA,EAOZtI,KAAKgJ,WAAa,GAAKV,GAAQ,EAC3B,KAAOA,IACTtI,KAAKgJ,UAAY,YAMnBhJ,KAAKiJ,MAAQH,EACT9I,KAAK4I,UAAUV,MACjBlI,KAAKiJ,MAAQJ,EAAYC,EAAWR,GAKtCtI,KAAKkJ,SAAWnB,GAAiB/H,KAAKgJ,WAAahJ,KAAKiJ,OAYxDjJ,KAAKJ,SAAWA,CACjB,CAID,MAAAM,GAIE,OAFkB6H,GADL/H,KAAK4I,UAAUR,kBACcpI,KAAKkJ,YACnBlJ,KAAKiJ,KAElC,CAOD,MAAA7I,CAAOuB,GACL,IAAM9B,OAAOC,UAAU6B,IACfA,IAAUoG,GAAiBpG,EAAQ3B,KAAKgJ,WAC9C,MAAM,IAAIjJ,UAAUiB,GAAiB,kBAAmBhB,MAClC,wCAA0CA,KAAKgJ,WAEvE,MAAMf,EAAOjI,KAAK4I,UAAUR,kBACtBe,EAAYpB,GAAiBpG,GAAS3B,KAAKiJ,OACjDjJ,KAAK4I,UAAUT,gBAAgBJ,GAAiBE,GAAQjI,KAAKkJ,UAC5BC,EAClC,EAoBH,MAAMT,WAAgBF,GACpB,WAAA9I,CAAYkJ,EAAWhJ,GACrBqC,MAAM2G,EAAW,EAAGhJ,EACrB,CAKD,MAAAM,CAAO1F,EAAG2F,GACR,QAASqI,GAAS5H,UAAUV,OAAOkJ,KAAKpJ,KAAMxF,EAAG2F,EAClD,CAGD,MAAAC,CAAOuB,GAKL,MAJI,kBAAqBA,IAEvBA,GAASA,GAEJ6G,GAAS5H,UAAUR,OAAOgJ,KAAKpJ,KAAM2B,EAC7C,EAkBH,MAAM0H,WAAa5J,GACjB,WAAAC,CAAY9H,EAAQgI,GAClB,KAAQhI,aAAkBiK,IAAmBjK,EAAOkK,WAC1CjC,OAAOC,UAAUlI,IAAY,GAAKA,GAC1C,MAAM,IAAImI,UAAU,yEAItB,IAAIJ,GAAQ,EACN/H,aAAkBiK,KACtBlC,EAAO/H,GAETqK,MAAMtC,EAAMC,GAOZI,KAAKpI,OAASA,CACf,CAGD,OAAA0I,CAAQ9F,EAAG2F,GACT,IAAIR,EAAOK,KAAKL,KAIhB,OAHI,EAAIA,IACNA,EAAOK,KAAKpI,OAAOsI,OAAO1F,EAAG2F,IAExBR,CACR,CAGD,MAAAO,CAAO1F,EAAG2F,QACJtH,IAAcsH,IAChBA,EAAS,GAEX,IAAIR,EAAOK,KAAKL,KAIhB,OAHI,EAAIA,IACNA,EAAOK,KAAKpI,OAAOsI,OAAO1F,EAAG2F,IAExB3F,EAAE4B,MAAM+D,EAAQA,EAASR,EACjC,CAOD,MAAAS,CAAOC,EAAK7F,EAAG2F,GACb,IAAIR,EAAOK,KAAKpI,OAIhB,GAHIoI,KAAKpI,kBAAkBiK,KACzBlC,EAAOU,EAAIzI,SAEPxB,OAAOyR,SAASxH,IACZV,IAASU,EAAIzI,OACrB,MAAM,IAAImI,UAAUiB,GAAiB,cAAehB,MAC9B,qBAAuBL,EAAO,mBAEtD,GAAKQ,EAASR,EAAQnF,EAAE5C,OACtB,MAAM,IAAI2I,WAAW,4BAMvB,OAJA/F,EAAE8O,MAAMjJ,EAAIpH,SAAS,OAAQkH,EAAQR,EAAM,OACvCK,KAAKpI,kBAAkBiK,IACzB7B,KAAKpI,OAAOwI,OAAOT,EAAMnF,EAAG2F,GAEvBR,CACR,EAgBH,MAAM4J,WAAgB9J,GACpB,WAAAC,CAAYE,GACVqC,OAAO,EAAGrC,EACX,CAGD,OAAAU,CAAQ9F,EAAG2F,GACT,IAAK/J,OAAOyR,SAASrN,GACnB,MAAM,IAAIuF,UAAU,2BAElBlH,IAAcsH,IAChBA,EAAS,GAEX,IAAI+E,EAAM/E,EACV,KAAQ+E,EAAM1K,EAAE5C,QAAY,IAAM4C,EAAE0K,IAClCA,GAAO,EAET,OAAO,EAAIA,EAAM/E,CAClB,CAGD,MAAAD,CAAO1F,EAAG2F,EAAQyF,QACZ/M,IAAcsH,IAChBA,EAAS,GAEX,IAAIR,EAAOK,KAAKM,QAAQ9F,EAAG2F,GAC3B,OAAO3F,EAAE4B,MAAM+D,EAAQA,EAASR,EAAO,GAAG1G,SAAS,QACpD,CAGD,MAAAmH,CAAOC,EAAK7F,EAAG2F,QACTtH,IAAcsH,IAChBA,EAAS,GAKP,iBAAoBE,IACtBA,EAAMA,EAAIpH,YAEZ,MAAMuQ,EAAO,IAAIpT,OAAOiK,EAAK,QACvBV,EAAO6J,EAAK5R,OAClB,GAAKuI,EAASR,EAAQnF,EAAE5C,OACtB,MAAM,IAAI2I,WAAW,4BAIvB,OAFAiJ,EAAKC,KAAKjP,EAAG2F,GACb3F,EAAE2F,EAASR,GAAQ,EACZA,EAAO,CACf,EAsBH,MAAM+J,WAAajK,GACjB,WAAAC,CAAYiK,EAAS/J,GAMnB,GALK,iBAAoB+J,QACjB9Q,IAAc+G,IACpBA,EAAW+J,EACXA,OAAU9Q,QAERA,IAAc8Q,EAChBA,GAAW,OACN,IAAK9J,OAAOC,UAAU6J,GAC3B,MAAM,IAAI5J,UAAU,8BAGtBkC,OAAO,EAAGrC,GAUVI,KAAK2J,QAAUA,CAChB,CAGD,OAAArJ,CAAQ9F,EAAG2F,GACT,IAAK/J,OAAOyR,SAASrN,GACnB,MAAM,IAAIuF,UAAU,sBAKtB,YAHIlH,IAAcsH,IAChBA,EAAS,GAEJ3F,EAAE5C,OAASuI,CACnB,CAGD,MAAAD,CAAO1F,EAAG2F,EAAQyF,QACZ/M,IAAcsH,IAChBA,EAAS,GAEX,IAAIR,EAAOK,KAAKM,QAAQ9F,EAAG2F,GAC3B,GAAK,GAAKH,KAAK2J,SACP3J,KAAK2J,QAAUhK,EACrB,MAAM,IAAIY,WAAW,+BAEvB,OAAO/F,EAAE4B,MAAM+D,EAAQA,EAASR,GAAM1G,SAAS,QAChD,CAGD,MAAAmH,CAAOC,EAAK7F,EAAG2F,QACTtH,IAAcsH,IAChBA,EAAS,GAKP,iBAAoBE,IACtBA,EAAMA,EAAIpH,YAEZ,MAAMuQ,EAAO,IAAIpT,OAAOiK,EAAK,QACvBV,EAAO6J,EAAK5R,OAClB,GAAK,GAAKoI,KAAK2J,SACP3J,KAAK2J,QAAUhK,EACrB,MAAM,IAAIY,WAAW,+BAEvB,GAAKJ,EAASR,EAAQnF,EAAE5C,OACtB,MAAM,IAAI2I,WAAW,4BAGvB,OADAiJ,EAAKC,KAAKjP,EAAG2F,GACNR,CACR,EAsBH,MAAMiK,WAAiBnK,GACrB,WAAAC,CAAYiC,EAAO/B,GACjBqC,MAAM,EAAGrC,GAWTI,KAAK2B,MAAQA,CACd,CAGD,MAAAzB,CAAO1F,EAAG2F,EAAQyF,GAChB,OAAO5F,KAAK2B,KACb,CAGD,MAAAvB,CAAOC,EAAK7F,EAAG2F,GAEb,OAAO,CACR,EAGmBgB,GAAAU,eAAGA,GACNV,GAAAY,YAAGA,GACFZ,GAAAgB,aAAGA,GACXhB,GAAAiB,KAAGA,GACDjB,GAAAkB,OAAGA,GACNlB,GAAAuB,IAAGA,GACDvB,GAAA0B,MAAGA,GACH1B,GAAAgD,MAAGA,GACDhD,GAAAmD,QAAGA,GACJnD,GAAAsD,OAAGA,GACDtD,GAAAyD,SAAGA,GACHzD,GAAA4D,SAAGA,GACF5D,GAAAkE,UAAGA,GACMlE,GAAAiF,mBAAGA,GACGjF,GAAAkF,yBAAGA,GACtBlF,GAAAmF,MAAGA,GACKnF,GAAAwG,cAAGA,GACJxG,GAAA6G,aAAGA,GACP7G,GAAAqH,SAAGA,GACJrH,GAAAuH,QAAGA,GACNvH,GAAAkI,KAAGA,GACAlI,GAAAoI,QAAGA,GACNpI,GAAAuI,KAAGA,GACCvI,GAAAyI,SAAGA,GAGnBzI,GAAA0I,OAAkB,CAAC7H,EAAapC,IAAa,IAAImC,GAAYC,EAAapC,GAG1EuB,GAAAhB,OAAc,CAAKmB,EAAQnB,EAAQP,IAAa,IAAIuC,GAAab,EAAQnB,EAAQP,GAIvEuB,GAAA2I,GAAIlK,GAAY,IAAIwC,GAAK,EAAGxC,GAI3BuB,GAAA4I,IAAInK,GAAY,IAAIwC,GAAK,EAAGxC,GAI5BuB,GAAA6I,IAAIpK,GAAY,IAAIwC,GAAK,EAAGxC,GAI5BuB,GAAA8I,IAAIrK,GAAY,IAAIwC,GAAK,EAAGxC,GAI5BuB,GAAA+I,IAAItK,GAAY,IAAIwC,GAAK,EAAGxC,GAI5BuB,GAAAgJ,IAAIvK,GAAY,IAAIwC,GAAK,EAAGxC,GAI3BuB,GAAAiJ,KAAIxK,GAAY,IAAI0D,GAAW1D,GAI9BuB,GAAAkJ,MAAIzK,GAAY,IAAIyC,GAAO,EAAGzC,GAI9BuB,GAAAmJ,MAAI1K,GAAY,IAAIyC,GAAO,EAAGzC,GAI9BuB,GAAAoJ,MAAI3K,GAAY,IAAIyC,GAAO,EAAGzC,GAI9BuB,GAAAqJ,MAAI5K,GAAY,IAAIyC,GAAO,EAAGzC,GAI9BuB,GAAAsJ,MAAI7K,GAAY,IAAIyC,GAAO,EAAGzC,GAI7BuB,GAAAuJ,OAAI9K,GAAY,IAAI8D,GAAa9D,GAIrCuB,GAAAwJ,GAAI/K,GAAY,IAAI8C,GAAI,EAAG9C,GAI1BuB,GAAAyJ,IAAIhL,GAAY,IAAI8C,GAAI,EAAG9C,GAI3BuB,GAAA0J,IAAIjL,GAAY,IAAI8C,GAAI,EAAG9C,GAI3BuB,GAAA2J,IAAIlL,GAAY,IAAI8C,GAAI,EAAG9C,GAI3BuB,GAAA4J,IAAInL,GAAY,IAAI8C,GAAI,EAAG9C,GAI3BuB,GAAA6J,IAAIpL,GAAY,IAAI8C,GAAI,EAAG9C,GAI1BuB,GAAA8J,KAAIrL,GAAY,IAAIiE,GAAUjE,GAI7BuB,GAAA+J,MAAItL,GAAY,IAAIiD,GAAM,EAAGjD,GAI7BuB,GAAAgK,MAAIvL,GAAY,IAAIiD,GAAM,EAAGjD,GAI7BuB,GAAAiK,MAAIxL,GAAY,IAAIiD,GAAM,EAAGjD,GAI7BuB,GAAAkK,MAAIzL,GAAY,IAAIiD,GAAM,EAAGjD,GAI7BuB,GAAAmK,MAAI1L,GAAY,IAAIiD,GAAM,EAAGjD,GAI5BuB,GAAAoK,OAAI3L,GAAY,IAAIoE,GAAYpE,GAGnCuB,GAAAqK,IAAI5L,GAAY,IAAIuE,GAAMvE,GAGxBuB,GAAAsK,MAAI7L,GAAY,IAAI0E,GAAQ1E,GAG9BuB,GAAAuK,IAAI9L,GAAY,IAAI6E,GAAO7E,GAGzBuB,GAAAwK,MAAI/L,GAAY,IAAIgF,GAAShF,GAG1CuB,GAAAyK,OAAc,CAAKtG,EAAQ1F,EAAU2F,IAAmB,IAAIF,GAAUC,EAAQ1F,EAAU2F,GAGxFpE,GAAAmH,KAAY,CAAKL,EAAMC,EAAKtI,IAAa,IAAIoI,GAAaC,EAAMC,EAAKtI,GAGrEuB,GAAA0K,IAAW,CAAK7G,EAAeC,EAAOrF,IAAa,IAAImF,GAASC,EAAeC,EAAOrF,GAGtFuB,GAAA2G,MAAa,CAAKvB,EAAOC,EAAe5G,IAAa,IAAI0G,GAAMC,EAAOC,EAAe5G,GAGrFuB,GAAA2K,yBAAoC,CAACxK,EAAQ1B,IAAa,IAAIyG,GAAyB/E,EAAQ1B,GAG/FuB,GAAA4K,KAAgB,CAACnU,EAAQgI,IAAa,IAAIyJ,GAAKzR,EAAQgI,GAG3CuB,GAAA6K,KAAIpM,GAAY,IAAI2J,GAAQ3J,GAGxCuB,GAAA8K,KAAgB,CAACtC,EAAS/J,IAAa,IAAI8J,GAAKC,EAAS/J,GAGzDuB,GAAA+K,MAAiB,CAACvK,EAAO/B,IAAa,IAAIgK,GAASjI,EAAO/B,kCCvpF1D,SAAWuM,EAAQC,GAIjB,SAASC,EAAQC,EAAKC,GACpB,IAAKD,EAAK,MAAM,IAAInV,MAAMoV,GAAO,mBAClC,CAID,SAASC,EAAUC,EAAMC,GACvBD,EAAKE,OAASD,EACd,IAAIE,EAAW,aACfA,EAAShM,UAAY8L,EAAU9L,UAC/B6L,EAAK7L,UAAY,IAAIgM,EACrBH,EAAK7L,UAAUlB,YAAc+M,CAC9B,CAID,SAASI,EAAIC,EAAQC,EAAMC,GACzB,GAAIH,EAAGI,KAAKH,GACV,OAAOA,EAGT9M,KAAKkN,SAAW,EAChBlN,KAAKmN,MAAQ,KACbnN,KAAKpI,OAAS,EAGdoI,KAAKoN,IAAM,KAEI,OAAXN,IACW,OAATC,GAA0B,OAATA,IACnBC,EAASD,EACTA,EAAO,IAGT/M,KAAKqN,MAAMP,GAAU,EAAGC,GAAQ,GAAIC,GAAU,MAEjD,CAUD,IAAI5W,EATkB,uBACbgW,QAAUS,EAEjBT,EAAQS,GAAKA,EAGfA,EAAGA,GAAKA,EACRA,EAAGS,SAAW,GAGd,IAEIlX,EADoB,oBAAXmX,aAAmD,IAAlBA,OAAOnX,OACxCmX,OAAOnX,OAEPoX,GAAkBpX,MAE9B,CAAC,MAAOsP,GACR,CAgID,SAAS+H,EAAeC,EAAQhQ,GAC9B,IAAIiQ,EAAID,EAAOE,WAAWlQ,GAE1B,OAAIiQ,GAAK,IAAMA,GAAK,GACXA,EAAI,GAEFA,GAAK,IAAMA,GAAK,GAClBA,EAAI,GAEFA,GAAK,IAAMA,GAAK,IAClBA,EAAI,QAEXtB,EAAO,EAAO,wBAA0BqB,EAE3C,CAED,SAASG,EAAcH,EAAQI,EAAYpQ,GACzC,IAAIqQ,EAAIN,EAAcC,EAAQhQ,GAI9B,OAHIA,EAAQ,GAAKoQ,IACfC,GAAKN,EAAcC,EAAQhQ,EAAQ,IAAM,GAEpCqQ,CACR,CA6CD,SAASC,EAAWC,EAAKhF,EAAOiF,EAAK7T,GAInC,IAHA,IAAI0T,EAAI,EACJvT,EAAI,EACJ2T,EAAM3U,KAAKoD,IAAIqR,EAAIrW,OAAQsW,GACtBpW,EAAImR,EAAOnR,EAAIqW,EAAKrW,IAAK,CAChC,IAAI6V,EAAIM,EAAIL,WAAW9V,GAAK,GAE5BiW,GAAK1T,EAIHG,EADEmT,GAAK,GACHA,EAAI,GAAK,GAGJA,GAAK,GACVA,EAAI,GAAK,GAITA,EAENtB,EAAOsB,GAAK,GAAKnT,EAAIH,EAAK,qBAC1B0T,GAAKvT,CACN,CACD,OAAOuT,CACR,CA2DD,SAASK,EAAMxI,EAAMvF,GACnBuF,EAAKuH,MAAQ9M,EAAI8M,MACjBvH,EAAKhO,OAASyI,EAAIzI,OAClBgO,EAAKsH,SAAW7M,EAAI6M,SACpBtH,EAAKwH,IAAM/M,EAAI+M,GAChB,CAqCD,GA/TAP,EAAGI,KAAO,SAAeoB,GACvB,OAAIA,aAAexB,EACV,EAGM,OAARwB,GAA+B,iBAARA,GAC5BA,EAAI3O,YAAY4N,WAAaT,EAAGS,UAAY3V,MAAM6N,QAAQ6I,EAAIlB,MACpE,EAEEN,EAAGhQ,IAAM,SAAcyR,EAAMC,GAC3B,OAAID,EAAKpS,IAAIqS,GAAS,EAAUD,EACzBC,CACX,EAEE1B,EAAGjQ,IAAM,SAAc0R,EAAMC,GAC3B,OAAID,EAAKpS,IAAIqS,GAAS,EAAUD,EACzBC,CACX,EAEE1B,EAAGjM,UAAUyM,MAAQ,SAAeP,EAAQC,EAAMC,GAChD,GAAsB,iBAAXF,EACT,OAAO9M,KAAKwO,YAAY1B,EAAQC,EAAMC,GAGxC,GAAsB,iBAAXF,EACT,OAAO9M,KAAKyO,WAAW3B,EAAQC,EAAMC,GAG1B,QAATD,IACFA,EAAO,IAETV,EAAOU,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,IAGnD,IAAI9D,EAAQ,EACM,OAFlB6D,EAASA,EAAO7T,WAAWyV,QAAQ,OAAQ,KAEhC,KACTzF,IACAjJ,KAAKkN,SAAW,GAGdjE,EAAQ6D,EAAOlV,SACJ,KAATmV,EACF/M,KAAK2O,UAAU7B,EAAQ7D,EAAO+D,IAG9BhN,KAAK4O,WAAW9B,EAAQC,EAAM9D,GACf,OAAX+D,GACFhN,KAAKyO,WAAWzO,KAAK6O,UAAW9B,EAAMC,IAIhD,EAEEH,EAAGjM,UAAU4N,YAAc,SAAsB1B,EAAQC,EAAMC,GACzDF,EAAS,IACX9M,KAAKkN,SAAW,EAChBJ,GAAUA,GAERA,EAAS,UACX9M,KAAKmN,MAAQ,CAAU,SAATL,GACd9M,KAAKpI,OAAS,GACLkV,EAAS,kBAClB9M,KAAKmN,MAAQ,CACF,SAATL,EACCA,EAAS,SAAa,UAEzB9M,KAAKpI,OAAS,IAEdyU,EAAOS,EAAS,kBAChB9M,KAAKmN,MAAQ,CACF,SAATL,EACCA,EAAS,SAAa,SACvB,GAEF9M,KAAKpI,OAAS,GAGD,OAAXoV,GAGJhN,KAAKyO,WAAWzO,KAAK6O,UAAW9B,EAAMC,EAC1C,EAEEH,EAAGjM,UAAU6N,WAAa,SAAqB3B,EAAQC,EAAMC,GAG3D,GADAX,EAAgC,iBAAlBS,EAAOlV,QACjBkV,EAAOlV,QAAU,EAGnB,OAFAoI,KAAKmN,MAAQ,CAAC,GACdnN,KAAKpI,OAAS,EACPoI,KAGTA,KAAKpI,OAAS4B,KAAKsV,KAAKhC,EAAOlV,OAAS,GACxCoI,KAAKmN,MAAQ,IAAIxV,MAAMqI,KAAKpI,QAC5B,IAAK,IAAIE,EAAI,EAAGA,EAAIkI,KAAKpI,OAAQE,IAC/BkI,KAAKmN,MAAMrV,GAAK,EAGlB,IAAIyB,EAAGwV,EACHC,EAAM,EACV,GAAe,OAAXhC,EACF,IAAKlV,EAAIgV,EAAOlV,OAAS,EAAG2B,EAAI,EAAGzB,GAAK,EAAGA,GAAK,EAC9CiX,EAAIjC,EAAOhV,GAAMgV,EAAOhV,EAAI,IAAM,EAAMgV,EAAOhV,EAAI,IAAM,GACzDkI,KAAKmN,MAAM5T,IAAOwV,GAAKC,EAAO,SAC9BhP,KAAKmN,MAAM5T,EAAI,GAAMwV,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPzV,UAGC,GAAe,OAAXyT,EACT,IAAKlV,EAAI,EAAGyB,EAAI,EAAGzB,EAAIgV,EAAOlV,OAAQE,GAAK,EACzCiX,EAAIjC,EAAOhV,GAAMgV,EAAOhV,EAAI,IAAM,EAAMgV,EAAOhV,EAAI,IAAM,GACzDkI,KAAKmN,MAAM5T,IAAOwV,GAAKC,EAAO,SAC9BhP,KAAKmN,MAAM5T,EAAI,GAAMwV,IAAO,GAAKC,EAAQ,UACzCA,GAAO,KACI,KACTA,GAAO,GACPzV,KAIN,OAAOyG,KAAKiP,QAChB,EA0BEpC,EAAGjM,UAAU+N,UAAY,SAAoB7B,EAAQ7D,EAAO+D,GAE1DhN,KAAKpI,OAAS4B,KAAKsV,MAAMhC,EAAOlV,OAASqR,GAAS,GAClDjJ,KAAKmN,MAAQ,IAAIxV,MAAMqI,KAAKpI,QAC5B,IAAK,IAAIE,EAAI,EAAGA,EAAIkI,KAAKpI,OAAQE,IAC/BkI,KAAKmN,MAAMrV,GAAK,EAIlB,IAGIiX,EAHAC,EAAM,EACNzV,EAAI,EAGR,GAAe,OAAXyT,EACF,IAAKlV,EAAIgV,EAAOlV,OAAS,EAAGE,GAAKmR,EAAOnR,GAAK,EAC3CiX,EAAIlB,EAAaf,EAAQ7D,EAAOnR,IAAMkX,EACtChP,KAAKmN,MAAM5T,IAAU,SAAJwV,EACbC,GAAO,IACTA,GAAO,GACPzV,GAAK,EACLyG,KAAKmN,MAAM5T,IAAMwV,IAAM,IAEvBC,GAAO,OAKX,IAAKlX,GADagV,EAAOlV,OAASqR,GACX,GAAM,EAAIA,EAAQ,EAAIA,EAAOnR,EAAIgV,EAAOlV,OAAQE,GAAK,EAC1EiX,EAAIlB,EAAaf,EAAQ7D,EAAOnR,IAAMkX,EACtChP,KAAKmN,MAAM5T,IAAU,SAAJwV,EACbC,GAAO,IACTA,GAAO,GACPzV,GAAK,EACLyG,KAAKmN,MAAM5T,IAAMwV,IAAM,IAEvBC,GAAO,EAKbhP,KAAKiP,QACT,EA6BEpC,EAAGjM,UAAUgO,WAAa,SAAqB9B,EAAQC,EAAM9D,GAE3DjJ,KAAKmN,MAAQ,CAAC,GACdnN,KAAKpI,OAAS,EAGd,IAAK,IAAIsX,EAAU,EAAGC,EAAU,EAAGA,GAAW,SAAWA,GAAWpC,EAClEmC,IAEFA,IACAC,EAAWA,EAAUpC,EAAQ,EAO7B,IALA,IAAI1Q,EAAQyQ,EAAOlV,OAASqR,EACxBmG,EAAM/S,EAAQ6S,EACdhB,EAAM1U,KAAKoD,IAAIP,EAAOA,EAAQ+S,GAAOnG,EAErChB,EAAO,EACFnQ,EAAImR,EAAOnR,EAAIoW,EAAKpW,GAAKoX,EAChCjH,EAAO+F,EAAUlB,EAAQhV,EAAGA,EAAIoX,EAASnC,GAEzC/M,KAAKqP,MAAMF,GACPnP,KAAKmN,MAAM,GAAKlF,EAAO,SACzBjI,KAAKmN,MAAM,IAAMlF,EAEjBjI,KAAKsP,OAAOrH,GAIhB,GAAY,IAARmH,EAAW,CACb,IAAInM,EAAM,EAGV,IAFAgF,EAAO+F,EAAUlB,EAAQhV,EAAGgV,EAAOlV,OAAQmV,GAEtCjV,EAAI,EAAGA,EAAIsX,EAAKtX,IACnBmL,GAAO8J,EAGT/M,KAAKqP,MAAMpM,GACPjD,KAAKmN,MAAM,GAAKlF,EAAO,SACzBjI,KAAKmN,MAAM,IAAMlF,EAEjBjI,KAAKsP,OAAOrH,EAEf,CAEDjI,KAAKiP,QACT,EAEEpC,EAAGjM,UAAU6I,KAAO,SAAe7D,GACjCA,EAAKuH,MAAQ,IAAIxV,MAAMqI,KAAKpI,QAC5B,IAAK,IAAIE,EAAI,EAAGA,EAAIkI,KAAKpI,OAAQE,IAC/B8N,EAAKuH,MAAMrV,GAAKkI,KAAKmN,MAAMrV,GAE7B8N,EAAKhO,OAASoI,KAAKpI,OACnBgO,EAAKsH,SAAWlN,KAAKkN,SACrBtH,EAAKwH,IAAMpN,KAAKoN,GACpB,EASEP,EAAGjM,UAAU2O,MAAQ,SAAgB3J,GACnCwI,EAAKxI,EAAM5F,KACf,EAEE6M,EAAGjM,UAAU4O,MAAQ,WACnB,IAAIzB,EAAI,IAAIlB,EAAG,MAEf,OADA7M,KAAKyJ,KAAKsE,GACHA,CACX,EAEElB,EAAGjM,UAAU6O,QAAU,SAAkBC,GACvC,KAAO1P,KAAKpI,OAAS8X,GACnB1P,KAAKmN,MAAMnN,KAAKpI,UAAY,EAE9B,OAAOoI,IACX,EAGE6M,EAAGjM,UAAUqO,OAAS,WACpB,KAAOjP,KAAKpI,OAAS,GAAqC,IAAhCoI,KAAKmN,MAAMnN,KAAKpI,OAAS,IACjDoI,KAAKpI,SAEP,OAAOoI,KAAK2P,WAChB,EAEE9C,EAAGjM,UAAU+O,UAAY,WAKvB,OAHoB,IAAhB3P,KAAKpI,QAAkC,IAAlBoI,KAAKmN,MAAM,KAClCnN,KAAKkN,SAAW,GAEXlN,IACX,EAIwB,oBAAX4P,QAAgD,mBAAfA,OAAOC,IACjD,IACEhD,EAAGjM,UAAUgP,OAAOC,IAAI,+BAAiCC,CAC1D,CAAC,MAAOpK,GACPmH,EAAGjM,UAAUkP,QAAUA,CACxB,MAEDjD,EAAGjM,UAAUkP,QAAUA,EAGzB,SAASA,IACP,OAAQ9P,KAAKoN,IAAM,UAAY,SAAWpN,KAAK/G,SAAS,IAAM,GAC/D,CAgCD,IAAI8W,EAAQ,CACV,GACA,IACA,KACA,MACA,OACA,QACA,SACA,UACA,WACA,YACA,aACA,cACA,eACA,gBACA,iBACA,kBACA,mBACA,oBACA,qBACA,sBACA,uBACA,wBACA,yBACA,0BACA,2BACA,6BAGEC,EAAa,CACf,EAAG,EACH,GAAI,GAAI,GAAI,GAAI,GAAI,EAAG,EACvB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAClB,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAGhBC,EAAa,CACf,EAAG,EACH,SAAU,SAAU,SAAU,SAAU,SAAU,SAAU,SAC5D,SAAU,IAAU,SAAU,SAAU,SAAU,QAAS,SAC3D,SAAU,SAAU,SAAU,SAAU,KAAU,QAAS,QAC3D,QAAS,QAAS,QAAS,SAAU,SAAU,SAAU,SACzD,MAAU,SAAU,SAAU,SAAU,SAAU,SAAU,UA4mB9D,SAASC,EAAYC,EAAM9B,EAAK+B,GAC9BA,EAAIlD,SAAWmB,EAAInB,SAAWiD,EAAKjD,SACnC,IAAIiB,EAAOgC,EAAKvY,OAASyW,EAAIzW,OAAU,EACvCwY,EAAIxY,OAASuW,EACbA,EAAOA,EAAM,EAAK,EAGlB,IAAI5T,EAAoB,EAAhB4V,EAAKhD,MAAM,GACf3S,EAAmB,EAAf6T,EAAIlB,MAAM,GACdY,EAAIxT,EAAIC,EAER0G,EAAS,SAAJ6M,EACLsC,EAAStC,EAAI,SAAa,EAC9BqC,EAAIjD,MAAM,GAAKjM,EAEf,IAAK,IAAIoP,EAAI,EAAGA,EAAInC,EAAKmC,IAAK,CAM5B,IAHA,IAAIC,EAASF,IAAU,GACnBG,EAAgB,SAARH,EACRI,EAAOjX,KAAKoD,IAAI0T,EAAGjC,EAAIzW,OAAS,GAC3B2B,EAAIC,KAAKqD,IAAI,EAAGyT,EAAIH,EAAKvY,OAAS,GAAI2B,GAAKkX,EAAMlX,IAAK,CAC7D,IAAIzB,EAAKwY,EAAI/W,EAAK,EAIlBgX,IADAxC,GAFAxT,EAAoB,EAAhB4V,EAAKhD,MAAMrV,KACf0C,EAAmB,EAAf6T,EAAIlB,MAAM5T,IACFiX,GACG,SAAa,EAC5BA,EAAY,SAAJzC,CACT,CACDqC,EAAIjD,MAAMmD,GAAa,EAARE,EACfH,EAAiB,EAATE,CACT,CAOD,OANc,IAAVF,EACFD,EAAIjD,MAAMmD,GAAa,EAARD,EAEfD,EAAIxY,SAGCwY,EAAInB,QACZ,CAhpBDpC,EAAGjM,UAAU3H,SAAW,SAAmB8T,EAAM2D,GAI/C,IAAIN,EACJ,GAHAM,EAAoB,EAAVA,GAAe,EAGZ,MAJb3D,EAAOA,GAAQ,KAIa,QAATA,EAAgB,CACjCqD,EAAM,GAGN,IAFA,IAAIpB,EAAM,EACNqB,EAAQ,EACHvY,EAAI,EAAGA,EAAIkI,KAAKpI,OAAQE,IAAK,CACpC,IAAIiX,EAAI/O,KAAKmN,MAAMrV,GACfmQ,GAA+B,UAArB8G,GAAKC,EAAOqB,IAAmBpX,SAAS,IACtDoX,EAAStB,IAAO,GAAKC,EAAQ,UAC7BA,GAAO,IACI,KACTA,GAAO,GACPlX,KAGAsY,EADY,IAAVC,GAAevY,IAAMkI,KAAKpI,OAAS,EAC/BmY,EAAM,EAAI9H,EAAKrQ,QAAUqQ,EAAOmI,EAEhCnI,EAAOmI,CAEhB,CAID,IAHc,IAAVC,IACFD,EAAMC,EAAMpX,SAAS,IAAMmX,GAEtBA,EAAIxY,OAAS8Y,GAAY,GAC9BN,EAAM,IAAMA,EAKd,OAHsB,IAAlBpQ,KAAKkN,WACPkD,EAAM,IAAMA,GAEPA,CACR,CAED,GAAIrD,KAAiB,EAAPA,IAAaA,GAAQ,GAAKA,GAAQ,GAAI,CAElD,IAAI4D,EAAYX,EAAWjD,GAEvB6D,EAAYX,EAAWlD,GAC3BqD,EAAM,GACN,IAAIzC,EAAI3N,KAAKwP,QAEb,IADA7B,EAAET,SAAW,GACLS,EAAEjT,UAAU,CAClB,IAAIqT,EAAIJ,EAAEkD,MAAMD,GAAW3X,SAAS8T,GAMlCqD,GALFzC,EAAIA,EAAEmD,MAAMF,IAELlW,SAGCqT,EAAIqC,EAFJL,EAAMY,EAAY5C,EAAEnW,QAAUmW,EAAIqC,CAI3C,CAID,IAHIpQ,KAAKtF,WACP0V,EAAM,IAAMA,GAEPA,EAAIxY,OAAS8Y,GAAY,GAC9BN,EAAM,IAAMA,EAKd,OAHsB,IAAlBpQ,KAAKkN,WACPkD,EAAM,IAAMA,GAEPA,CACR,CAED/D,EAAO,EAAO,kCAClB,EAEEQ,EAAGjM,UAAUmQ,SAAW,WACtB,IAAIC,EAAMhR,KAAKmN,MAAM,GASrB,OARoB,IAAhBnN,KAAKpI,OACPoZ,GAAuB,SAAhBhR,KAAKmN,MAAM,GACO,IAAhBnN,KAAKpI,QAAkC,IAAlBoI,KAAKmN,MAAM,GAEzC6D,GAAO,iBAAoC,SAAhBhR,KAAKmN,MAAM,GAC7BnN,KAAKpI,OAAS,GACvByU,EAAO,EAAO,8CAEU,IAAlBrM,KAAKkN,UAAmB8D,EAAMA,CAC1C,EAEEnE,EAAGjM,UAAUqQ,OAAS,WACpB,OAAOjR,KAAK/G,SAAS,GAAI,EAC7B,EAEM7C,IACFyW,EAAGjM,UAAUsQ,SAAW,SAAmBlE,EAAQpV,GACjD,OAAOoI,KAAKmR,YAAY/a,EAAQ4W,EAAQpV,EAC9C,GAGEiV,EAAGjM,UAAUiO,QAAU,SAAkB7B,EAAQpV,GAC/C,OAAOoI,KAAKmR,YAAYxZ,MAAOqV,EAAQpV,EAC3C,EASEiV,EAAGjM,UAAUuQ,YAAc,SAAsBC,EAAWpE,EAAQpV,GAClEoI,KAAKiP,SAEL,IAAIoC,EAAarR,KAAKqR,aAClBC,EAAY1Z,GAAU4B,KAAKqD,IAAI,EAAGwU,GACtChF,EAAOgF,GAAcC,EAAW,yCAChCjF,EAAOiF,EAAY,EAAG,+BAEtB,IAAIC,EAfS,SAAmBH,EAAW1B,GAC3C,OAAI0B,EAAUI,YACLJ,EAAUI,YAAY9B,GAExB,IAAI0B,EAAU1B,EACzB,CAUc+B,CAASL,EAAWE,GAG9B,OADAtR,KAAK,gBADoB,OAAXgN,EAAkB,KAAO,OACRuE,EAAKF,GAC7BE,CACX,EAEE1E,EAAGjM,UAAU8Q,eAAiB,SAAyBH,GAIrD,IAHA,IAAII,EAAW,EACXtB,EAAQ,EAEHvY,EAAI,EAAGmO,EAAQ,EAAGnO,EAAIkI,KAAKpI,OAAQE,IAAK,CAC/C,IAAImQ,EAAQjI,KAAKmN,MAAMrV,IAAMmO,EAASoK,EAEtCkB,EAAII,KAAqB,IAAP1J,EACd0J,EAAWJ,EAAI3Z,SACjB2Z,EAAII,KAAe1J,GAAQ,EAAK,KAE9B0J,EAAWJ,EAAI3Z,SACjB2Z,EAAII,KAAe1J,GAAQ,GAAM,KAGrB,IAAVhC,GACE0L,EAAWJ,EAAI3Z,SACjB2Z,EAAII,KAAe1J,GAAQ,GAAM,KAEnCoI,EAAQ,EACRpK,EAAQ,IAERoK,EAAQpI,IAAS,GACjBhC,GAAS,EAEZ,CAED,GAAI0L,EAAWJ,EAAI3Z,OAGjB,IAFA2Z,EAAII,KAActB,EAEXsB,EAAWJ,EAAI3Z,QACpB2Z,EAAII,KAAc,CAG1B,EAEE9E,EAAGjM,UAAUgR,eAAiB,SAAyBL,GAIrD,IAHA,IAAII,EAAWJ,EAAI3Z,OAAS,EACxByY,EAAQ,EAEHvY,EAAI,EAAGmO,EAAQ,EAAGnO,EAAIkI,KAAKpI,OAAQE,IAAK,CAC/C,IAAImQ,EAAQjI,KAAKmN,MAAMrV,IAAMmO,EAASoK,EAEtCkB,EAAII,KAAqB,IAAP1J,EACd0J,GAAY,IACdJ,EAAII,KAAe1J,GAAQ,EAAK,KAE9B0J,GAAY,IACdJ,EAAII,KAAe1J,GAAQ,GAAM,KAGrB,IAAVhC,GACE0L,GAAY,IACdJ,EAAII,KAAe1J,GAAQ,GAAM,KAEnCoI,EAAQ,EACRpK,EAAQ,IAERoK,EAAQpI,IAAS,GACjBhC,GAAS,EAEZ,CAED,GAAI0L,GAAY,EAGd,IAFAJ,EAAII,KAActB,EAEXsB,GAAY,GACjBJ,EAAII,KAAc,CAG1B,EAEMnY,KAAKqY,MACPhF,EAAGjM,UAAUkR,WAAa,SAAqB/C,GAC7C,OAAO,GAAKvV,KAAKqY,MAAM9C,EAC7B,EAEIlC,EAAGjM,UAAUkR,WAAa,SAAqB/C,GAC7C,IAAIgD,EAAIhD,EACJhB,EAAI,EAiBR,OAhBIgE,GAAK,OACPhE,GAAK,GACLgE,KAAO,IAELA,GAAK,KACPhE,GAAK,EACLgE,KAAO,GAELA,GAAK,IACPhE,GAAK,EACLgE,KAAO,GAELA,GAAK,IACPhE,GAAK,EACLgE,KAAO,GAEFhE,EAAIgE,CACjB,EAGElF,EAAGjM,UAAUoR,UAAY,SAAoBjD,GAE3C,GAAU,IAANA,EAAS,OAAO,GAEpB,IAAIgD,EAAIhD,EACJhB,EAAI,EAoBR,OAnBqB,IAAZ,KAAJgE,KACHhE,GAAK,GACLgE,KAAO,IAEU,IAAV,IAAJA,KACHhE,GAAK,EACLgE,KAAO,GAES,IAAT,GAAJA,KACHhE,GAAK,EACLgE,KAAO,GAES,IAAT,EAAJA,KACHhE,GAAK,EACLgE,KAAO,GAES,IAAT,EAAJA,IACHhE,IAEKA,CACX,EAGElB,EAAGjM,UAAUqR,UAAY,WACvB,IAAIlD,EAAI/O,KAAKmN,MAAMnN,KAAKpI,OAAS,GAC7Bsa,EAAKlS,KAAK8R,WAAW/C,GACzB,OAA2B,IAAnB/O,KAAKpI,OAAS,GAAUsa,CACpC,EAgBErF,EAAGjM,UAAUuR,SAAW,WACtB,GAAInS,KAAKtF,SAAU,OAAO,EAG1B,IADA,IAAIqT,EAAI,EACCjW,EAAI,EAAGA,EAAIkI,KAAKpI,OAAQE,IAAK,CACpC,IAAI0C,EAAIwF,KAAKgS,UAAUhS,KAAKmN,MAAMrV,IAElC,GADAiW,GAAKvT,EACK,KAANA,EAAU,KACf,CACD,OAAOuT,CACX,EAEElB,EAAGjM,UAAUyQ,WAAa,WACxB,OAAO7X,KAAKsV,KAAK9O,KAAKiS,YAAc,EACxC,EAEEpF,EAAGjM,UAAUwR,OAAS,SAAiBC,GACrC,OAAsB,IAAlBrS,KAAKkN,SACAlN,KAAKsS,MAAMC,MAAMF,GAAOG,MAAM,GAEhCxS,KAAKwP,OAChB,EAEE3C,EAAGjM,UAAU6R,SAAW,SAAmBJ,GACzC,OAAIrS,KAAK0S,MAAML,EAAQ,GACdrS,KAAK2S,KAAKN,GAAOG,MAAM,GAAGI,OAE5B5S,KAAKwP,OAChB,EAEE3C,EAAGjM,UAAUiS,MAAQ,WACnB,OAAyB,IAAlB7S,KAAKkN,QAChB,EAGEL,EAAGjM,UAAUkS,IAAM,WACjB,OAAO9S,KAAKwP,QAAQoD,MACxB,EAEE/F,EAAGjM,UAAUgS,KAAO,WAKlB,OAJK5S,KAAKtF,WACRsF,KAAKkN,UAAY,GAGZlN,IACX,EAGE6M,EAAGjM,UAAUmS,KAAO,SAAe1E,GACjC,KAAOrO,KAAKpI,OAASyW,EAAIzW,QACvBoI,KAAKmN,MAAMnN,KAAKpI,UAAY,EAG9B,IAAK,IAAIE,EAAI,EAAGA,EAAIuW,EAAIzW,OAAQE,IAC9BkI,KAAKmN,MAAMrV,GAAKkI,KAAKmN,MAAMrV,GAAKuW,EAAIlB,MAAMrV,GAG5C,OAAOkI,KAAKiP,QAChB,EAEEpC,EAAGjM,UAAUoS,IAAM,SAAc3E,GAE/B,OADAhC,EAA0C,IAAlCrM,KAAKkN,SAAWmB,EAAInB,WACrBlN,KAAK+S,KAAK1E,EACrB,EAGExB,EAAGjM,UAAUqS,GAAK,SAAa5E,GAC7B,OAAIrO,KAAKpI,OAASyW,EAAIzW,OAAeoI,KAAKwP,QAAQwD,IAAI3E,GAC/CA,EAAImB,QAAQwD,IAAIhT,KAC3B,EAEE6M,EAAGjM,UAAUsS,IAAM,SAAc7E,GAC/B,OAAIrO,KAAKpI,OAASyW,EAAIzW,OAAeoI,KAAKwP,QAAQuD,KAAK1E,GAChDA,EAAImB,QAAQuD,KAAK/S,KAC5B,EAGE6M,EAAGjM,UAAUuS,MAAQ,SAAgB9E,GAEnC,IAAI7T,EAEFA,EADEwF,KAAKpI,OAASyW,EAAIzW,OAChByW,EAEArO,KAGN,IAAK,IAAIlI,EAAI,EAAGA,EAAI0C,EAAE5C,OAAQE,IAC5BkI,KAAKmN,MAAMrV,GAAKkI,KAAKmN,MAAMrV,GAAKuW,EAAIlB,MAAMrV,GAK5C,OAFAkI,KAAKpI,OAAS4C,EAAE5C,OAEToI,KAAKiP,QAChB,EAEEpC,EAAGjM,UAAUwS,KAAO,SAAe/E,GAEjC,OADAhC,EAA0C,IAAlCrM,KAAKkN,SAAWmB,EAAInB,WACrBlN,KAAKmT,MAAM9E,EACtB,EAGExB,EAAGjM,UAAUyS,IAAM,SAAchF,GAC/B,OAAIrO,KAAKpI,OAASyW,EAAIzW,OAAeoI,KAAKwP,QAAQ4D,KAAK/E,GAChDA,EAAImB,QAAQ4D,KAAKpT,KAC5B,EAEE6M,EAAGjM,UAAU0S,KAAO,SAAejF,GACjC,OAAIrO,KAAKpI,OAASyW,EAAIzW,OAAeoI,KAAKwP,QAAQ2D,MAAM9E,GACjDA,EAAImB,QAAQ2D,MAAMnT,KAC7B,EAGE6M,EAAGjM,UAAU2S,MAAQ,SAAgBlF,GAEnC,IAAI9T,EACAC,EACAwF,KAAKpI,OAASyW,EAAIzW,QACpB2C,EAAIyF,KACJxF,EAAI6T,IAEJ9T,EAAI8T,EACJ7T,EAAIwF,MAGN,IAAK,IAAIlI,EAAI,EAAGA,EAAI0C,EAAE5C,OAAQE,IAC5BkI,KAAKmN,MAAMrV,GAAKyC,EAAE4S,MAAMrV,GAAK0C,EAAE2S,MAAMrV,GAGvC,GAAIkI,OAASzF,EACX,KAAOzC,EAAIyC,EAAE3C,OAAQE,IACnBkI,KAAKmN,MAAMrV,GAAKyC,EAAE4S,MAAMrV,GAM5B,OAFAkI,KAAKpI,OAAS2C,EAAE3C,OAEToI,KAAKiP,QAChB,EAEEpC,EAAGjM,UAAU4S,KAAO,SAAenF,GAEjC,OADAhC,EAA0C,IAAlCrM,KAAKkN,SAAWmB,EAAInB,WACrBlN,KAAKuT,MAAMlF,EACtB,EAGExB,EAAGjM,UAAU6S,IAAM,SAAcpF,GAC/B,OAAIrO,KAAKpI,OAASyW,EAAIzW,OAAeoI,KAAKwP,QAAQgE,KAAKnF,GAChDA,EAAImB,QAAQgE,KAAKxT,KAC5B,EAEE6M,EAAGjM,UAAU8S,KAAO,SAAerF,GACjC,OAAIrO,KAAKpI,OAASyW,EAAIzW,OAAeoI,KAAKwP,QAAQ+D,MAAMlF,GACjDA,EAAImB,QAAQ+D,MAAMvT,KAC7B,EAGE6M,EAAGjM,UAAU2R,MAAQ,SAAgBF,GACnChG,EAAwB,iBAAVgG,GAAsBA,GAAS,GAE7C,IAAIsB,EAAsC,EAAxBna,KAAKsV,KAAKuD,EAAQ,IAChCuB,EAAWvB,EAAQ,GAGvBrS,KAAKyP,QAAQkE,GAETC,EAAW,GACbD,IAIF,IAAK,IAAI7b,EAAI,EAAGA,EAAI6b,EAAa7b,IAC/BkI,KAAKmN,MAAMrV,GAAsB,UAAhBkI,KAAKmN,MAAMrV,GAS9B,OALI8b,EAAW,IACb5T,KAAKmN,MAAMrV,IAAMkI,KAAKmN,MAAMrV,GAAM,UAAc,GAAK8b,GAIhD5T,KAAKiP,QAChB,EAEEpC,EAAGjM,UAAU+R,KAAO,SAAeN,GACjC,OAAOrS,KAAKwP,QAAQ+C,MAAMF,EAC9B,EAGExF,EAAGjM,UAAUiT,KAAO,SAAeC,EAAKxH,GACtCD,EAAsB,iBAARyH,GAAoBA,GAAO,GAEzC,IAAI9E,EAAO8E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAUjB,OARA9T,KAAKyP,QAAQT,EAAM,GAGjBhP,KAAKmN,MAAM6B,GADT1C,EACgBtM,KAAKmN,MAAM6B,GAAQ,GAAK+E,EAExB/T,KAAKmN,MAAM6B,KAAS,GAAK+E,GAGtC/T,KAAKiP,QAChB,EAGEpC,EAAGjM,UAAUoT,KAAO,SAAe3F,GACjC,IAAIN,EAkBAxT,EAAGC,EAfP,GAAsB,IAAlBwF,KAAKkN,UAAmC,IAAjBmB,EAAInB,SAI7B,OAHAlN,KAAKkN,SAAW,EAChBa,EAAI/N,KAAKiU,KAAK5F,GACdrO,KAAKkN,UAAY,EACVlN,KAAK2P,YAGP,GAAsB,IAAlB3P,KAAKkN,UAAmC,IAAjBmB,EAAInB,SAIpC,OAHAmB,EAAInB,SAAW,EACfa,EAAI/N,KAAKiU,KAAK5F,GACdA,EAAInB,SAAW,EACRa,EAAE4B,YAKP3P,KAAKpI,OAASyW,EAAIzW,QACpB2C,EAAIyF,KACJxF,EAAI6T,IAEJ9T,EAAI8T,EACJ7T,EAAIwF,MAIN,IADA,IAAIqQ,EAAQ,EACHvY,EAAI,EAAGA,EAAI0C,EAAE5C,OAAQE,IAC5BiW,GAAkB,EAAbxT,EAAE4S,MAAMrV,KAAwB,EAAb0C,EAAE2S,MAAMrV,IAAUuY,EAC1CrQ,KAAKmN,MAAMrV,GAAS,SAAJiW,EAChBsC,EAAQtC,IAAM,GAEhB,KAAiB,IAAVsC,GAAevY,EAAIyC,EAAE3C,OAAQE,IAClCiW,GAAkB,EAAbxT,EAAE4S,MAAMrV,IAAUuY,EACvBrQ,KAAKmN,MAAMrV,GAAS,SAAJiW,EAChBsC,EAAQtC,IAAM,GAIhB,GADA/N,KAAKpI,OAAS2C,EAAE3C,OACF,IAAVyY,EACFrQ,KAAKmN,MAAMnN,KAAKpI,QAAUyY,EAC1BrQ,KAAKpI,cAEA,GAAI2C,IAAMyF,KACf,KAAOlI,EAAIyC,EAAE3C,OAAQE,IACnBkI,KAAKmN,MAAMrV,GAAKyC,EAAE4S,MAAMrV,GAI5B,OAAOkI,IACX,EAGE6M,EAAGjM,UAAU3E,IAAM,SAAcoS,GAC/B,IAAIkD,EACJ,OAAqB,IAAjBlD,EAAInB,UAAoC,IAAlBlN,KAAKkN,UAC7BmB,EAAInB,SAAW,EACfqE,EAAMvR,KAAKkU,IAAI7F,GACfA,EAAInB,UAAY,EACTqE,GACmB,IAAjBlD,EAAInB,UAAoC,IAAlBlN,KAAKkN,UACpClN,KAAKkN,SAAW,EAChBqE,EAAMlD,EAAI6F,IAAIlU,MACdA,KAAKkN,SAAW,EACTqE,GAGLvR,KAAKpI,OAASyW,EAAIzW,OAAeoI,KAAKwP,QAAQwE,KAAK3F,GAEhDA,EAAImB,QAAQwE,KAAKhU,KAC5B,EAGE6M,EAAGjM,UAAUqT,KAAO,SAAe5F,GAEjC,GAAqB,IAAjBA,EAAInB,SAAgB,CACtBmB,EAAInB,SAAW,EACf,IAAIa,EAAI/N,KAAKgU,KAAK3F,GAElB,OADAA,EAAInB,SAAW,EACRa,EAAE4B,WAGf,CAAW,GAAsB,IAAlB3P,KAAKkN,SAId,OAHAlN,KAAKkN,SAAW,EAChBlN,KAAKgU,KAAK3F,GACVrO,KAAKkN,SAAW,EACTlN,KAAK2P,YAId,IAWIpV,EAAGC,EAXH0B,EAAM8D,KAAK9D,IAAImS,GAGnB,GAAY,IAARnS,EAIF,OAHA8D,KAAKkN,SAAW,EAChBlN,KAAKpI,OAAS,EACdoI,KAAKmN,MAAM,GAAK,EACTnN,KAKL9D,EAAM,GACR3B,EAAIyF,KACJxF,EAAI6T,IAEJ9T,EAAI8T,EACJ7T,EAAIwF,MAIN,IADA,IAAIqQ,EAAQ,EACHvY,EAAI,EAAGA,EAAI0C,EAAE5C,OAAQE,IAE5BuY,GADAtC,GAAkB,EAAbxT,EAAE4S,MAAMrV,KAAwB,EAAb0C,EAAE2S,MAAMrV,IAAUuY,IAC7B,GACbrQ,KAAKmN,MAAMrV,GAAS,SAAJiW,EAElB,KAAiB,IAAVsC,GAAevY,EAAIyC,EAAE3C,OAAQE,IAElCuY,GADAtC,GAAkB,EAAbxT,EAAE4S,MAAMrV,IAAUuY,IACV,GACbrQ,KAAKmN,MAAMrV,GAAS,SAAJiW,EAIlB,GAAc,IAAVsC,GAAevY,EAAIyC,EAAE3C,QAAU2C,IAAMyF,KACvC,KAAOlI,EAAIyC,EAAE3C,OAAQE,IACnBkI,KAAKmN,MAAMrV,GAAKyC,EAAE4S,MAAMrV,GAU5B,OANAkI,KAAKpI,OAAS4B,KAAKqD,IAAImD,KAAKpI,OAAQE,GAEhCyC,IAAMyF,OACRA,KAAKkN,SAAW,GAGXlN,KAAKiP,QAChB,EAGEpC,EAAGjM,UAAUsT,IAAM,SAAc7F,GAC/B,OAAOrO,KAAKwP,QAAQyE,KAAK5F,EAC7B,EA8CE,IAAI8F,EAAc,SAAsBhE,EAAM9B,EAAK+B,GACjD,IAIIlP,EACAkT,EACAlC,EANA3X,EAAI4V,EAAKhD,MACT3S,EAAI6T,EAAIlB,MACRkH,EAAIjE,EAAIjD,MACRQ,EAAI,EAIJ2G,EAAY,EAAP/Z,EAAE,GACPga,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPla,EAAE,GACPma,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPra,EAAE,GACPsa,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxa,EAAE,GACPya,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP3a,EAAE,GACP4a,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP9a,EAAE,GACP+a,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPjb,EAAE,GACPkb,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPpb,EAAE,GACPqb,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPvb,EAAE,GACPwb,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP1b,EAAE,GACP2b,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP5b,EAAE,GACP6b,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAP/b,EAAE,GACPgc,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPlc,EAAE,GACPmc,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPrc,EAAE,GACPsc,EAAW,KAALD,EACNE,EAAMF,IAAO,GACbG,EAAY,EAAPxc,EAAE,GACPyc,EAAW,KAALD,EACNE,GAAMF,IAAO,GACbG,GAAY,EAAP3c,EAAE,GACP4c,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAP9c,EAAE,GACP+c,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPjd,EAAE,GACPkd,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPpd,EAAE,GACPqd,GAAW,KAALD,GACNE,GAAMF,KAAO,GACbG,GAAY,EAAPvd,EAAE,GACPwd,GAAW,KAALD,GACNE,GAAMF,KAAO,GAEjB3H,EAAIlD,SAAWiD,EAAKjD,SAAWmB,EAAInB,SACnCkD,EAAIxY,OAAS,GAMb,IAAIsgB,IAAQvK,GAJZzM,EAAK1H,KAAK2e,KAAK5D,EAAK8B,IAIE,KAAa,MAFnCjC,GADAA,EAAM5a,KAAK2e,KAAK5D,EAAK+B,IACR9c,KAAK2e,KAAK3D,EAAK6B,GAAQ,KAEU,IAAO,EACrD1I,IAFAuE,EAAK1Y,KAAK2e,KAAK3D,EAAK8B,KAEPlC,IAAQ,IAAO,IAAM8D,KAAO,IAAO,EAChDA,IAAM,SAENhX,EAAK1H,KAAK2e,KAAKzD,EAAK2B,GAEpBjC,GADAA,EAAM5a,KAAK2e,KAAKzD,EAAK4B,IACR9c,KAAK2e,KAAKxD,EAAK0B,GAAQ,EACpCnE,EAAK1Y,KAAK2e,KAAKxD,EAAK2B,GAKpB,IAAI8B,IAAQzK,GAJZzM,EAAMA,EAAK1H,KAAK2e,KAAK5D,EAAKiC,GAAQ,GAIZ,KAAa,MAFnCpC,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK5D,EAAKkC,GAAQ,GACvBjd,KAAK2e,KAAK3D,EAAKgC,GAAQ,KAEU,IAAO,EACrD7I,IAFAuE,EAAMA,EAAK1Y,KAAK2e,KAAK3D,EAAKiC,GAAQ,IAErBrC,IAAQ,IAAO,IAAMgE,KAAO,IAAO,EAChDA,IAAM,SAENlX,EAAK1H,KAAK2e,KAAKtD,EAAKwB,GAEpBjC,GADAA,EAAM5a,KAAK2e,KAAKtD,EAAKyB,IACR9c,KAAK2e,KAAKrD,EAAKuB,GAAQ,EACpCnE,EAAK1Y,KAAK2e,KAAKrD,EAAKwB,GACpBpV,EAAMA,EAAK1H,KAAK2e,KAAKzD,EAAK8B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKzD,EAAK+B,GAAQ,GACvBjd,KAAK2e,KAAKxD,EAAK6B,GAAQ,EACpCtE,EAAMA,EAAK1Y,KAAK2e,KAAKxD,EAAK8B,GAAQ,EAKlC,IAAI4B,IAAQ1K,GAJZzM,EAAMA,EAAK1H,KAAK2e,KAAK5D,EAAKoC,GAAQ,GAIZ,KAAa,MAFnCvC,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK5D,EAAKqC,GAAQ,GACvBpd,KAAK2e,KAAK3D,EAAKmC,GAAQ,KAEU,IAAO,EACrDhJ,IAFAuE,EAAMA,EAAK1Y,KAAK2e,KAAK3D,EAAKoC,GAAQ,IAErBxC,IAAQ,IAAO,IAAMiE,KAAO,IAAO,EAChDA,IAAM,SAENnX,EAAK1H,KAAK2e,KAAKnD,EAAKqB,GAEpBjC,GADAA,EAAM5a,KAAK2e,KAAKnD,EAAKsB,IACR9c,KAAK2e,KAAKlD,EAAKoB,GAAQ,EACpCnE,EAAK1Y,KAAK2e,KAAKlD,EAAKqB,GACpBpV,EAAMA,EAAK1H,KAAK2e,KAAKtD,EAAK2B,GAAQ,EAElCpC,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKtD,EAAK4B,GAAQ,GACvBjd,KAAK2e,KAAKrD,EAAK0B,GAAQ,EACpCtE,EAAMA,EAAK1Y,KAAK2e,KAAKrD,EAAK2B,GAAQ,EAClCvV,EAAMA,EAAK1H,KAAK2e,KAAKzD,EAAKiC,GAAQ,EAElCvC,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKzD,EAAKkC,GAAQ,GACvBpd,KAAK2e,KAAKxD,EAAKgC,GAAQ,EACpCzE,EAAMA,EAAK1Y,KAAK2e,KAAKxD,EAAKiC,GAAQ,EAKlC,IAAI0B,IAAQ3K,GAJZzM,EAAMA,EAAK1H,KAAK2e,KAAK5D,EAAKuC,GAAQ,GAIZ,KAAa,MAFnC1C,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK5D,EAAKwC,GAAQ,GACvBvd,KAAK2e,KAAK3D,EAAKsC,GAAQ,KAEU,IAAO,EACrDnJ,IAFAuE,EAAMA,EAAK1Y,KAAK2e,KAAK3D,EAAKuC,GAAQ,IAErB3C,IAAQ,IAAO,IAAMkE,KAAO,IAAO,EAChDA,IAAM,SAENpX,EAAK1H,KAAK2e,KAAKhD,EAAKkB,GAEpBjC,GADAA,EAAM5a,KAAK2e,KAAKhD,EAAKmB,IACR9c,KAAK2e,KAAK/C,EAAKiB,GAAQ,EACpCnE,EAAK1Y,KAAK2e,KAAK/C,EAAKkB,GACpBpV,EAAMA,EAAK1H,KAAK2e,KAAKnD,EAAKwB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKnD,EAAKyB,GAAQ,GACvBjd,KAAK2e,KAAKlD,EAAKuB,GAAQ,EACpCtE,EAAMA,EAAK1Y,KAAK2e,KAAKlD,EAAKwB,GAAQ,EAClCvV,EAAMA,EAAK1H,KAAK2e,KAAKtD,EAAK8B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKtD,EAAK+B,GAAQ,GACvBpd,KAAK2e,KAAKrD,EAAK6B,GAAQ,EACpCzE,EAAMA,EAAK1Y,KAAK2e,KAAKrD,EAAK8B,GAAQ,EAClC1V,EAAMA,EAAK1H,KAAK2e,KAAKzD,EAAKoC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKzD,EAAKqC,GAAQ,GACvBvd,KAAK2e,KAAKxD,EAAKmC,GAAQ,EACpC5E,EAAMA,EAAK1Y,KAAK2e,KAAKxD,EAAKoC,GAAQ,EAKlC,IAAIwB,IAAQ5K,GAJZzM,EAAMA,EAAK1H,KAAK2e,KAAK5D,EAAK0C,GAAQ,GAIZ,KAAa,MAFnC7C,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK5D,EAAK2C,IAAQ,GACvB1d,KAAK2e,KAAK3D,EAAKyC,GAAQ,KAEU,IAAO,EACrDtJ,IAFAuE,EAAMA,EAAK1Y,KAAK2e,KAAK3D,EAAK0C,IAAQ,IAErB9C,IAAQ,IAAO,IAAMmE,KAAO,IAAO,EAChDA,IAAM,SAENrX,EAAK1H,KAAK2e,KAAK7C,EAAKe,GAEpBjC,GADAA,EAAM5a,KAAK2e,KAAK7C,EAAKgB,IACR9c,KAAK2e,KAAK5C,EAAKc,GAAQ,EACpCnE,EAAK1Y,KAAK2e,KAAK5C,EAAKe,GACpBpV,EAAMA,EAAK1H,KAAK2e,KAAKhD,EAAKqB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKhD,EAAKsB,GAAQ,GACvBjd,KAAK2e,KAAK/C,EAAKoB,GAAQ,EACpCtE,EAAMA,EAAK1Y,KAAK2e,KAAK/C,EAAKqB,GAAQ,EAClCvV,EAAMA,EAAK1H,KAAK2e,KAAKnD,EAAK2B,GAAQ,EAElCvC,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKnD,EAAK4B,GAAQ,GACvBpd,KAAK2e,KAAKlD,EAAK0B,GAAQ,EACpCzE,EAAMA,EAAK1Y,KAAK2e,KAAKlD,EAAK2B,GAAQ,EAClC1V,EAAMA,EAAK1H,KAAK2e,KAAKtD,EAAKiC,GAAQ,EAElC1C,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKtD,EAAKkC,GAAQ,GACvBvd,KAAK2e,KAAKrD,EAAKgC,GAAQ,EACpC5E,EAAMA,EAAK1Y,KAAK2e,KAAKrD,EAAKiC,GAAQ,EAClC7V,EAAMA,EAAK1H,KAAK2e,KAAKzD,EAAKuC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKzD,EAAKwC,IAAQ,GACvB1d,KAAK2e,KAAKxD,EAAKsC,GAAQ,EACpC/E,EAAMA,EAAK1Y,KAAK2e,KAAKxD,EAAKuC,IAAQ,EAKlC,IAAIsB,IAAQ7K,GAJZzM,EAAMA,EAAK1H,KAAK2e,KAAK5D,EAAK6C,IAAQ,GAIZ,KAAa,MAFnChD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK5D,EAAK8C,IAAQ,GACvB7d,KAAK2e,KAAK3D,EAAK4C,IAAQ,KAEU,IAAO,EACrDzJ,IAFAuE,EAAMA,EAAK1Y,KAAK2e,KAAK3D,EAAK6C,IAAQ,IAErBjD,IAAQ,IAAO,IAAMoE,KAAO,IAAO,EAChDA,IAAM,SAENtX,EAAK1H,KAAK2e,KAAK1C,EAAKY,GAEpBjC,GADAA,EAAM5a,KAAK2e,KAAK1C,EAAKa,IACR9c,KAAK2e,KAAKzC,EAAKW,GAAQ,EACpCnE,EAAK1Y,KAAK2e,KAAKzC,EAAKY,GACpBpV,EAAMA,EAAK1H,KAAK2e,KAAK7C,EAAKkB,GAAQ,EAElCpC,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK7C,EAAKmB,GAAQ,GACvBjd,KAAK2e,KAAK5C,EAAKiB,GAAQ,EACpCtE,EAAMA,EAAK1Y,KAAK2e,KAAK5C,EAAKkB,GAAQ,EAClCvV,EAAMA,EAAK1H,KAAK2e,KAAKhD,EAAKwB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKhD,EAAKyB,GAAQ,GACvBpd,KAAK2e,KAAK/C,EAAKuB,GAAQ,EACpCzE,EAAMA,EAAK1Y,KAAK2e,KAAK/C,EAAKwB,GAAQ,EAClC1V,EAAMA,EAAK1H,KAAK2e,KAAKnD,EAAK8B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKnD,EAAK+B,GAAQ,GACvBvd,KAAK2e,KAAKlD,EAAK6B,GAAQ,EACpC5E,EAAMA,EAAK1Y,KAAK2e,KAAKlD,EAAK8B,GAAQ,EAClC7V,EAAMA,EAAK1H,KAAK2e,KAAKtD,EAAKoC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKtD,EAAKqC,IAAQ,GACvB1d,KAAK2e,KAAKrD,EAAKmC,GAAQ,EACpC/E,EAAMA,EAAK1Y,KAAK2e,KAAKrD,EAAKoC,IAAQ,EAClChW,EAAMA,EAAK1H,KAAK2e,KAAKzD,EAAK0C,IAAQ,EAElChD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKzD,EAAK2C,IAAQ,GACvB7d,KAAK2e,KAAKxD,EAAKyC,IAAQ,EACpClF,EAAMA,EAAK1Y,KAAK2e,KAAKxD,EAAK0C,IAAQ,EAKlC,IAAIoB,IAAQ9K,GAJZzM,EAAMA,EAAK1H,KAAK2e,KAAK5D,EAAKgD,IAAQ,GAIZ,KAAa,MAFnCnD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK5D,EAAKiD,IAAQ,GACvBhe,KAAK2e,KAAK3D,EAAK+C,IAAQ,KAEU,IAAO,EACrD5J,IAFAuE,EAAMA,EAAK1Y,KAAK2e,KAAK3D,EAAKgD,IAAQ,IAErBpD,IAAQ,IAAO,IAAMqE,KAAO,IAAO,EAChDA,IAAM,SAENvX,EAAK1H,KAAK2e,KAAKvC,EAAKS,GAEpBjC,GADAA,EAAM5a,KAAK2e,KAAKvC,EAAKU,IACR9c,KAAK2e,KAAKtC,EAAKQ,GAAQ,EACpCnE,EAAK1Y,KAAK2e,KAAKtC,EAAKS,GACpBpV,EAAMA,EAAK1H,KAAK2e,KAAK1C,EAAKe,GAAQ,EAElCpC,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK1C,EAAKgB,GAAQ,GACvBjd,KAAK2e,KAAKzC,EAAKc,GAAQ,EACpCtE,EAAMA,EAAK1Y,KAAK2e,KAAKzC,EAAKe,GAAQ,EAClCvV,EAAMA,EAAK1H,KAAK2e,KAAK7C,EAAKqB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK7C,EAAKsB,GAAQ,GACvBpd,KAAK2e,KAAK5C,EAAKoB,GAAQ,EACpCzE,EAAMA,EAAK1Y,KAAK2e,KAAK5C,EAAKqB,GAAQ,EAClC1V,EAAMA,EAAK1H,KAAK2e,KAAKhD,EAAK2B,GAAQ,EAElC1C,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKhD,EAAK4B,GAAQ,GACvBvd,KAAK2e,KAAK/C,EAAK0B,GAAQ,EACpC5E,EAAMA,EAAK1Y,KAAK2e,KAAK/C,EAAK2B,GAAQ,EAClC7V,EAAMA,EAAK1H,KAAK2e,KAAKnD,EAAKiC,GAAQ,EAElC7C,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKnD,EAAKkC,IAAQ,GACvB1d,KAAK2e,KAAKlD,EAAKgC,GAAQ,EACpC/E,EAAMA,EAAK1Y,KAAK2e,KAAKlD,EAAKiC,IAAQ,EAClChW,EAAMA,EAAK1H,KAAK2e,KAAKtD,EAAKuC,IAAQ,EAElChD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKtD,EAAKwC,IAAQ,GACvB7d,KAAK2e,KAAKrD,EAAKsC,IAAQ,EACpClF,EAAMA,EAAK1Y,KAAK2e,KAAKrD,EAAKuC,IAAQ,EAClCnW,EAAMA,EAAK1H,KAAK2e,KAAKzD,EAAK6C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKzD,EAAK8C,IAAQ,GACvBhe,KAAK2e,KAAKxD,EAAK4C,IAAQ,EACpCrF,EAAMA,EAAK1Y,KAAK2e,KAAKxD,EAAK6C,IAAQ,EAKlC,IAAIkB,IAAQ/K,GAJZzM,EAAMA,EAAK1H,KAAK2e,KAAK5D,EAAKmD,IAAQ,GAIZ,KAAa,MAFnCtD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK5D,EAAKoD,IAAQ,GACvBne,KAAK2e,KAAK3D,EAAKkD,IAAQ,KAEU,IAAO,EACrD/J,IAFAuE,EAAMA,EAAK1Y,KAAK2e,KAAK3D,EAAKmD,IAAQ,IAErBvD,IAAQ,IAAO,IAAMsE,KAAO,IAAO,EAChDA,IAAM,SAENxX,EAAK1H,KAAK2e,KAAKpC,EAAKM,GAEpBjC,GADAA,EAAM5a,KAAK2e,KAAKpC,EAAKO,IACR9c,KAAK2e,KAAKnC,EAAKK,GAAQ,EACpCnE,EAAK1Y,KAAK2e,KAAKnC,EAAKM,GACpBpV,EAAMA,EAAK1H,KAAK2e,KAAKvC,EAAKY,GAAQ,EAElCpC,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKvC,EAAKa,GAAQ,GACvBjd,KAAK2e,KAAKtC,EAAKW,GAAQ,EACpCtE,EAAMA,EAAK1Y,KAAK2e,KAAKtC,EAAKY,GAAQ,EAClCvV,EAAMA,EAAK1H,KAAK2e,KAAK1C,EAAKkB,GAAQ,EAElCvC,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK1C,EAAKmB,GAAQ,GACvBpd,KAAK2e,KAAKzC,EAAKiB,GAAQ,EACpCzE,EAAMA,EAAK1Y,KAAK2e,KAAKzC,EAAKkB,GAAQ,EAClC1V,EAAMA,EAAK1H,KAAK2e,KAAK7C,EAAKwB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK7C,EAAKyB,GAAQ,GACvBvd,KAAK2e,KAAK5C,EAAKuB,GAAQ,EACpC5E,EAAMA,EAAK1Y,KAAK2e,KAAK5C,EAAKwB,GAAQ,EAClC7V,EAAMA,EAAK1H,KAAK2e,KAAKhD,EAAK8B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKhD,EAAK+B,IAAQ,GACvB1d,KAAK2e,KAAK/C,EAAK6B,GAAQ,EACpC/E,EAAMA,EAAK1Y,KAAK2e,KAAK/C,EAAK8B,IAAQ,EAClChW,EAAMA,EAAK1H,KAAK2e,KAAKnD,EAAKoC,IAAQ,EAElChD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKnD,EAAKqC,IAAQ,GACvB7d,KAAK2e,KAAKlD,EAAKmC,IAAQ,EACpClF,EAAMA,EAAK1Y,KAAK2e,KAAKlD,EAAKoC,IAAQ,EAClCnW,EAAMA,EAAK1H,KAAK2e,KAAKtD,EAAK0C,IAAQ,EAElCnD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKtD,EAAK2C,IAAQ,GACvBhe,KAAK2e,KAAKrD,EAAKyC,IAAQ,EACpCrF,EAAMA,EAAK1Y,KAAK2e,KAAKrD,EAAK0C,IAAQ,EAClCtW,EAAMA,EAAK1H,KAAK2e,KAAKzD,EAAKgD,IAAQ,EAElCtD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKzD,EAAKiD,IAAQ,GACvBne,KAAK2e,KAAKxD,EAAK+C,IAAQ,EACpCxF,EAAMA,EAAK1Y,KAAK2e,KAAKxD,EAAKgD,IAAQ,EAKlC,IAAIgB,IAAQhL,GAJZzM,EAAMA,EAAK1H,KAAK2e,KAAK5D,EAAKsD,IAAQ,GAIZ,KAAa,MAFnCzD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK5D,EAAKuD,IAAQ,GACvBte,KAAK2e,KAAK3D,EAAKqD,IAAQ,KAEU,IAAO,EACrDlK,IAFAuE,EAAMA,EAAK1Y,KAAK2e,KAAK3D,EAAKsD,IAAQ,IAErB1D,IAAQ,IAAO,IAAMuE,KAAO,IAAO,EAChDA,IAAM,SAENzX,EAAK1H,KAAK2e,KAAKjC,EAAKG,GAEpBjC,GADAA,EAAM5a,KAAK2e,KAAKjC,EAAKI,IACR9c,KAAK2e,KAAKhC,EAAKE,GAAQ,EACpCnE,EAAK1Y,KAAK2e,KAAKhC,EAAKG,GACpBpV,EAAMA,EAAK1H,KAAK2e,KAAKpC,EAAKS,GAAQ,EAElCpC,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKpC,EAAKU,GAAQ,GACvBjd,KAAK2e,KAAKnC,EAAKQ,GAAQ,EACpCtE,EAAMA,EAAK1Y,KAAK2e,KAAKnC,EAAKS,GAAQ,EAClCvV,EAAMA,EAAK1H,KAAK2e,KAAKvC,EAAKe,GAAQ,EAElCvC,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKvC,EAAKgB,GAAQ,GACvBpd,KAAK2e,KAAKtC,EAAKc,GAAQ,EACpCzE,EAAMA,EAAK1Y,KAAK2e,KAAKtC,EAAKe,GAAQ,EAClC1V,EAAMA,EAAK1H,KAAK2e,KAAK1C,EAAKqB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK1C,EAAKsB,GAAQ,GACvBvd,KAAK2e,KAAKzC,EAAKoB,GAAQ,EACpC5E,EAAMA,EAAK1Y,KAAK2e,KAAKzC,EAAKqB,GAAQ,EAClC7V,EAAMA,EAAK1H,KAAK2e,KAAK7C,EAAK2B,GAAQ,EAElC7C,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK7C,EAAK4B,IAAQ,GACvB1d,KAAK2e,KAAK5C,EAAK0B,GAAQ,EACpC/E,EAAMA,EAAK1Y,KAAK2e,KAAK5C,EAAK2B,IAAQ,EAClChW,EAAMA,EAAK1H,KAAK2e,KAAKhD,EAAKiC,IAAQ,EAElChD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKhD,EAAKkC,IAAQ,GACvB7d,KAAK2e,KAAK/C,EAAKgC,IAAQ,EACpClF,EAAMA,EAAK1Y,KAAK2e,KAAK/C,EAAKiC,IAAQ,EAClCnW,EAAMA,EAAK1H,KAAK2e,KAAKnD,EAAKuC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKnD,EAAKwC,IAAQ,GACvBhe,KAAK2e,KAAKlD,EAAKsC,IAAQ,EACpCrF,EAAMA,EAAK1Y,KAAK2e,KAAKlD,EAAKuC,IAAQ,EAClCtW,EAAMA,EAAK1H,KAAK2e,KAAKtD,EAAK6C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKtD,EAAK8C,IAAQ,GACvBne,KAAK2e,KAAKrD,EAAK4C,IAAQ,EACpCxF,EAAMA,EAAK1Y,KAAK2e,KAAKrD,EAAK6C,IAAQ,EAClCzW,EAAMA,EAAK1H,KAAK2e,KAAKzD,EAAKmD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKzD,EAAKoD,IAAQ,GACvBte,KAAK2e,KAAKxD,EAAKkD,IAAQ,EACpC3F,EAAMA,EAAK1Y,KAAK2e,KAAKxD,EAAKmD,IAAQ,EAKlC,IAAIc,IAAQjL,GAJZzM,EAAMA,EAAK1H,KAAK2e,KAAK5D,EAAKyD,IAAQ,GAIZ,KAAa,MAFnC5D,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK5D,EAAK0D,IAAQ,GACvBze,KAAK2e,KAAK3D,EAAKwD,IAAQ,KAEU,IAAO,EACrDrK,IAFAuE,EAAMA,EAAK1Y,KAAK2e,KAAK3D,EAAKyD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMwE,KAAO,IAAO,EAChDA,IAAM,SAEN1X,EAAK1H,KAAK2e,KAAKjC,EAAKM,GAEpBpC,GADAA,EAAM5a,KAAK2e,KAAKjC,EAAKO,IACRjd,KAAK2e,KAAKhC,EAAKK,GAAQ,EACpCtE,EAAK1Y,KAAK2e,KAAKhC,EAAKM,GACpBvV,EAAMA,EAAK1H,KAAK2e,KAAKpC,EAAKY,GAAQ,EAElCvC,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKpC,EAAKa,GAAQ,GACvBpd,KAAK2e,KAAKnC,EAAKW,GAAQ,EACpCzE,EAAMA,EAAK1Y,KAAK2e,KAAKnC,EAAKY,GAAQ,EAClC1V,EAAMA,EAAK1H,KAAK2e,KAAKvC,EAAKkB,GAAQ,EAElC1C,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKvC,EAAKmB,GAAQ,GACvBvd,KAAK2e,KAAKtC,EAAKiB,GAAQ,EACpC5E,EAAMA,EAAK1Y,KAAK2e,KAAKtC,EAAKkB,GAAQ,EAClC7V,EAAMA,EAAK1H,KAAK2e,KAAK1C,EAAKwB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK1C,EAAKyB,IAAQ,GACvB1d,KAAK2e,KAAKzC,EAAKuB,GAAQ,EACpC/E,EAAMA,EAAK1Y,KAAK2e,KAAKzC,EAAKwB,IAAQ,EAClChW,EAAMA,EAAK1H,KAAK2e,KAAK7C,EAAK8B,IAAQ,EAElChD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK7C,EAAK+B,IAAQ,GACvB7d,KAAK2e,KAAK5C,EAAK6B,IAAQ,EACpClF,EAAMA,EAAK1Y,KAAK2e,KAAK5C,EAAK8B,IAAQ,EAClCnW,EAAMA,EAAK1H,KAAK2e,KAAKhD,EAAKoC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKhD,EAAKqC,IAAQ,GACvBhe,KAAK2e,KAAK/C,EAAKmC,IAAQ,EACpCrF,EAAMA,EAAK1Y,KAAK2e,KAAK/C,EAAKoC,IAAQ,EAClCtW,EAAMA,EAAK1H,KAAK2e,KAAKnD,EAAK0C,IAAQ,EAElCtD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKnD,EAAK2C,IAAQ,GACvBne,KAAK2e,KAAKlD,EAAKyC,IAAQ,EACpCxF,EAAMA,EAAK1Y,KAAK2e,KAAKlD,EAAK0C,IAAQ,EAClCzW,EAAMA,EAAK1H,KAAK2e,KAAKtD,EAAKgD,IAAQ,EAElCzD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKtD,EAAKiD,IAAQ,GACvBte,KAAK2e,KAAKrD,EAAK+C,IAAQ,EACpC3F,EAAMA,EAAK1Y,KAAK2e,KAAKrD,EAAKgD,IAAQ,EAKlC,IAAIe,IAASlL,GAJbzM,EAAMA,EAAK1H,KAAK2e,KAAKzD,EAAKsD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKzD,EAAKuD,IAAQ,GACvBze,KAAK2e,KAAKxD,EAAKqD,IAAQ,KAEW,IAAO,EACtDrK,IAFAuE,EAAMA,EAAK1Y,KAAK2e,KAAKxD,EAAKsD,IAAQ,IAErB7D,IAAQ,IAAO,IAAMyE,KAAQ,IAAO,EACjDA,IAAO,SAEP3X,EAAK1H,KAAK2e,KAAKjC,EAAKS,GAEpBvC,GADAA,EAAM5a,KAAK2e,KAAKjC,EAAKU,IACRpd,KAAK2e,KAAKhC,EAAKQ,GAAQ,EACpCzE,EAAK1Y,KAAK2e,KAAKhC,EAAKS,GACpB1V,EAAMA,EAAK1H,KAAK2e,KAAKpC,EAAKe,GAAQ,EAElC1C,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKpC,EAAKgB,GAAQ,GACvBvd,KAAK2e,KAAKnC,EAAKc,GAAQ,EACpC5E,EAAMA,EAAK1Y,KAAK2e,KAAKnC,EAAKe,GAAQ,EAClC7V,EAAMA,EAAK1H,KAAK2e,KAAKvC,EAAKqB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKvC,EAAKsB,IAAQ,GACvB1d,KAAK2e,KAAKtC,EAAKoB,GAAQ,EACpC/E,EAAMA,EAAK1Y,KAAK2e,KAAKtC,EAAKqB,IAAQ,EAClChW,EAAMA,EAAK1H,KAAK2e,KAAK1C,EAAK2B,IAAQ,EAElChD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK1C,EAAK4B,IAAQ,GACvB7d,KAAK2e,KAAKzC,EAAK0B,IAAQ,EACpClF,EAAMA,EAAK1Y,KAAK2e,KAAKzC,EAAK2B,IAAQ,EAClCnW,EAAMA,EAAK1H,KAAK2e,KAAK7C,EAAKiC,IAAQ,EAElCnD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK7C,EAAKkC,IAAQ,GACvBhe,KAAK2e,KAAK5C,EAAKgC,IAAQ,EACpCrF,EAAMA,EAAK1Y,KAAK2e,KAAK5C,EAAKiC,IAAQ,EAClCtW,EAAMA,EAAK1H,KAAK2e,KAAKhD,EAAKuC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKhD,EAAKwC,IAAQ,GACvBne,KAAK2e,KAAK/C,EAAKsC,IAAQ,EACpCxF,EAAMA,EAAK1Y,KAAK2e,KAAK/C,EAAKuC,IAAQ,EAClCzW,EAAMA,EAAK1H,KAAK2e,KAAKnD,EAAK6C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKnD,EAAK8C,IAAQ,GACvBte,KAAK2e,KAAKlD,EAAK4C,IAAQ,EACpC3F,EAAMA,EAAK1Y,KAAK2e,KAAKlD,EAAK6C,IAAQ,EAKlC,IAAIgB,IAASnL,GAJbzM,EAAMA,EAAK1H,KAAK2e,KAAKtD,EAAKmD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKtD,EAAKoD,IAAQ,GACvBze,KAAK2e,KAAKrD,EAAKkD,IAAQ,KAEW,IAAO,EACtDrK,IAFAuE,EAAMA,EAAK1Y,KAAK2e,KAAKrD,EAAKmD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM0E,KAAQ,IAAO,EACjDA,IAAO,SAEP5X,EAAK1H,KAAK2e,KAAKjC,EAAKY,GAEpB1C,GADAA,EAAM5a,KAAK2e,KAAKjC,EAAKa,IACRvd,KAAK2e,KAAKhC,EAAKW,GAAQ,EACpC5E,EAAK1Y,KAAK2e,KAAKhC,EAAKY,GACpB7V,EAAMA,EAAK1H,KAAK2e,KAAKpC,EAAKkB,GAAQ,EAElC7C,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKpC,EAAKmB,IAAQ,GACvB1d,KAAK2e,KAAKnC,EAAKiB,GAAQ,EACpC/E,EAAMA,EAAK1Y,KAAK2e,KAAKnC,EAAKkB,IAAQ,EAClChW,EAAMA,EAAK1H,KAAK2e,KAAKvC,EAAKwB,IAAQ,EAElChD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKvC,EAAKyB,IAAQ,GACvB7d,KAAK2e,KAAKtC,EAAKuB,IAAQ,EACpClF,EAAMA,EAAK1Y,KAAK2e,KAAKtC,EAAKwB,IAAQ,EAClCnW,EAAMA,EAAK1H,KAAK2e,KAAK1C,EAAK8B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK1C,EAAK+B,IAAQ,GACvBhe,KAAK2e,KAAKzC,EAAK6B,IAAQ,EACpCrF,EAAMA,EAAK1Y,KAAK2e,KAAKzC,EAAK8B,IAAQ,EAClCtW,EAAMA,EAAK1H,KAAK2e,KAAK7C,EAAKoC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK7C,EAAKqC,IAAQ,GACvBne,KAAK2e,KAAK5C,EAAKmC,IAAQ,EACpCxF,EAAMA,EAAK1Y,KAAK2e,KAAK5C,EAAKoC,IAAQ,EAClCzW,EAAMA,EAAK1H,KAAK2e,KAAKhD,EAAK0C,IAAQ,EAElCzD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKhD,EAAK2C,IAAQ,GACvBte,KAAK2e,KAAK/C,EAAKyC,IAAQ,EACpC3F,EAAMA,EAAK1Y,KAAK2e,KAAK/C,EAAK0C,IAAQ,EAKlC,IAAIiB,IAASpL,GAJbzM,EAAMA,EAAK1H,KAAK2e,KAAKnD,EAAKgD,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKnD,EAAKiD,IAAQ,GACvBze,KAAK2e,KAAKlD,EAAK+C,IAAQ,KAEW,IAAO,EACtDrK,IAFAuE,EAAMA,EAAK1Y,KAAK2e,KAAKlD,EAAKgD,IAAQ,IAErB7D,IAAQ,IAAO,IAAM2E,KAAQ,IAAO,EACjDA,IAAO,SAEP7X,EAAK1H,KAAK2e,KAAKjC,EAAKe,GAEpB7C,GADAA,EAAM5a,KAAK2e,KAAKjC,EAAKgB,KACR1d,KAAK2e,KAAKhC,EAAKc,GAAQ,EACpC/E,EAAK1Y,KAAK2e,KAAKhC,EAAKe,IACpBhW,EAAMA,EAAK1H,KAAK2e,KAAKpC,EAAKqB,IAAQ,EAElChD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKpC,EAAKsB,IAAQ,GACvB7d,KAAK2e,KAAKnC,EAAKoB,IAAQ,EACpClF,EAAMA,EAAK1Y,KAAK2e,KAAKnC,EAAKqB,IAAQ,EAClCnW,EAAMA,EAAK1H,KAAK2e,KAAKvC,EAAK2B,IAAQ,EAElCnD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKvC,EAAK4B,IAAQ,GACvBhe,KAAK2e,KAAKtC,EAAK0B,IAAQ,EACpCrF,EAAMA,EAAK1Y,KAAK2e,KAAKtC,EAAK2B,IAAQ,EAClCtW,EAAMA,EAAK1H,KAAK2e,KAAK1C,EAAKiC,IAAQ,EAElCtD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK1C,EAAKkC,IAAQ,GACvBne,KAAK2e,KAAKzC,EAAKgC,IAAQ,EACpCxF,EAAMA,EAAK1Y,KAAK2e,KAAKzC,EAAKiC,IAAQ,EAClCzW,EAAMA,EAAK1H,KAAK2e,KAAK7C,EAAKuC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK7C,EAAKwC,IAAQ,GACvBte,KAAK2e,KAAK5C,EAAKsC,IAAQ,EACpC3F,EAAMA,EAAK1Y,KAAK2e,KAAK5C,EAAKuC,IAAQ,EAKlC,IAAIkB,IAASrL,GAJbzM,EAAMA,EAAK1H,KAAK2e,KAAKhD,EAAK6C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKhD,EAAK8C,IAAQ,GACvBze,KAAK2e,KAAK/C,EAAK4C,IAAQ,KAEW,IAAO,EACtDrK,IAFAuE,EAAMA,EAAK1Y,KAAK2e,KAAK/C,EAAK6C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM4E,KAAQ,IAAO,EACjDA,IAAO,SAEP9X,EAAK1H,KAAK2e,KAAKjC,EAAKkB,IAEpBhD,GADAA,EAAM5a,KAAK2e,KAAKjC,EAAKmB,KACR7d,KAAK2e,KAAKhC,EAAKiB,IAAQ,EACpClF,EAAK1Y,KAAK2e,KAAKhC,EAAKkB,IACpBnW,EAAMA,EAAK1H,KAAK2e,KAAKpC,EAAKwB,IAAQ,EAElCnD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKpC,EAAKyB,IAAQ,GACvBhe,KAAK2e,KAAKnC,EAAKuB,IAAQ,EACpCrF,EAAMA,EAAK1Y,KAAK2e,KAAKnC,EAAKwB,IAAQ,EAClCtW,EAAMA,EAAK1H,KAAK2e,KAAKvC,EAAK8B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKvC,EAAK+B,IAAQ,GACvBne,KAAK2e,KAAKtC,EAAK6B,IAAQ,EACpCxF,EAAMA,EAAK1Y,KAAK2e,KAAKtC,EAAK8B,IAAQ,EAClCzW,EAAMA,EAAK1H,KAAK2e,KAAK1C,EAAKoC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK1C,EAAKqC,IAAQ,GACvBte,KAAK2e,KAAKzC,EAAKmC,IAAQ,EACpC3F,EAAMA,EAAK1Y,KAAK2e,KAAKzC,EAAKoC,IAAQ,EAKlC,IAAImB,IAAStL,GAJbzM,EAAMA,EAAK1H,KAAK2e,KAAK7C,EAAK0C,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK7C,EAAK2C,IAAQ,GACvBze,KAAK2e,KAAK5C,EAAKyC,IAAQ,KAEW,IAAO,EACtDrK,IAFAuE,EAAMA,EAAK1Y,KAAK2e,KAAK5C,EAAK0C,IAAQ,IAErB7D,IAAQ,IAAO,IAAM6E,KAAQ,IAAO,EACjDA,IAAO,SAEP/X,EAAK1H,KAAK2e,KAAKjC,EAAKqB,IAEpBnD,GADAA,EAAM5a,KAAK2e,KAAKjC,EAAKsB,KACRhe,KAAK2e,KAAKhC,EAAKoB,IAAQ,EACpCrF,EAAK1Y,KAAK2e,KAAKhC,EAAKqB,IACpBtW,EAAMA,EAAK1H,KAAK2e,KAAKpC,EAAK2B,IAAQ,EAElCtD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKpC,EAAK4B,IAAQ,GACvBne,KAAK2e,KAAKnC,EAAK0B,IAAQ,EACpCxF,EAAMA,EAAK1Y,KAAK2e,KAAKnC,EAAK2B,IAAQ,EAClCzW,EAAMA,EAAK1H,KAAK2e,KAAKvC,EAAKiC,IAAQ,EAElCzD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKvC,EAAKkC,IAAQ,GACvBte,KAAK2e,KAAKtC,EAAKgC,IAAQ,EACpC3F,EAAMA,EAAK1Y,KAAK2e,KAAKtC,EAAKiC,IAAQ,EAKlC,IAAIoB,IAASvL,GAJbzM,EAAMA,EAAK1H,KAAK2e,KAAK1C,EAAKuC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM5a,KAAK2e,KAAK1C,EAAKwC,IAAQ,GACvBze,KAAK2e,KAAKzC,EAAKsC,IAAQ,KAEW,IAAO,EACtDrK,IAFAuE,EAAMA,EAAK1Y,KAAK2e,KAAKzC,EAAKuC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM8E,KAAQ,IAAO,EACjDA,IAAO,SAEPhY,EAAK1H,KAAK2e,KAAKjC,EAAKwB,IAEpBtD,GADAA,EAAM5a,KAAK2e,KAAKjC,EAAKyB,KACRne,KAAK2e,KAAKhC,EAAKuB,IAAQ,EACpCxF,EAAK1Y,KAAK2e,KAAKhC,EAAKwB,IACpBzW,EAAMA,EAAK1H,KAAK2e,KAAKpC,EAAK8B,IAAQ,EAElCzD,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKpC,EAAK+B,IAAQ,GACvBte,KAAK2e,KAAKnC,EAAK6B,IAAQ,EACpC3F,EAAMA,EAAK1Y,KAAK2e,KAAKnC,EAAK8B,IAAQ,EAKlC,IAAIqB,IAASxL,GAJbzM,EAAMA,EAAK1H,KAAK2e,KAAKvC,EAAKoC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKvC,EAAKqC,IAAQ,GACvBze,KAAK2e,KAAKtC,EAAKmC,IAAQ,KAEW,IAAO,EACtDrK,IAFAuE,EAAMA,EAAK1Y,KAAK2e,KAAKtC,EAAKoC,IAAQ,IAErB7D,IAAQ,IAAO,IAAM+E,KAAQ,IAAO,EACjDA,IAAO,SAEPjY,EAAK1H,KAAK2e,KAAKjC,EAAK2B,IAEpBzD,GADAA,EAAM5a,KAAK2e,KAAKjC,EAAK4B,KACRte,KAAK2e,KAAKhC,EAAK0B,IAAQ,EACpC3F,EAAK1Y,KAAK2e,KAAKhC,EAAK2B,IAKpB,IAAIsB,IAASzL,GAJbzM,EAAMA,EAAK1H,KAAK2e,KAAKpC,EAAKiC,IAAQ,GAIX,KAAa,MAFpC5D,GADAA,EAAOA,EAAM5a,KAAK2e,KAAKpC,EAAKkC,IAAQ,GACvBze,KAAK2e,KAAKnC,EAAKgC,IAAQ,KAEW,IAAO,EACtDrK,IAFAuE,EAAMA,EAAK1Y,KAAK2e,KAAKnC,EAAKiC,IAAQ,IAErB7D,IAAQ,IAAO,IAAMgF,KAAQ,IAAO,EACjDA,IAAO,SAMP,IAAIC,IAAS1L,GAJbzM,EAAK1H,KAAK2e,KAAKjC,EAAK8B,KAIG,KAAa,MAFpC5D,GADAA,EAAM5a,KAAK2e,KAAKjC,EAAK+B,KACRze,KAAK2e,KAAKhC,EAAK6B,IAAQ,KAEW,IAAO,EA0BtD,OAzBArK,IAFAuE,EAAK1Y,KAAK2e,KAAKhC,EAAK8B,MAEP7D,IAAQ,IAAO,IAAMiF,KAAQ,IAAO,EACjDA,IAAO,SACPhF,EAAE,GAAK6D,GACP7D,EAAE,GAAK+D,GACP/D,EAAE,GAAKgE,GACPhE,EAAE,GAAKiE,GACPjE,EAAE,GAAKkE,GACPlE,EAAE,GAAKmE,GACPnE,EAAE,GAAKoE,GACPpE,EAAE,GAAKqE,GACPrE,EAAE,GAAKsE,GACPtE,EAAE,GAAKuE,GACPvE,EAAE,IAAMwE,GACRxE,EAAE,IAAMyE,GACRzE,EAAE,IAAM0E,GACR1E,EAAE,IAAM2E,GACR3E,EAAE,IAAM4E,GACR5E,EAAE,IAAM6E,GACR7E,EAAE,IAAM8E,GACR9E,EAAE,IAAM+E,GACR/E,EAAE,IAAMgF,GACE,IAAN1L,IACF0G,EAAE,IAAM1G,EACRyC,EAAIxY,UAECwY,CACX,EAOE,SAASkJ,EAAUnJ,EAAM9B,EAAK+B,GAC5BA,EAAIlD,SAAWmB,EAAInB,SAAWiD,EAAKjD,SACnCkD,EAAIxY,OAASuY,EAAKvY,OAASyW,EAAIzW,OAI/B,IAFA,IAAIyY,EAAQ,EACRkJ,EAAU,EACLjJ,EAAI,EAAGA,EAAIF,EAAIxY,OAAS,EAAG0Y,IAAK,CAGvC,IAAIC,EAASgJ,EACbA,EAAU,EAGV,IAFA,IAAI/I,EAAgB,SAARH,EACRI,EAAOjX,KAAKoD,IAAI0T,EAAGjC,EAAIzW,OAAS,GAC3B2B,EAAIC,KAAKqD,IAAI,EAAGyT,EAAIH,EAAKvY,OAAS,GAAI2B,GAAKkX,EAAMlX,IAAK,CAC7D,IAAIzB,EAAIwY,EAAI/W,EAGRwU,GAFoB,EAAhBoC,EAAKhD,MAAMrV,KACI,EAAfuW,EAAIlB,MAAM5T,IAGd2H,EAAS,SAAJ6M,EAGTyC,EAAa,UADbtP,EAAMA,EAAKsP,EAAS,GAIpB+I,IAFAhJ,GAHAA,EAAUA,GAAWxC,EAAI,SAAa,GAAM,IAGxB7M,IAAO,IAAO,KAEZ,GACtBqP,GAAU,QACX,CACDH,EAAIjD,MAAMmD,GAAKE,EACfH,EAAQE,EACRA,EAASgJ,CACV,CAOD,OANc,IAAVlJ,EACFD,EAAIjD,MAAMmD,GAAKD,EAEfD,EAAIxY,SAGCwY,EAAInB,QACZ,CAED,SAASuK,EAAYrJ,EAAM9B,EAAK+B,GAI9B,OAAOkJ,EAASnJ,EAAM9B,EAAK+B,EAC5B,CAlDI5W,KAAK2e,OACRhE,EAAcjE,GAmDhBrD,EAAGjM,UAAU6Y,MAAQ,SAAgBpL,EAAK+B,GACxC,IACIjC,EAAMnO,KAAKpI,OAASyW,EAAIzW,OAW5B,OAVoB,KAAhBoI,KAAKpI,QAAgC,KAAfyW,EAAIzW,OACtBuc,EAAYnU,KAAMqO,EAAK+B,GACpBjC,EAAM,GACT+B,EAAWlQ,KAAMqO,EAAK+B,GACnBjC,EAAM,KACTmL,EAAStZ,KAAMqO,EAAK+B,GAEpBoJ,EAAWxZ,KAAMqO,EAAK+B,EAIlC,EAuMEvD,EAAGjM,UAAUvG,IAAM,SAAcgU,GAC/B,IAAI+B,EAAM,IAAIvD,EAAG,MAEjB,OADAuD,EAAIjD,MAAQ,IAAIxV,MAAMqI,KAAKpI,OAASyW,EAAIzW,QACjCoI,KAAKyZ,MAAMpL,EAAK+B,EAC3B,EAGEvD,EAAGjM,UAAU8Y,KAAO,SAAerL,GACjC,IAAI+B,EAAM,IAAIvD,EAAG,MAEjB,OADAuD,EAAIjD,MAAQ,IAAIxV,MAAMqI,KAAKpI,OAASyW,EAAIzW,QACjC4hB,EAAWxZ,KAAMqO,EAAK+B,EACjC,EAGEvD,EAAGjM,UAAUuX,KAAO,SAAe9J,GACjC,OAAOrO,KAAKwP,QAAQiK,MAAMpL,EAAKrO,KACnC,EAEE6M,EAAGjM,UAAUyO,MAAQ,SAAgBhB,GACnC,IAAIsL,EAAWtL,EAAM,EACjBsL,IAAUtL,GAAOA,GAErBhC,EAAsB,iBAARgC,GACdhC,EAAOgC,EAAM,UAIb,IADA,IAAIgC,EAAQ,EACHvY,EAAI,EAAGA,EAAIkI,KAAKpI,OAAQE,IAAK,CACpC,IAAIiX,GAAqB,EAAhB/O,KAAKmN,MAAMrV,IAAUuW,EAC1BnN,GAAU,SAAJ6N,IAA0B,SAARsB,GAC5BA,IAAU,GACVA,GAAUtB,EAAI,SAAa,EAE3BsB,GAASnP,IAAO,GAChBlB,KAAKmN,MAAMrV,GAAU,SAALoJ,CACjB,CAOD,OALc,IAAVmP,IACFrQ,KAAKmN,MAAMrV,GAAKuY,EAChBrQ,KAAKpI,UAGA+hB,EAAW3Z,KAAK4S,OAAS5S,IACpC,EAEE6M,EAAGjM,UAAUgZ,KAAO,SAAevL,GACjC,OAAOrO,KAAKwP,QAAQH,MAAMhB,EAC9B,EAGExB,EAAGjM,UAAUiZ,IAAM,WACjB,OAAO7Z,KAAK3F,IAAI2F,KACpB,EAGE6M,EAAGjM,UAAUkZ,KAAO,WAClB,OAAO9Z,KAAKmY,KAAKnY,KAAKwP,QAC1B,EAGE3C,EAAGjM,UAAUqC,IAAM,SAAcoL,GAC/B,IAAIU,EA7xCN,SAAqBV,GAGnB,IAFA,IAAIU,EAAI,IAAIpX,MAAM0W,EAAI4D,aAEb6B,EAAM,EAAGA,EAAM/E,EAAEnX,OAAQkc,IAAO,CACvC,IAAI9E,EAAO8E,EAAM,GAAM,EACnBC,EAAOD,EAAM,GAEjB/E,EAAE+E,GAAQzF,EAAIlB,MAAM6B,KAAS+E,EAAQ,CACtC,CAED,OAAOhF,CACR,CAkxCSgL,CAAW1L,GACnB,GAAiB,IAAbU,EAAEnX,OAAc,OAAO,IAAIiV,EAAG,GAIlC,IADA,IAAI0E,EAAMvR,KACDlI,EAAI,EAAGA,EAAIiX,EAAEnX,QACP,IAATmX,EAAEjX,GADsBA,IAAKyZ,EAAMA,EAAIsI,OAI7C,KAAM/hB,EAAIiX,EAAEnX,OACV,IAAK,IAAIoiB,EAAIzI,EAAIsI,MAAO/hB,EAAIiX,EAAEnX,OAAQE,IAAKkiB,EAAIA,EAAEH,MAClC,IAAT9K,EAAEjX,KAENyZ,EAAMA,EAAIlX,IAAI2f,IAIlB,OAAOzI,CACX,EAGE1E,EAAGjM,UAAUqZ,OAAS,SAAiB3R,GACrC+D,EAAuB,iBAAT/D,GAAqBA,GAAQ,GAC3C,IAGIxQ,EAHAiW,EAAIzF,EAAO,GACX4R,GAAK5R,EAAOyF,GAAK,GACjBoM,EAAa,WAAe,GAAKpM,GAAQ,GAAKA,EAGlD,GAAU,IAANA,EAAS,CACX,IAAIsC,EAAQ,EAEZ,IAAKvY,EAAI,EAAGA,EAAIkI,KAAKpI,OAAQE,IAAK,CAChC,IAAIsiB,EAAWpa,KAAKmN,MAAMrV,GAAKqiB,EAC3BxM,GAAsB,EAAhB3N,KAAKmN,MAAMrV,IAAUsiB,GAAarM,EAC5C/N,KAAKmN,MAAMrV,GAAK6V,EAAI0C,EACpBA,EAAQ+J,IAAc,GAAKrM,CAC5B,CAEGsC,IACFrQ,KAAKmN,MAAMrV,GAAKuY,EAChBrQ,KAAKpI,SAER,CAED,GAAU,IAANsiB,EAAS,CACX,IAAKpiB,EAAIkI,KAAKpI,OAAS,EAAGE,GAAK,EAAGA,IAChCkI,KAAKmN,MAAMrV,EAAIoiB,GAAKla,KAAKmN,MAAMrV,GAGjC,IAAKA,EAAI,EAAGA,EAAIoiB,EAAGpiB,IACjBkI,KAAKmN,MAAMrV,GAAK,EAGlBkI,KAAKpI,QAAUsiB,CAChB,CAED,OAAOla,KAAKiP,QAChB,EAEEpC,EAAGjM,UAAUyZ,MAAQ,SAAgB/R,GAGnC,OADA+D,EAAyB,IAAlBrM,KAAKkN,UACLlN,KAAKia,OAAO3R,EACvB,EAKEuE,EAAGjM,UAAU0Z,OAAS,SAAiBhS,EAAMiS,EAAMC,GAEjD,IAAIC,EADJpO,EAAuB,iBAAT/D,GAAqBA,GAAQ,GAGzCmS,EADEF,GACGA,EAAQA,EAAO,IAAO,GAEvB,EAGN,IAAIxM,EAAIzF,EAAO,GACX4R,EAAI1gB,KAAKoD,KAAK0L,EAAOyF,GAAK,GAAI/N,KAAKpI,QACnC8iB,EAAO,SAAc,WAAc3M,GAAMA,EACzC4M,EAAcH,EAMlB,GAJAC,GAAKP,EACLO,EAAIjhB,KAAKqD,IAAI,EAAG4d,GAGZE,EAAa,CACf,IAAK,IAAI7iB,EAAI,EAAGA,EAAIoiB,EAAGpiB,IACrB6iB,EAAYxN,MAAMrV,GAAKkI,KAAKmN,MAAMrV,GAEpC6iB,EAAY/iB,OAASsiB,CACtB,CAED,GAAU,IAANA,QAEG,GAAIla,KAAKpI,OAASsiB,EAEvB,IADAla,KAAKpI,QAAUsiB,EACVpiB,EAAI,EAAGA,EAAIkI,KAAKpI,OAAQE,IAC3BkI,KAAKmN,MAAMrV,GAAKkI,KAAKmN,MAAMrV,EAAIoiB,QAGjCla,KAAKmN,MAAM,GAAK,EAChBnN,KAAKpI,OAAS,EAGhB,IAAIyY,EAAQ,EACZ,IAAKvY,EAAIkI,KAAKpI,OAAS,EAAGE,GAAK,IAAgB,IAAVuY,GAAevY,GAAK2iB,GAAI3iB,IAAK,CAChE,IAAImQ,EAAuB,EAAhBjI,KAAKmN,MAAMrV,GACtBkI,KAAKmN,MAAMrV,GAAMuY,GAAU,GAAKtC,EAAO9F,IAAS8F,EAChDsC,EAAQpI,EAAOyS,CAChB,CAYD,OATIC,GAAyB,IAAVtK,IACjBsK,EAAYxN,MAAMwN,EAAY/iB,UAAYyY,GAGxB,IAAhBrQ,KAAKpI,SACPoI,KAAKmN,MAAM,GAAK,EAChBnN,KAAKpI,OAAS,GAGToI,KAAKiP,QAChB,EAEEpC,EAAGjM,UAAUga,MAAQ,SAAgBtS,EAAMiS,EAAMC,GAG/C,OADAnO,EAAyB,IAAlBrM,KAAKkN,UACLlN,KAAKsa,OAAOhS,EAAMiS,EAAMC,EACnC,EAGE3N,EAAGjM,UAAUia,KAAO,SAAevS,GACjC,OAAOtI,KAAKwP,QAAQ6K,MAAM/R,EAC9B,EAEEuE,EAAGjM,UAAUka,MAAQ,SAAgBxS,GACnC,OAAOtI,KAAKwP,QAAQyK,OAAO3R,EAC/B,EAGEuE,EAAGjM,UAAUma,KAAO,SAAezS,GACjC,OAAOtI,KAAKwP,QAAQoL,MAAMtS,EAC9B,EAEEuE,EAAGjM,UAAUoa,MAAQ,SAAgB1S,GACnC,OAAOtI,KAAKwP,QAAQ8K,OAAOhS,EAC/B,EAGEuE,EAAGjM,UAAU8R,MAAQ,SAAgBoB,GACnCzH,EAAsB,iBAARyH,GAAoBA,GAAO,GACzC,IAAI/F,EAAI+F,EAAM,GACVoG,GAAKpG,EAAM/F,GAAK,GAChBiM,EAAI,GAAKjM,EAGb,OAAI/N,KAAKpI,QAAUsiB,EAAU,KAGrBla,KAAKmN,MAAM+M,GAELF,EAClB,EAGEnN,EAAGjM,UAAUqa,OAAS,SAAiB3S,GACrC+D,EAAuB,iBAAT/D,GAAqBA,GAAQ,GAC3C,IAAIyF,EAAIzF,EAAO,GACX4R,GAAK5R,EAAOyF,GAAK,GAIrB,GAFA1B,EAAyB,IAAlBrM,KAAKkN,SAAgB,2CAExBlN,KAAKpI,QAAUsiB,EACjB,OAAOla,KAQT,GALU,IAAN+N,GACFmM,IAEFla,KAAKpI,OAAS4B,KAAKoD,IAAIsd,EAAGla,KAAKpI,QAErB,IAANmW,EAAS,CACX,IAAI2M,EAAO,SAAc,WAAc3M,GAAMA,EAC7C/N,KAAKmN,MAAMnN,KAAKpI,OAAS,IAAM8iB,CAChC,CAED,OAAO1a,KAAKiP,QAChB,EAGEpC,EAAGjM,UAAUsa,MAAQ,SAAgB5S,GACnC,OAAOtI,KAAKwP,QAAQyL,OAAO3S,EAC/B,EAGEuE,EAAGjM,UAAU4R,MAAQ,SAAgBnE,GAGnC,OAFAhC,EAAsB,iBAARgC,GACdhC,EAAOgC,EAAM,UACTA,EAAM,EAAUrO,KAAKmb,OAAO9M,GAGV,IAAlBrO,KAAKkN,SACa,IAAhBlN,KAAKpI,SAAiC,EAAhBoI,KAAKmN,MAAM,KAAWkB,GAC9CrO,KAAKmN,MAAM,GAAKkB,GAAuB,EAAhBrO,KAAKmN,MAAM,IAClCnN,KAAKkN,SAAW,EACTlN,OAGTA,KAAKkN,SAAW,EAChBlN,KAAKmb,MAAM9M,GACXrO,KAAKkN,SAAW,EACTlN,MAIFA,KAAKsP,OAAOjB,EACvB,EAEExB,EAAGjM,UAAU0O,OAAS,SAAiBjB,GACrCrO,KAAKmN,MAAM,IAAMkB,EAGjB,IAAK,IAAIvW,EAAI,EAAGA,EAAIkI,KAAKpI,QAAUoI,KAAKmN,MAAMrV,IAAM,SAAWA,IAC7DkI,KAAKmN,MAAMrV,IAAM,SACbA,IAAMkI,KAAKpI,OAAS,EACtBoI,KAAKmN,MAAMrV,EAAI,GAAK,EAEpBkI,KAAKmN,MAAMrV,EAAI,KAKnB,OAFAkI,KAAKpI,OAAS4B,KAAKqD,IAAImD,KAAKpI,OAAQE,EAAI,GAEjCkI,IACX,EAGE6M,EAAGjM,UAAUua,MAAQ,SAAgB9M,GAGnC,GAFAhC,EAAsB,iBAARgC,GACdhC,EAAOgC,EAAM,UACTA,EAAM,EAAG,OAAOrO,KAAKwS,OAAOnE,GAEhC,GAAsB,IAAlBrO,KAAKkN,SAIP,OAHAlN,KAAKkN,SAAW,EAChBlN,KAAKwS,MAAMnE,GACXrO,KAAKkN,SAAW,EACTlN,KAKT,GAFAA,KAAKmN,MAAM,IAAMkB,EAEG,IAAhBrO,KAAKpI,QAAgBoI,KAAKmN,MAAM,GAAK,EACvCnN,KAAKmN,MAAM,IAAMnN,KAAKmN,MAAM,GAC5BnN,KAAKkN,SAAW,OAGhB,IAAK,IAAIpV,EAAI,EAAGA,EAAIkI,KAAKpI,QAAUoI,KAAKmN,MAAMrV,GAAK,EAAGA,IACpDkI,KAAKmN,MAAMrV,IAAM,SACjBkI,KAAKmN,MAAMrV,EAAI,IAAM,EAIzB,OAAOkI,KAAKiP,QAChB,EAEEpC,EAAGjM,UAAUwa,KAAO,SAAe/M,GACjC,OAAOrO,KAAKwP,QAAQgD,MAAMnE,EAC9B,EAEExB,EAAGjM,UAAUya,KAAO,SAAehN,GACjC,OAAOrO,KAAKwP,QAAQ2L,MAAM9M,EAC9B,EAEExB,EAAGjM,UAAU0a,KAAO,WAGlB,OAFAtb,KAAKkN,SAAW,EAETlN,IACX,EAEE6M,EAAGjM,UAAU0R,IAAM,WACjB,OAAOtS,KAAKwP,QAAQ8L,MACxB,EAEEzO,EAAGjM,UAAU2a,aAAe,SAAuBlN,EAAKhU,EAAK4L,GAC3D,IACInO,EAIAiX,EALAZ,EAAME,EAAIzW,OAASqO,EAGvBjG,KAAKyP,QAAQtB,GAGb,IAAIkC,EAAQ,EACZ,IAAKvY,EAAI,EAAGA,EAAIuW,EAAIzW,OAAQE,IAAK,CAC/BiX,GAA6B,EAAxB/O,KAAKmN,MAAMrV,EAAImO,IAAcoK,EAClC,IAAI9B,GAAwB,EAAfF,EAAIlB,MAAMrV,IAAUuC,EAEjCgW,IADAtB,GAAa,SAARR,IACS,KAAQA,EAAQ,SAAa,GAC3CvO,KAAKmN,MAAMrV,EAAImO,GAAa,SAAJ8I,CACzB,CACD,KAAOjX,EAAIkI,KAAKpI,OAASqO,EAAOnO,IAE9BuY,GADAtB,GAA6B,EAAxB/O,KAAKmN,MAAMrV,EAAImO,IAAcoK,IACrB,GACbrQ,KAAKmN,MAAMrV,EAAImO,GAAa,SAAJ8I,EAG1B,GAAc,IAAVsB,EAAa,OAAOrQ,KAAKiP,SAK7B,IAFA5C,GAAkB,IAAXgE,GACPA,EAAQ,EACHvY,EAAI,EAAGA,EAAIkI,KAAKpI,OAAQE,IAE3BuY,GADAtB,IAAsB,EAAhB/O,KAAKmN,MAAMrV,IAAUuY,IACd,GACbrQ,KAAKmN,MAAMrV,GAAS,SAAJiX,EAIlB,OAFA/O,KAAKkN,SAAW,EAETlN,KAAKiP,QAChB,EAEEpC,EAAGjM,UAAU4a,SAAW,SAAmBnN,EAAKoN,GAC9C,IAAIxV,GAAQjG,KAAKpI,OAASyW,EAAIzW,QAE1B2C,EAAIyF,KAAKwP,QACThV,EAAI6T,EAGJqN,EAA8B,EAAxBlhB,EAAE2S,MAAM3S,EAAE5C,OAAS,GAGf,IADdqO,EAAQ,GADMjG,KAAK8R,WAAW4J,MAG5BlhB,EAAIA,EAAEsgB,MAAM7U,GACZ1L,EAAE0f,OAAOhU,GACTyV,EAA8B,EAAxBlhB,EAAE2S,MAAM3S,EAAE5C,OAAS,IAI3B,IACIoiB,EADA2B,EAAIphB,EAAE3C,OAAS4C,EAAE5C,OAGrB,GAAa,QAAT6jB,EAAgB,EAClBzB,EAAI,IAAInN,EAAG,OACTjV,OAAS+jB,EAAI,EACf3B,EAAE7M,MAAQ,IAAIxV,MAAMqiB,EAAEpiB,QACtB,IAAK,IAAIE,EAAI,EAAGA,EAAIkiB,EAAEpiB,OAAQE,IAC5BkiB,EAAE7M,MAAMrV,GAAK,CAEhB,CAED,IAAI8jB,EAAOrhB,EAAEiV,QAAQ+L,aAAa/gB,EAAG,EAAGmhB,GAClB,IAAlBC,EAAK1O,WACP3S,EAAIqhB,EACA5B,IACFA,EAAE7M,MAAMwO,GAAK,IAIjB,IAAK,IAAIpiB,EAAIoiB,EAAI,EAAGpiB,GAAK,EAAGA,IAAK,CAC/B,IAAIsiB,EAAmC,UAAL,EAAxBthB,EAAE4S,MAAM3S,EAAE5C,OAAS2B,KACE,EAA5BgB,EAAE4S,MAAM3S,EAAE5C,OAAS2B,EAAI,IAO1B,IAHAsiB,EAAKriB,KAAKoD,IAAKif,EAAKH,EAAO,EAAG,UAE9BnhB,EAAEghB,aAAa/gB,EAAGqhB,EAAItiB,GACA,IAAfgB,EAAE2S,UACP2O,IACAthB,EAAE2S,SAAW,EACb3S,EAAEghB,aAAa/gB,EAAG,EAAGjB,GAChBgB,EAAEG,WACLH,EAAE2S,UAAY,GAGd8M,IACFA,EAAE7M,MAAM5T,GAAKsiB,EAEhB,CAWD,OAVI7B,GACFA,EAAE/K,SAEJ1U,EAAE0U,SAGW,QAATwM,GAA4B,IAAVxV,GACpB1L,EAAE+f,OAAOrU,GAGJ,CACL6V,IAAK9B,GAAK,KACV5K,IAAK7U,EAEX,EAMEsS,EAAGjM,UAAUmb,OAAS,SAAiB1N,EAAKoN,EAAMO,GAGhD,OAFA3P,GAAQgC,EAAI3T,UAERsF,KAAKtF,SACA,CACLohB,IAAK,IAAIjP,EAAG,GACZuC,IAAK,IAAIvC,EAAG,IAKM,IAAlB7M,KAAKkN,UAAmC,IAAjBmB,EAAInB,UAC7BqE,EAAMvR,KAAK8S,MAAMiJ,OAAO1N,EAAKoN,GAEhB,QAATA,IACFK,EAAMvK,EAAIuK,IAAIhJ,OAGH,QAAT2I,IACFrM,EAAMmC,EAAInC,IAAI0D,MACVkJ,GAA6B,IAAjB5M,EAAIlC,UAClBkC,EAAI4E,KAAK3F,IAIN,CACLyN,IAAKA,EACL1M,IAAKA,IAIa,IAAlBpP,KAAKkN,UAAmC,IAAjBmB,EAAInB,UAC7BqE,EAAMvR,KAAK+b,OAAO1N,EAAIyE,MAAO2I,GAEhB,QAATA,IACFK,EAAMvK,EAAIuK,IAAIhJ,OAGT,CACLgJ,IAAKA,EACL1M,IAAKmC,EAAInC,MAI0B,IAAlCpP,KAAKkN,SAAWmB,EAAInB,WACvBqE,EAAMvR,KAAK8S,MAAMiJ,OAAO1N,EAAIyE,MAAO2I,GAEtB,QAATA,IACFrM,EAAMmC,EAAInC,IAAI0D,MACVkJ,GAA6B,IAAjB5M,EAAIlC,UAClBkC,EAAI6E,KAAK5F,IAIN,CACLyN,IAAKvK,EAAIuK,IACT1M,IAAKA,IAOLf,EAAIzW,OAASoI,KAAKpI,QAAUoI,KAAK9D,IAAImS,GAAO,EACvC,CACLyN,IAAK,IAAIjP,EAAG,GACZuC,IAAKpP,MAKU,IAAfqO,EAAIzW,OACO,QAAT6jB,EACK,CACLK,IAAK9b,KAAKic,KAAK5N,EAAIlB,MAAM,IACzBiC,IAAK,MAII,QAATqM,EACK,CACLK,IAAK,KACL1M,IAAK,IAAIvC,EAAG7M,KAAK6Q,MAAMxC,EAAIlB,MAAM,MAI9B,CACL2O,IAAK9b,KAAKic,KAAK5N,EAAIlB,MAAM,IACzBiC,IAAK,IAAIvC,EAAG7M,KAAK6Q,MAAMxC,EAAIlB,MAAM,MAI9BnN,KAAKwb,SAASnN,EAAKoN,GAlF1B,IAAIK,EAAK1M,EAAKmC,CAmFlB,EAGE1E,EAAGjM,UAAUkb,IAAM,SAAczN,GAC/B,OAAOrO,KAAK+b,OAAO1N,EAAK,MAAO,GAAOyN,GAC1C,EAGEjP,EAAGjM,UAAUwO,IAAM,SAAcf,GAC/B,OAAOrO,KAAK+b,OAAO1N,EAAK,MAAO,GAAOe,GAC1C,EAEEvC,EAAGjM,UAAUsb,KAAO,SAAe7N,GACjC,OAAOrO,KAAK+b,OAAO1N,EAAK,MAAO,GAAMe,GACzC,EAGEvC,EAAGjM,UAAUub,SAAW,SAAmB9N,GACzC,IAAI+N,EAAKpc,KAAK+b,OAAO1N,GAGrB,GAAI+N,EAAGhN,IAAI1U,SAAU,OAAO0hB,EAAGN,IAE/B,IAAI1M,EAA0B,IAApBgN,EAAGN,IAAI5O,SAAiBkP,EAAGhN,IAAI6E,KAAK5F,GAAO+N,EAAGhN,IAEpDiN,EAAOhO,EAAI2M,MAAM,GACjBsB,EAAKjO,EAAIkO,MAAM,GACfrgB,EAAMkT,EAAIlT,IAAImgB,GAGlB,OAAIngB,EAAM,GAAa,IAAPogB,GAAoB,IAARpgB,EAAmBkgB,EAAGN,IAGvB,IAApBM,EAAGN,IAAI5O,SAAiBkP,EAAGN,IAAIX,MAAM,GAAKiB,EAAGN,IAAItJ,MAAM,EAClE,EAEE3F,EAAGjM,UAAUiQ,MAAQ,SAAgBxC,GACnC,IAAIsL,EAAWtL,EAAM,EACjBsL,IAAUtL,GAAOA,GAErBhC,EAAOgC,GAAO,UAId,IAHA,IAAImO,GAAK,GAAK,IAAMnO,EAEhBrS,EAAM,EACDlE,EAAIkI,KAAKpI,OAAS,EAAGE,GAAK,EAAGA,IACpCkE,GAAOwgB,EAAIxgB,GAAuB,EAAhBgE,KAAKmN,MAAMrV,KAAWuW,EAG1C,OAAOsL,GAAY3d,EAAMA,CAC7B,EAGE6Q,EAAGjM,UAAU6b,KAAO,SAAepO,GACjC,OAAOrO,KAAK6Q,MAAMxC,EACtB,EAGExB,EAAGjM,UAAUkQ,MAAQ,SAAgBzC,GACnC,IAAIsL,EAAWtL,EAAM,EACjBsL,IAAUtL,GAAOA,GAErBhC,EAAOgC,GAAO,UAGd,IADA,IAAIgC,EAAQ,EACHvY,EAAIkI,KAAKpI,OAAS,EAAGE,GAAK,EAAGA,IAAK,CACzC,IAAIiX,GAAqB,EAAhB/O,KAAKmN,MAAMrV,IAAkB,SAARuY,EAC9BrQ,KAAKmN,MAAMrV,GAAMiX,EAAIV,EAAO,EAC5BgC,EAAQtB,EAAIV,CACb,CAGD,OADArO,KAAKiP,SACE0K,EAAW3Z,KAAK4S,OAAS5S,IACpC,EAEE6M,EAAGjM,UAAUqb,KAAO,SAAe5N,GACjC,OAAOrO,KAAKwP,QAAQsB,MAAMzC,EAC9B,EAEExB,EAAGjM,UAAU8b,KAAO,SAAeF,GACjCnQ,EAAsB,IAAfmQ,EAAEtP,UACTb,GAAQmQ,EAAE9hB,UAEV,IAAIiiB,EAAI3c,KACJ4c,EAAIJ,EAAEhN,QAGRmN,EADiB,IAAfA,EAAEzP,SACAyP,EAAET,KAAKM,GAEPG,EAAEnN,QAaR,IATA,IAAIqN,EAAI,IAAIhQ,EAAG,GACXiQ,EAAI,IAAIjQ,EAAG,GAGXkQ,EAAI,IAAIlQ,EAAG,GACXmQ,EAAI,IAAInQ,EAAG,GAEXoQ,EAAI,EAEDN,EAAEO,UAAYN,EAAEM,UACrBP,EAAErC,OAAO,GACTsC,EAAEtC,OAAO,KACP2C,EAMJ,IAHA,IAAIE,EAAKP,EAAEpN,QACP4N,EAAKT,EAAEnN,SAEHmN,EAAEjiB,UAAU,CAClB,IAAK,IAAI5C,EAAI,EAAGulB,EAAK,EAAyB,IAArBV,EAAExP,MAAM,GAAKkQ,IAAavlB,EAAI,KAAMA,EAAGulB,IAAO,GACvE,GAAIvlB,EAAI,EAEN,IADA6kB,EAAErC,OAAOxiB,GACFA,KAAM,IACP+kB,EAAES,SAAWR,EAAEQ,WACjBT,EAAE7I,KAAKmJ,GACPL,EAAE7I,KAAKmJ,IAGTP,EAAEvC,OAAO,GACTwC,EAAExC,OAAO,GAIb,IAAK,IAAI/gB,EAAI,EAAGgkB,EAAK,EAAyB,IAArBX,EAAEzP,MAAM,GAAKoQ,IAAahkB,EAAI,KAAMA,EAAGgkB,IAAO,GACvE,GAAIhkB,EAAI,EAEN,IADAqjB,EAAEtC,OAAO/gB,GACFA,KAAM,IACPwjB,EAAEO,SAAWN,EAAEM,WACjBP,EAAE/I,KAAKmJ,GACPH,EAAE/I,KAAKmJ,IAGTL,EAAEzC,OAAO,GACT0C,EAAE1C,OAAO,GAITqC,EAAEzgB,IAAI0gB,IAAM,GACdD,EAAE1I,KAAK2I,GACPC,EAAE5I,KAAK8I,GACPD,EAAE7I,KAAK+I,KAEPJ,EAAE3I,KAAK0I,GACPI,EAAE9I,KAAK4I,GACPG,EAAE/I,KAAK6I,GAEV,CAED,MAAO,CACLviB,EAAGwiB,EACHviB,EAAGwiB,EACHQ,IAAKZ,EAAE3C,OAAOgD,GAEpB,EAKEpQ,EAAGjM,UAAU6c,OAAS,SAAiBjB,GACrCnQ,EAAsB,IAAfmQ,EAAEtP,UACTb,GAAQmQ,EAAE9hB,UAEV,IAAIH,EAAIyF,KACJxF,EAAIgiB,EAAEhN,QAGRjV,EADiB,IAAfA,EAAE2S,SACA3S,EAAE2hB,KAAKM,GAEPjiB,EAAEiV,QAQR,IALA,IAuCI+B,EAvCAmM,EAAK,IAAI7Q,EAAG,GACZ8Q,EAAK,IAAI9Q,EAAG,GAEZ+Q,EAAQpjB,EAAEgV,QAEPjV,EAAEsjB,KAAK,GAAK,GAAKrjB,EAAEqjB,KAAK,GAAK,GAAG,CACrC,IAAK,IAAI/lB,EAAI,EAAGulB,EAAK,EAAyB,IAArB9iB,EAAE4S,MAAM,GAAKkQ,IAAavlB,EAAI,KAAMA,EAAGulB,IAAO,GACvE,GAAIvlB,EAAI,EAEN,IADAyC,EAAE+f,OAAOxiB,GACFA,KAAM,GACP4lB,EAAGJ,SACLI,EAAG1J,KAAK4J,GAGVF,EAAGpD,OAAO,GAId,IAAK,IAAI/gB,EAAI,EAAGgkB,EAAK,EAAyB,IAArB/iB,EAAE2S,MAAM,GAAKoQ,IAAahkB,EAAI,KAAMA,EAAGgkB,IAAO,GACvE,GAAIhkB,EAAI,EAEN,IADAiB,EAAE8f,OAAO/gB,GACFA,KAAM,GACPokB,EAAGL,SACLK,EAAG3J,KAAK4J,GAGVD,EAAGrD,OAAO,GAIV/f,EAAE2B,IAAI1B,IAAM,GACdD,EAAE0Z,KAAKzZ,GACPkjB,EAAGzJ,KAAK0J,KAERnjB,EAAEyZ,KAAK1Z,GACPojB,EAAG1J,KAAKyJ,GAEX,CAaD,OATEnM,EADgB,IAAdhX,EAAEsjB,KAAK,GACHH,EAEAC,GAGAE,KAAK,GAAK,GAChBtM,EAAIyC,KAAKwI,GAGJjL,CACX,EAEE1E,EAAGjM,UAAU4c,IAAM,SAAcnP,GAC/B,GAAIrO,KAAKtF,SAAU,OAAO2T,EAAIiE,MAC9B,GAAIjE,EAAI3T,SAAU,OAAOsF,KAAKsS,MAE9B,IAAI/X,EAAIyF,KAAKwP,QACThV,EAAI6T,EAAImB,QACZjV,EAAE2S,SAAW,EACb1S,EAAE0S,SAAW,EAGb,IAAK,IAAIjH,EAAQ,EAAG1L,EAAE2iB,UAAY1iB,EAAE0iB,SAAUjX,IAC5C1L,EAAE+f,OAAO,GACT9f,EAAE8f,OAAO,GAGX,OAAG,CACD,KAAO/f,EAAE2iB,UACP3iB,EAAE+f,OAAO,GAEX,KAAO9f,EAAE0iB,UACP1iB,EAAE8f,OAAO,GAGX,IAAIvM,EAAIxT,EAAE2B,IAAI1B,GACd,GAAIuT,EAAI,EAAG,CAET,IAAIgE,EAAIxX,EACRA,EAAIC,EACJA,EAAIuX,CACZ,MAAa,GAAU,IAANhE,GAAyB,IAAdvT,EAAEqjB,KAAK,GAC3B,MAGFtjB,EAAE0Z,KAAKzZ,EACR,CAED,OAAOA,EAAEyf,OAAOhU,EACpB,EAGE4G,EAAGjM,UAAUkd,KAAO,SAAezP,GACjC,OAAOrO,KAAK0c,KAAKrO,GAAK9T,EAAE2hB,KAAK7N,EACjC,EAEExB,EAAGjM,UAAUsc,OAAS,WACpB,OAA+B,IAAP,EAAhBld,KAAKmN,MAAM,GACvB,EAEEN,EAAGjM,UAAU0c,MAAQ,WACnB,OAA+B,IAAP,EAAhBtd,KAAKmN,MAAM,GACvB,EAGEN,EAAGjM,UAAU2b,MAAQ,SAAgBlO,GACnC,OAAOrO,KAAKmN,MAAM,GAAKkB,CAC3B,EAGExB,EAAGjM,UAAUmd,MAAQ,SAAgBjK,GACnCzH,EAAsB,iBAARyH,GACd,IAAI/F,EAAI+F,EAAM,GACVoG,GAAKpG,EAAM/F,GAAK,GAChBiM,EAAI,GAAKjM,EAGb,GAAI/N,KAAKpI,QAAUsiB,EAGjB,OAFAla,KAAKyP,QAAQyK,EAAI,GACjBla,KAAKmN,MAAM+M,IAAMF,EACVha,KAKT,IADA,IAAIqQ,EAAQ2J,EACHliB,EAAIoiB,EAAa,IAAV7J,GAAevY,EAAIkI,KAAKpI,OAAQE,IAAK,CACnD,IAAIiX,EAAoB,EAAhB/O,KAAKmN,MAAMrV,GAEnBuY,GADAtB,GAAKsB,KACS,GACdtB,GAAK,SACL/O,KAAKmN,MAAMrV,GAAKiX,CACjB,CAKD,OAJc,IAAVsB,IACFrQ,KAAKmN,MAAMrV,GAAKuY,EAChBrQ,KAAKpI,UAEAoI,IACX,EAEE6M,EAAGjM,UAAUlG,OAAS,WACpB,OAAuB,IAAhBsF,KAAKpI,QAAkC,IAAlBoI,KAAKmN,MAAM,EAC3C,EAEEN,EAAGjM,UAAUid,KAAO,SAAexP,GACjC,IAOIkD,EAPArE,EAAWmB,EAAM,EAErB,GAAsB,IAAlBrO,KAAKkN,WAAmBA,EAAU,OAAQ,EAC9C,GAAsB,IAAlBlN,KAAKkN,UAAkBA,EAAU,OAAO,EAK5C,GAHAlN,KAAKiP,SAGDjP,KAAKpI,OAAS,EAChB2Z,EAAM,MACD,CACDrE,IACFmB,GAAOA,GAGThC,EAAOgC,GAAO,SAAW,qBAEzB,IAAIU,EAAoB,EAAhB/O,KAAKmN,MAAM,GACnBoE,EAAMxC,IAAMV,EAAM,EAAIU,EAAIV,GAAO,EAAI,CACtC,CACD,OAAsB,IAAlBrO,KAAKkN,SAA8B,GAANqE,EAC1BA,CACX,EAME1E,EAAGjM,UAAU1E,IAAM,SAAcmS,GAC/B,GAAsB,IAAlBrO,KAAKkN,UAAmC,IAAjBmB,EAAInB,SAAgB,OAAQ,EACvD,GAAsB,IAAlBlN,KAAKkN,UAAmC,IAAjBmB,EAAInB,SAAgB,OAAO,EAEtD,IAAIqE,EAAMvR,KAAKge,KAAK3P,GACpB,OAAsB,IAAlBrO,KAAKkN,SAA8B,GAANqE,EAC1BA,CACX,EAGE1E,EAAGjM,UAAUod,KAAO,SAAe3P,GAEjC,GAAIrO,KAAKpI,OAASyW,EAAIzW,OAAQ,OAAO,EACrC,GAAIoI,KAAKpI,OAASyW,EAAIzW,OAAQ,OAAQ,EAGtC,IADA,IAAI2Z,EAAM,EACDzZ,EAAIkI,KAAKpI,OAAS,EAAGE,GAAK,EAAGA,IAAK,CACzC,IAAIyC,EAAoB,EAAhByF,KAAKmN,MAAMrV,GACf0C,EAAmB,EAAf6T,EAAIlB,MAAMrV,GAElB,GAAIyC,IAAMC,EAAV,CACID,EAAIC,EACN+W,GAAO,EACEhX,EAAIC,IACb+W,EAAM,GAER,KANsB,CAOvB,CACD,OAAOA,CACX,EAEE1E,EAAGjM,UAAUqd,IAAM,SAAc5P,GAC/B,OAA0B,IAAnBrO,KAAK6d,KAAKxP,EACrB,EAEExB,EAAGjM,UAAUsd,GAAK,SAAa7P,GAC7B,OAAyB,IAAlBrO,KAAK9D,IAAImS,EACpB,EAEExB,EAAGjM,UAAUud,KAAO,SAAe9P,GACjC,OAAOrO,KAAK6d,KAAKxP,IAAQ,CAC7B,EAEExB,EAAGjM,UAAUxG,IAAM,SAAciU,GAC/B,OAAOrO,KAAK9D,IAAImS,IAAQ,CAC5B,EAEExB,EAAGjM,UAAUwd,IAAM,SAAc/P,GAC/B,OAA2B,IAApBrO,KAAK6d,KAAKxP,EACrB,EAEExB,EAAGjM,UAAU/E,GAAK,SAAawS,GAC7B,OAA0B,IAAnBrO,KAAK9D,IAAImS,EACpB,EAEExB,EAAGjM,UAAUyd,KAAO,SAAehQ,GACjC,OAAOrO,KAAK6d,KAAKxP,IAAQ,CAC7B,EAEExB,EAAGjM,UAAU0d,IAAM,SAAcjQ,GAC/B,OAAOrO,KAAK9D,IAAImS,IAAQ,CAC5B,EAEExB,EAAGjM,UAAU2d,IAAM,SAAclQ,GAC/B,OAA0B,IAAnBrO,KAAK6d,KAAKxP,EACrB,EAEExB,EAAGjM,UAAUzF,GAAK,SAAakT,GAC7B,OAAyB,IAAlBrO,KAAK9D,IAAImS,EACpB,EAMExB,EAAGO,IAAM,SAAciB,GACrB,OAAO,IAAImQ,EAAInQ,EACnB,EAEExB,EAAGjM,UAAU6d,MAAQ,SAAgBC,GAGnC,OAFArS,GAAQrM,KAAKoN,IAAK,yCAClBf,EAAyB,IAAlBrM,KAAKkN,SAAgB,iCACrBwR,EAAIC,UAAU3e,MAAM4e,UAAUF,EACzC,EAEE7R,EAAGjM,UAAUie,QAAU,WAErB,OADAxS,EAAOrM,KAAKoN,IAAK,wDACVpN,KAAKoN,IAAI0R,YAAY9e,KAChC,EAEE6M,EAAGjM,UAAUge,UAAY,SAAoBF,GAE3C,OADA1e,KAAKoN,IAAMsR,EACJ1e,IACX,EAEE6M,EAAGjM,UAAUme,SAAW,SAAmBL,GAEzC,OADArS,GAAQrM,KAAKoN,IAAK,yCACXpN,KAAK4e,UAAUF,EAC1B,EAEE7R,EAAGjM,UAAUoe,OAAS,SAAiB3Q,GAErC,OADAhC,EAAOrM,KAAKoN,IAAK,sCACVpN,KAAKoN,IAAInR,IAAI+D,KAAMqO,EAC9B,EAEExB,EAAGjM,UAAUqe,QAAU,SAAkB5Q,GAEvC,OADAhC,EAAOrM,KAAKoN,IAAK,uCACVpN,KAAKoN,IAAI4G,KAAKhU,KAAMqO,EAC/B,EAEExB,EAAGjM,UAAUse,OAAS,SAAiB7Q,GAErC,OADAhC,EAAOrM,KAAKoN,IAAK,sCACVpN,KAAKoN,IAAI8G,IAAIlU,KAAMqO,EAC9B,EAEExB,EAAGjM,UAAUue,QAAU,SAAkB9Q,GAEvC,OADAhC,EAAOrM,KAAKoN,IAAK,uCACVpN,KAAKoN,IAAI6G,KAAKjU,KAAMqO,EAC/B,EAEExB,EAAGjM,UAAUwe,OAAS,SAAiB/Q,GAErC,OADAhC,EAAOrM,KAAKoN,IAAK,sCACVpN,KAAKoN,IAAIiS,IAAIrf,KAAMqO,EAC9B,EAEExB,EAAGjM,UAAU0e,OAAS,SAAiBjR,GAGrC,OAFAhC,EAAOrM,KAAKoN,IAAK,sCACjBpN,KAAKoN,IAAImS,SAASvf,KAAMqO,GACjBrO,KAAKoN,IAAI/S,IAAI2F,KAAMqO,EAC9B,EAEExB,EAAGjM,UAAU4e,QAAU,SAAkBnR,GAGvC,OAFAhC,EAAOrM,KAAKoN,IAAK,sCACjBpN,KAAKoN,IAAImS,SAASvf,KAAMqO,GACjBrO,KAAKoN,IAAI+K,KAAKnY,KAAMqO,EAC/B,EAEExB,EAAGjM,UAAU6e,OAAS,WAGpB,OAFApT,EAAOrM,KAAKoN,IAAK,sCACjBpN,KAAKoN,IAAIsS,SAAS1f,MACXA,KAAKoN,IAAIyM,IAAI7Z,KACxB,EAEE6M,EAAGjM,UAAU+e,QAAU,WAGrB,OAFAtT,EAAOrM,KAAKoN,IAAK,uCACjBpN,KAAKoN,IAAIsS,SAAS1f,MACXA,KAAKoN,IAAI0M,KAAK9Z,KACzB,EAGE6M,EAAGjM,UAAUgf,QAAU,WAGrB,OAFAvT,EAAOrM,KAAKoN,IAAK,uCACjBpN,KAAKoN,IAAIsS,SAAS1f,MACXA,KAAKoN,IAAIyS,KAAK7f,KACzB,EAEE6M,EAAGjM,UAAUkf,QAAU,WAGrB,OAFAzT,EAAOrM,KAAKoN,IAAK,uCACjBpN,KAAKoN,IAAIsS,SAAS1f,MACXA,KAAKoN,IAAI0Q,KAAK9d,KACzB,EAGE6M,EAAGjM,UAAUmf,OAAS,WAGpB,OAFA1T,EAAOrM,KAAKoN,IAAK,sCACjBpN,KAAKoN,IAAIsS,SAAS1f,MACXA,KAAKoN,IAAI0F,IAAI9S,KACxB,EAEE6M,EAAGjM,UAAUof,OAAS,SAAiB3R,GAGrC,OAFAhC,EAAOrM,KAAKoN,MAAQiB,EAAIjB,IAAK,qBAC7BpN,KAAKoN,IAAIsS,SAAS1f,MACXA,KAAKoN,IAAInK,IAAIjD,KAAMqO,EAC9B,EAGE,IAAI4R,EAAS,CACXC,KAAM,KACNC,KAAM,KACNC,KAAM,KACNC,OAAQ,MAIV,SAASC,EAAQrf,EAAMub,GAErBxc,KAAKiB,KAAOA,EACZjB,KAAKwc,EAAI,IAAI3P,EAAG2P,EAAG,IACnBxc,KAAKugB,EAAIvgB,KAAKwc,EAAEvK,YAChBjS,KAAKsQ,EAAI,IAAIzD,EAAG,GAAGoN,OAAOja,KAAKugB,GAAGtM,KAAKjU,KAAKwc,GAE5Cxc,KAAKwgB,IAAMxgB,KAAKygB,MACjB,CAgDD,SAASC,IACPJ,EAAOlX,KACLpJ,KACA,OACA,0EACH,CA8DD,SAAS2gB,IACPL,EAAOlX,KACLpJ,KACA,OACA,iEACH,CAGD,SAAS4gB,IACPN,EAAOlX,KACLpJ,KACA,OACA,wDACH,CAGD,SAAS6gB,IAEPP,EAAOlX,KACLpJ,KACA,QACA,sEACH,CA6CD,SAASwe,EAAK7C,GACZ,GAAiB,iBAANA,EAAgB,CACzB,IAAImF,EAAQjU,EAAGkU,OAAOpF,GACtB3b,KAAK2b,EAAImF,EAAMtE,EACfxc,KAAK8gB,MAAQA,CACnB,MACMzU,EAAOsP,EAAEsC,IAAI,GAAI,kCACjBje,KAAK2b,EAAIA,EACT3b,KAAK8gB,MAAQ,IAEhB,CAkOD,SAASE,EAAMrF,GACb6C,EAAIpV,KAAKpJ,KAAM2b,GAEf3b,KAAKiG,MAAQjG,KAAK2b,EAAE1J,YAChBjS,KAAKiG,MAAQ,IAAO,IACtBjG,KAAKiG,OAAS,GAAMjG,KAAKiG,MAAQ,IAGnCjG,KAAK+N,EAAI,IAAIlB,EAAG,GAAGoN,OAAOja,KAAKiG,OAC/BjG,KAAKsc,GAAKtc,KAAKihB,KAAKjhB,KAAK+N,EAAE8L,OAC3B7Z,KAAKkhB,KAAOlhB,KAAK+N,EAAE0P,OAAOzd,KAAK2b,GAE/B3b,KAAKmhB,KAAOnhB,KAAKkhB,KAAK7mB,IAAI2F,KAAK+N,GAAGoN,MAAM,GAAGW,IAAI9b,KAAK2b,GACpD3b,KAAKmhB,KAAOnhB,KAAKmhB,KAAKjF,KAAKlc,KAAK+N,GAChC/N,KAAKmhB,KAAOnhB,KAAK+N,EAAEmG,IAAIlU,KAAKmhB,KAC7B,CA/aDb,EAAO1f,UAAU6f,KAAO,WACtB,IAAID,EAAM,IAAI3T,EAAG,MAEjB,OADA2T,EAAIrT,MAAQ,IAAIxV,MAAM6B,KAAKsV,KAAK9O,KAAKugB,EAAI,KAClCC,CACX,EAEEF,EAAO1f,UAAUwgB,QAAU,SAAkB/S,GAG3C,IACIgT,EADAtT,EAAIM,EAGR,GACErO,KAAKwD,MAAMuK,EAAG/N,KAAKwgB,KAGnBa,GADAtT,GADAA,EAAI/N,KAAKshB,MAAMvT,IACTiG,KAAKhU,KAAKwgB,MACPvO,kBACFoP,EAAOrhB,KAAKugB,GAErB,IAAIrkB,EAAMmlB,EAAOrhB,KAAKugB,GAAK,EAAIxS,EAAEiQ,KAAKhe,KAAKwc,GAgB3C,OAfY,IAARtgB,GACF6R,EAAEZ,MAAM,GAAK,EACbY,EAAEnW,OAAS,GACFsE,EAAM,EACf6R,EAAEkG,KAAKjU,KAAKwc,QAEI3jB,IAAZkV,EAAEwT,MAEJxT,EAAEwT,QAGFxT,EAAEkB,SAIClB,CACX,EAEEuS,EAAO1f,UAAU4C,MAAQ,SAAgBge,EAAOpR,GAC9CoR,EAAMlH,OAAOta,KAAKugB,EAAG,EAAGnQ,EAC5B,EAEEkQ,EAAO1f,UAAU0gB,MAAQ,SAAgBjT,GACvC,OAAOA,EAAI8J,KAAKnY,KAAKsQ,EACzB,EAQE9D,EAASkU,EAAMJ,GAEfI,EAAK9f,UAAU4C,MAAQ,SAAgBge,EAAOC,GAK5C,IAHA,IAAI/G,EAAO,QAEPgH,EAASloB,KAAKoD,IAAI4kB,EAAM5pB,OAAQ,GAC3BE,EAAI,EAAGA,EAAI4pB,EAAQ5pB,IAC1B2pB,EAAOtU,MAAMrV,GAAK0pB,EAAMrU,MAAMrV,GAIhC,GAFA2pB,EAAO7pB,OAAS8pB,EAEZF,EAAM5pB,QAAU,EAGlB,OAFA4pB,EAAMrU,MAAM,GAAK,OACjBqU,EAAM5pB,OAAS,GAKjB,IAAI+pB,EAAOH,EAAMrU,MAAM,GAGvB,IAFAsU,EAAOtU,MAAMsU,EAAO7pB,UAAY+pB,EAAOjH,EAElC5iB,EAAI,GAAIA,EAAI0pB,EAAM5pB,OAAQE,IAAK,CAClC,IAAI8pB,EAAwB,EAAjBJ,EAAMrU,MAAMrV,GACvB0pB,EAAMrU,MAAMrV,EAAI,KAAQ8pB,EAAOlH,IAAS,EAAMiH,IAAS,GACvDA,EAAOC,CACR,CACDD,KAAU,GACVH,EAAMrU,MAAMrV,EAAI,IAAM6pB,EACT,IAATA,GAAcH,EAAM5pB,OAAS,GAC/B4pB,EAAM5pB,QAAU,GAEhB4pB,EAAM5pB,QAAU,CAEtB,EAEE8oB,EAAK9f,UAAU0gB,MAAQ,SAAgBjT,GAErCA,EAAIlB,MAAMkB,EAAIzW,QAAU,EACxByW,EAAIlB,MAAMkB,EAAIzW,OAAS,GAAK,EAC5ByW,EAAIzW,QAAU,EAId,IADA,IAAIsJ,EAAK,EACApJ,EAAI,EAAGA,EAAIuW,EAAIzW,OAAQE,IAAK,CACnC,IAAIiX,EAAmB,EAAfV,EAAIlB,MAAMrV,GAClBoJ,GAAU,IAAJ6N,EACNV,EAAIlB,MAAMrV,GAAU,SAALoJ,EACfA,EAAS,GAAJ6N,GAAa7N,EAAK,SAAa,EACrC,CASD,OANkC,IAA9BmN,EAAIlB,MAAMkB,EAAIzW,OAAS,KACzByW,EAAIzW,SAC8B,IAA9ByW,EAAIlB,MAAMkB,EAAIzW,OAAS,IACzByW,EAAIzW,UAGDyW,CACX,EAQE7B,EAASmU,EAAML,GAQf9T,EAASoU,EAAMN,GASf9T,EAASqU,EAAQP,GAEjBO,EAAOjgB,UAAU0gB,MAAQ,SAAgBjT,GAGvC,IADA,IAAIgC,EAAQ,EACHvY,EAAI,EAAGA,EAAIuW,EAAIzW,OAAQE,IAAK,CACnC,IAAIoa,EAA0B,IAAL,EAAf7D,EAAIlB,MAAMrV,IAAiBuY,EACjCnP,EAAU,SAALgR,EACTA,KAAQ,GAER7D,EAAIlB,MAAMrV,GAAKoJ,EACfmP,EAAQ6B,CACT,CAID,OAHc,IAAV7B,IACFhC,EAAIlB,MAAMkB,EAAIzW,UAAYyY,GAErBhC,CACX,EAGExB,EAAGkU,OAAS,SAAgB9f,GAE1B,GAAIgf,EAAOhf,GAAO,OAAOgf,EAAOhf,GAEhC,IAAI6f,EACJ,GAAa,SAAT7f,EACF6f,EAAQ,IAAIJ,OACP,GAAa,SAATzf,EACT6f,EAAQ,IAAIH,OACP,GAAa,SAAT1f,EACT6f,EAAQ,IAAIF,MACP,IAAa,WAAT3f,EAGT,MAAM,IAAI9J,MAAM,iBAAmB8J,GAFnC6f,EAAQ,IAAID,CAGb,CAGD,OAFAZ,EAAOhf,GAAQ6f,EAERA,CACX,EAiBEtC,EAAI5d,UAAU8e,SAAW,SAAmBnlB,GAC1C8R,EAAsB,IAAf9R,EAAE2S,SAAgB,iCACzBb,EAAO9R,EAAE6S,IAAK,kCAClB,EAEEoR,EAAI5d,UAAU2e,SAAW,SAAmBhlB,EAAGC,GAC7C6R,EAAqC,IAA7B9R,EAAE2S,SAAW1S,EAAE0S,UAAiB,iCACxCb,EAAO9R,EAAE6S,KAAO7S,EAAE6S,MAAQ5S,EAAE4S,IAC1B,kCACN,EAEEoR,EAAI5d,UAAUqgB,KAAO,SAAe1mB,GAClC,OAAIyF,KAAK8gB,MAAc9gB,KAAK8gB,MAAMM,QAAQ7mB,GAAGqkB,UAAU5e,OAEvDoO,EAAK7T,EAAGA,EAAE2hB,KAAKlc,KAAK2b,GAAGiD,UAAU5e,OAC1BzF,EACX,EAEEikB,EAAI5d,UAAUkS,IAAM,SAAcvY,GAChC,OAAIA,EAAEG,SACGH,EAAEiV,QAGJxP,KAAK2b,EAAEzH,IAAI3Z,GAAGqkB,UAAU5e,KACnC,EAEEwe,EAAI5d,UAAU3E,IAAM,SAAc1B,EAAGC,GACnCwF,KAAKuf,SAAShlB,EAAGC,GAEjB,IAAI+W,EAAMhX,EAAE0B,IAAIzB,GAIhB,OAHI+W,EAAIrV,IAAI8D,KAAK2b,IAAM,GACrBpK,EAAI0C,KAAKjU,KAAK2b,GAETpK,EAAIqN,UAAU5e,KACzB,EAEEwe,EAAI5d,UAAUoT,KAAO,SAAezZ,EAAGC,GACrCwF,KAAKuf,SAAShlB,EAAGC,GAEjB,IAAI+W,EAAMhX,EAAEyZ,KAAKxZ,GAIjB,OAHI+W,EAAIrV,IAAI8D,KAAK2b,IAAM,GACrBpK,EAAI0C,KAAKjU,KAAK2b,GAETpK,CACX,EAEEiN,EAAI5d,UAAUsT,IAAM,SAAc3Z,EAAGC,GACnCwF,KAAKuf,SAAShlB,EAAGC,GAEjB,IAAI+W,EAAMhX,EAAE2Z,IAAI1Z,GAIhB,OAHI+W,EAAIsM,KAAK,GAAK,GAChBtM,EAAIyC,KAAKhU,KAAK2b,GAETpK,EAAIqN,UAAU5e,KACzB,EAEEwe,EAAI5d,UAAUqT,KAAO,SAAe1Z,EAAGC,GACrCwF,KAAKuf,SAAShlB,EAAGC,GAEjB,IAAI+W,EAAMhX,EAAE0Z,KAAKzZ,GAIjB,OAHI+W,EAAIsM,KAAK,GAAK,GAChBtM,EAAIyC,KAAKhU,KAAK2b,GAETpK,CACX,EAEEiN,EAAI5d,UAAUye,IAAM,SAAc9kB,EAAG8T,GAEnC,OADArO,KAAK0f,SAASnlB,GACPyF,KAAKihB,KAAK1mB,EAAEugB,MAAMzM,GAC7B,EAEEmQ,EAAI5d,UAAUuX,KAAO,SAAe5d,EAAGC,GAErC,OADAwF,KAAKuf,SAAShlB,EAAGC,GACVwF,KAAKihB,KAAK1mB,EAAE4d,KAAK3d,GAC5B,EAEEgkB,EAAI5d,UAAUvG,IAAM,SAAcE,EAAGC,GAEnC,OADAwF,KAAKuf,SAAShlB,EAAGC,GACVwF,KAAKihB,KAAK1mB,EAAEF,IAAIG,GAC3B,EAEEgkB,EAAI5d,UAAUkZ,KAAO,SAAevf,GAClC,OAAOyF,KAAKmY,KAAK5d,EAAGA,EAAEiV,QAC1B,EAEEgP,EAAI5d,UAAUiZ,IAAM,SAActf,GAChC,OAAOyF,KAAK3F,IAAIE,EAAGA,EACvB,EAEEikB,EAAI5d,UAAUif,KAAO,SAAetlB,GAClC,GAAIA,EAAEG,SAAU,OAAOH,EAAEiV,QAEzB,IAAIqS,EAAO7hB,KAAK2b,EAAEY,MAAM,GAIxB,GAHAlQ,EAAOwV,EAAO,GAAM,GAGP,IAATA,EAAY,CACd,IAAI5e,EAAMjD,KAAK2b,EAAE1f,IAAI,IAAI4Q,EAAG,IAAIyN,OAAO,GACvC,OAAOta,KAAKiD,IAAI1I,EAAG0I,EACpB,CAOD,IAFA,IAAI+W,EAAIha,KAAK2b,EAAEN,KAAK,GAChBnB,EAAI,GACAF,EAAEtf,UAA2B,IAAfsf,EAAEuC,MAAM,IAC5BrC,IACAF,EAAEM,OAAO,GAEXjO,GAAQ2N,EAAEtf,UAEV,IAAIonB,EAAM,IAAIjV,EAAG,GAAG4R,MAAMze,MACtB+hB,EAAOD,EAAI/B,SAIXiC,EAAOhiB,KAAK2b,EAAEN,KAAK,GAAGf,OAAO,GAC7B2H,EAAIjiB,KAAK2b,EAAE1J,YAGf,IAFAgQ,EAAI,IAAIpV,EAAG,EAAIoV,EAAIA,GAAGxD,MAAMze,MAEW,IAAhCA,KAAKiD,IAAIgf,EAAGD,GAAM9lB,IAAI6lB,IAC3BE,EAAEhD,QAAQ8C,GAOZ,IAJA,IAAIpU,EAAI3N,KAAKiD,IAAIgf,EAAGjI,GAChBjM,EAAI/N,KAAKiD,IAAI1I,EAAGyf,EAAEoB,KAAK,GAAGd,OAAO,IACjCvI,EAAI/R,KAAKiD,IAAI1I,EAAGyf,GAChB2B,EAAIzB,EACc,IAAfnI,EAAE7V,IAAI4lB,IAAY,CAEvB,IADA,IAAItB,EAAMzO,EACDja,EAAI,EAAoB,IAAjB0oB,EAAItkB,IAAI4lB,GAAYhqB,IAClC0oB,EAAMA,EAAIf,SAEZpT,EAAOvU,EAAI6jB,GACX,IAAInhB,EAAIwF,KAAKiD,IAAI0K,EAAG,IAAId,EAAG,GAAGoN,OAAO0B,EAAI7jB,EAAI,IAE7CiW,EAAIA,EAAEuR,OAAO9kB,GACbmT,EAAInT,EAAEilB,SACN1N,EAAIA,EAAEuN,OAAO3R,GACbgO,EAAI7jB,CACL,CAED,OAAOiW,CACX,EAEEyQ,EAAI5d,UAAUkd,KAAO,SAAevjB,GAClC,IAAI2nB,EAAM3nB,EAAEkjB,OAAOzd,KAAK2b,GACxB,OAAqB,IAAjBuG,EAAIhV,UACNgV,EAAIhV,SAAW,EACRlN,KAAKihB,KAAKiB,GAAKnC,UAEf/f,KAAKihB,KAAKiB,EAEvB,EAEE1D,EAAI5d,UAAUqC,IAAM,SAAc1I,EAAG8T,GACnC,GAAIA,EAAI3T,SAAU,OAAO,IAAImS,EAAG,GAAG4R,MAAMze,MACzC,GAAoB,IAAhBqO,EAAIwP,KAAK,GAAU,OAAOtjB,EAAEiV,QAEhC,IACI2S,EAAM,IAAIxqB,MAAM,IACpBwqB,EAAI,GAAK,IAAItV,EAAG,GAAG4R,MAAMze,MACzBmiB,EAAI,GAAK5nB,EACT,IAAK,IAAIzC,EAAI,EAAGA,EAAIqqB,EAAIvqB,OAAQE,IAC9BqqB,EAAIrqB,GAAKkI,KAAK3F,IAAI8nB,EAAIrqB,EAAI,GAAIyC,GAGhC,IAAIgX,EAAM4Q,EAAI,GACVC,EAAU,EACVC,EAAa,EACbpZ,EAAQoF,EAAI4D,YAAc,GAK9B,IAJc,IAAVhJ,IACFA,EAAQ,IAGLnR,EAAIuW,EAAIzW,OAAS,EAAGE,GAAK,EAAGA,IAAK,CAEpC,IADA,IAAImQ,EAAOoG,EAAIlB,MAAMrV,GACZyB,EAAI0P,EAAQ,EAAG1P,GAAK,EAAGA,IAAK,CACnC,IAAIua,EAAO7L,GAAQ1O,EAAK,EACpBgY,IAAQ4Q,EAAI,KACd5Q,EAAMvR,KAAK6Z,IAAItI,IAGL,IAARuC,GAAyB,IAAZsO,GAKjBA,IAAY,EACZA,GAAWtO,GA9BE,KA+BbuO,GACwC,IAANvqB,GAAiB,IAANyB,KAE7CgY,EAAMvR,KAAK3F,IAAIkX,EAAK4Q,EAAIC,IACxBC,EAAa,EACbD,EAAU,IAXRC,EAAa,CAYhB,CACDpZ,EAAQ,EACT,CAED,OAAOsI,CACX,EAEEiN,EAAI5d,UAAU+d,UAAY,SAAoBtQ,GAC5C,IAAIN,EAAIM,EAAI6N,KAAKlc,KAAK2b,GAEtB,OAAO5N,IAAMM,EAAMN,EAAEyB,QAAUzB,CACnC,EAEEyQ,EAAI5d,UAAUke,YAAc,SAAsBzQ,GAChD,IAAIkD,EAAMlD,EAAImB,QAEd,OADA+B,EAAInE,IAAM,KACHmE,CACX,EAME1E,EAAGyV,KAAO,SAAejU,GACvB,OAAO,IAAI2S,EAAK3S,EACpB,EAkBE7B,EAASwU,EAAMxC,GAEfwC,EAAKpgB,UAAU+d,UAAY,SAAoBtQ,GAC7C,OAAOrO,KAAKihB,KAAK5S,EAAIyM,MAAM9a,KAAKiG,OACpC,EAEE+a,EAAKpgB,UAAUke,YAAc,SAAsBzQ,GACjD,IAAIN,EAAI/N,KAAKihB,KAAK5S,EAAIhU,IAAI2F,KAAKkhB,OAE/B,OADAnT,EAAEX,IAAM,KACDW,CACX,EAEEiT,EAAKpgB,UAAUuX,KAAO,SAAe5d,EAAGC,GACtC,GAAID,EAAEG,UAAYF,EAAEE,SAGlB,OAFAH,EAAE4S,MAAM,GAAK,EACb5S,EAAE3C,OAAS,EACJ2C,EAGT,IAAIwX,EAAIxX,EAAE4d,KAAK3d,GACXmT,EAAIoE,EAAEmJ,MAAMlb,KAAKiG,OAAO5L,IAAI2F,KAAKmhB,MAAMlG,OAAOjb,KAAKiG,OAAO5L,IAAI2F,KAAK2b,GACnE4G,EAAIxQ,EAAEkC,KAAKtG,GAAG2M,OAAOta,KAAKiG,OAC1BsL,EAAMgR,EAQV,OANIA,EAAErmB,IAAI8D,KAAK2b,IAAM,EACnBpK,EAAMgR,EAAEtO,KAAKjU,KAAK2b,GACT4G,EAAE1E,KAAK,GAAK,IACrBtM,EAAMgR,EAAEvO,KAAKhU,KAAK2b,IAGbpK,EAAIqN,UAAU5e,KACzB,EAEEghB,EAAKpgB,UAAUvG,IAAM,SAAcE,EAAGC,GACpC,GAAID,EAAEG,UAAYF,EAAEE,SAAU,OAAO,IAAImS,EAAG,GAAG+R,UAAU5e,MAEzD,IAAI+R,EAAIxX,EAAEF,IAAIG,GACVmT,EAAIoE,EAAEmJ,MAAMlb,KAAKiG,OAAO5L,IAAI2F,KAAKmhB,MAAMlG,OAAOjb,KAAKiG,OAAO5L,IAAI2F,KAAK2b,GACnE4G,EAAIxQ,EAAEkC,KAAKtG,GAAG2M,OAAOta,KAAKiG,OAC1BsL,EAAMgR,EAOV,OANIA,EAAErmB,IAAI8D,KAAK2b,IAAM,EACnBpK,EAAMgR,EAAEtO,KAAKjU,KAAK2b,GACT4G,EAAE1E,KAAK,GAAK,IACrBtM,EAAMgR,EAAEvO,KAAKhU,KAAK2b,IAGbpK,EAAIqN,UAAU5e,KACzB,EAEEghB,EAAKpgB,UAAUkd,KAAO,SAAevjB,GAGnC,OADUyF,KAAKihB,KAAK1mB,EAAEkjB,OAAOzd,KAAK2b,GAAGthB,IAAI2F,KAAKsc,KACnCsC,UAAU5e,KACzB,CACC,CA39GD,GA29G4CA,mCC19G5C,IAAIwiB,EAAmBxiB,IAAQA,GAAKwiB,iBAAoB,SAAUpT,GAC9D,OAAQA,GAAOA,EAAIqT,WAAcrT,EAAM,CAAEsT,QAAWtT,EACxD,EACA1O,OAAOgB,eAAc0K,EAAU,aAAc,CAAEzK,MAAO,IACtDyK,EAAcjU,IAAAiU,EAAA9S,MAAgB8S,EAAmBuW,SAAAvW,EAAA6B,IAAc7B,EAAgBwW,MAAAxW,EAAAyW,OAAiBzW,EAAc0W,IAAA1W,EAAA2W,KAAe3W,EAAiB4W,OAAA5W,EAAA6W,UAAoB7W,EAAe8W,KAAA9W,EAAA+W,KAAe/W,EAAegX,KAAAhX,EAAAiX,KAAejX,MAAcA,EAAckX,IAAAlX,EAAAR,OAAiBQ,EAAcV,IAAAU,EAAAZ,IAAcY,EAAcmX,IAAAnX,EAAAnC,IAAcmC,EAAcoX,IAAApX,EAAArC,IAAcqC,EAAaqX,GAAArX,EAAAtC,QAAa,EACzX,MAAM4Z,EAAkBlW,GAClBmW,EAAYC,EACZC,EAAUrB,EAAgBsB,IAChC,IAAIC,EAAkBvW,GACtB9M,OAAOgB,eAAe0K,EAAS,KAAM,CAAE4X,WAAY,EAAMC,IAAK,WAAc,OAAOF,EAAgBja,EAAG,IACtGpJ,OAAOgB,eAAe0K,EAAS,KAAM,CAAE4X,WAAY,EAAMC,IAAK,WAAc,OAAOF,EAAgBpZ,EAAG,IACtGjK,OAAOgB,eAAe0K,EAAS,MAAO,CAAE4X,WAAY,EAAMC,IAAK,WAAc,OAAOF,EAAgBha,GAAI,IACxGrJ,OAAOgB,eAAe0K,EAAS,MAAO,CAAE4X,WAAY,EAAMC,IAAK,WAAc,OAAOF,EAAgBnZ,GAAI,IACxGlK,OAAOgB,eAAe0K,EAAS,MAAO,CAAE4X,WAAY,EAAMC,IAAK,WAAc,OAAOF,EAAgB9Z,GAAI,IACxGvJ,OAAOgB,eAAe0K,EAAS,MAAO,CAAE4X,WAAY,EAAMC,IAAK,WAAc,OAAOF,EAAgBjZ,GAAI,IACxGpK,OAAOgB,eAAe0K,EAAS,MAAO,CAAE4X,WAAY,EAAMC,IAAK,WAAc,OAAOF,EAAgBvY,GAAI,IACxG9K,OAAOgB,eAAe0K,EAAS,MAAO,CAAE4X,WAAY,EAAMC,IAAK,WAAc,OAAOF,EAAgBrY,GAAI,IACxGhL,OAAOgB,eAAe0K,EAAS,SAAU,CAAE4X,WAAY,EAAMC,IAAK,WAAc,OAAOF,EAAgBnY,MAAO,IAC9G,MAAMsY,UAAiBR,EAAgBjkB,OACnC,WAAAC,CAAYC,EAAMwkB,EAAQvkB,GACtBqC,MAAMtC,EAAMC,GACZI,KAAK+L,MAAO,EAAI2X,EAAgB3X,MAAMpM,GACtCK,KAAKmkB,OAASA,CACjB,CACD,MAAAjkB,CAAO1F,EAAG2F,EAAS,GACf,MAAMkO,EAAM,IAAIwV,EAAQnB,QAAQ1iB,KAAK+L,KAAK7L,OAAO1F,EAAG2F,GAAS,GAAI,MACjE,OAAIH,KAAKmkB,OACE9V,EAAIoE,SAAqB,EAAZzS,KAAKL,MAAU6P,QAEhCnB,CACV,CACD,MAAAjO,CAAOC,EAAK7F,EAAG2F,EAAS,GAIpB,OAHIH,KAAKmkB,SACL9jB,EAAMA,EAAI+R,OAAmB,EAAZpS,KAAKL,OAEnBK,KAAK+L,KAAK3L,OAAOC,EAAI8Q,YAAY/a,OAAQ,KAAM4J,KAAKL,MAAOnF,EAAG2F,EACxE,EAEL,SAASmjB,EAAI1jB,GACT,OAAO,IAAIskB,EAAS,EAAG,EAAOtkB,EACjC,CACDwM,EAAAkX,IAAcA,EAIdlX,EAAAgY,IAHA,SAAaxkB,GACT,OAAO,IAAIskB,EAAS,EAAG,EAAMtkB,EAChC,EAKDwM,EAAAiX,KAHA,SAAczjB,GACV,OAAO,IAAIskB,EAAS,GAAI,EAAOtkB,EAClC,EAKDwM,EAAAgX,KAHA,SAAcxjB,GACV,OAAO,IAAIskB,EAAS,GAAI,EAAMtkB,EACjC,EAKDwM,EAAA+W,KAHA,SAAcvjB,GACV,OAAO,IAAIskB,EAAS,GAAI,EAAOtkB,EAClC,EAKDwM,EAAA8W,KAHA,SAActjB,GACV,OAAO,IAAIskB,EAAS,GAAI,EAAMtkB,EACjC,EAED,MAAMykB,UAAsBX,EAAgBjkB,OACxC,WAAAC,CAAY4B,EAAQgjB,EAASC,EAAS3kB,GAClCqC,MAAMX,EAAO3B,KAAMC,GACnBI,KAAKsB,OAASA,EACdtB,KAAKskB,QAAUA,EACftkB,KAAKukB,QAAUA,CAClB,CACD,MAAArkB,CAAO1F,EAAG2F,GACN,OAAOH,KAAKskB,QAAQtkB,KAAKsB,OAAOpB,OAAO1F,EAAG2F,GAC7C,CACD,MAAAC,CAAOC,EAAK7F,EAAG2F,GACX,OAAOH,KAAKsB,OAAOlB,OAAOJ,KAAKukB,QAAQlkB,GAAM7F,EAAG2F,EACnD,CACD,OAAAG,CAAQ9F,EAAG2F,GACP,OAAOH,KAAKsB,OAAOhB,QAAQ9F,EAAG2F,EACjC,EAKLiM,EAAA6W,UAHA,SAAmBrjB,GACf,OAAO,IAAIykB,GAAc,EAAIX,EAAgB3X,MAAM,KAAMvR,GAAM,IAAImpB,EAAUa,UAAUhqB,KAAKiqB,GAAQA,EAAIvT,YAAYtR,EACvH,EAED,MAAM8kB,UAAqBhB,EAAgBjkB,OACvC,WAAAC,CAAY4B,EAAQ1B,GAChBqC,OAAO,EAAGrC,GACVI,KAAKsB,OAASA,EACdtB,KAAK0G,eAAgB,EAAIgd,EAAgB5Z,KAC5C,CACD,MAAA1J,CAAOC,EAAK7F,EAAG2F,EAAS,GACpB,OAAIE,QACOL,KAAK0G,cAActG,OAAO,EAAG5F,EAAG2F,IAE3CH,KAAK0G,cAActG,OAAO,EAAG5F,EAAG2F,GACzBH,KAAKsB,OAAOlB,OAAOC,EAAK7F,EAAG2F,EAAS,GAAK,EACnD,CACD,MAAAD,CAAO1F,EAAG2F,EAAS,GACf,MAAMuG,EAAgB1G,KAAK0G,cAAcxG,OAAO1F,EAAG2F,GACnD,GAAsB,IAAlBuG,EACA,OAAO,KAEN,GAAsB,IAAlBA,EACL,OAAO1G,KAAKsB,OAAOpB,OAAO1F,EAAG2F,EAAS,GAE1C,MAAM,IAAIhJ,MAAM,kBAAoB6I,KAAKJ,SAC5C,CACD,OAAAU,CAAQ9F,EAAG2F,EAAS,GAChB,MAAMuG,EAAgB1G,KAAK0G,cAAcxG,OAAO1F,EAAG2F,GACnD,GAAsB,IAAlBuG,EACA,OAAO,EAEN,GAAsB,IAAlBA,EACL,OAAO1G,KAAKsB,OAAOhB,QAAQ9F,EAAG2F,EAAS,GAAK,EAEhD,MAAM,IAAIhJ,MAAM,kBAAoB6I,KAAKJ,SAC5C,EAUL,SAAS+kB,EAAWhjB,GAChB,GAAc,IAAVA,EACA,OAAO,EAEN,GAAc,IAAVA,EACL,OAAO,EAEX,MAAM,IAAIxK,MAAM,iBAAmBwK,EACtC,CACD,SAASijB,EAAWjjB,GAChB,OAAOA,EAAQ,EAAI,CACtB,CA2BD,SAASihB,EAAMhjB,GACX,MAAMhI,GAAS,EAAI8rB,EAAgBzZ,KAAK,UAClC3I,GAAS,EAAIoiB,EAAgB9X,QAAQ,CACvChU,GACA,EAAI8rB,EAAgB3X,OAAM,EAAI2X,EAAgBvjB,QAAQvI,GAASA,EAAO+H,MAAO,UAEjF,OAAO,IAAI0kB,EAAc/iB,GAAQ,EAAGujB,UAAWA,IAAOA,IAAI,CAAQA,UAASjlB,EAC9E,CAlDDwM,EAAA4W,OAHA,SAAgB1hB,EAAQ1B,GACpB,OAAO,IAAI8kB,EAAapjB,EAAQ1B,EACnC,EAKDwM,EAAA2W,KAHA,SAAcnjB,GACV,OAAO,IAAIykB,GAAc,EAAIX,EAAgB5Z,MAAO6a,EAAYC,EAAYhlB,EAC/E,EAsBDwM,EAAA0W,IARA,SAAa9d,EAAepF,GACxB,MAAMhI,GAAS,EAAI8rB,EAAgBzZ,KAAK,UAClC3I,GAAS,EAAIoiB,EAAgB9X,QAAQ,CACvChU,GACA,EAAI8rB,EAAgB7X,KAAK7G,GAAe,EAAI0e,EAAgBvjB,QAAQvI,GAASA,EAAO+H,MAAO,YAE/F,OAAO,IAAI0kB,EAAc/iB,GAAQ,EAAGP,YAAaA,IAASA,IAAM,CAAQA,YAAWnB,EACtF,EAkBDwM,EAAAyW,OAhBA,SAAgBxb,EAAK/F,EAAQ1B,GACzB,MAAMklB,GAAgB,EAAIpB,EAAgB9X,QAAQ,CAC9C0X,EAAI,OACJhiB,EAAOd,UAAU,UAWrB,OAAO,IAAI6jB,EAAcS,GATzB,UAAqBzd,IAAK0d,EAAWF,KAAEA,IACnC,IAAKE,EAAY5pB,GAAGkM,GAChB,MAAM,IAAIlQ,MAAM,0BACZkQ,EAAIpO,SAAS,OACb,UACA8rB,EAAY9rB,SAAS,QAE7B,OAAO4rB,CACV,IACmDA,KAAYxd,MAAKwd,UAASjlB,EACjF,EAUDwM,EAAAwW,MAAgBA,EAIhBxW,EAAA6B,IAHA,SAAarO,GACT,OAAO,IAAIykB,EAAczB,KAAUiC,GAASA,EAAK5rB,SAAS,WAAWihB,GAAM9jB,OAAOC,KAAK6jB,EAAG,UAAUta,EACvG,EAODwM,EAAAuW,SALA,SAAkBqC,EAAUplB,EAAUqlB,GAClC,MAAMC,GAAc,EAAIxB,EAAgB5b,OAAOmd,QAAmDA,GAAe,EAAIvB,EAAgB5Z,MAAOlK,GAE5I,OADAolB,EAASvnB,SAAQ,CAACiK,EAAShK,IAAUwnB,EAAYzd,WAAW/J,EAAOgK,EAASA,EAAQ9H,YAC7EslB,CACV,EAQD9Y,EAAA9S,MANA,SAAe0L,EAAepN,EAAQgI,GAClC,MAAM0B,GAAS,EAAIoiB,EAAgB9X,QAAQ,EACvC,EAAI8X,EAAgB7X,KAAK7G,EAAepN,EAAQ,YAEpD,OAAO,IAAIysB,EAAc/iB,GAAQ,EAAGP,YAAaA,IAASA,IAAM,CAAQA,YAAWnB,EACtF,EAED,MAAMulB,UAAuBzB,EAAgBjkB,OACzC,WAAAC,CAAY0lB,EAAWC,EAAazlB,GAChCqC,MAAMmjB,EAAUzlB,KAAO0lB,EAAY1lB,KAAMC,GACzCI,KAAKolB,UAAYA,EACjBplB,KAAKqlB,YAAcA,CACtB,CACD,MAAAnlB,CAAO1F,EAAG2F,GAIN,OAHAA,EAASA,GAAU,EAGZ,CAFKH,KAAKolB,UAAUllB,OAAO1F,EAAG2F,GACvBH,KAAKqlB,YAAYnlB,OAAO1F,EAAG2F,EAASH,KAAKolB,UAAU9kB,QAAQ9F,EAAG2F,IAE/E,CACD,MAAAC,CAAOC,EAAK7F,EAAG2F,GACXA,EAASA,GAAU,EACnB,MAAMmlB,EAAWtlB,KAAKolB,UAAUhlB,OAAOC,EAAI,GAAI7F,EAAG2F,GAElD,OAAOmlB,EADYtlB,KAAKqlB,YAAYjlB,OAAOC,EAAI,GAAI7F,EAAG2F,EAASmlB,EAElE,CACD,OAAAhlB,CAAQ9F,EAAG2F,GACP,OAAQH,KAAKolB,UAAU9kB,QAAQ9F,EAAG2F,GAAUH,KAAKqlB,YAAY/kB,QAAQ9F,EAAG2F,EAC3E,EAULiM,EAAAjU,IARA,SAAaitB,EAAWC,EAAazlB,GACjC,MAAMhI,GAAS,EAAI8rB,EAAgBzZ,KAAK,UAClC3I,GAAS,EAAIoiB,EAAgB9X,QAAQ,CACvChU,GACA,EAAI8rB,EAAgB7X,KAAK,IAAIsZ,EAAeC,EAAWC,IAAc,EAAI3B,EAAgBvjB,QAAQvI,GAASA,EAAO+H,MAAO,YAE5H,OAAO,IAAI0kB,EAAc/iB,GAAQ,EAAGP,YAAa,IAAIwkB,IAAIxkB,KAAUA,IAAM,CAAQA,OAAQpJ,MAAMtB,KAAK0K,EAAOykB,cAAe5lB,EAC7H,OCzLD,MAAM6lB,GAAwB7Z,GAAAA,OAAO,CACjCtS,GAAAA,MAAMwQ,GAAEA,KAAI,GAAI,KAChBxQ,GAAAA,MAAMwQ,GAAEA,KAAI,GAAI,KAChBxQ,GAAAA,MAAMwQ,GAAEA,KAAI,GAAI,OAGd4b,GAAsC9Z,GAAAA,OAAO,CAC/CqX,GAAAA,UAAU,SACVK,GAAAA,IAAI,UACJN,UAAOM,GAAAA,MAAO,YACdxZ,GAAAA,GAAG,mBACHkZ,UAAOJ,GAAAA,QAAS,SAGd+C,GAAkC/Z,GAAAA,OAAO,CAC3C0X,GAAAA,IAAI,UACJN,UAAOlZ,GAAAA,KAAM,iBACb8B,UACI,CACI9B,GAAAA,GAAG,yBACHA,GAAAA,GAAG,oBACHG,GAAAA,IAAI,aACJ8Y,GAAAA,KAAK,iBAET,iBAEJhZ,GAAAA,IAAI,aACJiZ,UAAOM,GAAAA,MAAO,YACdN,UAAOJ,GAAAA,QAAS,SAGPgD,GAA0Bha,GAAAA,OAAO,CAC1CqX,GAAAA,UAAU,SACVD,UAAOlZ,GAAAA,KAAM,gCAGJ+b,GAAmBja,GAAAA,OAAO,CACnCmX,GAAAA,KAAK,cACLA,GAAAA,KAAK,mBACLjZ,GAAAA,GAAG,4BAGMgc,GAA+Cla,GAAAA,OAAO,CAC/DoX,GAAMA,OAACyC,GAAuB,SAC9BxC,GAAAA,UAAU,QACVD,GAAMA,OAAC4C,GAAyB,qBAChC9C,GAAGA,IAAC6C,GAAiC,6BACrC7C,GAAGA,IAAC4C,GAAqC,4BACzC3C,GAAAA,KAAK,cACLC,UAAOM,GAAAA,MAAO,8BACdN,GAAMA,OAAC6C,GAAkB,cACzB7C,UAAOlZ,GAAAA,KAAM,0CAGJic,GAAena,GAAAA,OAAO,CAC/BkX,OAAIG,GAAAA,YAAa,cACjBH,OAAIQ,GAAAA,MAAO,WACXN,UAAOM,GAAAA,MAAO,cAGL0C,GAAsBpa,GAAAA,OAAO,CACtCkX,OAAIG,GAAAA,YAAa,WACjBD,GAAAA,OAAOF,GAAAA,IAAIQ,GAAAA,MAAO,WAAY,WAC9BN,UAAOM,GAAAA,MAAO,YACdN,UAAOM,GAAAA,MAAO,UACdxZ,GAAAA,GAAG,SACHA,GAAAA,GAAG,UAGMmc,GAA+Cra,GAAAA,OAAO,CAC/DqX,GAAAA,UAAU,SACVD,UAAOM,GAAAA,MAAO,mBACdN,GAAMA,OAAC6C,GAAkB,gBAGvB,SAAUK,GACZrB,GAEA,MAAMsB,EAAS/vB,EAAOgwB,MAAM,KACtBjY,EAAM4X,GAAa3lB,OACrB,CACIimB,WAAYxB,EAAKwB,WACjBC,QAASzB,EAAKyB,QACdjrB,SAAUwpB,EAAKxpB,UAEnB8qB,GAGJ,OAAO/vB,EAAOmwB,OAAO,CACjB,IAAIC,WAAWhwB,IACf,IAAIgwB,WAAWL,EAAOM,SAAS,EAAGtY,KAE1C,CAUM,SAAUuY,GACZ7B,GAEA,MAAMsB,EAAS/vB,EAAOgwB,MAAM,KACtBjY,EAAM6X,GAAoB5lB,OAAOykB,EAAMsB,GAEvCQ,EAAevwB,EAAOgwB,MAAM,GAClCO,EAAaljB,cAAc0K,EAAK,GAEhC,MAAMyY,EAAaT,EAAOM,SAAS,EAAGtY,GACtC,OAAO/X,EAAOmwB,OAAO,CACjB,IAAIC,WAAW/vB,IACf,IAAI+vB,WAAWG,GACf,IAAIH,WAAWI,IAEvB,CAUM,SAAUC,GACZhC,GAEA,MAAMsB,EAAS/vB,EAAOgwB,MAAM,KACtBjY,EAAM8X,GAA6C7lB,OACrD,CACI7H,MAAOssB,EAAKtsB,MACZuuB,gBAAiBjC,EAAKiC,gBACtBC,WAAYlC,EAAKkC,YAErBZ,GAGJ,OAAO/vB,EAAOmwB,OAAO,CACjB,IAAIC,WAAW7vB,IACf,IAAI6vB,WAAWL,EAAOM,SAAS,EAAGtY,KAE1C,CAcM,SAAU6Y,GACZnC,GAEA,MAAMsB,EAAS/vB,EAAOgwB,MAAM,KAEtBjY,EAAM2X,GAA6C1lB,OACrDykB,EACAsB,GAGEQ,EAAevwB,EAAOgwB,MAAM,GAClCO,EAAaljB,cAAc0K,EAAK,GAEhC,MAAMyY,EAAaT,EAAOM,SAAS,EAAGtY,GAEtC,OAAO/X,EAAOmwB,OAAO,CACjB,IAAIC,WAAW9vB,IACf,IAAI8vB,WAAWG,GACf,IAAIH,WAAWI,IAEvB,CAuDa,MAAAK,GACTpsB,IAEA,MAAMqsB,SACFA,EAAQxuB,aACRA,EAAYyuB,cACZA,EAAalwB,KACbA,EAAIuB,aACJA,EAAY4uB,gBACZA,GACAvsB,EACJ,MAAO,CACH,CAAEsE,OAAQ+nB,EAAU7nB,SAAU,EAAMD,WAAY,GAChD,CAAED,OAAQzG,EAAc2G,SAAU,EAAOD,WAAY,GACrD,CAAED,OAAQgoB,EAAe9nB,SAAU,EAAOD,WAAY,GACtD,CAAED,OAAQlI,EAAMoI,SAAU,EAAOD,WAAY,GAC7C,CAAED,OAAQ3G,EAAc6G,SAAU,EAAOD,WAAY,GACrD,CAAED,OAAQioB,EAAiB/nB,SAAU,EAAOD,WAAY,GAC3D,EAGQioB,GACTxsB,IAEA,MAAMqsB,SACFA,EAAQxuB,aACRA,EAAYyuB,cACZA,EAAalwB,KACbA,EAAIuB,aACJA,EAAY4uB,gBACZA,EAAeE,qBACfA,GACAzsB,EACJ,MAAO,CACH,CAAEsE,OAAQ+nB,EAAU7nB,SAAU,EAAMD,WAAY,GAChD,CAAED,OAAQzG,EAAc2G,SAAU,EAAOD,WAAY,GACrD,CAAED,OAAQmoB,EAAsBjoB,SAAU,EAAOD,WAAY,GAC7D,CAAED,OAAQgoB,EAAe9nB,SAAU,EAAOD,WAAY,GACtD,CAAED,OAAQlI,EAAMoI,SAAU,EAAOD,WAAY,GAC7C,CAAED,OAAQ3G,EAAc6G,SAAU,EAAOD,WAAY,GACrD,CAAED,OAAQioB,EAAiB/nB,SAAU,EAAOD,WAAY,GAC3D,EAGQmoB,GACT1sB,IAEA,MAAM2sB,EAAgBzvB,GAAuB0vB,WACvCP,SACFA,EAAQQ,UACRA,EAASN,gBACTA,EAAenwB,KACfA,EAAIyB,aACJA,EAAYF,aACZA,EAAYmvB,mBACZA,EAAkBC,qBAClBA,EAAoBC,YACpBA,EAAWC,4BACXA,EAA2BC,0BAC3BA,EAAyBC,WACzBA,EAAUC,YACVA,EAAWd,cACXA,EAAae,WACbA,GACArtB,EAgCJ,MA9BoC,CAChC,CAAEsE,OAAQ+nB,EAAU7nB,SAAU,EAAMD,WAAY,GAChD,CAAED,OAAQuoB,EAAWroB,SAAU,EAAMD,WAAY,GACjD,CAAED,OAAQioB,EAAiB/nB,SAAU,EAAOD,WAAY,GACxD,CAAED,OAAQlI,EAAMoI,SAAU,EAAOD,WAAY,GAC7C,CAAED,OAAQzG,EAAc2G,SAAU,EAAOD,WAAY,GACrD,CAAED,OAAQ3G,EAAc6G,SAAU,EAAOD,WAAY,GACrD,CAAED,OAAQwoB,EAAoBtoB,SAAU,EAAOD,WAAY,GAC3D,CAAED,OAAQyoB,EAAsBvoB,SAAU,EAAOD,WAAY,GAC7D,CAAED,OAAQ0oB,EAAaxoB,SAAU,EAAOD,WAAY,GACpD,CACID,OAAQ2oB,EACRzoB,SAAU,EACVD,WAAY,GAEhB,CACID,OAAQ4oB,EACR1oB,SAAU,EACVD,WAAY,GAEhB,CAAED,OAAQ6oB,EAAY3oB,SAAU,EAAOD,WAAY,GACnD,CAAED,OAAQ8oB,EAAa5oB,SAAU,EAAOD,WAAY,GACpD,CAAED,OAAQgoB,EAAe9nB,SAAU,EAAOD,WAAY,GACtD,CACID,OAAQ+oB,QAAAA,EAAcV,EACtBnoB,SAAU,EACVD,WAAY,GAID,EAGV+oB,GACTttB,IAEA,MAAM2sB,EAAgBzvB,GAAuB0vB,WACvCP,SACFA,EAAQQ,UACRA,EAASN,gBACTA,EAAeO,mBACfA,EAAkBC,qBAClBA,EAAoBC,YACpBA,EAAWC,4BACXA,EAA2BC,0BAC3BA,EAAyBE,YACzBA,EAAWvvB,aACXA,EAAY0vB,iCACZA,EAAgC5vB,aAChCA,EAAY2uB,cACZA,GACAtsB,EAsCJ,MApCoC,CAChC,CAAEsE,OAAQ+nB,EAAU7nB,SAAU,EAAMD,WAAY,GAChD,CAAED,OAAQuoB,EAAWroB,SAAU,EAAMD,WAAY,GACjD,CAAED,OAAQioB,EAAiB/nB,SAAU,EAAOD,WAAY,GACxD,CAAED,OAAQwoB,EAAoBtoB,SAAU,EAAOD,WAAY,GAC3D,CAAED,OAAQyoB,EAAsBvoB,SAAU,EAAOD,WAAY,GAC7D,CAAED,OAAQ0oB,EAAaxoB,SAAU,EAAOD,WAAY,GACpD,CACID,OAAQ2oB,EACRzoB,SAAU,EACVD,WAAY,GAEhB,CACID,OAAQ4oB,EACR1oB,SAAU,EACVD,WAAY,GAEhB,CAAED,OAAQ8oB,EAAa5oB,SAAU,EAAOD,WAAY,GACpD,CACID,OAAQzG,QAAAA,EAAgB8uB,EACxBnoB,SAAU,EACVD,WAAY,GAEhB,CACID,OAAQipB,QAAAA,EAAoCZ,EAC5CnoB,SAAU,EACVD,WAAY,GAEhB,CACID,OAAQ3G,QAAAA,EAAgBgvB,EACxBnoB,SAAU,EACVD,WAAY,GAEhB,CAAED,OAAQgoB,EAAe9nB,SAAU,EAAOD,WAAY,GAGvC,EAGVipB,GACTxtB,IAEA,MAAMqsB,SACFA,EAAQQ,UACRA,EAASN,gBACTA,EAAeO,mBACfA,EAAkBC,qBAClBA,EAAoBC,YACpBA,EAAWC,4BACXA,EAA2BC,0BAC3BA,EAAyBE,YACzBA,EAAWd,cACXA,GACAtsB,EAEJ,MAAO,CACH,CAAEsE,OAAQ+nB,EAAU7nB,SAAU,EAAMD,WAAY,GAChD,CAAED,OAAQuoB,EAAWroB,SAAU,EAAMD,WAAY,GACjD,CAAED,OAAQioB,EAAiB/nB,SAAU,EAAOD,WAAY,GACxD,CAAED,OAAQwoB,EAAoBtoB,SAAU,EAAOD,WAAY,GAC3D,CAAED,OAAQyoB,EAAsBvoB,SAAU,EAAOD,WAAY,GAC7D,CAAED,OAAQ0oB,EAAaxoB,SAAU,EAAOD,WAAY,GACpD,CACID,OAAQ2oB,EACRzoB,SAAU,EACVD,WAAY,GAEhB,CACID,OAAQ4oB,EACR1oB,SAAU,EACVD,WAAY,GAEhB,CAAED,OAAQ8oB,EAAa5oB,SAAU,EAAOD,WAAY,GACpD,CAAED,OAAQgoB,EAAe9nB,SAAU,EAAOD,WAAY,GACzD,EAGQkpB,GAAuBD,GAEvBE,GACT1tB,IAEA,MAAMqsB,SACFA,EAAQQ,UACRA,EAASN,gBACTA,EAAeO,mBACfA,EAAkBC,qBAClBA,EAAoBC,YACpBA,EAAWC,4BACXA,EAA2BC,0BAC3BA,EAAyBE,YACzBA,EAAWd,cACXA,EAAalwB,KACbA,GACA4D,EAEJ,MAAO,CACH,CAAEsE,OAAQ+nB,EAAU7nB,SAAU,EAAMD,WAAY,GAChD,CAAED,OAAQuoB,EAAWroB,SAAU,EAAMD,WAAY,GACjD,CAAED,OAAQioB,EAAiB/nB,SAAU,EAAOD,WAAY,GACxD,CAAED,OAAQwoB,EAAoBtoB,SAAU,EAAOD,WAAY,GAC3D,CAAED,OAAQyoB,EAAsBvoB,SAAU,EAAOD,WAAY,GAC7D,CAAED,OAAQ0oB,EAAaxoB,SAAU,EAAOD,WAAY,GACpD,CACID,OAAQ2oB,EACRzoB,SAAU,EACVD,WAAY,GAEhB,CACID,OAAQ4oB,EACR1oB,SAAU,EACVD,WAAY,GAEhB,CAAED,OAAQ8oB,EAAa5oB,SAAU,EAAOD,WAAY,GACpD,CAAED,OAAQgoB,EAAe9nB,SAAU,EAAOD,WAAY,GACtD,CAAED,OAAQlI,EAAMoI,SAAU,EAAOD,WAAY,GAChD,EAGQopB,GAAqBD,GAErBE,GAA8C7c,GAAAA,OAAO,CAC9DA,GAAMA,OACF,CAACtS,GAAAA,MAAMwQ,GAAEA,KAAI,GAAI,KAAMxQ,GAAAA,MAAMwQ,GAAEA,KAAI,GAAI,KAAMxQ,GAAAA,MAAMwQ,GAAEA,KAAI,GAAI,MAC7D,SAEJmZ,GAAAA,UAAU,QACVH,GAAGA,IAAC6C,GAAiC,6BACrC3C,GAAMA,OAAC6C,GAAkB,cACzB5C,GAAAA,UAAU,YACVK,GAAAA,IAAI,mBACJxZ,GAAAA,GAAG,2BACHA,GAAAA,GAAG,gCACHkZ,UAAOM,GAAAA,MAAO,sBAGLoF,GAA6C9c,GAAAA,OAAO,CAC7DA,GAAMA,OACF,CAACtS,GAAAA,MAAMwQ,GAAEA,KAAI,GAAI,KAAMxQ,GAAAA,MAAMwQ,GAAEA,KAAI,GAAI,KAAMxQ,GAAAA,MAAMwQ,GAAEA,KAAI,GAAI,MAC7D,SAEJmZ,GAAAA,UAAU,QACVH,GAAGA,IAAC6C,GAAiC,6BACrC3C,GAAMA,OAAC6C,GAAkB,cACzB/b,GAAAA,GAAG,kCAID6e,GAA4B,CAC9BpuB,EAAG,IAAI5C,MAAM,IAAIixB,KAAK,GACtBpuB,EAAG,IAAI7C,MAAM,IAAIixB,KAAK,GACtBjb,EAAG,IAAIhW,MAAM,IAAIixB,KAAK,IAG1B,SAASC,GAAaC,GAClB,OACIA,EAAMvuB,EAAEE,OAAMF,GAAW,IAANA,KACnBuuB,EAAMtuB,EAAEC,OAAMD,GAAW,IAANA,KACnBsuB,EAAMnb,EAAElT,OAAMkT,GAAW,IAANA,GAE3B,CAEM,SAAUob,GACZlE,SAEA,MAAMsB,EAAS/vB,EAAOgwB,MAAM,KAEtB4C,EAAwB,QAAV/pB,EAAA4lB,EAAKiE,aAAK,IAAA7pB,EAAAA,EAAI0pB,GAE5Bxa,EAAMsa,GAA4CroB,OAE7CM,OAAAG,OAAAH,OAAAG,OAAA,CAAA,EAAAgkB,GACH,CAAAiE,MAAOE,IAEX7C,GAGEQ,EAAevwB,EAAOgwB,MAAM,GAClCO,EAAaljB,cAAc0K,EAAK,GAEhC,MAAMyY,EAAaT,EAAOM,SAAS,EAAGtY,GAEtC,OAAO/X,EAAOmwB,OAAO,CACjB,IAAIC,WAAW5vB,IACf,IAAI4vB,WAAWG,GACf,IAAIH,WAAWI,IAEvB,CAcM,SAAUqC,GACZpE,SAEA,MAAMsB,EAAS/vB,EAAOgwB,MAAM,KAEtB4C,EAAwB,QAAV/pB,EAAA4lB,EAAKiE,aAAK,IAAA7pB,EAAAA,EAAI0pB,GAE5Bxa,EAAMua,GAA2CtoB,OAE5CM,OAAAG,OAAAH,OAAAG,OAAA,CAAA,EAAAgkB,GACH,CAAAiE,MAAOE,IAEX7C,GAGEQ,EAAevwB,EAAOgwB,MAAM,GAClCO,EAAaljB,cAAc0K,EAAK,GAEhC,MAAMyY,EAAaT,EAAOM,SAAS,EAAGtY,GAEtC,OAAO/X,EAAOmwB,OAAO,CACjB,IAAIC,WAAW3vB,IACf,IAAI2vB,WAAWG,GACf,IAAIH,WAAWI,IAEvB,CC1Ka,MAAAsC,GAAoBruB,GACtBA,EAASkB,QACZ,CAACC,EAAKf,IAAgCe,EAAIC,IAAIhB,EAAQC,OAAOlC,SAC7DD,EAAAA,GAAG,IAOEowB,GAA0BtuB,IACnC,MAAMtC,EAAQsC,EAAS,GAAGK,OAAO3C,MACjCsC,EAAS4C,SAAQzB,IACb,IAAKA,EAAId,OAAO3C,MAAMrB,OAAOqB,GACzB,MAAM,IAAIpB,MAAM,iDACnB,GACH,EAMOiyB,GACT5pB,IAMO,CAAEvI,KAJIuI,EAAwB,GAAGtE,OAAOjE,KAIhCoyB,aAHM7pB,EAAwB,GAAGtE,OAAO3C,MAG1B+E,SAFZkC,EAAwB,GAAGtE,OAAOoC,WAK1CgsB,GAA8B,CACvCC,EACAC,KAEA,GAAID,EAAO3xB,OAAS,EAChB,MAAM,IAAIT,MAAM,iDAEpB,MAAMoB,EAAQgxB,EAAO,GAAGruB,OAAO3C,MAEzBkxB,EAAyBF,EAAOG,WAAUnvB,GAAKA,EAAEW,OAAOoC,WAG9D,IAAgC,IAA5BmsB,EACA,MAAO,CAAEE,kBAAmB,KAAMjC,UAAWnvB,GAEjD,MAAM+E,EAAWisB,EAAOE,GAAwBvuB,OAAOoC,SAGvD,MAAO,CACHqsB,kBAAmB,CACfpxB,QACAqxB,2BAL2BJ,EAAQ5xB,QAAU,EAAI,KAAO,GAO5D8vB,UAAWpqB,EACd,WAWWusB,GACZ7sB,EACA8sB,EACA9wB,GAEAA,EAASD,EAAAA,GAAGC,GACZ,MAAM+wB,EAAcb,GAAiBlsB,GAC/BgtB,EAAgBC,EAAaA,cAC/BjtB,EAA6B7E,KAAI6D,GAAOA,EAAIZ,qBAG1C8uB,EAAeH,EAAY7V,IAAIlb,GAIrC,OAFAmxB,EAAyBA,0BAACD,GAEtBA,EAAa/uB,GAAGpC,EAAEA,GAAC,KAAOixB,EAAc7uB,GAAGpC,EAAAA,GAAG,IACvC,CACH,CACIR,MAAOuxB,EACP9wB,SACAqC,SAAU2uB,EACV5rB,IAAK,QAMjBgsB,EAAiBA,kBACbptB,EAA6B7E,KAAI6D,GAAOA,EAAIZ,qBAEhD+tB,GAAuBnsB,GAEqC,CACxD,CACIzE,MAAOyE,EAA6B,GAAG9B,OAAO3C,MAC9CS,OAAQkxB,EACR7uB,SAAU2uB,EACV5rB,IAAK,MAET,CACI7F,MAAOuxB,EACP9wB,SACAqC,SAAUtC,EAAEA,GAAC,GACbqF,IAAK,OAIjB,CASgB,SAAAisB,GACZrtB,EACAhE,GAEAA,EAASD,EAAAA,GAAGC,GACZ,MAAMgxB,EAAgBC,EAAaA,cAC/BjtB,EAA6B7E,KAAI6D,GAAOA,EAAIZ,qBAG1C8uB,EADchB,GAAiBlsB,GACJkX,IAAIlb,GAKrC,OAHAmxB,EAAyBA,0BAACD,GAGtBA,EAAa/uB,GAAGpC,EAAEA,GAAC,KAAOixB,EAAc7uB,GAAGpC,EAAAA,GAAG,IACvC,IAGXqxB,EAAiBA,kBACbptB,EAA6B7E,KAAI6D,GAAOA,EAAIZ,qBAEhD+tB,GAAuBnsB,GAEiC,CACpD,CACIzE,MAAOyE,EAA6B,GAAG9B,OAAO3C,MAC9CS,OAAQkxB,EACR7uB,SAAU2uB,EACV5rB,IAAK,OAIjB,OAEarG,GAIT,WAAA2H,GAAgB,CAehB,mBAAO4qB,CAAa7C,GAChBznB,KAAKynB,UACoB,iBAAdA,EACD,IAAIjD,EAAAA,UAAUiD,GACdA,CACb,CAUD,yBAAO8C,CAAmBtzB,GACtB,MAAMuzB,EAAQ,CAACr0B,GAAWc,EAAKia,aACxBvY,EAASd,GAAK2sB,EAAAA,UAAUiG,uBAC3BD,EACAxqB,KAAKynB,WAET,OAAO9uB,CACV,CAUD,gCAAO+xB,CACHC,EACA1zB,GAEA,IAAK,IAAIyG,EAAQ,EAAGA,EAAQ,EAAGA,IAAS,CACpC,MAAMktB,EACF7yB,GAAuBC,4BAA4Bf,EAAMyG,GAC7D,GAAIktB,EAAW,GAAG1zB,OAAOyzB,GACrB,MAAO,CAACjtB,EAAOktB,EAAW,GAEjC,CACD,MAAM,IAAIzzB,MAAM,uBACnB,CAWD,kCAAOa,CACHf,EACAyG,GAEA,IAAI8sB,EAAkB,GAElBA,EADU,IAAV9sB,EACQ,CAACtH,EAAOC,KAAK,QAASY,EAAKia,WAAY9a,EAAOC,KAAK,KAEnD,CACJD,EAAOC,KAAK,QACZY,EAAKia,WACL9a,EAAOC,KAAK,CAACqH,KAGrB,MAAO/E,EAASQ,GAAQqrB,EAAAA,UAAUiG,uBAC9BD,EACAxqB,KAAKynB,WAET,MAAO,CAAC9uB,EAASQ,EACpB,CAGD,gCAAW0xB,GACP,MAAOlyB,EAASd,GAAK2sB,EAASA,UAACiG,uBAC3B,CAACn0B,IACD0J,KAAKynB,WAET,OAAO9uB,CACV,CAoBD,uBAAamyB,EAAW5D,SACpBA,EAAQjwB,KACRA,EAAIywB,UACJA,EAASqD,gBACTA,EAAeC,SACfA,EAAQC,kBACRA,EAAiBC,eACjBA,EAAcC,SACdA,IAEA,MAAM3yB,EAAe0yB,QAAAA,EAAkBE,mBAyBvC,MAAO,CAtB8BC,EAAaA,cAACC,cAAc,CAC7DC,WAAYrE,EACZ7rB,SAAU4vB,EACVO,iBAAkBv0B,EAClBwwB,UAAWjvB,EACXizB,MAAON,QAAAA,EAAYO,EAASA,YAGEC,EAAAA,iCAC9B10B,EACA+zB,EACAtD,EACAqD,EACAvyB,SAGqCwH,KAAK4rB,gBAAgB,CAC1D1E,WACAjwB,OACAi0B,eAAgB1yB,IAQvB,CAaD,4BAAaozB,EAAgB1E,SACzBA,EAAQjwB,KACRA,EAAIi0B,eACJA,IAEA,MAAM1yB,EAAe0yB,QAAAA,EAAkBE,mBAEjC1yB,EAAesH,KAAKhI,4BAA4Bf,EAAM,GAEtD40B,EAAO5E,GAA8B,CACvChwB,OACAiwB,WACAxuB,aAAcA,EAAa,GAC3BF,eACA4uB,gBAAiBpnB,KAAK6qB,sBACtB1D,cAAekE,EAAaA,cAAC5D,YAGjC,OAAO,IAAIqE,EAAAA,uBAAuB,CAC9BrE,UAAWznB,KAAKynB,UAChBoE,OACAhH,KAAMtuB,IAEb,CAcD,yBAAaw1B,EAAa7E,SACtBA,EAAQjwB,KACRA,EAAIiC,UACJA,EAASgyB,eACTA,IAEA,GAAIhyB,GAAa,EACb,MAAM,IAAI/B,MACN,0EAGR,GAAI+B,EAAY,EACZ,MAAM,IAAI/B,MACN,qBAAqB+B,4BAI7B,MAAMV,EAAe0yB,QAAAA,EAAkBE,mBAEjC9D,EAAuBtnB,KAAKhI,4BAC9Bf,EACAiC,EAAY,GAEVR,EAAesH,KAAKhI,4BAA4Bf,EAAMiC,GAEtD2yB,EAAOxE,GAA2B,CACpCpwB,OACAiwB,WACAxuB,aAAcA,EAAa,GAC3B4uB,qBAAsBA,EAAqB,GAC3C9uB,eACA4uB,gBAAiBpnB,KAAK6qB,sBACtB1D,cAAekE,EAAaA,cAAC5D,YAGjC,OAAO,IAAIqE,EAAAA,uBAAuB,CAC9BrE,UAAWznB,KAAKynB,UAChBoE,OACAhH,KAAMzuB,EAAOmwB,OAAO,CAChB,IAAIC,WAAW1vB,IACf,IAAI0vB,WAAWpwB,EAAOC,KAAK,CAAC6C,QAGvC,CAeD,mBAAa8yB,EAAO9E,SAChBA,EAAQjwB,KACRA,EAAIywB,UACJA,EAASuE,SACTA,EAAQjzB,OACRA,EAAMiE,oBACNA,EAAmBjG,cACnBA,IAEA,MAAMk1B,EAAaC,EAAAA,8BACb3zB,EAAexB,EAAcwB,aACnCzB,GAAmBC,EAAeC,GAElC,MAAMqvB,EAAUzX,EAAOA,QAAc7V,GAAQb,KAAIa,GAAUD,EAAAA,GAAGC,KACxDozB,EAAYvd,UAAQod,GAE1B,GAAI3F,EAAQ1uB,SAAWw0B,EAAUx0B,OAC7B,MAAM,IAAIT,MACN,wDAIR,MAAM00B,EAAOtE,GAAqB,CAC9BtwB,OACAiwB,WACAQ,YACAN,gBAAiBpnB,KAAK6qB,sBACtBryB,eACAE,aAAc1B,EAAc0B,aAC5BivB,mBAAoB0E,EAAkBA,mBAAC5E,UACvCG,qBAAsBsE,EAAWtE,qBACjCC,YAAaqE,EAAWrE,YACxBC,4BAA6BoE,EAAWpE,4BACxCC,0BAA2BmE,EAAWnE,0BACtCC,WACI/qB,EAAoBuB,WAAaC,EAAAA,SAASC,QACpCzB,EAAoBc,MACpBd,EAAoBY,KAC9BoqB,YAAajoB,KAAKynB,UAClBN,cAAekE,EAAaA,cAAC5D,UAC7BS,WAAY,OAGVrD,EAAOqB,GAA4B,CACrCG,WAAY+F,EACZ9F,UACAjrB,SAAU,OAGd,OAAO,IAAIywB,EAAAA,uBAAuB,CAC9BrE,UAAWznB,KAAKynB,UAChBoE,OACAhH,QAEP,CAiBD,6BAAayH,EAAiBpF,SAC1BA,EAAQjwB,KACRA,EAAIywB,UACJA,EAAS6E,sBACTA,EAAqBN,SACrBA,EAAQjzB,OACRA,EAAMiE,oBACNA,EAAmBjG,cACnBA,IAEA,MAAMw1B,EAAuBC,OAAOzzB,EAAOC,YAwB3C,MAAO,CArBsByzB,0BACzBz1B,EACAs1B,EACA7E,EACA8E,EACA,GACAx1B,EAAcwB,oBAIgBwH,KAAK2sB,SAAS,CAC5CC,MAAO1F,EACP3uB,MAAOmvB,EACPmF,OAAQN,EACRzC,UAAWmC,EACXh1B,OACA+B,SACAiE,sBACAjG,kBAIP,CAcD,qBAAa81B,EAASF,MAClBA,EAAK5vB,6BACLA,EAA4B8sB,UAC5BA,EAAS9wB,OACTA,EAAM+zB,oBACNA,EAAmBC,4BACnBA,IAEA,MAAM7vB,EACF0sB,GACI7sB,EACA8sB,EACA9wB,IAGFsG,0BACFA,EAAyBP,sBACzBA,EAAqBG,sBACrBA,GACApC,GAA4B,CAC5BE,+BACAE,YAAa8vB,EACb7vB,0BAGElG,KAAEA,GAASmyB,GAAepsB,IAE1B2sB,kBAAEA,EAAiBjC,UAAEA,GAAc4B,GACrCtsB,EACAG,GAcE0nB,EAAOmC,GAX2C,CACpD8B,MAAOiE,EACP91B,OACA0yB,oBACArqB,4BACA2tB,yBAA0BluB,EAC1BmuB,2BAA4B,KAC5BC,WAAY,EACZpG,WAAY,KACZqG,qCAAsC,QAIpCtF,4BACFA,EAA2BD,YAC3BA,EAAWD,qBACXA,EAAoBG,0BACpBA,GACAoE,EAAAA,8BACEN,EAAO1D,GAAuB,CAChCjB,SAAU0F,EACVlF,YACAN,gBAAiBpnB,KAAK6qB,sBACtBlD,mBAAoB0E,EAAkBA,mBAAC5E,UACvCG,qBAAsBA,EACtBC,YAAaA,EACbC,4BAA6BA,EAC7BC,0BAA2BA,EAC3BE,YAAajoB,KAAKynB,UAClB/uB,kBAAcG,EACduvB,sCAAkCvvB,EAClCL,kBAAcK,EACdsuB,cAAekE,EAAaA,cAAC5D,YAKjC,OAFAoE,EAAK1vB,QAAQ+C,GAEN,IAAI4sB,EAAAA,uBAAuB,CAC9BrE,UAAWznB,KAAKynB,UAChBoE,OACAhH,QAEP,CAcD,0CAAawI,EAA8BT,MACvCA,EAAKlF,UACLA,EAAS4F,MACTA,EAAKC,WACLA,EAAU7wB,kBACVA,IAGA,IAAI8wB,EAAuB,CACvBnC,EAAAA,cAAc5D,UACdgG,EAAAA,qBAAqBhG,UACrBznB,KAAK6qB,sBACLwB,EAAAA,mBAAmB5E,UACnB1vB,GAAuB0vB,UACvB0E,EAAAA,8BAA8BvE,qBAC9BuE,EAAAA,8BAA8BtE,YAC9BsE,EAAAA,8BAA8BrE,4BAC9BqE,EAAAA,8BAA8BpE,0BAC9B2F,EAAAA,+BAA+B1F,WAC/B0F,EAAAA,+BAA+BC,eAC/BD,EAAAA,+BAA+BE,YAC/BF,EAAAA,+BAA+BG,aAC/B7tB,KAAKynB,UACL2D,EAAgBA,iBAChB0C,EAAqBA,sBACrBpG,GAGA4F,GACAE,EAAQrxB,QACDmxB,KACAA,EAAMn1B,KAAIlB,GAAQ+I,KAAKuqB,mBAAmBtzB,MAIjDyF,GAAqBA,EAAkB9E,OAAS,GAChD41B,EAAQrxB,QAAQO,GAIpB,MAAMqxB,EAAO,IAAIC,IACXC,EAAcT,EAAQ1zB,QAAO2qB,IAC/B,MAAMyJ,EAASzJ,EAAIptB,WACnB,OAAI02B,EAAKI,IAAID,GAAgB,GAC7BH,EAAK9xB,IAAIiyB,GACF,EAAI,KAGRE,EAAmBC,GACtBC,EAAAA,0BAA0BC,kBAAkB,CACxC7G,YACAkF,MAAOlF,EACP6F,eAGFiB,EAAe,CAACJ,GAGtB,IAAK,IAAIt2B,EAAI,EAAGA,EAAIm2B,EAAYr2B,OAAQE,GAAK,GAAI,CAC7C,MAAM22B,EAAQR,EAAY7xB,MAAMtE,EAAGA,EAAI,IACjC42B,EAAWJ,EAAyBA,0BAACK,kBAAkB,CACzD/B,QACAlF,YACAkH,YAAaP,EACbQ,UAAWJ,IAEfD,EAAaryB,KAAKuyB,EACrB,CAED,MAAO,CACHF,eACA71B,QAAS01B,EAEhB,CAgBD,qBAAa1B,EAASC,MAClBA,EAAKr0B,MACLA,EAAKs0B,OACLA,EAAM/C,UACNA,EAAS9wB,OACTA,EAAM/B,KACNA,EAAIgG,oBACJA,EAAmBjG,cACnBA,IAEA,IAAImG,EAEJ,MAAM2xB,EAAcjgB,UAAqB7V,GACnC+1B,EAAiBlgB,UAAQib,GAI/B,GAFA/yB,GAAmBC,EAAeC,GAE9B63B,EAAYl3B,SAAWm3B,EAAen3B,OACtC,MAAM,IAAIT,MACN,yDAGR,GAAIwH,EAAAA,aAAaC,OAAQ,CACrB,MAAOlB,EAAOvE,GAAQ6G,KAAK0qB,0BACvB1zB,EAAc0B,aACdzB,GAcE4tB,EAAO6B,GAZiC,CAC1CsI,QAASD,EACTzI,QACIwI,EAAYl3B,OAAS,EACfk3B,EAAY32B,KAAI82B,GAAOl2B,EAAEA,GAACk2B,KAC1B,KACV5zB,SAAU,KACVrC,OAA+B,IAAvB81B,EAAYl3B,OAAemB,EAAEA,GAAC+1B,EAAY,IAAM,KACxDpxB,QACAvE,SAIE0yB,EAAOtE,GAAoB7mB,OAAAG,OAAAH,OAAAG,OAAA,CAC7B5J,OACAiwB,SAAU0F,EACVlF,UAAWnvB,EACX6uB,gBAAiBpnB,KAAK6qB,sBACtBryB,aAAcxB,EAAcwB,aAC5BE,aAAc1B,EAAc0B,aAC5BivB,mBAAoB0E,EAAkBA,mBAAC5E,WACpC0E,EAA2BA,+BAAE,CAChCnE,WAAY/qB,EAAoBc,MAChCkqB,YAAajoB,KAAKynB,UAClBN,cAAekE,EAAAA,cAAc5D,UAC7BS,WAAY,QAQhB,OANA2D,EAAK1vB,KAAK,CACNgD,OAAQ0tB,EACRztB,WAAY,EACZC,SAAU,IAGP,IAAIysB,EAAAA,uBAAuB,CAC9BrE,UAAWznB,KAAKynB,UAChBoE,OACAhH,QAEP,CAAM,CACH1nB,EAAuB2xB,EAAY32B,KAAI,CAAC82B,EAAKvxB,KACzC,MAAMwxB,EAAWn2B,KAAGk2B,GACpB,MAAO,CACH12B,MAAOw2B,EAAerxB,GACtB1E,OAAQk2B,EACR7zB,SAAU,KACV+C,IAAK,KACR,IAGL,MAAMkB,0BACFA,EAAyBP,sBACzBA,EAAqBG,sBACrBA,GACApC,GAA4B,CAC5BE,6BAA8B,GAC9BC,sBACAC,YAAa,GACbC,yBAkBE0nB,EAAOmC,GAf2C,CACpD8B,MAAO,KACP7xB,OACA0yB,kBAAmB,KACnBrqB,4BACA2tB,yBAA0BluB,EAC1BmuB,2BAA4Bv1B,MAAM6N,QAAQxM,GACpCA,EACKb,KAAI82B,GAAOl2B,KAAGk2B,KACdlzB,QAAO,CAACgN,EAAKkmB,IAAQlmB,EAAI9M,IAAIgzB,IAAMl2B,KAAG,IAC3CA,EAAAA,GAAGC,GACTm0B,WAAY,EACZpG,WAAY,KACZqG,qCAAsC,OAGpCvB,EAAO1D,GACNznB,OAAAG,OAAAH,OAAAG,OAAA,GAAAsrB,EAAAA,+BACH,CAAAjF,SAAU0F,EACVlF,UAAWnvB,EACX6uB,gBAAiBpnB,KAAK6qB,sBACtBlD,mBAAoB0E,EAAAA,mBAAmB5E,UACvCQ,YAAajoB,KAAKynB,UAClBN,cAAekE,EAAaA,cAAC5D,UAC7B/uB,aAAc1B,EAAc0B,aAC5B0vB,iCAAkCyE,EAClCr0B,aAAcxB,EAAcwB,gBAIhC,OAFAqzB,EAAK1vB,QAAQ+C,GAEN,IAAI4sB,EAAAA,uBAAuB,CAC9BrE,UAAWznB,KAAKynB,UAChBoE,OACAhH,QAEP,CACJ,CAgBD,uBAAasK,EAAWvC,MACpBA,EAAK5vB,6BACLA,EAA4B8sB,UAC5BA,EAAS9wB,OACTA,EAAM+zB,oBACNA,EAAmBC,4BACnBA,EAA2BoC,eAC3BA,IAEA,MAAMF,EAAWn2B,KAAGC,GACdq2B,EAAsBxgB,UAAQugB,GAE9BjyB,EAAuBktB,GACzBrtB,EACAkyB,IAIE5vB,0BACFA,EAAyBP,sBACzBA,EAAqBG,sBACrBA,GACApC,GAA4B,CAC5BE,+BACAE,YAAa8vB,EACb7vB,qBAAsBA,EACtBT,kBAAmB2yB,EACdjzB,MAAM,GACNjE,KAAI4B,GAAQA,EAAKrB,kBAGpBzB,KAAEA,GAASmyB,GAAepsB,IAC1B2sB,kBAAEA,EAAiBjC,UAAEA,GAAc4B,GACrCtsB,EACAG,GAcE0nB,EAAOmC,GAX2C,CACpD8B,MAAOiE,EACP91B,OACA0yB,oBACArqB,4BACA2tB,yBAA0BluB,EAC1BmuB,2BAA4BgC,EAC5B/B,WAAY,EACZpG,WAAY,KACZqG,qCAAsC,OAGpC50B,EAAe62B,EAAoB,GAAG72B,cAEtCsvB,4BACFA,EAA2BD,YAC3BA,EAAWD,qBACXA,EAAoBG,0BACpBA,GACAoE,EAAAA,8BAEEN,EAAO1D,GAAuB,CAChCjB,SAAU0F,EACVlF,UAAWA,EACXN,gBAAiBpnB,KAAK6qB,sBACtBlD,mBAAoB0E,EAAkBA,mBAAC5E,UACvCG,qBAAsBA,EACtBC,YAAaA,EACbC,4BAA6BA,EAC7BC,0BAA2BA,EAC3BE,YAAajoB,KAAKynB,UAClB/uB,aAAc22B,EAAoB,GAAG32B,aACrC0vB,iCAAkC0B,EAClCtxB,eACA2uB,cAAekE,EAAaA,cAAC5D,YAIjC,OAFAoE,EAAK1vB,QAAQ+C,GAEN,IAAI4sB,EAAAA,uBAAuB,CAC9BrE,UAAWznB,KAAKynB,UAChBoE,OACAhH,QAEP,CAeD,+BAAayK,EAAmB1C,MAC5BA,EAAKr0B,MACLA,EAAKyE,6BACLA,EAA4B/F,KAC5BA,EAAI81B,oBACJA,EAAmBC,4BACnBA,IAEA,GAAIhwB,EAA6BpF,OAAS,EACtC,MAAM,IAAIT,MAAM,mDAiBpB,OAdAoI,GAAUvC,EAA8B/F,GAcjC,OAZU+I,KAAK8sB,SAAS,CAC3BF,QACA5vB,+BACA8sB,UAAWvxB,EACXS,OAAQgE,EAA6BjB,QACjC,CAACgN,EAAK9N,IAAY8N,EAAI9M,IAAIhB,EAAQC,OAAOlC,SACzCD,EAAEA,GAAC,IAEPi0B,8BACAD,wBAIP,CAeD,oCAAawC,EAAwBrI,SACjCA,EAAQQ,UACRA,EAAS8H,aACTA,EAAYv4B,KACZA,EAAI6vB,gBACJA,EAAe7pB,oBACfA,EAAmBjG,cACnBA,IAEAD,GAAmBC,EAAeC,GAClC,MAAMiI,EAAuC,CACzC,CACIC,OACIlC,EAAoBuB,WAAaC,EAAAA,SAASC,QACpCzB,EAAoBc,MACpBd,EAAoBY,KAC9BwB,SAAU,EACVD,WAAY,IAIdylB,EAAOgC,GAA6C,CACtDtuB,MAAOmvB,EACPZ,gBAAiBA,QAAAA,EAAmB,KACpCC,WAAY,QAEVe,4BACFA,EAA2BD,YAC3BA,EAAWD,qBACXA,EAAoBG,0BACpBA,GACAoE,EAAAA,8BAEEN,EAAO1D,GAAuB,CAChCjB,WACAQ,YACAN,gBAAiBpnB,KAAK6qB,sBACtBlD,mBAAoB0E,EAAkBA,mBAAC5E,UACvCG,qBAAsBA,EACtBC,YAAaA,EACbC,4BAA6BA,EAC7BC,0BAA2BA,EAC3BE,YAAajoB,KAAKynB,UAClB/uB,aAAc1B,EAAc0B,aAC5B0vB,iCAAkCoH,EAClCh3B,aAAcxB,EAAcwB,aAC5B2uB,cAAekE,EAAaA,cAAC5D,YAKjC,OAFAoE,EAAK1vB,QAAQ+C,GAEN,IAAI4sB,EAAAA,uBAAuB,CAC9BrE,UAAWznB,KAAKynB,UAChBoE,OACAhH,QAEP,CAUD,6BAAa4K,CACTx4B,EACAy4B,SAEA,OAAgD,QAAzCzwB,QAAOywB,EAAWC,eAAe14B,UAAQ,IAAAgI,OAAA,EAAAA,EAAA1G,KACnD,CAcD,oBAAaq3B,EAAQhD,MACjBA,EAAK5vB,6BACLA,EAA4B8sB,UAC5BA,EAAS9wB,OACTA,EAAM+zB,oBACNA,EAAmBC,4BACnBA,IAEA,MAAM1tB,0BAAEA,EAAyBJ,sBAAEA,GAC/BpC,GAA4B,CACxBE,+BACAE,YAAa8vB,EACb7vB,qBAAsB,MAGxBlG,KAAEA,EAAIoyB,aAAEA,GAAiBD,GAC3BpsB,GAGE6yB,EACF7yB,EAA6B,GAAG5B,kBAAkBwC,SAC7CY,WAAaC,EAAQA,SAACC,QACrB,EACA,EAcJmmB,EAAOkE,GAZ0C,CACnDD,MAAOiE,EACP91B,OACAqI,4BACAynB,WAAY,KACZzpB,SAAUwsB,EACVgG,gBAAiB/2B,EAAEA,GAACC,GACpB+2B,wBAAyBF,EACzBG,6BAA8BH,EAC9BI,iBAAkB,QAKhBnI,4BACFA,EAA2BD,YAC3BA,EAAWD,qBACXA,EAAoBG,0BACpBA,GACAoE,EAAAA,8BAEEN,EAAOxD,GAAsB,CAC/BnB,SAAU0F,EACVlF,UAAW2B,EACXjC,gBAAiBpnB,KAAK6qB,sBACtBlD,mBAAoB0E,EAAkBA,mBAAC5E,UACvCG,qBAAsBA,EACtBC,YAAaA,EACbC,4BAA6BA,EAC7BC,0BAA2BA,EAC3BE,YAAajoB,KAAKynB,UAClBN,cAAekE,EAAaA,cAAC5D,YAKjC,OAFAoE,EAAK1vB,QAAQ+C,GAEN,IAAI4sB,EAAAA,uBAAuB,CAC9BrE,UAAWznB,KAAKynB,UAChBoE,OACAhH,QAEP,CAYD,mBAAaqL,EAAOtD,MAChBA,EAAK5vB,6BACLA,EAA4B+vB,oBAC5BA,EAAmBC,4BACnBA,IAEA7D,GAAuBnsB,GAEvB,MAAMsC,0BAAEA,EAAyBJ,sBAAEA,GAC/BpC,GAA4B,CACxBE,+BACAE,YAAa8vB,EACb7vB,qBAAsB,MAGxBlG,KAAEA,EAAIoyB,aAAEA,GAAiBD,GAC3BpsB,GAcE6nB,EAAOoE,GAXyC,CAClDH,MAAOiE,EACP91B,OACAqI,4BACAynB,WAAY,KACZoJ,6BACInzB,EAA6B,GAAG5B,kBAAkBwC,SAC7CY,WAAaC,EAAQA,SAACC,QACrB,EACA,KAIRopB,4BACFA,EAA2BD,YAC3BA,EAAWD,qBACXA,EAAoBG,0BACpBA,GACAoE,EAAAA,8BACEN,EAAOvD,GAAqB,CAC9BpB,SAAU0F,EACVlF,UAAW2B,EACXjC,gBAAiBpnB,KAAK6qB,sBACtBlD,mBAAoB0E,EAAkBA,mBAAC5E,UACvCG,qBAAsBA,EACtBC,YAAaA,EACbC,4BAA6BA,EAC7BC,0BAA2BA,EAC3BE,YAAajoB,KAAKynB,UAClBN,cAAekE,EAAaA,cAAC5D,YAKjC,OAFAoE,EAAK1vB,QAAQ+C,GAEN,IAAI4sB,EAAAA,uBAAuB,CAC9BrE,UAAWznB,KAAKynB,UAChBoE,OACAhH,QAEP,EA/hCM9sB,GAAA0vB,UAAuB,IAAIjD,EAASA,UACvC,+CCxkBK,MAAA4L,GAAuBh6B,OAAOC,KAAK,CAC5C,GAAI,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,IAAK,GAAI,IAAK,IAAK,IAAK,MAQlE,SAAUg6B,GAAgBC,GAC5B,MAAO33B,EAASQ,GAAQqrB,EAASA,UAACiG,uBAC9B,CAAC2F,GAAsBE,EAAWpf,YAClCqf,EAA2BA,6BAE/B,MAAO,CAAC53B,EAASQ,EACrB,okBCgwDyC,CACrCq3B,QAAS,QACTvvB,KAAM,yBACNutB,aAAc,CACV,CACIvtB,KAAM,kBACNwvB,KAAM,CACF,yEACA,qEACA,qEACA,8BAEJ51B,SAAU,CACN,CACIoG,KAAM,WACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CAAC,+BAEX,CACIxvB,KAAM,eACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,gBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,OACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,eACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,kBACNyvB,MAAO,EACPrxB,SAAU,IAGlBsxB,KAAM,IAEV,CACI1vB,KAAM,eACNwvB,KAAM,CACF,sEACA,oDAEJ51B,SAAU,CACN,CACIoG,KAAM,WACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CAAC,+BAEX,CACIxvB,KAAM,eACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,uBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,gBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,OACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,eACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,kBACNyvB,MAAO,EACPrxB,SAAU,IAGlBsxB,KAAM,CACF,CACI1vB,KAAM,iBACN2vB,KAAM,QAIlB,CACI3vB,KAAM,SACNwvB,KAAM,CACF,wEACA,0EACA,2EACA,2EACA,2EACA,yEACA,kDAEJ51B,SAAU,CACN,CACIoG,KAAM,WACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CAAC,+BAEX,CACIxvB,KAAM,YACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,kBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,OACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,eACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,eACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,qBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,uBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,cACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CAAC,aAEX,CACIxvB,KAAM,8BACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,4BACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,aACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,cACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,gBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,aACNyvB,MAAO,EACPrxB,SAAU,EACVwxB,WAAY,IAGpBF,KAAM,CACF,CACI1vB,KAAM,aACN2vB,KAAM,CACF9N,IAAK,cAGb,CACI7hB,KAAM,UACN2vB,KAAM,CACF9N,IAAK,QAGb,CACI7hB,KAAM,WACN2vB,KAAM,CACF5N,OAAQ,UAKxB,CACI/hB,KAAM,0BACNwvB,KAAM,CACF,2EACA,0EACA,2EAEJ51B,SAAU,CACN,CACIoG,KAAM,WACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CAAC,+BAEX,CACIxvB,KAAM,YACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CACF,oEACA,sEACA,oBAGR,CACIxvB,KAAM,kBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,qBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,uBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,cACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,8BACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,4BACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,cACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CAAC,2CAEX,CACIxvB,KAAM,eACNyvB,MAAO,EACPrxB,SAAU,EACVwxB,WAAY,GAEhB,CACI5vB,KAAM,mCACNyvB,MAAO,EACPrxB,SAAU,EACVwxB,WAAY,GAEhB,CACI5vB,KAAM,eACNyvB,MAAO,EACPrxB,SAAU,EACVwxB,WAAY,GAEhB,CACI5vB,KAAM,gBACNyvB,MAAO,EACPrxB,SAAU,IAGlBsxB,KAAM,CACF,CACI1vB,KAAM,QACN2vB,KAAM,aAEV,CACI3vB,KAAM,kBACN2vB,KAAM,CACF5N,OAAQ,QAGhB,CACI/hB,KAAM,aACN2vB,KAAM,CACF5N,OAAQ,CACJ8N,QAAS,4BAM7B,CACI7vB,KAAM,WACNwvB,KAAM,CACF,wEACA,uEACA,wEACA,0EACA,wEACA,uEACA,wEACA,kBAEJ51B,SAAU,CACN,CACIoG,KAAM,WACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CAAC,+BAEX,CACIxvB,KAAM,YACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CACF,oEACA,sEACA,oBAGR,CACIxvB,KAAM,kBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,qBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,uBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,cACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,8BACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,4BACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,cACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CAAC,2CAEX,CACIxvB,KAAM,eACNyvB,MAAO,EACPrxB,SAAU,EACVwxB,WAAY,GAEhB,CACI5vB,KAAM,mCACNyvB,MAAO,EACPrxB,SAAU,EACVwxB,WAAY,GAEhB,CACI5vB,KAAM,eACNyvB,MAAO,EACPrxB,SAAU,EACVwxB,WAAY,GAEhB,CACI5vB,KAAM,gBACNyvB,MAAO,EACPrxB,SAAU,IAGlBsxB,KAAM,CACF,CACI1vB,KAAM,SACN2vB,KAAM,WAIlB,CACI3vB,KAAM,UACNwvB,KAAM,CACF,0EACA,yEACA,2BACA,+CACA,uCACA,gDAEJ51B,SAAU,CACN,CACIoG,KAAM,WACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CAAC,+BAEX,CACIxvB,KAAM,YACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CACF,oEACA,sEACA,oBAGR,CACIxvB,KAAM,kBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,qBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,uBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,cACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,8BACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,4BACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,cACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CAAC,2CAEX,CACIxvB,KAAM,gBACNyvB,MAAO,EACPrxB,SAAU,IAGlBsxB,KAAM,CACF,CACI1vB,KAAM,SACN2vB,KAAM,WAIlB,CACI3vB,KAAM,SACNwvB,KAAM,CACF,0EACA,yEAEJ51B,SAAU,CACN,CACIoG,KAAM,WACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CAAC,+BAEX,CACIxvB,KAAM,YACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CACF,oEACA,sEACA,oBAGR,CACIxvB,KAAM,kBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,qBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,uBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,cACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,8BACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,4BACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,cACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CAAC,2CAEX,CACIxvB,KAAM,gBACNyvB,MAAO,EACPrxB,SAAU,IAGlBsxB,KAAM,CACF,CACI1vB,KAAM,SACN2vB,KAAM,WAIlB,CACI3vB,KAAM,SACNwvB,KAAM,CACF,2EACA,iEAEJ51B,SAAU,CACN,CACIoG,KAAM,WACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CAAC,+BAEX,CACIxvB,KAAM,YACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,kBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,qBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,uBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,cACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,8BACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,4BACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,cACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CAAC,gDAEX,CACIxvB,KAAM,gBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,OACNyvB,MAAO,EACPrxB,SAAU,IAGlBsxB,KAAM,CACF,CACI1vB,KAAM,SACN2vB,KAAM,WAIlB,CACI3vB,KAAM,OACNwvB,KAAM,CACF,yEACA,oEAEJ51B,SAAU,CACN,CACIoG,KAAM,WACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CAAC,+BAEX,CACIxvB,KAAM,YACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,kBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,qBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,uBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,cACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,8BACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,4BACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,cACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CAAC,gDAEX,CACIxvB,KAAM,gBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,OACNyvB,MAAO,EACPrxB,SAAU,IAGlBsxB,KAAM,CACF,CACI1vB,KAAM,SACN2vB,KAAM,WAIlB,CACI3vB,KAAM,OACNwvB,KAAM,CACF,0EACA,0EACA,gDAEJ51B,SAAU,CACN,CACIoG,KAAM,WACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CAAC,+BAEX,CACIxvB,KAAM,YACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CACF,oEACA,sEACA,oBAGR,CACIxvB,KAAM,kBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,OACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,eACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,eACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,qBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,uBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,cACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,8BACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,4BACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,cACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,gBACNyvB,MAAO,EACPrxB,SAAU,IAGlBsxB,KAAM,CACF,CACI1vB,KAAM,SACN2vB,KAAM,WAIlB,CACI3vB,KAAM,eACNwvB,KAAM,CACF,wEACA,2EACA,aAEJ51B,SAAU,CACN,CACIoG,KAAM,WACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CAAC,+BAEX,CACIxvB,KAAM,YACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CACF,oEACA,sEACA,oBAGR,CACIxvB,KAAM,kBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,qBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,uBACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,cACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,8BACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,4BACNyvB,MAAO,EACPrxB,SAAU,GAEd,CACI4B,KAAM,cACNyvB,MAAO,EACPrxB,SAAU,EACVoxB,KAAM,CAAC,2CAEX,CACIxvB,KAAM,eACNyvB,MAAO,EACPrxB,SAAU,EACVwxB,WAAY,GAEhB,CACI5vB,KAAM,mCACNyvB,MAAO,EACPrxB,SAAU,EACVwxB,WAAY,GAEhB,CACI5vB,KAAM,eACNyvB,MAAO,EACPrxB,SAAU,EACVwxB,WAAY,GAEhB,CACI5vB,KAAM,gBACNyvB,MAAO,EACPrxB,SAAU,IAGlBsxB,KAAM,CACF,CACI1vB,KAAM,UACN2vB,KAAM,CACFE,QAAS,2CAGjB,CACI7vB,KAAM,UACN2vB,KAAM,CACFE,QAAS,iBAM7BC,MAAO,CACH,CACI9vB,KAAM,eACN2vB,KAAM,CACFI,KAAM,OACNhM,SAAU,CACN,CACI/jB,KAAM,eAEV,CACIA,KAAM,aAKtB,CACIA,KAAM,oBACN2vB,KAAM,CACFI,KAAM,SACN1rB,OAAQ,CACJ,CACIrE,KAAM,QACN2vB,KAAM,aAEV,CACI3vB,KAAM,WACN2vB,KAAM,OAEV,CACI3vB,KAAM,UACN2vB,KAAM,CACF5N,OAAQ,CACJ1pB,MAAO,CAAC,KAAM,OAI1B,CACI2H,KAAM,OACN2vB,KAAM,CACF5N,OAAQ,CACJ8N,QAAS,8BAOjC,CACI7vB,KAAM,wBACN2vB,KAAM,CACFI,KAAM,SACN1rB,OAAQ,CACJ,CACIrE,KAAM,gBACN2vB,KAAM,CACFt3B,MAAO,CAAC,KAAM,KAGtB,CACI2H,KAAM,OACN2vB,KAAM,SAEV,CACI3vB,KAAM,WACN2vB,KAAM,CACFt3B,MAAO,CAAC,KAAM,SAMlC,CACI2H,KAAM,uBACN2vB,KAAM,CACFI,KAAM,SACN1rB,OAAQ,CACJ,CACIrE,KAAM,aACNwvB,KAAM,CACF,0EACA,wBAEJG,KAAM,QAEV,CACI3vB,KAAM,kBACNwvB,KAAM,CACF,wEACA,wBAEJG,KAAM,QAEV,CACI3vB,KAAM,yBACNwvB,KAAM,CACF,uDAEJG,KAAM,SAKtB,CACI3vB,KAAM,kBACN2vB,KAAM,CACFI,KAAM,SACN1rB,OAAQ,CACJ,CACIrE,KAAM,IACN2vB,KAAM,CACFt3B,MAAO,CAAC,KAAM,MAGtB,CACI2H,KAAM,IACN2vB,KAAM,CACFt3B,MAAO,CAAC,KAAM,MAGtB,CACI2H,KAAM,IACN2vB,KAAM,CACFt3B,MAAO,CAAC,KAAM,SAMlC,CACI2H,KAAM,yCACN2vB,KAAM,CACFI,KAAM,SACN1rB,OAAQ,CACJ,CACIrE,KAAM,QACN2vB,KAAM,CACF5N,OAAQ,CACJ8N,QAAS,qBAIrB,CACI7vB,KAAM,OACN2vB,KAAM,aAEV,CACI3vB,KAAM,oBACNwvB,KAAM,CACF,yCACA,oCACA,0DAEJG,KAAM,CACF5N,OAAQ,CACJ8N,QAAS,uBAIrB,CACI7vB,KAAM,4BACN2vB,KAAM,CACF9N,IAAK,CACDgO,QAAS,+BAIrB,CACI7vB,KAAM,2BACN2vB,KAAM,CACF9N,IAAK,CACDgO,QAAS,mCAIrB,CACI7vB,KAAM,aACN2vB,KAAM,QAEV,CACI3vB,KAAM,6BACN2vB,KAAM,CACF5N,OAAQ,QAGhB,CACI/hB,KAAM,aACN2vB,KAAM,CACF5N,OAAQ,CACJ8N,QAAS,0BAIrB,CACI7vB,KAAM,uCACN2vB,KAAM,CACF5N,OAAQ,UAM5B,CACI/hB,KAAM,uCACN2vB,KAAM,CACFI,KAAM,SACN1rB,OAAQ,CACJ,CACIrE,KAAM,QACN2vB,KAAM,CACF5N,OAAQ,CACJ8N,QAAS,qBAIrB,CACI7vB,KAAM,OACN2vB,KAAM,aAEV,CACI3vB,KAAM,4BACN2vB,KAAM,CACF9N,IAAK,CACDgO,QAAS,+BAIrB,CACI7vB,KAAM,aACN2vB,KAAM,CACF5N,OAAQ,CACJ8N,QAAS,0BAIrB,CACI7vB,KAAM,+BACN2vB,KAAM,SAKtB,CACI3vB,KAAM,wCACN2vB,KAAM,CACFI,KAAM,SACN1rB,OAAQ,CACJ,CACIrE,KAAM,QACN2vB,KAAM,CACF5N,OAAQ,CACJ8N,QAAS,qBAIrB,CACI7vB,KAAM,OACN2vB,KAAM,aAEV,CACI3vB,KAAM,4BACN2vB,KAAM,CACF9N,IAAK,CACDgO,QAAS,+BAIrB,CACI7vB,KAAM,aACN2vB,KAAM,CACF5N,OAAQ,CACJ8N,QAAS,0BAIrB,CACI7vB,KAAM,WACN2vB,KAAM,aAEV,CACI3vB,KAAM,kBACN2vB,KAAM,OAEV,CACI3vB,KAAM,0BACN2vB,KAAM,MAEV,CACI3vB,KAAM,+BACN2vB,KAAM,MAEV,CACI3vB,KAAM,mBACN2vB,KAAM,CACF5N,OAAQ,WAM5B,CACI/hB,KAAM,oBACNwvB,KAAM,CACF,+EAEJG,KAAM,CACFI,KAAM,SACN1rB,OAAQ,CACJ,CACIrE,KAAM,QACN2vB,KAAM,aAEV,CACI3vB,KAAM,6BACNwvB,KAAM,CACF,uEACA,wEACA,yEACA,YAEJG,KAAM,CACF5N,OAAQ,UAM5B,CACI/hB,KAAM,4BACN2vB,KAAM,CACFI,KAAM,SACN1rB,OAAQ,CACJ,CACIrE,KAAM,SACN2vB,KAAM,OAEV,CACI3vB,KAAM,gBACN2vB,KAAM,CACF5N,OAAQ,OAGhB,CACI/hB,KAAM,gBACN2vB,KAAM,CACFE,QAAS,wBAGjB,CACI7vB,KAAM,YACN2vB,KAAM,OAEV,CACI3vB,KAAM,WACN2vB,KAAM,CACF5N,OAAQ,QAGhB,CACI/hB,KAAM,MACNwvB,KAAM,CACF,2DAEJG,KAAM,CACF5N,OAAQ,aAM5B,CACI/hB,KAAM,wBACN2vB,KAAM,CACFI,KAAM,SACN1rB,OAAQ,CACJ,CACIrE,KAAM,QACN2vB,KAAM,CACF5N,OAAQ,CACJ8N,QAAS,qBAIrB,CACI7vB,KAAM,2CACN2vB,KAAM,CACF9N,IAAK,CACDgO,QACI,8CAIhB,CACI7vB,KAAM,2BACN2vB,KAAM,CACF9N,IAAK,CACDgO,QACI,8CAIhB,CACI7vB,KAAM,WACN2vB,KAAM,CACF5N,OAAQ,QAGhB,CACI/hB,KAAM,mBACN2vB,KAAM,CACF9N,IAAK,CACDgO,QAAS,4BAIrB,CACI7vB,KAAM,+BACN2vB,KAAM,CACF5N,OAAQ,QAGhB,CACI/hB,KAAM,aACN2vB,KAAM,WAKtB,CACI3vB,KAAM,2BACN2vB,KAAM,CACFI,KAAM,SACN1rB,OAAQ,CACJ,CACIrE,KAAM,QACN2vB,KAAM,CACF5N,OAAQ,CACJ8N,QAAS,qBAIrB,CACI7vB,KAAM,mBACN2vB,KAAM,CACF9N,IAAK,CACDgO,QAAS,4BAIrB,CACI7vB,KAAM,2CACN2vB,KAAM,CACF9N,IAAK,CACDgO,QACI,8CAIhB,CACI7vB,KAAM,2BACN2vB,KAAM,CACF9N,IAAK,CACDgO,QACI,8CAIhB,CACI7vB,KAAM,WACN2vB,KAAM,CACF5N,OAAQ,QAGhB,CACI/hB,KAAM,+BACN2vB,KAAM,CACF5N,OAAQ,QAGhB,CACI/hB,KAAM,aACN2vB,KAAM,QAEV,CACI3vB,KAAM,aACN2vB,KAAM,CACF5N,OAAQ,CACJ8N,QAAS,6BAOjC,CACI7vB,KAAM,2BACN2vB,KAAM,CACFI,KAAM,SACN1rB,OAAQ,CACJ,CACIrE,KAAM,SACN2vB,KAAM,aAEV,CACI3vB,KAAM,MACN2vB,KAAM,UAKtB,CACI3vB,KAAM,yBACN2vB,KAAM,CACFI,KAAM,SACN1rB,OAAQ,CACJ,CACIrE,KAAM,OACN2vB,KAAM,CACFt3B,MAAO,CAAC,KAAM,MAGtB,CACI2H,KAAM,2BACN2vB,KAAM,MAEV,CACI3vB,KAAM,gCACN2vB,KAAM,MAEV,CACI3vB,KAAM,6BACN2vB,KAAM,UAKtB,CACI3vB,KAAM,2CACN2vB,KAAM,CACFI,KAAM,SACN1rB,OAAQ,CACJ,CACIrE,KAAM,oBACN2vB,KAAM,CACFE,QAAS,sBAGjB,CACI7vB,KAAM,kBACN2vB,KAAM,SAKtB,CACI3vB,KAAM,2CACN2vB,KAAM,CACFI,KAAM,SACN1rB,OAAQ,CACJ,CACIrE,KAAM,oBACN2vB,KAAM,CACFE,QAAS,sBAGjB,CACI7vB,KAAM,gBACN2vB,KAAM,CACFE,QAAS,wBAGjB,CACI7vB,KAAM,YACNwvB,KAAM,CACF,mDAEJG,KAAM,OAEV,CACI3vB,KAAM,WACNwvB,KAAM,CACF,sEAEJG,KAAM,WAKtB,CACI3vB,KAAM,sBACN2vB,KAAM,CACFI,KAAM,SACN1rB,OAAQ,CACJ,CACIrE,KAAM,wBACN2vB,KAAM,MAEV,CACI3vB,KAAM,mBACN2vB,KAAM,MAEV,CACI3vB,KAAM,YACN2vB,KAAM,OAEV,CACI3vB,KAAM,eACN2vB,KAAM,WAKtB,CACI3vB,KAAM,gCACN2vB,KAAM,CACFI,KAAM,SACN1rB,OAAQ,CACJ,CACIrE,KAAM,QACN2vB,KAAM,aAEV,CACI3vB,KAAM,SACN2vB,KAAM,OAEV,CACI3vB,KAAM,WACN2vB,KAAM,CACF5N,OAAQ,QAGhB,CACI/hB,KAAM,kBACN2vB,KAAM,MAEV,CACI3vB,KAAM,MACNwvB,KAAM,CACF,2DAEJG,KAAM,CACF5N,OAAQ,aAM5B,CACI/hB,KAAM,yBACN2vB,KAAM,CACFI,KAAM,SACN1rB,OAAQ,CACJ,CACIrE,KAAM,+BACN2vB,KAAM,CACF9N,IAAK,CACDxpB,MAAO,CAAC,KAAM,OAI1B,CACI2H,KAAM,gCACN2vB,KAAM,CACF9N,IAAK,CACDxpB,MAAO,CAAC,KAAM,OAI1B,CACI2H,KAAM,2BACN2vB,KAAM,CACF9N,IAAK,CACDgO,QACI,8CAIhB,CACI7vB,KAAM,oBACN2vB,KAAM,CACF9N,IAAK,QAGb,CACI7hB,KAAM,kBACN2vB,KAAM,CACF9N,IAAK,CACDgO,QAAS,8BAIrB,CACI7vB,KAAM,WACN2vB,KAAM,CACF5N,OAAQ,QAGhB,CACI/hB,KAAM,aACN2vB,KAAM,QAEV,CACI3vB,KAAM,+BACN2vB,KAAM,CACF5N,OAAQ,QAGhB,CACI/hB,KAAM,cACN2vB,KAAM,CACF9N,IAAK,cAGb,CACI7hB,KAAM,UACN2vB,KAAM,CACF5N,OAAQ,aAM5B,CACI/hB,KAAM,aACN2vB,KAAM,CACFI,KAAM,SACN1rB,OAAQ,CACJ,CACIrE,KAAM,UACNwvB,KAAM,CAAC,iCACPG,KAAM,MAEV,CACI3vB,KAAM,QACNwvB,KAAM,CAAC,8CACPG,KAAM,UAKtB,CACI3vB,KAAM,YACN2vB,KAAM,CACFI,KAAM,SACN1rB,OAAQ,CACJ,CACIrE,KAAM,OACNwvB,KAAM,CAAC,yCACPG,KAAM,aAEV,CACI3vB,KAAM,QACNwvB,KAAM,CAAC,8BACPG,KAAM,aAEV,CACI3vB,KAAM,SACNwvB,KAAM,CAAC,4CACPG,KAAM,OAEV,CACI3vB,KAAM,WACNwvB,KAAM,CACF,6DACA,yCAEJG,KAAM,CACF5N,OAAQ,cAGhB,CACI/hB,KAAM,QACNwvB,KAAM,CAAC,uBACPG,KAAM,CACFE,QAAS,iBAGjB,CACI7vB,KAAM,MACNwvB,KAAM,CACF,2DAEJG,KAAM,CACF5N,OAAQ,cAOhCiO,OAAQ,CACJ,CACIC,KAAM,IACNjwB,KAAM,2BACNsL,IAAK,kDAET,CACI2kB,KAAM,KACNjwB,KAAM,wBACNsL,IAAK,yBAET,CACI2kB,KAAM,KACNjwB,KAAM,yBACNsL,IAAK,0BAET,CACI2kB,KAAM,KACNjwB,KAAM,2BACNsL,IAAK,4BAET,CACI2kB,KAAM,KACNjwB,KAAM,6BACNsL,IAAK,8BAET,CACI2kB,KAAM,KACNjwB,KAAM,iBACNsL,IAAK,kBAET,CACI2kB,KAAM,KACNjwB,KAAM,4CACNsL,IAAK,6CAET,CACI2kB,KAAM,KACNjwB,KAAM,sCACNsL,IAAK,uCAET,CACI2kB,KAAM,KACNjwB,KAAM,yCACNsL,IAAK,0CAET,CACI2kB,KAAM,KACNjwB,KAAM,oCACNsL,IAAK,qCAET,CACI2kB,KAAM,KACNjwB,KAAM,uCACNsL,IAAK,wCAET,CACI2kB,KAAM,KACNjwB,KAAM,4BACNsL,IAAK,6BAET,CACI2kB,KAAM,KACNjwB,KAAM,eACNsL,IAAK,uCAET,CACI2kB,KAAM,KACNjwB,KAAM,yBACNsL,IAAK,0BAET,CACI2kB,KAAM,KACNjwB,KAAM,wBACNsL,IAAK,yBAET,CACI2kB,KAAM,KACNjwB,KAAM,yBACNsL,IAAK,mCAET,CACI2kB,KAAM,KACNjwB,KAAM,sBACNsL,IAAK,uBAET,CACI2kB,KAAM,KACNjwB,KAAM,mBACNsL,IAAK,oBAET,CACI2kB,KAAM,KACNjwB,KAAM,uBACNsL,IAAK,sDAET,CACI2kB,KAAM,KACNjwB,KAAM,yBACNsL,IAAK,kDAET,CACI2kB,KAAM,KACNjwB,KAAM,wBAEV,CACIiwB,KAAM,KACNjwB,KAAM,yBAEV,CACIiwB,KAAM,KACNjwB,KAAM,iBACNsL,IAAK,+EAET,CACI2kB,KAAM,KACNjwB,KAAM,uBAEV,CACIiwB,KAAM,KACNjwB,KAAM,gCAEV,CACIiwB,KAAM,KACNjwB,KAAM,oBAEV,CACIiwB,KAAM,KACNjwB,KAAM,4BAEV,CACIiwB,KAAM,KACNjwB,KAAM,4BAEV,CACIiwB,KAAM,KACNjwB,KAAM,kCACNsL,IAAK,gEAET,CACI2kB,KAAM,KACNjwB,KAAM,uBACNsL,IAAK,sCAET,CACI2kB,KAAM,KACNjwB,KAAM,sBAEV,CACIiwB,KAAM,KACNjwB,KAAM,sCAEV,CACIiwB,KAAM,KACNjwB,KAAM,0JX5kHgC,sGY8D3C3J,eACHE,EACAo1B,EACA31B,EACAk6B,EACAC,EACAlG,GAEAA,EAAiBA,SAELnzB,GAAuB03B,iBAAiBx4B,EAAMO,GAC1D,MAAMg3B,EAAyC,GAEzC50B,SAAerC,GAAkBC,EAAKP,IAAOmF,MAAM,EAAG,GAGtDi1B,EAAuB,GAC7B,IAAK,IAAIv5B,EAAI,EAAGA,EAAI8B,EAAMhC,OAAQE,IACzB8B,EAAM9B,GAAGV,eACVi6B,EAAqBl1B,KAAKrE,GAKlC,IAAK,IAAIA,EAAI,EAAGA,EAAIq5B,KACZr5B,GAAKu5B,EAAqBz5B,QADSE,IAKvC02B,EAAaryB,WACHpE,GAAuBg0B,aAAa,CACtC90B,OACAiwB,SAAU0F,EAAM3J,UAChBiI,iBACAhyB,UAAWm4B,EAAqBv5B,MAI5C,MAAMw5B,UAAEA,SAAoB95B,EAAI+5B,qBAE1BC,EAAKC,EAAcA,eAACjD,EAAc5B,EAAO0E,GAI/C,aAFmBI,EAAgBA,iBAACl6B,EAAKg6B,EAAIJ,EAGjD,kBC9EO95B,eACHE,EACAo1B,EACA31B,EACA+B,EACAT,EACA+E,EACA8zB,GAEAp4B,EAASD,EAAAA,GAAGC,GACZ,MAAMwG,QAAgChI,EAAIm6B,kCACtCp5B,EAAM0qB,UACN,CACIhsB,UAID26B,GAAiBh3B,GACpB4E,EAAwBqyB,MACxB74B,GAGE8vB,QAActxB,EAAIs6B,mBACpBF,EAAcz5B,KAAI8C,IAAY,CAC1B82B,KAAM92B,EAAQG,kBAAkB22B,KAChCl0B,KAAM5C,EAAQG,kBAAkBwC,SAASC,KACzCE,MAAO9C,EAAQG,kBAAkBwC,SAASG,WAI5Ci0B,QAAWj6B,GAAuB63B,QAAQ,CAC5ChD,MAAOA,EAAM3J,UACbjmB,6BAA8B40B,EAC9B9H,UAAWxsB,EACXtE,SACAg0B,4BAA6BlE,EAAM5rB,YACnC6vB,oBAAqBjE,EAAMmJ,mBAGzBX,UAAEA,SAAoB95B,EAAI+5B,qBAC1BW,EAAoBC,EAAYA,aAACvF,EAAO,CAACr0B,IACzC65B,EAAWX,EAAcA,eAC3B,CAAChE,EAAAA,qBAAqB4E,oBAAoB,CAAEC,MAAO,OAAYN,GAC/DpF,EACA0E,EACAY,GAGJ,OAAOR,mBAAiBl6B,EAAK46B,EAAUhB,EAC3C,4DCxCO95B,eACHE,EACAo1B,EACA31B,EACAg1B,EACAvE,EACA1uB,EACAiE,EACAjG,EACAo6B,GAEAn0B,EACIA,QAAAA,EACAs1B,EAAAA,0BAA0B/6B,EAAIg7B,qBAClCx7B,EACIA,QAAAA,EACA2C,SAA0BpC,GAAkBC,EAAKP,IAErD,MAAMs1B,QAA8BkG,EAAAA,kCAChCj7B,EACAo1B,EACA31B,EACAywB,EAAUzE,eACVpqB,OACAA,EACAu4B,EACAp6B,EAAcwB,cAGZk6B,QAAY36B,GAAuBu0B,iBAAiB,CACtDpF,SAAU0F,EAAM3J,UAChBhsB,OACAywB,UAAWA,EAAUzE,UACrBsJ,sBAAuBA,EAAsB5zB,QAC7CK,SACAizB,WACAhvB,sBACAjG,mBAGEs6B,UAAEA,SAAoB95B,EAAI+5B,qBAC1BW,EAAoBC,EAAYA,aAACvF,EAAO,CAAClF,IAEzC8J,EAAKC,EAAAA,eACP,CACIhE,EAAAA,qBAAqB4E,oBAAoB,CACrCC,MAAO,KAAmC,IAAzBzjB,EAAAA,QAAQ7V,GAAQpB,YAElC86B,GAEP9F,EACA0E,EACAY,GAGJ,aAAaR,EAAAA,iBAAiBl6B,EAAKg6B,EAAIJ,EAC3C,qGCzDO95B,eACHE,EACAo1B,EACA31B,EACA+B,EACAT,EACAo6B,EACA7I,EACA7sB,EACAjG,EACAo6B,GAEAn0B,EACIA,QAAAA,EACAs1B,EAAAA,0BAA0B/6B,EAAIg7B,qBAClCx7B,EACIA,QAAAA,EACA2C,SAA0BpC,GAAkBC,EAAKP,IAErD,MAAM27B,QAAmB76B,GAAuB40B,SAAS,CACrDC,MAAOA,EAAM3J,UACb1qB,MAAOA,EAAM0qB,UACb4J,OAAQ8F,EACR7I,YACA9wB,SACA/B,OACAgG,sBACAjG,kBAGE67B,QAAqBr7B,EAAI+5B,qBACzBW,EAAoBC,EAAYA,aAACvF,EAAO,CAACr0B,IACzC65B,EAAWX,EAAAA,eACb,CACIhE,EAAAA,qBAAqB4E,oBAAoB,CACrCC,MAAO,KAAmC,IAAzBzjB,EAAAA,QAAQ7V,GAAQpB,SAErCg7B,GAEJhG,EACAiG,EAAavB,UACbY,GAGJ,aAAaR,EAAgBA,iBAACl6B,EAAK46B,EAAUhB,EAAgByB,EACjE,kCC9COv7B,eACHE,EACAo1B,EACA31B,EACAsB,EACAi3B,EACA1I,EACA7pB,EACAjG,EACAo6B,GAEAn0B,EACIA,QAAAA,EACAs1B,EAAAA,0BAA0B/6B,EAAIg7B,qBAClCx7B,EACIA,QAAAA,EACA2C,SAA0BpC,GAAkBC,EAAKP,IAErD,MAAM27B,QAAmB76B,GAAuBw3B,wBAAwB,CACpErI,SAAU0F,EAAM3J,UAChByE,UAAWnvB,EAAM0qB,UACjBuM,eACAv4B,OACA6vB,kBACA7pB,sBACAjG,kBAGE67B,QAAqBr7B,EAAI+5B,qBACzBW,EAAoBC,EAAYA,aAACvF,EAAO,CAACr0B,IAEzC65B,EAAWX,EAAAA,eACb,CACIhE,EAAAA,qBAAqB4E,oBAAoB,CACrCC,MAAO,OAEXM,GAEJhG,EACAiG,EAAavB,UACbY,GAGJ,aAAaR,EAAgBA,iBAACl6B,EAAK46B,EAAUhB,EAAgByB,EACjE,oHChDOv7B,eACHE,EACAo1B,EACAkG,EACA9H,EACA+H,EAAUC,EAAOA,QAACC,WAClB7B,EACAlG,EACAH,GAEA,MAAME,QACIzzB,EAAI07B,kCAAkCxH,EAASA,WAKnDyH,EACiB,GAAnBjI,EACM4C,EAAqBA,sBACrB5C,GAAkBE,EAAAA,iBAEtBsH,QAAY36B,GAAuB+yB,WAAW,CAChD5D,SAAU0F,EAAM3J,UAChBhsB,KAAM87B,EAAQ9P,UACd+H,WACAtD,UACI,cAAeoL,EACTA,EAAc7P,UACd6P,EACV/H,gBACIA,GAAmB,cAAeA,EAC5BA,EAAgB9H,UACf8H,QAAAA,EAAmB,KAC9BE,oBACAC,eAAgBiI,KAGd7B,UAAEA,SAAoB95B,EAAI+5B,qBAE1BW,EAAoBC,EAAYA,aAClCvF,EACA,CAACkG,EAAe/H,GAAiBjxB,QAC5Bs5B,GACav6B,MAAVu6B,GAAuB,cAAeA,KAI5C5B,EAAKC,EAAcA,eAACiB,EAAK9F,EAAO0E,EAAW,IAC1CY,EACHa,IAEEM,QAAa3B,EAAgBA,iBAACl6B,EAAKg6B,EAAIJ,GAE7C,MAAO,CAAEn6B,KAAM87B,EAAQ9P,UAAWqQ,qBAAsBD,EAC5D,0BLhEO/7B,eACHE,EACAo1B,EACA31B,EACAm6B,EACAlG,GAEAA,EAAiBA,SAELnzB,GAAuB03B,iBAAiBx4B,EAAMO,GAE1D,MAAMw6B,QAAWj6B,GAAuB6zB,gBAAgB,CACpD1E,SAAU0F,EAAM3J,UAChBhsB,OACAi0B,oBAGEoG,UAAEA,SAAoB95B,EAAI+5B,qBAE1BC,EAAKC,EAAAA,eAAe,CAACO,GAAKpF,EAAO0E,GAIvC,aAFmBI,EAAgBA,iBAACl6B,EAAKg6B,EAAIJ,EAGjD,iFM3BO95B,eACHE,EACAo1B,EACAlF,EACA4F,EACAiG,GAEA,MAAMhG,QAAmB/1B,EAAIg8B,QAAQ,cAC/BhF,aAAEA,EAAY71B,QAAEA,SACZZ,GAAuBs1B,8BAA8B,CACvDT,MAAOA,EAAM3J,UACbyE,UAAWA,EAAUzE,UACrBqK,QACA5wB,kBAAmB62B,EACnBhG,eAGF2E,EAAoBC,EAAYA,aAACvF,EAAO,CAAClF,IACzC+L,EAAQ,GAEd,IAAK,MAAMC,KAAelF,EAAc,CACpC,MAAMqE,QAAqBr7B,EAAI+5B,qBACzBa,EAAWX,EAAcA,eAC3B,CAACiC,GACD9G,EACAiG,EAAavB,UACbY,GAEEmB,QAAa3B,EAAgBA,iBAC/Bl6B,EACA46B,EACA,CAAE36B,WAAY,aACdo7B,GAEJY,EAAMt3B,KAAKk3B,EACd,CAED,MAAO,CAAEI,QAAO96B,UACpB,4EVigBM,SACFwtB,GAEA,MAAMtB,EAAO4D,GAA4CvoB,OACrDimB,EAAOM,SAAS7vB,GAAsBgB,SAE1C,OACO8I,OAAAG,OAAAH,OAAAG,OAAA,CAAA,EAAAgkB,IACHiE,MAAOD,GAAahE,EAAKiE,OAAU,KAAOjE,EAAKiE,OAEvD,6CAhbM,SACF3C,GAEA,OAAOH,GAAoB9lB,OACvBimB,EAAOM,SAAShwB,GAA6BmB,OAAS,GAE9D,uDAqBM,SACFuuB,GAEA,MAAMtB,EAAOoB,GAA6C/lB,OACtDimB,EAAOM,SAAS9vB,GAAyCiB,SAE7D,MAAO,CACHW,MAAOssB,EAAKtsB,MACZuuB,gBAAiBjC,EAAKiC,gBACtBC,WAAYlC,EAAKkC,WAEzB,sCA/DM,SACFZ,GAEA,OAAOJ,GAAa7lB,OAChBimB,EAAOM,SAASjwB,GAAsBoB,QAE9C,sCAgeM,SACFuuB,GAEA,MAAMtB,EAAO6D,GAA2CxoB,OACpDimB,EAAOM,SAAS5vB,GAAqBe,SAEzC,OACO8I,OAAAG,OAAAH,OAAAG,OAAA,CAAA,EAAAgkB,IACHiE,MAAOD,GAAahE,EAAKiE,OAAU,KAAOjE,EAAKiE,OAEvD,wCA1ZM,SACF3C,GAEA,OAAOL,GAA6C5lB,OAChDimB,EAAO/pB,MAAM1F,GAAuBkB,OAAS,GAErD,qBWtLON,eACHE,EACAo1B,EACA31B,EACA+B,EACAT,EACAuxB,EACAsF,EACAgC,GAEAp4B,EAASD,EAAAA,GAAGC,GAEZ,MAAMwG,QAAgChI,EAAIm6B,kCACtCp5B,EAAM0qB,UACN,CACIhsB,UAID26B,GAAiBt2B,GACpBkE,EAAwBqyB,MACxB74B,GAGE8vB,QAActxB,EAAIs6B,mBACpBF,EAAcz5B,KAAI8C,IAAY,CAC1B82B,KAAM92B,EAAQG,kBAAkB22B,KAChCl0B,KAAM5C,EAAQG,kBAAkBwC,SAASC,KACzCE,MAAO9C,EAAQG,kBAAkBwC,SAASG,WAM5C41B,EAAyB35B,GAF/Bo1B,EAAiBA,QAAAA,QAAyB73B,GAAkBC,EAAKP,GAI7D+B,GAGEg5B,QAAWj6B,GAAuBo3B,WAAW,CAC/CvC,MAAOA,EAAM3J,UACbjmB,6BAA8B40B,EAC9B9H,YACA9wB,SACAo2B,eAAgBuE,EAChB3G,4BAA6BlE,EAAM5rB,YACnC6vB,oBAAqBjE,EAAMmJ,mBAGzBX,UAAEA,SAAoB95B,EAAI+5B,qBAC1BW,EAAoBC,EAAYA,aAACvF,EAAO,CAACr0B,IACzC65B,EAAWX,EAAcA,eAC3B,CAAChE,EAAAA,qBAAqB4E,oBAAoB,CAAEC,MAAO,OAAYN,GAC/DpF,EACA0E,EACAY,GAEJ,aAAaR,EAAAA,iBAAiBl6B,EAAK46B,EAAUhB,EACjD,8BCvDO95B,eACHE,EACAo1B,EACA31B,EACA+B,EACAT,EACAuxB,EACAsF,EACAgC,GAEAp4B,EAASD,EAAAA,GAAGC,GAEZ,MAAMwG,QACIhI,EAAIo8B,qCAAqCr7B,EAAM0qB,UAAW,CAC5DhsB,UAGD26B,GAAiBt2B,GACpBkE,EAAwBqyB,MACxB74B,GAGE8vB,QAActxB,EAAIs6B,mBACpBF,EAAcz5B,KAAI8C,IAAY,CAC1B82B,KAAM92B,EAAQG,kBAAkB22B,KAChCl0B,KAAM5C,EAAQG,kBAAkBwC,SAASC,KACzCE,MAAO9C,EAAQG,kBAAkBwC,SAASG,WAI5C81B,EACFzE,QAAAA,EACAp1B,SACUzC,GAAkBC,EAAKP,GAC7B+B,GAGFg5B,QAAWj6B,GAAuBo3B,WAAW,CAC/CvC,MAAOA,EAAM3J,UACbjmB,6BAA8B40B,EAC9B9H,YACA9wB,SACAg0B,4BAA6BlE,EAAM5rB,YACnC6vB,oBAAqBjE,EAAMmJ,gBAC3B7C,eAAgByE,KAGdvC,UAAEA,SAAoB95B,EAAI+5B,qBAC1BW,EAAoBC,EAAYA,aAACvF,EAAO,CAACr0B,IACzC65B,EAAWX,EAAcA,eAC3B,CAAChE,EAAAA,qBAAqB4E,oBAAoB,CAAEC,MAAO,OAAYN,GAC/DpF,EACA0E,EACAY,GAGJ,OAAOR,mBAAiBl6B,EAAK46B,EAAUhB,EAC3C,sCVxFgB,SACZ0C,EACAC,GAIA,MAAMp7B,EAAUq7B,EAAAA,gBACZ3D,GAAgByD,GAAU,GAAGG,UAC7BF,EAAgBl2B,KAAKo2B,UACrB1D,EAAAA,4BAA4B0D,WAEhC,OAAOt8B,MAAMtB,KAAKsC,EACtB,qWAqCgB,SAA2BJ,EAAkBtB,GACzD,OAAOutB,EAAAA,UAAUiG,uBACb,CACIlyB,EAAM2Y,WACNqf,EAAAA,4BAA4Brf,WAC5Bja,EAAKia,YAETqf,EAA2BA,6BAC7B,EACN,4CAxBgB,SACZh4B,EACAtB,GAEA,OAAOutB,EAAAA,UAAUiG,uBACb,CACIlyB,EAAM2Y,WACNqf,EAAAA,4BAA4Brf,WAC5Bja,EAAKia,YAETqf,EAA2BA,4BAEnC,6DW8BM,SACFnB,GAEA,OAAQz3B,MAAM6N,QAAQ4pB,EAC1B,6BC9DO93B,eACHE,EACAo1B,EACA31B,EACAsB,EACA64B,GAEA,MAAM5xB,QAAgChI,EAAIm6B,kCACtCp5B,EAAM0qB,UACN,CAAEhsB,SAGN,GAA6C,IAAzCuI,EAAwBqyB,MAAMj6B,OAC9B,MAAM,IAAIT,MACN,+CAA+CF,EAAKI,cAI5D,MAAMm3B,EAAe,CACjBf,EAAAA,qBAAqB4E,oBAAoB,CAAEC,MAAO,OAGtD,IACI,IAAIx6B,EAAI,EACRA,EAAI0H,EAAwBqyB,MAAMz1B,MAAM,EAAG,GAAGxE,OAC9CE,GAAK,EACP,CACE,MAAMo8B,EAAQ10B,EAAwBqyB,MAAMz1B,MAAMtE,EAAGA,EAAI,GAEnDgxB,QAActxB,EAAI28B,iBACpBD,EAAM/7B,KAAI8C,GAAWlC,EAAAA,GAAGkC,EAAQG,kBAAkB22B,SAGhDqC,QACIr8B,GAAuBu3B,mBAAmB,CAC5C1C,MAAOA,EAAM3J,UACb1qB,MAAOA,EAAM0qB,UACbjmB,6BAA8Bk3B,EAC9Bj9B,OACA81B,oBAAqBjE,EAAMmJ,gBAC3BjF,4BAA6BlE,EAAM5rB,cAG3CsxB,EAAaryB,QAAQi4B,EACxB,CAED,MAAM9C,UAAEA,SAAoB95B,EAAI+5B,qBAC1BW,EAAoBC,EAAYA,aAACvF,EAAO,CAACr0B,IAEzC65B,EAAWX,EAAAA,eACbjD,EACA5B,EACA0E,EACAY,GAGJ,OAAOR,mBAAiBl6B,EAAK46B,EAAUhB,EAC3C,iBC1CO95B,eACHE,EACAo1B,EACA31B,EACAg1B,EACAvE,EACA1uB,EACAiE,EACAjG,EACAo6B,GAEAn0B,EACIA,QAAAA,EACAs1B,EAAAA,0BAA0B/6B,EAAIg7B,qBAClCx7B,EACIA,QAAAA,EACA2C,SAA0BpC,GAAkBC,EAAKP,IAErD,MAAM+6B,QAAWj6B,GAAuBi0B,OAAO,CAC3C9E,SAAU0F,EAAM3J,UAChBhsB,OACAywB,UAAWA,EAAUzE,UACrBjqB,SACAizB,WACAhvB,sBACAjG,mBAGEs6B,UAAEA,SAAoB95B,EAAI+5B,qBAC1BW,EAAoBC,EAAYA,aAACvF,EAAO,CAAClF,IAEzC8J,EAAKC,EAAcA,eACrB,CAAChE,EAAAA,qBAAqB4E,oBAAoB,CAAEC,MAAO,MAAcN,GACjEpF,EACA0E,EACAY,GAGJ,OAAOR,mBAAiBl6B,EAAKg6B,EAAIJ,EACrC,iLCxDO95B,eACHE,EACAo1B,EACA/xB,EACAtC,EACA64B,GAEA,MAAMtI,QAActxB,EAAIs6B,mBACpBj3B,EAAS1C,KAAI8C,IAAY,CACrB82B,KAAM92B,EAAQG,kBAAkB22B,KAChCl0B,KAAM5C,EAAQG,kBAAkBwC,SAASC,KACzCE,MAAO9C,EAAQG,kBAAkBwC,SAASG,YAyBtD,SAAoBxF,EAAesC,GAC/B,IAAKtC,EAAM0qB,UAAU/rB,OAAO2D,EAAS,GAAGK,OAAO3C,OAC3C,MAAM,IAAIpB,MACN,SAASoB,EAAM0qB,UAAU5rB,qCAAqCwD,EAAS,GAAGK,OAAO3C,MAAMlB,aAGnG,CA5BIg9B,CAAW97B,EAAOsC,GA8BtB,SAA0BA,GACtB,GAAIA,EAASy5B,MAAKr5B,GAAuC,OAA5BA,EAAQC,OAAOoC,WACxC,MAAM,IAAInG,MAAM,2BAExB,CAjCIo9B,CAAiB15B,GAEjB,MAAMm3B,QAAWj6B,GAAuBm4B,OAAO,CAC3CtD,MAAOA,EAAM3J,UACbjmB,6BAA8BnC,EAC9BmyB,4BAA6BlE,EAAM5rB,YACnC6vB,oBAAqBjE,EAAMmJ,mBAGzBX,UAAEA,SAAoB95B,EAAI+5B,qBAC1BW,EAAoBC,EAAYA,aAACvF,EAAO,CAACr0B,IACzC65B,EAAWX,EAAcA,eAC3B,CAAChE,EAAAA,qBAAqB4E,oBAAoB,CAAEC,MAAO,MAAYN,GAC/DpF,EACA0E,EACAY,GAGJ,OAAOR,mBAAiBl6B,EAAK46B,EAAUhB,EAC3C,2FtBMM,SACFv2B,EACA7B,EACA+B,EAAoB,GAOpB,MAAOS,EAAkBa,EAAOm4B,EAAe74B,GAC3CL,GACIT,EACA7B,EACA+B,GAER,MAAO,CAAES,mBAAkBa,QAAOm4B,gBAAe74B,oBACrD,+KA4KM,SACFd,EACAU,EACAR,EAAoB,GAOpB,MACIS,EACAC,EACAC,EACAC,GACAa,GACA3B,EACAU,EACAR,GAGJ,GAAIU,EAAkBI,GAAG9C,KAAGwC,IAAkB,CAC1C,MAAMO,EAAejB,EAASkB,QAC1B,CAACC,EAAKf,IAAYe,EAAIC,IAAIhB,EAAQC,OAAOlC,SACzCD,EAAAA,GAAG,IAEP,MAAIyC,EAAiB5D,QAAUmD,EACrB,IAAI5D,MACN,+BAA+BwE,EAAkB1C,eAAe8B,+CAAuDe,EAAa7C,eAAe4B,EAASjD,wEAG1J,IAAIT,MACN,mCAAmCoE,EAAetC,0BAA0B6C,EAAa7C,cAGpG,CAED,GAAgC,IAA5BuC,EAAiB5D,OACjB,MAAM,IAAIT,MAAMwD,IAGpB,MAAO,CACHa,EACAC,EACAC,EACAC,EAER,uQuB7QOrE,eACHE,EACAo1B,EACA31B,EACA+B,EACAT,EACAuxB,EACAsH,GAEAp4B,EAASD,EAAAA,GAAGC,GACZ,MAAMwG,QAAgChI,EAAIm6B,kCACtCp5B,EAAM0qB,UACN,CACIhsB,UAID26B,GAAiBt2B,GACpBkE,EAAwBqyB,MACxB74B,GAGE8vB,QAActxB,EAAIs6B,mBACpBF,EAAcz5B,KAAI8C,IAAY,CAC1B82B,KAAM92B,EAAQG,kBAAkB22B,KAChCl0B,KAAM5C,EAAQG,kBAAkBwC,SAASC,KACzCE,MAAO9C,EAAQG,kBAAkBwC,SAASG,WAI5Ci0B,QAAWj6B,GAAuB+0B,SAAS,CAC7CF,MAAOA,EAAM3J,UACbjmB,6BAA8B40B,EAC9B9H,YACA9wB,SACAg0B,4BAA6BlE,EAAM5rB,YACnC6vB,oBAAqBjE,EAAMmJ,mBAGzBX,UAAEA,SAAoB95B,EAAI+5B,qBAC1BW,EAAoBC,EAAYA,aAACvF,EAAO,CAACr0B,IACzC65B,EAAWX,EAAcA,eAC3B,CAAChE,EAAAA,qBAAqB4E,oBAAoB,CAAEC,MAAO,MAAYN,GAC/DpF,EACA0E,EACAY,GAGJ,OAAOR,mBAAiBl6B,EAAK46B,EAAUhB,EAC3C,8DCnDO95B,eACHE,EACAo1B,EACA31B,EACA+B,EACAT,EACAuxB,EACAsH,GAEAp4B,EAASD,EAAAA,GAAGC,GACZ,MAAMwG,QACIhI,EAAIo8B,qCAAqCr7B,EAAM0qB,UAAW,CAC5DhsB,UAGD26B,GAAiBt2B,GACpBkE,EAAwBqyB,MACxB74B,GAGE8vB,QAActxB,EAAIs6B,mBACpBF,EAAcz5B,KAAI8C,IAAY,CAC1B82B,KAAM92B,EAAQG,kBAAkB22B,KAChCl0B,KAAM5C,EAAQG,kBAAkBwC,SAASC,KACzCE,MAAO9C,EAAQG,kBAAkBwC,SAASG,WAI5Ci0B,QAAWj6B,GAAuB+0B,SAAS,CAC7CF,MAAOA,EAAM3J,UACbjmB,6BAA8B40B,EAC9B9H,YACA9wB,SACAg0B,4BAA6BlE,EAAM5rB,YACnC6vB,oBAAqBjE,EAAMmJ,mBAGzBX,UAAEA,SAAoB95B,EAAI+5B,qBAC1BW,EAAoBC,EAAYA,aAACvF,EAAO,CAACr0B,IACzC65B,EAAWX,EAAcA,eAC3B,CAAChE,EAAAA,qBAAqB4E,oBAAoB,CAAEC,MAAO,MAAYN,GAC/DpF,EACA0E,EACAY,GAGJ,OAAOR,mBAAiBl6B,EAAK46B,EAAUhB,EAC3C","x_google_ignoreList":[5,6,7]}