Java中PriorityBlockingQueue的remainingCapacity()方法

Java中PriorityBlockingQueue的remainingCapacity()方法

remainingCapacity 方法用于检查 还可以插入多少元素到此队列中 。但由于PriorityBlockingQueue无界,因此此方法始终返回 Integer.MAX_VALUE ,因为PriorityBlockingQueue没有容量限制。
语法:

public int remainingCapacity()

返回值: Integer.MAX_VALUE
下面的程序演示PriorityBlockingQueue的remainingCapacity()方法:

Program 1:

//Java程序演示PriorityBlockingQueue的remainingCapacity()方法
import java.util.concurrent.PriorityBlockingQueue;

public class GFG {
    public static void main(String[] args)
    {
        //定义PriorityBlockingQueue的容量
        int capacityOfQueue = 7;
         
        //创建PriorityBlockingQueue对象
        PriorityBlockingQueue pbq
            = new PriorityBlockingQueue(capacityOfQueue);
         
        //将元素添加到PriorityBlockingQueue中
        pbq.put(1);
        pbq.put(2);
        pbq.put(3);
        pbq.put(4);

        //使用remainingCapacity()方法查找pbq的剩余容量
        //初始容量在构造函数中设置为7
        //但此方法将返回Integer.MAX_VALUE
        int remainingCapacity = pbq.remainingCapacity();

        //打印结果
        System.out.println("队列: " + pbq);
        System.out.println("剩余容量: " + remainingCapacity);
    }
}

输出:

队列: [1, 2, 3, 4]
剩余容量: 2147483647

Program 2: 使用String演示remainingCapacity()

//Java程序演示PriorityBlockingQueue的remainingCapacity()方法
import java.util.concurrent.PriorityBlockingQueue;

public class GFG {
    public static void main(String[] args)
    {
        //创建PriorityBlockingQueue对象
        PriorityBlockingQueue pbq
            = new PriorityBlockingQueue();

        //将元素添加到PriorityBlockingQueue中
        pbq.put("Geeks");
        pbq.put("forGeeks");
        pbq.put("A Computer");
        pbq.put("Portal");

        //使用remainingCapacity()方法查找pbq的剩余容量
        int remainingCapacity = pbq.remainingCapacity();

        //打印结果
        System.out.println("队列: " + pbq);
        System.out.println("剩余容量: " + remainingCapacity);
    }
}

输出:

队列: [A Computer, Portal, Geeks, forGeeks]
剩余容量: 2147483647

Python教程

Java教程

Web教程

数据库教程

图形图像教程

大数据教程

开发工具教程

计算机教程