/**
* SPDX-License-Identifier: Copyright (c) 2024 ultimatedeal.net Osher Haim Glick.
*
* Copyright (c) 2024 ultimatedeal.net Osher Haim Glick.
* Kindly don't copy this code or sell it in anyform.
* 
*
* /$$   /$$ /$$   /$$     /$$                           /$$               /$$$$$$$             /$$$$$$  /$$
*| $$  | $$| $$  | $$    |__/                          | $$              | $$__  $$           /$$__  $$| $$
*| $$  | $$| $$ /$$$$$$   /$$ /$$$$$$/$$$$   /$$$$$$  /$$$$$$    /$$$$$$ | $$  \ $$  /$$$$$$ | $$  \ $$| $$
*| $$  | $$| $$|_  $$_/  | $$| $$_  $$_  $$ |____  $$|_  $$_/   /$$__  $$| $$  | $$ /$$__  $$| $$$$$$$$| $$
*| $$  | $$| $$  | $$    | $$| $$ \ $$ \ $$  /$$$$$$$  | $$    | $$$$$$$$| $$  | $$| $$$$$$$$| $$__  $$| $$
*| $$  | $$| $$  | $$ /$$| $$| $$ | $$ | $$ /$$__  $$  | $$ /$$| $$_____/| $$  | $$| $$_____/| $$  | $$| $$
*|  $$$$$$/| $$  |  $$$$/| $$| $$ | $$ | $$|  $$$$$$$  |  $$$$/|  $$$$$$$| $$$$$$$/|  $$$$$$$| $$  | $$| $$
* \______/ |__/   \___/  |__/|__/ |__/ |__/ \_______/   \___/   \_______/|_______/  \_______/|__/  |__/|__/
*                                                                                                          
*      its not i its little L                                                                                                       
*
*  /$$$$$$            /$$                                 /$$   /$$           /$$                      /$$$$$$  /$$ /$$           /$$      
* /$$__  $$          | $$                                | $$  | $$          |__/                     /$$__  $$| $$|__/          | $$      
*| $$  \ $$  /$$$$$$$| $$$$$$$   /$$$$$$   /$$$$$$       | $$  | $$  /$$$$$$  /$$ /$$$$$$/$$$$       | $$  \__/| $$ /$$  /$$$$$$$| $$   /$$
*| $$  | $$ /$$_____/| $$__  $$ /$$__  $$ /$$__  $$      | $$$$$$$$ |____  $$| $$| $$_  $$_  $$      | $$ /$$$$| $$| $$ /$$_____/| $$  /$$/
*| $$  | $$|  $$$$$$ | $$  \ $$| $$$$$$$$| $$  \__/      | $$__  $$  /$$$$$$$| $$| $$ \ $$ \ $$      | $$|_  $$| $$| $$| $$      | $$$$$$/ 
*| $$  | $$ \____  $$| $$  | $$| $$_____/| $$            | $$  | $$ /$$__  $$| $$| $$ | $$ | $$      | $$  \ $$| $$| $$| $$      | $$_  $$ 
*|  $$$$$$/ /$$$$$$$/| $$  | $$|  $$$$$$$| $$            | $$  | $$|  $$$$$$$| $$| $$ | $$ | $$      |  $$$$$$/| $$| $$|  $$$$$$$| $$ \  $$
* \______/ |_______/ |__/  |__/ \_______/|__/            |__/  |__/ \_______/|__/|__/ |__/ |__/       \______/ |__/|__/ \_______/|__/  \__/
*                                                                                                                                         
*                                                                                                                                          
*  DeAlStore Let you open a blockchain store with inventory managment, invoices, clients list, reward your customers with shares, distribute dividends to share holders and more!                                                                                                                                       
*  Contact us today for more details at support@ultimatedeal.net
*
*
*
**/
pragma solidity ^0.8.26;
import "contracts/IERC20Flat.sol";
import "contracts/ReentrancyGuard.sol";
import "@openzeppelin/contracts/utils/Strings.sol";
import "contracts/IInvoiceRenting.sol";

interface IERC20Extended {
    function decimals() external view returns (uint8);
}

