This Java program Implements ArrayDeque API.Resizable-array implementation of the Deque interface. Array deques have no capacity restrictions; they grow as necessary to support usage. They are not thread-safe; in the absence of external synchronization, they do not support concurrent access by multiple threads. Null elements are prohibited. This class is likely to be faster than Stack when used as a stack, and faster than LinkedList when used as a queue.
Here is the source code of the Java Program to Implement ArrayDeque API. The Java program is successfully compiled and run on a Linux system. The program output is also shown below.
import java.util.ArrayDeque; import java.util.Collection; import java.util.Iterator; public class ArrayDequeImpl<E> { private ArrayDeque<E> arrayDeque; /** * Constructs an empty array deque with an initial capacity sufficient to * hold 16 elements. **/ public ArrayDequeImpl() { arrayDeque = new ArrayDeque<E>(); } /** * Constructs a deque containing the elements of the specified collection, * in the order they are returned by the collection's iterator. **/ public ArrayDequeImpl(Collection<? extends E> c) { arrayDeque = new ArrayDeque<E>(c); } /** * Constructs an empty array deque with an initial capacity sufficient to * hold the specified number of elements. **/ public ArrayDequeImpl(int numElements) { arrayDeque = new ArrayDeque<E>(numElements); } /** Inserts the specified element at the tail of this queue. **/ public boolean add(E e) { return arrayDeque.add(e); } /** Atomically removes all of the elements from this queue. **/ public void clear() { arrayDeque.clear(); } /** Returns true if this queue contains the specified element. **/ public boolean contains(Object o) { return arrayDeque.contains(o); } /** Returns an iterator over the elements in this queue in proper sequence. **/ public Iterator<E> iterator() { return arrayDeque.iterator(); } /** * Inserts the specified element at the tail of this queue if it is possible * to do so immediately without exceeding the queue's capacity, returning * true upon success and false if this queue is full. **/ public boolean offer(E e) { return arrayDeque.offer(e); } /** * Retrieves, but does not remove, the head of this queue, or returns null * if this queue is empty. **/ public E peek() { return arrayDeque.peek(); } /** * Retrieves and removes the head of this queue, or returns null if this * queue is empty. **/ public E poll() { return arrayDeque.poll(); } /** * Removes a single instance of the specified element from this queue, if it * is present. **/ public boolean remove(Object o) { return arrayDeque.remove(o); } /** Returns the number of elements in this queue. **/ public int size() { return arrayDeque.size(); } /** * Returns an array containing all of the elements in this queue, in proper * sequence. **/ public Object[] toArray() { return arrayDeque.toArray(); } /** * Returns an array containing all of the elements in this queue, in proper * sequence; the runtime type of the returned array is that of the specified * array. **/ public <T> T[] toArray(T[] a) { return arrayDeque.toArray(a); } /** Returns a string representation of this collection. **/ public String toString() { return arrayDeque.toString(); } /** Inserts the specified element at the front of this deque. **/ public void addFirst(E e) { arrayDeque.addFirst(e); } /** Inserts the specified element at the end of this deque. **/ public void addLast(E e) { arrayDeque.addLast(e); } /** Retrieves, but does not remove, the first element of this deque. **/ public void getFirst() { arrayDeque.getFirst(); } /** Retrieves, but does not remove, the last element of this deque. **/ public void getLast() { arrayDeque.getLast(); } /** Inserts the specified element at the front of this deque. **/ public boolean offerFirst(E e) { return arrayDeque.offerFirst(e); } /** Inserts the specified element at the end of this deque. **/ public boolean offerLast(E e) { return arrayDeque.offerLast(e); } /** * Retrieves, but does not remove, the first element of this deque, or * returns null if this deque is empty. **/ public E peekFirst() { return arrayDeque.peekFirst(); } /** * Retrieves, but does not remove, the last element of this deque, or * returns null if this deque is empty. **/ public E peekLast() { return arrayDeque.peekLast(); } public static void main(String... arg) { ArrayDequeImpl<Integer> arrayDeque = new ArrayDequeImpl<Integer>(); arrayDeque.add(300); arrayDeque.add(200); arrayDeque.add(600); arrayDeque.add(-400); arrayDeque.add(240); System.out.println("the elements of the arrayDeque is "); Iterator<Integer> itr = arrayDeque.iterator(); while (itr.hasNext()) { System.out.print(itr.next() + "\t"); } System.out.println(); arrayDeque.offer(600); arrayDeque.offer(700); arrayDeque.offerFirst(3); arrayDeque.offerLast(10); System.out.println("the peak element of the arrayDeque is(by peeking) " + arrayDeque.peek()); System.out.println("the peak element of the arrayDeque is(by polling) " + arrayDeque.poll()); System.out.println("the last element of arrayDeque is (peeking)" + arrayDeque.peekLast()); System.out.println("element 300 removed " + arrayDeque.remove(300)); System.out.println("the arrayDeque contains 400 :" + arrayDeque.contains(400)); System.out.println("the arrayDeque contains 600 :" + arrayDeque.contains(600)); System.out.println("the size of the arrayDeque is " + arrayDeque.size()); System.out.println(arrayDeque); } }
$ javac ArrayDequeImpl.java $ java ArrayDequeImpl the elements of the arrayDeque is 300 200 600 -400 240 the peak element of the arrayDeque is(by peeking) 3 the peak element of the arrayDeque is(by polling) 3 the last element of arrayDeque is (peeking)10 element 300 removed true the arrayDeque contains 400 :false the arrayDeque contains 600 :true the size of the arrayDeque is 7 [200, 600, -400, 240, 600, 700, 10]
Related posts:
Một số tính năng mới về xử lý ngoại lệ trong Java 7
A Guide to EnumMap
A Guide to the Java LinkedList
Guide to ThreadLocalRandom in Java
Anonymous Classes in Java
Java – Try with Resources
Spring Data Reactive Repositories with MongoDB
Introduction to Spring Data MongoDB
Java Program to Check Cycle in a Graph using Topological Sort
Serve Static Resources with Spring
Serialize Only Fields that meet a Custom Criteria with Jackson
Chuyển đổi từ HashMap sang ArrayList
Java Program to Implement AVL Tree
Java – String to Reader
Extra Login Fields with Spring Security
Java 8 Predicate Chain
Java Program to find the maximum subarray sum using Binary Search approach
Java Program to Search Number Using Divide and Conquer with the Aid of Fibonacci Numbers
Java Program to Check Whether a Directed Graph Contains a Eulerian Path
Java Program to Implement the Program Used in grep/egrep/fgrep
Adding Parameters to HttpClient Requests
Java Program to Implement Sorted List
Assert an Exception is Thrown in JUnit 4 and 5
Java Program to Implement wheel Sieve to Generate Prime Numbers Between Given Range
Sorting Query Results with Spring Data
Spring Boot - Apache Kafka
A Guide to the ResourceBundle
Java Program to Perform Inorder Non-Recursive Traversal of a Given Binary Tree
How to Break from Java Stream forEach
HttpClient 4 – Send Custom Cookie
Java Program to Find Median of Elements where Elements are Stored in 2 Different Arrays
Comparing Two HashMaps in Java