Método LinkedBlockingQueue take() en Java con ejemplos

El método take() de LinkedBlockingQueue se usa para recuperar y eliminar el encabezado de esta cola. Si la cola está vacía, esperará hasta que un elemento esté disponible. Este método es más eficiente si se trabaja en subprocesos y se usa LinkedBlockingQueue en ese proceso. Entonces, el subproceso que inicialmente llama a take() se duerme si no hay ningún elemento disponible, lo que permite que otros subprocesos hagan lo que necesiten hacer.
Sintaxis: 
 

public E take() throws InterruptedException

Valor de retorno: este método devuelve valor al principio de esta LinkedBlockingQueue. Si la cola está vacía, esperará hasta que un elemento esté disponible.
Excepción: este método arroja las siguientes excepciones: 
 

• InterruptedException : cuando la interrupción se produce en el momento de esperar a que un elemento esté disponible si la cola está vacía.

Los siguientes programas ilustran el método take() de la clase LinkedBlockingQueue:
Programa 1: Elimina la operación en el encabezado de LinkedBlockingQueue usando take().
 

// Java Program Demonstrate take()
// 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 to LinkedBlockingQueue
        linkedQueue.add("Ravi");
        linkedQueue.add("Suraj");
        linkedQueue.add("Harsh");
        linkedQueue.add("Sayan");
 
        // print elements of queue
        System.out.println("Items in Queue are " + linkedQueue);
 
        // remove two elements from queue from head
        // Applying take() method on queue to remove element
        String removedItem1 = linkedQueue.take();
 
        // print removedItem and queue
        System.out.println("Removed Item from head is "
                           + removedItem1);
 
        // print elements of queue after removing first item
        System.out.println("Remaining Items in Queue are "
                           + linkedQueue);
 
        // Applying take() method on queue to remove another element
        String removedItem2 = linkedQueue.take();
 
        // print removedItem and queue
        System.out.println("Removed Item from head is "
                           + removedItem2);
 
        // print elements of queue after removing first item
        System.out.println("Remaining Items in Queue are "
                           + linkedQueue);
    }
}

Items in Queue are [Ravi, Suraj, Harsh, Sayan]
Removed Item from head is Ravi
Remaining Items in Queue are [Suraj, Harsh, Sayan]
Removed Item from head is Suraj
Remaining Items in Queue are [Harsh, Sayan]

Programa 2: elimine el objeto Empleado de LinkedBlockingQueue usando take().
 

// Java Program Demonstrate take()
// method of LinkedBlockingQueue
 
import java.util.concurrent.LinkedBlockingQueue;
public class GFG {
 
    public void takeDemo() 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("Ravi", "Tester", "39000");
        Employee emp2 = new Employee("Sanjeet", "Manager", "98000");
 
        // Add Employee Objects to linkedQueue
        linkedQueue.add(emp1);
        linkedQueue.add(emp2);
 
        // remove elements from the queue
        // and follow this process again and again
        // until the queue becomes empty
        while (linkedQueue.size() != 0) {
 
            // Remove Employee item from LinkedBlockingQueue
            // using take()
            Employee removedEmp = linkedQueue.take();
 
            // print removedItem
            System.out.println("Removed Item is :");
            System.out.println("Employee Name - "
                               + removedEmp.name);
            System.out.println("Employee Position - "
                               + removedEmp.position);
            System.out.println("Employee Salary - "
                               + removedEmp.salary);
 
            // find size of linkedQueue
            int size = linkedQueue.size();
 
            // print remaining capacity value
            System.out.println("\nSize of list :" + size + "\n");
        }
    }
 
    // create an Employee Object with name,
    // position and salary as an attribute
    public class Employee {
 
        public String name;
        public String position;
        public String salary;
 
        Employee(String name, String position, String salary)
        {
            this.name = name;
            this.position = position;
            this.salary = salary;
        }
 
        @Override
        public String toString()
        {
            return "Employee [name=" + name + ", position="
                + position + ", salary=" + salary + "]";
        }
    }
 
    // Main Method
    public static void main(String[] args)
    {
        GFG gfg = new GFG();
        try {
            gfg.takeDemo();
        }
        catch (Exception e) {
            e.printStackTrace();
        }
    }
}

Removed Item is :
Employee Name - Ravi
Employee Position - Tester
Employee Salary - 39000

Size of list :1

Removed Item is :
Employee Name - Sanjeet
Employee Position - Manager
Employee Salary - 98000

Size of list :0