Template Class Dequeue

• Defined in File Dequeue.h

Class Documentation

template<class T>
class Dequeue

a DEQUEUE on a bidirectional list with pointers

Public Types

using Item = T

the type of the items

using value_type = T

using size_type = std::size_t

using difference_type = std::ptrdiff_t

using reference = T&

using const_reference = const T&

using iterator = typename List<T>::iterator

using const_iterator = typename List<T>::const_iterator

using reverse_iterator = typename List<T>::reverse_iterator

using const_reverse_iterator = typename List<T>::const_reverse_iterator

Public Functions

bool empty(void) const

void insertHead(const T &v)

Post:

the dequeue is not empty

void insertTail(const T &v)

Post:

the dequeue is not empty

T removeHead(void)

Pre:

the dequeue is not empty

T removeTail(void)

Pre:

the dequeue is not empty

const T &head(void) const

Pre:

the dequeue is not empty

const T &tail(void) const

Pre:

the dequeue is not empty

inline iterator begin(void)

inline iterator end(void)

inline const_iterator begin(void) const

inline const_iterator end(void) const

inline const_iterator cbegin(void) const

inline const_iterator cend(void) const

inline reverse_iterator rbegin(void)

inline reverse_iterator rend(void)

inline const_reverse_iterator rbegin(void) const

inline const_reverse_iterator rend(void) const

inline void push_back(const T &v)

insertTail() and insertHead(), for the inserters of std

inline void push_front(const T &v)