#include <deque.h>
| |
A mutable random access iterator.
| |
| |
A const random access iterator.
|
| |
Introduces an empty deque.
| |
| |
Copy constructor.
| |
| |
Introduces a deque with items, all initialized to
.
|
|
| Assignment. |
|
| Test for equality: Two deques are equal, iff they have the same size and if their corresponding elements are equal. |
|
| Test for inequality. |
|
| Test for lexicographically smaller. |
|
| Returns a mutable iterator referring to the first element in deque D. |
|
| Returns a constant iterator referring to the first element in deque D. |
|
| Returns a mutable iterator which is the past-end-value of deque D. |
|
| Returns a constant iterator which is the past-end-value of deque D. |
|
| Returns true if D is empty. |
|
| Returns the number of items in deque D. |
|
| Random access operator. |
|
| Random access operator. |
|
| Returns a reference to the first item in deque D. |
|
| Returns a const reference to the first item in deque D. |
|
| Returns a reference to the last item in deque D. |
|
| Returns a const reference to the last item in deque D. |
|
| Inserts an item at the beginning of deque D. | ||
|
| Inserts an item at the end of deque D. | ||
|
| |||
Inserts a copy of t in front of iterator pos. The return value points to the inserted item. | ||||
|
| |||
Inserts copy of t in front of iterator pos. The return value points to the inserted item. | ||||
|
| |||
Inserts a copy of the range first, last in front of iterator pos. | ||||
|
| Removes the first item from deque D. | ||
|
| Removes the last item from deque D. | ||
|
| |||
Removes the item from deque D, where pos refers to. | ||||
|
| |||
Removes the items in the rangefirst, last from deque D. |