Poll() Method : Java.util.ArrayDeque
Declaration :
|
1 |
public E poll() |
Explanation :
| Purpose | The java.util.ArrayDeque.poll() retrieves and removes the head of the queue represented by this deque.Returns null if this deque is empty. |
| Parameters | NA |
| Return Value | This method returns the head of the queue represented by this deque or null if this deque is empty. |
| Exception | NA |
Java Program : Example
Below example will explain java.util.ArrayDeque.poll() method.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 |
package com.c4learn; import java.util.ArrayDeque; import java.util.Deque; public class ArrayDequeDemo { public static void main(String[] args) { // Create empty array deque with an initial capacity Deque<Integer> deque = new ArrayDeque<Integer>(8); // Use add() method to add elements deque.add(100); deque.add(25); deque.add(54); deque.add(40); deque.add(80); // Print all the elements in deque for (Integer number : deque) { System.out.println("Element is " + number); } int retval = deque.poll(); System.out.println("Removed Element is " + retval); // Print all the elements in deque after using poll() for (Integer number : deque) { System.out.println("Element is " + number); } } } |
Output of Program :
|
1 2 3 4 5 6 7 8 9 10 |
Element is 100 Element is 25 Element is 54 Element is 40 Element is 80 Removed Element is 100 Element is 25 Element is 54 Element is 40 Element is 80 |