Diffpack Documentation

---

              Search  

---

Stack(Type) Class Reference

dynamic stack structure for arbitrary entry types. More...

#include <Stack_Type.h>

List of all members.

Public Methods
	Stack(Type) ()
	~Stack(Type) ()
void	push (Type value)
Type	pop ()
Type	top ()
bool	empty ()

---

Detailed Description

dynamic stack structure for arbitrary entry types.

NAME: Stack(Type) - dynamic stack structure for arbitrary entry types

DESCRIPTION:

This class offers a dynamic stack structure parametrized with respect to the entry data type. Since stack entries are stored by value, this implementation is not very efficient for "Type"s given by large objects. Further improvements would include parametrization of storage scheme (pointer, handle and instance), see class "DpList".

---

Constructor & Destructor Documentation

Stack(Type)::Stack_Type ( ) [inline]

The only constructor takes no arguments and defines a new, empty stack.

Stack(Type)::~Stack(Type) ( ) [inline]

---

Member Function Documentation

bool Stack(Type)::empty ( ) [inline]

Returns true if the stack is empty, otherwise false is returned.

Type Stack(Type)::pop ( )

Pop the top entry from the stack.

void Stack(Type)::push ( Type value ) [inline]

Push a new entry on top of the stack.

Type Stack(Type)::top ( )

Return a copy of the top entry of the stack, without popping.

---

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

• Stack_Type.h

---