PriorityBlockingQueue size() method in Java
The size() method of PriorityBlockingQueue is used to find the present size of the queue. It returns the number of elements in the collection. If the collection contains more than Integer.MAX_VALUE elements, then this method returns Integer.MAX_VALUE.
Syntax:
public int size()
Return Value: This method returns the number of elements present in this PriorityBlockingQueue
Below are the program to illustrate size() method of PriorityBlockingQueue:
Program 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()); } } |
Output:
Queue: [1, 2, 3, 4] Queue Size: 4
Program 2: To demonstrate size() for dynamically changing queue.
// 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()); } } |
Output:
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
Contact Us