LinkedDeque

java.lang.Object
- net.datastructures.LinkedDeque<E>

All Implemented Interfaces:

Deque<E>
```
public class LinkedDeque<E>
extends Object
implements Deque<E>
```
Realization of a double-ended queue (deque) as an adaptation of a DoublyLinkedList. All operations are performed in constant time.

See Also:
DoublyLinkedList

Constructor Summary

Constructors
Constructor and Description

LinkedDeque()
Creates an empty deque.

Constructors
Constructor and Description
`LinkedDeque()` Creates an empty deque.

Method Summary

Methods
Modifier and Type	Method and Description
`void`	`addFirst(E e)` Inserts an element at the front of the deque.
`void`	`addLast(E e)` Inserts an element at the back of the deque.
`E`	`first()` Returns (but does not remove) the first element of the deque.
`boolean`	`isEmpty()` Tests whether the deque is empty.
`E`	`last()` Returns (but does not remove) the last element of the deque.
`E`	`removeFirst()` Removes and returns the first element of the deque.
`E`	`removeLast()` Removes and returns the last element of the deque.
`int`	`size()` Returns the number of elements in the deque.
`String`	`toString()` Produces a string representation of the contents of the deque.

Methods inherited from class java.lang.Object
clone, equals, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

- Constructor Detail
  - LinkedDeque
```
public LinkedDeque()
```
    Creates an empty deque.
- Method Detail
  - size
```
public int size()
```
    Description copied from interface: Deque
    
    Returns the number of elements in the deque.
    
    Specified by:
    
    size in interface Deque<E>
    
    Returns:
    number of elements in the deque
  - isEmpty
```
public boolean isEmpty()
```
    Description copied from interface: Deque
    
    Tests whether the deque is empty.
    
    Specified by:
    
    isEmpty in interface Deque<E>
    
    Returns:
    true if the deque is empty, false otherwise
  - first
```
public E first()
```
    Description copied from interface: Deque
    
    Returns (but does not remove) the first element of the deque.
    
    Specified by:
    
    first in interface Deque<E>
    
    Returns:
    first element of the deque (or null if empty)
  - last
```
public E last()
```
    Description copied from interface: Deque
    
    Returns (but does not remove) the last element of the deque.
    
    Specified by:
    
    last in interface Deque<E>
    
    Returns:
    last element of the deque (or null if empty)
  - addFirst
```
public void addFirst(E e)
```
    Description copied from interface: Deque
    
    Inserts an element at the front of the deque.
    
    Specified by:
    
    addFirst in interface Deque<E>
    
    Parameters:
    e - the new element
  - addLast
```
public void addLast(E e)
```
    Description copied from interface: Deque
    
    Inserts an element at the back of the deque.
    
    Specified by:
    
    addLast in interface Deque<E>
    
    Parameters:
    e - the new element
  - removeFirst
```
public E removeFirst()
```
    Description copied from interface: Deque
    
    Removes and returns the first element of the deque.
    
    Specified by:
    
    removeFirst in interface Deque<E>
    
    Returns:
    element removed (or null if empty)
  - removeLast
```
public E removeLast()
```
    Description copied from interface: Deque
    
    Removes and returns the last element of the deque.
    
    Specified by:
    
    removeLast in interface Deque<E>
    
    Returns:
    element removed (or null if empty)
  - toString
```
public String toString()
```
    Produces a string representation of the contents of the deque. (from front to back). This exists for debugging purposes only.
    
    Overrides:
    
    toString in class Object

Class LinkedDeque<E>

Constructor Summary

Method Summary

Methods inherited from class java.lang.Object

Constructor Detail

LinkedDeque

Method Detail

size

isEmpty

first

last

addFirst

addLast

removeFirst

removeLast

toString