Java中的PriorityBlockingQueue remainingCapacity()方法

这个 剩余容量 方法 优先阻塞队列 用于检查 可以在这个队列中插入多少元素。 但由于PriorityBlockingQueue是无界的,因此该方法总是返回 整数最大值 因为PriorityBlockingQueue没有容量限制。 语法:

null
public int remainingCapacity()

返回值: 整数总是最大值 下面的程序演示了PriorityBlockingQueue中的remainingCapacity()方法: 项目1:

JAVA

// Java Program Demonstrate remainingCapacity()
// method of PriorityBlockingQueue
import java.util.concurrent.PriorityBlockingQueue;
public class GFG {
public static void main(String[] args)
{
// define capacity of PriorityBlockingQueue
int capacityOfQueue = 7 ;
// create object of PriorityBlockingQueue
PriorityBlockingQueue<Integer> pbq
= new PriorityBlockingQueue<Integer>(capacityOfQueue);
// Add element to PriorityBlockingQueue
pbq.put( 1 );
pbq.put( 2 );
pbq.put( 3 );
pbq.put( 4 );
// find remaining Capacity  of pbq
// using remainingCapacity() method
// The initial capacity was set to 7
// by passing as parameter in constructor
// But this method will return Integer.MAX_VALUE
int remainingCapacity = pbq.remainingCapacity();
// print result
System.out.println( "Queue:  " + pbq);
System.out.println( "Remaining Capacity: " + remainingCapacity);
}
}


输出:

Queue:  [1, 2, 3, 4]Remaining Capacity: 2147483647

项目2: 使用字符串演示remainingCapacity()

JAVA

// Java Program Demonstrate remainingCapacity()
// method of PriorityBlockingQueue
import java.util.concurrent.PriorityBlockingQueue;
public class GFG {
public static void main(String[] args)
{
// create object of PriorityBlockingQueue
PriorityBlockingQueue<String> pbq
= new PriorityBlockingQueue<String>();
// Add element to PriorityBlockingQueue
pbq.put( "Geeks" );
pbq.put( "forGeeks" );
pbq.put( "A Computer" );
pbq.put( "Portal" );
// find remaining Capacity  of pbq
// using remainingCapacity() method
int remainingCapacity = pbq.remainingCapacity();
// print result
System.out.println( "Queue:  " + pbq);
System.out.println( "Remaining Capacity: " + remainingCapacity);
}
}


输出:

Queue:  [A Computer, Portal, Geeks, forGeeks]Remaining Capacity: 2147483647

© 版权声明
THE END
喜欢就支持一下吧
点赞9 分享