El método restante de la capacidad() de BlockingQueue devuelve la cantidad de elementos adicionales que se pueden agregar a BlockingQueue sin bloquear.
La Capacidad devuelta surge en tres supuestos:
- Si la capacidad restante es cero, no se pueden agregar más elementos a BlockingQueue.
- Si la capacidad restante de BlockingQueue es igual al tamaño de la cola, entonces no se puede eliminar ningún elemento de la cola porque, en tal situación, la cola está vacía.
- En cualquier otro caso, la capacidad siempre es igual a la diferencia entre la capacidad inicial de este BlockingQueue y el tamaño actual de este BlockingQueue.
Sintaxis:
public int remainingCapacity()
Valor devuelto: este método devuelve la capacidad restante de BlockingQueue.
Nota : El método de BlockingQueue restanteCapacity() se ha heredado de la clase Queue en Java.
Los siguientes programas ilustran el método de capacidad restante() de la clase BlockingQueue:
Programa 1:
// Java Program Demonstrate remainingCapacity()
// method of BlockingQueue
import java.util.concurrent.LinkedBlockingQueue;
import java.util.concurrent.BlockingQueue;
public class GFG {
public static void main(String[] args)
{
// define capacity of BlockingQueue
int capacityOfQueue = 7;
// create object of BlockingQueue
BlockingQueue<String> BQ
= new LinkedBlockingQueue<String>(
capacityOfQueue);
// Add element to BlockingQueue
BQ.add("John");
BQ.add("Tom");
BQ.add("Clark");
BQ.add("Kat");
// find remaining Capacity of BQ
// using remainingCapacity() method
int remainingCapacity
= BQ.remainingCapacity();
// print result
System.out.println("Queue is " + BQ);
// print head of the queue
System.out.println("Remaining Capacity of Queue is "
+ remainingCapacity);
}
}
Producción:
Queue is [John, Tom, Clark, Kat] Remaining Capacity of Queue is 3
Programa 2:
// Java Program Demonstrate remainingCapacity()
// method of BlockingQueue
import java.util.concurrent.LinkedBlockingQueue;
import java.util.concurrent.BlockingQueue;
public class GFG {
public void findPeek()
{
// define capacity of BlockingQueue
int capacityOfQueue = 7;
// create object of BlockingQueue
BlockingQueue<Employee> BQ
= new LinkedBlockingQueue<Employee>(
capacityOfQueue);
// Add element to BlockingQueue
Employee emp1
= new Employee("Ravi", "Tester", "39000");
Employee emp2
= new Employee("Sanjeet", "Manager", "98000");
// Add Employee Objects to BQ
BQ.add(emp1);
BQ.add(emp2);
// add element and find remaining capacity
// follow same process again
// until the queue becomes full
while (BQ.size() != 7) {
// adding emp2 again and again to queue
System.out.println(
"Adding employee is success "
+ BQ.offer(emp2));
// find remaining capacity of BQ
// using remainingCapacity() method
int remain = BQ.remainingCapacity();
// print remaining capacity value
System.out.println(
"Remaining Capacity of list :"
+ remain);
}
}
// 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();
gfg.findPeek();
}
}
Producción:
Adding employee is success true Remaining Capacity of list :4 Adding employee is success true Remaining Capacity of list :3 Adding employee is success true Remaining Capacity of list :2 Adding employee is success true Remaining Capacity of list :1 Adding employee is success true Remaining Capacity of list :0
Referencia: https://docs.oracle.com/javase/7/docs/api/java/util/concurrent/BlockingQueue.html#remainingCapacity()