Wednesday, 11 December 2013

FIFO based Queue implementation in Java

We know we have java.util.Stack as a data structure in Java. It has standard functions like pop(), push(), peek(). But  ever wondered what is analog for Queue in Java?

If you search for Queue class in java then you will wind such an interface java.util package.

public interface Queue<E> extends Collection<E>

And if you check classes implementing this interface you will find LinkedList in it. Yes LinkedList in java can be used for FIFO operations.  Actually LinkedList implements Deque which inturn implements Queue. If you see functions in Queue interface they are as follows -

  1. element(): This method retrieves the head of the queue.
  2. offer(E o): This inserts the specified element into the queue.
  3. peek(): This method retrieves the head of this queue, returning null if this queue is empty.
  4. poll(): This method retrieves and removes the head of this queue, or return null if this queue is empty.
  5. remove(): This method retrieves and removes the head of this queue.

 Lets understand this better with a code -

Code -

import java.util.LinkedList;
import java.util.Queue;

public class FIFOTest {
    public static void main(String args[]){
        Queue<String> myQueue = new LinkedList<String>();
        for(String element : myQueue){
            System.out.println("Element : " + element);
        System.out.println("Queue : " + myQueue);
        System.out.println("After peek : " + myQueue);
        System.out.println("After poll : " + myQueue);
        System.out.println("After remove : " + myQueue);

Output - 

Element : US
Element : Russia
Element : India
Element : Canada
Queue : [US, Russia, India, Canada]
After peek : [US, Russia, India, Canada]
After poll : [Russia, India, Canada]
After remove : [India, Canada]

Note : From usability point of view add() and offer() do the same thing. Same goes for poll() and remove().


t> UA-39527780-1 back to top