sudheertest · sudheertest · Sep 23, 2013 · Sep 20, 2013 · Sep 23, 2013
diff --git a/RunUsage b/RunUsage
@@ -1,4 +1,15 @@
-running test ng from command line
+ #####################################
+
+ #####################################
+
+ #####################################
+
+get TestNg help
+
+D:\sud-work\learn_java>java -cp ".\bin;..\common_lib\*;" org.testng.TestNG testngTest.xml --help
+
+#####################################
+running testng from command line
 
 Navigate to the testng.xml location and in the package folder
 java -cp "class file location; testng jar file location" org.testng.TestNG testng.xml
@@ -8,4 +19,5 @@ java -cp ".\bin;..\common_lib\*;" org.testng.TestNG testng.xml
 
 example to run by classes
 
-D:\sud-work\learn_java> java -cp ".\bin;..\common_lib\*;" org.testng.TestNG testngRunByClass.xml
+D:\sud-work\learn_java> java -cp ".\bin;..\common_lib\*;" org.testng.TestNG testngRunByClass.xml
+#####################################
diff --git a/TODO b/TODO
@@ -1,9 +1,24 @@
 http://testng.org/doc/documentation-main.html#parameters
 
+Listeners
+
 data provider
 
 YML file
 
 Factory
 
+parallel execution
+
+dependency
+
+rerun failure
+
+maven integration
+
+gradle setup
+
+jenkins execution
+
+supergrid setup
 
diff --git a/src/learnjava/ArmstrongNumber.java b/src/learnjava/ArmstrongNumber.java
@@ -1,5 +1,6 @@
 package learnjava;
 
+import org.testng.annotations.AfterMethod;
 import org.testng.annotations.Parameters;
 import org.testng.annotations.Test;
 
