-
Notifications
You must be signed in to change notification settings - Fork 0
/
Service.java
211 lines (195 loc) · 5.23 KB
/
Service.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
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
import java.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
public class Service {
public Service() {
}
public double getRandomDecimal(int min, int max) {
if (min >= max) {
throw new IllegalArgumentException("max must be greater than min");
}
return (Math.random() * ((max - min) + 1 + (min - max) - (max - min)));
}
public int[][] readFile(String name, int[] size) {
int[][] intArray = new int[size[0]][size[1]];
String[] stringArray = new String[size[1]];
String strLine = "";
try {
BufferedReader br = new BufferedReader(new FileReader(name));
int count = 0;
while (strLine != null) {
strLine = br.readLine();
if (strLine == null)
break;
stringArray = strLine.split(",");
for (int i = 0; i < stringArray.length; i++)
intArray[count][i] = Integer.valueOf(stringArray[i]);
count++;
}
br.close();
} catch (IOException e) {
e.printStackTrace();
}
return intArray;
}
public int[] get2DArraySize(String name) {
int[] result = new int[2];
String strLine = "";
try {
BufferedReader br = new BufferedReader(new FileReader(name));
int count = 0;
while (strLine != null) {
strLine = br.readLine();
if (strLine == null)
break;
result[1] = strLine.split(",").length;
count++;
}
result[0] = count;
br.close();
} catch (IOException e) {
e.printStackTrace();
}
return result;
}
public int[][] split2Columns(int[][] data) {
int row = data.length;
int column = data[0].length - 1;
int[][] result = new int[row][column];
for (int i = 0; i < row; i++) {
for (int j = 0; j < column; j++) {
result[i][j] = data[i][j];
}
}
return result;
}
public int[] split1Column(int index, int[][] data) {
int row = data.length;
int column = data[0].length;
int[] result = new int[row];
int count = 0;
for (int i = 0; i < row; i++) {
for (int j = 0; j < column; j++) {
if (j == index) {
result[count] = data[i][j];
count++;
}
}
}
return result;
}
// public int[] splitColumnInt(int index, int[][] data) {
// int row = data.length;
// int column = data[0].length;
// int[] result = new int[row];
// int count = 0;
// for (int i = 0; i < row; i++) {
// for (int j = 0; j < column; j++) {
// if (j == index) {
// result[count] = data[i][j];
// count++;
// }
// }
// }
// return result;
// }
// public boolean[][] mergeColumnBoolean(boolean[] data1, boolean[] data2) {
// int total = data1.length;
// boolean[][] result = new boolean[total][2];
// for (int i = 0; i < total; i++) {
// result[i][0] = data1[i];
// result[i][1] = data2[i];
// }
// return result;
// }
public boolean intToBoolean(int data) {
boolean result;
if (data == 0) {
result = false;
} else {
result = true;
}
return result;
}
public int booleanToInt(boolean data) {
int result;
if (data == false) {
result = 0;
} else {
result = 1;
}
return result;
}
public boolean[][] intArrayToBooleanArray(int[][] data) {
int row = data.length;
int column = data[0].length;
boolean[][] result = new boolean[row][column];
for (int i = 0; i < row; i++) {
for (int j = 0; j < column; j++) {
result[i][j] = intToBoolean(data[i][j]);
}
}
return result;
}
public int[][] booleanArrayToIntArray(boolean[][] data) {
int row = data.length;
int column = data[0].length;
int[][] result = new int[row][column];
for (int i = 0; i < row; i++) {
for (int j = 0; j < column; j++) {
result[i][j] = booleanToInt(data[i][j]);
}
}
return result;
}
public int[] targetAnd(boolean[][] data) {
if (data[0].length > 2) {
throw new IllegalArgumentException("maximum of column total is 2");
}
int size = data.length;
boolean[] temp = new boolean[size];
for (int i = 0; i < size; i++) {
temp[i] = data[i][0] && data[i][1];
}
int[] result = new int[size];
for (int i = 0; i < size; i++) {
result[i] = booleanToInt(temp[i]);
}
return result;
}
public int[] targetOr(boolean[][] data) {
if (data[0].length > 2) {
throw new IllegalArgumentException("maximum of column total is 2");
}
int size = data.length;
boolean[] temp = new boolean[size];
for (int i = 0; i < size; i++) {
temp[i] = data[i][0] || data[i][1];
}
int[] result = new int[size];
for (int i = 0; i < size; i++) {
result[i] = booleanToInt(temp[i]);
}
return result;
}
public int[][] updateLabelRuspini(int[][] data) {
int row = data.length;
int column = data[0].length;
int[][] result = new int[row][column];
for (int i = 0; i < row; i++) {
for (int j = 0; j < column; j++) {
int position = column - 1;
if (j == position) {
if (data[i][position] == 1 || data[i][position] == 3) {
result[i][j] = 0;
} else {
result[i][j] = 1;
}
} else {
result[i][j] = data[i][j];
}
}
}
return result;
}
}