1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140
|
#ifndef STACK_H_INCLUDED
#define STACK_H_INCLUDED
#include <exception>
#include<string>
class StackException:
public std::exception
{
private:
std::string msg;
public:
explicit StackException(const char* message): msg(message){}
explicit StackException(const std::string& message) : msg(message){}
virtual ~StackException() throw (){}
virtual const char* what() const throw(){
return msg.c_str();
}
};
///DEFINITION
template <class T, int ARRAYSIZE = 1024>
class Stack{
private:
T data[ARRAYSIZE];
int top;
void copyAll(const Stack<T, ARRAYSIZE>&);
public:
Stack(); ///constructor base
Stack(const Stack<T, ARRAYSIZE>&); ///constructor copy
void initialize();
bool isEmpty();
bool isFull();
void push(const T&);
void showStack();
T pop();
T getTop();
void gotoxy(int,int);
Stack<T, ARRAYSIZE>& operator = (const Stack<T, ARRAYSIZE>&); ///OPERATOR ASIGNED
};
///IMPLEMENTATION
using namespace std;
template <class T, int ARRAYSIZE>
Stack<T,ARRAYSIZE>::Stack():top(-1){ }
template <class T, int ARRAYSIZE>
void Stack<T, ARRAYSIZE>::copyAll(const Stack<T, ARRAYSIZE>& s)
{
int i(0);
while (i <= s.top)
{
this->data[i] = s.data[i];
i++;
}
this->top = s.top;
}
template <class T, int ARRAYSIZE>
Stack<T,ARRAYSIZE>::Stack(const Stack<T,ARRAYSIZE>& s){
copyAll(s);
}
template <class T, int ARRAYSIZE>
bool Stack<T, ARRAYSIZE>::isEmpty(){
return top == -1;
}
template <class T, int ARRAYSIZE>
bool Stack<T, ARRAYSIZE>::isFull(){
return top == ARRAYSIZE -1;
}
template <class T, int ARRAYSIZE>
void Stack<T, ARRAYSIZE>::push(const T& e){
if(isFull()){
throw StackException("DATA OVERLOAD, PUSH");
}
data[++top]= e;
}
template <class T, int ARRAYSIZE>
T Stack<T, ARRAYSIZE>::pop(){
if(isEmpty()){
throw StackException("DATA INSUFFICIENCY, POP");
}
return data[top--];
}
template <class T, int ARRAYSIZE>
T Stack<T, ARRAYSIZE>::getTop(){
if(isEmpty()){
throw StackException("DATA INSUFFICIENCY, getTop");
}
return data[top];
}
template <class T, int ARRAYSIZE> ///& reference
Stack<T, ARRAYSIZE>& Stack<T, ARRAYSIZE>::operator = (const Stack<T, ARRAYSIZE>& s){
copyAll(s);
return *this;
}
template <class T, int ARRAYSIZE>
void Stack<T, ARRAYSIZE>::showStack(){
int ayuda,i;
if(!isEmpty()){
system("cls");
printf("\n\n\t\t%c%c%c%c%c \n",201,205,205,205,187);
for(i=top;i>=0;i--){
printf("\t\t%c%c ",186,205);
cout<<data[i]; printf(" %c\n",186);
printf("\t\t%c%c%c%c%c\n",204,205,205,205,185);
}
//system("pause");
}
}
template <class T, int ARRAYSIZE>
void Stack<T, ARRAYSIZE>::gotoxy(int x,int y){
HANDLE hcon;
hcon = GetStdHandle(STD_OUTPUT_HANDLE);
COORD dwPos;
dwPos.X = x;
dwPos.Y= y;
SetConsoleCursorPosition(hcon,dwPos);
}
#endif // STACK_H_INCLUDED
|