Java ArrayBlockingQueue remainingCapacity() Method

The remainingCapacity() method of Java ArrayBlockingQueue class returns the capacity of the elements that this queue can accept without blocking.

Syntax:

Parameters:

Specified By:

The remainingCapacity () method of ArrayBlockingQueue class is specified by remainingCapacity in interface BlockingQueue.

Return Value:

The remainingCapacity () method returns the remaining capacity of the queue.

Example 1

import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.BlockingQueue;
public class ArrayBlockingQueueRemainingCapacityExample1 {
    public static void main(String[] args) {
        int capacity = 10;
        BlockingQueue<Integer> queue = new ArrayBlockingQueue<Integer>(capacity);
        for (int i = 1; i <= 6; i++) {
            //  Adding items add() to the tail of queue
            queue.add(i);
        }
        System.out.println("Queue : "+queue);
        int val =queue.remainingCapacity();
        System.out.println("Remaining capacity of the queue = "+val);
    }
}

Output:

Queue : [1, 2, 3, 4, 5, 6]
Remaining capacity of the queue = 4

Example 2

import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.BlockingQueue;
class Student {
    String name;
    public Student( String name) {
        this.name = name;
    }
    public String toString(){
        return this.name+"Name registered  "+ this.name ;
    }
}
public class ArrayBlockingQueueRemainingCapacityExample2 {
    public static void main(String[] args) {
        int capacity = 10;
        BlockingQueue<Student> queue = new ArrayBlockingQueue<Student>(capacity);
        Student student1 = new Student("Hinna");
        Student student2 = new Student("Vinni");
        Student student3 = new Student("Rima");
        queue.add(student1);
        queue.add(student2);
        queue.add(student3);
        Integer val =queue.remainingCapacity();
        System.out.println("Register your name quickly in JavaTpoint.\nAs only "+val+" seats are left");
    }
}

Output:

Register your name quickly in JavaTpoint.
As only 7 seats are left

Example 3

import java.util.Scanner;
import java.util.concurrent.ArrayBlockingQueue;
import java.util.concurrent.BlockingQueue;
public class ArrayBlockingQueueRemainingCapacityExample3 {
    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        System.out.print("Enter capacity : ");
        int capacity = scanner.nextInt();
        BlockingQueue<Integer> queue = new ArrayBlockingQueue<>(capacity);
        for (int i=0;i<capacity;i++){
            System.out.println("Remaining capacity : "+queue.remainingCapacity());
            System.out.print("Element : "); int val = scanner.nextInt();
            System.out.println();
            queue.add(val);
        }
        System.out.println("Queue = " +queue);
    }
}

Output:

Enter capacity : 5
Remaining capacity : 5
Element : 56

Remaining capacity : 4
Element : 78

Remaining capacity : 3
Element : 55

Remaining capacity : 2
Element : 9

Remaining capacity : 1
Element : 76

Queue = [56, 78, 55, 9, 76]

Next TopicJava-arrayblockingqueue-remove-method

← prev next →