Using a Queue (or LinkedList)

The Queue interface implements the Collection interface and supports ordering on a FIFO (First In First Out) basis.
This means that when you start out with an empty queue object and add an item to it, that object will be the first to be removed when using any of the methods that supports removing of items from the queue.

The main difference between a List and a Queue is that in the former you can choose what item to get, while in a Queue you only get access to the “first in line” object (however this shouldn’t be confused with classes like LinkedList which implements both the Queue and List interfaces).
In this example we use the LinkedList class which implements the Queue interface and add items to it using both the add() and offer() methods.
The difference between them is that the add method will throw an exception should the adding of the item fail but the offer() method will simply return false.
The example also shows how to remove items from the queue by using any of the two methods for removing, remove() and poll(). Like the methods to add items there’s one method that throws and exception if the remove operation goes wrong (i.e. if the queue is empty) and one that only returns false.
The same goes for the two methods for checking what item is first in the queue without removing it.

The output from the code above is:

Search for more Java info on this site here:
Custom Search

Please type any questions here.