run prettier

Author: Krishang Nadgauda

contracts/lib/Strings2.sol

@@ -1,8 +1,6 @@
-
 pragma solidity ^0.8.0;
 
 library Strings2 {
-
     ///@dev converts bytes array to its ASCII hex string representation
     /// TODO: Definitely more efficient way to do this by processing multiple (16?) bytes at once
     /// but really a helper function for the tests, efficiency not key.
@@ -13,13 +11,13 @@ library Strings2 {
         hex_buffer[0] = "0";
         hex_buffer[1] = "x";
 
-        uint pos = 2;
+        uint256 pos = 2;
         uint256 length = input.length;
-        for (uint i = 0; i < length; ++i) {
-            uint _byte = uint8(input[i]);
+        for (uint256 i = 0; i < length; ++i) {
+            uint256 _byte = uint8(input[i]);
             hex_buffer[pos++] = symbols[_byte >> 4];
             hex_buffer[pos++] = symbols[_byte & 0xf];
         }
         return string(hex_buffer);
     }
-}
+}

src/test/SignatureDrop.t.sol

@@ -11,7 +11,6 @@ import "@openzeppelin/contracts/utils/Strings.sol";
 import "contracts/lib/Strings2.sol";
 
 contract SignatureDropTest is BaseTest {
-
     using StringsUpgradeable for uint256;
     using Strings2 for bytes;
 
@@ -71,7 +70,7 @@ contract SignatureDropTest is BaseTest {
         assertEq(nextTokenIdToMintBefore + amountToLazyMint, sigdrop.nextTokenIdToMint());
         assertEq(nextTokenIdToMintBefore + amountToLazyMint, batchId);
 
-        for(uint256 i = 0; i < amountToLazyMint; i += 1) {
+        for (uint256 i = 0; i < amountToLazyMint; i += 1) {
             string memory uri = sigdrop.tokenURI(i);
             console.log(uri);
             assertEq(uri, string(abi.encodePacked(baseURI, i.toString())));
@@ -96,7 +95,7 @@ contract SignatureDropTest is BaseTest {
         assertEq(nextTokenIdToMintBefore + amountToLazyMint, sigdrop.nextTokenIdToMint());
         assertEq(nextTokenIdToMintBefore + amountToLazyMint, batchId);
 
-        for(uint256 i = 0; i < amountToLazyMint; i += 1) {
+        for (uint256 i = 0; i < amountToLazyMint; i += 1) {
             string memory uri = sigdrop.tokenURI(1);
             assertEq(uri, string(abi.encodePacked(baseURI, "0")));
         }
@@ -150,7 +149,6 @@ contract SignatureDropTest is BaseTest {
      *  note: Fuzz testing state changes; lazy mint a batch of tokens with no encrypted base URI.
      */
     function test_fuzz_lazyMint_noEncryptedURI(uint256 x) public {
-
         vm.assume(x > 0);
 
         uint256 amountToLazyMint = x;
@@ -166,10 +164,10 @@ contract SignatureDropTest is BaseTest {
         assertEq(nextTokenIdToMintBefore + amountToLazyMint, batchId);
 
         string memory uri = sigdrop.tokenURI(0);
-        assertEq(uri, string(abi.encodePacked(baseURI, uint(0).toString())));
+        assertEq(uri, string(abi.encodePacked(baseURI, uint256(0).toString())));
 
-        uri = sigdrop.tokenURI(x-1);
-        assertEq(uri, string(abi.encodePacked(baseURI, uint(x-1).toString())));
+        uri = sigdrop.tokenURI(x - 1);
+        assertEq(uri, string(abi.encodePacked(baseURI, uint256(x - 1).toString())));
 
         /**
          *  note: this loop takes too long to run with fuzz tests.
@@ -204,7 +202,7 @@ contract SignatureDropTest is BaseTest {
         string memory uri = sigdrop.tokenURI(0);
         assertEq(uri, string(abi.encodePacked(baseURI, "0")));
 
-        uri = sigdrop.tokenURI(x-1);
+        uri = sigdrop.tokenURI(x - 1);
         assertEq(uri, string(abi.encodePacked(baseURI, "0")));
 
         /**
@@ -251,15 +249,15 @@ contract SignatureDropTest is BaseTest {
         bytes memory encryptedURI = sigdrop.encryptDecrypt(secretURI, key);
         sigdrop.lazyMint(amountToLazyMint, placeholderURI, encryptedURI);
 
-        for(uint256 i = 0; i < amountToLazyMint; i += 1) {
+        for (uint256 i = 0; i < amountToLazyMint; i += 1) {
             string memory uri = sigdrop.tokenURI(i);
             assertEq(uri, string(abi.encodePacked(placeholderURI, "0")));
         }
 
         string memory revealedURI = sigdrop.reveal(0, key);
         assertEq(revealedURI, string(secretURI));
 
-        for(uint256 i = 0; i < amountToLazyMint; i += 1) {
+        for (uint256 i = 0; i < amountToLazyMint; i += 1) {
             string memory uri = sigdrop.tokenURI(i);
             assertEq(uri, string(abi.encodePacked(secretURI, i.toString())));
         }
@@ -382,7 +380,6 @@ contract SignatureDropTest is BaseTest {
 
         // Test with ERC20 currency
         {
-
             uint256 totalSupplyBefore = sigdrop.totalSupply();
 
             bytes memory encodedRequest = abi.encode(
@@ -648,7 +645,10 @@ contract SignatureDropTest is BaseTest {
             address owner = sigdrop.ownerOf(0);
             assertEq(deployerSigner, owner);
 
-            assertEq(currencyBalBefore - mintrequest.pricePerToken * mintrequest.quantity, erc20.balanceOf(deployerSigner));
+            assertEq(
+                currencyBalBefore - mintrequest.pricePerToken * mintrequest.quantity,
+                erc20.balanceOf(deployerSigner)
+            );
 
             vm.expectRevert(abi.encodeWithSignature("OwnerQueryForNonexistentToken()"));
             owner = sigdrop.ownerOf(1);

src/test/scripts/merkleTree.js

@@ -1,22 +1,22 @@
-const { MerkleTree } = require('merkletreejs')
-const SHA256 = require('crypto-js/sha256')
+const { MerkleTree } = require("merkletreejs");
+const SHA256 = require("crypto-js/sha256");
 
-const tree = async (leaves) => {
-    // console.log("leaves: ", leaves);
+const tree = async leaves => {
+  // console.log("leaves: ", leaves);
 
-    const leaves = ['a', 'b', 'c'].map(x => SHA256(x))
-    const tree = new MerkleTree(leaves, SHA256)
-    const root = tree.getRoot().toString('hex')
-    const leaf = SHA256('a')
-    const proof = tree.getProof(leaf)
-    console.log(tree.verify(proof, leaf, root)) // true
-    // return proof
+  const leaves = ["a", "b", "c"].map(x => SHA256(x));
+  const tree = new MerkleTree(leaves, SHA256);
+  const root = tree.getRoot().toString("hex");
+  const leaf = SHA256("a");
+  const proof = tree.getProof(leaf);
+  console.log(tree.verify(proof, leaf, root)); // true
+  // return proof
 
-    const badLeaves = ['a', 'x', 'c'].map(x => SHA256(x))
-    const badTree = new MerkleTree(badLeaves, SHA256)
-    const badLeaf = SHA256('x')
-    const badProof = tree.getProof(badLeaf)
-    console.log(tree.verify(badProof, leaf, root)) // false
-}
+  const badLeaves = ["a", "x", "c"].map(x => SHA256(x));
+  const badTree = new MerkleTree(badLeaves, SHA256);
+  const badLeaf = SHA256("x");
+  const badProof = tree.getProof(badLeaf);
+  console.log(tree.verify(badProof, leaf, root)); // false
+};
 
-tree();
+tree();