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 peek() method is used to return the head of the queue. It retrieves but does not remove, the head of this queue. If the queue is empty then this method returns null.
public E peek()
Parameters: The method does not take any parameters.
Return Value: The method returns the element present at the head of this queue.
Below programs illustrate peek() method of ArrayBlockingQueue.
After addding numbers queue is [23, 32, 45, 12] Head of queue 23
Details of First User Inserted User Name : Aman User Age : 24
- ArrayBlockingQueue put() method in Java
- ArrayBlockingQueue take() method in Java
- ArrayBlockingQueue contains() method in Java
- ArrayBlockingQueue add() method in Java
- LinkedBlockingDeque peek() method in Java
- Stack peek() Method in Java
- PriorityQueue peek() Method in Java
- LinkedTransferQueue peek() method in Java
- ConcurrentLinkedQueue peek() method in Java
- ArrayDeque peek() Method in Java
- ConcurrentLinkedDeque peek() method in Java with Example
- Queue peek() method in Java
- PriorityBlockingQueue peek() method in Java
- LinkedBlockingQueue peek() method in Java
- ArrayBlockingQueue poll() Method in Java
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.