Merge branch 'master' into bael-16656

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/astar/Graph.java

@@ -0,0 +1,30 @@
+package com.baeldung.algorithms.astar;
+
+import java.util.Map;
+import java.util.Set;
+import java.util.stream.Collectors;
+
+
+public class Graph<T extends GraphNode> {
+    private final Set<T> nodes;
+
+    private final Map<String, Set<String>> connections;
+
+    public Graph(Set<T> nodes, Map<String, Set<String>> connections) {
+        this.nodes = nodes;
+        this.connections = connections;
+    }
+
+    public T getNode(String id) {
+        return nodes.stream()
+            .filter(node -> node.getId().equals(id))
+            .findFirst()
+            .orElseThrow(() -> new IllegalArgumentException("No node found with ID"));
+    }
+
+    public Set<T> getConnections(T node) {
+        return connections.get(node.getId()).stream()
+            .map(this::getNode)
+            .collect(Collectors.toSet());
+    }
+}

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/astar/GraphNode.java

@@ -0,0 +1,5 @@
+package com.baeldung.algorithms.astar;
+
+public interface GraphNode {
+    String getId();
+}

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/astar/RouteFinder.java

@@ -0,0 +1,66 @@
+package com.baeldung.algorithms.astar;
+
+import java.util.ArrayList;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Map;
+import java.util.PriorityQueue;
+import java.util.Queue;
+import java.util.stream.Collectors;
+
+public class RouteFinder<T extends GraphNode> {
+    private final Graph<T> graph;
+    private final Scorer<T> nextNodeScorer;
+    private final Scorer<T> targetScorer;
+
+    public RouteFinder(Graph<T> graph, Scorer<T> nextNodeScorer, Scorer<T> targetScorer) {
+        this.graph = graph;
+        this.nextNodeScorer = nextNodeScorer;
+        this.targetScorer = targetScorer;
+    }
+
+    public List<T> findRoute(T from, T to) {
+        Map<T, RouteNode<T>> allNodes = new HashMap<>();
+        Queue<RouteNode> openSet = new PriorityQueue<>();
+
+        RouteNode<T> start = new RouteNode<>(from, null, 0d, targetScorer.computeCost(from, to));
+        allNodes.put(from, start);
+        openSet.add(start);
+
+        while (!openSet.isEmpty()) {
+            System.out.println("Open Set contains: " + openSet.stream().map(RouteNode::getCurrent).collect(Collectors.toSet()));
+            RouteNode<T> next = openSet.poll();
+            System.out.println("Looking at node: " + next);
+            if (next.getCurrent().equals(to)) {
+                System.out.println("Found our destination!");
+
+                List<T> route = new ArrayList<>();
+                RouteNode<T> current = next;
+                do {
+                    route.add(0, current.getCurrent());
+                    current = allNodes.get(current.getPrevious());
+                } while (current != null);
+
+                System.out.println("Route: " + route);
+                return route;
+            }
+
+            graph.getConnections(next.getCurrent()).forEach(connection -> {
+                double newScore = next.getRouteScore() + nextNodeScorer.computeCost(next.getCurrent(), connection);
+                RouteNode<T> nextNode = allNodes.getOrDefault(connection, new RouteNode<>(connection));
+                allNodes.put(connection, nextNode);
+
+                if (nextNode.getRouteScore() > newScore) {
+                    nextNode.setPrevious(next.getCurrent());
+                    nextNode.setRouteScore(newScore);
+                    nextNode.setEstimatedScore(newScore + targetScorer.computeCost(connection, to));
+                    openSet.add(nextNode);
+                    System.out.println("Found a better route to node: " + nextNode);
+                }
+            });
+        }
+
+        throw new IllegalStateException("No route found");
+    }
+
+}

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/astar/RouteNode.java

