Skip to main content

[Java 8] what's new - Foreach

I recently moved to Java 8 and found some interesting feature added with Java 8.
I have listed few of them:


1. forEach method - Apply on all
First we will go through forEach method.
Create a dummy collection

  List<Integer> iList = new ArrayList<Integer>();
  for(int i=0; i<100; i++) iList.add(i);
Without Foreach

  Iterator<Integer> itr = iList.iterator();
  while(itr.hasNext()){
   System.out.println("Value:"+itr.next());
  }

With Foreach

  iList.forEach(new Consumer<Integer>() {
   public void accept(Integer i) {
    System.out.println("Value::"+i);
   }

  });
You might see not much change in term of line of code. What important thing to note here clear separation between business and iteration. You can easily write your code 
As we apply operation on collection, we are prone to ConcurrentModificationException if we wrongly operate on iterator. Foreach help with that operation. 

Comments

Popular posts from this blog

Car Parking Problem

There is n parking slots and n-1 car already parked. Lets say car parked with initial arrangement and we want to make the car to be parked to some other arrangement. Lets say n = 5, inital = free, 3, 4, 1, 2 desired = 1, free, 2, 4 ,3 Give an algorithm with minimum steps needed to get desired arrangement. Told by one of my friend and after a lot of search i really got a nice solution. I will post solution in comment part

Median of Five Numbers

U have 5 NOs , X1,X2,X3,X4,X5 With minimum no. of comparisons we have to find a median. SWAP(X,Y) function is available to u . I have a answer of six comparisons and eight swaps....wait for people to find out by themselves.

Merge two sorted array inplace

Given an integer array of which both first half and second half are sorted. Write a function to merge the two parts to create one single sorted array in place [do not use any extra space]. e.g. If input array is [1,3,6,8,-5,-2,3,8] It should be converted to: [-5,-2,1,3,3,6,8,8]