AlgoPlus v0.1.0
Loading...
Searching...
No Matches
dequeue_list< T > Class Template Reference

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_listoperator= (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
 
front ()
 top function
 
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
 

Detailed Description

template<typename T>
class dequeue_list< T >

dequeue list class

Constructor & Destructor Documentation

◆ dequeue_list() [1/2]

template<typename T>
dequeue_list< T >::dequeue_list ( std::vector< T > v = {})
inlineexplicitnoexcept

Construct a new dequeue list object.

Parameters
vinitializer vector

◆ dequeue_list() [2/2]

template<typename T>
dequeue_list< T >::dequeue_list ( const dequeue_list< T > & q)
inlineexplicit

Copy constructor for dequeue list class.

Parameters
qthe dequeue we want to copy

Member Function Documentation

◆ back()

template<typename T>
T dequeue_list< T >::back ( )
inline

back function

Returns
T the back of the dequeue

◆ begin()

template<typename T>
Iterator dequeue_list< T >::begin ( )
inline

pointer to the front of the dequeue

Returns
Iterator

◆ end()

template<typename T>
Iterator dequeue_list< T >::end ( )
inline

pointer to the end of the dequeue

Returns
Iterator

◆ front()

template<typename T>
T dequeue_list< T >::front ( )
inline

top function

Returns
T the top of the dequeue

◆ operator=()

template<typename T>
dequeue_list & dequeue_list< T >::operator= ( const dequeue_list< T > & q)
inline

operator = for dequeue list class

Parameters
qthe dequeue we want to copy
Returns
dequeue_list&

◆ push_back()

template<typename T>
void dequeue_list< T >::push_back ( T key)
inline

push_back function

Parameters
keythe key to be pushed back

◆ push_front()

template<typename T>
void dequeue_list< T >::push_front ( T key)
inline

push_front function

Parameters
keythe key to be pushed front

◆ size()

template<typename T>
size_t dequeue_list< T >::size ( )
inline

size functon

Returns
size_t the size of the stack

The documentation for this class was generated from the following file: