BAEL-2797 new domain "math"created, sections moved

algorithms-miscellaneous-1/src/test/java/com/baeldung/algorithms/linesintersection/LinesIntersectionServiceUnitTest.java

@@ -1,40 +0,0 @@
-package com.baeldung.algorithms.linesintersection;
-
-import java.awt.Point;
-import java.util.Optional;
-
-import org.junit.Test;
-import static org.junit.Assert.assertTrue;
-import static org.junit.Assert.assertFalse;
-import static org.junit.Assert.assertEquals;
-
-public class LinesIntersectionServiceUnitTest {
-    private LinesIntersectionService service = new LinesIntersectionService();
-
-    @Test
-    public void givenNotParallelLines_whenCalculatePoint_thenPresent() {
-
-        double m1 = 0;
-        double b1 = 0;
-        double m2 = 1;
-        double b2 = -1;
-
-        Optional<Point> point = service.calculateIntersectionPoint(m1, b1, m2, b2);
-
-        assertTrue(point.isPresent());
-        assertEquals(point.get().getX(), 1, 0.001);
-        assertEquals(point.get().getY(), 0, 0.001);
-    }
-
-    @Test
-    public void givenParallelLines_whenCalculatePoint_thenEmpty() {
-        double m1 = 1;
-        double b1 = 0;
-        double m2 = 1;
-        double b2 = -1;
-
-        Optional<Point> point = service.calculateIntersectionPoint(m1, b1, m2, b2);
-
-        assertFalse(point.isPresent());
-    }
-}

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/HillClimbingAlgorithmUnitTest.java

@@ -1,7 +1,7 @@
-package com.baeldung.algorithms;
+package com.baeldung.math;
 
-import com.baeldung.algorithms.hillclimbing.HillClimbing;
-import com.baeldung.algorithms.hillclimbing.State;
+import com.baeldung.math.hillclimbing.HillClimbing;
+import com.baeldung.math.hillclimbing.State;
 import org.junit.Before;
 import org.junit.Test;
 

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/MiddleElementLookupUnitTest.java

@@ -1,7 +1,7 @@
-package com.baeldung.algorithms;
+package com.baeldung.math;
 
-import com.baeldung.algorithms.middleelementlookup.MiddleElementLookup;
-import com.baeldung.algorithms.middleelementlookup.Node;
+import com.baeldung.math.middleelementlookup.MiddleElementLookup;
+import com.baeldung.math.middleelementlookup.Node;
 import org.junit.Test;
 
 import java.util.LinkedList;

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/RtFiniteStateMachineLongRunningUnitTest.java

@@ -1,6 +1,6 @@
-package com.baeldung.algorithms;
+package com.baeldung.math;
 
-import com.baeldung.algorithms.automata.*;
+import com.baeldung.math.automata.*;
 import org.junit.Test;
 
 import static org.junit.Assert.assertTrue;

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/StringSearchAlgorithmsUnitTest.java

@@ -1,10 +1,10 @@
-package com.baeldung.algorithms;
+package com.baeldung.math;
 
 
 import org.junit.Assert;
 import org.junit.Test;
 
