Merge branch 'master' into lor6-patch-1

algorithms/src/main/java/com/baeldung/algorithms/mcts/tictactoe/Board.java

@@ -148,7 +148,7 @@ public class Board {
             System.out.println("Game Draw");
             break;
         case IN_PROGRESS:
-            System.out.println("Game In rogress");
+            System.out.println("Game In Progress");
             break;
         }
     }

algorithms/src/test/java/algorithms/HillClimbingAlgorithmUnitTest.java

@@ -13,7 +13,7 @@ import static org.junit.Assert.assertEquals;
 import static org.junit.Assert.assertNotNull;
 import static org.junit.Assert.assertTrue;
 
-public class HillClimbingAlgorithmTest {
+public class HillClimbingAlgorithmUnitTest {
     private Stack<String> initStack;
     private Stack<String> goalStack;
 

algorithms/src/test/java/algorithms/StringSearchAlgorithmsUnitTest.java

@@ -6,7 +6,7 @@ import org.junit.Test;
 
 import com.baeldung.algorithms.string.search.StringSearchAlgorithms;
 
-public class StringSearchAlgorithmsTest {
+public class StringSearchAlgorithmsUnitTest {
 	
 	
 	@Test

algorithms/src/test/java/algorithms/binarysearch/BinarySearchUnitTest.java

@@ -7,7 +7,7 @@ import org.junit.Assert;
 import org.junit.Test;
 import com.baeldung.algorithms.binarysearch.BinarySearch;
 
-public class BinarySearchTest {
+public class BinarySearchUnitTest {
 
     int[] sortedArray = { 0, 1, 2, 3, 4, 5, 5, 6, 7, 8, 9, 9 };
     int key = 6;

algorithms/src/test/java/algorithms/mcts/MCTSUnitTest.java

@@ -15,7 +15,7 @@ import com.baeldung.algorithms.mcts.tictactoe.Board;
 import com.baeldung.algorithms.mcts.tictactoe.Position;
 import com.baeldung.algorithms.mcts.tree.Tree;
 
-public class MCTSTest {
+public class MCTSUnitTest {
     private Tree gameTree;
     private MonteCarloTreeSearch mcts;
 

algorithms/src/test/java/algorithms/minimax/MinimaxUnitTest.java

@@ -7,7 +7,7 @@ import static org.junit.Assert.*;
 import com.baeldung.algorithms.minimax.MiniMax;
 import com.baeldung.algorithms.minimax.Tree;
 
-public class MinimaxTest {
+public class MinimaxUnitTest {
     private Tree gameTree;
     private MiniMax miniMax;
 

algorithms/src/test/java/com/baeldung/algorithms/analysis/AnalysisRunnerLiveTest.java

@@ -0,0 +1,139 @@
+package com.baeldung.algorithms.analysis;
+
+import org.junit.Test;
+
+public class AnalysisRunnerLiveTest {
+
+    int n = 10;
+    int total = 0;
+
+    @Test
+    public void whenConstantComplexity_thenConstantRuntime() {
+
+        System.out.println("**** n = " + n + " ****");
+        System.out.println();
+
+        // Constant Time
+        System.out.println("**** Constant time ****");
+
+        System.out.println("Hey - your input is: " + n);
+        System.out.println("Running time not dependent on input size!");
+        System.out.println();
+    }
+
+    @Test
+    public void whenLogarithmicComplexity_thenLogarithmicRuntime() {
+        // Logarithmic Time
+        System.out.println("**** Logarithmic Time ****");
+        for (int i = 1; i < n; i = i * 2) {
+            // System.out.println("Hey - I'm busy looking at: " + i);
+            total++;
+        }
+        System.out.println("Total amount of times run: " + total);
+        System.out.println();
+    }
+
+    @Test
+    public void whenLinearComplexity_thenLinearRuntime() {
+        // Linear Time
+        System.out.println("**** Linear Time ****");
+        for (int i = 0; i < n; i++) {
+            // System.out.println("Hey - I'm busy looking at: " + i);
+            total++;
+        }
+        System.out.println("Total amount of times run: " + total);
+        System.out.println();
+
+    }
+
+    @Test
+    public void whenNLogNComplexity_thenNLogNRuntime() {
+        // N Log N Time
+        System.out.println("**** nlogn Time ****");
+        total = 0;
+        for (
+
+            int i = 1; i <= n; i++) {
+            for (int j = 1; j < n; j = j * 2) {
+                // System.out.println("Hey - I'm busy looking at: " + i + " and " + j);
+                total++;
+            }
+        }
+        System.out.println("Total amount of times run: " + total);
+        System.out.println();
+    }
+
+    @Test
+    public void whenQuadraticComplexity_thenQuadraticRuntime() {
+        // Quadratic Time
+        System.out.println("**** Quadratic Time ****");
+        total = 0;
+        for (
+
+            int i = 1; i <= n; i++) {
+            for (int j = 1; j <= n; j++) {
+                // System.out.println("Hey - I'm busy looking at: " + i + " and " + j);
+                total++;
+            }
+        }
+        System.out.println("Total amount of times run: " + total);
+        System.out.println();
+    }
+
+    @Test
+    public void whenCubicComplexity_thenCubicRuntime() {
+        // Cubic Time
+        System.out.println("**** Cubic Time ****");
+        total = 0;
+        for (
+
+            int i = 1; i <= n; i++) {
+            for (int j = 1; j <= n; j++) {
+                for (int k = 1; k <= n; k++) {
+                    // System.out.println("Hey - I'm busy looking at: " + i + " and " + j + " and " + k);
+                    total++;
+                }
+            }
+        }
+        System.out.println("Total amount of times run: " + total);
+        System.out.println();
+    }
+
+    @Test
+    public void whenExponentialComplexity_thenExponentialRuntime() {
+        // Exponential Time
+        System.out.println("**** Exponential Time ****");
+        total = 0;
+        for (
+
+            int i = 1; i <= Math.pow(2, n); i++) {
+            // System.out.println("Hey - I'm busy looking at: " + i);
+            total++;
+        }
+        System.out.println("Total amount of times run: " + total);
+        System.out.println();
+    }
+
+    @Test
+    public void whenFactorialComplexity_thenFactorialRuntime() {
+        // Factorial Time
+        System.out.println("**** Factorial Time ****");
+        total = 0;
+        for (
+
+            int i = 1; i <=
+
+            factorial(n); i++) {
+            // System.out.println("Hey - I'm busy looking at: " + i);
+            total++;
+        }
+        System.out.println("Total amount of times run: " + total);
+    }
+
+    static int factorial(int n) {
+        if (n == 0 || n == 1)
+            return 1;
+        else
+            return n * factorial(n - 1);
+    }
+}

algorithms/src/test/java/com/baeldung/algorithms/bubblesort/BubbleSortUnitTest.java

@@ -4,7 +4,7 @@ import static org.junit.Assert.*;
 
 import org.junit.Test;
 
-public class BubbleSortTest {
+public class BubbleSortUnitTest {
 
     @Test
     public void givenIntegerArray_whenSortedWithBubbleSort_thenGetSortedArray() {

algorithms/src/test/java/com/baeldung/algorithms/editdistance/EditDistanceUnitTest.java

@@ -7,13 +7,13 @@ import org.junit.runners.Parameterized;
 import static org.junit.Assert.assertEquals;
 
 @RunWith(Parameterized.class)
-public class EditDistanceTest extends EditDistanceDataProvider {
+public class EditDistanceUnitTest extends EditDistanceDataProvider {
 
     private String x;
     private String y;
     private int result;
 
-    public EditDistanceTest(String a, String b, int res) {
+    public EditDistanceUnitTest(String a, String b, int res) {
         super();
         x = a;
         y = b;

algorithms/src/test/java/com/baeldung/algorithms/linkedlist/CycleDetectionBruteForceUnitTest.java

@@ -6,11 +6,11 @@ import org.junit.runner.RunWith;
 import org.junit.runners.Parameterized;
 
 @RunWith(value = Parameterized.class)
-public class CycleDetectionBruteForceTest extends CycleDetectionTestBase {
+public class CycleDetectionBruteForceUnitTest extends CycleDetectionTestBase {
     boolean cycleExists;
     Node<Integer> head;
 
-    public CycleDetectionBruteForceTest(Node<Integer> head, boolean cycleExists) {
+    public CycleDetectionBruteForceUnitTest(Node<Integer> head, boolean cycleExists) {
         super();
         this.cycleExists = cycleExists;
         this.head = head;

algorithms/src/test/java/com/baeldung/algorithms/linkedlist/CycleDetectionByFastAndSlowIteratorsUnitTest.java

@@ -6,11 +6,11 @@ import org.junit.runner.RunWith;
 import org.junit.runners.Parameterized;
 
 @RunWith(value = Parameterized.class)
-public class CycleDetectionByFastAndSlowIteratorsTest extends CycleDetectionTestBase {
+public class CycleDetectionByFastAndSlowIteratorsUnitTest extends CycleDetectionTestBase {
     boolean cycleExists;
     Node<Integer> head;
 
-    public CycleDetectionByFastAndSlowIteratorsTest(Node<Integer> head, boolean cycleExists) {
+    public CycleDetectionByFastAndSlowIteratorsUnitTest(Node<Integer> head, boolean cycleExists) {
         super();
         this.cycleExists = cycleExists;
         this.head = head;

algorithms/src/test/java/com/baeldung/algorithms/linkedlist/CycleDetectionByHashingUnitTest.java

@@ -6,11 +6,11 @@ import org.junit.runner.RunWith;
 import org.junit.runners.Parameterized;
 
 @RunWith(value = Parameterized.class)
-public class CycleDetectionByHashingTest extends CycleDetectionTestBase {
+public class CycleDetectionByHashingUnitTest extends CycleDetectionTestBase {
     boolean cycleExists;
     Node<Integer> head;
 
-    public CycleDetectionByHashingTest(Node<Integer> head, boolean cycleExists) {
+    public CycleDetectionByHashingUnitTest(Node<Integer> head, boolean cycleExists) {
         super();
         this.cycleExists = cycleExists;
         this.head = head;

algorithms/src/test/java/com/baeldung/algorithms/linkedlist/CycleRemovalBruteForceUnitTest.java

@@ -6,11 +6,11 @@ import org.junit.runner.RunWith;
 import org.junit.runners.Parameterized;
 
 @RunWith(value = Parameterized.class)
-public class CycleRemovalBruteForceTest extends CycleDetectionTestBase {
+public class CycleRemovalBruteForceUnitTest extends CycleDetectionTestBase {
     boolean cycleExists;
     Node<Integer> head;
 
-    public CycleRemovalBruteForceTest(Node<Integer> head, boolean cycleExists) {
+    public CycleRemovalBruteForceUnitTest(Node<Integer> head, boolean cycleExists) {
         super();
         this.cycleExists = cycleExists;
         this.head = head;

algorithms/src/test/java/com/baeldung/algorithms/linkedlist/CycleRemovalByCountingLoopNodesUnitTest.java

@@ -6,11 +6,11 @@ import org.junit.runner.RunWith;
 import org.junit.runners.Parameterized;
 
 @RunWith(value = Parameterized.class)
-public class CycleRemovalByCountingLoopNodesTest extends CycleDetectionTestBase {
+public class CycleRemovalByCountingLoopNodesUnitTest extends CycleDetectionTestBase {
     boolean cycleExists;
     Node<Integer> head;
 
-    public CycleRemovalByCountingLoopNodesTest(Node<Integer> head, boolean cycleExists) {
+    public CycleRemovalByCountingLoopNodesUnitTest(Node<Integer> head, boolean cycleExists) {
         super();
         this.cycleExists = cycleExists;
         this.head = head;

algorithms/src/test/java/com/baeldung/algorithms/linkedlist/CycleRemovalWithoutCountingLoopNodesUnitTest.java

@@ -6,11 +6,11 @@ import org.junit.runner.RunWith;
 import org.junit.runners.Parameterized;
 
 @RunWith(value = Parameterized.class)
-public class CycleRemovalWithoutCountingLoopNodesTest extends CycleDetectionTestBase {
+public class CycleRemovalWithoutCountingLoopNodesUnitTest extends CycleDetectionTestBase {
     boolean cycleExists;
     Node<Integer> head;
 
-    public CycleRemovalWithoutCountingLoopNodesTest(Node<Integer> head, boolean cycleExists) {
+    public CycleRemovalWithoutCountingLoopNodesUnitTest(Node<Integer> head, boolean cycleExists) {
         super();
         this.cycleExists = cycleExists;
         this.head = head;

algorithms/src/test/java/com/baeldung/algorithms/moneywords/NumberWordConverterUnitTest.java

@@ -6,7 +6,7 @@ import org.junit.Test;
 
 import com.baeldung.algorithms.numberwordconverter.NumberWordConverter;
 
-public class NumberWordConverterTest {
+public class NumberWordConverterUnitTest {
 
     @Test
     public void whenMoneyNegative_thenReturnInvalidInput() {

algorithms/src/test/java/com/baeldung/algorithms/prime/PrimeGeneratorUnitTest.java

@@ -7,7 +7,7 @@ import java.util.List;
 import org.junit.Test;
 import static org.junit.Assert.*;
 
-public class PrimeGeneratorTest {
+public class PrimeGeneratorUnitTest {
     @Test
     public void whenBruteForced_returnsSuccessfully() {
         final List<Integer> primeNumbers = primeNumbersBruteForce(20);

algorithms/src/test/java/com/baeldung/jgrapht/CompleteGraphUnitTest.java

@@ -12,7 +12,7 @@ import org.jgrapht.graph.SimpleWeightedGraph;
 import org.junit.Before;
 import org.junit.Test;
 
-public class CompleteGraphTest {
+public class CompleteGraphUnitTest {
 
     static SimpleWeightedGraph<String, DefaultEdge> completeGraph;
     static int size = 10;

algorithms/src/test/java/com/baeldung/jgrapht/DirectedGraphUnitTest.java

@@ -24,7 +24,7 @@ import org.jgrapht.traverse.DepthFirstIterator;
 import org.junit.Before;
 import org.junit.Test;
 
-public class DirectedGraphTests {
+public class DirectedGraphUnitTest {
     DirectedGraph<String, DefaultEdge> directedGraph;
 
     @Before

algorithms/src/test/java/com/baeldung/jgrapht/EulerianCircuitUnitTest.java

@@ -12,7 +12,7 @@ import org.jgrapht.graph.SimpleWeightedGraph;
 import org.junit.Before;
 import org.junit.Test;
 
-public class EulerianCircuitTest {
+public class EulerianCircuitUnitTest {
     SimpleWeightedGraph<String, DefaultEdge> simpleGraph;
 
     @Before

animal-sniffer-mvn-plugin/pom.xml

@@ -5,7 +5,7 @@
     <artifactId>animal-sniffer-mvn-plugin</artifactId>
     <packaging>jar</packaging>
     <version>1.0-SNAPSHOT</version>
-    <name>example-animal-sniffer-mvn-plugin</name>
+    <name>animal-sniffer-mvn-plugin</name>
     <url>http://maven.apache.org</url>
 
     <parent>

apache-cayenne/src/test/java/com/baeldung/apachecayenne/CayenneAdvancedOperationLiveTest.java

@@ -19,7 +19,7 @@ import java.util.List;
 import static junit.framework.Assert.assertEquals;
 import static org.junit.Assert.assertNotNull;
 
-public class CayenneAdvancedOperationIntegrationTest {
+public class CayenneAdvancedOperationLiveTest {
     private static ObjectContext context = null;
 
     @BeforeClass

apache-cayenne/src/test/java/com/baeldung/apachecayenne/CayenneOperationLiveTest.java

@@ -16,7 +16,7 @@ import static junit.framework.Assert.assertEquals;
 import static org.junit.Assert.assertNull;
 
 
-public class CayenneOperationIntegrationTest {
+public class CayenneOperationLiveTest {
     private static ObjectContext context = null;
 
     @BeforeClass

apache-curator/src/test/java/com/baeldung/apache/curator/BaseManualTest.java

@@ -6,7 +6,7 @@ import org.apache.curator.framework.CuratorFrameworkFactory;
 import org.apache.curator.retry.RetryNTimes;
 import org.junit.Before;
 
-public abstract class BaseTest {
+public abstract class BaseManualTest {
 
     @Before
     public void setup() {

apache-curator/src/test/java/com/baeldung/apache/curator/configuration/ConfigurationManagementManualTest.java

@@ -12,9 +12,9 @@ import org.apache.curator.framework.CuratorFramework;
 import org.apache.curator.x.async.AsyncCuratorFramework;
 import org.junit.Test;
 
-import com.baeldung.apache.curator.BaseTest;
+import com.baeldung.apache.curator.BaseManualTest;
 
-public class ConfigurationManagementManualTest extends BaseTest {
+public class ConfigurationManagementManualTest extends BaseManualTest {
 
     private static final String KEY_FORMAT = "/%s";
 

apache-curator/src/test/java/com/baeldung/apache/curator/modeled/ModelTypedExamplesManualTest.java

@@ -11,9 +11,9 @@ import org.apache.curator.x.async.modeled.ModeledFramework;
 import org.apache.curator.x.async.modeled.ZPath;
 import org.junit.Test;
 
-import com.baeldung.apache.curator.BaseTest;
+import com.baeldung.apache.curator.BaseManualTest;
 
-public class ModelTypedExamplesManualTest extends BaseTest {
+public class ModelTypedExamplesManualTest extends BaseManualTest {
 
     @Test
     public void givenPath_whenStoreAModel_thenNodesAreCreated()

apache-curator/src/test/java/com/baeldung/apache/curator/recipes/RecipesManualTest.java

@@ -10,9 +10,9 @@ import org.apache.curator.framework.recipes.shared.SharedCount;
 import org.apache.curator.framework.state.ConnectionState;
 import org.junit.Test;
 
-import com.baeldung.apache.curator.BaseTest;
+import com.baeldung.apache.curator.BaseManualTest;
 
-public class RecipesManualTest extends BaseTest {
+public class RecipesManualTest extends BaseManualTest {
 
     @Test
     public void givenRunningZookeeper_whenUsingLeaderElection_thenNoErrors() {

apache-opennlp/src/test/java/com/baeldung/apache/opennlp/ChunkerUnitTest.java

@@ -10,7 +10,7 @@ import opennlp.tools.tokenize.SimpleTokenizer;
 import static org.assertj.core.api.Assertions.assertThat;
 import org.junit.Test;
 
-public class ChunkerTest {
+public class ChunkerUnitTest {
 
     @Test
     public void givenChunkerModel_whenChunk_thenChunksAreDetected() throws Exception {

apache-opennlp/src/test/java/com/baeldung/apache/opennlp/LanguageDetectorAndTrainingDataUnitTest.java

@@ -19,7 +19,7 @@ import static org.assertj.core.api.Assertions.assertThat;
 import static org.assertj.core.api.Assertions.tuple;
 import org.junit.Test;
 
-public class LanguageDetectorAndTrainingDataTest {
+public class LanguageDetectorAndTrainingDataUnitTest {
 
     @Test
     public void givenLanguageDictionary_whenLanguageDetect_thenLanguageIsDetected() throws FileNotFoundException, IOException {

apache-opennlp/src/test/java/com/baeldung/apache/opennlp/LemmetizerUnitTest.java

@@ -8,7 +8,7 @@ import opennlp.tools.tokenize.SimpleTokenizer;
 import static org.assertj.core.api.Assertions.assertThat;
 import org.junit.Test;
 
-public class LemmetizerTest {
+public class LemmetizerUnitTest {
 
     @Test
     public void givenEnglishDictionary_whenLemmatize_thenLemmasAreDetected() throws Exception {