Merge pull request #8125 from eugenp/revert-8119-BAEL-3275-2

Revert "BAEL-3275: Using blocking queue for pub-sub"

java-numbers-2/src/test/java/com/baeldung/algorithms/primechecker/PrimeCheckerUnitTest.java

@@ -0,0 +1,68 @@
+package com.baeldung.algorithms.primechecker;
+
+import org.junit.Test;
+
+import static org.junit.Assert.assertFalse;
+import static org.junit.Assert.assertTrue;
+
+public class PrimeCheckerUnitTest {
+
+    private final BigIntegerPrimeChecker primeChecker = new BigIntegerPrimeChecker();
+
+    @Test
+    public void whenCheckIsPrime_thenTrue() {
+        assertTrue(primeChecker.isPrime(13l));
+        assertTrue(primeChecker.isPrime(1009L));
+        assertTrue(primeChecker.isPrime(74207281L));
+    }
+
+    @Test
+    public void whenCheckIsPrime_thenFalse() {
+        assertTrue(!primeChecker.isPrime(50L));
+        assertTrue(!primeChecker.isPrime(1001L));
+        assertTrue(!primeChecker.isPrime(74207282L));
+    }
+
+    private final BruteForcePrimeChecker bfPrimeChecker = new BruteForcePrimeChecker();
+
+    @Test
+    public void whenBFCheckIsPrime_thenTrue() {
+        assertTrue(bfPrimeChecker.isPrime(13));
+        assertTrue(bfPrimeChecker.isPrime(1009));
+    }
+
+    @Test
+    public void whenBFCheckIsPrime_thenFalse() {
+        assertFalse(bfPrimeChecker.isPrime(50));
+        assertFalse(bfPrimeChecker.isPrime(1001));
+    }
+
+    private final OptimisedPrimeChecker optimisedPrimeChecker = new OptimisedPrimeChecker();
+
+    @Test
+    public void whenOptCheckIsPrime_thenTrue() {
+        assertTrue(optimisedPrimeChecker.isPrime(13));
+        assertTrue(optimisedPrimeChecker.isPrime(1009));
+    }
+
+    @Test
+    public void whenOptCheckIsPrime_thenFalse() {
+        assertFalse(optimisedPrimeChecker.isPrime(50));
+        assertFalse(optimisedPrimeChecker.isPrime(1001));
+    }
+
+    private final PrimesPrimeChecker primesPrimeChecker = new PrimesPrimeChecker();
+
+    @Test
+    public void whenPrimesCheckIsPrime_thenTrue() {
+        assertTrue(primesPrimeChecker.isPrime(13));
+        assertTrue(primesPrimeChecker.isPrime(1009));
+    }
+
+    @Test
+    public void whenPrimesCheckIsPrime_thenFalse() {
+        assertFalse(primesPrimeChecker.isPrime(50));
+        assertFalse(primesPrimeChecker.isPrime(1001));
+    }
+
+}

java-numbers-2/src/test/java/com/baeldung/binarynumbers/BinaryNumbersUnitTest.java

