Java PriorityBlockingQueue size()方法

PriorityBlockingQueue的 size() 方法是用来 查找队列的当前大小 它返回集合中元素的数量。如果集合中包含超过Integer.MAX_VALUE的元素，那么该方法将返回Integer.MAX_VALUE。

语法

public int size()

返回值： 该方法返回该PriorityBlockingQueue中存在的元素数量。

下面是说明PriorityBlockingQueue的size()方法的程序。

程序1:

// Java program to demonstrate
// size() method
  
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("1");
        pbq.put("2");
        pbq.put("3");
        pbq.put("4");
  
        // print queue
        System.out.println("Queue:  " + pbq);
        System.out.println("Queue Size:  " + pbq.size());
    }
}

输出:

Queue:  [1, 2, 3, 4]
Queue Size:  4

程序2：演示动态改变队列的size()。

// Java program to demonstrate 
// size() method 
  
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("1");
        pbq.put("2");
        pbq.put("3");
        pbq.put("4");
  
        // print queue
        System.out.println("Queue:  " + pbq);
        System.out.println("Queue Size:  " + pbq.size());
  
        // remove 2
        boolean res = pbq.remove("2");
        System.out.println("\n2 removed: " + res);
  
        // print queue
        System.out.println("Queue:  " + pbq);
        System.out.println("Queue Size:  " + pbq.size());
  
        // add  5
        pbq.put("5");
  
        // print queue
        System.out.println("\n5 added");
        System.out.println("Queue:  " + pbq);
        System.out.println("Queue Size:  " + pbq.size());
    }
}

输出:

Queue:  [1, 2, 3, 4]
Queue Size:  4

2 removed: true
Queue:  [1, 4, 3]
Queue Size:  3

5 added
Queue:  [1, 4, 3, 5]
Queue Size:  4