@@ -0,0 +1,67 @@
+package com.baeldung.algorithms.astar;
+
+import java.util.StringJoiner;
+
+class RouteNode<T extends GraphNode> implements Comparable<RouteNode> {
+    private final T current;
+    private T previous;
+    private double routeScore;
+    private double estimatedScore;
+
+    RouteNode(T current) {
+        this(current, null, Double.POSITIVE_INFINITY, Double.POSITIVE_INFINITY);
+    }
+
+    RouteNode(T current, T previous, double routeScore, double estimatedScore) {
+        this.current = current;
+        this.previous = previous;
+        this.routeScore = routeScore;
+        this.estimatedScore = estimatedScore;
+    }
+
+    T getCurrent() {
+        return current;
+    }
+
+    T getPrevious() {
+        return previous;
+    }
+
+    double getRouteScore() {
+        return routeScore;
+    }
+
+    double getEstimatedScore() {
+        return estimatedScore;
+    }
+
+    void setPrevious(T previous) {
+        this.previous = previous;
+    }
+
+    void setRouteScore(double routeScore) {
+        this.routeScore = routeScore;
+    }
+
+    void setEstimatedScore(double estimatedScore) {
+        this.estimatedScore = estimatedScore;
+    }
+
+    @Override
+    public int compareTo(RouteNode other) {
+        if (this.estimatedScore > other.estimatedScore) {
+            return 1;
+        } else if (this.estimatedScore < other.estimatedScore) {
+            return -1;
+        } else {
+            return 0;
+        }
+    }
+
+    @Override
+    public String toString() {
+        return new StringJoiner(", ", RouteNode.class.getSimpleName() + "[", "]").add("current=" + current)
+            .add("previous=" + previous).add("routeScore=" + routeScore).add("estimatedScore=" + estimatedScore)
+            .toString();
+    }
+}

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/astar/Scorer.java

@@ -0,0 +1,5 @@
+package com.baeldung.algorithms.astar;
+
+public interface Scorer<T extends GraphNode> {
+    double computeCost(T from, T to);
+}

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/astar/underground/HaversineScorer.java

@@ -0,0 +1,19 @@
+package com.baeldung.algorithms.astar.underground;
+
+import com.baeldung.algorithms.astar.Scorer;
+
+public class HaversineScorer implements Scorer<Station> {
+    @Override
+    public double computeCost(Station from, Station to) {
+        double R = 6372.8; // In kilometers
+
+        double dLat = Math.toRadians(to.getLatitude() - from.getLatitude());
+        double dLon = Math.toRadians(to.getLongitude() - from.getLongitude());
+        double lat1 = Math.toRadians(from.getLatitude());
+        double lat2 = Math.toRadians(to.getLatitude());
+
+        double a = Math.pow(Math.sin(dLat / 2),2) + Math.pow(Math.sin(dLon / 2),2) * Math.cos(lat1) * Math.cos(lat2);
+        double c = 2 * Math.asin(Math.sqrt(a));
+        return R * c;
+    }
+}

algorithms-miscellaneous-2/src/test/java/com/baeldung/algorithms/astar/underground/Station.java

@@ -0,0 +1,42 @@
+package com.baeldung.algorithms.astar.underground;
+
+import java.util.StringJoiner;
+
+import com.baeldung.algorithms.astar.GraphNode;
+
+public class Station implements GraphNode {
+    private final String id;
+    private final String name;
+    private final double latitude;
+    private final double longitude;
+
+    public Station(String id, String name, double latitude, double longitude) {
+        this.id = id;
+        this.name = name;
+        this.latitude = latitude;
+        this.longitude = longitude;
+    }
+
+    @Override
+    public String getId() {
+        return id;
+    }
+
+    public String getName() {
+        return name;
+    }
+
+    public double getLatitude() {
+        return latitude;
+    }
+
+    public double getLongitude() {
+        return longitude;
+    }
+
+    @Override
+    public String toString() {
+        return new StringJoiner(", ", Station.class.getSimpleName() + "[", "]").add("id='" + id + "'")
+            .add("name='" + name + "'").add("latitude=" + latitude).add("longitude=" + longitude).toString();
+    }
+}

algorithms-miscellaneous-4/src/main/java/com/baeldung/algorithms/smallestinteger/SmallestMissingPositiveInteger.java

@@ -0,0 +1,37 @@
+package com.baeldung.algorithms.smallestinteger;
+
+import java.util.Arrays;
+
+public class SmallestMissingPositiveInteger {
+    public static int searchInSortedArray(int[] input) {
+        for (int i = 0; i < input.length; i++) {
+            if (i != input[i]) {
+                return i;
+            }
+        }
+
+        return input.length;
+    }
+
+    public static int searchInUnsortedArraySortingFirst(int[] input) {
+        Arrays.sort(input);
+        return searchInSortedArray(input);
+    }
+
+    public static int searchInUnsortedArrayBooleanArray(int[] input) {
+        boolean[] flags = new boolean[input.length];
+        for (int number : input) {
+            if (number < flags.length) {
+                flags[number] = true;
+            }
+        }
+
+        for (int i = 0; i < flags.length; i++) {
+            if (!flags[i]) {
+                return i;
+            }
+        }
+
+        return flags.length;
+    }
+}

algorithms-miscellaneous-4/src/test/java/com/baeldung/algorithms/smallestinteger/SmallestMissingPositiveIntegerUnitTest.java

@@ -0,0 +1,88 @@
+package com.baeldung.algorithms.smallestinteger;
+
+import org.junit.jupiter.api.Test;
+
+import static org.assertj.core.api.Assertions.assertThat;
+
+class SmallestMissingPositiveIntegerUnitTest {
+    @Test
+    void givenArrayWithThreeMissing_whenSearchInSortedArray_thenThree() {
+        int[] input = new int[] {0, 1, 2, 4, 5};
+
+        int result = SmallestMissingPositiveInteger.searchInSortedArray(input);
+
+        assertThat(result).isEqualTo(3);
+    }
+
+    @Test
+    void givenArrayWithOneAndThreeMissing_whenSearchInSortedArray_thenOne() {
+        int[] input = new int[] {0, 2, 4, 5};
+
+        int result = SmallestMissingPositiveInteger.searchInSortedArray(input);
+
+        assertThat(result).isEqualTo(1);
+    }
+
+    @Test
+    void givenArrayWithoutMissingInteger_whenSearchInSortedArray_thenArrayLength() {
+        int[] input = new int[] {0, 1, 2, 3, 4, 5};
+
+        int result = SmallestMissingPositiveInteger.searchInSortedArray(input);
+
+        assertThat(result).isEqualTo(input.length);
+    }
+
+    @Test
+    void givenArrayWithThreeMissing_whenSearchInUnsortedArraySortingFirst_thenThree() {
+        int[] input = new int[] {1, 4, 0, 5, 2};
+
+        int result = SmallestMissingPositiveInteger.searchInUnsortedArraySortingFirst(input);
+
+        assertThat(result).isEqualTo(3);
+    }
+
+    @Test
+    void givenArrayWithOneAndThreeMissing_whenSearchInUnsortedArraySortingFirst_thenOne() {
+        int[] input = new int[] {4, 2, 0, 5};
+
+        int result = SmallestMissingPositiveInteger.searchInUnsortedArraySortingFirst(input);
+
+        assertThat(result).isEqualTo(1);
+    }
+
+    @Test
+    void givenArrayWithoutMissingInteger_whenSearchInUnsortedArraySortingFirst_thenArrayLength() {
+        int[] input = new int[] {4, 5, 1, 3, 0, 2};
+
+        int result = SmallestMissingPositiveInteger.searchInUnsortedArraySortingFirst(input);
+
+        assertThat(result).isEqualTo(input.length);
+    }
+
+    @Test
+    void givenArrayWithThreeMissing_whenSearchInUnsortedArrayBooleanArray_thenThree() {
+        int[] input = new int[] {1, 4, 0, 5, 2};
+
+        int result = SmallestMissingPositiveInteger.searchInUnsortedArrayBooleanArray(input);
+
+        assertThat(result).isEqualTo(3);
+    }
+
+    @Test
+    void givenArrayWithOneAndThreeMissing_whenSearchInUnsortedArrayBooleanArray_thenOne() {
+        int[] input = new int[] {4, 2, 0, 5};
+
+        int result = SmallestMissingPositiveInteger.searchInUnsortedArrayBooleanArray(input);
+
+        assertThat(result).isEqualTo(1);
+    }
+
+    @Test
+    void givenArrayWithoutMissingInteger_whenSearchInUnsortedArrayBooleanArray_thenArrayLength() {
+        int[] input = new int[] {4, 5, 1, 3, 0, 2};
+
+        int result = SmallestMissingPositiveInteger.searchInUnsortedArrayBooleanArray(input);
+
+        assertThat(result).isEqualTo(input.length);
+    }
+}

algorithms-miscellaneous-5/src/main/java/com/baeldung/algorithms/binarygap/BinaryGap.java

@@ -0,0 +1,17 @@
+package com.baeldung.algorithms.binarygap;
+
+public class BinaryGap {
+    static int calculateBinaryGap(int n) {
+        return calculateBinaryGap(n >>> Integer.numberOfTrailingZeros(n), 0, 0);
+    }
+
+    static int calculateBinaryGap(int n, int current, int maximum) {
+        if (n == 0) {
+            return maximum;
+        } else if ((n & 1) == 0) {
+            return calculateBinaryGap(n >>> 1, current + 1, maximum);
+        } else {
+            return calculateBinaryGap(n >>> 1, 0, Math.max(maximum, current));
+        }
+    }
+}