contract DeAlStableLiquidity is ReentrancyGuard {

    address public contractOwner;
    event WorkerGotPayed(uint256 amount,address workerAddress);
    event AmountPurchasedMoreInfo(uint256 amount,string info,uint256 invoiceId);
    uint8 private paymentTokenDecimals;
    uint8 private rewardTokenDecimals;
    string public typeOfContract;
    IInvoice public invoices;
    uint256 public feeUSDC=0;
    uint256 public feeDeAl=0;
    event ProductAdded(
        string name,
        string barcode,
        uint256 price,
        uint256 quantity,
        uint256 discountPercentage,
        string description
    );

    event NewReceipt(
        uint256 receiptId,
        uint256 timestamp,
        address clientAddress,
        string productBarcode,
        uint256 amountPaid,
        string ProductDesc           
    );

    struct Product {
        string name;
        string barcode;
        uint256 price;
        uint256 quantity;
        string[] productImages;
        string productDescription;
        uint256 discountPercentage;
        string category;
    }

    struct Receipt {
        uint256 index;
        uint256 timestamp;
        address clientAddress;
        string productBarcode;
        uint256 amountPaid;
    }

    struct Locker {
        uint256 duration;
        uint256 startTime;
    }

    Locker public theLocker;

    uint256 public total = 0;
    uint256 public Balance = 0;
    string[] public productBarcodes;
    mapping(string => Product) public products;
    mapping(uint256 => Receipt) public receipts;
    mapping(uint256 => string) public infos;
    uint256 public receiptCounter = 1;
    IERC20Flat public tokenContract;
    IERC20Flat public rewardToken;
    uint256 public rewardsPool;
    mapping(uint256 => uint256[]) receiptNFTs;

    constructor(
        address _ERCUltra,
        address _invoices,
        address _paymentToken
    ) {
        typeOfContract = "Liquidity";
        invoices = IInvoice(_invoices);
        tokenContract = IERC20Flat(_paymentToken);
        rewardToken = IERC20Flat(_ERCUltra);
        contractOwner = msg.sender;
        tokenContract.approve(address(this), type(uint256).max);
        rewardsPool = 0;
        paymentTokenDecimals = IERC20Extended(_paymentToken).decimals();
        rewardTokenDecimals = IERC20Extended(_ERCUltra).decimals();
    }

    modifier onlyOwner() {
        require(msg.sender == contractOwner, "Only owner");
        _;
    }

    function verifyReceipt(address client, uint256 receiptId) public view returns (bool) {
        Receipt storage receipt = receipts[receiptId];
        return (receipt.clientAddress == client && receipt.index == receiptId);
    }

    function verifySpecificReceiptOfSpecificProduct(address client, uint256 receiptId, string memory productBarcode) public view returns (bool) {
        Receipt storage receipt = receipts[receiptId];
        return (receipt.clientAddress == client && receipt.index == receiptId && keccak256(abi.encodePacked(receipt.productBarcode)) == keccak256(abi.encodePacked(productBarcode)));
    }

    function lockProduct(string memory _barcode, uint256 _duration) nonReentrant onlyOwner public {
        theLocker = Locker({
            duration: _duration,
            startTime: block.timestamp
        });
    }

    function depositToRewardPool(uint256 amount) nonReentrant onlyOwner public returns(uint256) {
        require(rewardToken.transferFrom(msg.sender, address(this), amount*10**rewardTokenDecimals), "Transfer failed");
        rewardsPool += amount*10**rewardTokenDecimals;
        return rewardsPool;
    }

    function getProductPics(string memory _barcode) public view returns (string[] memory) {
        return products[_barcode].productImages;
    }

    function isClient(address _address) public view returns (bool) {
        return true;
    }

    function deposit(uint256 _amount) nonReentrant public {
        require(_amount > 0, "");
        require(tokenContract.transferFrom(msg.sender, address(this), _amount), "Failed to transfer tokens");
        Balance += _amount;
        total += _amount;
    }

    function changeOwner(address _newOwner) nonReentrant onlyOwner public returns (bool) {
        contractOwner = _newOwner;
    }

    function sell(uint256 _amount,string memory _barcode,uint256 _invoiceId) nonReentrant public {
        Product storage product = products[_barcode];
        address sender = msg.sender;
        require(invoices.verifyOwnership(sender,receiptNFTs[_invoiceId][0],_barcode),"You did not deposited DeAl");
        invoices.burnNFT(receiptNFTs[_invoiceId][0]);
        uint256 price = product.price;

        if (product.discountPercentage > 0) {
            price = price * (100 - product.discountPercentage) / 100;
        }
        // First, calculate the total amount the seller should receive
        uint256 totalAmountToPay = _amount*price*98/100;
        require(Balance>=totalAmountToPay,"Not Enough Balance");
        // Transfer the reward tokens from the seller to the contract
        require(rewardToken.transferFrom(msg.sender, address(this), _amount * 1e18), "Reward token transfer failed");
        feeDeAl += _amount * 1e18 * 3 / 100;

        // Update the rewards pool
        rewardsPool += _amount * 1e18 * 97 / 100;

        // Transfer the payment tokens to the seller
        require(tokenContract.transfer(msg.sender, totalAmountToPay), "Payment token transfer failed");

        // Update the contract's balance
        Balance -= totalAmountToPay;
    }

    function emergencyWithdrawRewardsPool() nonReentrant onlyOwner public {
        require(block.timestamp > theLocker.startTime + theLocker.duration, "Product is locked");
        if(rewardsPool!=0) {
            require(rewardToken.transfer(msg.sender, rewardsPool), "Reward transfer failed");
            rewardsPool=0;
        }
    }

    function getNFTsForReceipt(uint256 _receiptId) public view returns (uint256[] memory) {
        return receiptNFTs[_receiptId];
    }

    function addProduct(
        string memory _name,
        string memory _barcode,
        uint256 _priceInNormalNumber,
        uint256 _quantity,
        string[] memory _productImages,
        string memory _productDescription,
        uint256 _discountPercentage,
        string memory _category
    ) nonReentrant onlyOwner public {
        require(bytes(products[_barcode].barcode).length == 0, "Product already exists");
        require(_discountPercentage<=100,"discount greater than 100%!");
        Product storage newProduct = products[_barcode];
        newProduct.name = _name;
        newProduct.barcode = _barcode;
        newProduct.price = _priceInNormalNumber;
        newProduct.quantity = _quantity;
        newProduct.productImages = _productImages;
        newProduct.productDescription = _productDescription;
        newProduct.discountPercentage = _discountPercentage;
        newProduct.category = _category;
        productBarcodes.push(_barcode);
        emit ProductAdded(
            _name,
            _barcode,
            _priceInNormalNumber,
            _quantity,
            _discountPercentage,
            _productDescription
        );
    }

    function getAllCategories() public view returns (string[] memory) {
        string[] memory allCategories = new string[](productBarcodes.length);
        uint256 categoryCount = 0;

        for (uint256 i = 0; i < productBarcodes.length; i++) {
            string memory category = products[productBarcodes[i]].category;
            bool isUnique = true;
            
            for (uint256 j = 0; j < categoryCount; j++) {
                if (keccak256(abi.encodePacked(allCategories[j])) == keccak256(abi.encodePacked(category))) {
                    isUnique = false;
                    break;
                }
            }
            
            if (isUnique) {
                allCategories[categoryCount] = category;
                categoryCount++;
            }
        }

        string[] memory uniqueCategories = new string[](categoryCount);
        for (uint256 i = 0; i < categoryCount; i++) {
            uniqueCategories[i] = allCategories[i];
        }

        return uniqueCategories;
    }

    function updateProductQuantity(string memory _barcode, uint256 _newQuantity) nonReentrant onlyOwner public {
        for (uint256 i = 0; i < productBarcodes.length; i++) {
            if (keccak256(abi.encodePacked(productBarcodes[i])) == keccak256(abi.encodePacked(_barcode))) {
                products[productBarcodes[i]].quantity = _newQuantity;
                break;
            }
        }
    }

    function purchaseProduct(string memory _productBarcode,uint256 _amount, string memory _info, string memory metadata) nonReentrant public {
        Product storage product = products[_productBarcode];
        require(product.quantity >= 1, "Out of stock");

        uint256 amountToPay = product.price*_amount;

        if (product.discountPercentage > 0) {
            amountToPay = amountToPay * (100 - product.discountPercentage) / 100;
        }

        require(tokenContract.transferFrom(msg.sender, address(this), amountToPay), "Token transfer failed");
        feeUSDC += amountToPay*2/100;
        product.quantity-=1;
        uint256 newReceiptId = receiptCounter;
        receiptCounter++;
        Balance += amountToPay*98/100;
        total += amountToPay*98/100;

        // Create and store the receipt
        Receipt memory receipt = Receipt({
            index: newReceiptId,
            timestamp: block.timestamp,
            clientAddress: msg.sender,
            productBarcode: _productBarcode,
            amountPaid: amountToPay
        });

        infos[newReceiptId] = string(abi.encodePacked("Amount of the product: ", Strings.toString(_amount), "\n More info: ", _info));
        receipts[newReceiptId] = receipt;

        emit NewReceipt(
            newReceiptId,
            receipt.timestamp,
            msg.sender,
            receipt.productBarcode,
            receipt.amountPaid,
            product.productDescription
        );

        emit AmountPurchasedMoreInfo(_amount,_info,newReceiptId);

        require(rewardsPool>=_amount*1e18,"Not enough in the Pool try purchase less");
        {
            require(rewardToken.transfer(msg.sender, _amount*1e18), "Reward transfer failed");
            rewardsPool -= _amount*1e18;
        }
        uint256[] memory nftIds = new uint256[](1);
        uint256 nftId = invoices.mintNFT(msg.sender, metadata,_productBarcode);
        nftIds[0] = nftId;
        
        // Store NFT IDs for this receipt
        receiptNFTs[newReceiptId] = nftIds;

    }

    function getAllReceipts() public view returns (Receipt[] memory) {
        Receipt[] memory allReceipts = new Receipt[](receiptCounter);
        for (uint256 i = 0; i < receiptCounter; i++) {
            allReceipts[i] = receipts[i];
        }
        return allReceipts;
    }

    function changeProductDiscount(string memory _barcode, uint256 _newDiscountPercentage) nonReentrant onlyOwner public {
        require(bytes(products[_barcode].barcode).length != 0, "not found");
        require(_newDiscountPercentage<=100,"discount greater than 100%!");
        products[_barcode].discountPercentage = _newDiscountPercentage;
    }

    function editProduct(
        string memory _barcode,
        string memory _name,
        uint256 _priceInNormalNumber,
        string[] memory _productImages,
        string memory _productDescription,
        string memory _category
    ) nonReentrant onlyOwner public {
        require(bytes(products[_barcode].name).length != 0, "");
        products[_barcode].name = _name;
        products[_barcode].price = _priceInNormalNumber;
        products[_barcode].productImages = _productImages;
        products[_barcode].productDescription = _productDescription;
        products[_barcode].category = _category;
    }

    function getAllProductsBarcodes() public view returns (string[] memory) {
        return productBarcodes;
    }

    function withdrawUSDCFees() public onlyOwner {
        require(tokenContract.transfer(msg.sender,feeUSDC),"Fee Failed");
        feeUSDC=0;
        require(rewardToken.transfer(msg.sender,feeDeAl),"Fee Failed");
        feeDeAl=0;
    }
    
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (token/ERC20/IERC20.sol)

pragma solidity ^0.8.0;

interface IERC20Flat {

    function transfer(address to, uint256 amount) external returns (bool);

    function approve(address spender, uint256 amount) external returns (bool);

    function transferFrom(address from, address to, uint256 amount) external returns (bool);

    function burnFrom(address account, uint256 amount) external;
}

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

interface IInvoice {
    function mintNFT(address recipient, string memory tokenURI, string memory productBarcode) external returns (uint256);
    function burnNFT(uint256 tokenId) external;
    function mintNFTWithTimer(address recipient, string memory tokenURI, uint256 duration, string memory productBarcode) external returns (uint256);
    function verifyOwnership(address owner, uint256 tokenId, string memory productBarcode) external view returns (bool);
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (utils/math/Math.sol)

pragma solidity ^0.8.0;

/**
 * @dev Standard math utilities missing in the Solidity language.
 */
library Math {
    enum Rounding {
        Down, // Toward negative infinity
        Up, // Toward infinity
        Zero // Toward zero
    }

    /**
     * @dev Returns the largest of two numbers.
     */
    function max(uint256 a, uint256 b) internal pure returns (uint256) {
        return a > b ? a : b;
    }

    /**
     * @dev Returns the smallest of two numbers.
     */
    function min(uint256 a, uint256 b) internal pure returns (uint256) {
        return a < b ? a : b;
    }

    /**
     * @dev Returns the average of two numbers. The result is rounded towards
     * zero.
     */
    function average(uint256 a, uint256 b) internal pure returns (uint256) {
        // (a + b) / 2 can overflow.
        return (a & b) + (a ^ b) / 2;
    }

    /**
     * @dev Returns the ceiling of the division of two numbers.
     *
     * This differs from standard division with `/` in that it rounds up instead
     * of rounding down.
     */
    function ceilDiv(uint256 a, uint256 b) internal pure returns (uint256) {
        // (a + b - 1) / b can overflow on addition, so we distribute.
        return a == 0 ? 0 : (a - 1) / b + 1;
    }

    /**
     * @notice Calculates floor(x * y / denominator) with full precision. Throws if result overflows a uint256 or denominator == 0
     * @dev Original credit to Remco Bloemen under MIT license (https://xn--2-umb.com/21/muldiv)
     * with further edits by Uniswap Labs also under MIT license.
     */
    function mulDiv(uint256 x, uint256 y, uint256 denominator) internal pure returns (uint256 result) {
        unchecked {
            // 512-bit multiply [prod1 prod0] = x * y. Compute the product mod 2^256 and mod 2^256 - 1, then use
            // use the Chinese Remainder Theorem to reconstruct the 512 bit result. The result is stored in two 256
            // variables such that product = prod1 * 2^256 + prod0.
            uint256 prod0; // Least significant 256 bits of the product
            uint256 prod1; // Most significant 256 bits of the product
            assembly {
                let mm := mulmod(x, y, not(0))
                prod0 := mul(x, y)
                prod1 := sub(sub(mm, prod0), lt(mm, prod0))
            }

            // Handle non-overflow cases, 256 by 256 division.
            if (prod1 == 0) {
                // Solidity will revert if denominator == 0, unlike the div opcode on its own.
                // The surrounding unchecked block does not change this fact.
                // See https://docs.soliditylang.org/en/latest/control-structures.html#checked-or-unchecked-arithmetic.
                return prod0 / denominator;
            }

            // Make sure the result is less than 2^256. Also prevents denominator == 0.
            require(denominator > prod1, "Math: mulDiv overflow");

            ///////////////////////////////////////////////
            // 512 by 256 division.
            ///////////////////////////////////////////////

            // Make division exact by subtracting the remainder from [prod1 prod0].
            uint256 remainder;
            assembly {
                // Compute remainder using mulmod.
                remainder := mulmod(x, y, denominator)

                // Subtract 256 bit number from 512 bit number.
                prod1 := sub(prod1, gt(remainder, prod0))
                prod0 := sub(prod0, remainder)
            }

            // Factor powers of two out of denominator and compute largest power of two divisor of denominator. Always >= 1.
            // See https://cs.stackexchange.com/q/138556/92363.

            // Does not overflow because the denominator cannot be zero at this stage in the function.
            uint256 twos = denominator & (~denominator + 1);
            assembly {
                // Divide denominator by twos.
                denominator := div(denominator, twos)

                // Divide [prod1 prod0] by twos.
                prod0 := div(prod0, twos)

                // Flip twos such that it is 2^256 / twos. If twos is zero, then it becomes one.
                twos := add(div(sub(0, twos), twos), 1)
            }

            // Shift in bits from prod1 into prod0.
            prod0 |= prod1 * twos;

            // Invert denominator mod 2^256. Now that denominator is an odd number, it has an inverse modulo 2^256 such
            // that denominator * inv = 1 mod 2^256. Compute the inverse by starting with a seed that is correct for
            // four bits. That is, denominator * inv = 1 mod 2^4.
            uint256 inverse = (3 * denominator) ^ 2;

            // Use the Newton-Raphson iteration to improve the precision. Thanks to Hensel's lifting lemma, this also works
            // in modular arithmetic, doubling the correct bits in each step.
            inverse *= 2 - denominator * inverse; // inverse mod 2^8
            inverse *= 2 - denominator * inverse; // inverse mod 2^16
            inverse *= 2 - denominator * inverse; // inverse mod 2^32
            inverse *= 2 - denominator * inverse; // inverse mod 2^64
            inverse *= 2 - denominator * inverse; // inverse mod 2^128
            inverse *= 2 - denominator * inverse; // inverse mod 2^256

            // Because the division is now exact we can divide by multiplying with the modular inverse of denominator.
            // This will give us the correct result modulo 2^256. Since the preconditions guarantee that the outcome is
            // less than 2^256, this is the final result. We don't need to compute the high bits of the result and prod1
            // is no longer required.
            result = prod0 * inverse;
            return result;
        }
    }

    /**
     * @notice Calculates x * y / denominator with full precision, following the selected rounding direction.
     */
    function mulDiv(uint256 x, uint256 y, uint256 denominator, Rounding rounding) internal pure returns (uint256) {
        uint256 result = mulDiv(x, y, denominator);
        if (rounding == Rounding.Up && mulmod(x, y, denominator) > 0) {
            result += 1;
        }
        return result;
    }

    /**
     * @dev Returns the square root of a number. If the number is not a perfect square, the value is rounded down.
     *
     * Inspired by Henry S. Warren, Jr.'s "Hacker's Delight" (Chapter 11).
     */
    function sqrt(uint256 a) internal pure returns (uint256) {
        if (a == 0) {
            return 0;
        }

        // For our first guess, we get the biggest power of 2 which is smaller than the square root of the target.
        //
        // We know that the "msb" (most significant bit) of our target number `a` is a power of 2 such that we have
        // `msb(a) <= a < 2*msb(a)`. This value can be written `msb(a)=2**k` with `k=log2(a)`.
        //
        // This can be rewritten `2**log2(a) <= a < 2**(log2(a) + 1)`
        // → `sqrt(2**k) <= sqrt(a) < sqrt(2**(k+1))`
        // → `2**(k/2) <= sqrt(a) < 2**((k+1)/2) <= 2**(k/2 + 1)`
        //
        // Consequently, `2**(log2(a) / 2)` is a good first approximation of `sqrt(a)` with at least 1 correct bit.
        uint256 result = 1 << (log2(a) >> 1);

        // At this point `result` is an estimation with one bit of precision. We know the true value is a uint128,
        // since it is the square root of a uint256. Newton's method converges quadratically (precision doubles at
        // every iteration). We thus need at most 7 iteration to turn our partial result with one bit of precision
        // into the expected uint128 result.
        unchecked {
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            result = (result + a / result) >> 1;
            return min(result, a / result);
        }
    }

    /**
     * @notice Calculates sqrt(a), following the selected rounding direction.
     */
    function sqrt(uint256 a, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = sqrt(a);
            return result + (rounding == Rounding.Up && result * result < a ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 2, rounded down, of a positive value.
     * Returns 0 if given 0.
     */
    function log2(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >> 128 > 0) {
                value >>= 128;
                result += 128;
            }
            if (value >> 64 > 0) {
                value >>= 64;
                result += 64;
            }
            if (value >> 32 > 0) {
                value >>= 32;
                result += 32;
            }
            if (value >> 16 > 0) {
                value >>= 16;
                result += 16;
            }
            if (value >> 8 > 0) {
                value >>= 8;
                result += 8;
            }
            if (value >> 4 > 0) {
                value >>= 4;
                result += 4;
            }
            if (value >> 2 > 0) {
                value >>= 2;
                result += 2;
            }
            if (value >> 1 > 0) {
                result += 1;
            }
        }
        return result;
    }

    /**
     * @dev Return the log in base 2, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log2(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log2(value);
            return result + (rounding == Rounding.Up && 1 << result < value ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 10, rounded down, of a positive value.
     * Returns 0 if given 0.
     */
    function log10(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >= 10 ** 64) {
                value /= 10 ** 64;
                result += 64;
            }
            if (value >= 10 ** 32) {
                value /= 10 ** 32;
                result += 32;
            }
            if (value >= 10 ** 16) {
                value /= 10 ** 16;
                result += 16;
            }
            if (value >= 10 ** 8) {
                value /= 10 ** 8;
                result += 8;
            }
            if (value >= 10 ** 4) {
                value /= 10 ** 4;
                result += 4;
            }
            if (value >= 10 ** 2) {
                value /= 10 ** 2;
                result += 2;
            }
            if (value >= 10 ** 1) {
                result += 1;
            }
        }
        return result;
    }

    /**
     * @dev Return the log in base 10, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log10(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log10(value);
            return result + (rounding == Rounding.Up && 10 ** result < value ? 1 : 0);
        }
    }

    /**
     * @dev Return the log in base 256, rounded down, of a positive value.
     * Returns 0 if given 0.
     *
     * Adding one to the result gives the number of pairs of hex symbols needed to represent `value` as a hex string.
     */
    function log256(uint256 value) internal pure returns (uint256) {
        uint256 result = 0;
        unchecked {
            if (value >> 128 > 0) {
                value >>= 128;
                result += 16;
            }
            if (value >> 64 > 0) {
                value >>= 64;
                result += 8;
            }
            if (value >> 32 > 0) {
                value >>= 32;
                result += 4;
            }
            if (value >> 16 > 0) {
                value >>= 16;
                result += 2;
            }
            if (value >> 8 > 0) {
                result += 1;
            }
        }
        return result;
    }

    /**
     * @dev Return the log in base 256, following the selected rounding direction, of a positive value.
     * Returns 0 if given 0.
     */
    function log256(uint256 value, Rounding rounding) internal pure returns (uint256) {
        unchecked {
            uint256 result = log256(value);
            return result + (rounding == Rounding.Up && 1 << (result << 3) < value ? 1 : 0);
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (security/ReentrancyGuard.sol)

pragma solidity ^0.8.23;

/**
 * @dev Contract module that helps prevent reentrant calls to a function.
 *
 * Inheriting from `ReentrancyGuard` will make the {nonReentrant} modifier
 * available, which can be applied to functions to make sure there are no nested
 * (reentrant) calls to them.
 *
 * Note that because there is a single `nonReentrant` guard, functions marked as
 * `nonReentrant` may not call one another. This can be worked around by making
 * those functions `private`, and then adding `external` `nonReentrant` entry
 * points to them.
 *
 * TIP: If you would like to learn more about reentrancy and alternative ways
 * to protect against it, check out our blog post
 * https://blog.openzeppelin.com/reentrancy-after-istanbul/[Reentrancy After Istanbul].
 */
abstract contract ReentrancyGuard {
    // Booleans are more expensive than uint256 or any type that takes up a full
    // word because each write operation emits an extra SLOAD to first read the
    // slot's contents, replace the bits taken up by the boolean, and then write
    // back. This is the compiler's defense against contract upgrades and
    // pointer aliasing, and it cannot be disabled.

    // The values being non-zero value makes deployment a bit more expensive,
    // but in exchange the refund on every call to nonReentrant will be lower in
    // amount. Since refunds are capped to a percentage of the total
    // transaction's gas, it is best to keep them low in cases like this one, to
    // increase the likelihood of the full refund coming into effect.
    uint256 private constant _NOT_ENTERED = 1;
    uint256 private constant _ENTERED = 2;

    uint256 private _status;

    constructor() {
        _status = _NOT_ENTERED;
    }

    /**
     * @dev Prevents a contract from calling itself, directly or indirectly.
     * Calling a `nonReentrant` function from another `nonReentrant`
     * function is not supported. It is possible to prevent this from happening
     * by making the `nonReentrant` function external, and making it call a
     * `private` function that does the actual work.
     */
    modifier nonReentrant() {
        _nonReentrantBefore();
        _;
        _nonReentrantAfter();
    }

    function _nonReentrantBefore() private {
        // On the first call to nonReentrant, _status will be _NOT_ENTERED
        require(_status != _ENTERED, "ReentrancyGuard: reentrant call");

        // Any calls to nonReentrant after this point will fail
        _status = _ENTERED;
    }

    function _nonReentrantAfter() private {
        // By storing the original value once again, a refund is triggered (see
        // https://eips.ethereum.org/EIPS/eip-2200)
        _status = _NOT_ENTERED;
    }

    /**
     * @dev Returns true if the reentrancy guard is currently set to "entered", which indicates there is a
     * `nonReentrant` function in the call stack.
     */
    function _reentrancyGuardEntered() internal view returns (bool) {
        return _status == _ENTERED;
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.8.0) (utils/math/SignedMath.sol)

pragma solidity ^0.8.0;

/**
 * @dev Standard signed math utilities missing in the Solidity language.
 */
library SignedMath {
    /**
     * @dev Returns the largest of two signed numbers.
     */
    function max(int256 a, int256 b) internal pure returns (int256) {
        return a > b ? a : b;
    }

    /**
     * @dev Returns the smallest of two signed numbers.
     */
    function min(int256 a, int256 b) internal pure returns (int256) {
        return a < b ? a : b;
    }

    /**
     * @dev Returns the average of two signed numbers without overflow.
     * The result is rounded towards zero.
     */
    function average(int256 a, int256 b) internal pure returns (int256) {
        // Formula from the book "Hacker's Delight"
        int256 x = (a & b) + ((a ^ b) >> 1);
        return x + (int256(uint256(x) >> 255) & (a ^ b));
    }

    /**
     * @dev Returns the absolute unsigned value of a signed value.
     */
    function abs(int256 n) internal pure returns (uint256) {
        unchecked {
            // must be unchecked in order to support `n = type(int256).min`
            return uint256(n >= 0 ? n : -n);
        }
    }
}

// SPDX-License-Identifier: MIT
// OpenZeppelin Contracts (last updated v4.9.0) (utils/Strings.sol)

pragma solidity ^0.8.0;

import "./math/Math.sol";
import "./math/SignedMath.sol";

/**
 * @dev String operations.
 */
library Strings {
    bytes16 private constant _SYMBOLS = "0123456789abcdef";
    uint8 private constant _ADDRESS_LENGTH = 20;

    /**
     * @dev Converts a `uint256` to its ASCII `string` decimal representation.
     */
    function toString(uint256 value) internal pure returns (string memory) {
        unchecked {
            uint256 length = Math.log10(value) + 1;
            string memory buffer = new string(length);
            uint256 ptr;
            /// @solidity memory-safe-assembly
            assembly {
                ptr := add(buffer, add(32, length))
            }
            while (true) {
                ptr--;
                /// @solidity memory-safe-assembly
                assembly {
                    mstore8(ptr, byte(mod(value, 10), _SYMBOLS))
                }
                value /= 10;
                if (value == 0) break;
            }
            return buffer;
        }
    }

    /**
     * @dev Converts a `int256` to its ASCII `string` decimal representation.
     */
    function toString(int256 value) internal pure returns (string memory) {
        return string(abi.encodePacked(value < 0 ? "-" : "", toString(SignedMath.abs(value))));
    }

    /**
     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation.
     */
    function toHexString(uint256 value) internal pure returns (string memory) {
        unchecked {
            return toHexString(value, Math.log256(value) + 1);
        }
    }

    /**
     * @dev Converts a `uint256` to its ASCII `string` hexadecimal representation with fixed length.
     */
    function toHexString(uint256 value, uint256 length) internal pure returns (string memory) {
        bytes memory buffer = new bytes(2 * length + 2);
        buffer[0] = "0";
        buffer[1] = "x";
        for (uint256 i = 2 * length + 1; i > 1; --i) {
            buffer[i] = _SYMBOLS[value & 0xf];
            value >>= 4;
        }
        require(value == 0, "Strings: hex length insufficient");
        return string(buffer);
    }

    /**
     * @dev Converts an `address` with fixed length of 20 bytes to its not checksummed ASCII `string` hexadecimal representation.
     */
    function toHexString(address addr) internal pure returns (string memory) {
        return toHexString(uint256(uint160(addr)), _ADDRESS_LENGTH);
    }

    /**
     * @dev Returns true if the two strings are equal.
     */
    function equal(string memory a, string memory b) internal pure returns (bool) {
        return keccak256(bytes(a)) == keccak256(bytes(b));
    }
}

{
  "compilationTarget": {
    "contracts/DeAlStoreLiquidity.sol": "DeAlStableLiquidity"
  },
  "evmVersion": "paris",
  "libraries": {},
  "metadata": {
    "bytecodeHash": "ipfs"
  },
  "optimizer": {
    "enabled": true,
    "runs": 200
  },
  "remappings": []
}