@@ -0,0 +1,73 @@
+package com.baeldung.binarynumbers;
+
+import static org.junit.Assert.assertEquals;
+
+import org.junit.Test;
+
+public class BinaryNumbersUnitTest {
+
+    private BinaryNumbers binaryNumbers = new BinaryNumbers();
+
+    @Test
+    public void given_decimalNumber_then_returnBinaryNumber() {
+        assertEquals(Integer.valueOf(1000), binaryNumbers.convertDecimalToBinary(8));
+        assertEquals(Integer.valueOf(10100), binaryNumbers.convertDecimalToBinary(20));
+    }
+
+    @Test
+    public void given_decimalNumber_then_convertToBinaryNumber() {
+        assertEquals("1000", Integer.toBinaryString(8));
+        assertEquals("10100", Integer.toBinaryString(20));
+    }
+
+    @Test
+    public void given_binaryNumber_then_ConvertToDecimalNumber() {
+        assertEquals(8, Integer.parseInt("1000", 2));
+        assertEquals(20, Integer.parseInt("10100", 2));
+    }
+
+    @Test
+    public void given_binaryNumber_then_returnDecimalNumber() {
+        assertEquals(Integer.valueOf(8), binaryNumbers.convertBinaryToDecimal(1000));
+        assertEquals(Integer.valueOf(20), binaryNumbers.convertBinaryToDecimal(10100));
+    }
+
+    @Test
+    public void given_twoBinaryNumber_then_returnAddition() {
+        // adding 4 and 10
+        assertEquals(Integer.valueOf(1110), binaryNumbers.addBinaryNumber(100, 1010));
+
+        // adding 26 and 14
+        assertEquals(Integer.valueOf(101000), binaryNumbers.addBinaryNumber(11010, 1110));
+    }
+
+    @Test
+    public void given_twoBinaryNumber_then_returnSubtraction() {
+        // subtracting 16 from 25
+        assertEquals(Integer.valueOf(1001), binaryNumbers.substractBinaryNumber(11001, 10000));
+
+        // subtracting 29 from 16, the output here is negative
+        assertEquals(Integer.valueOf(1101), binaryNumbers.substractBinaryNumber(10000, 11101));
+    }
+
+    @Test
+    public void given_binaryLiteral_thenReturnDecimalValue() {
+
+        byte five = 0b101;
+        assertEquals((byte) 5, five);
+
+        short three = 0b11;
+        assertEquals((short) 3, three);
+
+        int nine = 0B1001;
+        assertEquals(9, nine);
+
+        long twentyNine = 0B11101;
+        assertEquals(29, twentyNine);
+
+        int minusThirtySeven = -0B100101;
+        assertEquals(-37, minusThirtySeven);
+
+    }
+
+}

java-numbers-2/src/test/java/com/baeldung/java/math/MathUnitTest.java

@@ -0,0 +1,175 @@
+package com.baeldung.java.math;
+
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+public class MathUnitTest {
+
+    @Test
+    public void whenAbsInteger_thenReturnAbsoluteValue() {
+        assertEquals(5,Math.abs(-5));
+    }
+
+    @Test
+    public void whenMaxBetweenTwoValue_thenReturnMaximum() {
+        assertEquals(10, Math.max(5,10));
+    }
+
+    @Test
+    public void whenMinBetweenTwoValue_thenReturnMinimum() {
+        assertEquals(5, Math.min(5,10));
+    }
+
+    @Test
+    public void whenSignumWithNegativeNumber_thenReturnMinusOne() {
+        assertEquals(-1, Math.signum(-5), 0);
+    }
+
+    @Test
+    public void whenCopySignWithNegativeSign_thenReturnNegativeArgument() {
+        assertEquals(-5, Math.copySign(5,-1), 0);
+    }
+
+    @Test
+    public void whenPow_thenReturnPoweredValue() {
+        assertEquals(25, Math.pow(5,2),0);
+    }
+
+    @Test
+    public void whenSqrt_thenReturnSquareRoot() {
+        assertEquals(5, Math.sqrt(25),0);
+    }
+
+    @Test
+    public void whenCbrt_thenReturnCubeRoot() {
+        assertEquals(5, Math.cbrt(125),0);
+    }
+
+    @Test
+    public void whenExp_thenReturnEulerNumberRaised() {
+        assertEquals(2.718, Math.exp(1),0.1);
+    }
+
+    @Test
+    public void whenExpm1_thenReturnEulerNumberMinusOne() {
+        assertEquals(1.718, Math.expm1(1),0.1);
+    }
+
+    @Test
+    public void whenGetExponent_thenReturnUnbiasedExponent() {
+        assertEquals(8, Math.getExponent(333.3),0);
+        assertEquals(7, Math.getExponent(222.2f),0);
+    }
+
+    @Test
+    public void whenLog_thenReturnValue() {
+        assertEquals(1, Math.log(Math.E),0);
+    }
+
+    @Test
+    public void whenLog10_thenReturnValue() {
+        assertEquals(1, Math.log10(10),0);
+    }
+
+    @Test
+    public void whenLog1p_thenReturnValue() {
+        assertEquals(1.31, Math.log1p(Math.E),0.1);
+    }
+
+    @Test
+    public void whenSin_thenReturnValue() {
+        assertEquals(1, Math.sin(Math.PI/2),0);
+    }
+
+    @Test
+    public void whenCos_thenReturnValue() {
+        assertEquals(1, Math.cos(0),0);
+    }
+
+    @Test
+    public void whenTan_thenReturnValue() {
+        assertEquals(1, Math.tan(Math.PI/4),0.1);
+    }
+
+    @Test
+    public void whenAsin_thenReturnValue() {
+        assertEquals(Math.PI/2, Math.asin(1),0);
+    }
+
+    @Test
+    public void whenAcos_thenReturnValue() {
+        assertEquals(Math.PI/2, Math.acos(0),0);
+    }
+
+    @Test
+    public void whenAtan_thenReturnValue() {
+        assertEquals(Math.PI/4, Math.atan(1),0);
+    }
+
+    @Test
+    public void whenAtan2_thenReturnValue() {
+        assertEquals(Math.PI/4, Math.atan2(1,1),0);
+    }
+
+    @Test
+    public void whenToDegrees_thenReturnValue() {
+        assertEquals(180, Math.toDegrees(Math.PI),0);
+    }
+
+    @Test
+    public void whenToRadians_thenReturnValue() {
+        assertEquals(Math.PI, Math.toRadians(180),0);
+    }
+
+    @Test
+    public void whenCeil_thenReturnValue() {
+        assertEquals(4, Math.ceil(Math.PI),0);
+    }
+
+    @Test
+    public void whenFloor_thenReturnValue() {
+        assertEquals(3, Math.floor(Math.PI),0);
+    }
+
+    @Test
+    public void whenGetExponent_thenReturnValue() {
+        assertEquals(8, Math.getExponent(333.3),0);
+    }
+
+    @Test
+    public void whenIEEERemainder_thenReturnValue() {
+        assertEquals(1.0, Math.IEEEremainder(5,2),0);
+    }
+
+    @Test
+    public void whenNextAfter_thenReturnValue() {
+        assertEquals(1.9499999284744263, Math.nextAfter(1.95f,1),0.0000001);
+    }
+
+    @Test
+    public void whenNextUp_thenReturnValue() {
+        assertEquals(1.9500002, Math.nextUp(1.95f),0.0000001);
+    }
+
+    @Test
+    public void whenRint_thenReturnValue() {
+        assertEquals(2.0, Math.rint(1.95f),0.0);
+    }
+
+    @Test
+    public void whenRound_thenReturnValue() {
+        assertEquals(2.0, Math.round(1.95f),0.0);
+    }
+
+    @Test
+    public void whenScalb_thenReturnValue() {
+        assertEquals(48, Math.scalb(3, 4),0.0);
+    }
+
+    @Test
+    public void whenHypot_thenReturnValue() {
+        assertEquals(5, Math.hypot(4, 3),0.0);
+    }
+
+}

java-numbers-2/src/test/java/com/baeldung/lcm/BigIntegerLCMUnitTest.java

@@ -0,0 +1,18 @@
+package com.baeldung.lcm;
+
+
+import org.junit.Assert;
+import org.junit.Test;
+
+import java.math.BigInteger;
+
+public class BigIntegerLCMUnitTest {
+
+    @Test
+    public void testLCM() {
+        BigInteger number1 = new BigInteger("12");
+        BigInteger number2 = new BigInteger("18");
+        BigInteger expectedLCM = new BigInteger("36");
+        Assert.assertEquals(expectedLCM, BigIntegerLCM.lcm(number1, number2));
+    }
+}

java-numbers-2/src/test/java/com/baeldung/lcm/EuclideanAlgorithmUnitTest.java

@@ -0,0 +1,27 @@
+package com.baeldung.lcm;
+
+import org.junit.Assert;
+import org.junit.Test;
+
+public class EuclideanAlgorithmUnitTest {
+
+    @Test
+    public void testGCD() {
+        Assert.assertEquals(6, EuclideanAlgorithm.gcd(12, 18));
+    }
+
+    @Test
+    public void testLCM() {
+        Assert.assertEquals(36, EuclideanAlgorithm.lcm(12, 18));
+    }
+
+    @Test
+    public void testLCMForArray() {
+        Assert.assertEquals(15, EuclideanAlgorithm.lcmForArray(new int[]{3, 5, 15}));
+    }
+
+    @Test
+    public void testLCMByLambdaForArray() {
+        Assert.assertEquals(15, EuclideanAlgorithm.lcmByLambda(new int[]{3, 5, 15}));
+    }
+}

java-numbers-2/src/test/java/com/baeldung/lcm/PrimeFactorizationAlgorithmUnitTest.java

