ArrayUtilTest.java

package com.coderising.array;

import static org.junit.Assert.*;
import junit.framework.Assert;

import org.junit.After;
import org.junit.Before;
import org.junit.Test;

import sun.misc.Perf.GetPerfAction;

public class ArrayUtilTest {

	@Before
	public void setUp() throws Exception {
	}

	@After
	public void tearDown() throws Exception {
	}

	@Test
	public void testReverseArray() {
		int[] a = {7,9,30,3,5};
		int[] b = a.clone();
		ArrayUtil.reverseArray(a);
		for (int i = 0; i < b.length; i ++) {
			Assert.assertEquals(b[i], a[b.length - 1 - i]);
		}
		
	}

	@Test
	public void testRemoveZero() {
		int oldArr[]={1,3,4,5,0,0,6,6,0,5,4,7,6,7,0,5};
		int[] result = {1,3,4,5,6,6,5,4,7,6,7,5};
		int[] removeZero = ArrayUtil.removeZero(oldArr);
		assertArrayEquals(result, removeZero);
	}

	@Test
	public void testMerge() {
		 int[] a1 = {3,5,7,8};
		 int[] a2 = {4,5,6,7};
		 int[] a3 = {3,4,5,6,7,8};
		 int[] merge = ArrayUtil.merge(a1, a2);
		 assertArrayEquals(a3, merge);
	}

	@Test
	public void testGrow() {
		int[] oldArray = {2,3,6};
		int size = 3;
		int[] growedArr = {2,3,6,0,0,0};
		assertArrayEquals(growedArr, ArrayUtil.grow(oldArray, size));
	}

	@Test
	public void testFibonacci() {
		int[] fibonacci = ArrayUtil.fibonacci(15);
		for (int i : fibonacci) {
			System.out.println(i);
		}
	}

	@Test
	public void testGetPrimes() {
		int[] primes = ArrayUtil.getPrimes(3);
		for (int i : primes) {
			System.out.println(i);
		}
	}

	@Test
	public void testGetPerfectNumbers() {
		int[] perfectNumbers = ArrayUtil.getPerfectNumbers(10000);
		int[] expecteds = {6,28,496,8128};
		assertArrayEquals(expecteds, perfectNumbers);
		for (int i : perfectNumbers) {
			System.out.println(i);
		}
	}

	@Test
	public void testJoin() {
		int[] arr = {3,4,5};
		String join = ArrayUtil.join(arr, "-");
		assertEquals("3-4-5", join);
	}

}