Overview
POL Balance
0 POL
POL Value
$0.00More Info
Private Name Tags
ContractCreator
Loading...
Loading
Contract Name:
IntegrationHelper
Compiler Version
v0.8.14+commit.80d49f37
Optimization Enabled:
Yes with 20000 runs
Other Settings:
default evmVersion
Contract Source Code (Solidity Standard Json-Input format)
// SPDX-License-Identifier: MIT pragma solidity =0.8.14; /* ░██╗░░░░░░░██╗░█████╗░░█████╗░░░░░░░███████╗██╗ ░██║░░██╗░░██║██╔══██╗██╔══██╗░░░░░░██╔════╝██║ ░╚██╗████╗██╔╝██║░░██║██║░░██║█████╗█████╗░░██║ ░░████╔═████║░██║░░██║██║░░██║╚════╝██╔══╝░░██║ ░░╚██╔╝░╚██╔╝░╚█████╔╝╚█████╔╝░░░░░░██║░░░░░██║ ░░░╚═╝░░░╚═╝░░░╚════╝░░╚════╝░░░░░░░╚═╝░░░░░╚═╝ * * MIT License * =========== * * Copyright (c) 2020 WooTrade * * Permission is hereby granted, free of charge, to any person obtaining a copy * of this software and associated documentation files (the "Software"), to deal * in the Software without restriction, including without limitation the rights * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell * copies of the Software, and to permit persons to whom the Software is * furnished to do so, subject to the following conditions: * * The above copyright notice and this permission notice shall be included in all * copies or substantial portions of the Software. * * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE. */ // OpenZeppelin Contracts import {Ownable} from "@openzeppelin/contracts/access/Ownable.sol"; import {EnumerableSet} from "@openzeppelin/contracts/utils/structs/EnumerableSet.sol"; contract IntegrationHelper is Ownable { using EnumerableSet for EnumerableSet.AddressSet; address public quoteToken; EnumerableSet.AddressSet private baseTokens; constructor(address _quoteToken, address[] memory _baseTokens) { quoteToken = _quoteToken; unchecked { for (uint256 i = 0; i < _baseTokens.length; ++i) { baseTokens.add(_baseTokens[i]); } } } function getSupportTokens() external view returns (address, address[] memory) { return (quoteToken, allBaseTokens()); } function allBaseTokensLength() external view returns (uint256) { return baseTokens.length(); } function allBaseTokens() public view returns (address[] memory) { uint256 length = baseTokens.length(); address[] memory tokens = new address[](length); unchecked { for (uint256 i = 0; i < length; ++i) { tokens[i] = baseTokens.at(i); } } return tokens; } function setQutoeToken(address _quoteToken) external onlyOwner { quoteToken = _quoteToken; } function addBaseToken(address token) external onlyOwner { bool success = baseTokens.add(token); require(success, "IntegrationHelper: token exist"); } function removeBaseToken(address token) external onlyOwner { bool success = baseTokens.remove(token); require(success, "IntegrationHelper: token not exist"); } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v4.7.0) (utils/structs/EnumerableSet.sol) pragma solidity ^0.8.0; /** * @dev Library for managing * https://en.wikipedia.org/wiki/Set_(abstract_data_type)[sets] of primitive * types. * * Sets have the following properties: * * - Elements are added, removed, and checked for existence in constant time * (O(1)). * - Elements are enumerated in O(n). No guarantees are made on the ordering. * * ``` * contract Example { * // Add the library methods * using EnumerableSet for EnumerableSet.AddressSet; * * // Declare a set state variable * EnumerableSet.AddressSet private mySet; * } * ``` * * As of v3.3.0, sets of type `bytes32` (`Bytes32Set`), `address` (`AddressSet`) * and `uint256` (`UintSet`) are supported. * * [WARNING] * ==== * Trying to delete such a structure from storage will likely result in data corruption, rendering the structure unusable. * See https://github.com/ethereum/solidity/pull/11843[ethereum/solidity#11843] for more info. * * In order to clean an EnumerableSet, you can either remove all elements one by one or create a fresh instance using an array of EnumerableSet. * ==== */ library EnumerableSet { // To implement this library for multiple types with as little code // repetition as possible, we write it in terms of a generic Set type with // bytes32 values. // The Set implementation uses private functions, and user-facing // implementations (such as AddressSet) are just wrappers around the // underlying Set. // This means that we can only create new EnumerableSets for types that fit // in bytes32. struct Set { // Storage of set values bytes32[] _values; // Position of the value in the `values` array, plus 1 because index 0 // means a value is not in the set. mapping(bytes32 => uint256) _indexes; } /** * @dev Add a value to a set. O(1). * * Returns true if the value was added to the set, that is if it was not * already present. */ function _add(Set storage set, bytes32 value) private returns (bool) { if (!_contains(set, value)) { set._values.push(value); // The value is stored at length-1, but we add 1 to all indexes // and use 0 as a sentinel value set._indexes[value] = set._values.length; return true; } else { return false; } } /** * @dev Removes a value from a set. O(1). * * Returns true if the value was removed from the set, that is if it was * present. */ function _remove(Set storage set, bytes32 value) private returns (bool) { // We read and store the value's index to prevent multiple reads from the same storage slot uint256 valueIndex = set._indexes[value]; if (valueIndex != 0) { // Equivalent to contains(set, value) // To delete an element from the _values array in O(1), we swap the element to delete with the last one in // the array, and then remove the last element (sometimes called as 'swap and pop'). // This modifies the order of the array, as noted in {at}. uint256 toDeleteIndex = valueIndex - 1; uint256 lastIndex = set._values.length - 1; if (lastIndex != toDeleteIndex) { bytes32 lastValue = set._values[lastIndex]; // Move the last value to the index where the value to delete is set._values[toDeleteIndex] = lastValue; // Update the index for the moved value set._indexes[lastValue] = valueIndex; // Replace lastValue's index to valueIndex } // Delete the slot where the moved value was stored set._values.pop(); // Delete the index for the deleted slot delete set._indexes[value]; return true; } else { return false; } } /** * @dev Returns true if the value is in the set. O(1). */ function _contains(Set storage set, bytes32 value) private view returns (bool) { return set._indexes[value] != 0; } /** * @dev Returns the number of values on the set. O(1). */ function _length(Set storage set) private view returns (uint256) { return set._values.length; } /** * @dev Returns the value stored at position `index` in the set. O(1). * * Note that there are no guarantees on the ordering of values inside the * array, and it may change when more values are added or removed. * * Requirements: * * - `index` must be strictly less than {length}. */ function _at(Set storage set, uint256 index) private view returns (bytes32) { return set._values[index]; } /** * @dev Return the entire set in an array * * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that * this function has an unbounded cost, and using it as part of a state-changing function may render the function * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block. */ function _values(Set storage set) private view returns (bytes32[] memory) { return set._values; } // Bytes32Set struct Bytes32Set { Set _inner; } /** * @dev Add a value to a set. O(1). * * Returns true if the value was added to the set, that is if it was not * already present. */ function add(Bytes32Set storage set, bytes32 value) internal returns (bool) { return _add(set._inner, value); } /** * @dev Removes a value from a set. O(1). * * Returns true if the value was removed from the set, that is if it was * present. */ function remove(Bytes32Set storage set, bytes32 value) internal returns (bool) { return _remove(set._inner, value); } /** * @dev Returns true if the value is in the set. O(1). */ function contains(Bytes32Set storage set, bytes32 value) internal view returns (bool) { return _contains(set._inner, value); } /** * @dev Returns the number of values in the set. O(1). */ function length(Bytes32Set storage set) internal view returns (uint256) { return _length(set._inner); } /** * @dev Returns the value stored at position `index` in the set. O(1). * * Note that there are no guarantees on the ordering of values inside the * array, and it may change when more values are added or removed. * * Requirements: * * - `index` must be strictly less than {length}. */ function at(Bytes32Set storage set, uint256 index) internal view returns (bytes32) { return _at(set._inner, index); } /** * @dev Return the entire set in an array * * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that * this function has an unbounded cost, and using it as part of a state-changing function may render the function * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block. */ function values(Bytes32Set storage set) internal view returns (bytes32[] memory) { return _values(set._inner); } // AddressSet struct AddressSet { Set _inner; } /** * @dev Add a value to a set. O(1). * * Returns true if the value was added to the set, that is if it was not * already present. */ function add(AddressSet storage set, address value) internal returns (bool) { return _add(set._inner, bytes32(uint256(uint160(value)))); } /** * @dev Removes a value from a set. O(1). * * Returns true if the value was removed from the set, that is if it was * present. */ function remove(AddressSet storage set, address value) internal returns (bool) { return _remove(set._inner, bytes32(uint256(uint160(value)))); } /** * @dev Returns true if the value is in the set. O(1). */ function contains(AddressSet storage set, address value) internal view returns (bool) { return _contains(set._inner, bytes32(uint256(uint160(value)))); } /** * @dev Returns the number of values in the set. O(1). */ function length(AddressSet storage set) internal view returns (uint256) { return _length(set._inner); } /** * @dev Returns the value stored at position `index` in the set. O(1). * * Note that there are no guarantees on the ordering of values inside the * array, and it may change when more values are added or removed. * * Requirements: * * - `index` must be strictly less than {length}. */ function at(AddressSet storage set, uint256 index) internal view returns (address) { return address(uint160(uint256(_at(set._inner, index)))); } /** * @dev Return the entire set in an array * * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that * this function has an unbounded cost, and using it as part of a state-changing function may render the function * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block. */ function values(AddressSet storage set) internal view returns (address[] memory) { bytes32[] memory store = _values(set._inner); address[] memory result; /// @solidity memory-safe-assembly assembly { result := store } return result; } // UintSet struct UintSet { Set _inner; } /** * @dev Add a value to a set. O(1). * * Returns true if the value was added to the set, that is if it was not * already present. */ function add(UintSet storage set, uint256 value) internal returns (bool) { return _add(set._inner, bytes32(value)); } /** * @dev Removes a value from a set. O(1). * * Returns true if the value was removed from the set, that is if it was * present. */ function remove(UintSet storage set, uint256 value) internal returns (bool) { return _remove(set._inner, bytes32(value)); } /** * @dev Returns true if the value is in the set. O(1). */ function contains(UintSet storage set, uint256 value) internal view returns (bool) { return _contains(set._inner, bytes32(value)); } /** * @dev Returns the number of values on the set. O(1). */ function length(UintSet storage set) internal view returns (uint256) { return _length(set._inner); } /** * @dev Returns the value stored at position `index` in the set. O(1). * * Note that there are no guarantees on the ordering of values inside the * array, and it may change when more values are added or removed. * * Requirements: * * - `index` must be strictly less than {length}. */ function at(UintSet storage set, uint256 index) internal view returns (uint256) { return uint256(_at(set._inner, index)); } /** * @dev Return the entire set in an array * * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that * this function has an unbounded cost, and using it as part of a state-changing function may render the function * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block. */ function values(UintSet storage set) internal view returns (uint256[] memory) { bytes32[] memory store = _values(set._inner); uint256[] memory result; /// @solidity memory-safe-assembly assembly { result := store } return result; } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts (last updated v4.7.0) (access/Ownable.sol) pragma solidity ^0.8.0; import "../utils/Context.sol"; /** * @dev Contract module which provides a basic access control mechanism, where * there is an account (an owner) that can be granted exclusive access to * specific functions. * * By default, the owner account will be the one that deploys the contract. This * can later be changed with {transferOwnership}. * * This module is used through inheritance. It will make available the modifier * `onlyOwner`, which can be applied to your functions to restrict their use to * the owner. */ abstract contract Ownable is Context { address private _owner; event OwnershipTransferred(address indexed previousOwner, address indexed newOwner); /** * @dev Initializes the contract setting the deployer as the initial owner. */ constructor() { _transferOwnership(_msgSender()); } /** * @dev Throws if called by any account other than the owner. */ modifier onlyOwner() { _checkOwner(); _; } /** * @dev Returns the address of the current owner. */ function owner() public view virtual returns (address) { return _owner; } /** * @dev Throws if the sender is not the owner. */ function _checkOwner() internal view virtual { require(owner() == _msgSender(), "Ownable: caller is not the owner"); } /** * @dev Leaves the contract without owner. It will not be possible to call * `onlyOwner` functions anymore. Can only be called by the current owner. * * NOTE: Renouncing ownership will leave the contract without an owner, * thereby removing any functionality that is only available to the owner. */ function renounceOwnership() public virtual onlyOwner { _transferOwnership(address(0)); } /** * @dev Transfers ownership of the contract to a new account (`newOwner`). * Can only be called by the current owner. */ function transferOwnership(address newOwner) public virtual onlyOwner { require(newOwner != address(0), "Ownable: new owner is the zero address"); _transferOwnership(newOwner); } /** * @dev Transfers ownership of the contract to a new account (`newOwner`). * Internal function without access restriction. */ function _transferOwnership(address newOwner) internal virtual { address oldOwner = _owner; _owner = newOwner; emit OwnershipTransferred(oldOwner, newOwner); } }
// SPDX-License-Identifier: MIT // OpenZeppelin Contracts v4.4.1 (utils/Context.sol) pragma solidity ^0.8.0; /** * @dev Provides information about the current execution context, including the * sender of the transaction and its data. While these are generally available * via msg.sender and msg.data, they should not be accessed in such a direct * manner, since when dealing with meta-transactions the account sending and * paying for execution may not be the actual sender (as far as an application * is concerned). * * This contract is only required for intermediate, library-like contracts. */ abstract contract Context { function _msgSender() internal view virtual returns (address) { return msg.sender; } function _msgData() internal view virtual returns (bytes calldata) { return msg.data; } }
{ "optimizer": { "enabled": true, "runs": 20000 }, "outputSelection": { "*": { "*": [ "evm.bytecode", "evm.deployedBytecode", "devdoc", "userdoc", "metadata", "abi" ] } }, "libraries": {} }
Contract Security Audit
- No Contract Security Audit Submitted- Submit Audit Here
[{"inputs":[{"internalType":"address","name":"_quoteToken","type":"address"},{"internalType":"address[]","name":"_baseTokens","type":"address[]"}],"stateMutability":"nonpayable","type":"constructor"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"inputs":[{"internalType":"address","name":"token","type":"address"}],"name":"addBaseToken","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"allBaseTokens","outputs":[{"internalType":"address[]","name":"","type":"address[]"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"allBaseTokensLength","outputs":[{"internalType":"uint256","name":"","type":"uint256"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"getSupportTokens","outputs":[{"internalType":"address","name":"","type":"address"},{"internalType":"address[]","name":"","type":"address[]"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"quoteToken","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"token","type":"address"}],"name":"removeBaseToken","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"_quoteToken","type":"address"}],"name":"setQutoeToken","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"}]
Contract Creation Code
60806040523480156200001157600080fd5b5060405162000c4d38038062000c4d8339810160408190526200003491620001a6565b6200003f33620000b1565b600180546001600160a01b0319166001600160a01b03841617905560005b8151811015620000a8576200009e8282815181106200008057620000806200028f565b602002602001015160026200010160201b620004fa1790919060201c565b506001016200005d565b505050620002a5565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b600062000118836001600160a01b03841662000121565b90505b92915050565b60008181526001830160205260408120546200016a575081546001818101845560008481526020808220909301849055845484825282860190935260409020919091556200011b565b5060006200011b565b80516001600160a01b03811681146200018b57600080fd5b919050565b634e487b7160e01b600052604160045260246000fd5b60008060408385031215620001ba57600080fd5b620001c58362000173565b602084810151919350906001600160401b0380821115620001e557600080fd5b818601915086601f830112620001fa57600080fd5b8151818111156200020f576200020f62000190565b8060051b604051601f19603f8301168101818110858211171562000237576200023762000190565b6040529182528482019250838101850191898311156200025657600080fd5b938501935b828510156200027f576200026f8562000173565b845293850193928501926200025b565b8096505050505050509250929050565b634e487b7160e01b600052603260045260246000fd5b61099880620002b56000396000f3fe608060405234801561001057600080fd5b50600436106100be5760003560e01c80638da5cb5b11610076578063bd6137fe1161005b578063bd6137fe14610187578063c9475cd71461019a578063f2fde38b146101af57600080fd5b80638da5cb5b14610156578063bbd1e1221461017457600080fd5b80634cd29390116100a75780634cd2939014610123578063715018a61461013957806383e280d91461014357600080fd5b8063217a4b70146100c357806339cdfb2b1461010d575b600080fd5b6001546100e39073ffffffffffffffffffffffffffffffffffffffff1681565b60405173ffffffffffffffffffffffffffffffffffffffff90911681526020015b60405180910390f35b6101156101c2565b604051610104929190610810565b61012b6101f1565b604051908152602001610104565b610141610202565b005b610141610151366004610847565b610216565b60005473ffffffffffffffffffffffffffffffffffffffff166100e3565b610141610182366004610847565b61029d565b610141610195366004610847565b610341565b6101a2610390565b6040516101049190610884565b6101416101bd366004610847565b610443565b60015460009060609073ffffffffffffffffffffffffffffffffffffffff166101e9610390565b915091509091565b60006101fd6002610525565b905090565b61020a61052f565b61021460006105b0565b565b61021e61052f565b600061022b6002836104fa565b905080610299576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152601e60248201527f496e746567726174696f6e48656c7065723a20746f6b656e206578697374000060448201526064015b60405180910390fd5b5050565b6102a561052f565b60006102b2600283610625565b905080610299576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152602260248201527f496e746567726174696f6e48656c7065723a20746f6b656e206e6f742065786960448201527f73740000000000000000000000000000000000000000000000000000000000006064820152608401610290565b61034961052f565b600180547fffffffffffffffffffffffff00000000000000000000000000000000000000001673ffffffffffffffffffffffffffffffffffffffff92909216919091179055565b6060600061039e6002610525565b905060008167ffffffffffffffff8111156103bb576103bb610897565b6040519080825280602002602001820160405280156103e4578160200160208202803683370190505b50905060005b8281101561043c576103fd600282610647565b82828151811061040f5761040f6108c6565b73ffffffffffffffffffffffffffffffffffffffff909216602092830291909101909101526001016103ea565b5092915050565b61044b61052f565b73ffffffffffffffffffffffffffffffffffffffff81166104ee576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201527f64647265737300000000000000000000000000000000000000000000000000006064820152608401610290565b6104f7816105b0565b50565b600061051c8373ffffffffffffffffffffffffffffffffffffffff8416610653565b90505b92915050565b600061051f825490565b60005473ffffffffffffffffffffffffffffffffffffffff163314610214576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65726044820152606401610290565b6000805473ffffffffffffffffffffffffffffffffffffffff8381167fffffffffffffffffffffffff0000000000000000000000000000000000000000831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b600061051c8373ffffffffffffffffffffffffffffffffffffffff84166106a2565b600061051c8383610795565b600081815260018301602052604081205461069a5750815460018181018455600084815260208082209093018490558454848252828601909352604090209190915561051f565b50600061051f565b6000818152600183016020526040812054801561078b5760006106c66001836108f5565b85549091506000906106da906001906108f5565b905081811461073f5760008660000182815481106106fa576106fa6108c6565b906000526020600020015490508087600001848154811061071d5761071d6108c6565b6000918252602080832090910192909255918252600188019052604090208390555b855486908061075057610750610933565b60019003818190600052602060002001600090559055856001016000868152602001908152602001600020600090556001935050505061051f565b600091505061051f565b60008260000182815481106107ac576107ac6108c6565b9060005260206000200154905092915050565b600081518084526020808501945080840160005b8381101561080557815173ffffffffffffffffffffffffffffffffffffffff16875295820195908201906001016107d3565b509495945050505050565b73ffffffffffffffffffffffffffffffffffffffff8316815260406020820152600061083f60408301846107bf565b949350505050565b60006020828403121561085957600080fd5b813573ffffffffffffffffffffffffffffffffffffffff8116811461087d57600080fd5b9392505050565b60208152600061051c60208301846107bf565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052604160045260246000fd5b7f4e487b7100000000000000000000000000000000000000000000000000000000600052603260045260246000fd5b60008282101561092e577f4e487b7100000000000000000000000000000000000000000000000000000000600052601160045260246000fd5b500390565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052603160045260246000fdfea264697066735822122030411ce8b106d9166938d034f51b13ded255271b9d2ec1f3e95f0481ae12c83964736f6c634300080e00330000000000000000000000002791bca1f2de4661ed88a30c99a7a9449aa84174000000000000000000000000000000000000000000000000000000000000004000000000000000000000000000000000000000000000000000000000000000040000000000000000000000000d500b1d8e8ef31e21c99d1db9a6444d3adf12700000000000000000000000007ceb23fd6bc0add59e62ac25578270cff1b9f6190000000000000000000000001bfd67037b42cf73acf2047067bd4f2c47d9bfd60000000000000000000000001b815d120b3ef02039ee11dc2d33de7aa4a8c603
Deployed Bytecode
0x608060405234801561001057600080fd5b50600436106100be5760003560e01c80638da5cb5b11610076578063bd6137fe1161005b578063bd6137fe14610187578063c9475cd71461019a578063f2fde38b146101af57600080fd5b80638da5cb5b14610156578063bbd1e1221461017457600080fd5b80634cd29390116100a75780634cd2939014610123578063715018a61461013957806383e280d91461014357600080fd5b8063217a4b70146100c357806339cdfb2b1461010d575b600080fd5b6001546100e39073ffffffffffffffffffffffffffffffffffffffff1681565b60405173ffffffffffffffffffffffffffffffffffffffff90911681526020015b60405180910390f35b6101156101c2565b604051610104929190610810565b61012b6101f1565b604051908152602001610104565b610141610202565b005b610141610151366004610847565b610216565b60005473ffffffffffffffffffffffffffffffffffffffff166100e3565b610141610182366004610847565b61029d565b610141610195366004610847565b610341565b6101a2610390565b6040516101049190610884565b6101416101bd366004610847565b610443565b60015460009060609073ffffffffffffffffffffffffffffffffffffffff166101e9610390565b915091509091565b60006101fd6002610525565b905090565b61020a61052f565b61021460006105b0565b565b61021e61052f565b600061022b6002836104fa565b905080610299576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152601e60248201527f496e746567726174696f6e48656c7065723a20746f6b656e206578697374000060448201526064015b60405180910390fd5b5050565b6102a561052f565b60006102b2600283610625565b905080610299576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152602260248201527f496e746567726174696f6e48656c7065723a20746f6b656e206e6f742065786960448201527f73740000000000000000000000000000000000000000000000000000000000006064820152608401610290565b61034961052f565b600180547fffffffffffffffffffffffff00000000000000000000000000000000000000001673ffffffffffffffffffffffffffffffffffffffff92909216919091179055565b6060600061039e6002610525565b905060008167ffffffffffffffff8111156103bb576103bb610897565b6040519080825280602002602001820160405280156103e4578160200160208202803683370190505b50905060005b8281101561043c576103fd600282610647565b82828151811061040f5761040f6108c6565b73ffffffffffffffffffffffffffffffffffffffff909216602092830291909101909101526001016103ea565b5092915050565b61044b61052f565b73ffffffffffffffffffffffffffffffffffffffff81166104ee576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201527f64647265737300000000000000000000000000000000000000000000000000006064820152608401610290565b6104f7816105b0565b50565b600061051c8373ffffffffffffffffffffffffffffffffffffffff8416610653565b90505b92915050565b600061051f825490565b60005473ffffffffffffffffffffffffffffffffffffffff163314610214576040517f08c379a000000000000000000000000000000000000000000000000000000000815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65726044820152606401610290565b6000805473ffffffffffffffffffffffffffffffffffffffff8381167fffffffffffffffffffffffff0000000000000000000000000000000000000000831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b600061051c8373ffffffffffffffffffffffffffffffffffffffff84166106a2565b600061051c8383610795565b600081815260018301602052604081205461069a5750815460018181018455600084815260208082209093018490558454848252828601909352604090209190915561051f565b50600061051f565b6000818152600183016020526040812054801561078b5760006106c66001836108f5565b85549091506000906106da906001906108f5565b905081811461073f5760008660000182815481106106fa576106fa6108c6565b906000526020600020015490508087600001848154811061071d5761071d6108c6565b6000918252602080832090910192909255918252600188019052604090208390555b855486908061075057610750610933565b60019003818190600052602060002001600090559055856001016000868152602001908152602001600020600090556001935050505061051f565b600091505061051f565b60008260000182815481106107ac576107ac6108c6565b9060005260206000200154905092915050565b600081518084526020808501945080840160005b8381101561080557815173ffffffffffffffffffffffffffffffffffffffff16875295820195908201906001016107d3565b509495945050505050565b73ffffffffffffffffffffffffffffffffffffffff8316815260406020820152600061083f60408301846107bf565b949350505050565b60006020828403121561085957600080fd5b813573ffffffffffffffffffffffffffffffffffffffff8116811461087d57600080fd5b9392505050565b60208152600061051c60208301846107bf565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052604160045260246000fd5b7f4e487b7100000000000000000000000000000000000000000000000000000000600052603260045260246000fd5b60008282101561092e577f4e487b7100000000000000000000000000000000000000000000000000000000600052601160045260246000fd5b500390565b7f4e487b7100000000000000000000000000000000000000000000000000000000600052603160045260246000fdfea264697066735822122030411ce8b106d9166938d034f51b13ded255271b9d2ec1f3e95f0481ae12c83964736f6c634300080e0033
Constructor Arguments (ABI-Encoded and is the last bytes of the Contract Creation Code above)
0000000000000000000000002791bca1f2de4661ed88a30c99a7a9449aa84174000000000000000000000000000000000000000000000000000000000000004000000000000000000000000000000000000000000000000000000000000000040000000000000000000000000d500b1d8e8ef31e21c99d1db9a6444d3adf12700000000000000000000000007ceb23fd6bc0add59e62ac25578270cff1b9f6190000000000000000000000001bfd67037b42cf73acf2047067bd4f2c47d9bfd60000000000000000000000001b815d120b3ef02039ee11dc2d33de7aa4a8c603
-----Decoded View---------------
Arg [0] : _quoteToken (address): 0x2791Bca1f2de4661ED88A30C99A7a9449Aa84174
Arg [1] : _baseTokens (address[]): 0x0d500B1d8E8eF31E21C99d1Db9A6444d3ADf1270,0x7ceB23fD6bC0adD59E62ac25578270cFf1b9f619,0x1BFD67037B42Cf73acF2047067bd4F2C47D9BfD6,0x1B815d120B3eF02039Ee11dC2d33DE7aA4a8C603
-----Encoded View---------------
7 Constructor Arguments found :
Arg [0] : 0000000000000000000000002791bca1f2de4661ed88a30c99a7a9449aa84174
Arg [1] : 0000000000000000000000000000000000000000000000000000000000000040
Arg [2] : 0000000000000000000000000000000000000000000000000000000000000004
Arg [3] : 0000000000000000000000000d500b1d8e8ef31e21c99d1db9a6444d3adf1270
Arg [4] : 0000000000000000000000007ceb23fd6bc0add59e62ac25578270cff1b9f619
Arg [5] : 0000000000000000000000001bfd67037b42cf73acf2047067bd4f2c47d9bfd6
Arg [6] : 0000000000000000000000001b815d120b3ef02039ee11dc2d33de7aa4a8c603
Loading...
Loading
Loading...
Loading
Multichain Portfolio | 30 Chains
Chain | Token | Portfolio % | Price | Amount | Value |
---|
[ Download: CSV Export ]
A contract address hosts a smart contract, which is a set of code stored on the blockchain that runs when predetermined conditions are met. Learn more about addresses in our Knowledge Base.