-import com.baeldung.algorithms.string.search.StringSearchAlgorithms;
+import com.baeldung.math.string.search.StringSearchAlgorithms;
 
 public class StringSearchAlgorithmsUnitTest {
 	

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/binarysearch/BinarySearchUnitTest.java

@@ -1,11 +1,10 @@
-package com.baeldung.algorithms.binarysearch;
+package com.baeldung.math.binarysearch;
 
 import java.util.Arrays;
 import java.util.List;
 
 import org.junit.Assert;
 import org.junit.Test;
-import com.baeldung.algorithms.binarysearch.BinarySearch;
 
 public class BinarySearchUnitTest {
 

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/combination/CombinationUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.combination;
+package com.baeldung.math.combination;
 
 import static org.junit.jupiter.api.Assertions.assertEquals;
 

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/enumstatemachine/LeaveRequestStateUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.enumstatemachine;
+package com.baeldung.math.enumstatemachine;
 
 import static org.junit.Assert.assertEquals;
 

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/factorial/FactorialUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.factorial;
+package com.baeldung.math.factorial;
 
 import static org.assertj.core.api.Assertions.assertThat;
 

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/kthlargest/FindKthLargestUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.kthlargest;
+package com.baeldung.math.kthlargest;
 
 import static org.assertj.core.api.Assertions.*;
 

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/mcts/MCTSUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.mcts;
+package com.baeldung.math.mcts;
 
 import static org.junit.Assert.assertEquals;
 import static org.junit.Assert.assertTrue;
@@ -8,12 +8,12 @@ import java.util.List;
 import org.junit.Before;
 import org.junit.Test;
 
-import com.baeldung.algorithms.mcts.montecarlo.MonteCarloTreeSearch;
-import com.baeldung.algorithms.mcts.montecarlo.State;
-import com.baeldung.algorithms.mcts.montecarlo.UCT;
-import com.baeldung.algorithms.mcts.tictactoe.Board;
-import com.baeldung.algorithms.mcts.tictactoe.Position;
-import com.baeldung.algorithms.mcts.tree.Tree;
+import com.baeldung.math.mcts.montecarlo.MonteCarloTreeSearch;
+import com.baeldung.math.mcts.montecarlo.State;
+import com.baeldung.math.mcts.montecarlo.UCT;
+import com.baeldung.math.mcts.tictactoe.Board;
+import com.baeldung.math.mcts.tictactoe.Position;
+import com.baeldung.math.mcts.tree.Tree;
 
 public class MCTSUnitTest {
     private Tree gameTree;

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/minimax/MinimaxUnitTest.java

@@ -1,11 +1,9 @@
-package com.baeldung.algorithms.minimax;
+package com.baeldung.math.minimax;
 
 import org.junit.Before;
 import org.junit.Test;
 
 import static org.junit.Assert.*;
-import com.baeldung.algorithms.minimax.MiniMax;
-import com.baeldung.algorithms.minimax.Tree;
 
 public class MinimaxUnitTest {
     private Tree gameTree;

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/multiswarm/LolFitnessFunction.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.multiswarm;
+package com.baeldung.math.multiswarm;
 
 /**
  * Specific fitness function implementation to solve the League of Legends

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/multiswarm/MultiswarmUnitTest.java

@@ -1,10 +1,10 @@
-package com.baeldung.algorithms.multiswarm;
+package com.baeldung.math.multiswarm;
 
 import org.junit.Assert;
 import org.junit.Rule;
 import org.junit.Test;
 
-import com.baeldung.algorithms.support.MayFailRule;
+import com.baeldung.math.support.MayFailRule;
 
 /**
  * Test for {@link Multiswarm}.

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/string/EnglishAlphabetLettersUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.string;
+package com.baeldung.math.string;
 
 import org.junit.jupiter.api.Assertions;
 import org.junit.jupiter.api.Test;

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/string/LongestSubstringNonRepeatingCharactersUnitTest.java

@@ -1,10 +1,10 @@
-package com.baeldung.algorithms.string;
+package com.baeldung.math.string;
 
 import org.junit.jupiter.api.Test;
 
 import static org.junit.jupiter.api.Assertions.assertEquals;
-import static com.baeldung.algorithms.string.LongestSubstringNonRepeatingCharacters.getUniqueCharacterSubstring;
-import static com.baeldung.algorithms.string.LongestSubstringNonRepeatingCharacters.getUniqueCharacterSubstringBruteForce;
+import static com.baeldung.math.string.LongestSubstringNonRepeatingCharacters.getUniqueCharacterSubstring;
+import static com.baeldung.math.string.LongestSubstringNonRepeatingCharacters.getUniqueCharacterSubstringBruteForce;
 
 public class LongestSubstringNonRepeatingCharactersUnitTest {
 

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/string/SubstringPalindromeUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.string;
+package com.baeldung.math.string;
 
 import static org.junit.Assert.assertEquals;
 import java.util.HashSet;

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/support/MayFailRule.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.support;
+package com.baeldung.math.support;
 
 import org.junit.Rule;
 import org.junit.rules.TestRule;

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/twopointertechnique/LinkedListFindMiddleUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.twopointertechnique;
+package com.baeldung.math.twopointertechnique;
 
 import static org.assertj.core.api.Assertions.assertThat;
 

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/twopointertechnique/RotateArrayUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.twopointertechnique;
+package com.baeldung.math.twopointertechnique;
 
 import static org.assertj.core.api.Assertions.assertThat;
 

algorithms-miscellaneous-1/src/test/java/com/baeldung/math/twopointertechnique/TwoSumUnitTest.java

@@ -1,4 +1,4 @@
-package com.baeldung.algorithms.twopointertechnique;
+package com.baeldung.math.twopointertechnique;
 
 import static org.junit.Assert.assertFalse;
 import static org.junit.Assert.assertTrue;