-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathcalculation.c
70 lines (55 loc) · 1.45 KB
/
calculation.c
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
# include "calculation.h"
# include <math.h>
double calculation(double a, double b, char operation)
{
switch (operation){
case '+' : return a + b;
break;
case '-' : return a - b;
break;
case '*' : return a * b;
break;
case '/' :
//if (b == 0)
//errx(1, "divide by 0");
return a / b;
break;
case '^' : return pow(a, b);
break;
case 's' : return sqrt(a);
break;
case 'l' : return log(a);
break;
case '@' : return cos(a);
break;
case '#' : return sin(a);
break;
case 'j' : return tan(a);
break;
case 'e' : return exp(a);
default : errx(1, "internal error unknown operator");
break;
}
return 0;
}
double solve(struct tree *t) {
if (t->left)
return calculation(solve(t->left), solve(t->right), t->key[0]);
return *(double *)(t->key);
}
double solveX(struct tree *t, double x) {
if (t->left)
return calculation(solveX(t->left, x), solveX(t->right, x), t->key[0]);
if (t->key[6] == -1 && t->key[7] == -1 && t->key[0] == 'x')
return x;
return *(double *)(t->key);
}
double solveXN(struct tree *t, double x, size_t n) {
if (t->left)
return calculation(solveXN(t->left, x, n), solveXN(t->right, x, n), t->key[0]);
if (t->key[6] == -1 && t->key[7] == -1 && t->key[0] == 'x')
return x;
if (t->key[6] == -1 && t->key[7] == -1 && t->key[0] == 'n')
return (double)n;
return *(double *)(t->key);
}