mindol1004/spring-boot-rest
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

BAEL-2797 wrong renaming fixed on algorithms package

Browse Source
This commit is contained in:
anilkivilcim.eray
2019-04-04 15:50:39 +03:00
parent 94bf17615c
commit 64bc79b290
64 changed files with 85 additions and 66 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

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

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

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

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

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

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

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

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

@@ -3,6 +3,7 @@ package com.baeldung.math.binarysearch;
import java.util.Arrays;
import java.util.List;
import com.baeldung.algorithms.binarysearch.BinarySearch;
import org.junit.Assert;
import org.junit.Test;

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

@@ -4,6 +4,9 @@ import static org.junit.jupiter.api.Assertions.assertEquals;
import java.util.List;
import com.baeldung.algorithms.combination.IterativeCombinationGenerator;
import com.baeldung.algorithms.combination.SelectionRecursiveCombinationGenerator;
import com.baeldung.algorithms.combination.SetRecursiveCombinationGenerator;
import org.junit.Test;
public class CombinationUnitTest {

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

@@ -2,6 +2,7 @@ package com.baeldung.math.enumstatemachine;
import static org.junit.Assert.assertEquals;
import com.baeldung.algorithms.enumstatemachine.LeaveRequestState;
import org.junit.Test;
public class LeaveRequestStateUnitTest {

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

@@ -4,6 +4,7 @@ import static org.assertj.core.api.Assertions.assertThat;
import java.math.BigInteger;
import com.baeldung.algorithms.factorial.Factorial;
import org.junit.Before;
import org.junit.Test;

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

@@ -2,6 +2,7 @@ package com.baeldung.math.kthlargest;
import static org.assertj.core.api.Assertions.*;
import com.baeldung.algorithms.kthlargest.FindKthLargest;
import org.junit.Before;
import org.junit.Test;

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

@@ -8,12 +8,12 @@ import java.util.List;
import org.junit.Before;
import org.junit.Test;
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;
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;
public class MCTSUnitTest {
private Tree gameTree;

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

@@ -1,5 +1,7 @@
package com.baeldung.math.minimax;
import com.baeldung.algorithms.minimax.MiniMax;
import com.baeldung.algorithms.minimax.Tree;
import org.junit.Before;
import org.junit.Test;

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

@@ -1,5 +1,7 @@
package com.baeldung.math.multiswarm;
import com.baeldung.algorithms.multiswarm.FitnessFunction;
/**
* Specific fitness function implementation to solve the League of Legends
* problem. This is the problem statement: <br>

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

@@ -1,5 +1,6 @@
package com.baeldung.math.multiswarm;
import com.baeldung.algorithms.multiswarm.Multiswarm;
import org.junit.Assert;
import org.junit.Rule;
import org.junit.Test;

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

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

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

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

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

@@ -3,6 +3,8 @@ package com.baeldung.math.string;
import static org.junit.Assert.assertEquals;
import java.util.HashSet;
import java.util.Set;
import com.baeldung.algorithms.string.SubstringPalindrome;
import org.junit.Test;
public class SubstringPalindromeUnitTest {

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

@@ -2,6 +2,8 @@ package com.baeldung.math.twopointertechnique;
import static org.assertj.core.api.Assertions.assertThat;
import com.baeldung.algorithms.twopointertechnique.LinkedListFindMiddle;
import com.baeldung.algorithms.twopointertechnique.MyNode;
import org.junit.Test;
public class LinkedListFindMiddleUnitTest {

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

@@ -2,6 +2,7 @@ package com.baeldung.math.twopointertechnique;
import static org.assertj.core.api.Assertions.assertThat;
import com.baeldung.algorithms.twopointertechnique.RotateArray;
import org.junit.Test;
public class RotateArrayUnitTest {

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

@@ -3,6 +3,7 @@ package com.baeldung.math.twopointertechnique;
import static org.junit.Assert.assertFalse;
import static org.junit.Assert.assertTrue;
import com.baeldung.algorithms.twopointertechnique.TwoSum;
import org.junit.Test;
public class TwoSumUnitTest {