AStack.h
#ifndef ASTACK_HEADER #define ASTACK_HEADER #include
template
private:
int size; int top; Elem* listArray; AStack()
{ size = 100; top = 0; listArray = new Elem[100]; } ~AStack()
{ delete [] listArray; } void clear() { top = 0; } bool push(Elem& item) { }
bool pop(Elem& it) { }
bool topValue(Elem& it) const { }
int length() const { return top; }
if (top == 0) return false;
else { it = listArray[top - 1]; return true; } if (top == 0) return false;
else { it = listArray[--top]; return true; } if (top == size) return false;
else { listArray[top++] = item; return true; }
public:
}; #endif
Function.cpp
#include \#include \#include
void calUserInfo() { }
int isp(char& ch) {
switch(ch) { case '=':
return 0; break;
cout<<\ 智能计算器V1.0*\cout<<\cout<<\cout<<\cout<<\cout<<\cout<<\
case '+': case '-':
return 3; break;
case '*': case '/': case '%':
return 5;
}
break; return 1; break; return 8; break;
case '(':
case ')':
case '^': case '&': }
return 7; break;
int osp(char& ch) {
{ case '=':
return 0; break; switch(ch)
case '+': case '-':
return 2; break;
case '*': case '/': case '%':
return 4; break; return 8; break;
case '(':
case ')':
}
return 1; break;
case '^': case '&': }
return 6; break;
double extract(double x,double y) { }
bool cal(char op, double x, double y, double& r) {
int o = 0; switch(op) { case '-':
r = x - y; break; r = x + y; break; r = x / y; break;
(int) o = (int)x % (int)y; r = (double)o; break; r = x * y; return pow(x,1/y);
case '+':
case '/':
case '%':
case '*':
}
}
break; r = extract(x,y); break; r = pow(x,y); break;
case '&':
case '^':
return true;
bool isDigit(char ch) { }
bool isPoint(char ch) { }
bool isOperator(char ch) { }
double turnDigit(char ch)
if ((ch == '=') || (ch == '-') || (ch == '+') || (ch == '(') || (ch == ')') || (ch == '*') ||
(ch == '&') ||(ch == '/') ||(ch == '%') ||(ch == '^')) return true; if (ch == '.')
return true; else return false;
if (((int)ch >= 48) && ((int)ch <= 57))
return true; else return false;
else return false;