A D I P R S T

A

addBack(double) - Method in class Deque

Adds the specified element to the back of this Deque.

addFront(double) - Method in class Deque

Adds the specified element to the front of this Deque.

D

Deque - class Deque.

A "deque" is a double-ended queue: it is a data structure which restricts access to ends.

Deque() - Constructor for class Deque

Creates an empty Deque

Deque(int) - Constructor for class Deque

Creates an empty deque with the specified initial capacity

I

isEmpty() - Method in class Deque

Returns true if the there are no elements in this Deque, false otherwise

P

peekBack() - Method in class Deque

Returns the element at the back of this Deque.

peekFront() - Method in class Deque

Returns the element at the front of this Deque.

R

removeBack() - Method in class Deque

Removes and returns the element at the back of this Deque.

removeFront() - Method in class Deque

Removes and returns the element at the front of this Deque.

S

size() - Method in class Deque

Returns the number of elements currently in this Deque

T

toString() - Method in class Deque

Returns a String representation of this Deque from front to back.

A D I P R S T