coinley-checkout/dist/core-be16e657.mjs.map

A React SDK for Coinley cryptocurrency payment processing with multi-network support

{"version":3,"file":"core-be16e657.mjs","sources":["../node_modules/viem/_esm/clients/transports/fallback.js","../node_modules/@reown/appkit-common/dist/esm/src/utils/ConstantsUtil.js","../node_modules/@reown/appkit-common/dist/esm/src/utils/NetworkUtil.js","../node_modules/big.js/big.mjs","../node_modules/@reown/appkit-common/dist/esm/src/utils/NumberUtil.js","../node_modules/@reown/appkit-common/dist/esm/src/contracts/erc20.js","../node_modules/@reown/appkit-common/dist/esm/src/contracts/swap.js","../node_modules/@reown/appkit-common/dist/esm/src/contracts/usdt.js","../node_modules/@reown/appkit-common/dist/esm/src/utils/ContractUtil.js","../node_modules/@reown/appkit-common/dist/esm/src/utils/ParseUtil.js","../node_modules/@reown/appkit-common/dist/esm/src/utils/SafeLocalStorage.js","../node_modules/@reown/appkit-common/dist/esm/src/utils/ThemeUtil.js","../node_modules/proxy-compare/dist/index.modern.js","../node_modules/valtio/esm/vanilla.mjs","../node_modules/valtio/esm/vanilla/utils.mjs","../node_modules/@reown/appkit-controllers/dist/esm/src/utils/ConstantsUtil.js","../node_modules/@reown/appkit-controllers/dist/esm/src/utils/StorageUtil.js","../node_modules/@reown/appkit-controllers/dist/esm/src/utils/CoreHelperUtil.js","../node_modules/@reown/appkit-controllers/dist/esm/src/utils/FetchUtil.js","../node_modules/@reown/appkit-controllers/dist/esm/src/utils/OptionsUtil.js","../node_modules/@reown/appkit-controllers/dist/esm/src/controllers/OptionsController.js","../node_modules/@reown/appkit-controllers/dist/esm/src/controllers/TelemetryController.js","../node_modules/@reown/appkit-controllers/dist/esm/src/utils/withErrorBoundary.js","../node_modules/@reown/appkit-controllers/dist/esm/src/utils/MobileWallet.js","../node_modules/@reown/appkit-controllers/dist/esm/src/controllers/AssetController.js","../node_modules/@reown/appkit-controllers/dist/esm/src/utils/AssetUtil.js","../node_modules/@reown/appkit-controllers/dist/esm/src/controllers/AlertController.js","../node_modules/@reown/appkit-controllers/dist/esm/src/controllers/EventsController.js","../node_modules/@reown/appkit-controllers/dist/esm/src/controllers/ApiController.js","../node_modules/@reown/appkit-controllers/dist/esm/src/controllers/RouterController.js","../node_modules/@reown/appkit-controllers/dist/esm/src/controllers/ThemeController.js","../node_modules/@reown/appkit-controllers/dist/esm/src/controllers/ConnectorController.js","../node_modules/@reown/appkit-wallet/dist/esm/src/W3mFrameConstants.js","../node_modules/@reown/appkit-controllers/dist/esm/src/controllers/SnackController.js","../node_modules/@reown/appkit-controllers/dist/esm/src/controllers/TransactionsController.js","../node_modules/@reown/appkit-controllers/dist/esm/src/controllers/ConnectionController.js","../node_modules/@reown/appkit-controllers/dist/esm/src/controllers/PublicStateController.js","../node_modules/@reown/appkit-controllers/dist/esm/src/utils/ERC7811Util.js","../node_modules/@reown/appkit-controllers/dist/esm/src/utils/SendApiUtil.js","../node_modules/@reown/appkit-controllers/dist/esm/src/controllers/SendController.js","../node_modules/@reown/appkit-controllers/dist/esm/src/controllers/ChainController.js","../node_modules/@reown/appkit-controllers/dist/esm/src/controllers/BlockchainApiController.js","../node_modules/@reown/appkit-controllers/dist/esm/src/controllers/AccountController.js","../node_modules/@reown/appkit-controllers/dist/esm/src/utils/NetworkUtil.js","../node_modules/@reown/appkit-controllers/dist/esm/src/controllers/ModalController.js","../node_modules/@reown/appkit-controllers/dist/esm/src/controllers/OnRampController.js","../node_modules/@reown/appkit-controllers/dist/esm/src/utils/EnsUtil.js","../node_modules/@reown/appkit-controllers/dist/esm/src/controllers/EnsController.js","../node_modules/@reown/appkit-controllers/dist/esm/src/utils/SIWXUtil.js","../node_modules/@reown/appkit/node_modules/unstorage/dist/shared/unstorage.CoCt7NXC.mjs","../node_modules/@reown/appkit/node_modules/unstorage/dist/index.mjs","../node_modules/@reown/appkit/node_modules/@walletconnect/keyvaluestorage/dist/index.es.js","../node_modules/@reown/appkit/node_modules/@walletconnect/types/dist/index.es.js","../node_modules/@reown/appkit/node_modules/@walletconnect/utils/node_modules/viem/_esm/utils/data/isHex.js","../node_modules/@reown/appkit/node_modules/@walletconnect/utils/node_modules/viem/_esm/utils/data/size.js","../node_modules/@reown/appkit/node_modules/@walletconnect/utils/node_modules/viem/_esm/errors/version.js","../node_modules/@reown/appkit/node_modules/@walletconnect/utils/node_modules/viem/_esm/errors/base.js","../node_modules/@reown/appkit/node_modules/@walletconnect/utils/node_modules/viem/_esm/errors/data.js","../node_modules/@reown/appkit/node_modules/@walletconnect/utils/node_modules/viem/_esm/utils/data/pad.js","../node_modules/@reown/appkit/node_modules/@walletconnect/utils/node_modules/viem/_esm/errors/encoding.js","../node_modules/@reown/appkit/node_modules/@walletconnect/utils/node_modules/viem/_esm/utils/encoding/fromHex.js","../node_modules/@reown/appkit/node_modules/@walletconnect/utils/node_modules/viem/_esm/utils/encoding/toHex.js","../node_modules/@reown/appkit/node_modules/@walletconnect/utils/node_modules/viem/_esm/utils/encoding/toBytes.js","../node_modules/@reown/appkit/node_modules/@noble/hashes/esm/_assert.js","../node_modules/@reown/appkit/node_modules/@noble/hashes/esm/_u64.js","../node_modules/@reown/appkit/node_modules/@noble/hashes/esm/crypto.js","../node_modules/@reown/appkit/node_modules/@noble/hashes/esm/utils.js","../node_modules/@reown/appkit/node_modules/@noble/hashes/esm/sha3.js","../node_modules/@reown/appkit/node_modules/@walletconnect/utils/node_modules/viem/_esm/utils/hash/keccak256.js","../node_modules/@reown/appkit/node_modules/@walletconnect/utils/node_modules/viem/_esm/utils/lru.js","../node_modules/@reown/appkit/node_modules/@walletconnect/utils/node_modules/viem/_esm/utils/address/getAddress.js","../node_modules/@reown/appkit/node_modules/@walletconnect/utils/node_modules/viem/_esm/accounts/utils/publicKeyToAddress.js","../node_modules/@reown/appkit/node_modules/@walletconnect/utils/node_modules/viem/_esm/utils/signature/recoverPublicKey.js","../node_modules/@reown/appkit/node_modules/@walletconnect/utils/node_modules/viem/_esm/utils/signature/recoverAddress.js","../node_modules/@reown/appkit/node_modules/base-x/src/esm/index.js","../node_modules/@reown/appkit/node_modules/bs58/src/esm/index.js","../node_modules/@reown/appkit/node_modules/uint8arrays/esm/src/alloc.js","../node_modules/@reown/appkit/node_modules/uint8arrays/esm/src/concat.js","../node_modules/@reown/appkit/node_modules/uint8arrays/esm/src/util/bases.js","../node_modules/@reown/appkit/node_modules/uint8arrays/esm/src/from-string.js","../node_modules/@reown/appkit/node_modules/uint8arrays/esm/src/to-string.js","../node_modules/@reown/appkit/node_modules/@walletconnect/utils/dist/index.es.js","../node_modules/@reown/appkit/node_modules/@walletconnect/core/dist/index.es.js","../node_modules/@reown/appkit/node_modules/@walletconnect/sign-client/dist/index.es.js","../node_modules/@reown/appkit/node_modules/@walletconnect/universal-provider/dist/index.es.js","../node_modules/@reown/appkit-controllers/dist/esm/src/utils/ConnectorControllerUtil.js","../node_modules/@reown/appkit-controllers/dist/esm/src/utils/ChainControllerUtil.js","../node_modules/@reown/appkit-utils/dist/esm/src/ConstantsUtil.js","../node_modules/@reown/appkit-utils/dist/esm/src/PresetsUtil.js","../node_modules/@reown/appkit-utils/dist/esm/src/HelpersUtil.js","../node_modules/@reown/appkit-utils/dist/esm/src/ErrorUtil.js","../node_modules/@reown/appkit-utils/dist/esm/src/LoggerUtil.js","../node_modules/@reown/appkit-utils/dist/esm/src/CaipNetworkUtil.js","../node_modules/@reown/appkit-utils/dist/esm/src/ProviderUtil.js","../node_modules/@reown/appkit-scaffold-ui/dist/esm/src/utils/ConstantsUtil.js","../node_modules/@reown/appkit-scaffold-ui/dist/esm/src/utils/WalletUtil.js","../node_modules/@reown/appkit-scaffold-ui/dist/esm/src/utils/ConnectorUtil.js","../node_modules/@lit/reactive-element/css-tag.js","../node_modules/@lit/reactive-element/reactive-element.js","../node_modules/lit-html/lit-html.js","../node_modules/lit-element/lit-element.js","../node_modules/@reown/appkit-ui/dist/esm/src/utils/ThemeUtil.js","../node_modules/@reown/appkit/dist/esm/src/utils/ConstantsUtil.js","../node_modules/@reown/appkit/dist/esm/src/networks/utils.js","../node_modules/@reown/appkit/dist/esm/src/networks/solana/solana.js","../node_modules/@reown/appkit/dist/esm/src/networks/solana/solanaDevnet.js","../node_modules/@reown/appkit/dist/esm/src/networks/solana/solanaTestnet.js","../node_modules/@reown/appkit/dist/esm/src/networks/bitcoin.js","../node_modules/@reown/appkit/dist/esm/src/utils/HelpersUtil.js","../node_modules/@reown/appkit/dist/esm/src/connectors/WalletConnectConnector.js","../node_modules/@reown/appkit/dist/esm/src/adapters/ChainAdapterBlueprint.js","../node_modules/@reown/appkit/dist/esm/src/universal-adapter/client.js","../node_modules/@reown/appkit/dist/esm/src/utils/ConfigUtil.js","../node_modules/@reown/appkit/dist/esm/src/client/appkit-base-client.js","../node_modules/@reown/appkit/dist/esm/src/client/appkit-core.js","../node_modules/@reown/appkit/dist/esm/exports/constants.js","../node_modules/@reown/appkit/dist/esm/exports/core.js"],"sourcesContent":["import { ExecutionRevertedError } from '../../errors/node.js';\nimport { TransactionRejectedRpcError, UserRejectedRequestError, } from '../../errors/rpc.js';\nimport { wait } from '../../utils/wait.js';\nimport { createTransport, } from './createTransport.js';\nexport function fallback(transports_, config = {}) {\n    const { key = 'fallback', name = 'Fallback', rank = false, shouldThrow: shouldThrow_ = shouldThrow, retryCount, retryDelay, } = config;\n    return (({ chain, pollingInterval = 4_000, timeout, ...rest }) => {\n        let transports = transports_;\n        let onResponse = () => { };\n        const transport = createTransport({\n            key,\n            name,\n            async request({ method, params }) {\n                let includes;\n                const fetch = async (i = 0) => {\n                    const transport = transports[i]({\n                        ...rest,\n                        chain,\n                        retryCount: 0,\n                        timeout,\n                    });\n                    try {\n                        const response = await transport.request({\n                            method,\n                            params,\n                        });\n                        onResponse({\n                            method,\n                            params: params,\n                            response,\n                            transport,\n                            status: 'success',\n                        });\n                        return response;\n                    }\n                    catch (err) {\n                        onResponse({\n                            error: err,\n                            method,\n                            params: params,\n                            transport,\n                            status: 'error',\n                        });\n                        if (shouldThrow_(err))\n                            throw err;\n                        // If we've reached the end of the fallbacks, throw the error.\n                        if (i === transports.length - 1)\n                            throw err;\n                        // Check if at least one other transport includes the method\n                        includes ??= transports.slice(i + 1).some((transport) => {\n                            const { include, exclude } = transport({ chain }).config.methods || {};\n                            if (include)\n                                return include.includes(method);\n                            if (exclude)\n                                return !exclude.includes(method);\n                            return true;\n                        });\n                        if (!includes)\n                            throw err;\n                        // Otherwise, try the next fallback.\n                        return fetch(i + 1);\n                    }\n                };\n                return fetch();\n            },\n            retryCount,\n            retryDelay,\n            type: 'fallback',\n        }, {\n            onResponse: (fn) => (onResponse = fn),\n            transports: transports.map((fn) => fn({ chain, retryCount: 0 })),\n        });\n        if (rank) {\n            const rankOptions = (typeof rank === 'object' ? rank : {});\n            rankTransports({\n                chain,\n                interval: rankOptions.interval ?? pollingInterval,\n                onTransports: (transports_) => (transports = transports_),\n                ping: rankOptions.ping,\n                sampleCount: rankOptions.sampleCount,\n                timeout: rankOptions.timeout,\n                transports,\n                weights: rankOptions.weights,\n            });\n        }\n        return transport;\n    });\n}\nexport function shouldThrow(error) {\n    if ('code' in error && typeof error.code === 'number') {\n        if (error.code === TransactionRejectedRpcError.code ||\n            error.code === UserRejectedRequestError.code ||\n            ExecutionRevertedError.nodeMessage.test(error.message) ||\n            error.code === 5000 // CAIP UserRejectedRequestError\n        )\n            return true;\n    }\n    return false;\n}\n/** @internal */\nexport function rankTransports({ chain, interval = 4_000, onTransports, ping, sampleCount = 10, timeout = 1_000, transports, weights = {}, }) {\n    const { stability: stabilityWeight = 0.7, latency: latencyWeight = 0.3 } = weights;\n    const samples = [];\n    const rankTransports_ = async () => {\n        // 1. Take a sample from each Transport.\n        const sample = await Promise.all(transports.map(async (transport) => {\n            const transport_ = transport({ chain, retryCount: 0, timeout });\n            const start = Date.now();\n            let end;\n            let success;\n            try {\n                await (ping\n                    ? ping({ transport: transport_ })\n                    : transport_.request({ method: 'net_listening' }));\n                success = 1;\n            }\n            catch {\n                success = 0;\n            }\n            finally {\n                end = Date.now();\n            }\n            const latency = end - start;\n            return { latency, success };\n        }));\n        // 2. Store the sample. If we have more than `sampleCount` samples, remove\n        // the oldest sample.\n        samples.push(sample);\n        if (samples.length > sampleCount)\n            samples.shift();\n        // 3. Calculate the max latency from samples.\n        const maxLatency = Math.max(...samples.map((sample) => Math.max(...sample.map(({ latency }) => latency))));\n        // 4. Calculate the score for each Transport.\n        const scores = transports\n            .map((_, i) => {\n            const latencies = samples.map((sample) => sample[i].latency);\n            const meanLatency = latencies.reduce((acc, latency) => acc + latency, 0) /\n                latencies.length;\n            const latencyScore = 1 - meanLatency / maxLatency;\n            const successes = samples.map((sample) => sample[i].success);\n            const stabilityScore = successes.reduce((acc, success) => acc + success, 0) /\n                successes.length;\n            if (stabilityScore === 0)\n                return [0, i];\n            return [\n                latencyWeight * latencyScore + stabilityWeight * stabilityScore,\n                i,\n            ];\n        })\n            .sort((a, b) => b[0] - a[0]);\n        // 5. Sort the Transports by score.\n        onTransports(scores.map(([, i]) => transports[i]));\n        // 6. Wait, and then rank again.\n        await wait(interval);\n        rankTransports_();\n    };\n    rankTransports_();\n}\n//# sourceMappingURL=fallback.js.map","export const ConstantsUtil = {\n    WC_NAME_SUFFIX: '.reown.id',\n    WC_NAME_SUFFIX_LEGACY: '.wcn.id',\n    BLOCKCHAIN_API_RPC_URL: 'https://rpc.walletconnect.org',\n    PULSE_API_URL: 'https://pulse.walletconnect.org',\n    W3M_API_URL: 'https://api.web3modal.org',\n    CONNECTOR_ID: {\n        WALLET_CONNECT: 'walletConnect',\n        INJECTED: 'injected',\n        WALLET_STANDARD: 'announced',\n        COINBASE: 'coinbaseWallet',\n        COINBASE_SDK: 'coinbaseWalletSDK',\n        SAFE: 'safe',\n        LEDGER: 'ledger',\n        OKX: 'okx',\n        EIP6963: 'eip6963',\n        AUTH: 'ID_AUTH'\n    },\n    CONNECTOR_NAMES: {\n        AUTH: 'Auth'\n    },\n    AUTH_CONNECTOR_SUPPORTED_CHAINS: ['eip155', 'solana'],\n    LIMITS: {\n        PENDING_TRANSACTIONS: 99\n    },\n    CHAIN: {\n        EVM: 'eip155',\n        SOLANA: 'solana',\n        POLKADOT: 'polkadot',\n        BITCOIN: 'bip122'\n    },\n    CHAIN_NAME_MAP: {\n        eip155: 'EVM Networks',\n        solana: 'Solana',\n        polkadot: 'Polkadot',\n        bip122: 'Bitcoin',\n        cosmos: 'Cosmos'\n    },\n    ADAPTER_TYPES: {\n        BITCOIN: 'bitcoin',\n        SOLANA: 'solana',\n        WAGMI: 'wagmi',\n        ETHERS: 'ethers',\n        ETHERS5: 'ethers5'\n    },\n    USDT_CONTRACT_ADDRESSES: [\n        '0xdac17f958d2ee523a2206206994597c13d831ec7',\n        '0xc2132d05d31c914a87c6611c10748aeb04b58e8f',\n        '0x9702230a8ea53601f5cd2dc00fdbc13d4df4a8c7',\n        '0x919C1c267BC06a7039e03fcc2eF738525769109c',\n        '0x48065fbBE25f71C9282ddf5e1cD6D6A887483D5e',\n        '0x55d398326f99059fF775485246999027B3197955',\n        '0xfd086bc7cd5c481dcc9c85ebe478a1c0b69fcbb9'\n    ],\n    HTTP_STATUS_CODES: {\n        SERVICE_UNAVAILABLE: 503,\n        FORBIDDEN: 403\n    },\n    UNSUPPORTED_NETWORK_NAME: 'Unknown Network',\n    SECURE_SITE_SDK_ORIGIN: (typeof process !== 'undefined' && typeof process.env !== 'undefined'\n        ? process.env['NEXT_PUBLIC_SECURE_SITE_ORIGIN']\n        : undefined) || 'https://secure.walletconnect.org'\n};\n//# sourceMappingURL=ConstantsUtil.js.map","import { ConstantsUtil } from './ConstantsUtil.js';\nexport const NetworkUtil = {\n    caipNetworkIdToNumber(caipnetworkId) {\n        return caipnetworkId ? Number(caipnetworkId.split(':')[1]) : undefined;\n    },\n    parseEvmChainId(chainId) {\n        return typeof chainId === 'string'\n            ? this.caipNetworkIdToNumber(chainId)\n            : chainId;\n    },\n    getNetworksByNamespace(networks, namespace) {\n        return networks?.filter(network => network.chainNamespace === namespace) || [];\n    },\n    getFirstNetworkByNamespace(networks, namespace) {\n        return this.getNetworksByNamespace(networks, namespace)[0];\n    },\n    getNetworkNameByCaipNetworkId(caipNetworks, caipNetworkId) {\n        if (!caipNetworkId) {\n            return undefined;\n        }\n        const caipNetwork = caipNetworks.find(network => network.caipNetworkId === caipNetworkId);\n        if (caipNetwork) {\n            return caipNetwork.name;\n        }\n        const [namespace] = caipNetworkId.split(':');\n        return ConstantsUtil.CHAIN_NAME_MAP?.[namespace] || undefined;\n    }\n};\n//# sourceMappingURL=NetworkUtil.js.map","/*\r\n *  big.js v6.2.2\r\n *  A small, fast, easy-to-use library for arbitrary-precision decimal arithmetic.\r\n *  Copyright (c) 2024 Michael Mclaughlin\r\n *  https://github.com/MikeMcl/big.js/LICENCE.md\r\n */\r\n\r\n\r\n/************************************** EDITABLE DEFAULTS *****************************************/\r\n\r\n\r\n  // The default values below must be integers within the stated ranges.\r\n\r\n  /*\r\n   * The maximum number of decimal places (DP) of the results of operations involving division:\r\n   * div and sqrt, and pow with negative exponents.\r\n   */\r\nvar DP = 20,          // 0 to MAX_DP\r\n\r\n  /*\r\n   * The rounding mode (RM) used when rounding to the above decimal places.\r\n   *\r\n   *  0  Towards zero (i.e. truncate, no rounding).       (ROUND_DOWN)\r\n   *  1  To nearest neighbour. If equidistant, round up.  (ROUND_HALF_UP)\r\n   *  2  To nearest neighbour. If equidistant, to even.   (ROUND_HALF_EVEN)\r\n   *  3  Away from zero.                                  (ROUND_UP)\r\n   */\r\n  RM = 1,             // 0, 1, 2 or 3\r\n\r\n  // The maximum value of DP and Big.DP.\r\n  MAX_DP = 1E6,       // 0 to 1000000\r\n\r\n  // The maximum magnitude of the exponent argument to the pow method.\r\n  MAX_POWER = 1E6,    // 1 to 1000000\r\n\r\n  /*\r\n   * The negative exponent (NE) at and beneath which toString returns exponential notation.\r\n   * (JavaScript numbers: -7)\r\n   * -1000000 is the minimum recommended exponent value of a Big.\r\n   */\r\n  NE = -7,            // 0 to -1000000\r\n\r\n  /*\r\n   * The positive exponent (PE) at and above which toString returns exponential notation.\r\n   * (JavaScript numbers: 21)\r\n   * 1000000 is the maximum recommended exponent value of a Big, but this limit is not enforced.\r\n   */\r\n  PE = 21,            // 0 to 1000000\r\n\r\n  /*\r\n   * When true, an error will be thrown if a primitive number is passed to the Big constructor,\r\n   * or if valueOf is called, or if toNumber is called on a Big which cannot be converted to a\r\n   * primitive number without a loss of precision.\r\n   */\r\n  STRICT = false,     // true or false\r\n\r\n\r\n/**************************************************************************************************/\r\n\r\n\r\n  // Error messages.\r\n  NAME = '[big.js] ',\r\n  INVALID = NAME + 'Invalid ',\r\n  INVALID_DP = INVALID + 'decimal places',\r\n  INVALID_RM = INVALID + 'rounding mode',\r\n  DIV_BY_ZERO = NAME + 'Division by zero',\r\n\r\n  // The shared prototype object.\r\n  P = {},\r\n  UNDEFINED = void 0,\r\n  NUMERIC = /^-?(\\d+(\\.\\d*)?|\\.\\d+)(e[+-]?\\d+)?$/i;\r\n\r\n\r\n/*\r\n * Create and return a Big constructor.\r\n */\r\nfunction _Big_() {\r\n\r\n  /*\r\n   * The Big constructor and exported function.\r\n   * Create and return a new instance of a Big number object.\r\n   *\r\n   * n {number|string|Big} A numeric value.\r\n   */\r\n  function Big(n) {\r\n    var x = this;\r\n\r\n    // Enable constructor usage without new.\r\n    if (!(x instanceof Big)) return n === UNDEFINED ? _Big_() : new Big(n);\r\n\r\n    // Duplicate.\r\n    if (n instanceof Big) {\r\n      x.s = n.s;\r\n      x.e = n.e;\r\n      x.c = n.c.slice();\r\n    } else {\r\n      if (typeof n !== 'string') {\r\n        if (Big.strict === true && typeof n !== 'bigint') {\r\n          throw TypeError(INVALID + 'value');\r\n        }\r\n\r\n        // Minus zero?\r\n        n = n === 0 && 1 / n < 0 ? '-0' : String(n);\r\n      }\r\n\r\n      parse(x, n);\r\n    }\r\n\r\n    // Retain a reference to this Big constructor.\r\n    // Shadow Big.prototype.constructor which points to Object.\r\n    x.constructor = Big;\r\n  }\r\n\r\n  Big.prototype = P;\r\n  Big.DP = DP;\r\n  Big.RM = RM;\r\n  Big.NE = NE;\r\n  Big.PE = PE;\r\n  Big.strict = STRICT;\r\n  Big.roundDown = 0;\r\n  Big.roundHalfUp = 1;\r\n  Big.roundHalfEven = 2;\r\n  Big.roundUp = 3;\r\n\r\n  return Big;\r\n}\r\n\r\n\r\n/*\r\n * Parse the number or string value passed to a Big constructor.\r\n *\r\n * x {Big} A Big number instance.\r\n * n {number|string} A numeric value.\r\n */\r\nfunction parse(x, n) {\r\n  var e, i, nl;\r\n\r\n  if (!NUMERIC.test(n)) {\r\n    throw Error(INVALID + 'number');\r\n  }\r\n\r\n  // Determine sign.\r\n  x.s = n.charAt(0) == '-' ? (n = n.slice(1), -1) : 1;\r\n\r\n  // Decimal point?\r\n  if ((e = n.indexOf('.')) > -1) n = n.replace('.', '');\r\n\r\n  // Exponential form?\r\n  if ((i = n.search(/e/i)) > 0) {\r\n\r\n    // Determine exponent.\r\n    if (e < 0) e = i;\r\n    e += +n.slice(i + 1);\r\n    n = n.substring(0, i);\r\n  } else if (e < 0) {\r\n\r\n    // Integer.\r\n    e = n.length;\r\n  }\r\n\r\n  nl = n.length;\r\n\r\n  // Determine leading zeros.\r\n  for (i = 0; i < nl && n.charAt(i) == '0';) ++i;\r\n\r\n  if (i == nl) {\r\n\r\n    // Zero.\r\n    x.c = [x.e = 0];\r\n  } else {\r\n\r\n    // Determine trailing zeros.\r\n    for (; nl > 0 && n.charAt(--nl) == '0';);\r\n    x.e = e - i - 1;\r\n    x.c = [];\r\n\r\n    // Convert string to array of digits without leading/trailing zeros.\r\n    for (e = 0; i <= nl;) x.c[e++] = +n.charAt(i++);\r\n  }\r\n\r\n  return x;\r\n}\r\n\r\n\r\n/*\r\n * Round Big x to a maximum of sd significant digits using rounding mode rm.\r\n *\r\n * x {Big} The Big to round.\r\n * sd {number} Significant digits: integer, 0 to MAX_DP inclusive.\r\n * rm {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n * [more] {boolean} Whether the result of division was truncated.\r\n */\r\nfunction round(x, sd, rm, more) {\r\n  var xc = x.c;\r\n\r\n  if (rm === UNDEFINED) rm = x.constructor.RM;\r\n  if (rm !== 0 && rm !== 1 && rm !== 2 && rm !== 3) {\r\n    throw Error(INVALID_RM);\r\n  }\r\n\r\n  if (sd < 1) {\r\n    more =\r\n      rm === 3 && (more || !!xc[0]) || sd === 0 && (\r\n      rm === 1 && xc[0] >= 5 ||\r\n      rm === 2 && (xc[0] > 5 || xc[0] === 5 && (more || xc[1] !== UNDEFINED))\r\n    );\r\n\r\n    xc.length = 1;\r\n\r\n    if (more) {\r\n\r\n      // 1, 0.1, 0.01, 0.001, 0.0001 etc.\r\n      x.e = x.e - sd + 1;\r\n      xc[0] = 1;\r\n    } else {\r\n\r\n      // Zero.\r\n      xc[0] = x.e = 0;\r\n    }\r\n  } else if (sd < xc.length) {\r\n\r\n    // xc[sd] is the digit after the digit that may be rounded up.\r\n    more =\r\n      rm === 1 && xc[sd] >= 5 ||\r\n      rm === 2 && (xc[sd] > 5 || xc[sd] === 5 &&\r\n        (more || xc[sd + 1] !== UNDEFINED || xc[sd - 1] & 1)) ||\r\n      rm === 3 && (more || !!xc[0]);\r\n\r\n    // Remove any digits after the required precision.\r\n    xc.length = sd;\r\n\r\n    // Round up?\r\n    if (more) {\r\n\r\n      // Rounding up may mean the previous digit has to be rounded up.\r\n      for (; ++xc[--sd] > 9;) {\r\n        xc[sd] = 0;\r\n        if (sd === 0) {\r\n          ++x.e;\r\n          xc.unshift(1);\r\n          break;\r\n        }\r\n      }\r\n    }\r\n\r\n    // Remove trailing zeros.\r\n    for (sd = xc.length; !xc[--sd];) xc.pop();\r\n  }\r\n\r\n  return x;\r\n}\r\n\r\n\r\n/*\r\n * Return a string representing the value of Big x in normal or exponential notation.\r\n * Handles P.toExponential, P.toFixed, P.toJSON, P.toPrecision, P.toString and P.valueOf.\r\n */\r\nfunction stringify(x, doExponential, isNonzero) {\r\n  var e = x.e,\r\n    s = x.c.join(''),\r\n    n = s.length;\r\n\r\n  // Exponential notation?\r\n  if (doExponential) {\r\n    s = s.charAt(0) + (n > 1 ? '.' + s.slice(1) : '') + (e < 0 ? 'e' : 'e+') + e;\r\n\r\n  // Normal notation.\r\n  } else if (e < 0) {\r\n    for (; ++e;) s = '0' + s;\r\n    s = '0.' + s;\r\n  } else if (e > 0) {\r\n    if (++e > n) {\r\n      for (e -= n; e--;) s += '0';\r\n    } else if (e < n) {\r\n      s = s.slice(0, e) + '.' + s.slice(e);\r\n    }\r\n  } else if (n > 1) {\r\n    s = s.charAt(0) + '.' + s.slice(1);\r\n  }\r\n\r\n  return x.s < 0 && isNonzero ? '-' + s : s;\r\n}\r\n\r\n\r\n// Prototype/instance methods\r\n\r\n\r\n/*\r\n * Return a new Big whose value is the absolute value of this Big.\r\n */\r\nP.abs = function () {\r\n  var x = new this.constructor(this);\r\n  x.s = 1;\r\n  return x;\r\n};\r\n\r\n\r\n/*\r\n * Return 1 if the value of this Big is greater than the value of Big y,\r\n *       -1 if the value of this Big is less than the value of Big y, or\r\n *        0 if they have the same value.\r\n */\r\nP.cmp = function (y) {\r\n  var isneg,\r\n    x = this,\r\n    xc = x.c,\r\n    yc = (y = new x.constructor(y)).c,\r\n    i = x.s,\r\n    j = y.s,\r\n    k = x.e,\r\n    l = y.e;\r\n\r\n  // Either zero?\r\n  if (!xc[0] || !yc[0]) return !xc[0] ? !yc[0] ? 0 : -j : i;\r\n\r\n  // Signs differ?\r\n  if (i != j) return i;\r\n\r\n  isneg = i < 0;\r\n\r\n  // Compare exponents.\r\n  if (k != l) return k > l ^ isneg ? 1 : -1;\r\n\r\n  j = (k = xc.length) < (l = yc.length) ? k : l;\r\n\r\n  // Compare digit by digit.\r\n  for (i = -1; ++i < j;) {\r\n    if (xc[i] != yc[i]) return xc[i] > yc[i] ^ isneg ? 1 : -1;\r\n  }\r\n\r\n  // Compare lengths.\r\n  return k == l ? 0 : k > l ^ isneg ? 1 : -1;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Big whose value is the value of this Big divided by the value of Big y, rounded,\r\n * if necessary, to a maximum of Big.DP decimal places using rounding mode Big.RM.\r\n */\r\nP.div = function (y) {\r\n  var x = this,\r\n    Big = x.constructor,\r\n    a = x.c,                  // dividend\r\n    b = (y = new Big(y)).c,   // divisor\r\n    k = x.s == y.s ? 1 : -1,\r\n    dp = Big.DP;\r\n\r\n  if (dp !== ~~dp || dp < 0 || dp > MAX_DP) {\r\n    throw Error(INVALID_DP);\r\n  }\r\n\r\n  // Divisor is zero?\r\n  if (!b[0]) {\r\n    throw Error(DIV_BY_ZERO);\r\n  }\r\n\r\n  // Dividend is 0? Return +-0.\r\n  if (!a[0]) {\r\n    y.s = k;\r\n    y.c = [y.e = 0];\r\n    return y;\r\n  }\r\n\r\n  var bl, bt, n, cmp, ri,\r\n    bz = b.slice(),\r\n    ai = bl = b.length,\r\n    al = a.length,\r\n    r = a.slice(0, bl),   // remainder\r\n    rl = r.length,\r\n    q = y,                // quotient\r\n    qc = q.c = [],\r\n    qi = 0,\r\n    p = dp + (q.e = x.e - y.e) + 1;    // precision of the result\r\n\r\n  q.s = k;\r\n  k = p < 0 ? 0 : p;\r\n\r\n  // Create version of divisor with leading zero.\r\n  bz.unshift(0);\r\n\r\n  // Add zeros to make remainder as long as divisor.\r\n  for (; rl++ < bl;) r.push(0);\r\n\r\n  do {\r\n\r\n    // n is how many times the divisor goes into current remainder.\r\n    for (n = 0; n < 10; n++) {\r\n\r\n      // Compare divisor and remainder.\r\n      if (bl != (rl = r.length)) {\r\n        cmp = bl > rl ? 1 : -1;\r\n      } else {\r\n        for (ri = -1, cmp = 0; ++ri < bl;) {\r\n          if (b[ri] != r[ri]) {\r\n            cmp = b[ri] > r[ri] ? 1 : -1;\r\n            break;\r\n          }\r\n        }\r\n      }\r\n\r\n      // If divisor < remainder, subtract divisor from remainder.\r\n      if (cmp < 0) {\r\n\r\n        // Remainder can't be more than 1 digit longer than divisor.\r\n        // Equalise lengths using divisor with extra leading zero?\r\n        for (bt = rl == bl ? b : bz; rl;) {\r\n          if (r[--rl] < bt[rl]) {\r\n            ri = rl;\r\n            for (; ri && !r[--ri];) r[ri] = 9;\r\n            --r[ri];\r\n            r[rl] += 10;\r\n          }\r\n          r[rl] -= bt[rl];\r\n        }\r\n\r\n        for (; !r[0];) r.shift();\r\n      } else {\r\n        break;\r\n      }\r\n    }\r\n\r\n    // Add the digit n to the result array.\r\n    qc[qi++] = cmp ? n : ++n;\r\n\r\n    // Update the remainder.\r\n    if (r[0] && cmp) r[rl] = a[ai] || 0;\r\n    else r = [a[ai]];\r\n\r\n  } while ((ai++ < al || r[0] !== UNDEFINED) && k--);\r\n\r\n  // Leading zero? Do not remove if result is simply zero (qi == 1).\r\n  if (!qc[0] && qi != 1) {\r\n\r\n    // There can't be more than one zero.\r\n    qc.shift();\r\n    q.e--;\r\n    p--;\r\n  }\r\n\r\n  // Round?\r\n  if (qi > p) round(q, p, Big.RM, r[0] !== UNDEFINED);\r\n\r\n  return q;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Big is equal to the value of Big y, otherwise return false.\r\n */\r\nP.eq = function (y) {\r\n  return this.cmp(y) === 0;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Big is greater than the value of Big y, otherwise return\r\n * false.\r\n */\r\nP.gt = function (y) {\r\n  return this.cmp(y) > 0;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Big is greater than or equal to the value of Big y, otherwise\r\n * return false.\r\n */\r\nP.gte = function (y) {\r\n  return this.cmp(y) > -1;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Big is less than the value of Big y, otherwise return false.\r\n */\r\nP.lt = function (y) {\r\n  return this.cmp(y) < 0;\r\n};\r\n\r\n\r\n/*\r\n * Return true if the value of this Big is less than or equal to the value of Big y, otherwise\r\n * return false.\r\n */\r\nP.lte = function (y) {\r\n  return this.cmp(y) < 1;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Big whose value is the value of this Big minus the value of Big y.\r\n */\r\nP.minus = P.sub = function (y) {\r\n  var i, j, t, xlty,\r\n    x = this,\r\n    Big = x.constructor,\r\n    a = x.s,\r\n    b = (y = new Big(y)).s;\r\n\r\n  // Signs differ?\r\n  if (a != b) {\r\n    y.s = -b;\r\n    return x.plus(y);\r\n  }\r\n\r\n  var xc = x.c.slice(),\r\n    xe = x.e,\r\n    yc = y.c,\r\n    ye = y.e;\r\n\r\n  // Either zero?\r\n  if (!xc[0] || !yc[0]) {\r\n    if (yc[0]) {\r\n      y.s = -b;\r\n    } else if (xc[0]) {\r\n      y = new Big(x);\r\n    } else {\r\n      y.s = 1;\r\n    }\r\n    return y;\r\n  }\r\n\r\n  // Determine which is the bigger number. Prepend zeros to equalise exponents.\r\n  if (a = xe - ye) {\r\n\r\n    if (xlty = a < 0) {\r\n      a = -a;\r\n      t = xc;\r\n    } else {\r\n      ye = xe;\r\n      t = yc;\r\n    }\r\n\r\n    t.reverse();\r\n    for (b = a; b--;) t.push(0);\r\n    t.reverse();\r\n  } else {\r\n\r\n    // Exponents equal. Check digit by digit.\r\n    j = ((xlty = xc.length < yc.length) ? xc : yc).length;\r\n\r\n    for (a = b = 0; b < j; b++) {\r\n      if (xc[b] != yc[b]) {\r\n        xlty = xc[b] < yc[b];\r\n        break;\r\n      }\r\n    }\r\n  }\r\n\r\n  // x < y? Point xc to the array of the bigger number.\r\n  if (xlty) {\r\n    t = xc;\r\n    xc = yc;\r\n    yc = t;\r\n    y.s = -y.s;\r\n  }\r\n\r\n  /*\r\n   * Append zeros to xc if shorter. No need to add zeros to yc if shorter as subtraction only\r\n   * needs to start at yc.length.\r\n   */\r\n  if ((b = (j = yc.length) - (i = xc.length)) > 0) for (; b--;) xc[i++] = 0;\r\n\r\n  // Subtract yc from xc.\r\n  for (b = i; j > a;) {\r\n    if (xc[--j] < yc[j]) {\r\n      for (i = j; i && !xc[--i];) xc[i] = 9;\r\n      --xc[i];\r\n      xc[j] += 10;\r\n    }\r\n\r\n    xc[j] -= yc[j];\r\n  }\r\n\r\n  // Remove trailing zeros.\r\n  for (; xc[--b] === 0;) xc.pop();\r\n\r\n  // Remove leading zeros and adjust exponent accordingly.\r\n  for (; xc[0] === 0;) {\r\n    xc.shift();\r\n    --ye;\r\n  }\r\n\r\n  if (!xc[0]) {\r\n\r\n    // n - n = +0\r\n    y.s = 1;\r\n\r\n    // Result must be zero.\r\n    xc = [ye = 0];\r\n  }\r\n\r\n  y.c = xc;\r\n  y.e = ye;\r\n\r\n  return y;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Big whose value is the value of this Big modulo the value of Big y.\r\n */\r\nP.mod = function (y) {\r\n  var ygtx,\r\n    x = this,\r\n    Big = x.constructor,\r\n    a = x.s,\r\n    b = (y = new Big(y)).s;\r\n\r\n  if (!y.c[0]) {\r\n    throw Error(DIV_BY_ZERO);\r\n  }\r\n\r\n  x.s = y.s = 1;\r\n  ygtx = y.cmp(x) == 1;\r\n  x.s = a;\r\n  y.s = b;\r\n\r\n  if (ygtx) return new Big(x);\r\n\r\n  a = Big.DP;\r\n  b = Big.RM;\r\n  Big.DP = Big.RM = 0;\r\n  x = x.div(y);\r\n  Big.DP = a;\r\n  Big.RM = b;\r\n\r\n  return this.minus(x.times(y));\r\n};\r\n\r\n\r\n/*\r\n * Return a new Big whose value is the value of this Big negated.\r\n */\r\nP.neg = function () {\r\n  var x = new this.constructor(this);\r\n  x.s = -x.s;\r\n  return x;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Big whose value is the value of this Big plus the value of Big y.\r\n */\r\nP.plus = P.add = function (y) {\r\n  var e, k, t,\r\n    x = this,\r\n    Big = x.constructor;\r\n\r\n  y = new Big(y);\r\n\r\n  // Signs differ?\r\n  if (x.s != y.s) {\r\n    y.s = -y.s;\r\n    return x.minus(y);\r\n  }\r\n\r\n  var xe = x.e,\r\n    xc = x.c,\r\n    ye = y.e,\r\n    yc = y.c;\r\n\r\n  // Either zero?\r\n  if (!xc[0] || !yc[0]) {\r\n    if (!yc[0]) {\r\n      if (xc[0]) {\r\n        y = new Big(x);\r\n      } else {\r\n        y.s = x.s;\r\n      }\r\n    }\r\n    return y;\r\n  }\r\n\r\n  xc = xc.slice();\r\n\r\n  // Prepend zeros to equalise exponents.\r\n  // Note: reverse faster than unshifts.\r\n  if (e = xe - ye) {\r\n    if (e > 0) {\r\n      ye = xe;\r\n      t = yc;\r\n    } else {\r\n      e = -e;\r\n      t = xc;\r\n    }\r\n\r\n    t.reverse();\r\n    for (; e--;) t.push(0);\r\n    t.reverse();\r\n  }\r\n\r\n  // Point xc to the longer array.\r\n  if (xc.length - yc.length < 0) {\r\n    t = yc;\r\n    yc = xc;\r\n    xc = t;\r\n  }\r\n\r\n  e = yc.length;\r\n\r\n  // Only start adding at yc.length - 1 as the further digits of xc can be left as they are.\r\n  for (k = 0; e; xc[e] %= 10) k = (xc[--e] = xc[e] + yc[e] + k) / 10 | 0;\r\n\r\n  // No need to check for zero, as +x + +y != 0 && -x + -y != 0\r\n\r\n  if (k) {\r\n    xc.unshift(k);\r\n    ++ye;\r\n  }\r\n\r\n  // Remove trailing zeros.\r\n  for (e = xc.length; xc[--e] === 0;) xc.pop();\r\n\r\n  y.c = xc;\r\n  y.e = ye;\r\n\r\n  return y;\r\n};\r\n\r\n\r\n/*\r\n * Return a Big whose value is the value of this Big raised to the power n.\r\n * If n is negative, round to a maximum of Big.DP decimal places using rounding\r\n * mode Big.RM.\r\n *\r\n * n {number} Integer, -MAX_POWER to MAX_POWER inclusive.\r\n */\r\nP.pow = function (n) {\r\n  var x = this,\r\n    one = new x.constructor('1'),\r\n    y = one,\r\n    isneg = n < 0;\r\n\r\n  if (n !== ~~n || n < -MAX_POWER || n > MAX_POWER) {\r\n    throw Error(INVALID + 'exponent');\r\n  }\r\n\r\n  if (isneg) n = -n;\r\n\r\n  for (;;) {\r\n    if (n & 1) y = y.times(x);\r\n    n >>= 1;\r\n    if (!n) break;\r\n    x = x.times(x);\r\n  }\r\n\r\n  return isneg ? one.div(y) : y;\r\n};\r\n\r\n\r\n/*\r\n * Return a new Big whose value is the value of this Big rounded to a maximum precision of sd\r\n * significant digits using rounding mode rm, or Big.RM if rm is not specified.\r\n *\r\n * sd {number} Significant digits: integer, 1 to MAX_DP inclusive.\r\n * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n */\r\nP.prec = function (sd, rm) {\r\n  if (sd !== ~~sd || sd < 1 || sd > MAX_DP) {\r\n    throw Error(INVALID + 'precision');\r\n  }\r\n  return round(new this.constructor(this), sd, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Big whose value is the value of this Big rounded to a maximum of dp decimal places\r\n * using rounding mode rm, or Big.RM if rm is not specified.\r\n * If dp is negative, round to an integer which is a multiple of 10**-dp.\r\n * If dp is not specified, round to 0 decimal places.\r\n *\r\n * dp? {number} Integer, -MAX_DP to MAX_DP inclusive.\r\n * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n */\r\nP.round = function (dp, rm) {\r\n  if (dp === UNDEFINED) dp = 0;\r\n  else if (dp !== ~~dp || dp < -MAX_DP || dp > MAX_DP) {\r\n    throw Error(INVALID_DP);\r\n  }\r\n  return round(new this.constructor(this), dp + this.e + 1, rm);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Big whose value is the square root of the value of this Big, rounded, if\r\n * necessary, to a maximum of Big.DP decimal places using rounding mode Big.RM.\r\n */\r\nP.sqrt = function () {\r\n  var r, c, t,\r\n    x = this,\r\n    Big = x.constructor,\r\n    s = x.s,\r\n    e = x.e,\r\n    half = new Big('0.5');\r\n\r\n  // Zero?\r\n  if (!x.c[0]) return new Big(x);\r\n\r\n  // Negative?\r\n  if (s < 0) {\r\n    throw Error(NAME + 'No square root');\r\n  }\r\n\r\n  // Estimate.\r\n  s = Math.sqrt(+stringify(x, true, true));\r\n\r\n  // Math.sqrt underflow/overflow?\r\n  // Re-estimate: pass x coefficient to Math.sqrt as integer, then adjust the result exponent.\r\n  if (s === 0 || s === 1 / 0) {\r\n    c = x.c.join('');\r\n    if (!(c.length + e & 1)) c += '0';\r\n    s = Math.sqrt(c);\r\n    e = ((e + 1) / 2 | 0) - (e < 0 || e & 1);\r\n    r = new Big((s == 1 / 0 ? '5e' : (s = s.toExponential()).slice(0, s.indexOf('e') + 1)) + e);\r\n  } else {\r\n    r = new Big(s + '');\r\n  }\r\n\r\n  e = r.e + (Big.DP += 4);\r\n\r\n  // Newton-Raphson iteration.\r\n  do {\r\n    t = r;\r\n    r = half.times(t.plus(x.div(t)));\r\n  } while (t.c.slice(0, e).join('') !== r.c.slice(0, e).join(''));\r\n\r\n  return round(r, (Big.DP -= 4) + r.e + 1, Big.RM);\r\n};\r\n\r\n\r\n/*\r\n * Return a new Big whose value is the value of this Big times the value of Big y.\r\n */\r\nP.times = P.mul = function (y) {\r\n  var c,\r\n    x = this,\r\n    Big = x.constructor,\r\n    xc = x.c,\r\n    yc = (y = new Big(y)).c,\r\n    a = xc.length,\r\n    b = yc.length,\r\n    i = x.e,\r\n    j = y.e;\r\n\r\n  // Determine sign of result.\r\n  y.s = x.s == y.s ? 1 : -1;\r\n\r\n  // Return signed 0 if either 0.\r\n  if (!xc[0] || !yc[0]) {\r\n    y.c = [y.e = 0];\r\n    return y;\r\n  }\r\n\r\n  // Initialise exponent of result as x.e + y.e.\r\n  y.e = i + j;\r\n\r\n  // If array xc has fewer digits than yc, swap xc and yc, and lengths.\r\n  if (a < b) {\r\n    c = xc;\r\n    xc = yc;\r\n    yc = c;\r\n    j = a;\r\n    a = b;\r\n    b = j;\r\n  }\r\n\r\n  // Initialise coefficient array of result with zeros.\r\n  for (c = new Array(j = a + b); j--;) c[j] = 0;\r\n\r\n  // Multiply.\r\n\r\n  // i is initially xc.length.\r\n  for (i = b; i--;) {\r\n    b = 0;\r\n\r\n    // a is yc.length.\r\n    for (j = a + i; j > i;) {\r\n\r\n      // Current sum of products at this digit position, plus carry.\r\n      b = c[j] + yc[i] * xc[j - i - 1] + b;\r\n      c[j--] = b % 10;\r\n\r\n      // carry\r\n      b = b / 10 | 0;\r\n    }\r\n\r\n    c[j] = b;\r\n  }\r\n\r\n  // Increment result exponent if there is a final carry, otherwise remove leading zero.\r\n  if (b) ++y.e;\r\n  else c.shift();\r\n\r\n  // Remove trailing zeros.\r\n  for (i = c.length; !c[--i];) c.pop();\r\n  y.c = c;\r\n\r\n  return y;\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Big in exponential notation rounded to dp fixed\r\n * decimal places using rounding mode rm, or Big.RM if rm is not specified.\r\n *\r\n * dp? {number} Decimal places: integer, 0 to MAX_DP inclusive.\r\n * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n */\r\nP.toExponential = function (dp, rm) {\r\n  var x = this,\r\n    n = x.c[0];\r\n\r\n  if (dp !== UNDEFINED) {\r\n    if (dp !== ~~dp || dp < 0 || dp > MAX_DP) {\r\n      throw Error(INVALID_DP);\r\n    }\r\n    x = round(new x.constructor(x), ++dp, rm);\r\n    for (; x.c.length < dp;) x.c.push(0);\r\n  }\r\n\r\n  return stringify(x, true, !!n);\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Big in normal notation rounded to dp fixed\r\n * decimal places using rounding mode rm, or Big.RM if rm is not specified.\r\n *\r\n * dp? {number} Decimal places: integer, 0 to MAX_DP inclusive.\r\n * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n *\r\n * (-0).toFixed(0) is '0', but (-0.1).toFixed(0) is '-0'.\r\n * (-0).toFixed(1) is '0.0', but (-0.01).toFixed(1) is '-0.0'.\r\n */\r\nP.toFixed = function (dp, rm) {\r\n  var x = this,\r\n    n = x.c[0];\r\n\r\n  if (dp !== UNDEFINED) {\r\n    if (dp !== ~~dp || dp < 0 || dp > MAX_DP) {\r\n      throw Error(INVALID_DP);\r\n    }\r\n    x = round(new x.constructor(x), dp + x.e + 1, rm);\r\n\r\n    // x.e may have changed if the value is rounded up.\r\n    for (dp = dp + x.e + 1; x.c.length < dp;) x.c.push(0);\r\n  }\r\n\r\n  return stringify(x, false, !!n);\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Big.\r\n * Return exponential notation if this Big has a positive exponent equal to or greater than\r\n * Big.PE, or a negative exponent equal to or less than Big.NE.\r\n * Omit the sign for negative zero.\r\n */\r\nP[Symbol.for('nodejs.util.inspect.custom')] = P.toJSON = P.toString = function () {\r\n  var x = this,\r\n    Big = x.constructor;\r\n  return stringify(x, x.e <= Big.NE || x.e >= Big.PE, !!x.c[0]);\r\n};\r\n\r\n\r\n/*\r\n * Return the value of this Big as a primitve number.\r\n */\r\nP.toNumber = function () {\r\n  var n = +stringify(this, true, true);\r\n  if (this.constructor.strict === true && !this.eq(n.toString())) {\r\n    throw Error(NAME + 'Imprecise conversion');\r\n  }\r\n  return n;\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Big rounded to sd significant digits using\r\n * rounding mode rm, or Big.RM if rm is not specified.\r\n * Use exponential notation if sd is less than the number of digits necessary to represent\r\n * the integer part of the value in normal notation.\r\n *\r\n * sd {number} Significant digits: integer, 1 to MAX_DP inclusive.\r\n * rm? {number} Rounding mode: 0 (down), 1 (half-up), 2 (half-even) or 3 (up).\r\n */\r\nP.toPrecision = function (sd, rm) {\r\n  var x = this,\r\n    Big = x.constructor,\r\n    n = x.c[0];\r\n\r\n  if (sd !== UNDEFINED) {\r\n    if (sd !== ~~sd || sd < 1 || sd > MAX_DP) {\r\n      throw Error(INVALID + 'precision');\r\n    }\r\n    x = round(new Big(x), sd, rm);\r\n    for (; x.c.length < sd;) x.c.push(0);\r\n  }\r\n\r\n  return stringify(x, sd <= x.e || x.e <= Big.NE || x.e >= Big.PE, !!n);\r\n};\r\n\r\n\r\n/*\r\n * Return a string representing the value of this Big.\r\n * Return exponential notation if this Big has a positive exponent equal to or greater than\r\n * Big.PE, or a negative exponent equal to or less than Big.NE.\r\n * Include the sign for negative zero.\r\n */\r\nP.valueOf = function () {\r\n  var x = this,\r\n    Big = x.constructor;\r\n  if (Big.strict === true) {\r\n    throw Error(NAME + 'valueOf disallowed');\r\n  }\r\n  return stringify(x, x.e <= Big.NE || x.e >= Big.PE, true);\r\n};\r\n\r\n\r\n// Export\r\n\r\n\r\nexport var Big = _Big_();\r\n\r\n/// <reference types=\"https://raw.githubusercontent.com/DefinitelyTyped/DefinitelyTyped/master/types/big.js/index.d.ts\" />\r\nexport default Big;\r\n","import Big from 'big.js';\nexport const NumberUtil = {\n    bigNumber(value) {\n        if (!value) {\n            return new Big(0);\n        }\n        return new Big(value);\n    },\n    multiply(a, b) {\n        if (a === undefined || b === undefined) {\n            return new Big(0);\n        }\n        const aBigNumber = new Big(a);\n        const bBigNumber = new Big(b);\n        return aBigNumber.times(bBigNumber);\n    },\n    formatNumberToLocalString(value, decimals = 2) {\n        if (value === undefined) {\n            return '0.00';\n        }\n        if (typeof value === 'number') {\n            return value.toLocaleString('en-US', {\n                maximumFractionDigits: decimals,\n                minimumFractionDigits: decimals\n            });\n        }\n        return parseFloat(value).toLocaleString('en-US', {\n            maximumFractionDigits: decimals,\n            minimumFractionDigits: decimals\n        });\n    },\n    parseLocalStringToNumber(value) {\n        if (value === undefined) {\n            return 0;\n        }\n        return parseFloat(value.replace(/,/gu, ''));\n    }\n};\n//# sourceMappingURL=NumberUtil.js.map","export const erc20ABI = [\n    {\n        type: 'function',\n        name: 'transfer',\n        stateMutability: 'nonpayable',\n        inputs: [\n            {\n                name: '_to',\n                type: 'address'\n            },\n            {\n                name: '_value',\n                type: 'uint256'\n            }\n        ],\n        outputs: [\n            {\n                name: '',\n                type: 'bool'\n            }\n        ]\n    },\n    {\n        type: 'function',\n        name: 'transferFrom',\n        stateMutability: 'nonpayable',\n        inputs: [\n            {\n                name: '_from',\n                type: 'address'\n            },\n            {\n                name: '_to',\n                type: 'address'\n            },\n            {\n                name: '_value',\n                type: 'uint256'\n            }\n        ],\n        outputs: [\n            {\n                name: '',\n                type: 'bool'\n            }\n        ]\n    }\n];\n//# sourceMappingURL=erc20.js.map","export const swapABI = [\n    {\n        type: 'function',\n        name: 'approve',\n        stateMutability: 'nonpayable',\n        inputs: [\n            { name: 'spender', type: 'address' },\n            { name: 'amount', type: 'uint256' }\n        ],\n        outputs: [{ type: 'bool' }]\n    }\n];\n//# sourceMappingURL=swap.js.map","export const usdtABI = [\n    {\n        type: 'function',\n        name: 'transfer',\n        stateMutability: 'nonpayable',\n        inputs: [\n            {\n                name: 'recipient',\n                type: 'address'\n            },\n            {\n                name: 'amount',\n                type: 'uint256'\n            }\n        ],\n        outputs: []\n    },\n    {\n        type: 'function',\n        name: 'transferFrom',\n        stateMutability: 'nonpayable',\n        inputs: [\n            {\n                name: 'sender',\n                type: 'address'\n            },\n            {\n                name: 'recipient',\n                type: 'address'\n            },\n            {\n                name: 'amount',\n                type: 'uint256'\n            }\n        ],\n        outputs: [\n            {\n                name: '',\n                type: 'bool'\n            }\n        ]\n    }\n];\n//# sourceMappingURL=usdt.js.map","import { erc20ABI } from '../contracts/erc20.js';\nimport { swapABI } from '../contracts/swap.js';\nimport { usdtABI } from '../contracts/usdt.js';\nimport { ConstantsUtil } from './ConstantsUtil.js';\nexport const ContractUtil = {\n    getERC20Abi: (tokenAddress) => {\n        if (ConstantsUtil.USDT_CONTRACT_ADDRESSES.includes(tokenAddress)) {\n            return usdtABI;\n        }\n        return erc20ABI;\n    },\n    getSwapAbi: () => swapABI\n};\n//# sourceMappingURL=ContractUtil.js.map","export const ParseUtil = {\n    validateCaipAddress(address) {\n        if (address.split(':')?.length !== 3) {\n            t