Java LinkedBlockingQueue take()用法及代碼示例

LinkedBlockingQueue的take()方法用於檢索和刪除此隊列的頭。如果隊列為空，則它將等待直到元素可用。如果在線程上工作並在該過程中使用LinkedBlockingQueue，則此方法會更有效。因此，如果沒有可用的元素，則最初調用take()的線程將進入睡眠狀態，從而讓其他線程執行所需的任何操作。

用法:

public E take() throws InterruptedException

返回值：此方法返回此LinkedBlockingQueue開頭的值。如果隊列為空，則它將等待直到元素可用。

異常：此方法引發以下異常：

InterruptedException–如果隊列為空，則在等待元素變為可用時發生中斷。

以下示例程序旨在說明LinkedBlockingQueue類的take()方法：

示例1:使用take()刪除LinkedBlockingQueue頭上的操作。

// 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]

示例2:使用take()從LinkedBlockingQueue中刪除Employee對象。

// 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

相關用法

注：本文由純淨天空篩選整理自AmanSingh2210大神的英文原創作品 LinkedBlockingQueue take() Method in Java with Examples。非經特殊聲明，原始代碼版權歸原作者所有，本譯文未經允許或授權，請勿轉載或複製。