Java Queue example

Queue Interface is part of java.util package. Queue generally works on FIFO (First In First Out) in ordering elements. In FIFO, new element is added at the end while in other cases ordering properties has to be specified. Queues are bounded which means that number of elements are restricted in it.


 

Ads

Tutorials   
How to read properties file in Java? Generate random numbers in Java Cloneable Interface in Java What is the flaw with the Stack class? List In Java Java Stack Example HashSet In Java Enumeration in java How to generate random number in java Iterator in java Queue in java Transient Java Keyword clone method in Java Java Queue example Logger in Java Java current date - How to get current date in Java Collection : LinkedList Example Collection : ArrayList Example Random alpha numeric string of fixed size Java List Iterator Example The Hashtable Class The BitSet class Java Vector Java Enumeration Data Structures in Java Java Transient Variable Java Date Format Example Java Properties File Example Map.Entry Java Interface Java Property File java preferences,Change the value of Preferences by user Retrieving a Preference Node Java hasNext Write Keys and Values to the Properties file in Java Get All Keys and Values of the Properties files in Java Properties file in Java Properties file in Java Determining If a Preference Node Contains a Specific Value Change the value of Preferences by user Clone method example in Java Implementing a Simple Event Notifier Determining When a Preference Node Is Added or Removed Listening for Changes to Preference Values in a Preference Node Importing Preferences Finding a Preference in a Preference Tree Retrieving the Parent and Child Nodes of a Preference Node Determining If a Preference Node Exists Removing a Preference Node Creating a Preference Node Getting the Maximum Size of a Preference Key and Value
Ads

Queue Interface is part of java.util package. Queue generally works on FIFO (First In First Out) in ordering elements. In FIFO, new element is added at the end while in other cases ordering properties has to be specified. Queues are bounded which means that number of elements are restricted in it.

add() method is used to insert an element in the queue but it will throw an exception if the operation fails.

offer() method is also used to insert an element in the queue but it will return false if the operation fails.

remove() method returns and removes the head of the queue. It throws an exception if the operation fails.

poll() method returns and removes the head of this queue. It return null if the operation fails.

element() method returns the head of the queue. It throws an exception if the operation fails.

peek() method returns the head of the queue. It return null if the operation fails.

In the following example we will implement Queue by its subclass LinkedList. add()and offer() methods are used to add elements o LinkedList while remove() and poll() methods are used to remove elements.

Following is the Java queue example:

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

public class MainDemo {

    public void queueExample() {

        Queue queue = new LinkedList();

        queue.add("Java");
        queue.add("DotNet");

        queue.offer("PHP");
        queue.offer("HTML");

        System.out.println("remove: " + queue.remove());
        System.out.println("element: " + queue.element());
        System.out.println("poll: " + queue.poll());
        System.out.println("peek: " + queue.peek());

    }

    public static void main(String[] args) {
        new MainDemo().queueExample();
    }
}

Output:

remove: Java
element: DotNet
poll: DotNet
peek: PHP

Advertisements

Share on Google+Share on Google+

Java Queue example

Posted on: May 13, 2013 If you enjoyed this post then why not add us on Google+? Add us to your Circles

Advertisements

Ads
 

Discuss: Java Queue example  

Post your Comment


Your Name (*) :
Your Email :
Subject (*):
Your Comment (*):
  Reload Image
 
 
Comments:0

Ads

 

Ads