ArrayBlockingQueue is bounded, blocking queue that stores the elements internally backed by an array.
- ArrayBlockingQueue class is a member of the Java Collections Framework.
- Bounded means it will have a fixed size, you can not store number the elements more than the capacity of the queue.
- The queue also follows FIFO (first-in-first-out) rule for storing and removing elements from the queue.
- If you try to put an element into a full queue or to take an element from an empty queue then the queue will block you.
The size() method returns the number of elements that queue contains. Size is an important method to see how many elements the queue contains and how many elements can be added to this queue by calculating the difference between the capacity of queue and size of the queue.
public int size()
Parameters: The method does not take any parameters.
Return Value:The method returns the number of elements in this queue.
Below programs illustrate size() method of ArrayBlockingQueue.
After addding numbers Queue size = 3 After addding more numbers Queue size = 5
After addding numbers Queue size = 2 After addding more numbers Queue size = 4
Attention reader! Don’t stop learning now. Get hold of all the important Java Foundation and Collections concepts with the Fundamentals of Java and Java Collections Course at a student-friendly price and become industry ready.