Java LinkedTransferQueue remove() method

The remove() method of Java LinkedTransferQueue class is used to remove the specified element from the queue if that element is present in the queue. This method of LinkedTransferQueue class overrides the remove in class AbstractCollection.

Syntax:

Parameters:

The parameter 'o' is the element to be removed from the queue if it is present.

Specified By:

The remove () method of LinkedTransferQueue class is specified by:

remove in interface Collection.
remove in interface BlockingQueue.

Return:

This method returns a Boolean value true if this queue changed as a result of the call.

Example 1

import java.util.concurrent.LinkedTransferQueue;  
public class LinkedTransferQueueRemoveExample1 {  
    public static void main(String[] args) {  
       LinkedTransferQueue<Integer> queue = new LinkedTransferQueue<Integer>();  
       queue.add(38);  
       queue.add(24);  
       queue.add(202);  
       queue.add(290);  
       queue.add(19);  
       System.out.println("Elements in queue : "+queue);  
       //remove() method will remove the specified element from the queue  
       queue.remove(392);  
       queue.remove(48);  
       System.out.println("Remaining elements in queue : "+queue);  
    }  
}

Test it Now

Output:

Elements in queue : [38, 24, 202, 290, 19]
Remaining elements in queue : [38, 24, 202, 290, 19]

Example 2

import java.util.concurrent.LinkedTransferQueue;  
public class LinkedTransferQueueRemoveExample2 {  
    public static void main(String[] args) {  
        List list1 = new List("Cake");  
        List list2 = new List("Candle");  
        List list3 = new List("Knife");  
        List list4 = new List("Matchbox"); 
        List list5 = new List("Cap");  
        List list6 = new List("Stricker");  
        LinkedTransferQueue<List> queue = new LinkedTransferQueue<List>();  
        queue.add(list1);  
        queue.add(list2);  
        queue.add(list3);  
        queue.add(list4);  
        queue.add(list5);  
        queue.add(list6);  
        for (List xyz:queue){  
            System.out.println(xyz);  
        }  
        queue.remove(list4);  
        queue.remove(list1);  
        System.out.println("New List : "+queue);  
    }  
}  
class List{  
    String birthday_item;  
    public List(String birthday_item) {  
        this.birthday_item = birthday_item;  
    }  
    public String toString(){  
        return this.birthday_item;  
    }  
}

Test it Now

Output:

Cake
Candle
Knife
Matchbox
Cap
Stricker
New List : [Candle, Knife, Cap, Stricker]

Example 3

import java.util.concurrent.LinkedTransferQueue;  
public class LinkedTransferQueueRemoveExample3 {  
    public static void main(String[] args) {  
    	LinkedTransferQueue<Integer> queue = new LinkedTransferQueue<Integer>();  
        queue.add(27);  
        queue.add(49);  
        queue.add(190);  
        queue.add(72);  
        queue.add(42);  
        System.out.println("Elements in queue : "+queue);  
        queue.remove(null);  
    }  
}  

Test it Now

Output:

Elements in queue : [27, 49, 190, 72, 42]

Next TopicJava LinkedTransferQueue

← prev next →

For Videos Join Our Youtube Channel: Join Now

Feedback

Send your Feedback to [email protected]

Help Others, Please Share

Learn Latest Tutorials

Splunk

SPSS

Swagger

Transact-SQL

Tumblr

ReactJS

Regex

Reinforcement Learning

R Programming

RxJS

React Native

Python Design Patterns

Python Pillow

Python Turtle

Keras

Preparation

Aptitude

Reasoning

Verbal Ability

Interview Questions

Company Questions

Trending Technologies

Artificial Intelligence

AWS

Selenium

Cloud Computing

Hadoop

ReactJS

Data Science

Angular 7

Blockchain

Git

Machine Learning

DevOps

B.Tech / MCA

DBMS

Data Structures

DAA

Operating System

Computer Network

Compiler Design

Computer Organization

Discrete Mathematics

Ethical Hacking

Computer Graphics

Software Engineering

Web Technology

Cyber Security

Automata

C Programming

C++

Java

.Net

Python

Programs

Control System

Data Mining

Data Warehouse

^{Like/Subscribe us for latest updates or newsletter}