Merge pull request #1 from eugenp/master

Update branch
2018-01-18 21:51:21 +01:00
parent 4e39bfb945 c8d11b402f
commit 68a3585cab
913 changed files with 231065 additions and 3397 deletions
@@ -3,7 +3,8 @@ language: java
 before_install: 
  - echo "MAVEN_OPTS='-Xmx2048M -Xss128M -XX:+CMSClassUnloadingEnabled -XX:+UseG1GC -XX:-UseGCOverheadLimit'" > ~/.mavenrc

-install: travis_wait 60 mvn -q test -fae
+install: skip
+script: travis_wait 60 mvn -q test -fae

 sudo: required

@@ -15,3 +15,4 @@
 - [Introduction to JGraphT](http://www.baeldung.com/jgrapht)
 - [Introduction to Minimax Algorithm](http://www.baeldung.com/java-minimax-algorithm)
 - [How to Calculate Levenshtein Distance in Java?](http://www.baeldung.com/java-levenshtein-distance)
+- [How to Find the Kth Largest Element in Java](http://www.baeldung.com/java-kth-largest-element)
@@ -39,6 +39,12 @@
            <artifactId>jgrapht-core</artifactId>
            <version>1.0.1</version>
        </dependency>
+        <dependency>
+            <groupId>org.assertj</groupId>
+            <artifactId>assertj-core</artifactId>
+            <version>3.9.0</version>
+            <scope>test</scope>
+        </dependency>
    </dependencies>

    <build>
@@ -0,0 +1,111 @@
+package com.baeldung.algorithms.kthlargest;
+
+import java.util.Arrays;
+import java.util.Collections;
+import java.util.stream.IntStream;
+
+public class FindKthLargest {
+
+    public int findKthLargestBySorting(Integer[] arr, int k) {
+        Arrays.sort(arr);
+        int targetIndex = arr.length - k;
+        return arr[targetIndex];
+    }
+
+    public int findKthLargestBySortingDesc(Integer[] arr, int k) {
+        Arrays.sort(arr, Collections.reverseOrder());
+        return arr[k - 1];
+    }
+
+    public int findKthElementByQuickSelect(Integer[] arr, int left, int right, int k) {
+        if (k >= 0 && k <= right - left + 1) {
+            int pos = partition(arr, left, right);
+            if (pos - left == k) {
+                return arr[pos];
+            }
+            if (pos - left > k) {
+                return findKthElementByQuickSelect(arr, left, pos - 1, k);
+            }
+            return findKthElementByQuickSelect(arr, pos + 1, right, k - pos + left - 1);
+        }
+        return 0;
+    }
+
+    public int findKthElementByQuickSelectWithIterativePartition(Integer[] arr, int left, int right, int k) {
+        if (k >= 0 && k <= right - left + 1) {
+            int pos = partitionIterative(arr, left, right);
+            if (pos - left == k) {
+                return arr[pos];
+            }
+            if (pos - left > k) {
+                return findKthElementByQuickSelectWithIterativePartition(arr, left, pos - 1, k);
+            }
+            return findKthElementByQuickSelectWithIterativePartition(arr, pos + 1, right, k - pos + left - 1);
+        }
+        return 0;
+    }
+
+    private int partition(Integer[] arr, int left, int right) {
+        int pivot = arr[right];
+        Integer[] leftArr;
+        Integer[] rightArr;
+
+        leftArr = IntStream.range(left, right)
+            .filter(i -> arr[i] < pivot)
+            .map(i -> arr[i])
+            .boxed()
+            .toArray(Integer[]::new);
+
+        rightArr = IntStream.range(left, right)
+            .filter(i -> arr[i] > pivot)
+            .map(i -> arr[i])
+            .boxed()
+            .toArray(Integer[]::new);
+
+        int leftArraySize = leftArr.length;
+        System.arraycopy(leftArr, 0, arr, left, leftArraySize);
+        arr[leftArraySize + left] = pivot;
+        System.arraycopy(rightArr, 0, arr, left + leftArraySize + 1, rightArr.length);
+
+        return left + leftArraySize;
+    }
+
+    private int partitionIterative(Integer[] arr, int left, int right) {
+        int pivot = arr[right], i = left;
+        for (int j = left; j <= right - 1; j++) {
+            if (arr[j] <= pivot) {
+                swap(arr, i, j);
+                i++;
+            }
+        }
+        swap(arr, i, right);
+        return i;
+    }
+
+    public int findKthElementByRandomizedQuickSelect(Integer[] arr, int left, int right, int k) {
+        if (k >= 0 && k <= right - left + 1) {
+            int pos = randomPartition(arr, left, right);
+            if (pos - left == k) {
+                return arr[pos];
+            }
+            if (pos - left > k) {
+                return findKthElementByRandomizedQuickSelect(arr, left, pos - 1, k);
+            }
+            return findKthElementByRandomizedQuickSelect(arr, pos + 1, right, k - pos + left - 1);
+        }
+        return 0;
+    }
+
+    private int randomPartition(Integer arr[], int left, int right) {
+        int n = right - left + 1;
+        int pivot = (int) (Math.random()) % n;
+        swap(arr, left + pivot, right);
+        return partition(arr, left, right);
+    }
+
+    private void swap(Integer[] arr, int n1, int n2) {
+        int temp = arr[n2];
+        arr[n2] = arr[n1];
+        arr[n1] = temp;
+    }
+}
@@ -0,0 +1,57 @@
+package com.baeldung.algorithms.kthlargest;
+
+import static org.assertj.core.api.Assertions.*;
+
+import org.junit.Before;
+import org.junit.Test;
+
+public class FindKthLargestUnitTest {
+
+    private FindKthLargest findKthLargest;
+    private Integer[] arr = { 3, 7, 1, 2, 8, 10, 4, 5, 6, 9 };
+
+    @Before
+    public void setup() {
+        findKthLargest = new FindKthLargest();
+    }
+
+    @Test
+    public void givenIntArray_whenFindKthLargestBySorting_thenGetResult() {
+        int k = 3;
+        assertThat(findKthLargest.findKthLargestBySorting(arr, k)).isEqualTo(8);
+    }
+
+    @Test
+    public void givenIntArray_whenFindKthLargestBySortingDesc_thenGetResult() {
+        int k = 3;
+        assertThat(findKthLargest.findKthLargestBySortingDesc(arr, k)).isEqualTo(8);
+    }
+
+    @Test
+    public void givenIntArray_whenFindKthLargestByQuickSelect_thenGetResult() {
+        int k = 3;
+        int kthLargest = arr.length - k;
+        assertThat(findKthLargest.findKthElementByQuickSelect(arr, 0, arr.length - 1, kthLargest)).isEqualTo(8);
+    }
+
+    @Test
+    public void givenIntArray_whenFindKthElementByQuickSelectIterative_thenGetResult() {
+        int k = 3;
+        int kthLargest = arr.length - k;
+        assertThat(findKthLargest.findKthElementByQuickSelectWithIterativePartition(arr, 0, arr.length - 1, kthLargest)).isEqualTo(8);
+    }
+
+    @Test
+    public void givenIntArray_whenFindKthSmallestByQuickSelect_thenGetResult() {
+        int k = 3;
+        assertThat(findKthLargest.findKthElementByQuickSelect(arr, 0, arr.length - 1, k - 1)).isEqualTo(3);
+    }
+
+    @Test
+    public void givenIntArray_whenFindKthLargestByRandomizedQuickSelect_thenGetResult() {
+        int k = 3;
+        int kthLargest = arr.length - k;
+        assertThat(findKthLargest.findKthElementByRandomizedQuickSelect(arr, 0, arr.length - 1, kthLargest)).isEqualTo(8);
+    }
+
+}
@@ -9,7 +9,7 @@
  <url>http://maven.apache.org</url>
  
  <properties>
-        <maven-compiler-plugin.version>3.6.0</maven-compiler-plugin.version>	
+        <maven-compiler-plugin.version>3.7.0</maven-compiler-plugin.version>	
    </properties>
 	
  <dependencies>
@@ -26,8 +26,8 @@
 				  <artifactId>maven-compiler-plugin</artifactId>
 				  <version>3.7.0</version>
 				  <configuration>
-					<source>1.6</source>
-					<target>1.6</target>
+					<source>1.8</source>
+					<target>1.8</target>
 				  </configuration>
 				</plugin>
 				<plugin>
@@ -15,7 +15,7 @@

    <properties>
        <auto-service.version>1.0-rc2</auto-service.version>
-        <maven-compiler-plugin.version>3.6.0</maven-compiler-plugin.version>
+        <maven-compiler-plugin.version>3.7.0</maven-compiler-plugin.version>
    </properties>

    <dependencies>
@@ -1,3 +1,4 @@
 ### Relevant Articles:
 - [Microsoft Word Processing in Java with Apache POI](http://www.baeldung.com/java-microsoft-word-with-apache-poi)
 - [Working with Microsoft Excel in Java](http://www.baeldung.com/java-microsoft-excel)
+- [Creating a MS PowerPoint Presentation in Java](https://github.com/eugenp/tutorials/tree/master/apache-poi)
@@ -65,7 +65,7 @@
            <plugin>
                <groupId>org.apache.maven.plugins</groupId>
                <artifactId>maven-compiler-plugin</artifactId>
-                <version>3.6.2</version>
+                <version>3.7.0</version>
                <configuration>
                    <source>1.8</source>
                    <target>1.8</target>
@@ -12,7 +12,7 @@

 	<properties>
 		<project.build.sourceEncoding>UTF-8</project.build.sourceEncoding>
-		<maven-compiler-plugin.version>3.6.0</maven-compiler-plugin.version>
+		<maven-compiler-plugin.version>3.7.0</maven-compiler-plugin.version>
 		<maven-surefire-plugin.version>2.19.1</maven-surefire-plugin.version>
 		<camel.version>2.19.1</camel.version>
 	    <spring-boot-starter.version>1.5.4.RELEASE</spring-boot-starter.version>
@@ -0,0 +1,2 @@
+## Relevant articles:
+- [CAS SSO With Spring Security](http://www.baeldung.com/spring-security-cas-sso)
@@ -14,7 +14,7 @@
 	<parent>
 		<groupId>org.springframework.boot</groupId>
 		<artifactId>spring-boot-starter-parent</artifactId>
-		<version>2.0.0.BUILD-SNAPSHOT</version>
+		<version>2.0.0.M7</version>
 		<relativePath/> <!-- lookup parent from repository -->
 	</parent>

@@ -87,14 +87,6 @@
 	</build>

 	<repositories>
-		<repository>
-			<id>spring-snapshots</id>
-			<name>Spring Snapshots</name>
-			<url>https://repo.spring.io/snapshot</url>
-			<snapshots>
-				<enabled>true</enabled>
-			</snapshots>
-		</repository>
 		<repository>
 			<id>spring-milestones</id>
 			<name>Spring Milestones</name>
@@ -106,14 +98,6 @@
 	</repositories>

 	<pluginRepositories>
-		<pluginRepository>
-			<id>spring-snapshots</id>
-			<name>Spring Snapshots</name>
-			<url>https://repo.spring.io/snapshot</url>
-			<snapshots>
-				<enabled>true</enabled>
-			</snapshots>
-		</pluginRepository>
 		<pluginRepository>
 			<id>spring-milestones</id>
 			<name>Spring Milestones</name>
@@ -52,7 +52,11 @@
            <plugin>
                <groupId>org.apache.maven.plugins</groupId>
                <artifactId>maven-compiler-plugin</artifactId>
-                <version>3.3</version>
+                <version>3.7.0</version>
+                <configuration>
+                    <source>1.8</source>
+                    <target>1.8</target>
+                </configuration>
            </plugin>
        </plugins>
        <finalName>cas</finalName>
@@ -32,3 +32,11 @@
 - [“Stream has already been operated upon or closed” Exception in Java](http://www.baeldung.com/java-stream-operated-upon-or-closed-exception)
 - [Display All Time Zones With GMT And UTC in Java](http://www.baeldung.com/java-time-zones)
 - [Copy a File with Java](http://www.baeldung.com/java-copy-file)
+- [Generating Prime Numbers in Java](http://www.baeldung.com/java-generate-prime-numbers)
+- [Static and Default Methods in Interfaces in Java](http://www.baeldung.com/java-static-default-methods)
+- [Iterable to Stream in Java](http://www.baeldung.com/java-iterable-to-stream)
+- [Converting String to Stream of chars](http://www.baeldung.com/java-string-to-stream)
+- [How to Iterate Over a Stream With Indices](http://www.baeldung.com/java-stream-indices)
+- [Efficient Word Frequency Calculator in Java](http://www.baeldung.com/java-word-frequency)
+- [Primitive Type Streams in Java 8](http://www.baeldung.com/java-8-primitive-streams)
+- [Fail-Safe Iterator vs Fail-Fast Iterator](http://www.baeldung.com/java-fail-safe-vs-fail-fast-iterator)
@@ -2,7 +2,6 @@ package com.baeldung.datetime;

 import java.time.Duration;
 import java.time.LocalTime;
-import java.time.Period;

 public class UseDuration {

@@ -0,0 +1,18 @@
+package com.baeldung.defaultstaticinterfacemethods.application;
+
+import com.baeldung.defaultstaticinterfacemethods.model.Car;
+import com.baeldung.defaultstaticinterfacemethods.model.Vehicle;
+
+public class Application {
+
+    public static void main(String[] args) {
+
+        Vehicle car = new Car("BMW");
+        System.out.println(car.getBrand());
+        System.out.println(car.speedUp());
+        System.out.println(car.slowDown());
+        System.out.println(car.turnAlarmOn());
+        System.out.println(car.turnAlarmOff());
+        System.out.println(Vehicle.getHorsePower(2500, 480));
+    }
+}
@@ -0,0 +1,12 @@
+package com.baeldung.defaultstaticinterfacemethods.model;
+
+public interface Alarm {
+
+    default String turnAlarmOn() {
+        return "Turning the alarm on.";
+    }
+
+    default String turnAlarmOff() {
+        return "Turning the alarm off.";
+    }
+}
@@ -0,0 +1,25 @@
+package com.baeldung.defaultstaticinterfacemethods.model;
+
+public class Car implements Vehicle {
+
+    private final String brand;
+
+    public Car(String brand) {
+        this.brand = brand;
+    }
+
+    @Override
+    public String getBrand() {
+        return brand;
+    }
+
+    @Override
+    public String speedUp() {
+        return "The car is speeding up.";
+    }
+
+    @Override
+    public String slowDown() {
+        return "The car is slowing down.";
+    }
+}
@@ -0,0 +1,25 @@
+package com.baeldung.defaultstaticinterfacemethods.model;
+
+public class Motorbike implements Vehicle {
+
+    private final String brand;
+
+    public Motorbike(String brand) {
+        this.brand = brand;
+    }
+
+    @Override
+    public String getBrand() {
+        return brand;
+    }
+
+    @Override
+    public String speedUp() {
+        return "The motorbike is speeding up.";
+    }
+
+    @Override
+    public String slowDown() {
+        return "The motorbike is slowing down.";
+    }
+}
@@ -0,0 +1,35 @@
+package com.baeldung.defaultstaticinterfacemethods.model;
+
+public class MultiAlarmCar implements Vehicle, Alarm {
+
+    private final String brand;
+
+    public MultiAlarmCar(String brand) {
+        this.brand = brand;
+    }
+
+    @Override
+    public String getBrand() {
+        return brand;
+    }
+
+    @Override
+    public String speedUp() {
+        return "The motorbike is speeding up.";
+    }
+
+    @Override
+    public String slowDown() {
+        return "The mootorbike is slowing down.";
+    }
+
+    @Override
+    public String turnAlarmOn() {
+        return Vehicle.super.turnAlarmOn() + " " + Alarm.super.turnAlarmOn();
+    }
+
+    @Override
+    public String turnAlarmOff() {
+        return Vehicle.super.turnAlarmOff() + " " + Alarm.super.turnAlarmOff();
+    }
+}
@@ -0,0 +1,22 @@
+package com.baeldung.defaultstaticinterfacemethods.model;
+
+public interface Vehicle {
+
+    String getBrand();
+
+    String speedUp();
+
+    String slowDown();
+
+    default String turnAlarmOn() {
+        return "Turning the vehice alarm on.";
+    }
+
+    default String turnAlarmOff() {
+        return "Turning the vehicle alarm off.";
+    }
+
+    static int getHorsePower(int rpm, int torque) {
+        return (rpm * torque) / 5252;
+    }
+}
@@ -0,0 +1,80 @@
+package com.baeldung.iterators;
+
+import java.util.ArrayList;
+import java.util.Iterator;
+import java.util.concurrent.ConcurrentHashMap;
+
+/**
+ * Source code https://github.com/eugenp/tutorials
+ *
+ * @author Santosh Thakur
+ */
+
+public class Iterators {
+
+    public static int failFast1() {
+        ArrayList<Integer> numbers = new ArrayList<>();
+
+        numbers.add(10);
+        numbers.add(20);
+        numbers.add(30);
+        numbers.add(40);
+
+        Iterator<Integer> iterator = numbers.iterator();
+        while (iterator.hasNext()) {
+            Integer number = iterator.next();
+            numbers.add(50);
+        }
+
+        return numbers.size();
+    }
+
+    public static int failFast2() {
+        ArrayList<Integer> numbers = new ArrayList<>();
+        numbers.add(10);
+        numbers.add(20);
+        numbers.add(30);
+        numbers.add(40);
+
+        Iterator<Integer> iterator = numbers.iterator();
+        while (iterator.hasNext()) {
+            if (iterator.next() == 30) {
+                // will not throw Exception
+                iterator.remove();
+            }
+        }
+
+        System.out.println("using iterator's remove method = " + numbers);
+
+        iterator = numbers.iterator();
+        while (iterator.hasNext()) {
+            if (iterator.next() == 40) {
+                // will throw Exception on
+                // next call of next() method
+                numbers.remove(2);
+            }
+        }
+
+        return numbers.size();
+    }
+
+    public static int failSafe1() {
+        ConcurrentHashMap<String, Integer> map = new ConcurrentHashMap<>();
+
+        map.put("First", 10);
+        map.put("Second", 20);
+        map.put("Third", 30);
+        map.put("Fourth", 40);
+
+        Iterator<String> iterator = map.keySet()
+            .iterator();
+
+        while (iterator.hasNext()) {
+            String key = iterator.next();
+            map.put("Fifth", 50);
+        }
+
+        return map.size();
+    }
+
+}
@@ -0,0 +1,44 @@
+package com.baeldung.spliteratorAPI;
+
+import java.util.List;
+
+public class Article {
+    private List<Author> listOfAuthors;
+    private int id;
+    private String name;
+
+    public Article(String name) {
+        this.name = name;
+    }
+
+    public Article(List<Author> listOfAuthors, int id) {
+        super();
+        this.listOfAuthors = listOfAuthors;
+        this.id = id;
+    }
+
+    public String getName() {
+        return name;
+    }
+
+    public void setName(String name) {
+        this.name = name;
+    }
+
+    public int getId() {
+        return id;
+    }
+
+    public void setId(int id) {
+        this.id = id;
+    }
+
+    public List<Author> getListOfAuthors() {
+        return listOfAuthors;
+    }
+
+    public void setListOfAuthors(List<Author> listOfAuthors) {
+        this.listOfAuthors = listOfAuthors;
+    }
+
+}
@@ -0,0 +1,33 @@
+package com.baeldung.spliteratorAPI;
+
+public class Author {
+    private String name;
+    private int relatedArticleId;
+
+    public Author(String name, int relatedArticleId) {
+        this.name = name;
+        this.relatedArticleId = relatedArticleId;
+    }
+
+    public int getRelatedArticleId() {
+        return relatedArticleId;
+    }
+
+    public void setRelatedArticleId(int relatedArticleId) {
+        this.relatedArticleId = relatedArticleId;
+    }
+
+    public String getName() {
+        return name;
+    }
+
+    public void setName(String name) {
+        this.name = name;
+    }
+
+    @Override
+    public String toString() {
+        return "[name: " + name + ", relatedId: " + relatedArticleId + "]";
+    }
+}
+
@@ -0,0 +1,45 @@
+package com.baeldung.spliteratorAPI;
+
+import java.util.Arrays;
+import java.util.List;
+import java.util.Spliterator;
+import java.util.concurrent.ExecutorService;
+import java.util.concurrent.Executors;
+import java.util.stream.Collectors;
+import java.util.stream.IntStream;
+import java.util.stream.Stream;
+import java.util.stream.StreamSupport;
+
+public class Executor {
+	public void executeCustomSpliterator() {
+        Article article = new Article(Arrays.asList(new Author("Ahmad", 0), new Author("Eugen", 0), new Author("Alice", 1), new Author("Alice", 1), new Author("Mike", 0), new Author("Alice", 1), new Author("Mike", 0), new Author("Alice", 1),
+            new Author("Mike", 0), new Author("Alice", 1), new Author("Mike", 0), new Author("Mike", 0), new Author("Alice", 1), new Author("Mike", 0), new Author("Alice", 1), new Author("Mike", 0), new Author("Alice", 1), new Author("Mike", 0),
+            new Author("Alice", 1), new Author("Mike", 0), new Author("Michał", 0), new Author("Loredana", 1)), 0);
+        Stream<Author> stream = IntStream.range(0, article.getListOfAuthors()
+            .size())
+            .mapToObj(article.getListOfAuthors()::get);
+        System.out.println("count= " + countAutors(stream.parallel()));
+        Spliterator<Author> spliterator = new RelatedAuthorSpliterator(article.getListOfAuthors());
+        Stream<Author> stream2 = StreamSupport.stream(spliterator, true);
+        System.out.println("count= " + countAutors(stream2.parallel()));
+    }
+
+    public void executeSpliterator() {
+        Spliterator<Article> split1 = generateElements().spliterator();
+        Spliterator<Article> split2 = split1.trySplit();
+        ExecutorService service = Executors.newCachedThreadPool();
+        service.execute(new Task(split1));
+        service.execute(new Task(split2));
+    }
+
+    private static int countAutors(Stream<Author> stream) {
+        RelatedAuthorCounter wordCounter = stream.reduce(new RelatedAuthorCounter(0, true), RelatedAuthorCounter::accumulate, RelatedAuthorCounter::combine);
+        return wordCounter.getCounter();
+    }
+
+    private List<Article> generateElements() {
+        return Stream.generate(() -> new Article("Java"))
+            .limit(35000)
+            .collect(Collectors.toList());
+    }
+}
@@ -0,0 +1,27 @@
+package com.baeldung.spliteratorAPI;
+
+public class RelatedAuthorCounter {
+    private final int counter;
+    private final boolean isRelated;
+
+    public RelatedAuthorCounter(int counter, boolean isRelated) {
+        this.counter = counter;
+        this.isRelated = isRelated;
+    }
+
+    public RelatedAuthorCounter accumulate(Author author) {
+        if (author.getRelatedArticleId() == 0) {
+            return isRelated ? this : new RelatedAuthorCounter(counter, true);
+        } else {
+            return isRelated ? new RelatedAuthorCounter(counter + 1, false) : this;
+        }
+    }
+
+    public RelatedAuthorCounter combine(RelatedAuthorCounter RelatedAuthorCounter) {
+        return new RelatedAuthorCounter(counter + RelatedAuthorCounter.counter, RelatedAuthorCounter.isRelated);
+    }
+
+    public int getCounter() {
+        return counter;
+    }
+}
@@ -0,0 +1,47 @@
+package com.baeldung.spliteratorAPI;
+
+import java.util.List;
+import java.util.Spliterator;
+import java.util.function.Consumer;
+
+public class RelatedAuthorSpliterator implements Spliterator<Author> {
+    private final List<Author> list;
+    private int current = 0;
+
+    public RelatedAuthorSpliterator(List<Author> list) {
+        this.list = list;
+    }
+
+    @Override
+    public boolean tryAdvance(Consumer<? super Author> action) {
+        action.accept(list.get(current++));
+        return current < list.size();
+    }
+
+    @Override
+    public Spliterator<Author> trySplit() {
+        int currentSize = list.size() - current;
+        if (currentSize < 10) {
+            return null;
+        }
+        for (int splitPos = currentSize / 2 + current; splitPos < list.size(); splitPos++) {
+            if (list.get(splitPos)
+                .getRelatedArticleId() == 0) {
+                Spliterator<Author> spliterator = new RelatedAuthorSpliterator(list.subList(current, splitPos));
+                current = splitPos;
+                return spliterator;
+            }
+        }
+        return null;
+    }
+
+    @Override
+    public long estimateSize() {
+        return list.size() - current;
+    }
+
+    @Override
+    public int characteristics() {
+        return SIZED + CONCURRENT;
+    }
+}
@@ -0,0 +1,26 @@
+package com.baeldung.spliteratorAPI;
+
+import java.util.Spliterator;
+
+public class Task implements Runnable {
+    private Spliterator<Article> spliterator;
+    private final static String SUFFIX = "- published by Baeldung";
+
+    public Task(Spliterator<Article> spliterator) {
+        this.spliterator = spliterator;
+    }
+
+    @Override
+    public void run() {
+        int current = 0;
+        while (spliterator.tryAdvance(article -> {
+            article.setName(article.getName()
+                .concat(SUFFIX));
+        })) {
+            current++;
+        }
+        ;
+        System.out.println(Thread.currentThread()
+            .getName() + ":" + current);
+    }
+}
@@ -0,0 +1,23 @@
+package com.baeldung.stream;
+
+import java.util.Arrays;
+import java.util.stream.IntStream;
+
+class PrimitiveStreams {
+
+    int min(int[] integers) {
+        return Arrays.stream(integers).min().getAsInt();
+    }
+
+    int max(int... integers) {
+        return IntStream.of(integers).max().getAsInt();
+    }
+
+    int sum(int... integers) {
+        return IntStream.of(integers).sum();
+    }
+
+    double avg(int... integers) {
+        return IntStream.of(integers).average().getAsDouble();
+    }
+}
--- a/Show More
+++ b/Show More