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

Sales by Match HackerRank Solution | Java Solution

HackerRank Sales by Match problem solution in Java   Problem Description : Alex works at a clothing store. There is a large pile of socks that must be paired by color for sale. Given an array of integers representing the color of each sock, determine how many pairs of socks with matching colors there are. For example, there are n=7 socks with colors socks = [1,2,1,2,1,3,2]. There is one pair of color 1 and one of color 2 . There are three odd socks left, one of each color. The number of pairs is 2 .   Example 1 : Input : n = 6 arr = [1, 2, 3, 4, 5, 6] Output : 0 Explanation : We have 6 socks with all different colors, So print 0. Example 2 : Input : n = 10 arr = [1, 2, 3, 4, 1, 4, 2, 7, 9, 9] Output : 4 Explanation : We have 10 socks. There is pair of color 1, 2, 4 and 9, So print 4. This problem easily solved by HashMap . Store all pair of socks one by one in Map and check if any pair is present in Map or not. If pair is present then increment ans variable by 1 ...

Queen's Attack II HackerRank Solution in Java with Explanation

Queen's Attack II Problem's Solution in Java (Chessboard Problem)   Problem Description : You will be given a square chess board with one queen and a number of obstacles placed on it. Determine how many squares the queen can attack.  A queen is standing on an n * n chessboard. The chess board's rows are numbered from 1 to n, going from bottom to top. Its columns are numbered from 1 to n, going from left to right. Each square is referenced by a tuple, (r, c), describing the row r and column c, where the square is located. The queen is standing at position (r_q, c_q). In a single move, queen can attack any square in any of the eight directions The queen can move: Horizontally (left, right) Vertically (up, down) Diagonally (four directions: up-left, up-right, down-left, down-right) The queen can move any number of squares in any of these directions, but it cannot move through obstacles. Input Format : n : The size of the chessboard ( n x n ). k : The number of obstacles...