added test cases

nars · nars · commit 51c2422d6498 · 2015-02-02T16:07:37.000+05:30
diff --git a/UnionFindAlgo/.classpath b/UnionFindAlgo/.classpath
@@ -2,5 +2,6 @@
 <classpath>
 	<classpathentry kind="src" path="src"/>
 	<classpathentry kind="con" path="org.eclipse.jdt.launching.JRE_CONTAINER/org.eclipse.jdt.internal.debug.ui.launcher.StandardVMType/JavaSE-1.7"/>
+	<classpathentry kind="con" path="org.eclipse.jdt.junit.JUNIT_CONTAINER/4"/>
 	<classpathentry kind="output" path="bin"/>
 </classpath>
diff --git a/UnionFindAlgo/src/eager/QuickFind/RuntimeArray.java b/UnionFindAlgo/src/eager/QuickFind/RuntimeArray.java
@@ -24,10 +24,14 @@ private static int[] initializeInput() {
 			System.out.println("invlaid integer");
 		}
 		int[] inputAr = new int[n];
+		initSimpleUnionFind(inputAr);
+		return inputAr;
+	}
+
+	public static void initSimpleUnionFind(int[] inputAr) {
 		for (int i = 0; i < inputAr.length; i++) {
 			inputAr[i] = i;
 		}
-		return inputAr;
 	}
 
 	public static void main(String[] args) {
@@ -42,7 +46,7 @@ public static void main(String[] args) {
 				union(p, q);
 			}
 		}while(!isConnected);
-			scan.close();
+		scan.close();
 		for (int i = 0; i < inputArray.length; i++) {
 			System.out.println(inputArray[i]);
 		}
@@ -62,4 +66,12 @@ public static void union(int p, int q)
 		}
 	}
 
+	public static int[] getInputArray() {
+		return inputArray;
+	}
+
+	public static void setInputArray(int[] inputArray) {
+		RuntimeArray.inputArray = inputArray;
+	}
+
 }
diff --git a/UnionFindAlgo/src/eager/test/SimpleUnionFindUnitTest.java b/UnionFindAlgo/src/eager/test/SimpleUnionFindUnitTest.java
@@ -0,0 +1,32 @@
+package eager.test;
+
+import static org.junit.Assert.*;
+import org.junit.Before;
+import org.junit.Test;
+import eager.QuickFind.RuntimeArray;
+
+public class SimpleUnionFindUnitTest {
+
+	@Before
+	public void setUp() throws Exception {
+		int[] in = new int[4];
+		RuntimeArray.initSimpleUnionFind(in);
+		RuntimeArray.setInputArray(in);
+	}
+
+	@Test
+	public void testFind() {
+		assertEquals(false, RuntimeArray.find(0, 1));
+	}
+	@Test
+	public void testUnionFalseCase() {
+		assertNotEquals(RuntimeArray.getInputArray()[0], RuntimeArray.getInputArray()[1]);
+	}
+	@Test
+	public void testUnion() {
+		RuntimeArray.union(0, 1);
+		assertEquals(RuntimeArray.getInputArray()[0], RuntimeArray.getInputArray()[1]);
+	}
+
+
+}

Original file line number	Diff line number	Diff line change
`@@ -24,10 +24,14 @@ private static int[] initializeInput() {`
`24`	`24`	`System.out.println("invlaid integer");`
`25`	`25`	`}`
`26`	`26`	`int[] inputAr = new int[n];`
	`27`	`+ initSimpleUnionFind(inputAr);`
	`28`	`+ return inputAr;`
	`29`	`+ }`
	`30`	`+`
	`31`	`+ public static void initSimpleUnionFind(int[] inputAr) {`
`27`	`32`	`for (int i = 0; i < inputAr.length; i++) {`
`28`	`33`	`inputAr[i] = i;`
`29`	`34`	`}`
`30`		`- return inputAr;`
`31`	`35`	`}`
`32`	`36`
`33`	`37`	`public static void main(String[] args) {`
`@@ -42,7 +46,7 @@ public static void main(String[] args) {`
`42`	`46`	`union(p, q);`
`43`	`47`	`}`
`44`	`48`	`}while(!isConnected);`
`45`		`- scan.close();`
	`49`	`+ scan.close();`
`46`	`50`	`for (int i = 0; i < inputArray.length; i++) {`
`47`	`51`	`System.out.println(inputArray[i]);`
`48`	`52`	`}`
`@@ -62,4 +66,12 @@ public static void union(int p, int q)`
`62`	`66`	`}`
`63`	`67`	`}`
`64`	`68`
	`69`	`+ public static int[] getInputArray() {`
	`70`	`+ return inputArray;`
	`71`	`+ }`
	`72`	`+`
	`73`	`+ public static void setInputArray(int[] inputArray) {`
	`74`	`+ RuntimeArray.inputArray = inputArray;`
	`75`	`+ }`
	`76`	`+`
`65`	`77`	`}`