Contract Source Code (Solidity Standard Json-Input format)

IDE

• Blockscan IDE
• 🤖 Code ReaderBeta
• Remix IDE

More Options

• Similar
• Sol2Uml
• Submit Audit
• Compare

// SPDX-License-Identifier: MIT
pragma solidity ^0.8.16;

import {Ownable} from "@oz/access/Ownable.sol";
import {EnumerableSet} from "@oz/utils/structs/EnumerableSet.sol";
import {IBeepBoop} from "../interfaces/IBeepBoop.sol";

contract BeepBoopAmmo is Ownable {
    using EnumerableSet for EnumerableSet.UintSet;

    /// @notice $BeepBoop
    IBeepBoop public beepBoop;

    /// @notice Token Ids
    uint256 gameMintPrice = 50000e18;

    /// @notice Round => Tokens
    mapping(uint256 => mapping(uint256 => EnumerableSet.UintSet))
        private _tokensWithAmmoForRound;

    /// @notice Season
    uint256 private _currentSeason;

    constructor(address beepBoop_) {
        beepBoop = IBeepBoop(beepBoop_);
    }

    /**
     * @notice Purchase a battery (limited using in-game)
     */
    function purchaseAmmo(uint256 round, uint256[] calldata tokenIds) public {
        require(tokenIds.length > 0);
        uint256 season = _currentSeason;
        uint256 cost = tokenIds.length * gameMintPrice;
        IBeepBoop(beepBoop).spendBeepBoop(msg.sender, cost);
        for (uint256 t; t < tokenIds.length; ++t) {
            _tokensWithAmmoForRound[season][round].add(tokenIds[t]);
        }
    }

    /**
     * @notice Return the token ids with ammo
     */
    function getTokensWithAmmo(
        uint256 roundFrom,
        uint256 roundTo
    ) public view returns (uint256[] memory) {
        require(roundFrom <= roundTo);
        uint256 season = _currentSeason;
        uint256 tokenLength;
        for (uint256 r = roundFrom; r <= roundTo; r++) {
            tokenLength += _tokensWithAmmoForRound[season][r].length();
        }
        uint256 tokenIdx;
        uint256[] memory tokenIds = new uint256[](tokenLength);
        for (uint256 r = roundFrom; r <= roundTo; r++) {
            for (
                uint256 t;
                t < _tokensWithAmmoForRound[season][r].length();
                ++t
            ) {
                tokenIds[tokenIdx++] = _tokensWithAmmoForRound[season][r].at(t);
            }
        }
        return tokenIds;
    }

    /**
     * @notice Change the boop contract
     */
    function changeBeepBoopContract(address contract_) public onlyOwner {
        beepBoop = IBeepBoop(contract_);
    }

    /**
     * @notice Modify price
     */
    function setGameMintPrice(uint256 price) public onlyOwner {
        gameMintPrice = price;
    }

    /**
     * @notice Modify season
     */
    function setSeason(uint256 season) public onlyOwner {
        _currentSeason = season;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.7.0) (access/Ownable.sol)

pragma solidity ^0.8.0;

import "../utils/Context.sol";

/**
 * @dev Contract module which provides a basic access control mechanism, where
 * there is an account (an owner) that can be granted exclusive access to
 * specific functions.
 *
 * By default, the owner account will be the one that deploys the contract. This
 * can later be changed with {transferOwnership}.
 *
 * This module is used through inheritance. It will make available the modifier
 * `onlyOwner`, which can be applied to your functions to restrict their use to
 * the owner.
 */
abstract contract Ownable is Context {
    address private _owner;

    event OwnershipTransferred(address indexed previousOwner, address indexed newOwner);

    /**
     * @dev Initializes the contract setting the deployer as the initial owner.
     */
    constructor() {
        _transferOwnership(_msgSender());
    }

    /**
     * @dev Throws if called by any account other than the owner.
     */
    modifier onlyOwner() {
        _checkOwner();
        _;
    }

    /**
     * @dev Returns the address of the current owner.
     */
    function owner() public view virtual returns (address) {
        return _owner;
    }

    /**
     * @dev Throws if the sender is not the owner.
     */
    function _checkOwner() internal view virtual {
        require(owner() == _msgSender(), "Ownable: caller is not the owner");
    }

    /**
     * @dev Leaves the contract without owner. It will not be possible to call
     * `onlyOwner` functions anymore. Can only be called by the current owner.
     *
     * NOTE: Renouncing ownership will leave the contract without an owner,
     * thereby removing any functionality that is only available to the owner.
     */
    function renounceOwnership() public virtual onlyOwner {
        _transferOwnership(address(0));
    }

    /**
     * @dev Transfers ownership of the contract to a new account (`newOwner`).
     * Can only be called by the current owner.
     */
    function transferOwnership(address newOwner) public virtual onlyOwner {
        require(newOwner != address(0), "Ownable: new owner is the zero address");
        _transferOwnership(newOwner);
    }

    /**
     * @dev Transfers ownership of the contract to a new account (`newOwner`).
     * Internal function without access restriction.
     */
    function _transferOwnership(address newOwner) internal virtual {
        address oldOwner = _owner;
        _owner = newOwner;
        emit OwnershipTransferred(oldOwner, newOwner);
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts v4.4.1 (utils/Context.sol)

pragma solidity ^0.8.0;

/**
 * @dev Provides information about the current execution context, including the
 * sender of the transaction and its data. While these are generally available
 * via msg.sender and msg.data, they should not be accessed in such a direct
 * manner, since when dealing with meta-transactions the account sending and
 * paying for execution may not be the actual sender (as far as an application
 * is concerned).
 *
 * This contract is only required for intermediate, library-like contracts.
 */
abstract contract Context {
    function _msgSender() internal view virtual returns (address) {
        return msg.sender;
    }

    function _msgData() internal view virtual returns (bytes calldata) {
        return msg.data;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.7.0) (utils/structs/EnumerableSet.sol)
// This file was procedurally generated from scripts/generate/templates/EnumerableSet.js.

pragma solidity ^0.8.0;

/**
 * @dev Library for managing
 * https://en.wikipedia.org/wiki/Set_(abstract_data_type)[sets] of primitive
 * types.
 *
 * Sets have the following properties:
 *
 * - Elements are added, removed, and checked for existence in constant time
 * (O(1)).
 * - Elements are enumerated in O(n). No guarantees are made on the ordering.
 *
 * ```
 * contract Example {
 *     // Add the library methods
 *     using EnumerableSet for EnumerableSet.AddressSet;
 *
 *     // Declare a set state variable
 *     EnumerableSet.AddressSet private mySet;
 * }
 * ```
 *
 * As of v3.3.0, sets of type `bytes32` (`Bytes32Set`), `address` (`AddressSet`)
 * and `uint256` (`UintSet`) are supported.
 *
 * [WARNING]
 * ====
 * Trying to delete such a structure from storage will likely result in data corruption, rendering the structure
 * unusable.
 * See https://github.com/ethereum/solidity/pull/11843[ethereum/solidity#11843] for more info.
 *
 * In order to clean an EnumerableSet, you can either remove all elements one by one or create a fresh instance using an
 * array of EnumerableSet.
 * ====
 */
library EnumerableSet {
    // To implement this library for multiple types with as little code
    // repetition as possible, we write it in terms of a generic Set type with
    // bytes32 values.
    // The Set implementation uses private functions, and user-facing
    // implementations (such as AddressSet) are just wrappers around the
    // underlying Set.
    // This means that we can only create new EnumerableSets for types that fit
    // in bytes32.

    struct Set {
        // Storage of set values
        bytes32[] _values;
        // Position of the value in the `values` array, plus 1 because index 0
        // means a value is not in the set.
        mapping(bytes32 => uint256) _indexes;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function _add(Set storage set, bytes32 value) private returns (bool) {
        if (!_contains(set, value)) {
            set._values.push(value);
            // The value is stored at length-1, but we add 1 to all indexes
            // and use 0 as a sentinel value
            set._indexes[value] = set._values.length;
            return true;
        } else {
            return false;
        }
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function _remove(Set storage set, bytes32 value) private returns (bool) {
        // We read and store the value's index to prevent multiple reads from the same storage slot
        uint256 valueIndex = set._indexes[value];

        if (valueIndex != 0) {
            // Equivalent to contains(set, value)
            // To delete an element from the _values array in O(1), we swap the element to delete with the last one in
            // the array, and then remove the last element (sometimes called as 'swap and pop').
            // This modifies the order of the array, as noted in {at}.

            uint256 toDeleteIndex = valueIndex - 1;
            uint256 lastIndex = set._values.length - 1;

            if (lastIndex != toDeleteIndex) {
                bytes32 lastValue = set._values[lastIndex];

                // Move the last value to the index where the value to delete is
                set._values[toDeleteIndex] = lastValue;
                // Update the index for the moved value
                set._indexes[lastValue] = valueIndex; // Replace lastValue's index to valueIndex
            }

            // Delete the slot where the moved value was stored
            set._values.pop();

            // Delete the index for the deleted slot
            delete set._indexes[value];

            return true;
        } else {
            return false;
        }
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function _contains(Set storage set, bytes32 value) private view returns (bool) {
        return set._indexes[value] != 0;
    }

    /**
     * @dev Returns the number of values on the set. O(1).
     */
    function _length(Set storage set) private view returns (uint256) {
        return set._values.length;
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function _at(Set storage set, uint256 index) private view returns (bytes32) {
        return set._values[index];
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function _values(Set storage set) private view returns (bytes32[] memory) {
        return set._values;
    }

    // Bytes32Set

    struct Bytes32Set {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(Bytes32Set storage set, bytes32 value) internal returns (bool) {
        return _add(set._inner, value);
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(Bytes32Set storage set, bytes32 value) internal returns (bool) {
        return _remove(set._inner, value);
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(Bytes32Set storage set, bytes32 value) internal view returns (bool) {
        return _contains(set._inner, value);
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(Bytes32Set storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(Bytes32Set storage set, uint256 index) internal view returns (bytes32) {
        return _at(set._inner, index);
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(Bytes32Set storage set) internal view returns (bytes32[] memory) {
        bytes32[] memory store = _values(set._inner);
        bytes32[] memory result;

        /// @solidity memory-safe-assembly
        assembly {
            result := store
        }

        return result;
    }

    // AddressSet

    struct AddressSet {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(AddressSet storage set, address value) internal returns (bool) {
        return _add(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(AddressSet storage set, address value) internal returns (bool) {
        return _remove(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(AddressSet storage set, address value) internal view returns (bool) {
        return _contains(set._inner, bytes32(uint256(uint160(value))));
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(AddressSet storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(AddressSet storage set, uint256 index) internal view returns (address) {
        return address(uint160(uint256(_at(set._inner, index))));
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(AddressSet storage set) internal view returns (address[] memory) {
        bytes32[] memory store = _values(set._inner);
        address[] memory result;

        /// @solidity memory-safe-assembly
        assembly {
            result := store
        }

        return result;
    }

    // UintSet

    struct UintSet {
        Set _inner;
    }

    /**
     * @dev Add a value to a set. O(1).
     *
     * Returns true if the value was added to the set, that is if it was not
     * already present.
     */
    function add(UintSet storage set, uint256 value) internal returns (bool) {
        return _add(set._inner, bytes32(value));
    }

    /**
     * @dev Removes a value from a set. O(1).
     *
     * Returns true if the value was removed from the set, that is if it was
     * present.
     */
    function remove(UintSet storage set, uint256 value) internal returns (bool) {
        return _remove(set._inner, bytes32(value));
    }

    /**
     * @dev Returns true if the value is in the set. O(1).
     */
    function contains(UintSet storage set, uint256 value) internal view returns (bool) {
        return _contains(set._inner, bytes32(value));
    }

    /**
     * @dev Returns the number of values in the set. O(1).
     */
    function length(UintSet storage set) internal view returns (uint256) {
        return _length(set._inner);
    }

    /**
     * @dev Returns the value stored at position `index` in the set. O(1).
     *
     * Note that there are no guarantees on the ordering of values inside the
     * array, and it may change when more values are added or removed.
     *
     * Requirements:
     *
     * - `index` must be strictly less than {length}.
     */
    function at(UintSet storage set, uint256 index) internal view returns (uint256) {
        return uint256(_at(set._inner, index));
    }

    /**
     * @dev Return the entire set in an array
     *
     * WARNING: This operation will copy the entire storage to memory, which can be quite expensive. This is designed
     * to mostly be used by view accessors that are queried without any gas fees. Developers should keep in mind that
     * this function has an unbounded cost, and using it as part of a state-changing function may render the function
     * uncallable if the set grows to a point where copying to memory consumes too much gas to fit in a block.
     */
    function values(UintSet storage set) internal view returns (uint256[] memory) {
        bytes32[] memory store = _values(set._inner);
        uint256[] memory result;

        /// @solidity memory-safe-assembly
        assembly {
            result := store
        }

        return result;
    }
}

// SPDX-License-Identifier: MIT
pragma solidity ^0.8.16;

interface IBeepBoop {
    function spendBeepBoop(address user, uint256 amount) external;

    function depositBeepBoopFor(address user, uint256 amount) external;

    function depositBeepBoop(uint256 amount) external;

    function getUserBalance(address user) external view returns (uint256);

    function mintFor(address user, uint256 amount) external;
}

{
  "remappings": [
    "@closedsea/=lib/closedsea/src/",
    "@erc721a-upgradable/=lib/ERC721A-Upgradeable/contracts/",
    "@erc721a/=lib/erc721a/contracts/",
    "@os/=lib/operator-filter-registry/src/",
    "@oz-upgradeable/=lib/openzeppelin-contracts-upgradeable/contracts/",
    "@oz/=lib/openzeppelin-contracts/contracts/",
    "@prb/test/=lib/prb-test/src/",
    "@solady/=lib/solady/src/",
    "@std/=lib/forge-std/src/",
    "ERC721A-Upgradeable/=lib/ERC721A-Upgradeable/contracts/",
    "closedsea/=lib/closedsea/src/",
    "ds-test/=lib/forge-std/lib/ds-test/src/",
    "erc4626-tests/=lib/closedsea/lib/openzeppelin-contracts/lib/erc4626-tests/",
    "erc721a-upgradeable/=lib/closedsea/lib/erc721a-upgradeable/contracts/",
    "erc721a/=lib/erc721a/contracts/",
    "forge-std/=lib/forge-std/src/",
    "openzeppelin-contracts-upgradeable/=lib/openzeppelin-contracts-upgradeable/contracts/",
    "openzeppelin-contracts/=lib/openzeppelin-contracts/contracts/",
    "operator-filter-registry/=lib/operator-filter-registry/src/",
    "prb-test/=lib/prb-test/src/",
    "solady/=lib/solady/src/",
    "solmate/=lib/solady/lib/solmate/src/"
  ],
  "optimizer": {
    "enabled": true,
    "runs": 200
  },
  "metadata": {
    "bytecodeHash": "ipfs"
  },
  "outputSelection": {
    "*": {
      "*": [
        "evm.bytecode",
        "evm.deployedBytecode",
        "devdoc",
        "userdoc",
        "metadata",
        "abi"
      ]
    }
  },
  "evmVersion": "london",
  "libraries": {}
}

• No Contract Security Audit Submitted- Submit Audit Here

[{"inputs":[{"internalType":"address","name":"beepBoop_","type":"address"}],"stateMutability":"nonpayable","type":"constructor"},{"anonymous":false,"inputs":[{"indexed":true,"internalType":"address","name":"previousOwner","type":"address"},{"indexed":true,"internalType":"address","name":"newOwner","type":"address"}],"name":"OwnershipTransferred","type":"event"},{"inputs":[],"name":"beepBoop","outputs":[{"internalType":"contract IBeepBoop","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"address","name":"contract_","type":"address"}],"name":"changeBeepBoopContract","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"roundFrom","type":"uint256"},{"internalType":"uint256","name":"roundTo","type":"uint256"}],"name":"getTokensWithAmmo","outputs":[{"internalType":"uint256[]","name":"","type":"uint256[]"}],"stateMutability":"view","type":"function"},{"inputs":[],"name":"owner","outputs":[{"internalType":"address","name":"","type":"address"}],"stateMutability":"view","type":"function"},{"inputs":[{"internalType":"uint256","name":"round","type":"uint256"},{"internalType":"uint256[]","name":"tokenIds","type":"uint256[]"}],"name":"purchaseAmmo","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[],"name":"renounceOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"price","type":"uint256"}],"name":"setGameMintPrice","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"uint256","name":"season","type":"uint256"}],"name":"setSeason","outputs":[],"stateMutability":"nonpayable","type":"function"},{"inputs":[{"internalType":"address","name":"newOwner","type":"address"}],"name":"transferOwnership","outputs":[],"stateMutability":"nonpayable","type":"function"}]

6080604052690a968163f0a57b40000060025534801561001e57600080fd5b5060405161089e38038061089e83398101604081905261003d916100bb565b6100463361006b565b600180546001600160a01b0319166001600160a01b03929092169190911790556100eb565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b6000602082840312156100cd57600080fd5b81516001600160a01b03811681146100e457600080fd5b9392505050565b6107a4806100fa6000396000f3fe608060405234801561001057600080fd5b50600436106100935760003560e01c80638da5cb5b116100665780638da5cb5b14610105578063af88fac914610116578063bcd1c1e514610129578063eed5cd061461013c578063f2fde38b1461014f57600080fd5b80630c817ed71461009857806349ac3fb4146100ad5780636b9a4f33146100dd578063715018a6146100fd575b600080fd5b6100ab6100a63660046105ba565b610162565b005b6001546100c0906001600160a01b031681565b6040516001600160a01b0390911681526020015b60405180910390f35b6100f06100eb3660046105e3565b61018c565b6040516100d49190610605565b6100ab6102e2565b6000546001600160a01b03166100c0565b6100ab610124366004610649565b6102f6565b6100ab610137366004610662565b610303565b6100ab61014a366004610649565b6103e3565b6100ab61015d3660046105ba565b6103f0565b61016a61046e565b600180546001600160a01b0319166001600160a01b0392909216919091179055565b60608183111561019b57600080fd5b6004546000845b8481116101e957600083815260036020908152604080832084845290915290206101cb906104c8565b6101d590836106f7565b9150806101e18161070a565b9150506101a2565b506000808267ffffffffffffffff81111561020657610206610723565b60405190808252806020026020018201604052801561022f578160200160208202803683370190505b509050865b8681116102d55760005b60008681526003602090815260408083208584529091529020610260906104c8565b8110156102c2576000868152600360209081526040808320858452909152902061028a90826104d2565b83856102958161070a565b9650815181106102a7576102a7610739565b60209081029190910101526102bb8161070a565b905061023e565b50806102cd8161070a565b915050610234565b5093505050505b92915050565b6102ea61046e565b6102f460006104e5565b565b6102fe61046e565b600455565b8061030d57600080fd5b600454600254600090610320908461074f565b60015460405163c2f7df3d60e01b8152336004820152602481018390529192506001600160a01b03169063c2f7df3d90604401600060405180830381600087803b15801561036d57600080fd5b505af1158015610381573d6000803e3d6000fd5b5050505060005b838110156103db576103ca8585838181106103a5576103a5610739565b60008781526003602090815260408083208d8452825290912093910201359050610535565b506103d48161070a565b9050610388565b505050505050565b6103eb61046e565b600255565b6103f861046e565b6001600160a01b0381166104625760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b60648201526084015b60405180910390fd5b61046b816104e5565b50565b6000546001600160a01b031633146102f45760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65726044820152606401610459565b60006102dc825490565b60006104de8383610541565b9392505050565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b60006104de838361056b565b600082600001828154811061055857610558610739565b9060005260206000200154905092915050565b60008181526001830160205260408120546105b2575081546001818101845560008481526020808220909301849055845484825282860190935260409020919091556102dc565b5060006102dc565b6000602082840312156105cc57600080fd5b81356001600160a01b03811681146104de57600080fd5b600080604083850312156105f657600080fd5b50508035926020909101359150565b6020808252825182820181905260009190848201906040850190845b8181101561063d57835183529284019291840191600101610621565b50909695505050505050565b60006020828403121561065b57600080fd5b5035919050565b60008060006040848603121561067757600080fd5b83359250602084013567ffffffffffffffff8082111561069657600080fd5b818601915086601f8301126106aa57600080fd5b8135818111156106b957600080fd5b8760208260051b85010111156106ce57600080fd5b6020830194508093505050509250925092565b634e487b7160e01b600052601160045260246000fd5b808201808211156102dc576102dc6106e1565b60006001820161071c5761071c6106e1565b5060010190565b634e487b7160e01b600052604160045260246000fd5b634e487b7160e01b600052603260045260246000fd5b6000816000190483118215151615610769576107696106e1565b50029056fea26469706673582212204d604163d760c0ed57c4c4f6142b051cc91715d33780323962b5a2b61cffcb8f64736f6c634300081000330000000000000000000000008013266cb5c9dd48be3ad7d1ce832874d64b3ce1

0x608060405234801561001057600080fd5b50600436106100935760003560e01c80638da5cb5b116100665780638da5cb5b14610105578063af88fac914610116578063bcd1c1e514610129578063eed5cd061461013c578063f2fde38b1461014f57600080fd5b80630c817ed71461009857806349ac3fb4146100ad5780636b9a4f33146100dd578063715018a6146100fd575b600080fd5b6100ab6100a63660046105ba565b610162565b005b6001546100c0906001600160a01b031681565b6040516001600160a01b0390911681526020015b60405180910390f35b6100f06100eb3660046105e3565b61018c565b6040516100d49190610605565b6100ab6102e2565b6000546001600160a01b03166100c0565b6100ab610124366004610649565b6102f6565b6100ab610137366004610662565b610303565b6100ab61014a366004610649565b6103e3565b6100ab61015d3660046105ba565b6103f0565b61016a61046e565b600180546001600160a01b0319166001600160a01b0392909216919091179055565b60608183111561019b57600080fd5b6004546000845b8481116101e957600083815260036020908152604080832084845290915290206101cb906104c8565b6101d590836106f7565b9150806101e18161070a565b9150506101a2565b506000808267ffffffffffffffff81111561020657610206610723565b60405190808252806020026020018201604052801561022f578160200160208202803683370190505b509050865b8681116102d55760005b60008681526003602090815260408083208584529091529020610260906104c8565b8110156102c2576000868152600360209081526040808320858452909152902061028a90826104d2565b83856102958161070a565b9650815181106102a7576102a7610739565b60209081029190910101526102bb8161070a565b905061023e565b50806102cd8161070a565b915050610234565b5093505050505b92915050565b6102ea61046e565b6102f460006104e5565b565b6102fe61046e565b600455565b8061030d57600080fd5b600454600254600090610320908461074f565b60015460405163c2f7df3d60e01b8152336004820152602481018390529192506001600160a01b03169063c2f7df3d90604401600060405180830381600087803b15801561036d57600080fd5b505af1158015610381573d6000803e3d6000fd5b5050505060005b838110156103db576103ca8585838181106103a5576103a5610739565b60008781526003602090815260408083208d8452825290912093910201359050610535565b506103d48161070a565b9050610388565b505050505050565b6103eb61046e565b600255565b6103f861046e565b6001600160a01b0381166104625760405162461bcd60e51b815260206004820152602660248201527f4f776e61626c653a206e6577206f776e657220697320746865207a65726f206160448201526564647265737360d01b60648201526084015b60405180910390fd5b61046b816104e5565b50565b6000546001600160a01b031633146102f45760405162461bcd60e51b815260206004820181905260248201527f4f776e61626c653a2063616c6c6572206973206e6f7420746865206f776e65726044820152606401610459565b60006102dc825490565b60006104de8383610541565b9392505050565b600080546001600160a01b038381166001600160a01b0319831681178455604051919092169283917f8be0079c531659141344cd1fd0a4f28419497f9722a3daafe3b4186f6b6457e09190a35050565b60006104de838361056b565b600082600001828154811061055857610558610739565b9060005260206000200154905092915050565b60008181526001830160205260408120546105b2575081546001818101845560008481526020808220909301849055845484825282860190935260409020919091556102dc565b5060006102dc565b6000602082840312156105cc57600080fd5b81356001600160a01b03811681146104de57600080fd5b600080604083850312156105f657600080fd5b50508035926020909101359150565b6020808252825182820181905260009190848201906040850190845b8181101561063d57835183529284019291840191600101610621565b50909695505050505050565b60006020828403121561065b57600080fd5b5035919050565b60008060006040848603121561067757600080fd5b83359250602084013567ffffffffffffffff8082111561069657600080fd5b818601915086601f8301126106aa57600080fd5b8135818111156106b957600080fd5b8760208260051b85010111156106ce57600080fd5b6020830194508093505050509250925092565b634e487b7160e01b600052601160045260246000fd5b808201808211156102dc576102dc6106e1565b60006001820161071c5761071c6106e1565b5060010190565b634e487b7160e01b600052604160045260246000fd5b634e487b7160e01b600052603260045260246000fd5b6000816000190483118215151615610769576107696106e1565b50029056fea26469706673582212204d604163d760c0ed57c4c4f6142b051cc91715d33780323962b5a2b61cffcb8f64736f6c63430008100033

0000000000000000000000008013266cb5c9dd48be3ad7d1ce832874d64b3ce1

-----Decoded View---------------
Arg [0] : beepBoop_ (address): 0x8013266cb5c9dd48bE3Ad7D1CE832874d64B3Ce1

-----Encoded View---------------
1 Constructor Arguments found :
Arg [0] : 0000000000000000000000008013266cb5c9dd48be3ad7d1ce832874d64b3ce1