From dff8ede2d55d164cf9a7784c0dbdc1ff7699741f Mon Sep 17 00:00:00 2001
From: MoonKyu Song <mksong@parametacorp.com>
Date: Tue, 8 Aug 2023 16:47:24 +0900
Subject: [PATCH] Remove unused stuff(method,throws,variables)

---
 .../btp/lib/MerkleTreeAccumulatorTest.java    | 25 +++----------------
 1 file changed, 4 insertions(+), 21 deletions(-)

diff --git a/lib/src/test/java/foundation/icon/btp/lib/MerkleTreeAccumulatorTest.java b/lib/src/test/java/foundation/icon/btp/lib/MerkleTreeAccumulatorTest.java
index bab5dcf..cf7443f 100644
--- a/lib/src/test/java/foundation/icon/btp/lib/MerkleTreeAccumulatorTest.java
+++ b/lib/src/test/java/foundation/icon/btp/lib/MerkleTreeAccumulatorTest.java
@@ -53,28 +53,11 @@ private static byte[] getHash(int height, int offset) {
         return hashes[idx+offset];
     }
 
-    private static byte[][] getProof(int depth, int index) {
-        var proofs = new ArrayList<byte[]>();
-        for (int i=0 ; i<depth ; i++, index/=2) {
-            if (index%2 == 0) {
-                proofs.add(getHash(i, index+1));
-            } else {
-                proofs.add(getHash(i, index-1));
-            }
-        }
-        var ret = new byte[proofs.size()][];
-        for (int i=0 ; i<ret.length ; i++) {
-            ret[i] = proofs.get(i);
-        }
-        return ret;
-    }
-
     private static byte[][] getProofAt(int height, int index) {
         if (height > HASH_COUNT || index <0 || index >= height ) {
             throw new IllegalArgumentException("InvalidHeightOrIndex");
         }
         var proofs = new ArrayList<byte[]>();
-        int covered = 2;
         for (int i=0 ; (index|1)+1<=height ; i++, height/=2, index/=2) {
             if (index%2 == 0) {
                 proofs.add(getHash(i, index+1));
@@ -90,7 +73,7 @@ private static byte[][] getProofAt(int height, int index) {
     }
 
     @Test
-    public void testBasic() throws Exception {
+    public void testBasic() {
         var mta = new MerkleTreeAccumulator();
         for (int i=0 ; i<HASH_COUNT ; i++) {
             mta.add(hashes[i]);
@@ -102,7 +85,7 @@ public void testBasic() throws Exception {
     }
 
     @Test
-    public void testForAllSize() throws Exception {
+    public void testForAllSize() {
         var mta = new MerkleTreeAccumulator();
         for (int i=0 ; i<HASH_COUNT ; i++) {
             mta.add(hashes[i]);
@@ -110,8 +93,8 @@ public void testForAllSize() throws Exception {
                 var proof = getProofAt((int)mta.getHeight(), j);
                 try {
                     mta.verify(proof, hashes[j], j, mta.getHeight());
-                } catch (Exception ex) {
-                    throw new Exception("Invalid("+j+"/"+(i+1)+")", ex);
+                } catch (MTAException ex) {
+                    throw new MTAException("Invalid("+j+"/"+(i+1)+")", ex);
                 }
             }
             int k = i+1;