Datasets:

Zellic
/

smart-contract-fiesta

	{
	"language": "Solidity",
	"sources": {
	"@openzeppelin/contracts-upgradeable/access/AccessControlEnumerableUpgradeable.sol": {
	"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.5.0) (access/AccessControlEnumerable.sol)\n\npragma solidity ^0.8.0;\n\nimport \"./IAccessControlEnumerableUpgradeable.sol\";\nimport \"./AccessControlUpgradeable.sol\";\nimport \"../utils/structs/EnumerableSetUpgradeable.sol\";\nimport \"../proxy/utils/Initializable.sol\";\n\n/*\n @dev Extension of {AccessControl} that allows enumerating the members of each role.\n /\nabstract contract AccessControlEnumerableUpgradeable is Initializable, IAccessControlEnumerableUpgradeable, AccessControlUpgradeable {\n function __AccessControlEnumerable_init() internal onlyInitializing {\n }\n\n function __AccessControlEnumerable_init_unchained() internal onlyInitializing {\n }\n using EnumerableSetUpgradeable for EnumerableSetUpgradeable.AddressSet;\n\n mapping(bytes32 => EnumerableSetUpgradeable.AddressSet) private _roleMembers;\n\n /\n @dev See {IERC165-supportsInterface}.\n /\n function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {\n return interfaceId == type(IAccessControlEnumerableUpgradeable).interfaceId \|\| super.supportsInterface(interfaceId);\n }\n\n /\n @dev Returns one of the accounts that have `role`. `index` must be a\n * value between 0 and {getRoleMemberCount}, non-inclusive.\n \n Role bearers are not sorted in any particular way, and their ordering may\n * change at any point.\n \n WARNING: When using {getRoleMember} and {getRoleMemberCount}, make sure\n * you perform all queries on the same block. See the following\n * https://forum.openzeppelin.com/t/iterating-over-elements-on-enumerableset-in-openzeppelin-contracts/2296[forum post]\n * for more information.\n /\n function getRoleMember(bytes32 role, uint256 index) public view virtual override returns (address) {\n return _roleMembers[role].at(index);\n }\n\n /\n @dev Returns the number of accounts that have `role`. Can be used\n * together with {getRoleMember} to enumerate all bearers of a role.\n /\n function getRoleMemberCount(bytes32 role) public view virtual override returns (uint256) {\n return _roleMembers[role].length();\n }\n\n /\n @dev Overload {_grantRole} to track enumerable memberships\n /\n function _grantRole(bytes32 role, address account) internal virtual override {\n super._grantRole(role, account);\n _roleMembers[role].add(account);\n }\n\n /\n @dev Overload {_revokeRole} to track enumerable memberships\n /\n function _revokeRole(bytes32 role, address account) internal virtual override {\n super._revokeRole(role, account);\n _roleMembers[role].remove(account);\n }\n\n /\n @dev This empty reserved space is put in place to allow future versions to add new\n * variables without shifting down storage in the inheritance chain.\n * See https://docs.openzeppelin.com/contracts/4.x/upgradeable#storage_gaps\n */\n uint256[49] private __gap;\n}\n"
	},
	"@openzeppelin/contracts-upgradeable/access/AccessControlUpgradeable.sol": {
	"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.8.0) (access/AccessControl.sol)\n\npragma solidity ^0.8.0;\n\nimport \"./IAccessControlUpgradeable.sol\";\nimport \"../utils/ContextUpgradeable.sol\";\nimport \"../utils/StringsUpgradeable.sol\";\nimport \"../utils/introspection/ERC165Upgradeable.sol\";\nimport \"../proxy/utils/Initializable.sol\";\n\n/*\n @dev Contract module that allows children to implement role-based access\n * control mechanisms. This is a lightweight version that doesn't allow enumerating role\n * members except through off-chain means by accessing the contract event logs. Some\n * applications may benefit from on-chain enumerability, for those cases see\n * {AccessControlEnumerable}.\n \n Roles are referred to by their `bytes32` identifier. These should be exposed\n * in the external API and be unique. The best way to achieve this is by\n * using `public constant` hash digests:\n \n ```\n * bytes32 public constant MY_ROLE = keccak256(\"MY_ROLE\");\n * ```\n \n Roles can be used to represent a set of permissions. To restrict access to a\n * function call, use {hasRole}:\n \n ```\n * function foo() public {\n * require(hasRole(MY_ROLE, msg.sender));\n * ...\n * }\n * ```\n \n Roles can be granted and revoked dynamically via the {grantRole} and\n * {revokeRole} functions. Each role has an associated admin role, and only\n * accounts that have a role's admin role can call {grantRole} and {revokeRole}.\n \n By default, the admin role for all roles is `DEFAULT_ADMIN_ROLE`, which means\n * that only accounts with this role will be able to grant or revoke other\n * roles. More complex role relationships can be created by using\n * {_setRoleAdmin}.\n \n WARNING: The `DEFAULT_ADMIN_ROLE` is also its own admin: it has permission to\n * grant and revoke this role. Extra precautions should be taken to secure\n * accounts that have been granted it.\n /\nabstract contract AccessControlUpgradeable is Initializable, ContextUpgradeable, IAccessControlUpgradeable, ERC165Upgradeable {\n function __AccessControl_init() internal onlyInitializing {\n }\n\n function __AccessControl_init_unchained() internal onlyInitializing {\n }\n struct RoleData {\n mapping(address => bool) members;\n bytes32 adminRole;\n }\n\n mapping(bytes32 => RoleData) private _roles;\n\n bytes32 public constant DEFAULT_ADMIN_ROLE = 0x00;\n\n /\n @dev Modifier that checks that an account has a specific role. Reverts\n * with a standardized message including the required role.\n \n The format of the revert reason is given by the following regular expression:\n \n /^AccessControl: account (0x[0-9a-f]{40}) is missing role (0x[0-9a-f]{64})$/\n \n _Available since v4.1._\n /\n modifier onlyRole(bytes32 role) {\n _checkRole(role);\n _;\n }\n\n /\n @dev See {IERC165-supportsInterface}.\n /\n function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {\n return interfaceId == type(IAccessControlUpgradeable).interfaceId \|\| super.supportsInterface(interfaceId);\n }\n\n /\n @dev Returns `true` if `account` has been granted `role`.\n /\n function hasRole(bytes32 role, address account) public view virtual override returns (bool) {\n return _roles[role].members[account];\n }\n\n /\n @dev Revert with a standard message if `_msgSender()` is missing `role`.\n * Overriding this function changes the behavior of the {onlyRole} modifier.\n \n Format of the revert message is described in {_checkRole}.\n \n _Available since v4.6._\n /\n function _checkRole(bytes32 role) internal view virtual {\n _checkRole(role, _msgSender());\n }\n\n /\n @dev Revert with a standard message if `account` is missing `role`.\n \n The format of the revert reason is given by the following regular expression:\n \n /^AccessControl: account (0x[0-9a-f]{40}) is missing role (0x[0-9a-f]{64})$/\n /\n function _checkRole(bytes32 role, address account) internal view virtual {\n if (!hasRole(role, account)) {\n revert(\n string(\n abi.encodePacked(\n \"AccessControl: account \",\n StringsUpgradeable.toHexString(account),\n \" is missing role \",\n StringsUpgradeable.toHexString(uint256(role), 32)\n )\n )\n );\n }\n }\n\n /\n @dev Returns the admin role that controls `role`. See {grantRole} and\n * {revokeRole}.\n \n To change a role's admin, use {_setRoleAdmin}.\n /\n function getRoleAdmin(bytes32 role) public view virtual override returns (bytes32) {\n return _roles[role].adminRole;\n }\n\n /\n @dev Grants `role` to `account`.\n \n If `account` had not been already granted `role`, emits a {RoleGranted}\n * event.\n \n Requirements:\n \n - the caller must have ``role``'s admin role.\n \n May emit a {RoleGranted} event.\n /\n function grantRole(bytes32 role, address account) public virtual override onlyRole(getRoleAdmin(role)) {\n _grantRole(role, account);\n }\n\n /\n @dev Revokes `role` from `account`.\n \n If `account` had been granted `role`, emits a {RoleRevoked} event.\n \n Requirements:\n \n - the caller must have ``role``'s admin role.\n \n May emit a {RoleRevoked} event.\n /\n function revokeRole(bytes32 role, address account) public virtual override onlyRole(getRoleAdmin(role)) {\n _revokeRole(role, account);\n }\n\n /\n @dev Revokes `role` from the calling account.\n \n Roles are often managed via {grantRole} and {revokeRole}: this function's\n * purpose is to provide a mechanism for accounts to lose their privileges\n * if they are compromised (such as when a trusted device is misplaced).\n \n If the calling account had been revoked `role`, emits a {RoleRevoked}\n * event.\n \n Requirements:\n \n - the caller must be `account`.\n \n May emit a {RoleRevoked} event.\n /\n function renounceRole(bytes32 role, address account) public virtual override {\n require(account == _msgSender(), \"AccessControl: can only renounce roles for self\");\n\n _revokeRole(role, account);\n }\n\n /\n @dev Grants `role` to `account`.\n \n If `account` had not been already granted `role`, emits a {RoleGranted}\n * event. Note that unlike {grantRole}, this function doesn't perform any\n * checks on the calling account.\n \n May emit a {RoleGranted} event.\n \n [WARNING]\n * ====\n * This function should only be called from the constructor when setting\n * up the initial roles for the system.\n \n Using this function in any other way is effectively circumventing the admin\n * system imposed by {AccessControl}.\n * ====\n \n NOTE: This function is deprecated in favor of {_grantRole}.\n /\n function _setupRole(bytes32 role, address account) internal virtual {\n _grantRole(role, account);\n }\n\n /\n @dev Sets `adminRole` as ``role``'s admin role.\n \n Emits a {RoleAdminChanged} event.\n /\n function _setRoleAdmin(bytes32 role, bytes32 adminRole) internal virtual {\n bytes32 previousAdminRole = getRoleAdmin(role);\n _roles[role].adminRole = adminRole;\n emit RoleAdminChanged(role, previousAdminRole, adminRole);\n }\n\n /\n @dev Grants `role` to `account`.\n \n Internal function without access restriction.\n \n May emit a {RoleGranted} event.\n /\n function _grantRole(bytes32 role, address account) internal virtual {\n if (!hasRole(role, account)) {\n _roles[role].members[account] = true;\n emit RoleGranted(role, account, _msgSender());\n }\n }\n\n /\n @dev Revokes `role` from `account`.\n \n Internal function without access restriction.\n \n May emit a {RoleRevoked} event.\n /\n function _revokeRole(bytes32 role, address account) internal virtual {\n if (hasRole(role, account)) {\n _roles[role].members[account] = false;\n emit RoleRevoked(role, account, _msgSender());\n }\n }\n\n /\n @dev This empty reserved space is put in place to allow future versions to add new\n * variables without shifting down storage in the inheritance chain.\n * See https://docs.openzeppelin.com/contracts/4.x/upgradeable#storage_gaps\n */\n uint256[49] private __gap;\n}\n"
	},
	"@openzeppelin/contracts-upgradeable/access/IAccessControlEnumerableUpgradeable.sol": {
	"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts v4.4.1 (access/IAccessControlEnumerable.sol)\n\npragma solidity ^0.8.0;\n\nimport \"./IAccessControlUpgradeable.sol\";\n\n/*\n @dev External interface of AccessControlEnumerable declared to support ERC165 detection.\n /\ninterface IAccessControlEnumerableUpgradeable is IAccessControlUpgradeable {\n /\n @dev Returns one of the accounts that have `role`. `index` must be a\n * value between 0 and {getRoleMemberCount}, non-inclusive.\n \n Role bearers are not sorted in any particular way, and their ordering may\n * change at any point.\n \n WARNING: When using {getRoleMember} and {getRoleMemberCount}, make sure\n * you perform all queries on the same block. See the following\n * https://forum.openzeppelin.com/t/iterating-over-elements-on-enumerableset-in-openzeppelin-contracts/2296[forum post]\n * for more information.\n /\n function getRoleMember(bytes32 role, uint256 index) external view returns (address);\n\n /\n @dev Returns the number of accounts that have `role`. Can be used\n * together with {getRoleMember} to enumerate all bearers of a role.\n */\n function getRoleMemberCount(bytes32 role) external view returns (uint256);\n}\n"
	},
	"@openzeppelin/contracts-upgradeable/access/IAccessControlUpgradeable.sol": {
	"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts v4.4.1 (access/IAccessControl.sol)\n\npragma solidity ^0.8.0;\n\n/*\n @dev External interface of AccessControl declared to support ERC165 detection.\n /\ninterface IAccessControlUpgradeable {\n /\n @dev Emitted when `newAdminRole` is set as ``role``'s admin role, replacing `previousAdminRole`\n \n `DEFAULT_ADMIN_ROLE` is the starting admin for all roles, despite\n * {RoleAdminChanged} not being emitted signaling this.\n \n _Available since v3.1._\n /\n event RoleAdminChanged(bytes32 indexed role, bytes32 indexed previousAdminRole, bytes32 indexed newAdminRole);\n\n /\n @dev Emitted when `account` is granted `role`.\n \n `sender` is the account that originated the contract call, an admin role\n * bearer except when using {AccessControl-_setupRole}.\n /\n event RoleGranted(bytes32 indexed role, address indexed account, address indexed sender);\n\n /\n @dev Emitted when `account` is revoked `role`.\n \n `sender` is the account that originated the contract call:\n * - if using `revokeRole`, it is the admin role bearer\n * - if using `renounceRole`, it is the role bearer (i.e. `account`)\n /\n event RoleRevoked(bytes32 indexed role, address indexed account, address indexed sender);\n\n /\n @dev Returns `true` if `account` has been granted `role`.\n /\n function hasRole(bytes32 role, address account) external view returns (bool);\n\n /\n @dev Returns the admin role that controls `role`. See {grantRole} and\n * {revokeRole}.\n \n To change a role's admin, use {AccessControl-_setRoleAdmin}.\n /\n function getRoleAdmin(bytes32 role) external view returns (bytes32);\n\n /\n @dev Grants `role` to `account`.\n \n If `account` had not been already granted `role`, emits a {RoleGranted}\n * event.\n \n Requirements:\n \n - the caller must have ``role``'s admin role.\n /\n function grantRole(bytes32 role, address account) external;\n\n /\n @dev Revokes `role` from `account`.\n \n If `account` had been granted `role`, emits a {RoleRevoked} event.\n \n Requirements:\n \n - the caller must have ``role``'s admin role.\n /\n function revokeRole(bytes32 role, address account) external;\n\n /\n @dev Revokes `role` from the calling account.\n \n Roles are often managed via {grantRole} and {revokeRole}: this function's\n * purpose is to provide a mechanism for accounts to lose their privileges\n * if they are compromised (such as when a trusted device is misplaced).\n \n If the calling account had been granted `role`, emits a {RoleRevoked}\n * event.\n \n Requirements:\n \n - the caller must be `account`.\n */\n function renounceRole(bytes32 role, address account) external;\n}\n"
	},
	"@openzeppelin/contracts-upgradeable/proxy/utils/Initializable.sol": {
	"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.8.0) (proxy/utils/Initializable.sol)\n\npragma solidity ^0.8.2;\n\nimport \"../../utils/AddressUpgradeable.sol\";\n\n/*\n @dev This is a base contract to aid in writing upgradeable contracts, or any kind of contract that will be deployed\n * behind a proxy. Since proxied contracts do not make use of a constructor, it's common to move constructor logic to an\n * external initializer function, usually called `initialize`. It then becomes necessary to protect this initializer\n * function so it can only be called once. The {initializer} modifier provided by this contract will have this effect.\n \n The initialization functions use a version number. Once a version number is used, it is consumed and cannot be\n * reused. This mechanism prevents re-execution of each \"step\" but allows the creation of new initialization steps in\n * case an upgrade adds a module that needs to be initialized.\n \n For example:\n \n [.hljs-theme-light.nopadding]\n * ```\n * contract MyToken is ERC20Upgradeable {\n * function initialize() initializer public {\n * __ERC20_init(\"MyToken\", \"MTK\");\n * }\n * }\n * contract MyTokenV2 is MyToken, ERC20PermitUpgradeable {\n * function initializeV2() reinitializer(2) public {\n * __ERC20Permit_init(\"MyToken\");\n * }\n * }\n * ```\n \n TIP: To avoid leaving the proxy in an uninitialized state, the initializer function should be called as early as\n * possible by providing the encoded function call as the `_data` argument to {ERC1967Proxy-constructor}.\n \n CAUTION: When used with inheritance, manual care must be taken to not invoke a parent initializer twice, or to ensure\n * that all initializers are idempotent. This is not verified automatically as constructors are by Solidity.\n \n [CAUTION]\n * ====\n * Avoid leaving a contract uninitialized.\n \n An uninitialized contract can be taken over by an attacker. This applies to both a proxy and its implementation\n * contract, which may impact the proxy. To prevent the implementation contract from being used, you should invoke\n * the {_disableInitializers} function in the constructor to automatically lock it when it is deployed:\n \n [.hljs-theme-light.nopadding]\n * ```\n * /// @custom:oz-upgrades-unsafe-allow constructor\n * constructor() {\n * _disableInitializers();\n * }\n * ```\n * ====\n /\nabstract contract Initializable {\n /\n @dev Indicates that the contract has been initialized.\n * @custom:oz-retyped-from bool\n /\n uint8 private _initialized;\n\n /\n @dev Indicates that the contract is in the process of being initialized.\n /\n bool private _initializing;\n\n /\n @dev Triggered when the contract has been initialized or reinitialized.\n /\n event Initialized(uint8 version);\n\n /\n @dev A modifier that defines a protected initializer function that can be invoked at most once. In its scope,\n * `onlyInitializing` functions can be used to initialize parent contracts.\n \n Similar to `reinitializer(1)`, except that functions marked with `initializer` can be nested in the context of a\n * constructor.\n \n Emits an {Initialized} event.\n /\n modifier initializer() {\n bool isTopLevelCall = !_initializing;\n require(\n (isTopLevelCall && _initialized < 1) \|\| (!AddressUpgradeable.isContract(address(this)) && _initialized == 1),\n \"Initializable: contract is already initialized\"\n );\n _initialized = 1;\n if (isTopLevelCall) {\n _initializing = true;\n }\n _;\n if (isTopLevelCall) {\n _initializing = false;\n emit Initialized(1);\n }\n }\n\n /\n @dev A modifier that defines a protected reinitializer function that can be invoked at most once, and only if the\n * contract hasn't been initialized to a greater version before. In its scope, `onlyInitializing` functions can be\n * used to initialize parent contracts.\n \n A reinitializer may be used after the original initialization step. This is essential to configure modules that\n * are added through upgrades and that require initialization.\n \n When `version` is 1, this modifier is similar to `initializer`, except that functions marked with `reinitializer`\n * cannot be nested. If one is invoked in the context of another, execution will revert.\n \n Note that versions can jump in increments greater than 1; this implies that if multiple reinitializers coexist in\n * a contract, executing them in the right order is up to the developer or operator.\n \n WARNING: setting the version to 255 will prevent any future reinitialization.\n \n Emits an {Initialized} event.\n /\n modifier reinitializer(uint8 version) {\n require(!_initializing && _initialized < version, \"Initializable: contract is already initialized\");\n _initialized = version;\n _initializing = true;\n _;\n _initializing = false;\n emit Initialized(version);\n }\n\n /\n @dev Modifier to protect an initialization function so that it can only be invoked by functions with the\n * {initializer} and {reinitializer} modifiers, directly or indirectly.\n /\n modifier onlyInitializing() {\n require(_initializing, \"Initializable: contract is not initializing\");\n _;\n }\n\n /\n @dev Locks the contract, preventing any future reinitialization. This cannot be part of an initializer call.\n * Calling this in the constructor of a contract will prevent that contract from being initialized or reinitialized\n * to any version. It is recommended to use this to lock implementation contracts that are designed to be called\n * through proxies.\n \n Emits an {Initialized} event the first time it is successfully executed.\n /\n function _disableInitializers() internal virtual {\n require(!_initializing, \"Initializable: contract is initializing\");\n if (_initialized < type(uint8).max) {\n _initialized = type(uint8).max;\n emit Initialized(type(uint8).max);\n }\n }\n\n /\n @dev Internal function that returns the initialized version. Returns `_initialized`\n /\n function _getInitializedVersion() internal view returns (uint8) {\n return _initialized;\n }\n\n /\n @dev Internal function that returns the initialized version. Returns `_initializing`\n */\n function _isInitializing() internal view returns (bool) {\n return _initializing;\n }\n}\n"
	},
	"@openzeppelin/contracts-upgradeable/security/PausableUpgradeable.sol": {
	"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.7.0) (security/Pausable.sol)\n\npragma solidity ^0.8.0;\n\nimport \"../utils/ContextUpgradeable.sol\";\nimport \"../proxy/utils/Initializable.sol\";\n\n/*\n @dev Contract module which allows children to implement an emergency stop\n * mechanism that can be triggered by an authorized account.\n \n This module is used through inheritance. It will make available the\n * modifiers `whenNotPaused` and `whenPaused`, which can be applied to\n * the functions of your contract. Note that they will not be pausable by\n * simply including this module, only once the modifiers are put in place.\n /\nabstract contract PausableUpgradeable is Initializable, ContextUpgradeable {\n /\n @dev Emitted when the pause is triggered by `account`.\n /\n event Paused(address account);\n\n /\n @dev Emitted when the pause is lifted by `account`.\n /\n event Unpaused(address account);\n\n bool private _paused;\n\n /\n @dev Initializes the contract in unpaused state.\n /\n function __Pausable_init() internal onlyInitializing {\n __Pausable_init_unchained();\n }\n\n function __Pausable_init_unchained() internal onlyInitializing {\n _paused = false;\n }\n\n /\n @dev Modifier to make a function callable only when the contract is not paused.\n \n Requirements:\n \n - The contract must not be paused.\n /\n modifier whenNotPaused() {\n _requireNotPaused();\n _;\n }\n\n /\n @dev Modifier to make a function callable only when the contract is paused.\n \n Requirements:\n \n - The contract must be paused.\n /\n modifier whenPaused() {\n _requirePaused();\n _;\n }\n\n /\n @dev Returns true if the contract is paused, and false otherwise.\n /\n function paused() public view virtual returns (bool) {\n return _paused;\n }\n\n /\n @dev Throws if the contract is paused.\n /\n function _requireNotPaused() internal view virtual {\n require(!paused(), \"Pausable: paused\");\n }\n\n /\n @dev Throws if the contract is not paused.\n /\n function _requirePaused() internal view virtual {\n require(paused(), \"Pausable: not paused\");\n }\n\n /\n @dev Triggers stopped state.\n \n Requirements:\n \n - The contract must not be paused.\n /\n function _pause() internal virtual whenNotPaused {\n _paused = true;\n emit Paused(_msgSender());\n }\n\n /\n @dev Returns to normal state.\n \n Requirements:\n \n - The contract must be paused.\n /\n function _unpause() internal virtual whenPaused {\n _paused = false;\n emit Unpaused(_msgSender());\n }\n\n /\n @dev This empty reserved space is put in place to allow future versions to add new\n * variables without shifting down storage in the inheritance chain.\n * See https://docs.openzeppelin.com/contracts/4.x/upgradeable#storage_gaps\n */\n uint256[49] private __gap;\n}\n"
	},
	"@openzeppelin/contracts-upgradeable/security/ReentrancyGuardUpgradeable.sol": {
	"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.8.0) (security/ReentrancyGuard.sol)\n\npragma solidity ^0.8.0;\nimport \"../proxy/utils/Initializable.sol\";\n\n/*\n @dev Contract module that helps prevent reentrant calls to a function.\n \n Inheriting from `ReentrancyGuard` will make the {nonReentrant} modifier\n * available, which can be applied to functions to make sure there are no nested\n * (reentrant) calls to them.\n \n Note that because there is a single `nonReentrant` guard, functions marked as\n * `nonReentrant` may not call one another. This can be worked around by making\n * those functions `private`, and then adding `external` `nonReentrant` entry\n * points to them.\n \n TIP: If you would like to learn more about reentrancy and alternative ways\n * to protect against it, check out our blog post\n * https://blog.openzeppelin.com/reentrancy-after-istanbul/[Reentrancy After Istanbul].\n /\nabstract contract ReentrancyGuardUpgradeable is Initializable {\n // Booleans are more expensive than uint256 or any type that takes up a full\n // word because each write operation emits an extra SLOAD to first read the\n // slot's contents, replace the bits taken up by the boolean, and then write\n // back. This is the compiler's defense against contract upgrades and\n // pointer aliasing, and it cannot be disabled.\n\n // The values being non-zero value makes deployment a bit more expensive,\n // but in exchange the refund on every call to nonReentrant will be lower in\n // amount. Since refunds are capped to a percentage of the total\n // transaction's gas, it is best to keep them low in cases like this one, to\n // increase the likelihood of the full refund coming into effect.\n uint256 private constant _NOT_ENTERED = 1;\n uint256 private constant _ENTERED = 2;\n\n uint256 private _status;\n\n function __ReentrancyGuard_init() internal onlyInitializing {\n __ReentrancyGuard_init_unchained();\n }\n\n function __ReentrancyGuard_init_unchained() internal onlyInitializing {\n _status = _NOT_ENTERED;\n }\n\n /\n @dev Prevents a contract from calling itself, directly or indirectly.\n * Calling a `nonReentrant` function from another `nonReentrant`\n * function is not supported. It is possible to prevent this from happening\n * by making the `nonReentrant` function external, and making it call a\n * `private` function that does the actual work.\n /\n modifier nonReentrant() {\n _nonReentrantBefore();\n _;\n _nonReentrantAfter();\n }\n\n function _nonReentrantBefore() private {\n // On the first call to nonReentrant, _status will be _NOT_ENTERED\n require(_status != _ENTERED, \"ReentrancyGuard: reentrant call\");\n\n // Any calls to nonReentrant after this point will fail\n _status = _ENTERED;\n }\n\n function _nonReentrantAfter() private {\n // By storing the original value once again, a refund is triggered (see\n // https://eips.ethereum.org/EIPS/eip-2200)\n _status = _NOT_ENTERED;\n }\n\n /\n @dev This empty reserved space is put in place to allow future versions to add new\n * variables without shifting down storage in the inheritance chain.\n * See https://docs.openzeppelin.com/contracts/4.x/upgradeable#storage_gaps\n */\n uint256[49] private __gap;\n}\n"
	},
	"@openzeppelin/contracts-upgradeable/token/ERC20/extensions/draft-IERC20PermitUpgradeable.sol": {
	"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts v4.4.1 (token/ERC20/extensions/draft-IERC20Permit.sol)\n\npragma solidity ^0.8.0;\n\n/*\n @dev Interface of the ERC20 Permit extension allowing approvals to be made via signatures, as defined in\n * https://eips.ethereum.org/EIPS/eip-2612[EIP-2612].\n \n Adds the {permit} method, which can be used to change an account's ERC20 allowance (see {IERC20-allowance}) by\n * presenting a message signed by the account. By not relying on {IERC20-approve}, the token holder account doesn't\n * need to send a transaction, and thus is not required to hold Ether at all.\n /\ninterface IERC20PermitUpgradeable {\n /\n @dev Sets `value` as the allowance of `spender` over ``owner``'s tokens,\n * given ``owner``'s signed approval.\n \n IMPORTANT: The same issues {IERC20-approve} has related to transaction\n * ordering also apply here.\n \n Emits an {Approval} event.\n \n Requirements:\n \n - `spender` cannot be the zero address.\n * - `deadline` must be a timestamp in the future.\n * - `v`, `r` and `s` must be a valid `secp256k1` signature from `owner`\n * over the EIP712-formatted function arguments.\n * - the signature must use ``owner``'s current nonce (see {nonces}).\n \n For more information on the signature format, see the\n * https://eips.ethereum.org/EIPS/eip-2612#specification[relevant EIP\n * section].\n /\n function permit(\n address owner,\n address spender,\n uint256 value,\n uint256 deadline,\n uint8 v,\n bytes32 r,\n bytes32 s\n ) external;\n\n /\n @dev Returns the current nonce for `owner`. This value must be\n * included whenever a signature is generated for {permit}.\n \n Every successful call to {permit} increases ``owner``'s nonce by one. This\n * prevents a signature from being used multiple times.\n /\n function nonces(address owner) external view returns (uint256);\n\n /\n @dev Returns the domain separator used in the encoding of the signature for {permit}, as defined by {EIP712}.\n */\n // solhint-disable-next-line func-name-mixedcase\n function DOMAIN_SEPARATOR() external view returns (bytes32);\n}\n"
	},
	"@openzeppelin/contracts-upgradeable/token/ERC20/IERC20Upgradeable.sol": {
	"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.6.0) (token/ERC20/IERC20.sol)\n\npragma solidity ^0.8.0;\n\n/*\n @dev Interface of the ERC20 standard as defined in the EIP.\n /\ninterface IERC20Upgradeable {\n /\n @dev Emitted when `value` tokens are moved from one account (`from`) to\n * another (`to`).\n \n Note that `value` may be zero.\n /\n event Transfer(address indexed from, address indexed to, uint256 value);\n\n /\n @dev Emitted when the allowance of a `spender` for an `owner` is set by\n * a call to {approve}. `value` is the new allowance.\n /\n event Approval(address indexed owner, address indexed spender, uint256 value);\n\n /\n @dev Returns the amount of tokens in existence.\n /\n function totalSupply() external view returns (uint256);\n\n /\n @dev Returns the amount of tokens owned by `account`.\n /\n function balanceOf(address account) external view returns (uint256);\n\n /\n @dev Moves `amount` tokens from the caller's account to `to`.\n \n Returns a boolean value indicating whether the operation succeeded.\n \n Emits a {Transfer} event.\n /\n function transfer(address to, uint256 amount) external returns (bool);\n\n /\n @dev Returns the remaining number of tokens that `spender` will be\n * allowed to spend on behalf of `owner` through {transferFrom}. This is\n * zero by default.\n \n This value changes when {approve} or {transferFrom} are called.\n /\n function allowance(address owner, address spender) external view returns (uint256);\n\n /\n @dev Sets `amount` as the allowance of `spender` over the caller's tokens.\n \n Returns a boolean value indicating whether the operation succeeded.\n \n IMPORTANT: Beware that changing an allowance with this method brings the risk\n * that someone may use both the old and the new allowance by unfortunate\n * transaction ordering. One possible solution to mitigate this race\n * condition is to first reduce the spender's allowance to 0 and set the\n * desired value afterwards:\n * https://github.com/ethereum/EIPs/issues/20#issuecomment-263524729\n \n Emits an {Approval} event.\n /\n function approve(address spender, uint256 amount) external returns (bool);\n\n /\n @dev Moves `amount` tokens from `from` to `to` using the\n * allowance mechanism. `amount` is then deducted from the caller's\n * allowance.\n \n Returns a boolean value indicating whether the operation succeeded.\n \n Emits a {Transfer} event.\n */\n function transferFrom(\n address from,\n address to,\n uint256 amount\n ) external returns (bool);\n}\n"
	},
	"@openzeppelin/contracts-upgradeable/token/ERC20/utils/SafeERC20Upgradeable.sol": {
	"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.8.0) (token/ERC20/utils/SafeERC20.sol)\n\npragma solidity ^0.8.0;\n\nimport \"../IERC20Upgradeable.sol\";\nimport \"../extensions/draft-IERC20PermitUpgradeable.sol\";\nimport \"../../../utils/AddressUpgradeable.sol\";\n\n/*\n @title SafeERC20\n * @dev Wrappers around ERC20 operations that throw on failure (when the token\n * contract returns false). Tokens that return no value (and instead revert or\n * throw on failure) are also supported, non-reverting calls are assumed to be\n * successful.\n * To use this library you can add a `using SafeERC20 for IERC20;` statement to your contract,\n * which allows you to call the safe operations as `token.safeTransfer(...)`, etc.\n /\nlibrary SafeERC20Upgradeable {\n using AddressUpgradeable for address;\n\n function safeTransfer(\n IERC20Upgradeable token,\n address to,\n uint256 value\n ) internal {\n _callOptionalReturn(token, abi.encodeWithSelector(token.transfer.selector, to, value));\n }\n\n function safeTransferFrom(\n IERC20Upgradeable token,\n address from,\n address to,\n uint256 value\n ) internal {\n _callOptionalReturn(token, abi.encodeWithSelector(token.transferFrom.selector, from, to, value));\n }\n\n /\n @dev Deprecated. This function has issues similar to the ones found in\n * {IERC20-approve}, and its usage is discouraged.\n \n Whenever possible, use {safeIncreaseAllowance} and\n * {safeDecreaseAllowance} instead.\n /\n function safeApprove(\n IERC20Upgradeable token,\n address spender,\n uint256 value\n ) internal {\n // safeApprove should only be called when setting an initial allowance,\n // or when resetting it to zero. To increase and decrease it, use\n // 'safeIncreaseAllowance' and 'safeDecreaseAllowance'\n require(\n (value == 0) \|\| (token.allowance(address(this), spender) == 0),\n \"SafeERC20: approve from non-zero to non-zero allowance\"\n );\n _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, value));\n }\n\n function safeIncreaseAllowance(\n IERC20Upgradeable token,\n address spender,\n uint256 value\n ) internal {\n uint256 newAllowance = token.allowance(address(this), spender) + value;\n _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, newAllowance));\n }\n\n function safeDecreaseAllowance(\n IERC20Upgradeable token,\n address spender,\n uint256 value\n ) internal {\n unchecked {\n uint256 oldAllowance = token.allowance(address(this), spender);\n require(oldAllowance >= value, \"SafeERC20: decreased allowance below zero\");\n uint256 newAllowance = oldAllowance - value;\n _callOptionalReturn(token, abi.encodeWithSelector(token.approve.selector, spender, newAllowance));\n }\n }\n\n function safePermit(\n IERC20PermitUpgradeable token,\n address owner,\n address spender,\n uint256 value,\n uint256 deadline,\n uint8 v,\n bytes32 r,\n bytes32 s\n ) internal {\n uint256 nonceBefore = token.nonces(owner);\n token.permit(owner, spender, value, deadline, v, r, s);\n uint256 nonceAfter = token.nonces(owner);\n require(nonceAfter == nonceBefore + 1, \"SafeERC20: permit did not succeed\");\n }\n\n /\n @dev Imitates a Solidity high-level call (i.e. a regular function call to a contract), relaxing the requirement\n * on the return value: the return value is optional (but if data is returned, it must not be false).\n * @param token The token targeted by the call.\n * @param data The call data (encoded using abi.encode or one of its variants).\n */\n function _callOptionalReturn(IERC20Upgradeable token, bytes memory data) private {\n // We need to perform a low level call here, to bypass Solidity's return data size checking mechanism, since\n // we're implementing it ourselves. We use {Address-functionCall} to perform this call, which verifies that\n // the target address contains contract code and also asserts for success in the low-level call.\n\n bytes memory returndata = address(token).functionCall(data, \"SafeERC20: low-level call failed\");\n if (returndata.length > 0) {\n // Return data is optional\n require(abi.decode(returndata, (bool)), \"SafeERC20: ERC20 operation did not succeed\");\n }\n }\n}\n"
	},
	"@openzeppelin/contracts-upgradeable/utils/AddressUpgradeable.sol": {
	"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.8.0) (utils/Address.sol)\n\npragma solidity ^0.8.1;\n\n/*\n @dev Collection of functions related to the address type\n /\nlibrary AddressUpgradeable {\n /\n @dev Returns true if `account` is a contract.\n \n [IMPORTANT]\n * ====\n * It is unsafe to assume that an address for which this function returns\n * false is an externally-owned account (EOA) and not a contract.\n \n Among others, `isContract` will return false for the following\n * types of addresses:\n \n - an externally-owned account\n * - a contract in construction\n * - an address where a contract will be created\n * - an address where a contract lived, but was destroyed\n * ====\n \n [IMPORTANT]\n * ====\n * You shouldn't rely on `isContract` to protect against flash loan attacks!\n \n Preventing calls from contracts is highly discouraged. It breaks composability, breaks support for smart wallets\n * like Gnosis Safe, and does not provide security since it can be circumvented by calling from a contract\n * constructor.\n * ====\n /\n function isContract(address account) internal view returns (bool) {\n // This method relies on extcodesize/address.code.length, which returns 0\n // for contracts in construction, since the code is only stored at the end\n // of the constructor execution.\n\n return account.code.length > 0;\n }\n\n /\n @dev Replacement for Solidity's `transfer`: sends `amount` wei to\n * `recipient`, forwarding all available gas and reverting on errors.\n \n https://eips.ethereum.org/EIPS/eip-1884[EIP1884] increases the gas cost\n * of certain opcodes, possibly making contracts go over the 2300 gas limit\n * imposed by `transfer`, making them unable to receive funds via\n * `transfer`. {sendValue} removes this limitation.\n \n https://diligence.consensys.net/posts/2019/09/stop-using-soliditys-transfer-now/[Learn more].\n \n IMPORTANT: because control is transferred to `recipient`, care must be\n * taken to not create reentrancy vulnerabilities. Consider using\n * {ReentrancyGuard} or the\n * https://solidity.readthedocs.io/en/v0.5.11/security-considerations.html#use-the-checks-effects-interactions-pattern[checks-effects-interactions pattern].\n /\n function sendValue(address payable recipient, uint256 amount) internal {\n require(address(this).balance >= amount, \"Address: insufficient balance\");\n\n (bool success, ) = recipient.call{value: amount}(\"\");\n require(success, \"Address: unable to send value, recipient may have reverted\");\n }\n\n /\n @dev Performs a Solidity function call using a low level `call`. A\n * plain `call` is an unsafe replacement for a function call: use this\n * function instead.\n \n If `target` reverts with a revert reason, it is bubbled up by this\n * function (like regular Solidity function calls).\n \n Returns the raw returned data. To convert to the expected return value,\n * use https://solidity.readthedocs.io/en/latest/units-and-global-variables.html?highlight=abi.decode#abi-encoding-and-decoding-functions[`abi.decode`].\n \n Requirements:\n \n - `target` must be a contract.\n * - calling `target` with `data` must not revert.\n \n _Available since v3.1._\n /\n function functionCall(address target, bytes memory data) internal returns (bytes memory) {\n return functionCallWithValue(target, data, 0, \"Address: low-level call failed\");\n }\n\n /\n @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`], but with\n * `errorMessage` as a fallback revert reason when `target` reverts.\n \n _Available since v3.1._\n /\n function functionCall(\n address target,\n bytes memory data,\n string memory errorMessage\n ) internal returns (bytes memory) {\n return functionCallWithValue(target, data, 0, errorMessage);\n }\n\n /\n @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\n * but also transferring `value` wei to `target`.\n \n Requirements:\n \n - the calling contract must have an ETH balance of at least `value`.\n * - the called Solidity function must be `payable`.\n \n _Available since v3.1._\n /\n function functionCallWithValue(\n address target,\n bytes memory data,\n uint256 value\n ) internal returns (bytes memory) {\n return functionCallWithValue(target, data, value, \"Address: low-level call with value failed\");\n }\n\n /\n @dev Same as {xref-Address-functionCallWithValue-address-bytes-uint256-}[`functionCallWithValue`], but\n * with `errorMessage` as a fallback revert reason when `target` reverts.\n \n _Available since v3.1._\n /\n function functionCallWithValue(\n address target,\n bytes memory data,\n uint256 value,\n string memory errorMessage\n ) internal returns (bytes memory) {\n require(address(this).balance >= value, \"Address: insufficient balance for call\");\n (bool success, bytes memory returndata) = target.call{value: value}(data);\n return verifyCallResultFromTarget(target, success, returndata, errorMessage);\n }\n\n /\n @dev Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\n * but performing a static call.\n \n _Available since v3.3._\n /\n function functionStaticCall(address target, bytes memory data) internal view returns (bytes memory) {\n return functionStaticCall(target, data, \"Address: low-level static call failed\");\n }\n\n /\n @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],\n * but performing a static call.\n \n _Available since v3.3._\n /\n function functionStaticCall(\n address target,\n bytes memory data,\n string memory errorMessage\n ) internal view returns (bytes memory) {\n (bool success, bytes memory returndata) = target.staticcall(data);\n return verifyCallResultFromTarget(target, success, returndata, errorMessage);\n }\n\n /\n @dev Tool to verify that a low level call to smart-contract was successful, and revert (either by bubbling\n * the revert reason or using the provided one) in case of unsuccessful call or if target was not a contract.\n \n _Available since v4.8._\n /\n function verifyCallResultFromTarget(\n address target,\n bool success,\n bytes memory returndata,\n string memory errorMessage\n ) internal view returns (bytes memory) {\n if (success) {\n if (returndata.length == 0) {\n // only check isContract if the call was successful and the return data is empty\n // otherwise we already know that it was a contract\n require(isContract(target), \"Address: call to non-contract\");\n }\n return returndata;\n } else {\n _revert(returndata, errorMessage);\n }\n }\n\n /\n @dev Tool to verify that a low level call was successful, and revert if it wasn't, either by bubbling the\n * revert reason or using the provided one.\n \n _Available since v4.3._\n */\n function verifyCallResult(\n bool success,\n bytes memory returndata,\n string memory errorMessage\n ) internal pure returns (bytes memory) {\n if (success) {\n return returndata;\n } else {\n _revert(returndata, errorMessage);\n }\n }\n\n function _revert(bytes memory returndata, string memory errorMessage) private pure {\n // Look for revert reason and bubble it up if present\n if (returndata.length > 0) {\n // The easiest way to bubble the revert reason is using memory via assembly\n /// @solidity memory-safe-assembly\n assembly {\n let returndata_size := mload(returndata)\n revert(add(32, returndata), returndata_size)\n }\n } else {\n revert(errorMessage);\n }\n }\n}\n"
	},
	"@openzeppelin/contracts-upgradeable/utils/ContextUpgradeable.sol": {
	"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts v4.4.1 (utils/Context.sol)\n\npragma solidity ^0.8.0;\nimport \"../proxy/utils/Initializable.sol\";\n\n/*\n @dev Provides information about the current execution context, including the\n * sender of the transaction and its data. While these are generally available\n * via msg.sender and msg.data, they should not be accessed in such a direct\n * manner, since when dealing with meta-transactions the account sending and\n * paying for execution may not be the actual sender (as far as an application\n * is concerned).\n \n This contract is only required for intermediate, library-like contracts.\n /\nabstract contract ContextUpgradeable is Initializable {\n function __Context_init() internal onlyInitializing {\n }\n\n function __Context_init_unchained() internal onlyInitializing {\n }\n function _msgSender() internal view virtual returns (address) {\n return msg.sender;\n }\n\n function _msgData() internal view virtual returns (bytes calldata) {\n return msg.data;\n }\n\n /\n @dev This empty reserved space is put in place to allow future versions to add new\n * variables without shifting down storage in the inheritance chain.\n * See https://docs.openzeppelin.com/contracts/4.x/upgradeable#storage_gaps\n */\n uint256[50] private __gap;\n}\n"
	},
	"@openzeppelin/contracts-upgradeable/utils/introspection/ERC165Upgradeable.sol": {
	"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts v4.4.1 (utils/introspection/ERC165.sol)\n\npragma solidity ^0.8.0;\n\nimport \"./IERC165Upgradeable.sol\";\nimport \"../../proxy/utils/Initializable.sol\";\n\n/*\n @dev Implementation of the {IERC165} interface.\n \n Contracts that want to implement ERC165 should inherit from this contract and override {supportsInterface} to check\n * for the additional interface id that will be supported. For example:\n \n ```solidity\n * function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {\n * return interfaceId == type(MyInterface).interfaceId \|\| super.supportsInterface(interfaceId);\n * }\n * ```\n \n Alternatively, {ERC165Storage} provides an easier to use but more expensive implementation.\n /\nabstract contract ERC165Upgradeable is Initializable, IERC165Upgradeable {\n function __ERC165_init() internal onlyInitializing {\n }\n\n function __ERC165_init_unchained() internal onlyInitializing {\n }\n /\n @dev See {IERC165-supportsInterface}.\n /\n function supportsInterface(bytes4 interfaceId) public view virtual override returns (bool) {\n return interfaceId == type(IERC165Upgradeable).interfaceId;\n }\n\n /\n @dev This empty reserved space is put in place to allow future versions to add new\n * variables without shifting down storage in the inheritance chain.\n * See https://docs.openzeppelin.com/contracts/4.x/upgradeable#storage_gaps\n */\n uint256[50] private __gap;\n}\n"
	},
	"@openzeppelin/contracts-upgradeable/utils/introspection/IERC165Upgradeable.sol": {
	"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts v4.4.1 (utils/introspection/IERC165.sol)\n\npragma solidity ^0.8.0;\n\n/*\n @dev Interface of the ERC165 standard, as defined in the\n * https://eips.ethereum.org/EIPS/eip-165[EIP].\n \n Implementers can declare support of contract interfaces, which can then be\n * queried by others ({ERC165Checker}).\n \n For an implementation, see {ERC165}.\n /\ninterface IERC165Upgradeable {\n /\n @dev Returns true if this contract implements the interface defined by\n * `interfaceId`. See the corresponding\n * https://eips.ethereum.org/EIPS/eip-165#how-interfaces-are-identified[EIP section]\n * to learn more about how these ids are created.\n \n This function call must use less than 30 000 gas.\n */\n function supportsInterface(bytes4 interfaceId) external view returns (bool);\n}\n"
	},
	"@openzeppelin/contracts-upgradeable/utils/math/MathUpgradeable.sol": {
	"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.8.0) (utils/math/Math.sol)\n\npragma solidity ^0.8.0;\n\n/*\n @dev Standard math utilities missing in the Solidity language.\n /\nlibrary MathUpgradeable {\n enum Rounding {\n Down, // Toward negative infinity\n Up, // Toward infinity\n Zero // Toward zero\n }\n\n /\n @dev Returns the largest of two numbers.\n /\n function max(uint256 a, uint256 b) internal pure returns (uint256) {\n return a > b ? a : b;\n }\n\n /\n @dev Returns the smallest of two numbers.\n /\n function min(uint256 a, uint256 b) internal pure returns (uint256) {\n return a < b ? a : b;\n }\n\n /\n @dev Returns the average of two numbers. The result is rounded towards\n * zero.\n /\n function average(uint256 a, uint256 b) internal pure returns (uint256) {\n // (a + b) / 2 can overflow.\n return (a & b) + (a ^ b) / 2;\n }\n\n /\n @dev Returns the ceiling of the division of two numbers.\n \n This differs from standard division with `/` in that it rounds up instead\n * of rounding down.\n /\n function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {\n // (a + b - 1) / b can overflow on addition, so we distribute.\n return a == 0 ? 0 : (a - 1) / b + 1;\n }\n\n /\n @notice Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or denominator == 0\n * @dev Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv)\n * with further edits by Uniswap Labs also under MIT license.\n /\n function mulDiv(\n uint256 x,\n uint256 y,\n uint256 denominator\n ) internal pure returns (uint256 result) {\n unchecked {\n // 512-bit multiply [prod1 prod0] = x y. Compute the product mod 2^256 and mod 2^256 - 1, then use\n // use the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256\n // variables such that product = prod1 * 2^256 + prod0.\n uint256 prod0; // Least significant 256 bits of the product\n uint256 prod1; // Most significant 256 bits of the product\n assembly {\n let mm := mulmod(x, y, not(0))\n prod0 := mul(x, y)\n prod1 := sub(sub(mm, prod0), lt(mm, prod0))\n }\n\n // Handle non-overflow cases, 256 by 256 division.\n if (prod1 == 0) {\n return prod0 / denominator;\n }\n\n // Make sure the result is less than 2^256. Also prevents denominator == 0.\n require(denominator > prod1);\n\n ///////////////////////////////////////////////\n // 512 by 256 division.\n ///////////////////////////////////////////////\n\n // Make division exact by subtracting the remainder from [prod1 prod0].\n uint256 remainder;\n assembly {\n // Compute remainder using mulmod.\n remainder := mulmod(x, y, denominator)\n\n // Subtract 256 bit number from 512 bit number.\n prod1 := sub(prod1, gt(remainder, prod0))\n prod0 := sub(prod0, remainder)\n }\n\n // Factor powers of two out of denominator and compute largest power of two divisor of denominator. Always >= 1.\n // See https://cs.stackexchange.com/q/138556/92363.\n\n // Does not overflow because the denominator cannot be zero at this stage in the function.\n uint256 twos = denominator & (~denominator + 1);\n assembly {\n // Divide denominator by twos.\n denominator := div(denominator, twos)\n\n // Divide [prod1 prod0] by twos.\n prod0 := div(prod0, twos)\n\n // Flip twos such that it is 2^256 / twos. If twos is zero, then it becomes one.\n twos := add(div(sub(0, twos), twos), 1)\n }\n\n // Shift in bits from prod1 into prod0.\n prod0 \|= prod1 * twos;\n\n // Invert denominator mod 2^256. Now that denominator is an odd number, it has an inverse modulo 2^256 such\n // that denominator * inv = 1 mod 2^256. Compute the inverse by starting with a seed that is correct for\n // four bits. That is, denominator * inv = 1 mod 2^4.\n uint256 inverse = (3 * denominator) ^ 2;\n\n // Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also works\n // in modular arithmetic, doubling the correct bits in each step.\n inverse = 2 - denominator inverse; // inverse mod 2^8\n inverse = 2 - denominator inverse; // inverse mod 2^16\n inverse = 2 - denominator inverse; // inverse mod 2^32\n inverse = 2 - denominator inverse; // inverse mod 2^64\n inverse = 2 - denominator inverse; // inverse mod 2^128\n inverse = 2 - denominator inverse; // inverse mod 2^256\n\n // Because the division is now exact we can divide by multiplying with the modular inverse of denominator.\n // This will give us the correct result modulo 2^256. Since the preconditions guarantee that the outcome is\n // less than 2^256, this is the final result. We don't need to compute the high bits of the result and prod1\n // is no longer required.\n result = prod0 * inverse;\n return result;\n }\n }\n\n /*\n @notice Calculates x * y / denominator with full precision, following the selected rounding direction.\n /\n function mulDiv(\n uint256 x,\n uint256 y,\n uint256 denominator,\n Rounding rounding\n ) internal pure returns (uint256) {\n uint256 result = mulDiv(x, y, denominator);\n if (rounding == Rounding.Up && mulmod(x, y, denominator) > 0) {\n result += 1;\n }\n return result;\n }\n\n /\n @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded down.\n \n Inspired by Henry S. Warren, Jr.'s \"Hacker's Delight\" (Chapter 11).\n /\n function sqrt(uint256 a) internal pure returns (uint256) {\n if (a == 0) {\n return 0;\n }\n\n // For our first guess, we get the biggest power of 2 which is smaller than the square root of the target.\n //\n // We know that the \"msb\" (most significant bit) of our target number `a` is a power of 2 such that we have\n // `msb(a) <= a < 2msb(a)`. This value can be written `msb(a)=2k` with `k=log2(a)`.\n //\n // This can be rewritten `2log2(a) <= a < 2(log2(a) + 1)`\n // → `sqrt(2k) <= sqrt(a) < sqrt(2(k+1))`\n // → `2(k/2) <= sqrt(a) < 2((k+1)/2) <= 2(k/2 + 1)`\n //\n // Consequently, `2(log2(a) / 2)` is a good first approximation of `sqrt(a)` with at least 1 correct bit.\n uint256 result = 1 << (log2(a) >> 1);\n\n // At this point `result` is an estimation with one bit of precision. We know the true value is a uint128,\n // since it is the square root of a uint256. Newton's method converges quadratically (precision doubles at\n // every iteration). We thus need at most 7 iteration to turn our partial result with one bit of precision\n // into the expected uint128 result.\n unchecked {\n result = (result + a / result) >> 1;\n result = (result + a / result) >> 1;\n result = (result + a / result) >> 1;\n result = (result + a / result) >> 1;\n result = (result + a / result) >> 1;\n result = (result + a / result) >> 1;\n result = (result + a / result) >> 1;\n return min(result, a / result);\n }\n }\n\n /\n * @notice Calculates sqrt(a), following the selected rounding direction.\n /\n function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {\n unchecked {\n uint256 result = sqrt(a);\n return result + (rounding == Rounding.Up && result result < a ? 1 : 0);\n }\n }\n\n /*\n @dev Return the log in base 2, rounded down, of a positive value.\n * Returns 0 if given 0.\n /\n function log2(uint256 value) internal pure returns (uint256) {\n uint256 result = 0;\n unchecked {\n if (value >> 128 > 0) {\n value >>= 128;\n result += 128;\n }\n if (value >> 64 > 0) {\n value >>= 64;\n result += 64;\n }\n if (value >> 32 > 0) {\n value >>= 32;\n result += 32;\n }\n if (value >> 16 > 0) {\n value >>= 16;\n result += 16;\n }\n if (value >> 8 > 0) {\n value >>= 8;\n result += 8;\n }\n if (value >> 4 > 0) {\n value >>= 4;\n result += 4;\n }\n if (value >> 2 > 0) {\n value >>= 2;\n result += 2;\n }\n if (value >> 1 > 0) {\n result += 1;\n }\n }\n return result;\n }\n\n /\n @dev Return the log in base 2, following the selected rounding direction, of a positive value.\n * Returns 0 if given 0.\n /\n function log2(uint256 value, Rounding rounding) internal pure returns (uint256) {\n unchecked {\n uint256 result = log2(value);\n return result + (rounding == Rounding.Up && 1 << result < value ? 1 : 0);\n }\n }\n\n /\n @dev Return the log in base 10, rounded down, of a positive value.\n * Returns 0 if given 0.\n /\n function log10(uint256 value) internal pure returns (uint256) {\n uint256 result = 0;\n unchecked {\n if (value >= 1064) {\n value /= 1064;\n result += 64;\n }\n if (value >= 1032) {\n value /= 1032;\n result += 32;\n }\n if (value >= 1016) {\n value /= 1016;\n result += 16;\n }\n if (value >= 108) {\n value /= 108;\n result += 8;\n }\n if (value >= 104) {\n value /= 104;\n result += 4;\n }\n if (value >= 102) {\n value /= 102;\n result += 2;\n }\n if (value >= 101) {\n result += 1;\n }\n }\n return result;\n }\n\n /\n @dev Return the log in base 10, following the selected rounding direction, of a positive value.\n * Returns 0 if given 0.\n /\n function log10(uint256 value, Rounding rounding) internal pure returns (uint256) {\n unchecked {\n uint256 result = log10(value);\n return result + (rounding == Rounding.Up && 10result < value ? 1 : 0);\n }\n }\n\n /\n @dev Return the log in base 256, rounded down, of a positive value.\n * Returns 0 if given 0.\n \n Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.\n /\n function log256(uint256 value) internal pure returns (uint256) {\n uint256 result = 0;\n unchecked {\n if (value >> 128 > 0) {\n value >>= 128;\n result += 16;\n }\n if (value >> 64 > 0) {\n value >>= 64;\n result += 8;\n }\n if (value >> 32 > 0) {\n value >>= 32;\n result += 4;\n }\n if (value >> 16 > 0) {\n value >>= 16;\n result += 2;\n }\n if (value >> 8 > 0) {\n result += 1;\n }\n }\n return result;\n }\n\n /\n @dev Return the log in base 10, following the selected rounding direction, of a positive value.\n * Returns 0 if given 0.\n /\n function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {\n unchecked {\n uint256 result = log256(value);\n return result + (rounding == Rounding.Up && 1 << (result 8) < value ? 1 : 0);\n }\n }\n}\n"
	},
	"@openzeppelin/contracts-upgradeable/utils/StringsUpgradeable.sol": {
	"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.8.0) (utils/Strings.sol)\n\npragma solidity ^0.8.0;\n\nimport \"./math/MathUpgradeable.sol\";\n\n/*\n @dev String operations.\n /\nlibrary StringsUpgradeable {\n bytes16 private constant _SYMBOLS = \"0123456789abcdef\";\n uint8 private constant _ADDRESS_LENGTH = 20;\n\n /\n @dev Converts a `uint256` to its ASCII `string` decimal representation.\n /\n function toString(uint256 value) internal pure returns (string memory) {\n unchecked {\n uint256 length = MathUpgradeable.log10(value) + 1;\n string memory buffer = new string(length);\n uint256 ptr;\n /// @solidity memory-safe-assembly\n assembly {\n ptr := add(buffer, add(32, length))\n }\n while (true) {\n ptr--;\n /// @solidity memory-safe-assembly\n assembly {\n mstore8(ptr, byte(mod(value, 10), _SYMBOLS))\n }\n value /= 10;\n if (value == 0) break;\n }\n return buffer;\n }\n }\n\n /\n @dev Converts a `uint256` to its ASCII `string` hexadecimal representation.\n /\n function toHexString(uint256 value) internal pure returns (string memory) {\n unchecked {\n return toHexString(value, MathUpgradeable.log256(value) + 1);\n }\n }\n\n /\n @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length.\n /\n function toHexString(uint256 value, uint256 length) internal pure returns (string memory) {\n bytes memory buffer = new bytes(2 length + 2);\n buffer[0] = \"0\";\n buffer[1] = \"x\";\n for (uint256 i = 2 * length + 1; i > 1; --i) {\n buffer[i] = _SYMBOLS[value & 0xf];\n value >>= 4;\n }\n require(value == 0, \"Strings: hex length insufficient\");\n return string(buffer);\n }\n\n /*\n @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal representation.\n */\n function toHexString(address addr) internal pure returns (string memory) {\n return toHexString(uint256(uint160(addr)), _ADDRESS_LENGTH);\n }\n}\n"
	},
	"@openzeppelin/contracts-upgradeable/utils/structs/EnumerableSetUpgradeable.sol": {
	"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.8.0) (utils/structs/EnumerableSet.sol)\n// This file was procedurally generated from scripts/generate/templates/EnumerableSet.js.\n\npragma solidity ^0.8.0;\n\n/*\n @dev Library for managing\n * https://en.wikipedia.org/wiki/Set_(abstract_data_type)[sets] of primitive\n * types.\n \n Sets have the following properties:\n \n - Elements are added, removed, and checked for existence in constant time\n * (O(1)).\n * - Elements are enumerated in O(n). No guarantees are made on the ordering.\n \n ```\n * contract Example {\n * // Add the library methods\n * using EnumerableSet for EnumerableSet.AddressSet;\n \n // Declare a set state variable\n * EnumerableSet.AddressSet private mySet;\n * }\n * ```\n \n As of v3.3.0, sets of type `bytes32` (`Bytes32Set`), `address` (`AddressSet`)\n * and `uint256` (`UintSet`) are supported.\n \n [WARNING]\n * ====\n * Trying to delete such a structure from storage will likely result in data corruption, rendering the structure\n * unusable.\n * See https://github.com/ethereum/solidity/pull/11843[ethereum/solidity#11843] for more info.\n \n In order to clean an EnumerableSet, you can either remove all elements one by one or create a fresh instance using an\n * array of EnumerableSet.\n * ====\n /\nlibrary EnumerableSetUpgradeable {\n // To implement this library for multiple types with as little code\n // repetition as possible, we write it in terms of a generic Set type with\n // bytes32 values.\n // The Set implementation uses private functions, and user-facing\n // implementations (such as AddressSet) are just wrappers around the\n // underlying Set.\n // This means that we can only create new EnumerableSets for types that fit\n // in bytes32.\n\n struct Set {\n // Storage of set values\n bytes32[] _values;\n // Position of the value in the `values` array, plus 1 because index 0\n // means a value is not in the set.\n mapping(bytes32 => uint256) _indexes;\n }\n\n /\n @dev Add a value to a set. O(1).\n \n Returns true if the value was added to the set, that is if it was not\n * already present.\n /\n function _add(Set storage set, bytes32 value) private returns (bool) {\n if (!_contains(set, value)) {\n set._values.push(value);\n // The value is stored at length-1, but we add 1 to all indexes\n // and use 0 as a sentinel value\n set._indexes[value] = set._values.length;\n return true;\n } else {\n return false;\n }\n }\n\n /\n @dev Removes a value from a set. O(1).\n \n Returns true if the value was removed from the set, that is if it was\n * present.\n /\n function _remove(Set storage set, bytes32 value) private returns (bool) {\n // We read and store the value's index to prevent multiple reads from the same storage slot\n uint256 valueIndex = set._indexes[value];\n\n if (valueIndex != 0) {\n // Equivalent to contains(set, value)\n // To delete an element from the _values array in O(1), we swap the element to delete with the last one in\n // the array, and then remove the last element (sometimes called as 'swap and pop').\n // This modifies the order of the array, as noted in {at}.\n\n uint256 toDeleteIndex = valueIndex - 1;\n uint256 lastIndex = set._values.length - 1;\n\n if (lastIndex != toDeleteIndex) {\n bytes32 lastValue = set._values[lastIndex];\n\n // Move the last value to the index where the value to delete is\n set._values[toDeleteIndex] = lastValue;\n // Update the index for the moved value\n set._indexes[lastValue] = valueIndex; // Replace lastValue's index to valueIndex\n }\n\n // Delete the slot where the moved value was stored\n set._values.pop();\n\n // Delete the index for the deleted slot\n delete set._indexes[value];\n\n return true;\n } else {\n return false;\n }\n }\n\n /\n @dev Returns true if the value is in the set. O(1).\n /\n function _contains(Set storage set, bytes32 value) private view returns (bool) {\n return set._indexes[value] != 0;\n }\n\n /\n @dev Returns the number of values on the set. O(1).\n /\n function _length(Set storage set) private view returns (uint256) {\n return set._values.length;\n }\n\n /\n @dev Returns the value stored at position `index` in the set. O(1).\n \n Note that there are no guarantees on the ordering of values inside the\n * array, and it may change when more values are added or removed.\n \n Requirements:\n \n - `index` must be strictly less than {length}.\n /\n function _at(Set storage set, uint256 index) private view returns (bytes32) {\n return set._values[index];\n }\n\n /\n @dev Return the entire set in an array\n \n WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n /\n function _values(Set storage set) private view returns (bytes32[] memory) {\n return set._values;\n }\n\n // Bytes32Set\n\n struct Bytes32Set {\n Set _inner;\n }\n\n /\n @dev Add a value to a set. O(1).\n \n Returns true if the value was added to the set, that is if it was not\n * already present.\n /\n function add(Bytes32Set storage set, bytes32 value) internal returns (bool) {\n return _add(set._inner, value);\n }\n\n /\n @dev Removes a value from a set. O(1).\n \n Returns true if the value was removed from the set, that is if it was\n * present.\n /\n function remove(Bytes32Set storage set, bytes32 value) internal returns (bool) {\n return _remove(set._inner, value);\n }\n\n /\n @dev Returns true if the value is in the set. O(1).\n /\n function contains(Bytes32Set storage set, bytes32 value) internal view returns (bool) {\n return _contains(set._inner, value);\n }\n\n /\n @dev Returns the number of values in the set. O(1).\n /\n function length(Bytes32Set storage set) internal view returns (uint256) {\n return _length(set._inner);\n }\n\n /\n @dev Returns the value stored at position `index` in the set. O(1).\n \n Note that there are no guarantees on the ordering of values inside the\n * array, and it may change when more values are added or removed.\n \n Requirements:\n \n - `index` must be strictly less than {length}.\n /\n function at(Bytes32Set storage set, uint256 index) internal view returns (bytes32) {\n return _at(set._inner, index);\n }\n\n /\n @dev Return the entire set in an array\n \n WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n /\n function values(Bytes32Set storage set) internal view returns (bytes32[] memory) {\n bytes32[] memory store = _values(set._inner);\n bytes32[] memory result;\n\n /// @solidity memory-safe-assembly\n assembly {\n result := store\n }\n\n return result;\n }\n\n // AddressSet\n\n struct AddressSet {\n Set _inner;\n }\n\n /\n @dev Add a value to a set. O(1).\n \n Returns true if the value was added to the set, that is if it was not\n * already present.\n /\n function add(AddressSet storage set, address value) internal returns (bool) {\n return _add(set._inner, bytes32(uint256(uint160(value))));\n }\n\n /\n @dev Removes a value from a set. O(1).\n \n Returns true if the value was removed from the set, that is if it was\n * present.\n /\n function remove(AddressSet storage set, address value) internal returns (bool) {\n return _remove(set._inner, bytes32(uint256(uint160(value))));\n }\n\n /\n @dev Returns true if the value is in the set. O(1).\n /\n function contains(AddressSet storage set, address value) internal view returns (bool) {\n return _contains(set._inner, bytes32(uint256(uint160(value))));\n }\n\n /\n @dev Returns the number of values in the set. O(1).\n /\n function length(AddressSet storage set) internal view returns (uint256) {\n return _length(set._inner);\n }\n\n /\n @dev Returns the value stored at position `index` in the set. O(1).\n \n Note that there are no guarantees on the ordering of values inside the\n * array, and it may change when more values are added or removed.\n \n Requirements:\n \n - `index` must be strictly less than {length}.\n /\n function at(AddressSet storage set, uint256 index) internal view returns (address) {\n return address(uint160(uint256(_at(set._inner, index))));\n }\n\n /\n @dev Return the entire set in an array\n \n WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n /\n function values(AddressSet storage set) internal view returns (address[] memory) {\n bytes32[] memory store = _values(set._inner);\n address[] memory result;\n\n /// @solidity memory-safe-assembly\n assembly {\n result := store\n }\n\n return result;\n }\n\n // UintSet\n\n struct UintSet {\n Set _inner;\n }\n\n /\n @dev Add a value to a set. O(1).\n \n Returns true if the value was added to the set, that is if it was not\n * already present.\n /\n function add(UintSet storage set, uint256 value) internal returns (bool) {\n return _add(set._inner, bytes32(value));\n }\n\n /\n @dev Removes a value from a set. O(1).\n \n Returns true if the value was removed from the set, that is if it was\n * present.\n /\n function remove(UintSet storage set, uint256 value) internal returns (bool) {\n return _remove(set._inner, bytes32(value));\n }\n\n /\n @dev Returns true if the value is in the set. O(1).\n /\n function contains(UintSet storage set, uint256 value) internal view returns (bool) {\n return _contains(set._inner, bytes32(value));\n }\n\n /\n @dev Returns the number of values in the set. O(1).\n /\n function length(UintSet storage set) internal view returns (uint256) {\n return _length(set._inner);\n }\n\n /\n @dev Returns the value stored at position `index` in the set. O(1).\n \n Note that there are no guarantees on the ordering of values inside the\n * array, and it may change when more values are added or removed.\n \n Requirements:\n \n - `index` must be strictly less than {length}.\n /\n function at(UintSet storage set, uint256 index) internal view returns (uint256) {\n return uint256(_at(set._inner, index));\n }\n\n /\n @dev Return the entire set in an array\n \n WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed\n * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that\n * this function has an unbounded cost, and using it as part of a state-changing function may render the function\n * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.\n */\n function values(UintSet storage set) internal view returns (uint256[] memory) {\n bytes32[] memory store = _values(set._inner);\n uint256[] memory result;\n\n /// @solidity memory-safe-assembly\n assembly {\n result := store\n }\n\n return result;\n }\n}\n"
	},
	"contracts/interfaces/IDepositToken.sol": {
	"content": "// SPDX-License-Identifier: MIT\r\n\r\npragma solidity 0.8.16;\r\n\r\ninterface IDepositToken {\r\n function pool() external view returns (address);\r\n function initialize(address pool) external returns (bool);\r\n function mint(address to, uint256 value) external returns (bool);\r\n function burn(address from, uint256 value) external returns (bool);\r\n}\r\n"
	},
	"contracts/interfaces/IMultiRewarder.sol": {
	"content": "// SPDX-License-Identifier: MIT\r\n\r\npragma solidity 0.8.16;\r\n\r\ninterface IMultiRewarder {\r\n function stakeFor(\r\n address pool,\r\n address account,\r\n uint256 amount\r\n ) external;\r\n\r\n function withdrawFrom(\r\n address pool,\r\n address account,\r\n uint256 amount\r\n ) external;\r\n\r\n function notifyRewardAmount(\r\n address pool,\r\n address[] memory _rewardsTokens,\r\n uint256[] memory _rewards\r\n ) external;\r\n}\r\n"
	},
	"contracts/interfaces/solidly/IBaseV1Voter.sol": {
	"content": "// SPDX-License-Identifier: MIT\r\npragma solidity 0.8.16;\r\n\r\ninterface IBaseV1Voter {\r\n function bribes(address gauge) external view returns (address bribe);\r\n\r\n function gauges(address pool) external view returns (address gauge);\r\n\r\n function feeDists(address pool) external view returns (address feeDist);\r\n\r\n function generalFees() external view returns (address generalFees);\r\n\r\n function poolForGauge(address gauge) external view returns (address pool);\r\n\r\n function createGauge(address pool) external returns (address);\r\n\r\n function vote(\r\n uint256 tokenId,\r\n address[] calldata pools,\r\n int256[] calldata weights\r\n ) external;\r\n\r\n function whitelist(address token, uint256 tokenId) external;\r\n\r\n function listing_fee() external view returns (uint256);\r\n\r\n function _ve() external view returns (address);\r\n\r\n function isWhitelisted(address pool) external view returns (bool);\r\n\r\n function isGauge(address gaugeAddress) external view returns (bool);\r\n\r\n}\r\n"
	},
	"contracts/interfaces/solidly/IBribe.sol": {
	"content": "// SPDX-License-Identifier: MIT\r\npragma solidity 0.8.16;\r\n\r\ninterface IBribe {\r\n function getReward(uint256 tokenId, address[] memory tokens) external;\r\n\r\n function rewardsList() external view returns (address[] memory);\r\n}\r\n"
	},
	"contracts/interfaces/solidly/IGauge.sol": {
	"content": "// SPDX-License-Identifier: MIT\n\npragma solidity 0.8.16;\n\ninterface IGauge {\n function balanceOf(address user) external returns (uint256);\n\n function deposit(uint256 amount, uint256 tokenId) external;\n\n function withdraw(uint256 amount) external;\n\n function withdrawToken(uint256 amount, uint256 tokenId) external;\n\n function getReward(address account, address[] memory tokens) external;\n\n function earned(address token, address account)\n external\n view\n returns (uint256);\n\n function tokenIds(address account) external view returns(uint256);\n}\n"
	},
	"contracts/interfaces/solidly/IVotingEscrow.sol": {
	"content": "// SPDX-License-Identifier: MIT\r\npragma solidity 0.8.16;\r\n\r\ninterface IVotingEscrow {\r\n function create_lock(uint256 value, uint256 lock_duration)\r\n external\r\n returns (uint256);\r\n\r\n function increase_amount(uint256 tokenID, uint256 value) external;\r\n\r\n function increase_unlock_time(uint256 tokenID, uint256 duration) external;\r\n\r\n function merge(uint256 fromID, uint256 toID) external;\r\n\r\n function locked(uint256 tokenID)\r\n external\r\n view\r\n returns (uint256 amount, uint256 unlockTime);\r\n\r\n function setApprovalForAll(address operator, bool approved) external;\r\n\r\n function safeTransferFrom(\r\n address from,\r\n address to,\r\n uint256 tokenId\r\n ) external;\r\n\r\n function balanceOfNFT(uint256 tokenId) external view returns (uint256);\r\n\r\n function split(uint256 from, uint256 amount) external returns (uint256);\r\n\r\n function attachments(uint256 tokenId) external view returns (uint256);\r\n\r\n function voted(uint256 tokenId) external view returns (bool isVoted);\r\n\r\n function ownerOf(uint256 tokenId) external view returns (address);\r\n\r\n // function isApprovedOrOwner(address, uint256) external view returns (bool);\r\n\r\n // function transferFrom(\r\n // address from,\r\n // address to,\r\n // uint256 tokenID\r\n // ) external;\r\n}\r\n"
	},
	"contracts/NFTHolder.sol": {
	"content": "// SPDX-License-Identifier: MIT\r\n\r\npragma solidity ^0.8.16;\r\n\r\nimport \"./interfaces/solidly/IVotingEscrow.sol\";\r\nimport \"./interfaces/solidly/IBribe.sol\";\r\nimport \"./interfaces/solidly/IGauge.sol\";\r\nimport \"./interfaces/solidly/IBaseV1Voter.sol\";\r\n\r\nimport \"./interfaces/IDepositToken.sol\";\r\nimport \"./interfaces/IMultiRewarder.sol\";\r\n\r\nimport \"@openzeppelin/contracts-upgradeable/security/PausableUpgradeable.sol\";\r\nimport \"@openzeppelin/contracts-upgradeable/security/ReentrancyGuardUpgradeable.sol\";\r\nimport \"@openzeppelin/contracts-upgradeable/access/AccessControlEnumerableUpgradeable.sol\";\r\nimport \"@openzeppelin/contracts-upgradeable/proxy/utils/Initializable.sol\";\r\nimport \"@openzeppelin/contracts-upgradeable/token/ERC20/IERC20Upgradeable.sol\";\r\nimport \"@openzeppelin/contracts-upgradeable/token/ERC20/utils/SafeERC20Upgradeable.sol\";\r\n\r\ncontract NFTHolder is\r\n Initializable,\r\n AccessControlEnumerableUpgradeable,\r\n PausableUpgradeable,\r\n ReentrancyGuardUpgradeable\r\n{\r\n using SafeERC20Upgradeable for IERC20Upgradeable;\r\n\r\n /* ========== STATE VARIABLES ========== /\r\n\r\n bytes32 public constant PAUSER_ROLE = keccak256(\"PAUSER_ROLE\");\r\n bytes32 public constant UNPAUSER_ROLE = keccak256(\"UNPAUSER_ROLE\");\r\n bytes32 public constant SETTER_ROLE = keccak256(\"SETTER_ROLE\");\r\n bytes32 public constant OPERATOR_ROLE = keccak256(\"OPERATOR_ROLE\");\r\n\r\n // solidly contracts\r\n IVotingEscrow public votingEscrow;\r\n IBaseV1Voter public solidlyVoter;\r\n\r\n // monlith contracts\r\n address public moSolid;\r\n\r\n uint256 public tokenID;\r\n\r\n mapping(address => bool) public isRewardToken;\r\n\r\n address public depositTokenImplementation;\r\n IMultiRewarder public multiRewarder;\r\n\r\n // pool -> gauge\r\n mapping(address => address) public gaugeForPool;\r\n // pool -> monolith deposit token\r\n mapping(address => address) public tokenForPool;\r\n // user -> pool -> deposit amount\r\n mapping(address => mapping(address => uint256)) public userBalances;\r\n // pool -> total deposit amount\r\n mapping(address => uint256) public totalBalances;\r\n\r\n // reward variables\r\n uint256 public callerFee; // e.g. 5e15 for 0.5%\r\n uint256 public platformFee; // e.g. 1e17 for 10%\r\n address public platformFeeReceiver;\r\n\r\n event Deposited(address indexed user, address indexed pool, uint256 amount);\r\n event Withdrawn(address indexed user, address indexed pool, uint256 amount);\r\n event TransferDeposit(\r\n address indexed pool,\r\n address indexed from,\r\n address indexed to,\r\n uint256 amount\r\n );\r\n\r\n / ========== CONSTRUCTOR ========== /\r\n\r\n function initialize(\r\n IVotingEscrow _votingEscrow,\r\n IBaseV1Voter _solidlyVoter,\r\n address admin,\r\n address pauser,\r\n address setter,\r\n address operator\r\n ) public initializer {\r\n __Pausable_init();\r\n __ReentrancyGuard_init();\r\n __AccessControlEnumerable_init();\r\n\r\n votingEscrow = _votingEscrow;\r\n solidlyVoter = _solidlyVoter;\r\n\r\n _grantRole(DEFAULT_ADMIN_ROLE, admin);\r\n _grantRole(UNPAUSER_ROLE, admin);\r\n _grantRole(PAUSER_ROLE, pauser);\r\n _grantRole(SETTER_ROLE, setter);\r\n _grantRole(OPERATOR_ROLE, operator);\r\n }\r\n\r\n / ========== MUTATIVE FUNCTIONS ========== /\r\n\r\n function onERC721Received(\r\n address _operator,\r\n address _from,\r\n uint256 _tokenID,\r\n bytes calldata\r\n ) external whenNotPaused returns (bytes4) {\r\n // VeDepositor transfers the NFT to this contract so this callback is required\r\n require(_operator == moSolid);\r\n\r\n // make sure only voting escrow can call this method\r\n require(msg.sender == address(votingEscrow));\r\n\r\n if (tokenID == 0) {\r\n tokenID = _tokenID;\r\n }\r\n\r\n return\r\n bytes4(\r\n keccak256(\"onERC721Received(address,address,uint256,bytes)\")\r\n );\r\n }\r\n\r\n /\r\n @notice Deposit Solidly LP tokens into a gauge via this contract\r\n * @dev Each deposit is also represented via a new ERC20, the address\r\n * is available by querying `tokenForPool(pool)`\r\n * @param pool Address of the pool token to deposit\r\n * @param amount Quantity of tokens to deposit\r\n /\r\n function deposit(address pool, uint256 amount)\r\n external\r\n whenNotPaused\r\n nonReentrant\r\n {\r\n require(tokenID != 0, \"Must lock SOLID first\");\r\n require(amount > 0, \"Cannot deposit zero\");\r\n\r\n address gauge = gaugeForPool[pool];\r\n\r\n if (gauge == address(0)) {\r\n gauge = solidlyVoter.gauges(pool);\r\n if (gauge == address(0)) {\r\n gauge = solidlyVoter.createGauge(pool);\r\n }\r\n gaugeForPool[pool] = gauge;\r\n tokenForPool[pool] = _deployDepositToken(pool);\r\n IERC20Upgradeable(pool).approve(gauge, type(uint256).max);\r\n }\r\n\r\n IERC20Upgradeable(pool).safeTransferFrom(\r\n msg.sender,\r\n address(this),\r\n amount\r\n );\r\n IGauge(gauge).deposit(amount, tokenID);\r\n\r\n userBalances[msg.sender][pool] += amount;\r\n totalBalances[pool] += amount;\r\n IDepositToken(tokenForPool[pool]).mint(msg.sender, amount);\r\n\r\n multiRewarder.stakeFor(pool, msg.sender, amount);\r\n\r\n emit Deposited(msg.sender, pool, amount);\r\n }\r\n\r\n /\r\n @notice Withdraw Solidly LP tokens\r\n * @param pool Address of the pool token to withdraw\r\n * @param amount Quantity of tokens to withdraw\r\n /\r\n function withdraw(address pool, uint256 amount)\r\n external\r\n whenNotPaused\r\n nonReentrant\r\n {\r\n address gauge = gaugeForPool[pool];\r\n\r\n require(gauge != address(0), \"Unknown pool\");\r\n require(amount > 0, \"Cannot withdraw zero\");\r\n require(\r\n userBalances[msg.sender][pool] >= amount,\r\n \"Insufficient deposit\"\r\n );\r\n\r\n userBalances[msg.sender][pool] -= amount;\r\n totalBalances[pool] -= amount;\r\n\r\n IDepositToken(tokenForPool[pool]).burn(msg.sender, amount);\r\n IGauge(gauge).withdraw(amount);\r\n IERC20Upgradeable(pool).safeTransfer(msg.sender, amount);\r\n\r\n multiRewarder.withdrawFrom(pool, msg.sender, amount);\r\n\r\n emit Withdrawn(msg.sender, pool, amount);\r\n }\r\n\r\n /// @notice Claims rewards from pool's gauge and deposit into multi rewarder after cutting platform share\r\n function getReward(\r\n address pool,\r\n address[] memory tokens,\r\n address bountyReceiver\r\n ) external whenNotPaused nonReentrant {\r\n IGauge(gaugeForPool[pool]).getReward(address(this), tokens);\r\n\r\n uint256[] memory rewards = new uint256[](tokens.length);\r\n uint256 reward;\r\n uint256 callerCut;\r\n uint256 platformCut;\r\n for (uint8 i = 0; i < tokens.length; i++) {\r\n require(isRewardToken[tokens[i]], \"Not reward token\");\r\n\r\n reward = IERC20Upgradeable(tokens[i]).balanceOf(address(this));\r\n\r\n if (reward > 0) {\r\n callerCut = (reward callerFee) / 1e18;\r\n reward -= callerCut;\r\n\r\n platformCut = (reward * platformFee) / 1e18;\r\n rewards[i] = reward - platformCut;\r\n\r\n IERC20Upgradeable(tokens[i]).safeTransfer(\r\n bountyReceiver,\r\n callerCut\r\n );\r\n\r\n IERC20Upgradeable(tokens[i]).safeTransfer(\r\n platformFeeReceiver,\r\n platformCut\r\n );\r\n\r\n if (\r\n IERC20Upgradeable(tokens[i]).allowance(\r\n address(this),\r\n address(multiRewarder)\r\n ) < rewards[i]\r\n ) {\r\n IERC20Upgradeable(tokens[i]).approve(\r\n address(multiRewarder),\r\n type(uint256).max\r\n );\r\n }\r\n }\r\n }\r\n\r\n multiRewarder.notifyRewardAmount(pool, tokens, rewards);\r\n }\r\n\r\n /* ========== RESTRICTED FUNCTIONS ========== /\r\n\r\n function transferDeposit(\r\n address pool,\r\n address from,\r\n address to,\r\n uint256 amount\r\n ) external whenNotPaused returns (bool) {\r\n require(msg.sender == tokenForPool[pool], \"Unauthorized caller\");\r\n require(amount > 0, \"Cannot transfer zero\");\r\n require(userBalances[from][pool] >= amount, \"Insufficient balance\");\r\n\r\n userBalances[from][pool] -= amount;\r\n multiRewarder.withdrawFrom(pool, from, amount);\r\n\r\n userBalances[to][pool] += amount;\r\n multiRewarder.stakeFor(pool, to, amount);\r\n\r\n emit TransferDeposit(pool, from, to, amount);\r\n\r\n return true;\r\n }\r\n\r\n function setAddresses(\r\n address _moSolid,\r\n address _depositTokenImplementation,\r\n address _multiRewarder,\r\n address _platformFeeReceiver\r\n ) external onlyRole(SETTER_ROLE) {\r\n if (_moSolid != address(0)) {\r\n moSolid = _moSolid;\r\n votingEscrow.setApprovalForAll(_moSolid, true); // for merge\r\n }\r\n\r\n if (_depositTokenImplementation != address(0)) {\r\n depositTokenImplementation = _depositTokenImplementation;\r\n }\r\n\r\n if (_multiRewarder != address(0)) {\r\n multiRewarder = IMultiRewarder(_multiRewarder);\r\n }\r\n\r\n if (_platformFeeReceiver != address(0)) {\r\n platformFeeReceiver = _platformFeeReceiver;\r\n }\r\n }\r\n\r\n function setRewardsFees(uint256 _callerFee, uint256 _platformFee)\r\n external\r\n onlyRole(SETTER_ROLE)\r\n {\r\n callerFee = _callerFee;\r\n platformFee = _platformFee;\r\n }\r\n\r\n function setRewardTokens(address[] memory rewardTokens, bool status)\r\n external\r\n onlyRole(SETTER_ROLE)\r\n {\r\n for (uint8 i = 0; i < rewardTokens.length; i++) {\r\n isRewardToken[rewardTokens[i]] = status;\r\n }\r\n }\r\n\r\n function vote(address[] memory pools, int256[] memory weights)\r\n external\r\n onlyRole(OPERATOR_ROLE)\r\n {\r\n solidlyVoter.vote(tokenID, pools, weights);\r\n }\r\n\r\n function withdrawERC20(\r\n address token,\r\n address to,\r\n uint256 amount\r\n ) external onlyRole(OPERATOR_ROLE) {\r\n IERC20Upgradeable(token).safeTransfer(to, amount);\r\n }\r\n\r\n function withdrawNFT(address to) external onlyRole(DEFAULT_ADMIN_ROLE) {\r\n votingEscrow.safeTransferFrom(address(this), to, tokenID);\r\n }\r\n\r\n function pause() external onlyRole(PAUSER_ROLE) {\r\n _pause();\r\n }\r\n\r\n function unpause() external onlyRole(UNPAUSER_ROLE) {\r\n _unpause();\r\n }\r\n\r\n / ========== INTERNAL FUNCTIONS ========== */\r\n function _deployDepositToken(address pool)\r\n internal\r\n returns (address token)\r\n {\r\n // taken from https://solidity-by-example.org/app/minimal-proxy/\r\n bytes20 targetBytes = bytes20(depositTokenImplementation);\r\n assembly {\r\n let clone := mload(0x40)\r\n mstore(\r\n clone,\r\n 0x3d602d80600a3d3981f3363d3d373d3d3d363d73000000000000000000000000\r\n )\r\n mstore(add(clone, 0x14), targetBytes)\r\n mstore(\r\n add(clone, 0x28),\r\n 0x5af43d82803e903d91602b57fd5bf30000000000000000000000000000000000\r\n )\r\n token := create(0, clone, 0x37)\r\n }\r\n IDepositToken(token).initialize(pool);\r\n return token;\r\n }\r\n}\r\n"
	}
	},
	"settings": {
	"metadata": {
	"bytecodeHash": "none"
	},
	"optimizer": {
	"enabled": true,
	"runs": 200
	},
	"outputSelection": {
	"*": {
	"*": [
	"evm.bytecode",
	"evm.deployedBytecode",
	"devdoc",
	"userdoc",
	"metadata",
	"abi"
	]
	}
	},
	"libraries": {}
	}
	}