ConcurrentLinkedQueue in Java with Examples

The ConcurrentLinkedQueue class in Java is a part of the Java Collection Framework and implements the Collection interface and the AbstractCollection class. It is used to implement a Queue with the help of LinkedList concurrently.

Class Hierarchy:

java.lang.Object
  ? java.util.AbstractCollection<E>
     ? java.util.AbstractQueue<E>
        ? Class ConcurrentLinkedQueue<E>

Syntax:

public abstract class ConcurrentLinkedQueue<E>
    extends AbstractCollection<E>
        implements Queue<E>, Serializable

where E is the type of elements maintained 
by this collection

Constructors in Java ConcurrentLinkedQueue:

• ConcurrentLinkedQueue(): This constructor is used to construct an empty queue.
• ConcurrentLinkedQueue(Collection<E> c): This constructor is used to construct a queue with the elements of the Collection passed as the parameter.

Below is a sample program to illustrate ConcurrentLinkedQueue in Java:

filter_none

edit

play_arrow

brightness_4

Output:

ConcurrentLinkedQueue: [12, 70, 1009, 475]
ConcurrentLinkedQueue1: [12, 70, 1009, 475]

Methods in Java ConcurrentLinkedQueue:

1. add(E e): This method inserts the specified element at the tail of this queue.
2. addAll(Collection c): This method appends all of the elements in the specified collection to the end of this queue, in the order that they are returned by the specified collection’s iterator.
3. contains(Object o): This method returns true if this queue contains the specified element.
4. isEmpty(): This method returns true if this queue contains no elements.
5. iterator(): This method returns an iterator over the elements in this queue in the proper sequence.
6. offer(E e): This method inserts the specified element at the tail of this queue.
7. peek(): This method retrieves, but does not remove, the head of this queue, or returns null if this queue is empty.
8. poll(): This method retrieves and removes the head of this queue, or returns null if this queue is empty.
9. remove(Object o): This method removes a single instance of the specified element from this queue if it is present.
10. size(): This method returns the number of elements in this queue.
11. spliterator? (): This method returns a Spliterator over the elements in this queue.
12. toArray(): This method returns an array containing all of the elements in this queue, in the proper sequence.
13. toArray(T[] a): This method returns an array containing all of the elements in this queue, in proper sequence; the runtime type of the returned array is that of the specified array.

Example:

filter_none

edit

play_arrow

brightness_4

Output:

ConcurrentLinkedQueue: [12, 70, 1009, 475]
First Element is: 12
Head Element is: 12
ConcurrentLinkedQueue: [70, 1009, 475]
Size: 3

Reference: https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/ConcurrentLinkedQueue.html