Calculator/ModPrimaryOperators.java at master · joeyhuaa/Calculator · GitHub

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
public class ModPrimaryOperators {
	String[] newNumArray, newOpArray;
	int loop = 1;

	public void modify(String[] nArray, String[] oArray )
	{
		String operator = "";
		double x = 0, y = 0;
		for(int i = 0; i <= oArray.length; i++) {
			if(i == oArray.length) {
				if(loop == 1) {
					loop++;
					modify(nArray, oArray);
				}
				else {
					newNumArray = nArray;
					newOpArray = oArray;
					return;
				}
			}
			else {
			    operator = oArray[i];
			    try {
			    	x = Double.parseDouble(nArray[i]);
			    }
			    catch(NumberFormatException e) {
			    	if(loop == 1) {
						loop++;
						modify(nArray, oArray);
					}
					else {
						newNumArray = nArray;
						newOpArray = oArray;
						return;
					}
			    }
			    try {
			    	y = Double.parseDouble(nArray[i+1]);
			    }
			    catch(NumberFormatException e) {
			    	if(loop == 1) {
						loop++;
						modify(nArray, oArray);
					}
					else {
						newNumArray = nArray;
						newOpArray = oArray;
						return;
					}
			    }
			}
			switch(operator) {
				case "*":
					nArray[i] = Double.toString(x * y);
					for (int p = i; p < oArray.length; p++) {
						if(p == oArray.length - 1) {
							oArray[p] = "n";
							break;
						}
						else if(p == oArray.length - 2) {
						    oArray[p] = oArray[p + 1];
						    oArray[p + 1] = "n";
						    break;
					    }
					    else {
						    oArray[p] = oArray[p + 1];
						    oArray[p + 1] = oArray[p + 2];
					    }
				    }
				    for (int a = i; a < nArray.length - 1; a++) {
					    if(a == nArray.length - 2) {
						    nArray[a + 1] = "n";
					        break;
					    }
					    else {
						    nArray[a + 1] = nArray[a + 2];
					    }
				    }
		            break;
				case "/":
					nArray[i] = Double.toString(x / y);
					for (int p = i; p < oArray.length; p++) {
						if(p == oArray.length - 1) {
							oArray[p] = "n";
						    break;
					    }
					    else if(p == oArray.length - 2) {
						    oArray[p] = oArray[p + 1];
						    oArray[p + 1] = "n";
						    break;
					    }
					    else {
						    oArray[p] = oArray[p + 1];
						    oArray[p + 1] = oArray[p + 2];
					    }
				    }
				    for (int a = i; a < nArray.length - 1; a++) {
					    if(a == nArray.length - 2) {
						    nArray[a + 1] = "n";
					        break;
					    }
					    else {
					  	    nArray[a + 1] = nArray[a + 2];
					    }
				    }
		            break;
				case "n":
					break;
				default:
					break;
			}
		}
	}
}