algorithms-miscellaneous-5/src/test/java/com/baeldung/algorithms/binarygap/BinaryGapUnitTest.java

@@ -0,0 +1,34 @@
+package com.baeldung.algorithms.binarygap;
+
+import static com.baeldung.algorithms.binarygap.BinaryGap.calculateBinaryGap;
+import static org.junit.jupiter.api.Assertions.assertEquals;
+
+import org.junit.jupiter.api.Test;
+
+public class BinaryGapUnitTest {
+
+    @Test public void givenNoOccurrenceOfBoundedZeros_whenCalculateBinaryGap_thenOutputCorrectResult() {
+
+        int result = calculateBinaryGap(63);
+        assertEquals(0, result);
+    }
+
+    @Test public void givenTrailingZeros_whenCalculateBinaryGap_thenOutputCorrectResult() {
+
+        int result = calculateBinaryGap(40);
+        assertEquals(1, result);
+    }
+
+    @Test public void givenSingleOccurrenceOfBoundedZeros_whenCalculateBinaryGap_thenOutputCorrectResult() {
+
+        int result = calculateBinaryGap(9);
+        assertEquals(2, result);
+    }
+
+    @Test public void givenMultipleOccurrenceOfBoundedZeros_whenCalculateBinaryGap_thenOutputCorrectResult() {
+
+        int result = calculateBinaryGap(145);
+        assertEquals(3, result);
+    }
+
+}

core-java-modules/README.md

