forked from kishanrajput23/Java-Projects-Collections
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathCalculator.java
182 lines (91 loc) · 2.83 KB
/
Calculator.java
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
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
package simplejavacalculator;
import static java.lang.Double.NaN;
import static java.lang.Math.log10;
import static java.lang.Math.pow;
public class Calculator {
public enum BiOperatorModes {
normal, add, minus, multiply, divide , xpowerofy
}
public enum MonoOperatorModes {
square, squareRoot, oneDividedBy, cos, sin, tan ,log , rate, abs
}
private double num1, num2;
private BiOperatorModes mode = BiOperatorModes.normal;
private double calculateBiImpl() {
if (mode == BiOperatorModes.normal) {
return num2;
}
if (mode == BiOperatorModes.add) {
if (num2 != 0) {
return num1 + num2;
}
return num1;
}
if (mode == BiOperatorModes.minus) {
return num1 - num2;
}
if (mode == BiOperatorModes.multiply) {
return num1 * num2;
}
if (mode == BiOperatorModes.divide) {
return num1 / num2;
}
if (mode == BiOperatorModes.xpowerofy) {
return pow(num1,num2);
}
// never reach
throw new Error();
}
public Double calculateBi(BiOperatorModes newMode, Double num) {
if (mode == BiOperatorModes.normal) {
num2 = 0.0;
num1 = num;
mode = newMode;
return NaN;
} else {
num2 = num;
num1 = calculateBiImpl();
mode = newMode;
return num1;
}
}
public Double calculateEqual(Double num) {
return calculateBi(BiOperatorModes.normal, num);
}
public Double reset() {
num2 = 0.0;
num1 = 0.0;
mode = BiOperatorModes.normal;
return NaN;
}
public Double calculateMono(MonoOperatorModes newMode, Double num) {
if (newMode == MonoOperatorModes.square) {
return num * num;
}
if (newMode == MonoOperatorModes.squareRoot) {
return Math.sqrt(num);
}
if (newMode == MonoOperatorModes.oneDividedBy) {
return 1 / num;
}
if (newMode == MonoOperatorModes.cos) {
return Math.cos(Math.toRadians(num));
}
if (newMode == MonoOperatorModes.sin) {
return Math.sin(Math.toRadians(num));
}
if (newMode == MonoOperatorModes.tan) {
if (num == 0 || num % 180 == 0) {
return 0.0;
}
if (num % 90 == 0 && num % 180 != 0) {
return NaN;
}
return Math.tan(Math.toRadians(num));
}
if (newMode == MonoOperatorModes.log) {
return log10(num);
}
if (newMode == MonoOperatorModes.rate) {
return num / 100;
}