algorithm/Java
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Java.git synced 2026-03-13 08:40:43 +08:00
Code Issues Packages Projects Releases Wiki Activity

style: include UTAO_JUNIT_ASSERTION_ODDITIES_ACTUAL_CONSTANT (#7239)

Browse Source
This commit is contained in:
Piotr Idzik
2026-01-24 14:16:48 +01:00
committed by GitHub
parent 1a7f8fe79e
commit 0b0cefe9f9
23 changed files with 107 additions and 110 deletions
Download Patch File Download Diff File Expand all files Collapse all files

26
src/test/java/com/thealgorithms/maths/DistanceFormulaTest.java
View File

@@ -9,78 +9,78 @@ public class DistanceFormulaTest {
@Test
void euclideanTest1() {
Assertions.assertEquals(DistanceFormula.euclideanDistance(1, 1, 2, 2), 1.4142135623730951);
Assertions.assertEquals(1.4142135623730951, DistanceFormula.euclideanDistance(1, 1, 2, 2));
}
@Test
void euclideanTest2() {
Assertions.assertEquals(DistanceFormula.euclideanDistance(1, 3, 8, 0), 7.0710678118654755);
Assertions.assertEquals(7.0710678118654755, DistanceFormula.euclideanDistance(1, 3, 8, 0));
}
@Test
void euclideanTest3() {
Assertions.assertEquals(DistanceFormula.euclideanDistance(2.4, 9.1, 55.1, 100), 110.91911467371168);
Assertions.assertEquals(110.91911467371168, DistanceFormula.euclideanDistance(2.4, 9.1, 55.1, 100));
}
@Test
void euclideanTest4() {
Assertions.assertEquals(DistanceFormula.euclideanDistance(1000, 13, 20000, 84), 19022.067605809836);
Assertions.assertEquals(19022.067605809836, DistanceFormula.euclideanDistance(1000, 13, 20000, 84));
}
@Test
public void manhattantest1() {
assertEquals(DistanceFormula.manhattanDistance(1, 2, 3, 4), 4);
assertEquals(4, DistanceFormula.manhattanDistance(1, 2, 3, 4));
}
@Test
public void manhattantest2() {
assertEquals(DistanceFormula.manhattanDistance(6.5, 8.4, 20.1, 13.6), 18.8);
assertEquals(18.8, DistanceFormula.manhattanDistance(6.5, 8.4, 20.1, 13.6));
}
@Test
public void manhattanTest3() {
assertEquals(DistanceFormula.manhattanDistance(10.112, 50, 8, 25.67), 26.442);
assertEquals(26.442, DistanceFormula.manhattanDistance(10.112, 50, 8, 25.67));
}
@Test
public void hammingTest1() {
int[] array1 = {1, 1, 1, 1};
int[] array2 = {0, 0, 0, 0};
assertEquals(DistanceFormula.hammingDistance(array1, array2), 4);
assertEquals(4, DistanceFormula.hammingDistance(array1, array2));
}
@Test
public void hammingTest2() {
int[] array1 = {1, 1, 1, 1};
int[] array2 = {1, 1, 1, 1};
assertEquals(DistanceFormula.hammingDistance(array1, array2), 0);
assertEquals(0, DistanceFormula.hammingDistance(array1, array2));
}
@Test
public void hammingTest3() {
int[] array1 = {1, 0, 0, 1, 1, 0, 1, 1, 0};
int[] array2 = {0, 1, 0, 0, 1, 1, 1, 0, 0};
assertEquals(DistanceFormula.hammingDistance(array1, array2), 5);
assertEquals(5, DistanceFormula.hammingDistance(array1, array2));
}
@Test
public void minkowskiTest1() {
double[] array1 = {1, 3, 8, 5};
double[] array2 = {4, 2, 6, 9};
assertEquals(DistanceFormula.minkowskiDistance(array1, array2, 1), 10);
assertEquals(10, DistanceFormula.minkowskiDistance(array1, array2, 1));
}
@Test
public void minkowskiTest2() {
double[] array1 = {1, 3, 8, 5};
double[] array2 = {4, 2, 6, 9};
assertEquals(DistanceFormula.minkowskiDistance(array1, array2, 2), 5.477225575051661);
assertEquals(5.477225575051661, DistanceFormula.minkowskiDistance(array1, array2, 2));
}
@Test
public void minkowskiTest3() {
double[] array1 = {1, 3, 8, 5};
double[] array2 = {4, 2, 6, 9};
assertEquals(DistanceFormula.minkowskiDistance(array1, array2, 3), 4.641588833612778);
assertEquals(4.641588833612778, DistanceFormula.minkowskiDistance(array1, array2, 3));
}
}

2
src/test/java/com/thealgorithms/maths/FactorialTest.java
View File

@@ -11,7 +11,7 @@ public class FactorialTest {
@Test
public void testWhenInvalidInoutProvidedShouldThrowException() {
IllegalArgumentException exception = assertThrows(IllegalArgumentException.class, () -> Factorial.factorial(-1));
assertEquals(exception.getMessage(), EXCEPTION_MESSAGE);
assertEquals(EXCEPTION_MESSAGE, exception.getMessage());
}
@Test

8
src/test/java/com/thealgorithms/maths/NthUglyNumberTest.java
View File

@@ -48,22 +48,22 @@ public class NthUglyNumberTest {
var uglyNumbers = new NthUglyNumber(new int[] {7, 2, 5, 3});
for (final var tc : testCases.entrySet()) {
assertEquals(uglyNumbers.get(tc.getKey()), tc.getValue());
assertEquals(tc.getValue(), uglyNumbers.get(tc.getKey()));
}
assertEquals(uglyNumbers.get(999), 385875);
assertEquals(385875, uglyNumbers.get(999));
}
@Test
public void testGetWithBase1() {
var uglyNumbers = new NthUglyNumber(new int[] {1});
assertEquals(uglyNumbers.get(10), 1);
assertEquals(1, uglyNumbers.get(10));
}
@Test
public void testGetWithBase2() {
var uglyNumbers = new NthUglyNumber(new int[] {2});
assertEquals(uglyNumbers.get(5), 32);
assertEquals(32, uglyNumbers.get(5));
}
@Test

2
src/test/java/com/thealgorithms/maths/PalindromeNumberTest.java
View File

@@ -25,6 +25,6 @@ public class PalindromeNumberTest {
@Test
public void testIfNegativeInputThenExceptionExpected() {
IllegalArgumentException exception = Assertions.assertThrows(IllegalArgumentException.class, () -> PalindromeNumber.isPalindrome(-1));
Assertions.assertEquals(exception.getMessage(), "Input parameter must not be negative!");
Assertions.assertEquals("Input parameter must not be negative!", exception.getMessage());
}
}

4
src/test/java/com/thealgorithms/maths/ParseIntegerTest.java
View File

@@ -14,13 +14,13 @@ public class ParseIntegerTest {
@Test
public void testNullInput() {
IllegalArgumentException exception = Assertions.assertThrows(IllegalArgumentException.class, () -> ParseInteger.parseInt(null));
Assertions.assertEquals(exception.getMessage(), NULL_PARAMETER_MESSAGE);
Assertions.assertEquals(NULL_PARAMETER_MESSAGE, exception.getMessage());
}
@Test
public void testEmptyInput() {
IllegalArgumentException exception = Assertions.assertThrows(IllegalArgumentException.class, () -> ParseInteger.parseInt(""));
Assertions.assertEquals(exception.getMessage(), EMPTY_PARAMETER_MESSAGE);
Assertions.assertEquals(EMPTY_PARAMETER_MESSAGE, exception.getMessage());
}
@Test

20
src/test/java/com/thealgorithms/maths/QuadraticEquationSolverTest.java
View File

@@ -14,10 +14,10 @@ public class QuadraticEquationSolverTest {
double c = 1.9;
ComplexNumber[] roots = quadraticEquationSolver.solveEquation(a, b, c);
Assertions.assertEquals(roots.length, 2);
Assertions.assertEquals(roots[0].real, -0.27810465435684306);
Assertions.assertEquals(2, roots.length, 2);
Assertions.assertEquals(-0.27810465435684306, roots[0].real);
Assertions.assertNull(roots[0].imaginary);
Assertions.assertEquals(roots[1].real, -1.6266572504050616);
Assertions.assertEquals(-1.6266572504050616, roots[1].real);
Assertions.assertNull(roots[1].imaginary);
}
@@ -29,8 +29,8 @@ public class QuadraticEquationSolverTest {
double c = 1;
ComplexNumber[] roots = quadraticEquationSolver.solveEquation(a, b, c);
Assertions.assertEquals(roots.length, 1);
Assertions.assertEquals(roots[0].real, -1);
Assertions.assertEquals(1, roots.length);
Assertions.assertEquals(-1, roots[0].real);
}
@Test
@@ -41,10 +41,10 @@ public class QuadraticEquationSolverTest {
double c = 5.6;
ComplexNumber[] roots = quadraticEquationSolver.solveEquation(a, b, c);
Assertions.assertEquals(roots.length, 2);
Assertions.assertEquals(roots[0].real, -0.8695652173913044);
Assertions.assertEquals(roots[0].imaginary, 1.2956229935435948);
Assertions.assertEquals(roots[1].real, -0.8695652173913044);
Assertions.assertEquals(roots[1].imaginary, -1.2956229935435948);
Assertions.assertEquals(2, roots.length);
Assertions.assertEquals(-0.8695652173913044, roots[0].real);
Assertions.assertEquals(1.2956229935435948, roots[0].imaginary);
Assertions.assertEquals(-0.8695652173913044, roots[1].real);
Assertions.assertEquals(-1.2956229935435948, roots[1].imaginary);
}
}

6
src/test/java/com/thealgorithms/maths/SecondMinMaxTest.java
View File

@@ -29,19 +29,19 @@ public class SecondMinMaxTest {
@Test
public void testForEmptyInputArray() {
IllegalArgumentException exception = assertThrows(IllegalArgumentException.class, () -> SecondMinMax.findSecondMin(new int[] {}));
assertEquals(exception.getMessage(), EXP_MSG_ARR_LEN_LESS_2);
assertEquals(EXP_MSG_ARR_LEN_LESS_2, exception.getMessage());
}
@Test
public void testForArrayWithSingleElement() {
IllegalArgumentException exception = assertThrows(IllegalArgumentException.class, () -> SecondMinMax.findSecondMax(new int[] {1}));
assertEquals(exception.getMessage(), EXP_MSG_ARR_LEN_LESS_2);
assertEquals(EXP_MSG_ARR_LEN_LESS_2, exception.getMessage());
}
@Test
public void testForArrayWithSameElements() {
IllegalArgumentException exception = assertThrows(IllegalArgumentException.class, () -> SecondMinMax.findSecondMin(new int[] {1, 1, 1, 1}));
assertEquals(exception.getMessage(), EXP_MSG_ARR_SAME_ELE);
assertEquals(EXP_MSG_ARR_SAME_ELE, exception.getMessage());
}
@ParameterizedTest

8
src/test/java/com/thealgorithms/maths/StandardDeviationTest.java
View File

@@ -8,19 +8,19 @@ public class StandardDeviationTest {
@Test
void test1() {
double[] t1 = new double[] {1, 1, 1, 1, 1};
Assertions.assertEquals(StandardDeviation.stdDev(t1), 0.0);
Assertions.assertEquals(0.0, StandardDeviation.stdDev(t1));
}
@Test
void test2() {
double[] t2 = new double[] {1, 2, 3, 4, 5, 6, 7, 8, 9, 10};
Assertions.assertEquals(StandardDeviation.stdDev(t2), 2.8722813232690143);
Assertions.assertEquals(2.8722813232690143, StandardDeviation.stdDev(t2));
}
@Test
void test3() {
double[] t3 = new double[] {1.1, 8.5, 20.3, 2.4, 6.2};
Assertions.assertEquals(StandardDeviation.stdDev(t3), 6.8308125431752265);
Assertions.assertEquals(6.8308125431752265, StandardDeviation.stdDev(t3));
}
@Test
@@ -32,6 +32,6 @@ public class StandardDeviationTest {
100.00045,
56.7,
};
Assertions.assertEquals(StandardDeviation.stdDev(t4), 38.506117353865775);
Assertions.assertEquals(38.506117353865775, StandardDeviation.stdDev(t4));
}
}

8
src/test/java/com/thealgorithms/maths/StandardScoreTest.java
View File

@@ -7,21 +7,21 @@ public class StandardScoreTest {
@Test
void test1() {
Assertions.assertEquals(StandardScore.zScore(2, 0, 5), 0.4);
Assertions.assertEquals(0.4, StandardScore.zScore(2, 0, 5));
}
@Test
void test2() {
Assertions.assertEquals(StandardScore.zScore(1, 1, 1), 0.0);
Assertions.assertEquals(0.0, StandardScore.zScore(1, 1, 1));
}
@Test
void test3() {
Assertions.assertEquals(StandardScore.zScore(2.5, 1.8, 0.7), 1.0);
Assertions.assertEquals(1.0, StandardScore.zScore(2.5, 1.8, 0.7));
}
@Test
void test4() {
Assertions.assertEquals(StandardScore.zScore(8.9, 3, 4.2), 1.4047619047619049);
Assertions.assertEquals(1.4047619047619049, StandardScore.zScore(8.9, 3, 4.2));
}
}

18
src/test/java/com/thealgorithms/maths/VolumeTest.java
View File

@@ -10,30 +10,30 @@ public class VolumeTest {
public void volume() {
/* test cube */
assertEquals(Volume.volumeCube(7), 343.0);
assertEquals(343.0, Volume.volumeCube(7));
/* test cuboid */
assertEquals(Volume.volumeCuboid(2, 5, 7), 70.0);
assertEquals(70.0, Volume.volumeCuboid(2, 5, 7));
/* test sphere */
assertEquals(Volume.volumeSphere(7), 1436.7550402417319);
assertEquals(1436.7550402417319, Volume.volumeSphere(7));
/* test cylinder */
assertEquals(Volume.volumeCylinder(3, 7), 197.92033717615698);
assertEquals(197.92033717615698, Volume.volumeCylinder(3, 7));
/* test hemisphere */
assertEquals(Volume.volumeHemisphere(7), 718.3775201208659);
assertEquals(718.3775201208659, Volume.volumeHemisphere(7));
/* test cone */
assertEquals(Volume.volumeCone(3, 7), 65.97344572538566);
assertEquals(65.97344572538566, Volume.volumeCone(3, 7));
/* test prism */
assertEquals(Volume.volumePrism(10, 2), 20.0);
assertEquals(20.0, Volume.volumePrism(10, 2));
/* test pyramid */
assertEquals(Volume.volumePyramid(10, 3), 10.0);
assertEquals(10.0, Volume.volumePyramid(10, 3));
/* test frustum */
assertEquals(Volume.volumeFrustumOfCone(3, 5, 7), 359.188760060433);
assertEquals(359.188760060433, Volume.volumeFrustumOfCone(3, 5, 7));
}
}