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

DEShaw Interview Questions

ther are N numbers frm 1 to N and starting from index 1 we will keep deleting every alternate going in cyclic order with array. Only one element will be left at the end. Tell us the index of element in array we started. e.g. there are 5 nums 1 2 3 4 5 then after 1st iteration 1 3 5 will be remained. .. then 1 will be next to be elliminated and then 5 3 will remain alone... give sum efficient algorithm to calculate which numer will remain at the end Answer: 2*(n-2^p)+1 where p=floor(log2 n)

HTTP/2 : what and why

HTTP History In 1989, the hypertext transfer protocol have been invented. HTTP/1.1 has been released in 1997 and took the longest pause in evolution. In 2015, Google has redrafted its inhouse SPDY protocol to HTTP/2 to optimize the web page load time.  HTTP/1.1 Pitfalls Too heavy and big protocol. Too many parts have been added as optional led to complicating the protocols with less of usage. Since HTTP1.1 release, web technology have seen tremendous change. Page size has been increased to MBs, the number to pages increased manifolds and parallel components making HTTP calls increased too.  Each HTTP request has a separate TCP connection and its handshake does add to page load time.  Head of line blocking has slowed the page load. We can have a maximum 8 parallel connection to the same domain. Due to increase in multiple components making separate HTTP calls, this has been a bottleneck.  HTTP/2 Solution Binary framing layer: HTTP/1.1 was text-only messaging, which wa...