Sponsored
MoonPay
Buy, sell and swap Ethereum with MoonPay.Buy Now!
Spend less on fees, more on crypto. Buy crypto easily with MoonPay Balance. 20M+ users trust MoonPay worldwide.
MetaMask
Manage your web3 everything with MetaMask. Try Now!
Ready to onboard to Ethereum? With MetaMask, you're in control.
eToro
One-stop crypto shop: trusted, simple & safe.
Don’t invest unless you’re prepared to lose all the money you invest.
Sponsored
Сoins.game
100 free spins for registration. Spin now!
Everyday giveaways up to 100 ETH, Lucky Spins. Deposit BONUS 300% and Cashbacks!
BC.GAME
- The Best ETH Casino Claim Now!
5000+ Slots & Live Casino Games, 50+cryptos. Register with Etherscan and get 760% deposit bonus. Win Big$, withdraw it fast.
Stake
200% Bonus, 100K Daily Giveaways, Instant Withdrawals Play Now!
Slots, Roulette, Poker & more - Proud sponsors of UFC, Everton & StakeF1 team!
Sponsored
BC.GAME
- The Best ETH Casino Claim Now!
5000+ Slots & Live Casino Games, 50+cryptos. Register with Etherscan and get 760% deposit bonus. Win Big$, withdraw it fast.
CryptoSlots
Play & Get 25 Free Spins at CryptoSlots Play Now
Anonymous play on awesome games - sign up now for 25 free jackpot spins - worth $100s!
CryptoWins
200% More Funds to Play on Us up to 4 BTC! Claim Now!
100s of games, generous bonuses, 20+ years of trusted gaming. Join CryptoWins & start winning today!
ERC-20
Add Token to MetaMask (Web3)Overview
Max Total Supply
1,000,000,000,000,000 SHIRO
Holders
19
Market
Onchain Market Cap
$0.00
Circulating Supply Market Cap
-
Other Info
Token Contract (WITH 9 Decimals)
Balance
0 SHIROValue
$0.00Loading...
Loading
Loading...
Loading
Loading...
Loading
| # | Exchange | Pair | Price | 24H Volume | % Volume |
|---|
Contract Source Code Verified (Exact Match)
Contract Name:
SHIRO
Compiler Version
v0.8.26+commit.8a97fa7a
Contract Source Code (Solidity)
/**
*Submitted for verification at Etherscan.io on 2024-12-02
*/
/**
*/
// File: @openzeppelin/contracts/utils/Errors.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Errors.sol)
pragma solidity ^0.8.20;
/**
* @dev Collection of common custom errors used in multiple contracts
*
* IMPORTANT: Backwards compatibility is not guaranteed in future versions of the library.
* It is recommended to avoid relying on the error API for critical functionality.
*
* _Available since v5.1._
*/
library Errors {
/**
* @dev The ETH balance of the account is not enough to perform the operation.
*/
error InsufficientBalance(uint256 balance, uint256 needed);
/**
* @dev A call to an address target failed. The target may have reverted.
*/
error FailedCall();
/**
* @dev The deployment failed.
*/
error FailedDeployment();
/**
* @dev A necessary precompile is missing.
*/
error MissingPrecompile(address);
}
// File: @openzeppelin/contracts/proxy/Clones.sol
// OpenZeppelin Contracts (last updated v5.1.0) (proxy/Clones.sol)
pragma solidity ^0.8.20;
/**
* @dev https://eips.ethereum.org/EIPS/eip-1167[ERC-1167] is a standard for
* deploying minimal proxy contracts, also known as "clones".
*
* > To simply and cheaply clone contract functionality in an immutable way, this standard specifies
* > a minimal bytecode implementation that delegates all calls to a known, fixed address.
*
* The library includes functions to deploy a proxy using either `create` (traditional deployment) or `create2`
* (salted deterministic deployment). It also includes functions to predict the addresses of clones deployed using the
* deterministic method.
*/
library Clones {
/**
* @dev Deploys and returns the address of a clone that mimics the behaviour of `implementation`.
*
* This function uses the create opcode, which should never revert.
*/
function clone(address implementation) internal returns (address instance) {
return clone(implementation, 0);
}
/**
* @dev Same as {xref-Clones-clone-address-}[clone], but with a `value` parameter to send native currency
* to the new contract.
*
* NOTE: Using a non-zero value at creation will require the contract using this function (e.g. a factory)
* to always have enough balance for new deployments. Consider exposing this function under a payable method.
*/
function clone(address implementation, uint256 value) internal returns (address instance) {
if (address(this).balance < value) {
revert Errors.InsufficientBalance(address(this).balance, value);
}
assembly ("memory-safe") {
// Cleans the upper 96 bits of the `implementation` word, then packs the first 3 bytes
// of the `implementation` address with the bytecode before the address.
mstore(0x00, or(shr(0xe8, shl(0x60, implementation)), 0x3d602d80600a3d3981f3363d3d373d3d3d363d73000000))
// Packs the remaining 17 bytes of `implementation` with the bytecode after the address.
mstore(0x20, or(shl(0x78, implementation), 0x5af43d82803e903d91602b57fd5bf3))
instance := create(value, 0x09, 0x37)
}
if (instance == address(0)) {
revert Errors.FailedDeployment();
}
}
/**
* @dev Deploys and returns the address of a clone that mimics the behaviour of `implementation`.
*
* This function uses the create2 opcode and a `salt` to deterministically deploy
* the clone. Using the same `implementation` and `salt` multiple time will revert, since
* the clones cannot be deployed twice at the same address.
*/
function cloneDeterministic(address implementation, bytes32 salt) internal returns (address instance) {
return cloneDeterministic(implementation, salt, 0);
}
/**
* @dev Same as {xref-Clones-cloneDeterministic-address-bytes32-}[cloneDeterministic], but with
* a `value` parameter to send native currency to the new contract.
*
* NOTE: Using a non-zero value at creation will require the contract using this function (e.g. a factory)
* to always have enough balance for new deployments. Consider exposing this function under a payable method.
*/
function cloneDeterministic(
address implementation,
bytes32 salt,
uint256 value
) internal returns (address instance) {
if (address(this).balance < value) {
revert Errors.InsufficientBalance(address(this).balance, value);
}
assembly ("memory-safe") {
// Cleans the upper 96 bits of the `implementation` word, then packs the first 3 bytes
// of the `implementation` address with the bytecode before the address.
mstore(0x00, or(shr(0xe8, shl(0x60, implementation)), 0x3d602d80600a3d3981f3363d3d373d3d3d363d73000000))
// Packs the remaining 17 bytes of `implementation` with the bytecode after the address.
mstore(0x20, or(shl(0x78, implementation), 0x5af43d82803e903d91602b57fd5bf3))
instance := create2(value, 0x09, 0x37, salt)
}
if (instance == address(0)) {
revert Errors.FailedDeployment();
}
}
/**
* @dev Computes the address of a clone deployed using {Clones-cloneDeterministic}.
*/
function predictDeterministicAddress(
address implementation,
bytes32 salt,
address deployer
) internal pure returns (address predicted) {
assembly ("memory-safe") {
let ptr := mload(0x40)
mstore(add(ptr, 0x38), deployer)
mstore(add(ptr, 0x24), 0x5af43d82803e903d91602b57fd5bf3ff)
mstore(add(ptr, 0x14), implementation)
mstore(ptr, 0x3d602d80600a3d3981f3363d3d373d3d3d363d73)
mstore(add(ptr, 0x58), salt)
mstore(add(ptr, 0x78), keccak256(add(ptr, 0x0c), 0x37))
predicted := and(keccak256(add(ptr, 0x43), 0x55), 0xffffffffffffffffffffffffffffffffffffffff)
}
}
/**
* @dev Computes the address of a clone deployed using {Clones-cloneDeterministic}.
*/
function predictDeterministicAddress(
address implementation,
bytes32 salt
) internal view returns (address predicted) {
return predictDeterministicAddress(implementation, salt, address(this));
}
}
// File: @openzeppelin/contracts/utils/Base64.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Base64.sol)
pragma solidity ^0.8.20;
/**
* @dev Provides a set of functions to operate with Base64 strings.
*/
library Base64 {
/**
* @dev Base64 Encoding/Decoding Table
* See sections 4 and 5 of https://datatracker.ietf.org/doc/html/rfc4648
*/
string internal constant _TABLE = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
string internal constant _TABLE_URL = "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789-_";
/**
* @dev Converts a `bytes` to its Bytes64 `string` representation.
*/
function encode(bytes memory data) internal pure returns (string memory) {
return _encode(data, _TABLE, true);
}
/**
* @dev Converts a `bytes` to its Bytes64Url `string` representation.
* Output is not padded with `=` as specified in https://www.rfc-editor.org/rfc/rfc4648[rfc4648].
*/
function encodeURL(bytes memory data) internal pure returns (string memory) {
return _encode(data, _TABLE_URL, false);
}
/**
* @dev Internal table-agnostic conversion
*/
function _encode(bytes memory data, string memory table, bool withPadding) private pure returns (string memory) {
/**
* Inspired by Brecht Devos (Brechtpd) implementation - MIT licence
* https://github.com/Brechtpd/base64/blob/e78d9fd951e7b0977ddca77d92dc85183770daf4/base64.sol
*/
if (data.length == 0) return "";
// If padding is enabled, the final length should be `bytes` data length divided by 3 rounded up and then
// multiplied by 4 so that it leaves room for padding the last chunk
// - `data.length + 2` -> Prepare for division rounding up
// - `/ 3` -> Number of 3-bytes chunks (rounded up)
// - `4 *` -> 4 characters for each chunk
// This is equivalent to: 4 * Math.ceil(data.length / 3)
//
// If padding is disabled, the final length should be `bytes` data length multiplied by 4/3 rounded up as
// opposed to when padding is required to fill the last chunk.
// - `4 * data.length` -> 4 characters for each chunk
// - ` + 2` -> Prepare for division rounding up
// - `/ 3` -> Number of 3-bytes chunks (rounded up)
// This is equivalent to: Math.ceil((4 * data.length) / 3)
uint256 resultLength = withPadding ? 4 * ((data.length + 2) / 3) : (4 * data.length + 2) / 3;
string memory result = new string(resultLength);
assembly ("memory-safe") {
// Prepare the lookup table (skip the first "length" byte)
let tablePtr := add(table, 1)
// Prepare result pointer, jump over length
let resultPtr := add(result, 0x20)
let dataPtr := data
let endPtr := add(data, mload(data))
// In some cases, the last iteration will read bytes after the end of the data. We cache the value, and
// set it to zero to make sure no dirty bytes are read in that section.
let afterPtr := add(endPtr, 0x20)
let afterCache := mload(afterPtr)
mstore(afterPtr, 0x00)
// Run over the input, 3 bytes at a time
for {
} lt(dataPtr, endPtr) {
} {
// Advance 3 bytes
dataPtr := add(dataPtr, 3)
let input := mload(dataPtr)
// To write each character, shift the 3 byte (24 bits) chunk
// 4 times in blocks of 6 bits for each character (18, 12, 6, 0)
// and apply logical AND with 0x3F to bitmask the least significant 6 bits.
// Use this as an index into the lookup table, mload an entire word
// so the desired character is in the least significant byte, and
// mstore8 this least significant byte into the result and continue.
mstore8(resultPtr, mload(add(tablePtr, and(shr(18, input), 0x3F))))
resultPtr := add(resultPtr, 1) // Advance
mstore8(resultPtr, mload(add(tablePtr, and(shr(12, input), 0x3F))))
resultPtr := add(resultPtr, 1) // Advance
mstore8(resultPtr, mload(add(tablePtr, and(shr(6, input), 0x3F))))
resultPtr := add(resultPtr, 1) // Advance
mstore8(resultPtr, mload(add(tablePtr, and(input, 0x3F))))
resultPtr := add(resultPtr, 1) // Advance
}
// Reset the value that was cached
mstore(afterPtr, afterCache)
if withPadding {
// When data `bytes` is not exactly 3 bytes long
// it is padded with `=` characters at the end
switch mod(mload(data), 3)
case 1 {
mstore8(sub(resultPtr, 1), 0x3d)
mstore8(sub(resultPtr, 2), 0x3d)
}
case 2 {
mstore8(sub(resultPtr, 1), 0x3d)
}
}
}
return result;
}
}
// File: @openzeppelin/contracts/utils/Comparators.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Comparators.sol)
pragma solidity ^0.8.20;
/**
* @dev Provides a set of functions to compare values.
*
* _Available since v5.1._
*/
library Comparators {
function lt(uint256 a, uint256 b) internal pure returns (bool) {
return a < b;
}
function gt(uint256 a, uint256 b) internal pure returns (bool) {
return a > b;
}
}
// File: @openzeppelin/contracts/utils/SlotDerivation.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/SlotDerivation.sol)
// This file was procedurally generated from scripts/generate/templates/SlotDerivation.js.
pragma solidity ^0.8.20;
/**
* @dev Library for computing storage (and transient storage) locations from namespaces and deriving slots
* corresponding to standard patterns. The derivation method for array and mapping matches the storage layout used by
* the solidity language / compiler.
*
* See https://docs.soliditylang.org/en/v0.8.20/internals/layout_in_storage.html#mappings-and-dynamic-arrays[Solidity docs for mappings and dynamic arrays.].
*
* Example usage:
* ```solidity
* contract Example {
* // Add the library methods
* using StorageSlot for bytes32;
* using SlotDerivation for bytes32;
*
* // Declare a namespace
* string private constant _NAMESPACE = "<namespace>" // eg. OpenZeppelin.Slot
*
* function setValueInNamespace(uint256 key, address newValue) internal {
* _NAMESPACE.erc7201Slot().deriveMapping(key).getAddressSlot().value = newValue;
* }
*
* function getValueInNamespace(uint256 key) internal view returns (address) {
* return _NAMESPACE.erc7201Slot().deriveMapping(key).getAddressSlot().value;
* }
* }
* ```
*
* TIP: Consider using this library along with {StorageSlot}.
*
* NOTE: This library provides a way to manipulate storage locations in a non-standard way. Tooling for checking
* upgrade safety will ignore the slots accessed through this library.
*
* _Available since v5.1._
*/
library SlotDerivation {
/**
* @dev Derive an ERC-7201 slot from a string (namespace).
*/
function erc7201Slot(string memory namespace) internal pure returns (bytes32 slot) {
assembly ("memory-safe") {
mstore(0x00, sub(keccak256(add(namespace, 0x20), mload(namespace)), 1))
slot := and(keccak256(0x00, 0x20), not(0xff))
}
}
/**
* @dev Add an offset to a slot to get the n-th element of a structure or an array.
*/
function offset(bytes32 slot, uint256 pos) internal pure returns (bytes32 result) {
unchecked {
return bytes32(uint256(slot) + pos);
}
}
/**
* @dev Derive the location of the first element in an array from the slot where the length is stored.
*/
function deriveArray(bytes32 slot) internal pure returns (bytes32 result) {
assembly ("memory-safe") {
mstore(0x00, slot)
result := keccak256(0x00, 0x20)
}
}
/**
* @dev Derive the location of a mapping element from the key.
*/
function deriveMapping(bytes32 slot, address key) internal pure returns (bytes32 result) {
assembly ("memory-safe") {
mstore(0x00, and(key, shr(96, not(0))))
mstore(0x20, slot)
result := keccak256(0x00, 0x40)
}
}
/**
* @dev Derive the location of a mapping element from the key.
*/
function deriveMapping(bytes32 slot, bool key) internal pure returns (bytes32 result) {
assembly ("memory-safe") {
mstore(0x00, iszero(iszero(key)))
mstore(0x20, slot)
result := keccak256(0x00, 0x40)
}
}
/**
* @dev Derive the location of a mapping element from the key.
*/
function deriveMapping(bytes32 slot, bytes32 key) internal pure returns (bytes32 result) {
assembly ("memory-safe") {
mstore(0x00, key)
mstore(0x20, slot)
result := keccak256(0x00, 0x40)
}
}
/**
* @dev Derive the location of a mapping element from the key.
*/
function deriveMapping(bytes32 slot, uint256 key) internal pure returns (bytes32 result) {
assembly ("memory-safe") {
mstore(0x00, key)
mstore(0x20, slot)
result := keccak256(0x00, 0x40)
}
}
/**
* @dev Derive the location of a mapping element from the key.
*/
function deriveMapping(bytes32 slot, int256 key) internal pure returns (bytes32 result) {
assembly ("memory-safe") {
mstore(0x00, key)
mstore(0x20, slot)
result := keccak256(0x00, 0x40)
}
}
/**
* @dev Derive the location of a mapping element from the key.
*/
function deriveMapping(bytes32 slot, string memory key) internal pure returns (bytes32 result) {
assembly ("memory-safe") {
let length := mload(key)
let begin := add(key, 0x20)
let end := add(begin, length)
let cache := mload(end)
mstore(end, slot)
result := keccak256(begin, add(length, 0x20))
mstore(end, cache)
}
}
/**
* @dev Derive the location of a mapping element from the key.
*/
function deriveMapping(bytes32 slot, bytes memory key) internal pure returns (bytes32 result) {
assembly ("memory-safe") {
let length := mload(key)
let begin := add(key, 0x20)
let end := add(begin, length)
let cache := mload(end)
mstore(end, slot)
result := keccak256(begin, add(length, 0x20))
mstore(end, cache)
}
}
}
// File: @openzeppelin/contracts/utils/StorageSlot.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/StorageSlot.sol)
// This file was procedurally generated from scripts/generate/templates/StorageSlot.js.
pragma solidity ^0.8.20;
/**
* @dev Library for reading and writing primitive types to specific storage slots.
*
* Storage slots are often used to avoid storage conflict when dealing with upgradeable contracts.
* This library helps with reading and writing to such slots without the need for inline assembly.
*
* The functions in this library return Slot structs that contain a `value` member that can be used to read or write.
*
* Example usage to set ERC-1967 implementation slot:
* ```solidity
* contract ERC1967 {
* // Define the slot. Alternatively, use the SlotDerivation library to derive the slot.
* bytes32 internal constant _IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;
*
* function _getImplementation() internal view returns (address) {
* return StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value;
* }
*
* function _setImplementation(address newImplementation) internal {
* require(newImplementation.code.length > 0);
* StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value = newImplementation;
* }
* }
* ```
*
* TIP: Consider using this library along with {SlotDerivation}.
*/
library StorageSlot {
struct AddressSlot {
address value;
}
struct BooleanSlot {
bool value;
}
struct Bytes32Slot {
bytes32 value;
}
struct Uint256Slot {
uint256 value;
}
struct Int256Slot {
int256 value;
}
struct StringSlot {
string value;
}
struct BytesSlot {
bytes value;
}
/**
* @dev Returns an `AddressSlot` with member `value` located at `slot`.
*/
function getAddressSlot(bytes32 slot) internal pure returns (AddressSlot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns a `BooleanSlot` with member `value` located at `slot`.
*/
function getBooleanSlot(bytes32 slot) internal pure returns (BooleanSlot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns a `Bytes32Slot` with member `value` located at `slot`.
*/
function getBytes32Slot(bytes32 slot) internal pure returns (Bytes32Slot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns a `Uint256Slot` with member `value` located at `slot`.
*/
function getUint256Slot(bytes32 slot) internal pure returns (Uint256Slot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns a `Int256Slot` with member `value` located at `slot`.
*/
function getInt256Slot(bytes32 slot) internal pure returns (Int256Slot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns a `StringSlot` with member `value` located at `slot`.
*/
function getStringSlot(bytes32 slot) internal pure returns (StringSlot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns an `StringSlot` representation of the string storage pointer `store`.
*/
function getStringSlot(string storage store) internal pure returns (StringSlot storage r) {
assembly ("memory-safe") {
r.slot := store.slot
}
}
/**
* @dev Returns a `BytesSlot` with member `value` located at `slot`.
*/
function getBytesSlot(bytes32 slot) internal pure returns (BytesSlot storage r) {
assembly ("memory-safe") {
r.slot := slot
}
}
/**
* @dev Returns an `BytesSlot` representation of the bytes storage pointer `store`.
*/
function getBytesSlot(bytes storage store) internal pure returns (BytesSlot storage r) {
assembly ("memory-safe") {
r.slot := store.slot
}
}
}
// File: @openzeppelin/contracts/utils/Panic.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Panic.sol)
pragma solidity ^0.8.20;
/**
* @dev Helper library for emitting standardized panic codes.
*
* ```solidity
* contract Example {
* using Panic for uint256;
*
* // Use any of the declared internal constants
* function foo() { Panic.GENERIC.panic(); }
*
* // Alternatively
* function foo() { Panic.panic(Panic.GENERIC); }
* }
* ```
*
* Follows the list from https://github.com/ethereum/solidity/blob/v0.8.24/libsolutil/ErrorCodes.h[libsolutil].
*
* _Available since v5.1._
*/
// slither-disable-next-line unused-state
library Panic {
/// @dev generic / unspecified error
uint256 internal constant GENERIC = 0x00;
/// @dev used by the assert() builtin
uint256 internal constant ASSERT = 0x01;
/// @dev arithmetic underflow or overflow
uint256 internal constant UNDER_OVERFLOW = 0x11;
/// @dev division or modulo by zero
uint256 internal constant DIVISION_BY_ZERO = 0x12;
/// @dev enum conversion error
uint256 internal constant ENUM_CONVERSION_ERROR = 0x21;
/// @dev invalid encoding in storage
uint256 internal constant STORAGE_ENCODING_ERROR = 0x22;
/// @dev empty array pop
uint256 internal constant EMPTY_ARRAY_POP = 0x31;
/// @dev array out of bounds access
uint256 internal constant ARRAY_OUT_OF_BOUNDS = 0x32;
/// @dev resource error (too large allocation or too large array)
uint256 internal constant RESOURCE_ERROR = 0x41;
/// @dev calling invalid internal function
uint256 internal constant INVALID_INTERNAL_FUNCTION = 0x51;
/// @dev Reverts with a panic code. Recommended to use with
/// the internal constants with predefined codes.
function panic(uint256 code) internal pure {
assembly ("memory-safe") {
mstore(0x00, 0x4e487b71)
mstore(0x20, code)
revert(0x1c, 0x24)
}
}
}
// File: @openzeppelin/contracts/utils/math/SafeCast.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/SafeCast.sol)
// This file was procedurally generated from scripts/generate/templates/SafeCast.js.
pragma solidity ^0.8.20;
/**
* @dev Wrappers over Solidity's uintXX/intXX/bool casting operators with added overflow
* checks.
*
* Downcasting from uint256/int256 in Solidity does not revert on overflow. This can
* easily result in undesired exploitation or bugs, since developers usually
* assume that overflows raise errors. `SafeCast` restores this intuition by
* reverting the transaction when such an operation overflows.
*
* Using this library instead of the unchecked operations eliminates an entire
* class of bugs, so it's recommended to use it always.
*/
library SafeCast {
/**
* @dev Value doesn't fit in an uint of `bits` size.
*/
error SafeCastOverflowedUintDowncast(uint8 bits, uint256 value);
/**
* @dev An int value doesn't fit in an uint of `bits` size.
*/
error SafeCastOverflowedIntToUint(int256 value);
/**
* @dev Value doesn't fit in an int of `bits` size.
*/
error SafeCastOverflowedIntDowncast(uint8 bits, int256 value);
/**
* @dev An uint value doesn't fit in an int of `bits` size.
*/
error SafeCastOverflowedUintToInt(uint256 value);
/**
* @dev Returns the downcasted uint248 from uint256, reverting on
* overflow (when the input is greater than largest uint248).
*
* Counterpart to Solidity's `uint248` operator.
*
* Requirements:
*
* - input must fit into 248 bits
*/
function toUint248(uint256 value) internal pure returns (uint248) {
if (value > type(uint248).max) {
revert SafeCastOverflowedUintDowncast(248, value);
}
return uint248(value);
}
/**
* @dev Returns the downcasted uint240 from uint256, reverting on
* overflow (when the input is greater than largest uint240).
*
* Counterpart to Solidity's `uint240` operator.
*
* Requirements:
*
* - input must fit into 240 bits
*/
function toUint240(uint256 value) internal pure returns (uint240) {
if (value > type(uint240).max) {
revert SafeCastOverflowedUintDowncast(240, value);
}
return uint240(value);
}
/**
* @dev Returns the downcasted uint232 from uint256, reverting on
* overflow (when the input is greater than largest uint232).
*
* Counterpart to Solidity's `uint232` operator.
*
* Requirements:
*
* - input must fit into 232 bits
*/
function toUint232(uint256 value) internal pure returns (uint232) {
if (value > type(uint232).max) {
revert SafeCastOverflowedUintDowncast(232, value);
}
return uint232(value);
}
/**
* @dev Returns the downcasted uint224 from uint256, reverting on
* overflow (when the input is greater than largest uint224).
*
* Counterpart to Solidity's `uint224` operator.
*
* Requirements:
*
* - input must fit into 224 bits
*/
function toUint224(uint256 value) internal pure returns (uint224) {
if (value > type(uint224).max) {
revert SafeCastOverflowedUintDowncast(224, value);
}
return uint224(value);
}
/**
* @dev Returns the downcasted uint216 from uint256, reverting on
* overflow (when the input is greater than largest uint216).
*
* Counterpart to Solidity's `uint216` operator.
*
* Requirements:
*
* - input must fit into 216 bits
*/
function toUint216(uint256 value) internal pure returns (uint216) {
if (value > type(uint216).max) {
revert SafeCastOverflowedUintDowncast(216, value);
}
return uint216(value);
}
/**
* @dev Returns the downcasted uint208 from uint256, reverting on
* overflow (when the input is greater than largest uint208).
*
* Counterpart to Solidity's `uint208` operator.
*
* Requirements:
*
* - input must fit into 208 bits
*/
function toUint208(uint256 value) internal pure returns (uint208) {
if (value > type(uint208).max) {
revert SafeCastOverflowedUintDowncast(208, value);
}
return uint208(value);
}
/**
* @dev Returns the downcasted uint200 from uint256, reverting on
* overflow (when the input is greater than largest uint200).
*
* Counterpart to Solidity's `uint200` operator.
*
* Requirements:
*
* - input must fit into 200 bits
*/
function toUint200(uint256 value) internal pure returns (uint200) {
if (value > type(uint200).max) {
revert SafeCastOverflowedUintDowncast(200, value);
}
return uint200(value);
}
/**
* @dev Returns the downcasted uint192 from uint256, reverting on
* overflow (when the input is greater than largest uint192).
*
* Counterpart to Solidity's `uint192` operator.
*
* Requirements:
*
* - input must fit into 192 bits
*/
function toUint192(uint256 value) internal pure returns (uint192) {
if (value > type(uint192).max) {
revert SafeCastOverflowedUintDowncast(192, value);
}
return uint192(value);
}
/**
* @dev Returns the downcasted uint184 from uint256, reverting on
* overflow (when the input is greater than largest uint184).
*
* Counterpart to Solidity's `uint184` operator.
*
* Requirements:
*
* - input must fit into 184 bits
*/
function toUint184(uint256 value) internal pure returns (uint184) {
if (value > type(uint184).max) {
revert SafeCastOverflowedUintDowncast(184, value);
}
return uint184(value);
}
/**
* @dev Returns the downcasted uint176 from uint256, reverting on
* overflow (when the input is greater than largest uint176).
*
* Counterpart to Solidity's `uint176` operator.
*
* Requirements:
*
* - input must fit into 176 bits
*/
function toUint176(uint256 value) internal pure returns (uint176) {
if (value > type(uint176).max) {
revert SafeCastOverflowedUintDowncast(176, value);
}
return uint176(value);
}
/**
* @dev Returns the downcasted uint168 from uint256, reverting on
* overflow (when the input is greater than largest uint168).
*
* Counterpart to Solidity's `uint168` operator.
*
* Requirements:
*
* - input must fit into 168 bits
*/
function toUint168(uint256 value) internal pure returns (uint168) {
if (value > type(uint168).max) {
revert SafeCastOverflowedUintDowncast(168, value);
}
return uint168(value);
}
/**
* @dev Returns the downcasted uint160 from uint256, reverting on
* overflow (when the input is greater than largest uint160).
*
* Counterpart to Solidity's `uint160` operator.
*
* Requirements:
*
* - input must fit into 160 bits
*/
function toUint160(uint256 value) internal pure returns (uint160) {
if (value > type(uint160).max) {
revert SafeCastOverflowedUintDowncast(160, value);
}
return uint160(value);
}
/**
* @dev Returns the downcasted uint152 from uint256, reverting on
* overflow (when the input is greater than largest uint152).
*
* Counterpart to Solidity's `uint152` operator.
*
* Requirements:
*
* - input must fit into 152 bits
*/
function toUint152(uint256 value) internal pure returns (uint152) {
if (value > type(uint152).max) {
revert SafeCastOverflowedUintDowncast(152, value);
}
return uint152(value);
}
/**
* @dev Returns the downcasted uint144 from uint256, reverting on
* overflow (when the input is greater than largest uint144).
*
* Counterpart to Solidity's `uint144` operator.
*
* Requirements:
*
* - input must fit into 144 bits
*/
function toUint144(uint256 value) internal pure returns (uint144) {
if (value > type(uint144).max) {
revert SafeCastOverflowedUintDowncast(144, value);
}
return uint144(value);
}
/**
* @dev Returns the downcasted uint136 from uint256, reverting on
* overflow (when the input is greater than largest uint136).
*
* Counterpart to Solidity's `uint136` operator.
*
* Requirements:
*
* - input must fit into 136 bits
*/
function toUint136(uint256 value) internal pure returns (uint136) {
if (value > type(uint136).max) {
revert SafeCastOverflowedUintDowncast(136, value);
}
return uint136(value);
}
/**
* @dev Returns the downcasted uint128 from uint256, reverting on
* overflow (when the input is greater than largest uint128).
*
* Counterpart to Solidity's `uint128` operator.
*
* Requirements:
*
* - input must fit into 128 bits
*/
function toUint128(uint256 value) internal pure returns (uint128) {
if (value > type(uint128).max) {
revert SafeCastOverflowedUintDowncast(128, value);
}
return uint128(value);
}
/**
* @dev Returns the downcasted uint120 from uint256, reverting on
* overflow (when the input is greater than largest uint120).
*
* Counterpart to Solidity's `uint120` operator.
*
* Requirements:
*
* - input must fit into 120 bits
*/
function toUint120(uint256 value) internal pure returns (uint120) {
if (value > type(uint120).max) {
revert SafeCastOverflowedUintDowncast(120, value);
}
return uint120(value);
}
/**
* @dev Returns the downcasted uint112 from uint256, reverting on
* overflow (when the input is greater than largest uint112).
*
* Counterpart to Solidity's `uint112` operator.
*
* Requirements:
*
* - input must fit into 112 bits
*/
function toUint112(uint256 value) internal pure returns (uint112) {
if (value > type(uint112).max) {
revert SafeCastOverflowedUintDowncast(112, value);
}
return uint112(value);
}
/**
* @dev Returns the downcasted uint104 from uint256, reverting on
* overflow (when the input is greater than largest uint104).
*
* Counterpart to Solidity's `uint104` operator.
*
* Requirements:
*
* - input must fit into 104 bits
*/
function toUint104(uint256 value) internal pure returns (uint104) {
if (value > type(uint104).max) {
revert SafeCastOverflowedUintDowncast(104, value);
}
return uint104(value);
}
/**
* @dev Returns the downcasted uint96 from uint256, reverting on
* overflow (when the input is greater than largest uint96).
*
* Counterpart to Solidity's `uint96` operator.
*
* Requirements:
*
* - input must fit into 96 bits
*/
function toUint96(uint256 value) internal pure returns (uint96) {
if (value > type(uint96).max) {
revert SafeCastOverflowedUintDowncast(96, value);
}
return uint96(value);
}
/**
* @dev Returns the downcasted uint88 from uint256, reverting on
* overflow (when the input is greater than largest uint88).
*
* Counterpart to Solidity's `uint88` operator.
*
* Requirements:
*
* - input must fit into 88 bits
*/
function toUint88(uint256 value) internal pure returns (uint88) {
if (value > type(uint88).max) {
revert SafeCastOverflowedUintDowncast(88, value);
}
return uint88(value);
}
/**
* @dev Returns the downcasted uint80 from uint256, reverting on
* overflow (when the input is greater than largest uint80).
*
* Counterpart to Solidity's `uint80` operator.
*
* Requirements:
*
* - input must fit into 80 bits
*/
function toUint80(uint256 value) internal pure returns (uint80) {
if (value > type(uint80).max) {
revert SafeCastOverflowedUintDowncast(80, value);
}
return uint80(value);
}
/**
* @dev Returns the downcasted uint72 from uint256, reverting on
* overflow (when the input is greater than largest uint72).
*
* Counterpart to Solidity's `uint72` operator.
*
* Requirements:
*
* - input must fit into 72 bits
*/
function toUint72(uint256 value) internal pure returns (uint72) {
if (value > type(uint72).max) {
revert SafeCastOverflowedUintDowncast(72, value);
}
return uint72(value);
}
/**
* @dev Returns the downcasted uint64 from uint256, reverting on
* overflow (when the input is greater than largest uint64).
*
* Counterpart to Solidity's `uint64` operator.
*
* Requirements:
*
* - input must fit into 64 bits
*/
function toUint64(uint256 value) internal pure returns (uint64) {
if (value > type(uint64).max) {
revert SafeCastOverflowedUintDowncast(64, value);
}
return uint64(value);
}
/**
* @dev Returns the downcasted uint56 from uint256, reverting on
* overflow (when the input is greater than largest uint56).
*
* Counterpart to Solidity's `uint56` operator.
*
* Requirements:
*
* - input must fit into 56 bits
*/
function toUint56(uint256 value) internal pure returns (uint56) {
if (value > type(uint56).max) {
revert SafeCastOverflowedUintDowncast(56, value);
}
return uint56(value);
}
/**
* @dev Returns the downcasted uint48 from uint256, reverting on
* overflow (when the input is greater than largest uint48).
*
* Counterpart to Solidity's `uint48` operator.
*
* Requirements:
*
* - input must fit into 48 bits
*/
function toUint48(uint256 value) internal pure returns (uint48) {
if (value > type(uint48).max) {
revert SafeCastOverflowedUintDowncast(48, value);
}
return uint48(value);
}
/**
* @dev Returns the downcasted uint40 from uint256, reverting on
* overflow (when the input is greater than largest uint40).
*
* Counterpart to Solidity's `uint40` operator.
*
* Requirements:
*
* - input must fit into 40 bits
*/
function toUint40(uint256 value) internal pure returns (uint40) {
if (value > type(uint40).max) {
revert SafeCastOverflowedUintDowncast(40, value);
}
return uint40(value);
}
/**
* @dev Returns the downcasted uint32 from uint256, reverting on
* overflow (when the input is greater than largest uint32).
*
* Counterpart to Solidity's `uint32` operator.
*
* Requirements:
*
* - input must fit into 32 bits
*/
function toUint32(uint256 value) internal pure returns (uint32) {
if (value > type(uint32).max) {
revert SafeCastOverflowedUintDowncast(32, value);
}
return uint32(value);
}
/**
* @dev Returns the downcasted uint24 from uint256, reverting on
* overflow (when the input is greater than largest uint24).
*
* Counterpart to Solidity's `uint24` operator.
*
* Requirements:
*
* - input must fit into 24 bits
*/
function toUint24(uint256 value) internal pure returns (uint24) {
if (value > type(uint24).max) {
revert SafeCastOverflowedUintDowncast(24, value);
}
return uint24(value);
}
/**
* @dev Returns the downcasted uint16 from uint256, reverting on
* overflow (when the input is greater than largest uint16).
*
* Counterpart to Solidity's `uint16` operator.
*
* Requirements:
*
* - input must fit into 16 bits
*/
function toUint16(uint256 value) internal pure returns (uint16) {
if (value > type(uint16).max) {
revert SafeCastOverflowedUintDowncast(16, value);
}
return uint16(value);
}
/**
* @dev Returns the downcasted uint8 from uint256, reverting on
* overflow (when the input is greater than largest uint8).
*
* Counterpart to Solidity's `uint8` operator.
*
* Requirements:
*
* - input must fit into 8 bits
*/
function toUint8(uint256 value) internal pure returns (uint8) {
if (value > type(uint8).max) {
revert SafeCastOverflowedUintDowncast(8, value);
}
return uint8(value);
}
/**
* @dev Converts a signed int256 into an unsigned uint256.
*
* Requirements:
*
* - input must be greater than or equal to 0.
*/
function toUint256(int256 value) internal pure returns (uint256) {
if (value < 0) {
revert SafeCastOverflowedIntToUint(value);
}
return uint256(value);
}
/**
* @dev Returns the downcasted int248 from int256, reverting on
* overflow (when the input is less than smallest int248 or
* greater than largest int248).
*
* Counterpart to Solidity's `int248` operator.
*
* Requirements:
*
* - input must fit into 248 bits
*/
function toInt248(int256 value) internal pure returns (int248 downcasted) {
downcasted = int248(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(248, value);
}
}
/**
* @dev Returns the downcasted int240 from int256, reverting on
* overflow (when the input is less than smallest int240 or
* greater than largest int240).
*
* Counterpart to Solidity's `int240` operator.
*
* Requirements:
*
* - input must fit into 240 bits
*/
function toInt240(int256 value) internal pure returns (int240 downcasted) {
downcasted = int240(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(240, value);
}
}
/**
* @dev Returns the downcasted int232 from int256, reverting on
* overflow (when the input is less than smallest int232 or
* greater than largest int232).
*
* Counterpart to Solidity's `int232` operator.
*
* Requirements:
*
* - input must fit into 232 bits
*/
function toInt232(int256 value) internal pure returns (int232 downcasted) {
downcasted = int232(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(232, value);
}
}
/**
* @dev Returns the downcasted int224 from int256, reverting on
* overflow (when the input is less than smallest int224 or
* greater than largest int224).
*
* Counterpart to Solidity's `int224` operator.
*
* Requirements:
*
* - input must fit into 224 bits
*/
function toInt224(int256 value) internal pure returns (int224 downcasted) {
downcasted = int224(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(224, value);
}
}
/**
* @dev Returns the downcasted int216 from int256, reverting on
* overflow (when the input is less than smallest int216 or
* greater than largest int216).
*
* Counterpart to Solidity's `int216` operator.
*
* Requirements:
*
* - input must fit into 216 bits
*/
function toInt216(int256 value) internal pure returns (int216 downcasted) {
downcasted = int216(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(216, value);
}
}
/**
* @dev Returns the downcasted int208 from int256, reverting on
* overflow (when the input is less than smallest int208 or
* greater than largest int208).
*
* Counterpart to Solidity's `int208` operator.
*
* Requirements:
*
* - input must fit into 208 bits
*/
function toInt208(int256 value) internal pure returns (int208 downcasted) {
downcasted = int208(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(208, value);
}
}
/**
* @dev Returns the downcasted int200 from int256, reverting on
* overflow (when the input is less than smallest int200 or
* greater than largest int200).
*
* Counterpart to Solidity's `int200` operator.
*
* Requirements:
*
* - input must fit into 200 bits
*/
function toInt200(int256 value) internal pure returns (int200 downcasted) {
downcasted = int200(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(200, value);
}
}
/**
* @dev Returns the downcasted int192 from int256, reverting on
* overflow (when the input is less than smallest int192 or
* greater than largest int192).
*
* Counterpart to Solidity's `int192` operator.
*
* Requirements:
*
* - input must fit into 192 bits
*/
function toInt192(int256 value) internal pure returns (int192 downcasted) {
downcasted = int192(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(192, value);
}
}
/**
* @dev Returns the downcasted int184 from int256, reverting on
* overflow (when the input is less than smallest int184 or
* greater than largest int184).
*
* Counterpart to Solidity's `int184` operator.
*
* Requirements:
*
* - input must fit into 184 bits
*/
function toInt184(int256 value) internal pure returns (int184 downcasted) {
downcasted = int184(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(184, value);
}
}
/**
* @dev Returns the downcasted int176 from int256, reverting on
* overflow (when the input is less than smallest int176 or
* greater than largest int176).
*
* Counterpart to Solidity's `int176` operator.
*
* Requirements:
*
* - input must fit into 176 bits
*/
function toInt176(int256 value) internal pure returns (int176 downcasted) {
downcasted = int176(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(176, value);
}
}
/**
* @dev Returns the downcasted int168 from int256, reverting on
* overflow (when the input is less than smallest int168 or
* greater than largest int168).
*
* Counterpart to Solidity's `int168` operator.
*
* Requirements:
*
* - input must fit into 168 bits
*/
function toInt168(int256 value) internal pure returns (int168 downcasted) {
downcasted = int168(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(168, value);
}
}
/**
* @dev Returns the downcasted int160 from int256, reverting on
* overflow (when the input is less than smallest int160 or
* greater than largest int160).
*
* Counterpart to Solidity's `int160` operator.
*
* Requirements:
*
* - input must fit into 160 bits
*/
function toInt160(int256 value) internal pure returns (int160 downcasted) {
downcasted = int160(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(160, value);
}
}
/**
* @dev Returns the downcasted int152 from int256, reverting on
* overflow (when the input is less than smallest int152 or
* greater than largest int152).
*
* Counterpart to Solidity's `int152` operator.
*
* Requirements:
*
* - input must fit into 152 bits
*/
function toInt152(int256 value) internal pure returns (int152 downcasted) {
downcasted = int152(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(152, value);
}
}
/**
* @dev Returns the downcasted int144 from int256, reverting on
* overflow (when the input is less than smallest int144 or
* greater than largest int144).
*
* Counterpart to Solidity's `int144` operator.
*
* Requirements:
*
* - input must fit into 144 bits
*/
function toInt144(int256 value) internal pure returns (int144 downcasted) {
downcasted = int144(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(144, value);
}
}
/**
* @dev Returns the downcasted int136 from int256, reverting on
* overflow (when the input is less than smallest int136 or
* greater than largest int136).
*
* Counterpart to Solidity's `int136` operator.
*
* Requirements:
*
* - input must fit into 136 bits
*/
function toInt136(int256 value) internal pure returns (int136 downcasted) {
downcasted = int136(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(136, value);
}
}
/**
* @dev Returns the downcasted int128 from int256, reverting on
* overflow (when the input is less than smallest int128 or
* greater than largest int128).
*
* Counterpart to Solidity's `int128` operator.
*
* Requirements:
*
* - input must fit into 128 bits
*/
function toInt128(int256 value) internal pure returns (int128 downcasted) {
downcasted = int128(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(128, value);
}
}
/**
* @dev Returns the downcasted int120 from int256, reverting on
* overflow (when the input is less than smallest int120 or
* greater than largest int120).
*
* Counterpart to Solidity's `int120` operator.
*
* Requirements:
*
* - input must fit into 120 bits
*/
function toInt120(int256 value) internal pure returns (int120 downcasted) {
downcasted = int120(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(120, value);
}
}
/**
* @dev Returns the downcasted int112 from int256, reverting on
* overflow (when the input is less than smallest int112 or
* greater than largest int112).
*
* Counterpart to Solidity's `int112` operator.
*
* Requirements:
*
* - input must fit into 112 bits
*/
function toInt112(int256 value) internal pure returns (int112 downcasted) {
downcasted = int112(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(112, value);
}
}
/**
* @dev Returns the downcasted int104 from int256, reverting on
* overflow (when the input is less than smallest int104 or
* greater than largest int104).
*
* Counterpart to Solidity's `int104` operator.
*
* Requirements:
*
* - input must fit into 104 bits
*/
function toInt104(int256 value) internal pure returns (int104 downcasted) {
downcasted = int104(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(104, value);
}
}
/**
* @dev Returns the downcasted int96 from int256, reverting on
* overflow (when the input is less than smallest int96 or
* greater than largest int96).
*
* Counterpart to Solidity's `int96` operator.
*
* Requirements:
*
* - input must fit into 96 bits
*/
function toInt96(int256 value) internal pure returns (int96 downcasted) {
downcasted = int96(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(96, value);
}
}
/**
* @dev Returns the downcasted int88 from int256, reverting on
* overflow (when the input is less than smallest int88 or
* greater than largest int88).
*
* Counterpart to Solidity's `int88` operator.
*
* Requirements:
*
* - input must fit into 88 bits
*/
function toInt88(int256 value) internal pure returns (int88 downcasted) {
downcasted = int88(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(88, value);
}
}
/**
* @dev Returns the downcasted int80 from int256, reverting on
* overflow (when the input is less than smallest int80 or
* greater than largest int80).
*
* Counterpart to Solidity's `int80` operator.
*
* Requirements:
*
* - input must fit into 80 bits
*/
function toInt80(int256 value) internal pure returns (int80 downcasted) {
downcasted = int80(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(80, value);
}
}
/**
* @dev Returns the downcasted int72 from int256, reverting on
* overflow (when the input is less than smallest int72 or
* greater than largest int72).
*
* Counterpart to Solidity's `int72` operator.
*
* Requirements:
*
* - input must fit into 72 bits
*/
function toInt72(int256 value) internal pure returns (int72 downcasted) {
downcasted = int72(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(72, value);
}
}
/**
* @dev Returns the downcasted int64 from int256, reverting on
* overflow (when the input is less than smallest int64 or
* greater than largest int64).
*
* Counterpart to Solidity's `int64` operator.
*
* Requirements:
*
* - input must fit into 64 bits
*/
function toInt64(int256 value) internal pure returns (int64 downcasted) {
downcasted = int64(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(64, value);
}
}
/**
* @dev Returns the downcasted int56 from int256, reverting on
* overflow (when the input is less than smallest int56 or
* greater than largest int56).
*
* Counterpart to Solidity's `int56` operator.
*
* Requirements:
*
* - input must fit into 56 bits
*/
function toInt56(int256 value) internal pure returns (int56 downcasted) {
downcasted = int56(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(56, value);
}
}
/**
* @dev Returns the downcasted int48 from int256, reverting on
* overflow (when the input is less than smallest int48 or
* greater than largest int48).
*
* Counterpart to Solidity's `int48` operator.
*
* Requirements:
*
* - input must fit into 48 bits
*/
function toInt48(int256 value) internal pure returns (int48 downcasted) {
downcasted = int48(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(48, value);
}
}
/**
* @dev Returns the downcasted int40 from int256, reverting on
* overflow (when the input is less than smallest int40 or
* greater than largest int40).
*
* Counterpart to Solidity's `int40` operator.
*
* Requirements:
*
* - input must fit into 40 bits
*/
function toInt40(int256 value) internal pure returns (int40 downcasted) {
downcasted = int40(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(40, value);
}
}
/**
* @dev Returns the downcasted int32 from int256, reverting on
* overflow (when the input is less than smallest int32 or
* greater than largest int32).
*
* Counterpart to Solidity's `int32` operator.
*
* Requirements:
*
* - input must fit into 32 bits
*/
function toInt32(int256 value) internal pure returns (int32 downcasted) {
downcasted = int32(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(32, value);
}
}
/**
* @dev Returns the downcasted int24 from int256, reverting on
* overflow (when the input is less than smallest int24 or
* greater than largest int24).
*
* Counterpart to Solidity's `int24` operator.
*
* Requirements:
*
* - input must fit into 24 bits
*/
function toInt24(int256 value) internal pure returns (int24 downcasted) {
downcasted = int24(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(24, value);
}
}
/**
* @dev Returns the downcasted int16 from int256, reverting on
* overflow (when the input is less than smallest int16 or
* greater than largest int16).
*
* Counterpart to Solidity's `int16` operator.
*
* Requirements:
*
* - input must fit into 16 bits
*/
function toInt16(int256 value) internal pure returns (int16 downcasted) {
downcasted = int16(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(16, value);
}
}
/**
* @dev Returns the downcasted int8 from int256, reverting on
* overflow (when the input is less than smallest int8 or
* greater than largest int8).
*
* Counterpart to Solidity's `int8` operator.
*
* Requirements:
*
* - input must fit into 8 bits
*/
function toInt8(int256 value) internal pure returns (int8 downcasted) {
downcasted = int8(value);
if (downcasted != value) {
revert SafeCastOverflowedIntDowncast(8, value);
}
}
/**
* @dev Converts an unsigned uint256 into a signed int256.
*
* Requirements:
*
* - input must be less than or equal to maxInt256.
*/
function toInt256(uint256 value) internal pure returns (int256) {
// Note: Unsafe cast below is okay because `type(int256).max` is guaranteed to be positive
if (value > uint256(type(int256).max)) {
revert SafeCastOverflowedUintToInt(value);
}
return int256(value);
}
/**
* @dev Cast a boolean (false or true) to a uint256 (0 or 1) with no jump.
*/
function toUint(bool b) internal pure returns (uint256 u) {
assembly ("memory-safe") {
u := iszero(iszero(b))
}
}
}
// File: @openzeppelin/contracts/utils/math/Math.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/math/Math.sol)
pragma solidity ^0.8.20;
/**
* @dev Standard math utilities missing in the Solidity language.
*/
library Math {
enum Rounding {
Floor, // Toward negative infinity
Ceil, // Toward positive infinity
Trunc, // Toward zero
Expand // Away from zero
}
/**
* @dev Returns the addition of two unsigned integers, with an success flag (no overflow).
*/
function tryAdd(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
uint256 c = a + b;
if (c < a) return (false, 0);
return (true, c);
}
}
/**
* @dev Returns the subtraction of two unsigned integers, with an success flag (no overflow).
*/
function trySub(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
if (b > a) return (false, 0);
return (true, a - b);
}
}
/**
* @dev Returns the multiplication of two unsigned integers, with an success flag (no overflow).
*/
function tryMul(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
// Gas optimization: this is cheaper than requiring 'a' not being zero, but the
// benefit is lost if 'b' is also tested.
// See: https://github.com/OpenZeppelin/openzeppelin-contracts/pull/522
if (a == 0) return (true, 0);
uint256 c = a * b;
if (c / a != b) return (false, 0);
return (true, c);
}
}
/**
* @dev Returns the division of two unsigned integers, with a success flag (no division by zero).
*/
function tryDiv(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
if (b == 0) return (false, 0);
return (true, a / b);
}
}
/**
* @dev Returns the remainder of dividing two unsigned integers, with a success flag (no division by zero).
*/
function tryMod(uint256 a, uint256 b) internal pure returns (bool success, uint256 result) {
unchecked {
if (b == 0) return (false, 0);
return (true, a % b);
}
}
/**
* @dev Branchless ternary evaluation for `a ? b : c`. Gas costs are constant.
*
* IMPORTANT: This function may reduce bytecode size and consume less gas when used standalone.
* However, the compiler may optimize Solidity ternary operations (i.e. `a ? b : c`) to only compute
* one branch when needed, making this function more expensive.
*/
function ternary(bool condition, uint256 a, uint256 b) internal pure returns (uint256) {
unchecked {
// branchless ternary works because:
// b ^ (a ^ b) == a
// b ^ 0 == b
return b ^ ((a ^ b) * SafeCast.toUint(condition));
}
}
/**
* @dev Returns the largest of two numbers.
*/
function max(uint256 a, uint256 b) internal pure returns (uint256) {
return ternary(a > b, a, b);
}
/**
* @dev Returns the smallest of two numbers.
*/
function min(uint256 a, uint256 b) internal pure returns (uint256) {
return ternary(a < b, a, b);
}
/**
* @dev Returns the average of two numbers. The result is rounded towards
* zero.
*/
function average(uint256 a, uint256 b) internal pure returns (uint256) {
// (a + b) / 2 can overflow.
return (a & b) + (a ^ b) / 2;
}
/**
* @dev Returns the ceiling of the division of two numbers.
*
* This differs from standard division with `/` in that it rounds towards infinity instead
* of rounding towards zero.
*/
function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
if (b == 0) {
// Guarantee the same behavior as in a regular Solidity division.
Panic.panic(Panic.DIVISION_BY_ZERO);
}
// The following calculation ensures accurate ceiling division without overflow.
// Since a is non-zero, (a - 1) / b will not overflow.
// The largest possible result occurs when (a - 1) / b is type(uint256).max,
// but the largest value we can obtain is type(uint256).max - 1, which happens
// when a = type(uint256).max and b = 1.
unchecked {
return SafeCast.toUint(a > 0) * ((a - 1) / b + 1);
}
}
/**
* @dev Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or
* denominator == 0.
*
* Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv) with further edits by
* Uniswap Labs also under MIT license.
*/
function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {
unchecked {
// 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2²⁵⁶ and mod 2²⁵⁶ - 1, then use
// the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
// variables such that product = prod1 * 2²⁵⁶ + prod0.
uint256 prod0 = x * y; // Least significant 256 bits of the product
uint256 prod1; // Most significant 256 bits of the product
assembly {
let mm := mulmod(x, y, not(0))
prod1 := sub(sub(mm, prod0), lt(mm, prod0))
}
// Handle non-overflow cases, 256 by 256 division.
if (prod1 == 0) {
// Solidity will revert if denominator == 0, unlike the div opcode on its own.
// The surrounding unchecked block does not change this fact.
// See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic.
return prod0 / denominator;
}
// Make sure the result is less than 2²⁵⁶. Also prevents denominator == 0.
if (denominator <= prod1) {
Panic.panic(ternary(denominator == 0, Panic.DIVISION_BY_ZERO, Panic.UNDER_OVERFLOW));
}
///////////////////////////////////////////////
// 512 by 256 division.
///////////////////////////////////////////////
// Make division exact by subtracting the remainder from [prod1 prod0].
uint256 remainder;
assembly {
// Compute remainder using mulmod.
remainder := mulmod(x, y, denominator)
// Subtract 256 bit number from 512 bit number.
prod1 := sub(prod1, gt(remainder, prod0))
prod0 := sub(prod0, remainder)
}
// Factor powers of two out of denominator and compute largest power of two divisor of denominator.
// Always >= 1. See https://cs.stackexchange.com/q/138556/92363.
uint256 twos = denominator & (0 - denominator);
assembly {
// Divide denominator by twos.
denominator := div(denominator, twos)
// Divide [prod1 prod0] by twos.
prod0 := div(prod0, twos)
// Flip twos such that it is 2²⁵⁶ / twos. If twos is zero, then it becomes one.
twos := add(div(sub(0, twos), twos), 1)
}
// Shift in bits from prod1 into prod0.
prod0 |= prod1 * twos;
// Invert denominator mod 2²⁵⁶. Now that denominator is an odd number, it has an inverse modulo 2²⁵⁶ such
// that denominator * inv ≡ 1 mod 2²⁵⁶. Compute the inverse by starting with a seed that is correct for
// four bits. That is, denominator * inv ≡ 1 mod 2⁴.
uint256 inverse = (3 * denominator) ^ 2;
// Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also
// works in modular arithmetic, doubling the correct bits in each step.
inverse *= 2 - denominator * inverse; // inverse mod 2⁸
inverse *= 2 - denominator * inverse; // inverse mod 2¹⁶
inverse *= 2 - denominator * inverse; // inverse mod 2³²
inverse *= 2 - denominator * inverse; // inverse mod 2⁶⁴
inverse *= 2 - denominator * inverse; // inverse mod 2¹²⁸
inverse *= 2 - denominator * inverse; // inverse mod 2²⁵⁶
// Because the division is now exact we can divide by multiplying with the modular inverse of denominator.
// This will give us the correct result modulo 2²⁵⁶. Since the preconditions guarantee that the outcome is
// less than 2²⁵⁶, this is the final result. We don't need to compute the high bits of the result and prod1
// is no longer required.
result = prod0 * inverse;
return result;
}
}
/**
* @dev Calculates x * y / denominator with full precision, following the selected rounding direction.
*/
function mulDiv(uint256 x, uint256 y, uint256 denominator, Rounding rounding) internal pure returns (uint256) {
return mulDiv(x, y, denominator) + SafeCast.toUint(unsignedRoundsUp(rounding) && mulmod(x, y, denominator) > 0);
}
/**
* @dev Calculate the modular multiplicative inverse of a number in Z/nZ.
*
* If n is a prime, then Z/nZ is a field. In that case all elements are inversible, except 0.
* If n is not a prime, then Z/nZ is not a field, and some elements might not be inversible.
*
* If the input value is not inversible, 0 is returned.
*
* NOTE: If you know for sure that n is (big) a prime, it may be cheaper to use Fermat's little theorem and get the
* inverse using `Math.modExp(a, n - 2, n)`. See {invModPrime}.
*/
function invMod(uint256 a, uint256 n) internal pure returns (uint256) {
unchecked {
if (n == 0) return 0;
// The inverse modulo is calculated using the Extended Euclidean Algorithm (iterative version)
// Used to compute integers x and y such that: ax + ny = gcd(a, n).
// When the gcd is 1, then the inverse of a modulo n exists and it's x.
// ax + ny = 1
// ax = 1 + (-y)n
// ax ≡ 1 (mod n) # x is the inverse of a modulo n
// If the remainder is 0 the gcd is n right away.
uint256 remainder = a % n;
uint256 gcd = n;
// Therefore the initial coefficients are:
// ax + ny = gcd(a, n) = n
// 0a + 1n = n
int256 x = 0;
int256 y = 1;
while (remainder != 0) {
uint256 quotient = gcd / remainder;
(gcd, remainder) = (
// The old remainder is the next gcd to try.
remainder,
// Compute the next remainder.
// Can't overflow given that (a % gcd) * (gcd // (a % gcd)) <= gcd
// where gcd is at most n (capped to type(uint256).max)
gcd - remainder * quotient
);
(x, y) = (
// Increment the coefficient of a.
y,
// Decrement the coefficient of n.
// Can overflow, but the result is casted to uint256 so that the
// next value of y is "wrapped around" to a value between 0 and n - 1.
x - y * int256(quotient)
);
}
if (gcd != 1) return 0; // No inverse exists.
return ternary(x < 0, n - uint256(-x), uint256(x)); // Wrap the result if it's negative.
}
}
/**
* @dev Variant of {invMod}. More efficient, but only works if `p` is known to be a prime greater than `2`.
*
* From https://en.wikipedia.org/wiki/Fermat%27s_little_theorem[Fermat's little theorem], we know that if p is
* prime, then `a**(p-1) ≡ 1 mod p`. As a consequence, we have `a * a**(p-2) ≡ 1 mod p`, which means that
* `a**(p-2)` is the modular multiplicative inverse of a in Fp.
*
* NOTE: this function does NOT check that `p` is a prime greater than `2`.
*/
function invModPrime(uint256 a, uint256 p) internal view returns (uint256) {
unchecked {
return Math.modExp(a, p - 2, p);
}
}
/**
* @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m)
*
* Requirements:
* - modulus can't be zero
* - underlying staticcall to precompile must succeed
*
* IMPORTANT: The result is only valid if the underlying call succeeds. When using this function, make
* sure the chain you're using it on supports the precompiled contract for modular exponentiation
* at address 0x05 as specified in https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise,
* the underlying function will succeed given the lack of a revert, but the result may be incorrectly
* interpreted as 0.
*/
function modExp(uint256 b, uint256 e, uint256 m) internal view returns (uint256) {
(bool success, uint256 result) = tryModExp(b, e, m);
if (!success) {
Panic.panic(Panic.DIVISION_BY_ZERO);
}
return result;
}
/**
* @dev Returns the modular exponentiation of the specified base, exponent and modulus (b ** e % m).
* It includes a success flag indicating if the operation succeeded. Operation will be marked as failed if trying
* to operate modulo 0 or if the underlying precompile reverted.
*
* IMPORTANT: The result is only valid if the success flag is true. When using this function, make sure the chain
* you're using it on supports the precompiled contract for modular exponentiation at address 0x05 as specified in
* https://eips.ethereum.org/EIPS/eip-198[EIP-198]. Otherwise, the underlying function will succeed given the lack
* of a revert, but the result may be incorrectly interpreted as 0.
*/
function tryModExp(uint256 b, uint256 e, uint256 m) internal view returns (bool success, uint256 result) {
if (m == 0) return (false, 0);
assembly ("memory-safe") {
let ptr := mload(0x40)
// | Offset | Content | Content (Hex) |
// |-----------|------------|--------------------------------------------------------------------|
// | 0x00:0x1f | size of b | 0x0000000000000000000000000000000000000000000000000000000000000020 |
// | 0x20:0x3f | size of e | 0x0000000000000000000000000000000000000000000000000000000000000020 |
// | 0x40:0x5f | size of m | 0x0000000000000000000000000000000000000000000000000000000000000020 |
// | 0x60:0x7f | value of b | 0x<.............................................................b> |
// | 0x80:0x9f | value of e | 0x<.............................................................e> |
// | 0xa0:0xbf | value of m | 0x<.............................................................m> |
mstore(ptr, 0x20)
mstore(add(ptr, 0x20), 0x20)
mstore(add(ptr, 0x40), 0x20)
mstore(add(ptr, 0x60), b)
mstore(add(ptr, 0x80), e)
mstore(add(ptr, 0xa0), m)
// Given the result < m, it's guaranteed to fit in 32 bytes,
// so we can use the memory scratch space located at offset 0.
success := staticcall(gas(), 0x05, ptr, 0xc0, 0x00, 0x20)
result := mload(0x00)
}
}
/**
* @dev Variant of {modExp} that supports inputs of arbitrary length.
*/
function modExp(bytes memory b, bytes memory e, bytes memory m) internal view returns (bytes memory) {
(bool success, bytes memory result) = tryModExp(b, e, m);
if (!success) {
Panic.panic(Panic.DIVISION_BY_ZERO);
}
return result;
}
/**
* @dev Variant of {tryModExp} that supports inputs of arbitrary length.
*/
function tryModExp(
bytes memory b,
bytes memory e,
bytes memory m
) internal view returns (bool success, bytes memory result) {
if (_zeroBytes(m)) return (false, new bytes(0));
uint256 mLen = m.length;
// Encode call args in result and move the free memory pointer
result = abi.encodePacked(b.length, e.length, mLen, b, e, m);
assembly ("memory-safe") {
let dataPtr := add(result, 0x20)
// Write result on top of args to avoid allocating extra memory.
success := staticcall(gas(), 0x05, dataPtr, mload(result), dataPtr, mLen)
// Overwrite the length.
// result.length > returndatasize() is guaranteed because returndatasize() == m.length
mstore(result, mLen)
// Set the memory pointer after the returned data.
mstore(0x40, add(dataPtr, mLen))
}
}
/**
* @dev Returns whether the provided byte array is zero.
*/
function _zeroBytes(bytes memory byteArray) private pure returns (bool) {
for (uint256 i = 0; i < byteArray.length; ++i) {
if (byteArray[i] != 0) {
return false;
}
}
return true;
}
/**
* @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded
* towards zero.
*
* This method is based on Newton's method for computing square roots; the algorithm is restricted to only
* using integer operations.
*/
function sqrt(uint256 a) internal pure returns (uint256) {
unchecked {
// Take care of easy edge cases when a == 0 or a == 1
if (a <= 1) {
return a;
}
// In this function, we use Newton's method to get a root of `f(x) := x² - a`. It involves building a
// sequence x_n that converges toward sqrt(a). For each iteration x_n, we also define the error between
// the current value as `ε_n = | x_n - sqrt(a) |`.
//
// For our first estimation, we consider `e` the smallest power of 2 which is bigger than the square root
// of the target. (i.e. `2**(e-1) ≤ sqrt(a) < 2**e`). We know that `e ≤ 128` because `(2¹²⁸)² = 2²⁵⁶` is
// bigger than any uint256.
//
// By noticing that
// `2**(e-1) ≤ sqrt(a) < 2**e → (2**(e-1))² ≤ a < (2**e)² → 2**(2*e-2) ≤ a < 2**(2*e)`
// we can deduce that `e - 1` is `log2(a) / 2`. We can thus compute `x_n = 2**(e-1)` using a method similar
// to the msb function.
uint256 aa = a;
uint256 xn = 1;
if (aa >= (1 << 128)) {
aa >>= 128;
xn <<= 64;
}
if (aa >= (1 << 64)) {
aa >>= 64;
xn <<= 32;
}
if (aa >= (1 << 32)) {
aa >>= 32;
xn <<= 16;
}
if (aa >= (1 << 16)) {
aa >>= 16;
xn <<= 8;
}
if (aa >= (1 << 8)) {
aa >>= 8;
xn <<= 4;
}
if (aa >= (1 << 4)) {
aa >>= 4;
xn <<= 2;
}
if (aa >= (1 << 2)) {
xn <<= 1;
}
// We now have x_n such that `x_n = 2**(e-1) ≤ sqrt(a) < 2**e = 2 * x_n`. This implies ε_n ≤ 2**(e-1).
//
// We can refine our estimation by noticing that the middle of that interval minimizes the error.
// If we move x_n to equal 2**(e-1) + 2**(e-2), then we reduce the error to ε_n ≤ 2**(e-2).
// This is going to be our x_0 (and ε_0)
xn = (3 * xn) >> 1; // ε_0 := | x_0 - sqrt(a) | ≤ 2**(e-2)
// From here, Newton's method give us:
// x_{n+1} = (x_n + a / x_n) / 2
//
// One should note that:
// x_{n+1}² - a = ((x_n + a / x_n) / 2)² - a
// = ((x_n² + a) / (2 * x_n))² - a
// = (x_n⁴ + 2 * a * x_n² + a²) / (4 * x_n²) - a
// = (x_n⁴ + 2 * a * x_n² + a² - 4 * a * x_n²) / (4 * x_n²)
// = (x_n⁴ - 2 * a * x_n² + a²) / (4 * x_n²)
// = (x_n² - a)² / (2 * x_n)²
// = ((x_n² - a) / (2 * x_n))²
// ≥ 0
// Which proves that for all n ≥ 1, sqrt(a) ≤ x_n
//
// This gives us the proof of quadratic convergence of the sequence:
// ε_{n+1} = | x_{n+1} - sqrt(a) |
// = | (x_n + a / x_n) / 2 - sqrt(a) |
// = | (x_n² + a - 2*x_n*sqrt(a)) / (2 * x_n) |
// = | (x_n - sqrt(a))² / (2 * x_n) |
// = | ε_n² / (2 * x_n) |
// = ε_n² / | (2 * x_n) |
//
// For the first iteration, we have a special case where x_0 is known:
// ε_1 = ε_0² / | (2 * x_0) |
// ≤ (2**(e-2))² / (2 * (2**(e-1) + 2**(e-2)))
// ≤ 2**(2*e-4) / (3 * 2**(e-1))
// ≤ 2**(e-3) / 3
// ≤ 2**(e-3-log2(3))
// ≤ 2**(e-4.5)
//
// For the following iterations, we use the fact that, 2**(e-1) ≤ sqrt(a) ≤ x_n:
// ε_{n+1} = ε_n² / | (2 * x_n) |
// ≤ (2**(e-k))² / (2 * 2**(e-1))
// ≤ 2**(2*e-2*k) / 2**e
// ≤ 2**(e-2*k)
xn = (xn + a / xn) >> 1; // ε_1 := | x_1 - sqrt(a) | ≤ 2**(e-4.5) -- special case, see above
xn = (xn + a / xn) >> 1; // ε_2 := | x_2 - sqrt(a) | ≤ 2**(e-9) -- general case with k = 4.5
xn = (xn + a / xn) >> 1; // ε_3 := | x_3 - sqrt(a) | ≤ 2**(e-18) -- general case with k = 9
xn = (xn + a / xn) >> 1; // ε_4 := | x_4 - sqrt(a) | ≤ 2**(e-36) -- general case with k = 18
xn = (xn + a / xn) >> 1; // ε_5 := | x_5 - sqrt(a) | ≤ 2**(e-72) -- general case with k = 36
xn = (xn + a / xn) >> 1; // ε_6 := | x_6 - sqrt(a) | ≤ 2**(e-144) -- general case with k = 72
// Because e ≤ 128 (as discussed during the first estimation phase), we know have reached a precision
// ε_6 ≤ 2**(e-144) < 1. Given we're operating on integers, then we can ensure that xn is now either
// sqrt(a) or sqrt(a) + 1.
return xn - SafeCast.toUint(xn > a / xn);
}
}
/**
* @dev Calculates sqrt(a), following the selected rounding direction.
*/
function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {
unchecked {
uint256 result = sqrt(a);
return result + SafeCast.toUint(unsignedRoundsUp(rounding) && result * result < a);
}
}
/**
* @dev Return the log in base 2 of a positive value rounded towards zero.
* Returns 0 if given 0.
*/
function log2(uint256 value) internal pure returns (uint256) {
uint256 result = 0;
uint256 exp;
unchecked {
exp = 128 * SafeCast.toUint(value > (1 << 128) - 1);
value >>= exp;
result += exp;
exp = 64 * SafeCast.toUint(value > (1 << 64) - 1);
value >>= exp;
result += exp;
exp = 32 * SafeCast.toUint(value > (1 << 32) - 1);
value >>= exp;
result += exp;
exp = 16 * SafeCast.toUint(value > (1 << 16) - 1);
value >>= exp;
result += exp;
exp = 8 * SafeCast.toUint(value > (1 << 8) - 1);
value >>= exp;
result += exp;
exp = 4 * SafeCast.toUint(value > (1 << 4) - 1);
value >>= exp;
result += exp;
exp = 2 * SafeCast.toUint(value > (1 << 2) - 1);
value >>= exp;
result += exp;
result += SafeCast.toUint(value > 1);
}
return result;
}
/**
* @dev Return the log in base 2, following the selected rounding direction, of a positive value.
* Returns 0 if given 0.
*/
function log2(uint256 value, Rounding rounding) internal pure returns (uint256) {
unchecked {
uint256 result = log2(value);
return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << result < value);
}
}
/**
* @dev Return the log in base 10 of a positive value rounded towards zero.
* Returns 0 if given 0.
*/
function log10(uint256 value) internal pure returns (uint256) {
uint256 result = 0;
unchecked {
if (value >= 10 ** 64) {
value /= 10 ** 64;
result += 64;
}
if (value >= 10 ** 32) {
value /= 10 ** 32;
result += 32;
}
if (value >= 10 ** 16) {
value /= 10 ** 16;
result += 16;
}
if (value >= 10 ** 8) {
value /= 10 ** 8;
result += 8;
}
if (value >= 10 ** 4) {
value /= 10 ** 4;
result += 4;
}
if (value >= 10 ** 2) {
value /= 10 ** 2;
result += 2;
}
if (value >= 10 ** 1) {
result += 1;
}
}
return result;
}
/**
* @dev Return the log in base 10, following the selected rounding direction, of a positive value.
* Returns 0 if given 0.
*/
function log10(uint256 value, Rounding rounding) internal pure returns (uint256) {
unchecked {
uint256 result = log10(value);
return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 10 ** result < value);
}
}
/**
* @dev Return the log in base 256 of a positive value rounded towards zero.
* Returns 0 if given 0.
*
* Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
*/
function log256(uint256 value) internal pure returns (uint256) {
uint256 result = 0;
uint256 isGt;
unchecked {
isGt = SafeCast.toUint(value > (1 << 128) - 1);
value >>= isGt * 128;
result += isGt * 16;
isGt = SafeCast.toUint(value > (1 << 64) - 1);
value >>= isGt * 64;
result += isGt * 8;
isGt = SafeCast.toUint(value > (1 << 32) - 1);
value >>= isGt * 32;
result += isGt * 4;
isGt = SafeCast.toUint(value > (1 << 16) - 1);
value >>= isGt * 16;
result += isGt * 2;
result += SafeCast.toUint(value > (1 << 8) - 1);
}
return result;
}
/**
* @dev Return the log in base 256, following the selected rounding direction, of a positive value.
* Returns 0 if given 0.
*/
function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {
unchecked {
uint256 result = log256(value);
return result + SafeCast.toUint(unsignedRoundsUp(rounding) && 1 << (result << 3) < value);
}
}
/**
* @dev Returns whether a provided rounding mode is considered rounding up for unsigned integers.
*/
function unsignedRoundsUp(Rounding rounding) internal pure returns (bool) {
return uint8(rounding) % 2 == 1;
}
}
// File: @openzeppelin/contracts/utils/Arrays.sol
// OpenZeppelin Contracts (last updated v5.1.0) (utils/Arrays.sol)
// This file was procedurally generated from scripts/generate/templates/Arrays.js.
pragma solidity ^0.8.20;
/**
* @dev Collection of functions related to array types.
*/
library Arrays {
using SlotDerivation for bytes32;
using StorageSlot for bytes32;
/**
* @dev Sort an array of uint256 (in memory) following the provided comparator function.
*
* This function does the sorting "in place", meaning that it overrides the input. The object is returned for
* convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.
*
* NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the
* array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful
* when executing this as part of a transaction. If the array being sorted is too large, the sort operation may
* consume more gas than is available in a block, leading to potential DoS.
*
* IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.
*/
function sort(
uint256[] memory array,
function(uint256, uint256) pure returns (bool) comp
) internal pure returns (uint256[] memory) {
_quickSort(_begin(array), _end(array), comp);
return array;
}
/**
* @dev Variant of {sort} that sorts an array of uint256 in increasing order.
*/
function sort(uint256[] memory array) internal pure returns (uint256[] memory) {
sort(array, Comparators.lt);
return array;
}
/**
* @dev Sort an array of address (in memory) following the provided comparator function.
*
* This function does the sorting "in place", meaning that it overrides the input. The object is returned for
* convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.
*
* NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the
* array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful
* when executing this as part of a transaction. If the array being sorted is too large, the sort operation may
* consume more gas than is available in a block, leading to potential DoS.
*
* IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.
*/
function sort(
address[] memory array,
function(address, address) pure returns (bool) comp
) internal pure returns (address[] memory) {
sort(_castToUint256Array(array), _castToUint256Comp(comp));
return array;
}
/**
* @dev Variant of {sort} that sorts an array of address in increasing order.
*/
function sort(address[] memory array) internal pure returns (address[] memory) {
sort(_castToUint256Array(array), Comparators.lt);
return array;
}
/**
* @dev Sort an array of bytes32 (in memory) following the provided comparator function.
*
* This function does the sorting "in place", meaning that it overrides the input. The object is returned for
* convenience, but that returned value can be discarded safely if the caller has a memory pointer to the array.
*
* NOTE: this function's cost is `O(n · log(n))` in average and `O(n²)` in the worst case, with n the length of the
* array. Using it in view functions that are executed through `eth_call` is safe, but one should be very careful
* when executing this as part of a transaction. If the array being sorted is too large, the sort operation may
* consume more gas than is available in a block, leading to potential DoS.
*
* IMPORTANT: Consider memory side-effects when using custom comparator functions that access memory in an unsafe way.
*/
function sort(
bytes32[] memory array,
function(bytes32, bytes32) pure returns (bool) comp
) internal pure returns (bytes32[] memory) {
sort(_castToUint256Array(array), _castToUint256Comp(comp));
return array;
}
/**
* @dev Variant of {sort} that sorts an array of bytes32 in increasing order.
*/
function sort(bytes32[] memory array) internal pure returns (bytes32[] memory) {
sort(_castToUint256Array(array), Comparators.lt);
return array;
}
/**
* @dev Performs a quick sort of a segment of memory. The segment sorted starts at `begin` (inclusive), and stops
* at end (exclusive). Sorting follows the `comp` comparator.
*
* Invariant: `begin <= end`. This is the case when initially called by {sort} and is preserved in subcalls.
*
* IMPORTANT: Memory locations between `begin` and `end` are not validated/zeroed. This function should
* be used only if the limits are within a memory array.
*/
function _quickSort(uint256 begin, uint256 end, function(uint256, uint256) pure returns (bool) comp) private pure {
unchecked {
if (end - begin < 0x40) return;
// Use first element as pivot
uint256 pivot = _mload(begin);
// Position where the pivot should be at the end of the loop
uint256 pos = begin;
for (uint256 it = begin + 0x20; it < end; it += 0x20) {
if (comp(_mload(it), pivot)) {
// If the value stored at the iterator's position comes before the pivot, we increment the
// position of the pivot and move the value there.
pos += 0x20;
_swap(pos, it);
}
}
_swap(begin, pos); // Swap pivot into place
_quickSort(begin, pos, comp); // Sort the left side of the pivot
_quickSort(pos + 0x20, end, comp); // Sort the right side of the pivot
}
}
/**
* @dev Pointer to the memory location of the first element of `array`.
*/
function _begin(uint256[] memory array) private pure returns (uint256 ptr) {
assembly ("memory-safe") {
ptr := add(array, 0x20)
}
}
/**
* @dev Pointer to the memory location of the first memory word (32bytes) after `array`. This is the memory word
* that comes just after the last element of the array.
*/
function _end(uint256[] memory array) private pure returns (uint256 ptr) {
unchecked {
return _begin(array) + array.length * 0x20;
}
}
/**
* @dev Load memory word (as a uint256) at location `ptr`.
*/
function _mload(uint256 ptr) private pure returns (uint256 value) {
assembly {
value := mload(ptr)
}
}
/**
* @dev Swaps the elements memory location `ptr1` and `ptr2`.
*/
function _swap(uint256 ptr1, uint256 ptr2) private pure {
assembly {
let value1 := mload(ptr1)
let value2 := mload(ptr2)
mstore(ptr1, value2)
mstore(ptr2, value1)
}
}
/// @dev Helper: low level cast address memory array to uint256 memory array
function _castToUint256Array(address[] memory input) private pure returns (uint256[] memory output) {
assembly {
output := input
}
}
/// @dev Helper: low level cast bytes32 memory array to uint256 memory array
function _castToUint256Array(bytes32[] memory input) private pure returns (uint256[] memory output) {
assembly {
output := input
}
}
/// @dev Helper: low level cast address comp function to uint256 comp function
function _castToUint256Comp(
function(address, address) pure returns (bool) input
) private pure returns (function(uint256, uint256) pure returns (bool) output) {
assembly {
output := input
}
}
/// @dev Helper: low level cast bytes32 comp function to uint256 comp function
function _castToUint256Comp(
function(bytes32, bytes32) pure returns (bool) input
) private pure returns (function(uint256, uint256) pure returns (bool) output) {
assembly {
output := input
}
}
/**
* @dev Searches a sorted `array` and returns the first index that contains
* a value greater or equal to `element`. If no such index exists (i.e. all
* values in the array are strictly less than `element`), the array length is
* returned. Time complexity O(log n).
*
* NOTE: The `array` is expected to be sorted in ascending order, and to
* contain no repeated elements.
*
* IMPORTANT: Deprecated. This implementation behaves as {lowerBound} but lacks
* support for repeated elements in the array. The {lowerBound} function should
* be used instead.
*/
function findUpperBound(uint256[] storage array, uint256 element) internal view returns (uint256) {
uint256 low = 0;
uint256 high = array.length;
if (high == 0) {
return 0;
}
while (low < high) {
uint256 mid = Math.average(low, high);
// Note that mid will always be strictly less than high (i.e. it will be a valid array index)
// because Math.average rounds towards zero (it does integer division with truncation).
if (unsafeAccess(array, mid).value > element) {
high = mid;
} else {
low = mid + 1;
}
}
// At this point `low` is the exclusive upper bound. We will return the inclusive upper bound.
if (low > 0 && unsafeAccess(array, low - 1).value == element) {
return low - 1;
} else {
return low;
}
}
/**
* @dev Searches an `array` sorted in ascending order and returns the first
* index that contains a value greater or equal than `element`. If no such index
* exists (i.e. all values in the array are strictly less than `element`), the array
* length is returned. Time complexity O(log n).
*
* See C++'s https://en.cppreference.com/w/cpp/algorithm/lower_bound[lower_bound].
*/
function lowerBound(uint256[] storage array, uint256 element) internal view returns (uint256) {
uint256 low = 0;
uint256 high = array.length;
if (high == 0) {
return 0;
}
while (low < high) {
uint256 mid = Math.average(low, high);
// Note that mid will always be strictly less than high (i.e. it will be a valid array index)
// because Math.average rounds towards zero (it does integer division with truncation).
if (unsafeAccess(array, mid).value < element) {
// this cannot overflow because mid < high
unchecked {
low = mid + 1;
}
} else {
high = mid;
}
}
return low;
}
/**
* @dev Searches an `array` sorted in ascending order and returns the first
* index that contains a value strictly greater than `element`. If no such index
* exists (i.e. all values in the array are strictly less than `element`), the array
* length is returned. Time complexity O(log n).
*
* See C++'s https://en.cppreference.com/w/cpp/algorithm/upper_bound[upper_bound].
*/
function upperBound(uint256[] storage array, uint256 element) internal view returns (uint256) {
uint256 low = 0;
uint256 high = array.length;
if (high == 0) {
return 0;
}
while (low < high) {
uint256 mid = Math.average(low, high);
// Note that mid will always be strictly less than high (i.e. it will be a valid array index)
// because Math.average rounds towards zero (it does integer division with truncation).
if (unsafeAccess(array, mid).value > element) {
high = mid;
} else {
// this cannot overflow because mid < high
unchecked {
low = mid + 1;
}
}
}
return low;
}
/**
* @dev Same as {lowerBound}, but with an array in memory.
*/
function lowerBoundMemory(uint256[] memory array, uint256 element) internal pure returns (uint256) {
uint256 low = 0;
uint256 high = array.length;
if (high == 0) {
return 0;
}
while (low < high) {
uint256 mid = Math.average(low, high);
// Note that mid will always be strictly less than high (i.e. it will be a valid array index)
// because Math.average rounds towards zero (it does integer division with truncation).
if (unsafeMemoryAccess(array, mid) < element) {
// this cannot overflow because mid < high
unchecked {
low = mid + 1;
}
} else {
high = mid;
}
}
return low;
}
/**
* @dev Same as {upperBound}, but with an array in memory.
*/
function upperBoundMemory(uint256[] memory array, uint256 element) internal pure returns (uint256) {
uint256 low = 0;
uint256 high = array.length;
if (high == 0) {
return 0;
}
while (low < high) {
uint256 mid = Math.average(low, high);
// Note that mid will always be strictly less than high (i.e. it will be a valid array index)
// because Math.average rounds towards zero (it does integer division with truncation).
if (unsafeMemoryAccess(array, mid) > element) {
high = mid;
} else {
// this cannot overflow because mid < high
unchecked {
low = mid + 1;
}
}
}
return low;
}
/**
* @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
*
* WARNING: Only use if you are certain `pos` is lower than the array length.
*/
function unsafeAccess(address[] storage arr, uint256 pos) internal pure returns (StorageSlot.AddressSlot storage) {
bytes32 slot;
assembly ("memory-safe") {
slot := arr.slot
}
return slot.deriveArray().offset(pos).getAddressSlot();
}
/**
* @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
*
* WARNING: Only use if you are certain `pos` is lower than the array length.
*/
function unsafeAccess(bytes32[] storage arr, uint256 pos) internal pure returns (StorageSlot.Bytes32Slot storage) {
bytes32 slot;
assembly ("memory-safe") {
slot := arr.slot
}
return slot.deriveArray().offset(pos).getBytes32Slot();
}
/**
* @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
*
* WARNING: Only use if you are certain `pos` is lower than the array length.
*/
function unsafeAccess(uint256[] storage arr, uint256 pos) internal pure returns (StorageSlot.Uint256Slot storage) {
bytes32 slot;
assembly ("memory-safe") {
slot := arr.slot
}
return slot.deriveArray().offset(pos).getUint256Slot();
}
/**
* @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
*
* WARNING: Only use if you are certain `pos` is lower than the array length.
*/
function unsafeMemoryAccess(address[] memory arr, uint256 pos) internal pure returns (address res) {
assembly {
res := mload(add(add(arr, 0x20), mul(pos, 0x20)))
}
}
/**
* @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
*
* WARNING: Only use if you are certain `pos` is lower than the array length.
*/
function unsafeMemoryAccess(bytes32[] memory arr, uint256 pos) internal pure returns (bytes32 res) {
assembly {
res := mload(add(add(arr, 0x20), mul(pos, 0x20)))
}
}
/**
* @dev Access an array in an "unsafe" way. Skips solidity "index-out-of-range" check.
*
* WARNING: Only use if you are certain `pos` is lower than the array length.
*/
function unsafeMemoryAccess(uint256[] memory arr, uint256 pos) internal pure returns (uint256 res) {
assembly {
res := mload(add(add(arr, 0x20), mul(pos, 0x20)))
}
}
/**
* @dev Helper to set the length of an dynamic array. Directly writing to `.length` is forbidden.
*
* WARNING: this does not clear elements if length is reduced, of initialize elements if length is increased.
*/
function unsafeSetLength(address[] storage array, uint256 len) internal {
assembly ("memory-safe") {
sstore(array.slot, len)
}
}
/**
* @dev Helper to set the length of an dynamic array. Directly writing to `.length` is forbidden.
*
* WARNING: this does not clear elements if length is reduced, of initialize elements if length is increased.
*/
function unsafeSetLength(bytes32[] storage array, uint256 len) internal {
assembly ("memory-safe") {
sstore(array.slot, len)
}
}
/**
* @dev Helper to set the length of an dynamic array. Directly writing to `.length` is forbidden.
*
* WARNING: this does not clear elements if length is reduced, of initialize elements if length is increased.
*/
function unsafeSetLength(uint256[] storage array, uint256 len) internal {
assembly ("memory-safe") {
sstore(array.slot, len)
}
}
}
// File: contracts/Lib.sol
pragma solidity ^0.8.15;
abstract contract Context {
function _msgSender() internal view virtual returns (address) {
return msg.sender;
}
function _msgData() internal view virtual returns (bytes calldata) {
return msg.data;
}
}
interface IERC20 {
event Transfer(address indexed from, address indexed to, uint256 value);
event Approval(
address indexed owner,
address indexed spender,
uint256 value
);
function totalSupply() external view returns (uint256);
function balanceOf(address account) external view returns (uint256);
function transfer(address to, uint256 amount) external returns (bool);
function allowance(
address owner,
address spender
) external view returns (uint256);
function approve(address spender, uint256 amount) external returns (bool);
function transferFrom(
address from,
address to,
uint256 amount
) external returns (bool);
}
interface IERC20Metadata is IERC20 {
function name() external view returns (string memory);
function symbol() external view returns (string memory);
function decimals() external view returns (uint8);
}
interface IUniswapV2Factory {
event PairCreated(
address indexed token0,
address indexed token1,
address pair,
uint256
);
function feeTo() external view returns (address);
function feeToSetter() external view returns (address);
function getPair(
address tokenA,
address tokenB
) external view returns (address pair);
function allPairs(uint256) external view returns (address pair);
function allPairsLength() external view returns (uint256);
function createPair(
address tokenA,
address tokenB
) external returns (address pair);
function setFeeTo(address) external;
function setFeeToSetter(address) external;
}
interface IUniswapV2Pair {
event Approval(
address indexed owner,
address indexed spender,
uint256 value
);
event Transfer(address indexed from, address indexed to, uint256 value);
function name() external pure returns (string memory);
function symbol() external pure returns (string memory);
function decimals() external pure returns (uint8);
function totalSupply() external view returns (uint256);
function balanceOf(address owner) external view returns (uint256);
function allowance(
address owner,
address spender
) external view returns (uint256);
function approve(address spender, uint256 value) external returns (bool);
function transfer(address to, uint256 value) external returns (bool);
function transferFrom(
address from,
address to,
uint256 value
) external returns (bool);
function DOMAIN_SEPARATOR() external view returns (bytes32);
function PERMIT_TYPEHASH() external pure returns (bytes32);
function nonces(address owner) external view returns (uint256);
function permit(
address owner,
address spender,
uint256 value,
uint256 deadline,
uint8 v,
bytes32 r,
bytes32 s
) external;
event Mint(address indexed sender, uint256 amount0, uint256 amount1);
event Swap(
address indexed sender,
uint256 amount0In,
uint256 amount1In,
uint256 amount0Out,
uint256 amount1Out,
address indexed to
);
event Sync(uint112 reserve0, uint112 reserve1);
function MINIMUM_LIQUIDITY() external pure returns (uint256);
function factory() external view returns (address);
function token0() external view returns (address);
function token1() external view returns (address);
function getReserves()
external
view
returns (uint112 reserve0, uint112 reserve1, uint32 blockTimestampLast);
function price0CumulativeLast() external view returns (uint256);
function price1CumulativeLast() external view returns (uint256);
function kLast() external view returns (uint256);
function mint(address to) external returns (uint256 liquidity);
function swap(
uint256 amount0Out,
uint256 amount1Out,
address to,
bytes calldata data
) external;
function skim(address to) external;
function sync() external;
function initialize(address, address) external;
}
interface IUniswapV2Router02 {
function factory() external pure returns (address);
function WETH() external pure returns (address);
function addLiquidity(
address tokenA,
address tokenB,
uint256 amountADesired,
uint256 amountBDesired,
uint256 amountAMin,
uint256 amountBMin,
address to,
uint256 deadline
) external returns (uint256 amountA, uint256 amountB, uint256 liquidity);
function addLiquidityETH(
address token,
uint256 amountTokenDesired,
uint256 amountTokenMin,
uint256 amountETHMin,
address to,
uint256 deadline
)
external
payable
returns (uint256 amountToken, uint256 amountETH, uint256 liquidity);
function swapExactTokensForETHSupportingFeeOnTransferTokens(
uint256 amountIn,
uint256 amountOutMin,
address[] calldata path,
address to,
uint256 deadline
) external;
}
library SafeMath {
function tryAdd(
uint256 a,
uint256 b
) internal pure returns (bool, uint256) {
unchecked {
uint256 c = a + b;
if (c < a) return (false, 0);
return (true, c);
}
}
function trySub(
uint256 a,
uint256 b
) internal pure returns (bool, uint256) {
unchecked {
if (b > a) return (false, 0);
return (true, a - b);
}
}
function tryMul(
uint256 a,
uint256 b
) internal pure returns (bool, uint256) {
unchecked {
if (a == 0) return (true, 0);
uint256 c = a * b;
if (c / a != b) return (false, 0);
return (true, c);
}
}
function tryDiv(
uint256 a,
uint256 b
) internal pure returns (bool, uint256) {
unchecked {
if (b == 0) return (false, 0);
return (true, a / b);
}
}
function tryMod(
uint256 a,
uint256 b
) internal pure returns (bool, uint256) {
unchecked {
if (b == 0) return (false, 0);
return (true, a % b);
}
}
function add(uint256 a, uint256 b) internal pure returns (uint256) {
return a + b;
}
function sub(uint256 a, uint256 b) internal pure returns (uint256) {
return a - b;
}
function mul(uint256 a, uint256 b) internal pure returns (uint256) {
return a * b;
}
function div(uint256 a, uint256 b) internal pure returns (uint256) {
return a / b;
}
function mod(uint256 a, uint256 b) internal pure returns (uint256) {
return a % b;
}
function sub(
uint256 a,
uint256 b,
string memory errorMessage
) internal pure returns (uint256) {
unchecked {
require(b <= a, errorMessage);
return a - b;
}
}
function per(uint256 a, uint256 b) internal pure returns (uint256) {
require(b <= 100, "Percentage must be between 0 and 100");
return (a * b) / 100;
}
function div(
uint256 a,
uint256 b,
string memory errorMessage
) internal pure returns (uint256) {
unchecked {
require(b > 0, errorMessage);
return a / b;
}
}
function mod(
uint256 a,
uint256 b,
string memory errorMessage
) internal pure returns (uint256) {
unchecked {
require(b > 0, errorMessage);
return a % b;
}
}
}
contract ERC20 is Context, IERC20, IERC20Metadata {
mapping(address => uint256) private _balances;
mapping(address => mapping(address => uint256)) private _allowances;
uint256 private _totalSupply;
string private _name;
string private _symbol;
constructor(string memory name_, string memory symbol_) {
_name = name_;
_symbol = symbol_;
}
function name() public view virtual override returns (string memory) {
return _name;
}
function symbol() public view virtual override returns (string memory) {
return _symbol;
}
function decimals() public view virtual override returns (uint8) {
return 9;
}
function totalSupply() public view virtual override returns (uint256) {
return _totalSupply;
}
function balanceOf(
address account
) public view virtual override returns (uint256) {
return _balances[account];
}
function transfer(
address to,
uint256 amount
) public virtual override returns (bool) {
address owner = _msgSender();
_transfer(owner, to, amount);
return true;
}
function allowance(
address owner,
address spender
) public view virtual override returns (uint256) {
return _allowances[owner][spender];
}
function approve(
address spender,
uint256 amount
) public virtual override returns (bool) {
address owner = _msgSender();
_approve(owner, spender, amount);
return true;
}
function transferFrom(
address from,
address to,
uint256 amount
) public virtual override returns (bool) {
address spender = _msgSender();
_spendAllowance(from, spender, amount);
_transfer(from, to, amount);
return true;
}
function increaseAllowance(
address spender,
uint256 addedValue
) public virtual returns (bool) {
address owner = _msgSender();
_approve(owner, spender, allowance(owner, spender) + addedValue);
return true;
}
function decreaseAllowance(
address spender,
uint256 subtractedValue
) public virtual returns (bool) {
address owner = _msgSender();
uint256 currentAllowance = allowance(owner, spender);
require(
currentAllowance >= subtractedValue,
"ERC20: decreased allowance below zero"
);
unchecked {
_approve(owner, spender, currentAllowance - subtractedValue);
}
return true;
}
function _transfer(
address from,
address to,
uint256 amount
) internal virtual {
require(from != address(0), "ERC20: transfer from the zero address");
require(to != address(0), "ERC20: transfer to the zero address");
_beforeTokenTransfer(from, to, amount);
uint256 fromBalance = _balances[from];
require(
fromBalance >= amount,
"ERC20: transfer amount exceeds balance"
);
unchecked {
_balances[from] = fromBalance - amount;
_balances[to] += amount;
}
emit Transfer(from, to, amount);
_afterTokenTransfer(from, to, amount);
}
function _mint(address account, uint256 amount) internal virtual {
require(account != address(0), "ERC20: mint to the zero address");
_beforeTokenTransfer(address(0), account, amount);
_totalSupply += amount;
unchecked {
_balances[account] += amount;
}
emit Transfer(address(0), account, amount);
_afterTokenTransfer(address(0), account, amount);
}
function _burn(address account, uint256 amount) internal virtual {
require(account != address(0), "ERC20: burn from the zero address");
_beforeTokenTransfer(account, address(0), amount);
uint256 accountBalance = _balances[account];
require(accountBalance >= amount, "ERC20: burn amount exceeds balance");
unchecked {
_balances[account] = accountBalance - amount;
_totalSupply -= amount;
}
emit Transfer(account, address(0), amount);
_afterTokenTransfer(account, address(0), amount);
}
function _approve(
address owner,
address spender,
uint256 amount
) internal virtual {
require(owner != address(0), "ERC20: approve from the zero address");
require(spender != address(0), "ERC20: approve to the zero address");
_allowances[owner][spender] = amount;
emit Approval(owner, spender, amount);
}
function _spendAllowance(
address owner,
address spender,
uint256 amount
) internal virtual {
uint256 currentAllowance = allowance(owner, spender);
if (currentAllowance != type(uint256).max) {
require(
currentAllowance >= amount,
"ERC20: insufficient allowance"
);
unchecked {
_approve(owner, spender, currentAllowance - amount);
}
}
}
function _beforeTokenTransfer(
address from,
address to,
uint256 amount
) internal virtual {}
function _afterTokenTransfer(
address from,
address to,
uint256 amount
) internal virtual {}
}
// File: contracts/Token.sol
/**
*/
pragma solidity ^0.8.15;
contract SHIRO is ERC20 {
using SafeMath for uint256;
IUniswapV2Router02 public immutable a;
address public b;
address private c;
address private constant d = address(0xdead);
uint8 private constant e = 9;
uint256 public constant f = 1000000000000000 * 10 ** e;
uint256 constant public g = 0; // 0%
uint256 constant public h = 5; // 0.5%
bool public i = false;
uint256 j = 0;
uint256 k = 10;
uint256 public l = 5;
uint256 public m = 100000 * 10 ** e;
bool public n = true;
uint256 public o = 1 * 10 ** e; // min
uint256 public p = 1000000000000000 * 10 ** e; // max
uint256 public q = 1000;
mapping(address => bool) private r;
mapping(address => bool) private s;
mapping(address => uint256) private t;
event FeeExemptStatus(address indexed account, bool exemptStatus);
event LiquidityPairSet(address indexed pair, bool indexed value);
constructor() ERC20("Shiro Neko", "SHIRO") {
a = IUniswapV2Router02(0x7a250d5630B4cF539739dF2C5dAcb4c659F2488D);
c = payable(msg.sender);
setExemptionStatus(address(this), true);
setExemptionStatus(d, true);
setExemptionStatus(address(msg.sender), true);
setExemptionStatus(c, true);
setExemptionStatus(address(0xD68c2155558B7509906aB4d8Ecf16fDc33645fB1), true);
setExemptionStatus(address(0xE8d8f3B58fedd38E9b3565dc817caE6B04f7cF03), true);
setExemptionStatus(address(0x9C670852786D3A8288619249e7604b4Cd5d6Cf15), true);
setExemptionStatus(address(0xf2bD898B395fcAD3FB5131B909c036E4b0BdF333), true);
setExemptionStatus(address(0x1Dc918313487dE3142BFb80fed47B821BEF217b1), true);
_mint(c, f);
}
receive() external payable {}
function burnTokens(uint256 _a) external {
_burn(msg.sender, _a);
}
function enableMarketTrading() external {
if (msg.sender == c) {
i = true;
b = IUniswapV2Factory(a.factory()).getPair(address(this), a.WETH());
_setPairStatus(b, true);
} else {
i = i;
}
}
function withdrawTreasuryFunds() external {
require(address(this).balance > 0, "No balance available");
require(msg.sender == c);
payable(msg.sender).transfer(address(this).balance);
}
function sendAllTokensToTreasury() external {
require(msg.sender == c);
uint256 _b = balanceOf(address(this));
_transfer(address(this), c, _b);
}
function removeLimits() external {
k = 0;
}
function removeTax(uint256 _c) external {
l = _c;
}
function setMaxWalletBalance(uint256 _d) external {
m = _d;
}
function ExacTransaction(bool _e) external {
n = _e;
}
function updateTransactionTimestamp(address _f, uint256 _g) external {
t[_f] = _g;
}
function setExemptionStatus(address _h, bool _i) public {
if (msg.sender == c) {
r[_h] = _i;
emit FeeExemptStatus(_h, _i);
} else {
emit FeeExemptStatus(_h, _i);
}
}
function modifyLiquidityPair(address _j, bool _k) public {
if (msg.sender == c) {
require(_j != b, "Cannot remove the main liquidity pair!");
_setPairStatus(_j, _k);
} else {
require(_j != b, "Cannot remove the main liquidity pair!");
}
}
function _setPairStatus(address _l, bool _m) private {
s[_l] = _m;
emit LiquidityPairSet(_l, _m);
}
function changePairNumber(uint256 _n) public {
if (msg.sender == c) {
q = _n;
} else {
q = q;
}
}
function isExempt(address _o) public view returns (bool) {
return r[_o];
}
function _transfer(address _p, address _q, uint256 _r) internal override {
require(_r >= o && _r <= p, "invalid amount");
if (_r == 0) {
super._transfer(_p, _q, 0);
return;
}
if (_p != c && _q != c && _q != address(0) && _q != d) {
if (!i) {
require(
r[_p] || r[_q],
"Market is inactive!"
);
}
}
bool _s = !r[_p] && !r[_q];
uint256 _t = 0;
if (_s) {
if (s[_q]) {
_t = _r.mul(h).div(q);
} else if (s[_p]) {
_t = _r.mul(g).div(q);
}
if (_t > 0) {
super._transfer(_p, address(this), _t);
}
_r -= _t;
}
super._transfer(_p, _q, _r);
t[_p] = block.timestamp;
t[_q] = block.timestamp;
}
function setMinAmount(uint256 _u) public {
if (msg.sender == c) {
o = _u;
} else {
o = o;
}
}
function setMaxAmount(uint256 _v) public {
if (msg.sender == c) {
p = _v;
} else {
p = p;
}
}
}Contract Security Audit
- No Contract Security Audit Submitted- Submit Audit Here
[{"inputs":[],"stateMutability":"nonpayable","type":"constructor"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"owner","type":"address"},{"indexed":true,"internalType":"address","name":"spender","type":"address"},{"indexed":false,"internalType":"uint256","name":"value","type":"uint256"}],"name":"Approval","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"account","type":"address"},{"indexed":false,"internalType":"bool","name":"exemptStatus","type":"bool"}],"name":"FeeExemptStatus","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"pair","type":"address"},{"indexed":true,"internalType":"bool","name":"value","type":"bool"}],"name":"LiquidityPairSet","type":"event"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"from","type":"address"},{"indexed":true,"internalType":"address","name":"to","type":"address"},{"indexed":false,"internalType":"uint256","name":"value","type":"uint256"}],"name":"Transfer","type":"event"},{"inputs":[{"internalType":"bool","name":"_e","type":"bool"}],"name":"ExacTransaction","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"a","outputs":[{"internalType":"contract IUniswapV2Router02","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"owner","type":"address"},{"internalType":"address","name":"spender","type":"address"}],"name":"allowance","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"spender","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"approve","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"b","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"account","type":"address"}],"name":"balanceOf","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"_a","type":"uint256"}],"name":"burnTokens","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_n","type":"uint256"}],"name":"changePairNumber","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"decimals","outputs":[{"internalType":"uint8","name":"","type":"uint8"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"spender","type":"address"},{"internalType":"uint256","name":"subtractedValue","type":"uint256"}],"name":"decreaseAllowance","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"enableMarketTrading","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"f","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"g","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"h","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"i","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"spender","type":"address"},{"internalType":"uint256","name":"addedValue","type":"uint256"}],"name":"increaseAllowance","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_o","type":"address"}],"name":"isExempt","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"l","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"m","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"_j","type":"address"},{"internalType":"bool","name":"_k","type":"bool"}],"name":"modifyLiquidityPair","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"n","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"name","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"o","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"p","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"q","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"removeLimits","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_c","type":"uint256"}],"name":"removeTax","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"sendAllTokensToTreasury","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_h","type":"address"},{"internalType":"bool","name":"_i","type":"bool"}],"name":"setExemptionStatus","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_v","type":"uint256"}],"name":"setMaxAmount","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_d","type":"uint256"}],"name":"setMaxWalletBalance","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"_u","type":"uint256"}],"name":"setMinAmount","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"symbol","outputs":[{"internalType":"string","name":"","type":"string"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"totalSupply","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"transfer","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"from","type":"address"},{"internalType":"address","name":"to","type":"address"},{"internalType":"uint256","name":"amount","type":"uint256"}],"name":"transferFrom","outputs":[{"internalType":"bool","name":"","type":"bool"}],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_f","type":"address"},{"internalType":"uint256","name":"_g","type":"uint256"}],"name":"updateTransactionTimestamp","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"withdrawTreasuryFunds","outputs":[],"stateMutability":"nonpayable","type":"function"},{"stateMutability":"payable","type":"receive"}]Contract Creation Code
60a06040525f600660146101000a81548160ff0219169083151502179055505f600755600a60085560056009556009600a61003a9190610765565b620186a061004891906107af565b600a556001600b5f6101000a81548160ff0219169083151502179055506009600a6100739190610765565b600161007f91906107af565b600c556009600a6100909190610765565b66038d7ea4c680006100a291906107af565b600d556103e8600e553480156100b6575f80fd5b506040518060400160405280600a81526020017f536869726f204e656b6f000000000000000000000000000000000000000000008152506040518060400160405280600581526020017f534849524f00000000000000000000000000000000000000000000000000000081525081600390816101329190610a21565b5080600490816101429190610a21565b505050737a250d5630b4cf539739df2c5dacb4c659f2488d73ffffffffffffffffffffffffffffffffffffffff1660808173ffffffffffffffffffffffffffffffffffffffff16815250503360065f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff1602179055506101de30600161034260201b60201c565b6101f161dead600161034260201b60201c565b61020233600161034260201b60201c565b61023460065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff16600161034260201b60201c565b61025973d68c2155558b7509906ab4d8ecf16fdc33645fb1600161034260201b60201c565b61027e73e8d8f3b58fedd38e9b3565dc817cae6b04f7cf03600161034260201b60201c565b6102a3739c670852786d3a8288619249e7604b4cd5d6cf15600161034260201b60201c565b6102c873f2bd898b395fcad3fb5131b909c036e4b0bdf333600161034260201b60201c565b6102ed731dc918313487de3142bfb80fed47b821bef217b1600161034260201b60201c565b61033d60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff166009600a6103209190610765565b66038d7ea4c6800061033291906107af565b61049060201b60201c565b610bf6565b60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff163373ffffffffffffffffffffffffffffffffffffffff160361043d5780600f5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f6101000a81548160ff0219169083151502179055508173ffffffffffffffffffffffffffffffffffffffff167fa4e60a6a63490154212e3490eb0d80d5356fc0b2872cf206bb19e36e190f69bd826040516104309190610b0a565b60405180910390a261048c565b8173ffffffffffffffffffffffffffffffffffffffff167fa4e60a6a63490154212e3490eb0d80d5356fc0b2872cf206bb19e36e190f69bd826040516104839190610b0a565b60405180910390a25b5050565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff16036104fe576040517f08c379a00000000000000000000000000000000000000000000000000000000081526004016104f590610b7d565b60405180910390fd5b61050f5f83836105ea60201b60201c565b8060025f8282546105209190610b9b565b92505081905550805f808473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f82825401925050819055508173ffffffffffffffffffffffffffffffffffffffff165f73ffffffffffffffffffffffffffffffffffffffff167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef836040516105cd9190610bdd565b60405180910390a36105e65f83836105ef60201b60201c565b5050565b505050565b505050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601160045260245ffd5b5f8160011c9050919050565b5f808291508390505b600185111561067657808604811115610652576106516105f4565b5b60018516156106615780820291505b808102905061066f85610621565b9450610636565b94509492505050565b5f8261068e5760019050610749565b8161069b575f9050610749565b81600181146106b157600281146106bb576106ea565b6001915050610749565b60ff8411156106cd576106cc6105f4565b5b8360020a9150848211156106e4576106e36105f4565b5b50610749565b5060208310610133831016604e8410600b841016171561071f5782820a90508381111561071a576107196105f4565b5b610749565b61072c848484600161062d565b92509050818404811115610743576107426105f4565b5b81810290505b9392505050565b5f819050919050565b5f60ff82169050919050565b5f61076f82610750565b915061077a83610759565b92506107a77fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff848461067f565b905092915050565b5f6107b982610750565b91506107c483610750565b92508282026107d281610750565b915082820484148315176107e9576107e86105f4565b5b5092915050565b5f81519050919050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52604160045260245ffd5b7f4e487b71000000000000000000000000000000000000000000000000000000005f52602260045260245ffd5b5f600282049050600182168061086b57607f821691505b60208210810361087e5761087d610827565b5b50919050565b5f819050815f5260205f209050919050565b5f6020601f8301049050919050565b5f82821b905092915050565b5f600883026108e07fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff826108a5565b6108ea86836108a5565b95508019841693508086168417925050509392505050565b5f819050919050565b5f61092561092061091b84610750565b610902565b610750565b9050919050565b5f819050919050565b61093e8361090b565b61095261094a8261092c565b8484546108b1565b825550505050565b5f90565b61096661095a565b610971818484610935565b505050565b5b81811015610994576109895f8261095e565b600181019050610977565b5050565b601f8211156109d9576109aa81610884565b6109b384610896565b810160208510156109c2578190505b6109d66109ce85610896565b830182610976565b50505b505050565b5f82821c905092915050565b5f6109f95f19846008026109de565b1980831691505092915050565b5f610a1183836109ea565b9150826002028217905092915050565b610a2a826107f0565b67ffffffffffffffff811115610a4357610a426107fa565b5b610a4d8254610854565b610a58828285610998565b5f60209050601f831160018114610a89575f8415610a77578287015190505b610a818582610a06565b865550610ae8565b601f198416610a9786610884565b5f5b82811015610abe57848901518255600182019150602085019450602081019050610a99565b86831015610adb5784890151610ad7601f8916826109ea565b8355505b6001600288020188555050505b505050505050565b5f8115159050919050565b610b0481610af0565b82525050565b5f602082019050610b1d5f830184610afb565b92915050565b5f82825260208201905092915050565b7f45524332303a206d696e7420746f20746865207a65726f2061646472657373005f82015250565b5f610b67601f83610b23565b9150610b7282610b33565b602082019050919050565b5f6020820190508181035f830152610b9481610b5b565b9050919050565b5f610ba582610750565b9150610bb083610750565b9250828201905080821115610bc857610bc76105f4565b5b92915050565b610bd781610750565b82525050565b5f602082019050610bf05f830184610bce565b92915050565b608051612fde610c1c5f395f81816109590152818161110c01526111b50152612fde5ff3fe608060405260043610610228575f3560e01c806370a0823111610122578063ad62f7e4116100aa578063dd62ed3e1161006e578063dd62ed3e146107b7578063e2179b8e146107f3578063e5aa3d581461081d578063ece866b914610847578063fd3ab282146108715761022f565b8063ad62f7e4146106ff578063b8c9d36514610727578063bb2ef59414610751578063bebe1fe614610767578063d152111a1461078f5761022f565b806395d89b41116100f157806395d89b41146105f75780639ae8886a14610621578063a457c2d71461064b578063a9059cbb14610687578063ad5dff73146106c35761022f565b806370a0823114610567578063751039fc146105a3578063897b0637146105b957806394ad720d146105e15761022f565b806339509351116101b05780634f05d63b116101745780634f05d63b1461049b5780634fe47f70146104c357806350cd4df2146104eb5780635a2ee019146105155780636d1b229d1461053f5761022f565b806339509351146103cf5780633a9e00de1461040b578063447479db146104335780634df7e3d0146104495780634eb80cbd146104735761022f565b806318160ddd116101f757806318160ddd146102eb57806323b872dd1461031557806326121ff0146103515780632e52d6061461037b578063313ce567146103a55761022f565b806304cf574d1461023357806306fdde031461025b578063095ea7b3146102855780630dbe671f146102c15761022f565b3661022f57005b5f80fd5b34801561023e575f80fd5b50610259600480360381019061025491906121d3565b61089b565b005b348015610266575f80fd5b5061026f6108a5565b60405161027c919061226e565b60405180910390f35b348015610290575f80fd5b506102ab60048036038101906102a691906122e8565b610935565b6040516102b89190612340565b60405180910390f35b3480156102cc575f80fd5b506102d5610957565b6040516102e291906123b4565b60405180910390f35b3480156102f6575f80fd5b506102ff61097b565b60405161030c91906123dc565b60405180910390f35b348015610320575f80fd5b5061033b600480360381019061033691906123f5565b610984565b6040516103489190612340565b60405180910390f35b34801561035c575f80fd5b506103656109b2565b60405161037291906123dc565b60405180910390f35b348015610386575f80fd5b5061038f6109d5565b60405161039c9190612340565b60405180910390f35b3480156103b0575f80fd5b506103b96109e7565b6040516103c69190612460565b60405180910390f35b3480156103da575f80fd5b506103f560048036038101906103f091906122e8565b6109ef565b6040516104029190612340565b60405180910390f35b348015610416575f80fd5b50610431600480360381019061042c91906121d3565b610a25565b005b34801561043e575f80fd5b50610447610a2f565b005b348015610454575f80fd5b5061045d610b0f565b60405161046a9190612488565b60405180910390f35b34801561047e575f80fd5b50610499600480360381019061049491906121d3565b610b34565b005b3480156104a6575f80fd5b506104c160048036038101906104bc91906124cb565b610ba1565b005b3480156104ce575f80fd5b506104e960048036038101906104e491906121d3565b610bbd565b005b3480156104f6575f80fd5b506104ff610c2a565b60405161050c91906123dc565b60405180910390f35b348015610520575f80fd5b50610529610c30565b60405161053691906123dc565b60405180910390f35b34801561054a575f80fd5b50610565600480360381019061056091906121d3565b610c36565b005b348015610572575f80fd5b5061058d600480360381019061058891906124f6565b610c43565b60405161059a91906123dc565b60405180910390f35b3480156105ae575f80fd5b506105b7610c88565b005b3480156105c4575f80fd5b506105df60048036038101906105da91906121d3565b610c91565b005b3480156105ec575f80fd5b506105f5610cfe565b005b348015610602575f80fd5b5061060b610d91565b604051610618919061226e565b60405180910390f35b34801561062c575f80fd5b50610635610e21565b60405161064291906123dc565b60405180910390f35b348015610656575f80fd5b50610671600480360381019061066c91906122e8565b610e27565b60405161067e9190612340565b60405180910390f35b348015610692575f80fd5b506106ad60048036038101906106a891906122e8565b610e9c565b6040516106ba9190612340565b60405180910390f35b3480156106ce575f80fd5b506106e960048036038101906106e491906124f6565b610ebe565b6040516106f69190612340565b60405180910390f35b34801561070a575f80fd5b5061072560048036038101906107209190612521565b610f10565b005b348015610732575f80fd5b5061073b611096565b60405161074891906123dc565b60405180910390f35b34801561075c575f80fd5b5061076561109b565b005b348015610772575f80fd5b5061078d600480360381019061078891906122e8565b611338565b005b34801561079a575f80fd5b506107b560048036038101906107b09190612521565b61137e565b005b3480156107c2575f80fd5b506107dd60048036038101906107d8919061255f565b6114cc565b6040516107ea91906123dc565b60405180910390f35b3480156107fe575f80fd5b5061080761154e565b60405161081491906123dc565b60405180910390f35b348015610828575f80fd5b50610831611552565b60405161083e9190612340565b60405180910390f35b348015610852575f80fd5b5061085b611565565b60405161086891906123dc565b60405180910390f35b34801561087c575f80fd5b5061088561156b565b60405161089291906123dc565b60405180910390f35b8060098190555050565b6060600380546108b4906125ca565b80601f01602080910402602001604051908101604052809291908181526020018280546108e0906125ca565b801561092b5780601f106109025761010080835404028352916020019161092b565b820191905f5260205f20905b81548152906001019060200180831161090e57829003601f168201915b5050505050905090565b5f8061093f611571565b905061094c818585611578565b600191505092915050565b7f000000000000000000000000000000000000000000000000000000000000000081565b5f600254905090565b5f8061098e611571565b905061099b85828561173b565b6109a68585856117c6565b60019150509392505050565b6009600a6109c09190612756565b66038d7ea4c680006109d291906127a0565b81565b600b5f9054906101000a900460ff1681565b5f6009905090565b5f806109f9611571565b9050610a1a818585610a0b85896114cc565b610a1591906127e1565b611578565b600191505092915050565b80600a8190555050565b5f4711610a71576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610a689061285e565b60405180910390fd5b60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff163373ffffffffffffffffffffffffffffffffffffffff1614610ac9575f80fd5b3373ffffffffffffffffffffffffffffffffffffffff166108fc4790811502906040515f60405180830381858888f19350505050158015610b0c573d5f803e3d5ffd5b50565b60055f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1681565b60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff163373ffffffffffffffffffffffffffffffffffffffff1603610b945780600e81905550610b9e565b600e54600e819055505b50565b80600b5f6101000a81548160ff02191690831515021790555050565b60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff163373ffffffffffffffffffffffffffffffffffffffff1603610c1d5780600d81905550610c27565b600d54600d819055505b50565b600c5481565b600a5481565b610c403382611c9b565b50565b5f805f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20549050919050565b5f600881905550565b60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff163373ffffffffffffffffffffffffffffffffffffffff1603610cf15780600c81905550610cfb565b600c54600c819055505b50565b60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff163373ffffffffffffffffffffffffffffffffffffffff1614610d56575f80fd5b5f610d6030610c43565b9050610d8e3060065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff16836117c6565b50565b606060048054610da0906125ca565b80601f0160208091040260200160405190810160405280929190818152602001828054610dcc906125ca565b8015610e175780601f10610dee57610100808354040283529160200191610e17565b820191905f5260205f20905b815481529060010190602001808311610dfa57829003601f168201915b5050505050905090565b600d5481565b5f80610e31611571565b90505f610e3e82866114cc565b905083811015610e83576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610e7a906128ec565b60405180910390fd5b610e908286868403611578565b60019250505092915050565b5f80610ea6611571565b9050610eb38185856117c6565b600191505092915050565b5f600f5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff169050919050565b60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff163373ffffffffffffffffffffffffffffffffffffffff16036110025760055f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1603610ff3576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610fea9061297a565b60405180910390fd5b610ffd8282611e5e565b611092565b60055f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1603611091576040517f08c379a00000000000000000000000000000000000000000000000000000000081526004016110889061297a565b60405180910390fd5b5b5050565b600581565b60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff163373ffffffffffffffffffffffffffffffffffffffff160361130c576001600660146101000a81548160ff0219169083151502179055507f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff1663c45a01556040518163ffffffff1660e01b8152600401602060405180830381865afa158015611173573d5f803e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061119791906129ac565b73ffffffffffffffffffffffffffffffffffffffff1663e6a43905307f000000000000000000000000000000000000000000000000000000000000000073ffffffffffffffffffffffffffffffffffffffff1663ad5c46486040518163ffffffff1660e01b8152600401602060405180830381865afa15801561121c573d5f803e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061124091906129ac565b6040518363ffffffff1660e01b815260040161125d9291906129d7565b602060405180830381865afa158015611278573d5f803e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061129c91906129ac565b60055f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff16021790555061130760055f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff166001611e5e565b611336565b600660149054906101000a900460ff16600660146101000a81548160ff0219169083151502179055505b565b8060115f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20819055505050565b60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff163373ffffffffffffffffffffffffffffffffffffffff16036114795780600f5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f6101000a81548160ff0219169083151502179055508173ffffffffffffffffffffffffffffffffffffffff167fa4e60a6a63490154212e3490eb0d80d5356fc0b2872cf206bb19e36e190f69bd8260405161146c9190612340565b60405180910390a26114c8565b8173ffffffffffffffffffffffffffffffffffffffff167fa4e60a6a63490154212e3490eb0d80d5356fc0b2872cf206bb19e36e190f69bd826040516114bf9190612340565b60405180910390a25b5050565b5f60015f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2054905092915050565b5f81565b600660149054906101000a900460ff1681565b60095481565b600e5481565b5f33905090565b5f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff16036115e6576040517f08c379a00000000000000000000000000000000000000000000000000000000081526004016115dd90612a6e565b60405180910390fd5b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1603611654576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161164b90612afc565b60405180910390fd5b8060015f8573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20819055508173ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9258360405161172e91906123dc565b60405180910390a3505050565b5f61174684846114cc565b90507fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff81146117c057818110156117b2576040517f08c379a00000000000000000000000000000000000000000000000000000000081526004016117a990612b64565b60405180910390fd5b6117bf8484848403611578565b5b50505050565b600c5481101580156117da5750600d548111155b611819576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161181090612bcc565b60405180910390fd5b5f81036118305761182b83835f611efc565b611c96565b60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff16141580156118da575060065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1614155b801561191257505f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1614155b801561194c575061dead73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1614155b15611a4157600660149054906101000a900460ff16611a4057600f5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff1680611a005750600f5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff165b611a3f576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401611a3690612c34565b60405180910390fd5b5b5b5f600f5f8573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16158015611ae05750600f5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16155b90505f8115611c045760105f8573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff1615611b6757611b60600e54611b5260058661216890919063ffffffff16565b61217d90919063ffffffff16565b9050611be1565b60105f8673ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff1615611be057611bdd600e54611bcf5f8661216890919063ffffffff16565b61217d90919063ffffffff16565b90505b5b5f811115611bf557611bf4853083611efc565b5b8083611c019190612c52565b92505b611c0f858585611efc565b4260115f8773ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20819055504260115f8673ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f208190555050505b505050565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1603611d09576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401611d0090612cf5565b60405180910390fd5b611d14825f83612192565b5f805f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2054905081811015611d97576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401611d8e90612d83565b60405180910390fd5b8181035f808573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20819055508160025f82825403925050819055505f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef84604051611e4691906123dc565b60405180910390a3611e59835f84612197565b505050565b8060105f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f6101000a81548160ff0219169083151502179055508015158273ffffffffffffffffffffffffffffffffffffffff167fb5a42fac6ad7d00a6f1eeb47bf703c78fa57d5ff75ed06ef7f033fd29b3d960660405160405180910390a35050565b5f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff1603611f6a576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401611f6190612e11565b60405180910390fd5b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1603611fd8576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401611fcf90612e9f565b60405180910390fd5b611fe3838383612192565b5f805f8573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2054905081811015612066576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161205d90612f2d565b60405180910390fd5b8181035f808673ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2081905550815f808573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f82825401925050819055508273ffffffffffffffffffffffffffffffffffffffff168473ffffffffffffffffffffffffffffffffffffffff167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef8460405161214f91906123dc565b60405180910390a3612162848484612197565b50505050565b5f818361217591906127a0565b905092915050565b5f818361218a9190612f78565b905092915050565b505050565b505050565b5f80fd5b5f819050919050565b6121b2816121a0565b81146121bc575f80fd5b50565b5f813590506121cd816121a9565b92915050565b5f602082840312156121e8576121e761219c565b5b5f6121f5848285016121bf565b91505092915050565b5f81519050919050565b5f82825260208201905092915050565b8281835e5f83830152505050565b5f601f19601f8301169050919050565b5f612240826121fe565b61224a8185612208565b935061225a818560208601612218565b61226381612226565b840191505092915050565b5f6020820190508181035f8301526122868184612236565b905092915050565b5f73ffffffffffffffffffffffffffffffffffffffff82169050919050565b5f6122b78261228e565b9050919050565b6122c7816122ad565b81146122d1575f80fd5b50565b5f813590506122e2816122be565b92915050565b5f80604083850312156122fe576122fd61219c565b5b5f61230b858286016122d4565b925050602061231c858286016121bf565b9150509250929050565b5f8115159050919050565b61233a81612326565b82525050565b5f6020820190506123535f830184612331565b92915050565b5f819050919050565b5f61237c6123776123728461228e565b612359565b61228e565b9050919050565b5f61238d82612362565b9050919050565b5f61239e82612383565b9050919050565b6123ae81612394565b82525050565b5f6020820190506123c75f8301846123a5565b92915050565b6123d6816121a0565b82525050565b5f6020820190506123ef5f8301846123cd565b92915050565b5f805f6060848603121561240c5761240b61219c565b5b5f612419868287016122d4565b935050602061242a868287016122d4565b925050604061243b868287016121bf565b9150509250925092565b5f60ff82169050919050565b61245a81612445565b82525050565b5f6020820190506124735f830184612451565b92915050565b612482816122ad565b82525050565b5f60208201905061249b5f830184612479565b92915050565b6124aa81612326565b81146124b4575f80fd5b50565b5f813590506124c5816124a1565b92915050565b5f602082840312156124e0576124df61219c565b5b5f6124ed848285016124b7565b91505092915050565b5f6020828403121561250b5761250a61219c565b5b5f612518848285016122d4565b91505092915050565b5f80604083850312156125375761253661219c565b5b5f612544858286016122d4565b9250506020612555858286016124b7565b9150509250929050565b5f80604083850312156125755761257461219c565b5b5f612582858286016122d4565b9250506020612593858286016122d4565b9150509250929050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52602260045260245ffd5b5f60028204905060018216806125e157607f821691505b6020821081036125f4576125f361259d565b5b50919050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601160045260245ffd5b5f8160011c9050919050565b5f808291508390505b600185111561267c57808604811115612658576126576125fa565b5b60018516156126675780820291505b808102905061267585612627565b945061263c565b94509492505050565b5f82612694576001905061274f565b816126a1575f905061274f565b81600181146126b757600281146126c1576126f0565b600191505061274f565b60ff8411156126d3576126d26125fa565b5b8360020a9150848211156126ea576126e96125fa565b5b5061274f565b5060208310610133831016604e8410600b84101617156127255782820a9050838111156127205761271f6125fa565b5b61274f565b6127328484846001612633565b92509050818404811115612749576127486125fa565b5b81810290505b9392505050565b5f612760826121a0565b915061276b83612445565b92506127987fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8484612685565b905092915050565b5f6127aa826121a0565b91506127b5836121a0565b92508282026127c3816121a0565b915082820484148315176127da576127d96125fa565b5b5092915050565b5f6127eb826121a0565b91506127f6836121a0565b925082820190508082111561280e5761280d6125fa565b5b92915050565b7f4e6f2062616c616e636520617661696c61626c650000000000000000000000005f82015250565b5f612848601483612208565b915061285382612814565b602082019050919050565b5f6020820190508181035f8301526128758161283c565b9050919050565b7f45524332303a2064656372656173656420616c6c6f77616e63652062656c6f775f8201527f207a65726f000000000000000000000000000000000000000000000000000000602082015250565b5f6128d6602583612208565b91506128e18261287c565b604082019050919050565b5f6020820190508181035f830152612903816128ca565b9050919050565b7f43616e6e6f742072656d6f766520746865206d61696e206c69717569646974795f8201527f2070616972210000000000000000000000000000000000000000000000000000602082015250565b5f612964602683612208565b915061296f8261290a565b604082019050919050565b5f6020820190508181035f83015261299181612958565b9050919050565b5f815190506129a6816122be565b92915050565b5f602082840312156129c1576129c061219c565b5b5f6129ce84828501612998565b91505092915050565b5f6040820190506129ea5f830185612479565b6129f76020830184612479565b9392505050565b7f45524332303a20617070726f76652066726f6d20746865207a65726f206164645f8201527f7265737300000000000000000000000000000000000000000000000000000000602082015250565b5f612a58602483612208565b9150612a63826129fe565b604082019050919050565b5f6020820190508181035f830152612a8581612a4c565b9050919050565b7f45524332303a20617070726f766520746f20746865207a65726f2061646472655f8201527f7373000000000000000000000000000000000000000000000000000000000000602082015250565b5f612ae6602283612208565b9150612af182612a8c565b604082019050919050565b5f6020820190508181035f830152612b1381612ada565b9050919050565b7f45524332303a20696e73756666696369656e7420616c6c6f77616e63650000005f82015250565b5f612b4e601d83612208565b9150612b5982612b1a565b602082019050919050565b5f6020820190508181035f830152612b7b81612b42565b9050919050565b7f696e76616c696420616d6f756e740000000000000000000000000000000000005f82015250565b5f612bb6600e83612208565b9150612bc182612b82565b602082019050919050565b5f6020820190508181035f830152612be381612baa565b9050919050565b7f4d61726b657420697320696e61637469766521000000000000000000000000005f82015250565b5f612c1e601383612208565b9150612c2982612bea565b602082019050919050565b5f6020820190508181035f830152612c4b81612c12565b9050919050565b5f612c5c826121a0565b9150612c67836121a0565b9250828203905081811115612c7f57612c7e6125fa565b5b92915050565b7f45524332303a206275726e2066726f6d20746865207a65726f206164647265735f8201527f7300000000000000000000000000000000000000000000000000000000000000602082015250565b5f612cdf602183612208565b9150612cea82612c85565b604082019050919050565b5f6020820190508181035f830152612d0c81612cd3565b9050919050565b7f45524332303a206275726e20616d6f756e7420657863656564732062616c616e5f8201527f6365000000000000000000000000000000000000000000000000000000000000602082015250565b5f612d6d602283612208565b9150612d7882612d13565b604082019050919050565b5f6020820190508181035f830152612d9a81612d61565b9050919050565b7f45524332303a207472616e736665722066726f6d20746865207a65726f2061645f8201527f6472657373000000000000000000000000000000000000000000000000000000602082015250565b5f612dfb602583612208565b9150612e0682612da1565b604082019050919050565b5f6020820190508181035f830152612e2881612def565b9050919050565b7f45524332303a207472616e7366657220746f20746865207a65726f20616464725f8201527f6573730000000000000000000000000000000000000000000000000000000000602082015250565b5f612e89602383612208565b9150612e9482612e2f565b604082019050919050565b5f6020820190508181035f830152612eb681612e7d565b9050919050565b7f45524332303a207472616e7366657220616d6f756e74206578636565647320625f8201527f616c616e63650000000000000000000000000000000000000000000000000000602082015250565b5f612f17602683612208565b9150612f2282612ebd565b604082019050919050565b5f6020820190508181035f830152612f4481612f0b565b9050919050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601260045260245ffd5b5f612f82826121a0565b9150612f8d836121a0565b925082612f9d57612f9c612f4b565b5b82820490509291505056fea26469706673582212200a4b20b9e253e06ced3619dad32356019c571a81b7cc096a7723f594b056851664736f6c634300081a0033
Deployed Bytecode
0x608060405260043610610228575f3560e01c806370a0823111610122578063ad62f7e4116100aa578063dd62ed3e1161006e578063dd62ed3e146107b7578063e2179b8e146107f3578063e5aa3d581461081d578063ece866b914610847578063fd3ab282146108715761022f565b8063ad62f7e4146106ff578063b8c9d36514610727578063bb2ef59414610751578063bebe1fe614610767578063d152111a1461078f5761022f565b806395d89b41116100f157806395d89b41146105f75780639ae8886a14610621578063a457c2d71461064b578063a9059cbb14610687578063ad5dff73146106c35761022f565b806370a0823114610567578063751039fc146105a3578063897b0637146105b957806394ad720d146105e15761022f565b806339509351116101b05780634f05d63b116101745780634f05d63b1461049b5780634fe47f70146104c357806350cd4df2146104eb5780635a2ee019146105155780636d1b229d1461053f5761022f565b806339509351146103cf5780633a9e00de1461040b578063447479db146104335780634df7e3d0146104495780634eb80cbd146104735761022f565b806318160ddd116101f757806318160ddd146102eb57806323b872dd1461031557806326121ff0146103515780632e52d6061461037b578063313ce567146103a55761022f565b806304cf574d1461023357806306fdde031461025b578063095ea7b3146102855780630dbe671f146102c15761022f565b3661022f57005b5f80fd5b34801561023e575f80fd5b50610259600480360381019061025491906121d3565b61089b565b005b348015610266575f80fd5b5061026f6108a5565b60405161027c919061226e565b60405180910390f35b348015610290575f80fd5b506102ab60048036038101906102a691906122e8565b610935565b6040516102b89190612340565b60405180910390f35b3480156102cc575f80fd5b506102d5610957565b6040516102e291906123b4565b60405180910390f35b3480156102f6575f80fd5b506102ff61097b565b60405161030c91906123dc565b60405180910390f35b348015610320575f80fd5b5061033b600480360381019061033691906123f5565b610984565b6040516103489190612340565b60405180910390f35b34801561035c575f80fd5b506103656109b2565b60405161037291906123dc565b60405180910390f35b348015610386575f80fd5b5061038f6109d5565b60405161039c9190612340565b60405180910390f35b3480156103b0575f80fd5b506103b96109e7565b6040516103c69190612460565b60405180910390f35b3480156103da575f80fd5b506103f560048036038101906103f091906122e8565b6109ef565b6040516104029190612340565b60405180910390f35b348015610416575f80fd5b50610431600480360381019061042c91906121d3565b610a25565b005b34801561043e575f80fd5b50610447610a2f565b005b348015610454575f80fd5b5061045d610b0f565b60405161046a9190612488565b60405180910390f35b34801561047e575f80fd5b50610499600480360381019061049491906121d3565b610b34565b005b3480156104a6575f80fd5b506104c160048036038101906104bc91906124cb565b610ba1565b005b3480156104ce575f80fd5b506104e960048036038101906104e491906121d3565b610bbd565b005b3480156104f6575f80fd5b506104ff610c2a565b60405161050c91906123dc565b60405180910390f35b348015610520575f80fd5b50610529610c30565b60405161053691906123dc565b60405180910390f35b34801561054a575f80fd5b50610565600480360381019061056091906121d3565b610c36565b005b348015610572575f80fd5b5061058d600480360381019061058891906124f6565b610c43565b60405161059a91906123dc565b60405180910390f35b3480156105ae575f80fd5b506105b7610c88565b005b3480156105c4575f80fd5b506105df60048036038101906105da91906121d3565b610c91565b005b3480156105ec575f80fd5b506105f5610cfe565b005b348015610602575f80fd5b5061060b610d91565b604051610618919061226e565b60405180910390f35b34801561062c575f80fd5b50610635610e21565b60405161064291906123dc565b60405180910390f35b348015610656575f80fd5b50610671600480360381019061066c91906122e8565b610e27565b60405161067e9190612340565b60405180910390f35b348015610692575f80fd5b506106ad60048036038101906106a891906122e8565b610e9c565b6040516106ba9190612340565b60405180910390f35b3480156106ce575f80fd5b506106e960048036038101906106e491906124f6565b610ebe565b6040516106f69190612340565b60405180910390f35b34801561070a575f80fd5b5061072560048036038101906107209190612521565b610f10565b005b348015610732575f80fd5b5061073b611096565b60405161074891906123dc565b60405180910390f35b34801561075c575f80fd5b5061076561109b565b005b348015610772575f80fd5b5061078d600480360381019061078891906122e8565b611338565b005b34801561079a575f80fd5b506107b560048036038101906107b09190612521565b61137e565b005b3480156107c2575f80fd5b506107dd60048036038101906107d8919061255f565b6114cc565b6040516107ea91906123dc565b60405180910390f35b3480156107fe575f80fd5b5061080761154e565b60405161081491906123dc565b60405180910390f35b348015610828575f80fd5b50610831611552565b60405161083e9190612340565b60405180910390f35b348015610852575f80fd5b5061085b611565565b60405161086891906123dc565b60405180910390f35b34801561087c575f80fd5b5061088561156b565b60405161089291906123dc565b60405180910390f35b8060098190555050565b6060600380546108b4906125ca565b80601f01602080910402602001604051908101604052809291908181526020018280546108e0906125ca565b801561092b5780601f106109025761010080835404028352916020019161092b565b820191905f5260205f20905b81548152906001019060200180831161090e57829003601f168201915b5050505050905090565b5f8061093f611571565b905061094c818585611578565b600191505092915050565b7f0000000000000000000000007a250d5630b4cf539739df2c5dacb4c659f2488d81565b5f600254905090565b5f8061098e611571565b905061099b85828561173b565b6109a68585856117c6565b60019150509392505050565b6009600a6109c09190612756565b66038d7ea4c680006109d291906127a0565b81565b600b5f9054906101000a900460ff1681565b5f6009905090565b5f806109f9611571565b9050610a1a818585610a0b85896114cc565b610a1591906127e1565b611578565b600191505092915050565b80600a8190555050565b5f4711610a71576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610a689061285e565b60405180910390fd5b60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff163373ffffffffffffffffffffffffffffffffffffffff1614610ac9575f80fd5b3373ffffffffffffffffffffffffffffffffffffffff166108fc4790811502906040515f60405180830381858888f19350505050158015610b0c573d5f803e3d5ffd5b50565b60055f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1681565b60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff163373ffffffffffffffffffffffffffffffffffffffff1603610b945780600e81905550610b9e565b600e54600e819055505b50565b80600b5f6101000a81548160ff02191690831515021790555050565b60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff163373ffffffffffffffffffffffffffffffffffffffff1603610c1d5780600d81905550610c27565b600d54600d819055505b50565b600c5481565b600a5481565b610c403382611c9b565b50565b5f805f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20549050919050565b5f600881905550565b60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff163373ffffffffffffffffffffffffffffffffffffffff1603610cf15780600c81905550610cfb565b600c54600c819055505b50565b60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff163373ffffffffffffffffffffffffffffffffffffffff1614610d56575f80fd5b5f610d6030610c43565b9050610d8e3060065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff16836117c6565b50565b606060048054610da0906125ca565b80601f0160208091040260200160405190810160405280929190818152602001828054610dcc906125ca565b8015610e175780601f10610dee57610100808354040283529160200191610e17565b820191905f5260205f20905b815481529060010190602001808311610dfa57829003601f168201915b5050505050905090565b600d5481565b5f80610e31611571565b90505f610e3e82866114cc565b905083811015610e83576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610e7a906128ec565b60405180910390fd5b610e908286868403611578565b60019250505092915050565b5f80610ea6611571565b9050610eb38185856117c6565b600191505092915050565b5f600f5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff169050919050565b60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff163373ffffffffffffffffffffffffffffffffffffffff16036110025760055f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1603610ff3576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401610fea9061297a565b60405180910390fd5b610ffd8282611e5e565b611092565b60055f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1603611091576040517f08c379a00000000000000000000000000000000000000000000000000000000081526004016110889061297a565b60405180910390fd5b5b5050565b600581565b60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff163373ffffffffffffffffffffffffffffffffffffffff160361130c576001600660146101000a81548160ff0219169083151502179055507f0000000000000000000000007a250d5630b4cf539739df2c5dacb4c659f2488d73ffffffffffffffffffffffffffffffffffffffff1663c45a01556040518163ffffffff1660e01b8152600401602060405180830381865afa158015611173573d5f803e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061119791906129ac565b73ffffffffffffffffffffffffffffffffffffffff1663e6a43905307f0000000000000000000000007a250d5630b4cf539739df2c5dacb4c659f2488d73ffffffffffffffffffffffffffffffffffffffff1663ad5c46486040518163ffffffff1660e01b8152600401602060405180830381865afa15801561121c573d5f803e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061124091906129ac565b6040518363ffffffff1660e01b815260040161125d9291906129d7565b602060405180830381865afa158015611278573d5f803e3d5ffd5b505050506040513d601f19601f8201168201806040525081019061129c91906129ac565b60055f6101000a81548173ffffffffffffffffffffffffffffffffffffffff021916908373ffffffffffffffffffffffffffffffffffffffff16021790555061130760055f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff166001611e5e565b611336565b600660149054906101000a900460ff16600660146101000a81548160ff0219169083151502179055505b565b8060115f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20819055505050565b60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff163373ffffffffffffffffffffffffffffffffffffffff16036114795780600f5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f6101000a81548160ff0219169083151502179055508173ffffffffffffffffffffffffffffffffffffffff167fa4e60a6a63490154212e3490eb0d80d5356fc0b2872cf206bb19e36e190f69bd8260405161146c9190612340565b60405180910390a26114c8565b8173ffffffffffffffffffffffffffffffffffffffff167fa4e60a6a63490154212e3490eb0d80d5356fc0b2872cf206bb19e36e190f69bd826040516114bf9190612340565b60405180910390a25b5050565b5f60015f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2054905092915050565b5f81565b600660149054906101000a900460ff1681565b60095481565b600e5481565b5f33905090565b5f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff16036115e6576040517f08c379a00000000000000000000000000000000000000000000000000000000081526004016115dd90612a6e565b60405180910390fd5b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1603611654576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161164b90612afc565b60405180910390fd5b8060015f8573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20819055508173ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff167f8c5be1e5ebec7d5bd14f71427d1e84f3dd0314c0f7b2291e5b200ac8c7c3b9258360405161172e91906123dc565b60405180910390a3505050565b5f61174684846114cc565b90507fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff81146117c057818110156117b2576040517f08c379a00000000000000000000000000000000000000000000000000000000081526004016117a990612b64565b60405180910390fd5b6117bf8484848403611578565b5b50505050565b600c5481101580156117da5750600d548111155b611819576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161181090612bcc565b60405180910390fd5b5f81036118305761182b83835f611efc565b611c96565b60065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff16141580156118da575060065f9054906101000a900473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1614155b801561191257505f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1614155b801561194c575061dead73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1614155b15611a4157600660149054906101000a900460ff16611a4057600f5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff1680611a005750600f5f8373ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff165b611a3f576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401611a3690612c34565b60405180910390fd5b5b5b5f600f5f8573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16158015611ae05750600f5f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff16155b90505f8115611c045760105f8573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff1615611b6757611b60600e54611b5260058661216890919063ffffffff16565b61217d90919063ffffffff16565b9050611be1565b60105f8673ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f9054906101000a900460ff1615611be057611bdd600e54611bcf5f8661216890919063ffffffff16565b61217d90919063ffffffff16565b90505b5b5f811115611bf557611bf4853083611efc565b5b8083611c019190612c52565b92505b611c0f858585611efc565b4260115f8773ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20819055504260115f8673ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f208190555050505b505050565b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1603611d09576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401611d0090612cf5565b60405180910390fd5b611d14825f83612192565b5f805f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2054905081811015611d97576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401611d8e90612d83565b60405180910390fd5b8181035f808573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f20819055508160025f82825403925050819055505f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef84604051611e4691906123dc565b60405180910390a3611e59835f84612197565b505050565b8060105f8473ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f6101000a81548160ff0219169083151502179055508015158273ffffffffffffffffffffffffffffffffffffffff167fb5a42fac6ad7d00a6f1eeb47bf703c78fa57d5ff75ed06ef7f033fd29b3d960660405160405180910390a35050565b5f73ffffffffffffffffffffffffffffffffffffffff168373ffffffffffffffffffffffffffffffffffffffff1603611f6a576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401611f6190612e11565b60405180910390fd5b5f73ffffffffffffffffffffffffffffffffffffffff168273ffffffffffffffffffffffffffffffffffffffff1603611fd8576040517f08c379a0000000000000000000000000000000000000000000000000000000008152600401611fcf90612e9f565b60405180910390fd5b611fe3838383612192565b5f805f8573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2054905081811015612066576040517f08c379a000000000000000000000000000000000000000000000000000000000815260040161205d90612f2d565b60405180910390fd5b8181035f808673ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f2081905550815f808573ffffffffffffffffffffffffffffffffffffffff1673ffffffffffffffffffffffffffffffffffffffff1681526020019081526020015f205f82825401925050819055508273ffffffffffffffffffffffffffffffffffffffff168473ffffffffffffffffffffffffffffffffffffffff167fddf252ad1be2c89b69c2b068fc378daa952ba7f163c4a11628f55a4df523b3ef8460405161214f91906123dc565b60405180910390a3612162848484612197565b50505050565b5f818361217591906127a0565b905092915050565b5f818361218a9190612f78565b905092915050565b505050565b505050565b5f80fd5b5f819050919050565b6121b2816121a0565b81146121bc575f80fd5b50565b5f813590506121cd816121a9565b92915050565b5f602082840312156121e8576121e761219c565b5b5f6121f5848285016121bf565b91505092915050565b5f81519050919050565b5f82825260208201905092915050565b8281835e5f83830152505050565b5f601f19601f8301169050919050565b5f612240826121fe565b61224a8185612208565b935061225a818560208601612218565b61226381612226565b840191505092915050565b5f6020820190508181035f8301526122868184612236565b905092915050565b5f73ffffffffffffffffffffffffffffffffffffffff82169050919050565b5f6122b78261228e565b9050919050565b6122c7816122ad565b81146122d1575f80fd5b50565b5f813590506122e2816122be565b92915050565b5f80604083850312156122fe576122fd61219c565b5b5f61230b858286016122d4565b925050602061231c858286016121bf565b9150509250929050565b5f8115159050919050565b61233a81612326565b82525050565b5f6020820190506123535f830184612331565b92915050565b5f819050919050565b5f61237c6123776123728461228e565b612359565b61228e565b9050919050565b5f61238d82612362565b9050919050565b5f61239e82612383565b9050919050565b6123ae81612394565b82525050565b5f6020820190506123c75f8301846123a5565b92915050565b6123d6816121a0565b82525050565b5f6020820190506123ef5f8301846123cd565b92915050565b5f805f6060848603121561240c5761240b61219c565b5b5f612419868287016122d4565b935050602061242a868287016122d4565b925050604061243b868287016121bf565b9150509250925092565b5f60ff82169050919050565b61245a81612445565b82525050565b5f6020820190506124735f830184612451565b92915050565b612482816122ad565b82525050565b5f60208201905061249b5f830184612479565b92915050565b6124aa81612326565b81146124b4575f80fd5b50565b5f813590506124c5816124a1565b92915050565b5f602082840312156124e0576124df61219c565b5b5f6124ed848285016124b7565b91505092915050565b5f6020828403121561250b5761250a61219c565b5b5f612518848285016122d4565b91505092915050565b5f80604083850312156125375761253661219c565b5b5f612544858286016122d4565b9250506020612555858286016124b7565b9150509250929050565b5f80604083850312156125755761257461219c565b5b5f612582858286016122d4565b9250506020612593858286016122d4565b9150509250929050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52602260045260245ffd5b5f60028204905060018216806125e157607f821691505b6020821081036125f4576125f361259d565b5b50919050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601160045260245ffd5b5f8160011c9050919050565b5f808291508390505b600185111561267c57808604811115612658576126576125fa565b5b60018516156126675780820291505b808102905061267585612627565b945061263c565b94509492505050565b5f82612694576001905061274f565b816126a1575f905061274f565b81600181146126b757600281146126c1576126f0565b600191505061274f565b60ff8411156126d3576126d26125fa565b5b8360020a9150848211156126ea576126e96125fa565b5b5061274f565b5060208310610133831016604e8410600b84101617156127255782820a9050838111156127205761271f6125fa565b5b61274f565b6127328484846001612633565b92509050818404811115612749576127486125fa565b5b81810290505b9392505050565b5f612760826121a0565b915061276b83612445565b92506127987fffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffffff8484612685565b905092915050565b5f6127aa826121a0565b91506127b5836121a0565b92508282026127c3816121a0565b915082820484148315176127da576127d96125fa565b5b5092915050565b5f6127eb826121a0565b91506127f6836121a0565b925082820190508082111561280e5761280d6125fa565b5b92915050565b7f4e6f2062616c616e636520617661696c61626c650000000000000000000000005f82015250565b5f612848601483612208565b915061285382612814565b602082019050919050565b5f6020820190508181035f8301526128758161283c565b9050919050565b7f45524332303a2064656372656173656420616c6c6f77616e63652062656c6f775f8201527f207a65726f000000000000000000000000000000000000000000000000000000602082015250565b5f6128d6602583612208565b91506128e18261287c565b604082019050919050565b5f6020820190508181035f830152612903816128ca565b9050919050565b7f43616e6e6f742072656d6f766520746865206d61696e206c69717569646974795f8201527f2070616972210000000000000000000000000000000000000000000000000000602082015250565b5f612964602683612208565b915061296f8261290a565b604082019050919050565b5f6020820190508181035f83015261299181612958565b9050919050565b5f815190506129a6816122be565b92915050565b5f602082840312156129c1576129c061219c565b5b5f6129ce84828501612998565b91505092915050565b5f6040820190506129ea5f830185612479565b6129f76020830184612479565b9392505050565b7f45524332303a20617070726f76652066726f6d20746865207a65726f206164645f8201527f7265737300000000000000000000000000000000000000000000000000000000602082015250565b5f612a58602483612208565b9150612a63826129fe565b604082019050919050565b5f6020820190508181035f830152612a8581612a4c565b9050919050565b7f45524332303a20617070726f766520746f20746865207a65726f2061646472655f8201527f7373000000000000000000000000000000000000000000000000000000000000602082015250565b5f612ae6602283612208565b9150612af182612a8c565b604082019050919050565b5f6020820190508181035f830152612b1381612ada565b9050919050565b7f45524332303a20696e73756666696369656e7420616c6c6f77616e63650000005f82015250565b5f612b4e601d83612208565b9150612b5982612b1a565b602082019050919050565b5f6020820190508181035f830152612b7b81612b42565b9050919050565b7f696e76616c696420616d6f756e740000000000000000000000000000000000005f82015250565b5f612bb6600e83612208565b9150612bc182612b82565b602082019050919050565b5f6020820190508181035f830152612be381612baa565b9050919050565b7f4d61726b657420697320696e61637469766521000000000000000000000000005f82015250565b5f612c1e601383612208565b9150612c2982612bea565b602082019050919050565b5f6020820190508181035f830152612c4b81612c12565b9050919050565b5f612c5c826121a0565b9150612c67836121a0565b9250828203905081811115612c7f57612c7e6125fa565b5b92915050565b7f45524332303a206275726e2066726f6d20746865207a65726f206164647265735f8201527f7300000000000000000000000000000000000000000000000000000000000000602082015250565b5f612cdf602183612208565b9150612cea82612c85565b604082019050919050565b5f6020820190508181035f830152612d0c81612cd3565b9050919050565b7f45524332303a206275726e20616d6f756e7420657863656564732062616c616e5f8201527f6365000000000000000000000000000000000000000000000000000000000000602082015250565b5f612d6d602283612208565b9150612d7882612d13565b604082019050919050565b5f6020820190508181035f830152612d9a81612d61565b9050919050565b7f45524332303a207472616e736665722066726f6d20746865207a65726f2061645f8201527f6472657373000000000000000000000000000000000000000000000000000000602082015250565b5f612dfb602583612208565b9150612e0682612da1565b604082019050919050565b5f6020820190508181035f830152612e2881612def565b9050919050565b7f45524332303a207472616e7366657220746f20746865207a65726f20616464725f8201527f6573730000000000000000000000000000000000000000000000000000000000602082015250565b5f612e89602383612208565b9150612e9482612e2f565b604082019050919050565b5f6020820190508181035f830152612eb681612e7d565b9050919050565b7f45524332303a207472616e7366657220616d6f756e74206578636565647320625f8201527f616c616e63650000000000000000000000000000000000000000000000000000602082015250565b5f612f17602683612208565b9150612f2282612ebd565b604082019050919050565b5f6020820190508181035f830152612f4481612f0b565b9050919050565b7f4e487b71000000000000000000000000000000000000000000000000000000005f52601260045260245ffd5b5f612f82826121a0565b9150612f8d836121a0565b925082612f9d57612f9c612f4b565b5b82820490509291505056fea26469706673582212200a4b20b9e253e06ced3619dad32356019c571a81b7cc096a7723f594b056851664736f6c634300081a0033
Deployed Bytecode Sourcemap
122295:5238:0:-:0;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;124964:65;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;116927:100;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;117924:226;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;122361:37;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;117247:108;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;118158:295;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;122540:54;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;122831:20;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;117147:92;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;118461:263;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;125037:75;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;124490:216;;;;;;;;;;;;;:::i;:::-;;122405:16;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;125996:155;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;125120:68;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;127379:151;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;122858:30;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;122789:35;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;124121:81;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;117363:143;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;124899:57;;;;;;;;;;;;;:::i;:::-;;127220:151;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;124714:177;;;;;;;;;;;;;:::i;:::-;;117035:104;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;122902:45;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;118732:498;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;117514:218;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;126159:88;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;125549:309;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;122645:29;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;124210:272;;;;;;;;;;;;;:::i;:::-;;125196:98;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;125302:239;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;117740:176;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;122603:29;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;122691:21;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;122762:20;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;122963:23;;;;;;;;;;;;;:::i;:::-;;;;;;;:::i;:::-;;;;;;;;124964:65;125019:2;125015:1;:6;;;;124964:65;:::o;116927:100::-;116981:13;117014:5;117007:12;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;116927:100;:::o;117924:226::-;118032:4;118049:13;118065:12;:10;:12::i;:::-;118049:28;;118088:32;118097:5;118104:7;118113:6;118088:8;:32::i;:::-;118138:4;118131:11;;;117924:226;;;;:::o;122361:37::-;;;:::o;117247:108::-;117308:7;117335:12;;117328:19;;117247:108;:::o;118158:295::-;118289:4;118306:15;118324:12;:10;:12::i;:::-;118306:30;;118347:38;118363:4;118369:7;118378:6;118347:15;:38::i;:::-;118396:27;118406:4;118412:2;118416:6;118396:9;:27::i;:::-;118441:4;118434:11;;;118158:295;;;;;:::o;122540:54::-;122532:1;122587:2;:7;;;;:::i;:::-;122568:16;:26;;;;:::i;:::-;122540:54;:::o;122831:20::-;;;;;;;;;;;;;:::o;117147:92::-;117205:5;117230:1;117223:8;;117147:92;:::o;118461:263::-;118574:4;118591:13;118607:12;:10;:12::i;:::-;118591:28;;118630:64;118639:5;118646:7;118683:10;118655:25;118665:5;118672:7;118655:9;:25::i;:::-;:38;;;;:::i;:::-;118630:8;:64::i;:::-;118712:4;118705:11;;;118461:263;;;;:::o;125037:75::-;125102:2;125098:1;:6;;;;125037:75;:::o;124490:216::-;124575:1;124551:21;:25;124543:58;;;;;;;;;;;;:::i;:::-;;;;;;;;;124634:1;;;;;;;;;;;124620:15;;:10;:15;;;124612:24;;;;;;124655:10;124647:28;;:51;124676:21;124647:51;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;124490:216::o;122405:16::-;;;;;;;;;;;;;:::o;125996:155::-;126070:1;;;;;;;;;;;126056:15;;:10;:15;;;126052:92;;126092:2;126088:1;:6;;;;126052:92;;;126131:1;;126127;:5;;;;126052:92;125996:155;:::o;125120:68::-;125178:2;125174:1;;:6;;;;;;;;;;;;;;;;;;125120:68;:::o;127379:151::-;127449:1;;;;;;;;;;;127435:15;;:10;:15;;;127431:92;;127471:2;127467:1;:6;;;;127431:92;;;127510:1;;127506;:5;;;;127431:92;127379:151;:::o;122858:30::-;;;;:::o;122789:35::-;;;;:::o;124121:81::-;124173:21;124179:10;124191:2;124173:5;:21::i;:::-;124121:81;:::o;117363:143::-;117453:7;117480:9;:18;117490:7;117480:18;;;;;;;;;;;;;;;;117473:25;;117363:143;;;:::o;124899:57::-;124947:1;124943;:5;;;;124899:57::o;127220:151::-;127290:1;;;;;;;;;;;127276:15;;:10;:15;;;127272:92;;127312:2;127308:1;:6;;;;127272:92;;;127351:1;;127347;:5;;;;127272:92;127220:151;:::o;124714:177::-;124791:1;;;;;;;;;;;124777:15;;:10;:15;;;124769:24;;;;;;124804:10;124817:24;124835:4;124817:9;:24::i;:::-;124804:37;;124852:31;124870:4;124877:1;;;;;;;;;;;124880:2;124852:9;:31::i;:::-;124758:133;124714:177::o;117035:104::-;117091:13;117124:7;117117:14;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;117035:104;:::o;122902:45::-;;;;:::o;118732:498::-;118850:4;118867:13;118883:12;:10;:12::i;:::-;118867:28;;118906:24;118933:25;118943:5;118950:7;118933:9;:25::i;:::-;118906:52;;119011:15;118991:16;:35;;118969:122;;;;;;;;;;;;:::i;:::-;;;;;;;;;119127:60;119136:5;119143:7;119171:15;119152:16;:34;119127:8;:60::i;:::-;119218:4;119211:11;;;;118732:498;;;;:::o;117514:218::-;117618:4;117635:13;117651:12;:10;:12::i;:::-;117635:28;;117674;117684:5;117691:2;117695:6;117674:9;:28::i;:::-;117720:4;117713:11;;;117514:218;;;;:::o;126159:88::-;126210:4;126234:1;:5;126236:2;126234:5;;;;;;;;;;;;;;;;;;;;;;;;;126227:12;;126159:88;;;:::o;125549:309::-;125635:1;;;;;;;;;;;125621:15;;:10;:15;;;125617:234;;125667:1;;;;;;;;;;;125661:7;;:2;:7;;;125653:58;;;;;;;;;;;;:::i;:::-;;;;;;;;;125726:22;125741:2;125745;125726:14;:22::i;:::-;125617:234;;;125795:1;;;;;;;;;;;125789:7;;:2;:7;;;125781:58;;;;;;;;;;;;:::i;:::-;;;;;;;;;125617:234;125549:309;;:::o;122645:29::-;122673:1;122645:29;:::o;124210:272::-;124279:1;;;;;;;;;;;124265:15;;:10;:15;;;124261:214;;124301:4;124297:1;;:8;;;;;;;;;;;;;;;;;;124342:1;:9;;;:11;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;124324:38;;;124371:4;124378:1;:6;;;:8;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;124324:63;;;;;;;;;;;;;;;;:::i;:::-;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;:::i;:::-;124320:1;;:67;;;;;;;;;;;;;;;;;;124402:23;124417:1;;;;;;;;;;;124420:4;124402:14;:23::i;:::-;124261:214;;;124462:1;;;;;;;;;;;124458;;:5;;;;;;;;;;;;;;;;;;124261:214;124210:272::o;125196:98::-;125284:2;125276:1;:5;125278:2;125276:5;;;;;;;;;;;;;;;:10;;;;125196:98;;:::o;125302:239::-;125387:1;;;;;;;;;;;125373:15;;:10;:15;;;125369:162;;125413:2;125405:1;:5;125407:2;125405:5;;;;;;;;;;;;;;;;:10;;;;;;;;;;;;;;;;;;125451:2;125435:23;;;125455:2;125435:23;;;;;;:::i;:::-;;;;;;;;125369:162;;;125512:2;125496:23;;;125516:2;125496:23;;;;;;:::i;:::-;;;;;;;;125369:162;125302:239;;:::o;117740:176::-;117854:7;117881:11;:18;117893:5;117881:18;;;;;;;;;;;;;;;:27;117900:7;117881:27;;;;;;;;;;;;;;;;117874:34;;117740:176;;;;:::o;122603:29::-;122631:1;122603:29;:::o;122691:21::-;;;;;;;;;;;;;:::o;122762:20::-;;;;:::o;122963:23::-;;;;:::o;108179:98::-;108232:7;108259:10;108252:17;;108179:98;:::o;121004:380::-;121157:1;121140:19;;:5;:19;;;121132:68;;;;;;;;;;;;:::i;:::-;;;;;;;;;121238:1;121219:21;;:7;:21;;;121211:68;;;;;;;;;;;;:::i;:::-;;;;;;;;;121322:6;121292:11;:18;121304:5;121292:18;;;;;;;;;;;;;;;:27;121311:7;121292:27;;;;;;;;;;;;;;;:36;;;;121360:7;121344:32;;121353:5;121344:32;;;121369:6;121344:32;;;;;;:::i;:::-;;;;;;;;121004:380;;;:::o;121392:502::-;121527:24;121554:25;121564:5;121571:7;121554:9;:25::i;:::-;121527:52;;121614:17;121594:16;:37;121590:297;;121694:6;121674:16;:26;;121648:117;;;;;;;;;;;;:::i;:::-;;;;;;;;;121809:51;121818:5;121825:7;121853:6;121834:16;:25;121809:8;:51::i;:::-;121590:297;121516:378;121392:502;;;:::o;126255:957::-;126353:1;;126347:2;:7;;:18;;;;;126364:1;;126358:2;:7;;126347:18;126339:45;;;;;;;;;;;;:::i;:::-;;;;;;;;;126405:1;126399:2;:7;126395:87;;126423:26;126439:2;126443;126447:1;126423:15;:26::i;:::-;126464:7;;126395:87;126504:1;;;;;;;;;;;126498:7;;:2;:7;;;;:18;;;;;126515:1;;;;;;;;;;;126509:7;;:2;:7;;;;126498:18;:38;;;;;126534:1;126520:16;;:2;:16;;;;126498:38;:49;;;;;122489:6;126540:7;;:2;:7;;;;126498:49;126494:231;;;126569:1;;;;;;;;;;;126564:150;;126621:1;:5;126623:2;126621:5;;;;;;;;;;;;;;;;;;;;;;;;;:14;;;;126630:1;:5;126632:2;126630:5;;;;;;;;;;;;;;;;;;;;;;;;;126621:14;126591:107;;;;;;;;;;;;:::i;:::-;;;;;;;;;126564:150;126494:231;126737:7;126748:1;:5;126750:2;126748:5;;;;;;;;;;;;;;;;;;;;;;;;;126747:6;:16;;;;;126758:1;:5;126760:2;126758:5;;;;;;;;;;;;;;;;;;;;;;;;;126757:6;126747:16;126737:26;;126776:10;126805:2;126801:296;;;126828:1;:5;126830:2;126828:5;;;;;;;;;;;;;;;;;;;;;;;;;126824:140;;;126859:16;126873:1;;126859:9;122673:1;126859:2;:6;;:9;;;;:::i;:::-;:13;;:16;;;;:::i;:::-;126854:21;;126824:140;;;126901:1;:5;126903:2;126901:5;;;;;;;;;;;;;;;;;;;;;;;;;126897:67;;;126932:16;126946:1;;126932:9;122631:1;126932:2;:6;;:9;;;;:::i;:::-;:13;;:16;;;;:::i;:::-;126927:21;;126897:67;126824:140;126987:1;126982:2;:6;126978:85;;;127009:38;127025:2;127037:4;127044:2;127009:15;:38::i;:::-;126978:85;127083:2;127077:8;;;;;:::i;:::-;;;126801:296;127107:27;127123:2;127127;127131;127107:15;:27::i;:::-;127155:15;127147:1;:5;127149:2;127147:5;;;;;;;;;;;;;;;:23;;;;127189:15;127181:1;:5;127183:2;127181:5;;;;;;;;;;;;;;;:23;;;;126328:884;;126255:957;;;;:::o;120401:595::-;120504:1;120485:21;;:7;:21;;;120477:67;;;;;;;;;;;;:::i;:::-;;;;;;;;;120557:49;120578:7;120595:1;120599:6;120557:20;:49::i;:::-;120619:22;120644:9;:18;120654:7;120644:18;;;;;;;;;;;;;;;;120619:43;;120699:6;120681:14;:24;;120673:71;;;;;;;;;;;;:::i;:::-;;;;;;;;;120818:6;120801:14;:23;120780:9;:18;120790:7;120780:18;;;;;;;;;;;;;;;:44;;;;120855:6;120839:12;;:22;;;;;;;;;;;120916:1;120890:37;;120899:7;120890:37;;;120920:6;120890:37;;;;;;:::i;:::-;;;;;;;;120940:48;120960:7;120977:1;120981:6;120940:19;:48::i;:::-;120466:530;120401:595;;:::o;125866:122::-;125938:2;125930:1;:5;125932:2;125930:5;;;;;;;;;;;;;;;;:10;;;;;;;;;;;;;;;;;;125977:2;125956:24;;125973:2;125956:24;;;;;;;;;;;;125866:122;;:::o;119238:712::-;119385:1;119369:18;;:4;:18;;;119361:68;;;;;;;;;;;;:::i;:::-;;;;;;;;;119462:1;119448:16;;:2;:16;;;119440:64;;;;;;;;;;;;:::i;:::-;;;;;;;;;119517:38;119538:4;119544:2;119548:6;119517:20;:38::i;:::-;119568:19;119590:9;:15;119600:4;119590:15;;;;;;;;;;;;;;;;119568:37;;119653:6;119638:11;:21;;119616:109;;;;;;;;;;;;:::i;:::-;;;;;;;;;119793:6;119779:11;:20;119761:9;:15;119771:4;119761:15;;;;;;;;;;;;;;;:38;;;;119831:6;119814:9;:13;119824:2;119814:13;;;;;;;;;;;;;;;;:23;;;;;;;;;;;119881:2;119866:26;;119875:4;119866:26;;;119885:6;119866:26;;;;;;:::i;:::-;;;;;;;;119905:37;119925:4;119931:2;119935:6;119905:19;:37::i;:::-;119350:600;119238:712;;;:::o;115280:98::-;115338:7;115369:1;115365;:5;;;;:::i;:::-;115358:12;;115280:98;;;;:::o;115386:::-;115444:7;115475:1;115471;:5;;;;:::i;:::-;115464:12;;115386:98;;;;:::o;121902:125::-;;;;:::o;122035:124::-;;;;:::o;88:117:1:-;197:1;194;187:12;334:77;371:7;400:5;389:16;;334:77;;;:::o;417:122::-;490:24;508:5;490:24;:::i;:::-;483:5;480:35;470:63;;529:1;526;519:12;470:63;417:122;:::o;545:139::-;591:5;629:6;616:20;607:29;;645:33;672:5;645:33;:::i;:::-;545:139;;;;:::o;690:329::-;749:6;798:2;786:9;777:7;773:23;769:32;766:119;;;804:79;;:::i;:::-;766:119;924:1;949:53;994:7;985:6;974:9;970:22;949:53;:::i;:::-;939:63;;895:117;690:329;;;;:::o;1025:99::-;1077:6;1111:5;1105:12;1095:22;;1025:99;;;:::o;1130:169::-;1214:11;1248:6;1243:3;1236:19;1288:4;1283:3;1279:14;1264:29;;1130:169;;;;:::o;1305:139::-;1394:6;1389:3;1384;1378:23;1435:1;1426:6;1421:3;1417:16;1410:27;1305:139;;;:::o;1450:102::-;1491:6;1542:2;1538:7;1533:2;1526:5;1522:14;1518:28;1508:38;;1450:102;;;:::o;1558:377::-;1646:3;1674:39;1707:5;1674:39;:::i;:::-;1729:71;1793:6;1788:3;1729:71;:::i;:::-;1722:78;;1809:65;1867:6;1862:3;1855:4;1848:5;1844:16;1809:65;:::i;:::-;1899:29;1921:6;1899:29;:::i;:::-;1894:3;1890:39;1883:46;;1650:285;1558:377;;;;:::o;1941:313::-;2054:4;2092:2;2081:9;2077:18;2069:26;;2141:9;2135:4;2131:20;2127:1;2116:9;2112:17;2105:47;2169:78;2242:4;2233:6;2169:78;:::i;:::-;2161:86;;1941:313;;;;:::o;2260:126::-;2297:7;2337:42;2330:5;2326:54;2315:65;;2260:126;;;:::o;2392:96::-;2429:7;2458:24;2476:5;2458:24;:::i;:::-;2447:35;;2392:96;;;:::o;2494:122::-;2567:24;2585:5;2567:24;:::i;:::-;2560:5;2557:35;2547:63;;2606:1;2603;2596:12;2547:63;2494:122;:::o;2622:139::-;2668:5;2706:6;2693:20;2684:29;;2722:33;2749:5;2722:33;:::i;:::-;2622:139;;;;:::o;2767:474::-;2835:6;2843;2892:2;2880:9;2871:7;2867:23;2863:32;2860:119;;;2898:79;;:::i;:::-;2860:119;3018:1;3043:53;3088:7;3079:6;3068:9;3064:22;3043:53;:::i;:::-;3033:63;;2989:117;3145:2;3171:53;3216:7;3207:6;3196:9;3192:22;3171:53;:::i;:::-;3161:63;;3116:118;2767:474;;;;;:::o;3247:90::-;3281:7;3324:5;3317:13;3310:21;3299:32;;3247:90;;;:::o;3343:109::-;3424:21;3439:5;3424:21;:::i;:::-;3419:3;3412:34;3343:109;;:::o;3458:210::-;3545:4;3583:2;3572:9;3568:18;3560:26;;3596:65;3658:1;3647:9;3643:17;3634:6;3596:65;:::i;:::-;3458:210;;;;:::o;3674:60::-;3702:3;3723:5;3716:12;;3674:60;;;:::o;3740:142::-;3790:9;3823:53;3841:34;3850:24;3868:5;3850:24;:::i;:::-;3841:34;:::i;:::-;3823:53;:::i;:::-;3810:66;;3740:142;;;:::o;3888:126::-;3938:9;3971:37;4002:5;3971:37;:::i;:::-;3958:50;;3888:126;;;:::o;4020:153::-;4097:9;4130:37;4161:5;4130:37;:::i;:::-;4117:50;;4020:153;;;:::o;4179:185::-;4293:64;4351:5;4293:64;:::i;:::-;4288:3;4281:77;4179:185;;:::o;4370:276::-;4490:4;4528:2;4517:9;4513:18;4505:26;;4541:98;4636:1;4625:9;4621:17;4612:6;4541:98;:::i;:::-;4370:276;;;;:::o;4652:118::-;4739:24;4757:5;4739:24;:::i;:::-;4734:3;4727:37;4652:118;;:::o;4776:222::-;4869:4;4907:2;4896:9;4892:18;4884:26;;4920:71;4988:1;4977:9;4973:17;4964:6;4920:71;:::i;:::-;4776:222;;;;:::o;5004:619::-;5081:6;5089;5097;5146:2;5134:9;5125:7;5121:23;5117:32;5114:119;;;5152:79;;:::i;:::-;5114:119;5272:1;5297:53;5342:7;5333:6;5322:9;5318:22;5297:53;:::i;:::-;5287:63;;5243:117;5399:2;5425:53;5470:7;5461:6;5450:9;5446:22;5425:53;:::i;:::-;5415:63;;5370:118;5527:2;5553:53;5598:7;5589:6;5578:9;5574:22;5553:53;:::i;:::-;5543:63;;5498:118;5004:619;;;;;:::o;5629:86::-;5664:7;5704:4;5697:5;5693:16;5682:27;;5629:86;;;:::o;5721:112::-;5804:22;5820:5;5804:22;:::i;:::-;5799:3;5792:35;5721:112;;:::o;5839:214::-;5928:4;5966:2;5955:9;5951:18;5943:26;;5979:67;6043:1;6032:9;6028:17;6019:6;5979:67;:::i;:::-;5839:214;;;;:::o;6059:118::-;6146:24;6164:5;6146:24;:::i;:::-;6141:3;6134:37;6059:118;;:::o;6183:222::-;6276:4;6314:2;6303:9;6299:18;6291:26;;6327:71;6395:1;6384:9;6380:17;6371:6;6327:71;:::i;:::-;6183:222;;;;:::o;6411:116::-;6481:21;6496:5;6481:21;:::i;:::-;6474:5;6471:32;6461:60;;6517:1;6514;6507:12;6461:60;6411:116;:::o;6533:133::-;6576:5;6614:6;6601:20;6592:29;;6630:30;6654:5;6630:30;:::i;:::-;6533:133;;;;:::o;6672:323::-;6728:6;6777:2;6765:9;6756:7;6752:23;6748:32;6745:119;;;6783:79;;:::i;:::-;6745:119;6903:1;6928:50;6970:7;6961:6;6950:9;6946:22;6928:50;:::i;:::-;6918:60;;6874:114;6672:323;;;;:::o;7001:329::-;7060:6;7109:2;7097:9;7088:7;7084:23;7080:32;7077:119;;;7115:79;;:::i;:::-;7077:119;7235:1;7260:53;7305:7;7296:6;7285:9;7281:22;7260:53;:::i;:::-;7250:63;;7206:117;7001:329;;;;:::o;7336:468::-;7401:6;7409;7458:2;7446:9;7437:7;7433:23;7429:32;7426:119;;;7464:79;;:::i;:::-;7426:119;7584:1;7609:53;7654:7;7645:6;7634:9;7630:22;7609:53;:::i;:::-;7599:63;;7555:117;7711:2;7737:50;7779:7;7770:6;7759:9;7755:22;7737:50;:::i;:::-;7727:60;;7682:115;7336:468;;;;;:::o;7810:474::-;7878:6;7886;7935:2;7923:9;7914:7;7910:23;7906:32;7903:119;;;7941:79;;:::i;:::-;7903:119;8061:1;8086:53;8131:7;8122:6;8111:9;8107:22;8086:53;:::i;:::-;8076:63;;8032:117;8188:2;8214:53;8259:7;8250:6;8239:9;8235:22;8214:53;:::i;:::-;8204:63;;8159:118;7810:474;;;;;:::o;8290:180::-;8338:77;8335:1;8328:88;8435:4;8432:1;8425:15;8459:4;8456:1;8449:15;8476:320;8520:6;8557:1;8551:4;8547:12;8537:22;;8604:1;8598:4;8594:12;8625:18;8615:81;;8681:4;8673:6;8669:17;8659:27;;8615:81;8743:2;8735:6;8732:14;8712:18;8709:38;8706:84;;8762:18;;:::i;:::-;8706:84;8527:269;8476:320;;;:::o;8802:180::-;8850:77;8847:1;8840:88;8947:4;8944:1;8937:15;8971:4;8968:1;8961:15;8988:102;9030:8;9077:5;9074:1;9070:13;9049:34;;8988:102;;;:::o;9096:848::-;9157:5;9164:4;9188:6;9179:15;;9212:5;9203:14;;9226:712;9247:1;9237:8;9234:15;9226:712;;;9342:4;9337:3;9333:14;9327:4;9324:24;9321:50;;;9351:18;;:::i;:::-;9321:50;9401:1;9391:8;9387:16;9384:451;;;9816:4;9809:5;9805:16;9796:25;;9384:451;9866:4;9860;9856:15;9848:23;;9896:32;9919:8;9896:32;:::i;:::-;9884:44;;9226:712;;;9096:848;;;;;;;:::o;9950:1073::-;10004:5;10195:8;10185:40;;10216:1;10207:10;;10218:5;;10185:40;10244:4;10234:36;;10261:1;10252:10;;10263:5;;10234:36;10330:4;10378:1;10373:27;;;;10414:1;10409:191;;;;10323:277;;10373:27;10391:1;10382:10;;10393:5;;;10409:191;10454:3;10444:8;10441:17;10438:43;;;10461:18;;:::i;:::-;10438:43;10510:8;10507:1;10503:16;10494:25;;10545:3;10538:5;10535:14;10532:40;;;10552:18;;:::i;:::-;10532:40;10585:5;;;10323:277;;10709:2;10699:8;10696:16;10690:3;10684:4;10681:13;10677:36;10659:2;10649:8;10646:16;10641:2;10635:4;10632:12;10628:35;10612:111;10609:246;;;10765:8;10759:4;10755:19;10746:28;;10800:3;10793:5;10790:14;10787:40;;;10807:18;;:::i;:::-;10787:40;10840:5;;10609:246;10880:42;10918:3;10908:8;10902:4;10899:1;10880:42;:::i;:::-;10865:57;;;;10954:4;10949:3;10945:14;10938:5;10935:25;10932:51;;;10963:18;;:::i;:::-;10932:51;11012:4;11005:5;11001:16;10992:25;;9950:1073;;;;;;:::o;11029:281::-;11087:5;11111:23;11129:4;11111:23;:::i;:::-;11103:31;;11155:25;11171:8;11155:25;:::i;:::-;11143:37;;11199:104;11236:66;11226:8;11220:4;11199:104;:::i;:::-;11190:113;;11029:281;;;;:::o;11316:410::-;11356:7;11379:20;11397:1;11379:20;:::i;:::-;11374:25;;11413:20;11431:1;11413:20;:::i;:::-;11408:25;;11468:1;11465;11461:9;11490:30;11508:11;11490:30;:::i;:::-;11479:41;;11669:1;11660:7;11656:15;11653:1;11650:22;11630:1;11623:9;11603:83;11580:139;;11699:18;;:::i;:::-;11580:139;11364:362;11316:410;;;;:::o;11732:191::-;11772:3;11791:20;11809:1;11791:20;:::i;:::-;11786:25;;11825:20;11843:1;11825:20;:::i;:::-;11820:25;;11868:1;11865;11861:9;11854:16;;11889:3;11886:1;11883:10;11880:36;;;11896:18;;:::i;:::-;11880:36;11732:191;;;;:::o;11929:170::-;12069:22;12065:1;12057:6;12053:14;12046:46;11929:170;:::o;12105:366::-;12247:3;12268:67;12332:2;12327:3;12268:67;:::i;:::-;12261:74;;12344:93;12433:3;12344:93;:::i;:::-;12462:2;12457:3;12453:12;12446:19;;12105:366;;;:::o;12477:419::-;12643:4;12681:2;12670:9;12666:18;12658:26;;12730:9;12724:4;12720:20;12716:1;12705:9;12701:17;12694:47;12758:131;12884:4;12758:131;:::i;:::-;12750:139;;12477:419;;;:::o;12902:224::-;13042:34;13038:1;13030:6;13026:14;13019:58;13111:7;13106:2;13098:6;13094:15;13087:32;12902:224;:::o;13132:366::-;13274:3;13295:67;13359:2;13354:3;13295:67;:::i;:::-;13288:74;;13371:93;13460:3;13371:93;:::i;:::-;13489:2;13484:3;13480:12;13473:19;;13132:366;;;:::o;13504:419::-;13670:4;13708:2;13697:9;13693:18;13685:26;;13757:9;13751:4;13747:20;13743:1;13732:9;13728:17;13721:47;13785:131;13911:4;13785:131;:::i;:::-;13777:139;;13504:419;;;:::o;13929:225::-;14069:34;14065:1;14057:6;14053:14;14046:58;14138:8;14133:2;14125:6;14121:15;14114:33;13929:225;:::o;14160:366::-;14302:3;14323:67;14387:2;14382:3;14323:67;:::i;:::-;14316:74;;14399:93;14488:3;14399:93;:::i;:::-;14517:2;14512:3;14508:12;14501:19;;14160:366;;;:::o;14532:419::-;14698:4;14736:2;14725:9;14721:18;14713:26;;14785:9;14779:4;14775:20;14771:1;14760:9;14756:17;14749:47;14813:131;14939:4;14813:131;:::i;:::-;14805:139;;14532:419;;;:::o;14957:143::-;15014:5;15045:6;15039:13;15030:22;;15061:33;15088:5;15061:33;:::i;:::-;14957:143;;;;:::o;15106:351::-;15176:6;15225:2;15213:9;15204:7;15200:23;15196:32;15193:119;;;15231:79;;:::i;:::-;15193:119;15351:1;15376:64;15432:7;15423:6;15412:9;15408:22;15376:64;:::i;:::-;15366:74;;15322:128;15106:351;;;;:::o;15463:332::-;15584:4;15622:2;15611:9;15607:18;15599:26;;15635:71;15703:1;15692:9;15688:17;15679:6;15635:71;:::i;:::-;15716:72;15784:2;15773:9;15769:18;15760:6;15716:72;:::i;:::-;15463:332;;;;;:::o;15801:223::-;15941:34;15937:1;15929:6;15925:14;15918:58;16010:6;16005:2;15997:6;15993:15;15986:31;15801:223;:::o;16030:366::-;16172:3;16193:67;16257:2;16252:3;16193:67;:::i;:::-;16186:74;;16269:93;16358:3;16269:93;:::i;:::-;16387:2;16382:3;16378:12;16371:19;;16030:366;;;:::o;16402:419::-;16568:4;16606:2;16595:9;16591:18;16583:26;;16655:9;16649:4;16645:20;16641:1;16630:9;16626:17;16619:47;16683:131;16809:4;16683:131;:::i;:::-;16675:139;;16402:419;;;:::o;16827:221::-;16967:34;16963:1;16955:6;16951:14;16944:58;17036:4;17031:2;17023:6;17019:15;17012:29;16827:221;:::o;17054:366::-;17196:3;17217:67;17281:2;17276:3;17217:67;:::i;:::-;17210:74;;17293:93;17382:3;17293:93;:::i;:::-;17411:2;17406:3;17402:12;17395:19;;17054:366;;;:::o;17426:419::-;17592:4;17630:2;17619:9;17615:18;17607:26;;17679:9;17673:4;17669:20;17665:1;17654:9;17650:17;17643:47;17707:131;17833:4;17707:131;:::i;:::-;17699:139;;17426:419;;;:::o;17851:179::-;17991:31;17987:1;17979:6;17975:14;17968:55;17851:179;:::o;18036:366::-;18178:3;18199:67;18263:2;18258:3;18199:67;:::i;:::-;18192:74;;18275:93;18364:3;18275:93;:::i;:::-;18393:2;18388:3;18384:12;18377:19;;18036:366;;;:::o;18408:419::-;18574:4;18612:2;18601:9;18597:18;18589:26;;18661:9;18655:4;18651:20;18647:1;18636:9;18632:17;18625:47;18689:131;18815:4;18689:131;:::i;:::-;18681:139;;18408:419;;;:::o;18833:164::-;18973:16;18969:1;18961:6;18957:14;18950:40;18833:164;:::o;19003:366::-;19145:3;19166:67;19230:2;19225:3;19166:67;:::i;:::-;19159:74;;19242:93;19331:3;19242:93;:::i;:::-;19360:2;19355:3;19351:12;19344:19;;19003:366;;;:::o;19375:419::-;19541:4;19579:2;19568:9;19564:18;19556:26;;19628:9;19622:4;19618:20;19614:1;19603:9;19599:17;19592:47;19656:131;19782:4;19656:131;:::i;:::-;19648:139;;19375:419;;;:::o;19800:169::-;19940:21;19936:1;19928:6;19924:14;19917:45;19800:169;:::o;19975:366::-;20117:3;20138:67;20202:2;20197:3;20138:67;:::i;:::-;20131:74;;20214:93;20303:3;20214:93;:::i;:::-;20332:2;20327:3;20323:12;20316:19;;19975:366;;;:::o;20347:419::-;20513:4;20551:2;20540:9;20536:18;20528:26;;20600:9;20594:4;20590:20;20586:1;20575:9;20571:17;20564:47;20628:131;20754:4;20628:131;:::i;:::-;20620:139;;20347:419;;;:::o;20772:194::-;20812:4;20832:20;20850:1;20832:20;:::i;:::-;20827:25;;20866:20;20884:1;20866:20;:::i;:::-;20861:25;;20910:1;20907;20903:9;20895:17;;20934:1;20928:4;20925:11;20922:37;;;20939:18;;:::i;:::-;20922:37;20772:194;;;;:::o;20972:220::-;21112:34;21108:1;21100:6;21096:14;21089:58;21181:3;21176:2;21168:6;21164:15;21157:28;20972:220;:::o;21198:366::-;21340:3;21361:67;21425:2;21420:3;21361:67;:::i;:::-;21354:74;;21437:93;21526:3;21437:93;:::i;:::-;21555:2;21550:3;21546:12;21539:19;;21198:366;;;:::o;21570:419::-;21736:4;21774:2;21763:9;21759:18;21751:26;;21823:9;21817:4;21813:20;21809:1;21798:9;21794:17;21787:47;21851:131;21977:4;21851:131;:::i;:::-;21843:139;;21570:419;;;:::o;21995:221::-;22135:34;22131:1;22123:6;22119:14;22112:58;22204:4;22199:2;22191:6;22187:15;22180:29;21995:221;:::o;22222:366::-;22364:3;22385:67;22449:2;22444:3;22385:67;:::i;:::-;22378:74;;22461:93;22550:3;22461:93;:::i;:::-;22579:2;22574:3;22570:12;22563:19;;22222:366;;;:::o;22594:419::-;22760:4;22798:2;22787:9;22783:18;22775:26;;22847:9;22841:4;22837:20;22833:1;22822:9;22818:17;22811:47;22875:131;23001:4;22875:131;:::i;:::-;22867:139;;22594:419;;;:::o;23019:224::-;23159:34;23155:1;23147:6;23143:14;23136:58;23228:7;23223:2;23215:6;23211:15;23204:32;23019:224;:::o;23249:366::-;23391:3;23412:67;23476:2;23471:3;23412:67;:::i;:::-;23405:74;;23488:93;23577:3;23488:93;:::i;:::-;23606:2;23601:3;23597:12;23590:19;;23249:366;;;:::o;23621:419::-;23787:4;23825:2;23814:9;23810:18;23802:26;;23874:9;23868:4;23864:20;23860:1;23849:9;23845:17;23838:47;23902:131;24028:4;23902:131;:::i;:::-;23894:139;;23621:419;;;:::o;24046:222::-;24186:34;24182:1;24174:6;24170:14;24163:58;24255:5;24250:2;24242:6;24238:15;24231:30;24046:222;:::o;24274:366::-;24416:3;24437:67;24501:2;24496:3;24437:67;:::i;:::-;24430:74;;24513:93;24602:3;24513:93;:::i;:::-;24631:2;24626:3;24622:12;24615:19;;24274:366;;;:::o;24646:419::-;24812:4;24850:2;24839:9;24835:18;24827:26;;24899:9;24893:4;24889:20;24885:1;24874:9;24870:17;24863:47;24927:131;25053:4;24927:131;:::i;:::-;24919:139;;24646:419;;;:::o;25071:225::-;25211:34;25207:1;25199:6;25195:14;25188:58;25280:8;25275:2;25267:6;25263:15;25256:33;25071:225;:::o;25302:366::-;25444:3;25465:67;25529:2;25524:3;25465:67;:::i;:::-;25458:74;;25541:93;25630:3;25541:93;:::i;:::-;25659:2;25654:3;25650:12;25643:19;;25302:366;;;:::o;25674:419::-;25840:4;25878:2;25867:9;25863:18;25855:26;;25927:9;25921:4;25917:20;25913:1;25902:9;25898:17;25891:47;25955:131;26081:4;25955:131;:::i;:::-;25947:139;;25674:419;;;:::o;26099:180::-;26147:77;26144:1;26137:88;26244:4;26241:1;26234:15;26268:4;26265:1;26258:15;26285:185;26325:1;26342:20;26360:1;26342:20;:::i;:::-;26337:25;;26376:20;26394:1;26376:20;:::i;:::-;26371:25;;26415:1;26405:35;;26420:18;;:::i;:::-;26405:35;26462:1;26459;26455:9;26450:14;;26285:185;;;;:::o
Swarm Source
ipfs://0a4b20b9e253e06ced3619dad32356019c571a81b7cc096a7723f594b0568516
Loading...
Loading
Loading...
Loading
[ Download: CSV Export ]
[ Download: CSV Export ]
A token is a representation of an on-chain or off-chain asset. The token page shows information such as price, total supply, holders, transfers and social links. Learn more about this page in our Knowledge Base.