|
1 | 1 | package simplejavacalculator; |
2 | 2 |
|
3 | 3 | public class Calculator { |
4 | | - public enum BiOperatorModes { |
5 | | - normal, add, minus, multiply, divide |
6 | | - } |
| 4 | + public enum BiOperatorModes { |
| 5 | + normal, add, minus, multiply, divide |
| 6 | + } |
7 | 7 |
|
8 | | - public enum MonoOperatorModes { |
9 | | - square, squareRoot, oneDevidedBy, cos, sin, tan |
10 | | - } |
| 8 | + public enum MonoOperatorModes { |
| 9 | + square, squareRoot, oneDevidedBy, cos, sin, tan |
| 10 | + } |
11 | 11 |
|
12 | | - private Double num1, num2; |
13 | | - private BiOperatorModes mode = BiOperatorModes.normal; |
| 12 | + private Double num1, num2; |
| 13 | + private BiOperatorModes mode = BiOperatorModes.normal; |
14 | 14 |
|
15 | | - private Double calculateBiImpl() { |
16 | | - if (mode == BiOperatorModes.normal) { |
17 | | - return num2; |
18 | | - } |
19 | | - if (mode == BiOperatorModes.add) { |
20 | | - return num1 + num2; |
21 | | - } |
22 | | - if (mode == BiOperatorModes.minus) { |
23 | | - return num1 - num2; |
24 | | - } |
25 | | - if (mode == BiOperatorModes.multiply) { |
26 | | - return num1 * num2; |
27 | | - } |
28 | | - if (mode == BiOperatorModes.divide) { |
29 | | - return num1 / num2; |
30 | | - } |
| 15 | + private Double calculateBiImpl() { |
| 16 | + if (mode == BiOperatorModes.normal) { |
| 17 | + return num2; |
| 18 | + } |
| 19 | + if (mode == BiOperatorModes.add) { |
| 20 | + return num1 + num2; |
| 21 | + } |
| 22 | + if (mode == BiOperatorModes.minus) { |
| 23 | + return num1 - num2; |
| 24 | + } |
| 25 | + if (mode == BiOperatorModes.multiply) { |
| 26 | + return num1 * num2; |
| 27 | + } |
| 28 | + if (mode == BiOperatorModes.divide) { |
| 29 | + return num1 / num2; |
| 30 | + } |
31 | 31 |
|
32 | | - // never reach |
33 | | - throw new Error(); |
34 | | - } |
| 32 | + // never reach |
| 33 | + throw new Error(); |
| 34 | + } |
35 | 35 |
|
36 | | - public Double calculateBi(BiOperatorModes newMode, Double num) { |
37 | | - if (mode == BiOperatorModes.normal) { |
38 | | - num2 = 0.0; |
39 | | - num1 = num; |
40 | | - mode = newMode; |
41 | | - return Double.NaN; |
42 | | - } else { |
43 | | - num2 = num; |
44 | | - num1 = calculateBiImpl(); |
45 | | - mode = newMode; |
46 | | - return num1; |
47 | | - } |
48 | | - } |
| 36 | + public Double calculateBi(BiOperatorModes newMode, Double num) { |
| 37 | + if (mode == BiOperatorModes.normal) { |
| 38 | + num2 = 0.0; |
| 39 | + num1 = num; |
| 40 | + mode = newMode; |
| 41 | + return Double.NaN; |
| 42 | + } else { |
| 43 | + num2 = num; |
| 44 | + num1 = calculateBiImpl(); |
| 45 | + mode = newMode; |
| 46 | + return num1; |
| 47 | + } |
| 48 | + } |
49 | 49 |
|
50 | | - public Double calculateEqual(Double num) { |
51 | | - return calculateBi(BiOperatorModes.normal, num); |
52 | | - } |
| 50 | + public Double calculateEqual(Double num) { |
| 51 | + return calculateBi(BiOperatorModes.normal, num); |
| 52 | + } |
53 | 53 |
|
54 | | - public Double reset() { |
55 | | - num2 = 0.0; |
56 | | - num1 = 0.0; |
57 | | - mode = BiOperatorModes.normal; |
| 54 | + public Double reset() { |
| 55 | + num2 = 0.0; |
| 56 | + num1 = 0.0; |
| 57 | + mode = BiOperatorModes.normal; |
58 | 58 |
|
59 | | - return Double.NaN; |
60 | | - } |
| 59 | + return Double.NaN; |
| 60 | + } |
61 | 61 |
|
62 | | - public Double calculateMono(MonoOperatorModes newMode, Double num) { |
63 | | - if (newMode == MonoOperatorModes.square) { |
64 | | - return num * num; |
65 | | - } |
66 | | - if (newMode == MonoOperatorModes.squareRoot) { |
67 | | - return Math.sqrt(num); |
68 | | - } |
69 | | - if (newMode == MonoOperatorModes.oneDevidedBy) { |
70 | | - return 1 / num; |
71 | | - } |
72 | | - if (newMode == MonoOperatorModes.cos) { |
73 | | - return Math.cos(num); |
74 | | - } |
75 | | - if (newMode == MonoOperatorModes.sin) { |
76 | | - return Math.sin(num); |
77 | | - } |
78 | | - if (newMode == MonoOperatorModes.tan) { |
79 | | - return Math.tan(num); |
80 | | - } |
| 62 | + public Double calculateMono(MonoOperatorModes newMode, Double num) { |
| 63 | + if (newMode == MonoOperatorModes.square) { |
| 64 | + return num * num; |
| 65 | + } |
| 66 | + if (newMode == MonoOperatorModes.squareRoot) { |
| 67 | + return Math.sqrt(num); |
| 68 | + } |
| 69 | + if (newMode == MonoOperatorModes.oneDevidedBy) { |
| 70 | + return 1 / num; |
| 71 | + } |
| 72 | + if (newMode == MonoOperatorModes.cos) { |
| 73 | + return Math.cos(num); |
| 74 | + } |
| 75 | + if (newMode == MonoOperatorModes.sin) { |
| 76 | + return Math.sin(num); |
| 77 | + } |
| 78 | + if (newMode == MonoOperatorModes.tan) { |
| 79 | + return Math.tan(num); |
| 80 | + } |
81 | 81 |
|
82 | | - // never reach |
83 | | - throw new Error(); |
84 | | - } |
| 82 | + // never reach |
| 83 | + throw new Error(); |
| 84 | + } |
85 | 85 |
|
86 | 86 | } |
0 commit comments