LinkedBlockingDeque的remainingCapacity()方法返回此雙端隊列在沒有阻塞的情況下理想情況下可以接受的其他元素的數量(在沒有內存或資源約束的情況下)。
remainingCapacity() = final_size() – current_size()
用法:
public int remainingCapacity()
參數:此方法不接受任何參數。
返回值:此方法返回可以插入雙端隊列容器的剩餘元素數。
以下示例程序旨在說明LinkedBlockingDeque的remainingCapacity()方法:
示例1:
// Java Program Demonstrate remainingCapacity() 
// method of LinkedBlockingDeque 
// when initial size is mentioned 
  
import java.util.concurrent.LinkedBlockingDeque; 
import java.util.*; 
  
public class GFG { 
    public static void main(String[] args) 
        throws InterruptedException 
    { 
  
        // create object of LinkedBlockingDeque 
        LinkedBlockingDeque<Integer> LBD 
            = new LinkedBlockingDeque<Integer>(6); 
  
        // Add numbers to end of LinkedBlockingDeque 
        LBD.add(7855642); 
        LBD.add(35658786); 
        LBD.add(5278367); 
        LBD.add(74381793); 
  
        // print Dequeue 
        System.out.println("Linked Blocking Deque: " + LBD); 
        System.out.println("remainingCapacity = : " +  
                              LBD.remainingCapacity()); 
    } 
}
輸出:
Linked Blocking Deque: [7855642, 35658786, 5278367, 74381793] remainingCapacity = : 2
示例2:
// Java Program Demonstrate remainingCapacity() 
// method of LinkedBlockingDeque 
// when no initial size is mentioned 
  
import java.util.concurrent.LinkedBlockingDeque; 
import java.util.*; 
  
public class GFG { 
    public static void main(String[] args) 
        throws InterruptedException 
    { 
  
        // create object of LinkedBlockingDeque 
        LinkedBlockingDeque<Integer> LBD 
            = new LinkedBlockingDeque<Integer>(6); 
  
        // Add numbers to end of LinkedBlockingDeque 
        LBD.add(7855642); 
        LBD.add(35658786); 
        LBD.add(5278367); 
        LBD.add(74381793); 
  
        // print Dequeue 
        System.out.println("Linked Blocking Deque: " + LBD); 
        System.out.println("remainingCapacity = " +  
                             LBD.remainingCapacity()); 
    } 
}
輸出:
Linked Blocking Deque: [7855642, 35658786, 5278367, 74381793] remainingCapacity = 2
相關用法
- Java PriorityBlockingQueue remainingCapacity()用法及代碼示例
 - Java LinkedBlockingQueue remainingCapacity()用法及代碼示例
 - Java ArrayBlockingQueue remainingCapacity()用法及代碼示例
 - Java LinkedTransferQueue remainingCapacity()用法及代碼示例
 - Java DelayQueue remainingCapacity()用法及代碼示例
 - Java BlockingQueue remainingCapacity()用法及代碼示例
 - Java LinkedBlockingDeque add()用法及代碼示例
 - Java LinkedBlockingDeque contains()用法及代碼示例
 - Java LinkedBlockingDeque take()用法及代碼示例
 - Java LinkedBlockingDeque pop()用法及代碼示例
 - Java LinkedBlockingDeque put()用法及代碼示例
 - Java LinkedBlockingDeque descendingIterator()用法及代碼示例
 - Java LinkedBlockingDeque pollFirst()用法及代碼示例
 - Java LinkedBlockingDeque putLast()用法及代碼示例
 - Java LinkedBlockingDeque addFirst()用法及代碼示例
 
注:本文由純淨天空篩選整理自gopaldave大神的英文原創作品 LinkedBlockingDeque remainingCapacity() method in Java。非經特殊聲明,原始代碼版權歸原作者所有,本譯文未經允許或授權,請勿轉載或複製。