@@ -8,22 +9,22 @@
 /**
  * 371 = 3**3 + 7**3 + 1**3 = 371.
  * an Armstrong number or a plus perfect number) is a number that is the sum of its own digits each raised to the power of the number of digits.
- *
+ * <p/>
  * A five digit ArmStrong number ABCDE is such that ABCDE = A^5+B^5+C^5+D^5+E^5.
  * let A,B,C,D,E be variables, then equation is
  * E+D*10+C*100+B*1000+A*10000 = A^5 + B^5 + C^5 + D^5 + E^5.
- *
+ * <p/>
  * 1. Return 4 digit armstrong numbers in he range of 1 to 10000
  * 2. Find whether a given number is armstrong number or not
  * 3. Return all armstrong numbers in the range of 0 to 999
- *
+ * <p/>
  * http://in.answers.yahoo.com/question/index?qid=20091118020348AAbKxA6
- *
+ * <p/>
  * http://www.programmingsimplified.com/java/source-code/java-program-armstrong-number
- *
+ * <p/>
  * http://www.javatpoint.com/operators-in-java
- *
- *
+ * <p/>
+ * <p/>
  * Created with IntelliJ IDEA.
  * User: sudheern
  * Date: 13/9/13
@@ -54,14 +55,15 @@ boolean verifyIsArmStrong(int number, int numOrder) {
     }
 
     @Parameters({"armStrongNumber"})
-    @Test(groups = {"done"})
+    @Test(groups = {"pending"})
     public boolean verifyIsArmStrong(int number) {
         int num = number;
         int numOrder = getNumberOrder(number);
+        System.out.println("in method verifyIsArmStrong "+verifyIsArmStrong(number, numOrder));
         return verifyIsArmStrong(number, numOrder);
     }
 
-    @Test(groups = {"done"})
+    @Test (groups = {"pending"})
     @Parameters({"armStrongNumberMin", "armStrongNumberMax"})
     public ArrayList getArmStrongNumbers(int min, int max) {
         int order = 0;
@@ -76,24 +78,34 @@ public ArrayList getArmStrongNumbers(int min, int max) {
                 order = getNumberOrder(i);
             }
         }
+        System.out.println("in method getArmStrongNumbers "+getArmStrongNumbers(min, max, order));
         return getArmStrongNumbers(min, max, order);
     }
 
-    ArrayList getArmStrongNumbers(int min, int max, int numOrder){
+    ArrayList getArmStrongNumbers(int min, int max, int numOrder) {
         ArrayList numArray = new ArrayList();
 
-        for (int i = min; i <= max; i++ ){
-            if (verifyIsArmStrong(i, getNumberOrder(i))){
+        for (int i = min; i <= max; i++) {
+            if (verifyIsArmStrong(i, getNumberOrder(i))) {
                 numArray.add(i);
             }
         }
         return numArray;
     }
 
-//    public static void main(String args[]) {
-//        int num = 3711;
-//        ArmstrongNumber an = new ArmstrongNumber();
-//        System.out.println(an.getArmStrongNumbers(10, 400));
-//        System.out.println(an.verifyIsArmStrong(num));
-//    }
+
+    @Test(groups = {"run"})
+    public void callByObject() {
+        int num = 153;
+        ArmstrongNumber an = new ArmstrongNumber();
+        System.out.println("callByObject: " + an.getArmStrongNumbers(10, 700));
+        System.out.println("callByObject: "+ num + " is:  " + an.verifyIsArmStrong(num));
+    }
+
+    @Test(groups = {"run"})
+    public void callByMethod() {
+        int num = 371;
+        System.out.println("callByMethod: " + getArmStrongNumbers(101, 400, 3));
+        System.out.println("callByMethod: " + verifyIsArmStrong(num, 3));
+    }
 }
diff --git a/src/learnjava/PrimeNumbers.java b/src/learnjava/PrimeNumbers.java
@@ -17,7 +17,7 @@
  */
 public class PrimeNumbers {
 
-    @Test(groups = {"done"})
+
     public boolean isPrime_Simple(int num) {
         for (int i = 2; i < num; i++) {
             if ((num % i) == 0)
@@ -26,12 +26,19 @@ public boolean isPrime_Simple(int num) {
         return true;
     }
 
-    @Test
+
     public boolean isPrime(int num) {
         for (int i = 2; i <= num / 2; i++) {
             if ((num % i) == 0)
                 return false;
         }
         return true;
     }
+
+    @Test(groups = {"done"})
+    public void result() {
+        PrimeNumbers pn = new PrimeNumbers();
+        System.out.println("PrimeNumbers: " + pn.isPrime(6));
+        System.out.println("PrimeNumbers: " + pn.isPrime_Simple(7));
+    }
 }
diff --git a/src/learnjava/TemplateForTestNG.java b/src/learnjava/TemplateForTestNG.java
@@ -0,0 +1,101 @@
+package learnjava;
+
+import org.testng.annotations.Parameters;
+import org.testng.annotations.Test;
+
+import java.util.ArrayList;
+
+/**
+ * 371 = 3**3 + 7**3 + 1**3 = 371.
+ * an Armstrong number or a plus perfect number) is a number that is the sum of its own digits each raised to the power of the number of digits.
+ *
+ * A five digit ArmStrong number ABCDE is such that ABCDE = A^5+B^5+C^5+D^5+E^5.
+ * let A,B,C,D,E be variables, then equation is
+ * E+D*10+C*100+B*1000+A*10000 = A^5 + B^5 + C^5 + D^5 + E^5.
+ *
+ * 1. Return 4 digit armstrong numbers in he range of 1 to 10000
+ * 2. Find whether a given number is armstrong number or not
+ * 3. Return all armstrong numbers in the range of 0 to 999
+ *
+ * http://in.answers.yahoo.com/question/index?qid=20091118020348AAbKxA6
+ *
+ * http://www.programmingsimplified.com/java/source-code/java-program-armstrong-number
+ *
+ * http://www.javatpoint.com/operators-in-java
+ *
+ *
+ * Created with IntelliJ IDEA.
+ * User: sudheern
+ * Date: 13/9/13
+ * Time: 2:22 PM
+ * To change this template use File | Settings | File Templates.
+ */
+public class TemplateForTestNG {
+
+     int getNumberOrder(int num) {
+        int i = 1;
+        while (num > 10) {
+            num = (int) num / 10;
+            i++;
+        }
+        return i;
+    }
+
+     boolean verifyIsArmStrong(int number, int numOrder) {
+        int num = number;
+        int tempNum = 0;
+        int reminder = 0;
+        for (int i = 0; i <= numOrder; i++) {
+            reminder = num % 10;
+            num = (int) num / 10;
+            tempNum = tempNum + (int) Math.pow(reminder, numOrder);
+        }
+        return (number == tempNum);
+    }
+
+    @Parameters({"armStrongNumber"})
+    @Test(groups = {"done"})
+    public boolean verifyIsArmStrong(int number) {
+        int num = number;
+        int numOrder = getNumberOrder(number);
+        System.out.println("in method verifyIsArmStrong "+verifyIsArmStrong(number, numOrder));
+        return verifyIsArmStrong(number, numOrder);
+    }
+
+    @Test(groups = {"done"})
+    @Parameters({"armStrongNumberMin", "armStrongNumberMax"})
+    public ArrayList getArmStrongNumbers(int min, int max) {
+        int order = 0;
+        for (int i = min; i <= max; i++) {
+            if (i < 9) {
+                order = 1;
+            } else if (i < 99) {
+                order = 2;
+            } else if (i < 999) {
+                order = 3;
+            } else {
+                order = getNumberOrder(i);
+            }
+        }
+        System.out.println("in method getArmStrongNumbers "+getArmStrongNumbers(min, max, order));
+        return getArmStrongNumbers(min, max, order);
+    }
+
+    private ArrayList getArmStrongNumbers(int min, int max, int numOrder){
+        ArrayList numArray = new ArrayList();
+
+        for (int i = min; i <= max; i++ ){
+            if (verifyIsArmStrong(i, getNumberOrder(i))){
+                numArray.add(i);
+            }
+        }
+        return numArray;
+    }
+
+//    public static void main(String args[]) {
+//        int num = 3711;
+//        ArmstrongNumber an = new ArmstrongNumber();
+//        System.out.println(an.getArmStrongNumbers(10, 400));
+//        System.out.println(an.verifyIsArmStrong(num));
+//    }
+}
diff --git a/src/testng/TestNGTest1.java b/src/testng/TestNGTest1.java
@@ -0,0 +1,84 @@
+package testng;
+
+import org.testng.Assert;
+import org.testng.annotations.*;
+
+import java.util.ArrayList;
+import java.util.Collection;
+
+/**
+ * Created with IntelliJ IDEA.
+ * User: sudheern
+ * Date: 20/9/13
+ * Time: 6:15 PM
+ * To change this template use File | Settings | File Templates.
+ */
+public class TestNGTest1 {
+    private Collection collection;
+    ArrayList<String> array = new ArrayList<String>();
+
+    @BeforeClass
+    public void oneTimeSetUp() {
+        // one-time initialization code
+        System.out.println("TestNGTest1: @BeforeClass - oneTimeSetUp");
+    }
+
+    @AfterClass
+    public void oneTimeTearDown() {
+        // one-time cleanup code
+        System.out.println("TestNGTest1: @AfterClass - oneTimeTearDown");
+    }
+
+    @BeforeMethod
+    public void setUp() {
+        collection = new ArrayList();
+        System.out.println("TestNGTest1: @BeforeMethod - setUp");
+    }
+
+    @AfterMethod
+    public void tearDown() {
+        collection.clear();
+        System.out.println("TestNGTest1: @AfterMethod - tearDown");
+    }
+
+    @Test
+    public void testEmptyCollection() {
+        Assert.assertEquals(collection.isEmpty(), true);
+        System.out.println("TestNGTest1: @Test - testEmptyCollection");
+    }
+
+    @Test
+    public void testOneItemCollection() {
+        collection.add("itemA");
+        Assert.assertEquals(collection.size(), 1);
+        System.out.println("TestNGTest1: @Test - testOneItemCollection");
+    }
+
+    @Test(groups = "method1")
+    public void testGroup1() {
+        array.add("item1");
+        Assert.assertEquals(array.isEmpty(), false);
+        System.out.println("TestNGTest1: @Test - testGroup1 groups = method1");
+    }
+
+    @Test(groups = "method2")
+    public void testGroup2() {
+        array.add("item2");
+        Assert.assertEquals(array.isEmpty(), false);
+        System.out.println("TestNGTest1: @Test - testGroup2 groups = method2");
+    }
+
+    @Test(groups = "method1")
+    public void testGroup3() {
+        array.add("item3");
+        Assert.assertEquals(array.isEmpty(), false);
+        System.out.println("TestNGTest1: @Test - testGroup3 groups = method1");
+    }
+
+    @Test(groups = "method2")
+    public void testGroup4() {
+        array.add("item4");
+        Assert.assertEquals(array.isEmpty(), false);
+        System.out.println("TestNGTest1: @Test - testGroup4 groups = method2");
+    }
+}
diff --git a/src/testng/TestNGTest2.java b/src/testng/TestNGTest2.java
@@ -0,0 +1,24 @@
+package testng;
+
+import org.testng.annotations.*;
+
+/**
+ * Created with IntelliJ IDEA.
+ * User: sudheern
+ * Date: 20/9/13
+ * Time: 7:00 PM
+ * To change this template use File | Settings | File Templates.
+ */
+public class TestNGTest2 {
+    @Test(expectedExceptions = ArithmeticException.class)
+      public void divisionWithException() {
+        System.out.println("TestNGTest2: @Test - in divisionWithException");
+        int i = 1/0;
+    }
+
+    @Test
+    public void divisionWithOutException() {
+        System.out.println("TestNGTest2: @Test - in divisionWithOutException");
+        int i = 1/0;
+    }
+}