LinkedTransferQueue remove() method in Java
Last Updated :
14 Sep, 2018
The java.util.concurrent.LinkedTransferQueue.remove() method is an in-built function in Java which is used to remove an element if it is present in this queue.
Syntax:
LinkedTransferQueue.remove(Object o)
Parameters: The function accepts a single parameter o i.e. the object to be removed.
Return Value: The function returns a true boolean value on successful removal of the object, otherwise returns false.
Below programs illustrate LinkedTransferQueue.remove() method:
Program 1: The element to be removed is present in the queue.
import java.util.concurrent.LinkedTransferQueue;
class LinkedTransferQueueRemoveExample1 {
public static void main(String[] args)
{
LinkedTransferQueue<Integer> queue =
new LinkedTransferQueue<Integer>();
for (int i = 1; i <= 5; i++)
queue.add(i);
System.out.println("The elements in the queue are:");
for (Integer i : queue)
System.out.print(i + " ");
queue.remove(1);
queue.remove(5);
System.out.println("\nRemaining elements in queue : ");
for (Integer i : queue)
System.out.print(i + " ");
}
}
|
Output:
The elements in the queue are:
1 2 3 4 5
Remaining elements in queue :
2 3 4
Program 2: The element to be removed is not present in the queue.
import java.util.concurrent.LinkedTransferQueue;
class LinkedTransferQueueRemoveExample2 {
public static void main(String[] args)
{
LinkedTransferQueue<Integer> queue =
new LinkedTransferQueue<Integer>();
for (int i = 10; i <= 15; i++)
queue.add(i);
System.out.println("The elements in the queue are:");
for (Integer i : queue)
System.out.print(i + " ");
queue.remove(1);
queue.remove(5);
System.out.println("\nRemaining elements in queue : ");
for (Integer i : queue)
System.out.print(i + " ");
}
}
|
Output:
The elements in the queue are:
10 11 12 13 14 15
Remaining elements in queue :
10 11 12 13 14 15
Reference: https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/LinkedTransferQueue.html#remove(java.lang.Object)
Like Article
Suggest improvement
Share your thoughts in the comments
Please Login to comment...