Java Program to Implement LinkedBlockingQueue API

LinkedBlockingQueue API is an optionally-bounded queue based on linked nodes. It orders the elements in FIFO(First In First Out) order. The head of this queue is the element that has been there in the queue for the longest time and the tail of the queue is the element that has been in the queue for the shortest time.  New elements are inserted at the tail of the queue, and the queue retrieval operations obtain elements at the head of the queue. It belongs to java.util.concurrent package. It extends Object, AbstractCollection and AbstractQueue classes.

The capacity argument serves as a way to prevent excessive queue expansion. The capacity (if not specified) is equal to Integer.MAX_VALUE. Linked nodes are dynamically created upon each insertion unless this would bring the queue above capacity. 

LinkedBlockingQueue API is a member of Java Collection Framework.

All implemented interfaces:

1. Serializable
2. Iterable<E>
3. Collection<E>
4. BlockingQueue<E>
5. Queue<E>

Parameters: E — The type of elements in the collection

Syntax:

public class LinkedBlockingQueue<E> extends AbstractQueue<E>
implements BlockingQueue<E>, Serializable

Constructors:

1. public LinkedBlockingQueue() - Creates a LinkedBlockingQueue with a capacity of Integer.MAX_VALUE.
2. public LinkedBlockingQueue(Collection<? extends E> c) - Creates a LinkedBlockingQueue of capacity Integer.MAX_VALUE, initially containing the elements of the specified Collection.
3. public LinkedBlockingQueue(int capacity) - Creates a LinkedBlockingQueue with the given capacity.

Implementation:

Example

The elements of the LinkedBlockingQueue is 
1 2 3 
The remaining capacity is 2147483644
3 removed true
The peak element of the LinkedBlockingQueue is 1
The peak element of the LinkedBlockingQueue is 1
The LinkedBlockingQueue contains 4 :false
The LinkedBlockingQueue contains 1 :false
The size of the LinkedBlockingQueue is 3
[2, 6, 7]

Methods: