Skip to main content

Stream Operations | Intermediate and Terminal Stream Tutorial

Intermediate and Terminal Operation in Java 8 Stream API

Intermediate and Terminal Operation in Java 8 Stream API
 

The java stream API provides a functional approach to processing collection of objects. Stream API added in java 8.

Stream operations are divided into intermediate and terminal operations and are combined to form stream pipelines.

A Stream pipeline is source such as array, collection, I/O channel or generator function.

In Java 8, Stream API have two types of operations :-

  1. Intermediate Operation
  2. Terminal Operation

1. Intermediate Operation

Intermediate operations are lazy operations means it is always returns new Stream. Intermediate operations does not produce result.

Following are Intermediates methods of stream :-

  1. filter()
  2. map()
  3. sorted()
  4. flatMap()
  5. Distinct()
  6. limit()
  7. peek()

Lazy operations are allows significant efficiencies. In a pipeline such as filtering, mapping and summing can be fused into a single pass on the data, with minimal intermediate state.

Laziness also avoids examining the all data when it is not necessary.

Intermediate operations are also divided into two operations :-

  1. Stateless
  2. Stateful 

Stateless Operation :-

Stateless operations such as filter and map, retain no state for previously seen element when processing new element. Each element can be processed independently.

Stateful Operation :-

Stateful operations such as Distinct and Sorted, may incorporate state from previously seen elements when processing new elements. 

Stateful operations may need to process entire input before producing result. For example, Sorting all given elements.

See example of Intermediate Operation :-

Intermediate Operation of java8 stream API
 
As you can see Intermediate operation returns Stream, it does not produce result.

2. Terminal Operation

Terminal operations are traverse the stream and produce the result.

After the performed Terminal operation, the stream pipeline is considered consumed, and can no longer used.

If we need to traverse the same data source again, we must return to the data source to get a new stream.

In almost all cases, terminal operations are eager.

Following are Terminal Operations :-

  1. collect()
  2. forEach()
  3. reduce()
  4. anyMatch()
  5. allMatch()
  6. count()
  7. findAny()
  8. min()
  9. max()
  10. toArray()
 See example of Terminal Operation :-

Terminal Operation of java8 stream API
 
Terminal Operation returns result. In above example, we print list of string using forEach() method.

Checkout Java 8 Methods :-

Comments

Popular posts from this blog

Plus Minus HackerRank Solution in Java | Programming Blog

Java Solution for HackerRank Plus Minus Problem Given an array of integers, calculate the ratios of its elements that are positive , negative , and zero . Print the decimal value of each fraction on a new line with 6 places after the decimal. Example 1 : array = [1, 1, 0, -1, -1] There are N = 5 elements, two positive, two negative and one zero. Their ratios are 2/5 = 0.400000, 2/5 = 0.400000 and 1/5 = 0.200000. Results are printed as:  0.400000 0.400000 0.200000 proportion of positive values proportion of negative values proportion of zeros Example 2 : array = [-4, 3, -9, 0, 4, 1]  There are 3 positive numbers, 2 negative numbers, and 1 zero in array. Following is answer : 3/6 = 0.500000 2/6 = 0.333333 1/6 = 0.166667 Lets see solution Solution 1 import java.io.*; import java.math.*; import java.security.*; import java.text.*; import java.util.*; import java.util.concurrent.*; import java.util.function.*; import java.util.regex.*; import java.util.stream.*; import static java.util.st

Flipping the Matrix HackerRank Solution in Java with Explanation

Java Solution for Flipping the Matrix | Find Highest Sum of Upper-Left Quadrant of Matrix Problem Description : Sean invented a game involving a 2n * 2n matrix where each cell of the matrix contains an integer. He can reverse any of its rows or columns any number of times. The goal of the game is to maximize the sum of the elements in the n *n submatrix located in the upper-left quadrant of the matrix. Given the initial configurations for q matrices, help Sean reverse the rows and columns of each matrix in the best possible way so that the sum of the elements in the matrix's upper-left quadrant is maximal.  Input : matrix = [[1, 2], [3, 4]] Output : 4 Input : matrix = [[112, 42, 83, 119], [56, 125, 56, 49], [15, 78, 101, 43], [62, 98, 114, 108]] Output : 119 + 114 + 56 + 125 = 414 Full Problem Description : Flipping the Matrix Problem Description   Here we can find solution using following pattern, So simply we have to find Max of same number of box like (1,1,1,1). And last