File size: 68,782 Bytes
f998fcd |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 |
{
"language": "Solidity",
"sources": {
"contracts/DogShi.sol": {
"content": "// SPDX-License-Identifier: UNLICENSED\r\npragma solidity 0.8.19;\r\n\r\nimport \"@openzeppelin/contracts/access/Ownable.sol\";\r\nimport \"@openzeppelin/contracts/token/ERC20/IERC20.sol\";\r\nimport \"@openzeppelin/contracts/utils/Context.sol\";\r\nimport \"@openzeppelin/contracts/utils/Address.sol\";\r\nimport \"@openzeppelin/contracts/utils/Arrays.sol\";\r\nimport \"@openzeppelin/contracts/utils/Counters.sol\";\r\n\r\ncontract ReflectionToken is IERC20, Context, Ownable {\r\n using Address for address;\r\n using Arrays for uint256[];\r\n using Counters for Counters.Counter;\r\n\r\n // Snapshotted values have arrays of ids and the value corresponding to that id. These could be an array of a\r\n // Snapshot struct, but that would impede usage of functions that work on an array.\r\n struct Snapshots {\r\n uint256[] ids;\r\n uint256[] values;\r\n }\r\n\r\n mapping(address => Snapshots) private _accountBalanceSnapshots;\r\n Snapshots private _totalSupplySnapshots;\r\n\r\n // Snapshot ids increase monotonically, with the first value being 1. An id of 0 is invalid.\r\n Counters.Counter private _currentSnapshotId;\r\n\r\n /**\r\n * @dev Emitted by {_snapshot} when a snapshot identified by `id` is created.\r\n */\r\n event Snapshot(uint256 id);\r\n\r\n mapping(address => uint256) private _userShares;\r\n mapping(address => mapping(address => uint256)) private _allowances;\r\n\r\n uint256 private _totalSupply;\r\n uint256 private _totalShare;\r\n uint256 private NAV;\r\n uint256 private LastRewardBlock;\r\n string private _name;\r\n string private _symbol;\r\n uint8 private _decimals = 18;\r\n \r\n mapping(address => uint256) private _lastRewards;\r\n mapping (address => bool) private _isExcluded; // Accounts to not receive rewards\r\n address[] private _excluded; // Accounts which do not receive rewards\r\n mapping(address => uint256) private _excludedBalance;\r\n\r\n uint256 internal constant maxSupply = 21 * 10 ** 24;\r\n uint256 internal constant liquiditySupply = maxSupply * 10 / 100;\r\n uint256 internal constant ryoshiSupply = maxSupply * 50 / 100;\r\n uint256 internal constant contractSupply = maxSupply - liquiditySupply - ryoshiSupply;\r\n uint256[] public halvingBlock = [19686542,30109852,40533162]; //mainnet\r\n\r\n uint256 startBlock;\r\n\r\n uint256 holderRewardPerBlock;\r\n uint256 liquidityRewardPerBlock;\r\n uint256 totalRewardForHolder;\r\n\r\n bool isActivated;\r\n uint256 activateTime;\r\n uint256 totalRewardByDAO;\r\n uint256 lastRewardBlockByVoting;\r\n\r\n address liquidityAddress;\r\n mapping(address => uint256) private _liquidityBlock;\r\n uint256 liquidityLastRewardBlock;\r\n uint256 liquidityAccTokensPerShare;\r\n mapping( address=> uint256) private rewardDebts;\r\n address previousLiquidityAdder;\r\n address votingContract;\r\n uint256 totalDistributedRewardByVoting;\r\n\r\n constructor(\r\n string memory tname,\r\n string memory tsymbol\r\n ) {\r\n _name = tname;\r\n _symbol = tsymbol;\r\n _mint(0xB8f226dDb7bC672E27dffB67e4adAbFa8c0dFA08, ryoshiSupply);\r\n _mint( address(this), contractSupply);\r\n _mint( _msgSender(), liquiditySupply);\r\n\r\n setExclude(address(this)); //no rewards for deployer\r\n setExclude(0xdEAD000000000000000042069420694206942069); //no rewards to dead wallet\r\n setExclude(0xB8f226dDb7bC672E27dffB67e4adAbFa8c0dFA08); //no additional rewards to Ryoshi\r\n\r\n totalRewardForHolder = contractSupply * 20 / 100;\r\n totalRewardByDAO = totalRewardForHolder;\r\n\r\n isActivated = false;\r\n activateTime = 0;\r\n }\r\n\r\n /**\r\n * @dev Creates a new snapshot and returns its snapshot id.\r\n *\r\n * Emits a {Snapshot} event that contains the same id.\r\n *\r\n * {_snapshot} is `internal` and you have to decide how to expose it externally. Its usage may be restricted to a\r\n * set of accounts, for example using {AccessControl}, or it may be open to the public.\r\n *\r\n * [WARNING]\r\n * ====\r\n * While an open way of calling {_snapshot} is required for certain trust minimization mechanisms such as forking,\r\n * you must consider that it can potentially be used by attackers in two ways.\r\n *\r\n * First, it can be used to increase the cost of retrieval of values from snapshots, although it will grow\r\n * logarithmically thus rendering this attack ineffective in the long term. Second, it can be used to target\r\n * specific accounts and increase the cost of ERC20 transfers for them, in the ways specified in the Gas Costs\r\n * section above.\r\n *\r\n * We haven't measured the actual numbers; if this is something you're interested in please reach out to us.\r\n * ====\r\n */\r\n function _snapshot() internal virtual returns (uint256) {\r\n _currentSnapshotId.increment();\r\n\r\n uint256 currentId = _getCurrentSnapshotId();\r\n emit Snapshot(currentId);\r\n return currentId;\r\n }\r\n\r\n /**\r\n * @dev Get the current snapshotId\r\n */\r\n function _getCurrentSnapshotId() internal view virtual returns (uint256) {\r\n return _currentSnapshotId.current();\r\n }\r\n\r\n function getCurrentSnapshotId() external view virtual returns (uint256) {\r\n return _getCurrentSnapshotId();\r\n }\r\n\r\n function snapshot() external returns (uint256) {\r\n require(_msgSender() == votingContract);\r\n return _snapshot();\r\n }\r\n\r\n /**\r\n * @dev Retrieves the balance of `account` at the time `snapshotId` was created.\r\n */\r\n function balanceOfAt(address account, uint256 snapshotId) public view virtual returns (uint256) {\r\n (bool snapshotted, uint256 value) = _valueAt(snapshotId, _accountBalanceSnapshots[account]);\r\n\r\n return snapshotted ? value : balanceOf(account);\r\n }\r\n\r\n /**\r\n * @dev Retrieves the total supply at the time `snapshotId` was created.\r\n */\r\n function totalSupplyAt(uint256 snapshotId) public view virtual returns (uint256) {\r\n (bool snapshotted, uint256 value) = _valueAt(snapshotId, _totalSupplySnapshots);\r\n\r\n return snapshotted ? value : totalSupply();\r\n }\r\n\r\n // Update balance and/or total supply snapshots before the values are modified. This is implemented\r\n // in the _beforeTokenTransfer hook, which is executed for _mint, _burn, and _transfer operations.\r\n function _beforeTokenTransfer(address from, address to, uint256 amount) internal virtual {\r\n if (from == address(0)) {\r\n // mint\r\n _updateAccountSnapshot(to);\r\n _updateTotalSupplySnapshot();\r\n } else if (to == address(0)) {\r\n // burn\r\n _updateAccountSnapshot(from);\r\n _updateTotalSupplySnapshot();\r\n } else {\r\n // transfer\r\n _updateAccountSnapshot(from);\r\n _updateAccountSnapshot(to);\r\n }\r\n }\r\n\r\n function _valueAt(uint256 snapshotId, Snapshots storage snapshots) private view returns (bool, uint256) {\r\n require(snapshotId > 0, \"ERC20Snapshot: id is 0\");\r\n require(snapshotId <= _getCurrentSnapshotId(), \"ERC20Snapshot: nonexistent id\");\r\n\r\n // When a valid snapshot is queried, there are three possibilities:\r\n // a) The queried value was not modified after the snapshot was taken. Therefore, a snapshot entry was never\r\n // created for this id, and all stored snapshot ids are smaller than the requested one. The value that corresponds\r\n // to this id is the current one.\r\n // b) The queried value was modified after the snapshot was taken. Therefore, there will be an entry with the\r\n // requested id, and its value is the one to return.\r\n // c) More snapshots were created after the requested one, and the queried value was later modified. There will be\r\n // no entry for the requested id: the value that corresponds to it is that of the smallest snapshot id that is\r\n // larger than the requested one.\r\n //\r\n // In summary, we need to find an element in an array, returning the index of the smallest value that is larger if\r\n // it is not found, unless said value doesn't exist (e.g. when all values are smaller). Arrays.findUpperBound does\r\n // exactly this.\r\n\r\n uint256 index = snapshots.ids.findUpperBound(snapshotId);\r\n\r\n if (index == snapshots.ids.length) {\r\n return (false, 0);\r\n } else {\r\n return (true, snapshots.values[index]);\r\n }\r\n }\r\n\r\n function _updateAccountSnapshot(address account) private {\r\n _updateSnapshot(_accountBalanceSnapshots[account], balanceOf(account));\r\n }\r\n\r\n function _updateTotalSupplySnapshot() private {\r\n _updateSnapshot(_totalSupplySnapshots, totalSupply());\r\n }\r\n\r\n function _updateSnapshot(Snapshots storage snapshots, uint256 currentValue) private {\r\n uint256 currentId = _getCurrentSnapshotId();\r\n if (_lastSnapshotId(snapshots.ids) < currentId) {\r\n snapshots.ids.push(currentId);\r\n snapshots.values.push(currentValue);\r\n }\r\n }\r\n\r\n function _lastSnapshotId(uint256[] storage ids) private view returns (uint256) {\r\n if (ids.length == 0) {\r\n return 0;\r\n } else {\r\n return ids[ids.length - 1];\r\n }\r\n }\r\n \r\n function getRewardPerBlock( uint256 currentBlock, uint256 totalReward) internal view returns(uint256){\r\n uint256 rewardPerBlock = 0;\r\n uint256 totalBlock = 0;\r\n uint256 halving = 1;\r\n if( isActivated == false) return 0;\r\n for( uint i = 0; i < halvingBlock.length;i++) {\r\n if( currentBlock < halvingBlock[i]) {\r\n totalBlock += ((halvingBlock[i] - currentBlock)/halving);\r\n }\r\n halving *= 2;\r\n }\r\n if( totalBlock == 0 ) return 0;\r\n rewardPerBlock = totalReward / totalBlock;\r\n return rewardPerBlock;\r\n }\r\n\r\n function setExclude(address user) public onlyOwner {\r\n require(_isExcluded[user]==false,\"already excluded!\");\r\n _excludedBalance[user] = balanceOf(user);\r\n _excluded.push(user);\r\n _isExcluded[user] = true;\r\n NAV -= _excludedBalance[user];\r\n _totalShare -= _userShares[user];\r\n _userShares[user] = 0;\r\n }\r\n\r\n function setLiquidityAddress(address liquidity) public onlyOwner {\r\n liquidityAddress = liquidity;\r\n }\r\n\r\n function setVotingContractAddress(address _votingContract) public onlyOwner {\r\n votingContract = _votingContract;\r\n }\r\n\r\n function activateHolderReward() public onlyOwner {\r\n startBlock = block.number;\r\n isActivated = true;\r\n holderRewardPerBlock = getRewardPerBlock(startBlock,totalRewardForHolder);\r\n liquidityRewardPerBlock = holderRewardPerBlock * 3;\r\n activateTime = block.number;\r\n }\r\n\r\n /**\r\n * @dev Returns the name of the token.\r\n */\r\n function name() public view returns (string memory) {\r\n return _name;\r\n }\r\n\r\n /**\r\n * @dev Returns the symbol of the token, usually a shorter version of the\r\n * name.\r\n */\r\n function symbol() public view returns (string memory) {\r\n return _symbol;\r\n }\r\n /**\r\n * @dev Returns the number of decimals used to get its user representation.\r\n * For example, if `decimals` equals `2`, a balance of `505` tokens should\r\n * be displayed to a user as `5.05` (`505 / 10 ** 2`).\r\n *\r\n * Tokens usually opt for a value of 18, imitating the relationship between\r\n * Ether and Wei. This is the value {ERC20} uses, unless this function is\r\n * overridden;\r\n *\r\n * NOTE: This information is only used for _display_ purposes: it in\r\n * no way affects any of the arithmetic of the contract, including\r\n * {IERC20-balanceOf} and {IERC20-transfer}.\r\n */\r\n function decimals() public view returns (uint8) {\r\n return _decimals;\r\n }\r\n /**\r\n * @dev See {IERC20-totalSupply}.\r\n */\r\n function totalSupply() public view virtual override returns (uint256) {\r\n return _totalSupply;\r\n }\r\n\r\n\r\n /**\r\n * @dev See {IERC20-balanceOf}.\r\n */\r\n function balanceOf(address account) public view virtual override returns (uint256) {\r\n if(_isExcluded[account]) {\r\n if( account == address(this)) {\r\n return _excludedBalance[account] - totalUsedAmount();\r\n }\r\n return _excludedBalance[account];\r\n }\r\n uint256 balance = getRewardOfLiquidityUser(account);\r\n if( _totalShare == 0 ) return balance;\r\n uint curNAV = NAV;\r\n if( block.number > LastRewardBlock) {\r\n curNAV += getTokensReward();\r\n }\r\n balance += (curNAV * _userShares[account] / _totalShare);\r\n return balance;\r\n }\r\n\r\n /**\r\n * @dev See {IERC20-transfer}.\r\n *\r\n * Requirements:\r\n *\r\n * - `to` cannot be the zero address.\r\n * - the caller must have a balance of at least `amount`.\r\n */\r\n function transfer(address to, uint256 amount) public virtual override returns (bool) {\r\n address owner = _msgSender();\r\n _transfer(owner, to, amount);\r\n return true;\r\n }\r\n\r\n /**\r\n * @dev See {IERC20-allowance}.\r\n */\r\n function allowance(address owner, address spender) public view virtual override returns (uint256) {\r\n return _allowances[owner][spender];\r\n }\r\n\r\n /**\r\n * @dev See {IERC20-approve}.\r\n *\r\n * NOTE: If `amount` is the maximum `uint256`, the allowance is not updated on\r\n * `transferFrom`. This is semantically equivalent to an infinite approval.\r\n *\r\n * Requirements:\r\n *\r\n * - `spender` cannot be the zero address.\r\n */\r\n function approve(address spender, uint256 amount) public virtual override returns (bool) {\r\n address owner = _msgSender();\r\n _approve(owner, spender, amount);\r\n return true;\r\n }\r\n\r\n /**\r\n * @dev See {IERC20-transferFrom}.\r\n *\r\n * Emits an {Approval} event indicating the updated allowance. This is not\r\n * required by the EIP. See the note at the beginning of {ERC20}.\r\n *\r\n * NOTE: Does not update the allowance if the current allowance\r\n * is the maximum `uint256`.\r\n *\r\n * Requirements:\r\n *\r\n * - `from` and `to` cannot be the zero address.\r\n * - `from` must have a balance of at least `amount`.\r\n * - the caller must have allowance for ``from``'s tokens of at least\r\n * `amount`.\r\n */\r\n function transferFrom(\r\n address from,\r\n address to,\r\n uint256 amount\r\n ) public virtual override returns (bool) {\r\n address spender = _msgSender();\r\n _spendAllowance(from, spender, amount);\r\n _transfer(from, to, amount);\r\n return true;\r\n }\r\n\r\n /**\r\n * @dev Atomically increases the allowance granted to `spender` by the caller.\r\n *\r\n * This is an alternative to {approve} that can be used as a mitigation for\r\n * problems described in {IERC20-approve}.\r\n *\r\n * Emits an {Approval} event indicating the updated allowance.\r\n *\r\n * Requirements:\r\n *\r\n * - `spender` cannot be the zero address.\r\n */\r\n function increaseAllowance(address spender, uint256 addedValue) public virtual returns (bool) {\r\n address owner = _msgSender();\r\n _approve(owner, spender, allowance(owner, spender) + addedValue);\r\n return true;\r\n }\r\n\r\n /**\r\n * @dev Atomically decreases the allowance granted to `spender` by the caller.\r\n *\r\n * This is an alternative to {approve} that can be used as a mitigation for\r\n * problems described in {IERC20-approve}.\r\n *\r\n * Emits an {Approval} event indicating the updated allowance.\r\n *\r\n * Requirements:\r\n *\r\n * - `spender` cannot be the zero address.\r\n * - `spender` must have allowance for the caller of at least\r\n * `subtractedValue`.\r\n */\r\n function decreaseAllowance(address spender, uint256 subtractedValue) public virtual returns (bool) {\r\n address owner = _msgSender();\r\n uint256 currentAllowance = allowance(owner, spender);\r\n require(currentAllowance >= subtractedValue, \"ERC20: decreased allowance below zero\");\r\n unchecked {\r\n _approve(owner, spender, currentAllowance - subtractedValue);\r\n }\r\n\r\n return true;\r\n }\r\n\r\n function addingDecimal() public view returns (uint256) {\r\n return 10**_decimals;\r\n }\r\n\r\n /**\r\n * @dev Moves `amount` of tokens from `sender` to `recipient`.\r\n *\r\n * This internal function is equivalent to {transfer}, and can be used to\r\n * e.g. implement automatic token fees, slashing mechanisms, etc.\r\n *\r\n * Emits a {Transfer} event.\r\n *\r\n * Requirements:\r\n *\r\n * - `from` cannot be the zero address.\r\n * - `to` cannot be the zero address.\r\n * - `from` must have a balance of at least `amount`.\r\n */\r\n function _transfer(\r\n address from,\r\n address to,\r\n uint256 amount\r\n ) internal virtual {\r\n require(from != address(0), \"ERC20: transfer from the zero address\");\r\n require(to != address(0), \"ERC20: transfer to the zero address\");\r\n\r\n _beforeTokenTransfer(from, to, amount);\r\n \r\n if( _isExcluded[from] && !_isExcluded[to] ) {\r\n _transferFromExcluded(from, to, amount);\r\n } else if( !_isExcluded[from] && _isExcluded[to]) {\r\n _transferToExcluded(from, to, amount);\r\n } else if( !_isExcluded[from] && !_isExcluded[to]) {\r\n _transferStandard(from, to, amount);\r\n } else if(_isExcluded[from] && _isExcluded[to]) {\r\n _transferBothExcluded(from, to, amount);\r\n } else {\r\n _transferStandard(from, to, amount);\r\n }\r\n\r\n emit Transfer(from, to, amount);\r\n\r\n _afterTokenTransfer(from, to, amount);\r\n }\r\n\r\n function distributeRewardByVoting(address _receiver, uint256 _amount) public {\r\n require(_msgSender() == votingContract,\"only voting contract can call this function\");\r\n uint256 amount = getPendingRewardByVoting();\r\n require(_amount > 0 && _amount <= amount, \"Can't distribute this amount\");\r\n _transfer( address(this), _receiver, _amount);\r\n totalDistributedRewardByVoting += _amount;\r\n lastRewardBlockByVoting = block.number;\r\n }\r\n\r\n function getPendingRewardByVoting() public view returns(uint256) {\r\n return getRewardAmount(holderRewardPerBlock, startBlock,block.number) - totalDistributedRewardByVoting;\r\n }\r\n\r\n function totalUsedAmount() internal view returns(uint256) {\r\n uint rewardPerBlock = getRewardPerBlock(startBlock, totalRewardForHolder * 4);\r\n uint totalUsed = getRewardAmount(rewardPerBlock, startBlock, block.number);\r\n return totalUsed;\r\n }\r\n\r\n function totalDistributedReward() public view returns(uint256) {\r\n uint totalUsed = totalUsedAmount();\r\n totalUsed += totalDistributedRewardByVoting;\r\n return totalUsed;\r\n }\r\n\r\n function getRewardAmount(uint rewardPerBlock, uint firstBlock, uint lastBlock) internal view returns(uint) {\r\n uint i = 0;\r\n if( firstBlock < startBlock) firstBlock = startBlock;\r\n if( lastBlock <= firstBlock) return 0;\r\n if( rewardPerBlock == 0) return 0;\r\n \r\n for( i = 0; i < halvingBlock.length; i++ ) {\r\n if( firstBlock < halvingBlock[i]) break;\r\n rewardPerBlock /= 2;\r\n }\r\n if(i == halvingBlock.length) {\r\n return 0;\r\n }\r\n uint256 totalReward = 0;\r\n for( uint j = i; j < halvingBlock.length; j++) {\r\n if( lastBlock < halvingBlock[j]) {\r\n totalReward += rewardPerBlock*(lastBlock-firstBlock);\r\n break;\r\n }\r\n totalReward += rewardPerBlock*(halvingBlock[j]-firstBlock);\r\n firstBlock = halvingBlock[j];\r\n rewardPerBlock /= 2;\r\n }\r\n return totalReward; \r\n }\r\n\r\n function getTokensReward() public view returns(uint256) {\r\n return getRewardAmount(holderRewardPerBlock, LastRewardBlock, block.number);\r\n }\r\n\r\n function getRewardOfLiquidityUser(address user) public view returns(uint256) {\r\n uint256 accTokensPerShare = liquidityAccTokensPerShare;\r\n if(liquidityAddress == address(0)) return 0;\r\n uint256 lpSupply = IERC20(liquidityAddress).totalSupply();\r\n uint256 lpBalance = IERC20(liquidityAddress).balanceOf(user);\r\n uint256 curBlock = block.number;\r\n uint256 finalBlock = halvingBlock[halvingBlock.length-1];\r\n if( curBlock > finalBlock) curBlock = finalBlock;\r\n if (curBlock > liquidityLastRewardBlock && lpSupply != 0) {\r\n uint256 tokensReward = getLiquidityTokensReward();\r\n accTokensPerShare += (tokensReward * addingDecimal() / lpSupply);\r\n }\r\n uint256 rewardDebt = rewardDebts[user];\r\n if( user == previousLiquidityAdder)\r\n rewardDebt = lpBalance * liquidityAccTokensPerShare / addingDecimal();\r\n return lpBalance * accTokensPerShare / addingDecimal() - rewardDebt;\r\n }\r\n\r\n function getLiquidityTokensReward() public view returns(uint256) {\r\n return getRewardAmount(liquidityRewardPerBlock, liquidityLastRewardBlock, block.number);\r\n }\r\n\r\n function _transferStandard(address from, address to, uint256 amount) private {\r\n NAV += getTokensReward();\r\n uint valuePerShare = NAV * addingDecimal() / _totalShare;\r\n uint shareAmount = amount * addingDecimal() / valuePerShare;\r\n _userShares[from] -= shareAmount;\r\n _userShares[to] += shareAmount;\r\n LastRewardBlock = block.number;\r\n }\r\n\r\n function _transferFromExcluded(address from, address to, uint256 amount) private {\r\n NAV += getTokensReward();\r\n uint valuePerShare = NAV * addingDecimal() / _totalShare;\r\n uint shareAmount = amount * addingDecimal() / valuePerShare;\r\n NAV += amount;\r\n _excludedBalance[from] -= amount;\r\n _userShares[to] += shareAmount;\r\n _totalShare += shareAmount;\r\n LastRewardBlock = block.number;\r\n if( from == liquidityAddress) {\r\n uint256 liquidityTotalSupply = IERC20(liquidityAddress).totalSupply();\r\n if( liquidityLastRewardBlock == 0) {\r\n previousLiquidityAdder = to;\r\n liquidityLastRewardBlock = block.number;\r\n } else if( block.number > liquidityLastRewardBlock){\r\n uint256 previousBalance = IERC20(liquidityAddress).balanceOf(previousLiquidityAdder);\r\n rewardDebts[previousLiquidityAdder] = previousBalance * liquidityAccTokensPerShare;\r\n liquidityAccTokensPerShare += getLiquidityTokensReward() / liquidityTotalSupply;\r\n uint256 toUNIBalance = IERC20(liquidityAddress).balanceOf(to);\r\n uint256 toPendingBalance = liquidityAccTokensPerShare * toUNIBalance / addingDecimal() - rewardDebts[to];\r\n if( toPendingBalance > 0) {\r\n _userShares[to] += (toPendingBalance * addingDecimal() / valuePerShare);\r\n }\r\n liquidityLastRewardBlock = block.number;\r\n previousLiquidityAdder = to;\r\n }\r\n }\r\n }\r\n\r\n function _transferToExcluded(address from, address to, uint256 amount) private {\r\n NAV += getTokensReward();\r\n uint valuePerShare = NAV * addingDecimal() / _totalShare;\r\n uint shareAmount = amount * addingDecimal() / valuePerShare;\r\n NAV -= amount;\r\n _userShares[from] -= shareAmount;\r\n _excludedBalance[to] += amount;\r\n _totalShare -= shareAmount;\r\n LastRewardBlock = block.number;\r\n if( to == liquidityAddress) {\r\n uint256 liquidityTotalSupply = IERC20(liquidityAddress).totalSupply();\r\n if( liquidityLastRewardBlock == 0) {\r\n previousLiquidityAdder = from;\r\n liquidityLastRewardBlock = block.number;\r\n } else if( block.number > liquidityLastRewardBlock){\r\n uint256 previousBalance = IERC20(liquidityAddress).balanceOf(previousLiquidityAdder);\r\n rewardDebts[previousLiquidityAdder] = previousBalance * liquidityAccTokensPerShare;\r\n liquidityAccTokensPerShare += getLiquidityTokensReward() / liquidityTotalSupply;\r\n uint256 fromUNIBalance = IERC20(liquidityAddress).balanceOf(from);\r\n uint256 fromPendingBalance = liquidityAccTokensPerShare * fromUNIBalance / addingDecimal() - rewardDebts[from];\r\n if( fromPendingBalance > 0) {\r\n _userShares[from] += (fromPendingBalance * addingDecimal() / valuePerShare);\r\n }\r\n liquidityLastRewardBlock = block.number;\r\n previousLiquidityAdder = from;\r\n }\r\n }\r\n }\r\n\r\n function _transferBothExcluded(address from, address to, uint256 amount) private {\r\n _excludedBalance[from] -= amount;\r\n _excludedBalance[to] += amount;\r\n }\r\n\r\n /** @dev Creates `amount` tokens and assigns them to `account`, increasing\r\n * the total supply.\r\n *\r\n * Emits a {Transfer} event with `from` set to the zero address.\r\n *\r\n * Requirements:\r\n *\r\n * - `account` cannot be the zero address.\r\n */\r\n function _mint(address account, uint256 amount) internal virtual {\r\n require(account != address(0), \"ERC20: mint to the zero address\");\r\n\r\n _beforeTokenTransfer(address(0), account, amount);\r\n\r\n _totalSupply += amount;\r\n if( _totalShare == 0 ) {\r\n NAV += amount;\r\n _userShares[account] += addingDecimal();\r\n _totalShare += addingDecimal();\r\n } else {\r\n NAV += getTokensReward();\r\n uint valuePerShare = NAV * addingDecimal() / _totalShare;\r\n uint shareAmount = amount * addingDecimal() / valuePerShare;\r\n _userShares[account] += shareAmount;\r\n _totalShare += shareAmount;\r\n NAV += amount;\r\n }\r\n LastRewardBlock = block.number;\r\n \r\n\r\n emit Transfer(address(0), account, amount);\r\n\r\n _afterTokenTransfer(address(0), account, amount);\r\n }\r\n\r\n /**\r\n * @dev Destroys `amount` tokens from `account`, reducing the\r\n * total supply.\r\n *\r\n * Emits a {Transfer} event with `to` set to the zero address.\r\n *\r\n * Requirements:\r\n *\r\n * - `account` cannot be the zero address.\r\n * - `account` must have at least `amount` tokens.\r\n */\r\n function _burn(address account, uint256 amount) internal virtual {\r\n require(account != address(0), \"ERC20: burn from the zero address\");\r\n\r\n _beforeTokenTransfer(account, address(0), amount);\r\n\r\n uint256 accountBalance = balanceOf(account);\r\n require(accountBalance >= amount, \"ERC20: burn amount exceeds balance\");\r\n NAV += getTokensReward();\r\n uint valuePerShare = NAV * addingDecimal() / _totalShare;\r\n uint shareAmount = amount * addingDecimal() / valuePerShare;\r\n _userShares[account] -= shareAmount;\r\n _totalShare -= shareAmount;\r\n NAV -= amount;\r\n LastRewardBlock = block.number;\r\n _totalSupply -= amount;\r\n\r\n emit Transfer(account, address(0), amount);\r\n\r\n _afterTokenTransfer(account, address(0), amount);\r\n }\r\n\r\n /**\r\n * @dev Sets `amount` as the allowance of `spender` over the `owner` s tokens.\r\n *\r\n * This internal function is equivalent to `approve`, and can be used to\r\n * e.g. set automatic allowances for certain subsystems, etc.\r\n *\r\n * Emits an {Approval} event.\r\n *\r\n * Requirements:\r\n *\r\n * - `owner` cannot be the zero address.\r\n * - `spender` cannot be the zero address.\r\n */\r\n function _approve(\r\n address owner,\r\n address spender,\r\n uint256 amount\r\n ) internal virtual {\r\n require(owner != address(0), \"ERC20: approve from the zero address\");\r\n require(spender != address(0), \"ERC20: approve to the zero address\");\r\n\r\n _allowances[owner][spender] = amount;\r\n emit Approval(owner, spender, amount);\r\n }\r\n\r\n /**\r\n * @dev Updates `owner` s allowance for `spender` based on spent `amount`.\r\n *\r\n * Does not update the allowance amount in case of infinite allowance.\r\n * Revert if not enough allowance is available.\r\n *\r\n * Might emit an {Approval} event.\r\n */\r\n function _spendAllowance(\r\n address owner,\r\n address spender,\r\n uint256 amount\r\n ) internal virtual {\r\n uint256 currentAllowance = allowance(owner, spender);\r\n if (currentAllowance != type(uint256).max) {\r\n require(currentAllowance >= amount, \"ERC20: insufficient allowance\");\r\n unchecked {\r\n _approve(owner, spender, currentAllowance - amount);\r\n }\r\n }\r\n }\r\n\r\n /**\r\n * @dev Hook that is called before any transfer of tokens. This includes\r\n * minting and burning.\r\n *\r\n * Calling conditions:\r\n *\r\n * - when `from` and `to` are both non-zero, `amount` of ``from``'s tokens\r\n * has been transferred to `to`.\r\n * - when `from` is zero, `amount` tokens have been minted for `to`.\r\n * - when `to` is zero, `amount` of ``from``'s tokens have been burned.\r\n * - `from` and `to` are never both zero.\r\n *\r\n * To learn more about hooks, head to xref:ROOT:extending-contracts.adoc#using-hooks[Using Hooks].\r\n */\r\n\r\n function _afterTokenTransfer(\r\n address from,\r\n address to,\r\n uint256 amount\r\n ) internal virtual {}\r\n}"
},
"@openzeppelin/contracts/utils/Counters.sol": {
"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts v4.4.1 (utils/Counters.sol)\n\npragma solidity ^0.8.0;\n\n/**\n * @title Counters\n * @author Matt Condon (@shrugs)\n * @dev Provides counters that can only be incremented, decremented or reset. This can be used e.g. to track the number\n * of elements in a mapping, issuing ERC721 ids, or counting request ids.\n *\n * Include with `using Counters for Counters.Counter;`\n */\nlibrary Counters {\n struct Counter {\n // This variable should never be directly accessed by users of the library: interactions must be restricted to\n // the library's function. As of Solidity v0.5.2, this cannot be enforced, though there is a proposal to add\n // this feature: see https://github.com/ethereum/solidity/issues/4637\n uint256 _value; // default: 0\n }\n\n function current(Counter storage counter) internal view returns (uint256) {\n return counter._value;\n }\n\n function increment(Counter storage counter) internal {\n unchecked {\n counter._value += 1;\n }\n }\n\n function decrement(Counter storage counter) internal {\n uint256 value = counter._value;\n require(value > 0, \"Counter: decrement overflow\");\n unchecked {\n counter._value = value - 1;\n }\n }\n\n function reset(Counter storage counter) internal {\n counter._value = 0;\n }\n}\n"
},
"@openzeppelin/contracts/utils/Arrays.sol": {
"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.8.0) (utils/Arrays.sol)\n\npragma solidity ^0.8.0;\n\nimport \"./StorageSlot.sol\";\nimport \"./math/Math.sol\";\n\n/**\n * @dev Collection of functions related to array types.\n */\nlibrary Arrays {\n using StorageSlot for bytes32;\n\n /**\n * @dev Searches a sorted `array` and returns the first index that contains\n * a value greater or equal to `element`. If no such index exists (i.e. all\n * values in the array are strictly less than `element`), the array length is\n * returned. Time complexity O(log n).\n *\n * `array` is expected to be sorted in ascending order, and to contain no\n * repeated elements.\n */\n function findUpperBound(uint256[] storage array, uint256 element) internal view returns (uint256) {\n if (array.length == 0) {\n return 0;\n }\n\n uint256 low = 0;\n uint256 high = array.length;\n\n while (low < high) {\n uint256 mid = Math.average(low, high);\n\n // Note that mid will always be strictly less than high (i.e. it will be a valid array index)\n // because Math.average rounds down (it does integer division with truncation).\n if (unsafeAccess(array, mid).value > element) {\n high = mid;\n } else {\n low = mid + 1;\n }\n }\n\n // At this point `low` is the exclusive upper bound. We will return the inclusive upper bound.\n if (low > 0 && unsafeAccess(array, low - 1).value == element) {\n return low - 1;\n } else {\n return low;\n }\n }\n\n /**\n * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n *\n * WARNING: Only use if you are certain `pos` is lower than the array length.\n */\n function unsafeAccess(address[] storage arr, uint256 pos) internal pure returns (StorageSlot.AddressSlot storage) {\n bytes32 slot;\n /// @solidity memory-safe-assembly\n assembly {\n mstore(0, arr.slot)\n slot := add(keccak256(0, 0x20), pos)\n }\n return slot.getAddressSlot();\n }\n\n /**\n * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n *\n * WARNING: Only use if you are certain `pos` is lower than the array length.\n */\n function unsafeAccess(bytes32[] storage arr, uint256 pos) internal pure returns (StorageSlot.Bytes32Slot storage) {\n bytes32 slot;\n /// @solidity memory-safe-assembly\n assembly {\n mstore(0, arr.slot)\n slot := add(keccak256(0, 0x20), pos)\n }\n return slot.getBytes32Slot();\n }\n\n /**\n * @dev Access an array in an \"unsafe\" way. Skips solidity \"index-out-of-range\" check.\n *\n * WARNING: Only use if you are certain `pos` is lower than the array length.\n */\n function unsafeAccess(uint256[] storage arr, uint256 pos) internal pure returns (StorageSlot.Uint256Slot storage) {\n bytes32 slot;\n /// @solidity memory-safe-assembly\n assembly {\n mstore(0, arr.slot)\n slot := add(keccak256(0, 0x20), pos)\n }\n return slot.getUint256Slot();\n }\n}\n"
},
"@openzeppelin/contracts/utils/Address.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 Address {\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 Same as {xref-Address-functionCall-address-bytes-}[`functionCall`],\n * but performing a delegate call.\n *\n * _Available since v3.4._\n */\n function functionDelegateCall(address target, bytes memory data) internal returns (bytes memory) {\n return functionDelegateCall(target, data, \"Address: low-level delegate call failed\");\n }\n\n /**\n * @dev Same as {xref-Address-functionCall-address-bytes-string-}[`functionCall`],\n * but performing a delegate call.\n *\n * _Available since v3.4._\n */\n function functionDelegateCall(\n address target,\n bytes memory data,\n string memory errorMessage\n ) internal returns (bytes memory) {\n (bool success, bytes memory returndata) = target.delegatecall(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/utils/Context.sol": {
"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts v4.4.1 (utils/Context.sol)\n\npragma solidity ^0.8.0;\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 Context {\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"
},
"@openzeppelin/contracts/token/ERC20/IERC20.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 IERC20 {\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/access/Ownable.sol": {
"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.7.0) (access/Ownable.sol)\n\npragma solidity ^0.8.0;\n\nimport \"../utils/Context.sol\";\n\n/**\n * @dev Contract module which provides a basic access control mechanism, where\n * there is an account (an owner) that can be granted exclusive access to\n * specific functions.\n *\n * By default, the owner account will be the one that deploys the contract. This\n * can later be changed with {transferOwnership}.\n *\n * This module is used through inheritance. It will make available the modifier\n * `onlyOwner`, which can be applied to your functions to restrict their use to\n * the owner.\n */\nabstract contract Ownable is Context {\n address private _owner;\n\n event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);\n\n /**\n * @dev Initializes the contract setting the deployer as the initial owner.\n */\n constructor() {\n _transferOwnership(_msgSender());\n }\n\n /**\n * @dev Throws if called by any account other than the owner.\n */\n modifier onlyOwner() {\n _checkOwner();\n _;\n }\n\n /**\n * @dev Returns the address of the current owner.\n */\n function owner() public view virtual returns (address) {\n return _owner;\n }\n\n /**\n * @dev Throws if the sender is not the owner.\n */\n function _checkOwner() internal view virtual {\n require(owner() == _msgSender(), \"Ownable: caller is not the owner\");\n }\n\n /**\n * @dev Leaves the contract without owner. It will not be possible to call\n * `onlyOwner` functions anymore. Can only be called by the current owner.\n *\n * NOTE: Renouncing ownership will leave the contract without an owner,\n * thereby removing any functionality that is only available to the owner.\n */\n function renounceOwnership() public virtual onlyOwner {\n _transferOwnership(address(0));\n }\n\n /**\n * @dev Transfers ownership of the contract to a new account (`newOwner`).\n * Can only be called by the current owner.\n */\n function transferOwnership(address newOwner) public virtual onlyOwner {\n require(newOwner != address(0), \"Ownable: new owner is the zero address\");\n _transferOwnership(newOwner);\n }\n\n /**\n * @dev Transfers ownership of the contract to a new account (`newOwner`).\n * Internal function without access restriction.\n */\n function _transferOwnership(address newOwner) internal virtual {\n address oldOwner = _owner;\n _owner = newOwner;\n emit OwnershipTransferred(oldOwner, newOwner);\n }\n}\n"
},
"@openzeppelin/contracts/utils/math/Math.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 Math {\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 < 2*msb(a)`. This value can be written `msb(a)=2**k` with `k=log2(a)`.\n //\n // This can be rewritten `2**log2(a) <= a < 2**(log2(a) + 1)`\n // → `sqrt(2**k) <= 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 >= 10**64) {\n value /= 10**64;\n result += 64;\n }\n if (value >= 10**32) {\n value /= 10**32;\n result += 32;\n }\n if (value >= 10**16) {\n value /= 10**16;\n result += 16;\n }\n if (value >= 10**8) {\n value /= 10**8;\n result += 8;\n }\n if (value >= 10**4) {\n value /= 10**4;\n result += 4;\n }\n if (value >= 10**2) {\n value /= 10**2;\n result += 2;\n }\n if (value >= 10**1) {\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 && 10**result < 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/utils/StorageSlot.sol": {
"content": "// SPDX-License-Identifier: MIT\n// OpenZeppelin Contracts (last updated v4.7.0) (utils/StorageSlot.sol)\n\npragma solidity ^0.8.0;\n\n/**\n * @dev Library for reading and writing primitive types to specific storage slots.\n *\n * Storage slots are often used to avoid storage conflict when dealing with upgradeable contracts.\n * This library helps with reading and writing to such slots without the need for inline assembly.\n *\n * The functions in this library return Slot structs that contain a `value` member that can be used to read or write.\n *\n * Example usage to set ERC1967 implementation slot:\n * ```\n * contract ERC1967 {\n * bytes32 internal constant _IMPLEMENTATION_SLOT = 0x360894a13ba1a3210667c828492db98dca3e2076cc3735a920a3ca505d382bbc;\n *\n * function _getImplementation() internal view returns (address) {\n * return StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value;\n * }\n *\n * function _setImplementation(address newImplementation) internal {\n * require(Address.isContract(newImplementation), \"ERC1967: new implementation is not a contract\");\n * StorageSlot.getAddressSlot(_IMPLEMENTATION_SLOT).value = newImplementation;\n * }\n * }\n * ```\n *\n * _Available since v4.1 for `address`, `bool`, `bytes32`, and `uint256`._\n */\nlibrary StorageSlot {\n struct AddressSlot {\n address value;\n }\n\n struct BooleanSlot {\n bool value;\n }\n\n struct Bytes32Slot {\n bytes32 value;\n }\n\n struct Uint256Slot {\n uint256 value;\n }\n\n /**\n * @dev Returns an `AddressSlot` with member `value` located at `slot`.\n */\n function getAddressSlot(bytes32 slot) internal pure returns (AddressSlot storage r) {\n /// @solidity memory-safe-assembly\n assembly {\n r.slot := slot\n }\n }\n\n /**\n * @dev Returns an `BooleanSlot` with member `value` located at `slot`.\n */\n function getBooleanSlot(bytes32 slot) internal pure returns (BooleanSlot storage r) {\n /// @solidity memory-safe-assembly\n assembly {\n r.slot := slot\n }\n }\n\n /**\n * @dev Returns an `Bytes32Slot` with member `value` located at `slot`.\n */\n function getBytes32Slot(bytes32 slot) internal pure returns (Bytes32Slot storage r) {\n /// @solidity memory-safe-assembly\n assembly {\n r.slot := slot\n }\n }\n\n /**\n * @dev Returns an `Uint256Slot` with member `value` located at `slot`.\n */\n function getUint256Slot(bytes32 slot) internal pure returns (Uint256Slot storage r) {\n /// @solidity memory-safe-assembly\n assembly {\n r.slot := slot\n }\n }\n}\n"
}
},
"settings": {
"optimizer": {
"enabled": false,
"runs": 200
},
"outputSelection": {
"*": {
"*": [
"evm.bytecode",
"evm.deployedBytecode",
"devdoc",
"userdoc",
"metadata",
"abi"
]
}
}
}
} |