stack< Type > Class Template Reference

Collaboration diagram for stack< Type >:

Public Member Functions
void	display ()
	stack ()
	~stack ()
bool	isEmptyStack ()
void	push (Type item)
Type	top ()
void	pop ()
void	clear ()
stack< Type > &	operator= (const stack< Type > &otherStack)

Private Attributes
node< Type > *	stackTop
int	size

Constructor & Destructor Documentation

stack()

template<class Type >

stack< Type >::stack ( )

inline

Default constructor

            {
        stackTop = NULL;
        size = 0;
    }

~stack()

template<class Type >

stack< Type >::~stack ( )

inline

Destructor

{}

Member Function Documentation

clear()

template<class Type >

void stack< Type >::clear ( )

inline

Clear stack

{ stackTop = NULL; }

display()

template<class Type >

void stack< Type >::display ( )

inline

Show stack

                   {
        node<Type> *current = stackTop;
        std::cout << "Top --> ";
        while (current != NULL) {
            std::cout << current->data << "  ";
            current = current->next;
        }
        std::cout << std::endl;
        std::cout << "Size of stack: " << size << std::endl;
    }

Here is the call graph for this function:

isEmptyStack()

template<class Type >

bool stack< Type >::isEmptyStack ( )

inline

Determine whether the stack is empty

{ return (stackTop == NULL); }

operator=()

template<class Type >

stack<Type>& stack< Type >::operator= ( const stack< Type > &  otherStack )

inline

Overload "=" the assignment operator

                                                          {
        node<Type> *newNode, *current, *last;
 
        /* If stack is no empty, make it empty */
        if (stackTop != NULL) {
            stackTop = NULL;
        }
        if (otherStack.stackTop == NULL) {
            stackTop = NULL;
        } else {
            current = otherStack.stackTop;
            stackTop = new node<Type>;
            stackTop->data = current->data;
            stackTop->next = NULL;
            last = stackTop;
            current = current->next;
            /* Copy the remaining stack */
            while (current != NULL) {
                newNode = new node<Type>;
                newNode->data = current->data;
                newNode->next = NULL;
                last->next = newNode;
                last = newNode;
                current = current->next;
            }
        }
        size = otherStack.size;
        return *this;
    }

pop()

template<class Type >

void stack< Type >::pop ( )

inline

Remove the top element of the stack

               {
        node<Type> *temp;
        if (!isEmptyStack()) {
            temp = stackTop;
            stackTop = stackTop->next;
            delete temp;
            size--;
        } else {
            std::cout << "Stack is empty !" << std::endl;
        }
    }

Here is the call graph for this function:

push()

template<class Type >

void stack< Type >::push ( Type  item )

inline

Add new item to the stack

                         {
        node<Type> *newNode;
        newNode = new node<Type>;
        newNode->data = item;
        newNode->next = stackTop;
        stackTop = newNode;
        size++;
    }

top()

template<class Type >

Type stack< Type >::top ( )

inline

Return the top element of the stack

               {
        assert(stackTop != NULL);
        return stackTop->data;
    }

Member Data Documentation

stackTop

template<class Type >

node<Type>* stack< Type >::stackTop

private

Pointer to the stack

---

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

• data_structures/stack.h