newtest case added Bheeshma

src/palindrom/palindrom.java

@@ -1,103 +1,104 @@
-package palindrom;
-import java.io.EOFException;
-import java.util.Scanner;
-
-public class palindrom {
-	public boolean isPal(int a){
-		int b,c, e;
-		boolean isPolindrome = false;
-		//these are the changes made by me 
-		//The changes has no effect on the program 
-		if(a > 9999 && a < 100000)
-        {           
-				b = a / 10000;
-                a = a % 10000;
-                c = a / 1000;
-                a = a % 1000;
-                a = a % 100;
-                e = a / 10;
-                a = a % 10;
-
-                if (b == a && c == e)
-                {
-                    isPolindrome = true;
-                }
-                    else
-                    	 isPolindrome = false;
-
-    }  
-   if(a>999 && a<10000)
-   {
-
-    b = a / 1000;
-    a = a % 1000;
-    c = a / 100;
-    a = a % 100;
-    e = a / 10;
-    a = a % 10;
-    if (b == a && c == e)
-                {
-    	           isPolindrome = true;
-                }
-                    else
-                    	 isPolindrome = false;
-	}              
-    if(a>99 && a<1000)
-    {
-
-		b = a / 100;
-    	a = a % 100;
-    	a = a % 10;
-    	if (b == a)
-                {
-    		             isPolindrome = true;
-                }
-                    else
-                    	 isPolindrome = false;
-    }
-    if(a>9 && a<100)
-	{
-
-		b = a / 10;
-		a = a % 10;
-			if (b == a)
-                {
-				        isPolindrome = true;
-                }
-                    else
-                    	 isPolindrome = false;
-	} 
-    return isPolindrome;
-
-	}
-	public static void main(String[] args) {
-	//String s = new String();
-		int n;
-		System.out.println("Input number of input data ");
-        Scanner scanner = new Scanner(System.in);
-        n = scanner.nextInt();
-        int [] mas;
-        mas = new int[n];
-        System.out.println("Input value:");
-        for(int i=0;i<n;i++){
-            mas[i] = scanner.nextInt();
-
-        }
-        palindrom obj = new palindrom();
-        System.out.println("Palindromes are: ");
-        for(int i=0;i<n;i++)
-        { 
-        	if(obj.isPal(mas[i]))
-        	{
-        		System.out.print(mas[i] + " ");
-        		}
-        	}
-        scanner.close();
-
-
-}
-
-        }
-
-
-
+package palindrom;
+import java.io.EOFException;
+import java.util.Scanner;
+
+public class palindrom {
+	public boolean isPal(int a){
+		int b,c, e;
+		boolean isPolindrome = false;
+		//these are the changes made by me 
+		// I have created a new branch
+		//The changes has no effect on the program 
+		if(a > 9999 && a < 100000)
+        {           
+				b = a / 10000;
+                a = a % 10000;
+                c = a / 1000;
+                a = a % 1000;
+                a = a % 100;
+                e = a / 10;
+                a = a % 10;
+
+                if (b == a && c == e)
+                {
+                    isPolindrome = true;
+                }
+                    else
+                    	 isPolindrome = false;
+
+    }  
+   if(a>999 && a<10000)
+   {
+
+    b = a / 1000;
+    a = a % 1000;
+    c = a / 100;
+    a = a % 100;
+    e = a / 10;
+    a = a % 10;
+    if (b == a && c == e)
+                {
+    	           isPolindrome = true;
+                }
+                    else
+                    	 isPolindrome = false;
+	}              
+    if(a>99 && a<1000)
+    {
+
+		b = a / 100;
+    	a = a % 100;
+    	a = a % 10;
+    	if (b == a)
+                {
+    		             isPolindrome = true;
+                }
+                    else
+                    	 isPolindrome = false;
+    }
+    if(a>9 && a<100)
+	{
+
+		b = a / 10;
+		a = a % 10;
+			if (b == a)
+                {
+				        isPolindrome = true;
+                }
+                    else
+                    	 isPolindrome = false;
+	} 
+    return isPolindrome;
+
+	}
+	public static void main(String[] args) {
+	//String s = new String();
+		int n;
+		System.out.println("Input number of input data ");
+        Scanner scanner = new Scanner(System.in);
+        n = scanner.nextInt();
+        int [] mas;
+        mas = new int[n];
+        System.out.println("Input value:");
+        for(int i=0;i<n;i++){
+            mas[i] = scanner.nextInt();
+
+        }
+        palindrom obj = new palindrom();
+        System.out.println("Palindromes are: ");
+        for(int i=0;i<n;i++)
+        { 
+        	if(obj.isPal(mas[i]))
+        	{
+        		System.out.print(mas[i] + " ");
+        		}
+        	}
+        scanner.close();
+
+
+}
+
+        }
+
+
+

untest/palindrom/AllTests.java

@@ -0,0 +1,11 @@
+package palindrom;
+
+import org.junit.runner.RunWith;
+import org.junit.runners.Suite;
+import org.junit.runners.Suite.SuiteClasses;
+
+@RunWith(Suite.class)
+@SuiteClasses({ palindromTest.class, palindromTestTest.class })
+public class AllTests {
+
+}

untest/palindrom/palindromTest.java

@@ -1,31 +1,31 @@
-package palindrom;
-
-import static org.junit.Assert.*;
-
-import org.junit.*;
-
-
-public class palindromTest {
-
-	@BeforeClass
-	public static void beforeClass(){
-		System.out.println("Before PalindromTest.class");
-	}
-	@AfterClass
-	
-	public static void AfterClass(){
-		System.out.println("After PalindromTest.class");
-	}
-	@Before
-	public  void initTest(){
-	
-	}	
-	@Test
-	public void testIsPal() {
-		
-		palindrom test = new palindrom();
-		assertTrue(test.isPal(1221));
-		for(int i=0;i<10;i++)
-		assertFalse(test.isPal(i));
-	}
-}
+package palindrom;
+
+import static org.junit.Assert.*;
+
+import org.junit.*;
+
+
+public class palindromTest {
+
+	@BeforeClass
+	public static void beforeClass(){
+		System.out.println("Before PalindromTest.class");
+	}
+	@AfterClass
+
+	public static void AfterClass(){
+		System.out.println("After PalindromTest.class");
+	}
+	@Before
+	public  void initTest(){
+
+	}	
+	@Test
+	public void testIsPal() {
+
+		palindrom test = new palindrom();
+		assertTrue(test.isPal(1221));
+	//	for(int i=0;i<12;i++)
+	//	assertFalse(test.isPal(i));
+	}
+}

untest/palindrom/palindromTestTest.java

@@ -0,0 +1,27 @@
+package palindrom;
+
+import static org.junit.Assert.*;
+
+import org.junit.Test;
+
+public class palindromTestTest {
+
+
+	@Test
+	public void testAfterClass() {
+		System.out.println("Before PalindromTestTest.class");
+	}
+
+	@Test
+	public void testInitTest() {
+		System.out.println("Before PalindromTestTest.class");
+	}
+
+	@Test
+	public void testTestIsPal() {
+		palindrom test = new palindrom();
+			for(int i=0;i<100;i++)
+			assertFalse(test.isPal(i));
+	}
+
+}