@@ -0,0 +1,30 @@
+package com.baeldung.lcm;
+
+import org.junit.Assert;
+import org.junit.Test;
+
+import java.util.HashMap;
+import java.util.Map;
+
+import static com.baeldung.lcm.PrimeFactorizationAlgorithm.*;
+
+
+public class PrimeFactorizationAlgorithmUnitTest {
+
+    @Test
+    public void testGetPrimeFactors() {
+        Map<Integer, Integer> expectedPrimeFactorsMapForTwelve = new HashMap<>();
+        expectedPrimeFactorsMapForTwelve.put(2, 2);
+        expectedPrimeFactorsMapForTwelve.put(3, 1);
+        Map<Integer, Integer> expectedPrimeFactorsMapForEighteen = new HashMap<>();
+        expectedPrimeFactorsMapForEighteen.put(2, 1);
+        expectedPrimeFactorsMapForEighteen.put(3, 2);
+        Assert.assertEquals(expectedPrimeFactorsMapForTwelve, getPrimeFactors(12));
+        Assert.assertEquals(expectedPrimeFactorsMapForEighteen, getPrimeFactors(18));
+    }
+
+    @Test
+    public void testLCM() {
+        Assert.assertEquals(36, PrimeFactorizationAlgorithm.lcm(12, 18));
+    }
+}

java-numbers-2/src/test/java/com/baeldung/lcm/SimpleAlgorithmUnitTest.java

@@ -0,0 +1,15 @@
+package com.baeldung.lcm;
+
+import org.junit.Assert;
+import org.junit.Test;
+
+import static com.baeldung.lcm.SimpleAlgorithm.*;
+
+public class SimpleAlgorithmUnitTest {
+
+    @Test
+    public void testLCM() {
+        Assert.assertEquals(36, lcm(12, 18));
+    }
+
+}

java-numbers-2/src/test/java/com/baeldung/lossyconversion/ConversionTechniquesUnitTest.java

@@ -0,0 +1,68 @@
+package com.baeldung.lossyconversion;
+
+import static org.junit.Assert.assertEquals;
+import static org.junit.Assert.assertTrue;
+
+import org.junit.jupiter.api.Test;
+
+public class ConversionTechniquesUnitTest {
+
+    @Test
+    public void testPrimitiveConversion() {
+        
+        long longNum = 24;
+        short shortNum = (short) longNum;
+        assertEquals(24, shortNum);
+
+        double doubleNum = 15.6;
+        int integerNum = (int) doubleNum;
+        assertEquals(15, integerNum);
+        
+        long largeLongNum = 32768;
+        short minShortNum = (short) largeLongNum;
+        assertEquals(-32768, minShortNum);
+        
+        long smallLongNum = -32769;
+        short maxShortNum = (short) smallLongNum;
+        assertEquals(32767, maxShortNum);
+        
+        long maxLong = Long.MAX_VALUE;
+        int minInt = (int) maxLong;
+        assertEquals(-1, minInt);
+        
+        long minLong = Long.MIN_VALUE;
+        int maxInt = (int) minLong;
+        assertEquals(0, maxInt);
+    }
+
+    @Test
+    public void testWrapperToPrimitiveConversion() {
+
+        Float floatNum = 17.564f;
+        long longNum = floatNum.longValue();
+        assertEquals(17, longNum);
+
+        Double doubleNum = 15.9999;
+        longNum = doubleNum.longValue();
+        assertEquals(15, longNum);
+    }
+
+    @Test
+    public void testWrapperToPrimitiveConversionUsingMathRound() {
+
+        Double doubleNum = 15.9999;
+        long longNum = Math.round(doubleNum);
+        assertEquals(16, longNum);
+    }
+    
+    @Test
+    public void testWrapperConversion() {
+
+        Double doubleNum = 10.3;
+        double dbl = doubleNum.doubleValue(); //unboxing
+        int intgr = (int) dbl; //downcasting
+        Integer intNum = Integer.valueOf(intgr);
+        assertEquals(Integer.valueOf(10), intNum);
+    }
+    
+}

java-numbers-2/src/test/java/com/baeldung/numbersinrange/NumbersInARangeUnitTest.java

