A data structure that works in LIFO principle.
More...
#include <Stack.hpp>
template<class T, class Container = std::deque<T>>
class Stack< T, Container >
A data structure that works in LIFO principle.
- Template Parameters
-
◆ Stack()
template<class T , class Container = std::deque<T>>
◆ isEmpty()
template<class T , class Container = std::deque<T>>
bool Stack< T, Container >::isEmpty |
( |
| ) |
|
|
inline |
◆ isFull()
template<class T , class Container = std::deque<T>>
bool Stack< T, Container >::isFull |
( |
| ) |
|
|
inline |
◆ peek()
template<class T , class Container = std::deque<T>>
void Stack< T, Container >::peek |
( |
| ) |
|
|
inline |
◆ pop()
template<class T , class Container = std::deque<T>>
T Stack< T, Container >::pop |
( |
| ) |
|
|
inline |
◆ push()
template<class T , class Container = std::deque<T>>
T Stack< T, Container >::push |
( |
T |
element | ) |
|
|
inline |
◆ top()
template<class T , class Container = std::deque<T>>
T Stack< T, Container >::top |
( |
| ) |
|
|
inline |
◆ _top
template<class T , class Container = std::deque<T>>
size_t Stack< T, Container >::_top |
|
private |
◆ stack
template<class T , class Container = std::deque<T>>
The documentation for this class was generated from the following file:
- /home/prajol329/Projects/campus/sem4/graphics/project/voxeloop/core/include/Data Structures/Stack.hpp