DynamicStack< T > Class Template Reference

Stack implementation with dynamic memory allocation. More...

#include <DynamicStack.hpp>

Inheritance diagram for DynamicStack< T >:

Collaboration diagram for DynamicStack< T >:

Public Member Functions
	DynamicStack ()
	DynamicStack (T data[])
	create the structure and populate it with the data from the array More...
std::string	getName ()
	Provides the name of the data structure as a string representation. More...
void	push (T val)
	Add an element to the top of the stack. More...
T	pop ()
	Remove an element from the top of the stack. More...
T	peek ()
	See the value from the top of the stack, without removing it. More...
int	getSize ()
	Outputs the number of elements stored in the structure. More...
bool	isEmpty ()
	Check whether the structure is empty. More...
bool	isFull ()
	Check whether the structure is full. More...
Public Member Functions inherited from ProtectedLinkedList< T >
string	getName ()
	Provides the name of the data structure as a string representation. More...
	ProtectedLinkedList ()
	~ProtectedLinkedList ()
int	getSize ()
	Outputs the number of elements stored in the structure. More...
bool	isEmpty ()
	Check whether the structure is empty. More...
bool	isFull ()
	Check whether the structure is full. More...
Public Member Functions inherited from Stack< T >
std::string	getName ()
	Provides the name of the data structure as a string representation. More...

Additional Inherited Members
Protected Member Functions inherited from ProtectedLinkedList< T >
Node< T > *	getNode (int index)
	ProtectedLinkedList (const T data[])
	create the structure and populate it with the data from the array More...
Node< T > *	getFirst () const
Node< T > *	getLast () const
virtual void	insert (const T val)
	Insert an element at the end of the list. More...
virtual void	insert (const T val, const int index)
	Insert an element at the specified position in the list. More...
virtual T	remove (const int index)
	Remove an element from the list. More...
virtual T	get (const int index)
	Get the element at the specified position in the list, without removing. More...
virtual Iterator< T >	iterator ()
	Creates an Iterator, an object that allows the sequential access of values in a Linked List without the search overhead. More...

Detailed Description

template<class T>
class DynamicStack< T >

Stack implementation with dynamic memory allocation.

Author

Douglas De Rizzo Meneghetti (dougl.nosp@m.asri.nosp@m.zzom@.nosp@m.gmai.nosp@m.l.com)

Date

2017-6-14Stack implementation with dynamic memory allocation. This stack extends a ProtectedLinkedList in order to gain dynamic memory allocation powers.

Template Parameters

T	The type of object the data structure will contain

Definition at line 19 of file DynamicStack.hpp.

Constructor & Destructor Documentation

DynamicStack() [1/2]

template<class T>

DynamicStack< T >::DynamicStack ( )

inlineexplicit

Definition at line 21 of file DynamicStack.hpp.

{}

DynamicStack() [2/2]

template<class T>

DynamicStack< T >::DynamicStack ( T  data[] )

inlineexplicit

create the structure and populate it with the data from the array

Parameters

data	an array with data with which the structure will be initialized

Definition at line 25 of file DynamicStack.hpp.

: ProtectedLinkedList<T>(data) {}

Here is the call graph for this function:

=======

>>>>>>> 36f9b37... fixed dependency of ProtectedLinkedList to Iterator =======

>>>>>>> bded2143692dca559ffcc9e7202d9eb5fbfc45bf =======