Método LinkedBlockingQueue remove() en Java

El método remove(Object obj) de LinkedBlockingQueue elimina solo una instancia del Objeto dado, pasado como parámetro, de esta LinkedBlockingQueue si está presente. Elimina un elemento e tal que obj.equals(e) y si esta cola contiene una o más instancias del elemento e. Este método devuelve verdadero si esta cola contenía el elemento que ahora se elimina de LinkedBlockingQueue.

Sintaxis:

public boolean remove(Object o)

Parámetro: este método acepta un parámetro obligatorio obj , que es el elemento que se eliminará de LinkedBlockingQueue.

Valor devuelto: este método devuelve verdadero si esta cola contenía el elemento que ahora se elimina de LinkedBlockingQueue. Si LinkedBlockingQueue no contiene el elemento obj , este método devuelve false .

Los siguientes programas ilustran el método remove(Object obj) de la clase LinkedBlockingQueue:

Programa 1: Intente eliminar algún elemento de LinkedBlockingQueue usando remove(Object obj) e imprima el resultado.

// Java Program Demonstrate  remove(Object obj)
// method of LinkedBlockingQueue
  
import java.util.concurrent.LinkedBlockingQueue;
  
public class GFG {
  
    public static void main(String[] args)
        throws InterruptedException
    {
        // define capacity of LinkedBlockingQueue
        int capacityOfQueue = 4;
  
        // create object of LinkedBlockingQueue
        LinkedBlockingQueue<String> linkedQueue
            = new LinkedBlockingQueue<String>(capacityOfQueue);
  
        // Add element using put() method
        linkedQueue.put("Karan");
        linkedQueue.put("Suraj");
        linkedQueue.put("Harsh");
        linkedQueue.put("Rahul");
  
        // print elements of queue
        System.out.println("Items in Queue are " + linkedQueue);
  
        // try to remove Karan from Queue using remove()
        boolean try1 = linkedQueue.remove("Karan");
        // Print result of remove()
        System.out.println("String name Karan is removed :"
                           + try1);
  
        // try to remove Sunny from Queue using remove()
        boolean try2 = linkedQueue.remove("Sunny");
        // Print result of remove()
        System.out.println("String name Sunny is removed :"
                           + try2);
  
        // try to remove Sunny from Queue using remove()
        boolean try3 = linkedQueue.remove("Harsh");
        // Print result of remove()
        System.out.println("String name Harsh is removed :"
                           + try2);
  
        // print queue
        System.out.println("After Removing Some Elements:");
        System.out.println("Items in Queue are " + linkedQueue);
    }
}
Producción:

Items in Queue are [Karan, Suraj, Harsh, Rahul]
String name Karan is removed :true
String name Sunny is removed :false
String name Harsh is removed :false
After Removing Some Elements:
Items in Queue are [Suraj, Rahul]

Programa 1: Quitar el objeto Employee usando el método remove(Object obj) en LinkedBlockingQueue

// Java Program Demonstrate remove(object obj)
// method of LinkedBlockingQueue
  
import java.util.Iterator;
import java.util.concurrent.LinkedBlockingQueue;
public class GFG {
  
    public void removeDemo() throws InterruptedException
    {
        // define capacity of LinkedBlockingQueue
        int capacityOfQueue = 5;
  
        // create object of LinkedBlockingQueue
        LinkedBlockingQueue<Employee> linkedQueue
            = new LinkedBlockingQueue<Employee>(capacityOfQueue);
  
        // Add element to LinkedBlockingQueue
        Employee emp1 = new Employee("Ranjeet", "Tester", "29000", 27);
        Employee emp2 = new Employee("Sanjeet", "Manager", "98000", 34);
        Employee emp3 = new Employee("Karan", "Analyst", "44000", 30);
  
        // Add Employee Objects to linkedQueue Using put(E e)
        linkedQueue.put(emp1);
        linkedQueue.put(emp2);
        linkedQueue.put(emp3);
  
        // print details of linkedQueue
        System.out.println("Before removing Elements");
        Iterator itr = linkedQueue.iterator();
        while (itr.hasNext())
            System.out.println(itr.next());
  
        // remove employee2 name Sanjeet from linkedQueue
        // Using remove(Object obj) method
        linkedQueue.remove(emp2);
  
        // Also remove Ranjeet employee1 from linkedQueue
        // Using remove(Object obj) method
        linkedQueue.remove(emp1);
  
        // print details of linkedQueue
        System.out.println("After removing Some Elements");
        itr = linkedQueue.iterator();
        while (itr.hasNext())
            System.out.println(itr.next());
    }
  
    // create an Employee Object with name,
    // position, salary and age as attributes
    public class Employee {
  
        public String name;
        public String position;
        public String salary;
        public int Age;
        Employee(String name, String position,
                 String salary, int age)
        {
            this.name = name;
            this.position = position;
            this.salary = salary;
            this.Age = age;
        }
  
        @Override
        public String toString()
        {
            return "Employee [name=" + name + ", position="
                + position + ", salary=" + salary + ", Age=" + Age + "]";
        }
    }
  
    // Main Method
    public static void main(String[] args)
    {
        GFG gfg = new GFG();
        try {
            gfg.removeDemo();
        }
        catch (InterruptedException e) {
            // TODO Auto-generated catch block
            e.printStackTrace();
        }
    }
}
Producción:

Before removing Elements
Employee [name=Ranjeet, position=Tester, salary=29000, Age=27]
Employee [name=Sanjeet, position=Manager, salary=98000, Age=34]
Employee [name=Karan, position=Analyst, salary=44000, Age=30]
After removing Some Elements
Employee [name=Karan, position=Analyst, salary=44000, Age=30]

Referencia: https://docs.oracle.com/javase/8/docs/api/java/util/concurrent/LinkedBlockingQueue.html#remove-java.lang.Object-

Publicación traducida automáticamente

Artículo escrito por AmanSingh2210 y traducido por Barcelona Geeks. The original can be accessed here. Licence: CCBY-SA

Deja una respuesta

Tu dirección de correo electrónico no será publicada. Los campos obligatorios están marcados con *