@@ -0,0 +1,43 @@
+package com.baeldung.numbersinrange;
+
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import java.util.Arrays;
+import java.util.List;
+
+import org.junit.Test;
+
+public class NumbersInARangeUnitTest {
+
+    @Test
+    public void givenTheRange1To10_andUsingForLoop_thenExpectCorrectResult() {
+        NumbersInARange numbersInARange = new NumbersInARange();
+        List<Integer> numbers = numbersInARange.getNumbersInRange(1, 10);
+        
+        assertEquals(Arrays.asList(1,2,3,4,5,6,7,8,9), numbers);
+    }
+    
+    @Test
+    public void givenTheRange1To10_andUsingIntStreamRange_thenExpectCorrectResult() {
+        NumbersInARange numbersInARange = new NumbersInARange();
+        List<Integer> numbers = numbersInARange.getNumbersUsingIntStreamRange(1, 10);
+        
+        assertEquals(Arrays.asList(1,2,3,4,5,6,7,8,9), numbers);
+    }
+    
+    @Test
+    public void givenTheRange1To10_andUsingIntStreamRangeClosed_thenExpectCorrectResult() {
+        NumbersInARange numbersInARange = new NumbersInARange();
+        List<Integer> numbers = numbersInARange.getNumbersUsingIntStreamRangeClosed(1, 10);
+        
+        assertEquals(Arrays.asList(1,2,3,4,5,6,7,8,9,10), numbers);
+    }
+    
+    @Test
+    public void givenTheRange1To10_andUsingIntStreamIterate_thenExpectCorrectResult() {
+        NumbersInARange numbersInARange = new NumbersInARange();
+        List<Integer> numbers = numbersInARange.getNumbersUsingIntStreamIterate(1, 10);
+        
+        assertEquals(Arrays.asList(1,2,3,4,5,6,7,8,9,10), numbers);
+    }
+}

java-numbers-2/src/test/java/com/baeldung/numbersinrange/RandomNumbersInARangeUnitTest.java

@@ -0,0 +1,35 @@
+package com.baeldung.numbersinrange;
+
+import static org.junit.Assert.assertTrue;
+
+import org.junit.Test;
+
+public class RandomNumbersInARangeUnitTest {
+
+    @Test
+    public void givenTheRange1To10_andUsingMathRandom_thenExpectCorrectResult() {
+        RandomNumbersInARange randomNumbersInARange = new RandomNumbersInARange();
+        int number = randomNumbersInARange.getRandomNumber(1, 10);
+
+        assertTrue(number >= 1);
+        assertTrue(number < 10);
+    }
+
+    @Test
+    public void givenTheRange1To10_andUsingRandomInts_thenExpectCorrectResult() {
+        RandomNumbersInARange randomNumbersInARange = new RandomNumbersInARange();
+        int number = randomNumbersInARange.getRandomNumberUsingInts(1, 10);
+
+        assertTrue(number >= 1);
+        assertTrue(number < 10);
+    }
+
+    @Test
+    public void givenTheRange1To10_andUsingRandomNextInt_thenExpectCorrectResult() {
+        RandomNumbersInARange randomNumbersInARange = new RandomNumbersInARange();
+        int number = randomNumbersInARange.getRandomNumberUsingNextInt(1, 10);
+
+        assertTrue(number >= 1);
+        assertTrue(number < 10);
+    }
+}

java-numbers-2/src/test/java/com/baeldung/prime/PrimeGeneratorUnitTest.java

@@ -0,0 +1,29 @@
+package com.baeldung.prime;
+
+import org.junit.Test;
+
+import java.util.Arrays;
+import java.util.List;
+
+import static com.baeldung.prime.PrimeGenerator.*;
+import static org.junit.Assert.*;
+
+public class PrimeGeneratorUnitTest {
+    @Test
+    public void whenBruteForced_returnsSuccessfully() {
+        final List<Integer> primeNumbers = primeNumbersBruteForce(20);
+        assertEquals(Arrays.asList(new Integer[] { 2, 3, 5, 7, 11, 13, 17, 19 }), primeNumbers);
+    }
+
+    @Test
+    public void whenOptimized_returnsSuccessfully() {
+        final List<Integer> primeNumbers = primeNumbersTill(20);
+        assertEquals(Arrays.asList(new Integer[] { 2, 3, 5, 7, 11, 13, 17, 19 }), primeNumbers);
+    }
+
+    @Test
+    public void whenSieveOfEratosthenes_returnsSuccessfully() {
+        final List<Integer> primeNumbers = sieveOfEratosthenes(20);
+        assertEquals(Arrays.asList(new Integer[] { 2, 3, 5, 7, 11, 13, 17, 19 }), primeNumbers);
+    }
+}