![]() |
AlgoPlus v0.1.0
|
dequeue list class More...
#include <dequeue_list.h>
Classes | |
class | Iterator |
Iterator class. More... | |
Public Member Functions | |
dequeue_list (std::vector< T > v={}) noexcept | |
Construct a new dequeue list object. | |
dequeue_list (const dequeue_list &q) | |
Copy constructor for dequeue list class. | |
dequeue_list & | operator= (const dequeue_list &q) |
operator = for dequeue list class | |
void | clear () |
clear function | |
size_t | size () |
size functon | |
void | push_back (T key) |
push_back function | |
void | push_front (T key) |
push_front function | |
T | front () |
top function | |
T | back () |
back function | |
void | pop_front () |
pop_front function removes the front from the dequeue | |
void | pop_back () |
pop_back function removes the back from the queue | |
Iterator | begin () |
pointer to the front of the dequeue | |
Iterator | end () |
pointer to the end of the dequeue | |
dequeue list class
|
inlineexplicitnoexcept |
Construct a new dequeue list object.
v | initializer vector |
|
inlineexplicit |
Copy constructor for dequeue list class.
q | the dequeue we want to copy |
|
inline |
back function
|
inline |
pointer to the front of the dequeue
|
inline |
pointer to the end of the dequeue
|
inline |
top function
|
inline |
|
inline |
push_back function
key | the key to be pushed back |
|
inline |
push_front function
key | the key to be pushed front |
|
inline |
size functon