finished lab

src/main/java/com/zipcodewilmington/arrayutility/ArrayUtility.java

@@ -1,7 +1,92 @@
 package com.zipcodewilmington.arrayutility;
 
+import java.lang.reflect.Array;
+import java.util.*;
 /**
  * Created by leon on 3/6/18.
  */
-public class ArrayUtility {
+public class ArrayUtility<T extends Object> {
+
+    private T[] arr;
+
+    public ArrayUtility(T[] arr) {
+        this.arr = arr;
+    }
+
+    private T[] merge(T[] arr1, T[] arr2){
+        T[] result = Arrays.copyOf(arr1, arr1.length + arr2.length);
+        for(int i = 0; i < arr2.length; i ++){
+            result[arr1.length + i] = arr2[i];
+        }
+        return result;
+    }
+
+    private void goThroughArray(Map<T, Integer> count, T[] arr) {
+        for(T jawnathan : arr){
+            if(!count.containsKey(jawnathan)){
+                count.put(jawnathan, 1);
+            } else {
+                Integer amount = count.get(jawnathan);
+                amount ++;
+                count.put(jawnathan, amount);
+            }
+        }
+    }
+
+    public Integer countDuplicatesInMerge(T[] arrayToMerge, T valueToEvaluate) {
+        T[] array = merge(arr, arrayToMerge);
+        Integer count = 0;
+        for(T jawn: array){
+            if(jawn.equals(valueToEvaluate)){
+                count ++;
+            }
+        }
+        return count;
+    }
+
+    public T getMostCommonFromMerge(T[] arrayToMerge) {
+        T[] newArr = merge(arr, arrayToMerge);
+        Map<T, Integer> count = new HashMap<>();
+
+        goThroughArray(count, newArr);
+        return countGreatestOccurMap(count);
+    }
+
+    public T countGreatestOccurMap(Map<T, Integer> map){
+        int max = 0;
+        T result = null;
+
+        for(T key : map.keySet()){
+            if(map.get(key) > max){
+                max = map.get(key);
+                result = key;
+            }
+        }
+        return result;
+    }
+
+    public Integer getNumberOfOccurrences(T valueToEvaluate) {
+        Map<T, Integer> count = new HashMap<>();
+
+        goThroughArray(count, arr);
+        return count.get(valueToEvaluate);
+    }
+
+
+    public T[] removeValue(T valueToRemove) {
+        Integer occ = getNumberOfOccurrences(valueToRemove);
+        T[] newArr = (T[]) Array.newInstance(this.arr.getClass().getComponentType(), this.arr.length - occ );
+        int count = 0;
+        for(T jawnnyboi : arr){
+            if(jawnnyboi.equals(valueToRemove)){
+                continue;
+            }
+              else{
+                newArr[count] = jawnnyboi;
+                count ++;
+            }
+        }
+        return newArr;
+    }
 }
+

src/test/java/com/zipcodewilmington/arrayutility/RemoveValueTest.java

@@ -1,6 +1,6 @@
 package com.zipcodewilmington.arrayutility;
 
-import com.zipcodewilmington.UnitTestingUtils;
+import com.zipcodewilmington.arrayutility.UnitTestingUtils;
 import org.junit.Test;
 
 /**