Open In App
Related Articles

LinkedBlockingDeque remainingCapacity() method in Java

Improve Article
Improve
Save Article
Save
Like Article
Like

The remainingCapacity() method of LinkedBlockingDeque returns the number of additional elements that this deque can ideally (in the absence of memory or resource constraints) accept without blocking.

remainingCapacity() = final_size() – current_size()

Syntax:

public int remainingCapacity()

Parameters: This method does not accepts any parameters.

Returns: This method returns the remaining number of elements that can be inserted into the deque container.

Below programs illustrate remainingCapacity() method of LinkedBlockingDeque:

Program 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());
    }
}


Output:

Linked Blocking Deque: [7855642, 35658786, 5278367, 74381793]
remainingCapacity = : 2

Program 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());
    }
}


Output:

Linked Blocking Deque: [7855642, 35658786, 5278367, 74381793]
remainingCapacity = 2

Reference: https://docs.oracle.com/javase/8/docs/api/java/util/concurrent/LinkedBlockingDeque.html#remainingCapacity–


Whether you're preparing for your first job interview or aiming to upskill in this ever-evolving tech landscape, GeeksforGeeks Courses are your key to success. We provide top-quality content at affordable prices, all geared towards accelerating your growth in a time-bound manner. Join the millions we've already empowered, and we're here to do the same for you. Don't miss out - check it out now!

Last Updated : 17 Sep, 2018
Like Article
Save Article
Similar Reads
Related Tutorials