Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- package src;
- import java.util.ArrayDeque;
- import java.util.Iterator;
- public class ArrayDequeDeque<E> {
- ArrayDeque<E> deque = new ArrayDeque<E>();
- public boolean add(E e) {
- return deque.add(e);
- }
- public void addFirst(E e) {
- deque.push(e);
- }
- public void addLast(E e) {
- deque.addLast(e);
- }
- public boolean contains(Object o) {
- return deque.contains(o);
- }
- public Iterator<E> descendingIterator() {
- return deque.descendingIterator();
- }
- public E element() {
- return deque.element();
- }
- public E getFirst() {
- return deque.getFirst();
- }
- public E getLast() {
- return deque.getLast();
- }
- public Iterator<E> iterator() {
- return deque.iterator();
- }
- public boolean offer(E e) {
- return deque.offer(e);
- }
- public boolean offerFirst(E e) {
- return deque.offerFirst(e);
- }
- public boolean offerLast(E e) {
- return deque.offerLast(e);
- }
- public E peek() {
- return deque.peek();
- }
- public E peekFirst() {
- return deque.peekFirst();
- }
- public E peekLast() {
- return deque.peekLast();
- }
- public E poll() {
- return deque.poll();
- }
- public E pollFirst() {
- return deque.pollFirst();
- }
- public E pollLast() {
- return deque.pollLast();
- }
- public E pop() {
- return deque.pop();
- }
- public void push(E e) {
- deque.push(e);
- }
- public E remove() {
- return deque.remove();
- }
- public boolean remove(Object o) {
- return deque.remove(o);
- }
- public E removeFirst() {
- return deque.removeFirst();
- }
- public boolean removeFirstOccurrence(Object o) {
- return deque.removeFirstOccurrence(o);
- }
- public E removeLast() {
- return deque.removeLast();
- }
- public boolean removeLastOccurrence(Object o) {
- return deque.removeLastOccurrence(o);
- }
- public int size() {
- return deque.size();
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement