-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathSubstitutionCypher.java
More file actions
337 lines (295 loc) · 12.6 KB
/
Copy pathSubstitutionCypher.java
File metadata and controls
337 lines (295 loc) · 12.6 KB
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
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
import acm.program.CommandLineProgram;
import java.util.Arrays;
public class SubstitutionCypher extends CommandLineProgram {
public void run() {
testAllPairs();
testGetColumn();
testContainsInSuffix();
testUnique();
testIsValid();
testInvert();
testCreateKey();
testEncodeChar();
testEncodeText();
testDecodeText();
}
public boolean allPairs(char[][] key) {
if (key != null) {
for (int i = 0; i < key.length; i++) {
if (key[i] == null || key[i].length != 2) {
return false;
}
}
} else {
return false;
}
return true;
}
public void testAllPairs() {
printlnInfo("BEGIN allPairs");
assertEquals("allPairs1", false, allPairs(null));
assertEquals("allPairs2", false, allPairs(new char[][]{{'a', 'b'}, null, {'c', 'd'}}));
assertEquals("allPairs3", true, allPairs(new char[][]{}));
assertEquals("allPairs4", false, allPairs(new char[][]{{}}));
assertEquals("allPairs5", true, allPairs(new char[][]{{'a', 'b'}}));
assertEquals("allPairs6", false, allPairs(new char[][]{{'a', 'b'}, {'a'}}));
printlnInfo("END allPairs");
printBar();
}
public char[] getColumn(char[][] key, int column) {
if (key.length == 0) {
return new char[]{};
}
char[] keyColumn = new char[key.length];
for (int i = 0; i < keyColumn.length; i++) {
keyColumn[i] = key[i][column];
}
return keyColumn;
}
public void testGetColumn() {
printlnInfo("BEGIN getColumns");
assertEquals("getColumns1", new char[]{}, getColumn(new char[][]{}, 0));
assertEquals("getColumns2", new char[]{}, getColumn(new char[][]{}, 1));
assertEquals("getColumns3", new char[]{'a'}, getColumn(new char[][]{{'a', 'b'}}, 0));
assertEquals("getColumns4", new char[]{'b'}, getColumn(new char[][]{{'a', 'b'}}, 1));
assertEquals("getColumns5", new char[]{'a', 'c'}, getColumn(new char[][]{{'a', 'b'}, {'c', 'd'}}, 0));
assertEquals("getColumns6", new char[]{'b', 'd'}, getColumn(new char[][]{{'a', 'b'}, {'c', 'd'}}, 1));
printlnInfo("END getColumns");
printBar();
}
public boolean containsInSuffix(char[] chars, int initialPos, char c) {
if (chars.length > initialPos) {
for (int i = initialPos; i < chars.length; i++) {
if (c == chars[i]) {
return true;
}
}
}
return false;
}
public void testContainsInSuffix() {
printlnInfo("BEGIN containsInSuffix");
assertEquals("containsInSuffix1", false, containsInSuffix(new char[]{}, 12, 'a'));
assertEquals("containsInSuffix2", false, containsInSuffix(new char[]{'a'}, 2, 'a'));
assertEquals("containsInSuffix3", false, containsInSuffix(new char[]{'a', 'b'}, 1, 'a'));
assertEquals("containsInSuffix4", true, containsInSuffix(new char[]{'a', 'b'}, 1, 'b'));
printlnInfo("END containsInSuffix");
printBar();
}
public boolean unique(char[] chars) {
for (int i = 0; i < chars.length; i++) {
if (containsInSuffix(chars, i + 1, chars[i])) {
return false;
}
}
return true;
}
public void testUnique() {
printlnInfo("BEGIN unique");
assertEquals("unique1", true, unique("".toCharArray()));
assertEquals("unique2", true, unique("a".toCharArray()));
assertEquals("unique3", false, unique("aa".toCharArray()));
assertEquals("unique4", true, unique("abcdef".toCharArray()));
assertEquals("unique5", false, unique("abcad".toCharArray()));
printlnInfo("END unique");
printBar();
}
public boolean isValid(char[][] key) {
if (!allPairs(key)) {
return false;
} else if (key.length > 0) {
for (int j = 0; j < key[0].length; j++) {
char[] column = new char[key[0].length];
for (int i = 0; i < key.length; i++) {
column[i] = key[i][j];
if (!unique(column)) {
return false;
}
}
}
}
return true;
}
public void testIsValid() {
printlnInfo("BEGIN isValid");
assertEquals("isValid1", false, isValid(null));
assertEquals("isValid2", true, isValid(new char[][]{}));
assertEquals("isValid3", false, isValid(new char[][]{null}));
assertEquals("isValid4", true, isValid(new char[][]{{'a', 'b'}}));
assertEquals("isValid5", false, isValid(new char[][]{{'a'}}));
assertEquals("isValid6", false, isValid(new char[][]{{'a', 'b'}, {'a', 'c'}}));
assertEquals("isValid7", false, isValid(new char[][]{{'a', 'b'}, {'c', 'b'}}));
assertEquals("isValid8", true, isValid(new char[][]{{'a', 'b'}, {'c', 'd'}}));
//assertEquals("isValid9", false, isValid(new char[][]{{'a', 'b'}, {'c', 'd'},{'f'}}));
//assertEquals("isValid10", false, isValid(new char[][]{{'a', 'b'}, {},{'c', 'd'},{'f'}}));
printlnInfo("END isValid");
printBar();
}
public char[][] invert(char[][] key) {
if (key.length == 0) {
return new char[0][0];
}
char[][] keyInverted = new char[key.length][key[0].length];
for (int i = 0; i < key.length; i++) {
keyInverted[i][1] = key[i][0];
keyInverted[i][0] = key[i][1];
}
return keyInverted;
}
public void testInvert() {
printlnInfo("BEGIN invert");
assertEquals("invert1", new char[][]{}, invert(new char[][]{}));
assertEquals("invert2", new char[][]{{'b', 'a'}}, invert(new char[][]{{'a', 'b'}}));
assertEquals("invert3", new char[][]{{'b', 'a'}, {'d', 'c'}}, invert(new char[][]{{'a', 'b'}, {'c', 'd'}}));
printlnInfo("END invert");
printBar();
}
public char[][] createKey(String left, String right) {
int numberOfPairs = minStrLength(left, right);
if (numberOfPairs != 0) {
char[][] keyCreated = new char[numberOfPairs][2];
for (int i = 0; i < numberOfPairs; i++) {
keyCreated[i][0] = left.charAt(i);
keyCreated[i][1] = right.charAt(i);
}
return keyCreated;
} else {
return new char[0][0];
}
}
public int minStrLength(String str1, String str2) {
int min;
if (str1.length() < str2.length()) {
min = str1.length();
} else {
min = str2.length();
}
return min;
}
public void testCreateKey() {
printlnInfo("BEGIN createKey");
assertEquals("createKey1", new char[][]{}, createKey("", "anything"));
assertEquals("createKey2", new char[][]{}, createKey("anything", ""));
assertEquals("createKey3", new char[][]{{'a', 'b'}}, createKey("a", "bc"));
assertEquals("createKey4", new char[][]{{'a', 'c'}}, createKey("ab", "c"));
assertEquals("createKey5", new char[][]{{'a', 'c'}, {'b', 'd'}}, createKey("ab", "cd"));
//assertEquals("createKey6", new char[][]{{'a', 'c'}, {'b', 'd'},{'c','c'}}, createKey("abcd", "cdc"));
printlnInfo("END createKey");
printBar();
}
public int encodeChar(char[][] key, char c) {
if (key.length != 0) {
for (int i = 0; i < key.length; i++) {
if (c == key[i][0]) {
return key[i][1];
}
}
}
return -1;
}
public void testEncodeChar() {
printlnInfo("BEGIN encodeChar");
assertEquals("encodeChar1", -1, encodeChar(new char[][]{}, 'a'));
assertEquals("encodeChar2", 'b', encodeChar(new char[][]{{'a', 'b'}}, 'a'));
assertEquals("encodeChar3", 'd', encodeChar(new char[][]{{'a', 'b'}, {'c', 'd'}}, 'c'));
printlnInfo("END encodeChar");
printBar();
}
public String encodeText(char[][] key, String clearText) {
char[] encodedText = new char[clearText.length()];
for (int i = 0; i < clearText.length(); i++) {
if (encodeChar(key, clearText.charAt(i)) != -1) {
encodedText[i] = (char) encodeChar(key, clearText.charAt(i));
} else {
return null;
}
}
return new String(encodedText);
}
public void testEncodeText() {
printlnInfo("BEGIN encodeText");
assertEquals("encodeText1", "", encodeText(new char[][]{}, ""));
assertEquals("encodeText2", null, encodeText(new char[][]{{'a', 'b'}}, "aca"));
assertEquals("encodeText3", "bddb", encodeText(new char[][]{{'a', 'b'}, {'c', 'd'}}, "acca"));
printlnInfo("END encodeText");
printBar();
}
public String decodeText(char[][] key, String encodedText) {
return encodeText(invert(key), encodedText);
}
public void testDecodeText() {
printlnInfo("BEGIN decodeText");
assertEquals("decodeText1", "", decodeText(new char[][]{}, ""));
assertEquals("decodeText2", "acca", decodeText(new char[][]{{'a', 'b'}, {'c', 'd'}}, "bddb"));
//assertEquals("decodeText3", "accacx", decodeText(new char[][]{{'a', 'b'}, {'c', 'd'},{'x','c'}}, "bddbdc"));
printlnInfo("END decodeText");
printBar();
}
// Assert functions
public void assertEquals(String message, boolean expected, boolean computed) {
if (expected == computed) {
printlnOk(message);
} else {
printlnError(message + " Expected " + expected + " but found " + computed);
}
}
public void assertEquals(String message, char[] expected, char[] computed) {
if (Arrays.equals(expected, computed)) {
printlnOk(message);
} else {
printlnError(message + " Expected " + Arrays.toString(expected) + " but found " + Arrays.toString(computed));
}
}
public void assertEquals(String message, int expected, int computed) {
if (expected == computed) {
printlnOk(message);
} else {
printlnError(message + " Expected " + expected + " but found " + computed);
}
}
public void assertEquals(String message, char[][] expected, char[][] computed) {
if (expected.length != computed.length) {
printlnError(message + " Expected has length " + expected.length + " but computed has " + computed.length);
return;
}
for (int i = 0; i < computed.length; i += 1) {
char[] er = expected[i];
char[] cr = computed[i];
if (!Arrays.equals(er, cr)) {
printlnError("\tRow " + i + " of expected is " + Arrays.toString(er) + " in computed is " + Arrays.toString(cr));
return;
}
}
printlnOk(message);
}
public void assertEquals(String message, String expected, String computed) {
if (expected == null ? computed == null : expected.equals(computed)) {
printlnOk(message);
} else {
printlnError(message + " Expected " + expected + " but found " + computed);
}
}
// Colorize output for CommandLineProgram
private static final String ANSI_RESET = "\u001B[0m";
private static final String ANSI_RED = "\u001B[31m";
private static final String ANSI_GREEN = "\u001B[32m";
private static final String ANSI_BLUE = "\u001B[34m";
public void printlnInfo(String message) {
if (acm.program.CommandLineProgram.class.isInstance(this)) println(ANSI_BLUE + message + ANSI_RESET);
else println(message);
}
public void printlnOk(String message) {
if (acm.program.CommandLineProgram.class.isInstance(this)) println(ANSI_GREEN + "OK: " + message + ANSI_RESET);
else println("OK: " + message);
}
public void printlnError(String message) {
if (acm.program.CommandLineProgram.class.isInstance(this)) println(ANSI_RED + "ERROR: " + message + ANSI_RESET);
else println("ERROR: " + message);
}
public void printBar() {
println("--------------------------------------------------");
}
public static void main(String[] args) {
new SubstitutionCypher().start(args);
}
}