@@ -5,6 +5,5 @@ This module contains modules about core Java
 ## Relevant articles:
 
 - [Multi-Module Maven Application with Java Modules](https://www.baeldung.com/maven-multi-module-project-java-jpms)
-- [Guide to Java FileChannel](https://www.baeldung.com/java-filechannel)
 - [Understanding the NumberFormatException in Java](https://www.baeldung.com/java-number-format-exception)
 - [Will an Error Be Caught by Catch Block in Java?](https://www.baeldung.com/java-error-catch)

core-java-modules/core-java-11/pom.xml

@@ -29,6 +29,27 @@
             <version>${assertj.version}</version>
             <scope>test</scope>
         </dependency>
+        <dependency>
+            <groupId>org.openjdk.jmh</groupId>
+            <artifactId>jmh-core</artifactId>
+            <version>${jmh.version}</version>
+        </dependency>
+        <dependency>
+            <groupId>org.openjdk.jmh</groupId>
+            <artifactId>jmh-generator-annprocess</artifactId>
+            <version>${jmh.version}</version>
+            <scope>provided</scope>
+        </dependency>
+        <dependency>
+            <groupId>org.eclipse.collections</groupId>
+            <artifactId>eclipse-collections</artifactId>
+            <version>10.0.0</version>
+        </dependency>
+        <dependency>
+            <groupId>org.eclipse.collections</groupId>
+            <artifactId>eclipse-collections-api</artifactId>
+            <version>10.0.0</version>
+        </dependency>
     </dependencies>
 
     <build>
@@ -42,6 +63,42 @@
                     <target>${maven.compiler.target.version}</target>
                 </configuration>
             </plugin>
+            <plugin>
+                <groupId>org.apache.maven.plugins</groupId>
+                <artifactId>maven-shade-plugin</artifactId>
+                <version>3.2.1</version>
+                <executions>
+                    <execution>
+                        <phase>package</phase>
+                        <goals>
+                            <goal>shade</goal>
+                        </goals>
+                        <configuration>
+                            <finalName>${uberjar.name}</finalName>
+                            <transformers>
+                                <transformer implementation="org.apache.maven.plugins.shade.resource.ManifestResourceTransformer">
+                                    <mainClass>org.openjdk.jmh.Main</mainClass>
+                                </transformer>
+                                <transformer implementation="org.apache.maven.plugins.shade.resource.ServicesResourceTransformer"/>
+                            </transformers>
+                            <filters>
+                                <filter>
+                                    <!--
+                                        Shading signed JARs will fail without this.
+                                        http://stackoverflow.com/questions/999489/invalid-signature-file-when-attempting-to-run-a-jar
+                                    -->
+                                    <artifact>*:*</artifact>
+                                    <excludes>
+                                        <exclude>META-INF/*.SF</exclude>
+                                        <exclude>META-INF/*.DSA</exclude>
+                                        <exclude>META-INF/*.RSA</exclude>
+                                    </excludes>
+                                </filter>
+                            </filters>
+                        </configuration>
+                    </execution>
+                </executions>
+            </plugin>
         </plugins>
     </build>
 
@@ -50,6 +107,7 @@
         <maven.compiler.target.version>11</maven.compiler.target.version>
         <guava.version>27.1-jre</guava.version>
         <assertj.version>3.11.1</assertj.version>
+        <uberjar.name>benchmarks</uberjar.name>
+        <jmh.version>1.22</jmh.version>
     </properties>
-
 </project>

core-java-modules/core-java-11/src/main/java/com/baeldung/benchmark/IntegerListFilter.java

@@ -0,0 +1,70 @@
+package com.baeldung.benchmark;
+
+import org.eclipse.collections.api.list.MutableList;
+import org.eclipse.collections.api.list.primitive.IntList;
+import org.eclipse.collections.api.list.primitive.MutableIntList;
+import org.eclipse.collections.impl.factory.primitive.IntLists;
+import org.eclipse.collections.impl.list.mutable.FastList;
+import org.eclipse.collections.impl.list.mutable.primitive.IntArrayList;
+import org.openjdk.jmh.annotations.*;
+
+import java.util.ArrayList;
+import java.util.List;
+import java.util.PrimitiveIterator;
+import java.util.Random;
+import java.util.concurrent.ExecutorService;
+import java.util.concurrent.Executors;
+import java.util.concurrent.TimeUnit;
+import java.util.stream.Collectors;
+
+@State(Scope.Benchmark)
+@BenchmarkMode(Mode.Throughput)
+@OutputTimeUnit(TimeUnit.SECONDS)
+@Fork(2)
+public class IntegerListFilter {
+
+    private List<Integer> jdkIntList;
+    private MutableList<Integer> ecMutableList;
+    private IntList ecIntList;
+    private ExecutorService executor;
+
+    @Setup
+    public void setup() {
+        PrimitiveIterator.OfInt iterator = new Random(1L).ints(-10000, 10000).iterator();
+        ecMutableList = FastList.newWithNValues(1_000_000, iterator::nextInt);
+        jdkIntList = new ArrayList<>(1_000_000);
+        jdkIntList.addAll(ecMutableList);
+        ecIntList = ecMutableList.collectInt(i -> i, new IntArrayList(1_000_000));
+        executor = Executors.newWorkStealingPool();
+    }
+
+    @Benchmark
+    public List<Integer> jdkList() {
+        return jdkIntList.stream().filter(i -> i % 5 == 0).collect(Collectors.toList());
+    }
+
+    @Benchmark
+    public MutableList<Integer> ecMutableList() {
+        return ecMutableList.select(i -> i % 5 == 0);
+    }
+
+    @Benchmark
+    public List<Integer> jdkListParallel() {
+        return jdkIntList.parallelStream().filter(i -> i % 5 == 0).collect(Collectors.toList());
+    }
+
+    @Benchmark
+    public MutableList<Integer> ecMutableListParallel() {
+        return ecMutableList.asParallel(executor, 100_000).select(i -> i % 5 == 0).toList();
+    }
+
+    @Benchmark
+    public IntList ecPrimitive() {
+        return this.ecIntList.select(i -> i % 5 == 0);
+    }
+
+    @Benchmark
+    public IntList ecPrimitiveParallel() {
+        return this.ecIntList.primitiveParallelStream().filter(i -> i % 5 == 0).collect(IntLists.mutable::empty, MutableIntList::add, MutableIntList::addAll);
+    }
+}

core-java-modules/core-java-11/src/main/java/com/baeldung/benchmark/IntegerListSum.java

@@ -0,0 +1,67 @@
+package com.baeldung.benchmark;
+
+import org.eclipse.collections.api.list.MutableList;
+import org.eclipse.collections.api.list.primitive.IntList;
+import org.eclipse.collections.impl.list.mutable.FastList;
+import org.eclipse.collections.impl.list.mutable.primitive.IntArrayList;
+import org.openjdk.jmh.annotations.*;
+
+import java.util.ArrayList;
+import java.util.List;
+import java.util.PrimitiveIterator;
+import java.util.Random;
+import java.util.concurrent.ExecutorService;
+import java.util.concurrent.Executors;
+import java.util.concurrent.TimeUnit;
+
+@State(Scope.Benchmark)
+@BenchmarkMode(Mode.Throughput)
+@OutputTimeUnit(TimeUnit.SECONDS)
+@Fork(2)
+public class IntegerListSum {
+
+    private List<Integer> jdkIntList;
+    private MutableList<Integer> ecMutableList;
+    private ExecutorService executor;
+    private IntList ecIntList;
+
+    @Setup
+    public void setup() {
+        PrimitiveIterator.OfInt iterator = new Random(1L).ints(-10000, 10000).iterator();
+        ecMutableList = FastList.newWithNValues(1_000_000, iterator::nextInt);
+        jdkIntList = new ArrayList<>(1_000_000);
+        jdkIntList.addAll(ecMutableList);
+        ecIntList = ecMutableList.collectInt(i -> i, new IntArrayList(1_000_000));
+        executor = Executors.newWorkStealingPool();
+    }
+
+    @Benchmark
+    public long jdkList() {
+        return jdkIntList.stream().mapToLong(i -> i).sum();
+    }
+
+    @Benchmark
+    public long ecMutableList() {
+        return ecMutableList.sumOfInt(i -> i);
+    }
+
+    @Benchmark
+    public long jdkListParallel() {
+        return jdkIntList.parallelStream().mapToLong(i -> i).sum();
+    }
+
+    @Benchmark
+    public long ecMutableListParallel() {
+        return ecMutableList.asParallel(executor, 100_000).sumOfInt(i -> i);
+    }
+
+    @Benchmark
+    public long ecPrimitive() {
+        return this.ecIntList.sum();
+    }
+
+    @Benchmark
+    public long ecPrimitiveParallel() {
+        return this.ecIntList.primitiveParallelStream().sum();
+    }
+}

core-java-modules/core-java-11/src/test/java/com/baeldung/benchmark/IntegerListFilterUnitTest.java

@@ -0,0 +1,33 @@
+package com.baeldung.benchmark;
+
+import org.junit.Before;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+
+public class IntegerListFilterUnitTest {
+
+    private IntegerListFilter integerListFilter;
+
+    @Before
+    public void init() {
+        integerListFilter = new IntegerListFilter();
+        integerListFilter.setup();
+    }
+
+    @Test
+    public void whenBenchmarkIsExecute_thenJDKListsMustBeOfSameSize() {
+        assertEquals(integerListFilter.jdkList().size(), integerListFilter.jdkListParallel().size());
+    }
+
+    @Test
+    public void whenBenchmarkIsExecute_thenMutableListsMustBeOfSameSize() {
+        assertEquals(integerListFilter.ecMutableList().size(), integerListFilter.ecMutableListParallel().size());
+    }
+
+    @Test
+    public void whenBenchmarkIsExecute_thenPrimitiveListsMustBeOfSameSize() {
+        assertEquals(integerListFilter.ecPrimitive().size(), integerListFilter.ecPrimitiveParallel().size());
+    }
+}

core-java-modules/core-java-11/src/test/java/com/baeldung/benchmark/IntegerListSumUnitTest.java

@@ -0,0 +1,33 @@
+package com.baeldung.benchmark;
+
+import org.junit.Before;
+import org.junit.Test;
+
+import static org.junit.Assert.assertEquals;
+
+
+public class IntegerListSumUnitTest {
+
+    private IntegerListSum integerListSum;
+
+    @Before
+    public void init() {
+        integerListSum = new IntegerListSum();
+        integerListSum.setup();
+    }
+
+    @Test
+    public void whenBenchmarkIsExecute_thenJDKListsMustHaveSameValue() {
+        assertEquals(integerListSum.jdkList(), integerListSum.jdkListParallel());
+    }
+
+    @Test
+    public void whenBenchmarkIsExecute_thenMutableListsMustHaveSameValue() {
+        assertEquals(integerListSum.ecMutableList(), integerListSum.ecMutableListParallel());
+    }
+
+    @Test
+    public void whenBenchmarkIsExecute_thenPrimitiveListsMustHaveSameValue() {
+        assertEquals(integerListSum.ecPrimitive(), integerListSum.ecPrimitiveParallel());
+    }
+}

core-java-modules/core-java-11/src/test/resources/sample.txt

@@ -0,0 +1 @@
+Sample file content

core-java-modules/core-java-9-improvements/README.md

@@ -0,0 +1,17 @@
+## Core Java 9
+
+This module contains articles about the improvements to core Java features introduced with Java 9.
+
+### Relevant Articles:
+
+- [New Stream Collectors in Java 9](http://www.baeldung.com/java9-stream-collectors)
+- [Java 9 Optional API Additions](https://www.baeldung.com/java-9-optional)
+- [Java 9 Convenience Factory Methods for Collections](https://www.baeldung.com/java-9-collections-factory-methods)
+- [Java 9 Stream API Improvements](https://www.baeldung.com/java-9-stream-api)
+- [Java 9 java.util.Objects Additions](https://www.baeldung.com/java-9-objects-new)
+- [Java 9 CompletableFuture API Improvements](https://www.baeldung.com/java-9-completablefuture)
+
+#### Relevant articles not in this module:
+
+- [Java 9 Process API Improvements](https://www.baeldung.com/java-9-process-api) (see the [core-java-os](/core-java-os) module)
+

core-java-modules/core-java-9-improvements/pom.xml

@@ -0,0 +1,73 @@
+<project xmlns="http://maven.apache.org/POM/4.0.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
+    xsi:schemaLocation="http://maven.apache.org/POM/4.0.0 http://maven.apache.org/xsd/maven-4.0.0.xsd">
+    <modelVersion>4.0.0</modelVersion>
+    <artifactId>core-java-9</artifactId>
+    <version>0.2-SNAPSHOT</version>
+    <name>core-java-9</name>
+
+    <parent>
+        <groupId>com.baeldung</groupId>
+        <artifactId>parent-modules</artifactId>
+        <version>1.0.0-SNAPSHOT</version>
+        <relativePath>../../</relativePath>
+    </parent>
+
+    <dependencies>
+        <dependency>
+            <groupId>com.jayway.awaitility</groupId>
+            <artifactId>awaitility</artifactId>
+            <version>${awaitility.version}</version>
+            <scope>test</scope>
+        </dependency>
+        <dependency>
+            <groupId>org.assertj</groupId>
+            <artifactId>assertj-core</artifactId>
+            <version>${assertj.version}</version>
+            <scope>test</scope>
+        </dependency>
+        <dependency>
+            <groupId>com.google.guava</groupId>
+            <artifactId>guava</artifactId>
+            <version>${guava.version}</version>
+        </dependency>
+        <dependency>
+            <groupId>org.junit.platform</groupId>
+            <artifactId>junit-platform-runner</artifactId>
+            <version>${junit.platform.version}</version>
+            <scope>test</scope>
+        </dependency>
+    </dependencies>
+
+    <build>
+        <finalName>core-java-9</finalName>
+        <plugins>
+            <plugin>
+                <groupId>org.apache.maven.plugins</groupId>
+                <artifactId>maven-compiler-plugin</artifactId>
+                <version>${maven-compiler-plugin.version}</version>
+                <configuration>
+                    <source>${maven.compiler.source}</source>
+                    <target>${maven.compiler.target}</target>
+                </configuration>
+            </plugin>
+        </plugins>
+    </build>
+
+    <pluginRepositories>
+        <pluginRepository>
+            <id>apache.snapshots</id>
+            <url>http://repository.apache.org/snapshots/</url>
+        </pluginRepository>
+    </pluginRepositories>
+
+    <properties>
+        <!-- testing -->
+        <assertj.version>3.10.0</assertj.version>
+        <junit.platform.version>1.2.0</junit.platform.version>
+        <awaitility.version>1.7.0</awaitility.version>
+        <maven.compiler.source>1.9</maven.compiler.source>
+        <maven.compiler.target>1.9</maven.compiler.target>
+        <guava.version>25.1-jre</guava.version>
+    </properties>
+
+</project>

core-java-modules/core-java-9-jigsaw/README.md

@@ -0,0 +1,11 @@
+## Core Java 9
+
+This module contains articles about Project Jigsaw and the Java Platform Module System (JPMS), introduced with Java 9.
+
+### Relevant Articles:
+
+- [Introduction to Project Jigsaw](http://www.baeldung.com/project-jigsaw-java-modularity)
+- [A Guide to Java 9 Modularity](https://www.baeldung.com/java-9-modularity)
+- [Java 9 java.lang.Module API](https://www.baeldung.com/java-9-module-api)
+
+